Lines Matching defs:orig
788 * @orig: original untranslated bitmap
793 * n-th bit of @relmap is set, the m-th bit of @orig is set, and
798 * In other words, @orig is mapped onto (surjectively) @dst,
802 * Any set bits in @orig above bit number W, where W is the
804 * In particular, if for all bits m set in @orig, m >= W, then
808 * @orig bitmap over itself so that all its set bits x are in the
810 * setting the bit (m % W) in @dst, for each bit (m) set in @orig.
813 * Let's say @relmap has bits 30-39 set, and @orig has bits
817 * When bit 0 is set in @orig, it means turn on the bit in
822 * When bit 1 is set in @orig (as in the above example), it
831 * @orig (i.e. bits 3, 5, 7 and 9) were also set.
833 * When bit 11 is set in @orig, it means turn on the bit in
837 * 11 was set in @orig had no affect on @dst.
851 * bitmap_fold(tmp, orig, bitmap_weight(relmap, bits), bits);
855 * various @orig's. I list the zero-based positions of each set bit.
857 * using bitmap_fold() to fold the @orig bitmap modulo ten
860 * @orig tmp @dst
876 * If either of @orig or @relmap is empty (no set bits), then @dst
879 * If (as explained above) the only set bits in @orig are in positions
885 void bitmap_onto(unsigned long *dst, const unsigned long *orig,
890 if (dst == orig) /* following doesn't handle inplace mappings */
898 * n = bitmap_ord_to_pos(orig, m, bits);
899 * if (test_bit(m, orig))
907 if (test_bit(m, orig))
917 * @orig: original larger bitmap
921 * For each bit oldbit in @orig, set bit oldbit mod @sz in @dst.
925 void bitmap_fold(unsigned long *dst, const unsigned long *orig,
930 if (dst == orig) /* following doesn't handle inplace mappings */
934 for_each_set_bit(oldbit, orig, bits)