Home
last modified time | relevance | path

Searched refs:it (Results 1 – 25 of 3236) sorted by relevance

12345678910>>...130

/NextBSD/usr.bin/migcom/
HDtype.c195 register ipc_type_t *it, **last; in itLookUp() local
197 for (it = *(last = &list); it != itNULL; it = *(last = &it->itNext)) in itLookUp()
198 if (streql(name, it->itName)) in itLookUp()
201 *last = it->itNext; in itLookUp()
202 it->itNext = list; in itLookUp()
203 list = it; in itLookUp()
205 return it; in itLookUp()
216 itInsert(identifier_t name, ipc_type_t *it) in itInsert() argument
218 it->itName = name; in itInsert()
219 it->itNext = list; in itInsert()
[all …]
HDroutine.c221 register ipc_type_t *it = arg->argType; in rtPrintArg() local
285 printf("\t%s: %s", arg->argName, it->itName); in rtPrintArg()
342 ipc_type_t *it = arg->argType; in rtCheckSimple() local
344 if (IS_KERN_PROC_DATA(it)) in rtCheckSimple()
362 register ipc_type_t *it = arg->argType; in rtCheckFit() local
364 machine_alignment(size, it->itMinTypeSize); in rtCheckFit()
365 if (it->itNative) in rtCheckFit()
367 else if (IS_VARIABLE_SIZED_UNTYPED(it)) { in rtCheckFit()
368 machine_alignment(size, it->itTypeSize); in rtCheckFit()
369 size += it->itPadSize; in rtCheckFit()
[all …]
HDserver.c242 register ipc_type_t *it = arg->argType; in WriteKPD_Iterator() local
246 fprintf(file, "\t register\t%s\t*ptr;\n", it->itKPDType); in WriteKPD_Iterator()
267 fprintf(file, "\t j = min(%d, ", it->itKPD_Number); in WriteKPD_Iterator()
276 fprintf(file, "\t for (i = 0; i < %d; ptr++, i++) %s\n", it->itKPD_Number, in WriteKPD_Iterator()
765 register ipc_type_t *it = ret->argType; local
768 fprintf(file, "\t%s %s;\n", it->itTransType, ret->argVarName);
775 register ipc_type_t *it = arg->argType; in WriteLocalVarDecl() local
776 register ipc_type_t *btype = it->itElement; in WriteLocalVarDecl()
778 if (IS_VARIABLE_SIZED_UNTYPED(it)) in WriteLocalVarDecl()
779 …fprintf(file, "\t%s %s[%d]", btype->itTransType, arg->argVarName, btype->itNumber ? it->itNumber/b… in WriteLocalVarDecl()
[all …]
HDutils.c411 FetchUserType(ipc_type_t *it) in FetchUserType() argument
413 return it->itUserType; in FetchUserType()
417 FetchServerType(ipc_type_t *it) in FetchServerType() argument
419 return it->itServerType; in FetchServerType()
423 FetchKPDType(ipc_type_t *it) in FetchKPDType() argument
425 return it->itKPDType; in FetchKPDType()
440 register ipc_type_t *it = arg->argType; in WriteFieldDeclPrim() local
442 if (IS_VARIABLE_SIZED_UNTYPED(it) || it->itNoOptArray) { in WriteFieldDeclPrim()
444 register ipc_type_t *btype = it->itElement; in WriteFieldDeclPrim()
456 if (it->itString) in WriteFieldDeclPrim()
[all …]
/NextBSD/crypto/openssl/crypto/asn1/
HDtasn_new.c67 static int asn1_item_ex_combine_new(ASN1_VALUE **pval, const ASN1_ITEM *it,
69 static void asn1_item_clear(ASN1_VALUE **pval, const ASN1_ITEM *it);
71 static void asn1_primitive_clear(ASN1_VALUE **pval, const ASN1_ITEM *it);
73 ASN1_VALUE *ASN1_item_new(const ASN1_ITEM *it) in ASN1_item_new() argument
76 if (ASN1_item_ex_new(&ret, it) > 0) in ASN1_item_new()
83 int ASN1_item_ex_new(ASN1_VALUE **pval, const ASN1_ITEM *it) in ASN1_item_ex_new() argument
85 return asn1_item_ex_combine_new(pval, it, 0); in ASN1_item_ex_new()
88 static int asn1_item_ex_combine_new(ASN1_VALUE **pval, const ASN1_ITEM *it, in asn1_item_ex_combine_new() argument
94 const ASN1_AUX *aux = it->funcs; in asn1_item_ex_combine_new()
104 if (it->sname) in asn1_item_ex_combine_new()
[all …]
HDtasn_fre.c65 static void asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it,
70 void ASN1_item_free(ASN1_VALUE *val, const ASN1_ITEM *it) in ASN1_item_free() argument
72 asn1_item_combine_free(&val, it, 0); in ASN1_item_free()
75 void ASN1_item_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it) in ASN1_item_ex_free() argument
77 asn1_item_combine_free(pval, it, 0); in ASN1_item_ex_free()
80 static void asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it, in asn1_item_combine_free() argument
86 const ASN1_AUX *aux = it->funcs; in asn1_item_combine_free()
91 if ((it->itype != ASN1_ITYPE_PRIMITIVE) && !*pval) in asn1_item_combine_free()
98 switch (it->itype) { in asn1_item_combine_free()
101 if (it->templates) in asn1_item_combine_free()
[all …]
HDtasn_enc.c68 const ASN1_ITEM *it, int tag, int aclass);
75 const ASN1_ITEM *it, int flags);
83 const ASN1_ITEM *it) in ASN1_item_ndef_i2d() argument
85 return asn1_item_flags_i2d(val, out, it, ASN1_TFLG_NDEF); in ASN1_item_ndef_i2d()
88 int ASN1_item_i2d(ASN1_VALUE *val, unsigned char **out, const ASN1_ITEM *it) in ASN1_item_i2d() argument
90 return asn1_item_flags_i2d(val, out, it, 0); in ASN1_item_i2d()
101 const ASN1_ITEM *it, int flags) in asn1_item_flags_i2d() argument
106 len = ASN1_item_ex_i2d(&val, NULL, it, -1, flags); in asn1_item_flags_i2d()
113 ASN1_item_ex_i2d(&val, &p, it, -1, flags); in asn1_item_flags_i2d()
118 return ASN1_item_ex_i2d(&val, out, it, -1, flags); in asn1_item_flags_i2d()
[all …]
HDtasn_utl.c76 int asn1_get_choice_selector(ASN1_VALUE **pval, const ASN1_ITEM *it) in asn1_get_choice_selector() argument
78 int *sel = offset2ptr(*pval, it->utype); in asn1_get_choice_selector()
87 const ASN1_ITEM *it) in asn1_set_choice_selector() argument
90 sel = offset2ptr(*pval, it->utype); in asn1_set_choice_selector()
103 int asn1_do_lock(ASN1_VALUE **pval, int op, const ASN1_ITEM *it) in asn1_do_lock() argument
107 if ((it->itype != ASN1_ITYPE_SEQUENCE) in asn1_do_lock()
108 && (it->itype != ASN1_ITYPE_NDEF_SEQUENCE)) in asn1_do_lock()
110 aux = it->funcs; in asn1_do_lock()
120 fprintf(stderr, "%s: Reference Count: %d\n", it->sname, *lck); in asn1_do_lock()
124 fprintf(stderr, "%s, bad reference count\n", it->sname); in asn1_do_lock()
[all …]
/NextBSD/contrib/llvm/lib/Support/
HDDAGDeltaAlgorithm.cpp128 for (changeset_ty::const_iterator it = S.begin(), in ExecuteOneTest()
129 ie = S.end(); it != ie; ++it) in ExecuteOneTest()
130 for (succ_iterator_ty it2 = succ_begin(*it), in ExecuteOneTest()
131 ie2 = succ_end(*it); it2 != ie2; ++it2) in ExecuteOneTest()
184 for (changeset_ty::const_iterator it = Changes.begin(), in DAGDeltaAlgorithmImpl() local
185 ie = Changes.end(); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
186 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
187 Successors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
189 for (std::vector<edge_ty>::const_iterator it = Dependencies.begin(), in DAGDeltaAlgorithmImpl() local
190 ie = Dependencies.end(); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
[all …]
HDDeltaAlgorithm.cpp34 for (changeset_ty::const_iterator it = S.begin(), in Split() local
35 ie = S.end(); it != ie; ++it, ++idx) in Split()
36 ((idx < N) ? LHS : RHS).insert(*it); in Split()
60 for (changesetlist_ty::const_iterator it = Sets.begin(), in Delta() local
61 ie = Sets.end(); it != ie; ++it) in Delta()
62 Split(*it, SplitSets); in Delta()
73 for (changesetlist_ty::const_iterator it = Sets.begin(), in Search() local
74 ie = Sets.end(); it != ie; ++it) { in Search()
76 if (GetTestResult(*it)) { in Search()
78 Split(*it, Sets); in Search()
[all …]
/NextBSD/contrib/llvm/lib/Option/
HDArgList.cpp48 for (const_reverse_iterator it = rbegin(), ie = rend(); it != ie; ++it) in getLastArgNoClaim() local
49 if ((*it)->getOption().matches(Id)) in getLastArgNoClaim()
50 return *it; in getLastArgNoClaim()
56 for (const_reverse_iterator it = rbegin(), ie = rend(); it != ie; ++it) in getLastArgNoClaim() local
57 if ((*it)->getOption().matches(Id0) || in getLastArgNoClaim()
58 (*it)->getOption().matches(Id1)) in getLastArgNoClaim()
59 return *it; in getLastArgNoClaim()
66 for (const_reverse_iterator it = rbegin(), ie = rend(); it != ie; ++it) in getLastArgNoClaim() local
67 if ((*it)->getOption().matches(Id0) || (*it)->getOption().matches(Id1) || in getLastArgNoClaim()
68 (*it)->getOption().matches(Id2)) in getLastArgNoClaim()
[all …]
/NextBSD/contrib/dma/
HDspool.c122 writequeuef(struct qitem *it) in writequeuef() argument
127 queuefd = open_locked(it->queuefn, O_CREAT|O_EXCL|O_RDWR, 0660); in writequeuef()
132 it->queuef = fdopen(queuefd, "w+"); in writequeuef()
133 if (it->queuef == NULL) in writequeuef()
136 error = fprintf(it->queuef, in writequeuef()
140 it->queueid, in writequeuef()
141 it->sender, in writequeuef()
142 it->addr); in writequeuef()
147 if (fflush(it->queuef) != 0 || fsync(fileno(it->queuef)) != 0) in writequeuef()
161 struct qitem *it = NULL; in readqueuef() local
[all …]
HDdma.c178 struct qitem *it, *tit; in add_recp() local
183 it = calloc(1, sizeof(*it)); in add_recp()
184 if (it == NULL) in add_recp()
186 it->addr = strdup(str); in add_recp()
187 if (it->addr == NULL) in add_recp()
190 it->sender = queue->sender; in add_recp()
191 host = strrchr(it->addr, '@'); in add_recp()
199 if (strcmp(tit->addr, it->addr) == 0) { in add_recp()
200 free(it->addr); in add_recp()
201 free(it); in add_recp()
[all …]
HDaliases_parse.y85 struct stritem *it; variable
89 it = calloc(1, sizeof(*it));
90 if (it == NULL)
92 it->str = $1;
93 $$ = it;
97 struct stritem *it; variable
101 it = calloc(1, sizeof(*it));
102 if (it == NULL)
104 it->str = $1;
105 SLIST_NEXT(it, next) = $3;
[all …]
/NextBSD/contrib/gdb/gdb/doc/
HDrefcard.tex13 %This program is free software; you can redistribute it and/or modify
14 %it under the terms of the GNU General Public License as published by
18 %This program is distributed in the hope that it will be useful, but
46 % All other values will be computed at process time so it should be
214 \font\it=cmti7
247 gdb {\it program} \opt{{\it core}}&debug {\it program} \opt{using
248 coredump {\it core}}\cr
249 b \opt{\it file\tt:}{\it function}&set breakpoint at {\it function} \opt{in \it file}\cr
250 run \opt{{\it arglist}}&start your program \opt{with {\it arglist}}\cr
252 p {\it expr}&display the value of an expression\cr
[all …]
/NextBSD/contrib/netbsd-tests/lib/libc/sys/
HDt_getitimer.c62 struct itimerval it; in ATF_TC_BODY() local
69 (void)memset(&it, 0, sizeof(struct itimerval)); in ATF_TC_BODY()
71 ATF_REQUIRE(getitimer(ITIMER_REAL, &it) == 0); in ATF_TC_BODY()
73 if (it.it_value.tv_sec != 0 || it.it_value.tv_usec != 0) in ATF_TC_BODY()
76 ATF_REQUIRE(getitimer(ITIMER_VIRTUAL, &it) == 0); in ATF_TC_BODY()
78 if (it.it_value.tv_sec != 0 || it.it_value.tv_usec != 0) in ATF_TC_BODY()
81 ATF_REQUIRE(getitimer(ITIMER_PROF, &it) == 0); in ATF_TC_BODY()
83 if (it.it_value.tv_sec != 0 || it.it_value.tv_usec != 0) in ATF_TC_BODY()
100 struct itimerval it; in ATF_TC_BODY() local
103 ATF_REQUIRE_ERRNO(EINVAL, getitimer(-1, &it) == -1); in ATF_TC_BODY()
[all …]
/NextBSD/sys/kern/
HDkern_time.c103 void itimer_fire(struct itimer *it);
1029 struct itimer *it; in itimer_init() local
1031 it = (struct itimer *)mem; in itimer_init()
1032 mtx_init(&it->it_mtx, "itimer lock", NULL, MTX_DEF); in itimer_init()
1039 struct itimer *it; in itimer_fini() local
1041 it = (struct itimer *)mem; in itimer_fini()
1042 mtx_destroy(&it->it_mtx); in itimer_fini()
1046 itimer_enter(struct itimer *it) in itimer_enter() argument
1049 mtx_assert(&it->it_mtx, MA_OWNED); in itimer_enter()
1050 it->it_usecount++; in itimer_enter()
[all …]
/NextBSD/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/
Derase_fn_imps.hpp156 for (typename internal_node::iterator it = in clear_imp() local
158 it != static_cast<internal_node_pointer>(p_nd)->end(); in clear_imp()
159 ++it) in clear_imp()
161 node_pointer p_child =* it; in clear_imp()
176 erase(const_iterator it) in erase() argument
180 if (it == end()) in erase()
181 return it; in erase()
183 const_iterator ret_it = it; in erase()
185 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == pat_trie_leaf_node_type); in erase()
186 erase_leaf(static_cast<leaf_pointer>(it.m_p_nd)); in erase()
[all …]
Ddebug_fn_imps.hpp77 for (const_iterator it = begin(); it != end(); ++it) in assert_iterators() local
80 map_debug_base::check_key_exists(PB_DS_V2F(*it)); in assert_iterators()
81 _GLIBCXX_DEBUG_ASSERT(lower_bound(PB_DS_V2F(*it)) == it); in assert_iterators()
82 _GLIBCXX_DEBUG_ASSERT(--upper_bound(PB_DS_V2F(*it)) == it); in assert_iterators()
93 for (const_reverse_iterator it = rbegin(); it != rend(); ++it) in assert_reverse_iterators() local
97 const_cast<PB_DS_CLASS_C_DEC* >(this)->find_imp(PB_DS_V2F(*it)); in assert_reverse_iterators()
98 _GLIBCXX_DEBUG_ASSERT(p_nd == it.m_p_nd); in assert_reverse_iterators()
114 for (typename internal_node::const_iterator it = in recursive_count_leafs() local
116 it != static_cast<const_internal_node_pointer>(p_nd)->end(); in recursive_count_leafs()
117 ++it) in recursive_count_leafs()
[all …]
/NextBSD/contrib/llvm/tools/lldb/tools/lldb-mi/
HDMICmdArgSet.cpp55 SetCmdArgs_t::iterator it = m_setCmdArgs.begin(); in Destroy() local
56 while (it != m_setCmdArgs.end()) in Destroy()
58 CMICmdArgValBase *pArg(*it); in Destroy()
62 ++it; in Destroy()
172 SetCmdArgs_t::const_iterator it = m_setCmdArgs.begin(); in Validate() local
173 while (it != m_setCmdArgs.end()) in Validate()
175 const CMICmdArgValBase *pArg(*it); in Validate()
197 ++it; in Validate()
230 SetCmdArgs_t::const_iterator it = m_setCmdArgsThatAreMissing.begin(); in ValidationFormErrorMessages() local
231 while (it != m_setCmdArgsThatAreMissing.end()) in ValidationFormErrorMessages()
[all …]
/NextBSD/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/
Derase_fn_imps.hpp52 point_iterator it = find(r_key); in erase() local
53 if (it == base_type::end()) in erase()
55 erase(it); in erase()
62 erase(iterator it) in erase() argument
65 if (it == base_type::end()) in erase()
66 return it; in erase()
67 iterator ret_it = it; in erase()
69 erase_node(it.m_p_nd); in erase()
77 erase(reverse_iterator it) in erase() argument
80 if (it.m_p_nd == base_type::m_p_head) in erase()
[all …]
/NextBSD/contrib/llvm/tools/clang/lib/Frontend/
HDTextDiagnosticBuffer.cpp50 for (const_iterator it = err_begin(), ie = err_end(); it != ie; ++it) in FlushDiagnostics() local
52 << it->second; in FlushDiagnostics()
53 for (const_iterator it = warn_begin(), ie = warn_end(); it != ie; ++it) in FlushDiagnostics() local
55 << it->second; in FlushDiagnostics()
56 for (const_iterator it = remark_begin(), ie = remark_end(); it != ie; ++it) in FlushDiagnostics() local
58 << it->second; in FlushDiagnostics()
59 for (const_iterator it = note_begin(), ie = note_end(); it != ie; ++it) in FlushDiagnostics() local
61 << it->second; in FlushDiagnostics()
/NextBSD/contrib/libstdc++/include/ext/pb_ds/detail/
Dmap_debug_base.hpp182 key_set_iterator it = find(r_key); in erase_existing()
183 if (it == m_key_set.end()) in erase_existing()
188 m_key_set.erase(it); in erase_existing()
262 for (iterator_type it = m_key_set.begin(); it != m_key_set.end(); ++it) in find() local
263 if (m_eq(*it, r_key)) in find()
264 return it; in find()
274 key_set_iterator it = m_key_set.begin(); in find()
275 while (it != m_key_set.end()) in find()
277 if (m_eq(*it, r_key)) in find()
278 return it; in find()
[all …]
/NextBSD/contrib/libstdc++/include/ext/pb_ds/detail/tree_policy/
Dorder_statistics_imp.hpp52 node_iterator it = node_begin(); in find_by_order() local
56 while (it != end_it) in find_by_order()
58 node_iterator l_it = it.get_l_child(); in find_by_order()
65 return (*it); in find_by_order()
67 it = l_it; in find_by_order()
72 it = it.get_r_child(); in find_by_order()
92 const_node_iterator it = node_begin(); in order_of_key() local
101 while (it != end_it) in order_of_key()
103 const_node_iterator l_it = it.get_l_child(); in order_of_key()
105 if (r_cmp_fn(r_key, extract_key(*(*it)))) in order_of_key()
[all …]
/NextBSD/contrib/llvm/tools/clang/lib/Analysis/
HDCocoaConventions.cpp98 StringRef::iterator it = functionName.begin(); in followsCreateRule() local
99 StringRef::iterator start = it; in followsCreateRule()
104 for ( ; it != endI ; ++it) { in followsCreateRule()
106 char ch = *it; in followsCreateRule()
109 if (ch == 'c' && it != start && isLetter(*(it - 1))) in followsCreateRule()
112 ++it; in followsCreateRule()
118 if (it == endI) in followsCreateRule()
123 StringRef suffix = functionName.substr(it - start); in followsCreateRule()
125 it += 5; in followsCreateRule()
128 it += 3; in followsCreateRule()
[all …]

12345678910>>...130