Lines Matching defs:dname

46 #include "util/data/dname.h"
90 	uint8_t* dname;
93 	/** offset in packet that points to this dname */
100  * @param dname: pointer to uncompressed dname.
103  *	guaranteed to be smaller or equal to the sought dname.
107  * @param insertpt: insert location for dname, if not found.
111 compress_tree_search(struct compress_tree_node** tree, uint8_t* dname,
120 		if((c = dname_lab_cmp(dname, labs, p->dname, p->labs, &n)) 
131 			close = p; /* p->dname is smaller than dname */
145  * @param dname: pointer to uncompressed dname.
147  * @param insertpt: insert location for dname, if not found.
151 compress_tree_lookup(struct compress_tree_node** tree, uint8_t* dname,
158 	if(compress_tree_search(tree, dname, labs, &p, &m, insertpt)) {
175  * @param dname: pointer to uncompressed dname (stored in tree).
176  * @param labs: number of labels in dname.
177  * @param offset: offset into packet for dname.
182 compress_tree_newnode(uint8_t* dname, int labs, size_t offset, 
191 	n->dname = dname;
199  * @param dname: pointer to uncompressed dname (stored in tree).
200  * @param labs: number of labels in dname.
201  * @param offset: offset into packet for dname.
203  * @param closest: match from previous lookup, used to compress dname.
205  *	if the tree has an ancestor of dname already, this must be it.
206  * @param insertpt: where to insert the dname in tree. 
210 compress_tree_store(uint8_t* dname, int labs, size_t offset, 
220 	/* algorithms builds up a vine of dname-labels to hang into tree */
226 		if(!(newnode = compress_tree_newnode(dname, labs, offset, 
240 		lablen = *dname++;
241 		dname += lablen;
256 write_compressed_dname(sldns_buffer* pkt, uint8_t* dname, int labs,
274 		lablen = *dname++;
278 		sldns_buffer_write(pkt, dname, lablen);
279 		dname += lablen;
299 		/* compress first time dname */
301 			(p = compress_tree_lookup(tree, key->rk.dname,
307 			if(!write_compressed_dname(pkt, key->rk.dname, 
318 			sldns_buffer_write(pkt, key->rk.dname, 
324 			!compress_tree_store(key->rk.dname, owner_labs,
344 compress_any_dname(uint8_t* dname, sldns_buffer* pkt, int labs,
352 		(p = compress_tree_lookup(tree, dname, labs, &insertpt))) {
353 		if(!write_compressed_dname(pkt, dname, labs, p))
357 		if(!dname_buffer_write(pkt, dname))
361 		!compress_tree_store(dname, labs, pos, region, p, insertpt))
478 	owner_labs = dname_count_labels(key->rk.dname);
526 				if((r=compress_any_dname(key->rk.dname,
617 		qinfo->local_alias->rrset->rk.dname : qinfo->qname;
1070 		qinfo->local_alias->rrset->rk.dname : qinfo->qname;
1107 			qinfo->local_alias->rrset->rk.dname : qinfo->qname;