pool.c 4.72 KB
Newer Older
1
#include "pool.h"
2
#include "posix.h"
3 4 5 6 7 8 9 10
#ifndef GIT_WIN32
#include <unistd.h>
#endif

struct git_pool_page {
	git_pool_page *next;
	uint32_t size;
	uint32_t avail;
11
	GIT_ALIGN(char data[GIT_FLEX_ARRAY], 8);
12 13
};

14
static void *pool_alloc_page(git_pool *pool, uint32_t size);
15

16 17 18
uint32_t git_pool__system_page_size(void)
{
	static uint32_t size = 0;
19

20 21 22 23
	if (!size) {
		size_t page_size;
		if (git__page_size(&page_size) < 0)
			page_size = 4096;
24 25
		/* allow space for malloc overhead */
		size = page_size - (2 * sizeof(void *)) - sizeof(git_pool_page);
26
	}
27

28 29 30
	return size;
}

31
#ifndef GIT_DEBUG_POOL
32
void git_pool_init(git_pool *pool, uint32_t item_size)
33 34
{
	assert(pool);
35
	assert(item_size >= 1);
36 37 38

	memset(pool, 0, sizeof(git_pool));
	pool->item_size = item_size;
39
	pool->page_size = git_pool__system_page_size();
40 41 42 43 44 45
}

void git_pool_clear(git_pool *pool)
{
	git_pool_page *scan, *next;

46
	for (scan = pool->pages; scan != NULL; scan = next) {
47 48 49 50
		next = scan->next;
		git__free(scan);
	}

51
	pool->pages = NULL;
52 53
}

54
static void *pool_alloc_page(git_pool *pool, uint32_t size)
55 56
{
	git_pool_page *page;
57
	const uint32_t new_page_size = (size <= pool->page_size) ? pool->page_size : size;
58
	size_t alloc_size;
59

60
	if (GIT_ADD_SIZET_OVERFLOW(&alloc_size, new_page_size, sizeof(git_pool_page)) ||
61
		!(page = git__malloc(alloc_size)))
62
		return NULL;
63

64
	page->size = new_page_size;
65
	page->avail = new_page_size - size;
66
	page->next = pool->pages;
67

68
	pool->pages = page;
69

70
	return page->data;
71 72
}

73
static void *pool_alloc(git_pool *pool, uint32_t size)
74
{
75 76
	git_pool_page *page = pool->pages;
	void *ptr = NULL;
77

78
	if (!page || page->avail < size)
79 80
		return pool_alloc_page(pool, size);

81 82
	ptr = &page->data[page->size - page->avail];
	page->avail -= size;
83

84
	return ptr;
85 86
}

87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163
uint32_t git_pool__open_pages(git_pool *pool)
{
	uint32_t ct = 0;
	git_pool_page *scan;
	for (scan = pool->pages; scan != NULL; scan = scan->next) ct++;
	return ct;
}

bool git_pool__ptr_in_pool(git_pool *pool, void *ptr)
{
	git_pool_page *scan;
	for (scan = pool->pages; scan != NULL; scan = scan->next)
		if ((void *)scan->data <= ptr &&
			(void *)(((char *)scan->data) + scan->size) > ptr)
			return true;
	return false;
}

#else

static int git_pool__ptr_cmp(const void * a, const void * b)
{
	if(a > b) {
		return 1;
	}
	if(a < b) {
		return -1;
	}
	else {
		return 0;
	}
}

void git_pool_init(git_pool *pool, uint32_t item_size)
{
	assert(pool);
	assert(item_size >= 1);

	memset(pool, 0, sizeof(git_pool));
	pool->item_size = item_size;
	pool->page_size = git_pool__system_page_size();
	git_vector_init(&pool->allocations, 100, git_pool__ptr_cmp);
}

void git_pool_clear(git_pool *pool)
{
	git_vector_free_deep(&pool->allocations);
}

static void *pool_alloc(git_pool *pool, uint32_t size) {
	void *ptr = NULL;
	if((ptr = git__malloc(size)) == NULL) {
		return NULL;
	}
	git_vector_insert_sorted(&pool->allocations, ptr, NULL);
	return ptr;
}

bool git_pool__ptr_in_pool(git_pool *pool, void *ptr)
{
	size_t pos;
	return git_vector_bsearch(&pos, &pool->allocations, ptr) != GIT_ENOTFOUND;
}
#endif

void git_pool_swap(git_pool *a, git_pool *b)
{
	git_pool temp;

	if (a == b)
		return;

	memcpy(&temp, a, sizeof(temp));
	memcpy(a, b, sizeof(temp));
	memcpy(b, &temp, sizeof(temp));
}

164 165 166 167 168 169 170 171 172 173 174 175
static uint32_t alloc_size(git_pool *pool, uint32_t count)
{
	const uint32_t align = sizeof(void *) - 1;

	if (pool->item_size > 1) {
		const uint32_t item_size = (pool->item_size + align) & ~align;
		return item_size * count;
	}

	return (count + align) & ~align;
}

176 177
void *git_pool_malloc(git_pool *pool, uint32_t items)
{
178
	return pool_alloc(pool, alloc_size(pool, items));
179 180 181 182
}

void *git_pool_mallocz(git_pool *pool, uint32_t items)
{
183
	const uint32_t size = alloc_size(pool, items);
184 185 186 187 188 189
	void *ptr = pool_alloc(pool, size);
	if (ptr)
		memset(ptr, 0x0, size);
	return ptr;
}

190 191
char *git_pool_strndup(git_pool *pool, const char *str, size_t n)
{
192
	char *ptr = NULL;
193 194 195

	assert(pool && str && pool->item_size == sizeof(char));

196 197 198
	if ((uint32_t)(n + 1) < n)
		return NULL;

Russell Belfer committed
199
	if ((ptr = git_pool_malloc(pool, (uint32_t)(n + 1))) != NULL) {
200
		memcpy(ptr, str, n);
201
		ptr[n] = '\0';
202
	}
203

204 205 206 207 208 209
	return ptr;
}

char *git_pool_strdup(git_pool *pool, const char *str)
{
	assert(pool && str && pool->item_size == sizeof(char));
210 211 212
	return git_pool_strndup(pool, str, strlen(str));
}

213 214
char *git_pool_strdup_safe(git_pool *pool, const char *str)
{
215
	return str ? git_pool_strdup(pool, str) : NULL;
216 217
}

218 219 220 221 222
char *git_pool_strcat(git_pool *pool, const char *a, const char *b)
{
	void *ptr;
	size_t len_a, len_b;

223
	assert(pool && pool->item_size == sizeof(char));
224 225 226 227

	len_a = a ? strlen(a) : 0;
	len_b = b ? strlen(b) : 0;

Russell Belfer committed
228
	if ((ptr = git_pool_malloc(pool, (uint32_t)(len_a + len_b + 1))) != NULL) {
229 230 231 232 233 234 235
		if (len_a)
			memcpy(ptr, a, len_a);
		if (len_b)
			memcpy(((char *)ptr) + len_a, b, len_b);
		*(((char *)ptr) + len_a + len_b) = '\0';
	}
	return ptr;
236
}