Lines Matching refs:idx
30 unsigned long idx, val, sz = (size); \
32 for (idx = 0; idx * BITS_PER_LONG < sz; idx++) { \
35 sz = min(idx * BITS_PER_LONG + __ffs(MUNGE(val)), sz); \
52 unsigned long mask, idx, tmp, sz = (size), __start = (start); \
58 idx = __start / BITS_PER_LONG; \
61 if ((idx + 1) * BITS_PER_LONG >= sz) \
63 idx++; \
66 sz = min(idx * BITS_PER_LONG + __ffs(MUNGE(tmp)), sz); \
73 unsigned long sz = (size), nr = (num), idx, w, tmp; \
75 for (idx = 0; (idx + 1) * BITS_PER_LONG <= sz; idx++) { \
76 if (idx * BITS_PER_LONG + nr >= sz) \
90 sz = min(idx * BITS_PER_LONG + fns(tmp, nr), sz); \
101 return FIND_FIRST_BIT(addr[idx], /* nop */, size);
114 return FIND_FIRST_BIT(addr1[idx] & addr2[idx], /* nop */, size);
125 return FIND_FIRST_BIT(~addr[idx], /* nop */, size);
133 return FIND_NEXT_BIT(addr[idx], /* nop */, nbits, start);
140 return FIND_NTH_BIT(addr[idx], size, n);
147 return FIND_NTH_BIT(addr1[idx] & addr2[idx], size, n);
154 return FIND_NTH_BIT(addr1[idx] & ~addr2[idx], size, n);
163 return FIND_NTH_BIT(addr1[idx] & addr2[idx] & ~addr3[idx], size, n);
171 return FIND_NEXT_BIT(addr1[idx] & addr2[idx], /* nop */, nbits, start);
180 return FIND_NEXT_BIT(addr1[idx] & ~addr2[idx], /* nop */, nbits, start);
189 return FIND_NEXT_BIT(addr1[idx] | addr2[idx], /* nop */, nbits, start);
198 return FIND_NEXT_BIT(~addr[idx], /* nop */, nbits, start);
208 unsigned long idx = (size-1) / BITS_PER_LONG;
211 val &= addr[idx];
213 return idx * BITS_PER_LONG + __fls(val);
216 } while (idx--);
245 return FIND_FIRST_BIT(~addr[idx], swab, size);
255 return FIND_NEXT_BIT(~addr[idx], swab, size, offset);
264 return FIND_NEXT_BIT(addr[idx], swab, size, offset);