[fio.git] / smalloc.c

/*
 * simple memory allocator, backed by mmap() so that it hands out memory
 * that can be shared across processes and threads
 */
#include <sys/mman.h>
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <string.h>
#include <unistd.h>
#include <sys/types.h>
#include <limits.h>

#include "mutex.h"

#define MP_SAFE			/* define to make thread safe */
#define SMALLOC_REDZONE		/* define to detect memory corruption */

#define SMALLOC_BPB	32	/* block size, bytes-per-bit in bitmap */
#define SMALLOC_BPI	(sizeof(unsigned int) * 8)
#define SMALLOC_BPL	(SMALLOC_BPB * SMALLOC_BPI)

#define INITIAL_SIZE	1024*1024	/* new pool size */
#define MAX_POOLS	4		/* maximum number of pools to setup */

#define SMALLOC_PRE_RED		0xdeadbeefU
#define SMALLOC_POST_RED	0x5aa55aa5U

unsigned int smalloc_pool_size = INITIAL_SIZE;

struct pool {
	struct fio_mutex *lock;			/* protects this pool */
	void *map;				/* map of blocks */
	unsigned int *bitmap;			/* blocks free/busy map */
	unsigned int free_blocks;		/* free blocks */
	unsigned int nr_blocks;			/* total blocks */
	unsigned int next_non_full;
	int fd;					/* memory backing fd */
	char file[PATH_MAX];			/* filename for fd */
	unsigned int mmap_size;
};

struct block_hdr {
	unsigned int size;
#ifdef SMALLOC_REDZONE
	unsigned int prered;
#endif
};

static struct pool mp[MAX_POOLS];
static unsigned int nr_pools;
static unsigned int last_pool;
static struct fio_mutex *lock;

static inline void pool_lock(struct pool *pool)
{
	if (pool->lock)
		fio_mutex_down(pool->lock);
}

static inline void pool_unlock(struct pool *pool)
{
	if (pool->lock)
		fio_mutex_up(pool->lock);
}

static inline void global_read_lock(void)
{
	if (lock)
		fio_mutex_down_read(lock);
}

static inline void global_read_unlock(void)
{
	if (lock)
		fio_mutex_up_read(lock);
}

static inline void global_write_lock(void)
{
	if (lock)
		fio_mutex_down_write(lock);
}

static inline void global_write_unlock(void)
{
	if (lock)
		fio_mutex_up_write(lock);
}

static inline int ptr_valid(struct pool *pool, void *ptr)
{
	unsigned int pool_size = pool->nr_blocks * SMALLOC_BPL;

	return (ptr >= pool->map) && (ptr < pool->map + pool_size);
}

static inline unsigned int size_to_blocks(unsigned int size)
{
	return (size + SMALLOC_BPB - 1) / SMALLOC_BPB;
}

static int blocks_iter(struct pool *pool, unsigned int pool_idx,
		       unsigned int idx, unsigned int nr_blocks,
		       int (*func)(unsigned int *map, unsigned int mask))
{

	while (nr_blocks) {
		unsigned int this_blocks, mask;
		unsigned int *map;

		if (pool_idx >= pool->nr_blocks)
			return 0;

		map = &pool->bitmap[pool_idx];

		this_blocks = nr_blocks;
		if (this_blocks + idx > SMALLOC_BPI) {
			this_blocks = SMALLOC_BPI - idx;
			idx = SMALLOC_BPI - this_blocks;
		}

		if (this_blocks == SMALLOC_BPI)
			mask = -1U;
		else
			mask = ((1U << this_blocks) - 1) << idx;

		if (!func(map, mask))
			return 0;

		nr_blocks -= this_blocks;
		idx = 0;
		pool_idx++;
	}

	return 1;
}

static int mask_cmp(unsigned int *map, unsigned int mask)
{
	return !(*map & mask);
}

static int mask_clear(unsigned int *map, unsigned int mask)
{
	assert((*map & mask) == mask);
	*map &= ~mask;
	return 1;
}

static int mask_set(unsigned int *map, unsigned int mask)
{
	assert(!(*map & mask));
	*map |= mask;
	return 1;
}

static int blocks_free(struct pool *pool, unsigned int pool_idx,
		       unsigned int idx, unsigned int nr_blocks)
{
	return blocks_iter(pool, pool_idx, idx, nr_blocks, mask_cmp);
}

