Lines Matching refs:cindex

854 	unsigned long cindex = get_index(tn->key, tp);
864 BUG_ON(tn != get_child(tp, cindex));
879 tn = get_child(tp, cindex);
902 tn = get_child(tp, cindex);
953 * prefix plus zeros for the bits in the cindex. The index
959 * we know the value is cindex
1456 t_key cindex;
1459 cindex = 0;
1461 n = get_child_rcu(pn, cindex);
1483 * we know the value is cindex
1496 /* only record pn and cindex if we are going to be chopping
1501 cindex = index;
1536 /* If we are at cindex 0 there are no more bits for
1541 while (!cindex) {
1558 cindex = get_index(pkey, pn);
1561 /* strip the least significant bit from the cindex */
1562 cindex &= cindex - 1;
1565 cptr = &pn->tnode[cindex];
1788 unsigned long cindex;
1794 cindex = (key > pn->key) ? get_index(key, pn) : 0;
1796 if (cindex >> pn->bits)
1800 n = get_child_rcu(pn, cindex++);
1812 if (cindex >= (1ul << pn->bits)) {
1816 cindex = get_index(pkey, pn) + 1;
1821 n = get_child_rcu(pn, cindex++);
1831 cindex = 0;
1846 unsigned long cindex = 1;
1854 if (!(cindex--)) {
1867 cindex = get_index(pkey, pn);
1873 n = get_child(pn, cindex);
1878 /* record pn and cindex for leaf walking */
1880 cindex = 1ul << n->bits;
1963 unsigned long cindex = 1;
1972 if (!(cindex--)) {
1985 cindex = get_index(pkey, pn);
1991 n = get_child(pn, cindex);
1996 /* record pn and cindex for leaf walking */
1998 cindex = 1ul << n->bits;
2033 unsigned long cindex = 1;
2043 if (!(cindex--)) {
2056 cindex = get_index(pkey, pn);
2062 n = get_child(pn, cindex);
2067 /* record pn and cindex for leaf walking */
2069 cindex = 1ul << n->bits;
2122 unsigned long cindex = 1;
2128 if (!(cindex--)) {
2135 cindex = get_index(pkey, pn);
2140 n = get_child(pn, cindex);
2145 /* record pn and cindex for leaf walking */
2147 cindex = 1ul << n->bits;
2457 unsigned long cindex = iter->index;
2465 while (cindex < child_length(pn)) {
2466 struct key_vector *n = get_child_rcu(pn, cindex++);
2473 iter->index = cindex;
2487 cindex = get_index(pkey, pn) + 1;