This promise is violated in a number of places, e.g. already in the second function below this paragraph. Since I don't think anybody relies on this being true, and since actually honouring it would hurt performance and code size in various places, just remove the paragraph.
Signed-off-by: Rasmus Villemoes <li...@rasmusvillemoes.dk> --- lib/bitmap.c | 5 ----- 1 file changed, 5 deletions(-) diff --git a/lib/bitmap.c b/lib/bitmap.c index 58f9750e49c6..1f73b2e52186 100644 --- a/lib/bitmap.c +++ b/lib/bitmap.c @@ -35,11 +35,6 @@ * carefully filter out these unused bits from impacting their * results. * - * These operations actually hold to a slightly stronger rule: - * if you don't input any bitmaps to these ops that have some - * unused bits set, then they won't output any set unused bits - * in output bitmaps. - * * The byte ordering of bitmaps is more natural on little * endian architectures. See the big-endian headers * include/asm-ppc64/bitops.h and include/asm-s390/bitops.h -- 2.16.4