kernel/lib/bitmap.c

181  * Set the n-th bit of @dst iff the n-th bit of @src is set and
182  * n is less than @first, or the m-th bit of @src is set for any
736  * characters. Grouping such as "1,,5", ",44", "," or "" is allowed.
794  * that bit 7 is the 3rd (starting with 0th) set bit in @buf.
807  * bitmap_ord_to_pos - find position of n-th set bit in bitmap
809  *	@ord: ordinal bit position (n-th set bit, n >= 0)
820  * that the 3rd set bit (starting with 0th) is at position 7 in @buf.
845  * whatever position is held by the n-th set bit in @old is mapped
846  * to the n-th set bit in @new.  In the more general case, allowing
848  * weight of @old, map the position of the n-th set bit in @old to
849  * the position of the m-th set bit in @new, where m == n % w.
863  * position 4 to 12, 5 to 13, 6 to 14 and 7 to 15, and of all other
865  * with bits 1, 5 and 7 set, then @dst should leave with bits 1,
897  * whatever position is held by the n-th set bit in @old is mapped
898  * to the n-th set bit in @new.  In the more general case, allowing
900  * weight of @old, map the position of the n-th set bit in @old to
901  * the position of the m-th set bit in @new, where m == n % w.
911  * position 4 to 12, 5 to 13, 6 to 14 and 7 to 15, and of all other
912  * bit positions unchanged.  So if say @oldbit is 5, then this routine
933  * Set the n-th bit of @dst iff there exists some m such that the
934  * n-th bit of @relmap is set, the m-th bit of @orig is set, and
935  * the n-th bit of @relmap is also the m-th _set_ bit of @relmap.
940  * using the map { <n, m> | the n-th bit of @relmap is the
941  * m-th set bit of @relmap }.
955  *  1, 3, 5, 7, 9 and 11 set.  Then on return from this routine,
970  *  because they were the 4th, 6th, 8th and 10th set bits
971  *  set in @relmap, and the 4th, 6th, 8th and 10th bits of
972  *  @orig (i.e. bits 3, 5, 7 and 9) were also set.
1009  *      1 3 5 7          1 3 5 7       41 43 48 61