Lines Matching refs:labs
82 int labs;
91 * @param labs: number of labels in domain name.
102 int labs, struct compress_tree_node** match, int* matchlabels,
110 if((c = dname_lab_cmp(dname, labs, p->dname, p->labs, &n))
136 * @param labs: number of labels in domain name.
142 int labs, struct compress_tree_node*** insertpt)
146 if(labs <= 1)
148 if(compress_tree_search(tree, dname, labs, &p, &m, insertpt)) {
154 /* www.example.com. (labs=4) matched foo.example.com.(labs=4)
156 while(p && p->labs > m)
166 * @param labs: number of labels in dname.
172 compress_tree_newnode(uint8_t* dname, int labs, size_t offset,
182 n->labs = labs;
190 * @param labs: number of labels in dname.
200 compress_tree_store(uint8_t* dname, int labs, size_t offset,
207 int uplabs = labs-1; /* does not store root in tree */
208 if(closest) uplabs = labs - closest->labs;
216 if(!(newnode = compress_tree_newnode(dname, labs, offset,
234 labs--;
246 write_compressed_dname(sldns_buffer* pkt, uint8_t* dname, int labs,
250 int labcopy = labs - p->labs;
254 if(labs == 1) {
291 if(p->labs == owner_labs)
330 compress_any_dname(uint8_t* dname, sldns_buffer* pkt, int labs,
336 if((p = compress_tree_lookup(tree, dname, labs, &insertpt))) {
337 if(!write_compressed_dname(pkt, dname, labs, p))
343 if(!compress_tree_store(dname, labs, pos, region, p, insertpt))
365 int labs, r, rdf = 0;
376 labs = dname_count_size_labels(rdata, &dname_len);
377 if((r=compress_any_dname(rdata, pkt, labs, region,