Lines Matching defs:cindex
852 unsigned long cindex = get_index(tn->key, tp);
862 BUG_ON(tn != get_child(tp, cindex));
877 tn = get_child(tp, cindex);
900 tn = get_child(tp, cindex);
951 * prefix plus zeros for the bits in the cindex. The index
957 * we know the value is cindex
1408 t_key cindex;
1411 cindex = 0;
1413 n = get_child_rcu(pn, cindex);
1435 * we know the value is cindex
1448 /* only record pn and cindex if we are going to be chopping
1453 cindex = index;
1488 /* If we are at cindex 0 there are no more bits for
1493 while (!cindex) {
1510 cindex = get_index(pkey, pn);
1513 /* strip the least significant bit from the cindex */
1514 cindex &= cindex - 1;
1517 cptr = &pn->tnode[cindex];
1737 unsigned long cindex;
1743 cindex = (key > pn->key) ? get_index(key, pn) : 0;
1745 if (cindex >> pn->bits)
1749 n = get_child_rcu(pn, cindex++);
1761 if (cindex >= (1ul << pn->bits)) {
1765 cindex = get_index(pkey, pn) + 1;
1770 n = get_child_rcu(pn, cindex++);
1780 cindex = 0;
1795 unsigned long cindex = 1;
1803 if (!(cindex--)) {
1816 cindex = get_index(pkey, pn);
1822 n = get_child(pn, cindex);
1827 /* record pn and cindex for leaf walking */
1829 cindex = 1ul << n->bits;
1912 unsigned long cindex = 1;
1921 if (!(cindex--)) {
1934 cindex = get_index(pkey, pn);
1940 n = get_child(pn, cindex);
1945 /* record pn and cindex for leaf walking */
1947 cindex = 1ul << n->bits;
1982 unsigned long cindex = 1;
1992 if (!(cindex--)) {
2005 cindex = get_index(pkey, pn);
2011 n = get_child(pn, cindex);
2016 /* record pn and cindex for leaf walking */
2018 cindex = 1ul << n->bits;
2071 unsigned long cindex = 1;
2077 if (!(cindex--)) {
2084 cindex = get_index(pkey, pn);
2089 n = get_child(pn, cindex);
2094 /* record pn and cindex for leaf walking */
2096 cindex = 1ul << n->bits;
2414 unsigned long cindex = iter->index;
2422 while (cindex < child_length(pn)) {
2423 struct key_vector *n = get_child_rcu(pn, cindex++);
2430 iter->index = cindex;
2444 cindex = get_index(pkey, pn) + 1;