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()
1785 struct key_vector *pn, *n = *tn; in leaf_walk_rcu() local
1791 pn = n; in leaf_walk_rcu()
1792 cindex = (key > pn->key) ? get_index(key, pn) : 0; in leaf_walk_rcu()
1794 if (cindex >> pn->bits) in leaf_walk_rcu()
1798 n = get_child_rcu(pn, cindex++); in leaf_walk_rcu()
1808 while (!IS_TRIE(pn)) { in leaf_walk_rcu()
1810 if (cindex >= (1ul << pn->bits)) { in leaf_walk_rcu()
1811 t_key pkey = pn->key; in leaf_walk_rcu()
1813 pn = node_parent_rcu(pn); in leaf_walk_rcu()
1814 cindex = get_index(pkey, pn) + 1; in leaf_walk_rcu()
1819 n = get_child_rcu(pn, cindex++); in leaf_walk_rcu()
1828 pn = n; in leaf_walk_rcu()
1832 *tn = pn; in leaf_walk_rcu()
1836 *tn = pn; in leaf_walk_rcu()
1843 struct key_vector *pn = t->kv; in fib_trie_free() local
1853 t_key pkey = pn->key; in fib_trie_free()
1855 if (IS_TRIE(pn)) in fib_trie_free()
1858 n = pn; in fib_trie_free()
1859 pn = node_parent(pn); in fib_trie_free()
1862 put_child_root(pn, n->key, NULL); in fib_trie_free()
1865 cindex = get_index(pkey, pn); in fib_trie_free()
1871 n = get_child(pn, cindex); in fib_trie_free()
1877 pn = n; in fib_trie_free()
1888 put_child_root(pn, n->key, NULL); in fib_trie_free()
1960 struct key_vector *pn = t->kv; in fib_table_flush_external() local
1971 t_key pkey = pn->key; in fib_table_flush_external()
1974 if (IS_TRIE(pn)) in fib_table_flush_external()
1978 if (pn->slen > pn->pos) in fib_table_flush_external()
1979 update_suffix(pn); in fib_table_flush_external()
1982 pn = resize(t, pn); in fib_table_flush_external()
1983 cindex = get_index(pkey, pn); in fib_table_flush_external()
1989 n = get_child(pn, cindex); in fib_table_flush_external()
1995 pn = n; in fib_table_flush_external()
2019 put_child_root(pn, n->key, NULL); in fib_table_flush_external()
2029 struct key_vector *pn = t->kv; in fib_table_flush() local
2041 t_key pkey = pn->key; in fib_table_flush()
2044 if (IS_TRIE(pn)) in fib_table_flush()
2048 if (pn->slen > pn->pos) in fib_table_flush()
2049 update_suffix(pn); in fib_table_flush()
2052 pn = resize(t, pn); in fib_table_flush()
2053 cindex = get_index(pkey, pn); in fib_table_flush()
2059 n = get_child(pn, cindex); in fib_table_flush()
2065 pn = n; in fib_table_flush()
2101 put_child_root(pn, n->key, NULL); in fib_table_flush()
2115 struct key_vector *pn = t->kv; in __fib_info_notify_update() local
2123 t_key pkey = pn->key; in __fib_info_notify_update()
2125 if (IS_TRIE(pn)) in __fib_info_notify_update()
2128 pn = node_parent(pn); in __fib_info_notify_update()
2129 cindex = get_index(pkey, pn); in __fib_info_notify_update()
2134 n = get_child(pn, cindex); in __fib_info_notify_update()
2140 pn = n; in __fib_info_notify_update()
2452 struct key_vector *pn = iter->tnode; in fib_trie_get_next() local
2458 while (!IS_TRIE(pn)) { in fib_trie_get_next()
2459 while (cindex < child_length(pn)) { in fib_trie_get_next()
2460 struct key_vector *n = get_child_rcu(pn, cindex++); in fib_trie_get_next()
2466 iter->tnode = pn; in fib_trie_get_next()
2479 pkey = pn->key; in fib_trie_get_next()
2480 pn = node_parent_rcu(pn); in fib_trie_get_next()
2481 cindex = get_index(pkey, pn) + 1; in fib_trie_get_next()
2486 iter->tnode = pn; in fib_trie_get_next()
2495 struct key_vector *n, *pn; in fib_trie_get_first() local
2500 pn = t->kv; in fib_trie_get_first()
2501 n = rcu_dereference(pn->tnode[0]); in fib_trie_get_first()
2510 iter->tnode = pn; in fib_trie_get_first()