diff options
| author | Peter Xu <peterx@redhat.com> | 2017-08-30 16:31:58 +0800 |
|---|---|---|
| committer | Juan Quintela <quintela@redhat.com> | 2017-09-22 14:11:23 +0200 |
| commit | ab089e058eb443a9a11ade4d3fc57ced1947bfa3 (patch) | |
| tree | 664db99bf413aaac56888179327239a25575e0ba | |
| parent | e595a01ab656192b11254b3dafcc83b0adb18470 (diff) | |
bitmap: remove BITOP_WORD()
We have BIT_WORD(). It's the same.
Signed-off-by: Peter Xu <peterx@redhat.com>
Reviewed-by: Juan Quintela <quintela@redhat.com>
Signed-off-by: Juan Quintela <quintela@redhat.com>
| -rw-r--r-- | util/bitops.c | 6 |
1 files changed, 2 insertions, 4 deletions
diff --git a/util/bitops.c b/util/bitops.c index b0c35dd5f1..f2364015c4 100644 --- a/util/bitops.c +++ b/util/bitops.c @@ -14,15 +14,13 @@ #include "qemu/osdep.h" #include "qemu/bitops.h" -#define BITOP_WORD(nr) ((nr) / BITS_PER_LONG) - /* * Find the next set bit in a memory region. */ unsigned long find_next_bit(const unsigned long *addr, unsigned long size, unsigned long offset) { - const unsigned long *p = addr + BITOP_WORD(offset); + const unsigned long *p = addr + BIT_WORD(offset); unsigned long result = offset & ~(BITS_PER_LONG-1); unsigned long tmp; @@ -87,7 +85,7 @@ found_middle: unsigned long find_next_zero_bit(const unsigned long *addr, unsigned long size, unsigned long offset) { - const unsigned long *p = addr + BITOP_WORD(offset); + const unsigned long *p = addr + BIT_WORD(offset); unsigned long result = offset & ~(BITS_PER_LONG-1); unsigned long tmp; |