Lines Matching defs:first
166 * @first: start bit of region to be removed
171 * n is less than @first, or the m-th bit of @src is set for any
172 * m such that @first <= n < nbits, and m = n + @cut.
184 * if @cut is 3, and @first is 14, bits 14-16 in @src are cut and @dst is::
200 unsigned int first, unsigned int cut, unsigned int nbits)
206 if (first % BITS_PER_LONG) {
207 keep = src[first / BITS_PER_LONG] &
208 (~0UL >> (BITS_PER_LONG - first % BITS_PER_LONG));
214 for (i = first / BITS_PER_LONG; i < len; i++) {
224 dst[first / BITS_PER_LONG] &= ~0UL << (first % BITS_PER_LONG);
225 dst[first / BITS_PER_LONG] |= keep;
568 * (If you understood the previous sentence the first time your
580 * to use the bitmap_fold() operator, below, to first fold the
591 * @dst corresponding to whatever is the first bit (if any)
617 * (for the curious, that's 40 plus the first ten terms of the
652 * For these marked lines, if we hadn't first done bitmap_fold()