pool.c 5 KB
Newer Older
1 2 3 4 5 6 7
/*
 * Copyright (C) the libgit2 contributors. All rights reserved.
 *
 * This file is part of libgit2, distributed under the GNU GPL v2 with
 * a Linking Exception. For full terms see the included COPYING file.
 */

8
#include "pool.h"
9

10
#include "posix.h"
11 12 13 14 15 16
#ifndef GIT_WIN32
#include <unistd.h>
#endif

struct git_pool_page {
	git_pool_page *next;
17 18
	size_t size;
	size_t avail;
19
	GIT_ALIGN(char data[GIT_FLEX_ARRAY], 8);
20 21
};

22
static void *pool_alloc_page(git_pool *pool, size_t size);
23

24
size_t git_pool__system_page_size(void)
25
{
26
	static size_t size = 0;
27

28 29 30 31
	if (!size) {
		size_t page_size;
		if (git__page_size(&page_size) < 0)
			page_size = 4096;
32
		/* allow space for malloc overhead */
33
		size = (page_size - (2 * sizeof(void *)) - sizeof(git_pool_page));
34
	}
35

36 37 38
	return size;
}

39
#ifndef GIT_DEBUG_POOL
40
int git_pool_init(git_pool *pool, size_t item_size)
41 42
{
	assert(pool);
43
	assert(item_size >= 1);
44 45 46

	memset(pool, 0, sizeof(git_pool));
	pool->item_size = item_size;
47
	pool->page_size = git_pool__system_page_size();
48 49

	return 0;
50 51 52 53 54 55
}

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

56
	for (scan = pool->pages; scan != NULL; scan = next) {
57 58 59 60
		next = scan->next;
		git__free(scan);
	}

61
	pool->pages = NULL;
62 63
}

64
static void *pool_alloc_page(git_pool *pool, size_t size)
65 66
{
	git_pool_page *page;
67
	const size_t new_page_size = (size <= pool->page_size) ? pool->page_size : size;
68
	size_t alloc_size;
69

70
	if (GIT_ADD_SIZET_OVERFLOW(&alloc_size, new_page_size, sizeof(git_pool_page)) ||
71
		!(page = git__malloc(alloc_size)))
72
		return NULL;
73

74
	page->size = new_page_size;
75
	page->avail = new_page_size - size;
76
	page->next = pool->pages;
77

78
	pool->pages = page;
79

80
	return page->data;
81 82
}

83
static void *pool_alloc(git_pool *pool, size_t size)
84
{
85 86
	git_pool_page *page = pool->pages;
	void *ptr = NULL;
87

88
	if (!page || page->avail < size)
89 90
		return pool_alloc_page(pool, size);

91 92
	ptr = &page->data[page->size - page->avail];
	page->avail -= size;
93

94
	return ptr;
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
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;
	}
}

130
int git_pool_init(git_pool *pool, size_t item_size)
131 132 133 134 135 136 137 138
{
	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);
139 140

	return 0;
141 142 143 144 145 146 147
}

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

148
static void *pool_alloc(git_pool *pool, size_t size) {
149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175
	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));
}

176
static size_t alloc_size(git_pool *pool, size_t count)
177
{
178
	const size_t align = sizeof(void *) - 1;
179 180

	if (pool->item_size > 1) {
181
		const size_t item_size = (pool->item_size + align) & ~align;
182 183 184 185 186 187
		return item_size * count;
	}

	return (count + align) & ~align;
}

188
void *git_pool_malloc(git_pool *pool, size_t items)
189
{
190
	return pool_alloc(pool, alloc_size(pool, items));
191 192
}

193
void *git_pool_mallocz(git_pool *pool, size_t items)
194
{
195
	const size_t size = alloc_size(pool, items);
196 197 198 199 200 201
	void *ptr = pool_alloc(pool, size);
	if (ptr)
		memset(ptr, 0x0, size);
	return ptr;
}

202 203
char *git_pool_strndup(git_pool *pool, const char *str, size_t n)
{
204
	char *ptr = NULL;
205 206 207

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

208
	if (n == SIZE_MAX)
209 210
		return NULL;

211
	if ((ptr = git_pool_malloc(pool, (n + 1))) != NULL) {
212
		memcpy(ptr, str, n);
213
		ptr[n] = '\0';
214
	}
215

216 217 218 219 220 221
	return ptr;
}

char *git_pool_strdup(git_pool *pool, const char *str)
{
	assert(pool && str && pool->item_size == sizeof(char));
222 223 224
	return git_pool_strndup(pool, str, strlen(str));
}

225 226
char *git_pool_strdup_safe(git_pool *pool, const char *str)
{
227
	return str ? git_pool_strdup(pool, str) : NULL;
228 229
}

230 231 232
char *git_pool_strcat(git_pool *pool, const char *a, const char *b)
{
	void *ptr;
233
	size_t len_a, len_b, total;
234

235
	assert(pool && pool->item_size == sizeof(char));
236 237 238 239

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

240 241 242 243 244
	if (GIT_ADD_SIZET_OVERFLOW(&total, len_a, len_b) ||
		GIT_ADD_SIZET_OVERFLOW(&total, total, 1))
		return NULL;

	if ((ptr = git_pool_malloc(pool, total)) != NULL) {
245 246 247 248 249 250 251
		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;
252
}