static void set_blocks(struct pool *pool, unsigned int pool_idx,
		       unsigned int idx, unsigned int nr_blocks)
{
	blocks_iter(pool, pool_idx, idx, nr_blocks, mask_set);
}

static void clear_blocks(struct pool *pool, unsigned int pool_idx,
			 unsigned int idx, unsigned int nr_blocks)
{
	blocks_iter(pool, pool_idx, idx, nr_blocks, mask_clear);
}

static inline int __ffs(int word)
{
	int r = 0;

	if (!(word & 0xffff)) {
		word >>= 16;
		r += 16;
	}
	if (!(word & 0xff)) {
		word >>= 8;
		r += 8;
	}
	if (!(word & 0xf)) {
		word >>= 4;
		r += 4;
	}
	if (!(word & 3)) {
		word >>= 2;
		r += 2;
	}
	if (!(word & 1)) {
		word >>= 1;
		r += 1;
	}

	return r;
}

static int find_next_zero(int word, int start)
{
	assert(word != -1U);
	word >>= (start + 1);
	return __ffs(~word) + start + 1;
}

static int add_pool(struct pool *pool, unsigned int alloc_size)
{
	void *ptr;
	int fd, bitmap_blocks;

	strcpy(pool->file, "/tmp/.fio_smalloc.XXXXXX");
	fd = mkstemp(pool->file);
	if (fd < 0)
		goto out_close;

#ifdef SMALLOC_REDZONE
	alloc_size += sizeof(unsigned int);
#endif
	alloc_size += sizeof(struct block_hdr);
	if (alloc_size < INITIAL_SIZE)
		alloc_size = INITIAL_SIZE;

	/* round up to nearest full number of blocks */
	alloc_size = (alloc_size + SMALLOC_BPL - 1) & ~(SMALLOC_BPL - 1);
	bitmap_blocks = alloc_size / SMALLOC_BPL;
	alloc_size += bitmap_blocks * sizeof(unsigned int);
	pool->mmap_size = alloc_size;
	
	pool->nr_blocks = bitmap_blocks;
	pool->free_blocks = bitmap_blocks * SMALLOC_BPB;

	if (ftruncate(fd, alloc_size) < 0)
		goto out_unlink;

	ptr = mmap(NULL, alloc_size, PROT_READ|PROT_WRITE, MAP_SHARED, fd, 0);
	if (ptr == MAP_FAILED)
		goto out_unlink;

	memset(ptr, 0, alloc_size);
	pool->map = ptr;
	pool->bitmap = (void *) ptr + (pool->nr_blocks * SMALLOC_BPL);

#ifdef MP_SAFE
	pool->lock = fio_mutex_init(1);
	if (!pool->lock)
		goto out_unlink;
#endif

	pool->fd = fd;

	global_write_lock();
	nr_pools++;
	global_write_unlock();
	return 0;
out_unlink:
	fprintf(stderr, "smalloc: failed adding pool\n");
	if (pool->map)
		munmap(pool->map, pool->mmap_size);
	unlink(pool->file);
out_close:
	if (fd >= 0)
		close(fd);
	return 1;
}

void sinit(void)
{
	int ret;

#ifdef MP_SAFE
	lock = fio_mutex_rw_init();
#endif
	ret = add_pool(&mp[0], INITIAL_SIZE);
	assert(!ret);
}

static void cleanup_pool(struct pool *pool)
{
	unlink(pool->file);
	close(pool->fd);
	munmap(pool->map, pool->mmap_size);

	if (pool->lock)
		fio_mutex_remove(pool->lock);
}

void scleanup(void)
{
	unsigned int i;

	for (i = 0; i < nr_pools; i++)
		cleanup_pool(&mp[i]);

	if (lock)
		fio_mutex_remove(lock);
}

static void fill_redzone(struct block_hdr *hdr)
{
#ifdef SMALLOC_REDZONE
	unsigned int *postred = (void *) hdr + hdr->size - sizeof(unsigned int);

	hdr->prered = SMALLOC_PRE_RED;
	*postred = SMALLOC_POST_RED;
#endif
}

