Lines Matching defs:cindex
853 unsigned long cindex = get_index(tn->key, tp);
863 BUG_ON(tn != get_child(tp, cindex));
878 tn = get_child(tp, cindex);
901 tn = get_child(tp, cindex);
952 * prefix plus zeros for the bits in the cindex. The index
958 * we know the value is cindex
1455 t_key cindex;
1458 cindex = 0;
1460 n = get_child_rcu(pn, cindex);
1482 * we know the value is cindex
1495 /* only record pn and cindex if we are going to be chopping
1500 cindex = index;
1535 /* If we are at cindex 0 there are no more bits for
1540 while (!cindex) {
1557 cindex = get_index(pkey, pn);
1560 /* strip the least significant bit from the cindex */
1561 cindex &= cindex - 1;
1564 cptr = &pn->tnode[cindex];
1787 unsigned long cindex;
1793 cindex = (key > pn->key) ? get_index(key, pn) : 0;
1795 if (cindex >> pn->bits)
1799 n = get_child_rcu(pn, cindex++);
1811 if (cindex >= (1ul << pn->bits)) {
1815 cindex = get_index(pkey, pn) + 1;
1820 n = get_child_rcu(pn, cindex++);
1830 cindex = 0;
1845 unsigned long cindex = 1;
1853 if (!(cindex--)) {
1866 cindex = get_index(pkey, pn);
1872 n = get_child(pn, cindex);
1877 /* record pn and cindex for leaf walking */
1879 cindex = 1ul << n->bits;
1962 unsigned long cindex = 1;
1971 if (!(cindex--)) {
1984 cindex = get_index(pkey, pn);
1990 n = get_child(pn, cindex);
1995 /* record pn and cindex for leaf walking */
1997 cindex = 1ul << n->bits;
2032 unsigned long cindex = 1;
2042 if (!(cindex--)) {
2055 cindex = get_index(pkey, pn);
2061 n = get_child(pn, cindex);
2066 /* record pn and cindex for leaf walking */
2068 cindex = 1ul << n->bits;
2121 unsigned long cindex = 1;
2127 if (!(cindex--)) {
2134 cindex = get_index(pkey, pn);
2139 n = get_child(pn, cindex);
2144 /* record pn and cindex for leaf walking */
2146 cindex = 1ul << n->bits;
2456 unsigned long cindex = iter->index;
2464 while (cindex < child_length(pn)) {
2465 struct key_vector *n = get_child_rcu(pn, cindex++);
2472 iter->index = cindex;
2486 cindex = get_index(pkey, pn) + 1;