[fio.git] / lib / axmap.c

/*
 * Bitmap of bitmaps, where each layer is number-of-bits-per-word smaller than
 * the previous. Hence an 'axmap', since we axe each previous layer into a
 * much smaller piece. I swear, that is why it's named like that. It has
 * nothing to do with anything remotely narcissistic.
 *
 * A set bit at layer N indicates a full word at layer N-1, and so forth. As
 * the bitmap becomes progressively more full, checking for existence
 * becomes cheaper (since fewer layers are walked, making it a lot more
 * cache friendly) and locating the next free space likewise.
 *
 * Axmaps get pretty close to optimal (1 bit per block) space usage, since
 * layers quickly diminish in size. Doing the size math is straight forward,
 * since we have log64(blocks) layers of maps. For 20000 blocks, overhead
 * is roughly 1.9%, or 1.019 bits per block. The number quickly converges
 * towards 1.0158, or 1.58% of overhead.
 */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>

#include "../arch/arch.h"
#include "axmap.h"
#include "../minmax.h"

#if BITS_PER_LONG == 64
#define UNIT_SHIFT		6
#elif BITS_PER_LONG == 32
#define UNIT_SHIFT		5
#else
#error "Number of arch bits unknown"
#endif

#define BLOCKS_PER_UNIT		(1U << UNIT_SHIFT)
#define BLOCKS_PER_UNIT_MASK	(BLOCKS_PER_UNIT - 1)

static const unsigned long bit_masks[] = {
	0x0000000000000000, 0x0000000000000001, 0x0000000000000003, 0x0000000000000007,
	0x000000000000000f, 0x000000000000001f, 0x000000000000003f, 0x000000000000007f,
	0x00000000000000ff, 0x00000000000001ff, 0x00000000000003ff, 0x00000000000007ff,
	0x0000000000000fff, 0x0000000000001fff, 0x0000000000003fff, 0x0000000000007fff,
	0x000000000000ffff, 0x000000000001ffff, 0x000000000003ffff, 0x000000000007ffff,
	0x00000000000fffff, 0x00000000001fffff, 0x00000000003fffff, 0x00000000007fffff,
	0x0000000000ffffff, 0x0000000001ffffff, 0x0000000003ffffff, 0x0000000007ffffff,
	0x000000000fffffff, 0x000000001fffffff, 0x000000003fffffff, 0x000000007fffffff,
	0x00000000ffffffff,
#if BITS_PER_LONG == 64
	0x00000001ffffffff, 0x00000003ffffffff, 0x00000007ffffffff, 0x0000000fffffffff,
	0x0000001fffffffff, 0x0000003fffffffff, 0x0000007fffffffff, 0x000000ffffffffff,
	0x000001ffffffffff, 0x000003ffffffffff, 0x000007ffffffffff, 0x00000fffffffffff,
	0x00001fffffffffff, 0x00003fffffffffff, 0x00007fffffffffff, 0x0000ffffffffffff,
	0x0001ffffffffffff, 0x0003ffffffffffff, 0x0007ffffffffffff, 0x000fffffffffffff,
	0x001fffffffffffff, 0x003fffffffffffff, 0x007fffffffffffff, 0x00ffffffffffffff,
	0x01ffffffffffffff, 0x03ffffffffffffff, 0x07ffffffffffffff, 0x0fffffffffffffff,
	0x1fffffffffffffff, 0x3fffffffffffffff, 0x7fffffffffffffff, 0xffffffffffffffff
#endif
};

/**
 * struct axmap_level - a bitmap used to implement struct axmap
 * @level: Level index. Each map has at least one level with index zero. The
 *	higher the level index, the fewer bits a struct axmap_level contains.
 * @map_size: Number of elements of the @map array.
 * @map: A bitmap with @map_size elements.
 */
struct axmap_level {
	int level;
	unsigned long map_size;
	unsigned long *map;
};

/**
 * struct axmap - a set that can store numbers 0 .. @nr_bits - 1
 * @nr_level: Number of elements of the @levels array.
 * @levels: struct axmap_level array in which lower levels contain more bits
 *	than higher levels.
 * @nr_bits: One more than the highest value stored in the set.
 */
struct axmap {
	unsigned int nr_levels;
	struct axmap_level *levels;
	uint64_t nr_bits;
};

/* Remove all elements from the @axmap set */
void axmap_reset(struct axmap *axmap)
{
	int i;

	for (i = 0; i < axmap->nr_levels; i++) {
		struct axmap_level *al = &axmap->levels[i];

		memset(al->map, 0, al->map_size * sizeof(unsigned long));
	}
}

