Lines Matching refs:cindex
848 unsigned long cindex = get_index(tn->key, tp);
858 BUG_ON(tn != get_child(tp, cindex));
873 tn = get_child(tp, cindex);
896 tn = get_child(tp, cindex);
947 * prefix plus zeros for the bits in the cindex. The index
953 * we know the value is cindex
1431 t_key cindex;
1434 cindex = 0;
1436 n = get_child_rcu(pn, cindex);
1458 * we know the value is cindex
1471 /* only record pn and cindex if we are going to be chopping
1476 cindex = index;
1511 /* If we are at cindex 0 there are no more bits for
1516 while (!cindex) {
1533 cindex = get_index(pkey, pn);
1536 /* strip the least significant bit from the cindex */
1537 cindex &= cindex - 1;
1540 cptr = &pn->tnode[cindex];
1760 unsigned long cindex;
1766 cindex = (key > pn->key) ? get_index(key, pn) : 0;
1768 if (cindex >> pn->bits)
1772 n = get_child_rcu(pn, cindex++);
1784 if (cindex >= (1ul << pn->bits)) {
1788 cindex = get_index(pkey, pn) + 1;
1793 n = get_child_rcu(pn, cindex++);
1803 cindex = 0;
1818 unsigned long cindex = 1;
1826 if (!(cindex--)) {
1839 cindex = get_index(pkey, pn);
1845 n = get_child(pn, cindex);
1850 /* record pn and cindex for leaf walking */
1852 cindex = 1ul << n->bits;
1935 unsigned long cindex = 1;
1944 if (!(cindex--)) {
1957 cindex = get_index(pkey, pn);
1963 n = get_child(pn, cindex);
1968 /* record pn and cindex for leaf walking */
1970 cindex = 1ul << n->bits;
2005 unsigned long cindex = 1;
2015 if (!(cindex--)) {
2028 cindex = get_index(pkey, pn);
2034 n = get_child(pn, cindex);
2039 /* record pn and cindex for leaf walking */
2041 cindex = 1ul << n->bits;
2094 unsigned long cindex = 1;
2100 if (!(cindex--)) {
2107 cindex = get_index(pkey, pn);
2112 n = get_child(pn, cindex);
2117 /* record pn and cindex for leaf walking */
2119 cindex = 1ul << n->bits;
2429 unsigned long cindex = iter->index;
2437 while (cindex < child_length(pn)) {
2438 struct key_vector *n = get_child_rcu(pn, cindex++);
2445 iter->index = cindex;
2459 cindex = get_index(pkey, pn) + 1;