Searched refs:dclass (Results 1 - 25 of 35) sorted by relevance

12

/freebsd-11-stable/contrib/unbound/util/storage/
H A Ddnstree.c52 if(x->dclass != y->dclass) {
53 if(x->dclass < y->dclass)
85 uint8_t* name, size_t len, int labs, uint16_t dclass)
91 node->dclass = dclass;
146 if(!prev || prev->dclass != node->dclass) {
167 size_t len, int labs, uint16_t dclass)
84 name_tree_insert(rbtree_type* tree, struct name_tree_node* node, uint8_t* name, size_t len, int labs, uint16_t dclass) argument
166 name_tree_find(rbtree_type* tree, uint8_t* name, size_t len, int labs, uint16_t dclass) argument
178 name_tree_lookup(rbtree_type* tree, uint8_t* name, size_t len, int labs, uint16_t dclass) argument
255 name_tree_next_root(rbtree_type* tree, uint16_t* dclass) argument
[all...]
H A Ddnstree.h56 /** rbtree node, key is this struct : dclass and name */
67 uint16_t dclass; member in struct:name_tree_node
105 * @param dclass: class of name
109 uint8_t* name, size_t len, int labs, uint16_t dclass);
124 * @param dclass: class of name
128 size_t len, int labs, uint16_t dclass);
136 * @param dclass: class of name
140 size_t len, int labs, uint16_t dclass);
145 * @param dclass: the class to look for next (or higher).
148 int name_tree_next_root(rbtree_type* tree, uint16_t* dclass);
[all...]
/freebsd-11-stable/contrib/unbound/iterator/
H A Diter_fwd.c58 if(n1->dclass != n2->dclass) {
59 if(n1->dclass < n2->dclass)
119 node->dclass = c;
156 if(!prev || prev->dclass != node->dclass) {
293 key.dclass = c;
296 return forwards_insert_data(fwd, key.dclass, key.name,
347 key.dclass
397 forwards_next_root(struct iter_forwards* fwd, uint16_t* dclass) argument
[all...]
H A Diter_utils.h199 * @param dclass: class of query.
203 struct dns_msg* msg, uint16_t dclass);
223 * @param dclass: class of query.
228 enum response_type type, uint16_t dclass);
H A Diter_fwd.h84 uint16_t dclass; member in struct:iter_forward_zone
H A Diter_utils.c132 n->dclass = LDNS_RR_CLASS_IN;
133 if(!name_tree_insert(ntree, n, nm, len, n->labs, n->dclass)) {
800 struct dns_msg* msg, uint16_t dclass)
808 dclass))) {
820 LDNS_RR_TYPE_DS, dclass))
825 dp->name, dp->namelen, dclass, env->scratch, *env->now);
859 enum response_type type, uint16_t dclass)
865 LDNS_RR_TYPE_SOA, dclass) ||
867 LDNS_RR_TYPE_SOA, dclass))
879 ntohs(s->rk.rrset_class) == dclass) {
799 iter_indicates_dnssec(struct module_env* env, struct delegpt* dp, struct dns_msg* msg, uint16_t dclass) argument
858 iter_msg_from_zone(struct dns_msg* msg, struct delegpt* dp, enum response_type type, uint16_t dclass) argument
[all...]
H A Diter_priv.c186 * @param dclass: class to check.
191 uint8_t* name, size_t name_len, uint16_t dclass)
201 return name_tree_lookup(&priv->n, decomp, len, labs, dclass) != NULL;
190 priv_lookup_name(struct iter_priv* priv, sldns_buffer* pkt, uint8_t* name, size_t name_len, uint16_t dclass) argument
/freebsd-11-stable/contrib/unbound/validator/
H A Dval_kentry.h166 * @param dclass: class of key entry. (host order);
172 uint8_t* name, size_t namelen, uint16_t dclass, time_t ttl,
180 * @param dclass: class of key entry. (host order);
187 uint8_t* name, size_t namelen, uint16_t dclass,
195 * @param dclass: class of key entry. (host order);
201 uint8_t* name, size_t namelen, uint16_t dclass, time_t ttl,
H A Dval_neg.h126 uint16_t dclass; member in struct:val_neg_zone
277 * @param dclass: class to look for.
281 uint8_t* nm, size_t len, uint16_t dclass);
289 * @param dclass: class of zone, host order.
293 uint8_t* nm, size_t nm_len, uint16_t dclass);
H A Dval_anchor.h120 uint16_t dclass; member in struct:trust_anchor
172 * @param dclass: class of trust anchor
176 uint8_t* name, int namelabs, size_t namelen, uint16_t dclass);
235 * @param dclass: class of trust anchor
241 size_t namelen, uint16_t dclass, uint16_t keytag);
H A Dval_neg.c78 if(x->dclass != y->dclass) {
79 if(x->dclass < y->dclass)
281 uint8_t* nm, size_t len, uint16_t dclass)
289 lookfor.dclass = dclass;
380 key.dclass = qclass;
388 if(!result || result->dclass != qclass)
446 * @param dclass
280 neg_find_zone(struct val_neg_cache* neg, uint8_t* nm, size_t len, uint16_t dclass) argument
449 neg_setup_zone_node( uint8_t* nm, size_t nm_len, int labs, uint16_t dclass) argument
482 neg_zone_chain( uint8_t* nm, size_t nm_len, int labs, uint16_t dclass, struct val_neg_zone* parent) argument
530 neg_create_zone(struct val_neg_cache* neg, uint8_t* nm, size_t nm_len, uint16_t dclass) argument
852 reply_nsec_signer(struct reply_info* rep, size_t* signer_len, uint16_t* dclass) argument
974 uint16_t dclass; local
1353 uint16_t dclass; local
[all...]
H A Dval_anchor.c66 if(n1->dclass != n2->dclass) {
67 if(n1->dclass < n2->dclass)
164 if(!prev || prev->dclass != node->dclass) {
198 size_t namelen, uint16_t dclass)
207 key.dclass = dclass;
222 size_t namelen, uint16_t dclass, in
197 anchor_find(struct val_anchors* anchors, uint8_t* name, int namelabs, size_t namelen, uint16_t dclass) argument
221 anchor_new_ta(struct val_anchors* anchors, uint8_t* name, int namelabs, size_t namelen, uint16_t dclass, int lockit) argument
304 anchor_store_new_key(struct val_anchors* anchors, uint8_t* name, uint16_t type, uint16_t dclass, uint8_t* rdata, size_t rdata_len) argument
1281 anchor_has_keytag(struct val_anchors* anchors, uint8_t* name, int namelabs, size_t namelen, uint16_t dclass, uint16_t keytag) argument
[all...]
H A Dval_kentry.c257 uint8_t* name, size_t namelen, uint16_t dclass,
269 (*k)->key_class = dclass;
279 uint8_t* name, size_t namelen, uint16_t dclass, time_t ttl,
284 if(!key_entry_setup(region, name, namelen, dclass, &k, &d))
297 uint8_t* name, size_t namelen, uint16_t dclass,
304 if(!key_entry_setup(region, name, namelen, dclass, &k, &d))
325 uint8_t* name, size_t namelen, uint16_t dclass, time_t ttl,
330 if(!key_entry_setup(region, name, namelen, dclass, &k, &d))
256 key_entry_setup(struct regional* region, uint8_t* name, size_t namelen, uint16_t dclass, struct key_entry_key** k, struct key_entry_data** d) argument
278 key_entry_create_null(struct regional* region, uint8_t* name, size_t namelen, uint16_t dclass, time_t ttl, time_t now) argument
296 key_entry_create_rrset(struct regional* region, uint8_t* name, size_t namelen, uint16_t dclass, struct ub_packed_rrset_key* rrset, uint8_t* sigalg, time_t now) argument
324 key_entry_create_bad(struct regional* region, uint8_t* name, size_t namelen, uint16_t dclass, time_t ttl, time_t now) argument
/freebsd-11-stable/contrib/unbound/services/
H A Dauthzone.h107 * uses 'dclass' to not conflict with c++ keyword class. */
108 uint16_t dclass; member in struct:auth_zone
111 * For the node, parent, name, namelen, namelabs, dclass, you
213 * uses 'dclass' to not conflict with c++ keyword class. */
214 uint16_t dclass; member in struct:auth_xfer
551 * @param dclass: class of zone to find.
555 uint8_t* name, size_t name_len, uint16_t dclass);
559 size_t nmlen, uint16_t dclass);
563 size_t nmlen, uint16_t dclass);
568 size_t nmlen, uint16_t dclass);
[all...]
H A Dlocalzone.h134 * uses 'dclass' to not conflict with c++ keyword class. */
135 uint16_t dclass; member in struct:local_zone
138 * For the node, parent, name, namelen, namelabs, dclass, you
255 * @param dclass: class to lookup.
264 uint8_t* name, size_t len, int labs, uint16_t dclass, uint16_t dtype,
274 * @param dclass: class to lookup.
280 uint8_t* name, size_t len, int labs, uint16_t dclass, uint16_t dtype);
370 * @param dclass: class to lookup.
374 uint8_t* name, size_t len, int labs, uint16_t dclass);
383 * @param dclass
[all...]
H A Dlocalzone.c112 if(a->dclass != b->dclass) {
113 if(a->dclass < b->dclass)
147 enum localzone_type t, uint16_t dclass)
154 z->dclass = dclass;
209 uint16_t dclass)
225 if(!(z=lz_enter_zone_dname(zones, nm, len, labs, t, dclass))) {
234 uint16_t* dclass, time_
146 local_zone_create(uint8_t* nm, size_t len, int labs, enum localzone_type t, uint16_t dclass) argument
208 lz_enter_zone(struct local_zones* zones, const char* name, const char* type, uint16_t dclass) argument
233 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) argument
261 get_rr_nameclass(const char* str, uint8_t** nm, uint16_t* dclass, uint16_t* dtype) argument
982 uint16_t dclass = 0; local
1131 local_zones_lookup(struct local_zones* zones, uint8_t* name, size_t len, int labs, uint16_t dclass, uint16_t dtype) argument
1139 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) argument
1177 local_zones_find(struct local_zones* zones, uint8_t* name, size_t len, int labs, uint16_t dclass) argument
1191 local_zones_find_le(struct local_zones* zones, uint8_t* name, size_t len, int labs, uint16_t dclass, int* exact) argument
1922 local_zones_add_zone(struct local_zones* zones, uint8_t* name, size_t len, int labs, uint16_t dclass, enum localzone_type tp) argument
2052 local_zones_del_data(struct local_zones* zones, uint8_t* name, size_t len, int labs, uint16_t dclass) argument
[all...]
H A Dauthzone.c178 key.rk.rrset_class = htons(z->dclass);
204 uint16_t type, uint16_t dclass)
210 ntohs(k->rk.rrset_class) == dclass &&
227 z->dclass))
251 z->dclass))
274 z->dclass))
314 if(a->dclass != b->dclass) {
315 if(a->dclass < b->dclass)
203 msg_rrset_duplicate(struct dns_msg* msg, uint8_t* nm, size_t nmlen, uint16_t type, uint16_t dclass) argument
411 auth_zone_create(struct auth_zones* az, uint8_t* nm, size_t nmlen, uint16_t dclass) argument
444 auth_zone_find(struct auth_zones* az, uint8_t* nm, size_t nmlen, uint16_t dclass) argument
457 auth_xfer_find(struct auth_zones* az, uint8_t* nm, size_t nmlen, uint16_t dclass) argument
471 auth_zone_find_less_equal(struct auth_zones* az, uint8_t* nm, size_t nmlen, uint16_t dclass, struct auth_zone** z) argument
486 auth_zones_find_zone(struct auth_zones* az, uint8_t* name, size_t name_len, uint16_t dclass) argument
2416 create_synth_cname(uint8_t* qname, size_t qname_len, struct regional* region, struct auth_data* node, struct auth_rrset* dname, uint16_t dclass, struct ub_packed_rrset_key** cname) argument
3393 auth_zones_can_fallback(struct auth_zones* az, uint8_t* nm, size_t nmlen, uint16_t dclass) argument
3564 auth_zones_notify(struct auth_zones* az, struct module_env* env, uint8_t* nm, size_t nmlen, uint16_t dclass, struct sockaddr_storage* addr, socklen_t addrlen, int has_serial, uint32_t serial, int* refused) argument
3596 auth_zones_startprobesequence(struct auth_zones* az, struct module_env* env, uint8_t* nm, size_t nmlen, uint16_t dclass) argument
[all...]
/freebsd-11-stable/contrib/unbound/util/data/
H A Dmsgparse.c78 uint16_t type, uint16_t dclass, hashvalue_type hash,
96 p->rrset_class = dclass;
168 uint16_t dclass, uint32_t rrset_flags)
175 h = hashlittle(&dclass, sizeof(dclass), h); /* netw order */
194 pkt_hash_rrset_rest(hashvalue_type dname_h, uint16_t type, uint16_t dclass, argument
201 h = hashlittle(&dclass, sizeof(dclass), h); /* netw order */
210 uint16_t type, uint16_t dclass)
213 p->rrset_class == dclass
77 new_rrset(struct msg_parse* msg, uint8_t* dname, size_t dnamelen, uint16_t type, uint16_t dclass, hashvalue_type hash, uint32_t rrset_flags, sldns_pkt_section section, struct regional* region) argument
167 pkt_hash_rrset(sldns_buffer* pkt, uint8_t* dname, uint16_t type, uint16_t dclass, uint32_t rrset_flags) argument
208 rrset_parse_equals(struct rrset_parse* p, sldns_buffer* pkt, hashvalue_type h, uint32_t rrset_flags, uint8_t* dname, size_t dnamelen, uint16_t type, uint16_t dclass) argument
221 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) argument
461 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) argument
829 uint16_t dclass, prev_dclass = 0; local
[all...]
H A Dmsgparse.h305 * @param dclass: rrset class in network order.
310 uint16_t type, uint16_t dclass, uint32_t rrset_flags);
321 * @param dclass: rrset class, network order.
326 uint8_t* dname, size_t dnamelen, uint16_t type, uint16_t dclass);
H A Dmsgreply.h441 * @param dclass: looks for (host order).
445 uint8_t* name, size_t namelen, uint16_t type, uint16_t dclass);
453 * @param dclass: looks for (host order).
457 uint8_t* name, size_t namelen, uint16_t type, uint16_t dclass);
465 * @param dclass: looks for (host order).
469 uint8_t* name, size_t namelen, uint16_t type, uint16_t dclass);
/freebsd-11-stable/contrib/unbound/ipsecmod/
H A Dipsecmod-whitelist.c76 n->dclass = LDNS_RR_CLASS_IN;
77 if(!name_tree_insert(whitelist, n, nm, len, n->labs, n->dclass)) {
/freebsd-11-stable/contrib/gdb/gdb/
H A Dgdbtypes.c134 static void virtual_base_list_aux (struct type *dclass);
1855 is_ancestor (struct type *base, struct type *dclass) argument
1860 CHECK_TYPEDEF (dclass);
1862 if (base == dclass)
1864 if (TYPE_NAME (base) && TYPE_NAME (dclass) &&
1865 !strcmp (TYPE_NAME (base), TYPE_NAME (dclass)))
1868 for (i = 0; i < TYPE_N_BASECLASSES (dclass); i++)
1869 if (is_ancestor (base, TYPE_BASECLASS (dclass, i)))
1882 has_vtable (struct type *dclass) argument
1889 if (TYPE_CODE (dclass) !
1924 primary_base_class(struct type *dclass) argument
1956 virtual_base_list_aux(struct type *dclass) argument
2014 virtual_base_list(struct type *dclass) argument
2051 virtual_base_list_length(struct type *dclass) argument
2069 virtual_base_list_length_skip_primaries(struct type *dclass) argument
2098 virtual_base_index(struct type *base, struct type *dclass) argument
2128 virtual_base_index_skip_primaries(struct type *base, struct type *dclass) argument
2160 class_index_in_primary_list(struct type *dclass) argument
2182 count_virtual_fns(struct type *dclass) argument
[all...]
/freebsd-11-stable/contrib/unbound/services/cache/
H A Drrset.h240 * @param dclass: class of rrset, host order
244 uint16_t type, uint16_t dclass, uint32_t flags);
/freebsd-11-stable/contrib/unbound/util/
H A Dnet_help.h237 * @param dclass: host format RR class.
240 uint8_t* name, uint16_t type, uint16_t dclass);
246 uint16_t dclass);
H A Dnet_help.c485 uint16_t type, uint16_t dclass)
505 if(sldns_lookup_by_id(sldns_rr_classes, (int)dclass) &&
506 sldns_lookup_by_id(sldns_rr_classes, (int)dclass)->name)
507 cs = sldns_lookup_by_id(sldns_rr_classes, (int)dclass)->name;
509 snprintf(c, sizeof(c), "CLASS%d", (int)dclass);
516 log_query_in(const char* str, uint8_t* name, uint16_t type, uint16_t dclass) argument
534 if(sldns_lookup_by_id(sldns_rr_classes, (int)dclass) &&
535 sldns_lookup_by_id(sldns_rr_classes, (int)dclass)->name)
536 cs = sldns_lookup_by_id(sldns_rr_classes, (int)dclass)->name;
538 snprintf(c, sizeof(c), "CLASS%d", (int)dclass);
484 log_nametypeclass(enum verbosity_value v, const char* str, uint8_t* name, uint16_t type, uint16_t dclass) argument
[all...]

Completed in 246 milliseconds

12