439 	struct lpm_trie_node *node, *parent;  in trie_delete_elem()  local
458 	parent = NULL;  in trie_delete_elem()
467 		parent = node;  in trie_delete_elem()
498 	if (parent && (parent->flags & LPM_TREE_NODE_FLAG_IM) &&  in trie_delete_elem()
500 		if (node == rcu_access_pointer(parent->child[0]))  in trie_delete_elem()
502 				*trim2, rcu_access_pointer(parent->child[1]));  in trie_delete_elem()
505 				*trim2, rcu_access_pointer(parent->child[0]));  in trie_delete_elem()
506 		kfree_rcu(parent, rcu);  in trie_delete_elem()
630 	struct lpm_trie_node *node, *next_node = NULL, *parent, *search_root;  in trie_get_next_key()  local
684 		parent = node_stack[stack_ptr - 1];  in trie_get_next_key()
685 		if (rcu_dereference(parent->child[0]) == node) {  in trie_get_next_key()
686 			search_root = rcu_dereference(parent->child[1]);  in trie_get_next_key()
690 		if (!(parent->flags & LPM_TREE_NODE_FLAG_IM)) {  in trie_get_next_key()
691 			next_node = parent;  in trie_get_next_key()
695 		node = parent;  in trie_get_next_key()