diff options
| author | Andy Shevchenko <andriy.shevchenko@linux.intel.com> | 2023-08-17 19:20:54 +0300 |
|---|---|---|
| committer | Yury Norov <yury.norov@gmail.com> | 2023-10-14 20:25:22 -0700 |
| commit | 7733aa893847f021c674d0d30b723d892109369d (patch) | |
| tree | 3e5024871c441cd87cac381d99cc84371639c19b /lib | |
| parent | 8ed13a762ca0661e4df16ce5eba929e73f4bd8f6 (diff) | |
| download | linux-7733aa893847f021c674d0d30b723d892109369d.tar.gz | |
bitmap: Remove dead code, i.e. bitmap_copy_le()
Besides the fact it's not used anywhere it should be implemented
differently, i.e. via helpers from linux/byteorder/generic.h.
Yet the helpers themselves need to be introduced first.
Also note, the function lacks of the test cases, they must be provided.
Hence, drop the current dead code for good.
Signed-off-by: Andy Shevchenko <andriy.shevchenko@linux.intel.com>
Signed-off-by: Yury Norov <yury.norov@gmail.com>
Diffstat (limited to 'lib')
| -rw-r--r-- | lib/bitmap.c | 23 |
1 files changed, 0 insertions, 23 deletions
diff --git a/lib/bitmap.c b/lib/bitmap.c index 24284caadbcc6..935e0f96e785d 100644 --- a/lib/bitmap.c +++ b/lib/bitmap.c @@ -1360,29 +1360,6 @@ int bitmap_allocate_region(unsigned long *bitmap, unsigned int pos, int order) } EXPORT_SYMBOL(bitmap_allocate_region); -/** - * bitmap_copy_le - copy a bitmap, putting the bits into little-endian order. - * @dst: destination buffer - * @src: bitmap to copy - * @nbits: number of bits in the bitmap - * - * Require nbits % BITS_PER_LONG == 0. - */ -#ifdef __BIG_ENDIAN -void bitmap_copy_le(unsigned long *dst, const unsigned long *src, unsigned int nbits) -{ - unsigned int i; - - for (i = 0; i < nbits/BITS_PER_LONG; i++) { - if (BITS_PER_LONG == 64) - dst[i] = cpu_to_le64(src[i]); - else - dst[i] = cpu_to_le32(src[i]); - } -} -EXPORT_SYMBOL(bitmap_copy_le); -#endif - unsigned long *bitmap_alloc(unsigned int nbits, gfp_t flags) { return kmalloc_array(BITS_TO_LONGS(nbits), sizeof(unsigned long), |