[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 <fcntl.h>

#include "mutex.h"
#include "arch/arch.h"
#include "os/os.h"

#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	8192*1024	/* new pool size */
#define MAX_POOLS	128		/* maximum number of pools to setup */

#define SMALLOC_PRE_RED		0xdeadbeefU
#define SMALLOC_POST_RED	0x5aa55aa5U

unsigned int smalloc_pool_size = INITIAL_SIZE;
const int int_mask = sizeof(int) - 1;

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 */
	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)
{
	fio_mutex_down(pool->lock);
}

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

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

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

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

static inline void global_write_unlock(void)
{
	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 int find_next_zero(int word, int start)
{
	assert(word != -1U);
	word >>= (start + 1);
	return ffz(word) + start + 1;
}

static int add_pool(struct pool *pool, unsigned int alloc_size)
{
	int fd, bitmap_blocks;
	char file[] = "/tmp/.fio_smalloc.XXXXXX";
	void *ptr;

	fd = mkstemp(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;

#ifdef FIO_HAVE_FALLOCATE
	posix_fallocate(fd, 0, alloc_size);
#endif

	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);

	pool->lock = fio_mutex_init(1);
	if (!pool->lock)
		goto out_unlink;

	/*
	 * Unlink pool file now. It wont get deleted until the fd is closed,
	 * which happens both for cleanup or unexpected quit. This way we
	 * don't leave temp files around in case of a crash.
	 */
	unlink(file);
	pool->fd = fd;

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

void sinit(void)
{
	int ret;

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

static void cleanup_pool(struct pool *pool)
{
	/*
	 * This will also remove the temporary file we used as a backing
	 * store, it was already unlinked
	 */
	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);
}

#ifdef SMALLOC_REDZONE
static void *postred_ptr(struct block_hdr *hdr)
{
	unsigned long ptr;

	ptr = (unsigned long) hdr + hdr->size - sizeof(unsigned int);
	ptr = (ptr + int_mask) & ~int_mask;

	return (void *) ptr;
}

static void fill_redzone(struct block_hdr *hdr)
{
	unsigned int *postred = postred_ptr(hdr);

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

static void sfree_check_redzone(struct block_hdr *hdr)
{
	unsigned int *postred = postred_ptr(hdr);

	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);
	}
}
#else
static void fill_redzone(struct block_hdr *hdr)
{
}

static void sfree_check_redzone(struct block_hdr *hdr)
{
}
#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)
{
	unsigned int alloc_size = size + sizeof(struct block_hdr);
	void *ptr;

	/*
	 * Round to int alignment, so that the postred pointer will
	 * be naturally aligned as well.
	 */
#ifdef SMALLOC_REDZONE
	alloc_size += sizeof(unsigned int);
	alloc_size = (alloc_size + int_mask) & ~int_mask;
#endif

	ptr = __smalloc_pool(pool, alloc_size);
	if (ptr) {
		struct block_hdr *hdr = ptr;

		hdr->size = alloc_size;
		fill_redzone(hdr);

		ptr += sizeof(*hdr);
		memset(ptr, 0, size);
	}

	return ptr;
}

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

	global_write_lock();
	i = last_pool;

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

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

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

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