Home
last modified time | relevance | path

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

12345678910>>...60

/dragonfly/crypto/libressl/crypto/asn1/
H A Dtasn_new.c106 switch (it->itype) { in asn1_item_ex_new()
108 ef = it->funcs; in asn1_item_ex_new()
160 for (i = 0, tt = it->templates; i < it->tcount; tt++, i++) { in asn1_item_ex_new()
189 ef = it->funcs; in asn1_item_clear()
197 if (it->templates) in asn1_item_clear()
272 if (it != NULL && it->funcs != NULL) { in ASN1_primitive_new()
280 if (!it || (it->itype == ASN1_ITYPE_MSTRING)) in ASN1_primitive_new()
283 utype = it->utype; in ASN1_primitive_new()
308 if (it != NULL && it->itype == ASN1_ITYPE_MSTRING && in ASN1_primitive_new()
324 if (it != NULL && it->funcs != NULL) { in asn1_primitive_clear()
[all …]
H A Dtasn_fre.c74 asn1_item_free(&val, it); in ASN1_item_free()
80 asn1_item_free(pval, it); in ASN1_item_ex_free()
101 switch (it->itype) { in asn1_item_free()
103 if (it->templates) in asn1_item_free()
122 tt = it->templates + i; in asn1_item_free()
133 ef = it->funcs; in asn1_item_free()
153 tt = it->templates + it->tcount - 1; in asn1_item_free()
192 if (it != NULL && it->funcs != NULL) { in ASN1_primitive_free()
200 if (!it) { in ASN1_primitive_free()
211 utype = it->utype; in ASN1_primitive_free()
[all …]
H A Dtasn_dec.c284 if (it->funcs != NULL) in asn1_c2i_primitive()
391 if (it->utype != V_ASN1_ANY || it->funcs != NULL) in asn1_c2i_any()
423 if (it->funcs != NULL) { in asn1_c2i()
455 const ASN1_ITEM *it) in asn1_d2i_primitive_content() argument
611 int utype = it->utype; in asn1_d2i_primitive()
624 tag_number = it->utype; in asn1_d2i_primitive()
704 if (i == it->tcount) { in asn1_item_d2i_choice()
728 it->sname); in asn1_item_d2i_choice()
904 it->sname); in asn1_item_d2i_sequence()
952 switch (it->itype) { in asn1_item_d2i()
[all …]
H A Dtasn_enc.c78 const ASN1_ITEM *it);
148 switch (it->itype) { in ASN1_item_ex_i2d()
151 if (it->templates) in ASN1_item_ex_i2d()
185 chtt = it->templates + i; in ASN1_item_ex_i2d()
197 ef = it->funcs; in ASN1_item_ex_i2d()
226 for (i = 0, tt = it->templates; i < it->tcount; tt++, i++) { in ASN1_item_ex_i2d()
243 for (i = 0, tt = it->templates; i < it->tcount; tt++, i++) { in ASN1_item_ex_i2d()
502 utype = it->utype; in asn1_i2d_ex_primitive()
561 const ASN1_ITEM *it) in asn1_ex_i2c() argument
571 if (it->funcs != NULL) { in asn1_ex_i2c()
[all …]
H A Dx_long.c78 const ASN1_ITEM *it);
128 long_new(ASN1_VALUE **pval, const ASN1_ITEM *it) in long_new() argument
130 long_clear(pval, it); in long_new()
136 long_free(ASN1_VALUE **pval, const ASN1_ITEM *it) in long_free() argument
138 long_clear(pval, it); in long_free()
142 long_clear(ASN1_VALUE **pval, const ASN1_ITEM *it) in long_clear() argument
145 long_set(pval, it->size); in long_clear()
150 const ASN1_ITEM *it) in long_i2c() argument
163 if (val == it->size) in long_i2c()
182 char *free_content, const ASN1_ITEM *it) in long_c2i() argument
[all …]
H A Dtasn_utl.c82 int *sel = offset2ptr(*pval, it->utype); in asn1_get_choice_selector()
94 sel = offset2ptr(*pval, it->utype); in asn1_set_choice_selector()
112 if ((it->itype != ASN1_ITYPE_SEQUENCE) && in asn1_do_lock()
113 (it->itype != ASN1_ITYPE_NDEF_SEQUENCE)) in asn1_do_lock()
115 aux = it->funcs; in asn1_do_lock()
130 const ASN1_AUX *aux = it->funcs; in asn1_get_enc_ptr()
146 if ((aenc = asn1_get_enc_ptr(pval, it)) == NULL) in asn1_enc_init()
168 if ((aenc = asn1_get_enc_ptr(pval, it)) == NULL) in asn1_enc_cleanup()
181 if ((aenc = asn1_get_enc_ptr(pval, it)) == NULL) in asn1_enc_save()
202 const ASN1_ITEM *it) in asn1_enc_restore() argument
[all …]
H A Dtasn_prn.c190 sname = it->sname; in ASN1_item_print()
202 const ASN1_AUX *aux = it->funcs; in asn1_item_print_ctx()
227 switch (it->itype) { in asn1_item_print_ctx()
229 if (it->templates) { in asn1_item_print_ctx()
231 it->templates, pctx)) in asn1_item_print_ctx()
246 ef = it->funcs; in asn1_item_print_ctx()
269 tt = it->templates + i; in asn1_item_print_ctx()
299 for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) { in asn1_item_print_ctx()
505 if (it != NULL && it->funcs != NULL) { in asn1_primitive_print()
517 utype = it->utype; in asn1_primitive_print()
[all …]
/dragonfly/libexec/dma/
H A Dspool.c143 it->queueid, in writequeuef()
144 it->sender, in writequeuef()
145 it->addr); in writequeuef()
150 if (fflush(it->queuef) != 0 || fsync(fileno(it->queuef)) != 0) in writequeuef()
231 return (it); in readqueuef()
255 if (stat(it->queuefn, &st) == 0 || stat(it->mailfn, &st) == 0) in linkspool()
267 it->addr, it->queueid); in linkspool()
326 if (it == NULL) in load_queue()
355 free(it); in delqueue()
373 it->mailf = fopen(it->mailfn, "r"); in acquirespool()
[all …]
H A Ddma.c186 it = calloc(1, sizeof(*it)); in add_recp()
187 if (it == NULL) in add_recp()
204 free(it); in add_recp()
215 it->remote = 0; in add_recp()
240 free(it->addr); in add_recp()
241 free(it); in add_recp()
300 return (it); in go_background()
329 if (it->remote) in deliver()
337 delqueue(it); in deliver()
386 deliver(it); in run_queue()
[all …]
H A Daliases_parse.y89 struct stritem *it; variable
93 it = calloc(1, sizeof(*it));
94 if (it == NULL)
96 it->str = $1;
97 $$ = it;
101 struct stritem *it; variable
105 it = calloc(1, sizeof(*it));
106 if (it == NULL)
108 it->str = $1;
109 SLIST_NEXT(it, next) = $3;
[all …]
/dragonfly/contrib/gcc-4.7/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Derase_fn_imps.hpp151 ++it) in clear_imp()
172 if (it == end()) in erase()
173 return it; in erase()
187 erase(iterator it) in erase() argument
192 return it; in erase()
210 return it; in erase()
229 return it; in erase()
256 it = erase(it); in erase_if()
259 ++it; in erase_if()
304 ++it; in update_min_max_for_erased_leaf()
[all …]
H A Ddebug_fn_imps.hpp71 for (const_iterator it = begin(); it != end(); ++it) in assert_iterators() local
74 debug_base::check_key_exists(PB_DS_V2F(*it), __file, __line); in assert_iterators()
75 PB_DS_DEBUG_VERIFY(lower_bound(PB_DS_V2F(*it)) == it); in assert_iterators()
76 PB_DS_DEBUG_VERIFY(--upper_bound(PB_DS_V2F(*it)) == it); in assert_iterators()
87 for (const_reverse_iterator it = rbegin(); it != rend(); ++it) in assert_reverse_iterators() local
91 const_cast<PB_DS_CLASS_C_DEC*>(this)->find_imp(PB_DS_V2F(*it)); in assert_reverse_iterators()
92 PB_DS_DEBUG_VERIFY(p_nd == it.m_p_nd); in assert_reverse_iterators()
108 for (typename inode::const_iterator it = static_cast<inode_const_pointer>(p_nd)->begin(); in recursive_count_leafs() local
109 it != static_cast<inode_const_pointer>(p_nd)->end(); in recursive_count_leafs()
110 ++it) in recursive_count_leafs()
[all …]
/dragonfly/contrib/gcc-8.0/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Derase_fn_imps.hpp151 ++it) in clear_imp()
172 if (it == end()) in erase()
173 return it; in erase()
187 erase(iterator it) in erase() argument
192 return it; in erase()
210 return it; in erase()
229 return it; in erase()
256 it = erase(it); in erase_if()
259 ++it; in erase_if()
304 ++it; in update_min_max_for_erased_leaf()
[all …]
H A Ddebug_fn_imps.hpp71 for (const_iterator it = begin(); it != end(); ++it) in assert_iterators() local
74 debug_base::check_key_exists(PB_DS_V2F(*it), __file, __line); in assert_iterators()
75 PB_DS_DEBUG_VERIFY(lower_bound(PB_DS_V2F(*it)) == it); in assert_iterators()
76 PB_DS_DEBUG_VERIFY(--upper_bound(PB_DS_V2F(*it)) == it); in assert_iterators()
87 for (const_reverse_iterator it = rbegin(); it != rend(); ++it) in assert_reverse_iterators() local
91 const_cast<PB_DS_CLASS_C_DEC*>(this)->find_imp(PB_DS_V2F(*it)); in assert_reverse_iterators()
92 PB_DS_DEBUG_VERIFY(p_nd == it.m_p_nd); in assert_reverse_iterators()
108 for (typename inode::const_iterator it = static_cast<inode_const_pointer>(p_nd)->begin(); in recursive_count_leafs() local
109 it != static_cast<inode_const_pointer>(p_nd)->end(); in recursive_count_leafs()
110 ++it) in recursive_count_leafs()
[all …]
/dragonfly/contrib/gcc-8.0/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/
H A Derase_fn_imps.hpp49 erase(it); in erase()
56 erase(iterator it) in erase() argument
60 return it; in erase()
61 iterator ret_it = it; in erase()
63 erase_node(it.m_p_nd); in erase()
71 erase(reverse_iterator it) in erase() argument
75 return (it); in erase()
78 erase_node(it.m_p_nd); in erase()
94 if (pred(*it)) in erase_if()
97 it = erase(it); in erase_if()
[all …]
/dragonfly/contrib/gcc-4.7/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/
H A Derase_fn_imps.hpp49 erase(it); in erase()
56 erase(iterator it) in erase() argument
60 return it; in erase()
61 iterator ret_it = it; in erase()
63 erase_node(it.m_p_nd); in erase()
71 erase(reverse_iterator it) in erase() argument
75 return (it); in erase()
78 erase_node(it.m_p_nd); in erase()
94 if (pred(*it)) in erase_if()
97 it = erase(it); in erase_if()
[all …]
/dragonfly/contrib/gcc-8.0/libstdc++-v3/include/ext/pb_ds/detail/
H A Ddebug_map_base.hpp263 for (iterator_type it = m_keys.begin(); it != m_keys.end(); ++it) in find() local
264 if (m_eq(*it, r_key)) in find()
265 return it; in find()
279 return it; in find()
280 ++it; in find()
282 return it; in find()
317 it = m_keys.erase(it); in split()
320 ++it; in split()
331 insert_new(*it); in join()
333 it = other.m_keys.erase(it); in join()
[all …]
/dragonfly/contrib/gcc-4.7/libstdc++-v3/include/ext/pb_ds/detail/
H A Ddebug_map_base.hpp264 for (iterator_type it = m_keys.begin(); it != m_keys.end(); ++it) in find() local
265 if (m_eq(*it, r_key)) in find()
266 return it; in find()
280 return it; in find()
281 ++it; in find()
283 return it; in find()
318 it = m_keys.erase(it); in split()
321 ++it; in split()
332 insert_new(*it); in join()
334 it = other.m_keys.erase(it); in join()
[all …]
/dragonfly/contrib/gcc-4.7/libstdc++-v3/include/ext/pb_ds/detail/tree_policy/
H A Dorder_statistics_imp.hpp46 node_iterator it = node_begin(); in find_by_order() local
49 while (it != end_it) in find_by_order()
51 node_iterator l_it = it.get_l_child(); in find_by_order()
55 return *it; in find_by_order()
57 it = l_it; in find_by_order()
61 it = it.get_r_child(); in find_by_order()
79 node_const_iterator it = node_begin(); in order_of_key() local
84 while (it != end_it) in order_of_key()
89 it = l_it; in order_of_key()
93 it = it.get_r_child(); in order_of_key()
[all …]
/dragonfly/contrib/gcc-8.0/libstdc++-v3/include/ext/pb_ds/detail/tree_policy/
H A Dorder_statistics_imp.hpp46 node_iterator it = node_begin(); in find_by_order() local
49 while (it != end_it) in find_by_order()
51 node_iterator l_it = it.get_l_child(); in find_by_order()
55 return *it; in find_by_order()
57 it = l_it; in find_by_order()
61 it = it.get_r_child(); in find_by_order()
79 node_const_iterator it = node_begin(); in order_of_key() local
84 while (it != end_it) in order_of_key()
89 it = l_it; in order_of_key()
93 it = it.get_r_child(); in order_of_key()
[all …]
/dragonfly/sys/dev/drm/amd/amdgpu/
H A Damdgpu_mn.c101 struct interval_tree_node it; member
267 while (it) { in amdgpu_mn_invalidate_range_start_gfx()
275 node = container_of(it, struct amdgpu_mn_node, it); in amdgpu_mn_invalidate_range_start_gfx()
276 it = interval_tree_iter_next(it, start, end); in amdgpu_mn_invalidate_range_start_gfx()
312 while (it) { in amdgpu_mn_invalidate_range_start_hsa()
321 node = container_of(it, struct amdgpu_mn_node, it); in amdgpu_mn_invalidate_range_start_hsa()
322 it = interval_tree_iter_next(it, start, end); in amdgpu_mn_invalidate_range_start_hsa()
470 node = container_of(it, struct amdgpu_mn_node, it); in amdgpu_mn_register()
473 end = max(it->last, end); in amdgpu_mn_register()
484 node->it.start = addr; in amdgpu_mn_register()
[all …]
/dragonfly/sys/bus/firewire/
H A Dfwdev.c236 struct fw_xferq *it = d->it; in fw_close() local
248 d->it = NULL; in fw_close()
363 it = ((struct fw_drv1 *)dev->si_drv1)->it; in fw_write()
364 if (it == NULL || it->buf == NULL) in fw_write()
368 it->stproc = STAILQ_FIRST(&it->stfree); in fw_write()
389 it->stproc->poffset + it->queued); in fw_write()
394 if (it->queued >= it->bnpacket) { in fw_write()
396 STAILQ_INSERT_TAIL(&it->stvalid, it->stproc, link); in fw_write()
444 it = d->it; in fw_ioctl()
450 it = fc->it[i]; in fw_ioctl()
[all …]
/dragonfly/sys/dev/drm/radeon/
H A Dradeon_mn.c57 struct interval_tree_node it; member
79 it.rb) { in radeon_mn_destroy()
127 struct interval_tree_node *it; in radeon_mn_invalidate_range_start() local
135 while (it) { in radeon_mn_invalidate_range_start()
140 node = container_of(it, struct radeon_mn_node, it); in radeon_mn_invalidate_range_start()
141 it = interval_tree_iter_next(it, start, end); in radeon_mn_invalidate_range_start()
258 node = container_of(it, struct radeon_mn_node, it); in radeon_mn_register()
260 addr = min(it->start, addr); in radeon_mn_register()
261 end = max(it->last, end); in radeon_mn_register()
276 node->it.start = addr; in radeon_mn_register()
[all …]
/dragonfly/contrib/gcc-4.7/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/
H A Derase_fn_imps.hpp49 erase(it); in erase()
56 erase(iterator it) in erase() argument
60 return it; in erase()
62 iterator ret_it = it; in erase()
64 erase_node(it.m_p_nd); in erase()
72 erase(reverse_iterator it) in erase() argument
76 return it; in erase()
80 erase_node(it.m_p_nd); in erase()
96 if (pred(*it)) in erase_if()
99 it = erase(it); in erase_if()
[all …]
/dragonfly/contrib/gcc-8.0/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/
H A Derase_fn_imps.hpp49 erase(it); in erase()
56 erase(iterator it) in erase() argument
60 return it; in erase()
62 iterator ret_it = it; in erase()
64 erase_node(it.m_p_nd); in erase()
72 erase(reverse_iterator it) in erase() argument
76 return it; in erase()
80 erase_node(it.m_p_nd); in erase()
96 if (pred(*it)) in erase_if()
99 it = erase(it); in erase_if()
[all …]

12345678910>>...60