void axmap_free(struct axmap *axmap)
{
	unsigned int i;

	if (!axmap)
		return;

	for (i = 0; i < axmap->nr_levels; i++)
		free(axmap->levels[i].map);

	free(axmap->levels);
	free(axmap);
}

/* Allocate memory for a set that can store the numbers 0 .. @nr_bits - 1. */
struct axmap *axmap_new(unsigned long nr_bits)
{
	struct axmap *axmap;
	unsigned int i, levels;

	axmap = malloc(sizeof(*axmap));
	if (!axmap)
		return NULL;

	levels = 1;
	i = (nr_bits + BLOCKS_PER_UNIT - 1) >> UNIT_SHIFT;
	while (i > 1) {
		i = (i + BLOCKS_PER_UNIT - 1) >> UNIT_SHIFT;
		levels++;
	}

	axmap->nr_levels = levels;
	axmap->levels = calloc(axmap->nr_levels, sizeof(struct axmap_level));
	if (!axmap->levels)
		goto free_axmap;
	axmap->nr_bits = nr_bits;

	for (i = 0; i < axmap->nr_levels; i++) {
		struct axmap_level *al = &axmap->levels[i];

		al->level = i;
		al->map_size = (nr_bits + BLOCKS_PER_UNIT - 1) >> UNIT_SHIFT;
		al->map = malloc(al->map_size * sizeof(unsigned long));
		if (!al->map)
			goto free_levels;

		nr_bits = (nr_bits + BLOCKS_PER_UNIT - 1) >> UNIT_SHIFT;
	}

	axmap_reset(axmap);
	return axmap;

free_levels:
	for (i = 0; i < axmap->nr_levels; i++)
		free(axmap->levels[i].map);

	free(axmap->levels);

free_axmap:
	free(axmap);
	return NULL;
}

/*
 * Call @func for each level, starting at level zero, until a level is found
 * for which @func returns true. Return false if none of the @func calls
 * returns true.
 */
static bool axmap_handler(struct axmap *axmap, uint64_t bit_nr,
			  bool (*func)(struct axmap_level *, unsigned long, unsigned int,
			  void *), void *data)
{
	struct axmap_level *al;
	uint64_t index = bit_nr;
	int i;

	for (i = 0; i < axmap->nr_levels; i++) {
		unsigned long offset = index >> UNIT_SHIFT;
		unsigned int bit = index & BLOCKS_PER_UNIT_MASK;

		al = &axmap->levels[i];

		if (func(al, offset, bit, data))
			return true;

		if (index)
			index >>= UNIT_SHIFT;
	}

	return false;
}

/*
 * Call @func for each level, starting at the highest level, until a level is
 * found for which @func returns true. Return false if none of the @func calls
 * returns true.
 */
static bool axmap_handler_topdown(struct axmap *axmap, uint64_t bit_nr,
	bool (*func)(struct axmap_level *, unsigned long, unsigned int, void *))
{
	int i;

	for (i = axmap->nr_levels - 1; i >= 0; i--) {
		unsigned long index = bit_nr >> (UNIT_SHIFT * i);
		unsigned long offset = index >> UNIT_SHIFT;
		unsigned int bit = index & BLOCKS_PER_UNIT_MASK;

		if (func(&axmap->levels[i], offset, bit, NULL))
			return true;
	}

	return false;
}

struct axmap_set_data {
	unsigned int nr_bits;
	unsigned int set_bits;
};

/*
 * Set at most @__data->nr_bits bits in @al at offset @offset. Do not exceed
 * the boundary of the element at offset @offset. Return the number of bits
 * that have been set in @__data->set_bits if @al->level == 0.
 */
static bool axmap_set_fn(struct axmap_level *al, unsigned long offset,
			 unsigned int bit, void *__data)
{
	struct axmap_set_data *data = __data;
	unsigned long mask, overlap;
	unsigned int nr_bits;

	nr_bits = min(data->nr_bits, BLOCKS_PER_UNIT - bit);

	mask = bit_masks[nr_bits] << bit;

	/*
	 * Mask off any potential overlap, only sets contig regions
	 */
	overlap = al->map[offset] & mask;
	if (overlap == mask) {
done:
		data->set_bits = 0;
		return true;
	}

	if (overlap) {
		const int __bit = ffz(~overlap);

		nr_bits = __bit - bit;
		if (!nr_bits)
			goto done;

		mask = bit_masks[nr_bits] << bit;
	}

	assert(mask);
	assert(!(al->map[offset] & mask));
	al->map[offset] |= mask;

	if (!al->level)
		data->set_bits = nr_bits;

	/* For the next level */
	data->nr_bits = 1;

	return al->map[offset] != -1UL;
}

