| /src/external/bsd/unbound/dist/util/storage/ |
| dnstree.c | 52 if(x->dclass != y->dclass) {
53 if(x->dclass < y->dclass)
98 uint8_t* name, size_t len, int labs, uint16_t dclass)
104 node->dclass = dclass;
159 if(!prev || prev->dclass != node->dclass) {
180 size_t len, int labs, uint16_t dclass)
[all...] |
| dnstree.h | 56 /** 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...] |
| /src/external/bsd/unbound/dist/iterator/ |
| iter_fwd.c | 58 if(n1->dclass != n2->dclass) {
59 if(n1->dclass < n2->dclass)
121 node->dclass = c;
147 key.dclass = c;
169 if(!prev || prev->dclass != node->dclass) {
319 key.dclass = c;
322 return forwards_insert_data(fwd, key.dclass, key.name
[all...] |
| iter_fwd.h | 90 uint16_t dclass; member in struct:iter_forward_zone
|
| iter_utils.h | 222 * @param dclass: class of query.
226 struct dns_msg* msg, uint16_t dclass);
246 * @param dclass: class of query.
251 enum response_type type, uint16_t dclass);
|
| iter_utils.c | 168 n->dclass = LDNS_RR_CLASS_IN;
169 if(!name_tree_insert(ntree, n, nm, len, n->labs, n->dclass)) {
938 struct dns_msg* msg, uint16_t dclass)
946 dclass))) {
958 LDNS_RR_TYPE_DS, dclass))
963 dp->name, dp->namelen, dclass, env->scratch, *env->now);
997 enum response_type type, uint16_t dclass)
1003 LDNS_RR_TYPE_SOA, dclass) ||
1005 LDNS_RR_TYPE_SOA, dclass))
1017 ntohs(s->rk.rrset_class) == dclass) {
[all...] |
| /src/external/bsd/unbound/dist/validator/ |
| val_anchor.h | 120 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);
|
| val_kentry.h | 170 * @param dclass: class of key entry. (host order);
178 uint8_t* name, size_t namelen, uint16_t dclass, time_t ttl,
187 * @param dclass: class of key entry. (host order);
196 uint8_t* name, size_t namelen, uint16_t dclass,
206 * @param dclass: class of key entry. (host order);
214 uint8_t* name, size_t namelen, uint16_t dclass, time_t ttl,
|
| val_neg.h | 126 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);
|
| val_neg.c | 85 if(x->dclass != y->dclass) {
86 if(x->dclass < y->dclass)
288 uint8_t* nm, size_t len, uint16_t dclass)
296 lookfor.dclass = dclass;
387 key.dclass = qclass;
395 if(!result || result->dclass != qclass)
453 * @param dclass: class of zone, host order
990 uint16_t dclass; local
1396 uint16_t dclass; local
[all...] |
| val_anchor.c | 66 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, int lockit
[all...] |
| val_kentry.c | 260 uint8_t* name, size_t namelen, uint16_t dclass,
272 (*k)->key_class = dclass;
282 uint8_t* name, size_t namelen, uint16_t dclass, time_t ttl,
288 if(!key_entry_setup(region, name, namelen, dclass, &k, &d))
304 uint8_t* name, size_t namelen, uint16_t dclass,
313 if(!key_entry_setup(region, name, namelen, dclass, &k, &d))
337 uint8_t* name, size_t namelen, uint16_t dclass, time_t ttl,
343 if(!key_entry_setup(region, name, namelen, dclass, &k, &d))
|
| autotrust.c | 355 tp->dclass = dc;
841 uint16_t dclass; local
854 dclass = parse_int(next+1, &r);
861 tp = autr_tp_create(anchors, dname, dname_len, dclass);
1134 print_id(FILE* out, char* fname, uint8_t* nm, size_t nmlen, uint16_t dclass)
1141 if(fprintf(out, ";;id: %s %d\n", s, (int)dclass) < 0) {
1173 if(!print_id(out, fn, tp->name, tp->namelen, tp->dclass)) {
1699 tp->name, LDNS_RR_TYPE_DNSKEY, tp->dclass);
2129 key.dclass = tp->dclass;
[all...] |
| /src/external/bsd/unbound/dist/services/ |
| localzone.h | 147 * uses 'dclass' to not conflict with c++ keyword class. */
148 uint16_t dclass; member in struct:local_zone
151 * For the node, parent, name, namelen, namelabs, dclass, you
268 * @param dclass: class to lookup.
279 uint8_t* name, size_t len, int labs, uint16_t dclass, uint16_t dtype,
289 * @param dclass: class to lookup.
297 uint8_t* name, size_t len, int labs, uint16_t dclass, uint16_t dtype,
388 * @param dclass: class to lookup.
392 uint8_t* name, size_t len, int labs, uint16_t dclass);
401 * @param dclass: class to lookup
[all...] |
| authzone.h | 104 * uses 'dclass' to not conflict with c++ keyword class. */
105 uint16_t dclass; member in struct:auth_zone
108 * For the node, parent, name, namelen, namelabs, dclass, you
235 * uses 'dclass' to not conflict with c++ keyword class. */
236 uint16_t dclass; member in struct:auth_xfer
596 * @param dclass: class of zone to find.
600 uint8_t* name, size_t name_len, uint16_t dclass);
604 size_t nmlen, uint16_t dclass);
608 size_t nmlen, uint16_t dclass);
613 size_t nmlen, uint16_t dclass);
[all...] |
| localzone.c | 99 log_nametypeclass(NO_VERBOSE, buf, z->name, 0, z->dclass);
168 if(a->dclass != b->dclass) {
169 if(a->dclass < b->dclass)
203 enum localzone_type t, uint16_t dclass)
210 z->dclass = dclass;
265 uint16_t dclass)
281 if(!(z=lz_enter_zone_dname(zones, nm, len, labs, t, dclass))) {
1064 uint16_t dclass = 0; local
[all...] |
| authzone.c | 189 key.rk.rrset_class = htons(z->dclass);
215 uint16_t type, uint16_t dclass)
221 ntohs(k->rk.rrset_class) == dclass &&
238 z->dclass))
262 z->dclass))
285 z->dclass))
325 if(a->dclass != b->dclass) {
326 if(a->dclass < b->dclass)
[all...] |
| /src/external/bsd/unbound/dist/testcode/ |
| pktview.c | 134 uint16_t type, dclass, len; local
138 dclass = sldns_buffer_read_u16(pkt);
142 (int)dclass)?sldns_lookup_by_id(sldns_rr_classes,
143 (int)dclass)->name:"??", (int)dclass);
|
| /src/external/bsd/unbound/dist/util/data/ |
| msgparse.c | 85 uint16_t type, uint16_t dclass, hashvalue_type hash,
103 p->rrset_class = dclass;
175 uint16_t dclass, uint32_t rrset_flags)
182 h = hashlittle(&dclass, sizeof(dclass), h); /* netw order */
201 pkt_hash_rrset_rest(hashvalue_type dname_h, uint16_t type, uint16_t dclass,
208 h = hashlittle(&dclass, sizeof(dclass), h); /* netw order */
217 uint16_t type, uint16_t dclass)
220 p->rrset_class == dclass && p->flags == rrset_flags &
839 uint16_t dclass, prev_dclass = 0; local
[all...] |
| msgparse.h | 367 * @param dclass: rrset class in network order.
372 uint16_t type, uint16_t dclass, uint32_t rrset_flags);
383 * @param dclass: rrset class, network order.
388 uint8_t* dname, size_t dnamelen, uint16_t type, uint16_t dclass);
|
| msgreply.h | 516 * @param dclass: looks for (host order).
520 uint8_t* name, size_t namelen, uint16_t type, uint16_t dclass);
528 * @param dclass: looks for (host order).
532 uint8_t* name, size_t namelen, uint16_t type, uint16_t dclass);
540 * @param dclass: looks for (host order).
544 uint8_t* name, size_t namelen, uint16_t type, uint16_t dclass);
|
| /src/external/bsd/unbound/dist/ipsecmod/ |
| ipsecmod-whitelist.c | 76 n->dclass = LDNS_RR_CLASS_IN;
77 if(!name_tree_insert(whitelist, n, nm, len, n->labs, n->dclass)) {
|
| /src/external/gpl3/gcc.old/dist/gcc/d/dmd/ |
| arraytypes.d | 14 import dmd.dclass;
|
| /src/external/bsd/unbound/dist/services/cache/ |
| rrset.h | 271 * @param dclass: class of rrset, host order
275 uint16_t type, uint16_t dclass, uint32_t flags);
|
| /src/external/bsd/unbound/dist/util/ |
| net_help.h | 258 * @param dclass: host format RR class.
261 uint8_t* name, uint16_t type, uint16_t dclass);
267 uint16_t dclass);
|
