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

12

/freebsd-10.0-release/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;
139 if(!prev || prev->dclass != node->dclass) {
160 size_t len, int labs, uint16_t dclass)
84 name_tree_insert(rbtree_t* tree, struct name_tree_node* node, uint8_t* name, size_t len, int labs, uint16_t dclass) argument
159 name_tree_find(rbtree_t* tree, uint8_t* name, size_t len, int labs, uint16_t dclass) argument
171 name_tree_lookup(rbtree_t* tree, uint8_t* name, size_t len, int labs, uint16_t dclass) argument
235 name_tree_next_root(rbtree_t* 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_t* tree, uint16_t* dclass);
[all...]
/freebsd-10.0-release/contrib/unbound/services/
H A Dlocalzone.h101 * uses 'dclass' to not conflict with c++ keyword class. */
102 uint16_t dclass; member in struct:local_zone
105 * For the node, parent, name, namelen, namelabs, dclass, you
201 * @param dclass: class to lookup.
205 uint8_t* name, size_t len, int labs, uint16_t dclass);
253 * @param dclass: class to lookup.
257 uint8_t* name, size_t len, int labs, uint16_t dclass);
267 * @param dclass: class to add.
272 uint8_t* name, size_t len, int labs, uint16_t dclass,
302 * @param dclass
[all...]
H A Dlocalzone.c106 if(a->dclass != b->dclass) {
107 if(a->dclass < b->dclass)
150 enum localzone_type t, uint16_t dclass)
157 z->dclass = dclass;
202 uint16_t dclass)
218 if(!(z=lz_enter_zone_dname(zones, nm, len, labs, t, dclass))) {
228 uint16_t* dclass, uint32_
149 local_zone_create(uint8_t* nm, size_t len, int labs, enum localzone_type t, uint16_t dclass) argument
201 lz_enter_zone(struct local_zones* zones, const char* name, const char* type, uint16_t dclass) argument
227 get_rr_content(const char* str, uint8_t** nm, uint16_t* type, uint16_t* dclass, uint32_t* ttl, ldns_buffer* rdata) argument
266 get_rr_nameclass(const char* str, uint8_t** nm, uint16_t* dclass) argument
754 uint16_t dclass = 0; local
887 local_zones_lookup(struct local_zones* zones, uint8_t* name, size_t len, int labs, uint16_t dclass) argument
920 local_zones_find(struct local_zones* zones, uint8_t* name, size_t len, int labs, uint16_t dclass) argument
1215 local_zones_add_zone(struct local_zones* zones, uint8_t* name, size_t len, int labs, uint16_t dclass, enum localzone_type tp) argument
1323 local_zones_del_data(struct local_zones* zones, uint8_t* name, size_t len, int labs, uint16_t dclass) argument
[all...]
/freebsd-10.0-release/contrib/unbound/iterator/
H A Diter_fwd.c59 if(n1->dclass != n2->dclass) {
60 if(n1->dclass < n2->dclass)
120 node->dclass = c;
157 if(!prev || prev->dclass != node->dclass) {
281 key.dclass = c;
284 return forwards_insert_data(fwd, key.dclass, key.name,
335 key.dclass
369 forwards_next_root(struct iter_forwards* fwd, uint16_t* dclass) argument
[all...]
H A Diter_utils.h182 * @param dclass: class of query.
186 struct dns_msg* msg, uint16_t dclass);
206 * @param dclass: class of query.
211 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.c545 struct dns_msg* msg, uint16_t dclass)
553 dclass))) {
560 LDNS_RR_TYPE_DS, dclass))
565 dp->name, dp->namelen, dclass, env->scratch, *env->now);
599 enum response_type type, uint16_t dclass)
605 LDNS_RR_TYPE_SOA, dclass) ||
607 LDNS_RR_TYPE_SOA, dclass))
619 ntohs(s->rk.rrset_class) == dclass) {
633 LDNS_RR_TYPE_NS, dclass) ||
635 LDNS_RR_TYPE_NS, dclass))
544 iter_indicates_dnssec(struct module_env* env, struct delegpt* dp, struct dns_msg* msg, uint16_t dclass) argument
598 iter_msg_from_zone(struct dns_msg* msg, struct delegpt* dp, enum response_type type, uint16_t dclass) argument
[all...]
H A Diter_priv.c187 * @param dclass: class to check.
192 uint8_t* name, size_t name_len, uint16_t dclass)
202 return name_tree_lookup(&priv->n, decomp, len, labs, dclass) != NULL;
191 priv_lookup_name(struct iter_priv* priv, ldns_buffer* pkt, uint8_t* name, size_t name_len, uint16_t dclass) argument
/freebsd-10.0-release/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, uint32_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, uint32_t ttl,
H A Dval_neg.h119 uint16_t dclass; member in struct:val_neg_zone
289 * @param dclass: class to look for.
293 uint8_t* nm, size_t len, uint16_t dclass);
301 * @param dclass: class of zone, host order.
305 uint8_t* nm, size_t nm_len, uint16_t dclass);
H A Dval_anchor.h121 uint16_t dclass; member in struct:trust_anchor
173 * @param dclass: class of trust anchor
177 uint8_t* name, int namelabs, size_t namelen, uint16_t dclass);
H A Dval_neg.c76 if(x->dclass != y->dclass) {
77 if(x->dclass < y->dclass)
278 uint8_t* nm, size_t len, uint16_t dclass)
286 lookfor.dclass = dclass;
377 key.dclass = qclass;
385 if(!result || result->dclass != qclass)
443 * @param dclass
277 neg_find_zone(struct val_neg_cache* neg, uint8_t* nm, size_t len, uint16_t dclass) argument
446 neg_setup_zone_node( uint8_t* nm, size_t nm_len, int labs, uint16_t dclass) argument
479 neg_zone_chain( uint8_t* nm, size_t nm_len, int labs, uint16_t dclass, struct val_neg_zone* parent) argument
527 neg_create_zone(struct val_neg_cache* neg, uint8_t* nm, size_t nm_len, uint16_t dclass) argument
1021 reply_nsec_signer(struct reply_info* rep, size_t* signer_len, uint16_t* dclass) argument
1053 uint16_t dclass; local
1365 uint16_t dclass; local
[all...]
H A Dval_anchor.c64 if(n1->dclass != n2->dclass) {
65 if(n1->dclass < n2->dclass)
162 if(!prev || prev->dclass != node->dclass) {
196 size_t namelen, uint16_t dclass)
205 key.dclass = dclass;
220 size_t namelen, uint16_t dclass, in
195 anchor_find(struct val_anchors* anchors, uint8_t* name, int namelabs, size_t namelen, uint16_t dclass) argument
219 anchor_new_ta(struct val_anchors* anchors, uint8_t* name, int namelabs, size_t namelen, uint16_t dclass, int lockit) argument
300 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
[all...]
H A Dval_kentry.c256 uint8_t* name, size_t namelen, uint16_t dclass,
268 (*k)->key_class = dclass;
278 uint8_t* name, size_t namelen, uint16_t dclass, uint32_t ttl,
283 if(!key_entry_setup(region, name, namelen, dclass, &k, &d))
296 uint8_t* name, size_t namelen, uint16_t dclass,
303 if(!key_entry_setup(region, name, namelen, dclass, &k, &d))
324 uint8_t* name, size_t namelen, uint16_t dclass, uint32_t ttl,
329 if(!key_entry_setup(region, name, namelen, dclass, &k, &d))
255 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
277 key_entry_create_null(struct regional* region, uint8_t* name, size_t namelen, uint16_t dclass, uint32_t ttl, uint32_t now) argument
295 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, uint32_t now) argument
323 key_entry_create_bad(struct regional* region, uint8_t* name, size_t namelen, uint16_t dclass, uint32_t ttl, uint32_t now) argument
H A Dautotrust.c316 tp->dclass = dc;
605 uint16_t dclass; local
616 dclass = parse_int(next+1, &r);
623 tp = autr_tp_create(anchors, rdf, dclass);
869 uint8_t* nm, size_t nmlen, uint16_t dclass)
891 (int)dclass) < 0) {
922 if(!print_id(out, fn, env, tp->name, tp->namelen, tp->dclass)) {
1407 tp->name, LDNS_RR_TYPE_DNSKEY, tp->dclass);
1818 key.dclass = tp->dclass;
868 print_id(FILE* out, char* fname, struct module_env* env, uint8_t* nm, size_t nmlen, uint16_t dclass) argument
[all...]
/freebsd-10.0-release/contrib/unbound/util/data/
H A Dmsgparse.c70 uint16_t type, uint16_t dclass, hashvalue_t hash,
88 p->rrset_class = dclass;
160 uint16_t dclass, uint32_t rrset_flags)
167 h = hashlittle(&dclass, sizeof(dclass), h); /* netw order */
186 pkt_hash_rrset_rest(hashvalue_t dname_h, uint16_t type, uint16_t dclass, argument
193 h = hashlittle(&dclass, sizeof(dclass), h); /* netw order */
202 uint16_t type, uint16_t dclass)
205 p->rrset_class == dclass
69 new_rrset(struct msg_parse* msg, uint8_t* dname, size_t dnamelen, uint16_t type, uint16_t dclass, hashvalue_t hash, uint32_t rrset_flags, ldns_pkt_section section, struct regional* region) argument
159 pkt_hash_rrset(ldns_buffer* pkt, uint8_t* dname, uint16_t type, uint16_t dclass, uint32_t rrset_flags) argument
200 rrset_parse_equals(struct rrset_parse* p, ldns_buffer* pkt, hashvalue_t h, uint32_t rrset_flags, uint8_t* dname, size_t dnamelen, uint16_t type, uint16_t dclass) argument
213 msgparse_hashtable_lookup(struct msg_parse* msg, ldns_buffer* pkt, hashvalue_t h, uint32_t rrset_flags, uint8_t* dname, size_t dnamelen, uint16_t type, uint16_t dclass) argument
453 find_rrset(struct msg_parse* msg, ldns_buffer* pkt, uint8_t* dname, size_t dnamelen, uint16_t type, uint16_t dclass, hashvalue_t* 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, ldns_pkt_section section, struct regional* region) argument
821 uint16_t dclass, prev_dclass = 0; local
[all...]
H A Dmsgreply.h369 * @param dclass: looks for (host order).
373 uint8_t* name, size_t namelen, uint16_t type, uint16_t dclass);
381 * @param dclass: looks for (host order).
385 uint8_t* name, size_t namelen, uint16_t type, uint16_t dclass);
393 * @param dclass: looks for (host order).
397 uint8_t* name, size_t namelen, uint16_t type, uint16_t dclass);
H A Dmsgparse.h269 * @param dclass: rrset class in network order.
274 uint16_t dclass, uint32_t rrset_flags);
285 * @param dclass: rrset class, network order.
290 uint8_t* dname, size_t dnamelen, uint16_t type, uint16_t dclass);
H A Dmsgreply.c716 uint8_t* name, size_t namelen, uint16_t type, uint16_t dclass)
722 ntohs(s->rk.rrset_class) == dclass &&
732 uint8_t* name, size_t namelen, uint16_t type, uint16_t dclass)
738 ntohs(s->rk.rrset_class) == dclass &&
748 uint8_t* name, size_t namelen, uint16_t type, uint16_t dclass)
754 ntohs(s->rk.rrset_class) == dclass &&
715 reply_find_rrset_section_an(struct reply_info* rep, uint8_t* name, size_t namelen, uint16_t type, uint16_t dclass) argument
731 reply_find_rrset_section_ns(struct reply_info* rep, uint8_t* name, size_t namelen, uint16_t type, uint16_t dclass) argument
747 reply_find_rrset(struct reply_info* rep, uint8_t* name, size_t namelen, uint16_t type, uint16_t dclass) argument
/freebsd-10.0-release/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-10.0-release/contrib/unbound/services/cache/
H A Drrset.h222 * @param dclass: class of rrset, host order
226 uint16_t type, uint16_t dclass, uint32_t flags);
H A Drrset.c405 uint16_t type, uint16_t dclass, uint32_t flags)
411 key.rk.rrset_class = htons(dclass);
404 rrset_cache_remove(struct rrset_cache* r, uint8_t* nm, size_t nmlen, uint16_t type, uint16_t dclass, uint32_t flags) argument
/freebsd-10.0-release/contrib/unbound/util/
H A Dnet_help.h200 * @param dclass: host format RR class.
203 uint8_t* name, uint16_t type, uint16_t dclass);
H A Dnet_help.c269 uint16_t type, uint16_t dclass)
289 if(ldns_lookup_by_id(ldns_rr_classes, (int)dclass) &&
290 ldns_lookup_by_id(ldns_rr_classes, (int)dclass)->name)
291 cs = ldns_lookup_by_id(ldns_rr_classes, (int)dclass)->name;
293 snprintf(c, sizeof(c), "CLASS%d", (int)dclass);
268 log_nametypeclass(enum verbosity_value v, const char* str, uint8_t* name, uint16_t type, uint16_t dclass) argument

Completed in 222 milliseconds

12