Lines Matching refs:size
25 uint32 size : 31; // size in allocation_header units
42 uint32 size = heapSize / 8;
44 fEnd = size + 1;
49 fBase[1].size = size - 1;
67 if (fLastFree == 0 || fBase[fLastFree].size < 2) {
75 pool->Init(header + 1, header->size * 8);
94 void* Allocate(size_t size)
96 size = (size + 7) / 8;
98 while (index != 0 && fBase[index].size < size)
107 if (fBase[index].size - size >= 2) {
108 uint32 next = index + 1 + size;
109 uint32 nextNext = index + 1 + fBase[index].size;
110 fBase[next].size = fBase[index].size - size - 1;
112 fBase[index].size = size;
139 uint32 next = index + 1 + header->size;
146 fBase[previous].size += 1 + header->size;
157 header->size += 1 + fBase[next].size;
159 uint32 nextNext = index + 1 + header->size;
170 // find the insertion point -- list is sorted by ascending size
171 uint32 size = fBase[index].size;
173 while (next != 0 && size > fBase[next].size)
272 debug_malloc(size_t size)
277 return sCurrentPool->Allocate(size);
282 debug_calloc(size_t num, size_t size)
284 size_t allocationSize = num * size;