static void sfree_check_redzone(struct block_hdr *hdr)
{
#ifdef SMALLOC_REDZONE
	unsigned int *postred = (void *) hdr + hdr->size - sizeof(unsigned int);

	if (hdr->prered != SMALLOC_PRE_RED) {
		fprintf(stderr, "smalloc pre redzone destroyed!\n");
		fprintf(stderr, "  ptr=%p, prered=%x, expected %x\n",
				hdr, hdr->prered, SMALLOC_PRE_RED);
		assert(0);
	}
	if (*postred != SMALLOC_POST_RED) {
		fprintf(stderr, "smalloc post redzone destroyed!\n");
		fprintf(stderr, "  ptr=%p, postred=%x, expected %x\n",
				hdr, *postred, SMALLOC_POST_RED);
		assert(0);
	}
#endif
}

static void sfree_pool(struct pool *pool, void *ptr)
{
	struct block_hdr *hdr;
	unsigned int i, idx;
	unsigned long offset;

	if (!ptr)
		return;

	ptr -= sizeof(*hdr);
	hdr = ptr;

	assert(ptr_valid(pool, ptr));

	sfree_check_redzone(hdr);

	offset = ptr - pool->map;
	i = offset / SMALLOC_BPL;
	idx = (offset % SMALLOC_BPL) / SMALLOC_BPB;

	pool_lock(pool);
	clear_blocks(pool, i, idx, size_to_blocks(hdr->size));
	if (i < pool->next_non_full)
		pool->next_non_full = i;
	pool->free_blocks += size_to_blocks(hdr->size);
	pool_unlock(pool);
}

void sfree(void *ptr)
{
	struct pool *pool = NULL;
	unsigned int i;

	if (!ptr)
		return;

	global_read_lock();

	for (i = 0; i < nr_pools; i++) {
		if (ptr_valid(&mp[i], ptr)) {
			pool = &mp[i];
			break;
		}
	}

	global_read_unlock();

	assert(pool);
	sfree_pool(pool, ptr);
}

static void *__smalloc_pool(struct pool *pool, unsigned int size)
{
	unsigned int nr_blocks;
	unsigned int i;
	unsigned int offset;
	unsigned int last_idx;
	void *ret = NULL;

	pool_lock(pool);

	nr_blocks = size_to_blocks(size);
	if (nr_blocks > pool->free_blocks)
		goto fail;

	i = pool->next_non_full;
	last_idx = 0;
	offset = -1U;
	while (i < pool->nr_blocks) {
		unsigned int idx;

		if (pool->bitmap[i] == -1U) {
			i++;
			pool->next_non_full = i;
			last_idx = 0;
			continue;
		}

		idx = find_next_zero(pool->bitmap[i], last_idx);
		if (!blocks_free(pool, i, idx, nr_blocks)) {
			idx += nr_blocks;
			if (idx < SMALLOC_BPI)
				last_idx = idx;
			else {
				last_idx = 0;
				while (idx >= SMALLOC_BPI) {
					i++;
					idx -= SMALLOC_BPI;
				}
			}
			continue;
		}
		set_blocks(pool, i, idx, nr_blocks);
		offset = i * SMALLOC_BPL + idx * SMALLOC_BPB;
		break;
	}

	if (i < pool->nr_blocks) {
		pool->free_blocks -= nr_blocks;
		ret = pool->map + offset;
	}
fail:
	pool_unlock(pool);
	return ret;
}

static void *smalloc_pool(struct pool *pool, unsigned int size)
{
	struct block_hdr *hdr;
	unsigned int alloc_size;
	void *ptr;

	alloc_size = size + sizeof(*hdr);
#ifdef SMALLOC_REDZONE
	alloc_size += sizeof(unsigned int);
#endif

	ptr = __smalloc_pool(pool, alloc_size);
	if (!ptr)
		return NULL;

	hdr = ptr;
	hdr->size = alloc_size;
	ptr += sizeof(*hdr);

	fill_redzone(hdr);

	memset(ptr, 0, size);
	return ptr;
}

