Lines Matching refs:prefixlen

27 	u32				prefixlen;  member
169 u32 limit = min(node->prefixlen, key->prefixlen); in longest_prefix_match()
170 u32 prefixlen = 0, i = 0; in longest_prefix_match() local
184 prefixlen = 64 - fls64(diff); in longest_prefix_match()
185 if (prefixlen >= limit) in longest_prefix_match()
188 return prefixlen; in longest_prefix_match()
197 prefixlen += 32 - fls(diff); in longest_prefix_match()
198 if (prefixlen >= limit) in longest_prefix_match()
201 return prefixlen; in longest_prefix_match()
209 prefixlen += 16 - fls(diff); in longest_prefix_match()
210 if (prefixlen >= limit) in longest_prefix_match()
213 return prefixlen; in longest_prefix_match()
218 prefixlen += 8 - fls(node->data[i] ^ key->data[i]); in longest_prefix_match()
220 if (prefixlen >= limit) in longest_prefix_match()
224 return prefixlen; in longest_prefix_match()
255 if (matchlen < node->prefixlen) in trie_lookup_elem()
268 next_bit = extract_bit(key->data, node->prefixlen); in trie_lookup_elem()
318 if (key->prefixlen > trie->max_prefixlen) in trie_update_elem()
338 new_node->prefixlen = key->prefixlen; in trie_update_elem()
354 if (node->prefixlen != matchlen || in trie_update_elem()
355 node->prefixlen == key->prefixlen || in trie_update_elem()
356 node->prefixlen == trie->max_prefixlen) in trie_update_elem()
359 next_bit = extract_bit(key->data, node->prefixlen); in trie_update_elem()
374 if (node->prefixlen == matchlen) { in trie_update_elem()
390 if (matchlen == key->prefixlen) { in trie_update_elem()
403 im_node->prefixlen = matchlen; in trie_update_elem()
445 if (key->prefixlen > trie->max_prefixlen) in trie_delete_elem()
463 if (node->prefixlen != matchlen || in trie_delete_elem()
464 node->prefixlen == key->prefixlen) in trie_delete_elem()
469 next_bit = extract_bit(key->data, node->prefixlen); in trie_delete_elem()
473 if (!node || node->prefixlen != key->prefixlen || in trie_delete_elem()
474 node->prefixlen != matchlen || in trie_delete_elem()
642 if (!key || key->prefixlen > trie->max_prefixlen) in trie_get_next_key()
655 if (node->prefixlen != matchlen || in trie_get_next_key()
656 node->prefixlen == key->prefixlen) in trie_get_next_key()
659 next_bit = extract_bit(key->data, node->prefixlen); in trie_get_next_key()
662 if (!node || node->prefixlen != key->prefixlen || in trie_get_next_key()
705 next_key->prefixlen = next_node->prefixlen; in trie_get_next_key()