Home
last modified time | relevance | path

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

123

/openbsd-src/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()
98 uint8_t* name, size_t len, int labs, uint16_t dclass) in name_tree_insert() argument
104 node->dclass = dclass; in name_tree_insert()
159 if(!prev || prev->dclass != node->dclass) { in name_tree_init_parents()
180 size_t len, int labs, uint16_t dclass) in name_tree_find() argument
187 key.dclass = dclass; in name_tree_find()
192 size_t len, int labs, uint16_t dclass) in name_tree_lookup() argument
201 key.dclass = dclass; in name_tree_lookup()
209 if(!result || result->dclass != dclass) in name_tree_lookup()
[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-src/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()
98 uint8_t* name, size_t len, int labs, uint16_t dclass) in name_tree_insert() argument
104 node->dclass = dclass; in name_tree_insert()
159 if(!prev || prev->dclass != node->dclass) { in name_tree_init_parents()
180 size_t len, int labs, uint16_t dclass) in name_tree_find() argument
187 key.dclass = dclass; in name_tree_find()
192 size_t len, int labs, uint16_t dclass) in name_tree_lookup() argument
201 key.dclass = dclass; in name_tree_lookup()
209 if(!result || result->dclass != dclass) in name_tree_lookup()
[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-src/gnu/usr.bin/perl/cpan/Test-Harness/lib/TAP/Parser/
H A DIteratorFactory.pm72 my ( $class, $dclass ) = @_;
74 confess("$dclass must implement can_handle & make_iterator methods!")
75 unless UNIVERSAL::can( $dclass, 'can_handle' )
76 && UNIVERSAL::can( $dclass, 'make_iterator' );
79 push @{$handlers}, $dclass
80 unless grep { $_ eq $dclass } @{$handlers};
165 for my $dclass ( "TAP::Parser::SourceHandler::$handler", $handler ) {
166 return $dclass
167 if UNIVERSAL::can( $dclass, 'can_handle' )
168 && UNIVERSAL::can( $dclass, 'make_iterato
[all...]
/openbsd-src/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()
121 node->dclass = c; in forwards_insert_data()
158 if(!prev || prev->dclass != node->dclass) { in fwd_init_parents()
303 key.dclass = c; in fwd_add_stub_hole()
306 return forwards_insert_data(fwd, key.dclass, key.name, in fwd_add_stub_hole()
369 key.dclass = qclass; in forwards_find()
390 key.dclass = qclass; in forwards_lookup()
402 if(!result || result->dclass != qclass) { in forwards_lookup()
430 next_root_locked(struct iter_forwards* fwd, uint16_t* dclass) in next_root_locked() argument
[all …]
/openbsd-src/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()
121 node->dclass = c; in forwards_insert_data()
158 if(!prev || prev->dclass != node->dclass) { in fwd_init_parents()
303 key.dclass = c; in fwd_add_stub_hole()
306 return forwards_insert_data(fwd, key.dclass, key.name, in fwd_add_stub_hole()
369 key.dclass = qclass; in forwards_find()
390 key.dclass = qclass; in forwards_lookup()
402 if(!result || result->dclass != qclass) { in forwards_lookup()
430 next_root_locked(struct iter_forwards* fwd, uint16_t* dclass) in next_root_locked() argument
[all …]
/openbsd-src/usr.sbin/unbound/util/data/
H A Dmsgparse.c83 uint16_t type, uint16_t dclass, hashvalue_type hash, in new_rrset() argument
101 p->rrset_class = dclass; in new_rrset()
173 uint16_t dclass, uint32_t rrset_flags) in pkt_hash_rrset() argument
180 h = hashlittle(&dclass, sizeof(dclass), h); /* netw order */ in pkt_hash_rrset()
199 pkt_hash_rrset_rest(hashvalue_type dname_h, uint16_t type, uint16_t dclass, in pkt_hash_rrset_rest() argument
206 h = hashlittle(&dclass, sizeof(dclass), h); /* netw order */ in pkt_hash_rrset_rest()
215 uint16_t type, uint16_t dclass) in rrset_parse_equals() argument
218 p->rrset_class == dclass in rrset_parse_equals()
228 msgparse_hashtable_lookup(struct msg_parse * msg,sldns_buffer * pkt,hashvalue_type h,uint32_t rrset_flags,uint8_t * dname,size_t dnamelen,uint16_t type,uint16_t dclass) msgparse_hashtable_lookup() argument
467 find_rrset(struct msg_parse * msg,sldns_buffer * pkt,uint8_t * dname,size_t dnamelen,uint16_t type,uint16_t dclass,hashvalue_type * hash,uint32_t * rrset_flags,uint8_t ** prev_dname_first,uint8_t ** prev_dname_last,size_t * prev_dnamelen,uint16_t * prev_type,uint16_t * prev_dclass,struct rrset_parse ** rrset_prev,sldns_pkt_section section,struct regional * region) find_rrset() argument
834 uint16_t dclass, prev_dclass = 0; parse_section() local
[all...]
/openbsd-src/sbin/unwind/libunbound/util/data/
H A Dmsgparse.c83 uint16_t type, uint16_t dclass, hashvalue_type hash, in new_rrset() argument
101 p->rrset_class = dclass; in new_rrset()
173 uint16_t dclass, uint32_t rrset_flags) in pkt_hash_rrset() argument
180 h = hashlittle(&dclass, sizeof(dclass), h); /* netw order */ in pkt_hash_rrset()
199 pkt_hash_rrset_rest(hashvalue_type dname_h, uint16_t type, uint16_t dclass, in pkt_hash_rrset_rest() argument
206 h = hashlittle(&dclass, sizeof(dclass), h); /* netw order */ in pkt_hash_rrset_rest()
215 uint16_t type, uint16_t dclass) in rrset_parse_equals() argument
218 p->rrset_class == dclass in rrset_parse_equals()
228 msgparse_hashtable_lookup(struct msg_parse * msg,sldns_buffer * pkt,hashvalue_type h,uint32_t rrset_flags,uint8_t * dname,size_t dnamelen,uint16_t type,uint16_t dclass) msgparse_hashtable_lookup() argument
467 find_rrset(struct msg_parse * msg,sldns_buffer * pkt,uint8_t * dname,size_t dnamelen,uint16_t type,uint16_t dclass,hashvalue_type * hash,uint32_t * rrset_flags,uint8_t ** prev_dname_first,uint8_t ** prev_dname_last,size_t * prev_dnamelen,uint16_t * prev_type,uint16_t * prev_dclass,struct rrset_parse ** rrset_prev,sldns_pkt_section section,struct regional * region) find_rrset() argument
834 uint16_t dclass, prev_dclass = 0; parse_section() local
[all...]
/openbsd-src/gnu/usr.bin/binutils/gdb/
H A Dgdbtypes.c139 static void virtual_base_list_aux (struct type *dclass);
1842 is_ancestor (struct type *base, struct type *dclass) in is_ancestor() argument
1847 CHECK_TYPEDEF (dclass); in is_ancestor()
1849 if (base == dclass) in is_ancestor()
1851 if (TYPE_NAME (base) && TYPE_NAME (dclass) && in is_ancestor()
1852 !strcmp (TYPE_NAME (base), TYPE_NAME (dclass))) in is_ancestor()
1855 for (i = 0; i < TYPE_N_BASECLASSES (dclass); i++) in is_ancestor()
1856 if (is_ancestor (base, TYPE_BASECLASS (dclass, i))) in is_ancestor()
1869 has_vtable (struct type *dclass) in has_vtable() argument
1876 if (TYPE_CODE (dclass) != TYPE_CODE_CLASS) in has_vtable()
[all …]
/openbsd-src/usr.sbin/unbound/services/
H A Dlocalzone.h138 * uses 'dclass' to not conflict with c++ keyword class. */
139 uint16_t dclass; member
142 * For the node, parent, name, namelen, namelabs, dclass, you
259 * @param dclass: class to lookup.
268 uint8_t* name, size_t len, int labs, uint16_t dclass, uint16_t dtype,
278 * @param dclass: class to lookup.
284 uint8_t* name, size_t len, int labs, uint16_t dclass, uint16_t dtype);
374 * @param dclass: class to lookup.
378 uint8_t* name, size_t len, int labs, uint16_t dclass);
387 * @param dclass
[all...]
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.c81 log_nametypeclass(NO_VERBOSE, buf, z->name, 0, z->dclass); in local_zone_print()
150 if(a->dclass != b->dclass) { in local_zone_cmp()
151 if(a->dclass < b->dclass) in local_zone_cmp()
185 enum localzone_type t, uint16_t dclass) in local_zone_create() argument
192 z->dclass = dclass; in local_zone_create()
247 uint16_t dclass) in lz_enter_zone() argument
263 if(!(z=lz_enter_zone_dname(zones, nm, len, labs, t, dclass))) { in lz_enter_zone()
272 rrstr_get_rr_content(const char * str,uint8_t ** nm,uint16_t * type,uint16_t * dclass,time_t * ttl,uint8_t * rr,size_t len,uint8_t ** rdata,size_t * rdata_len) rrstr_get_rr_content() argument
299 get_rr_nameclass(const char * str,uint8_t ** nm,uint16_t * dclass,uint16_t * dtype) get_rr_nameclass() argument
1033 uint16_t dclass = 0; lz_setup_implicit() local
1221 local_zones_lookup(struct local_zones * zones,uint8_t * name,size_t len,int labs,uint16_t dclass,uint16_t dtype) local_zones_lookup() argument
1229 local_zones_tags_lookup(struct local_zones * zones,uint8_t * name,size_t len,int labs,uint16_t dclass,uint16_t dtype,uint8_t * taglist,size_t taglen,int ignoretags) local_zones_tags_lookup() argument
1267 local_zones_find(struct local_zones * zones,uint8_t * name,size_t len,int labs,uint16_t dclass) local_zones_find() argument
1281 local_zones_find_le(struct local_zones * zones,uint8_t * name,size_t len,int labs,uint16_t dclass,int * exact) local_zones_find_le() argument
2028 local_zones_add_zone(struct local_zones * zones,uint8_t * name,size_t len,int labs,uint16_t dclass,enum localzone_type tp) local_zones_add_zone() argument
2158 local_zones_del_data(struct local_zones * zones,uint8_t * name,size_t len,int labs,uint16_t dclass) local_zones_del_data() argument
[all...]
/openbsd-src/sbin/unwind/libunbound/services/
H A Dlocalzone.h138 * uses 'dclass' to not conflict with c++ keyword class. */
139 uint16_t dclass; member
142 * For the node, parent, name, namelen, namelabs, dclass, you
259 * @param dclass: class to lookup.
268 uint8_t* name, size_t len, int labs, uint16_t dclass, uint16_t dtype,
278 * @param dclass: class to lookup.
284 uint8_t* name, size_t len, int labs, uint16_t dclass, uint16_t dtype);
374 * @param dclass: class to lookup.
378 uint8_t* name, size_t len, int labs, uint16_t dclass);
387 * @param dclass
[all...]
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.c81 log_nametypeclass(NO_VERBOSE, buf, z->name, 0, z->dclass); in local_zone_print()
150 if(a->dclass != b->dclass) { in local_zone_cmp()
151 if(a->dclass < b->dclass) in local_zone_cmp()
185 enum localzone_type t, uint16_t dclass) in local_zone_create() argument
192 z->dclass = dclass; in local_zone_create()
247 uint16_t dclass) in lz_enter_zone() argument
263 if(!(z=lz_enter_zone_dname(zones, nm, len, labs, t, dclass))) { in lz_enter_zone()
272 rrstr_get_rr_content(const char * str,uint8_t ** nm,uint16_t * type,uint16_t * dclass,time_t * ttl,uint8_t * rr,size_t len,uint8_t ** rdata,size_t * rdata_len) rrstr_get_rr_content() argument
299 get_rr_nameclass(const char * str,uint8_t ** nm,uint16_t * dclass,uint16_t * dtype) get_rr_nameclass() argument
1033 uint16_t dclass = 0; lz_setup_implicit() local
1221 local_zones_lookup(struct local_zones * zones,uint8_t * name,size_t len,int labs,uint16_t dclass,uint16_t dtype) local_zones_lookup() argument
1229 local_zones_tags_lookup(struct local_zones * zones,uint8_t * name,size_t len,int labs,uint16_t dclass,uint16_t dtype,uint8_t * taglist,size_t taglen,int ignoretags) local_zones_tags_lookup() argument
1267 local_zones_find(struct local_zones * zones,uint8_t * name,size_t len,int labs,uint16_t dclass) local_zones_find() argument
1281 local_zones_find_le(struct local_zones * zones,uint8_t * name,size_t len,int labs,uint16_t dclass,int * exact) local_zones_find_le() argument
2028 local_zones_add_zone(struct local_zones * zones,uint8_t * name,size_t len,int labs,uint16_t dclass,enum localzone_type tp) local_zones_add_zone() argument
2158 local_zones_del_data(struct local_zones * zones,uint8_t * name,size_t len,int labs,uint16_t dclass) local_zones_del_data() argument
[all...]
/openbsd-src/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()
281 uint8_t* nm, size_t len, uint16_t dclass) in neg_find_zone() argument
289 lookfor.dclass = dclass; in neg_find_zone()
380 key.dclass = qclass; in neg_closest_zone_parent()
388 if(!result || result->dclass != qclass) in neg_closest_zone_parent()
450 uint8_t* nm, size_t nm_len, int labs, uint16_t dclass) in neg_setup_zone_node() argument
465 zone->dclass = dclass; in neg_setup_zone_node()
483 uint8_t* nm, size_t nm_len, int labs, uint16_t dclass, in neg_zone_chain() argument
494 zone = neg_setup_zone_node(nm, nm_len, i, dclass); in neg_zone_chain()
[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()
222 size_t namelen, uint16_t dclass, int lockit) in anchor_new_ta() argument
240 ta->dclass = dclass; in anchor_new_ta()
305 uint16_t dclass, uint8_t* rdata, size_t rdata_len) in anchor_store_new_key() argument
317 ta = anchor_find(anchors, name, namelabs, namelen, dclass); in anchor_store_new_key()
319 ta = anchor_new_ta(anchors, name, namelabs, namelen, dclass, 1); in anchor_store_new_key()
[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-src/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()
281 uint8_t* nm, size_t len, uint16_t dclass) in neg_find_zone() argument
289 lookfor.dclass = dclass; in neg_find_zone()
380 key.dclass = qclass; in neg_closest_zone_parent()
388 if(!result || result->dclass != qclass) in neg_closest_zone_parent()
450 uint8_t* nm, size_t nm_len, int labs, uint16_t dclass) in neg_setup_zone_node() argument
465 zone->dclass = dclass; in neg_setup_zone_node()
483 uint8_t* nm, size_t nm_len, int labs, uint16_t dclass, in neg_zone_chain() argument
494 zone = neg_setup_zone_node(nm, nm_len, i, dclass); in neg_zone_chain()
[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()
222 size_t namelen, uint16_t dclass, int lockit) in anchor_new_ta() argument
240 ta->dclass = dclass; in anchor_new_ta()
305 uint16_t dclass, uint8_t* rdata, size_t rdata_len) in anchor_store_new_key() argument
317 ta = anchor_find(anchors, name, namelabs, namelen, dclass); in anchor_store_new_key()
319 ta = anchor_new_ta(anchors, name, namelabs, namelen, dclass, 1); in anchor_store_new_key()
[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-src/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