void *smalloc(unsigned int size)
{
	unsigned int i;

	global_read_lock();
	i = last_pool;

	do {
		for (; i < nr_pools; i++) {
			void *ptr = smalloc_pool(&mp[i], size);

			if (ptr) {
				last_pool = i;
				global_read_unlock();
				return ptr;
			}
		}
		if (last_pool) {
			last_pool = 0;
			continue;
		}

		if (nr_pools + 1 > MAX_POOLS)
			break;
		else {
			i = nr_pools;
			global_read_unlock();
			if (add_pool(&mp[nr_pools], size))
				goto out;
			global_read_lock();
		}
	} while (1);

	global_read_unlock();
out:
	return NULL;
}

char *smalloc_strdup(const char *str)
{
	char *ptr;

	ptr = smalloc(strlen(str) + 1);
	strcpy(ptr, str);
	return ptr;
}
Commit	Line	Data
d24c33a4 JA	1	/*
	2	* simple memory allocator, backed by mmap() so that it hands out memory
	3	* that can be shared across processes and threads
	4	*/
	5	#include <sys/mman.h>
	6	#include <stdio.h>
	7	#include <stdlib.h>
	8	#include <assert.h>
	9	#include <string.h>
	10	#include <unistd.h>
	11	#include <sys/types.h>
	12	#include <limits.h>
	13
	14	#include "mutex.h"
	15
1f37f636	16	#define MP_SAFE /* define to make thread safe */
55f6491d	17	#define SMALLOC_REDZONE /* define to detect memory corruption */
d24c33a4	18
ec996e9c JA	19	#define SMALLOC_BPB 32 /* block size, bytes-per-bit in bitmap */
	20	#define SMALLOC_BPI (sizeof(unsigned int) * 8)
	21	#define SMALLOC_BPL (SMALLOC_BPB * SMALLOC_BPI)
	22
	23	#define INITIAL_SIZE 10241024 / new pool size */
c5dda9e3	24	#define MAX_POOLS 4 /* maximum number of pools to setup */
d24c33a4	25
55f6491d JA	26	#define SMALLOC_PRE_RED 0xdeadbeefU
55f6491d JA	27	#define SMALLOC_POST_RED 0x5aa55aa5U
55f6491d	28
2b386d25 JA	29	unsigned int smalloc_pool_size = INITIAL_SIZE;
2b386d25 JA	30
d24c33a4 JA	31	struct pool {
	32	struct fio_mutex lock; / protects this pool */
	33	void map; / map of blocks */
ec996e9c JA	34	unsigned int bitmap; / blocks free/busy map */
	35	unsigned int free_blocks; /* free blocks */
	36	unsigned int nr_blocks; /* total blocks */
	37	unsigned int next_non_full;
d24c33a4 JA	38	int fd; /* memory backing fd */
d24c33a4 JA	39	char file[PATH_MAX]; /* filename for fd */
ec996e9c JA	40	unsigned int mmap_size;
	41	};
	42
	43	struct block_hdr {
	44	unsigned int size;
	45	#ifdef SMALLOC_REDZONE
	46	unsigned int prered;
	47	#endif
d24c33a4 JA	48	};
	49
	50	static struct pool mp[MAX_POOLS];
	51	static unsigned int nr_pools;
	52	static unsigned int last_pool;
	53	static struct fio_mutex *lock;
	54
d24c33a4 JA	55	static inline void pool_lock(struct pool *pool)
	56	{
	57	if (pool->lock)
	58	fio_mutex_down(pool->lock);
	59	}
	60
	61	static inline void pool_unlock(struct pool *pool)
	62	{
	63	if (pool->lock)
	64	fio_mutex_up(pool->lock);
	65	}
	66
65864cf7	67	static inline void global_read_lock(void)
d24c33a4 JA	68	{
d24c33a4 JA	69	if (lock)
65864cf7	70	fio_mutex_down_read(lock);
d24c33a4 JA	71	}
d24c33a4 JA	72
65864cf7	73	static inline void global_read_unlock(void)
d24c33a4 JA	74	{
d24c33a4 JA	75	if (lock)
65864cf7 JA	76	fio_mutex_up_read(lock);
	77	}
	78
	79	static inline void global_write_lock(void)
	80	{
	81	if (lock)
	82	fio_mutex_down_write(lock);
	83	}
	84
	85	static inline void global_write_unlock(void)
	86	{
	87	if (lock)
	88	fio_mutex_up_write(lock);
d24c33a4 JA	89	}
d24c33a4 JA	90
d24c33a4 JA	91	static inline int ptr_valid(struct pool pool, void ptr)
d24c33a4 JA	92	{
dcb69098	93	unsigned int pool_size = pool->nr_blocks * SMALLOC_BPL;
ec996e9c JA	94
ec996e9c JA	95	return (ptr >= pool->map) && (ptr < pool->map + pool_size);
d24c33a4 JA	96	}
d24c33a4 JA	97
808e9ea8 JA	98	static inline unsigned int size_to_blocks(unsigned int size)
	99	{
	100	return (size + SMALLOC_BPB - 1) / SMALLOC_BPB;
	101	}
	102
