outbound_list_init(&iq->outlist);
if(qstate->qinfo.has_cd)
flags |= BIT_CD;
- e = (*env->send_query)(qstate->qinfo.qname, qstate->qinfo.qnamesize,
+ e = (*env->send_query)(qstate->qinfo.qname, qstate->qinfo.qname_len,
qstate->qinfo.qtype, qstate->qinfo.qclass, flags, dnssec,
&ie->fwd_addr, ie->fwd_addrlen, qstate);
if(!e)
* we just look for the closest set of server to the parent of qname.
*/
delname = qstate->qinfo.qname;
- delnamelen = qstate->qinfo.qnamesize;
+ delnamelen = qstate->qinfo.qname_len;
if(qstate->qinfo.qtype == LDNS_RR_TYPE_DS && delname[0] != 0) {
/* do not adjust root label */
size_t lablen = delname[0] + 1;
if(!qinf->qname) return 0;
dname_pkt_copy(pkt, qinf->qname, msg->qname);
} else qinf->qname = 0;
- qinf->qnamesize = msg->qname_len;
+ qinf->qname_len = msg->qname_len;
qinf->qtype = msg->qtype;
qinf->qclass = msg->qclass;
qinf->has_cd = 0;
m->has_cd = LDNS_CD_WIRE(q)?1:0;
ldns_buffer_skip(query, LDNS_HEADER_SIZE);
m->qname = ldns_buffer_current(query);
- if((m->qnamesize = query_dname_len(query)) == 0)
+ if((m->qname_len = query_dname_len(query)) == 0)
return 0; /* parse error */
if(ldns_buffer_remaining(query) < 4)
return 0; /* need qtype, qclass */
query_info_allocqname(struct query_info* m)
{
uint8_t* q = m->qname;
- if(!(m->qname = (uint8_t*)malloc(m->qnamesize))) {
+ if(!(m->qname = (uint8_t*)malloc(m->qname_len))) {
log_err("query_info_allocqname: out of memory");
return 0; /* out of memory */
}
- memcpy(m->qname, q, m->qnamesize);
+ memcpy(m->qname, q, m->qname_len);
return 1;
}
COMPARE_IT(msg1->qtype, msg2->qtype);
if((mc = query_dname_compare(msg1->qname, msg2->qname)) != 0)
return mc;
- log_assert(msg1->qnamesize == msg2->qnamesize);
+ log_assert(msg1->qname_len == msg2->qname_len);
COMPARE_IT(msg1->has_cd, msg2->has_cd);
COMPARE_IT(msg1->qclass, msg2->qclass);
return 0;
struct query_info* q = (struct query_info*)k;
struct reply_info* r = (struct reply_info*)d;
size_t s = sizeof(struct msgreply_entry) + sizeof(struct reply_info)
- + q->qnamesize;
+ + q->qname_len;
s += (r->rrset_count-1) * sizeof(struct rrset_ref);
s += r->rrset_count * sizeof(struct ub_packed_rrset_key*);
return s;
/* insert query section */
if(rep->qdcount) {
if(ldns_buffer_remaining(buffer) <
- qinfo->qnamesize+sizeof(uint16_t)*2)
+ qinfo->qname_len+sizeof(uint16_t)*2)
return 0; /* buffer too small */
if(!compress_tree_store(&tree, qinfo->qname,
dname_count_labels(qinfo->qname),
ldns_buffer_position(buffer), region, NULL))
return 0;
- ldns_buffer_write(buffer, qinfo->qname, qinfo->qnamesize);
+ ldns_buffer_write(buffer, qinfo->qname, qinfo->qname_len);
ldns_buffer_write_u16(buffer, qinfo->qtype);
ldns_buffer_write_u16(buffer, qinfo->qclass);
}
lock_protect(&e->entry.lock, &e->key, sizeof(e->key));
lock_protect(&e->entry.lock, &e->entry.hash, sizeof(e->entry.hash) +
sizeof(e->entry.key) + sizeof(e->entry.data));
- lock_protect(&e->entry.lock, e->key.qname, e->key.qnamesize);
+ lock_protect(&e->entry.lock, e->key.qname, e->key.qname_len);
q->qname = NULL;
return e;
}
ldns_buffer_write_u16(pkt, flags);
ldns_buffer_write_u16(pkt, 1); /* query count */
ldns_buffer_write(pkt, "\000\000\000\000\000\000", 6); /* counts */
- ldns_buffer_write(pkt, qinfo->qname, qinfo->qnamesize);
+ ldns_buffer_write(pkt, qinfo->qname, qinfo->qname_len);
ldns_buffer_write_u16(pkt, qinfo->qtype);
ldns_buffer_write_u16(pkt, qinfo->qclass);
ldns_buffer_flip(pkt);