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
72
73
74
75
76
77
78
79
80
81
82
83
84
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
|
/*
libualloc - microlib for memory allocation with various strategies
Copyright (c) 2020 Tibor 'Igor2' Palinkas
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of the Author nor the names of contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE.
Source code: svn://svn.repo.hu/libualloc/trunk
Contact the author: http://igor2.repo.hu/contact.html
*/
#include <stdlib.h>
#include <stddef.h>
#include <assert.h>
#include <libualloc/libualloc.h>
struct uall_stackd_page_s {
size_t alloced, used;
size_t last; /* offset of the last item in page (all_stackd_elem_t) */
uall_stackd_page_t *next;
char data[1];
};
typedef struct uall_stackd_elem_s {
size_t prev_len; /* length of the previous item in the same page */
char data[1];
} uall_stackd_elem_t;
#define UALL_STACKD_PAGE_T_SIZE offsetof(uall_stackd_page_t, data)
#define UALL_STACKD_ELEM_T_SIZE offsetof(uall_stackd_elem_t, data)
UALL_INLINE void *uall_stackd_alloc(uall_stackd_t *ctx, size_t size)
{
uall_stackd_page_t *page = ctx->pages;
size_t avail = (page == NULL) ? 0 : ctx->pages->alloced - ctx->pages->used;
size_t totlen = UALL_ALIGN(size + UALL_STACKD_ELEM_T_SIZE);
uall_stackd_elem_t *elem;
if (size == 0)
return NULL;
/* if not enough room in the current page, go on allocating the next page */
if (avail < totlen) {
size_t need = size + UALL_STACKD_ELEM_T_SIZE + UALL_STACKD_PAGE_T_SIZE;
size_t req = (need <= ctx->sys->page_size) ? ctx->sys->page_size : ((need / ctx->sys->page_size) + 1) * ctx->sys->page_size;
page = ctx->sys->alloc(ctx->sys, req);
if (page == NULL)
return NULL;
page->used = page->last = 0;
page->alloced = req - UALL_STACKD_PAGE_T_SIZE;
page->next = ctx->pages;
ctx->pages = page;
}
/* current page has enough room, pack our data at the end */
elem = (uall_stackd_elem_t *)((char *)page->data + page->used);
elem->prev_len = page->used - page->last; /* ->used is the end of the last element, ->last is the beginning of the last element */
page->last = page->used;
page->used += totlen;
return elem->data;
}
UALL_INLINE int uall_stackd_free(uall_stackd_t *ctx)
{
uall_stackd_page_t *page = ctx->pages;
uall_stackd_elem_t *elem;
size_t elem_len;
if (page == NULL)
return 0;
elem = (uall_stackd_elem_t *)((char *)page->data + page->last);
elem_len = page->used - page->last;
page->last -= elem->prev_len;
page->used -= elem_len;
/* check if the current page got empty and get rid of it */
if (page->used == 0) {
ctx->pages = page->next;
ctx->sys->free(ctx->sys, page);
}
return 1;
}
void *uall_stackd_top(uall_stackd_t *ctx)
{
uall_stackd_page_t *page = ctx->pages;
uall_stackd_elem_t *elem;
if (page == NULL)
return NULL;
elem = (uall_stackd_elem_t *)((char *)page->data + page->last);
return elem->data;
}
UALL_INLINE void uall_stackd_clean(uall_stackd_t *ctx)
{
uall_stackd_page_t *page, *next;
for(page = ctx->pages; page != NULL; page = next) {
next = page->next;
ctx->sys->free(ctx->sys, page);
}
ctx->pages = NULL;
}
|
