util/data/msgencode.c

46 #include "util/data/dname.h"
86 	uint8_t* dname;
89 	/** offset in packet that points to this dname */
96  * @param dname: pointer to uncompressed dname.
99  *	guaranteed to be smaller or equal to the sought dname.
103  * @param insertpt: insert location for dname, if not found.
107 compress_tree_search(struct compress_tree_node** tree, uint8_t* dname,
116 		if((c = dname_lab_cmp(dname, labs, p->dname, p->labs, &n))
127 			close = p; /* p->dname is smaller than dname */
141  * @param dname: pointer to uncompressed dname.
143  * @param insertpt: insert location for dname, if not found.
147 compress_tree_lookup(struct compress_tree_node** tree, uint8_t* dname,
154 	if(compress_tree_search(tree, dname, labs, &p, &m, insertpt)) {
171  * @param dname: pointer to uncompressed dname (stored in tree).
172  * @param labs: number of labels in dname.
173  * @param offset: offset into packet for dname.
178 compress_tree_newnode(uint8_t* dname, int labs, size_t offset,
187 	n->dname = dname;
195  * @param dname: pointer to uncompressed dname (stored in tree).
196  * @param labs: number of labels in dname.
197  * @param offset: offset into packet for dname.
199  * @param closest: match from previous lookup, used to compress dname.
201  *	if the tree has an ancestor of dname already, this must be it.
202  * @param insertpt: where to insert the dname in tree.
206 compress_tree_store(uint8_t* dname, int labs, size_t offset,
216 	/* algorithms builds up a vine of dname-labels to hang into tree */
222 		if(!(newnode = compress_tree_newnode(dname, labs, offset,
236 		lablen = *dname++;
237 		dname += lablen;
252 write_compressed_dname(sldns_buffer* pkt, uint8_t* dname, int labs,
270 		lablen = *dname++;
274 		sldns_buffer_write(pkt, dname, lablen);
275 		dname += lablen;
294 		/* compress first time dname */
295 		if((p = compress_tree_lookup(tree, key->rk.dname,
301 			if(!write_compressed_dname(pkt, key->rk.dname,
311 			sldns_buffer_write(pkt, key->rk.dname,
316 		if(!compress_tree_store(key->rk.dname, owner_labs,
336 compress_any_dname(uint8_t* dname, sldns_buffer* pkt, int labs,
342 	if((p = compress_tree_lookup(tree, dname, labs, &insertpt))) {
343 		if(!write_compressed_dname(pkt, dname, labs, p))
346 		if(!dname_buffer_write(pkt, dname))
349 	if(!compress_tree_store(dname, labs, pos, region, p, insertpt))
465 	owner_labs = dname_count_labels(key->rk.dname);
513 				if((r=compress_any_dname(key->rk.dname,
603 		qinfo->local_alias->rrset->rk.dname : qinfo->qname;
1055 		qinfo->local_alias->rrset->rk.dname : qinfo->qname;
1092 			qinfo->local_alias->rrset->rk.dname : qinfo->qname;