1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
|
#include "mupdf/fitz.h"
typedef struct fz_pool_node_s fz_pool_node;
struct fz_pool_s
{
fz_pool_node *head, *tail;
char *pos, *end;
};
struct fz_pool_node_s
{
fz_pool_node *next;
char mem[64 << 10]; /* 64k blocks */
};
fz_pool *fz_new_pool(fz_context *ctx)
{
fz_pool *pool = fz_malloc_struct(ctx, fz_pool);
fz_pool_node *node = fz_malloc_struct(ctx, fz_pool_node);
pool->head = pool->tail = node;
pool->pos = node->mem;
pool->end = node->mem + sizeof node->mem;
return pool;
}
void *fz_pool_alloc(fz_context *ctx, fz_pool *pool, size_t size)
{
char *ptr;
/* round size to pointer alignment (we don't expect to use doubles) */
size = ((size + sizeof(void*) - 1) / sizeof(void*)) * sizeof(void*);
if (pool->pos + size > pool->end)
{
fz_pool_node *node = fz_malloc_struct(ctx, fz_pool_node);
pool->tail = pool->tail->next = node;
pool->pos = node->mem;
pool->end = node->mem + sizeof node->mem;
if (pool->pos + size > pool->end)
fz_throw(ctx, FZ_ERROR_GENERIC, "out of memory: allocation too large to fit in pool");
}
ptr = pool->pos;
pool->pos += size;
return ptr;
}
char *fz_pool_strdup(fz_context *ctx, fz_pool *pool, const char *s)
{
size_t n = strlen(s) + 1;
char *p = fz_pool_alloc(ctx, pool, n);
memcpy(p, s, n);
return p;
}
void fz_drop_pool(fz_context *ctx, fz_pool *pool)
{
fz_pool_node *node;
if (!pool)
return;
node = pool->head;
while (node)
{
fz_pool_node *next = node->next;
fz_free(ctx, node);
node = next;
}
fz_free(ctx, pool);
}
|
