29 	u32				prefixlen;  member
171 	size_t prefixlen = 0;  in longest_prefix_match()  local
178 		prefixlen += b;  in longest_prefix_match()
180 		if (prefixlen >= node->prefixlen || prefixlen >= key->prefixlen)  in longest_prefix_match()
181 			return min(node->prefixlen, key->prefixlen);  in longest_prefix_match()
187 	return prefixlen;  in longest_prefix_match()
217 		if (matchlen < node->prefixlen)  in trie_lookup_elem()
230 		next_bit = extract_bit(key->data, node->prefixlen);  in trie_lookup_elem()
279 	if (key->prefixlen > trie->max_prefixlen)  in trie_update_elem()
299 	new_node->prefixlen = key->prefixlen;  in trie_update_elem()
315 		if (node->prefixlen != matchlen ||  in trie_update_elem()
316 		    node->prefixlen == key->prefixlen ||  in trie_update_elem()
317 		    node->prefixlen == trie->max_prefixlen)  in trie_update_elem()
320 		next_bit = extract_bit(key->data, node->prefixlen);  in trie_update_elem()
335 	if (node->prefixlen == matchlen) {  in trie_update_elem()
351 	if (matchlen == key->prefixlen) {  in trie_update_elem()
364 	im_node->prefixlen = matchlen;  in trie_update_elem()
406 	if (key->prefixlen > trie->max_prefixlen)  in trie_delete_elem()
424 		if (node->prefixlen != matchlen ||  in trie_delete_elem()
425 		    node->prefixlen == key->prefixlen)  in trie_delete_elem()
430 		next_bit = extract_bit(key->data, node->prefixlen);  in trie_delete_elem()
434 	if (!node || node->prefixlen != key->prefixlen ||  in trie_delete_elem()
625 	if (!key || key->prefixlen > trie->max_prefixlen)  in trie_get_next_key()
638 		if (node->prefixlen != matchlen ||  in trie_get_next_key()
639 		    node->prefixlen == key->prefixlen)  in trie_get_next_key()
642 		next_bit = extract_bit(key->data, node->prefixlen);  in trie_get_next_key()
645 	if (!node || node->prefixlen != key->prefixlen ||  in trie_get_next_key()
683 	next_key->prefixlen = next_node->prefixlen;  in trie_get_next_key()