My favorites | Sign in
Project Home Downloads Source
Checkout   Browse   Changes    
 
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
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
#include <Core/Core.h>
//#BLITZ_APPROVE

NAMESPACE_UPP

#ifdef UPP_HEAP

#include "HeapImp.h"

#define LLOG(x) // LOG((void *)this << ' ' << x)

inline void Heap::Page::Format(int k)
{
DbgFreeFill(Begin(), End() - Begin());
klass = k;
active = 0;
int sz = Ksz(k);
byte *ptr = End() - sz;
byte *b = Begin();
FreeLink *l = NULL;
while(ptr >= b) {
((FreeLink *)ptr)->next = l;
l = (FreeLink *)ptr;
ptr -= sz;
}
freelist = l;
}

Heap::Page *Heap::WorkPage(int k)
{
LLOG("AllocK - next work not available " << k << " empty: " << (void *)empty[k]);
Page *page = empty[k];
empty[k] = NULL;
if(!page) {
LLOG("AllocK - trying FreeRemote");
FreeRemote();
if(work[k]->freelist) {
LLOG("AllocK - work available after FreeRemote " << k);
return work[k];
}
page = empty[k];
empty[k] = NULL;
}
if(!page)
for(int i = 0; i < NKLASS; i++)
if(empty[i]) {
LLOG("AllocK - free page available for reformatting " << k);
page = empty[i];
empty[i] = NULL;
page->Format(k);
break;
}
if(!page) {
Mutex::Lock __(mutex);
aux.FreeRemoteRaw();
if(aux.work[k]->next != aux.work[k]) {
page = aux.work[k]->next;
page->Unlink();
page->heap = this;
LLOG("AllocK - adopting aux page " << k << " page: " << (void *)page << ", free " << (void *)page->freelist);
}
if(!page && aux.empty[k]) {
page = aux.empty[k];
aux.empty[k] = page->next;
LLOG("AllocK - empty aux page available of the same format " << k << " page: " << (void *)page << ", free " << (void *)page->freelist);
}
if(!page)
for(int i = 0; i < NKLASS; i++)
if(aux.empty[i]) {
page = aux.empty[i];
aux.empty[i] = page->next;
page->Format(k);
LLOG("AllocK - empty aux page available for reformatting " << k << " page: " << (void *)page << ", free " << (void *)page->freelist);
break;
}
if(!page) {
page = (Page *)AllocRaw4KB(Ksz(k));
LLOG("AllocK - allocated new system page " << (void *)page << " " << k);
page->Format(k);
}
page->heap = this;
}
page->Link(work[k]);
ASSERT(page->klass == k);
return page;
}

void *Heap::AllocK(int k)
{
LLOG("AllocK " << k);
if(!initialized)
Init();
Page *page = work[k]->next;
for(;;) {
ASSERT(page->klass == k);
FreeLink *p = page->freelist;
if(p) {
LLOG("AllocK allocating from " << (void *)page << " " << (void *)p);
page->freelist = p->next;
++page->active;
return p;
}
LLOG("AllocK - page exhausted " << k << " page: " << (void *)page);
if(page->next != page) {
LLOG("Moving " << (void *)page << " to full");
page->Unlink();
page->Link(full[k]);
page = work[k]->next;
}
if(page->next == page)
page = WorkPage(k);
}
}


inline
void *Heap::Allok(int k)
{
FreeLink *ptr = cache[k];
if(ptr) {
cachen[k]++;
cache[k] = ptr->next;
return DbgFreeCheckK(ptr, k);
}
return DbgFreeCheckK(AllocK(k), k);
}

inline
void *Heap::Alloc(size_t sz)
{
Stat(sz);
if(sz <= 224) {
if(sz == 0) sz = 1;
return Allok(((int)sz - 1) >> 4);
}
if(sz <= 576)
return Allok(sz <= 368 ? sz <= 288 ? 14 : 15 : sz <= 448 ? 16 : 17);
return LAlloc(sz);
}

inline
void *Heap::AllocSz(size_t& sz)
{
Stat(sz);
if(sz <= 224) {
if(sz == 0) sz = 1;
int k = ((int)sz - 1) >> 4;
sz = (k + 1) << 4;
return Allok(k);
}
if(sz <= 576) {
int k;
if(sz <= 368)
if(sz <= 288)
sz = 288, k = 14;
else
sz = 368, k = 15;
else
if(sz <= 448)
sz = 448, k = 16;
else
sz = 576, k = 17;
return Allok(k);
}
return LAlloc(sz);
}

inline
void Heap::FreeK(void *ptr, Page *page, int k)
{
if(page->freelist) {
LLOG("Free next in work page " << k);
((FreeLink *)ptr)->next = page->freelist;
}
else {
LLOG("Free full to work " << k << " heap: " << (void *)page->heap);
page->Unlink();
page->Link(work[k]);
((FreeLink *)ptr)->next = NULL;
}
page->freelist = (FreeLink *)ptr;
if(--page->active == 0) {
LLOG("Free page is empty" << " " << (void *)page);
page->Unlink();
if(this == &aux) {
LLOG("...is aux");
page->next = empty[k];
empty[k] = page;
}
else {
if(empty[k]) {
LLOG("Global free " << k << " " << (void *)empty[k]);
Mutex::Lock __(mutex);
empty[k]->heap = &aux;
empty[k]->next = aux.empty[k];
aux.empty[k] = empty[k];
}
empty[k] = page;
}
}
}