dcb69098 JA	103	static int blocks_iter(struct pool *pool, unsigned int pool_idx,
dcb69098 JA	104	unsigned int idx, unsigned int nr_blocks,
ec996e9c	105	int (func)(unsigned int map, unsigned int mask))
d24c33a4	106	{
dcb69098	107
ec996e9c JA	108	while (nr_blocks) {
ec996e9c JA	109	unsigned int this_blocks, mask;
dcb69098 JA	110	unsigned int *map;
	111
	112	if (pool_idx >= pool->nr_blocks)
	113	return 0;
	114
	115	map = &pool->bitmap[pool_idx];
ec996e9c JA	116
	117	this_blocks = nr_blocks;
	118	if (this_blocks + idx > SMALLOC_BPI) {
	119	this_blocks = SMALLOC_BPI - idx;
	120	idx = SMALLOC_BPI - this_blocks;
	121	}
	122
	123	if (this_blocks == SMALLOC_BPI)
	124	mask = -1U;
	125	else
	126	mask = ((1U << this_blocks) - 1) << idx;
	127
	128	if (!func(map, mask))
	129	return 0;
	130
	131	nr_blocks -= this_blocks;
	132	idx = 0;
dcb69098	133	pool_idx++;
ec996e9c JA	134	}
	135
	136	return 1;
d24c33a4 JA	137	}
d24c33a4 JA	138
ec996e9c	139	static int mask_cmp(unsigned int *map, unsigned int mask)
d24c33a4	140	{
ec996e9c	141	return !(*map & mask);
d24c33a4 JA	142	}
d24c33a4 JA	143
ec996e9c	144	static int mask_clear(unsigned int *map, unsigned int mask)
d24c33a4	145	{
dcb69098	146	assert((*map & mask) == mask);
ec996e9c JA	147	*map &= ~mask;
ec996e9c JA	148	return 1;
d24c33a4 JA	149	}
d24c33a4 JA	150
ec996e9c	151	static int mask_set(unsigned int *map, unsigned int mask)
d24c33a4	152	{
dcb69098	153	assert(!(*map & mask));
ec996e9c JA	154	*map \|= mask;
ec996e9c JA	155	return 1;
d24c33a4 JA	156	}
d24c33a4 JA	157
dcb69098 JA	158	static int blocks_free(struct pool *pool, unsigned int pool_idx,
dcb69098 JA	159	unsigned int idx, unsigned int nr_blocks)
d24c33a4	160	{
dcb69098	161	return blocks_iter(pool, pool_idx, idx, nr_blocks, mask_cmp);
d24c33a4 JA	162	}
d24c33a4 JA	163
dcb69098 JA	164	static void set_blocks(struct pool *pool, unsigned int pool_idx,
dcb69098 JA	165	unsigned int idx, unsigned int nr_blocks)
d24c33a4	166	{
dcb69098	167	blocks_iter(pool, pool_idx, idx, nr_blocks, mask_set);
d24c33a4 JA	168	}
d24c33a4 JA	169
dcb69098 JA	170	static void clear_blocks(struct pool *pool, unsigned int pool_idx,
dcb69098 JA	171	unsigned int idx, unsigned int nr_blocks)
d24c33a4	172	{
dcb69098	173	blocks_iter(pool, pool_idx, idx, nr_blocks, mask_clear);
d24c33a4 JA	174	}
d24c33a4 JA	175
ec996e9c	176	static inline int __ffs(int word)
d24c33a4	177	{
ec996e9c	178	int r = 0;
d24c33a4	179
ec996e9c JA	180	if (!(word & 0xffff)) {
	181	word >>= 16;
	182	r += 16;
	183	}
	184	if (!(word & 0xff)) {
	185	word >>= 8;
	186	r += 8;
	187	}
	188	if (!(word & 0xf)) {
	189	word >>= 4;
	190	r += 4;
	191	}
	192	if (!(word & 3)) {
	193	word >>= 2;
	194	r += 2;
	195	}
	196	if (!(word & 1)) {
	197	word >>= 1;
	198	r += 1;
d24c33a4 JA	199	}
d24c33a4 JA	200
ec996e9c JA	201	return r;
	202	}
	203
	204	static int find_next_zero(int word, int start)
	205	{
	206	assert(word != -1U);
	207	word >>= (start + 1);
	208	return __ffs(~word) + start + 1;
d24c33a4 JA	209	}
d24c33a4 JA	210
adf57099	211	static int add_pool(struct pool *pool, unsigned int alloc_size)
d24c33a4	212	{
d24c33a4	213	void *ptr;
ec996e9c JA	214	int fd, bitmap_blocks;
ec996e9c JA	215
d24c33a4 JA	216	strcpy(pool->file, "/tmp/.fio_smalloc.XXXXXX");
	217	fd = mkstemp(pool->file);
	218	if (fd < 0)
	219	goto out_close;
	220
55f6491d	221	#ifdef SMALLOC_REDZONE
ec996e9c	222	alloc_size += sizeof(unsigned int);
55f6491d	223	#endif
ec996e9c JA	224	alloc_size += sizeof(struct block_hdr);
	225	if (alloc_size < INITIAL_SIZE)
	226	alloc_size = INITIAL_SIZE;
	227
	228	/* round up to nearest full number of blocks */
	229	alloc_size = (alloc_size + SMALLOC_BPL - 1) & ~(SMALLOC_BPL - 1);
	230	bitmap_blocks = alloc_size / SMALLOC_BPL;
	231	alloc_size += bitmap_blocks * sizeof(unsigned int);
	232	pool->mmap_size = alloc_size;
55f6491d	233
ec996e9c JA	234	pool->nr_blocks = bitmap_blocks;
ec996e9c JA	235	pool->free_blocks = bitmap_blocks * SMALLOC_BPB;
adf57099	236
ec996e9c	237	if (ftruncate(fd, alloc_size) < 0)
d24c33a4 JA	238	goto out_unlink;
d24c33a4 JA	239
ec996e9c	240	ptr = mmap(NULL, alloc_size, PROT_READ\|PROT_WRITE, MAP_SHARED, fd, 0);
d24c33a4 JA	241	if (ptr == MAP_FAILED)
	242	goto out_unlink;
	243
ec996e9c JA	244	memset(ptr, 0, alloc_size);
	245	pool->map = ptr;
	246	pool->bitmap = (void ) ptr + (pool->nr_blocks SMALLOC_BPL);
d24c33a4 JA	247
	248	#ifdef MP_SAFE
	249	pool->lock = fio_mutex_init(1);
	250	if (!pool->lock)
	251	goto out_unlink;
	252	#endif
	253
	254	pool->fd = fd;
	255
65864cf7	256	global_write_lock();
d24c33a4	257	nr_pools++;
65864cf7	258	global_write_unlock();
d24c33a4 JA	259	return 0;
d24c33a4 JA	260	out_unlink:
ec996e9c	261	fprintf(stderr, "smalloc: failed adding pool\n");
d24c33a4	262	if (pool->map)
ec996e9c	263	munmap(pool->map, pool->mmap_size);
d24c33a4 JA	264	unlink(pool->file);
	265	out_close:
	266	if (fd >= 0)
	267	close(fd);
	268	return 1;
	269	}
	270
	271	void sinit(void)
	272	{
4d4e80f2	273	int ret;
d24c33a4 JA	274
d24c33a4 JA	275	#ifdef MP_SAFE
9c5b5290	276	lock = fio_mutex_rw_init();
d24c33a4	277	#endif
adf57099	278	ret = add_pool(&mp[0], INITIAL_SIZE);
d24c33a4 JA	279	assert(!ret);
	280	}
	281
	282	static void cleanup_pool(struct pool *pool)
	283	{
	284	unlink(pool->file);
	285	close(pool->fd);
ec996e9c	286	munmap(pool->map, pool->mmap_size);
d24c33a4 JA	287
	288	if (pool->lock)
	289	fio_mutex_remove(pool->lock);
	290	}
	291
	292	void scleanup(void)
	293	{
	294	unsigned int i;
	295
	296	for (i = 0; i < nr_pools; i++)
	297	cleanup_pool(&mp[i]);
	298
	299	if (lock)
	300	fio_mutex_remove(lock);
	301	}
	302
