Lines Matching defs:prefixlen
28 u32 prefixlen;
172 u32 limit = min(node->prefixlen, key->prefixlen);
173 u32 prefixlen = 0, i = 0;
187 prefixlen = 64 - fls64(diff);
188 if (prefixlen >= limit)
191 return prefixlen;
200 prefixlen += 32 - fls(diff);
201 if (prefixlen >= limit)
204 return prefixlen;
212 prefixlen += 16 - fls(diff);
213 if (prefixlen >= limit)
216 return prefixlen;
221 prefixlen += 8 - fls(node->data[i] ^ key->data[i]);
223 if (prefixlen >= limit)
227 return prefixlen;
244 if (key->prefixlen > trie->max_prefixlen)
268 if (matchlen < node->prefixlen)
281 next_bit = extract_bit(key->data, node->prefixlen);
338 if (key->prefixlen > trie->max_prefixlen)
350 new_node->prefixlen = key->prefixlen;
365 if (node->prefixlen != matchlen ||
366 node->prefixlen == key->prefixlen)
369 next_bit = extract_bit(key->data, node->prefixlen);
388 if (node->prefixlen == matchlen) {
416 if (matchlen == key->prefixlen) {
430 im_node->prefixlen = matchlen;
469 if (key->prefixlen > trie->max_prefixlen)
488 if (node->prefixlen != matchlen ||
489 node->prefixlen == key->prefixlen)
494 next_bit = extract_bit(key->data, node->prefixlen);
498 if (!node || node->prefixlen != key->prefixlen ||
499 node->prefixlen != matchlen ||
683 if (!key || key->prefixlen > trie->max_prefixlen)
696 if (node->prefixlen != matchlen ||
697 node->prefixlen == key->prefixlen)
700 next_bit = extract_bit(key->data, node->prefixlen);
703 if (!node || node->prefixlen != matchlen ||
746 next_key->prefixlen = next_node->prefixlen;