Home
last modified time | relevance | path

Searched refs:dclass (Results 1 – 25 of 68) sorted by relevance

123

/openbsd/usr.sbin/unbound/util/storage/
H A Ddnstree.c52 if(x->dclass != y->dclass) { in name_tree_compare()
53 if(x->dclass < y->dclass) in name_tree_compare()
104 node->dclass = dclass; in name_tree_insert()
187 key.dclass = dclass; in name_tree_find()
201 key.dclass = dclass; in name_tree_lookup()
209 if(!result || result->dclass != dclass) in name_tree_lookup()
280 *dclass = p->dclass; in name_tree_next_root()
284 *dclass = p->dclass + 1; in name_tree_next_root()
294 key.dclass = *dclass; in name_tree_next_root()
308 *dclass = p->dclass; in name_tree_next_root()
[all …]
H A Ddnstree.h67 uint16_t dclass; member
109 uint8_t* name, size_t len, int labs, uint16_t dclass);
128 size_t len, int labs, uint16_t dclass);
140 size_t len, int labs, uint16_t dclass);
148 int name_tree_next_root(rbtree_type* tree, uint16_t* dclass);
/openbsd/sbin/unwind/libunbound/util/storage/
H A Ddnstree.c52 if(x->dclass != y->dclass) { in name_tree_compare()
53 if(x->dclass < y->dclass) in name_tree_compare()
104 node->dclass = dclass; in name_tree_insert()
187 key.dclass = dclass; in name_tree_find()
201 key.dclass = dclass; in name_tree_lookup()
209 if(!result || result->dclass != dclass) in name_tree_lookup()
280 *dclass = p->dclass; in name_tree_next_root()
284 *dclass = p->dclass + 1; in name_tree_next_root()
294 key.dclass = *dclass; in name_tree_next_root()
308 *dclass = p->dclass; in name_tree_next_root()
[all …]
H A Ddnstree.h67 uint16_t dclass; member
109 uint8_t* name, size_t len, int labs, uint16_t dclass);
128 size_t len, int labs, uint16_t dclass);
140 size_t len, int labs, uint16_t dclass);
148 int name_tree_next_root(rbtree_type* tree, uint16_t* dclass);
/openbsd/gnu/usr.bin/perl/cpan/Test-Harness/lib/TAP/Parser/
H A DIteratorFactory.pm72 my ( $class, $dclass ) = @_;
75 unless UNIVERSAL::can( $dclass, 'can_handle' )
76 && UNIVERSAL::can( $dclass, 'make_iterator' );
79 push @{$handlers}, $dclass
80 unless grep { $_ eq $dclass } @{$handlers};
166 return $dclass
167 if UNIVERSAL::can( $dclass, 'can_handle' )
168 && UNIVERSAL::can( $dclass, 'make_iterator' );
170 eval "use $dclass";
176 return $dclass
[all …]
/openbsd/usr.sbin/unbound/iterator/
H A Diter_fwd.c58 if(n1->dclass != n2->dclass) { in fwd_cmp()
59 if(n1->dclass < n2->dclass) in fwd_cmp()
119 node->dclass = c; in forwards_insert_data()
156 if(!prev || prev->dclass != node->dclass) { in fwd_init_parents()
301 key.dclass = c; in fwd_add_stub_hole()
417 *dclass = p->dclass; in forwards_next_root()
421 *dclass = p->dclass + 1; in forwards_next_root()
431 key.dclass = *dclass; in forwards_next_root()
445 *dclass = p->dclass; in forwards_next_root()
449 *dclass = p->dclass+1; in forwards_next_root()
[all …]
/openbsd/sbin/unwind/libunbound/iterator/
H A Diter_fwd.c58 if(n1->dclass != n2->dclass) { in fwd_cmp()
59 if(n1->dclass < n2->dclass) in fwd_cmp()
119 node->dclass = c; in forwards_insert_data()
156 if(!prev || prev->dclass != node->dclass) { in fwd_init_parents()
301 key.dclass = c; in fwd_add_stub_hole()
417 *dclass = p->dclass; in forwards_next_root()
421 *dclass = p->dclass + 1; in forwards_next_root()
431 key.dclass = *dclass; in forwards_next_root()
445 *dclass = p->dclass; in forwards_next_root()
449 *dclass = p->dclass+1; in forwards_next_root()
[all …]
/openbsd/usr.sbin/unbound/util/data/
H A Dmsgparse.c101 p->rrset_class = dclass; in new_rrset()
180 h = hashlittle(&dclass, sizeof(dclass), h); /* netw order */ in pkt_hash_rrset()
206 h = hashlittle(&dclass, sizeof(dclass), h); /* netw order */ in pkt_hash_rrset_rest()
233 type, dclass)) in msgparse_hashtable_lookup()
515 dclass); in find_rrset()
526 dclass); in find_rrset()
535 *prev_dclass = dclass; in find_rrset()
543 dclass, 0); in find_rrset()
546 dclass); in find_rrset()
572 *prev_dclass = dclass; in find_rrset()
[all …]
/openbsd/sbin/unwind/libunbound/util/data/
H A Dmsgparse.c101 p->rrset_class = dclass; in new_rrset()
180 h = hashlittle(&dclass, sizeof(dclass), h); /* netw order */ in pkt_hash_rrset()
206 h = hashlittle(&dclass, sizeof(dclass), h); /* netw order */ in pkt_hash_rrset_rest()
233 type, dclass)) in msgparse_hashtable_lookup()
515 dclass); in find_rrset()
526 dclass); in find_rrset()
535 *prev_dclass = dclass; in find_rrset()
543 dclass, 0); in find_rrset()
546 dclass); in find_rrset()
572 *prev_dclass = dclass; in find_rrset()
[all …]
/openbsd/gnu/usr.bin/binutils/gdb/
H A Dgdbtypes.c1847 CHECK_TYPEDEF (dclass); in is_ancestor()
1849 if (base == dclass) in is_ancestor()
1869 has_vtable (struct type *dclass) in has_vtable() argument
1880 if (TYPE_FIELD_VIRTUAL_BITS (dclass)) in has_vtable()
1886 if (TYPE_FN_FIELDLISTS (dclass)) in has_vtable()
2010 virtual_base_list_aux (dclass); in virtual_base_list()
2044 virtual_base_list_aux (dclass); in virtual_base_list_length()
2062 primary = TYPE_RUNTIME_PTR (dclass) ? TYPE_PRIMARY_BASE (dclass) : NULL; in virtual_base_list_length_skip_primaries()
2068 virtual_base_list_aux (dclass); in virtual_base_list_length_skip_primaries()
2125 primary = TYPE_RUNTIME_PTR (dclass) ? TYPE_PRIMARY_BASE (dclass) : NULL; in virtual_base_index_skip_primaries()
[all …]
/openbsd/usr.sbin/unbound/services/
H A Dlocalzone.h139 uint16_t dclass; member
268 uint8_t* name, size_t len, int labs, uint16_t dclass, uint16_t dtype,
284 uint8_t* name, size_t len, int labs, uint16_t dclass, uint16_t dtype);
378 uint8_t* name, size_t len, int labs, uint16_t dclass);
393 uint8_t* name, size_t len, int labs, uint16_t dclass,
409 uint8_t* name, size_t len, int labs, uint16_t dclass,
440 uint8_t* name, size_t len, int labs, uint16_t dclass);
513 uint16_t* dclass, time_t* ttl, uint8_t* rr, size_t len,
H A Dauthzone.h108 uint16_t dclass; member
225 uint16_t dclass; member
569 uint8_t* name, size_t name_len, uint16_t dclass);
573 size_t nmlen, uint16_t dclass);
577 size_t nmlen, uint16_t dclass);
582 size_t nmlen, uint16_t dclass);
601 uint16_t dclass);
622 uint8_t* nm, size_t nmlen, uint16_t dclass,
634 struct module_env* env, uint8_t* nm, size_t nmlen, uint16_t dclass);
H A Dlocalzone.c150 if(a->dclass != b->dclass) { in local_zone_cmp()
151 if(a->dclass < b->dclass) in local_zone_cmp()
192 z->dclass = dclass; in local_zone_create()
247 uint16_t dclass) in lz_enter_zone() argument
994 if(!prev || prev->dclass != node->dclass) { in init_parents()
1124 n2, 0, dclass); in lz_setup_implicit()
1240 key.dclass = dclass; in local_zones_tags_lookup()
1247 if(!result || result->dclass != dclass) in local_zones_tags_lookup()
1269 key.dclass = dclass; in local_zones_find()
1285 key.dclass = dclass; in local_zones_find_le()
[all …]
/openbsd/sbin/unwind/libunbound/services/
H A Dlocalzone.h139 uint16_t dclass; member
268 uint8_t* name, size_t len, int labs, uint16_t dclass, uint16_t dtype,
284 uint8_t* name, size_t len, int labs, uint16_t dclass, uint16_t dtype);
378 uint8_t* name, size_t len, int labs, uint16_t dclass);
393 uint8_t* name, size_t len, int labs, uint16_t dclass,
409 uint8_t* name, size_t len, int labs, uint16_t dclass,
440 uint8_t* name, size_t len, int labs, uint16_t dclass);
513 uint16_t* dclass, time_t* ttl, uint8_t* rr, size_t len,
H A Dauthzone.h108 uint16_t dclass; member
225 uint16_t dclass; member
569 uint8_t* name, size_t name_len, uint16_t dclass);
573 size_t nmlen, uint16_t dclass);
577 size_t nmlen, uint16_t dclass);
582 size_t nmlen, uint16_t dclass);
601 uint16_t dclass);
622 uint8_t* nm, size_t nmlen, uint16_t dclass,
634 struct module_env* env, uint8_t* nm, size_t nmlen, uint16_t dclass);
H A Dlocalzone.c150 if(a->dclass != b->dclass) { in local_zone_cmp()
151 if(a->dclass < b->dclass) in local_zone_cmp()
192 z->dclass = dclass; in local_zone_create()
247 uint16_t dclass) in lz_enter_zone() argument
994 if(!prev || prev->dclass != node->dclass) { in init_parents()
1124 n2, 0, dclass); in lz_setup_implicit()
1240 key.dclass = dclass; in local_zones_tags_lookup()
1247 if(!result || result->dclass != dclass) in local_zones_tags_lookup()
1269 key.dclass = dclass; in local_zones_find()
1285 key.dclass = dclass; in local_zones_find_le()
[all …]
/openbsd/usr.sbin/unbound/validator/
H A Dval_neg.c78 if(x->dclass != y->dclass) { in val_neg_zone_compare()
79 if(x->dclass < y->dclass) in val_neg_zone_compare()
289 lookfor.dclass = dclass; in neg_find_zone()
380 key.dclass = qclass; in neg_closest_zone_parent()
465 zone->dclass = dclass; in neg_setup_zone_node()
853 uint16_t* dclass) in reply_nsec_signer() argument
974 uint16_t dclass; in val_neg_addreferral() local
987 signer, LDNS_RR_TYPE_NS, dclass); in val_neg_addreferral()
998 dclass))) { in val_neg_addreferral()
1353 uint16_t dclass; in add_soa() local
[all …]
H A Dval_anchor.c66 if(n1->dclass != n2->dclass) { in anchor_cmp()
67 if(n1->dclass < n2->dclass) in anchor_cmp()
164 if(!prev || prev->dclass != node->dclass) { in anchors_init_parents_locked()
198 size_t namelen, uint16_t dclass) in anchor_find() argument
207 key.dclass = dclass; in anchor_find()
240 ta->dclass = dclass; in anchor_new_ta()
874 pkey->rk.rrset_class = htons(ta->dclass); in assemble_it()
1144 key.dclass = qclass; in anchors_lookup()
1194 key.dclass = c; in anchors_add_insecure()
1221 key.dclass = c; in anchors_delete_insecure()
[all …]
H A Dval_kentry.h178 uint8_t* name, size_t namelen, uint16_t dclass, time_t ttl,
196 uint8_t* name, size_t namelen, uint16_t dclass,
214 uint8_t* name, size_t namelen, uint16_t dclass, time_t ttl,
H A Dval_anchor.h120 uint16_t dclass; member
176 uint8_t* name, int namelabs, size_t namelen, uint16_t dclass);
241 size_t namelen, uint16_t dclass, uint16_t keytag);
/openbsd/sbin/unwind/libunbound/validator/
H A Dval_neg.c78 if(x->dclass != y->dclass) { in val_neg_zone_compare()
79 if(x->dclass < y->dclass) in val_neg_zone_compare()
289 lookfor.dclass = dclass; in neg_find_zone()
380 key.dclass = qclass; in neg_closest_zone_parent()
465 zone->dclass = dclass; in neg_setup_zone_node()
853 uint16_t* dclass) in reply_nsec_signer() argument
974 uint16_t dclass; in val_neg_addreferral() local
987 signer, LDNS_RR_TYPE_NS, dclass); in val_neg_addreferral()
998 dclass))) { in val_neg_addreferral()
1353 uint16_t dclass; in add_soa() local
[all …]
H A Dval_anchor.c66 if(n1->dclass != n2->dclass) { in anchor_cmp()
67 if(n1->dclass < n2->dclass) in anchor_cmp()
164 if(!prev || prev->dclass != node->dclass) { in anchors_init_parents_locked()
198 size_t namelen, uint16_t dclass) in anchor_find() argument
207 key.dclass = dclass; in anchor_find()
240 ta->dclass = dclass; in anchor_new_ta()
874 pkey->rk.rrset_class = htons(ta->dclass); in assemble_it()
1144 key.dclass = qclass; in anchors_lookup()
1194 key.dclass = c; in anchors_add_insecure()
1221 key.dclass = c; in anchors_delete_insecure()
[all …]
H A Dval_kentry.h178 uint8_t* name, size_t namelen, uint16_t dclass, time_t ttl,
196 uint8_t* name, size_t namelen, uint16_t dclass,
214 uint8_t* name, size_t namelen, uint16_t dclass, time_t ttl,
H A Dval_anchor.h120 uint16_t dclass; member
176 uint8_t* name, int namelabs, size_t namelen, uint16_t dclass);
241 size_t namelen, uint16_t dclass, uint16_t keytag);
/openbsd/usr.sbin/unbound/testcode/
H A Dpktview.c130 uint16_t type, dclass, len; in analyze_rr() local
134 dclass = sldns_buffer_read_u16(pkt); in analyze_rr()
138 (int)dclass)?sldns_lookup_by_id(sldns_rr_classes, in analyze_rr()
139 (int)dclass)->name:"??", (int)dclass); in analyze_rr()

123