/*
 * Set up to @data->nr_bits starting from @bit_nr in @axmap. Start at
 * @bit_nr. If that bit has not yet been set then set it and continue until
 * either @data->nr_bits have been set or a 1 bit is found. Store the number
 * of bits that have been set in @data->set_bits. It is guaranteed that all
 * bits that have been requested to set fit in the same unsigned long word of
 * level 0 of @axmap.
 */
static void __axmap_set(struct axmap *axmap, uint64_t bit_nr,
			 struct axmap_set_data *data)
{
	unsigned int set_bits, nr_bits = data->nr_bits;

	if (bit_nr > axmap->nr_bits)
		return;
	else if (bit_nr + nr_bits > axmap->nr_bits)
		nr_bits = axmap->nr_bits - bit_nr;

	set_bits = 0;
	while (nr_bits) {
		axmap_handler(axmap, bit_nr, axmap_set_fn, data);
		set_bits += data->set_bits;

		if (!data->set_bits ||
		    data->set_bits != (BLOCKS_PER_UNIT - nr_bits))
			break;

		nr_bits -= data->set_bits;
		bit_nr += data->set_bits;

		data->nr_bits = nr_bits;
	}

	data->set_bits = set_bits;
}

void axmap_set(struct axmap *axmap, uint64_t bit_nr)
{
	struct axmap_set_data data = { .nr_bits = 1, };

	__axmap_set(axmap, bit_nr, &data);
}

/*
 * Set up to @nr_bits starting from @bit in @axmap. Start at @bit. If that
 * bit has not yet been set then set it and continue until either @nr_bits
 * have been set or a 1 bit is found. Return the number of bits that have been
 * set.
 */
unsigned int axmap_set_nr(struct axmap *axmap, uint64_t bit_nr,
			  unsigned int nr_bits)
{
	unsigned int set_bits = 0;

	do {
		struct axmap_set_data data = { .nr_bits = nr_bits, };
		unsigned int max_bits, this_set;

		max_bits = BLOCKS_PER_UNIT - (bit_nr & BLOCKS_PER_UNIT_MASK);
		if (nr_bits > max_bits)
			data.nr_bits = max_bits;

		this_set = data.nr_bits;
		__axmap_set(axmap, bit_nr, &data);
		set_bits += data.set_bits;
		if (data.set_bits != this_set)
			break;

		nr_bits -= data.set_bits;
		bit_nr += data.set_bits;
	} while (nr_bits);

	return set_bits;
}

static bool axmap_isset_fn(struct axmap_level *al, unsigned long offset,
			   unsigned int bit, void *unused)
{
	return (al->map[offset] & (1UL << bit)) != 0;
}

bool axmap_isset(struct axmap *axmap, uint64_t bit_nr)
{
	if (bit_nr <= axmap->nr_bits)
		return axmap_handler_topdown(axmap, bit_nr, axmap_isset_fn);

	return false;
}

/*
 * Find the first free bit that is at least as large as bit_nr.  Return
 * -1 if no free bit is found before the end of the map.
 */
static uint64_t axmap_find_first_free(struct axmap *axmap, uint64_t bit_nr)
{
	int i;
	unsigned long temp;
	unsigned int bit;
	uint64_t offset, base_index, index;
	struct axmap_level *al;

	index = 0;
	for (i = axmap->nr_levels - 1; i >= 0; i--) {
		al = &axmap->levels[i];

		/* Shift previously calculated index for next level */
		index <<= UNIT_SHIFT;

		/*
		 * Start from an index that's at least as large as the
		 * originally passed in bit number.
		 */
		base_index = bit_nr >> (UNIT_SHIFT * i);
		if (index < base_index)
			index = base_index;

		/* Get the offset and bit for this level */
		offset = index >> UNIT_SHIFT;
		bit = index & BLOCKS_PER_UNIT_MASK;

		/*
		 * If the previous level had unused bits in its last
		 * word, the offset could be bigger than the map at
		 * this level. That means no free bits exist before the
		 * end of the map, so return -1.
		 */
		if (offset >= al->map_size)
			return -1ULL;

		/* Check the first word starting with the specific bit */
		temp = ~bit_masks[bit] & ~al->map[offset];
		if (temp)
			goto found;

		/*
		 * No free bit in the first word, so iterate
		 * looking for a word with one or more free bits.
		 */
		for (offset++; offset < al->map_size; offset++) {
			temp = ~al->map[offset];
			if (temp)
				goto found;
		}

		/* Did not find a free bit */
		return -1ULL;

found:
		/* Compute the index of the free bit just found */
		index = (offset << UNIT_SHIFT) + ffz(~temp);
	}

	/* If found an unused bit in the last word of level 0, return -1 */
	if (index >= axmap->nr_bits)
		return -1ULL;

	return index;
}

