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
1450 t_key cindex;
1453 cindex = 0;
1455 n = get_child_rcu(pn, cindex);
1477 * we know the value is cindex
1490 /* only record pn and cindex if we are going to be chopping
1495 cindex = index;
1530 /* If we are at cindex 0 there are no more bits for
1535 while (!cindex) {
1552 cindex = get_index(pkey, pn);
1555 /* strip the least significant bit from the cindex */
1556 cindex &= cindex - 1;
1559 cptr = &pn->tnode[cindex];
1782 unsigned long cindex;
1788 cindex = (key > pn->key) ? get_index(key, pn) : 0;
1790 if (cindex >> pn->bits)
1794 n = get_child_rcu(pn, cindex++);
1806 if (cindex >= (1ul << pn->bits)) {
1810 cindex = get_index(pkey, pn) + 1;
1815 n = get_child_rcu(pn, cindex++);
1825 cindex = 0;
1840 unsigned long cindex = 1;
1848 if (!(cindex--)) {
1861 cindex = get_index(pkey, pn);
1867 n = get_child(pn, cindex);
1872 /* record pn and cindex for leaf walking */
1874 cindex = 1ul << n->bits;
1957 unsigned long cindex = 1;
1966 if (!(cindex--)) {
1979 cindex = get_index(pkey, pn);
1985 n = get_child(pn, cindex);
1990 /* record pn and cindex for leaf walking */
1992 cindex = 1ul << n->bits;
2027 unsigned long cindex = 1;
2037 if (!(cindex--)) {
2050 cindex = get_index(pkey, pn);
2056 n = get_child(pn, cindex);
2061 /* record pn and cindex for leaf walking */
2063 cindex = 1ul << n->bits;
2116 unsigned long cindex = 1;
2122 if (!(cindex--)) {
2129 cindex = get_index(pkey, pn);
2134 n = get_child(pn, cindex);
2139 /* record pn and cindex for leaf walking */
2141 cindex = 1ul << n->bits;
2451 unsigned long cindex = iter->index;
2459 while (cindex < child_length(pn)) {
2460 struct key_vector *n = get_child_rcu(pn, cindex++);
2467 iter->index = cindex;
2481 cindex = get_index(pkey, pn) + 1;