167 				   const struct bpf_lpm_trie_key_u8 *key)  in longest_prefix_match()  argument
169 	u32 limit = min(node->prefixlen, key->prefixlen);  in longest_prefix_match()
182 				       *(__be64 *)key->data);  in longest_prefix_match()
195 				       *(__be32 *)&key->data[i]);  in longest_prefix_match()
207 				       *(__be16 *)&key->data[i]);  in longest_prefix_match()
218 		prefixlen += 8 - fls(node->data[i] ^ key->data[i]);  in longest_prefix_match()
232 	struct bpf_lpm_trie_key_u8 *key = _key;  in trie_lookup_elem()  local
234 	if (key->prefixlen > trie->max_prefixlen)  in trie_lookup_elem()
248 		matchlen = longest_prefix_match(trie, node, key);  in trie_lookup_elem()
271 		next_bit = extract_bit(key->data, node->prefixlen);  in trie_lookup_elem()
313 	struct bpf_lpm_trie_key_u8 *key = _key;  in trie_update_elem()  local
322 	if (key->prefixlen > trie->max_prefixlen)  in trie_update_elem()
342 	new_node->prefixlen = key->prefixlen;  in trie_update_elem()
345 	memcpy(new_node->data, key->data, trie->data_size);  in trie_update_elem()
356 		matchlen = longest_prefix_match(trie, node, key);  in trie_update_elem()
359 		    node->prefixlen == key->prefixlen ||  in trie_update_elem()
363 		next_bit = extract_bit(key->data, node->prefixlen);  in trie_update_elem()
394 	if (matchlen == key->prefixlen) {  in trie_update_elem()
412 	if (extract_bit(key->data, matchlen)) {  in trie_update_elem()
443 	struct bpf_lpm_trie_key_u8 *key = _key;  in trie_delete_elem()  local
451 	if (key->prefixlen > trie->max_prefixlen)  in trie_delete_elem()
467 		matchlen = longest_prefix_match(trie, node, key);  in trie_delete_elem()
470 		    node->prefixlen == key->prefixlen)  in trie_delete_elem()
475 		next_bit = extract_bit(key->data, node->prefixlen);  in trie_delete_elem()
479 	if (!node || node->prefixlen != key->prefixlen ||  in trie_delete_elem()
624 	struct bpf_lpm_trie_key_u8 *key = _key, *next_key = _next_key;  in trie_get_next_key()  local
647 	if (!key || key->prefixlen > trie->max_prefixlen)  in trie_get_next_key()
659 		matchlen = longest_prefix_match(trie, node, key);  in trie_get_next_key()
661 		    node->prefixlen == key->prefixlen)  in trie_get_next_key()
664 		next_bit = extract_bit(key->data, node->prefixlen);  in trie_get_next_key()
667 	if (!node || node->prefixlen != key->prefixlen ||  in trie_get_next_key()