/*
 * 'bit_nr' is already set. Find the next free bit after this one.
 * Return -1 if no free bits found.
 */
uint64_t axmap_next_free(struct axmap *axmap, uint64_t bit_nr)
{
	uint64_t ret;
	uint64_t next_bit = bit_nr + 1;
	unsigned long temp;
	uint64_t offset;
	unsigned int bit;

	if (bit_nr >= axmap->nr_bits)
		return -1ULL;

	/* If at the end of the map, wrap-around */
	if (next_bit == axmap->nr_bits)
		next_bit = 0;

	offset = next_bit >> UNIT_SHIFT;
	bit = next_bit & BLOCKS_PER_UNIT_MASK;

	/*
	 * As an optimization, do a quick check for a free bit
	 * in the current word at level 0. If not found, do
	 * a topdown search.
	 */
	temp = ~bit_masks[bit] & ~axmap->levels[0].map[offset];
	if (temp) {
		ret = (offset << UNIT_SHIFT) + ffz(~temp);

		/* Might have found an unused bit at level 0 */
		if (ret >= axmap->nr_bits)
			ret = -1ULL;
	} else
		ret = axmap_find_first_free(axmap, next_bit);

	/*
	 * If there are no free bits starting at next_bit and going
	 * to the end of the map, wrap around by searching again
	 * starting at bit 0.
	 */
	if (ret == -1ULL && next_bit != 0)
		ret = axmap_find_first_free(axmap, 0);
	return ret;
}
Commit	Line	Data
7ebd796f JA	1	/*
	2	* Bitmap of bitmaps, where each layer is number-of-bits-per-word smaller than
	3	* the previous. Hence an 'axmap', since we axe each previous layer into a
	4	* much smaller piece. I swear, that is why it's named like that. It has
	5	* nothing to do with anything remotely narcissistic.
	6	*
	7	* A set bit at layer N indicates a full word at layer N-1, and so forth. As
de8f6de9	8	* the bitmap becomes progressively more full, checking for existence
7ebd796f JA	9	* becomes cheaper (since fewer layers are walked, making it a lot more
	10	* cache friendly) and locating the next free space likewise.
	11	*
	12	* Axmaps get pretty close to optimal (1 bit per block) space usage, since
	13	* layers quickly diminish in size. Doing the size math is straight forward,
	14	* since we have log64(blocks) layers of maps. For 20000 blocks, overhead
	15	* is roughly 1.9%, or 1.019 bits per block. The number quickly converges
	16	* towards 1.0158, or 1.58% of overhead.
	17	*/
	18	#include <stdio.h>
	19	#include <stdlib.h>
	20	#include <string.h>
	21	#include <assert.h>
	22
	23	#include "../arch/arch.h"
	24	#include "axmap.h"
7ebd796f JA	25	#include "../minmax.h"
	26
	27	#if BITS_PER_LONG == 64
	28	#define UNIT_SHIFT 6
	29	#elif BITS_PER_LONG == 32
	30	#define UNIT_SHIFT 5
	31	#else
	32	#error "Number of arch bits unknown"
	33	#endif
	34
e6f735f0	35	#define BLOCKS_PER_UNIT (1U << UNIT_SHIFT)
7ebd796f JA	36	#define BLOCKS_PER_UNIT_MASK (BLOCKS_PER_UNIT - 1)
7ebd796f JA	37
76dd186e JA	38	static const unsigned long bit_masks[] = {
	39	0x0000000000000000, 0x0000000000000001, 0x0000000000000003, 0x0000000000000007,
	40	0x000000000000000f, 0x000000000000001f, 0x000000000000003f, 0x000000000000007f,
	41	0x00000000000000ff, 0x00000000000001ff, 0x00000000000003ff, 0x00000000000007ff,
	42	0x0000000000000fff, 0x0000000000001fff, 0x0000000000003fff, 0x0000000000007fff,
	43	0x000000000000ffff, 0x000000000001ffff, 0x000000000003ffff, 0x000000000007ffff,
	44	0x00000000000fffff, 0x00000000001fffff, 0x00000000003fffff, 0x00000000007fffff,
	45	0x0000000000ffffff, 0x0000000001ffffff, 0x0000000003ffffff, 0x0000000007ffffff,
	46	0x000000000fffffff, 0x000000001fffffff, 0x000000003fffffff, 0x000000007fffffff,
	47	0x00000000ffffffff,
	48	#if BITS_PER_LONG == 64
	49	0x00000001ffffffff, 0x00000003ffffffff, 0x00000007ffffffff, 0x0000000fffffffff,
	50	0x0000001fffffffff, 0x0000003fffffffff, 0x0000007fffffffff, 0x000000ffffffffff,
	51	0x000001ffffffffff, 0x000003ffffffffff, 0x000007ffffffffff, 0x00000fffffffffff,
	52	0x00001fffffffffff, 0x00003fffffffffff, 0x00007fffffffffff, 0x0000ffffffffffff,
	53	0x0001ffffffffffff, 0x0003ffffffffffff, 0x0007ffffffffffff, 0x000fffffffffffff,
	54	0x001fffffffffffff, 0x003fffffffffffff, 0x007fffffffffffff, 0x00ffffffffffffff,
	55	0x01ffffffffffffff, 0x03ffffffffffffff, 0x07ffffffffffffff, 0x0fffffffffffffff,
	56	0x1fffffffffffffff, 0x3fffffffffffffff, 0x7fffffffffffffff, 0xffffffffffffffff
	57	#endif
	58	};
	59
