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