Lines Matching refs:pn
938 struct key_vector *pn, *n = t->kv; in fib_find_node() local
942 pn = n; in fib_find_node()
972 *tp = pn; in fib_find_node()
1452 struct key_vector *n, *pn; in fib_table_lookup() local
1457 pn = t->kv; in fib_table_lookup()
1460 n = get_child_rcu(pn, cindex); in fib_table_lookup()
1499 pn = n; in fib_table_lookup()
1541 t_key pkey = pn->key; in fib_table_lookup()
1547 if (IS_TRIE(pn)) { in fib_table_lookup()
1556 pn = node_parent_rcu(pn); in fib_table_lookup()
1557 cindex = get_index(pkey, pn); in fib_table_lookup()
1564 cptr = &pn->tnode[cindex]; in fib_table_lookup()
1786 struct key_vector *pn, *n = *tn; in leaf_walk_rcu() local
1792 pn = n; in leaf_walk_rcu()
1793 cindex = (key > pn->key) ? get_index(key, pn) : 0; in leaf_walk_rcu()
1795 if (cindex >> pn->bits) in leaf_walk_rcu()
1799 n = get_child_rcu(pn, cindex++); in leaf_walk_rcu()
1809 while (!IS_TRIE(pn)) { in leaf_walk_rcu()
1811 if (cindex >= (1ul << pn->bits)) { in leaf_walk_rcu()
1812 t_key pkey = pn->key; in leaf_walk_rcu()
1814 pn = node_parent_rcu(pn); in leaf_walk_rcu()
1815 cindex = get_index(pkey, pn) + 1; in leaf_walk_rcu()
1820 n = get_child_rcu(pn, cindex++); in leaf_walk_rcu()
1829 pn = n; in leaf_walk_rcu()
1833 *tn = pn; in leaf_walk_rcu()
1837 *tn = pn; in leaf_walk_rcu()
1844 struct key_vector *pn = t->kv; in fib_trie_free() local
1854 t_key pkey = pn->key; in fib_trie_free()
1856 if (IS_TRIE(pn)) in fib_trie_free()
1859 n = pn; in fib_trie_free()
1860 pn = node_parent(pn); in fib_trie_free()
1863 put_child_root(pn, n->key, NULL); in fib_trie_free()
1866 cindex = get_index(pkey, pn); in fib_trie_free()
1872 n = get_child(pn, cindex); in fib_trie_free()
1878 pn = n; in fib_trie_free()
1889 put_child_root(pn, n->key, NULL); in fib_trie_free()
1961 struct key_vector *pn = t->kv; in fib_table_flush_external() local
1972 t_key pkey = pn->key; in fib_table_flush_external()
1975 if (IS_TRIE(pn)) in fib_table_flush_external()
1979 if (pn->slen > pn->pos) in fib_table_flush_external()
1980 update_suffix(pn); in fib_table_flush_external()
1983 pn = resize(t, pn); in fib_table_flush_external()
1984 cindex = get_index(pkey, pn); in fib_table_flush_external()
1990 n = get_child(pn, cindex); in fib_table_flush_external()
1996 pn = n; in fib_table_flush_external()
2020 put_child_root(pn, n->key, NULL); in fib_table_flush_external()
2031 struct key_vector *pn = t->kv; in fib_table_flush() local
2043 t_key pkey = pn->key; in fib_table_flush()
2046 if (IS_TRIE(pn)) in fib_table_flush()
2050 if (pn->slen > pn->pos) in fib_table_flush()
2051 update_suffix(pn); in fib_table_flush()
2054 pn = resize(t, pn); in fib_table_flush()
2055 cindex = get_index(pkey, pn); in fib_table_flush()
2061 n = get_child(pn, cindex); in fib_table_flush()
2067 pn = n; in fib_table_flush()
2106 put_child_root(pn, n->key, NULL); in fib_table_flush()
2120 struct key_vector *pn = t->kv; in __fib_info_notify_update() local
2128 t_key pkey = pn->key; in __fib_info_notify_update()
2130 if (IS_TRIE(pn)) in __fib_info_notify_update()
2133 pn = node_parent(pn); in __fib_info_notify_update()
2134 cindex = get_index(pkey, pn); in __fib_info_notify_update()
2139 n = get_child(pn, cindex); in __fib_info_notify_update()
2145 pn = n; in __fib_info_notify_update()
2457 struct key_vector *pn = iter->tnode; in fib_trie_get_next() local
2463 while (!IS_TRIE(pn)) { in fib_trie_get_next()
2464 while (cindex < child_length(pn)) { in fib_trie_get_next()
2465 struct key_vector *n = get_child_rcu(pn, cindex++); in fib_trie_get_next()
2471 iter->tnode = pn; in fib_trie_get_next()
2484 pkey = pn->key; in fib_trie_get_next()
2485 pn = node_parent_rcu(pn); in fib_trie_get_next()
2486 cindex = get_index(pkey, pn) + 1; in fib_trie_get_next()
2491 iter->tnode = pn; in fib_trie_get_next()
2500 struct key_vector *n, *pn; in fib_trie_get_first() local
2505 pn = t->kv; in fib_trie_get_first()
2506 n = rcu_dereference(pn->tnode[0]); in fib_trie_get_first()
2515 iter->tnode = pn; in fib_trie_get_first()