Lines Matching defs:relmap
1068 * @relmap: bitmap relative to which translated
1072 * n-th bit of @relmap is set, the m-th bit of @orig is set, and
1073 * the n-th bit of @relmap is also the m-th _set_ bit of @relmap.
1078 * using the map { <n, m> | the n-th bit of @relmap is the
1079 * m-th set bit of @relmap }.
1082 * weight of (number of set bits in) @relmap are mapped nowhere.
1092 * Let's say @relmap has bits 30-39 set, and @orig has bits
1098 * that is turned on in @relmap. Since bit 0 was off in the
1103 * is the second bit that is turned on in @relmap. The second
1104 * bit in @relmap that was turned on in the above example was
1109 * set in @relmap, and the 4th, 6th, 8th and 10th bits of
1114 * turned on in @relmap. In the above example, there were
1115 * only ten bits turned on in @relmap (30..39), so that bit
1119 * Let's say @relmap has these ten bits set::
1132 * bitmap_fold(tmp, orig, bitmap_weight(relmap, bits), bits);
1133 * bitmap_onto(dst, tmp, relmap, bits);
1139 * (the weight of @relmap):
1161 * If either of @orig or @relmap is empty (no set bits), then @dst
1165 * m where m >= W, (where W is the weight of @relmap) then @dst will
1171 const unsigned long *relmap, unsigned int bits)
1182 * for (m = 0; m < bitmap_weight(relmap, bits); m++) {
1190 for_each_set_bit(n, relmap, bits) {
1191 /* m == bitmap_pos_to_ord(relmap, n, bits) */