ec996e9c	303	static void fill_redzone(struct block_hdr *hdr)
55f6491d JA	304	{
55f6491d JA	305	#ifdef SMALLOC_REDZONE
ec996e9c	306	unsigned int postred = (void ) hdr + hdr->size - sizeof(unsigned int);
55f6491d	307
ec996e9c JA	308	hdr->prered = SMALLOC_PRE_RED;
	309	*postred = SMALLOC_POST_RED;
	310	#endif
	311	}
55f6491d	312
ec996e9c JA	313	static void sfree_check_redzone(struct block_hdr *hdr)
	314	{
	315	#ifdef SMALLOC_REDZONE
	316	unsigned int postred = (void ) hdr + hdr->size - sizeof(unsigned int);
	317
	318	if (hdr->prered != SMALLOC_PRE_RED) {
55f6491d JA	319	fprintf(stderr, "smalloc pre redzone destroyed!\n");
55f6491d JA	320	fprintf(stderr, " ptr=%p, prered=%x, expected %x\n",
ec996e9c	321	hdr, hdr->prered, SMALLOC_PRE_RED);
55f6491d JA	322	assert(0);
	323	}
	324	if (*postred != SMALLOC_POST_RED) {
	325	fprintf(stderr, "smalloc post redzone destroyed!\n");
	326	fprintf(stderr, " ptr=%p, postred=%x, expected %x\n",
ec996e9c	327	hdr, *postred, SMALLOC_POST_RED);
55f6491d JA	328	assert(0);
	329	}
	330	#endif
	331	}
	332
