mirror of
https://github.com/xen-project/xen.git
synced 2026-10-28 02:01:24 +01:00
Denis Mukhin
b3d31533a0
Introduce some basic infrastructure for doing domain ID allocation unit tests, and add a few tests that ensure correctness of the domain ID allocator. Use <xen-tools/bitops.h> and xen/lib/find-next-bit.c in test hardness code. Adjust find-next-bit.c to be compiled with __XEN_TOOLS__. Signed-off-by: Denis Mukhin <dmukhin@ford.com> Reviewed-by: Anthony PERARD <anthony.perard@vates.tech>
95 lines
2.2 KiB
C
95 lines
2.2 KiB
C
#ifndef __XEN_TOOLS_BITOPS_H__
|
|
#define __XEN_TOOLS_BITOPS_H__
|
|
|
|
/* bitmap operations for single threaded access */
|
|
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
#ifdef __LP64__
|
|
#define BITS_PER_LONG 64
|
|
#else
|
|
#define BITS_PER_LONG 32
|
|
#endif
|
|
|
|
#define ffsl(x) __builtin_ffsl(x)
|
|
|
|
#define BIT_WORD(nr) ((nr) / BITS_PER_LONG)
|
|
|
|
#define BITS_TO_LONGS(bits) \
|
|
(((bits) + BITS_PER_LONG - 1) / BITS_PER_LONG)
|
|
|
|
#define DECLARE_BITMAP(name, bits) \
|
|
unsigned long name[BITS_TO_LONGS(bits)]
|
|
|
|
#define BITMAP_ENTRY(_nr,_bmap) ((_bmap))[(_nr) / 8]
|
|
#define BITMAP_SHIFT(_nr) ((_nr) % 8)
|
|
|
|
/* calculate required space for number of bytes needed to hold nr_bits */
|
|
static inline unsigned long bitmap_size(unsigned long nr_bits)
|
|
{
|
|
return (nr_bits + 7) / 8;
|
|
}
|
|
|
|
static inline void *bitmap_alloc(unsigned long nr_bits)
|
|
{
|
|
unsigned long longs;
|
|
|
|
longs = (nr_bits + BITS_PER_LONG - 1) / BITS_PER_LONG;
|
|
return calloc(longs, sizeof(unsigned long));
|
|
}
|
|
|
|
static inline void bitmap_set(void *addr, unsigned long nr_bits)
|
|
{
|
|
memset(addr, 0xff, bitmap_size(nr_bits));
|
|
}
|
|
|
|
static inline void bitmap_clear(void *addr, unsigned long nr_bits)
|
|
{
|
|
memset(addr, 0, bitmap_size(nr_bits));
|
|
}
|
|
|
|
static inline int test_bit(unsigned long nr, const void *_addr)
|
|
{
|
|
const char *addr = _addr;
|
|
return (BITMAP_ENTRY(nr, addr) >> BITMAP_SHIFT(nr)) & 1;
|
|
}
|
|
|
|
static inline void clear_bit(unsigned long nr, void *_addr)
|
|
{
|
|
char *addr = _addr;
|
|
BITMAP_ENTRY(nr, addr) &= ~(1UL << BITMAP_SHIFT(nr));
|
|
}
|
|
|
|
static inline void set_bit(unsigned long nr, void *_addr)
|
|
{
|
|
char *addr = _addr;
|
|
BITMAP_ENTRY(nr, addr) |= (1UL << BITMAP_SHIFT(nr));
|
|
}
|
|
|
|
static inline int test_and_clear_bit(unsigned long nr, void *addr)
|
|
{
|
|
int oldbit = test_bit(nr, addr);
|
|
clear_bit(nr, addr);
|
|
return oldbit;
|
|
}
|
|
|
|
static inline int test_and_set_bit(unsigned long nr, void *addr)
|
|
{
|
|
int oldbit = test_bit(nr, addr);
|
|
set_bit(nr, addr);
|
|
return oldbit;
|
|
}
|
|
|
|
static inline void bitmap_or(void *_dst, const void *_other,
|
|
unsigned long nr_bits)
|
|
{
|
|
char *dst = _dst;
|
|
const char *other = _other;
|
|
unsigned long i;
|
|
for ( i = 0; i < bitmap_size(nr_bits); ++i )
|
|
dst[i] |= other[i];
|
|
}
|
|
|
|
#endif /* __XEN_TOOLS_BITOPS_H__ */
|