void Heap::Free(void *ptr)
{
if(!ptr) return;
LLOG("Free " << ptr);
if((((dword)(uintptr_t)ptr) & 8) == 0) {
Page *page = (Page *)((uintptr_t)ptr & ~(uintptr_t)4095);
int k = page->klass;
LLOG("Small free page: " << (void *)page << ", k: " << k << ", ksz: " << Ksz(k));
ASSERT((4096 - ((uintptr_t)ptr & (uintptr_t)4095)) % Ksz(k) == 0);
#ifdef _MULTITHREADED
if(page->heap != this) {
page->heap->RemoteFree(ptr);
return;
}
#endif
DbgFreeFillK(ptr, k);
if(cachen[k]) {
cachen[k]--;
FreeLink *l = (FreeLink *)ptr;
l->next = cache[k];
cache[k] = l;
return;
}
FreeK(ptr, page, k);
}
else
LFree(ptr);
}

void Heap::FreeDirect(void *ptr)
{
LLOG("Free Direct " << ptr);
if((((dword)(uintptr_t)ptr) & 8) == 0) {
Page *page = (Page *)((uintptr_t)ptr & ~(uintptr_t)4095);
int k = page->klass;
LLOG("Small free page: " << (void *)page << ", k: " << k << ", ksz: " << Ksz(k));
ASSERT((4096 - ((uintptr_t)ptr & (uintptr_t)4095)) % Ksz(k) == 0);
DbgFreeFillK(ptr, k);
FreeK(ptr, page, k);
}
else
LFree(ptr);
}

inline
void *Heap::Alloc32()
{
Stat(32);
return Allok(1);
}

inline
void Heap::Free32(void *ptr)
{
Page *page = (Page *)((uintptr_t)ptr & ~(uintptr_t)4095);
LLOG("Small free page: " << (void *)page << ", k: " << k << ", ksz: " << Ksz(k));
ASSERT((4096 - ((uintptr_t)ptr & (uintptr_t)4095)) % Ksz(1) == 0);
#ifdef _MULTITHREADED
if(page->heap != this) {
page->heap->RemoteFree(ptr);
return;
}
#endif
DbgFreeFillK(ptr, 1);
if(cachen[1]) {
cachen[1]--;
FreeLink *l = (FreeLink *)ptr;
l->next = cache[1];
cache[1] = l;
return;
}
FreeK(ptr, page, 1);
}

inline
void *Heap::Alloc48()
{
Stat(48);
return Allok(2);
}

inline
void Heap::Free48(void *ptr)
{
Page *page = (Page *)((uintptr_t)ptr & ~(uintptr_t)4095);
LLOG("Small free page: " << (void *)page << ", k: " << k << ", ksz: " << Ksz(k));
ASSERT((4096 - ((uintptr_t)ptr & (uintptr_t)4095)) % Ksz(2) == 0);
#ifdef _MULTITHREADED
if(page->heap != this) {
page->heap->RemoteFree(ptr);
return;
}
#endif
DbgFreeFillK(ptr, 2);
if(cachen[2]) {
cachen[2]--;
FreeLink *l = (FreeLink *)ptr;
l->next = cache[2];
cache[2] = l;
return;
}
FreeK(ptr, page, 2);
}

Heap::Page dummy;
#define DI { { 0, 0, 0, 0, &dummy, &dummy } }

thread__ Heap heap = {
{ DI, DI, DI, DI, DI, DI, DI, DI, DI, DI, DI, DI, DI, DI, DI, DI, DI, DI }
};

#if defined(HEAPDBG)
void *MemoryAlloc_(size_t sz)
{
return heap.Alloc(sz);
}

void MemoryFree_(void *ptr)
{
heap.Free(ptr);
}
#else
void *MemoryAlloc(size_t sz)
{
return heap.Alloc(sz);
}

void *MemoryAllocSz(size_t& sz)
{
return heap.AllocSz(sz);
}

void MemoryFree(void *ptr)
{
heap.Free(ptr);
}

void *MemoryAlloc32()
{
return heap.Alloc32();
}

void MemoryFree32(void *ptr)
{
heap.Free32(ptr);
}

void *MemoryAlloc48()
{
return heap.Alloc48();
}

void MemoryFree48(void *ptr)
{
heap.Free48(ptr);
}

#endif

#endif

END_UPP_NAMESPACE

Change log

r4471 by cxl on Jan 26, 2012   Diff
Core: Out of memory panic now displays
info about requested block size and
allocated memory (RM #240)
Go to: 
Project members, sign in to write a code review

Older revisions

r324 by mdelfede on Aug 2, 2008   Diff
new uvs2 releases : uppsrc-2630
tutorial-38  examples-142
reference-115
r281 by mdelfede on Jun 7, 2008   Diff
changed svn layout
r272 by mdelfede on May 28, 2008   Diff
new uvs2 releases : uppsrc-2567
tutorial-38  examples-141
reference-113
All revisions of this file

File info

Size: 7595 bytes, 364 lines
Powered by Google Project Hosting