c7143018 BVA	60	/**
	61	* struct axmap_level - a bitmap used to implement struct axmap
	62	* @level: Level index. Each map has at least one level with index zero. The
	63	* higher the level index, the fewer bits a struct axmap_level contains.
	64	* @map_size: Number of elements of the @map array.
	65	* @map: A bitmap with @map_size elements.
	66	*/
7ebd796f JA	67	struct axmap_level {
	68	int level;
	69	unsigned long map_size;
	70	unsigned long *map;
	71	};
	72
c7143018 BVA	73	/**
	74	* struct axmap - a set that can store numbers 0 .. @nr_bits - 1
	75	* @nr_level: Number of elements of the @levels array.
	76	* @levels: struct axmap_level array in which lower levels contain more bits
	77	* than higher levels.
	78	* @nr_bits: One more than the highest value stored in the set.
	79	*/
7ebd796f JA	80	struct axmap {
	81	unsigned int nr_levels;
	82	struct axmap_level *levels;
47d94b0b	83	uint64_t nr_bits;
7ebd796f JA	84	};
7ebd796f JA	85
c7143018	86	/* Remove all elements from the @axmap set */
7ebd796f JA	87	void axmap_reset(struct axmap *axmap)
	88	{
	89	int i;
	90
	91	for (i = 0; i < axmap->nr_levels; i++) {
	92	struct axmap_level *al = &axmap->levels[i];
	93
	94	memset(al->map, 0, al->map_size * sizeof(unsigned long));
	95	}
	96	}
	97
	98	void axmap_free(struct axmap *axmap)
	99	{
	100	unsigned int i;
	101
	102	if (!axmap)
	103	return;
	104
	105	for (i = 0; i < axmap->nr_levels; i++)
aded30f7	106	free(axmap->levels[i].map);
7ebd796f	107
aded30f7 JA	108	free(axmap->levels);
aded30f7 JA	109	free(axmap);
7ebd796f JA	110	}
7ebd796f JA	111
c7143018	112	/* Allocate memory for a set that can store the numbers 0 .. @nr_bits - 1. */
7ebd796f JA	113	struct axmap *axmap_new(unsigned long nr_bits)
	114	{
	115	struct axmap *axmap;
	116	unsigned int i, levels;
	117
aded30f7	118	axmap = malloc(sizeof(*axmap));
7ebd796f JA	119	if (!axmap)
	120	return NULL;
	121
	122	levels = 1;
	123	i = (nr_bits + BLOCKS_PER_UNIT - 1) >> UNIT_SHIFT;
	124	while (i > 1) {
	125	i = (i + BLOCKS_PER_UNIT - 1) >> UNIT_SHIFT;
	126	levels++;
	127	}
	128
	129	axmap->nr_levels = levels;
2404b2c3	130	axmap->levels = calloc(axmap->nr_levels, sizeof(struct axmap_level));
70c0f356 BVA	131	if (!axmap->levels)
70c0f356 BVA	132	goto free_axmap;
47d94b0b	133	axmap->nr_bits = nr_bits;
7ebd796f JA	134
	135	for (i = 0; i < axmap->nr_levels; i++) {
	136	struct axmap_level *al = &axmap->levels[i];
	137
	138	al->level = i;
	139	al->map_size = (nr_bits + BLOCKS_PER_UNIT - 1) >> UNIT_SHIFT;
aded30f7	140	al->map = malloc(al->map_size * sizeof(unsigned long));
7ebd796f	141	if (!al->map)
70c0f356	142	goto free_levels;
7ebd796f JA	143
	144	nr_bits = (nr_bits + BLOCKS_PER_UNIT - 1) >> UNIT_SHIFT;
	145	}
	146
	147	axmap_reset(axmap);
	148	return axmap;
70c0f356 BVA	149
70c0f356 BVA	150	free_levels:
7ebd796f	151	for (i = 0; i < axmap->nr_levels; i++)
70c0f356	152	free(axmap->levels[i].map);
7ebd796f	153
aded30f7	154	free(axmap->levels);
70c0f356 BVA	155
70c0f356 BVA	156	free_axmap:
bb1116fe	157	free(axmap);
7ebd796f JA	158	return NULL;
	159	}
	160