d24c33a4 JA	333	static void sfree_pool(struct pool pool, void ptr)
d24c33a4 JA	334	{
ec996e9c	335	struct block_hdr *hdr;
179446e0	336	unsigned int i, idx;
ec996e9c	337	unsigned long offset;
d24c33a4 JA	338
	339	if (!ptr)
	340	return;
	341
ec996e9c JA	342	ptr -= sizeof(*hdr);
ec996e9c JA	343	hdr = ptr;
55f6491d	344
d24c33a4 JA	345	assert(ptr_valid(pool, ptr));
d24c33a4 JA	346
ec996e9c	347	sfree_check_redzone(hdr);
d24c33a4	348
ec996e9c JA	349	offset = ptr - pool->map;
	350	i = offset / SMALLOC_BPL;
	351	idx = (offset % SMALLOC_BPL) / SMALLOC_BPB;
d24c33a4	352
ec996e9c	353	pool_lock(pool);
dcb69098	354	clear_blocks(pool, i, idx, size_to_blocks(hdr->size));
ec996e9c JA	355	if (i < pool->next_non_full)
ec996e9c JA	356	pool->next_non_full = i;
179446e0	357	pool->free_blocks += size_to_blocks(hdr->size);
d24c33a4 JA	358	pool_unlock(pool);
	359	}
	360
	361	void sfree(void *ptr)
	362	{
	363	struct pool *pool = NULL;
	364	unsigned int i;
	365
8e5732e5 JA	366	if (!ptr)
	367	return;
	368
65864cf7	369	global_read_lock();
d24c33a4 JA	370
	371	for (i = 0; i < nr_pools; i++) {
	372	if (ptr_valid(&mp[i], ptr)) {
	373	pool = &mp[i];
	374	break;
	375	}
	376	}
	377
65864cf7	378	global_read_unlock();
d24c33a4 JA	379
	380	assert(pool);
	381	sfree_pool(pool, ptr);
	382	}
	383
