Lines Matching refs:pn
940 struct key_vector *pn, *n = t->kv; in fib_find_node() local
944 pn = n; in fib_find_node()
974 *tp = pn; in fib_find_node()
1320 struct key_vector *n, *pn; in fib_table_lookup() local
1325 pn = t->kv; in fib_table_lookup()
1328 n = get_child_rcu(pn, cindex); in fib_table_lookup()
1367 pn = n; in fib_table_lookup()
1409 t_key pkey = pn->key; in fib_table_lookup()
1415 if (IS_TRIE(pn)) { in fib_table_lookup()
1424 pn = node_parent_rcu(pn); in fib_table_lookup()
1425 cindex = get_index(pkey, pn); in fib_table_lookup()
1432 cptr = &pn->tnode[cindex]; in fib_table_lookup()
1620 struct key_vector *pn, *n = *tn; in leaf_walk_rcu() local
1626 pn = n; in leaf_walk_rcu()
1627 cindex = (key > pn->key) ? get_index(key, pn) : 0; in leaf_walk_rcu()
1629 if (cindex >> pn->bits) in leaf_walk_rcu()
1633 n = get_child_rcu(pn, cindex++); in leaf_walk_rcu()
1643 while (!IS_TRIE(pn)) { in leaf_walk_rcu()
1645 if (cindex >= (1ul << pn->bits)) { in leaf_walk_rcu()
1646 t_key pkey = pn->key; in leaf_walk_rcu()
1648 pn = node_parent_rcu(pn); in leaf_walk_rcu()
1649 cindex = get_index(pkey, pn) + 1; in leaf_walk_rcu()
1654 n = get_child_rcu(pn, cindex++); in leaf_walk_rcu()
1663 pn = n; in leaf_walk_rcu()
1667 *tn = pn; in leaf_walk_rcu()
1671 *tn = pn; in leaf_walk_rcu()
1678 struct key_vector *pn = t->kv; in fib_trie_free() local
1688 t_key pkey = pn->key; in fib_trie_free()
1690 if (IS_TRIE(pn)) in fib_trie_free()
1693 n = pn; in fib_trie_free()
1694 pn = node_parent(pn); in fib_trie_free()
1697 put_child_root(pn, n->key, NULL); in fib_trie_free()
1700 cindex = get_index(pkey, pn); in fib_trie_free()
1706 n = get_child(pn, cindex); in fib_trie_free()
1712 pn = n; in fib_trie_free()
1723 put_child_root(pn, n->key, NULL); in fib_trie_free()
1795 struct key_vector *pn = t->kv; in fib_table_flush_external() local
1806 t_key pkey = pn->key; in fib_table_flush_external()
1809 if (IS_TRIE(pn)) in fib_table_flush_external()
1813 if (pn->slen > pn->pos) in fib_table_flush_external()
1814 update_suffix(pn); in fib_table_flush_external()
1817 pn = resize(t, pn); in fib_table_flush_external()
1818 cindex = get_index(pkey, pn); in fib_table_flush_external()
1824 n = get_child(pn, cindex); in fib_table_flush_external()
1830 pn = n; in fib_table_flush_external()
1854 put_child_root(pn, n->key, NULL); in fib_table_flush_external()
1864 struct key_vector *pn = t->kv; in fib_table_flush() local
1876 t_key pkey = pn->key; in fib_table_flush()
1879 if (IS_TRIE(pn)) in fib_table_flush()
1883 if (pn->slen > pn->pos) in fib_table_flush()
1884 update_suffix(pn); in fib_table_flush()
1887 pn = resize(t, pn); in fib_table_flush()
1888 cindex = get_index(pkey, pn); in fib_table_flush()
1894 n = get_child(pn, cindex); in fib_table_flush()
1900 pn = n; in fib_table_flush()
1938 put_child_root(pn, n->key, NULL); in fib_table_flush()
1952 struct key_vector *pn = t->kv; in __fib_info_notify_update() local
1960 t_key pkey = pn->key; in __fib_info_notify_update()
1962 if (IS_TRIE(pn)) in __fib_info_notify_update()
1965 pn = node_parent(pn); in __fib_info_notify_update()
1966 cindex = get_index(pkey, pn); in __fib_info_notify_update()
1971 n = get_child(pn, cindex); in __fib_info_notify_update()
1977 pn = n; in __fib_info_notify_update()
2263 struct key_vector *pn = iter->tnode; in fib_trie_get_next() local
2269 while (!IS_TRIE(pn)) { in fib_trie_get_next()
2270 while (cindex < child_length(pn)) { in fib_trie_get_next()
2271 struct key_vector *n = get_child_rcu(pn, cindex++); in fib_trie_get_next()
2277 iter->tnode = pn; in fib_trie_get_next()
2290 pkey = pn->key; in fib_trie_get_next()
2291 pn = node_parent_rcu(pn); in fib_trie_get_next()
2292 cindex = get_index(pkey, pn) + 1; in fib_trie_get_next()
2297 iter->tnode = pn; in fib_trie_get_next()
2306 struct key_vector *n, *pn; in fib_trie_get_first() local
2311 pn = t->kv; in fib_trie_get_first()
2312 n = rcu_dereference(pn->tnode[0]); in fib_trie_get_first()
2321 iter->tnode = pn; in fib_trie_get_first()