kernel/bpf/lpm_trie.c

252 		size_t matchlen;
258 		matchlen = __longest_prefix_match(trie, node, key);
259 		if (matchlen == trie->max_prefixlen) {
268 		if (matchlen < node->prefixlen)
332 	size_t matchlen = 0;
363 		matchlen = longest_prefix_match(trie, node, key);
365 		if (node->prefixlen != matchlen ||
388 	if (node->prefixlen == matchlen) {
416 	if (matchlen == key->prefixlen) {
417 		next_bit = extract_bit(node->data, matchlen);
430 	im_node->prefixlen = matchlen;
435 	if (extract_bit(key->data, matchlen)) {
466 	size_t matchlen = 0;
486 		matchlen = longest_prefix_match(trie, node, key);
488 		if (node->prefixlen != matchlen ||
499 	    node->prefixlen != matchlen ||
664 	size_t matchlen = 0;
695 		matchlen = longest_prefix_match(trie, node, key);
696 		if (node->prefixlen != matchlen ||
703 	if (!node || node->prefixlen != matchlen ||