55f6491d	384	static void __smalloc_pool(struct pool pool, unsigned int size)
d24c33a4	385	{
ec996e9c JA	386	unsigned int nr_blocks;
	387	unsigned int i;
	388	unsigned int offset;
	389	unsigned int last_idx;
	390	void *ret = NULL;
d24c33a4	391
d24c33a4	392	pool_lock(pool);
179446e0 JA	393
179446e0 JA	394	nr_blocks = size_to_blocks(size);
ec996e9c	395	if (nr_blocks > pool->free_blocks)
8e5732e5	396	goto fail;
5ec10eaa	397
ec996e9c JA	398	i = pool->next_non_full;
	399	last_idx = 0;
	400	offset = -1U;
	401	while (i < pool->nr_blocks) {
	402	unsigned int idx;
d24c33a4	403
ec996e9c JA	404	if (pool->bitmap[i] == -1U) {
	405	i++;
	406	pool->next_non_full = i;
	407	last_idx = 0;
	408	continue;
	409	}
d24c33a4	410
ec996e9c	411	idx = find_next_zero(pool->bitmap[i], last_idx);
dcb69098	412	if (!blocks_free(pool, i, idx, nr_blocks)) {
ec996e9c JA	413	idx += nr_blocks;
	414	if (idx < SMALLOC_BPI)
	415	last_idx = idx;
	416	else {
	417	last_idx = 0;
	418	while (idx >= SMALLOC_BPI) {
	419	i++;
	420	idx -= SMALLOC_BPI;
	421	}
	422	}
	423	continue;
d24c33a4	424	}
dcb69098	425	set_blocks(pool, i, idx, nr_blocks);
ec996e9c JA	426	offset = i * SMALLOC_BPL + idx * SMALLOC_BPB;
	427	break;
	428	}
	429
	430	if (i < pool->nr_blocks) {
	431	pool->free_blocks -= nr_blocks;
	432	ret = pool->map + offset;
d24c33a4	433	}
ec996e9c	434	fail:
d24c33a4	435	pool_unlock(pool);
ec996e9c	436	return ret;
d24c33a4 JA	437	}
d24c33a4 JA	438
55f6491d JA	439	static void smalloc_pool(struct pool pool, unsigned int size)
55f6491d JA	440	{
ec996e9c JA	441	struct block_hdr *hdr;
ec996e9c JA	442	unsigned int alloc_size;
55f6491d JA	443	void *ptr;
55f6491d JA	444
ec996e9c JA	445	alloc_size = size + sizeof(*hdr);
	446	#ifdef SMALLOC_REDZONE
	447	alloc_size += sizeof(unsigned int);
	448	#endif
	449
	450	ptr = __smalloc_pool(pool, alloc_size);
076b17ce	451	if (!ptr)
55f6491d JA	452	return NULL;
55f6491d JA	453
ec996e9c JA	454	hdr = ptr;
	455	hdr->size = alloc_size;
	456	ptr += sizeof(*hdr);
55f6491d	457
ec996e9c JA	458	fill_redzone(hdr);
	459
	460	memset(ptr, 0, size);
55f6491d	461	return ptr;
55f6491d JA	462	}
55f6491d JA	463
d24c33a4 JA	464	void *smalloc(unsigned int size)
	465	{
	466	unsigned int i;
	467
65864cf7	468	global_read_lock();
d24c33a4 JA	469	i = last_pool;
	470
	471	do {
	472	for (; i < nr_pools; i++) {
	473	void *ptr = smalloc_pool(&mp[i], size);
	474
	475	if (ptr) {
	476	last_pool = i;
65864cf7	477	global_read_unlock();
d24c33a4 JA	478	return ptr;
	479	}
	480	}
	481	if (last_pool) {
	482	last_pool = 0;
	483	continue;
	484	}
	485
ec996e9c	486	if (nr_pools + 1 > MAX_POOLS)
d24c33a4 JA	487	break;
	488	else {
	489	i = nr_pools;
65864cf7	490	global_read_unlock();
adf57099	491	if (add_pool(&mp[nr_pools], size))
65864cf7 JA	492	goto out;
65864cf7 JA	493	global_read_lock();
d24c33a4 JA	494	}
	495	} while (1);
	496
65864cf7 JA	497	global_read_unlock();
65864cf7 JA	498	out:
d24c33a4 JA	499	return NULL;
	500	}
	501
	502	char smalloc_strdup(const char str)
	503	{
	504	char *ptr;
	505
	506	ptr = smalloc(strlen(str) + 1);
	507	strcpy(ptr, str);
	508	return ptr;
	509	}