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
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
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
|
/* (c) Copyright 2004, 2005 Stijn van Dongen
*
* This file is part of tingea. You can redistribute and/or modify tingea
* under the terms of the GNU General Public License; either version 3 of the
* License or (at your option) any later version. You should have received a
* copy of the GPL along with tingea, in the file COPYING.
*/
#include "alloc.h"
#include "gralloc.h"
/* TODO
* calloc stuff.
* implement arithmetic capacity strategy.
*/
#define DEBUG 0
typedef struct memnext
{ struct memnext* next
;
} memnext ;
/* future idea; use higher bita as perbytage style coefficients. duh. */
#define n1(grim) ((grim->flags >> 16) & 0xFF)
#define n2(grim) ((grim->flags >> 24) & 0xFF)
typedef struct grim_buf
{ char* units /* n_units * (sizeof(memnext) + sz_unit) */
; dim n_units /* number of units available for this struct */
; struct grim_buf* prev
;
} grim_buf ;
struct mcxGrim
{ grim_buf* buf
; dim sz_unit /* size of one unit */
; memnext* na /* next available */
; dim ct /* number in use */
; mcxbits flags /* allocation strategy, numbers */
;
} ;
grim_buf* grim_buf_new
( dim sz_unit
, dim n_units
)
{ dim i
; grim_buf* buf
; char* units
; dim sz_load = sizeof(memnext) + sz_unit
; if (!(buf = mcxAlloc(sizeof(grim_buf), RETURN_ON_FAIL)))
return NULL
; if
( !(buf->units
= units
= mcxAlloc(n_units * sz_load, RETURN_ON_FAIL)
) )
{ mcxFree(buf)
; return NULL
; }
buf->prev = NULL
; buf->n_units = n_units
#if DEBUG
; fprintf (stderr, "Extending grim with <%lu> units\n", (ulong) n_units);
#endif
; for (i=0;i<n_units-1;i++)
((memnext*) (units + i * sz_load))->next
= (memnext*) (units + (i+1) * sz_load)
; ((memnext*) (buf->units + (n_units-1) * sz_load))->next = NULL
; return buf
; }
mcxGrim* mcxGrimNew
( dim sz_unit
, dim n_units
, mcxbits options
)
{ mcxGrim* src = mcxAlloc(sizeof(mcxGrim), RETURN_ON_FAIL)
; if (!src)
return NULL
; if (!(src->buf = grim_buf_new(sz_unit, n_units)))
{ mcxFree(src)
; return NULL
; }
src->buf->prev = NULL
; src->flags = options
; src->na = (void*) src->buf->units
; src->ct = 0
; src->sz_unit = sz_unit
; return src
; }
dim mcxGrimMemSize
( mcxGrim* src
)
{ grim_buf *buf = src->buf, *this = buf->prev
; dim n = buf->n_units
; while (this)
n += this->n_units
, this = this->prev
; return n
; }
mcxbool mcx_grim_extend
( mcxGrim* src
)
{ grim_buf* prevbuf = src->buf->prev
; dim n_units = prevbuf ? 2 * prevbuf->n_units : src->buf->n_units
#if DEBUG
; dim t = mcxGrimMemSize(src)
; fprintf(stderr, "have %lu units\n", (ulong) t)
#endif
; grim_buf* newbuf = grim_buf_new(src->sz_unit, n_units)
; if (!newbuf)
return FALSE
; newbuf->prev = src->buf->prev
; src->buf->prev = newbuf
; src->na = (void*) newbuf->units /* fixme cast */
; return TRUE
; }
void mcxGrimFree
( mcxGrim** srcp
)
{ grim_buf *this = (*srcp)->buf
; while (this)
{ grim_buf* tmp = this->prev
; mcxFree(this->units)
; mcxFree(this)
; this = tmp
; }
mcxFree(*srcp)
; *srcp = NULL
; }
void mcxGrimLet
( mcxGrim* src
, void* mem
)
{ memnext* na = (void*) ((char*) mem - sizeof(memnext))
; na->next = src->na
; src->na = na
; src->ct--
; }
void* mcxGrimGet
( mcxGrim* src
)
{ void* mem
; if (!src->na && !mcx_grim_extend(src))
return NULL
; mem = ((char*) src->na) + sizeof(memnext)
; src->na = src->na->next
; src->ct++
; return mem
; }
dim mcxGrimCount
( mcxGrim* src
)
{ return src->ct
; }
#undef DEBUG
|
