/freebsd-10.0-release/contrib/unbound/iterator/ |
H A D | iter_hints.h | 56 * first sorted on qclass. Then on dname in nsec-like order, so that 100 * @param qclass: class for which root hints are requested. host order. 103 struct delegpt* hints_lookup_root(struct iter_hints* hints, uint16_t qclass); 108 * @param qclass: class for which root hints are sought. 113 * false if not root hint class is found (qclass may have been changed). 115 int hints_next_root(struct iter_hints* hints, uint16_t* qclass); 118 * Given a qname/qclass combination, and the delegation point from the cache 119 * for this qname/qclass, determine if this combination indicates that a 124 * @param qclass: The qclass tha [all...] |
H A D | iter_fwd.h | 55 * first sorted on qclass. Then on dname in nsec-like order, so that 109 * For this qname/qclass find forward zone information, returns delegation 114 * @param qclass: The qclass of the query. 119 uint8_t* qname, uint16_t qclass); 124 * @param qclass: The qclass of the query. 128 uint16_t qclass); 133 * @param qclass: class to look at next, or higher. 134 * @return false if none found, or if true stored in qclass [all...] |
H A D | iterator.c | 204 super_iq->qchase.qclass, super->region, 242 * message cache (so per qname, qtype, qclass). 475 * @param qclass The query class for this request. 490 uint16_t qclass, struct module_qstate* qstate, int id, 502 qinf.qclass = qclass; 558 * @param qclass: the class to prime. 563 uint16_t qclass) 568 ldns_lookup_by_id(ldns_rr_classes, (int)qclass)? 569 ldns_lookup_by_id(ldns_rr_classes, (int)qclass) 489 generate_sub_request(uint8_t* qname, size_t qnamelen, uint16_t qtype, uint16_t qclass, struct module_qstate* qstate, int id, struct iter_qstate* iq, enum iter_state initial_state, enum iter_state finalstate, struct module_qstate** subq_ret, int v) argument 562 prime_root(struct module_qstate* qstate, struct iter_qstate* iq, int id, uint16_t qclass) argument 623 prime_stub(struct module_qstate* qstate, struct iter_qstate* iq, int id, uint8_t* qname, uint16_t qclass) argument 1279 generate_parentside_target_query(struct module_qstate* qstate, struct iter_qstate* iq, int id, uint8_t* name, size_t namelen, uint16_t qtype, uint16_t qclass) argument 1331 generate_target_query(struct module_qstate* qstate, struct iter_qstate* iq, int id, uint8_t* name, size_t namelen, uint16_t qtype, uint16_t qclass) argument [all...] |
H A D | iter_hints.c | 446 hints_lookup_root(struct iter_hints* hints, uint16_t qclass) argument 451 &rootlab, 1, 1, qclass); 459 uint16_t qclass, struct delegpt* cache_dp) 468 len, labs, qclass); 494 int hints_next_root(struct iter_hints* hints, uint16_t* qclass) argument 496 return name_tree_next_root(&hints->tree, qclass); 458 hints_lookup_stub(struct iter_hints* hints, uint8_t* qname, uint16_t qclass, struct delegpt* cache_dp) argument
|
H A D | iter_resptype.c | 79 ntohs(s->rk.rrset_class) == request->qclass && 163 ntohs(s->rk.rrset_class) == request->qclass && 177 ntohs(s->rk.rrset_class) == request->qclass &&
|
H A D | iter_utils.c | 452 qinf.qclass = c; 468 LDNS_RR_TYPE_AAAA, qstate->qinfo.qclass) || 470 LDNS_RR_TYPE_A, qstate->qinfo.qclass)) { 475 qstate->qinfo.qclass); 490 LDNS_RR_TYPE_A, qstate->qinfo.qclass)) { 493 LDNS_RR_TYPE_A, qstate->qinfo.qclass); 497 LDNS_RR_TYPE_AAAA, qstate->qinfo.qclass)) { 500 LDNS_RR_TYPE_AAAA, qstate->qinfo.qclass); 789 neg->rk.rrset_class = htons(qinfo->qclass); 830 dp->namelen, LDNS_RR_TYPE_NS, qinfo->qclass, [all...] |
H A D | iter_fwd.c | 328 forwards_lookup(struct iter_forwards* fwd, uint8_t* qname, uint16_t qclass) argument 335 key.dclass = qclass; 345 if(!result || result->dclass != qclass) 362 forwards_lookup_root(struct iter_forwards* fwd, uint16_t qclass) argument 365 return forwards_lookup(fwd, &root, qclass);
|
/freebsd-10.0-release/contrib/unbound/services/cache/ |
H A D | dns.h | 117 * @param qclass: query class. 125 uint8_t* qname, size_t qnamelen, uint16_t qtype, uint16_t qclass, 134 * @param qclass: query class. 142 uint8_t* qname, size_t qnamelen, uint16_t qtype, uint16_t qclass, 148 * @param qclass: which class to look in. 153 int cache_fill_missing(struct module_env* env, uint16_t qclass, 162 * @param qclass: query section class 168 uint16_t qclass, struct regional* region, size_t capacity);
|
H A D | dns.c | 145 uint16_t qclass, uint32_t now, uint16_t searchtype, int stripfront) 160 qnamelen, searchtype, qclass, 0, now, 0))) 186 uint16_t qtype, uint16_t qclass, uint32_t now, int wr) 195 k.qclass = qclass; 209 find_add_addrs(struct module_env* env, uint16_t qclass, argument 218 ns->namelen, LDNS_RR_TYPE_A, qclass, 0, now, 0); 229 LDNS_RR_TYPE_A, qclass, now, 0); 236 ns->namelen, LDNS_RR_TYPE_AAAA, qclass, 0, now, 0); 247 LDNS_RR_TYPE_AAAA, qclass, no 144 find_closest_of_type(struct module_env* env, uint8_t* qname, size_t qnamelen, uint16_t qclass, uint32_t now, uint16_t searchtype, int stripfront) argument 185 msg_cache_lookup(struct module_env* env, uint8_t* qname, size_t qnamelen, uint16_t qtype, uint16_t qclass, uint32_t now, int wr) argument 259 cache_fill_missing(struct module_env* env, uint16_t qclass, struct regional* region, struct delegpt* dp) argument 342 dns_msg_create(uint8_t* qname, size_t qnamelen, uint16_t qtype, uint16_t qclass, struct regional* region, size_t capacity) argument 382 dns_cache_find_delegation(struct module_env* env, uint8_t* qname, size_t qnamelen, uint16_t qtype, uint16_t qclass, struct regional* region, struct dns_msg** msg, uint32_t now) argument 626 dns_cache_lookup(struct module_env* env, uint8_t* qname, size_t qnamelen, uint16_t qtype, uint16_t qclass, struct regional* region, struct regional* scratch) argument [all...] |
H A D | rrset.h | 143 * @param qclass: class of rrset to lookup (host order). 151 uint8_t* qname, size_t qnamelen, uint16_t qtype, uint16_t qclass,
|
/freebsd-10.0-release/contrib/unbound/daemon/ |
H A D | stats.h | 55 /** number of qclass that is stored for in array */ 86 /** qclass stats */ 87 size_t qclass[STATS_QCLASS_NUM]; member in struct:server_stats 88 /** bigger qclass values not in array */ 220 * @param qclass: query class 225 uint16_t qtype, uint16_t qclass, struct edns_data* edns,
|
H A D | stats.c | 235 total->svr.qclass[i] += a->svr.qclass[i]; 257 uint16_t qtype, uint16_t qclass, struct edns_data* edns, 264 if(qclass < STATS_QCLASS_NUM) 265 stats->qclass[qclass]++; 256 server_stats_insquery(struct server_stats* stats, struct comm_point* c, uint16_t qtype, uint16_t qclass, struct edns_data* edns, struct comm_reply* repinfo) argument
|
/freebsd-10.0-release/contrib/unbound/libunbound/ |
H A D | worker.h | 56 * @param qclass: query class. (host order) 69 uint16_t qtype, uint16_t qclass, uint16_t flags, int dnssec, 105 * @param qclass: query class. (host order) 118 uint16_t qtype, uint16_t qclass, uint16_t flags, int dnssec,
|
H A D | unbound.h | 120 int qclass; member in struct:ub_result
|
/freebsd-10.0-release/contrib/unbound/validator/ |
H A D | val_anchor.h | 155 * Given a qname/qclass combination, find the trust anchor closest above it. 161 * @param qclass: class to query for. 165 uint8_t* qname, size_t qname_len, uint16_t qclass);
|
H A D | val_neg.h | 222 * @param qclass: class to look in. 229 * thus, qname DLV qclass does not exist. 232 uint16_t qclass, struct rrset_cache* rrset_cache, uint32_t now);
|
H A D | validator.c | 339 * @param qclass: query class. 345 size_t namelen, uint16_t qtype, uint16_t qclass, uint16_t flags) 353 ask.qclass = qclass; 1248 vq->qchase.qclass = ntohs(vq->orig_msg->rep-> 1271 lookup_name, lookup_len, vq->qchase.qclass); 1296 lookup_name, lookup_len, vq->qchase.qclass); 1326 vq->qchase.qclass, qstate->region, *qstate->env->now); 1428 vq->qchase.qclass, BIT_CD)) { 1500 vq->qchase.qclass, BIT_C 344 generate_request(struct module_qstate* qstate, int id, uint8_t* name, size_t namelen, uint16_t qtype, uint16_t qclass, uint16_t flags) argument [all...] |
H A D | val_neg.c | 364 * @param qclass: class. 368 uint8_t* nm, size_t nm_len, int labs, uint16_t qclass) 377 key.dclass = qclass; 385 if(!result || result->dclass != qclass) 920 uint16_t qclass, struct rrset_cache* rrset_cache, uint32_t now) 934 LDNS_RR_TYPE_DLV, qclass); 938 zone = neg_closest_zone_parent(neg, qname, len, labs, qclass); 998 qinfo.qclass = qclass; 1129 * @param qclass 367 neg_closest_zone_parent(struct val_neg_cache* neg, uint8_t* nm, size_t nm_len, int labs, uint16_t qclass) argument 919 val_neg_dlvlookup(struct val_neg_cache* neg, uint8_t* qname, size_t len, uint16_t qclass, struct rrset_cache* rrset_cache, uint32_t now) argument 1138 grab_nsec(struct rrset_cache* rrset_cache, uint8_t* qname, size_t qname_len, uint16_t qtype, uint16_t qclass, uint32_t flags, struct regional* region, int checkbit, uint16_t checktype, uint32_t now) argument [all...] |
/freebsd-10.0-release/contrib/unbound/smallapp/ |
H A D | worker_cb.c | 104 uint16_t ATTR_UNUSED(qclass), uint16_t ATTR_UNUSED(flags), 136 uint16_t ATTR_UNUSED(qclass), uint16_t ATTR_UNUSED(flags),
|
/freebsd-10.0-release/contrib/unbound/util/ |
H A D | fptr_wlist.h | 213 uint8_t* qname, size_t qnamelen, uint16_t qtype, uint16_t qclass,
|
H A D | module.h | 95 * @param qclass: query class. (host order) 113 uint16_t qtype, uint16_t qclass, uint16_t flags, int dnssec,
|
/freebsd-10.0-release/contrib/unbound/util/data/ |
H A D | msgreply.c | 75 qinf->qclass = msg->qclass; 502 /* minimum size: header + \0 + qtype + qclass */ 513 return 0; /* need qtype, qclass */ 515 m->qclass = ldns_buffer_read_u16(query); 536 COMPARE_IT(msg1->qclass, msg2->qclass); 582 h = hashlittle(&q->qclass, sizeof(q->qclass), h); 678 ntohs(s->rk.rrset_class) == qinfo->qclass [all...] |
H A D | msgparse.h | 113 uint16_t qclass; member in struct:msg_parse
|
H A D | msgreply.h | 73 /** qclass, host byte order */ 74 uint16_t qclass; member in struct:query_info
|
/freebsd-10.0-release/lib/libc/net/ |
H A D | hesiod.c | 369 get_txt_records(qclass, name) 370 int qclass; 383 n = res_mkquery(QUERY, name, qclass, T_TXT, NULL, 0, 436 if (class != qclass || type != T_TXT) {
|