c7143018 BVA	161	/*
	162	* Call @func for each level, starting at level zero, until a level is found
	163	* for which @func returns true. Return false if none of the @func calls
	164	* returns true.
	165	*/
e39c0676 JA	166	static bool axmap_handler(struct axmap *axmap, uint64_t bit_nr,
e39c0676 JA	167	bool (func)(struct axmap_level , unsigned long, unsigned int,
7ebd796f JA	168	void ), void data)
	169	{
	170	struct axmap_level *al;
edfca254	171	uint64_t index = bit_nr;
7ebd796f JA	172	int i;
	173
	174	for (i = 0; i < axmap->nr_levels; i++) {
7ebd796f JA	175	unsigned long offset = index >> UNIT_SHIFT;
	176	unsigned int bit = index & BLOCKS_PER_UNIT_MASK;
	177
	178	al = &axmap->levels[i];
	179
	180	if (func(al, offset, bit, data))
e39c0676	181	return true;
edfca254 JA	182
	183	if (index)
	184	index >>= UNIT_SHIFT;
7ebd796f JA	185	}
7ebd796f JA	186
e39c0676	187	return false;
7ebd796f JA	188	}
7ebd796f JA	189
c7143018 BVA	190	/*
	191	* Call @func for each level, starting at the highest level, until a level is
	192	* found for which @func returns true. Return false if none of the @func calls
	193	* returns true.
	194	*/
e39c0676	195	static bool axmap_handler_topdown(struct axmap *axmap, uint64_t bit_nr,
c406445a	196	bool (func)(struct axmap_level , unsigned long, unsigned int, void *))
7ebd796f	197	{
76dd186e	198	int i;
7ebd796f JA	199
7ebd796f JA	200	for (i = axmap->nr_levels - 1; i >= 0; i--) {
a1a4ab81	201	unsigned long index = bit_nr >> (UNIT_SHIFT * i);
7ebd796f JA	202	unsigned long offset = index >> UNIT_SHIFT;
	203	unsigned int bit = index & BLOCKS_PER_UNIT_MASK;
	204
41264298	205	if (func(&axmap->levels[i], offset, bit, NULL))
e39c0676	206	return true;
7ebd796f JA	207	}
7ebd796f JA	208
e39c0676	209	return false;
7ebd796f JA	210	}
7ebd796f JA	211
7ebd796f JA	212	struct axmap_set_data {
	213	unsigned int nr_bits;
	214	unsigned int set_bits;
7ebd796f JA	215	};
7ebd796f JA	216
c7143018 BVA	217	/*
	218	* Set at most @__data->nr_bits bits in @al at offset @offset. Do not exceed
	219	* the boundary of the element at offset @offset. Return the number of bits
	220	* that have been set in @__data->set_bits if @al->level == 0.
	221	*/
e39c0676	222	static bool axmap_set_fn(struct axmap_level *al, unsigned long offset,
7ebd796f JA	223	unsigned int bit, void *__data)
	224	{
	225	struct axmap_set_data *data = __data;
	226	unsigned long mask, overlap;
	227	unsigned int nr_bits;
	228
	229	nr_bits = min(data->nr_bits, BLOCKS_PER_UNIT - bit);
	230
	231	mask = bit_masks[nr_bits] << bit;
	232
	233	/*
	234	* Mask off any potential overlap, only sets contig regions
	235	*/
	236	overlap = al->map[offset] & mask;
bd71edce JA	237	if (overlap == mask) {
	238	done:
	239	data->set_bits = 0;
e39c0676	240	return true;
bd71edce	241	}
7ebd796f	242
8cd5a2fd JA	243	if (overlap) {
8cd5a2fd JA	244	const int __bit = ffz(~overlap);
7ebd796f	245
c2e48e0e JA	246	nr_bits = __bit - bit;
c2e48e0e JA	247	if (!nr_bits)
bd71edce	248	goto done;
8cd5a2fd	249
8cd5a2fd	250	mask = bit_masks[nr_bits] << bit;
7ebd796f JA	251	}
	252
	253	assert(mask);
	254	assert(!(al->map[offset] & mask));
7ebd796f JA	255	al->map[offset] \|= mask;
	256
	257	if (!al->level)
	258	data->set_bits = nr_bits;
	259
c7143018	260	/* For the next level */
7ebd796f	261	data->nr_bits = 1;
c7143018	262
7ebd796f JA	263	return al->map[offset] != -1UL;
	264	}
	265
