Lines Matching refs:node
167 const struct lpm_trie_node *node, in __longest_prefix_match() argument
170 u32 limit = min(node->prefixlen, key->prefixlen); in __longest_prefix_match()
182 u64 diff = be64_to_cpu(*(__be64 *)node->data ^ in __longest_prefix_match()
195 u32 diff = be32_to_cpu(*(__be32 *)&node->data[i] ^ in __longest_prefix_match()
207 u16 diff = be16_to_cpu(*(__be16 *)&node->data[i] ^ in __longest_prefix_match()
219 prefixlen += 8 - fls(node->data[i] ^ key->data[i]); in __longest_prefix_match()
229 const struct lpm_trie_node *node, in longest_prefix_match() argument
232 return __longest_prefix_match(trie, node, key); in longest_prefix_match()
239 struct lpm_trie_node *node, *found = NULL; in trie_lookup_elem() local
247 for (node = rcu_dereference_check(trie->root, rcu_read_lock_bh_held()); in trie_lookup_elem()
248 node;) { in trie_lookup_elem()
256 matchlen = __longest_prefix_match(trie, node, key); in trie_lookup_elem()
258 found = node; in trie_lookup_elem()
266 if (matchlen < node->prefixlen) in trie_lookup_elem()
272 if (!(node->flags & LPM_TREE_NODE_FLAG_IM)) in trie_lookup_elem()
273 found = node; in trie_lookup_elem()
279 next_bit = extract_bit(key->data, node->prefixlen); in trie_lookup_elem()
280 node = rcu_dereference_check(node->child[next_bit], in trie_lookup_elem()
293 struct lpm_trie_node *node; in lpm_trie_node_alloc() local
299 node = bpf_map_kmalloc_node(&trie->map, size, GFP_NOWAIT | __GFP_NOWARN, in lpm_trie_node_alloc()
301 if (!node) in lpm_trie_node_alloc()
304 node->flags = 0; in lpm_trie_node_alloc()
307 memcpy(node->data + trie->data_size, value, in lpm_trie_node_alloc()
310 return node; in lpm_trie_node_alloc()
328 struct lpm_trie_node *node, *im_node, *new_node = NULL; in trie_update_elem() local
364 while ((node = rcu_dereference_protected(*slot, in trie_update_elem()
366 matchlen = longest_prefix_match(trie, node, key); in trie_update_elem()
368 if (node->prefixlen != matchlen || in trie_update_elem()
369 node->prefixlen == key->prefixlen || in trie_update_elem()
370 node->prefixlen == trie->max_prefixlen) in trie_update_elem()
373 next_bit = extract_bit(key->data, node->prefixlen); in trie_update_elem()
374 slot = &node->child[next_bit]; in trie_update_elem()
380 if (!node) { in trie_update_elem()
392 if (node->prefixlen == matchlen) { in trie_update_elem()
393 if (!(node->flags & LPM_TREE_NODE_FLAG_IM)) { in trie_update_elem()
404 new_node->child[0] = node->child[0]; in trie_update_elem()
405 new_node->child[1] = node->child[1]; in trie_update_elem()
408 free_node = node; in trie_update_elem()
421 next_bit = extract_bit(node->data, matchlen); in trie_update_elem()
422 rcu_assign_pointer(new_node->child[next_bit], node); in trie_update_elem()
436 memcpy(im_node->data, node->data, trie->data_size); in trie_update_elem()
440 rcu_assign_pointer(im_node->child[0], node); in trie_update_elem()
444 rcu_assign_pointer(im_node->child[1], node); in trie_update_elem()
466 struct lpm_trie_node *node, *parent; in trie_delete_elem() local
486 while ((node = rcu_dereference_protected( in trie_delete_elem()
488 matchlen = longest_prefix_match(trie, node, key); in trie_delete_elem()
490 if (node->prefixlen != matchlen || in trie_delete_elem()
491 node->prefixlen == key->prefixlen) in trie_delete_elem()
494 parent = node; in trie_delete_elem()
496 next_bit = extract_bit(key->data, node->prefixlen); in trie_delete_elem()
497 trim = &node->child[next_bit]; in trie_delete_elem()
500 if (!node || node->prefixlen != key->prefixlen || in trie_delete_elem()
501 node->prefixlen != matchlen || in trie_delete_elem()
502 (node->flags & LPM_TREE_NODE_FLAG_IM)) { in trie_delete_elem()
512 if (rcu_access_pointer(node->child[0]) && in trie_delete_elem()
513 rcu_access_pointer(node->child[1])) { in trie_delete_elem()
514 node->flags |= LPM_TREE_NODE_FLAG_IM; in trie_delete_elem()
526 !node->child[0] && !node->child[1]) { in trie_delete_elem()
527 if (node == rcu_access_pointer(parent->child[0])) in trie_delete_elem()
534 free_node = node; in trie_delete_elem()
542 if (node->child[0]) in trie_delete_elem()
543 rcu_assign_pointer(*trim, rcu_access_pointer(node->child[0])); in trie_delete_elem()
544 else if (node->child[1]) in trie_delete_elem()
545 rcu_assign_pointer(*trim, rcu_access_pointer(node->child[1])); in trie_delete_elem()
548 free_node = node; in trie_delete_elem()
606 struct lpm_trie_node *node; in trie_free() local
617 node = rcu_dereference_protected(*slot, 1); in trie_free()
618 if (!node) in trie_free()
621 if (rcu_access_pointer(node->child[0])) { in trie_free()
622 slot = &node->child[0]; in trie_free()
626 if (rcu_access_pointer(node->child[1])) { in trie_free()
627 slot = &node->child[1]; in trie_free()
631 kfree(node); in trie_free()
643 struct lpm_trie_node *node, *next_node = NULL, *parent, *search_root; in trie_get_next_key() local
678 for (node = search_root; node;) { in trie_get_next_key()
679 node_stack[++stack_ptr] = node; in trie_get_next_key()
680 matchlen = longest_prefix_match(trie, node, key); in trie_get_next_key()
681 if (node->prefixlen != matchlen || in trie_get_next_key()
682 node->prefixlen == key->prefixlen) in trie_get_next_key()
685 next_bit = extract_bit(key->data, node->prefixlen); in trie_get_next_key()
686 node = rcu_dereference(node->child[next_bit]); in trie_get_next_key()
688 if (!node || node->prefixlen != matchlen || in trie_get_next_key()
689 (node->flags & LPM_TREE_NODE_FLAG_IM)) in trie_get_next_key()
695 node = node_stack[stack_ptr]; in trie_get_next_key()
698 if (rcu_dereference(parent->child[0]) == node) { in trie_get_next_key()
708 node = parent; in trie_get_next_key()
720 for (node = search_root; node;) { in trie_get_next_key()
721 if (node->flags & LPM_TREE_NODE_FLAG_IM) { in trie_get_next_key()
722 node = rcu_dereference(node->child[0]); in trie_get_next_key()
724 next_node = node; in trie_get_next_key()
725 node = rcu_dereference(node->child[0]); in trie_get_next_key()
726 if (!node) in trie_get_next_key()
727 node = rcu_dereference(next_node->child[1]); in trie_get_next_key()