source: libcfa/src/heap.cfa@ ae3db00

ADT arm-eh ast-experimental enum forall-pointer-decay jacob/cs343-translation new-ast-unique-expr pthread-emulation qualifiedEnum
Last change on this file since ae3db00 was baf608a, checked in by Peter A. Buhr <pabuhr@…>, 6 years ago

provide switch to print heap statistics on program termination
  • Property mode set to 100644
File size: 43.5 KB
Line 
1//
2// Cforall Version 1.0.0 Copyright (C) 2017 University of Waterloo
3//
4// The contents of this file are covered under the licence agreement in the
5// file "LICENCE" distributed with Cforall.
6//
7// heap.c --
8//
9// Author : Peter A. Buhr
10// Created On : Tue Dec 19 21:58:35 2017
11// Last Modified By : Peter A. Buhr
12// Last Modified On : Wed Dec 4 21:42:46 2019
13// Update Count : 646
14//
15
16#include <unistd.h> // sbrk, sysconf
17#include <stdbool.h> // true, false
18#include <stdio.h> // snprintf, fileno
19#include <errno.h> // errno
20#include <string.h> // memset, memcpy
21extern "C" {
22#include <sys/mman.h> // mmap, munmap
23} // extern "C"
24
25// #comment TD : Many of these should be merged into math I believe
26#include "bits/align.hfa" // libPow2
27#include "bits/defs.hfa" // likely, unlikely
28#include "bits/locks.hfa" // __spinlock_t
29#include "startup.hfa" // STARTUP_PRIORITY_MEMORY
30//#include "stdlib.hfa" // bsearchl
31#include "malloc.h"
32
33#define MIN(x, y) (y > x ? x : y)
34
35static bool traceHeap = false;
36
37inline bool traceHeap() { return traceHeap; }
38
39bool traceHeapOn() {
40 bool temp = traceHeap;
41 traceHeap = true;
42 return temp;
43} // traceHeapOn
44
45bool traceHeapOff() {
46 bool temp = traceHeap;
47 traceHeap = false;
48 return temp;
49} // traceHeapOff
50
51bool traceHeapTerm() { return false; }
52
53
54static bool prtFree = false;
55
56inline bool prtFree() {
57 return prtFree;
58} // prtFree
59
60bool prtFreeOn() {
61 bool temp = prtFree;
62 prtFree = true;
63 return temp;
64} // prtFreeOn
65
66bool prtFreeOff() {
67 bool temp = prtFree;
68 prtFree = false;
69 return temp;
70} // prtFreeOff
71
72
73enum {
74 // Define the default extension heap amount in units of bytes. When the uC++ supplied heap reaches the brk address,
75 // the brk address is extended by the extension amount.
76 __CFA_DEFAULT_HEAP_EXPANSION__ = (1 * 1024 * 1024),
77
78 // Define the mmap crossover point during allocation. Allocations less than this amount are allocated from buckets;
79 // values greater than or equal to this value are mmap from the operating system.
80 __CFA_DEFAULT_MMAP_START__ = (512 * 1024 + 1),
81};
82
83size_t default_mmap_start() __attribute__(( weak )) {
84 return __CFA_DEFAULT_MMAP_START__;
85} // default_mmap_start
86
87size_t default_heap_expansion() __attribute__(( weak )) {
88 return __CFA_DEFAULT_HEAP_EXPANSION__;
89} // default_heap_expansion
90
91
92#ifdef __CFA_DEBUG__
93static unsigned int allocFree; // running total of allocations minus frees
94
95static void prtUnfreed() {
96 if ( allocFree != 0 ) {
97 // DO NOT USE STREAMS AS THEY MAY BE UNAVAILABLE AT THIS POINT.
98 char helpText[512];
99 int len = snprintf( helpText, sizeof(helpText), "CFA warning (UNIX pid:%ld) : program terminating with %u(0x%x) bytes of storage allocated but not freed.\n"
100 "Possible cause is unfreed storage allocated by the program or system/library routines called from the program.\n",
101 (long int)getpid(), allocFree, allocFree ); // always print the UNIX pid
102 __cfaabi_bits_write( STDERR_FILENO, helpText, len ); // print debug/nodebug
103 } // if
104} // prtUnfreed
105
106extern "C" {
107 void heapAppStart() { // called by __cfaabi_appready_startup
108 allocFree = 0;
109 } // heapAppStart
110
111 void heapAppStop() { // called by __cfaabi_appready_startdown
112 fclose( stdin ); fclose( stdout );
113 prtUnfreed();
114 } // heapAppStop
115} // extern "C"
116#endif // __CFA_DEBUG__
117
118
119// statically allocated variables => zero filled.
120static size_t pageSize; // architecture pagesize
121static size_t heapExpand; // sbrk advance
122static size_t mmapStart; // cross over point for mmap
123static unsigned int maxBucketsUsed; // maximum number of buckets in use
124
125
126#define SPINLOCK 0
127#define LOCKFREE 1
128#define BUCKETLOCK SPINLOCK
129#if BUCKETLOCK == LOCKFREE
130#include <uStackLF.h>
131#endif // LOCKFREE
132
133// Recursive definitions: HeapManager needs size of bucket array and bucket area needs sizeof HeapManager storage.
134// Break recusion by hardcoding number of buckets and statically checking number is correct after bucket array defined.
135enum { NoBucketSizes = 91 }; // number of buckets sizes
136
137struct HeapManager {
138// struct FreeHeader; // forward declaration
139
140 struct Storage {
141 struct Header { // header
142 union Kind {
143 struct RealHeader {
144 union {
145 struct { // 4-byte word => 8-byte header, 8-byte word => 16-byte header
146 #if __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__ && __SIZEOF_POINTER__ == 4
147 uint32_t padding; // unused, force home/blocksize to overlay alignment in fake header
148 #endif // __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__ && __SIZEOF_POINTER__ == 4
149
150 union {
151// FreeHeader * home; // allocated block points back to home locations (must overlay alignment)
152 void * home; // allocated block points back to home locations (must overlay alignment)
153 size_t blockSize; // size for munmap (must overlay alignment)
154 #if BUCKLOCK == SPINLOCK
155 Storage * next; // freed block points next freed block of same size
156 #endif // SPINLOCK
157 };
158
159 #if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__ && __SIZEOF_POINTER__ == 4
160 uint32_t padding; // unused, force home/blocksize to overlay alignment in fake header
161 #endif // __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__ && __SIZEOF_POINTER__ == 4
162 };
163 // future code
164 #if BUCKLOCK == LOCKFREE
165 Stack<Storage>::Link next; // freed block points next freed block of same size (double-wide)
166 #endif // LOCKFREE
167 };
168 } real; // RealHeader
169 struct FakeHeader {
170 #if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
171 uint32_t alignment; // low-order bits of home/blockSize used for tricks
172 #endif // __ORDER_LITTLE_ENDIAN__
173
174 uint32_t offset;
175
176 #if __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
177 uint32_t alignment; // low-order bits of home/blockSize used for tricks
178 #endif // __ORDER_BIG_ENDIAN__
179 } fake; // FakeHeader
180 } kind; // Kind
181 } header; // Header
182 char pad[libAlign() - sizeof( Header )];
183 char data[0]; // storage
184 }; // Storage
185
186 static_assert( libAlign() >= sizeof( Storage ), "libAlign() < sizeof( Storage )" );
187
188 struct FreeHeader {
189 #if BUCKLOCK == SPINLOCK
190 __spinlock_t lock; // must be first field for alignment
191 Storage * freeList;
192 #elif BUCKLOCK == LOCKFREE
193 // future code
194 StackLF<Storage> freeList;
195 #else
196 #error undefined lock type for bucket lock
197 #endif // SPINLOCK
198 size_t blockSize; // size of allocations on this list
199 }; // FreeHeader
200
201 // must be first fields for alignment
202 __spinlock_t extlock; // protects allocation-buffer extension
203 FreeHeader freeLists[NoBucketSizes]; // buckets for different allocation sizes
204
205 void * heapBegin; // start of heap
206 void * heapEnd; // logical end of heap
207 size_t heapRemaining; // amount of storage not allocated in the current chunk
208}; // HeapManager
209
210static inline size_t getKey( const HeapManager.FreeHeader & freeheader ) { return freeheader.blockSize; }
211
212
213#define FASTLOOKUP
214#define __STATISTICS__
215
216// Bucket size must be multiple of 16.
217// Powers of 2 are common allocation sizes, so make powers of 2 generate the minimum required size.
218static const unsigned int bucketSizes[] @= { // different bucket sizes
219 16, 32, 48, 64 + sizeof(HeapManager.Storage), // 4
220 96, 112, 128 + sizeof(HeapManager.Storage), // 3
221 160, 192, 224, 256 + sizeof(HeapManager.Storage), // 4
222 320, 384, 448, 512 + sizeof(HeapManager.Storage), // 4
223 640, 768, 896, 1_024 + sizeof(HeapManager.Storage), // 4
224 1_536, 2_048 + sizeof(HeapManager.Storage), // 2
225 2_560, 3_072, 3_584, 4_096 + sizeof(HeapManager.Storage), // 4
226 6_144, 8_192 + sizeof(HeapManager.Storage), // 2
227 9_216, 10_240, 11_264, 12_288, 13_312, 14_336, 15_360, 16_384 + sizeof(HeapManager.Storage), // 8
228 18_432, 20_480, 22_528, 24_576, 26_624, 28_672, 30_720, 32_768 + sizeof(HeapManager.Storage), // 8
229 36_864, 40_960, 45_056, 49_152, 53_248, 57_344, 61_440, 65_536 + sizeof(HeapManager.Storage), // 8
230 73_728, 81_920, 90_112, 98_304, 106_496, 114_688, 122_880, 131_072 + sizeof(HeapManager.Storage), // 8
231 147_456, 163_840, 180_224, 196_608, 212_992, 229_376, 245_760, 262_144 + sizeof(HeapManager.Storage), // 8
232 294_912, 327_680, 360_448, 393_216, 425_984, 458_752, 491_520, 524_288 + sizeof(HeapManager.Storage), // 8
233 655_360, 786_432, 917_504, 1_048_576 + sizeof(HeapManager.Storage), // 4
234 1_179_648, 1_310_720, 1_441_792, 1_572_864, 1_703_936, 1_835_008, 1_966_080, 2_097_152 + sizeof(HeapManager.Storage), // 8
235 2_621_440, 3_145_728, 3_670_016, 4_194_304 + sizeof(HeapManager.Storage), // 4
236};
237
238static_assert( NoBucketSizes == sizeof(bucketSizes) / sizeof(bucketSizes[0]), "size of bucket array wrong" );
239
240#ifdef FASTLOOKUP
241enum { LookupSizes = 65_536 + sizeof(HeapManager.Storage) }; // number of fast lookup sizes
242static unsigned char lookup[LookupSizes]; // O(1) lookup for small sizes
243#endif // FASTLOOKUP
244
245static int mmapFd = -1; // fake or actual fd for anonymous file
246#ifdef __CFA_DEBUG__
247static bool heapBoot = 0; // detect recursion during boot
248#endif // __CFA_DEBUG__
249static HeapManager heapManager __attribute__(( aligned (128) )) @= {}; // size of cache line to prevent false sharing
250
251
252#ifdef __STATISTICS__
253// Heap statistics counters.
254static unsigned long long int mmap_storage;
255static unsigned int mmap_calls;
256static unsigned long long int munmap_storage;
257static unsigned int munmap_calls;
258static unsigned long long int sbrk_storage;
259static unsigned int sbrk_calls;
260static unsigned long long int malloc_storage;
261static unsigned int malloc_calls;
262static unsigned long long int free_storage;
263static unsigned int free_calls;
264static unsigned long long int calloc_storage;
265static unsigned int calloc_calls;
266static unsigned long long int memalign_storage;
267static unsigned int memalign_calls;
268static unsigned long long int cmemalign_storage;
269static unsigned int cmemalign_calls;
270static unsigned long long int realloc_storage;
271static unsigned int realloc_calls;
272// Statistics file descriptor (changed by malloc_stats_fd).
273static int statfd = STDERR_FILENO; // default stderr
274
275// Use "write" because streams may be shutdown when calls are made.
276static void printStats() {
277 char helpText[512];
278 __cfaabi_bits_print_buffer( STDERR_FILENO, helpText, sizeof(helpText),
279 "\nHeap statistics:\n"
280 " malloc: calls %u / storage %llu\n"
281 " calloc: calls %u / storage %llu\n"
282 " memalign: calls %u / storage %llu\n"
283 " cmemalign: calls %u / storage %llu\n"
284 " realloc: calls %u / storage %llu\n"
285 " free: calls %u / storage %llu\n"
286 " mmap: calls %u / storage %llu\n"
287 " munmap: calls %u / storage %llu\n"
288 " sbrk: calls %u / storage %llu\n",
289 malloc_calls, malloc_storage,
290 calloc_calls, calloc_storage,
291 memalign_calls, memalign_storage,
292 cmemalign_calls, cmemalign_storage,
293 realloc_calls, realloc_storage,
294 free_calls, free_storage,
295 mmap_calls, mmap_storage,
296 munmap_calls, munmap_storage,
297 sbrk_calls, sbrk_storage
298 );
299} // printStats
300
301static int printStatsXML( FILE * stream ) { // see malloc_info
302 char helpText[512];
303 int len = snprintf( helpText, sizeof(helpText),
304 "<malloc version=\"1\">\n"
305 "<heap nr=\"0\">\n"
306 "<sizes>\n"
307 "</sizes>\n"
308 "<total type=\"malloc\" count=\"%u\" size=\"%llu\"/>\n"
309 "<total type=\"calloc\" count=\"%u\" size=\"%llu\"/>\n"
310 "<total type=\"memalign\" count=\"%u\" size=\"%llu\"/>\n"
311 "<total type=\"cmemalign\" count=\"%u\" size=\"%llu\"/>\n"
312 "<total type=\"realloc\" count=\"%u\" size=\"%llu\"/>\n"
313 "<total type=\"free\" count=\"%u\" size=\"%llu\"/>\n"
314 "<total type=\"mmap\" count=\"%u\" size=\"%llu\"/>\n"
315 "<total type=\"munmap\" count=\"%u\" size=\"%llu\"/>\n"
316 "<total type=\"sbrk\" count=\"%u\" size=\"%llu\"/>\n"
317 "</malloc>",
318 malloc_calls, malloc_storage,
319 calloc_calls, calloc_storage,
320 memalign_calls, memalign_storage,
321 cmemalign_calls, cmemalign_storage,
322 realloc_calls, realloc_storage,
323 free_calls, free_storage,
324 mmap_calls, mmap_storage,
325 munmap_calls, munmap_storage,
326 sbrk_calls, sbrk_storage
327 );
328 __cfaabi_bits_write( fileno( stream ), helpText, len ); // ensures all bytes written or exit
329 return len;
330} // printStatsXML
331#endif // __STATISTICS__
332
333
334// #comment TD : Is this the samething as Out-of-Memory?
335static inline void noMemory() {
336 abort( "Heap memory exhausted at %zu bytes.\n"
337 "Possible cause is very large memory allocation and/or large amount of unfreed storage allocated by the program or system/library routines.",
338 ((char *)(sbrk( 0 )) - (char *)(heapManager.heapBegin)) );
339} // noMemory
340
341
342static inline void checkAlign( size_t alignment ) {
343 if ( alignment < libAlign() || ! libPow2( alignment ) ) {
344 abort( "Alignment %zu for memory allocation is less than %d and/or not a power of 2.", alignment, libAlign() );
345 } // if
346} // checkAlign
347
348
349static inline bool setHeapExpand( size_t value ) {
350 if ( heapExpand < pageSize ) return true;
351 heapExpand = value;
352 return false;
353} // setHeapExpand
354
355
356// thunk problem
357size_t Bsearchl( unsigned int key, const unsigned int * vals, size_t dim ) {
358 size_t l = 0, m, h = dim;
359 while ( l < h ) {
360 m = (l + h) / 2;
361 if ( (unsigned int &)(vals[m]) < key ) { // cast away const
362 l = m + 1;
363 } else {
364 h = m;
365 } // if
366 } // while
367 return l;
368} // Bsearchl
369
370
371static inline bool setMmapStart( size_t value ) { // true => mmapped, false => sbrk
372 if ( value < pageSize || bucketSizes[NoBucketSizes - 1] < value ) return true;
373 mmapStart = value; // set global
374
375 // find the closest bucket size less than or equal to the mmapStart size
376 maxBucketsUsed = Bsearchl( (unsigned int)mmapStart, bucketSizes, NoBucketSizes ); // binary search
377 assert( maxBucketsUsed < NoBucketSizes ); // subscript failure ?
378 assert( mmapStart <= bucketSizes[maxBucketsUsed] ); // search failure ?
379 return false;
380} // setMmapStart
381
382
383static inline void checkHeader( bool check, const char * name, void * addr ) {
384 if ( unlikely( check ) ) { // bad address ?
385 abort( "Attempt to %s storage %p with address outside the heap.\n"
386 "Possible cause is duplicate free on same block or overwriting of memory.",
387 name, addr );
388 } // if
389} // checkHeader
390
391
392static inline void fakeHeader( HeapManager.Storage.Header *& header, size_t & alignment ) {
393 if ( unlikely( (header->kind.fake.alignment & 1) == 1 ) ) { // fake header ?
394 size_t offset = header->kind.fake.offset;
395 alignment = header->kind.fake.alignment & -2; // remove flag from value
396 #ifdef __CFA_DEBUG__
397 checkAlign( alignment ); // check alignment
398 #endif // __CFA_DEBUG__
399 header = (HeapManager.Storage.Header *)((char *)header - offset);
400 } // if
401} // fakeHeader
402
403
404// <-------+----------------------------------------------------> bsize (bucket size)
405// |header |addr
406//==================================================================================
407// | alignment
408// <-----------------<------------+-----------------------------> bsize (bucket size)
409// |fake-header | addr
410#define headerAddr( addr ) ((HeapManager.Storage.Header *)( (char *)addr - sizeof(HeapManager.Storage) ))
411
412// <-------<<--------------------- dsize ---------------------->> bsize (bucket size)
413// |header |addr
414//==================================================================================
415// | alignment
416// <------------------------------<<---------- dsize --------->>> bsize (bucket size)
417// |fake-header |addr
418#define dataStorage( bsize, addr, header ) (bsize - ( (char *)addr - (char *)header ))
419
420
421static inline bool headers( const char * name __attribute__(( unused )), void * addr, HeapManager.Storage.Header *& header, HeapManager.FreeHeader *& freeElem, size_t & size, size_t & alignment ) with ( heapManager ) {
422 header = headerAddr( addr );
423
424 if ( unlikely( heapEnd < addr ) ) { // mmapped ?
425 fakeHeader( header, alignment );
426 size = header->kind.real.blockSize & -3; // mmap size
427 return true;
428 } // if
429
430 #ifdef __CFA_DEBUG__
431 checkHeader( addr < heapBegin || header < (HeapManager.Storage.Header *)heapBegin, name, addr ); // bad low address ?
432 #endif // __CFA_DEBUG__
433
434 // header may be safe to dereference
435 fakeHeader( header, alignment );
436 #ifdef __CFA_DEBUG__
437 checkHeader( header < (HeapManager.Storage.Header *)heapBegin || (HeapManager.Storage.Header *)heapEnd < header, name, addr ); // bad address ? (offset could be + or -)
438 #endif // __CFA_DEBUG__
439
440 freeElem = (HeapManager.FreeHeader *)((size_t)header->kind.real.home & -3);
441 #ifdef __CFA_DEBUG__
442 if ( freeElem < &freeLists[0] || &freeLists[NoBucketSizes] <= freeElem ) {
443 abort( "Attempt to %s storage %p with corrupted header.\n"
444 "Possible cause is duplicate free on same block or overwriting of header information.",
445 name, addr );
446 } // if
447 #endif // __CFA_DEBUG__
448 size = freeElem->blockSize;
449 return false;
450} // headers
451
452
453static inline void * extend( size_t size ) with ( heapManager ) {
454 lock( extlock __cfaabi_dbg_ctx2 );
455 ptrdiff_t rem = heapRemaining - size;
456 if ( rem < 0 ) {
457 // If the size requested is bigger than the current remaining storage, increase the size of the heap.
458
459 size_t increase = libCeiling( size > heapExpand ? size : heapExpand, libAlign() );
460 if ( sbrk( increase ) == (void *)-1 ) {
461 unlock( extlock );
462 errno = ENOMEM;
463 return 0p;
464 } // if
465 #ifdef __STATISTICS__
466 sbrk_calls += 1;
467 sbrk_storage += increase;
468 #endif // __STATISTICS__
469 #ifdef __CFA_DEBUG__
470 // Set new memory to garbage so subsequent uninitialized usages might fail.
471 memset( (char *)heapEnd + heapRemaining, '\377', increase );
472 #endif // __CFA_DEBUG__
473 rem = heapRemaining + increase - size;
474 } // if
475
476 HeapManager.Storage * block = (HeapManager.Storage *)heapEnd;
477 heapRemaining = rem;
478 heapEnd = (char *)heapEnd + size;
479 unlock( extlock );
480 return block;
481} // extend
482
483
484static inline void * doMalloc( size_t size ) with ( heapManager ) {
485 HeapManager.Storage * block; // pointer to new block of storage
486
487 // Look up size in the size list. Make sure the user request includes space for the header that must be allocated
488 // along with the block and is a multiple of the alignment size.
489
490 if ( unlikely( size > ~0ul - sizeof(HeapManager.Storage) ) ) return 0p;
491 size_t tsize = size + sizeof(HeapManager.Storage);
492 if ( likely( tsize < mmapStart ) ) { // small size => sbrk
493 size_t posn;
494 #ifdef FASTLOOKUP
495 if ( tsize < LookupSizes ) posn = lookup[tsize];
496 else
497 #endif // FASTLOOKUP
498 posn = Bsearchl( (unsigned int)tsize, bucketSizes, (size_t)maxBucketsUsed );
499 HeapManager.FreeHeader * freeElem = &freeLists[posn];
500 // #ifdef FASTLOOKUP
501 // if ( tsize < LookupSizes )
502 // freeElem = &freeLists[lookup[tsize]];
503 // else
504 // #endif // FASTLOOKUP
505 // freeElem = bsearchl( tsize, freeLists, (size_t)maxBucketsUsed ); // binary search
506 // HeapManager.FreeHeader * freeElem =
507 // #ifdef FASTLOOKUP
508 // tsize < LookupSizes ? &freeLists[lookup[tsize]] :
509 // #endif // FASTLOOKUP
510 // bsearchl( tsize, freeLists, (size_t)maxBucketsUsed ); // binary search
511 assert( freeElem <= &freeLists[maxBucketsUsed] ); // subscripting error ?
512 assert( tsize <= freeElem->blockSize ); // search failure ?
513 tsize = freeElem->blockSize; // total space needed for request
514
515 // Spin until the lock is acquired for this particular size of block.
516
517 #if defined( SPINLOCK )
518 lock( freeElem->lock __cfaabi_dbg_ctx2 );
519 block = freeElem->freeList; // remove node from stack
520 #else
521 block = freeElem->freeList.pop();
522 #endif // SPINLOCK
523 if ( unlikely( block == 0p ) ) { // no free block ?
524 #if defined( SPINLOCK )
525 unlock( freeElem->lock );
526 #endif // SPINLOCK
527
528 // Freelist for that size was empty, so carve it out of the heap if there's enough left, or get some more
529 // and then carve it off.
530
531 block = (HeapManager.Storage *)extend( tsize ); // mutual exclusion on call
532 if ( unlikely( block == 0p ) ) return 0p;
533 #if defined( SPINLOCK )
534 } else {
535 freeElem->freeList = block->header.kind.real.next;
536 unlock( freeElem->lock );
537 #endif // SPINLOCK
538 } // if
539
540 block->header.kind.real.home = freeElem; // pointer back to free list of apropriate size
541 } else { // large size => mmap
542 if ( unlikely( size > ~0ul - pageSize ) ) return 0p;
543 tsize = libCeiling( tsize, pageSize ); // must be multiple of page size
544 #ifdef __STATISTICS__
545 __atomic_add_fetch( &mmap_calls, 1, __ATOMIC_SEQ_CST );
546 __atomic_add_fetch( &mmap_storage, tsize, __ATOMIC_SEQ_CST );
547 #endif // __STATISTICS__
548 block = (HeapManager.Storage *)mmap( 0, tsize, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANONYMOUS, mmapFd, 0 );
549 if ( block == (HeapManager.Storage *)MAP_FAILED ) {
550 // Do not call strerror( errno ) as it may call malloc.
551 abort( "(HeapManager &)0x%p.doMalloc() : internal error, mmap failure, size:%zu error:%d.", &heapManager, tsize, errno );
552 } // if
553 #ifdef __CFA_DEBUG__
554 // Set new memory to garbage so subsequent uninitialized usages might fail.
555 memset( block, '\377', tsize );
556 #endif // __CFA_DEBUG__
557 block->header.kind.real.blockSize = tsize; // storage size for munmap
558 } // if
559
560 void * addr = &(block->data); // adjust off header to user bytes
561
562 #ifdef __CFA_DEBUG__
563 assert( ((uintptr_t)addr & (libAlign() - 1)) == 0 ); // minimum alignment ?
564 __atomic_add_fetch( &allocFree, tsize, __ATOMIC_SEQ_CST );
565 if ( traceHeap() ) {
566 enum { BufferSize = 64 };
567 char helpText[BufferSize];
568 int len = snprintf( helpText, BufferSize, "%p = Malloc( %zu ) (allocated %zu)\n", addr, size, tsize );
569 // int len = snprintf( helpText, BufferSize, "Malloc %p %zu\n", addr, size );
570 __cfaabi_bits_write( STDERR_FILENO, helpText, len ); // print debug/nodebug
571 } // if
572 #endif // __CFA_DEBUG__
573
574 return addr;
575} // doMalloc
576
577
578static inline void doFree( void * addr ) with ( heapManager ) {
579 #ifdef __CFA_DEBUG__
580 if ( unlikely( heapManager.heapBegin == 0p ) ) {
581 abort( "doFree( %p ) : internal error, called before heap is initialized.", addr );
582 } // if
583 #endif // __CFA_DEBUG__
584
585 HeapManager.Storage.Header * header;
586 HeapManager.FreeHeader * freeElem;
587 size_t size, alignment; // not used (see realloc)
588
589 if ( headers( "free", addr, header, freeElem, size, alignment ) ) { // mmapped ?
590 #ifdef __STATISTICS__
591 __atomic_add_fetch( &munmap_calls, 1, __ATOMIC_SEQ_CST );
592 __atomic_add_fetch( &munmap_storage, size, __ATOMIC_SEQ_CST );
593 #endif // __STATISTICS__
594 if ( munmap( header, size ) == -1 ) {
595 #ifdef __CFA_DEBUG__
596 abort( "Attempt to deallocate storage %p not allocated or with corrupt header.\n"
597 "Possible cause is invalid pointer.",
598 addr );
599 #endif // __CFA_DEBUG__
600 } // if
601 } else {
602 #ifdef __CFA_DEBUG__
603 // Set free memory to garbage so subsequent usages might fail.
604 memset( ((HeapManager.Storage *)header)->data, '\377', freeElem->blockSize - sizeof( HeapManager.Storage ) );
605 #endif // __CFA_DEBUG__
606
607 #ifdef __STATISTICS__
608 free_storage += size;
609 #endif // __STATISTICS__
610 #if defined( SPINLOCK )
611 lock( freeElem->lock __cfaabi_dbg_ctx2 ); // acquire spin lock
612 header->kind.real.next = freeElem->freeList; // push on stack
613 freeElem->freeList = (HeapManager.Storage *)header;
614 unlock( freeElem->lock ); // release spin lock
615 #else
616 freeElem->freeList.push( *(HeapManager.Storage *)header );
617 #endif // SPINLOCK
618 } // if
619
620 #ifdef __CFA_DEBUG__
621 __atomic_add_fetch( &allocFree, -size, __ATOMIC_SEQ_CST );
622 if ( traceHeap() ) {
623 enum { BufferSize = 64 };
624 char helpText[BufferSize];
625 int len = snprintf( helpText, sizeof(helpText), "Free( %p ) size:%zu\n", addr, size );
626 __cfaabi_bits_write( STDERR_FILENO, helpText, len ); // print debug/nodebug
627 } // if
628 #endif // __CFA_DEBUG__
629} // doFree
630
631
632size_t prtFree( HeapManager & manager ) with ( manager ) {
633 size_t total = 0;
634 #ifdef __STATISTICS__
635 __cfaabi_bits_acquire();
636 __cfaabi_bits_print_nolock( STDERR_FILENO, "\nBin lists (bin size : free blocks on list)\n" );
637 #endif // __STATISTICS__
638 for ( unsigned int i = 0; i < maxBucketsUsed; i += 1 ) {
639 size_t size = freeLists[i].blockSize;
640 #ifdef __STATISTICS__
641 unsigned int N = 0;
642 #endif // __STATISTICS__
643
644 #if defined( SPINLOCK )
645 for ( HeapManager.Storage * p = freeLists[i].freeList; p != 0p; p = p->header.kind.real.next ) {
646 #else
647 for ( HeapManager.Storage * p = freeLists[i].freeList.top(); p != 0p; p = p->header.kind.real.next.top ) {
648 #endif // SPINLOCK
649 total += size;
650 #ifdef __STATISTICS__
651 N += 1;
652 #endif // __STATISTICS__
653 } // for
654
655 #ifdef __STATISTICS__
656 __cfaabi_bits_print_nolock( STDERR_FILENO, "%7zu, %-7u ", size, N );
657 if ( (i + 1) % 8 == 0 ) __cfaabi_bits_print_nolock( STDERR_FILENO, "\n" );
658 #endif // __STATISTICS__
659 } // for
660 #ifdef __STATISTICS__
661 __cfaabi_bits_print_nolock( STDERR_FILENO, "\ntotal free blocks:%zu\n", total );
662 __cfaabi_bits_release();
663 #endif // __STATISTICS__
664 return (char *)heapEnd - (char *)heapBegin - total;
665} // prtFree
666
667
668static void ?{}( HeapManager & manager ) with ( manager ) {
669 pageSize = sysconf( _SC_PAGESIZE );
670
671 for ( unsigned int i = 0; i < NoBucketSizes; i += 1 ) { // initialize the free lists
672 freeLists[i].blockSize = bucketSizes[i];
673 } // for
674
675 #ifdef FASTLOOKUP
676 unsigned int idx = 0;
677 for ( unsigned int i = 0; i < LookupSizes; i += 1 ) {
678 if ( i > bucketSizes[idx] ) idx += 1;
679 lookup[i] = idx;
680 } // for
681 #endif // FASTLOOKUP
682
683 if ( setMmapStart( default_mmap_start() ) ) {
684 abort( "HeapManager : internal error, mmap start initialization failure." );
685 } // if
686 heapExpand = default_heap_expansion();
687
688 char * end = (char *)sbrk( 0 );
689 sbrk( (char *)libCeiling( (long unsigned int)end, libAlign() ) - end ); // move start of heap to multiple of alignment
690 heapBegin = heapEnd = sbrk( 0 ); // get new start point
691} // HeapManager
692
693
694static void ^?{}( HeapManager & ) {
695 #ifdef __STATISTICS__
696 if ( traceHeapTerm() ) {
697 printStats();
698 // if ( prtfree() ) prtFree( heapManager, true );
699 } // if
700 #endif // __STATISTICS__
701} // ~HeapManager
702
703
704static void memory_startup( void ) __attribute__(( constructor( STARTUP_PRIORITY_MEMORY ) ));
705void memory_startup( void ) {
706 #ifdef __CFA_DEBUG__
707 if ( unlikely( heapBoot ) ) { // check for recursion during system boot
708 // DO NOT USE STREAMS AS THEY MAY BE UNAVAILABLE AT THIS POINT.
709 abort( "boot() : internal error, recursively invoked during system boot." );
710 } // if
711 heapBoot = true;
712 #endif // __CFA_DEBUG__
713
714 //assert( heapManager.heapBegin != 0 );
715 //heapManager{};
716 if ( heapManager.heapBegin == 0p ) heapManager{};
717} // memory_startup
718
719static void memory_shutdown( void ) __attribute__(( destructor( STARTUP_PRIORITY_MEMORY ) ));
720void memory_shutdown( void ) {
721 ^heapManager{};
722} // memory_shutdown
723
724
725static inline void * mallocNoStats( size_t size ) { // necessary for malloc statistics
726 //assert( heapManager.heapBegin != 0 );
727 if ( unlikely( heapManager.heapBegin == 0p ) ) heapManager{}; // called before memory_startup ?
728 void * addr = doMalloc( size );
729 if ( unlikely( addr == 0p ) ) errno = ENOMEM; // POSIX
730 return addr;
731} // mallocNoStats
732
733
734static inline void * callocNoStats( size_t noOfElems, size_t elemSize ) {
735 size_t size = noOfElems * elemSize;
736 char * addr = (char *)mallocNoStats( size );
737 if ( unlikely( addr == 0p ) ) return 0p;
738
739 HeapManager.Storage.Header * header;
740 HeapManager.FreeHeader * freeElem;
741 size_t bsize, alignment;
742 bool mapped __attribute__(( unused )) = headers( "calloc", addr, header, freeElem, bsize, alignment );
743 #ifndef __CFA_DEBUG__
744 // Mapped storage is zero filled, but in debug mode mapped memory is scrubbed in doMalloc, so it has to be reset to zero.
745 if ( ! mapped )
746 #endif // __CFA_DEBUG__
747 // Zero entire data space even when > than size => realloc without a new allocation and zero fill works.
748 // <-------00000000000000000000000000000000000000000000000000000> bsize (bucket size)
749 // `-header`-addr `-size
750 memset( addr, '\0', bsize - sizeof(HeapManager.Storage) ); // set to zeros
751
752 header->kind.real.blockSize |= 2; // mark as zero filled
753 return addr;
754} // callocNoStats
755
756
757static inline void * memalignNoStats( size_t alignment, size_t size ) { // necessary for malloc statistics
758 #ifdef __CFA_DEBUG__
759 checkAlign( alignment ); // check alignment
760 #endif // __CFA_DEBUG__
761
762 // if alignment <= default alignment, do normal malloc as two headers are unnecessary
763 if ( unlikely( alignment <= libAlign() ) ) return mallocNoStats( size );
764
765 // Allocate enough storage to guarantee an address on the alignment boundary, and sufficient space before it for
766 // administrative storage. NOTE, WHILE THERE ARE 2 HEADERS, THE FIRST ONE IS IMPLICITLY CREATED BY DOMALLOC.
767 // .-------------v-----------------v----------------v----------,
768 // | Real Header | ... padding ... | Fake Header | data ... |
769 // `-------------^-----------------^-+--------------^----------'
770 // |<--------------------------------' offset/align |<-- alignment boundary
771
772 // subtract libAlign() because it is already the minimum alignment
773 // add sizeof(Storage) for fake header
774 char * addr = (char *)mallocNoStats( size + alignment - libAlign() + sizeof(HeapManager.Storage) );
775 if ( unlikely( addr == 0p ) ) return addr;
776
777 // address in the block of the "next" alignment address
778 char * user = (char *)libCeiling( (uintptr_t)(addr + sizeof(HeapManager.Storage)), alignment );
779
780 // address of header from malloc
781 HeapManager.Storage.Header * realHeader = headerAddr( addr );
782 // address of fake header * before* the alignment location
783 HeapManager.Storage.Header * fakeHeader = headerAddr( user );
784 // SKULLDUGGERY: insert the offset to the start of the actual storage block and remember alignment
785 fakeHeader->kind.fake.offset = (char *)fakeHeader - (char *)realHeader;
786 // SKULLDUGGERY: odd alignment imples fake header
787 fakeHeader->kind.fake.alignment = alignment | 1;
788
789 return user;
790} // memalignNoStats
791
792
793static inline void * cmemalignNoStats( size_t alignment, size_t noOfElems, size_t elemSize ) {
794 size_t size = noOfElems * elemSize;
795 char * addr = (char *)memalignNoStats( alignment, size );
796 if ( unlikely( addr == 0p ) ) return 0p;
797 HeapManager.Storage.Header * header;
798 HeapManager.FreeHeader * freeElem;
799 size_t bsize;
800 bool mapped __attribute__(( unused )) = headers( "cmemalign", addr, header, freeElem, bsize, alignment );
801 #ifndef __CFA_DEBUG__
802 // Mapped storage is zero filled, but in debug mode mapped memory is scrubbed in doMalloc, so it has to be reset to zero.
803 if ( ! mapped )
804 #endif // __CFA_DEBUG__
805 memset( addr, '\0', dataStorage( bsize, addr, header ) ); // set to zeros
806 header->kind.real.blockSize |= 2; // mark as zero filled
807
808 return addr;
809} // cmemalignNoStats
810
811
812// supported mallopt options
813#ifndef M_MMAP_THRESHOLD
814#define M_MMAP_THRESHOLD (-1)
815#endif // M_TOP_PAD
816#ifndef M_TOP_PAD
817#define M_TOP_PAD (-2)
818#endif // M_TOP_PAD
819
820
821extern "C" {
822 // The malloc() function allocates size bytes and returns a pointer to the allocated memory. The memory is not
823 // initialized. If size is 0, then malloc() returns either 0p, or a unique pointer value that can later be
824 // successfully passed to free().
825 void * malloc( size_t size ) {
826 #ifdef __STATISTICS__
827 __atomic_add_fetch( &malloc_calls, 1, __ATOMIC_SEQ_CST );
828 __atomic_add_fetch( &malloc_storage, size, __ATOMIC_SEQ_CST );
829 #endif // __STATISTICS__
830
831 return mallocNoStats( size );
832 } // malloc
833
834 // The calloc() function allocates memory for an array of nmemb elements of size bytes each and returns a pointer to
835 // the allocated memory. The memory is set to zero. If nmemb or size is 0, then calloc() returns either 0p, or a
836 // unique pointer value that can later be successfully passed to free().
837 void * calloc( size_t noOfElems, size_t elemSize ) {
838 #ifdef __STATISTICS__
839 __atomic_add_fetch( &calloc_calls, 1, __ATOMIC_SEQ_CST );
840 __atomic_add_fetch( &calloc_storage, noOfElems * elemSize, __ATOMIC_SEQ_CST );
841 #endif // __STATISTICS__
842
843 return callocNoStats( noOfElems, elemSize );
844 } // calloc
845
846 // The realloc() function changes the size of the memory block pointed to by ptr to size bytes. The contents will be
847 // unchanged in the range from the start of the region up to the minimum of the old and new sizes. If the new size
848 // is larger than the old size, the added memory will not be initialized. If ptr is 0p, then the call is
849 // equivalent to malloc(size), for all values of size; if size is equal to zero, and ptr is not 0p, then the call
850 // is equivalent to free(ptr). Unless ptr is 0p, it must have been returned by an earlier call to malloc(),
851 // calloc() or realloc(). If the area pointed to was moved, a free(ptr) is done.
852 void * realloc( void * oaddr, size_t size ) {
853 #ifdef __STATISTICS__
854 __atomic_add_fetch( &realloc_calls, 1, __ATOMIC_SEQ_CST );
855 #endif // __STATISTICS__
856
857 // If size is equal to 0, either NULL or a pointer suitable to be passed to free() is returned.
858 if ( unlikely( size == 0 ) ) { free( oaddr ); return mallocNoStats( size ); } // special cases
859 if ( unlikely( oaddr == 0p ) ) return mallocNoStats( size );
860
861 HeapManager.Storage.Header * header;
862 HeapManager.FreeHeader * freeElem;
863 size_t bsize, oalign = 0;
864 headers( "realloc", oaddr, header, freeElem, bsize, oalign );
865
866 size_t odsize = dataStorage( bsize, oaddr, header ); // data storage available in bucket
867 if ( size <= odsize && odsize <= size * 2 ) { // allow up to 50% wasted storage in smaller size
868 // Do not know size of original allocation => cannot do 0 fill for any additional space because do not know
869 // where to start filling, i.e., do not overwrite existing values in space.
870 //
871 // This case does not result in a new profiler entry because the previous one still exists and it must match with
872 // the free for this memory. Hence, this realloc does not appear in the profiler output.
873 return oaddr;
874 } // if
875
876 #ifdef __STATISTICS__
877 __atomic_add_fetch( &realloc_storage, size, __ATOMIC_SEQ_CST );
878 #endif // __STATISTICS__
879
880 // change size and copy old content to new storage
881
882 void * naddr;
883 if ( unlikely( oalign != 0 ) ) { // previous request memalign?
884 if ( unlikely( header->kind.real.blockSize & 2 ) ) { // previous request zero fill
885 naddr = cmemalignNoStats( oalign, 1, size ); // create new aligned area
886 } else {
887 naddr = memalignNoStats( oalign, size ); // create new aligned area
888 } // if
889 } else {
890 if ( unlikely( header->kind.real.blockSize & 2 ) ) { // previous request zero fill
891 naddr = callocNoStats( 1, size ); // create new area
892 } else {
893 naddr = mallocNoStats( size ); // create new area
894 } // if
895 } // if
896 if ( unlikely( naddr == 0p ) ) return 0p;
897
898 headers( "realloc", naddr, header, freeElem, bsize, oalign );
899 size_t ndsize = dataStorage( bsize, naddr, header ); // data storage avilable in bucket
900 // To preserve prior fill, the entire bucket must be copied versus the size.
901 memcpy( naddr, oaddr, MIN( odsize, ndsize ) ); // copy bytes
902 free( oaddr );
903 return naddr;
904 } // realloc
905
906 // The obsolete function memalign() allocates size bytes and returns a pointer to the allocated memory. The memory
907 // address will be a multiple of alignment, which must be a power of two.
908 void * memalign( size_t alignment, size_t size ) {
909 #ifdef __STATISTICS__
910 __atomic_add_fetch( &memalign_calls, 1, __ATOMIC_SEQ_CST );
911 __atomic_add_fetch( &memalign_storage, size, __ATOMIC_SEQ_CST );
912 #endif // __STATISTICS__
913
914 return memalignNoStats( alignment, size );
915 } // memalign
916
917
918 // The cmemalign() function is the same as calloc() with memory alignment.
919 void * cmemalign( size_t alignment, size_t noOfElems, size_t elemSize ) {
920 #ifdef __STATISTICS__
921 __atomic_add_fetch( &cmemalign_calls, 1, __ATOMIC_SEQ_CST );
922 __atomic_add_fetch( &cmemalign_storage, noOfElems * elemSize, __ATOMIC_SEQ_CST );
923 #endif // __STATISTICS__
924
925 return cmemalignNoStats( alignment, noOfElems, elemSize );
926 } // cmemalign
927
928 // The function aligned_alloc() is the same as memalign(), except for the added restriction that size should be a
929 // multiple of alignment.
930 void * aligned_alloc( size_t alignment, size_t size ) {
931 return memalign( alignment, size );
932 } // aligned_alloc
933
934
935 // The function posix_memalign() allocates size bytes and places the address of the allocated memory in *memptr. The
936 // address of the allocated memory will be a multiple of alignment, which must be a power of two and a multiple of
937 // sizeof(void *). If size is 0, then posix_memalign() returns either 0p, or a unique pointer value that can later
938 // be successfully passed to free(3).
939 int posix_memalign( void ** memptr, size_t alignment, size_t size ) {
940 if ( alignment < sizeof(void *) || ! libPow2( alignment ) ) return EINVAL; // check alignment
941 * memptr = memalign( alignment, size );
942 if ( unlikely( * memptr == 0p ) ) return ENOMEM;
943 return 0;
944 } // posix_memalign
945
946 // The obsolete function valloc() allocates size bytes and returns a pointer to the allocated memory. The memory
947 // address will be a multiple of the page size. It is equivalent to memalign(sysconf(_SC_PAGESIZE),size).
948 void * valloc( size_t size ) {
949 return memalign( pageSize, size );
950 } // valloc
951
952
953 // The free() function frees the memory space pointed to by ptr, which must have been returned by a previous call to
954 // malloc(), calloc() or realloc(). Otherwise, or if free(ptr) has already been called before, undefined behavior
955 // occurs. If ptr is 0p, no operation is performed.
956 void free( void * addr ) {
957 #ifdef __STATISTICS__
958 __atomic_add_fetch( &free_calls, 1, __ATOMIC_SEQ_CST );
959 #endif // __STATISTICS__
960
961 if ( unlikely( addr == 0p ) ) { // special case
962 // #ifdef __CFA_DEBUG__
963 // if ( traceHeap() ) {
964 // #define nullmsg "Free( 0x0 ) size:0\n"
965 // // Do not debug print free( 0p ), as it can cause recursive entry from sprintf.
966 // __cfaabi_dbg_write( nullmsg, sizeof(nullmsg) - 1 );
967 // } // if
968 // #endif // __CFA_DEBUG__
969 return;
970 } // exit
971
972 doFree( addr );
973 } // free
974
975
976 // The malloc_alignment() function returns the alignment of the allocation.
977 size_t malloc_alignment( void * addr ) {
978 if ( unlikely( addr == 0p ) ) return libAlign(); // minimum alignment
979 HeapManager.Storage.Header * header = headerAddr( addr );
980 if ( (header->kind.fake.alignment & 1) == 1 ) { // fake header ?
981 return header->kind.fake.alignment & -2; // remove flag from value
982 } else {
983 return libAlign (); // minimum alignment
984 } // if
985 } // malloc_alignment
986
987
988 // The malloc_zero_fill() function returns true if the allocation is zero filled, i.e., initially allocated by calloc().
989 bool malloc_zero_fill( void * addr ) {
990 if ( unlikely( addr == 0p ) ) return false; // null allocation is not zero fill
991 HeapManager.Storage.Header * header = headerAddr( addr );
992 if ( (header->kind.fake.alignment & 1) == 1 ) { // fake header ?
993 header = (HeapManager.Storage.Header *)((char *)header - header->kind.fake.offset);
994 } // if
995 return (header->kind.real.blockSize & 2) != 0; // zero filled (calloc/cmemalign) ?
996 } // malloc_zero_fill
997
998
999 // The malloc_usable_size() function returns the number of usable bytes in the block pointed to by ptr, a pointer to
1000 // a block of memory allocated by malloc(3) or a related function.
1001 size_t malloc_usable_size( void * addr ) {
1002 if ( unlikely( addr == 0p ) ) return 0; // null allocation has 0 size
1003 HeapManager.Storage.Header * header;
1004 HeapManager.FreeHeader * freeElem;
1005 size_t bsize, alignment;
1006
1007 headers( "malloc_usable_size", addr, header, freeElem, bsize, alignment );
1008 return dataStorage( bsize, addr, header ); // data storage in bucket
1009 } // malloc_usable_size
1010
1011
1012 // The malloc_stats() function prints (on default standard error) statistics about memory allocated by malloc(3) and
1013 // related functions.
1014 void malloc_stats( void ) {
1015 #ifdef __STATISTICS__
1016 printStats();
1017 if ( prtFree() ) prtFree( heapManager );
1018 #endif // __STATISTICS__
1019 } // malloc_stats
1020
1021 // The malloc_stats_fd() function changes the file descripter where malloc_stats() writes the statistics.
1022 int malloc_stats_fd( int fd __attribute__(( unused )) ) {
1023 #ifdef __STATISTICS__
1024 int temp = statfd;
1025 statfd = fd;
1026 return temp;
1027 #else
1028 return -1;
1029 #endif // __STATISTICS__
1030 } // malloc_stats_fd
1031
1032
1033 // The mallopt() function adjusts parameters that control the behavior of the memory-allocation functions (see
1034 // malloc(3)). The param argument specifies the parameter to be modified, and value specifies the new value for that
1035 // parameter.
1036 int mallopt( int option, int value ) {
1037 choose( option ) {
1038 case M_TOP_PAD:
1039 if ( setHeapExpand( value ) ) return 1;
1040 case M_MMAP_THRESHOLD:
1041 if ( setMmapStart( value ) ) return 1;
1042 } // switch
1043 return 0; // error, unsupported
1044 } // mallopt
1045
1046 // The malloc_trim() function attempts to release free memory at the top of the heap (by calling sbrk(2) with a
1047 // suitable argument).
1048 int malloc_trim( size_t ) {
1049 return 0; // => impossible to release memory
1050 } // malloc_trim
1051
1052
1053 // The malloc_info() function exports an XML string that describes the current state of the memory-allocation
1054 // implementation in the caller. The string is printed on the file stream stream. The exported string includes
1055 // information about all arenas (see malloc(3)).
1056 int malloc_info( int options, FILE * stream ) {
1057 if ( options != 0 ) { errno = EINVAL; return -1; }
1058 return printStatsXML( stream );
1059 } // malloc_info
1060
1061
1062 // The malloc_get_state() function records the current state of all malloc(3) internal bookkeeping variables (but
1063 // not the actual contents of the heap or the state of malloc_hook(3) functions pointers). The state is recorded in
1064 // a system-dependent opaque data structure dynamically allocated via malloc(3), and a pointer to that data
1065 // structure is returned as the function result. (It is the caller's responsibility to free(3) this memory.)
1066 void * malloc_get_state( void ) {
1067 return 0p; // unsupported
1068 } // malloc_get_state
1069
1070
1071 // The malloc_set_state() function restores the state of all malloc(3) internal bookkeeping variables to the values
1072 // recorded in the opaque data structure pointed to by state.
1073 int malloc_set_state( void * ptr ) {
1074 return 0; // unsupported
1075 } // malloc_set_state
1076} // extern "C"
1077
1078
1079// Must have CFA linkage to overload with C linkage realloc.
1080void * realloc( void * oaddr, size_t nalign, size_t size ) {
1081 #ifdef __STATISTICS__
1082 __atomic_add_fetch( &realloc_calls, 1, __ATOMIC_SEQ_CST );
1083 #endif // __STATISTICS__
1084
1085 // If size is equal to 0, either NULL or a pointer suitable to be passed to free() is returned.
1086 if ( unlikely( size == 0 ) ) { free( oaddr ); return mallocNoStats( size ); } // special cases
1087 if ( unlikely( oaddr == 0p ) ) return mallocNoStats( size );
1088
1089 if ( unlikely( nalign == 0 ) ) nalign = libAlign(); // reset alignment to minimum
1090 #ifdef __CFA_DEBUG__
1091 else
1092 checkAlign( nalign ); // check alignment
1093 #endif // __CFA_DEBUG__
1094
1095 HeapManager.Storage.Header * header;
1096 HeapManager.FreeHeader * freeElem;
1097 size_t bsize, oalign = 0;
1098 headers( "realloc", oaddr, header, freeElem, bsize, oalign );
1099 size_t odsize = dataStorage( bsize, oaddr, header ); // data storage available in bucket
1100
1101 if ( oalign != 0 && (uintptr_t)oaddr % nalign == 0 ) { // has alignment and just happens to work out
1102 headerAddr( oaddr )->kind.fake.alignment = nalign | 1; // update alignment (could be the same)
1103 return realloc( oaddr, size );
1104 } // if
1105
1106 #ifdef __STATISTICS__
1107 __atomic_add_fetch( &realloc_storage, size, __ATOMIC_SEQ_CST );
1108 #endif // __STATISTICS__
1109
1110 // change size and copy old content to new storage
1111
1112 void * naddr;
1113 if ( unlikely( header->kind.real.blockSize & 2 ) ) { // previous request zero fill
1114 naddr = cmemalignNoStats( nalign, 1, size ); // create new aligned area
1115 } else {
1116 naddr = memalignNoStats( nalign, size ); // create new aligned area
1117 } // if
1118
1119 headers( "realloc", naddr, header, freeElem, bsize, oalign );
1120 size_t ndsize = dataStorage( bsize, naddr, header ); // data storage avilable in bucket
1121 // To preserve prior fill, the entire bucket must be copied versus the size.
1122 memcpy( naddr, oaddr, MIN( odsize, ndsize ) ); // copy bytes
1123 free( oaddr );
1124 return naddr;
1125} // realloc
1126
1127
1128// Local Variables: //
1129// tab-width: 4 //
1130// compile-command: "cfa -nodebug -O2 heap.cfa" //
1131// End: //
Note: See TracBrowser for help on using the repository browser.