c7143018 BVA	266	/*
	267	* Set up to @data->nr_bits starting from @bit_nr in @axmap. Start at
	268	* @bit_nr. If that bit has not yet been set then set it and continue until
	269	* either @data->nr_bits have been set or a 1 bit is found. Store the number
	270	* of bits that have been set in @data->set_bits. It is guaranteed that all
	271	* bits that have been requested to set fit in the same unsigned long word of
	272	* level 0 of @axmap.
	273	*/
7ebd796f JA	274	static void __axmap_set(struct axmap *axmap, uint64_t bit_nr,
	275	struct axmap_set_data *data)
	276	{
	277	unsigned int set_bits, nr_bits = data->nr_bits;
	278
47d94b0b JA	279	if (bit_nr > axmap->nr_bits)
	280	return;
	281	else if (bit_nr + nr_bits > axmap->nr_bits)
	282	nr_bits = axmap->nr_bits - bit_nr;
	283
7ebd796f JA	284	set_bits = 0;
	285	while (nr_bits) {
	286	axmap_handler(axmap, bit_nr, axmap_set_fn, data);
	287	set_bits += data->set_bits;
	288
0bfdf9f1 JA	289	if (!data->set_bits \|\|
0bfdf9f1 JA	290	data->set_bits != (BLOCKS_PER_UNIT - nr_bits))
7ebd796f JA	291	break;
	292
	293	nr_bits -= data->set_bits;
	294	bit_nr += data->set_bits;
	295
	296	data->nr_bits = nr_bits;
7ebd796f JA	297	}
	298
	299	data->set_bits = set_bits;
	300	}
	301
	302	void axmap_set(struct axmap *axmap, uint64_t bit_nr)
	303	{
	304	struct axmap_set_data data = { .nr_bits = 1, };
	305
	306	__axmap_set(axmap, bit_nr, &data);
	307	}
	308
c7143018 BVA	309	/*
	310	* Set up to @nr_bits starting from @bit in @axmap. Start at @bit. If that
	311	* bit has not yet been set then set it and continue until either @nr_bits
	312	* have been set or a 1 bit is found. Return the number of bits that have been
	313	* set.
	314	*/
e39c0676 JA	315	unsigned int axmap_set_nr(struct axmap *axmap, uint64_t bit_nr,
e39c0676 JA	316	unsigned int nr_bits)
7ebd796f	317	{
0bfdf9f1 JA	318	unsigned int set_bits = 0;
	319
	320	do {
09d6bf09	321	struct axmap_set_data data = { .nr_bits = nr_bits, };
0bfdf9f1 JA	322	unsigned int max_bits, this_set;
	323
	324	max_bits = BLOCKS_PER_UNIT - (bit_nr & BLOCKS_PER_UNIT_MASK);
bd71edce	325	if (nr_bits > max_bits)
0bfdf9f1 JA	326	data.nr_bits = max_bits;
	327
	328	this_set = data.nr_bits;
	329	__axmap_set(axmap, bit_nr, &data);
	330	set_bits += data.set_bits;
	331	if (data.set_bits != this_set)
	332	break;
7ebd796f	333
0bfdf9f1 JA	334	nr_bits -= data.set_bits;
	335	bit_nr += data.set_bits;
	336	} while (nr_bits);
	337
	338	return set_bits;
7ebd796f JA	339	}
7ebd796f JA	340
e39c0676 JA	341	static bool axmap_isset_fn(struct axmap_level *al, unsigned long offset,
e39c0676 JA	342	unsigned int bit, void *unused)
7ebd796f JA	343	{
	344	return (al->map[offset] & (1UL << bit)) != 0;
	345	}
	346
e39c0676	347	bool axmap_isset(struct axmap *axmap, uint64_t bit_nr)
7ebd796f	348	{
ac569176	349	if (bit_nr <= axmap->nr_bits)
c406445a	350	return axmap_handler_topdown(axmap, bit_nr, axmap_isset_fn);
47d94b0b	351
e39c0676	352	return false;
7ebd796f JA	353	}
7ebd796f JA	354
b9304c5b MK	355	/*
	356	* Find the first free bit that is at least as large as bit_nr. Return
	357	* -1 if no free bit is found before the end of the map.
	358	*/
	359	static uint64_t axmap_find_first_free(struct axmap *axmap, uint64_t bit_nr)
