Lines Matching refs:pn
937 struct key_vector *pn, *n = t->kv;
941 pn = n;
971 *tp = pn;
1405 struct key_vector *n, *pn;
1410 pn = t->kv;
1413 n = get_child_rcu(pn, cindex);
1448 /* only record pn and cindex if we are going to be chopping
1452 pn = n;
1494 t_key pkey = pn->key;
1500 if (IS_TRIE(pn)) {
1509 pn = node_parent_rcu(pn);
1510 cindex = get_index(pkey, pn);
1517 cptr = &pn->tnode[cindex];
1736 struct key_vector *pn, *n = *tn;
1742 pn = n;
1743 cindex = (key > pn->key) ? get_index(key, pn) : 0;
1745 if (cindex >> pn->bits)
1749 n = get_child_rcu(pn, cindex++);
1759 while (!IS_TRIE(pn)) {
1761 if (cindex >= (1ul << pn->bits)) {
1762 t_key pkey = pn->key;
1764 pn = node_parent_rcu(pn);
1765 cindex = get_index(pkey, pn) + 1;
1770 n = get_child_rcu(pn, cindex++);
1779 pn = n;
1783 *tn = pn;
1787 *tn = pn;
1794 struct key_vector *pn = t->kv;
1804 t_key pkey = pn->key;
1806 if (IS_TRIE(pn))
1809 n = pn;
1810 pn = node_parent(pn);
1813 put_child_root(pn, n->key, NULL);
1816 cindex = get_index(pkey, pn);
1822 n = get_child(pn, cindex);
1827 /* record pn and cindex for leaf walking */
1828 pn = n;
1839 put_child_root(pn, n->key, NULL);
1911 struct key_vector *pn = t->kv;
1922 t_key pkey = pn->key;
1925 if (IS_TRIE(pn))
1929 if (pn->slen > pn->pos)
1930 update_suffix(pn);
1933 pn = resize(t, pn);
1934 cindex = get_index(pkey, pn);
1940 n = get_child(pn, cindex);
1945 /* record pn and cindex for leaf walking */
1946 pn = n;
1970 put_child_root(pn, n->key, NULL);
1981 struct key_vector *pn = t->kv;
1993 t_key pkey = pn->key;
1996 if (IS_TRIE(pn))
2000 if (pn->slen > pn->pos)
2001 update_suffix(pn);
2004 pn = resize(t, pn);
2005 cindex = get_index(pkey, pn);
2011 n = get_child(pn, cindex);
2016 /* record pn and cindex for leaf walking */
2017 pn = n;
2056 put_child_root(pn, n->key, NULL);
2070 struct key_vector *pn = t->kv;
2078 t_key pkey = pn->key;
2080 if (IS_TRIE(pn))
2083 pn = node_parent(pn);
2084 cindex = get_index(pkey, pn);
2089 n = get_child(pn, cindex);
2094 /* record pn and cindex for leaf walking */
2095 pn = n;
2415 struct key_vector *pn = iter->tnode;
2421 while (!IS_TRIE(pn)) {
2422 while (cindex < child_length(pn)) {
2423 struct key_vector *n = get_child_rcu(pn, cindex++);
2429 iter->tnode = pn;
2442 pkey = pn->key;
2443 pn = node_parent_rcu(pn);
2444 cindex = get_index(pkey, pn) + 1;
2449 iter->tnode = pn;
2458 struct key_vector *n, *pn;
2463 pn = t->kv;
2464 n = rcu_dereference(pn->tnode[0]);
2473 iter->tnode = pn;