Lines Matching refs:node
166 const struct lpm_trie_node *node, in longest_prefix_match() argument
169 u32 limit = min(node->prefixlen, key->prefixlen); in longest_prefix_match()
181 u64 diff = be64_to_cpu(*(__be64 *)node->data ^ in longest_prefix_match()
194 u32 diff = be32_to_cpu(*(__be32 *)&node->data[i] ^ in longest_prefix_match()
206 u16 diff = be16_to_cpu(*(__be16 *)&node->data[i] ^ in longest_prefix_match()
218 prefixlen += 8 - fls(node->data[i] ^ key->data[i]); in longest_prefix_match()
231 struct lpm_trie_node *node, *found = NULL; in trie_lookup_elem() local
239 for (node = rcu_dereference_check(trie->root, rcu_read_lock_bh_held()); in trie_lookup_elem()
240 node;) { in trie_lookup_elem()
248 matchlen = longest_prefix_match(trie, node, key); in trie_lookup_elem()
250 found = node; in trie_lookup_elem()
258 if (matchlen < node->prefixlen) in trie_lookup_elem()
264 if (!(node->flags & LPM_TREE_NODE_FLAG_IM)) in trie_lookup_elem()
265 found = node; in trie_lookup_elem()
271 next_bit = extract_bit(key->data, node->prefixlen); in trie_lookup_elem()
272 node = rcu_dereference_check(node->child[next_bit], in trie_lookup_elem()
285 struct lpm_trie_node *node; in lpm_trie_node_alloc() local
291 node = bpf_map_kmalloc_node(&trie->map, size, GFP_NOWAIT | __GFP_NOWARN, in lpm_trie_node_alloc()
293 if (!node) in lpm_trie_node_alloc()
296 node->flags = 0; in lpm_trie_node_alloc()
299 memcpy(node->data + trie->data_size, value, in lpm_trie_node_alloc()
302 return node; in lpm_trie_node_alloc()
310 struct lpm_trie_node *node, *im_node = NULL, *new_node = NULL; in trie_update_elem() local
354 while ((node = rcu_dereference_protected(*slot, in trie_update_elem()
356 matchlen = longest_prefix_match(trie, node, key); in trie_update_elem()
358 if (node->prefixlen != matchlen || in trie_update_elem()
359 node->prefixlen == key->prefixlen || in trie_update_elem()
360 node->prefixlen == trie->max_prefixlen) in trie_update_elem()
363 next_bit = extract_bit(key->data, node->prefixlen); in trie_update_elem()
364 slot = &node->child[next_bit]; in trie_update_elem()
370 if (!node) { in trie_update_elem()
378 if (node->prefixlen == matchlen) { in trie_update_elem()
379 new_node->child[0] = node->child[0]; in trie_update_elem()
380 new_node->child[1] = node->child[1]; in trie_update_elem()
382 if (!(node->flags & LPM_TREE_NODE_FLAG_IM)) in trie_update_elem()
386 free_node = node; in trie_update_elem()
395 next_bit = extract_bit(node->data, matchlen); in trie_update_elem()
396 rcu_assign_pointer(new_node->child[next_bit], node); in trie_update_elem()
409 memcpy(im_node->data, node->data, trie->data_size); in trie_update_elem()
413 rcu_assign_pointer(im_node->child[0], node); in trie_update_elem()
417 rcu_assign_pointer(im_node->child[1], node); in trie_update_elem()
445 struct lpm_trie_node *node, *parent; in trie_delete_elem() local
465 while ((node = rcu_dereference_protected( in trie_delete_elem()
467 matchlen = longest_prefix_match(trie, node, key); in trie_delete_elem()
469 if (node->prefixlen != matchlen || in trie_delete_elem()
470 node->prefixlen == key->prefixlen) in trie_delete_elem()
473 parent = node; in trie_delete_elem()
475 next_bit = extract_bit(key->data, node->prefixlen); in trie_delete_elem()
476 trim = &node->child[next_bit]; in trie_delete_elem()
479 if (!node || node->prefixlen != key->prefixlen || in trie_delete_elem()
480 node->prefixlen != matchlen || in trie_delete_elem()
481 (node->flags & LPM_TREE_NODE_FLAG_IM)) { in trie_delete_elem()
491 if (rcu_access_pointer(node->child[0]) && in trie_delete_elem()
492 rcu_access_pointer(node->child[1])) { in trie_delete_elem()
493 node->flags |= LPM_TREE_NODE_FLAG_IM; in trie_delete_elem()
505 !node->child[0] && !node->child[1]) { in trie_delete_elem()
506 if (node == rcu_access_pointer(parent->child[0])) in trie_delete_elem()
513 free_node = node; in trie_delete_elem()
521 if (node->child[0]) in trie_delete_elem()
522 rcu_assign_pointer(*trim, rcu_access_pointer(node->child[0])); in trie_delete_elem()
523 else if (node->child[1]) in trie_delete_elem()
524 rcu_assign_pointer(*trim, rcu_access_pointer(node->child[1])); in trie_delete_elem()
527 free_node = node; in trie_delete_elem()
585 struct lpm_trie_node *node; in trie_free() local
596 node = rcu_dereference_protected(*slot, 1); in trie_free()
597 if (!node) in trie_free()
600 if (rcu_access_pointer(node->child[0])) { in trie_free()
601 slot = &node->child[0]; in trie_free()
605 if (rcu_access_pointer(node->child[1])) { in trie_free()
606 slot = &node->child[1]; in trie_free()
610 kfree(node); in trie_free()
622 struct lpm_trie_node *node, *next_node = NULL, *parent, *search_root; in trie_get_next_key() local
657 for (node = search_root; node;) { in trie_get_next_key()
658 node_stack[++stack_ptr] = node; in trie_get_next_key()
659 matchlen = longest_prefix_match(trie, node, key); in trie_get_next_key()
660 if (node->prefixlen != matchlen || 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()
665 node = rcu_dereference(node->child[next_bit]); in trie_get_next_key()
667 if (!node || node->prefixlen != key->prefixlen || in trie_get_next_key()
668 (node->flags & LPM_TREE_NODE_FLAG_IM)) in trie_get_next_key()
674 node = node_stack[stack_ptr]; in trie_get_next_key()
677 if (rcu_dereference(parent->child[0]) == node) { in trie_get_next_key()
687 node = parent; in trie_get_next_key()
699 for (node = search_root; node;) { in trie_get_next_key()
700 if (node->flags & LPM_TREE_NODE_FLAG_IM) { in trie_get_next_key()
701 node = rcu_dereference(node->child[0]); in trie_get_next_key()
703 next_node = node; in trie_get_next_key()
704 node = rcu_dereference(node->child[0]); in trie_get_next_key()
705 if (!node) in trie_get_next_key()
706 node = rcu_dereference(next_node->child[1]); in trie_get_next_key()