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()
1440 struct key_vector *n, *pn; in fib_table_lookup() local
1445 pn = t->kv; in fib_table_lookup()
1448 n = get_child_rcu(pn, cindex); in fib_table_lookup()
1487 pn = n; in fib_table_lookup()
1529 t_key pkey = pn->key; in fib_table_lookup()
1535 if (IS_TRIE(pn)) { in fib_table_lookup()
1544 pn = node_parent_rcu(pn); in fib_table_lookup()
1545 cindex = get_index(pkey, pn); in fib_table_lookup()
1552 cptr = &pn->tnode[cindex]; in fib_table_lookup()
1770 struct key_vector *pn, *n = *tn; in leaf_walk_rcu() local
1776 pn = n; in leaf_walk_rcu()
1777 cindex = (key > pn->key) ? get_index(key, pn) : 0; in leaf_walk_rcu()
1779 if (cindex >> pn->bits) in leaf_walk_rcu()
1783 n = get_child_rcu(pn, cindex++); in leaf_walk_rcu()
1793 while (!IS_TRIE(pn)) { in leaf_walk_rcu()
1795 if (cindex >= (1ul << pn->bits)) { in leaf_walk_rcu()
1796 t_key pkey = pn->key; in leaf_walk_rcu()
1798 pn = node_parent_rcu(pn); in leaf_walk_rcu()
1799 cindex = get_index(pkey, pn) + 1; in leaf_walk_rcu()
1804 n = get_child_rcu(pn, cindex++); in leaf_walk_rcu()
1813 pn = n; in leaf_walk_rcu()
1817 *tn = pn; in leaf_walk_rcu()
1821 *tn = pn; in leaf_walk_rcu()
1828 struct key_vector *pn = t->kv; in fib_trie_free() local
1838 t_key pkey = pn->key; in fib_trie_free()
1840 if (IS_TRIE(pn)) in fib_trie_free()
1843 n = pn; in fib_trie_free()
1844 pn = node_parent(pn); in fib_trie_free()
1847 put_child_root(pn, n->key, NULL); in fib_trie_free()
1850 cindex = get_index(pkey, pn); in fib_trie_free()
1856 n = get_child(pn, cindex); in fib_trie_free()
1862 pn = n; in fib_trie_free()
1873 put_child_root(pn, n->key, NULL); in fib_trie_free()
1945 struct key_vector *pn = t->kv; in fib_table_flush_external() local
1956 t_key pkey = pn->key; in fib_table_flush_external()
1959 if (IS_TRIE(pn)) in fib_table_flush_external()
1963 if (pn->slen > pn->pos) in fib_table_flush_external()
1964 update_suffix(pn); in fib_table_flush_external()
1967 pn = resize(t, pn); in fib_table_flush_external()
1968 cindex = get_index(pkey, pn); in fib_table_flush_external()
1974 n = get_child(pn, cindex); in fib_table_flush_external()
1980 pn = n; in fib_table_flush_external()
2004 put_child_root(pn, n->key, NULL); in fib_table_flush_external()
2014 struct key_vector *pn = t->kv; in fib_table_flush() local
2026 t_key pkey = pn->key; in fib_table_flush()
2029 if (IS_TRIE(pn)) in fib_table_flush()
2033 if (pn->slen > pn->pos) in fib_table_flush()
2034 update_suffix(pn); in fib_table_flush()
2037 pn = resize(t, pn); in fib_table_flush()
2038 cindex = get_index(pkey, pn); in fib_table_flush()
2044 n = get_child(pn, cindex); in fib_table_flush()
2050 pn = n; in fib_table_flush()
2086 put_child_root(pn, n->key, NULL); in fib_table_flush()
2100 struct key_vector *pn = t->kv; in __fib_info_notify_update() local
2108 t_key pkey = pn->key; in __fib_info_notify_update()
2110 if (IS_TRIE(pn)) in __fib_info_notify_update()
2113 pn = node_parent(pn); in __fib_info_notify_update()
2114 cindex = get_index(pkey, pn); in __fib_info_notify_update()
2119 n = get_child(pn, cindex); in __fib_info_notify_update()
2125 pn = n; in __fib_info_notify_update()
2437 struct key_vector *pn = iter->tnode; in fib_trie_get_next() local
2443 while (!IS_TRIE(pn)) { in fib_trie_get_next()
2444 while (cindex < child_length(pn)) { in fib_trie_get_next()
2445 struct key_vector *n = get_child_rcu(pn, cindex++); in fib_trie_get_next()
2451 iter->tnode = pn; in fib_trie_get_next()
2464 pkey = pn->key; in fib_trie_get_next()
2465 pn = node_parent_rcu(pn); in fib_trie_get_next()
2466 cindex = get_index(pkey, pn) + 1; in fib_trie_get_next()
2471 iter->tnode = pn; in fib_trie_get_next()
2480 struct key_vector *n, *pn; in fib_trie_get_first() local
2485 pn = t->kv; in fib_trie_get_first()
2486 n = rcu_dereference(pn->tnode[0]); in fib_trie_get_first()
2495 iter->tnode = pn; in fib_trie_get_first()