mirror of
https://github.com/koverstreet/bcachefs-tools.git
synced 2025-02-02 00:00:03 +03:00
133 lines
3.3 KiB
C
133 lines
3.3 KiB
C
#ifndef _PERF_BITOPS_H
|
|
#define _PERF_BITOPS_H
|
|
|
|
#include <string.h>
|
|
#include <linux/bitops.h>
|
|
#include <stdlib.h>
|
|
|
|
#define DECLARE_BITMAP(name,bits) \
|
|
unsigned long name[BITS_TO_LONGS(bits)]
|
|
|
|
int __bitmap_weight(const unsigned long *bitmap, int bits);
|
|
void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1,
|
|
const unsigned long *bitmap2, int bits);
|
|
int __bitmap_and(unsigned long *dst, const unsigned long *bitmap1,
|
|
const unsigned long *bitmap2, unsigned int bits);
|
|
|
|
#define BITMAP_FIRST_WORD_MASK(start) (~0UL << ((start) & (BITS_PER_LONG - 1)))
|
|
|
|
#define BITMAP_LAST_WORD_MASK(nbits) \
|
|
( \
|
|
((nbits) % BITS_PER_LONG) ? \
|
|
(1UL<<((nbits) % BITS_PER_LONG))-1 : ~0UL \
|
|
)
|
|
|
|
#define small_const_nbits(nbits) \
|
|
(__builtin_constant_p(nbits) && (nbits) <= BITS_PER_LONG)
|
|
|
|
static inline void bitmap_zero(unsigned long *dst, int nbits)
|
|
{
|
|
memset(dst, 0, BITS_TO_LONGS(nbits) * sizeof(unsigned long));
|
|
}
|
|
|
|
static inline int bitmap_weight(const unsigned long *src, int nbits)
|
|
{
|
|
if (small_const_nbits(nbits))
|
|
return hweight_long(*src & BITMAP_LAST_WORD_MASK(nbits));
|
|
return __bitmap_weight(src, nbits);
|
|
}
|
|
|
|
static inline void bitmap_or(unsigned long *dst, const unsigned long *src1,
|
|
const unsigned long *src2, int nbits)
|
|
{
|
|
if (small_const_nbits(nbits))
|
|
*dst = *src1 | *src2;
|
|
else
|
|
__bitmap_or(dst, src1, src2, nbits);
|
|
}
|
|
|
|
/**
|
|
* bitmap_alloc - Allocate bitmap
|
|
* @nr: Bit to set
|
|
*/
|
|
static inline unsigned long *bitmap_alloc(int nbits)
|
|
{
|
|
return calloc(1, BITS_TO_LONGS(nbits) * sizeof(unsigned long));
|
|
}
|
|
|
|
/*
|
|
* bitmap_scnprintf - print bitmap list into buffer
|
|
* @bitmap: bitmap
|
|
* @nbits: size of bitmap
|
|
* @buf: buffer to store output
|
|
* @size: size of @buf
|
|
*/
|
|
size_t bitmap_scnprintf(unsigned long *bitmap, int nbits,
|
|
char *buf, size_t size);
|
|
|
|
/**
|
|
* bitmap_and - Do logical and on bitmaps
|
|
* @dst: resulting bitmap
|
|
* @src1: operand 1
|
|
* @src2: operand 2
|
|
* @nbits: size of bitmap
|
|
*/
|
|
static inline int bitmap_and(unsigned long *dst, const unsigned long *src1,
|
|
const unsigned long *src2, unsigned int nbits)
|
|
{
|
|
if (small_const_nbits(nbits))
|
|
return (*dst = *src1 & *src2 & BITMAP_LAST_WORD_MASK(nbits)) != 0;
|
|
return __bitmap_and(dst, src1, src2, nbits);
|
|
}
|
|
|
|
static inline unsigned long _find_next_bit(const unsigned long *addr,
|
|
unsigned long nbits, unsigned long start, unsigned long invert)
|
|
{
|
|
unsigned long tmp;
|
|
|
|
if (!nbits || start >= nbits)
|
|
return nbits;
|
|
|
|
tmp = addr[start / BITS_PER_LONG] ^ invert;
|
|
|
|
/* Handle 1st word. */
|
|
tmp &= BITMAP_FIRST_WORD_MASK(start);
|
|
start = round_down(start, BITS_PER_LONG);
|
|
|
|
while (!tmp) {
|
|
start += BITS_PER_LONG;
|
|
if (start >= nbits)
|
|
return nbits;
|
|
|
|
tmp = addr[start / BITS_PER_LONG] ^ invert;
|
|
}
|
|
|
|
return min(start + __ffs(tmp), nbits);
|
|
}
|
|
|
|
static inline unsigned long find_next_bit(const unsigned long *addr, unsigned long size,
|
|
unsigned long offset)
|
|
{
|
|
return _find_next_bit(addr, size, offset, 0UL);
|
|
}
|
|
|
|
static inline unsigned long find_next_zero_bit(const unsigned long *addr, unsigned long size,
|
|
unsigned long offset)
|
|
{
|
|
return _find_next_bit(addr, size, offset, ~0UL);
|
|
}
|
|
|
|
static inline unsigned long find_first_zero_bit(const unsigned long *addr, unsigned long size)
|
|
{
|
|
unsigned long idx;
|
|
|
|
for (idx = 0; idx * BITS_PER_LONG < size; idx++) {
|
|
if (addr[idx] != ~0UL)
|
|
return min(idx * BITS_PER_LONG + ffz(addr[idx]), size);
|
|
}
|
|
|
|
return size;
|
|
}
|
|
|
|
#endif /* _PERF_BITOPS_H */
|