Lines Matching defs:labs
92 int labs;
101 * @param labs: number of labels in domain name.
112 int labs, struct compress_tree_node** match, int* matchlabels,
120 if((c = dname_lab_cmp(dname, labs, p->dname, p->labs, &n))
146 * @param labs: number of labels in domain name.
152 int labs, struct compress_tree_node*** insertpt)
156 if(labs <= 1)
158 if(compress_tree_search(tree, dname, labs, &p, &m, insertpt)) {
164 /* www.example.com. (labs=4) matched foo.example.com.(labs=4)
166 while(p && p->labs > m)
176 * @param labs: number of labels in dname.
182 compress_tree_newnode(uint8_t* dname, int labs, size_t offset,
192 n->labs = labs;
200 * @param labs: number of labels in dname.
210 compress_tree_store(uint8_t* dname, int labs, size_t offset,
217 int uplabs = labs-1; /* does not store root in tree */
218 if(closest) uplabs = labs - closest->labs;
226 if(!(newnode = compress_tree_newnode(dname, labs, offset,
244 labs--;
256 write_compressed_dname(sldns_buffer* pkt, uint8_t* dname, int labs,
260 int labcopy = labs - p->labs;
264 if(labs == 1) {
303 if(p->labs == 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))
361 !compress_tree_store(dname, labs, pos, region, p, insertpt))
383 int labs, r, rdf = 0;
394 labs = dname_count_size_labels(rdata, &dname_len);
395 if((r=compress_any_dname(rdata, pkt, labs, region,