92 	int labs;  member
112 	int labs, struct compress_tree_node** match, int* matchlabels,  in compress_tree_search()  argument
120 		if((c = dname_lab_cmp(dname, labs, p->dname, p->labs, &n))   in compress_tree_search()
152 	int labs, struct compress_tree_node*** insertpt)  in compress_tree_lookup()  argument
156 	if(labs <= 1)  in compress_tree_lookup()
158 	if(compress_tree_search(tree, dname, labs, &p, &m, insertpt)) {  in compress_tree_lookup()
166 		while(p && p->labs > m)  in compress_tree_lookup()
182 compress_tree_newnode(uint8_t* dname, int labs, size_t offset,   in compress_tree_newnode()  argument
192 	n->labs = labs;  in compress_tree_newnode()
210 compress_tree_store(uint8_t* dname, int labs, size_t offset,   in compress_tree_store()  argument
217 	int uplabs = labs-1; /* does not store root in tree */  in compress_tree_store()
218 	if(closest) uplabs = labs - closest->labs;  in compress_tree_store()
226 		if(!(newnode = compress_tree_newnode(dname, labs, offset,   in compress_tree_store()
244 		labs--;  in compress_tree_store()
256 write_compressed_dname(sldns_buffer* pkt, uint8_t* dname, int labs,  in write_compressed_dname()  argument
260 	int labcopy = labs - p->labs;  in write_compressed_dname()
264 	if(labs == 1) {  in write_compressed_dname()
303 			if(p->labs == owner_labs)   in compress_owner()
344 compress_any_dname(uint8_t* dname, sldns_buffer* pkt, int labs,  in compress_any_dname()  argument
352 		(p = compress_tree_lookup(tree, dname, labs, &insertpt))) {  in compress_any_dname()
353 		if(!write_compressed_dname(pkt, dname, labs, p))  in compress_any_dname()
361 		!compress_tree_store(dname, labs, pos, region, p, insertpt))  in compress_any_dname()
383 	int labs, r, rdf = 0;  in compress_rdata()  local
394 			labs = dname_count_size_labels(rdata, &dname_len);  in compress_rdata()
395 			if((r=compress_any_dname(rdata, pkt, labs, region,  in compress_rdata()