kernel/bpf/lpm_trie.c

27 	u32				prefixlen;
169 	u32 limit = min(node->prefixlen, key->prefixlen);
170 	u32 prefixlen = 0, i = 0;
184 		prefixlen = 64 - fls64(diff);
185 		if (prefixlen >= limit)
188 			return prefixlen;
197 		prefixlen += 32 - fls(diff);
198 		if (prefixlen >= limit)
201 			return prefixlen;
209 		prefixlen += 16 - fls(diff);
210 		if (prefixlen >= limit)
213 			return prefixlen;
218 		prefixlen += 8 - fls(node->data[i] ^ key->data[i]);
220 		if (prefixlen >= limit)
224 	return prefixlen;
234 	if (key->prefixlen > trie->max_prefixlen)
258 		if (matchlen < node->prefixlen)
271 		next_bit = extract_bit(key->data, node->prefixlen);
321 	if (key->prefixlen > trie->max_prefixlen)
341 	new_node->prefixlen = key->prefixlen;
357 		if (node->prefixlen != matchlen ||
358 		    node->prefixlen == key->prefixlen ||
359 		    node->prefixlen == trie->max_prefixlen)
362 		next_bit = extract_bit(key->data, node->prefixlen);
377 	if (node->prefixlen == matchlen) {
393 	if (matchlen == key->prefixlen) {
406 	im_node->prefixlen = matchlen;
448 	if (key->prefixlen > trie->max_prefixlen)
466 		if (node->prefixlen != matchlen ||
467 		    node->prefixlen == key->prefixlen)
472 		next_bit = extract_bit(key->data, node->prefixlen);
476 	if (!node || node->prefixlen != key->prefixlen ||
477 	    node->prefixlen != matchlen ||
642 	if (!key || key->prefixlen > trie->max_prefixlen)
655 		if (node->prefixlen != matchlen ||
656 		    node->prefixlen == key->prefixlen)
659 		next_bit = extract_bit(key->data, node->prefixlen);
662 	if (!node || node->prefixlen != key->prefixlen ||
705 	next_key->prefixlen = next_node->prefixlen;