166 				   const struct bpf_lpm_trie_key *key)  in longest_prefix_match()  argument
168 	u32 limit = min(node->prefixlen, key->prefixlen);  in longest_prefix_match()
181 				       *(__be64 *)key->data);  in longest_prefix_match()
194 				       *(__be32 *)&key->data[i]);  in longest_prefix_match()
206 				       *(__be16 *)&key->data[i]);  in longest_prefix_match()
217 		prefixlen += 8 - fls(node->data[i] ^ key->data[i]);  in longest_prefix_match()
231 	struct bpf_lpm_trie_key *key = _key;  in trie_lookup_elem()  local
233 	if (key->prefixlen > trie->max_prefixlen)  in trie_lookup_elem()
246 		matchlen = longest_prefix_match(trie, node, key);  in trie_lookup_elem()
269 		next_bit = extract_bit(key->data, node->prefixlen);  in trie_lookup_elem()
309 	struct bpf_lpm_trie_key *key = _key;  in trie_update_elem()  local
318 	if (key->prefixlen > trie->max_prefixlen)  in trie_update_elem()
338 	new_node->prefixlen = key->prefixlen;  in trie_update_elem()
341 	memcpy(new_node->data, key->data, trie->data_size);  in trie_update_elem()
352 		matchlen = longest_prefix_match(trie, node, key);  in trie_update_elem()
355 		    node->prefixlen == key->prefixlen ||  in trie_update_elem()
359 		next_bit = extract_bit(key->data, node->prefixlen);  in trie_update_elem()
390 	if (matchlen == key->prefixlen) {  in trie_update_elem()
408 	if (extract_bit(key->data, matchlen)) {  in trie_update_elem()
437 	struct bpf_lpm_trie_key *key = _key;  in trie_delete_elem()  local
445 	if (key->prefixlen > trie->max_prefixlen)  in trie_delete_elem()
461 		matchlen = longest_prefix_match(trie, node, key);  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()
637 	struct bpf_lpm_trie_key *key = _key, *next_key = _next_key;  in trie_get_next_key()  local
660 	if (!key || key->prefixlen > trie->max_prefixlen)  in trie_get_next_key()
672 		matchlen = longest_prefix_match(trie, node, key);  in trie_get_next_key()
674 		    node->prefixlen == key->prefixlen)  in trie_get_next_key()
677 		next_bit = extract_bit(key->data, node->prefixlen);  in trie_get_next_key()
680 	if (!node || node->prefixlen != key->prefixlen ||  in trie_get_next_key()