Lines Matching +full:40 +full:m
172 * n is less than @first, or the m-th bit of @src is set for any
173 * m such that @first <= n < nbits, and m = n + @cut.
497 * the position of the m-th set bit in @new, where m == n % w.
550 * the position of the m-th set bit in @new, where m == n % w.
584 * Set the n-th bit of @dst iff there exists some m such that the
585 * n-th bit of @relmap is set, the m-th bit of @orig is set, and
586 * the n-th bit of @relmap is also the m-th _set_ bit of @relmap.
591 * using the map { <n, m> | the n-th bit of @relmap is the
592 * m-th set bit of @relmap }.
596 * In particular, if for all bits m set in @orig, m >= W, then
602 * setting the bit (m % W) in @dst, for each bit (m) set in @orig.
634 * 40 41 42 43 45 48 53 61 74 95
636 * (for the curious, that's 40 plus the first ten terms of the
656 * 0 0 40
659 * 10 0 40 [#f1]_
661 * 0 1 2 3 4 0 1 2 3 4 40 41 42 43 45
662 * 0 9 18 27 0 9 8 7 40 61 74 95
663 * 0 10 20 30 0 40
664 * 0 11 22 33 0 1 2 3 40 41 42 43
665 * 0 12 24 36 0 2 4 6 40 42 45 53
678 * m where m >= W, (where W is the weight of @relmap) then @dst will
686 unsigned int n, m; /* same meaning as in above comment */ in bitmap_onto() local
695 * for (m = 0; m < bitmap_weight(relmap, bits); m++) { in bitmap_onto()
696 * n = find_nth_bit(orig, bits, m); in bitmap_onto()
697 * if (test_bit(m, orig)) in bitmap_onto()
702 m = 0; in bitmap_onto()
704 /* m == bitmap_pos_to_ord(relmap, n, bits) */ in bitmap_onto()
705 if (test_bit(m, orig)) in bitmap_onto()
707 m++; in bitmap_onto()