Searched refs:it (Results 1 - 25 of 686) sorted by relevance

1234567891011>>

/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/list_update_map_/
H A Ddebug_fn_imps.hpp6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
24 // file, or you compile this file and link it with other files to
55 for (const_iterator it = begin(); it != end(); ++it)
57 map_debug_base::check_key_exists(PB_DS_V2F(*it));
/freebsd-11-stable/crypto/openssl/crypto/asn1/
H A Dasn1_int.h62 void asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it,
H A Dtasn_new.c68 static int asn1_item_ex_combine_new(ASN1_VALUE **pval, const ASN1_ITEM *it,
70 static void asn1_item_clear(ASN1_VALUE **pval, const ASN1_ITEM *it);
72 static void asn1_primitive_clear(ASN1_VALUE **pval, const ASN1_ITEM *it);
74 ASN1_VALUE *ASN1_item_new(const ASN1_ITEM *it) argument
77 if (ASN1_item_ex_new(&ret, it) > 0)
84 int ASN1_item_ex_new(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
86 return asn1_item_ex_combine_new(pval, it, 0);
89 static int asn1_item_ex_combine_new(ASN1_VALUE **pval, const ASN1_ITEM *it, argument
95 const ASN1_AUX *aux = it->funcs;
105 if (it
224 asn1_item_clear(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
260 const ASN1_ITEM *it = ASN1_ITEM_ptr(tt->item); local
313 ASN1_primitive_new(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
366 asn1_primitive_clear(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
[all...]
H A Dtasn_fre.c68 void ASN1_item_free(ASN1_VALUE *val, const ASN1_ITEM *it) argument
70 asn1_item_combine_free(&val, it, 0);
73 void ASN1_item_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
75 asn1_item_combine_free(pval, it, 0);
78 void asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it, int combine) argument
83 const ASN1_AUX *aux = it->funcs;
88 if ((it->itype != ASN1_ITYPE_PRIMITIVE) && !*pval)
95 switch (it->itype) {
98 if (it->templates)
99 ASN1_template_free(pval, it
192 ASN1_primitive_free(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
[all...]
H A Dx_long.c70 static int long_new(ASN1_VALUE **pval, const ASN1_ITEM *it);
71 static void long_free(ASN1_VALUE **pval, const ASN1_ITEM *it);
74 const ASN1_ITEM *it);
76 int utype, char *free_cont, const ASN1_ITEM *it);
77 static int long_print(BIO *out, ASN1_VALUE **pval, const ASN1_ITEM *it,
98 static int long_new(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
100 *(long *)pval = it->size;
104 static void long_free(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
106 *(long *)pval = it->size;
110 const ASN1_ITEM *it)
109 long_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it) argument
155 long_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it) argument
214 long_print(BIO *out, ASN1_VALUE **pval, const ASN1_ITEM *it, int indent, const ASN1_PCTX *pctx) argument
[all...]
H A Dtasn_utl.c76 int asn1_get_choice_selector(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
78 int *sel = offset2ptr(*pval, it->utype);
87 const ASN1_ITEM *it)
90 sel = offset2ptr(*pval, it->utype);
97 * Do reference counting. The value 'op' decides what to do. if it is +1
103 int asn1_do_lock(ASN1_VALUE **pval, int op, const ASN1_ITEM *it) argument
107 if ((it->itype != ASN1_ITYPE_SEQUENCE)
108 && (it->itype != ASN1_ITYPE_NDEF_SEQUENCE))
110 aux = it->funcs;
120 fprintf(stderr, "%s: Reference Count: %d\n", it
86 asn1_set_choice_selector(ASN1_VALUE **pval, int value, const ASN1_ITEM *it) argument
129 asn1_get_enc_ptr(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
140 asn1_enc_init(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
151 asn1_enc_free(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
164 asn1_enc_save(ASN1_VALUE **pval, const unsigned char *in, int inlen, const ASN1_ITEM *it) argument
184 asn1_enc_restore(int *len, unsigned char **out, ASN1_VALUE **pval, const ASN1_ITEM *it) argument
[all...]
H A Dx_bignum.c67 * as a BIGNUM directly. Currently it ignores the sign which isn't a problem
74 static int bn_new(ASN1_VALUE **pval, const ASN1_ITEM *it);
75 static void bn_free(ASN1_VALUE **pval, const ASN1_ITEM *it);
78 const ASN1_ITEM *it);
80 int utype, char *free_cont, const ASN1_ITEM *it);
81 static int bn_print(BIO *out, ASN1_VALUE **pval, const ASN1_ITEM *it,
102 static int bn_new(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
111 static void bn_free(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
115 if (it->size & BN_SENSITIVE)
123 const ASN1_ITEM *it)
122 bn_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it) argument
143 bn_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it) argument
158 bn_print(BIO *out, ASN1_VALUE **pval, const ASN1_ITEM *it, int indent, const ASN1_PCTX *pctx) argument
[all...]
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/
H A Ddebug_fn_imps.hpp6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
24 // file, or you compile this file and link it with other files to
77 for (const_iterator it = begin(); it != end(); ++it)
80 map_debug_base::check_key_exists(PB_DS_V2F(*it));
81 _GLIBCXX_DEBUG_ASSERT(lower_bound(PB_DS_V2F(*it)) == it);
[all...]
H A Derase_fn_imps.hpp6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
24 // file, or you compile this file and link it with other files to
156 for (typename internal_node::iterator it =
158 it != static_cast<internal_node_pointer>(p_nd)->end();
159 ++it)
161 node_pointer p_child =* it;
176 erase(const_iterator it) argument
180 if (it
195 erase(iterator it) argument
213 erase(const_reverse_iterator it) argument
232 erase(reverse_iterator it) argument
257 iterator it = begin(); local
[all...]
/freebsd-11-stable/cddl/usr.sbin/zfsd/
H A Dcallout.cc78 for (std::list<Callout *>::iterator it(s_activeCallouts.begin());
79 it != s_activeCallouts.end(); it++) {
80 if (*it != this)
83 it = s_activeCallouts.erase(it);
84 if (it != s_activeCallouts.end()) {
91 timeradd(&(*it)->m_interval, &m_interval,
92 &(*it)->m_interval);
115 std::list<Callout *>::iterator it(s_activeCallout
198 std::list<Callout *>::iterator it; local
[all...]
/freebsd-11-stable/contrib/netbsd-tests/lib/libc/sys/
H A Dt_getitimer.c62 struct itimerval it; local
69 (void)memset(&it, 0, sizeof(struct itimerval));
71 ATF_REQUIRE(getitimer(ITIMER_REAL, &it) == 0);
73 if (it.it_value.tv_sec != 0 || it.it_value.tv_usec != 0)
76 ATF_REQUIRE(getitimer(ITIMER_VIRTUAL, &it) == 0);
78 if (it.it_value.tv_sec != 0 || it.it_value.tv_usec != 0)
81 ATF_REQUIRE(getitimer(ITIMER_PROF, &it) == 0);
83 if (it
100 struct itimerval it; local
120 struct itimerval it; local
155 struct itimerval it, ot; local
175 struct itimerval it, ot; local
[all...]
/freebsd-11-stable/contrib/dma/
H A Daliases_parse.y85 struct stritem *it;
89 it = calloc(1, sizeof(*it));
90 if (it == NULL)
92 it->str = $1;
93 $$ = it;
97 struct stritem *it;
101 it = calloc(1, sizeof(*it));
102 if (it
[all...]
H A Dspool.c65 * One data file might be shared by linking it several times.
122 writequeuef(struct qitem *it) argument
127 queuefd = open_locked(it->queuefn, O_CREAT|O_EXCL|O_RDWR, 0660);
132 it->queuef = fdopen(queuefd, "w+");
133 if (it->queuef == NULL)
136 error = fprintf(it->queuef,
140 it->queueid,
141 it->sender,
142 it->addr);
147 if (fflush(it
161 struct qitem *it = NULL; local
235 struct qitem *it; local
282 struct qitem *it; local
344 delqueue(struct qitem *it) argument
356 acquirespool(struct qitem *it) argument
387 struct qitem *it; local
[all...]
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/ov_tree_map_/
H A Dcond_dtor.hpp6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
24 // file, or you compile this file and link it with other files to
60 iterator it = m_a_vec;
61 while (it != m_r_last_it)
63 it->~value_type();
64 ++it;
H A Ddebug_fn_imps.hpp6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
24 // file, or you compile this file and link it with other files to
73 for (const_iterator it = begin(); it != end(); ++it)
76 _GLIBCXX_DEBUG_ONLY(map_debug_base::check_key_exists(PB_DS_V2F(*it));)
77 _GLIBCXX_DEBUG_ASSERT(lower_bound(PB_DS_V2F(*it)) == it);
[all...]
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/tree_policy/
H A Dorder_statistics_imp.hpp6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
24 // file, or you compile this file and link it with other files to
52 node_iterator it = node_begin(); local
56 while (it != end_it)
58 node_iterator l_it = it.get_l_child();
65 return (*it);
67 it = l_it;
72 it
92 const_node_iterator it = node_begin(); local
[all...]
/freebsd-11-stable/contrib/subversion/subversion/libsvn_client/
H A Dlayout.c77 struct layout_item_t *it; local
84 it = lb->stack;
85 lb->stack = it->ancestor;
86 svn_pool_destroy(it->pool);
92 it = apr_pcalloc(item_pool, sizeof(*it));
93 it->pool = item_pool;
94 it->local_abspath = apr_pstrdup(item_pool, local_abspath);
95 it->depth = depth;
96 it
156 struct layout_item_t *it; local
209 struct layout_item_t *it; local
[all...]
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/
H A Dcmp_fn_imps.hpp6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
24 // file, or you compile this file and link it with other files to
64 for (typename Other_Map_Type::const_iterator it = other.begin();
65 it != other.end(); ++it)
67 const_key_reference r_key = const_key_reference(PB_DS_V2F(*it));
77 if (p_mapped_value->second != it->second)
H A Dinfo_fn_imps.hpp6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
24 // file, or you compile this file and link it with other files to
82 for (typename Other_Map_Type::const_iterator it = other.begin();
83 it != other.end(); ++it)
85 const_key_reference r_key =(const_key_reference)PB_DS_V2F(*it);
94 if (p_mapped_value->second != it->second)
/freebsd-11-stable/contrib/openbsm/bin/auditdistd/
H A Dsigtimedwait.h49 struct itimerval it; local
59 timerclear(&it.it_interval);
60 it.it_value.tv_sec = timeout->tv_sec;
61 it.it_value.tv_usec = timeout->tv_nsec / 1000;
62 if (it.it_value.tv_sec == 0 && it.it_value.tv_usec == 0)
63 it.it_value.tv_usec = 1;
64 PJDLOG_VERIFY(setitimer(ITIMER_REAL, &it, NULL) == 0);
72 timerclear(&it.it_interval);
73 timerclear(&it
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp26 // well formed predicates, this doesn't happen, but it commonly occurs in
127 for (changeset_ty::const_iterator it = S.begin(), ie = S.end(); it != ie;
128 ++it)
129 for (succ_iterator_ty it2 = succ_begin(*it), ie2 = succ_end(*it);
183 for (changeset_ty::const_iterator it = Changes.begin(),
184 ie = Changes.end(); it != ie; ++it) {
185 Predecessors.insert(std::make_pair(*it, st
[all...]
H A DDeltaAlgorithm.cpp34 for (changeset_ty::const_iterator it = S.begin(),
35 ie = S.end(); it != ie; ++it, ++idx)
36 ((idx < N) ? LHS : RHS).insert(*it);
60 for (changesetlist_ty::const_iterator it = Sets.begin(),
61 ie = Sets.end(); it != ie; ++it)
62 Split(*it, SplitSets);
73 for (changesetlist_ty::const_iterator it = Sets.begin(),
74 ie = Sets.end(); it !
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/lib/Analysis/
H A DCocoaConventions.cpp104 StringRef::iterator it = functionName.begin(); local
105 StringRef::iterator start = it;
110 for ( ; it != endI ; ++it) {
112 char ch = *it;
115 if (ch == 'c' && it != start && isLetter(*(it - 1)))
118 ++it;
124 if (it == endI)
129 StringRef suffix = functionName.substr(it
[all...]
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/
H A Derase_fn_imps.hpp6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
24 // file, or you compile this file and link it with other files to
52 point_iterator it = find(r_key); local
53 if (it == base_type::end())
55 erase(it);
62 erase(iterator it) argument
65 if (it == base_type::end())
66 return it;
77 erase(reverse_iterator it) argument
97 iterator it = base_type::begin(); local
[all...]
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/
H A Dmap_debug_base.hpp6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
24 // file, or you compile this file and link it with other files to
182 key_set_iterator it = find(r_key); local
183 if (it == m_key_set.end())
188 m_key_set.erase(it);
262 for (iterator_type it = m_key_set.begin(); it != m_key_set.end(); ++it)
274 key_set_iterator it = m_key_set.begin(); local
317 key_set_iterator it = m_key_set.begin(); local
337 key_set_iterator it = other.m_key_set.begin(); local
[all...]

Completed in 120 milliseconds

1234567891011>>