7ebd796f	360	{
731ef4c7	361	int i;
b9304c5b MK	362	unsigned long temp;
	363	unsigned int bit;
	364	uint64_t offset, base_index, index;
	365	struct axmap_level *al;
7ebd796f	366
b9304c5b MK	367	index = 0;
	368	for (i = axmap->nr_levels - 1; i >= 0; i--) {
	369	al = &axmap->levels[i];
7ebd796f	370
b9304c5b MK	371	/* Shift previously calculated index for next level */
	372	index <<= UNIT_SHIFT;
	373
	374	/*
	375	* Start from an index that's at least as large as the
	376	* originally passed in bit number.
	377	*/
	378	base_index = bit_nr >> (UNIT_SHIFT * i);
	379	if (index < base_index)
	380	index = base_index;
	381
	382	/* Get the offset and bit for this level */
	383	offset = index >> UNIT_SHIFT;
	384	bit = index & BLOCKS_PER_UNIT_MASK;
	385
	386	/*
	387	* If the previous level had unused bits in its last
	388	* word, the offset could be bigger than the map at
	389	* this level. That means no free bits exist before the
	390	* end of the map, so return -1.
	391	*/
	392	if (offset >= al->map_size)
	393	return -1ULL;
	394
	395	/* Check the first word starting with the specific bit */
	396	temp = ~bit_masks[bit] & ~al->map[offset];
	397	if (temp)
	398	goto found;
	399
	400	/*
	401	* No free bit in the first word, so iterate
	402	* looking for a word with one or more free bits.
	403	*/
	404	for (offset++; offset < al->map_size; offset++) {
	405	temp = ~al->map[offset];
	406	if (temp)
	407	goto found;
7ebd796f	408	}
47d94b0b	409
b9304c5b MK	410	/* Did not find a free bit */
b9304c5b MK	411	return -1ULL;
7ebd796f	412
b9304c5b MK	413	found:
	414	/* Compute the index of the free bit just found */
	415	index = (offset << UNIT_SHIFT) + ffz(~temp);
7ebd796f JA	416	}
7ebd796f JA	417
b9304c5b MK	418	/* If found an unused bit in the last word of level 0, return -1 */
	419	if (index >= axmap->nr_bits)
	420	return -1ULL;
	421
	422	return index;
7ebd796f JA	423	}
	424
	425	/*
	426	* 'bit_nr' is already set. Find the next free bit after this one.
b9304c5b	427	* Return -1 if no free bits found.
7ebd796f JA	428	*/
	429	uint64_t axmap_next_free(struct axmap *axmap, uint64_t bit_nr)
	430	{
53737ae0	431	uint64_t ret;
b9304c5b MK	432	uint64_t next_bit = bit_nr + 1;
	433	unsigned long temp;
	434	uint64_t offset;
	435	unsigned int bit;
7ebd796f	436
b9304c5b MK	437	if (bit_nr >= axmap->nr_bits)
b9304c5b MK	438	return -1ULL;
12bde369	439
b9304c5b MK	440	/* If at the end of the map, wrap-around */
	441	if (next_bit == axmap->nr_bits)
	442	next_bit = 0;
7ebd796f	443
b9304c5b MK	444	offset = next_bit >> UNIT_SHIFT;
b9304c5b MK	445	bit = next_bit & BLOCKS_PER_UNIT_MASK;
7ebd796f	446
53737ae0	447	/*
b9304c5b MK	448	* As an optimization, do a quick check for a free bit
	449	* in the current word at level 0. If not found, do
	450	* a topdown search.
53737ae0	451	*/
b9304c5b MK	452	temp = ~bit_masks[bit] & ~axmap->levels[0].map[offset];
	453	if (temp) {
	454	ret = (offset << UNIT_SHIFT) + ffz(~temp);
53737ae0	455
b9304c5b MK	456	/* Might have found an unused bit at level 0 */
	457	if (ret >= axmap->nr_bits)
	458	ret = -1ULL;
	459	} else
	460	ret = axmap_find_first_free(axmap, next_bit);
	461
	462	/*
	463	* If there are no free bits starting at next_bit and going
	464	* to the end of the map, wrap around by searching again
	465	* starting at bit 0.
	466	*/
	467	if (ret == -1ULL && next_bit != 0)
	468	ret = axmap_find_first_free(axmap, 0);
	469	return ret;
7ebd796f	470	}