Lines Matching refs:pn
937 struct key_vector *pn, *n = t->kv; in fib_find_node() local
941 pn = n; in fib_find_node()
971 *tp = pn; in fib_find_node()
1403 struct key_vector *n, *pn; in fib_table_lookup() local
1408 pn = t->kv; in fib_table_lookup()
1411 n = get_child_rcu(pn, cindex); in fib_table_lookup()
1450 pn = n; in fib_table_lookup()
1492 t_key pkey = pn->key; in fib_table_lookup()
1498 if (IS_TRIE(pn)) { in fib_table_lookup()
1507 pn = node_parent_rcu(pn); in fib_table_lookup()
1508 cindex = get_index(pkey, pn); in fib_table_lookup()
1515 cptr = &pn->tnode[cindex]; in fib_table_lookup()
1733 struct key_vector *pn, *n = *tn; in leaf_walk_rcu() local
1739 pn = n; in leaf_walk_rcu()
1740 cindex = (key > pn->key) ? get_index(key, pn) : 0; in leaf_walk_rcu()
1742 if (cindex >> pn->bits) in leaf_walk_rcu()
1746 n = get_child_rcu(pn, cindex++); in leaf_walk_rcu()
1756 while (!IS_TRIE(pn)) { in leaf_walk_rcu()
1758 if (cindex >= (1ul << pn->bits)) { in leaf_walk_rcu()
1759 t_key pkey = pn->key; in leaf_walk_rcu()
1761 pn = node_parent_rcu(pn); in leaf_walk_rcu()
1762 cindex = get_index(pkey, pn) + 1; in leaf_walk_rcu()
1767 n = get_child_rcu(pn, cindex++); in leaf_walk_rcu()
1776 pn = n; in leaf_walk_rcu()
1780 *tn = pn; in leaf_walk_rcu()
1784 *tn = pn; in leaf_walk_rcu()
1791 struct key_vector *pn = t->kv; in fib_trie_free() local
1801 t_key pkey = pn->key; in fib_trie_free()
1803 if (IS_TRIE(pn)) in fib_trie_free()
1806 n = pn; in fib_trie_free()
1807 pn = node_parent(pn); in fib_trie_free()
1810 put_child_root(pn, n->key, NULL); in fib_trie_free()
1813 cindex = get_index(pkey, pn); in fib_trie_free()
1819 n = get_child(pn, cindex); in fib_trie_free()
1825 pn = n; in fib_trie_free()
1836 put_child_root(pn, n->key, NULL); in fib_trie_free()
1908 struct key_vector *pn = t->kv; in fib_table_flush_external() local
1919 t_key pkey = pn->key; in fib_table_flush_external()
1922 if (IS_TRIE(pn)) in fib_table_flush_external()
1926 if (pn->slen > pn->pos) in fib_table_flush_external()
1927 update_suffix(pn); in fib_table_flush_external()
1930 pn = resize(t, pn); in fib_table_flush_external()
1931 cindex = get_index(pkey, pn); in fib_table_flush_external()
1937 n = get_child(pn, cindex); in fib_table_flush_external()
1943 pn = n; in fib_table_flush_external()
1967 put_child_root(pn, n->key, NULL); in fib_table_flush_external()
1977 struct key_vector *pn = t->kv; in fib_table_flush() local
1989 t_key pkey = pn->key; in fib_table_flush()
1992 if (IS_TRIE(pn)) in fib_table_flush()
1996 if (pn->slen > pn->pos) in fib_table_flush()
1997 update_suffix(pn); in fib_table_flush()
2000 pn = resize(t, pn); in fib_table_flush()
2001 cindex = get_index(pkey, pn); in fib_table_flush()
2007 n = get_child(pn, cindex); in fib_table_flush()
2013 pn = n; in fib_table_flush()
2049 put_child_root(pn, n->key, NULL); in fib_table_flush()
2063 struct key_vector *pn = t->kv; in __fib_info_notify_update() local
2071 t_key pkey = pn->key; in __fib_info_notify_update()
2073 if (IS_TRIE(pn)) in __fib_info_notify_update()
2076 pn = node_parent(pn); in __fib_info_notify_update()
2077 cindex = get_index(pkey, pn); in __fib_info_notify_update()
2082 n = get_child(pn, cindex); in __fib_info_notify_update()
2088 pn = n; in __fib_info_notify_update()
2408 struct key_vector *pn = iter->tnode; in fib_trie_get_next() local
2414 while (!IS_TRIE(pn)) { in fib_trie_get_next()
2415 while (cindex < child_length(pn)) { in fib_trie_get_next()
2416 struct key_vector *n = get_child_rcu(pn, cindex++); in fib_trie_get_next()
2422 iter->tnode = pn; in fib_trie_get_next()
2435 pkey = pn->key; in fib_trie_get_next()
2436 pn = node_parent_rcu(pn); in fib_trie_get_next()
2437 cindex = get_index(pkey, pn) + 1; in fib_trie_get_next()
2442 iter->tnode = pn; in fib_trie_get_next()
2451 struct key_vector *n, *pn; in fib_trie_get_first() local
2456 pn = t->kv; in fib_trie_get_first()
2457 n = rcu_dereference(pn->tnode[0]); in fib_trie_get_first()
2466 iter->tnode = pn; in fib_trie_get_first()