-10

apps/plugins/lua/README

reviewed

··· 9 9 strtol.c 10 10 strtoul.c 11 11 strstr.c 12 12 - 13 13 - The malloc routine is Doug Lea's malloc with the following license: 14 14 - 15 15 - Version 2.8.3 Thu Sep 22 11:16:15 2005 Doug Lea (dl at gee) 16 16 - 17 17 - This is a version (aka dlmalloc) of malloc/free/realloc written by 18 18 - Doug Lea and released to the public domain, as explained at 19 19 - http://creativecommons.org/licenses/publicdomain. Send questions, 20 20 - comments, complaints, performance data, etc to dl@cs.oswego.edu 21 21 -

+1 -1

apps/plugins/lua/SOURCES

reviewed

··· 28 28 lzio.c 29 29 rockaux.c 30 30 rocklib.c 31 31 - rockmalloc.c 31 31 + tlsf_helper.c 32 32 fscanf.c 33 33 gmtime.c 34 34 strcspn.c

+3 -3

apps/plugins/lua/lua.make

reviewed

··· 30 30 ROCKS += $(LUA_BUILDDIR)/lua.rock 31 31 endif 32 32 33 33 - $(LUA_BUILDDIR)/lua.rock: $(LUA_OBJ) $(LUA_BUILDDIR)/actions.lua $(LUA_BUILDDIR)/buttons.lua $(LUA_BUILDDIR)/rocklib_aux.o 33 33 + $(LUA_BUILDDIR)/lua.rock: $(LUA_OBJ) $(TLSFLIB) $(LUA_BUILDDIR)/actions.lua $(LUA_BUILDDIR)/buttons.lua $(LUA_BUILDDIR)/rocklib_aux.o 34 34 35 35 $(LUA_BUILDDIR)/actions.lua: $(LUA_OBJ) $(LUA_SRCDIR)/action_helper.pl 36 36 $(call PRINTS,GEN $(@F))$(CC) $(PLUGINFLAGS) $(INCLUDES) -E $(APPSDIR)/plugins/lib/pluginlib_actions.h | $(LUA_SRCDIR)/action_helper.pl > $(LUA_BUILDDIR)/actions.lua ··· 45 45 $(LUA_BUILDDIR)/rocklib_aux.o: $(LUA_BUILDDIR)/rocklib_aux.c 46 46 $(call PRINTS,CC $(<F))$(CC) $(INCLUDES) $(PLUGINFLAGS) -I $(LUA_SRCDIR) -c $< -o $@ 47 47 48 48 - $(LUA_BUILDDIR)/lua.refmap: $(LUA_OBJ) 48 48 + $(LUA_BUILDDIR)/lua.refmap: $(LUA_OBJ) $(TLSFLIB) 49 49 50 50 $(LUA_OUTLDS): $(PLUGIN_LDS) $(LUA_BUILDDIR)/lua.refmap 51 51 $(call PRINTS,PP $(@F))$(call preprocess2file,$<,$@,-DOVERLAY_OFFSET=$(shell \ 52 52 $(TOOLSDIR)/ovl_offset.pl $(LUA_BUILDDIR)/lua.refmap)) 53 53 54 54 - $(LUA_BUILDDIR)/lua.ovl: $(LUA_OBJ) $(LUA_OUTLDS) 54 54 + $(LUA_BUILDDIR)/lua.ovl: $(LUA_OBJ) $(TLSFLIB) $(LUA_OUTLDS) 55 55 $(SILENT)$(CC) $(PLUGINFLAGS) -o $(basename $@).elf \ 56 56 $(filter %.o, $^) \ 57 57 $(filter %.a, $+) \

-5056

apps/plugins/lua/malloc.c

reviewed

··· 1 1 - /* 2 2 - This is a version (aka dlmalloc) of malloc/free/realloc written by 3 3 - Doug Lea and released to the public domain, as explained at 4 4 - http://creativecommons.org/licenses/publicdomain. Send questions, 5 5 - comments, complaints, performance data, etc to dl@cs.oswego.edu 6 6 - 7 7 - * Version 2.8.3 Thu Sep 22 11:16:15 2005 Doug Lea (dl at gee) 8 8 - 9 9 - Note: There may be an updated version of this malloc obtainable at 10 10 - ftp://gee.cs.oswego.edu/pub/misc/malloc.c 11 11 - Check before installing! 12 12 - 13 13 - * Quickstart 14 14 - 15 15 - This library is all in one file to simplify the most common usage: 16 16 - ftp it, compile it (-O3), and link it into another program. All of 17 17 - the compile-time options default to reasonable values for use on 18 18 - most platforms. You might later want to step through various 19 19 - compile-time and dynamic tuning options. 20 20 - 21 21 - For convenience, an include file for code using this malloc is at: 22 22 - ftp://gee.cs.oswego.edu/pub/misc/malloc-2.8.3.h 23 23 - You don't really need this .h file unless you call functions not 24 24 - defined in your system include files. The .h file contains only the 25 25 - excerpts from this file needed for using this malloc on ANSI C/C++ 26 26 - systems, so long as you haven't changed compile-time options about 27 27 - naming and tuning parameters. If you do, then you can create your 28 28 - own malloc.h that does include all settings by cutting at the point 29 29 - indicated below. Note that you may already by default be using a C 30 30 - library containing a malloc that is based on some version of this 31 31 - malloc (for example in linux). You might still want to use the one 32 32 - in this file to customize settings or to avoid overheads associated 33 33 - with library versions. 34 34 - 35 35 - * Vital statistics: 36 36 - 37 37 - Supported pointer/size_t representation: 4 or 8 bytes 38 38 - size_t MUST be an unsigned type of the same width as 39 39 - pointers. (If you are using an ancient system that declares 40 40 - size_t as a signed type, or need it to be a different width 41 41 - than pointers, you can use a previous release of this malloc 42 42 - (e.g. 2.7.2) supporting these.) 43 43 - 44 44 - Alignment: 8 bytes (default) 45 45 - This suffices for nearly all current machines and C compilers. 46 46 - However, you can define MALLOC_ALIGNMENT to be wider than this 47 47 - if necessary (up to 128bytes), at the expense of using more space. 48 48 - 49 49 - Minimum overhead per allocated chunk: 4 or 8 bytes (if 4byte sizes) 50 50 - 8 or 16 bytes (if 8byte sizes) 51 51 - Each malloced chunk has a hidden word of overhead holding size 52 52 - and status information, and additional cross-check word 53 53 - if FOOTERS is defined. 54 54 - 55 55 - Minimum allocated size: 4-byte ptrs: 16 bytes (including overhead) 56 56 - 8-byte ptrs: 32 bytes (including overhead) 57 57 - 58 58 - Even a request for zero bytes (i.e., malloc(0)) returns a 59 59 - pointer to something of the minimum allocatable size. 60 60 - The maximum overhead wastage (i.e., number of extra bytes 61 61 - allocated than were requested in malloc) is less than or equal 62 62 - to the minimum size, except for requests >= mmap_threshold that 63 63 - are serviced via mmap(), where the worst case wastage is about 64 64 - 32 bytes plus the remainder from a system page (the minimal 65 65 - mmap unit); typically 4096 or 8192 bytes. 66 66 - 67 67 - Security: static-safe; optionally more or less 68 68 - The "security" of malloc refers to the ability of malicious 69 69 - code to accentuate the effects of errors (for example, freeing 70 70 - space that is not currently malloc'ed or overwriting past the 71 71 - ends of chunks) in code that calls malloc. This malloc 72 72 - guarantees not to modify any memory locations below the base of 73 73 - heap, i.e., static variables, even in the presence of usage 74 74 - errors. The routines additionally detect most improper frees 75 75 - and reallocs. All this holds as long as the static bookkeeping 76 76 - for malloc itself is not corrupted by some other means. This 77 77 - is only one aspect of security -- these checks do not, and 78 78 - cannot, detect all possible programming errors. 79 79 - 80 80 - If FOOTERS is defined nonzero, then each allocated chunk 81 81 - carries an additional check word to verify that it was malloced 82 82 - from its space. These check words are the same within each 83 83 - execution of a program using malloc, but differ across 84 84 - executions, so externally crafted fake chunks cannot be 85 85 - freed. This improves security by rejecting frees/reallocs that 86 86 - could corrupt heap memory, in addition to the checks preventing 87 87 - writes to statics that are always on. This may further improve 88 88 - security at the expense of time and space overhead. (Note that 89 89 - FOOTERS may also be worth using with MSPACES.) 90 90 - 91 91 - By default detected errors cause the program to abort (calling 92 92 - "abort()"). You can override this to instead proceed past 93 93 - errors by defining PROCEED_ON_ERROR. In this case, a bad free 94 94 - has no effect, and a malloc that encounters a bad address 95 95 - caused by user overwrites will ignore the bad address by 96 96 - dropping pointers and indices to all known memory. This may 97 97 - be appropriate for programs that should continue if at all 98 98 - possible in the face of programming errors, although they may 99 99 - run out of memory because dropped memory is never reclaimed. 100 100 - 101 101 - If you don't like either of these options, you can define 102 102 - CORRUPTION_ERROR_ACTION and USAGE_ERROR_ACTION to do anything 103 103 - else. And if if you are sure that your program using malloc has 104 104 - no errors or vulnerabilities, you can define INSECURE to 1, 105 105 - which might (or might not) provide a small performance improvement. 106 106 - 107 107 - Thread-safety: NOT thread-safe unless USE_LOCKS defined 108 108 - When USE_LOCKS is defined, each public call to malloc, free, 109 109 - etc is surrounded with either a pthread mutex or a win32 110 110 - spinlock (depending on WIN32). This is not especially fast, and 111 111 - can be a major bottleneck. It is designed only to provide 112 112 - minimal protection in concurrent environments, and to provide a 113 113 - basis for extensions. If you are using malloc in a concurrent 114 114 - program, consider instead using ptmalloc, which is derived from 115 115 - a version of this malloc. (See http://www.malloc.de). 116 116 - 117 117 - System requirements: Any combination of MORECORE and/or MMAP/MUNMAP 118 118 - This malloc can use unix sbrk or any emulation (invoked using 119 119 - the CALL_MORECORE macro) and/or mmap/munmap or any emulation 120 120 - (invoked using CALL_MMAP/CALL_MUNMAP) to get and release system 121 121 - memory. On most unix systems, it tends to work best if both 122 122 - MORECORE and MMAP are enabled. On Win32, it uses emulations 123 123 - based on VirtualAlloc. It also uses common C library functions 124 124 - like memset. 125 125 - 126 126 - Compliance: I believe it is compliant with the Single Unix Specification 127 127 - (See http://www.unix.org). Also SVID/XPG, ANSI C, and probably 128 128 - others as well. 129 129 - 130 130 - * Overview of algorithms 131 131 - 132 132 - This is not the fastest, most space-conserving, most portable, or 133 133 - most tunable malloc ever written. However it is among the fastest 134 134 - while also being among the most space-conserving, portable and 135 135 - tunable. Consistent balance across these factors results in a good 136 136 - general-purpose allocator for malloc-intensive programs. 137 137 - 138 138 - In most ways, this malloc is a best-fit allocator. Generally, it 139 139 - chooses the best-fitting existing chunk for a request, with ties 140 140 - broken in approximately least-recently-used order. (This strategy 141 141 - normally maintains low fragmentation.) However, for requests less 142 142 - than 256bytes, it deviates from best-fit when there is not an 143 143 - exactly fitting available chunk by preferring to use space adjacent 144 144 - to that used for the previous small request, as well as by breaking 145 145 - ties in approximately most-recently-used order. (These enhance 146 146 - locality of series of small allocations.) And for very large requests 147 147 - (>= 256Kb by default), it relies on system memory mapping 148 148 - facilities, if supported. (This helps avoid carrying around and 149 149 - possibly fragmenting memory used only for large chunks.) 150 150 - 151 151 - All operations (except malloc_stats and mallinfo) have execution 152 152 - times that are bounded by a constant factor of the number of bits in 153 153 - a size_t, not counting any clearing in calloc or copying in realloc, 154 154 - or actions surrounding MORECORE and MMAP that have times 155 155 - proportional to the number of non-contiguous regions returned by 156 156 - system allocation routines, which is often just 1. 157 157 - 158 158 - The implementation is not very modular and seriously overuses 159 159 - macros. Perhaps someday all C compilers will do as good a job 160 160 - inlining modular code as can now be done by brute-force expansion, 161 161 - but now, enough of them seem not to. 162 162 - 163 163 - Some compilers issue a lot of warnings about code that is 164 164 - dead/unreachable only on some platforms, and also about intentional 165 165 - uses of negation on unsigned types. All known cases of each can be 166 166 - ignored. 167 167 - 168 168 - For a longer but out of date high-level description, see 169 169 - http://gee.cs.oswego.edu/dl/html/malloc.html 170 170 - 171 171 - * MSPACES 172 172 - If MSPACES is defined, then in addition to malloc, free, etc., 173 173 - this file also defines mspace_malloc, mspace_free, etc. These 174 174 - are versions of malloc routines that take an "mspace" argument 175 175 - obtained using create_mspace, to control all internal bookkeeping. 176 176 - If ONLY_MSPACES is defined, only these versions are compiled. 177 177 - So if you would like to use this allocator for only some allocations, 178 178 - and your system malloc for others, you can compile with 179 179 - ONLY_MSPACES and then do something like... 180 180 - static mspace mymspace = create_mspace(0,0); // for example 181 181 - #define mymalloc(bytes) mspace_malloc(mymspace, bytes) 182 182 - 183 183 - (Note: If you only need one instance of an mspace, you can instead 184 184 - use "USE_DL_PREFIX" to relabel the global malloc.) 185 185 - 186 186 - You can similarly create thread-local allocators by storing 187 187 - mspaces as thread-locals. For example: 188 188 - static __thread mspace tlms = 0; 189 189 - void* tlmalloc(size_t bytes) { 190 190 - if (tlms == 0) tlms = create_mspace(0, 0); 191 191 - return mspace_malloc(tlms, bytes); 192 192 - } 193 193 - void tlfree(void* mem) { mspace_free(tlms, mem); } 194 194 - 195 195 - Unless FOOTERS is defined, each mspace is completely independent. 196 196 - You cannot allocate from one and free to another (although 197 197 - conformance is only weakly checked, so usage errors are not always 198 198 - caught). If FOOTERS is defined, then each chunk carries around a tag 199 199 - indicating its originating mspace, and frees are directed to their 200 200 - originating spaces. 201 201 - 202 202 - ------------------------- Compile-time options --------------------------- 203 203 - 204 204 - Be careful in setting #define values for numerical constants of type 205 205 - size_t. On some systems, literal values are not automatically extended 206 206 - to size_t precision unless they are explicitly casted. 207 207 - 208 208 - WIN32 default: defined if _WIN32 defined 209 209 - Defining WIN32 sets up defaults for MS environment and compilers. 210 210 - Otherwise defaults are for unix. 211 211 - 212 212 - MALLOC_ALIGNMENT default: (size_t)8 213 213 - Controls the minimum alignment for malloc'ed chunks. It must be a 214 214 - power of two and at least 8, even on machines for which smaller 215 215 - alignments would suffice. It may be defined as larger than this 216 216 - though. Note however that code and data structures are optimized for 217 217 - the case of 8-byte alignment. 218 218 - 219 219 - MSPACES default: 0 (false) 220 220 - If true, compile in support for independent allocation spaces. 221 221 - This is only supported if HAVE_MMAP is true. 222 222 - 223 223 - ONLY_MSPACES default: 0 (false) 224 224 - If true, only compile in mspace versions, not regular versions. 225 225 - 226 226 - USE_LOCKS default: 0 (false) 227 227 - Causes each call to each public routine to be surrounded with 228 228 - pthread or WIN32 mutex lock/unlock. (If set true, this can be 229 229 - overridden on a per-mspace basis for mspace versions.) 230 230 - 231 231 - FOOTERS default: 0 232 232 - If true, provide extra checking and dispatching by placing 233 233 - information in the footers of allocated chunks. This adds 234 234 - space and time overhead. 235 235 - 236 236 - INSECURE default: 0 237 237 - If true, omit checks for usage errors and heap space overwrites. 238 238 - 239 239 - USE_DL_PREFIX default: NOT defined 240 240 - Causes compiler to prefix all public routines with the string 'dl'. 241 241 - This can be useful when you only want to use this malloc in one part 242 242 - of a program, using your regular system malloc elsewhere. 243 243 - 244 244 - ABORT default: defined as abort() 245 245 - Defines how to abort on failed checks. On most systems, a failed 246 246 - check cannot die with an "assert" or even print an informative 247 247 - message, because the underlying print routines in turn call malloc, 248 248 - which will fail again. Generally, the best policy is to simply call 249 249 - abort(). It's not very useful to do more than this because many 250 250 - errors due to overwriting will show up as address faults (null, odd 251 251 - addresses etc) rather than malloc-triggered checks, so will also 252 252 - abort. Also, most compilers know that abort() does not return, so 253 253 - can better optimize code conditionally calling it. 254 254 - 255 255 - PROCEED_ON_ERROR default: defined as 0 (false) 256 256 - Controls whether detected bad addresses cause them to bypassed 257 257 - rather than aborting. If set, detected bad arguments to free and 258 258 - realloc are ignored. And all bookkeeping information is zeroed out 259 259 - upon a detected overwrite of freed heap space, thus losing the 260 260 - ability to ever return it from malloc again, but enabling the 261 261 - application to proceed. If PROCEED_ON_ERROR is defined, the 262 262 - static variable malloc_corruption_error_count is compiled in 263 263 - and can be examined to see if errors have occurred. This option 264 264 - generates slower code than the default abort policy. 265 265 - 266 266 - DEBUG default: NOT defined 267 267 - The DEBUG setting is mainly intended for people trying to modify 268 268 - this code or diagnose problems when porting to new platforms. 269 269 - However, it may also be able to better isolate user errors than just 270 270 - using runtime checks. The assertions in the check routines spell 271 271 - out in more detail the assumptions and invariants underlying the 272 272 - algorithms. The checking is fairly extensive, and will slow down 273 273 - execution noticeably. Calling malloc_stats or mallinfo with DEBUG 274 274 - set will attempt to check every non-mmapped allocated and free chunk 275 275 - in the course of computing the summaries. 276 276 - 277 277 - ABORT_ON_ASSERT_FAILURE default: defined as 1 (true) 278 278 - Debugging assertion failures can be nearly impossible if your 279 279 - version of the assert macro causes malloc to be called, which will 280 280 - lead to a cascade of further failures, blowing the runtime stack. 281 281 - ABORT_ON_ASSERT_FAILURE cause assertions failures to call abort(), 282 282 - which will usually make debugging easier. 283 283 - 284 284 - MALLOC_FAILURE_ACTION default: sets errno to ENOMEM, or no-op on win32 285 285 - The action to take before "return 0" when malloc fails to be able to 286 286 - return memory because there is none available. 287 287 - 288 288 - HAVE_MORECORE default: 1 (true) unless win32 or ONLY_MSPACES 289 289 - True if this system supports sbrk or an emulation of it. 290 290 - 291 291 - MORECORE default: sbrk 292 292 - The name of the sbrk-style system routine to call to obtain more 293 293 - memory. See below for guidance on writing custom MORECORE 294 294 - functions. The type of the argument to sbrk/MORECORE varies across 295 295 - systems. It cannot be size_t, because it supports negative 296 296 - arguments, so it is normally the signed type of the same width as 297 297 - size_t (sometimes declared as "intptr_t"). It doesn't much matter 298 298 - though. Internally, we only call it with arguments less than half 299 299 - the max value of a size_t, which should work across all reasonable 300 300 - possibilities, although sometimes generating compiler warnings. See 301 301 - near the end of this file for guidelines for creating a custom 302 302 - version of MORECORE. 303 303 - 304 304 - MORECORE_CONTIGUOUS default: 1 (true) 305 305 - If true, take advantage of fact that consecutive calls to MORECORE 306 306 - with positive arguments always return contiguous increasing 307 307 - addresses. This is true of unix sbrk. It does not hurt too much to 308 308 - set it true anyway, since malloc copes with non-contiguities. 309 309 - Setting it false when definitely non-contiguous saves time 310 310 - and possibly wasted space it would take to discover this though. 311 311 - 312 312 - MORECORE_CANNOT_TRIM default: NOT defined 313 313 - True if MORECORE cannot release space back to the system when given 314 314 - negative arguments. This is generally necessary only if you are 315 315 - using a hand-crafted MORECORE function that cannot handle negative 316 316 - arguments. 317 317 - 318 318 - HAVE_MMAP default: 1 (true) 319 319 - True if this system supports mmap or an emulation of it. If so, and 320 320 - HAVE_MORECORE is not true, MMAP is used for all system 321 321 - allocation. If set and HAVE_MORECORE is true as well, MMAP is 322 322 - primarily used to directly allocate very large blocks. It is also 323 323 - used as a backup strategy in cases where MORECORE fails to provide 324 324 - space from system. Note: A single call to MUNMAP is assumed to be 325 325 - able to unmap memory that may have be allocated using multiple calls 326 326 - to MMAP, so long as they are adjacent. 327 327 - 328 328 - HAVE_MREMAP default: 1 on linux, else 0 329 329 - If true realloc() uses mremap() to re-allocate large blocks and 330 330 - extend or shrink allocation spaces. 331 331 - 332 332 - MMAP_CLEARS default: 1 on unix 333 333 - True if mmap clears memory so calloc doesn't need to. This is true 334 334 - for standard unix mmap using /dev/zero. 335 335 - 336 336 - USE_BUILTIN_FFS default: 0 (i.e., not used) 337 337 - Causes malloc to use the builtin ffs() function to compute indices. 338 338 - Some compilers may recognize and intrinsify ffs to be faster than the 339 339 - supplied C version. Also, the case of x86 using gcc is special-cased 340 340 - to an asm instruction, so is already as fast as it can be, and so 341 341 - this setting has no effect. (On most x86s, the asm version is only 342 342 - slightly faster than the C version.) 343 343 - 344 344 - malloc_getpagesize default: derive from system includes, or 4096. 345 345 - The system page size. To the extent possible, this malloc manages 346 346 - memory from the system in page-size units. This may be (and 347 347 - usually is) a function rather than a constant. This is ignored 348 348 - if WIN32, where page size is determined using getSystemInfo during 349 349 - initialization. 350 350 - 351 351 - USE_DEV_RANDOM default: 0 (i.e., not used) 352 352 - Causes malloc to use /dev/random to initialize secure magic seed for 353 353 - stamping footers. Otherwise, the current time is used. 354 354 - 355 355 - NO_MALLINFO default: 0 356 356 - If defined, don't compile "mallinfo". This can be a simple way 357 357 - of dealing with mismatches between system declarations and 358 358 - those in this file. 359 359 - 360 360 - MALLINFO_FIELD_TYPE default: size_t 361 361 - The type of the fields in the mallinfo struct. This was originally 362 362 - defined as "int" in SVID etc, but is more usefully defined as 363 363 - size_t. The value is used only if HAVE_USR_INCLUDE_MALLOC_H is not set 364 364 - 365 365 - REALLOC_ZERO_BYTES_FREES default: not defined 366 366 - This should be set if a call to realloc with zero bytes should 367 367 - be the same as a call to free. Some people think it should. Otherwise, 368 368 - since this malloc returns a unique pointer for malloc(0), so does 369 369 - realloc(p, 0). 370 370 - 371 371 - LACKS_UNISTD_H, LACKS_FCNTL_H, LACKS_SYS_PARAM_H, LACKS_SYS_MMAN_H 372 372 - LACKS_STRINGS_H, LACKS_STRING_H, LACKS_SYS_TYPES_H, LACKS_ERRNO_H 373 373 - LACKS_STDLIB_H default: NOT defined unless on WIN32 374 374 - Define these if your system does not have these header files. 375 375 - You might need to manually insert some of the declarations they provide. 376 376 - 377 377 - DEFAULT_GRANULARITY default: page size if MORECORE_CONTIGUOUS, 378 378 - system_info.dwAllocationGranularity in WIN32, 379 379 - otherwise 64K. 380 380 - Also settable using mallopt(M_GRANULARITY, x) 381 381 - The unit for allocating and deallocating memory from the system. On 382 382 - most systems with contiguous MORECORE, there is no reason to 383 383 - make this more than a page. However, systems with MMAP tend to 384 384 - either require or encourage larger granularities. You can increase 385 385 - this value to prevent system allocation functions to be called so 386 386 - often, especially if they are slow. The value must be at least one 387 387 - page and must be a power of two. Setting to 0 causes initialization 388 388 - to either page size or win32 region size. (Note: In previous 389 389 - versions of malloc, the equivalent of this option was called 390 390 - "TOP_PAD") 391 391 - 392 392 - DEFAULT_TRIM_THRESHOLD default: 2MB 393 393 - Also settable using mallopt(M_TRIM_THRESHOLD, x) 394 394 - The maximum amount of unused top-most memory to keep before 395 395 - releasing via malloc_trim in free(). Automatic trimming is mainly 396 396 - useful in long-lived programs using contiguous MORECORE. Because 397 397 - trimming via sbrk can be slow on some systems, and can sometimes be 398 398 - wasteful (in cases where programs immediately afterward allocate 399 399 - more large chunks) the value should be high enough so that your 400 400 - overall system performance would improve by releasing this much 401 401 - memory. As a rough guide, you might set to a value close to the 402 402 - average size of a process (program) running on your system. 403 403 - Releasing this much memory would allow such a process to run in 404 404 - memory. Generally, it is worth tuning trim thresholds when a 405 405 - program undergoes phases where several large chunks are allocated 406 406 - and released in ways that can reuse each other's storage, perhaps 407 407 - mixed with phases where there are no such chunks at all. The trim 408 408 - value must be greater than page size to have any useful effect. To 409 409 - disable trimming completely, you can set to MAX_SIZE_T. Note that the trick 410 410 - some people use of mallocing a huge space and then freeing it at 411 411 - program startup, in an attempt to reserve system memory, doesn't 412 412 - have the intended effect under automatic trimming, since that memory 413 413 - will immediately be returned to the system. 414 414 - 415 415 - DEFAULT_MMAP_THRESHOLD default: 256K 416 416 - Also settable using mallopt(M_MMAP_THRESHOLD, x) 417 417 - The request size threshold for using MMAP to directly service a 418 418 - request. Requests of at least this size that cannot be allocated 419 419 - using already-existing space will be serviced via mmap. (If enough 420 420 - normal freed space already exists it is used instead.) Using mmap 421 421 - segregates relatively large chunks of memory so that they can be 422 422 - individually obtained and released from the host system. A request 423 423 - serviced through mmap is never reused by any other request (at least 424 424 - not directly; the system may just so happen to remap successive 425 425 - requests to the same locations). Segregating space in this way has 426 426 - the benefits that: Mmapped space can always be individually released 427 427 - back to the system, which helps keep the system level memory demands 428 428 - of a long-lived program low. Also, mapped memory doesn't become 429 429 - `locked' between other chunks, as can happen with normally allocated 430 430 - chunks, which means that even trimming via malloc_trim would not 431 431 - release them. However, it has the disadvantage that the space 432 432 - cannot be reclaimed, consolidated, and then used to service later 433 433 - requests, as happens with normal chunks. The advantages of mmap 434 434 - nearly always outweigh disadvantages for "large" chunks, but the 435 435 - value of "large" may vary across systems. The default is an 436 436 - empirically derived value that works well in most systems. You can 437 437 - disable mmap by setting to MAX_SIZE_T. 438 438 - 439 439 - */ 440 440 - 441 441 - #ifndef WIN32 442 442 - #ifdef _WIN32 443 443 - #define WIN32 1 444 444 - #endif /* _WIN32 */ 445 445 - #endif /* WIN32 */ 446 446 - #ifdef WIN32 447 447 - #define WIN32_LEAN_AND_MEAN 448 448 - #include <windows.h> 449 449 - #define HAVE_MMAP 1 450 450 - #define HAVE_MORECORE 0 451 451 - #define LACKS_UNISTD_H 452 452 - #define LACKS_SYS_PARAM_H 453 453 - #define LACKS_SYS_MMAN_H 454 454 - #define LACKS_STRING_H 455 455 - #define LACKS_STRINGS_H 456 456 - #define LACKS_SYS_TYPES_H 457 457 - #define LACKS_ERRNO_H 458 458 - #define MALLOC_FAILURE_ACTION 459 459 - #define MMAP_CLEARS 0 /* WINCE and some others apparently don't clear */ 460 460 - #endif /* WIN32 */ 461 461 - 462 462 - #if defined(DARWIN) || defined(_DARWIN) 463 463 - /* Mac OSX docs advise not to use sbrk; it seems better to use mmap */ 464 464 - #ifndef HAVE_MORECORE 465 465 - #define HAVE_MORECORE 0 466 466 - #define HAVE_MMAP 1 467 467 - #endif /* HAVE_MORECORE */ 468 468 - #endif /* DARWIN */ 469 469 - 470 470 - #ifndef LACKS_SYS_TYPES_H 471 471 - #include <sys/types.h> /* For size_t */ 472 472 - #endif /* LACKS_SYS_TYPES_H */ 473 473 - 474 474 - /* The maximum possible size_t value has all bits set */ 475 475 - #define MAX_SIZE_T (~(size_t)0) 476 476 - 477 477 - #ifndef ONLY_MSPACES 478 478 - #define ONLY_MSPACES 0 479 479 - #endif /* ONLY_MSPACES */ 480 480 - #ifndef MSPACES 481 481 - #if ONLY_MSPACES 482 482 - #define MSPACES 1 483 483 - #else /* ONLY_MSPACES */ 484 484 - #define MSPACES 0 485 485 - #endif /* ONLY_MSPACES */ 486 486 - #endif /* MSPACES */ 487 487 - #ifndef MALLOC_ALIGNMENT 488 488 - #define MALLOC_ALIGNMENT ((size_t)8U) 489 489 - #endif /* MALLOC_ALIGNMENT */ 490 490 - #ifndef FOOTERS 491 491 - #define FOOTERS 0 492 492 - #endif /* FOOTERS */ 493 493 - #ifndef ABORT 494 494 - #define ABORT abort() 495 495 - #endif /* ABORT */ 496 496 - #ifndef ABORT_ON_ASSERT_FAILURE 497 497 - #define ABORT_ON_ASSERT_FAILURE 1 498 498 - #endif /* ABORT_ON_ASSERT_FAILURE */ 499 499 - #ifndef PROCEED_ON_ERROR 500 500 - #define PROCEED_ON_ERROR 0 501 501 - #endif /* PROCEED_ON_ERROR */ 502 502 - #ifndef USE_LOCKS 503 503 - #define USE_LOCKS 0 504 504 - #endif /* USE_LOCKS */ 505 505 - #ifndef INSECURE 506 506 - #define INSECURE 0 507 507 - #endif /* INSECURE */ 508 508 - #ifndef HAVE_MMAP 509 509 - #define HAVE_MMAP 1 510 510 - #endif /* HAVE_MMAP */ 511 511 - #ifndef MMAP_CLEARS 512 512 - #define MMAP_CLEARS 1 513 513 - #endif /* MMAP_CLEARS */ 514 514 - #ifndef HAVE_MREMAP 515 515 - #ifdef linux 516 516 - #define HAVE_MREMAP 1 517 517 - #else /* linux */ 518 518 - #define HAVE_MREMAP 0 519 519 - #endif /* linux */ 520 520 - #endif /* HAVE_MREMAP */ 521 521 - #ifndef MALLOC_FAILURE_ACTION 522 522 - #define MALLOC_FAILURE_ACTION errno = ENOMEM; 523 523 - #endif /* MALLOC_FAILURE_ACTION */ 524 524 - #ifndef HAVE_MORECORE 525 525 - #if ONLY_MSPACES 526 526 - #define HAVE_MORECORE 0 527 527 - #else /* ONLY_MSPACES */ 528 528 - #define HAVE_MORECORE 1 529 529 - #endif /* ONLY_MSPACES */ 530 530 - #endif /* HAVE_MORECORE */ 531 531 - #if !HAVE_MORECORE 532 532 - #define MORECORE_CONTIGUOUS 0 533 533 - #else /* !HAVE_MORECORE */ 534 534 - #ifndef MORECORE 535 535 - #define MORECORE sbrk 536 536 - #endif /* MORECORE */ 537 537 - #ifndef MORECORE_CONTIGUOUS 538 538 - #define MORECORE_CONTIGUOUS 1 539 539 - #endif /* MORECORE_CONTIGUOUS */ 540 540 - #endif /* HAVE_MORECORE */ 541 541 - #ifndef DEFAULT_GRANULARITY 542 542 - #if MORECORE_CONTIGUOUS 543 543 - #define DEFAULT_GRANULARITY (0) /* 0 means to compute in init_mparams */ 544 544 - #else /* MORECORE_CONTIGUOUS */ 545 545 - #define DEFAULT_GRANULARITY ((size_t)64U * (size_t)1024U) 546 546 - #endif /* MORECORE_CONTIGUOUS */ 547 547 - #endif /* DEFAULT_GRANULARITY */ 548 548 - #ifndef DEFAULT_TRIM_THRESHOLD 549 549 - #ifndef MORECORE_CANNOT_TRIM 550 550 - #define DEFAULT_TRIM_THRESHOLD ((size_t)2U * (size_t)1024U * (size_t)1024U) 551 551 - #else /* MORECORE_CANNOT_TRIM */ 552 552 - #define DEFAULT_TRIM_THRESHOLD MAX_SIZE_T 553 553 - #endif /* MORECORE_CANNOT_TRIM */ 554 554 - #endif /* DEFAULT_TRIM_THRESHOLD */ 555 555 - #ifndef DEFAULT_MMAP_THRESHOLD 556 556 - #if HAVE_MMAP 557 557 - #define DEFAULT_MMAP_THRESHOLD ((size_t)256U * (size_t)1024U) 558 558 - #else /* HAVE_MMAP */ 559 559 - #define DEFAULT_MMAP_THRESHOLD MAX_SIZE_T 560 560 - #endif /* HAVE_MMAP */ 561 561 - #endif /* DEFAULT_MMAP_THRESHOLD */ 562 562 - #ifndef USE_BUILTIN_FFS 563 563 - #define USE_BUILTIN_FFS 0 564 564 - #endif /* USE_BUILTIN_FFS */ 565 565 - #ifndef USE_DEV_RANDOM 566 566 - #define USE_DEV_RANDOM 0 567 567 - #endif /* USE_DEV_RANDOM */ 568 568 - #ifndef NO_MALLINFO 569 569 - #define NO_MALLINFO 0 570 570 - #endif /* NO_MALLINFO */ 571 571 - #ifndef MALLINFO_FIELD_TYPE 572 572 - #define MALLINFO_FIELD_TYPE size_t 573 573 - #endif /* MALLINFO_FIELD_TYPE */ 574 574 - 575 575 - /* 576 576 - mallopt tuning options. SVID/XPG defines four standard parameter 577 577 - numbers for mallopt, normally defined in malloc.h. None of these 578 578 - are used in this malloc, so setting them has no effect. But this 579 579 - malloc does support the following options. 580 580 - */ 581 581 - 582 582 - #define M_TRIM_THRESHOLD (-1) 583 583 - #define M_GRANULARITY (-2) 584 584 - #define M_MMAP_THRESHOLD (-3) 585 585 - 586 586 - /* ------------------------ Mallinfo declarations ------------------------ */ 587 587 - 588 588 - #if !NO_MALLINFO 589 589 - /* 590 590 - This version of malloc supports the standard SVID/XPG mallinfo 591 591 - routine that returns a struct containing usage properties and 592 592 - statistics. It should work on any system that has a 593 593 - /usr/include/malloc.h defining struct mallinfo. The main 594 594 - declaration needed is the mallinfo struct that is returned (by-copy) 595 595 - by mallinfo(). The malloinfo struct contains a bunch of fields that 596 596 - are not even meaningful in this version of malloc. These fields are 597 597 - are instead filled by mallinfo() with other numbers that might be of 598 598 - interest. 599 599 - 600 600 - HAVE_USR_INCLUDE_MALLOC_H should be set if you have a 601 601 - /usr/include/malloc.h file that includes a declaration of struct 602 602 - mallinfo. If so, it is included; else a compliant version is 603 603 - declared below. These must be precisely the same for mallinfo() to 604 604 - work. The original SVID version of this struct, defined on most 605 605 - systems with mallinfo, declares all fields as ints. But some others 606 606 - define as unsigned long. If your system defines the fields using a 607 607 - type of different width than listed here, you MUST #include your 608 608 - system version and #define HAVE_USR_INCLUDE_MALLOC_H. 609 609 - */ 610 610 - 611 611 - /* #define HAVE_USR_INCLUDE_MALLOC_H */ 612 612 - 613 613 - #ifdef HAVE_USR_INCLUDE_MALLOC_H 614 614 - #include "/usr/include/malloc.h" 615 615 - #else /* HAVE_USR_INCLUDE_MALLOC_H */ 616 616 - 617 617 - struct mallinfo { 618 618 - MALLINFO_FIELD_TYPE arena; /* non-mmapped space allocated from system */ 619 619 - MALLINFO_FIELD_TYPE ordblks; /* number of free chunks */ 620 620 - MALLINFO_FIELD_TYPE smblks; /* always 0 */ 621 621 - MALLINFO_FIELD_TYPE hblks; /* always 0 */ 622 622 - MALLINFO_FIELD_TYPE hblkhd; /* space in mmapped regions */ 623 623 - MALLINFO_FIELD_TYPE usmblks; /* maximum total allocated space */ 624 624 - MALLINFO_FIELD_TYPE fsmblks; /* always 0 */ 625 625 - MALLINFO_FIELD_TYPE uordblks; /* total allocated space */ 626 626 - MALLINFO_FIELD_TYPE fordblks; /* total free space */ 627 627 - MALLINFO_FIELD_TYPE keepcost; /* releasable (via malloc_trim) space */ 628 628 - }; 629 629 - 630 630 - #endif /* HAVE_USR_INCLUDE_MALLOC_H */ 631 631 - #endif /* NO_MALLINFO */ 632 632 - 633 633 - #ifdef __cplusplus 634 634 - extern "C" { 635 635 - #endif /* __cplusplus */ 636 636 - 637 637 - #if !ONLY_MSPACES 638 638 - 639 639 - /* ------------------- Declarations of public routines ------------------- */ 640 640 - 641 641 - #ifndef USE_DL_PREFIX 642 642 - #define dlcalloc calloc 643 643 - #define dlfree free 644 644 - #define dlmalloc malloc 645 645 - #define dlmemalign memalign 646 646 - #define dlrealloc realloc 647 647 - #define dlvalloc valloc 648 648 - #define dlpvalloc pvalloc 649 649 - #define dlmallinfo mallinfo 650 650 - #define dlmallopt mallopt 651 651 - #define dlmalloc_trim malloc_trim 652 652 - #define dlmalloc_stats malloc_stats 653 653 - #define dlmalloc_usable_size malloc_usable_size 654 654 - #define dlmalloc_footprint malloc_footprint 655 655 - #define dlmalloc_max_footprint malloc_max_footprint 656 656 - #define dlindependent_calloc independent_calloc 657 657 - #define dlindependent_comalloc independent_comalloc 658 658 - #endif /* USE_DL_PREFIX */ 659 659 - 660 660 - 661 661 - /* 662 662 - malloc(size_t n) 663 663 - Returns a pointer to a newly allocated chunk of at least n bytes, or 664 664 - null if no space is available, in which case errno is set to ENOMEM 665 665 - on ANSI C systems. 666 666 - 667 667 - If n is zero, malloc returns a minimum-sized chunk. (The minimum 668 668 - size is 16 bytes on most 32bit systems, and 32 bytes on 64bit 669 669 - systems.) Note that size_t is an unsigned type, so calls with 670 670 - arguments that would be negative if signed are interpreted as 671 671 - requests for huge amounts of space, which will often fail. The 672 672 - maximum supported value of n differs across systems, but is in all 673 673 - cases less than the maximum representable value of a size_t. 674 674 - */ 675 675 - void* dlmalloc(size_t); 676 676 - 677 677 - /* 678 678 - free(void* p) 679 679 - Releases the chunk of memory pointed to by p, that had been previously 680 680 - allocated using malloc or a related routine such as realloc. 681 681 - It has no effect if p is null. If p was not malloced or already 682 682 - freed, free(p) will by default cause the current program to abort. 683 683 - */ 684 684 - void dlfree(void*); 685 685 - 686 686 - /* 687 687 - calloc(size_t n_elements, size_t element_size); 688 688 - Returns a pointer to n_elements * element_size bytes, with all locations 689 689 - set to zero. 690 690 - */ 691 691 - void* dlcalloc(size_t, size_t); 692 692 - 693 693 - /* 694 694 - realloc(void* p, size_t n) 695 695 - Returns a pointer to a chunk of size n that contains the same data 696 696 - as does chunk p up to the minimum of (n, p's size) bytes, or null 697 697 - if no space is available. 698 698 - 699 699 - The returned pointer may or may not be the same as p. The algorithm 700 700 - prefers extending p in most cases when possible, otherwise it 701 701 - employs the equivalent of a malloc-copy-free sequence. 702 702 - 703 703 - If p is null, realloc is equivalent to malloc. 704 704 - 705 705 - If space is not available, realloc returns null, errno is set (if on 706 706 - ANSI) and p is NOT freed. 707 707 - 708 708 - if n is for fewer bytes than already held by p, the newly unused 709 709 - space is lopped off and freed if possible. realloc with a size 710 710 - argument of zero (re)allocates a minimum-sized chunk. 711 711 - 712 712 - The old unix realloc convention of allowing the last-free'd chunk 713 713 - to be used as an argument to realloc is not supported. 714 714 - */ 715 715 - 716 716 - void* dlrealloc(void*, size_t); 717 717 - 718 718 - /* 719 719 - memalign(size_t alignment, size_t n); 720 720 - Returns a pointer to a newly allocated chunk of n bytes, aligned 721 721 - in accord with the alignment argument. 722 722 - 723 723 - The alignment argument should be a power of two. If the argument is 724 724 - not a power of two, the nearest greater power is used. 725 725 - 8-byte alignment is guaranteed by normal malloc calls, so don't 726 726 - bother calling memalign with an argument of 8 or less. 727 727 - 728 728 - Overreliance on memalign is a sure way to fragment space. 729 729 - */ 730 730 - void* dlmemalign(size_t, size_t); 731 731 - 732 732 - /* 733 733 - valloc(size_t n); 734 734 - Equivalent to memalign(pagesize, n), where pagesize is the page 735 735 - size of the system. If the pagesize is unknown, 4096 is used. 736 736 - */ 737 737 - void* dlvalloc(size_t); 738 738 - 739 739 - /* 740 740 - mallopt(int parameter_number, int parameter_value) 741 741 - Sets tunable parameters The format is to provide a 742 742 - (parameter-number, parameter-value) pair. mallopt then sets the 743 743 - corresponding parameter to the argument value if it can (i.e., so 744 744 - long as the value is meaningful), and returns 1 if successful else 745 745 - 0. SVID/XPG/ANSI defines four standard param numbers for mallopt, 746 746 - normally defined in malloc.h. None of these are use in this malloc, 747 747 - so setting them has no effect. But this malloc also supports other 748 748 - options in mallopt. See below for details. Briefly, supported 749 749 - parameters are as follows (listed defaults are for "typical" 750 750 - configurations). 751 751 - 752 752 - Symbol param # default allowed param values 753 753 - M_TRIM_THRESHOLD -1 2*1024*1024 any (MAX_SIZE_T disables) 754 754 - M_GRANULARITY -2 page size any power of 2 >= page size 755 755 - M_MMAP_THRESHOLD -3 256*1024 any (or 0 if no MMAP support) 756 756 - */ 757 757 - int dlmallopt(int, int); 758 758 - 759 759 - /* 760 760 - malloc_footprint(); 761 761 - Returns the number of bytes obtained from the system. The total 762 762 - number of bytes allocated by malloc, realloc etc., is less than this 763 763 - value. Unlike mallinfo, this function returns only a precomputed 764 764 - result, so can be called frequently to monitor memory consumption. 765 765 - Even if locks are otherwise defined, this function does not use them, 766 766 - so results might not be up to date. 767 767 - */ 768 768 - size_t dlmalloc_footprint(void); 769 769 - 770 770 - /* 771 771 - malloc_max_footprint(); 772 772 - Returns the maximum number of bytes obtained from the system. This 773 773 - value will be greater than current footprint if deallocated space 774 774 - has been reclaimed by the system. The peak number of bytes allocated 775 775 - by malloc, realloc etc., is less than this value. Unlike mallinfo, 776 776 - this function returns only a precomputed result, so can be called 777 777 - frequently to monitor memory consumption. Even if locks are 778 778 - otherwise defined, this function does not use them, so results might 779 779 - not be up to date. 780 780 - */ 781 781 - size_t dlmalloc_max_footprint(void); 782 782 - 783 783 - #if !NO_MALLINFO 784 784 - /* 785 785 - mallinfo() 786 786 - Returns (by copy) a struct containing various summary statistics: 787 787 - 788 788 - arena: current total non-mmapped bytes allocated from system 789 789 - ordblks: the number of free chunks 790 790 - smblks: always zero. 791 791 - hblks: current number of mmapped regions 792 792 - hblkhd: total bytes held in mmapped regions 793 793 - usmblks: the maximum total allocated space. This will be greater 794 794 - than current total if trimming has occurred. 795 795 - fsmblks: always zero 796 796 - uordblks: current total allocated space (normal or mmapped) 797 797 - fordblks: total free space 798 798 - keepcost: the maximum number of bytes that could ideally be released 799 799 - back to system via malloc_trim. ("ideally" means that 800 800 - it ignores page restrictions etc.) 801 801 - 802 802 - Because these fields are ints, but internal bookkeeping may 803 803 - be kept as longs, the reported values may wrap around zero and 804 804 - thus be inaccurate. 805 805 - */ 806 806 - struct mallinfo dlmallinfo(void); 807 807 - #endif /* NO_MALLINFO */ 808 808 - 809 809 - /* 810 810 - independent_calloc(size_t n_elements, size_t element_size, void* chunks[]); 811 811 - 812 812 - independent_calloc is similar to calloc, but instead of returning a 813 813 - single cleared space, it returns an array of pointers to n_elements 814 814 - independent elements that can hold contents of size elem_size, each 815 815 - of which starts out cleared, and can be independently freed, 816 816 - realloc'ed etc. The elements are guaranteed to be adjacently 817 817 - allocated (this is not guaranteed to occur with multiple callocs or 818 818 - mallocs), which may also improve cache locality in some 819 819 - applications. 820 820 - 821 821 - The "chunks" argument is optional (i.e., may be null, which is 822 822 - probably the most typical usage). If it is null, the returned array 823 823 - is itself dynamically allocated and should also be freed when it is 824 824 - no longer needed. Otherwise, the chunks array must be of at least 825 825 - n_elements in length. It is filled in with the pointers to the 826 826 - chunks. 827 827 - 828 828 - In either case, independent_calloc returns this pointer array, or 829 829 - null if the allocation failed. If n_elements is zero and "chunks" 830 830 - is null, it returns a chunk representing an array with zero elements 831 831 - (which should be freed if not wanted). 832 832 - 833 833 - Each element must be individually freed when it is no longer 834 834 - needed. If you'd like to instead be able to free all at once, you 835 835 - should instead use regular calloc and assign pointers into this 836 836 - space to represent elements. (In this case though, you cannot 837 837 - independently free elements.) 838 838 - 839 839 - independent_calloc simplifies and speeds up implementations of many 840 840 - kinds of pools. It may also be useful when constructing large data 841 841 - structures that initially have a fixed number of fixed-sized nodes, 842 842 - but the number is not known at compile time, and some of the nodes 843 843 - may later need to be freed. For example: 844 844 - 845 845 - struct Node { int item; struct Node* next; }; 846 846 - 847 847 - struct Node* build_list() { 848 848 - struct Node** pool; 849 849 - int n = read_number_of_nodes_needed(); 850 850 - if (n <= 0) return 0; 851 851 - pool = (struct Node**)(independent_calloc(n, sizeof(struct Node), 0); 852 852 - if (pool == 0) die(); 853 853 - // organize into a linked list... 854 854 - struct Node* first = pool[0]; 855 855 - for (i = 0; i < n-1; ++i) 856 856 - pool[i]->next = pool[i+1]; 857 857 - free(pool); // Can now free the array (or not, if it is needed later) 858 858 - return first; 859 859 - } 860 860 - */ 861 861 - void** dlindependent_calloc(size_t, size_t, void**); 862 862 - 863 863 - /* 864 864 - independent_comalloc(size_t n_elements, size_t sizes[], void* chunks[]); 865 865 - 866 866 - independent_comalloc allocates, all at once, a set of n_elements 867 867 - chunks with sizes indicated in the "sizes" array. It returns 868 868 - an array of pointers to these elements, each of which can be 869 869 - independently freed, realloc'ed etc. The elements are guaranteed to 870 870 - be adjacently allocated (this is not guaranteed to occur with 871 871 - multiple callocs or mallocs), which may also improve cache locality 872 872 - in some applications. 873 873 - 874 874 - The "chunks" argument is optional (i.e., may be null). If it is null 875 875 - the returned array is itself dynamically allocated and should also 876 876 - be freed when it is no longer needed. Otherwise, the chunks array 877 877 - must be of at least n_elements in length. It is filled in with the 878 878 - pointers to the chunks. 879 879 - 880 880 - In either case, independent_comalloc returns this pointer array, or 881 881 - null if the allocation failed. If n_elements is zero and chunks is 882 882 - null, it returns a chunk representing an array with zero elements 883 883 - (which should be freed if not wanted). 884 884 - 885 885 - Each element must be individually freed when it is no longer 886 886 - needed. If you'd like to instead be able to free all at once, you 887 887 - should instead use a single regular malloc, and assign pointers at 888 888 - particular offsets in the aggregate space. (In this case though, you 889 889 - cannot independently free elements.) 890 890 - 891 891 - independent_comallac differs from independent_calloc in that each 892 892 - element may have a different size, and also that it does not 893 893 - automatically clear elements. 894 894 - 895 895 - independent_comalloc can be used to speed up allocation in cases 896 896 - where several structs or objects must always be allocated at the 897 897 - same time. For example: 898 898 - 899 899 - struct Head { ... } 900 900 - struct Foot { ... } 901 901 - 902 902 - void send_message(char* msg) { 903 903 - int msglen = strlen(msg); 904 904 - size_t sizes[3] = { sizeof(struct Head), msglen, sizeof(struct Foot) }; 905 905 - void* chunks[3]; 906 906 - if (independent_comalloc(3, sizes, chunks) == 0) 907 907 - die(); 908 908 - struct Head* head = (struct Head*)(chunks[0]); 909 909 - char* body = (char*)(chunks[1]); 910 910 - struct Foot* foot = (struct Foot*)(chunks[2]); 911 911 - // ... 912 912 - } 913 913 - 914 914 - In general though, independent_comalloc is worth using only for 915 915 - larger values of n_elements. For small values, you probably won't 916 916 - detect enough difference from series of malloc calls to bother. 917 917 - 918 918 - Overuse of independent_comalloc can increase overall memory usage, 919 919 - since it cannot reuse existing noncontiguous small chunks that 920 920 - might be available for some of the elements. 921 921 - */ 922 922 - void** dlindependent_comalloc(size_t, size_t*, void**); 923 923 - 924 924 - 925 925 - /* 926 926 - pvalloc(size_t n); 927 927 - Equivalent to valloc(minimum-page-that-holds(n)), that is, 928 928 - round up n to nearest pagesize. 929 929 - */ 930 930 - void* dlpvalloc(size_t); 931 931 - 932 932 - /* 933 933 - malloc_trim(size_t pad); 934 934 - 935 935 - If possible, gives memory back to the system (via negative arguments 936 936 - to sbrk) if there is unused memory at the `high' end of the malloc 937 937 - pool or in unused MMAP segments. You can call this after freeing 938 938 - large blocks of memory to potentially reduce the system-level memory 939 939 - requirements of a program. However, it cannot guarantee to reduce 940 940 - memory. Under some allocation patterns, some large free blocks of 941 941 - memory will be locked between two used chunks, so they cannot be 942 942 - given back to the system. 943 943 - 944 944 - The `pad' argument to malloc_trim represents the amount of free 945 945 - trailing space to leave untrimmed. If this argument is zero, only 946 946 - the minimum amount of memory to maintain internal data structures 947 947 - will be left. Non-zero arguments can be supplied to maintain enough 948 948 - trailing space to service future expected allocations without having 949 949 - to re-obtain memory from the system. 950 950 - 951 951 - Malloc_trim returns 1 if it actually released any memory, else 0. 952 952 - */ 953 953 - int dlmalloc_trim(size_t); 954 954 - 955 955 - /* 956 956 - malloc_usable_size(void* p); 957 957 - 958 958 - Returns the number of bytes you can actually use in 959 959 - an allocated chunk, which may be more than you requested (although 960 960 - often not) due to alignment and minimum size constraints. 961 961 - You can use this many bytes without worrying about 962 962 - overwriting other allocated objects. This is not a particularly great 963 963 - programming practice. malloc_usable_size can be more useful in 964 964 - debugging and assertions, for example: 965 965 - 966 966 - p = malloc(n); 967 967 - assert(malloc_usable_size(p) >= 256); 968 968 - */ 969 969 - size_t dlmalloc_usable_size(void*); 970 970 - 971 971 - /* 972 972 - malloc_stats(); 973 973 - Prints on stderr the amount of space obtained from the system (both 974 974 - via sbrk and mmap), the maximum amount (which may be more than 975 975 - current if malloc_trim and/or munmap got called), and the current 976 976 - number of bytes allocated via malloc (or realloc, etc) but not yet 977 977 - freed. Note that this is the number of bytes allocated, not the 978 978 - number requested. It will be larger than the number requested 979 979 - because of alignment and bookkeeping overhead. Because it includes 980 980 - alignment wastage as being in use, this figure may be greater than 981 981 - zero even when no user-level chunks are allocated. 982 982 - 983 983 - The reported current and maximum system memory can be inaccurate if 984 984 - a program makes other calls to system memory allocation functions 985 985 - (normally sbrk) outside of malloc. 986 986 - 987 987 - malloc_stats prints only the most commonly interesting statistics. 988 988 - More information can be obtained by calling mallinfo. 989 989 - */ 990 990 - void dlmalloc_stats(void); 991 991 - 992 992 - #endif /* ONLY_MSPACES */ 993 993 - 994 994 - #if MSPACES 995 995 - 996 996 - /* 997 997 - mspace is an opaque type representing an independent 998 998 - region of space that supports mspace_malloc, etc. 999 999 - */ 1000 1000 - typedef void* mspace; 1001 1001 - 1002 1002 - /* 1003 1003 - create_mspace creates and returns a new independent space with the 1004 1004 - given initial capacity, or, if 0, the default granularity size. It 1005 1005 - returns null if there is no system memory available to create the 1006 1006 - space. If argument locked is non-zero, the space uses a separate 1007 1007 - lock to control access. The capacity of the space will grow 1008 1008 - dynamically as needed to service mspace_malloc requests. You can 1009 1009 - control the sizes of incremental increases of this space by 1010 1010 - compiling with a different DEFAULT_GRANULARITY or dynamically 1011 1011 - setting with mallopt(M_GRANULARITY, value). 1012 1012 - */ 1013 1013 - mspace create_mspace(size_t capacity, int locked); 1014 1014 - 1015 1015 - /* 1016 1016 - destroy_mspace destroys the given space, and attempts to return all 1017 1017 - of its memory back to the system, returning the total number of 1018 1018 - bytes freed. After destruction, the results of access to all memory 1019 1019 - used by the space become undefined. 1020 1020 - */ 1021 1021 - size_t destroy_mspace(mspace msp); 1022 1022 - 1023 1023 - /* 1024 1024 - create_mspace_with_base uses the memory supplied as the initial base 1025 1025 - of a new mspace. Part (less than 128*sizeof(size_t) bytes) of this 1026 1026 - space is used for bookkeeping, so the capacity must be at least this 1027 1027 - large. (Otherwise 0 is returned.) When this initial space is 1028 1028 - exhausted, additional memory will be obtained from the system. 1029 1029 - Destroying this space will deallocate all additionally allocated 1030 1030 - space (if possible) but not the initial base. 1031 1031 - */ 1032 1032 - mspace create_mspace_with_base(void* base, size_t capacity, int locked); 1033 1033 - 1034 1034 - /* 1035 1035 - mspace_malloc behaves as malloc, but operates within 1036 1036 - the given space. 1037 1037 - */ 1038 1038 - void* mspace_malloc(mspace msp, size_t bytes); 1039 1039 - 1040 1040 - /* 1041 1041 - mspace_free behaves as free, but operates within 1042 1042 - the given space. 1043 1043 - 1044 1044 - If compiled with FOOTERS==1, mspace_free is not actually needed. 1045 1045 - free may be called instead of mspace_free because freed chunks from 1046 1046 - any space are handled by their originating spaces. 1047 1047 - */ 1048 1048 - void mspace_free(mspace msp, void* mem); 1049 1049 - 1050 1050 - /* 1051 1051 - mspace_realloc behaves as realloc, but operates within 1052 1052 - the given space. 1053 1053 - 1054 1054 - If compiled with FOOTERS==1, mspace_realloc is not actually 1055 1055 - needed. realloc may be called instead of mspace_realloc because 1056 1056 - realloced chunks from any space are handled by their originating 1057 1057 - spaces. 1058 1058 - */ 1059 1059 - void* mspace_realloc(mspace msp, void* mem, size_t newsize); 1060 1060 - 1061 1061 - /* 1062 1062 - mspace_calloc behaves as calloc, but operates within 1063 1063 - the given space. 1064 1064 - */ 1065 1065 - void* mspace_calloc(mspace msp, size_t n_elements, size_t elem_size); 1066 1066 - 1067 1067 - /* 1068 1068 - mspace_memalign behaves as memalign, but operates within 1069 1069 - the given space. 1070 1070 - */ 1071 1071 - void* mspace_memalign(mspace msp, size_t alignment, size_t bytes); 1072 1072 - 1073 1073 - /* 1074 1074 - mspace_independent_calloc behaves as independent_calloc, but 1075 1075 - operates within the given space. 1076 1076 - */ 1077 1077 - void** mspace_independent_calloc(mspace msp, size_t n_elements, 1078 1078 - size_t elem_size, void* chunks[]); 1079 1079 - 1080 1080 - /* 1081 1081 - mspace_independent_comalloc behaves as independent_comalloc, but 1082 1082 - operates within the given space. 1083 1083 - */ 1084 1084 - void** mspace_independent_comalloc(mspace msp, size_t n_elements, 1085 1085 - size_t sizes[], void* chunks[]); 1086 1086 - 1087 1087 - /* 1088 1088 - mspace_footprint() returns the number of bytes obtained from the 1089 1089 - system for this space. 1090 1090 - */ 1091 1091 - size_t mspace_footprint(mspace msp); 1092 1092 - 1093 1093 - /* 1094 1094 - mspace_max_footprint() returns the peak number of bytes obtained from the 1095 1095 - system for this space. 1096 1096 - */ 1097 1097 - size_t mspace_max_footprint(mspace msp); 1098 1098 - 1099 1099 - 1100 1100 - #if !NO_MALLINFO 1101 1101 - /* 1102 1102 - mspace_mallinfo behaves as mallinfo, but reports properties of 1103 1103 - the given space. 1104 1104 - */ 1105 1105 - struct mallinfo mspace_mallinfo(mspace msp); 1106 1106 - #endif /* NO_MALLINFO */ 1107 1107 - 1108 1108 - /* 1109 1109 - mspace_malloc_stats behaves as malloc_stats, but reports 1110 1110 - properties of the given space. 1111 1111 - */ 1112 1112 - void mspace_malloc_stats(mspace msp); 1113 1113 - 1114 1114 - /* 1115 1115 - mspace_trim behaves as malloc_trim, but 1116 1116 - operates within the given space. 1117 1117 - */ 1118 1118 - int mspace_trim(mspace msp, size_t pad); 1119 1119 - 1120 1120 - /* 1121 1121 - An alias for mallopt. 1122 1122 - */ 1123 1123 - int mspace_mallopt(int, int); 1124 1124 - 1125 1125 - #endif /* MSPACES */ 1126 1126 - 1127 1127 - #ifdef __cplusplus 1128 1128 - }; /* end of extern "C" */ 1129 1129 - #endif /* __cplusplus */ 1130 1130 - 1131 1131 - /* 1132 1132 - ======================================================================== 1133 1133 - To make a fully customizable malloc.h header file, cut everything 1134 1134 - above this line, put into file malloc.h, edit to suit, and #include it 1135 1135 - on the next line, as well as in programs that use this malloc. 1136 1136 - ======================================================================== 1137 1137 - */ 1138 1138 - 1139 1139 - // #include "malloc.h" 1140 1140 - 1141 1141 - /*------------------------------ internal #includes ---------------------- */ 1142 1142 - 1143 1143 - #ifdef WIN32 1144 1144 - #pragma warning( disable : 4146 ) /* no "unsigned" warnings */ 1145 1145 - #endif /* WIN32 */ 1146 1146 - 1147 1147 - #include <stdio.h> /* for printing in malloc_stats */ 1148 1148 - 1149 1149 - #ifndef LACKS_ERRNO_H 1150 1150 - #include <errno.h> /* for MALLOC_FAILURE_ACTION */ 1151 1151 - #endif /* LACKS_ERRNO_H */ 1152 1152 - #if FOOTERS 1153 1153 - #include <time.h> /* for magic initialization */ 1154 1154 - #endif /* FOOTERS */ 1155 1155 - #ifndef LACKS_STDLIB_H 1156 1156 - #include <stdlib.h> /* for abort() */ 1157 1157 - #endif /* LACKS_STDLIB_H */ 1158 1158 - #ifdef DEBUG 1159 1159 - #if ABORT_ON_ASSERT_FAILURE 1160 1160 - #define assert(x) if(!(x)) ABORT 1161 1161 - #else /* ABORT_ON_ASSERT_FAILURE */ 1162 1162 - #include <assert.h> 1163 1163 - #endif /* ABORT_ON_ASSERT_FAILURE */ 1164 1164 - #else /* DEBUG */ 1165 1165 - #define assert(x) 1166 1166 - #endif /* DEBUG */ 1167 1167 - #ifndef LACKS_STRING_H 1168 1168 - #include <string.h> /* for memset etc */ 1169 1169 - #endif /* LACKS_STRING_H */ 1170 1170 - #if USE_BUILTIN_FFS 1171 1171 - #ifndef LACKS_STRINGS_H 1172 1172 - #include <strings.h> /* for ffs */ 1173 1173 - #endif /* LACKS_STRINGS_H */ 1174 1174 - #endif /* USE_BUILTIN_FFS */ 1175 1175 - #if HAVE_MMAP 1176 1176 - #ifndef LACKS_SYS_MMAN_H 1177 1177 - #include <sys/mman.h> /* for mmap */ 1178 1178 - #endif /* LACKS_SYS_MMAN_H */ 1179 1179 - #ifndef LACKS_FCNTL_H 1180 1180 - #include <fcntl.h> 1181 1181 - #endif /* LACKS_FCNTL_H */ 1182 1182 - #endif /* HAVE_MMAP */ 1183 1183 - #if HAVE_MORECORE 1184 1184 - #ifndef LACKS_UNISTD_H 1185 1185 - #include <unistd.h> /* for sbrk */ 1186 1186 - #else /* LACKS_UNISTD_H */ 1187 1187 - #if !defined(__FreeBSD__) && !defined(__OpenBSD__) && !defined(__NetBSD__) 1188 1188 - extern void* sbrk(ptrdiff_t); 1189 1189 - #endif /* FreeBSD etc */ 1190 1190 - #endif /* LACKS_UNISTD_H */ 1191 1191 - #endif /* HAVE_MMAP */ 1192 1192 - 1193 1193 - #ifndef WIN32 1194 1194 - #ifndef malloc_getpagesize 1195 1195 - # ifdef _SC_PAGESIZE /* some SVR4 systems omit an underscore */ 1196 1196 - # ifndef _SC_PAGE_SIZE 1197 1197 - # define _SC_PAGE_SIZE _SC_PAGESIZE 1198 1198 - # endif 1199 1199 - # endif 1200 1200 - # ifdef _SC_PAGE_SIZE 1201 1201 - # define malloc_getpagesize sysconf(_SC_PAGE_SIZE) 1202 1202 - # else 1203 1203 - # if defined(BSD) || defined(DGUX) || defined(HAVE_GETPAGESIZE) 1204 1204 - extern size_t getpagesize(); 1205 1205 - # define malloc_getpagesize getpagesize() 1206 1206 - # else 1207 1207 - # ifdef WIN32 /* use supplied emulation of getpagesize */ 1208 1208 - # define malloc_getpagesize getpagesize() 1209 1209 - # else 1210 1210 - # ifndef LACKS_SYS_PARAM_H 1211 1211 - # include <sys/param.h> 1212 1212 - # endif 1213 1213 - # ifdef EXEC_PAGESIZE 1214 1214 - # define malloc_getpagesize EXEC_PAGESIZE 1215 1215 - # else 1216 1216 - # ifdef NBPG 1217 1217 - # ifndef CLSIZE 1218 1218 - # define malloc_getpagesize NBPG 1219 1219 - # else 1220 1220 - # define malloc_getpagesize (NBPG * CLSIZE) 1221 1221 - # endif 1222 1222 - # else 1223 1223 - # ifdef NBPC 1224 1224 - # define malloc_getpagesize NBPC 1225 1225 - # else 1226 1226 - # ifdef PAGESIZE 1227 1227 - # define malloc_getpagesize PAGESIZE 1228 1228 - # else /* just guess */ 1229 1229 - # define malloc_getpagesize ((size_t)4096U) 1230 1230 - # endif 1231 1231 - # endif 1232 1232 - # endif 1233 1233 - # endif 1234 1234 - # endif 1235 1235 - # endif 1236 1236 - # endif 1237 1237 - #endif 1238 1238 - #endif 1239 1239 - 1240 1240 - /* ------------------- size_t and alignment properties -------------------- */ 1241 1241 - 1242 1242 - /* The byte and bit size of a size_t */ 1243 1243 - #define SIZE_T_SIZE (sizeof(size_t)) 1244 1244 - #define SIZE_T_BITSIZE (sizeof(size_t) << 3) 1245 1245 - 1246 1246 - /* Some constants coerced to size_t */ 1247 1247 - /* Annoying but necessary to avoid errors on some plaftorms */ 1248 1248 - #define SIZE_T_ZERO ((size_t)0) 1249 1249 - #define SIZE_T_ONE ((size_t)1) 1250 1250 - #define SIZE_T_TWO ((size_t)2) 1251 1251 - #define TWO_SIZE_T_SIZES (SIZE_T_SIZE<<1) 1252 1252 - #define FOUR_SIZE_T_SIZES (SIZE_T_SIZE<<2) 1253 1253 - #define SIX_SIZE_T_SIZES (FOUR_SIZE_T_SIZES+TWO_SIZE_T_SIZES) 1254 1254 - #define HALF_MAX_SIZE_T (MAX_SIZE_T / 2U) 1255 1255 - 1256 1256 - /* The bit mask value corresponding to MALLOC_ALIGNMENT */ 1257 1257 - #define CHUNK_ALIGN_MASK (MALLOC_ALIGNMENT - SIZE_T_ONE) 1258 1258 - 1259 1259 - /* True if address a has acceptable alignment */ 1260 1260 - #define is_aligned(A) (((size_t)((A)) & (CHUNK_ALIGN_MASK)) == 0) 1261 1261 - 1262 1262 - /* the number of bytes to offset an address to align it */ 1263 1263 - #define align_offset(A)\ 1264 1264 - ((((size_t)(A) & CHUNK_ALIGN_MASK) == 0)? 0 :\ 1265 1265 - ((MALLOC_ALIGNMENT - ((size_t)(A) & CHUNK_ALIGN_MASK)) & CHUNK_ALIGN_MASK)) 1266 1266 - 1267 1267 - /* -------------------------- MMAP preliminaries ------------------------- */ 1268 1268 - 1269 1269 - /* 1270 1270 - If HAVE_MORECORE or HAVE_MMAP are false, we just define calls and 1271 1271 - checks to fail so compiler optimizer can delete code rather than 1272 1272 - using so many "#if"s. 1273 1273 - */ 1274 1274 - 1275 1275 - 1276 1276 - /* MORECORE and MMAP must return MFAIL on failure */ 1277 1277 - #define MFAIL ((void*)(MAX_SIZE_T)) 1278 1278 - #define CMFAIL ((char*)(MFAIL)) /* defined for convenience */ 1279 1279 - 1280 1280 - #if !HAVE_MMAP 1281 1281 - #define IS_MMAPPED_BIT (SIZE_T_ZERO) 1282 1282 - #define USE_MMAP_BIT (SIZE_T_ZERO) 1283 1283 - #define CALL_MMAP(s) MFAIL 1284 1284 - #define CALL_MUNMAP(a, s) (-1) 1285 1285 - #define DIRECT_MMAP(s) MFAIL 1286 1286 - 1287 1287 - #else /* HAVE_MMAP */ 1288 1288 - #define IS_MMAPPED_BIT (SIZE_T_ONE) 1289 1289 - #define USE_MMAP_BIT (SIZE_T_ONE) 1290 1290 - 1291 1291 - #ifndef WIN32 1292 1292 - #define CALL_MUNMAP(a, s) munmap((a), (s)) 1293 1293 - #define MMAP_PROT (PROT_READ|PROT_WRITE) 1294 1294 - #if !defined(MAP_ANONYMOUS) && defined(MAP_ANON) 1295 1295 - #define MAP_ANONYMOUS MAP_ANON 1296 1296 - #endif /* MAP_ANON */ 1297 1297 - #ifdef MAP_ANONYMOUS 1298 1298 - #define MMAP_FLAGS (MAP_PRIVATE|MAP_ANONYMOUS) 1299 1299 - #define CALL_MMAP(s) mmap(0, (s), MMAP_PROT, MMAP_FLAGS, -1, 0) 1300 1300 - #else /* MAP_ANONYMOUS */ 1301 1301 - /* 1302 1302 - Nearly all versions of mmap support MAP_ANONYMOUS, so the following 1303 1303 - is unlikely to be needed, but is supplied just in case. 1304 1304 - */ 1305 1305 - #define MMAP_FLAGS (MAP_PRIVATE) 1306 1306 - static int dev_zero_fd = -1; /* Cached file descriptor for /dev/zero. */ 1307 1307 - #define CALL_MMAP(s) ((dev_zero_fd < 0) ? \ 1308 1308 - (dev_zero_fd = open("/dev/zero", O_RDWR), \ 1309 1309 - mmap(0, (s), MMAP_PROT, MMAP_FLAGS, dev_zero_fd, 0)) : \ 1310 1310 - mmap(0, (s), MMAP_PROT, MMAP_FLAGS, dev_zero_fd, 0)) 1311 1311 - #endif /* MAP_ANONYMOUS */ 1312 1312 - 1313 1313 - #define DIRECT_MMAP(s) CALL_MMAP(s) 1314 1314 - #else /* WIN32 */ 1315 1315 - 1316 1316 - /* Win32 MMAP via VirtualAlloc */ 1317 1317 - static void* win32mmap(size_t size) { 1318 1318 - void* ptr = VirtualAlloc(0, size, MEM_RESERVE|MEM_COMMIT, PAGE_READWRITE); 1319 1319 - return (ptr != 0)? ptr: MFAIL; 1320 1320 - } 1321 1321 - 1322 1322 - /* For direct MMAP, use MEM_TOP_DOWN to minimize interference */ 1323 1323 - static void* win32direct_mmap(size_t size) { 1324 1324 - void* ptr = VirtualAlloc(0, size, MEM_RESERVE|MEM_COMMIT|MEM_TOP_DOWN, 1325 1325 - PAGE_READWRITE); 1326 1326 - return (ptr != 0)? ptr: MFAIL; 1327 1327 - } 1328 1328 - 1329 1329 - /* This function supports releasing coalesed segments */ 1330 1330 - static int win32munmap(void* ptr, size_t size) { 1331 1331 - MEMORY_BASIC_INFORMATION minfo; 1332 1332 - char* cptr = ptr; 1333 1333 - while (size) { 1334 1334 - if (VirtualQuery(cptr, &minfo, sizeof(minfo)) == 0) 1335 1335 - return -1; 1336 1336 - if (minfo.BaseAddress != cptr || minfo.AllocationBase != cptr || 1337 1337 - minfo.State != MEM_COMMIT || minfo.RegionSize > size) 1338 1338 - return -1; 1339 1339 - if (VirtualFree(cptr, 0, MEM_RELEASE) == 0) 1340 1340 - return -1; 1341 1341 - cptr += minfo.RegionSize; 1342 1342 - size -= minfo.RegionSize; 1343 1343 - } 1344 1344 - return 0; 1345 1345 - } 1346 1346 - 1347 1347 - #define CALL_MMAP(s) win32mmap(s) 1348 1348 - #define CALL_MUNMAP(a, s) win32munmap((a), (s)) 1349 1349 - #define DIRECT_MMAP(s) win32direct_mmap(s) 1350 1350 - #endif /* WIN32 */ 1351 1351 - #endif /* HAVE_MMAP */ 1352 1352 - 1353 1353 - #if HAVE_MMAP && HAVE_MREMAP 1354 1354 - #define CALL_MREMAP(addr, osz, nsz, mv) mremap((addr), (osz), (nsz), (mv)) 1355 1355 - #else /* HAVE_MMAP && HAVE_MREMAP */ 1356 1356 - #define CALL_MREMAP(addr, osz, nsz, mv) MFAIL 1357 1357 - #endif /* HAVE_MMAP && HAVE_MREMAP */ 1358 1358 - 1359 1359 - #if HAVE_MORECORE 1360 1360 - #define CALL_MORECORE(S) MORECORE(S) 1361 1361 - #else /* HAVE_MORECORE */ 1362 1362 - #define CALL_MORECORE(S) MFAIL 1363 1363 - #endif /* HAVE_MORECORE */ 1364 1364 - 1365 1365 - /* mstate bit set if continguous morecore disabled or failed */ 1366 1366 - #define USE_NONCONTIGUOUS_BIT (4U) 1367 1367 - 1368 1368 - /* segment bit set in create_mspace_with_base */ 1369 1369 - #define EXTERN_BIT (8U) 1370 1370 - 1371 1371 - 1372 1372 - /* --------------------------- Lock preliminaries ------------------------ */ 1373 1373 - 1374 1374 - #if USE_LOCKS 1375 1375 - 1376 1376 - /* 1377 1377 - When locks are defined, there are up to two global locks: 1378 1378 - 1379 1379 - * If HAVE_MORECORE, morecore_mutex protects sequences of calls to 1380 1380 - MORECORE. In many cases sys_alloc requires two calls, that should 1381 1381 - not be interleaved with calls by other threads. This does not 1382 1382 - protect against direct calls to MORECORE by other threads not 1383 1383 - using this lock, so there is still code to cope the best we can on 1384 1384 - interference. 1385 1385 - 1386 1386 - * magic_init_mutex ensures that mparams.magic and other 1387 1387 - unique mparams values are initialized only once. 1388 1388 - */ 1389 1389 - 1390 1390 - #ifndef WIN32 1391 1391 - /* By default use posix locks */ 1392 1392 - #include <pthread.h> 1393 1393 - #define MLOCK_T pthread_mutex_t 1394 1394 - #define INITIAL_LOCK(l) pthread_mutex_init(l, NULL) 1395 1395 - #define ACQUIRE_LOCK(l) pthread_mutex_lock(l) 1396 1396 - #define RELEASE_LOCK(l) pthread_mutex_unlock(l) 1397 1397 - 1398 1398 - #if HAVE_MORECORE 1399 1399 - static MLOCK_T morecore_mutex = PTHREAD_MUTEX_INITIALIZER; 1400 1400 - #endif /* HAVE_MORECORE */ 1401 1401 - 1402 1402 - static MLOCK_T magic_init_mutex = PTHREAD_MUTEX_INITIALIZER; 1403 1403 - 1404 1404 - #else /* WIN32 */ 1405 1405 - /* 1406 1406 - Because lock-protected regions have bounded times, and there 1407 1407 - are no recursive lock calls, we can use simple spinlocks. 1408 1408 - */ 1409 1409 - 1410 1410 - #define MLOCK_T long 1411 1411 - static int win32_acquire_lock (MLOCK_T *sl) { 1412 1412 - for (;;) { 1413 1413 - #ifdef InterlockedCompareExchangePointer 1414 1414 - if (!InterlockedCompareExchange(sl, 1, 0)) 1415 1415 - return 0; 1416 1416 - #else /* Use older void* version */ 1417 1417 - if (!InterlockedCompareExchange((void**)sl, (void*)1, (void*)0)) 1418 1418 - return 0; 1419 1419 - #endif /* InterlockedCompareExchangePointer */ 1420 1420 - Sleep (0); 1421 1421 - } 1422 1422 - } 1423 1423 - 1424 1424 - static void win32_release_lock (MLOCK_T *sl) { 1425 1425 - InterlockedExchange (sl, 0); 1426 1426 - } 1427 1427 - 1428 1428 - #define INITIAL_LOCK(l) *(l)=0 1429 1429 - #define ACQUIRE_LOCK(l) win32_acquire_lock(l) 1430 1430 - #define RELEASE_LOCK(l) win32_release_lock(l) 1431 1431 - #if HAVE_MORECORE 1432 1432 - static MLOCK_T morecore_mutex; 1433 1433 - #endif /* HAVE_MORECORE */ 1434 1434 - static MLOCK_T magic_init_mutex; 1435 1435 - #endif /* WIN32 */ 1436 1436 - 1437 1437 - #define USE_LOCK_BIT (2U) 1438 1438 - #else /* USE_LOCKS */ 1439 1439 - #define USE_LOCK_BIT (0U) 1440 1440 - #define INITIAL_LOCK(l) 1441 1441 - #endif /* USE_LOCKS */ 1442 1442 - 1443 1443 - #if USE_LOCKS && HAVE_MORECORE 1444 1444 - #define ACQUIRE_MORECORE_LOCK() ACQUIRE_LOCK(&morecore_mutex); 1445 1445 - #define RELEASE_MORECORE_LOCK() RELEASE_LOCK(&morecore_mutex); 1446 1446 - #else /* USE_LOCKS && HAVE_MORECORE */ 1447 1447 - #define ACQUIRE_MORECORE_LOCK() 1448 1448 - #define RELEASE_MORECORE_LOCK() 1449 1449 - #endif /* USE_LOCKS && HAVE_MORECORE */ 1450 1450 - 1451 1451 - #if USE_LOCKS 1452 1452 - #define ACQUIRE_MAGIC_INIT_LOCK() ACQUIRE_LOCK(&magic_init_mutex); 1453 1453 - #define RELEASE_MAGIC_INIT_LOCK() RELEASE_LOCK(&magic_init_mutex); 1454 1454 - #else /* USE_LOCKS */ 1455 1455 - #define ACQUIRE_MAGIC_INIT_LOCK() 1456 1456 - #define RELEASE_MAGIC_INIT_LOCK() 1457 1457 - #endif /* USE_LOCKS */ 1458 1458 - 1459 1459 - 1460 1460 - /* ----------------------- Chunk representations ------------------------ */ 1461 1461 - 1462 1462 - /* 1463 1463 - (The following includes lightly edited explanations by Colin Plumb.) 1464 1464 - 1465 1465 - The malloc_chunk declaration below is misleading (but accurate and 1466 1466 - necessary). It declares a "view" into memory allowing access to 1467 1467 - necessary fields at known offsets from a given base. 1468 1468 - 1469 1469 - Chunks of memory are maintained using a `boundary tag' method as 1470 1470 - originally described by Knuth. (See the paper by Paul Wilson 1471 1471 - ftp://ftp.cs.utexas.edu/pub/garbage/allocsrv.ps for a survey of such 1472 1472 - techniques.) Sizes of free chunks are stored both in the front of 1473 1473 - each chunk and at the end. This makes consolidating fragmented 1474 1474 - chunks into bigger chunks fast. The head fields also hold bits 1475 1475 - representing whether chunks are free or in use. 1476 1476 - 1477 1477 - Here are some pictures to make it clearer. They are "exploded" to 1478 1478 - show that the state of a chunk can be thought of as extending from 1479 1479 - the high 31 bits of the head field of its header through the 1480 1480 - prev_foot and PINUSE_BIT bit of the following chunk header. 1481 1481 - 1482 1482 - A chunk that's in use looks like: 1483 1483 - 1484 1484 - chunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1485 1485 - | Size of previous chunk (if P = 1) | 1486 1486 - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1487 1487 - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |P| 1488 1488 - | Size of this chunk 1| +-+ 1489 1489 - mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1490 1490 - | | 1491 1491 - +- -+ 1492 1492 - | | 1493 1493 - +- -+ 1494 1494 - | : 1495 1495 - +- size - sizeof(size_t) available payload bytes -+ 1496 1496 - : | 1497 1497 - chunk-> +- -+ 1498 1498 - | | 1499 1499 - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1500 1500 - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |1| 1501 1501 - | Size of next chunk (may or may not be in use) | +-+ 1502 1502 - mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1503 1503 - 1504 1504 - And if it's free, it looks like this: 1505 1505 - 1506 1506 - chunk-> +- -+ 1507 1507 - | User payload (must be in use, or we would have merged!) | 1508 1508 - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1509 1509 - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |P| 1510 1510 - | Size of this chunk 0| +-+ 1511 1511 - mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1512 1512 - | Next pointer | 1513 1513 - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1514 1514 - | Prev pointer | 1515 1515 - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1516 1516 - | : 1517 1517 - +- size - sizeof(struct chunk) unused bytes -+ 1518 1518 - : | 1519 1519 - chunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1520 1520 - | Size of this chunk | 1521 1521 - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1522 1522 - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |0| 1523 1523 - | Size of next chunk (must be in use, or we would have merged)| +-+ 1524 1524 - mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1525 1525 - | : 1526 1526 - +- User payload -+ 1527 1527 - : | 1528 1528 - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1529 1529 - |0| 1530 1530 - +-+ 1531 1531 - Note that since we always merge adjacent free chunks, the chunks 1532 1532 - adjacent to a free chunk must be in use. 1533 1533 - 1534 1534 - Given a pointer to a chunk (which can be derived trivially from the 1535 1535 - payload pointer) we can, in O(1) time, find out whether the adjacent 1536 1536 - chunks are free, and if so, unlink them from the lists that they 1537 1537 - are on and merge them with the current chunk. 1538 1538 - 1539 1539 - Chunks always begin on even word boundaries, so the mem portion 1540 1540 - (which is returned to the user) is also on an even word boundary, and 1541 1541 - thus at least double-word aligned. 1542 1542 - 1543 1543 - The P (PINUSE_BIT) bit, stored in the unused low-order bit of the 1544 1544 - chunk size (which is always a multiple of two words), is an in-use 1545 1545 - bit for the *previous* chunk. If that bit is *clear*, then the 1546 1546 - word before the current chunk size contains the previous chunk 1547 1547 - size, and can be used to find the front of the previous chunk. 1548 1548 - The very first chunk allocated always has this bit set, preventing 1549 1549 - access to non-existent (or non-owned) memory. If pinuse is set for 1550 1550 - any given chunk, then you CANNOT determine the size of the 1551 1551 - previous chunk, and might even get a memory addressing fault when 1552 1552 - trying to do so. 1553 1553 - 1554 1554 - The C (CINUSE_BIT) bit, stored in the unused second-lowest bit of 1555 1555 - the chunk size redundantly records whether the current chunk is 1556 1556 - inuse. This redundancy enables usage checks within free and realloc, 1557 1557 - and reduces indirection when freeing and consolidating chunks. 1558 1558 - 1559 1559 - Each freshly allocated chunk must have both cinuse and pinuse set. 1560 1560 - That is, each allocated chunk borders either a previously allocated 1561 1561 - and still in-use chunk, or the base of its memory arena. This is 1562 1562 - ensured by making all allocations from the the `lowest' part of any 1563 1563 - found chunk. Further, no free chunk physically borders another one, 1564 1564 - so each free chunk is known to be preceded and followed by either 1565 1565 - inuse chunks or the ends of memory. 1566 1566 - 1567 1567 - Note that the `foot' of the current chunk is actually represented 1568 1568 - as the prev_foot of the NEXT chunk. This makes it easier to 1569 1569 - deal with alignments etc but can be very confusing when trying 1570 1570 - to extend or adapt this code. 1571 1571 - 1572 1572 - The exceptions to all this are 1573 1573 - 1574 1574 - 1. The special chunk `top' is the top-most available chunk (i.e., 1575 1575 - the one bordering the end of available memory). It is treated 1576 1576 - specially. Top is never included in any bin, is used only if 1577 1577 - no other chunk is available, and is released back to the 1578 1578 - system if it is very large (see M_TRIM_THRESHOLD). In effect, 1579 1579 - the top chunk is treated as larger (and thus less well 1580 1580 - fitting) than any other available chunk. The top chunk 1581 1581 - doesn't update its trailing size field since there is no next 1582 1582 - contiguous chunk that would have to index off it. However, 1583 1583 - space is still allocated for it (TOP_FOOT_SIZE) to enable 1584 1584 - separation or merging when space is extended. 1585 1585 - 1586 1586 - 3. Chunks allocated via mmap, which have the lowest-order bit 1587 1587 - (IS_MMAPPED_BIT) set in their prev_foot fields, and do not set 1588 1588 - PINUSE_BIT in their head fields. Because they are allocated 1589 1589 - one-by-one, each must carry its own prev_foot field, which is 1590 1590 - also used to hold the offset this chunk has within its mmapped 1591 1591 - region, which is needed to preserve alignment. Each mmapped 1592 1592 - chunk is trailed by the first two fields of a fake next-chunk 1593 1593 - for sake of usage checks. 1594 1594 - 1595 1595 - */ 1596 1596 - 1597 1597 - struct malloc_chunk { 1598 1598 - size_t prev_foot; /* Size of previous chunk (if free). */ 1599 1599 - size_t head; /* Size and inuse bits. */ 1600 1600 - struct malloc_chunk* fd; /* double links -- used only if free. */ 1601 1601 - struct malloc_chunk* bk; 1602 1602 - }; 1603 1603 - 1604 1604 - typedef struct malloc_chunk mchunk; 1605 1605 - typedef struct malloc_chunk* mchunkptr; 1606 1606 - typedef struct malloc_chunk* sbinptr; /* The type of bins of chunks */ 1607 1607 - typedef unsigned int bindex_t; /* Described below */ 1608 1608 - typedef unsigned int binmap_t; /* Described below */ 1609 1609 - typedef unsigned int flag_t; /* The type of various bit flag sets */ 1610 1610 - 1611 1611 - /* ------------------- Chunks sizes and alignments ----------------------- */ 1612 1612 - 1613 1613 - #define MCHUNK_SIZE (sizeof(mchunk)) 1614 1614 - 1615 1615 - #if FOOTERS 1616 1616 - #define CHUNK_OVERHEAD (TWO_SIZE_T_SIZES) 1617 1617 - #else /* FOOTERS */ 1618 1618 - #define CHUNK_OVERHEAD (SIZE_T_SIZE) 1619 1619 - #endif /* FOOTERS */ 1620 1620 - 1621 1621 - /* MMapped chunks need a second word of overhead ... */ 1622 1622 - #define MMAP_CHUNK_OVERHEAD (TWO_SIZE_T_SIZES) 1623 1623 - /* ... and additional padding for fake next-chunk at foot */ 1624 1624 - #define MMAP_FOOT_PAD (FOUR_SIZE_T_SIZES) 1625 1625 - 1626 1626 - /* The smallest size we can malloc is an aligned minimal chunk */ 1627 1627 - #define MIN_CHUNK_SIZE\ 1628 1628 - ((MCHUNK_SIZE + CHUNK_ALIGN_MASK) & ~CHUNK_ALIGN_MASK) 1629 1629 - 1630 1630 - /* conversion from malloc headers to user pointers, and back */ 1631 1631 - #define chunk2mem(p) ((void*)((char*)(p) + TWO_SIZE_T_SIZES)) 1632 1632 - #define mem2chunk(mem) ((mchunkptr)((char*)(mem) - TWO_SIZE_T_SIZES)) 1633 1633 - /* chunk associated with aligned address A */ 1634 1634 - #define align_as_chunk(A) (mchunkptr)((A) + align_offset(chunk2mem(A))) 1635 1635 - 1636 1636 - /* Bounds on request (not chunk) sizes. */ 1637 1637 - #define MAX_REQUEST ((-MIN_CHUNK_SIZE) << 2) 1638 1638 - #define MIN_REQUEST (MIN_CHUNK_SIZE - CHUNK_OVERHEAD - SIZE_T_ONE) 1639 1639 - 1640 1640 - /* pad request bytes into a usable size */ 1641 1641 - #define pad_request(req) \ 1642 1642 - (((req) + CHUNK_OVERHEAD + CHUNK_ALIGN_MASK) & ~CHUNK_ALIGN_MASK) 1643 1643 - 1644 1644 - /* pad request, checking for minimum (but not maximum) */ 1645 1645 - #define request2size(req) \ 1646 1646 - (((req) < MIN_REQUEST)? MIN_CHUNK_SIZE : pad_request(req)) 1647 1647 - 1648 1648 - 1649 1649 - /* ------------------ Operations on head and foot fields ----------------- */ 1650 1650 - 1651 1651 - /* 1652 1652 - The head field of a chunk is or'ed with PINUSE_BIT when previous 1653 1653 - adjacent chunk in use, and or'ed with CINUSE_BIT if this chunk is in 1654 1654 - use. If the chunk was obtained with mmap, the prev_foot field has 1655 1655 - IS_MMAPPED_BIT set, otherwise holding the offset of the base of the 1656 1656 - mmapped region to the base of the chunk. 1657 1657 - */ 1658 1658 - 1659 1659 - #define PINUSE_BIT (SIZE_T_ONE) 1660 1660 - #define CINUSE_BIT (SIZE_T_TWO) 1661 1661 - #define INUSE_BITS (PINUSE_BIT|CINUSE_BIT) 1662 1662 - 1663 1663 - /* Head value for fenceposts */ 1664 1664 - #define FENCEPOST_HEAD (INUSE_BITS|SIZE_T_SIZE) 1665 1665 - 1666 1666 - /* extraction of fields from head words */ 1667 1667 - #define cinuse(p) ((p)->head & CINUSE_BIT) 1668 1668 - #define pinuse(p) ((p)->head & PINUSE_BIT) 1669 1669 - #define chunksize(p) ((p)->head & ~(INUSE_BITS)) 1670 1670 - 1671 1671 - #define clear_pinuse(p) ((p)->head &= ~PINUSE_BIT) 1672 1672 - #define clear_cinuse(p) ((p)->head &= ~CINUSE_BIT) 1673 1673 - 1674 1674 - /* Treat space at ptr +/- offset as a chunk */ 1675 1675 - #define chunk_plus_offset(p, s) ((mchunkptr)(((char*)(p)) + (s))) 1676 1676 - #define chunk_minus_offset(p, s) ((mchunkptr)(((char*)(p)) - (s))) 1677 1677 - 1678 1678 - /* Ptr to next or previous physical malloc_chunk. */ 1679 1679 - #define next_chunk(p) ((mchunkptr)( ((char*)(p)) + ((p)->head & ~INUSE_BITS))) 1680 1680 - #define prev_chunk(p) ((mchunkptr)( ((char*)(p)) - ((p)->prev_foot) )) 1681 1681 - 1682 1682 - /* extract next chunk's pinuse bit */ 1683 1683 - #define next_pinuse(p) ((next_chunk(p)->head) & PINUSE_BIT) 1684 1684 - 1685 1685 - /* Get/set size at footer */ 1686 1686 - #define get_foot(p, s) (((mchunkptr)((char*)(p) + (s)))->prev_foot) 1687 1687 - #define set_foot(p, s) (((mchunkptr)((char*)(p) + (s)))->prev_foot = (s)) 1688 1688 - 1689 1689 - /* Set size, pinuse bit, and foot */ 1690 1690 - #define set_size_and_pinuse_of_free_chunk(p, s)\ 1691 1691 - ((p)->head = (s|PINUSE_BIT), set_foot(p, s)) 1692 1692 - 1693 1693 - /* Set size, pinuse bit, foot, and clear next pinuse */ 1694 1694 - #define set_free_with_pinuse(p, s, n)\ 1695 1695 - (clear_pinuse(n), set_size_and_pinuse_of_free_chunk(p, s)) 1696 1696 - 1697 1697 - #define is_mmapped(p)\ 1698 1698 - (!((p)->head & PINUSE_BIT) && ((p)->prev_foot & IS_MMAPPED_BIT)) 1699 1699 - 1700 1700 - /* Get the internal overhead associated with chunk p */ 1701 1701 - #define overhead_for(p)\ 1702 1702 - (is_mmapped(p)? MMAP_CHUNK_OVERHEAD : CHUNK_OVERHEAD) 1703 1703 - 1704 1704 - /* Return true if malloced space is not necessarily cleared */ 1705 1705 - #if MMAP_CLEARS 1706 1706 - #define calloc_must_clear(p) (!is_mmapped(p)) 1707 1707 - #else /* MMAP_CLEARS */ 1708 1708 - #define calloc_must_clear(p) (1) 1709 1709 - #endif /* MMAP_CLEARS */ 1710 1710 - 1711 1711 - /* ---------------------- Overlaid data structures ----------------------- */ 1712 1712 - 1713 1713 - /* 1714 1714 - When chunks are not in use, they are treated as nodes of either 1715 1715 - lists or trees. 1716 1716 - 1717 1717 - "Small" chunks are stored in circular doubly-linked lists, and look 1718 1718 - like this: 1719 1719 - 1720 1720 - chunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1721 1721 - | Size of previous chunk | 1722 1722 - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1723 1723 - `head:' | Size of chunk, in bytes |P| 1724 1724 - mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1725 1725 - | Forward pointer to next chunk in list | 1726 1726 - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1727 1727 - | Back pointer to previous chunk in list | 1728 1728 - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1729 1729 - | Unused space (may be 0 bytes long) . 1730 1730 - . . 1731 1731 - . | 1732 1732 - nextchunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1733 1733 - `foot:' | Size of chunk, in bytes | 1734 1734 - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1735 1735 - 1736 1736 - Larger chunks are kept in a form of bitwise digital trees (aka 1737 1737 - tries) keyed on chunksizes. Because malloc_tree_chunks are only for 1738 1738 - free chunks greater than 256 bytes, their size doesn't impose any 1739 1739 - constraints on user chunk sizes. Each node looks like: 1740 1740 - 1741 1741 - chunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1742 1742 - | Size of previous chunk | 1743 1743 - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1744 1744 - `head:' | Size of chunk, in bytes |P| 1745 1745 - mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1746 1746 - | Forward pointer to next chunk of same size | 1747 1747 - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1748 1748 - | Back pointer to previous chunk of same size | 1749 1749 - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1750 1750 - | Pointer to left child (child[0]) | 1751 1751 - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1752 1752 - | Pointer to right child (child[1]) | 1753 1753 - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1754 1754 - | Pointer to parent | 1755 1755 - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1756 1756 - | bin index of this chunk | 1757 1757 - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1758 1758 - | Unused space . 1759 1759 - . | 1760 1760 - nextchunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1761 1761 - `foot:' | Size of chunk, in bytes | 1762 1762 - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1763 1763 - 1764 1764 - Each tree holding treenodes is a tree of unique chunk sizes. Chunks 1765 1765 - of the same size are arranged in a circularly-linked list, with only 1766 1766 - the oldest chunk (the next to be used, in our FIFO ordering) 1767 1767 - actually in the tree. (Tree members are distinguished by a non-null 1768 1768 - parent pointer.) If a chunk with the same size an an existing node 1769 1769 - is inserted, it is linked off the existing node using pointers that 1770 1770 - work in the same way as fd/bk pointers of small chunks. 1771 1771 - 1772 1772 - Each tree contains a power of 2 sized range of chunk sizes (the 1773 1773 - smallest is 0x100 <= x < 0x180), which is is divided in half at each 1774 1774 - tree level, with the chunks in the smaller half of the range (0x100 1775 1775 - <= x < 0x140 for the top nose) in the left subtree and the larger 1776 1776 - half (0x140 <= x < 0x180) in the right subtree. This is, of course, 1777 1777 - done by inspecting individual bits. 1778 1778 - 1779 1779 - Using these rules, each node's left subtree contains all smaller 1780 1780 - sizes than its right subtree. However, the node at the root of each 1781 1781 - subtree has no particular ordering relationship to either. (The 1782 1782 - dividing line between the subtree sizes is based on trie relation.) 1783 1783 - If we remove the last chunk of a given size from the interior of the 1784 1784 - tree, we need to replace it with a leaf node. The tree ordering 1785 1785 - rules permit a node to be replaced by any leaf below it. 1786 1786 - 1787 1787 - The smallest chunk in a tree (a common operation in a best-fit 1788 1788 - allocator) can be found by walking a path to the leftmost leaf in 1789 1789 - the tree. Unlike a usual binary tree, where we follow left child 1790 1790 - pointers until we reach a null, here we follow the right child 1791 1791 - pointer any time the left one is null, until we reach a leaf with 1792 1792 - both child pointers null. The smallest chunk in the tree will be 1793 1793 - somewhere along that path. 1794 1794 - 1795 1795 - The worst case number of steps to add, find, or remove a node is 1796 1796 - bounded by the number of bits differentiating chunks within 1797 1797 - bins. Under current bin calculations, this ranges from 6 up to 21 1798 1798 - (for 32 bit sizes) or up to 53 (for 64 bit sizes). The typical case 1799 1799 - is of course much better. 1800 1800 - */ 1801 1801 - 1802 1802 - struct malloc_tree_chunk { 1803 1803 - /* The first four fields must be compatible with malloc_chunk */ 1804 1804 - size_t prev_foot; 1805 1805 - size_t head; 1806 1806 - struct malloc_tree_chunk* fd; 1807 1807 - struct malloc_tree_chunk* bk; 1808 1808 - 1809 1809 - struct malloc_tree_chunk* child[2]; 1810 1810 - struct malloc_tree_chunk* parent; 1811 1811 - bindex_t index; 1812 1812 - }; 1813 1813 - 1814 1814 - typedef struct malloc_tree_chunk tchunk; 1815 1815 - typedef struct malloc_tree_chunk* tchunkptr; 1816 1816 - typedef struct malloc_tree_chunk* tbinptr; /* The type of bins of trees */ 1817 1817 - 1818 1818 - /* A little helper macro for trees */ 1819 1819 - #define leftmost_child(t) ((t)->child[0] != 0? (t)->child[0] : (t)->child[1]) 1820 1820 - 1821 1821 - /* ----------------------------- Segments -------------------------------- */ 1822 1822 - 1823 1823 - /* 1824 1824 - Each malloc space may include non-contiguous segments, held in a 1825 1825 - list headed by an embedded malloc_segment record representing the 1826 1826 - top-most space. Segments also include flags holding properties of 1827 1827 - the space. Large chunks that are directly allocated by mmap are not 1828 1828 - included in this list. They are instead independently created and 1829 1829 - destroyed without otherwise keeping track of them. 1830 1830 - 1831 1831 - Segment management mainly comes into play for spaces allocated by 1832 1832 - MMAP. Any call to MMAP might or might not return memory that is 1833 1833 - adjacent to an existing segment. MORECORE normally contiguously 1834 1834 - extends the current space, so this space is almost always adjacent, 1835 1835 - which is simpler and faster to deal with. (This is why MORECORE is 1836 1836 - used preferentially to MMAP when both are available -- see 1837 1837 - sys_alloc.) When allocating using MMAP, we don't use any of the 1838 1838 - hinting mechanisms (inconsistently) supported in various 1839 1839 - implementations of unix mmap, or distinguish reserving from 1840 1840 - committing memory. Instead, we just ask for space, and exploit 1841 1841 - contiguity when we get it. It is probably possible to do 1842 1842 - better than this on some systems, but no general scheme seems 1843 1843 - to be significantly better. 1844 1844 - 1845 1845 - Management entails a simpler variant of the consolidation scheme 1846 1846 - used for chunks to reduce fragmentation -- new adjacent memory is 1847 1847 - normally prepended or appended to an existing segment. However, 1848 1848 - there are limitations compared to chunk consolidation that mostly 1849 1849 - reflect the fact that segment processing is relatively infrequent 1850 1850 - (occurring only when getting memory from system) and that we 1851 1851 - don't expect to have huge numbers of segments: 1852 1852 - 1853 1853 - * Segments are not indexed, so traversal requires linear scans. (It 1854 1854 - would be possible to index these, but is not worth the extra 1855 1855 - overhead and complexity for most programs on most platforms.) 1856 1856 - * New segments are only appended to old ones when holding top-most 1857 1857 - memory; if they cannot be prepended to others, they are held in 1858 1858 - different segments. 1859 1859 - 1860 1860 - Except for the top-most segment of an mstate, each segment record 1861 1861 - is kept at the tail of its segment. Segments are added by pushing 1862 1862 - segment records onto the list headed by &mstate.seg for the 1863 1863 - containing mstate. 1864 1864 - 1865 1865 - Segment flags control allocation/merge/deallocation policies: 1866 1866 - * If EXTERN_BIT set, then we did not allocate this segment, 1867 1867 - and so should not try to deallocate or merge with others. 1868 1868 - (This currently holds only for the initial segment passed 1869 1869 - into create_mspace_with_base.) 1870 1870 - * If IS_MMAPPED_BIT set, the segment may be merged with 1871 1871 - other surrounding mmapped segments and trimmed/de-allocated 1872 1872 - using munmap. 1873 1873 - * If neither bit is set, then the segment was obtained using 1874 1874 - MORECORE so can be merged with surrounding MORECORE'd segments 1875 1875 - and deallocated/trimmed using MORECORE with negative arguments. 1876 1876 - */ 1877 1877 - 1878 1878 - struct malloc_segment { 1879 1879 - char* base; /* base address */ 1880 1880 - size_t size; /* allocated size */ 1881 1881 - struct malloc_segment* next; /* ptr to next segment */ 1882 1882 - flag_t sflags; /* mmap and extern flag */ 1883 1883 - }; 1884 1884 - 1885 1885 - #define is_mmapped_segment(S) ((S)->sflags & IS_MMAPPED_BIT) 1886 1886 - #define is_extern_segment(S) ((S)->sflags & EXTERN_BIT) 1887 1887 - 1888 1888 - typedef struct malloc_segment msegment; 1889 1889 - typedef struct malloc_segment* msegmentptr; 1890 1890 - 1891 1891 - /* ---------------------------- malloc_state ----------------------------- */ 1892 1892 - 1893 1893 - /* 1894 1894 - A malloc_state holds all of the bookkeeping for a space. 1895 1895 - The main fields are: 1896 1896 - 1897 1897 - Top 1898 1898 - The topmost chunk of the currently active segment. Its size is 1899 1899 - cached in topsize. The actual size of topmost space is 1900 1900 - topsize+TOP_FOOT_SIZE, which includes space reserved for adding 1901 1901 - fenceposts and segment records if necessary when getting more 1902 1902 - space from the system. The size at which to autotrim top is 1903 1903 - cached from mparams in trim_check, except that it is disabled if 1904 1904 - an autotrim fails. 1905 1905 - 1906 1906 - Designated victim (dv) 1907 1907 - This is the preferred chunk for servicing small requests that 1908 1908 - don't have exact fits. It is normally the chunk split off most 1909 1909 - recently to service another small request. Its size is cached in 1910 1910 - dvsize. The link fields of this chunk are not maintained since it 1911 1911 - is not kept in a bin. 1912 1912 - 1913 1913 - SmallBins 1914 1914 - An array of bin headers for free chunks. These bins hold chunks 1915 1915 - with sizes less than MIN_LARGE_SIZE bytes. Each bin contains 1916 1916 - chunks of all the same size, spaced 8 bytes apart. To simplify 1917 1917 - use in double-linked lists, each bin header acts as a malloc_chunk 1918 1918 - pointing to the real first node, if it exists (else pointing to 1919 1919 - itself). This avoids special-casing for headers. But to avoid 1920 1920 - waste, we allocate only the fd/bk pointers of bins, and then use 1921 1921 - repositioning tricks to treat these as the fields of a chunk. 1922 1922 - 1923 1923 - TreeBins 1924 1924 - Treebins are pointers to the roots of trees holding a range of 1925 1925 - sizes. There are 2 equally spaced treebins for each power of two 1926 1926 - from TREE_SHIFT to TREE_SHIFT+16. The last bin holds anything 1927 1927 - larger. 1928 1928 - 1929 1929 - Bin maps 1930 1930 - There is one bit map for small bins ("smallmap") and one for 1931 1931 - treebins ("treemap). Each bin sets its bit when non-empty, and 1932 1932 - clears the bit when empty. Bit operations are then used to avoid 1933 1933 - bin-by-bin searching -- nearly all "search" is done without ever 1934 1934 - looking at bins that won't be selected. The bit maps 1935 1935 - conservatively use 32 bits per map word, even if on 64bit system. 1936 1936 - For a good description of some of the bit-based techniques used 1937 1937 - here, see Henry S. Warren Jr's book "Hacker's Delight" (and 1938 1938 - supplement at http://hackersdelight.org/). Many of these are 1939 1939 - intended to reduce the branchiness of paths through malloc etc, as 1940 1940 - well as to reduce the number of memory locations read or written. 1941 1941 - 1942 1942 - Segments 1943 1943 - A list of segments headed by an embedded malloc_segment record 1944 1944 - representing the initial space. 1945 1945 - 1946 1946 - Address check support 1947 1947 - The least_addr field is the least address ever obtained from 1948 1948 - MORECORE or MMAP. Attempted frees and reallocs of any address less 1949 1949 - than this are trapped (unless INSECURE is defined). 1950 1950 - 1951 1951 - Magic tag 1952 1952 - A cross-check field that should always hold same value as mparams.magic. 1953 1953 - 1954 1954 - Flags 1955 1955 - Bits recording whether to use MMAP, locks, or contiguous MORECORE 1956 1956 - 1957 1957 - Statistics 1958 1958 - Each space keeps track of current and maximum system memory 1959 1959 - obtained via MORECORE or MMAP. 1960 1960 - 1961 1961 - Locking 1962 1962 - If USE_LOCKS is defined, the "mutex" lock is acquired and released 1963 1963 - around every public call using this mspace. 1964 1964 - */ 1965 1965 - 1966 1966 - /* Bin types, widths and sizes */ 1967 1967 - #define NSMALLBINS (32U) 1968 1968 - #define NTREEBINS (32U) 1969 1969 - #define SMALLBIN_SHIFT (3U) 1970 1970 - #define SMALLBIN_WIDTH (SIZE_T_ONE << SMALLBIN_SHIFT) 1971 1971 - #define TREEBIN_SHIFT (8U) 1972 1972 - #define MIN_LARGE_SIZE (SIZE_T_ONE << TREEBIN_SHIFT) 1973 1973 - #define MAX_SMALL_SIZE (MIN_LARGE_SIZE - SIZE_T_ONE) 1974 1974 - #define MAX_SMALL_REQUEST (MAX_SMALL_SIZE - CHUNK_ALIGN_MASK - CHUNK_OVERHEAD) 1975 1975 - 1976 1976 - struct malloc_state { 1977 1977 - binmap_t smallmap; 1978 1978 - binmap_t treemap; 1979 1979 - size_t dvsize; 1980 1980 - size_t topsize; 1981 1981 - char* least_addr; 1982 1982 - mchunkptr dv; 1983 1983 - mchunkptr top; 1984 1984 - size_t trim_check; 1985 1985 - size_t magic; 1986 1986 - mchunkptr smallbins[(NSMALLBINS+1)*2]; 1987 1987 - tbinptr treebins[NTREEBINS]; 1988 1988 - size_t footprint; 1989 1989 - size_t max_footprint; 1990 1990 - flag_t mflags; 1991 1991 - #if USE_LOCKS 1992 1992 - MLOCK_T mutex; /* locate lock among fields that rarely change */ 1993 1993 - #endif /* USE_LOCKS */ 1994 1994 - msegment seg; 1995 1995 - }; 1996 1996 - 1997 1997 - typedef struct malloc_state* mstate; 1998 1998 - 1999 1999 - /* ------------- Global malloc_state and malloc_params ------------------- */ 2000 2000 - 2001 2001 - /* 2002 2002 - malloc_params holds global properties, including those that can be 2003 2003 - dynamically set using mallopt. There is a single instance, mparams, 2004 2004 - initialized in init_mparams. 2005 2005 - */ 2006 2006 - 2007 2007 - struct malloc_params { 2008 2008 - size_t magic; 2009 2009 - size_t page_size; 2010 2010 - size_t granularity; 2011 2011 - size_t mmap_threshold; 2012 2012 - size_t trim_threshold; 2013 2013 - flag_t default_mflags; 2014 2014 - }; 2015 2015 - 2016 2016 - static struct malloc_params mparams; 2017 2017 - 2018 2018 - /* The global malloc_state used for all non-"mspace" calls */ 2019 2019 - static struct malloc_state _gm_; 2020 2020 - #define gm (&_gm_) 2021 2021 - #define is_global(M) ((M) == &_gm_) 2022 2022 - #define is_initialized(M) ((M)->top != 0) 2023 2023 - 2024 2024 - /* -------------------------- system alloc setup ------------------------- */ 2025 2025 - 2026 2026 - /* Operations on mflags */ 2027 2027 - 2028 2028 - #define use_lock(M) ((M)->mflags & USE_LOCK_BIT) 2029 2029 - #define enable_lock(M) ((M)->mflags |= USE_LOCK_BIT) 2030 2030 - #define disable_lock(M) ((M)->mflags &= ~USE_LOCK_BIT) 2031 2031 - 2032 2032 - #define use_mmap(M) ((M)->mflags & USE_MMAP_BIT) 2033 2033 - #define enable_mmap(M) ((M)->mflags |= USE_MMAP_BIT) 2034 2034 - #define disable_mmap(M) ((M)->mflags &= ~USE_MMAP_BIT) 2035 2035 - 2036 2036 - #define use_noncontiguous(M) ((M)->mflags & USE_NONCONTIGUOUS_BIT) 2037 2037 - #define disable_contiguous(M) ((M)->mflags |= USE_NONCONTIGUOUS_BIT) 2038 2038 - 2039 2039 - #define set_lock(M,L)\ 2040 2040 - ((M)->mflags = (L)?\ 2041 2041 - ((M)->mflags | USE_LOCK_BIT) :\ 2042 2042 - ((M)->mflags & ~USE_LOCK_BIT)) 2043 2043 - 2044 2044 - /* page-align a size */ 2045 2045 - #define page_align(S)\ 2046 2046 - (((S) + (mparams.page_size)) & ~(mparams.page_size - SIZE_T_ONE)) 2047 2047 - 2048 2048 - /* granularity-align a size */ 2049 2049 - #define granularity_align(S)\ 2050 2050 - (((S) + (mparams.granularity)) & ~(mparams.granularity - SIZE_T_ONE)) 2051 2051 - 2052 2052 - #define is_page_aligned(S)\ 2053 2053 - (((size_t)(S) & (mparams.page_size - SIZE_T_ONE)) == 0) 2054 2054 - #define is_granularity_aligned(S)\ 2055 2055 - (((size_t)(S) & (mparams.granularity - SIZE_T_ONE)) == 0) 2056 2056 - 2057 2057 - /* True if segment S holds address A */ 2058 2058 - #define segment_holds(S, A)\ 2059 2059 - ((char*)(A) >= S->base && (char*)(A) < S->base + S->size) 2060 2060 - 2061 2061 - /* Return segment holding given address */ 2062 2062 - static msegmentptr segment_holding(mstate m, char* addr) { 2063 2063 - msegmentptr sp = &m->seg; 2064 2064 - for (;;) { 2065 2065 - if (addr >= sp->base && addr < sp->base + sp->size) 2066 2066 - return sp; 2067 2067 - if ((sp = sp->next) == 0) 2068 2068 - return 0; 2069 2069 - } 2070 2070 - } 2071 2071 - 2072 2072 - /* Return true if segment contains a segment link */ 2073 2073 - static int has_segment_link(mstate m, msegmentptr ss) { 2074 2074 - msegmentptr sp = &m->seg; 2075 2075 - for (;;) { 2076 2076 - if ((char*)sp >= ss->base && (char*)sp < ss->base + ss->size) 2077 2077 - return 1; 2078 2078 - if ((sp = sp->next) == 0) 2079 2079 - return 0; 2080 2080 - } 2081 2081 - } 2082 2082 - 2083 2083 - #ifndef MORECORE_CANNOT_TRIM 2084 2084 - #define should_trim(M,s) ((s) > (M)->trim_check) 2085 2085 - #else /* MORECORE_CANNOT_TRIM */ 2086 2086 - #define should_trim(M,s) (0) 2087 2087 - #endif /* MORECORE_CANNOT_TRIM */ 2088 2088 - 2089 2089 - /* 2090 2090 - TOP_FOOT_SIZE is padding at the end of a segment, including space 2091 2091 - that may be needed to place segment records and fenceposts when new 2092 2092 - noncontiguous segments are added. 2093 2093 - */ 2094 2094 - #define TOP_FOOT_SIZE\ 2095 2095 - (align_offset(chunk2mem(0))+pad_request(sizeof(struct malloc_segment))+MIN_CHUNK_SIZE) 2096 2096 - 2097 2097 - 2098 2098 - /* ------------------------------- Hooks -------------------------------- */ 2099 2099 - 2100 2100 - /* 2101 2101 - PREACTION should be defined to return 0 on success, and nonzero on 2102 2102 - failure. If you are not using locking, you can redefine these to do 2103 2103 - anything you like. 2104 2104 - */ 2105 2105 - 2106 2106 - #if USE_LOCKS 2107 2107 - 2108 2108 - /* Ensure locks are initialized */ 2109 2109 - #define GLOBALLY_INITIALIZE() (mparams.page_size == 0 && init_mparams()) 2110 2110 - 2111 2111 - #define PREACTION(M) ((GLOBALLY_INITIALIZE() || use_lock(M))? ACQUIRE_LOCK(&(M)->mutex) : 0) 2112 2112 - #define POSTACTION(M) { if (use_lock(M)) RELEASE_LOCK(&(M)->mutex); } 2113 2113 - #else /* USE_LOCKS */ 2114 2114 - 2115 2115 - #ifndef PREACTION 2116 2116 - #define PREACTION(M) (0) 2117 2117 - #endif /* PREACTION */ 2118 2118 - 2119 2119 - #ifndef POSTACTION 2120 2120 - #define POSTACTION(M) 2121 2121 - #endif /* POSTACTION */ 2122 2122 - 2123 2123 - #endif /* USE_LOCKS */ 2124 2124 - 2125 2125 - /* 2126 2126 - CORRUPTION_ERROR_ACTION is triggered upon detected bad addresses. 2127 2127 - USAGE_ERROR_ACTION is triggered on detected bad frees and 2128 2128 - reallocs. The argument p is an address that might have triggered the 2129 2129 - fault. It is ignored by the two predefined actions, but might be 2130 2130 - useful in custom actions that try to help diagnose errors. 2131 2131 - */ 2132 2132 - 2133 2133 - #if PROCEED_ON_ERROR 2134 2134 - 2135 2135 - /* A count of the number of corruption errors causing resets */ 2136 2136 - int malloc_corruption_error_count; 2137 2137 - 2138 2138 - /* default corruption action */ 2139 2139 - static void reset_on_error(mstate m); 2140 2140 - 2141 2141 - #define CORRUPTION_ERROR_ACTION(m) reset_on_error(m) 2142 2142 - #define USAGE_ERROR_ACTION(m, p) 2143 2143 - 2144 2144 - #else /* PROCEED_ON_ERROR */ 2145 2145 - 2146 2146 - #ifndef CORRUPTION_ERROR_ACTION 2147 2147 - #define CORRUPTION_ERROR_ACTION(m) ABORT 2148 2148 - #endif /* CORRUPTION_ERROR_ACTION */ 2149 2149 - 2150 2150 - #ifndef USAGE_ERROR_ACTION 2151 2151 - #define USAGE_ERROR_ACTION(m,p) ABORT 2152 2152 - #endif /* USAGE_ERROR_ACTION */ 2153 2153 - 2154 2154 - #endif /* PROCEED_ON_ERROR */ 2155 2155 - 2156 2156 - /* -------------------------- Debugging setup ---------------------------- */ 2157 2157 - 2158 2158 - #ifndef DEBUG 2159 2159 - 2160 2160 - #define check_free_chunk(M,P) 2161 2161 - #define check_inuse_chunk(M,P) 2162 2162 - #define check_malloced_chunk(M,P,N) 2163 2163 - #define check_mmapped_chunk(M,P) 2164 2164 - #define check_malloc_state(M) 2165 2165 - #define check_top_chunk(M,P) 2166 2166 - 2167 2167 - #else /* DEBUG */ 2168 2168 - #define check_free_chunk(M,P) do_check_free_chunk(M,P) 2169 2169 - #define check_inuse_chunk(M,P) do_check_inuse_chunk(M,P) 2170 2170 - #define check_top_chunk(M,P) do_check_top_chunk(M,P) 2171 2171 - #define check_malloced_chunk(M,P,N) do_check_malloced_chunk(M,P,N) 2172 2172 - #define check_mmapped_chunk(M,P) do_check_mmapped_chunk(M,P) 2173 2173 - #define check_malloc_state(M) do_check_malloc_state(M) 2174 2174 - 2175 2175 - static void do_check_any_chunk(mstate m, mchunkptr p); 2176 2176 - static void do_check_top_chunk(mstate m, mchunkptr p); 2177 2177 - static void do_check_mmapped_chunk(mstate m, mchunkptr p); 2178 2178 - static void do_check_inuse_chunk(mstate m, mchunkptr p); 2179 2179 - static void do_check_free_chunk(mstate m, mchunkptr p); 2180 2180 - static void do_check_malloced_chunk(mstate m, void* mem, size_t s); 2181 2181 - static void do_check_tree(mstate m, tchunkptr t); 2182 2182 - static void do_check_treebin(mstate m, bindex_t i); 2183 2183 - static void do_check_smallbin(mstate m, bindex_t i); 2184 2184 - static void do_check_malloc_state(mstate m); 2185 2185 - static int bin_find(mstate m, mchunkptr x); 2186 2186 - static size_t traverse_and_check(mstate m); 2187 2187 - #endif /* DEBUG */ 2188 2188 - 2189 2189 - /* ---------------------------- Indexing Bins ---------------------------- */ 2190 2190 - 2191 2191 - #define is_small(s) (((s) >> SMALLBIN_SHIFT) < NSMALLBINS) 2192 2192 - #define small_index(s) ((s) >> SMALLBIN_SHIFT) 2193 2193 - #define small_index2size(i) ((i) << SMALLBIN_SHIFT) 2194 2194 - #define MIN_SMALL_INDEX (small_index(MIN_CHUNK_SIZE)) 2195 2195 - 2196 2196 - /* addressing by index. See above about smallbin repositioning */ 2197 2197 - #define smallbin_at(M, i) ((sbinptr)((char*)&((M)->smallbins[(i)<<1]))) 2198 2198 - #define treebin_at(M,i) (&((M)->treebins[i])) 2199 2199 - 2200 2200 - /* assign tree index for size S to variable I */ 2201 2201 - #if defined(__GNUC__) && defined(i386) 2202 2202 - #define compute_tree_index(S, I)\ 2203 2203 - {\ 2204 2204 - size_t X = S >> TREEBIN_SHIFT;\ 2205 2205 - if (X == 0)\ 2206 2206 - I = 0;\ 2207 2207 - else if (X > 0xFFFF)\ 2208 2208 - I = NTREEBINS-1;\ 2209 2209 - else {\ 2210 2210 - unsigned int K;\ 2211 2211 - __asm__("bsrl %1,%0\n\t" : "=r" (K) : "rm" (X));\ 2212 2212 - I = (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\ 2213 2213 - }\ 2214 2214 - } 2215 2215 - #else /* GNUC */ 2216 2216 - #define compute_tree_index(S, I)\ 2217 2217 - {\ 2218 2218 - size_t X = S >> TREEBIN_SHIFT;\ 2219 2219 - if (X == 0)\ 2220 2220 - I = 0;\ 2221 2221 - else if (X > 0xFFFF)\ 2222 2222 - I = NTREEBINS-1;\ 2223 2223 - else {\ 2224 2224 - unsigned int Y = (unsigned int)X;\ 2225 2225 - unsigned int N = ((Y - 0x100) >> 16) & 8;\ 2226 2226 - unsigned int K = (((Y <<= N) - 0x1000) >> 16) & 4;\ 2227 2227 - N += K;\ 2228 2228 - N += K = (((Y <<= K) - 0x4000) >> 16) & 2;\ 2229 2229 - K = 14 - N + ((Y <<= K) >> 15);\ 2230 2230 - I = (K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1));\ 2231 2231 - }\ 2232 2232 - } 2233 2233 - #endif /* GNUC */ 2234 2234 - 2235 2235 - /* Bit representing maximum resolved size in a treebin at i */ 2236 2236 - #define bit_for_tree_index(i) \ 2237 2237 - (i == NTREEBINS-1)? (SIZE_T_BITSIZE-1) : (((i) >> 1) + TREEBIN_SHIFT - 2) 2238 2238 - 2239 2239 - /* Shift placing maximum resolved bit in a treebin at i as sign bit */ 2240 2240 - #define leftshift_for_tree_index(i) \ 2241 2241 - ((i == NTREEBINS-1)? 0 : \ 2242 2242 - ((SIZE_T_BITSIZE-SIZE_T_ONE) - (((i) >> 1) + TREEBIN_SHIFT - 2))) 2243 2243 - 2244 2244 - /* The size of the smallest chunk held in bin with index i */ 2245 2245 - #define minsize_for_tree_index(i) \ 2246 2246 - ((SIZE_T_ONE << (((i) >> 1) + TREEBIN_SHIFT)) | \ 2247 2247 - (((size_t)((i) & SIZE_T_ONE)) << (((i) >> 1) + TREEBIN_SHIFT - 1))) 2248 2248 - 2249 2249 - 2250 2250 - /* ------------------------ Operations on bin maps ----------------------- */ 2251 2251 - 2252 2252 - /* bit corresponding to given index */ 2253 2253 - #define idx2bit(i) ((binmap_t)(1) << (i)) 2254 2254 - 2255 2255 - /* Mark/Clear bits with given index */ 2256 2256 - #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i)) 2257 2257 - #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i)) 2258 2258 - #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i)) 2259 2259 - 2260 2260 - #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i)) 2261 2261 - #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i)) 2262 2262 - #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i)) 2263 2263 - 2264 2264 - /* index corresponding to given bit */ 2265 2265 - 2266 2266 - #if defined(__GNUC__) && defined(i386) 2267 2267 - #define compute_bit2idx(X, I)\ 2268 2268 - {\ 2269 2269 - unsigned int J;\ 2270 2270 - __asm__("bsfl %1,%0\n\t" : "=r" (J) : "rm" (X));\ 2271 2271 - I = (bindex_t)J;\ 2272 2272 - } 2273 2273 - 2274 2274 - #else /* GNUC */ 2275 2275 - #if USE_BUILTIN_FFS 2276 2276 - #define compute_bit2idx(X, I) I = ffs(X)-1 2277 2277 - 2278 2278 - #else /* USE_BUILTIN_FFS */ 2279 2279 - #define compute_bit2idx(X, I)\ 2280 2280 - {\ 2281 2281 - unsigned int Y = X - 1;\ 2282 2282 - unsigned int K = Y >> (16-4) & 16;\ 2283 2283 - unsigned int N = K; Y >>= K;\ 2284 2284 - N += K = Y >> (8-3) & 8; Y >>= K;\ 2285 2285 - N += K = Y >> (4-2) & 4; Y >>= K;\ 2286 2286 - N += K = Y >> (2-1) & 2; Y >>= K;\ 2287 2287 - N += K = Y >> (1-0) & 1; Y >>= K;\ 2288 2288 - I = (bindex_t)(N + Y);\ 2289 2289 - } 2290 2290 - #endif /* USE_BUILTIN_FFS */ 2291 2291 - #endif /* GNUC */ 2292 2292 - 2293 2293 - /* isolate the least set bit of a bitmap */ 2294 2294 - #define least_bit(x) ((x) & -(x)) 2295 2295 - 2296 2296 - /* mask with all bits to left of least bit of x on */ 2297 2297 - #define left_bits(x) ((x<<1) | -(x<<1)) 2298 2298 - 2299 2299 - /* mask with all bits to left of or equal to least bit of x on */ 2300 2300 - #define same_or_left_bits(x) ((x) | -(x)) 2301 2301 - 2302 2302 - 2303 2303 - /* ----------------------- Runtime Check Support ------------------------- */ 2304 2304 - 2305 2305 - /* 2306 2306 - For security, the main invariant is that malloc/free/etc never 2307 2307 - writes to a static address other than malloc_state, unless static 2308 2308 - malloc_state itself has been corrupted, which cannot occur via 2309 2309 - malloc (because of these checks). In essence this means that we 2310 2310 - believe all pointers, sizes, maps etc held in malloc_state, but 2311 2311 - check all of those linked or offsetted from other embedded data 2312 2312 - structures. These checks are interspersed with main code in a way 2313 2313 - that tends to minimize their run-time cost. 2314 2314 - 2315 2315 - When FOOTERS is defined, in addition to range checking, we also 2316 2316 - verify footer fields of inuse chunks, which can be used guarantee 2317 2317 - that the mstate controlling malloc/free is intact. This is a 2318 2318 - streamlined version of the approach described by William Robertson 2319 2319 - et al in "Run-time Detection of Heap-based Overflows" LISA'03 2320 2320 - http://www.usenix.org/events/lisa03/tech/robertson.html The footer 2321 2321 - of an inuse chunk holds the xor of its mstate and a random seed, 2322 2322 - that is checked upon calls to free() and realloc(). This is 2323 2323 - (probablistically) unguessable from outside the program, but can be 2324 2324 - computed by any code successfully malloc'ing any chunk, so does not 2325 2325 - itself provide protection against code that has already broken 2326 2326 - security through some other means. Unlike Robertson et al, we 2327 2327 - always dynamically check addresses of all offset chunks (previous, 2328 2328 - next, etc). This turns out to be cheaper than relying on hashes. 2329 2329 - */ 2330 2330 - 2331 2331 - #if !INSECURE 2332 2332 - /* Check if address a is at least as high as any from MORECORE or MMAP */ 2333 2333 - #define ok_address(M, a) ((char*)(a) >= (M)->least_addr) 2334 2334 - /* Check if address of next chunk n is higher than base chunk p */ 2335 2335 - #define ok_next(p, n) ((char*)(p) < (char*)(n)) 2336 2336 - /* Check if p has its cinuse bit on */ 2337 2337 - #define ok_cinuse(p) cinuse(p) 2338 2338 - /* Check if p has its pinuse bit on */ 2339 2339 - #define ok_pinuse(p) pinuse(p) 2340 2340 - 2341 2341 - #else /* !INSECURE */ 2342 2342 - #define ok_address(M, a) (1) 2343 2343 - #define ok_next(b, n) (1) 2344 2344 - #define ok_cinuse(p) (1) 2345 2345 - #define ok_pinuse(p) (1) 2346 2346 - #endif /* !INSECURE */ 2347 2347 - 2348 2348 - #if (FOOTERS && !INSECURE) 2349 2349 - /* Check if (alleged) mstate m has expected magic field */ 2350 2350 - #define ok_magic(M) ((M)->magic == mparams.magic) 2351 2351 - #else /* (FOOTERS && !INSECURE) */ 2352 2352 - #define ok_magic(M) (1) 2353 2353 - #endif /* (FOOTERS && !INSECURE) */ 2354 2354 - 2355 2355 - 2356 2356 - /* In gcc, use __builtin_expect to minimize impact of checks */ 2357 2357 - #if !INSECURE 2358 2358 - #if defined(__GNUC__) && __GNUC__ >= 3 2359 2359 - #define RTCHECK(e) __builtin_expect(e, 1) 2360 2360 - #else /* GNUC */ 2361 2361 - #define RTCHECK(e) (e) 2362 2362 - #endif /* GNUC */ 2363 2363 - #else /* !INSECURE */ 2364 2364 - #define RTCHECK(e) (1) 2365 2365 - #endif /* !INSECURE */ 2366 2366 - 2367 2367 - /* macros to set up inuse chunks with or without footers */ 2368 2368 - 2369 2369 - #if !FOOTERS 2370 2370 - 2371 2371 - #define mark_inuse_foot(M,p,s) 2372 2372 - 2373 2373 - /* Set cinuse bit and pinuse bit of next chunk */ 2374 2374 - #define set_inuse(M,p,s)\ 2375 2375 - ((p)->head = (((p)->head & PINUSE_BIT)|s|CINUSE_BIT),\ 2376 2376 - ((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT) 2377 2377 - 2378 2378 - /* Set cinuse and pinuse of this chunk and pinuse of next chunk */ 2379 2379 - #define set_inuse_and_pinuse(M,p,s)\ 2380 2380 - ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\ 2381 2381 - ((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT) 2382 2382 - 2383 2383 - /* Set size, cinuse and pinuse bit of this chunk */ 2384 2384 - #define set_size_and_pinuse_of_inuse_chunk(M, p, s)\ 2385 2385 - ((p)->head = (s|PINUSE_BIT|CINUSE_BIT)) 2386 2386 - 2387 2387 - #else /* FOOTERS */ 2388 2388 - 2389 2389 - /* Set foot of inuse chunk to be xor of mstate and seed */ 2390 2390 - #define mark_inuse_foot(M,p,s)\ 2391 2391 - (((mchunkptr)((char*)(p) + (s)))->prev_foot = ((size_t)(M) ^ mparams.magic)) 2392 2392 - 2393 2393 - #define get_mstate_for(p)\ 2394 2394 - ((mstate)(((mchunkptr)((char*)(p) +\ 2395 2395 - (chunksize(p))))->prev_foot ^ mparams.magic)) 2396 2396 - 2397 2397 - #define set_inuse(M,p,s)\ 2398 2398 - ((p)->head = (((p)->head & PINUSE_BIT)|s|CINUSE_BIT),\ 2399 2399 - (((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT), \ 2400 2400 - mark_inuse_foot(M,p,s)) 2401 2401 - 2402 2402 - #define set_inuse_and_pinuse(M,p,s)\ 2403 2403 - ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\ 2404 2404 - (((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT),\ 2405 2405 - mark_inuse_foot(M,p,s)) 2406 2406 - 2407 2407 - #define set_size_and_pinuse_of_inuse_chunk(M, p, s)\ 2408 2408 - ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\ 2409 2409 - mark_inuse_foot(M, p, s)) 2410 2410 - 2411 2411 - #endif /* !FOOTERS */ 2412 2412 - 2413 2413 - /* ---------------------------- setting mparams -------------------------- */ 2414 2414 - 2415 2415 - /* Initialize mparams */ 2416 2416 - static int init_mparams(void) { 2417 2417 - if (mparams.page_size == 0) { 2418 2418 - size_t s; 2419 2419 - 2420 2420 - mparams.mmap_threshold = DEFAULT_MMAP_THRESHOLD; 2421 2421 - mparams.trim_threshold = DEFAULT_TRIM_THRESHOLD; 2422 2422 - #if MORECORE_CONTIGUOUS 2423 2423 - mparams.default_mflags = USE_LOCK_BIT|USE_MMAP_BIT; 2424 2424 - #else /* MORECORE_CONTIGUOUS */ 2425 2425 - mparams.default_mflags = USE_LOCK_BIT|USE_MMAP_BIT|USE_NONCONTIGUOUS_BIT; 2426 2426 - #endif /* MORECORE_CONTIGUOUS */ 2427 2427 - 2428 2428 - #if (FOOTERS && !INSECURE) 2429 2429 - { 2430 2430 - #if USE_DEV_RANDOM 2431 2431 - int fd; 2432 2432 - unsigned char buf[sizeof(size_t)]; 2433 2433 - /* Try to use /dev/urandom, else fall back on using time */ 2434 2434 - if ((fd = open("/dev/urandom", O_RDONLY)) >= 0 && 2435 2435 - read(fd, buf, sizeof(buf)) == sizeof(buf)) { 2436 2436 - s = *((size_t *) buf); 2437 2437 - close(fd); 2438 2438 - } 2439 2439 - else 2440 2440 - #endif /* USE_DEV_RANDOM */ 2441 2441 - s = (size_t)(time(0) ^ (size_t)0x55555555U); 2442 2442 - 2443 2443 - s |= (size_t)8U; /* ensure nonzero */ 2444 2444 - s &= ~(size_t)7U; /* improve chances of fault for bad values */ 2445 2445 - 2446 2446 - } 2447 2447 - #else /* (FOOTERS && !INSECURE) */ 2448 2448 - s = (size_t)0x58585858U; 2449 2449 - #endif /* (FOOTERS && !INSECURE) */ 2450 2450 - ACQUIRE_MAGIC_INIT_LOCK(); 2451 2451 - if (mparams.magic == 0) { 2452 2452 - mparams.magic = s; 2453 2453 - /* Set up lock for main malloc area */ 2454 2454 - INITIAL_LOCK(&gm->mutex); 2455 2455 - gm->mflags = mparams.default_mflags; 2456 2456 - } 2457 2457 - RELEASE_MAGIC_INIT_LOCK(); 2458 2458 - 2459 2459 - #ifndef WIN32 2460 2460 - mparams.page_size = malloc_getpagesize; 2461 2461 - mparams.granularity = ((DEFAULT_GRANULARITY != 0)? 2462 2462 - DEFAULT_GRANULARITY : mparams.page_size); 2463 2463 - #else /* WIN32 */ 2464 2464 - { 2465 2465 - SYSTEM_INFO system_info; 2466 2466 - GetSystemInfo(&system_info); 2467 2467 - mparams.page_size = system_info.dwPageSize; 2468 2468 - mparams.granularity = system_info.dwAllocationGranularity; 2469 2469 - } 2470 2470 - #endif /* WIN32 */ 2471 2471 - 2472 2472 - /* Sanity-check configuration: 2473 2473 - size_t must be unsigned and as wide as pointer type. 2474 2474 - ints must be at least 4 bytes. 2475 2475 - alignment must be at least 8. 2476 2476 - Alignment, min chunk size, and page size must all be powers of 2. 2477 2477 - */ 2478 2478 - if ((sizeof(size_t) != sizeof(char*)) || 2479 2479 - (MAX_SIZE_T < MIN_CHUNK_SIZE) || 2480 2480 - (sizeof(int) < 4) || 2481 2481 - (MALLOC_ALIGNMENT < (size_t)8U) || 2482 2482 - ((MALLOC_ALIGNMENT & (MALLOC_ALIGNMENT-SIZE_T_ONE)) != 0) || 2483 2483 - ((MCHUNK_SIZE & (MCHUNK_SIZE-SIZE_T_ONE)) != 0) || 2484 2484 - ((mparams.granularity & (mparams.granularity-SIZE_T_ONE)) != 0) || 2485 2485 - ((mparams.page_size & (mparams.page_size-SIZE_T_ONE)) != 0)) 2486 2486 - ABORT; 2487 2487 - } 2488 2488 - return 0; 2489 2489 - } 2490 2490 - 2491 2491 - /* support for mallopt */ 2492 2492 - static int change_mparam(int param_number, int value) { 2493 2493 - size_t val = (size_t)value; 2494 2494 - init_mparams(); 2495 2495 - switch(param_number) { 2496 2496 - case M_TRIM_THRESHOLD: 2497 2497 - mparams.trim_threshold = val; 2498 2498 - return 1; 2499 2499 - case M_GRANULARITY: 2500 2500 - if (val >= mparams.page_size && ((val & (val-1)) == 0)) { 2501 2501 - mparams.granularity = val; 2502 2502 - return 1; 2503 2503 - } 2504 2504 - else 2505 2505 - return 0; 2506 2506 - case M_MMAP_THRESHOLD: 2507 2507 - mparams.mmap_threshold = val; 2508 2508 - return 1; 2509 2509 - default: 2510 2510 - return 0; 2511 2511 - } 2512 2512 - } 2513 2513 - 2514 2514 - #ifdef DEBUG 2515 2515 - /* ------------------------- Debugging Support --------------------------- */ 2516 2516 - 2517 2517 - /* Check properties of any chunk, whether free, inuse, mmapped etc */ 2518 2518 - static void do_check_any_chunk(mstate m, mchunkptr p) { 2519 2519 - assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD)); 2520 2520 - assert(ok_address(m, p)); 2521 2521 - } 2522 2522 - 2523 2523 - /* Check properties of top chunk */ 2524 2524 - static void do_check_top_chunk(mstate m, mchunkptr p) { 2525 2525 - msegmentptr sp = segment_holding(m, (char*)p); 2526 2526 - size_t sz = chunksize(p); 2527 2527 - assert(sp != 0); 2528 2528 - assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD)); 2529 2529 - assert(ok_address(m, p)); 2530 2530 - assert(sz == m->topsize); 2531 2531 - assert(sz > 0); 2532 2532 - assert(sz == ((sp->base + sp->size) - (char*)p) - TOP_FOOT_SIZE); 2533 2533 - assert(pinuse(p)); 2534 2534 - assert(!next_pinuse(p)); 2535 2535 - } 2536 2536 - 2537 2537 - /* Check properties of (inuse) mmapped chunks */ 2538 2538 - static void do_check_mmapped_chunk(mstate m, mchunkptr p) { 2539 2539 - size_t sz = chunksize(p); 2540 2540 - size_t len = (sz + (p->prev_foot & ~IS_MMAPPED_BIT) + MMAP_FOOT_PAD); 2541 2541 - assert(is_mmapped(p)); 2542 2542 - assert(use_mmap(m)); 2543 2543 - assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD)); 2544 2544 - assert(ok_address(m, p)); 2545 2545 - assert(!is_small(sz)); 2546 2546 - assert((len & (mparams.page_size-SIZE_T_ONE)) == 0); 2547 2547 - assert(chunk_plus_offset(p, sz)->head == FENCEPOST_HEAD); 2548 2548 - assert(chunk_plus_offset(p, sz+SIZE_T_SIZE)->head == 0); 2549 2549 - } 2550 2550 - 2551 2551 - /* Check properties of inuse chunks */ 2552 2552 - static void do_check_inuse_chunk(mstate m, mchunkptr p) { 2553 2553 - do_check_any_chunk(m, p); 2554 2554 - assert(cinuse(p)); 2555 2555 - assert(next_pinuse(p)); 2556 2556 - /* If not pinuse and not mmapped, previous chunk has OK offset */ 2557 2557 - assert(is_mmapped(p) || pinuse(p) || next_chunk(prev_chunk(p)) == p); 2558 2558 - if (is_mmapped(p)) 2559 2559 - do_check_mmapped_chunk(m, p); 2560 2560 - } 2561 2561 - 2562 2562 - /* Check properties of free chunks */ 2563 2563 - static void do_check_free_chunk(mstate m, mchunkptr p) { 2564 2564 - size_t sz = p->head & ~(PINUSE_BIT|CINUSE_BIT); 2565 2565 - mchunkptr next = chunk_plus_offset(p, sz); 2566 2566 - do_check_any_chunk(m, p); 2567 2567 - assert(!cinuse(p)); 2568 2568 - assert(!next_pinuse(p)); 2569 2569 - assert (!is_mmapped(p)); 2570 2570 - if (p != m->dv && p != m->top) { 2571 2571 - if (sz >= MIN_CHUNK_SIZE) { 2572 2572 - assert((sz & CHUNK_ALIGN_MASK) == 0); 2573 2573 - assert(is_aligned(chunk2mem(p))); 2574 2574 - assert(next->prev_foot == sz); 2575 2575 - assert(pinuse(p)); 2576 2576 - assert (next == m->top || cinuse(next)); 2577 2577 - assert(p->fd->bk == p); 2578 2578 - assert(p->bk->fd == p); 2579 2579 - } 2580 2580 - else /* markers are always of size SIZE_T_SIZE */ 2581 2581 - assert(sz == SIZE_T_SIZE); 2582 2582 - } 2583 2583 - } 2584 2584 - 2585 2585 - /* Check properties of malloced chunks at the point they are malloced */ 2586 2586 - static void do_check_malloced_chunk(mstate m, void* mem, size_t s) { 2587 2587 - if (mem != 0) { 2588 2588 - mchunkptr p = mem2chunk(mem); 2589 2589 - size_t sz = p->head & ~(PINUSE_BIT|CINUSE_BIT); 2590 2590 - do_check_inuse_chunk(m, p); 2591 2591 - assert((sz & CHUNK_ALIGN_MASK) == 0); 2592 2592 - assert(sz >= MIN_CHUNK_SIZE); 2593 2593 - assert(sz >= s); 2594 2594 - /* unless mmapped, size is less than MIN_CHUNK_SIZE more than request */ 2595 2595 - assert(is_mmapped(p) || sz < (s + MIN_CHUNK_SIZE)); 2596 2596 - } 2597 2597 - } 2598 2598 - 2599 2599 - /* Check a tree and its subtrees. */ 2600 2600 - static void do_check_tree(mstate m, tchunkptr t) { 2601 2601 - tchunkptr head = 0; 2602 2602 - tchunkptr u = t; 2603 2603 - bindex_t tindex = t->index; 2604 2604 - size_t tsize = chunksize(t); 2605 2605 - bindex_t idx; 2606 2606 - compute_tree_index(tsize, idx); 2607 2607 - assert(tindex == idx); 2608 2608 - assert(tsize >= MIN_LARGE_SIZE); 2609 2609 - assert(tsize >= minsize_for_tree_index(idx)); 2610 2610 - assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); 2611 2611 - 2612 2612 - do { /* traverse through chain of same-sized nodes */ 2613 2613 - do_check_any_chunk(m, ((mchunkptr)u)); 2614 2614 - assert(u->index == tindex); 2615 2615 - assert(chunksize(u) == tsize); 2616 2616 - assert(!cinuse(u)); 2617 2617 - assert(!next_pinuse(u)); 2618 2618 - assert(u->fd->bk == u); 2619 2619 - assert(u->bk->fd == u); 2620 2620 - if (u->parent == 0) { 2621 2621 - assert(u->child[0] == 0); 2622 2622 - assert(u->child[1] == 0); 2623 2623 - } 2624 2624 - else { 2625 2625 - assert(head == 0); /* only one node on chain has parent */ 2626 2626 - head = u; 2627 2627 - assert(u->parent != u); 2628 2628 - assert (u->parent->child[0] == u || 2629 2629 - u->parent->child[1] == u || 2630 2630 - *((tbinptr*)(u->parent)) == u); 2631 2631 - if (u->child[0] != 0) { 2632 2632 - assert(u->child[0]->parent == u); 2633 2633 - assert(u->child[0] != u); 2634 2634 - do_check_tree(m, u->child[0]); 2635 2635 - } 2636 2636 - if (u->child[1] != 0) { 2637 2637 - assert(u->child[1]->parent == u); 2638 2638 - assert(u->child[1] != u); 2639 2639 - do_check_tree(m, u->child[1]); 2640 2640 - } 2641 2641 - if (u->child[0] != 0 && u->child[1] != 0) { 2642 2642 - assert(chunksize(u->child[0]) < chunksize(u->child[1])); 2643 2643 - } 2644 2644 - } 2645 2645 - u = u->fd; 2646 2646 - } while (u != t); 2647 2647 - assert(head != 0); 2648 2648 - } 2649 2649 - 2650 2650 - /* Check all the chunks in a treebin. */ 2651 2651 - static void do_check_treebin(mstate m, bindex_t i) { 2652 2652 - tbinptr* tb = treebin_at(m, i); 2653 2653 - tchunkptr t = *tb; 2654 2654 - int empty = (m->treemap & (1U << i)) == 0; 2655 2655 - if (t == 0) 2656 2656 - assert(empty); 2657 2657 - if (!empty) 2658 2658 - do_check_tree(m, t); 2659 2659 - } 2660 2660 - 2661 2661 - /* Check all the chunks in a smallbin. */ 2662 2662 - static void do_check_smallbin(mstate m, bindex_t i) { 2663 2663 - sbinptr b = smallbin_at(m, i); 2664 2664 - mchunkptr p = b->bk; 2665 2665 - unsigned int empty = (m->smallmap & (1U << i)) == 0; 2666 2666 - if (p == b) 2667 2667 - assert(empty); 2668 2668 - if (!empty) { 2669 2669 - for (; p != b; p = p->bk) { 2670 2670 - size_t size = chunksize(p); 2671 2671 - mchunkptr q; 2672 2672 - /* each chunk claims to be free */ 2673 2673 - do_check_free_chunk(m, p); 2674 2674 - /* chunk belongs in bin */ 2675 2675 - assert(small_index(size) == i); 2676 2676 - assert(p->bk == b || chunksize(p->bk) == chunksize(p)); 2677 2677 - /* chunk is followed by an inuse chunk */ 2678 2678 - q = next_chunk(p); 2679 2679 - if (q->head != FENCEPOST_HEAD) 2680 2680 - do_check_inuse_chunk(m, q); 2681 2681 - } 2682 2682 - } 2683 2683 - } 2684 2684 - 2685 2685 - /* Find x in a bin. Used in other check functions. */ 2686 2686 - static int bin_find(mstate m, mchunkptr x) { 2687 2687 - size_t size = chunksize(x); 2688 2688 - if (is_small(size)) { 2689 2689 - bindex_t sidx = small_index(size); 2690 2690 - sbinptr b = smallbin_at(m, sidx); 2691 2691 - if (smallmap_is_marked(m, sidx)) { 2692 2692 - mchunkptr p = b; 2693 2693 - do { 2694 2694 - if (p == x) 2695 2695 - return 1; 2696 2696 - } while ((p = p->fd) != b); 2697 2697 - } 2698 2698 - } 2699 2699 - else { 2700 2700 - bindex_t tidx; 2701 2701 - compute_tree_index(size, tidx); 2702 2702 - if (treemap_is_marked(m, tidx)) { 2703 2703 - tchunkptr t = *treebin_at(m, tidx); 2704 2704 - size_t sizebits = size << leftshift_for_tree_index(tidx); 2705 2705 - while (t != 0 && chunksize(t) != size) { 2706 2706 - t = t->child[(sizebits >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1]; 2707 2707 - sizebits <<= 1; 2708 2708 - } 2709 2709 - if (t != 0) { 2710 2710 - tchunkptr u = t; 2711 2711 - do { 2712 2712 - if (u == (tchunkptr)x) 2713 2713 - return 1; 2714 2714 - } while ((u = u->fd) != t); 2715 2715 - } 2716 2716 - } 2717 2717 - } 2718 2718 - return 0; 2719 2719 - } 2720 2720 - 2721 2721 - /* Traverse each chunk and check it; return total */ 2722 2722 - static size_t traverse_and_check(mstate m) { 2723 2723 - size_t sum = 0; 2724 2724 - if (is_initialized(m)) { 2725 2725 - msegmentptr s = &m->seg; 2726 2726 - sum += m->topsize + TOP_FOOT_SIZE; 2727 2727 - while (s != 0) { 2728 2728 - mchunkptr q = align_as_chunk(s->base); 2729 2729 - mchunkptr lastq = 0; 2730 2730 - assert(pinuse(q)); 2731 2731 - while (segment_holds(s, q) && 2732 2732 - q != m->top && q->head != FENCEPOST_HEAD) { 2733 2733 - sum += chunksize(q); 2734 2734 - if (cinuse(q)) { 2735 2735 - assert(!bin_find(m, q)); 2736 2736 - do_check_inuse_chunk(m, q); 2737 2737 - } 2738 2738 - else { 2739 2739 - assert(q == m->dv || bin_find(m, q)); 2740 2740 - assert(lastq == 0 || cinuse(lastq)); /* Not 2 consecutive free */ 2741 2741 - do_check_free_chunk(m, q); 2742 2742 - } 2743 2743 - lastq = q; 2744 2744 - q = next_chunk(q); 2745 2745 - } 2746 2746 - s = s->next; 2747 2747 - } 2748 2748 - } 2749 2749 - return sum; 2750 2750 - } 2751 2751 - 2752 2752 - /* Check all properties of malloc_state. */ 2753 2753 - static void do_check_malloc_state(mstate m) { 2754 2754 - bindex_t i; 2755 2755 - size_t total; 2756 2756 - /* check bins */ 2757 2757 - for (i = 0; i < NSMALLBINS; ++i) 2758 2758 - do_check_smallbin(m, i); 2759 2759 - for (i = 0; i < NTREEBINS; ++i) 2760 2760 - do_check_treebin(m, i); 2761 2761 - 2762 2762 - if (m->dvsize != 0) { /* check dv chunk */ 2763 2763 - do_check_any_chunk(m, m->dv); 2764 2764 - assert(m->dvsize == chunksize(m->dv)); 2765 2765 - assert(m->dvsize >= MIN_CHUNK_SIZE); 2766 2766 - assert(bin_find(m, m->dv) == 0); 2767 2767 - } 2768 2768 - 2769 2769 - if (m->top != 0) { /* check top chunk */ 2770 2770 - do_check_top_chunk(m, m->top); 2771 2771 - assert(m->topsize == chunksize(m->top)); 2772 2772 - assert(m->topsize > 0); 2773 2773 - assert(bin_find(m, m->top) == 0); 2774 2774 - } 2775 2775 - 2776 2776 - total = traverse_and_check(m); 2777 2777 - assert(total <= m->footprint); 2778 2778 - assert(m->footprint <= m->max_footprint); 2779 2779 - } 2780 2780 - #endif /* DEBUG */ 2781 2781 - 2782 2782 - /* ----------------------------- statistics ------------------------------ */ 2783 2783 - 2784 2784 - #if !NO_MALLINFO 2785 2785 - static struct mallinfo internal_mallinfo(mstate m) { 2786 2786 - struct mallinfo nm = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }; 2787 2787 - if (!PREACTION(m)) { 2788 2788 - check_malloc_state(m); 2789 2789 - if (is_initialized(m)) { 2790 2790 - size_t nfree = SIZE_T_ONE; /* top always free */ 2791 2791 - size_t mfree = m->topsize + TOP_FOOT_SIZE; 2792 2792 - size_t sum = mfree; 2793 2793 - msegmentptr s = &m->seg; 2794 2794 - while (s != 0) { 2795 2795 - mchunkptr q = align_as_chunk(s->base); 2796 2796 - while (segment_holds(s, q) && 2797 2797 - q != m->top && q->head != FENCEPOST_HEAD) { 2798 2798 - size_t sz = chunksize(q); 2799 2799 - sum += sz; 2800 2800 - if (!cinuse(q)) { 2801 2801 - mfree += sz; 2802 2802 - ++nfree; 2803 2803 - } 2804 2804 - q = next_chunk(q); 2805 2805 - } 2806 2806 - s = s->next; 2807 2807 - } 2808 2808 - 2809 2809 - nm.arena = sum; 2810 2810 - nm.ordblks = nfree; 2811 2811 - nm.hblkhd = m->footprint - sum; 2812 2812 - nm.usmblks = m->max_footprint; 2813 2813 - nm.uordblks = m->footprint - mfree; 2814 2814 - nm.fordblks = mfree; 2815 2815 - nm.keepcost = m->topsize; 2816 2816 - } 2817 2817 - 2818 2818 - POSTACTION(m); 2819 2819 - } 2820 2820 - return nm; 2821 2821 - } 2822 2822 - #endif /* !NO_MALLINFO */ 2823 2823 - 2824 2824 - static void internal_malloc_stats(mstate m) { 2825 2825 - if (!PREACTION(m)) { 2826 2826 - check_malloc_state(m); 2827 2827 - if (is_initialized(m)) { 2828 2828 - msegmentptr s = &m->seg; 2829 2829 - size_t used = m->footprint - (m->topsize + TOP_FOOT_SIZE); 2830 2830 - while (s != 0) { 2831 2831 - mchunkptr q = align_as_chunk(s->base); 2832 2832 - while (segment_holds(s, q) && 2833 2833 - q != m->top && q->head != FENCEPOST_HEAD) { 2834 2834 - if (!cinuse(q)) 2835 2835 - used -= chunksize(q); 2836 2836 - q = next_chunk(q); 2837 2837 - } 2838 2838 - s = s->next; 2839 2839 - } 2840 2840 - DEBUGF("max system bytes = %10zu\n", m->max_footprint); 2841 2841 - DEBUGF("system bytes = %10zu\n", m->footprint); 2842 2842 - DEBUGF("in use bytes = %10zu\n", used); 2843 2843 - } else { 2844 2844 - DEBUGF("malloc not initialized\n"); 2845 2845 - } 2846 2846 - 2847 2847 - POSTACTION(m); 2848 2848 - } 2849 2849 - } 2850 2850 - 2851 2851 - /* ----------------------- Operations on smallbins ----------------------- */ 2852 2852 - 2853 2853 - /* 2854 2854 - Various forms of linking and unlinking are defined as macros. Even 2855 2855 - the ones for trees, which are very long but have very short typical 2856 2856 - paths. This is ugly but reduces reliance on inlining support of 2857 2857 - compilers. 2858 2858 - */ 2859 2859 - 2860 2860 - /* Link a free chunk into a smallbin */ 2861 2861 - #define insert_small_chunk(M, P, S) {\ 2862 2862 - bindex_t I = small_index(S);\ 2863 2863 - mchunkptr B = smallbin_at(M, I);\ 2864 2864 - mchunkptr F = B;\ 2865 2865 - assert(S >= MIN_CHUNK_SIZE);\ 2866 2866 - if (!smallmap_is_marked(M, I))\ 2867 2867 - mark_smallmap(M, I);\ 2868 2868 - else if (RTCHECK(ok_address(M, B->fd)))\ 2869 2869 - F = B->fd;\ 2870 2870 - else {\ 2871 2871 - CORRUPTION_ERROR_ACTION(M);\ 2872 2872 - }\ 2873 2873 - B->fd = P;\ 2874 2874 - F->bk = P;\ 2875 2875 - P->fd = F;\ 2876 2876 - P->bk = B;\ 2877 2877 - } 2878 2878 - 2879 2879 - /* Unlink a chunk from a smallbin */ 2880 2880 - #define unlink_small_chunk(M, P, S) {\ 2881 2881 - mchunkptr F = P->fd;\ 2882 2882 - mchunkptr B = P->bk;\ 2883 2883 - bindex_t I = small_index(S);\ 2884 2884 - assert(P != B);\ 2885 2885 - assert(P != F);\ 2886 2886 - assert(chunksize(P) == small_index2size(I));\ 2887 2887 - if (F == B)\ 2888 2888 - clear_smallmap(M, I);\ 2889 2889 - else if (RTCHECK((F == smallbin_at(M,I) || ok_address(M, F)) &&\ 2890 2890 - (B == smallbin_at(M,I) || ok_address(M, B)))) {\ 2891 2891 - F->bk = B;\ 2892 2892 - B->fd = F;\ 2893 2893 - }\ 2894 2894 - else {\ 2895 2895 - CORRUPTION_ERROR_ACTION(M);\ 2896 2896 - }\ 2897 2897 - } 2898 2898 - 2899 2899 - /* Unlink the first chunk from a smallbin */ 2900 2900 - #define unlink_first_small_chunk(M, B, P, I) {\ 2901 2901 - mchunkptr F = P->fd;\ 2902 2902 - assert(P != B);\ 2903 2903 - assert(P != F);\ 2904 2904 - assert(chunksize(P) == small_index2size(I));\ 2905 2905 - if (B == F)\ 2906 2906 - clear_smallmap(M, I);\ 2907 2907 - else if (RTCHECK(ok_address(M, F))) {\ 2908 2908 - B->fd = F;\ 2909 2909 - F->bk = B;\ 2910 2910 - }\ 2911 2911 - else {\ 2912 2912 - CORRUPTION_ERROR_ACTION(M);\ 2913 2913 - }\ 2914 2914 - } 2915 2915 - 2916 2916 - /* Replace dv node, binning the old one */ 2917 2917 - /* Used only when dvsize known to be small */ 2918 2918 - #define replace_dv(M, P, S) {\ 2919 2919 - size_t DVS = M->dvsize;\ 2920 2920 - if (DVS != 0) {\ 2921 2921 - mchunkptr DV = M->dv;\ 2922 2922 - assert(is_small(DVS));\ 2923 2923 - insert_small_chunk(M, DV, DVS);\ 2924 2924 - }\ 2925 2925 - M->dvsize = S;\ 2926 2926 - M->dv = P;\ 2927 2927 - } 2928 2928 - 2929 2929 - /* ------------------------- Operations on trees ------------------------- */ 2930 2930 - 2931 2931 - /* Insert chunk into tree */ 2932 2932 - #define insert_large_chunk(M, X, S) {\ 2933 2933 - tbinptr* H;\ 2934 2934 - bindex_t I;\ 2935 2935 - compute_tree_index(S, I);\ 2936 2936 - H = treebin_at(M, I);\ 2937 2937 - X->index = I;\ 2938 2938 - X->child[0] = X->child[1] = 0;\ 2939 2939 - if (!treemap_is_marked(M, I)) {\ 2940 2940 - mark_treemap(M, I);\ 2941 2941 - *H = X;\ 2942 2942 - X->parent = (tchunkptr)H;\ 2943 2943 - X->fd = X->bk = X;\ 2944 2944 - }\ 2945 2945 - else {\ 2946 2946 - tchunkptr T = *H;\ 2947 2947 - size_t K = S << leftshift_for_tree_index(I);\ 2948 2948 - for (;;) {\ 2949 2949 - if (chunksize(T) != S) {\ 2950 2950 - tchunkptr* C = &(T->child[(K >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1]);\ 2951 2951 - K <<= 1;\ 2952 2952 - if (*C != 0)\ 2953 2953 - T = *C;\ 2954 2954 - else if (RTCHECK(ok_address(M, C))) {\ 2955 2955 - *C = X;\ 2956 2956 - X->parent = T;\ 2957 2957 - X->fd = X->bk = X;\ 2958 2958 - break;\ 2959 2959 - }\ 2960 2960 - else {\ 2961 2961 - CORRUPTION_ERROR_ACTION(M);\ 2962 2962 - break;\ 2963 2963 - }\ 2964 2964 - }\ 2965 2965 - else {\ 2966 2966 - tchunkptr F = T->fd;\ 2967 2967 - if (RTCHECK(ok_address(M, T) && ok_address(M, F))) {\ 2968 2968 - T->fd = F->bk = X;\ 2969 2969 - X->fd = F;\ 2970 2970 - X->bk = T;\ 2971 2971 - X->parent = 0;\ 2972 2972 - break;\ 2973 2973 - }\ 2974 2974 - else {\ 2975 2975 - CORRUPTION_ERROR_ACTION(M);\ 2976 2976 - break;\ 2977 2977 - }\ 2978 2978 - }\ 2979 2979 - }\ 2980 2980 - }\ 2981 2981 - } 2982 2982 - 2983 2983 - /* 2984 2984 - Unlink steps: 2985 2985 - 2986 2986 - 1. If x is a chained node, unlink it from its same-sized fd/bk links 2987 2987 - and choose its bk node as its replacement. 2988 2988 - 2. If x was the last node of its size, but not a leaf node, it must 2989 2989 - be replaced with a leaf node (not merely one with an open left or 2990 2990 - right), to make sure that lefts and rights of descendents 2991 2991 - correspond properly to bit masks. We use the rightmost descendent 2992 2992 - of x. We could use any other leaf, but this is easy to locate and 2993 2993 - tends to counteract removal of leftmosts elsewhere, and so keeps 2994 2994 - paths shorter than minimally guaranteed. This doesn't loop much 2995 2995 - because on average a node in a tree is near the bottom. 2996 2996 - 3. If x is the base of a chain (i.e., has parent links) relink 2997 2997 - x's parent and children to x's replacement (or null if none). 2998 2998 - */ 2999 2999 - 3000 3000 - #define unlink_large_chunk(M, X) {\ 3001 3001 - tchunkptr XP = X->parent;\ 3002 3002 - tchunkptr R;\ 3003 3003 - if (X->bk != X) {\ 3004 3004 - tchunkptr F = X->fd;\ 3005 3005 - R = X->bk;\ 3006 3006 - if (RTCHECK(ok_address(M, F))) {\ 3007 3007 - F->bk = R;\ 3008 3008 - R->fd = F;\ 3009 3009 - }\ 3010 3010 - else {\ 3011 3011 - CORRUPTION_ERROR_ACTION(M);\ 3012 3012 - }\ 3013 3013 - }\ 3014 3014 - else {\ 3015 3015 - tchunkptr* RP;\ 3016 3016 - if (((R = *(RP = &(X->child[1]))) != 0) ||\ 3017 3017 - ((R = *(RP = &(X->child[0]))) != 0)) {\ 3018 3018 - tchunkptr* CP;\ 3019 3019 - while ((*(CP = &(R->child[1])) != 0) ||\ 3020 3020 - (*(CP = &(R->child[0])) != 0)) {\ 3021 3021 - R = *(RP = CP);\ 3022 3022 - }\ 3023 3023 - if (RTCHECK(ok_address(M, RP)))\ 3024 3024 - *RP = 0;\ 3025 3025 - else {\ 3026 3026 - CORRUPTION_ERROR_ACTION(M);\ 3027 3027 - }\ 3028 3028 - }\ 3029 3029 - }\ 3030 3030 - if (XP != 0) {\ 3031 3031 - tbinptr* H = treebin_at(M, X->index);\ 3032 3032 - if (X == *H) {\ 3033 3033 - if ((*H = R) == 0) \ 3034 3034 - clear_treemap(M, X->index);\ 3035 3035 - }\ 3036 3036 - else if (RTCHECK(ok_address(M, XP))) {\ 3037 3037 - if (XP->child[0] == X) \ 3038 3038 - XP->child[0] = R;\ 3039 3039 - else \ 3040 3040 - XP->child[1] = R;\ 3041 3041 - }\ 3042 3042 - else\ 3043 3043 - CORRUPTION_ERROR_ACTION(M);\ 3044 3044 - if (R != 0) {\ 3045 3045 - if (RTCHECK(ok_address(M, R))) {\ 3046 3046 - tchunkptr C0, C1;\ 3047 3047 - R->parent = XP;\ 3048 3048 - if ((C0 = X->child[0]) != 0) {\ 3049 3049 - if (RTCHECK(ok_address(M, C0))) {\ 3050 3050 - R->child[0] = C0;\ 3051 3051 - C0->parent = R;\ 3052 3052 - }\ 3053 3053 - else\ 3054 3054 - CORRUPTION_ERROR_ACTION(M);\ 3055 3055 - }\ 3056 3056 - if ((C1 = X->child[1]) != 0) {\ 3057 3057 - if (RTCHECK(ok_address(M, C1))) {\ 3058 3058 - R->child[1] = C1;\ 3059 3059 - C1->parent = R;\ 3060 3060 - }\ 3061 3061 - else\ 3062 3062 - CORRUPTION_ERROR_ACTION(M);\ 3063 3063 - }\ 3064 3064 - }\ 3065 3065 - else\ 3066 3066 - CORRUPTION_ERROR_ACTION(M);\ 3067 3067 - }\ 3068 3068 - }\ 3069 3069 - } 3070 3070 - 3071 3071 - /* Relays to large vs small bin operations */ 3072 3072 - 3073 3073 - #define insert_chunk(M, P, S)\ 3074 3074 - if (is_small(S)) insert_small_chunk(M, P, S)\ 3075 3075 - else { tchunkptr TP = (tchunkptr)(P); insert_large_chunk(M, TP, S); } 3076 3076 - 3077 3077 - #define unlink_chunk(M, P, S)\ 3078 3078 - if (is_small(S)) unlink_small_chunk(M, P, S)\ 3079 3079 - else { tchunkptr TP = (tchunkptr)(P); unlink_large_chunk(M, TP); } 3080 3080 - 3081 3081 - 3082 3082 - /* Relays to internal calls to malloc/free from realloc, memalign etc */ 3083 3083 - 3084 3084 - #if ONLY_MSPACES 3085 3085 - #define internal_malloc(m, b) mspace_malloc(m, b) 3086 3086 - #define internal_free(m, mem) mspace_free(m,mem); 3087 3087 - #else /* ONLY_MSPACES */ 3088 3088 - #if MSPACES 3089 3089 - #define internal_malloc(m, b)\ 3090 3090 - (m == gm)? dlmalloc(b) : mspace_malloc(m, b) 3091 3091 - #define internal_free(m, mem)\ 3092 3092 - if (m == gm) dlfree(mem); else mspace_free(m,mem); 3093 3093 - #else /* MSPACES */ 3094 3094 - #define internal_malloc(m, b) dlmalloc(b) 3095 3095 - #define internal_free(m, mem) dlfree(mem) 3096 3096 - #endif /* MSPACES */ 3097 3097 - #endif /* ONLY_MSPACES */ 3098 3098 - 3099 3099 - /* ----------------------- Direct-mmapping chunks ----------------------- */ 3100 3100 - 3101 3101 - /* 3102 3102 - Directly mmapped chunks are set up with an offset to the start of 3103 3103 - the mmapped region stored in the prev_foot field of the chunk. This 3104 3104 - allows reconstruction of the required argument to MUNMAP when freed, 3105 3105 - and also allows adjustment of the returned chunk to meet alignment 3106 3106 - requirements (especially in memalign). There is also enough space 3107 3107 - allocated to hold a fake next chunk of size SIZE_T_SIZE to maintain 3108 3108 - the PINUSE bit so frees can be checked. 3109 3109 - */ 3110 3110 - 3111 3111 - /* Malloc using mmap */ 3112 3112 - static void* mmap_alloc(mstate m, size_t nb) { 3113 3113 - size_t mmsize = granularity_align(nb + SIX_SIZE_T_SIZES + CHUNK_ALIGN_MASK); 3114 3114 - if (mmsize > nb) { /* Check for wrap around 0 */ 3115 3115 - char* mm = (char*)(DIRECT_MMAP(mmsize)); 3116 3116 - if (mm != CMFAIL) { 3117 3117 - size_t offset = align_offset(chunk2mem(mm)); 3118 3118 - size_t psize = mmsize - offset - MMAP_FOOT_PAD; 3119 3119 - mchunkptr p = (mchunkptr)(mm + offset); 3120 3120 - p->prev_foot = offset | IS_MMAPPED_BIT; 3121 3121 - (p)->head = (psize|CINUSE_BIT); 3122 3122 - mark_inuse_foot(m, p, psize); 3123 3123 - chunk_plus_offset(p, psize)->head = FENCEPOST_HEAD; 3124 3124 - chunk_plus_offset(p, psize+SIZE_T_SIZE)->head = 0; 3125 3125 - 3126 3126 - if (mm < m->least_addr) 3127 3127 - m->least_addr = mm; 3128 3128 - if ((m->footprint += mmsize) > m->max_footprint) 3129 3129 - m->max_footprint = m->footprint; 3130 3130 - assert(is_aligned(chunk2mem(p))); 3131 3131 - check_mmapped_chunk(m, p); 3132 3132 - return chunk2mem(p); 3133 3133 - } 3134 3134 - } 3135 3135 - return 0; 3136 3136 - } 3137 3137 - 3138 3138 - /* Realloc using mmap */ 3139 3139 - static mchunkptr mmap_resize(mstate m, mchunkptr oldp, size_t nb) { 3140 3140 - size_t oldsize = chunksize(oldp); 3141 3141 - if (is_small(nb)) /* Can't shrink mmap regions below small size */ 3142 3142 - return 0; 3143 3143 - /* Keep old chunk if big enough but not too big */ 3144 3144 - if (oldsize >= nb + SIZE_T_SIZE && 3145 3145 - (oldsize - nb) <= (mparams.granularity << 1)) 3146 3146 - return oldp; 3147 3147 - else { 3148 3148 - size_t offset = oldp->prev_foot & ~IS_MMAPPED_BIT; 3149 3149 - size_t oldmmsize = oldsize + offset + MMAP_FOOT_PAD; 3150 3150 - size_t newmmsize = granularity_align(nb + SIX_SIZE_T_SIZES + 3151 3151 - CHUNK_ALIGN_MASK); 3152 3152 - char* cp = (char*)CALL_MREMAP((char*)oldp - offset, 3153 3153 - oldmmsize, newmmsize, 1); 3154 3154 - if (cp != CMFAIL) { 3155 3155 - mchunkptr newp = (mchunkptr)(cp + offset); 3156 3156 - size_t psize = newmmsize - offset - MMAP_FOOT_PAD; 3157 3157 - newp->head = (psize|CINUSE_BIT); 3158 3158 - mark_inuse_foot(m, newp, psize); 3159 3159 - chunk_plus_offset(newp, psize)->head = FENCEPOST_HEAD; 3160 3160 - chunk_plus_offset(newp, psize+SIZE_T_SIZE)->head = 0; 3161 3161 - 3162 3162 - if (cp < m->least_addr) 3163 3163 - m->least_addr = cp; 3164 3164 - if ((m->footprint += newmmsize - oldmmsize) > m->max_footprint) 3165 3165 - m->max_footprint = m->footprint; 3166 3166 - check_mmapped_chunk(m, newp); 3167 3167 - return newp; 3168 3168 - } 3169 3169 - } 3170 3170 - return 0; 3171 3171 - } 3172 3172 - 3173 3173 - /* -------------------------- mspace management -------------------------- */ 3174 3174 - 3175 3175 - /* Initialize top chunk and its size */ 3176 3176 - static void init_top(mstate m, mchunkptr p, size_t psize) { 3177 3177 - /* Ensure alignment */ 3178 3178 - size_t offset = align_offset(chunk2mem(p)); 3179 3179 - p = (mchunkptr)((char*)p + offset); 3180 3180 - psize -= offset; 3181 3181 - 3182 3182 - m->top = p; 3183 3183 - m->topsize = psize; 3184 3184 - p->head = psize | PINUSE_BIT; 3185 3185 - /* set size of fake trailing chunk holding overhead space only once */ 3186 3186 - chunk_plus_offset(p, psize)->head = TOP_FOOT_SIZE; 3187 3187 - m->trim_check = mparams.trim_threshold; /* reset on each update */ 3188 3188 - } 3189 3189 - 3190 3190 - /* Initialize bins for a new mstate that is otherwise zeroed out */ 3191 3191 - static void init_bins(mstate m) { 3192 3192 - /* Establish circular links for smallbins */ 3193 3193 - bindex_t i; 3194 3194 - for (i = 0; i < NSMALLBINS; ++i) { 3195 3195 - sbinptr bin = smallbin_at(m,i); 3196 3196 - bin->fd = bin->bk = bin; 3197 3197 - } 3198 3198 - } 3199 3199 - 3200 3200 - #if PROCEED_ON_ERROR 3201 3201 - 3202 3202 - /* default corruption action */ 3203 3203 - static void reset_on_error(mstate m) { 3204 3204 - int i; 3205 3205 - ++malloc_corruption_error_count; 3206 3206 - /* Reinitialize fields to forget about all memory */ 3207 3207 - m->smallbins = m->treebins = 0; 3208 3208 - m->dvsize = m->topsize = 0; 3209 3209 - m->seg.base = 0; 3210 3210 - m->seg.size = 0; 3211 3211 - m->seg.next = 0; 3212 3212 - m->top = m->dv = 0; 3213 3213 - for (i = 0; i < NTREEBINS; ++i) 3214 3214 - *treebin_at(m, i) = 0; 3215 3215 - init_bins(m); 3216 3216 - } 3217 3217 - #endif /* PROCEED_ON_ERROR */ 3218 3218 - 3219 3219 - /* Allocate chunk and prepend remainder with chunk in successor base. */ 3220 3220 - static void* prepend_alloc(mstate m, char* newbase, char* oldbase, 3221 3221 - size_t nb) { 3222 3222 - mchunkptr p = align_as_chunk(newbase); 3223 3223 - mchunkptr oldfirst = align_as_chunk(oldbase); 3224 3224 - size_t psize = (char*)oldfirst - (char*)p; 3225 3225 - mchunkptr q = chunk_plus_offset(p, nb); 3226 3226 - size_t qsize = psize - nb; 3227 3227 - set_size_and_pinuse_of_inuse_chunk(m, p, nb); 3228 3228 - 3229 3229 - assert((char*)oldfirst > (char*)q); 3230 3230 - assert(pinuse(oldfirst)); 3231 3231 - assert(qsize >= MIN_CHUNK_SIZE); 3232 3232 - 3233 3233 - /* consolidate remainder with first chunk of old base */ 3234 3234 - if (oldfirst == m->top) { 3235 3235 - size_t tsize = m->topsize += qsize; 3236 3236 - m->top = q; 3237 3237 - q->head = tsize | PINUSE_BIT; 3238 3238 - check_top_chunk(m, q); 3239 3239 - } 3240 3240 - else if (oldfirst == m->dv) { 3241 3241 - size_t dsize = m->dvsize += qsize; 3242 3242 - m->dv = q; 3243 3243 - set_size_and_pinuse_of_free_chunk(q, dsize); 3244 3244 - } 3245 3245 - else { 3246 3246 - if (!cinuse(oldfirst)) { 3247 3247 - size_t nsize = chunksize(oldfirst); 3248 3248 - unlink_chunk(m, oldfirst, nsize); 3249 3249 - oldfirst = chunk_plus_offset(oldfirst, nsize); 3250 3250 - qsize += nsize; 3251 3251 - } 3252 3252 - set_free_with_pinuse(q, qsize, oldfirst); 3253 3253 - insert_chunk(m, q, qsize); 3254 3254 - check_free_chunk(m, q); 3255 3255 - } 3256 3256 - 3257 3257 - check_malloced_chunk(m, chunk2mem(p), nb); 3258 3258 - return chunk2mem(p); 3259 3259 - } 3260 3260 - 3261 3261 - 3262 3262 - /* Add a segment to hold a new noncontiguous region */ 3263 3263 - static void add_segment(mstate m, char* tbase, size_t tsize, flag_t mmapped) { 3264 3264 - /* Determine locations and sizes of segment, fenceposts, old top */ 3265 3265 - char* old_top = (char*)m->top; 3266 3266 - msegmentptr oldsp = segment_holding(m, old_top); 3267 3267 - char* old_end = oldsp->base + oldsp->size; 3268 3268 - size_t ssize = pad_request(sizeof(struct malloc_segment)); 3269 3269 - char* rawsp = old_end - (ssize + FOUR_SIZE_T_SIZES + CHUNK_ALIGN_MASK); 3270 3270 - size_t offset = align_offset(chunk2mem(rawsp)); 3271 3271 - char* asp = rawsp + offset; 3272 3272 - char* csp = (asp < (old_top + MIN_CHUNK_SIZE))? old_top : asp; 3273 3273 - mchunkptr sp = (mchunkptr)csp; 3274 3274 - msegmentptr ss = (msegmentptr)(chunk2mem(sp)); 3275 3275 - mchunkptr tnext = chunk_plus_offset(sp, ssize); 3276 3276 - mchunkptr p = tnext; 3277 3277 - int nfences = 0; 3278 3278 - 3279 3279 - /* reset top to new space */ 3280 3280 - init_top(m, (mchunkptr)tbase, tsize - TOP_FOOT_SIZE); 3281 3281 - 3282 3282 - /* Set up segment record */ 3283 3283 - assert(is_aligned(ss)); 3284 3284 - set_size_and_pinuse_of_inuse_chunk(m, sp, ssize); 3285 3285 - *ss = m->seg; /* Push current record */ 3286 3286 - m->seg.base = tbase; 3287 3287 - m->seg.size = tsize; 3288 3288 - m->seg.sflags = mmapped; 3289 3289 - m->seg.next = ss; 3290 3290 - 3291 3291 - /* Insert trailing fenceposts */ 3292 3292 - for (;;) { 3293 3293 - mchunkptr nextp = chunk_plus_offset(p, SIZE_T_SIZE); 3294 3294 - p->head = FENCEPOST_HEAD; 3295 3295 - ++nfences; 3296 3296 - if ((char*)(&(nextp->head)) < old_end) 3297 3297 - p = nextp; 3298 3298 - else 3299 3299 - break; 3300 3300 - } 3301 3301 - assert(nfences >= 2); 3302 3302 - 3303 3303 - /* Insert the rest of old top into a bin as an ordinary free chunk */ 3304 3304 - if (csp != old_top) { 3305 3305 - mchunkptr q = (mchunkptr)old_top; 3306 3306 - size_t psize = csp - old_top; 3307 3307 - mchunkptr tn = chunk_plus_offset(q, psize); 3308 3308 - set_free_with_pinuse(q, psize, tn); 3309 3309 - insert_chunk(m, q, psize); 3310 3310 - } 3311 3311 - 3312 3312 - check_top_chunk(m, m->top); 3313 3313 - } 3314 3314 - 3315 3315 - /* -------------------------- System allocation -------------------------- */ 3316 3316 - 3317 3317 - /* Get memory from system using MORECORE or MMAP */ 3318 3318 - static void* sys_alloc(mstate m, size_t nb) { 3319 3319 - char* tbase = CMFAIL; 3320 3320 - size_t tsize = 0; 3321 3321 - flag_t mmap_flag = 0; 3322 3322 - 3323 3323 - init_mparams(); 3324 3324 - 3325 3325 - /* Directly map large chunks */ 3326 3326 - if (use_mmap(m) && nb >= mparams.mmap_threshold) { 3327 3327 - void* mem = mmap_alloc(m, nb); 3328 3328 - if (mem != 0) 3329 3329 - return mem; 3330 3330 - } 3331 3331 - 3332 3332 - /* 3333 3333 - Try getting memory in any of three ways (in most-preferred to 3334 3334 - least-preferred order): 3335 3335 - 1. A call to MORECORE that can normally contiguously extend memory. 3336 3336 - (disabled if not MORECORE_CONTIGUOUS or not HAVE_MORECORE or 3337 3337 - or main space is mmapped or a previous contiguous call failed) 3338 3338 - 2. A call to MMAP new space (disabled if not HAVE_MMAP). 3339 3339 - Note that under the default settings, if MORECORE is unable to 3340 3340 - fulfill a request, and HAVE_MMAP is true, then mmap is 3341 3341 - used as a noncontiguous system allocator. This is a useful backup 3342 3342 - strategy for systems with holes in address spaces -- in this case 3343 3343 - sbrk cannot contiguously expand the heap, but mmap may be able to 3344 3344 - find space. 3345 3345 - 3. A call to MORECORE that cannot usually contiguously extend memory. 3346 3346 - (disabled if not HAVE_MORECORE) 3347 3347 - */ 3348 3348 - 3349 3349 - if (MORECORE_CONTIGUOUS && !use_noncontiguous(m)) { 3350 3350 - char* br = CMFAIL; 3351 3351 - msegmentptr ss = (m->top == 0)? 0 : segment_holding(m, (char*)m->top); 3352 3352 - size_t asize = 0; 3353 3353 - ACQUIRE_MORECORE_LOCK(); 3354 3354 - 3355 3355 - if (ss == 0) { /* First time through or recovery */ 3356 3356 - char* base = (char*)CALL_MORECORE(0); 3357 3357 - if (base != CMFAIL) { 3358 3358 - asize = granularity_align(nb + TOP_FOOT_SIZE + SIZE_T_ONE); 3359 3359 - /* Adjust to end on a page boundary */ 3360 3360 - if (!is_page_aligned(base)) 3361 3361 - asize += (page_align((size_t)base) - (size_t)base); 3362 3362 - /* Can't call MORECORE if size is negative when treated as signed */ 3363 3363 - if (asize < HALF_MAX_SIZE_T && 3364 3364 - (br = (char*)(CALL_MORECORE(asize))) == base) { 3365 3365 - tbase = base; 3366 3366 - tsize = asize; 3367 3367 - } 3368 3368 - } 3369 3369 - } 3370 3370 - else { 3371 3371 - /* Subtract out existing available top space from MORECORE request. */ 3372 3372 - asize = granularity_align(nb - m->topsize + TOP_FOOT_SIZE + SIZE_T_ONE); 3373 3373 - /* Use mem here only if it did continuously extend old space */ 3374 3374 - if (asize < HALF_MAX_SIZE_T && 3375 3375 - (br = (char*)(CALL_MORECORE(asize))) == ss->base+ss->size) { 3376 3376 - tbase = br; 3377 3377 - tsize = asize; 3378 3378 - } 3379 3379 - } 3380 3380 - 3381 3381 - if (tbase == CMFAIL) { /* Cope with partial failure */ 3382 3382 - if (br != CMFAIL) { /* Try to use/extend the space we did get */ 3383 3383 - if (asize < HALF_MAX_SIZE_T && 3384 3384 - asize < nb + TOP_FOOT_SIZE + SIZE_T_ONE) { 3385 3385 - size_t esize = granularity_align(nb + TOP_FOOT_SIZE + SIZE_T_ONE - asize); 3386 3386 - if (esize < HALF_MAX_SIZE_T) { 3387 3387 - char* end = (char*)CALL_MORECORE(esize); 3388 3388 - if (end != CMFAIL) 3389 3389 - asize += esize; 3390 3390 - else { /* Can't use; try to release */ 3391 3391 - CALL_MORECORE(-asize); 3392 3392 - br = CMFAIL; 3393 3393 - } 3394 3394 - } 3395 3395 - } 3396 3396 - } 3397 3397 - if (br != CMFAIL) { /* Use the space we did get */ 3398 3398 - tbase = br; 3399 3399 - tsize = asize; 3400 3400 - } 3401 3401 - else 3402 3402 - disable_contiguous(m); /* Don't try contiguous path in the future */ 3403 3403 - } 3404 3404 - 3405 3405 - RELEASE_MORECORE_LOCK(); 3406 3406 - } 3407 3407 - 3408 3408 - if (HAVE_MMAP && tbase == CMFAIL) { /* Try MMAP */ 3409 3409 - size_t req = nb + TOP_FOOT_SIZE + SIZE_T_ONE; 3410 3410 - size_t rsize = granularity_align(req); 3411 3411 - if (rsize > nb) { /* Fail if wraps around zero */ 3412 3412 - char* mp = (char*)(CALL_MMAP(rsize)); 3413 3413 - if (mp != CMFAIL) { 3414 3414 - tbase = mp; 3415 3415 - tsize = rsize; 3416 3416 - mmap_flag = IS_MMAPPED_BIT; 3417 3417 - } 3418 3418 - } 3419 3419 - } 3420 3420 - 3421 3421 - if (HAVE_MORECORE && tbase == CMFAIL) { /* Try noncontiguous MORECORE */ 3422 3422 - size_t asize = granularity_align(nb + TOP_FOOT_SIZE + SIZE_T_ONE); 3423 3423 - if (asize < HALF_MAX_SIZE_T) { 3424 3424 - char* br = CMFAIL; 3425 3425 - char* end = CMFAIL; 3426 3426 - ACQUIRE_MORECORE_LOCK(); 3427 3427 - br = (char*)(CALL_MORECORE(asize)); 3428 3428 - end = (char*)(CALL_MORECORE(0)); 3429 3429 - RELEASE_MORECORE_LOCK(); 3430 3430 - if (br != CMFAIL && end != CMFAIL && br < end) { 3431 3431 - size_t ssize = end - br; 3432 3432 - if (ssize > nb + TOP_FOOT_SIZE) { 3433 3433 - tbase = br; 3434 3434 - tsize = ssize; 3435 3435 - } 3436 3436 - } 3437 3437 - } 3438 3438 - } 3439 3439 - 3440 3440 - if (tbase != CMFAIL) { 3441 3441 - 3442 3442 - if ((m->footprint += tsize) > m->max_footprint) 3443 3443 - m->max_footprint = m->footprint; 3444 3444 - 3445 3445 - if (!is_initialized(m)) { /* first-time initialization */ 3446 3446 - m->seg.base = m->least_addr = tbase; 3447 3447 - m->seg.size = tsize; 3448 3448 - m->seg.sflags = mmap_flag; 3449 3449 - m->magic = mparams.magic; 3450 3450 - init_bins(m); 3451 3451 - if (is_global(m)) 3452 3452 - init_top(m, (mchunkptr)tbase, tsize - TOP_FOOT_SIZE); 3453 3453 - else { 3454 3454 - /* Offset top by embedded malloc_state */ 3455 3455 - mchunkptr mn = next_chunk(mem2chunk(m)); 3456 3456 - init_top(m, mn, (size_t)((tbase + tsize) - (char*)mn) -TOP_FOOT_SIZE); 3457 3457 - } 3458 3458 - } 3459 3459 - 3460 3460 - else { 3461 3461 - /* Try to merge with an existing segment */ 3462 3462 - msegmentptr sp = &m->seg; 3463 3463 - while (sp != 0 && tbase != sp->base + sp->size) 3464 3464 - sp = sp->next; 3465 3465 - if (sp != 0 && 3466 3466 - !is_extern_segment(sp) && 3467 3467 - (sp->sflags & IS_MMAPPED_BIT) == mmap_flag && 3468 3468 - segment_holds(sp, m->top)) { /* append */ 3469 3469 - sp->size += tsize; 3470 3470 - init_top(m, m->top, m->topsize + tsize); 3471 3471 - } 3472 3472 - else { 3473 3473 - if (tbase < m->least_addr) 3474 3474 - m->least_addr = tbase; 3475 3475 - sp = &m->seg; 3476 3476 - while (sp != 0 && sp->base != tbase + tsize) 3477 3477 - sp = sp->next; 3478 3478 - if (sp != 0 && 3479 3479 - !is_extern_segment(sp) && 3480 3480 - (sp->sflags & IS_MMAPPED_BIT) == mmap_flag) { 3481 3481 - char* oldbase = sp->base; 3482 3482 - sp->base = tbase; 3483 3483 - sp->size += tsize; 3484 3484 - return prepend_alloc(m, tbase, oldbase, nb); 3485 3485 - } 3486 3486 - else 3487 3487 - add_segment(m, tbase, tsize, mmap_flag); 3488 3488 - } 3489 3489 - } 3490 3490 - 3491 3491 - if (nb < m->topsize) { /* Allocate from new or extended top space */ 3492 3492 - size_t rsize = m->topsize -= nb; 3493 3493 - mchunkptr p = m->top; 3494 3494 - mchunkptr r = m->top = chunk_plus_offset(p, nb); 3495 3495 - r->head = rsize | PINUSE_BIT; 3496 3496 - set_size_and_pinuse_of_inuse_chunk(m, p, nb); 3497 3497 - check_top_chunk(m, m->top); 3498 3498 - check_malloced_chunk(m, chunk2mem(p), nb); 3499 3499 - return chunk2mem(p); 3500 3500 - } 3501 3501 - } 3502 3502 - 3503 3503 - MALLOC_FAILURE_ACTION; 3504 3504 - return 0; 3505 3505 - } 3506 3506 - 3507 3507 - /* ----------------------- system deallocation -------------------------- */ 3508 3508 - 3509 3509 - /* Unmap and unlink any mmapped segments that don't contain used chunks */ 3510 3510 - static size_t release_unused_segments(mstate m) { 3511 3511 - size_t released = 0; 3512 3512 - msegmentptr pred = &m->seg; 3513 3513 - msegmentptr sp = pred->next; 3514 3514 - while (sp != 0) { 3515 3515 - char* base = sp->base; 3516 3516 - size_t size = sp->size; 3517 3517 - msegmentptr next = sp->next; 3518 3518 - if (is_mmapped_segment(sp) && !is_extern_segment(sp)) { 3519 3519 - mchunkptr p = align_as_chunk(base); 3520 3520 - size_t psize = chunksize(p); 3521 3521 - /* Can unmap if first chunk holds entire segment and not pinned */ 3522 3522 - if (!cinuse(p) && (char*)p + psize >= base + size - TOP_FOOT_SIZE) { 3523 3523 - tchunkptr tp = (tchunkptr)p; 3524 3524 - assert(segment_holds(sp, (char*)sp)); 3525 3525 - if (p == m->dv) { 3526 3526 - m->dv = 0; 3527 3527 - m->dvsize = 0; 3528 3528 - } 3529 3529 - else { 3530 3530 - unlink_large_chunk(m, tp); 3531 3531 - } 3532 3532 - if (CALL_MUNMAP(base, size) == 0) { 3533 3533 - released += size; 3534 3534 - m->footprint -= size; 3535 3535 - /* unlink obsoleted record */ 3536 3536 - sp = pred; 3537 3537 - sp->next = next; 3538 3538 - } 3539 3539 - else { /* back out if cannot unmap */ 3540 3540 - insert_large_chunk(m, tp, psize); 3541 3541 - } 3542 3542 - } 3543 3543 - } 3544 3544 - pred = sp; 3545 3545 - sp = next; 3546 3546 - } 3547 3547 - return released; 3548 3548 - } 3549 3549 - 3550 3550 - static int sys_trim(mstate m, size_t pad) { 3551 3551 - size_t released = 0; 3552 3552 - if (pad < MAX_REQUEST && is_initialized(m)) { 3553 3553 - pad += TOP_FOOT_SIZE; /* ensure enough room for segment overhead */ 3554 3554 - 3555 3555 - if (m->topsize > pad) { 3556 3556 - /* Shrink top space in granularity-size units, keeping at least one */ 3557 3557 - size_t unit = mparams.granularity; 3558 3558 - size_t extra = ((m->topsize - pad + (unit - SIZE_T_ONE)) / unit - 3559 3559 - SIZE_T_ONE) * unit; 3560 3560 - msegmentptr sp = segment_holding(m, (char*)m->top); 3561 3561 - 3562 3562 - if (!is_extern_segment(sp)) { 3563 3563 - if (is_mmapped_segment(sp)) { 3564 3564 - if (HAVE_MMAP && 3565 3565 - sp->size >= extra && 3566 3566 - !has_segment_link(m, sp)) { /* can't shrink if pinned */ 3567 3567 - // size_t newsize = sp->size - extra; 3568 3568 - /* Prefer mremap, fall back to munmap */ 3569 3569 - if ((CALL_MREMAP(sp->base, sp->size, newsize, 0) != MFAIL) || 3570 3570 - (CALL_MUNMAP(sp->base + newsize, extra) == 0)) { 3571 3571 - released = extra; 3572 3572 - } 3573 3573 - } 3574 3574 - } 3575 3575 - else if (HAVE_MORECORE) { 3576 3576 - if (extra >= HALF_MAX_SIZE_T) /* Avoid wrapping negative */ 3577 3577 - extra = (HALF_MAX_SIZE_T) + SIZE_T_ONE - unit; 3578 3578 - ACQUIRE_MORECORE_LOCK(); 3579 3579 - { 3580 3580 - /* Make sure end of memory is where we last set it. */ 3581 3581 - char* old_br = (char*)(CALL_MORECORE(0)); 3582 3582 - if (old_br == sp->base + sp->size) { 3583 3583 - char* rel_br = (char*)(CALL_MORECORE(-extra)); 3584 3584 - char* new_br = (char*)(CALL_MORECORE(0)); 3585 3585 - if (rel_br != CMFAIL && new_br < old_br) 3586 3586 - released = old_br - new_br; 3587 3587 - } 3588 3588 - } 3589 3589 - RELEASE_MORECORE_LOCK(); 3590 3590 - } 3591 3591 - } 3592 3592 - 3593 3593 - if (released != 0) { 3594 3594 - sp->size -= released; 3595 3595 - m->footprint -= released; 3596 3596 - init_top(m, m->top, m->topsize - released); 3597 3597 - check_top_chunk(m, m->top); 3598 3598 - } 3599 3599 - } 3600 3600 - 3601 3601 - /* Unmap any unused mmapped segments */ 3602 3602 - if (HAVE_MMAP) 3603 3603 - released += release_unused_segments(m); 3604 3604 - 3605 3605 - /* On failure, disable autotrim to avoid repeated failed future calls */ 3606 3606 - if (released == 0) 3607 3607 - m->trim_check = MAX_SIZE_T; 3608 3608 - } 3609 3609 - 3610 3610 - return (released != 0)? 1 : 0; 3611 3611 - } 3612 3612 - 3613 3613 - /* ---------------------------- malloc support --------------------------- */ 3614 3614 - 3615 3615 - /* allocate a large request from the best fitting chunk in a treebin */ 3616 3616 - static void* tmalloc_large(mstate m, size_t nb) { 3617 3617 - tchunkptr v = 0; 3618 3618 - size_t rsize = -nb; /* Unsigned negation */ 3619 3619 - tchunkptr t; 3620 3620 - bindex_t idx; 3621 3621 - compute_tree_index(nb, idx); 3622 3622 - 3623 3623 - if ((t = *treebin_at(m, idx)) != 0) { 3624 3624 - /* Traverse tree for this bin looking for node with size == nb */ 3625 3625 - size_t sizebits = nb << leftshift_for_tree_index(idx); 3626 3626 - tchunkptr rst = 0; /* The deepest untaken right subtree */ 3627 3627 - for (;;) { 3628 3628 - tchunkptr rt; 3629 3629 - size_t trem = chunksize(t) - nb; 3630 3630 - if (trem < rsize) { 3631 3631 - v = t; 3632 3632 - if ((rsize = trem) == 0) 3633 3633 - break; 3634 3634 - } 3635 3635 - rt = t->child[1]; 3636 3636 - t = t->child[(sizebits >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1]; 3637 3637 - if (rt != 0 && rt != t) 3638 3638 - rst = rt; 3639 3639 - if (t == 0) { 3640 3640 - t = rst; /* set t to least subtree holding sizes > nb */ 3641 3641 - break; 3642 3642 - } 3643 3643 - sizebits <<= 1; 3644 3644 - } 3645 3645 - } 3646 3646 - 3647 3647 - if (t == 0 && v == 0) { /* set t to root of next non-empty treebin */ 3648 3648 - binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; 3649 3649 - if (leftbits != 0) { 3650 3650 - bindex_t i; 3651 3651 - binmap_t leastbit = least_bit(leftbits); 3652 3652 - compute_bit2idx(leastbit, i); 3653 3653 - t = *treebin_at(m, i); 3654 3654 - } 3655 3655 - } 3656 3656 - 3657 3657 - while (t != 0) { /* find smallest of tree or subtree */ 3658 3658 - size_t trem = chunksize(t) - nb; 3659 3659 - if (trem < rsize) { 3660 3660 - rsize = trem; 3661 3661 - v = t; 3662 3662 - } 3663 3663 - t = leftmost_child(t); 3664 3664 - } 3665 3665 - 3666 3666 - /* If dv is a better fit, return 0 so malloc will use it */ 3667 3667 - if (v != 0 && rsize < (size_t)(m->dvsize - nb)) { 3668 3668 - if (RTCHECK(ok_address(m, v))) { /* split */ 3669 3669 - mchunkptr r = chunk_plus_offset(v, nb); 3670 3670 - assert(chunksize(v) == rsize + nb); 3671 3671 - if (RTCHECK(ok_next(v, r))) { 3672 3672 - unlink_large_chunk(m, v); 3673 3673 - if (rsize < MIN_CHUNK_SIZE) 3674 3674 - set_inuse_and_pinuse(m, v, (rsize + nb)); 3675 3675 - else { 3676 3676 - set_size_and_pinuse_of_inuse_chunk(m, v, nb); 3677 3677 - set_size_and_pinuse_of_free_chunk(r, rsize); 3678 3678 - insert_chunk(m, r, rsize); 3679 3679 - } 3680 3680 - return chunk2mem(v); 3681 3681 - } 3682 3682 - } 3683 3683 - CORRUPTION_ERROR_ACTION(m); 3684 3684 - } 3685 3685 - return 0; 3686 3686 - } 3687 3687 - 3688 3688 - /* allocate a small request from the best fitting chunk in a treebin */ 3689 3689 - static void* tmalloc_small(mstate m, size_t nb) { 3690 3690 - tchunkptr t, v; 3691 3691 - size_t rsize; 3692 3692 - bindex_t i; 3693 3693 - binmap_t leastbit = least_bit(m->treemap); 3694 3694 - compute_bit2idx(leastbit, i); 3695 3695 - 3696 3696 - v = t = *treebin_at(m, i); 3697 3697 - rsize = chunksize(t) - nb; 3698 3698 - 3699 3699 - while ((t = leftmost_child(t)) != 0) { 3700 3700 - size_t trem = chunksize(t) - nb; 3701 3701 - if (trem < rsize) { 3702 3702 - rsize = trem; 3703 3703 - v = t; 3704 3704 - } 3705 3705 - } 3706 3706 - 3707 3707 - if (RTCHECK(ok_address(m, v))) { 3708 3708 - mchunkptr r = chunk_plus_offset(v, nb); 3709 3709 - assert(chunksize(v) == rsize + nb); 3710 3710 - if (RTCHECK(ok_next(v, r))) { 3711 3711 - unlink_large_chunk(m, v); 3712 3712 - if (rsize < MIN_CHUNK_SIZE) 3713 3713 - set_inuse_and_pinuse(m, v, (rsize + nb)); 3714 3714 - else { 3715 3715 - set_size_and_pinuse_of_inuse_chunk(m, v, nb); 3716 3716 - set_size_and_pinuse_of_free_chunk(r, rsize); 3717 3717 - replace_dv(m, r, rsize); 3718 3718 - } 3719 3719 - return chunk2mem(v); 3720 3720 - } 3721 3721 - } 3722 3722 - 3723 3723 - CORRUPTION_ERROR_ACTION(m); 3724 3724 - return 0; 3725 3725 - } 3726 3726 - 3727 3727 - /* --------------------------- realloc support --------------------------- */ 3728 3728 - 3729 3729 - static void* internal_realloc(mstate m, void* oldmem, size_t bytes) { 3730 3730 - if (bytes >= MAX_REQUEST) { 3731 3731 - MALLOC_FAILURE_ACTION; 3732 3732 - return 0; 3733 3733 - } 3734 3734 - if (!PREACTION(m)) { 3735 3735 - mchunkptr oldp = mem2chunk(oldmem); 3736 3736 - size_t oldsize = chunksize(oldp); 3737 3737 - mchunkptr next = chunk_plus_offset(oldp, oldsize); 3738 3738 - mchunkptr newp = 0; 3739 3739 - void* extra = 0; 3740 3740 - 3741 3741 - /* Try to either shrink or extend into top. Else malloc-copy-free */ 3742 3742 - 3743 3743 - if (RTCHECK(ok_address(m, oldp) && ok_cinuse(oldp) && 3744 3744 - ok_next(oldp, next) && ok_pinuse(next))) { 3745 3745 - size_t nb = request2size(bytes); 3746 3746 - if (is_mmapped(oldp)) 3747 3747 - newp = mmap_resize(m, oldp, nb); 3748 3748 - else if (oldsize >= nb) { /* already big enough */ 3749 3749 - size_t rsize = oldsize - nb; 3750 3750 - newp = oldp; 3751 3751 - if (rsize >= MIN_CHUNK_SIZE) { 3752 3752 - mchunkptr remainder = chunk_plus_offset(newp, nb); 3753 3753 - set_inuse(m, newp, nb); 3754 3754 - set_inuse(m, remainder, rsize); 3755 3755 - extra = chunk2mem(remainder); 3756 3756 - } 3757 3757 - } 3758 3758 - else if (next == m->top && oldsize + m->topsize > nb) { 3759 3759 - /* Expand into top */ 3760 3760 - size_t newsize = oldsize + m->topsize; 3761 3761 - size_t newtopsize = newsize - nb; 3762 3762 - mchunkptr newtop = chunk_plus_offset(oldp, nb); 3763 3763 - set_inuse(m, oldp, nb); 3764 3764 - newtop->head = newtopsize |PINUSE_BIT; 3765 3765 - m->top = newtop; 3766 3766 - m->topsize = newtopsize; 3767 3767 - newp = oldp; 3768 3768 - } 3769 3769 - } 3770 3770 - else { 3771 3771 - USAGE_ERROR_ACTION(m, oldmem); 3772 3772 - POSTACTION(m); 3773 3773 - return 0; 3774 3774 - } 3775 3775 - 3776 3776 - POSTACTION(m); 3777 3777 - 3778 3778 - if (newp != 0) { 3779 3779 - if (extra != 0) { 3780 3780 - internal_free(m, extra); 3781 3781 - } 3782 3782 - check_inuse_chunk(m, newp); 3783 3783 - return chunk2mem(newp); 3784 3784 - } 3785 3785 - else { 3786 3786 - void* newmem = internal_malloc(m, bytes); 3787 3787 - if (newmem != 0) { 3788 3788 - size_t oc = oldsize - overhead_for(oldp); 3789 3789 - memcpy(newmem, oldmem, (oc < bytes)? oc : bytes); 3790 3790 - internal_free(m, oldmem); 3791 3791 - } 3792 3792 - return newmem; 3793 3793 - } 3794 3794 - } 3795 3795 - return 0; 3796 3796 - } 3797 3797 - 3798 3798 - /* --------------------------- memalign support -------------------------- */ 3799 3799 - 3800 3800 - static void* internal_memalign(mstate m, size_t alignment, size_t bytes) { 3801 3801 - if (alignment <= MALLOC_ALIGNMENT) /* Can just use malloc */ 3802 3802 - return internal_malloc(m, bytes); 3803 3803 - if (alignment < MIN_CHUNK_SIZE) /* must be at least a minimum chunk size */ 3804 3804 - alignment = MIN_CHUNK_SIZE; 3805 3805 - if ((alignment & (alignment-SIZE_T_ONE)) != 0) {/* Ensure a power of 2 */ 3806 3806 - size_t a = MALLOC_ALIGNMENT << 1; 3807 3807 - while (a < alignment) a <<= 1; 3808 3808 - alignment = a; 3809 3809 - } 3810 3810 - 3811 3811 - if (bytes >= MAX_REQUEST - alignment) { 3812 3812 - if (m != 0) { /* Test isn't needed but avoids compiler warning */ 3813 3813 - MALLOC_FAILURE_ACTION; 3814 3814 - } 3815 3815 - } 3816 3816 - else { 3817 3817 - size_t nb = request2size(bytes); 3818 3818 - size_t req = nb + alignment + MIN_CHUNK_SIZE - CHUNK_OVERHEAD; 3819 3819 - char* mem = (char*)internal_malloc(m, req); 3820 3820 - if (mem != 0) { 3821 3821 - void* leader = 0; 3822 3822 - void* trailer = 0; 3823 3823 - mchunkptr p = mem2chunk(mem); 3824 3824 - 3825 3825 - if (PREACTION(m)) return 0; 3826 3826 - if ((((size_t)(mem)) % alignment) != 0) { /* misaligned */ 3827 3827 - /* 3828 3828 - Find an aligned spot inside chunk. Since we need to give 3829 3829 - back leading space in a chunk of at least MIN_CHUNK_SIZE, if 3830 3830 - the first calculation places us at a spot with less than 3831 3831 - MIN_CHUNK_SIZE leader, we can move to the next aligned spot. 3832 3832 - We've allocated enough total room so that this is always 3833 3833 - possible. 3834 3834 - */ 3835 3835 - char* br = (char*)mem2chunk((size_t)(((size_t)(mem + 3836 3836 - alignment - 3837 3837 - SIZE_T_ONE)) & 3838 3838 - -alignment)); 3839 3839 - char* pos = ((size_t)(br - (char*)(p)) >= MIN_CHUNK_SIZE)? 3840 3840 - br : br+alignment; 3841 3841 - mchunkptr newp = (mchunkptr)pos; 3842 3842 - size_t leadsize = pos - (char*)(p); 3843 3843 - size_t newsize = chunksize(p) - leadsize; 3844 3844 - 3845 3845 - if (is_mmapped(p)) { /* For mmapped chunks, just adjust offset */ 3846 3846 - newp->prev_foot = p->prev_foot + leadsize; 3847 3847 - newp->head = (newsize|CINUSE_BIT); 3848 3848 - } 3849 3849 - else { /* Otherwise, give back leader, use the rest */ 3850 3850 - set_inuse(m, newp, newsize); 3851 3851 - set_inuse(m, p, leadsize); 3852 3852 - leader = chunk2mem(p); 3853 3853 - } 3854 3854 - p = newp; 3855 3855 - } 3856 3856 - 3857 3857 - /* Give back spare room at the end */ 3858 3858 - if (!is_mmapped(p)) { 3859 3859 - size_t size = chunksize(p); 3860 3860 - if (size > nb + MIN_CHUNK_SIZE) { 3861 3861 - size_t remainder_size = size - nb; 3862 3862 - mchunkptr remainder = chunk_plus_offset(p, nb); 3863 3863 - set_inuse(m, p, nb); 3864 3864 - set_inuse(m, remainder, remainder_size); 3865 3865 - trailer = chunk2mem(remainder); 3866 3866 - } 3867 3867 - } 3868 3868 - 3869 3869 - assert (chunksize(p) >= nb); 3870 3870 - assert((((size_t)(chunk2mem(p))) % alignment) == 0); 3871 3871 - check_inuse_chunk(m, p); 3872 3872 - POSTACTION(m); 3873 3873 - if (leader != 0) { 3874 3874 - internal_free(m, leader); 3875 3875 - } 3876 3876 - if (trailer != 0) { 3877 3877 - internal_free(m, trailer); 3878 3878 - } 3879 3879 - return chunk2mem(p); 3880 3880 - } 3881 3881 - } 3882 3882 - return 0; 3883 3883 - } 3884 3884 - 3885 3885 - /* ------------------------ comalloc/coalloc support --------------------- */ 3886 3886 - 3887 3887 - static void** ialloc(mstate m, 3888 3888 - size_t n_elements, 3889 3889 - size_t* sizes, 3890 3890 - int opts, 3891 3891 - void* chunks[]) { 3892 3892 - /* 3893 3893 - This provides common support for independent_X routines, handling 3894 3894 - all of the combinations that can result. 3895 3895 - 3896 3896 - The opts arg has: 3897 3897 - bit 0 set if all elements are same size (using sizes[0]) 3898 3898 - bit 1 set if elements should be zeroed 3899 3899 - */ 3900 3900 - 3901 3901 - size_t element_size; /* chunksize of each element, if all same */ 3902 3902 - size_t contents_size; /* total size of elements */ 3903 3903 - size_t array_size; /* request size of pointer array */ 3904 3904 - void* mem; /* malloced aggregate space */ 3905 3905 - mchunkptr p; /* corresponding chunk */ 3906 3906 - size_t remainder_size; /* remaining bytes while splitting */ 3907 3907 - void** marray; /* either "chunks" or malloced ptr array */ 3908 3908 - mchunkptr array_chunk; /* chunk for malloced ptr array */ 3909 3909 - flag_t was_enabled; /* to disable mmap */ 3910 3910 - size_t size; 3911 3911 - size_t i; 3912 3912 - 3913 3913 - /* compute array length, if needed */ 3914 3914 - if (chunks != 0) { 3915 3915 - if (n_elements == 0) 3916 3916 - return chunks; /* nothing to do */ 3917 3917 - marray = chunks; 3918 3918 - array_size = 0; 3919 3919 - } 3920 3920 - else { 3921 3921 - /* if empty req, must still return chunk representing empty array */ 3922 3922 - if (n_elements == 0) 3923 3923 - return (void**)internal_malloc(m, 0); 3924 3924 - marray = 0; 3925 3925 - array_size = request2size(n_elements * (sizeof(void*))); 3926 3926 - } 3927 3927 - 3928 3928 - /* compute total element size */ 3929 3929 - if (opts & 0x1) { /* all-same-size */ 3930 3930 - element_size = request2size(*sizes); 3931 3931 - contents_size = n_elements * element_size; 3932 3932 - } 3933 3933 - else { /* add up all the sizes */ 3934 3934 - element_size = 0; 3935 3935 - contents_size = 0; 3936 3936 - for (i = 0; i != n_elements; ++i) 3937 3937 - contents_size += request2size(sizes[i]); 3938 3938 - } 3939 3939 - 3940 3940 - size = contents_size + array_size; 3941 3941 - 3942 3942 - /* 3943 3943 - Allocate the aggregate chunk. First disable direct-mmapping so 3944 3944 - malloc won't use it, since we would not be able to later 3945 3945 - free/realloc space internal to a segregated mmap region. 3946 3946 - */ 3947 3947 - was_enabled = use_mmap(m); 3948 3948 - disable_mmap(m); 3949 3949 - mem = internal_malloc(m, size - CHUNK_OVERHEAD); 3950 3950 - if (was_enabled) 3951 3951 - enable_mmap(m); 3952 3952 - if (mem == 0) 3953 3953 - return 0; 3954 3954 - 3955 3955 - if (PREACTION(m)) return 0; 3956 3956 - p = mem2chunk(mem); 3957 3957 - remainder_size = chunksize(p); 3958 3958 - 3959 3959 - assert(!is_mmapped(p)); 3960 3960 - 3961 3961 - if (opts & 0x2) { /* optionally clear the elements */ 3962 3962 - memset((size_t*)mem, 0, remainder_size - SIZE_T_SIZE - array_size); 3963 3963 - } 3964 3964 - 3965 3965 - /* If not provided, allocate the pointer array as final part of chunk */ 3966 3966 - if (marray == 0) { 3967 3967 - size_t array_chunk_size; 3968 3968 - array_chunk = chunk_plus_offset(p, contents_size); 3969 3969 - array_chunk_size = remainder_size - contents_size; 3970 3970 - marray = (void**) (chunk2mem(array_chunk)); 3971 3971 - set_size_and_pinuse_of_inuse_chunk(m, array_chunk, array_chunk_size); 3972 3972 - remainder_size = contents_size; 3973 3973 - } 3974 3974 - 3975 3975 - /* split out elements */ 3976 3976 - for (i = 0; ; ++i) { 3977 3977 - marray[i] = chunk2mem(p); 3978 3978 - if (i != n_elements-1) { 3979 3979 - if (element_size != 0) 3980 3980 - size = element_size; 3981 3981 - else 3982 3982 - size = request2size(sizes[i]); 3983 3983 - remainder_size -= size; 3984 3984 - set_size_and_pinuse_of_inuse_chunk(m, p, size); 3985 3985 - p = chunk_plus_offset(p, size); 3986 3986 - } 3987 3987 - else { /* the final element absorbs any overallocation slop */ 3988 3988 - set_size_and_pinuse_of_inuse_chunk(m, p, remainder_size); 3989 3989 - break; 3990 3990 - } 3991 3991 - } 3992 3992 - 3993 3993 - #ifdef DEBUG 3994 3994 - if (marray != chunks) { 3995 3995 - /* final element must have exactly exhausted chunk */ 3996 3996 - if (element_size != 0) { 3997 3997 - assert(remainder_size == element_size); 3998 3998 - } 3999 3999 - else { 4000 4000 - assert(remainder_size == request2size(sizes[i])); 4001 4001 - } 4002 4002 - check_inuse_chunk(m, mem2chunk(marray)); 4003 4003 - } 4004 4004 - for (i = 0; i != n_elements; ++i) 4005 4005 - check_inuse_chunk(m, mem2chunk(marray[i])); 4006 4006 - 4007 4007 - #endif /* DEBUG */ 4008 4008 - 4009 4009 - POSTACTION(m); 4010 4010 - return marray; 4011 4011 - } 4012 4012 - 4013 4013 - 4014 4014 - /* -------------------------- public routines ---------------------------- */ 4015 4015 - 4016 4016 - #if !ONLY_MSPACES 4017 4017 - 4018 4018 - void* dlmalloc(size_t bytes) { 4019 4019 - /* 4020 4020 - Basic algorithm: 4021 4021 - If a small request (< 256 bytes minus per-chunk overhead): 4022 4022 - 1. If one exists, use a remainderless chunk in associated smallbin. 4023 4023 - (Remainderless means that there are too few excess bytes to 4024 4024 - represent as a chunk.) 4025 4025 - 2. If it is big enough, use the dv chunk, which is normally the 4026 4026 - chunk adjacent to the one used for the most recent small request. 4027 4027 - 3. If one exists, split the smallest available chunk in a bin, 4028 4028 - saving remainder in dv. 4029 4029 - 4. If it is big enough, use the top chunk. 4030 4030 - 5. If available, get memory from system and use it 4031 4031 - Otherwise, for a large request: 4032 4032 - 1. Find the smallest available binned chunk that fits, and use it 4033 4033 - if it is better fitting than dv chunk, splitting if necessary. 4034 4034 - 2. If better fitting than any binned chunk, use the dv chunk. 4035 4035 - 3. If it is big enough, use the top chunk. 4036 4036 - 4. If request size >= mmap threshold, try to directly mmap this chunk. 4037 4037 - 5. If available, get memory from system and use it 4038 4038 - 4039 4039 - The ugly goto's here ensure that postaction occurs along all paths. 4040 4040 - */ 4041 4041 - 4042 4042 - if (!PREACTION(gm)) { 4043 4043 - void* mem; 4044 4044 - size_t nb; 4045 4045 - if (bytes <= MAX_SMALL_REQUEST) { 4046 4046 - bindex_t idx; 4047 4047 - binmap_t smallbits; 4048 4048 - nb = (bytes < MIN_REQUEST)? MIN_CHUNK_SIZE : pad_request(bytes); 4049 4049 - idx = small_index(nb); 4050 4050 - smallbits = gm->smallmap >> idx; 4051 4051 - 4052 4052 - if ((smallbits & 0x3U) != 0) { /* Remainderless fit to a smallbin. */ 4053 4053 - mchunkptr b, p; 4054 4054 - idx += ~smallbits & 1; /* Uses next bin if idx empty */ 4055 4055 - b = smallbin_at(gm, idx); 4056 4056 - p = b->fd; 4057 4057 - assert(chunksize(p) == small_index2size(idx)); 4058 4058 - unlink_first_small_chunk(gm, b, p, idx); 4059 4059 - set_inuse_and_pinuse(gm, p, small_index2size(idx)); 4060 4060 - mem = chunk2mem(p); 4061 4061 - check_malloced_chunk(gm, mem, nb); 4062 4062 - goto postaction; 4063 4063 - } 4064 4064 - 4065 4065 - else if (nb > gm->dvsize) { 4066 4066 - if (smallbits != 0) { /* Use chunk in next nonempty smallbin */ 4067 4067 - mchunkptr b, p, r; 4068 4068 - size_t rsize; 4069 4069 - bindex_t i; 4070 4070 - binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); 4071 4071 - binmap_t leastbit = least_bit(leftbits); 4072 4072 - compute_bit2idx(leastbit, i); 4073 4073 - b = smallbin_at(gm, i); 4074 4074 - p = b->fd; 4075 4075 - assert(chunksize(p) == small_index2size(i)); 4076 4076 - unlink_first_small_chunk(gm, b, p, i); 4077 4077 - rsize = small_index2size(i) - nb; 4078 4078 - /* Fit here cannot be remainderless if 4byte sizes */ 4079 4079 - if (SIZE_T_SIZE != 4 && rsize < MIN_CHUNK_SIZE) 4080 4080 - set_inuse_and_pinuse(gm, p, small_index2size(i)); 4081 4081 - else { 4082 4082 - set_size_and_pinuse_of_inuse_chunk(gm, p, nb); 4083 4083 - r = chunk_plus_offset(p, nb); 4084 4084 - set_size_and_pinuse_of_free_chunk(r, rsize); 4085 4085 - replace_dv(gm, r, rsize); 4086 4086 - } 4087 4087 - mem = chunk2mem(p); 4088 4088 - check_malloced_chunk(gm, mem, nb); 4089 4089 - goto postaction; 4090 4090 - } 4091 4091 - 4092 4092 - else if (gm->treemap != 0 && (mem = tmalloc_small(gm, nb)) != 0) { 4093 4093 - check_malloced_chunk(gm, mem, nb); 4094 4094 - goto postaction; 4095 4095 - } 4096 4096 - } 4097 4097 - } 4098 4098 - else if (bytes >= MAX_REQUEST) 4099 4099 - nb = MAX_SIZE_T; /* Too big to allocate. Force failure (in sys alloc) */ 4100 4100 - else { 4101 4101 - nb = pad_request(bytes); 4102 4102 - if (gm->treemap != 0 && (mem = tmalloc_large(gm, nb)) != 0) { 4103 4103 - check_malloced_chunk(gm, mem, nb); 4104 4104 - goto postaction; 4105 4105 - } 4106 4106 - } 4107 4107 - 4108 4108 - if (nb <= gm->dvsize) { 4109 4109 - size_t rsize = gm->dvsize - nb; 4110 4110 - mchunkptr p = gm->dv; 4111 4111 - if (rsize >= MIN_CHUNK_SIZE) { /* split dv */ 4112 4112 - mchunkptr r = gm->dv = chunk_plus_offset(p, nb); 4113 4113 - gm->dvsize = rsize; 4114 4114 - set_size_and_pinuse_of_free_chunk(r, rsize); 4115 4115 - set_size_and_pinuse_of_inuse_chunk(gm, p, nb); 4116 4116 - } 4117 4117 - else { /* exhaust dv */ 4118 4118 - size_t dvs = gm->dvsize; 4119 4119 - gm->dvsize = 0; 4120 4120 - gm->dv = 0; 4121 4121 - set_inuse_and_pinuse(gm, p, dvs); 4122 4122 - } 4123 4123 - mem = chunk2mem(p); 4124 4124 - check_malloced_chunk(gm, mem, nb); 4125 4125 - goto postaction; 4126 4126 - } 4127 4127 - 4128 4128 - else if (nb < gm->topsize) { /* Split top */ 4129 4129 - size_t rsize = gm->topsize -= nb; 4130 4130 - mchunkptr p = gm->top; 4131 4131 - mchunkptr r = gm->top = chunk_plus_offset(p, nb); 4132 4132 - r->head = rsize | PINUSE_BIT; 4133 4133 - set_size_and_pinuse_of_inuse_chunk(gm, p, nb); 4134 4134 - mem = chunk2mem(p); 4135 4135 - check_top_chunk(gm, gm->top); 4136 4136 - check_malloced_chunk(gm, mem, nb); 4137 4137 - goto postaction; 4138 4138 - } 4139 4139 - 4140 4140 - mem = sys_alloc(gm, nb); 4141 4141 - 4142 4142 - postaction: 4143 4143 - POSTACTION(gm); 4144 4144 - return mem; 4145 4145 - } 4146 4146 - 4147 4147 - return 0; 4148 4148 - } 4149 4149 - 4150 4150 - void dlfree(void* mem) { 4151 4151 - /* 4152 4152 - Consolidate freed chunks with preceeding or succeeding bordering 4153 4153 - free chunks, if they exist, and then place in a bin. Intermixed 4154 4154 - with special cases for top, dv, mmapped chunks, and usage errors. 4155 4155 - */ 4156 4156 - 4157 4157 - if (mem != 0) { 4158 4158 - mchunkptr p = mem2chunk(mem); 4159 4159 - #if FOOTERS 4160 4160 - mstate fm = get_mstate_for(p); 4161 4161 - if (!ok_magic(fm)) { 4162 4162 - USAGE_ERROR_ACTION(fm, p); 4163 4163 - return; 4164 4164 - } 4165 4165 - #else /* FOOTERS */ 4166 4166 - #define fm gm 4167 4167 - #endif /* FOOTERS */ 4168 4168 - if (!PREACTION(fm)) { 4169 4169 - check_inuse_chunk(fm, p); 4170 4170 - if (RTCHECK(ok_address(fm, p) && ok_cinuse(p))) { 4171 4171 - size_t psize = chunksize(p); 4172 4172 - mchunkptr next = chunk_plus_offset(p, psize); 4173 4173 - if (!pinuse(p)) { 4174 4174 - size_t prevsize = p->prev_foot; 4175 4175 - if ((prevsize & IS_MMAPPED_BIT) != 0) { 4176 4176 - prevsize &= ~IS_MMAPPED_BIT; 4177 4177 - psize += prevsize + MMAP_FOOT_PAD; 4178 4178 - if (CALL_MUNMAP((char*)p - prevsize, psize) == 0) 4179 4179 - fm->footprint -= psize; 4180 4180 - goto postaction; 4181 4181 - } 4182 4182 - else { 4183 4183 - mchunkptr prev = chunk_minus_offset(p, prevsize); 4184 4184 - psize += prevsize; 4185 4185 - p = prev; 4186 4186 - if (RTCHECK(ok_address(fm, prev))) { /* consolidate backward */ 4187 4187 - if (p != fm->dv) { 4188 4188 - unlink_chunk(fm, p, prevsize); 4189 4189 - } 4190 4190 - else if ((next->head & INUSE_BITS) == INUSE_BITS) { 4191 4191 - fm->dvsize = psize; 4192 4192 - set_free_with_pinuse(p, psize, next); 4193 4193 - goto postaction; 4194 4194 - } 4195 4195 - } 4196 4196 - else 4197 4197 - goto erroraction; 4198 4198 - } 4199 4199 - } 4200 4200 - 4201 4201 - if (RTCHECK(ok_next(p, next) && ok_pinuse(next))) { 4202 4202 - if (!cinuse(next)) { /* consolidate forward */ 4203 4203 - if (next == fm->top) { 4204 4204 - size_t tsize = fm->topsize += psize; 4205 4205 - fm->top = p; 4206 4206 - p->head = tsize | PINUSE_BIT; 4207 4207 - if (p == fm->dv) { 4208 4208 - fm->dv = 0; 4209 4209 - fm->dvsize = 0; 4210 4210 - } 4211 4211 - if (should_trim(fm, tsize)) 4212 4212 - sys_trim(fm, 0); 4213 4213 - goto postaction; 4214 4214 - } 4215 4215 - else if (next == fm->dv) { 4216 4216 - size_t dsize = fm->dvsize += psize; 4217 4217 - fm->dv = p; 4218 4218 - set_size_and_pinuse_of_free_chunk(p, dsize); 4219 4219 - goto postaction; 4220 4220 - } 4221 4221 - else { 4222 4222 - size_t nsize = chunksize(next); 4223 4223 - psize += nsize; 4224 4224 - unlink_chunk(fm, next, nsize); 4225 4225 - set_size_and_pinuse_of_free_chunk(p, psize); 4226 4226 - if (p == fm->dv) { 4227 4227 - fm->dvsize = psize; 4228 4228 - goto postaction; 4229 4229 - } 4230 4230 - } 4231 4231 - } 4232 4232 - else 4233 4233 - set_free_with_pinuse(p, psize, next); 4234 4234 - insert_chunk(fm, p, psize); 4235 4235 - check_free_chunk(fm, p); 4236 4236 - goto postaction; 4237 4237 - } 4238 4238 - } 4239 4239 - erroraction: 4240 4240 - USAGE_ERROR_ACTION(fm, p); 4241 4241 - postaction: 4242 4242 - POSTACTION(fm); 4243 4243 - } 4244 4244 - } 4245 4245 - #if !FOOTERS 4246 4246 - #undef fm 4247 4247 - #endif /* FOOTERS */ 4248 4248 - } 4249 4249 - 4250 4250 - void* dlcalloc(size_t n_elements, size_t elem_size) { 4251 4251 - void* mem; 4252 4252 - size_t req = 0; 4253 4253 - if (n_elements != 0) { 4254 4254 - req = n_elements * elem_size; 4255 4255 - if (((n_elements | elem_size) & ~(size_t)0xffff) && 4256 4256 - (req / n_elements != elem_size)) 4257 4257 - req = MAX_SIZE_T; /* force downstream failure on overflow */ 4258 4258 - } 4259 4259 - mem = dlmalloc(req); 4260 4260 - if (mem != 0 && calloc_must_clear(mem2chunk(mem))) 4261 4261 - memset(mem, 0, req); 4262 4262 - return mem; 4263 4263 - } 4264 4264 - 4265 4265 - void* dlrealloc(void* oldmem, size_t bytes) { 4266 4266 - if (oldmem == 0) 4267 4267 - return dlmalloc(bytes); 4268 4268 - #ifdef REALLOC_ZERO_BYTES_FREES 4269 4269 - if (bytes == 0) { 4270 4270 - dlfree(oldmem); 4271 4271 - return 0; 4272 4272 - } 4273 4273 - #endif /* REALLOC_ZERO_BYTES_FREES */ 4274 4274 - else { 4275 4275 - #if ! FOOTERS 4276 4276 - mstate m = gm; 4277 4277 - #else /* FOOTERS */ 4278 4278 - mstate m = get_mstate_for(mem2chunk(oldmem)); 4279 4279 - if (!ok_magic(m)) { 4280 4280 - USAGE_ERROR_ACTION(m, oldmem); 4281 4281 - return 0; 4282 4282 - } 4283 4283 - #endif /* FOOTERS */ 4284 4284 - return internal_realloc(m, oldmem, bytes); 4285 4285 - } 4286 4286 - } 4287 4287 - 4288 4288 - void* dlmemalign(size_t alignment, size_t bytes) { 4289 4289 - return internal_memalign(gm, alignment, bytes); 4290 4290 - } 4291 4291 - 4292 4292 - void** dlindependent_calloc(size_t n_elements, size_t elem_size, 4293 4293 - void* chunks[]) { 4294 4294 - size_t sz = elem_size; /* serves as 1-element array */ 4295 4295 - return ialloc(gm, n_elements, &sz, 3, chunks); 4296 4296 - } 4297 4297 - 4298 4298 - void** dlindependent_comalloc(size_t n_elements, size_t sizes[], 4299 4299 - void* chunks[]) { 4300 4300 - return ialloc(gm, n_elements, sizes, 0, chunks); 4301 4301 - } 4302 4302 - 4303 4303 - void* dlvalloc(size_t bytes) { 4304 4304 - size_t pagesz; 4305 4305 - init_mparams(); 4306 4306 - pagesz = mparams.page_size; 4307 4307 - return dlmemalign(pagesz, bytes); 4308 4308 - } 4309 4309 - 4310 4310 - void* dlpvalloc(size_t bytes) { 4311 4311 - size_t pagesz; 4312 4312 - init_mparams(); 4313 4313 - pagesz = mparams.page_size; 4314 4314 - return dlmemalign(pagesz, (bytes + pagesz - SIZE_T_ONE) & ~(pagesz - SIZE_T_ONE)); 4315 4315 - } 4316 4316 - 4317 4317 - int dlmalloc_trim(size_t pad) { 4318 4318 - int result = 0; 4319 4319 - if (!PREACTION(gm)) { 4320 4320 - result = sys_trim(gm, pad); 4321 4321 - POSTACTION(gm); 4322 4322 - } 4323 4323 - return result; 4324 4324 - } 4325 4325 - 4326 4326 - size_t dlmalloc_footprint(void) { 4327 4327 - return gm->footprint; 4328 4328 - } 4329 4329 - 4330 4330 - size_t dlmalloc_max_footprint(void) { 4331 4331 - return gm->max_footprint; 4332 4332 - } 4333 4333 - 4334 4334 - #if !NO_MALLINFO 4335 4335 - struct mallinfo dlmallinfo(void) { 4336 4336 - return internal_mallinfo(gm); 4337 4337 - } 4338 4338 - #endif /* NO_MALLINFO */ 4339 4339 - 4340 4340 - void dlmalloc_stats() { 4341 4341 - internal_malloc_stats(gm); 4342 4342 - } 4343 4343 - 4344 4344 - size_t dlmalloc_usable_size(void* mem) { 4345 4345 - if (mem != 0) { 4346 4346 - mchunkptr p = mem2chunk(mem); 4347 4347 - if (cinuse(p)) 4348 4348 - return chunksize(p) - overhead_for(p); 4349 4349 - } 4350 4350 - return 0; 4351 4351 - } 4352 4352 - 4353 4353 - int dlmallopt(int param_number, int value) { 4354 4354 - return change_mparam(param_number, value); 4355 4355 - } 4356 4356 - 4357 4357 - #endif /* !ONLY_MSPACES */ 4358 4358 - 4359 4359 - /* ----------------------------- user mspaces ---------------------------- */ 4360 4360 - 4361 4361 - #if MSPACES 4362 4362 - 4363 4363 - static mstate init_user_mstate(char* tbase, size_t tsize) { 4364 4364 - size_t msize = pad_request(sizeof(struct malloc_state)); 4365 4365 - mchunkptr mn; 4366 4366 - mchunkptr msp = align_as_chunk(tbase); 4367 4367 - mstate m = (mstate)(chunk2mem(msp)); 4368 4368 - memset(m, 0, msize); 4369 4369 - INITIAL_LOCK(&m->mutex); 4370 4370 - msp->head = (msize|PINUSE_BIT|CINUSE_BIT); 4371 4371 - m->seg.base = m->least_addr = tbase; 4372 4372 - m->seg.size = m->footprint = m->max_footprint = tsize; 4373 4373 - m->magic = mparams.magic; 4374 4374 - m->mflags = mparams.default_mflags; 4375 4375 - disable_contiguous(m); 4376 4376 - init_bins(m); 4377 4377 - mn = next_chunk(mem2chunk(m)); 4378 4378 - init_top(m, mn, (size_t)((tbase + tsize) - (char*)mn) - TOP_FOOT_SIZE); 4379 4379 - check_top_chunk(m, m->top); 4380 4380 - return m; 4381 4381 - } 4382 4382 - 4383 4383 - mspace create_mspace(size_t capacity, int locked) { 4384 4384 - mstate m = 0; 4385 4385 - size_t msize = pad_request(sizeof(struct malloc_state)); 4386 4386 - init_mparams(); /* Ensure pagesize etc initialized */ 4387 4387 - 4388 4388 - if (capacity < (size_t) -(msize + TOP_FOOT_SIZE + mparams.page_size)) { 4389 4389 - size_t rs = ((capacity == 0)? mparams.granularity : 4390 4390 - (capacity + TOP_FOOT_SIZE + msize)); 4391 4391 - size_t tsize = granularity_align(rs); 4392 4392 - char* tbase = (char*)(CALL_MMAP(tsize)); 4393 4393 - if (tbase != CMFAIL) { 4394 4394 - m = init_user_mstate(tbase, tsize); 4395 4395 - m->seg.sflags = IS_MMAPPED_BIT; 4396 4396 - set_lock(m, locked); 4397 4397 - } 4398 4398 - } 4399 4399 - return (mspace)m; 4400 4400 - } 4401 4401 - 4402 4402 - mspace create_mspace_with_base(void* base, size_t capacity, int locked) { 4403 4403 - mstate m = 0; 4404 4404 - size_t msize = pad_request(sizeof(struct malloc_state)); 4405 4405 - init_mparams(); /* Ensure pagesize etc initialized */ 4406 4406 - 4407 4407 - if (capacity > msize + TOP_FOOT_SIZE && 4408 4408 - capacity < (size_t) -(msize + TOP_FOOT_SIZE + mparams.page_size)) { 4409 4409 - m = init_user_mstate((char*)base, capacity); 4410 4410 - m->seg.sflags = EXTERN_BIT; 4411 4411 - set_lock(m, locked); 4412 4412 - } 4413 4413 - return (mspace)m; 4414 4414 - } 4415 4415 - 4416 4416 - size_t destroy_mspace(mspace msp) { 4417 4417 - size_t freed = 0; 4418 4418 - mstate ms = (mstate)msp; 4419 4419 - if (ok_magic(ms)) { 4420 4420 - msegmentptr sp = &ms->seg; 4421 4421 - while (sp != 0) { 4422 4422 - char* base = sp->base; 4423 4423 - size_t size = sp->size; 4424 4424 - flag_t flag = sp->sflags; 4425 4425 - sp = sp->next; 4426 4426 - if ((flag & IS_MMAPPED_BIT) && !(flag & EXTERN_BIT) && 4427 4427 - CALL_MUNMAP(base, size) == 0) 4428 4428 - freed += size; 4429 4429 - } 4430 4430 - } 4431 4431 - else { 4432 4432 - USAGE_ERROR_ACTION(ms,ms); 4433 4433 - } 4434 4434 - return freed; 4435 4435 - } 4436 4436 - 4437 4437 - /* 4438 4438 - mspace versions of routines are near-clones of the global 4439 4439 - versions. This is not so nice but better than the alternatives. 4440 4440 - */ 4441 4441 - 4442 4442 - 4443 4443 - void* mspace_malloc(mspace msp, size_t bytes) { 4444 4444 - mstate ms = (mstate)msp; 4445 4445 - if (!ok_magic(ms)) { 4446 4446 - USAGE_ERROR_ACTION(ms,ms); 4447 4447 - return 0; 4448 4448 - } 4449 4449 - if (!PREACTION(ms)) { 4450 4450 - void* mem; 4451 4451 - size_t nb; 4452 4452 - if (bytes <= MAX_SMALL_REQUEST) { 4453 4453 - bindex_t idx; 4454 4454 - binmap_t smallbits; 4455 4455 - nb = (bytes < MIN_REQUEST)? MIN_CHUNK_SIZE : pad_request(bytes); 4456 4456 - idx = small_index(nb); 4457 4457 - smallbits = ms->smallmap >> idx; 4458 4458 - 4459 4459 - if ((smallbits & 0x3U) != 0) { /* Remainderless fit to a smallbin. */ 4460 4460 - mchunkptr b, p; 4461 4461 - idx += ~smallbits & 1; /* Uses next bin if idx empty */ 4462 4462 - b = smallbin_at(ms, idx); 4463 4463 - p = b->fd; 4464 4464 - assert(chunksize(p) == small_index2size(idx)); 4465 4465 - unlink_first_small_chunk(ms, b, p, idx); 4466 4466 - set_inuse_and_pinuse(ms, p, small_index2size(idx)); 4467 4467 - mem = chunk2mem(p); 4468 4468 - check_malloced_chunk(ms, mem, nb); 4469 4469 - goto postaction; 4470 4470 - } 4471 4471 - 4472 4472 - else if (nb > ms->dvsize) { 4473 4473 - if (smallbits != 0) { /* Use chunk in next nonempty smallbin */ 4474 4474 - mchunkptr b, p, r; 4475 4475 - size_t rsize; 4476 4476 - bindex_t i; 4477 4477 - binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); 4478 4478 - binmap_t leastbit = least_bit(leftbits); 4479 4479 - compute_bit2idx(leastbit, i); 4480 4480 - b = smallbin_at(ms, i); 4481 4481 - p = b->fd; 4482 4482 - assert(chunksize(p) == small_index2size(i)); 4483 4483 - unlink_first_small_chunk(ms, b, p, i); 4484 4484 - rsize = small_index2size(i) - nb; 4485 4485 - /* Fit here cannot be remainderless if 4byte sizes */ 4486 4486 - if (SIZE_T_SIZE != 4 && rsize < MIN_CHUNK_SIZE) 4487 4487 - set_inuse_and_pinuse(ms, p, small_index2size(i)); 4488 4488 - else { 4489 4489 - set_size_and_pinuse_of_inuse_chunk(ms, p, nb); 4490 4490 - r = chunk_plus_offset(p, nb); 4491 4491 - set_size_and_pinuse_of_free_chunk(r, rsize); 4492 4492 - replace_dv(ms, r, rsize); 4493 4493 - } 4494 4494 - mem = chunk2mem(p); 4495 4495 - check_malloced_chunk(ms, mem, nb); 4496 4496 - goto postaction; 4497 4497 - } 4498 4498 - 4499 4499 - else if (ms->treemap != 0 && (mem = tmalloc_small(ms, nb)) != 0) { 4500 4500 - check_malloced_chunk(ms, mem, nb); 4501 4501 - goto postaction; 4502 4502 - } 4503 4503 - } 4504 4504 - } 4505 4505 - else if (bytes >= MAX_REQUEST) 4506 4506 - nb = MAX_SIZE_T; /* Too big to allocate. Force failure (in sys alloc) */ 4507 4507 - else { 4508 4508 - nb = pad_request(bytes); 4509 4509 - if (ms->treemap != 0 && (mem = tmalloc_large(ms, nb)) != 0) { 4510 4510 - check_malloced_chunk(ms, mem, nb); 4511 4511 - goto postaction; 4512 4512 - } 4513 4513 - } 4514 4514 - 4515 4515 - if (nb <= ms->dvsize) { 4516 4516 - size_t rsize = ms->dvsize - nb; 4517 4517 - mchunkptr p = ms->dv; 4518 4518 - if (rsize >= MIN_CHUNK_SIZE) { /* split dv */ 4519 4519 - mchunkptr r = ms->dv = chunk_plus_offset(p, nb); 4520 4520 - ms->dvsize = rsize; 4521 4521 - set_size_and_pinuse_of_free_chunk(r, rsize); 4522 4522 - set_size_and_pinuse_of_inuse_chunk(ms, p, nb); 4523 4523 - } 4524 4524 - else { /* exhaust dv */ 4525 4525 - size_t dvs = ms->dvsize; 4526 4526 - ms->dvsize = 0; 4527 4527 - ms->dv = 0; 4528 4528 - set_inuse_and_pinuse(ms, p, dvs); 4529 4529 - } 4530 4530 - mem = chunk2mem(p); 4531 4531 - check_malloced_chunk(ms, mem, nb); 4532 4532 - goto postaction; 4533 4533 - } 4534 4534 - 4535 4535 - else if (nb < ms->topsize) { /* Split top */ 4536 4536 - size_t rsize = ms->topsize -= nb; 4537 4537 - mchunkptr p = ms->top; 4538 4538 - mchunkptr r = ms->top = chunk_plus_offset(p, nb); 4539 4539 - r->head = rsize | PINUSE_BIT; 4540 4540 - set_size_and_pinuse_of_inuse_chunk(ms, p, nb); 4541 4541 - mem = chunk2mem(p); 4542 4542 - check_top_chunk(ms, ms->top); 4543 4543 - check_malloced_chunk(ms, mem, nb); 4544 4544 - goto postaction; 4545 4545 - } 4546 4546 - 4547 4547 - mem = sys_alloc(ms, nb); 4548 4548 - 4549 4549 - postaction: 4550 4550 - POSTACTION(ms); 4551 4551 - return mem; 4552 4552 - } 4553 4553 - 4554 4554 - return 0; 4555 4555 - } 4556 4556 - 4557 4557 - void mspace_free(mspace msp, void* mem) { 4558 4558 - if (mem != 0) { 4559 4559 - mchunkptr p = mem2chunk(mem); 4560 4560 - #if FOOTERS 4561 4561 - mstate fm = get_mstate_for(p); 4562 4562 - #else /* FOOTERS */ 4563 4563 - mstate fm = (mstate)msp; 4564 4564 - #endif /* FOOTERS */ 4565 4565 - if (!ok_magic(fm)) { 4566 4566 - USAGE_ERROR_ACTION(fm, p); 4567 4567 - return; 4568 4568 - } 4569 4569 - if (!PREACTION(fm)) { 4570 4570 - check_inuse_chunk(fm, p); 4571 4571 - if (RTCHECK(ok_address(fm, p) && ok_cinuse(p))) { 4572 4572 - size_t psize = chunksize(p); 4573 4573 - mchunkptr next = chunk_plus_offset(p, psize); 4574 4574 - if (!pinuse(p)) { 4575 4575 - size_t prevsize = p->prev_foot; 4576 4576 - if ((prevsize & IS_MMAPPED_BIT) != 0) { 4577 4577 - prevsize &= ~IS_MMAPPED_BIT; 4578 4578 - psize += prevsize + MMAP_FOOT_PAD; 4579 4579 - if (CALL_MUNMAP((char*)p - prevsize, psize) == 0) 4580 4580 - fm->footprint -= psize; 4581 4581 - goto postaction; 4582 4582 - } 4583 4583 - else { 4584 4584 - mchunkptr prev = chunk_minus_offset(p, prevsize); 4585 4585 - psize += prevsize; 4586 4586 - p = prev; 4587 4587 - if (RTCHECK(ok_address(fm, prev))) { /* consolidate backward */ 4588 4588 - if (p != fm->dv) { 4589 4589 - unlink_chunk(fm, p, prevsize); 4590 4590 - } 4591 4591 - else if ((next->head & INUSE_BITS) == INUSE_BITS) { 4592 4592 - fm->dvsize = psize; 4593 4593 - set_free_with_pinuse(p, psize, next); 4594 4594 - goto postaction; 4595 4595 - } 4596 4596 - } 4597 4597 - else 4598 4598 - goto erroraction; 4599 4599 - } 4600 4600 - } 4601 4601 - 4602 4602 - if (RTCHECK(ok_next(p, next) && ok_pinuse(next))) { 4603 4603 - if (!cinuse(next)) { /* consolidate forward */ 4604 4604 - if (next == fm->top) { 4605 4605 - size_t tsize = fm->topsize += psize; 4606 4606 - fm->top = p; 4607 4607 - p->head = tsize | PINUSE_BIT; 4608 4608 - if (p == fm->dv) { 4609 4609 - fm->dv = 0; 4610 4610 - fm->dvsize = 0; 4611 4611 - } 4612 4612 - if (should_trim(fm, tsize)) 4613 4613 - sys_trim(fm, 0); 4614 4614 - goto postaction; 4615 4615 - } 4616 4616 - else if (next == fm->dv) { 4617 4617 - size_t dsize = fm->dvsize += psize; 4618 4618 - fm->dv = p; 4619 4619 - set_size_and_pinuse_of_free_chunk(p, dsize); 4620 4620 - goto postaction; 4621 4621 - } 4622 4622 - else { 4623 4623 - size_t nsize = chunksize(next); 4624 4624 - psize += nsize; 4625 4625 - unlink_chunk(fm, next, nsize); 4626 4626 - set_size_and_pinuse_of_free_chunk(p, psize); 4627 4627 - if (p == fm->dv) { 4628 4628 - fm->dvsize = psize; 4629 4629 - goto postaction; 4630 4630 - } 4631 4631 - } 4632 4632 - } 4633 4633 - else 4634 4634 - set_free_with_pinuse(p, psize, next); 4635 4635 - insert_chunk(fm, p, psize); 4636 4636 - check_free_chunk(fm, p); 4637 4637 - goto postaction; 4638 4638 - } 4639 4639 - } 4640 4640 - erroraction: 4641 4641 - USAGE_ERROR_ACTION(fm, p); 4642 4642 - postaction: 4643 4643 - POSTACTION(fm); 4644 4644 - } 4645 4645 - } 4646 4646 - } 4647 4647 - 4648 4648 - void* mspace_calloc(mspace msp, size_t n_elements, size_t elem_size) { 4649 4649 - void* mem; 4650 4650 - size_t req = 0; 4651 4651 - mstate ms = (mstate)msp; 4652 4652 - if (!ok_magic(ms)) { 4653 4653 - USAGE_ERROR_ACTION(ms,ms); 4654 4654 - return 0; 4655 4655 - } 4656 4656 - if (n_elements != 0) { 4657 4657 - req = n_elements * elem_size; 4658 4658 - if (((n_elements | elem_size) & ~(size_t)0xffff) && 4659 4659 - (req / n_elements != elem_size)) 4660 4660 - req = MAX_SIZE_T; /* force downstream failure on overflow */ 4661 4661 - } 4662 4662 - mem = internal_malloc(ms, req); 4663 4663 - if (mem != 0 && calloc_must_clear(mem2chunk(mem))) 4664 4664 - memset(mem, 0, req); 4665 4665 - return mem; 4666 4666 - } 4667 4667 - 4668 4668 - void* mspace_realloc(mspace msp, void* oldmem, size_t bytes) { 4669 4669 - if (oldmem == 0) 4670 4670 - return mspace_malloc(msp, bytes); 4671 4671 - #ifdef REALLOC_ZERO_BYTES_FREES 4672 4672 - if (bytes == 0) { 4673 4673 - mspace_free(msp, oldmem); 4674 4674 - return 0; 4675 4675 - } 4676 4676 - #endif /* REALLOC_ZERO_BYTES_FREES */ 4677 4677 - else { 4678 4678 - #if FOOTERS 4679 4679 - mchunkptr p = mem2chunk(oldmem); 4680 4680 - mstate ms = get_mstate_for(p); 4681 4681 - #else /* FOOTERS */ 4682 4682 - mstate ms = (mstate)msp; 4683 4683 - #endif /* FOOTERS */ 4684 4684 - if (!ok_magic(ms)) { 4685 4685 - USAGE_ERROR_ACTION(ms,ms); 4686 4686 - return 0; 4687 4687 - } 4688 4688 - return internal_realloc(ms, oldmem, bytes); 4689 4689 - } 4690 4690 - } 4691 4691 - 4692 4692 - void* mspace_memalign(mspace msp, size_t alignment, size_t bytes) { 4693 4693 - mstate ms = (mstate)msp; 4694 4694 - if (!ok_magic(ms)) { 4695 4695 - USAGE_ERROR_ACTION(ms,ms); 4696 4696 - return 0; 4697 4697 - } 4698 4698 - return internal_memalign(ms, alignment, bytes); 4699 4699 - } 4700 4700 - 4701 4701 - void** mspace_independent_calloc(mspace msp, size_t n_elements, 4702 4702 - size_t elem_size, void* chunks[]) { 4703 4703 - size_t sz = elem_size; /* serves as 1-element array */ 4704 4704 - mstate ms = (mstate)msp; 4705 4705 - if (!ok_magic(ms)) { 4706 4706 - USAGE_ERROR_ACTION(ms,ms); 4707 4707 - return 0; 4708 4708 - } 4709 4709 - return ialloc(ms, n_elements, &sz, 3, chunks); 4710 4710 - } 4711 4711 - 4712 4712 - void** mspace_independent_comalloc(mspace msp, size_t n_elements, 4713 4713 - size_t sizes[], void* chunks[]) { 4714 4714 - mstate ms = (mstate)msp; 4715 4715 - if (!ok_magic(ms)) { 4716 4716 - USAGE_ERROR_ACTION(ms,ms); 4717 4717 - return 0; 4718 4718 - } 4719 4719 - return ialloc(ms, n_elements, sizes, 0, chunks); 4720 4720 - } 4721 4721 - 4722 4722 - int mspace_trim(mspace msp, size_t pad) { 4723 4723 - int result = 0; 4724 4724 - mstate ms = (mstate)msp; 4725 4725 - if (ok_magic(ms)) { 4726 4726 - if (!PREACTION(ms)) { 4727 4727 - result = sys_trim(ms, pad); 4728 4728 - POSTACTION(ms); 4729 4729 - } 4730 4730 - } 4731 4731 - else { 4732 4732 - USAGE_ERROR_ACTION(ms,ms); 4733 4733 - } 4734 4734 - return result; 4735 4735 - } 4736 4736 - 4737 4737 - void mspace_malloc_stats(mspace msp) { 4738 4738 - mstate ms = (mstate)msp; 4739 4739 - if (ok_magic(ms)) { 4740 4740 - internal_malloc_stats(ms); 4741 4741 - } 4742 4742 - else { 4743 4743 - USAGE_ERROR_ACTION(ms,ms); 4744 4744 - } 4745 4745 - } 4746 4746 - 4747 4747 - size_t mspace_footprint(mspace msp) { 4748 4748 - size_t result; 4749 4749 - mstate ms = (mstate)msp; 4750 4750 - if (ok_magic(ms)) { 4751 4751 - result = ms->footprint; 4752 4752 - } 4753 4753 - USAGE_ERROR_ACTION(ms,ms); 4754 4754 - return result; 4755 4755 - } 4756 4756 - 4757 4757 - 4758 4758 - size_t mspace_max_footprint(mspace msp) { 4759 4759 - size_t result; 4760 4760 - mstate ms = (mstate)msp; 4761 4761 - if (ok_magic(ms)) { 4762 4762 - result = ms->max_footprint; 4763 4763 - } 4764 4764 - USAGE_ERROR_ACTION(ms,ms); 4765 4765 - return result; 4766 4766 - } 4767 4767 - 4768 4768 - 4769 4769 - #if !NO_MALLINFO 4770 4770 - struct mallinfo mspace_mallinfo(mspace msp) { 4771 4771 - mstate ms = (mstate)msp; 4772 4772 - if (!ok_magic(ms)) { 4773 4773 - USAGE_ERROR_ACTION(ms,ms); 4774 4774 - } 4775 4775 - return internal_mallinfo(ms); 4776 4776 - } 4777 4777 - #endif /* NO_MALLINFO */ 4778 4778 - 4779 4779 - int mspace_mallopt(int param_number, int value) { 4780 4780 - return change_mparam(param_number, value); 4781 4781 - } 4782 4782 - 4783 4783 - #endif /* MSPACES */ 4784 4784 - 4785 4785 - /* -------------------- Alternative MORECORE functions ------------------- */ 4786 4786 - 4787 4787 - /* 4788 4788 - Guidelines for creating a custom version of MORECORE: 4789 4789 - 4790 4790 - * For best performance, MORECORE should allocate in multiples of pagesize. 4791 4791 - * MORECORE may allocate more memory than requested. (Or even less, 4792 4792 - but this will usually result in a malloc failure.) 4793 4793 - * MORECORE must not allocate memory when given argument zero, but 4794 4794 - instead return one past the end address of memory from previous 4795 4795 - nonzero call. 4796 4796 - * For best performance, consecutive calls to MORECORE with positive 4797 4797 - arguments should return increasing addresses, indicating that 4798 4798 - space has been contiguously extended. 4799 4799 - * Even though consecutive calls to MORECORE need not return contiguous 4800 4800 - addresses, it must be OK for malloc'ed chunks to span multiple 4801 4801 - regions in those cases where they do happen to be contiguous. 4802 4802 - * MORECORE need not handle negative arguments -- it may instead 4803 4803 - just return MFAIL when given negative arguments. 4804 4804 - Negative arguments are always multiples of pagesize. MORECORE 4805 4805 - must not misinterpret negative args as large positive unsigned 4806 4806 - args. You can suppress all such calls from even occurring by defining 4807 4807 - MORECORE_CANNOT_TRIM, 4808 4808 - 4809 4809 - As an example alternative MORECORE, here is a custom allocator 4810 4810 - kindly contributed for pre-OSX macOS. It uses virtually but not 4811 4811 - necessarily physically contiguous non-paged memory (locked in, 4812 4812 - present and won't get swapped out). You can use it by uncommenting 4813 4813 - this section, adding some #includes, and setting up the appropriate 4814 4814 - defines above: 4815 4815 - 4816 4816 - #define MORECORE osMoreCore 4817 4817 - 4818 4818 - There is also a shutdown routine that should somehow be called for 4819 4819 - cleanup upon program exit. 4820 4820 - 4821 4821 - #define MAX_POOL_ENTRIES 100 4822 4822 - #define MINIMUM_MORECORE_SIZE (64 * 1024U) 4823 4823 - static int next_os_pool; 4824 4824 - void *our_os_pools[MAX_POOL_ENTRIES]; 4825 4825 - 4826 4826 - void *osMoreCore(int size) 4827 4827 - { 4828 4828 - void *ptr = 0; 4829 4829 - static void *sbrk_top = 0; 4830 4830 - 4831 4831 - if (size > 0) 4832 4832 - { 4833 4833 - if (size < MINIMUM_MORECORE_SIZE) 4834 4834 - size = MINIMUM_MORECORE_SIZE; 4835 4835 - if (CurrentExecutionLevel() == kTaskLevel) 4836 4836 - ptr = PoolAllocateResident(size + RM_PAGE_SIZE, 0); 4837 4837 - if (ptr == 0) 4838 4838 - { 4839 4839 - return (void *) MFAIL; 4840 4840 - } 4841 4841 - // save ptrs so they can be freed during cleanup 4842 4842 - our_os_pools[next_os_pool] = ptr; 4843 4843 - next_os_pool++; 4844 4844 - ptr = (void *) ((((size_t) ptr) + RM_PAGE_MASK) & ~RM_PAGE_MASK); 4845 4845 - sbrk_top = (char *) ptr + size; 4846 4846 - return ptr; 4847 4847 - } 4848 4848 - else if (size < 0) 4849 4849 - { 4850 4850 - // we don't currently support shrink behavior 4851 4851 - return (void *) MFAIL; 4852 4852 - } 4853 4853 - else 4854 4854 - { 4855 4855 - return sbrk_top; 4856 4856 - } 4857 4857 - } 4858 4858 - 4859 4859 - // cleanup any allocated memory pools 4860 4860 - // called as last thing before shutting down driver 4861 4861 - 4862 4862 - void osCleanupMem(void) 4863 4863 - { 4864 4864 - void **ptr; 4865 4865 - 4866 4866 - for (ptr = our_os_pools; ptr < &our_os_pools[MAX_POOL_ENTRIES]; ptr++) 4867 4867 - if (*ptr) 4868 4868 - { 4869 4869 - PoolDeallocate(*ptr); 4870 4870 - *ptr = 0; 4871 4871 - } 4872 4872 - } 4873 4873 - 4874 4874 - */ 4875 4875 - 4876 4876 - 4877 4877 - /* ----------------------------------------------------------------------- 4878 4878 - History: 4879 4879 - V2.8.3 Thu Sep 22 11:16:32 2005 Doug Lea (dl at gee) 4880 4880 - * Add max_footprint functions 4881 4881 - * Ensure all appropriate literals are size_t 4882 4882 - * Fix conditional compilation problem for some #define settings 4883 4883 - * Avoid concatenating segments with the one provided 4884 4884 - in create_mspace_with_base 4885 4885 - * Rename some variables to avoid compiler shadowing warnings 4886 4886 - * Use explicit lock initialization. 4887 4887 - * Better handling of sbrk interference. 4888 4888 - * Simplify and fix segment insertion, trimming and mspace_destroy 4889 4889 - * Reinstate REALLOC_ZERO_BYTES_FREES option from 2.7.x 4890 4890 - * Thanks especially to Dennis Flanagan for help on these. 4891 4891 - 4892 4892 - V2.8.2 Sun Jun 12 16:01:10 2005 Doug Lea (dl at gee) 4893 4893 - * Fix memalign brace error. 4894 4894 - 4895 4895 - V2.8.1 Wed Jun 8 16:11:46 2005 Doug Lea (dl at gee) 4896 4896 - * Fix improper #endif nesting in C++ 4897 4897 - * Add explicit casts needed for C++ 4898 4898 - 4899 4899 - V2.8.0 Mon May 30 14:09:02 2005 Doug Lea (dl at gee) 4900 4900 - * Use trees for large bins 4901 4901 - * Support mspaces 4902 4902 - * Use segments to unify sbrk-based and mmap-based system allocation, 4903 4903 - removing need for emulation on most platforms without sbrk. 4904 4904 - * Default safety checks 4905 4905 - * Optional footer checks. Thanks to William Robertson for the idea. 4906 4906 - * Internal code refactoring 4907 4907 - * Incorporate suggestions and platform-specific changes. 4908 4908 - Thanks to Dennis Flanagan, Colin Plumb, Niall Douglas, 4909 4909 - Aaron Bachmann, Emery Berger, and others. 4910 4910 - * Speed up non-fastbin processing enough to remove fastbins. 4911 4911 - * Remove useless cfree() to avoid conflicts with other apps. 4912 4912 - * Remove internal memcpy, memset. Compilers handle builtins better. 4913 4913 - * Remove some options that no one ever used and rename others. 4914 4914 - 4915 4915 - V2.7.2 Sat Aug 17 09:07:30 2002 Doug Lea (dl at gee) 4916 4916 - * Fix malloc_state bitmap array misdeclaration 4917 4917 - 4918 4918 - V2.7.1 Thu Jul 25 10:58:03 2002 Doug Lea (dl at gee) 4919 4919 - * Allow tuning of FIRST_SORTED_BIN_SIZE 4920 4920 - * Use PTR_UINT as type for all ptr->int casts. Thanks to John Belmonte. 4921 4921 - * Better detection and support for non-contiguousness of MORECORE. 4922 4922 - Thanks to Andreas Mueller, Conal Walsh, and Wolfram Gloger 4923 4923 - * Bypass most of malloc if no frees. Thanks To Emery Berger. 4924 4924 - * Fix freeing of old top non-contiguous chunk im sysmalloc. 4925 4925 - * Raised default trim and map thresholds to 256K. 4926 4926 - * Fix mmap-related #defines. Thanks to Lubos Lunak. 4927 4927 - * Fix copy macros; added LACKS_FCNTL_H. Thanks to Neal Walfield. 4928 4928 - * Branch-free bin calculation 4929 4929 - * Default trim and mmap thresholds now 256K. 4930 4930 - 4931 4931 - V2.7.0 Sun Mar 11 14:14:06 2001 Doug Lea (dl at gee) 4932 4932 - * Introduce independent_comalloc and independent_calloc. 4933 4933 - Thanks to Michael Pachos for motivation and help. 4934 4934 - * Make optional .h file available 4935 4935 - * Allow > 2GB requests on 32bit systems. 4936 4936 - * new WIN32 sbrk, mmap, munmap, lock code from <Walter@GeNeSys-e.de>. 4937 4937 - Thanks also to Andreas Mueller <a.mueller at paradatec.de>, 4938 4938 - and Anonymous. 4939 4939 - * Allow override of MALLOC_ALIGNMENT (Thanks to Ruud Waij for 4940 4940 - helping test this.) 4941 4941 - * memalign: check alignment arg 4942 4942 - * realloc: don't try to shift chunks backwards, since this 4943 4943 - leads to more fragmentation in some programs and doesn't 4944 4944 - seem to help in any others. 4945 4945 - * Collect all cases in malloc requiring system memory into sysmalloc 4946 4946 - * Use mmap as backup to sbrk 4947 4947 - * Place all internal state in malloc_state 4948 4948 - * Introduce fastbins (although similar to 2.5.1) 4949 4949 - * Many minor tunings and cosmetic improvements 4950 4950 - * Introduce USE_PUBLIC_MALLOC_WRAPPERS, USE_MALLOC_LOCK 4951 4951 - * Introduce MALLOC_FAILURE_ACTION, MORECORE_CONTIGUOUS 4952 4952 - Thanks to Tony E. Bennett <tbennett@nvidia.com> and others. 4953 4953 - * Include errno.h to support default failure action. 4954 4954 - 4955 4955 - V2.6.6 Sun Dec 5 07:42:19 1999 Doug Lea (dl at gee) 4956 4956 - * return null for negative arguments 4957 4957 - * Added Several WIN32 cleanups from Martin C. Fong <mcfong at yahoo.com> 4958 4958 - * Add 'LACKS_SYS_PARAM_H' for those systems without 'sys/param.h' 4959 4959 - (e.g. WIN32 platforms) 4960 4960 - * Cleanup header file inclusion for WIN32 platforms 4961 4961 - * Cleanup code to avoid Microsoft Visual C++ compiler complaints 4962 4962 - * Add 'USE_DL_PREFIX' to quickly allow co-existence with existing 4963 4963 - memory allocation routines 4964 4964 - * Set 'malloc_getpagesize' for WIN32 platforms (needs more work) 4965 4965 - * Use 'assert' rather than 'ASSERT' in WIN32 code to conform to 4966 4966 - usage of 'assert' in non-WIN32 code 4967 4967 - * Improve WIN32 'sbrk()' emulation's 'findRegion()' routine to 4968 4968 - avoid infinite loop 4969 4969 - * Always call 'fREe()' rather than 'free()' 4970 4970 - 4971 4971 - V2.6.5 Wed Jun 17 15:57:31 1998 Doug Lea (dl at gee) 4972 4972 - * Fixed ordering problem with boundary-stamping 4973 4973 - 4974 4974 - V2.6.3 Sun May 19 08:17:58 1996 Doug Lea (dl at gee) 4975 4975 - * Added pvalloc, as recommended by H.J. Liu 4976 4976 - * Added 64bit pointer support mainly from Wolfram Gloger 4977 4977 - * Added anonymously donated WIN32 sbrk emulation 4978 4978 - * Malloc, calloc, getpagesize: add optimizations from Raymond Nijssen 4979 4979 - * malloc_extend_top: fix mask error that caused wastage after 4980 4980 - foreign sbrks 4981 4981 - * Add linux mremap support code from HJ Liu 4982 4982 - 4983 4983 - V2.6.2 Tue Dec 5 06:52:55 1995 Doug Lea (dl at gee) 4984 4984 - * Integrated most documentation with the code. 4985 4985 - * Add support for mmap, with help from 4986 4986 - Wolfram Gloger (Gloger@lrz.uni-muenchen.de). 4987 4987 - * Use last_remainder in more cases. 4988 4988 - * Pack bins using idea from colin@nyx10.cs.du.edu 4989 4989 - * Use ordered bins instead of best-fit threshhold 4990 4990 - * Eliminate block-local decls to simplify tracing and debugging. 4991 4991 - * Support another case of realloc via move into top 4992 4992 - * Fix error occuring when initial sbrk_base not word-aligned. 4993 4993 - * Rely on page size for units instead of SBRK_UNIT to 4994 4994 - avoid surprises about sbrk alignment conventions. 4995 4995 - * Add mallinfo, mallopt. Thanks to Raymond Nijssen 4996 4996 - (raymond@es.ele.tue.nl) for the suggestion. 4997 4997 - * Add `pad' argument to malloc_trim and top_pad mallopt parameter. 4998 4998 - * More precautions for cases where other routines call sbrk, 4999 4999 - courtesy of Wolfram Gloger (Gloger@lrz.uni-muenchen.de). 5000 5000 - * Added macros etc., allowing use in linux libc from 5001 5001 - H.J. Lu (hjl@gnu.ai.mit.edu) 5002 5002 - * Inverted this history list 5003 5003 - 5004 5004 - V2.6.1 Sat Dec 2 14:10:57 1995 Doug Lea (dl at gee) 5005 5005 - * Re-tuned and fixed to behave more nicely with V2.6.0 changes. 5006 5006 - * Removed all preallocation code since under current scheme 5007 5007 - the work required to undo bad preallocations exceeds 5008 5008 - the work saved in good cases for most test programs. 5009 5009 - * No longer use return list or unconsolidated bins since 5010 5010 - no scheme using them consistently outperforms those that don't 5011 5011 - given above changes. 5012 5012 - * Use best fit for very large chunks to prevent some worst-cases. 5013 5013 - * Added some support for debugging 5014 5014 - 5015 5015 - V2.6.0 Sat Nov 4 07:05:23 1995 Doug Lea (dl at gee) 5016 5016 - * Removed footers when chunks are in use. Thanks to 5017 5017 - Paul Wilson (wilson@cs.texas.edu) for the suggestion. 5018 5018 - 5019 5019 - V2.5.4 Wed Nov 1 07:54:51 1995 Doug Lea (dl at gee) 5020 5020 - * Added malloc_trim, with help from Wolfram Gloger 5021 5021 - (wmglo@Dent.MED.Uni-Muenchen.DE). 5022 5022 - 5023 5023 - V2.5.3 Tue Apr 26 10:16:01 1994 Doug Lea (dl at g) 5024 5024 - 5025 5025 - V2.5.2 Tue Apr 5 16:20:40 1994 Doug Lea (dl at g) 5026 5026 - * realloc: try to expand in both directions 5027 5027 - * malloc: swap order of clean-bin strategy; 5028 5028 - * realloc: only conditionally expand backwards 5029 5029 - * Try not to scavenge used bins 5030 5030 - * Use bin counts as a guide to preallocation 5031 5031 - * Occasionally bin return list chunks in first scan 5032 5032 - * Add a few optimizations from colin@nyx10.cs.du.edu 5033 5033 - 5034 5034 - V2.5.1 Sat Aug 14 15:40:43 1993 Doug Lea (dl at g) 5035 5035 - * faster bin computation & slightly different binning 5036 5036 - * merged all consolidations to one part of malloc proper 5037 5037 - (eliminating old malloc_find_space & malloc_clean_bin) 5038 5038 - * Scan 2 returns chunks (not just 1) 5039 5039 - * Propagate failure in realloc if malloc returns 0 5040 5040 - * Add stuff to allow compilation on non-ANSI compilers 5041 5041 - from kpv@research.att.com 5042 5042 - 5043 5043 - V2.5 Sat Aug 7 07:41:59 1993 Doug Lea (dl at g.oswego.edu) 5044 5044 - * removed potential for odd address access in prev_chunk 5045 5045 - * removed dependency on getpagesize.h 5046 5046 - * misc cosmetics and a bit more internal documentation 5047 5047 - * anticosmetics: mangled names in macros to evade debugger strangeness 5048 5048 - * tested on sparc, hp-700, dec-mips, rs6000 5049 5049 - with gcc & native cc (hp, dec only) allowing 5050 5050 - Detlefs & Zorn comparison study (in SIGPLAN Notices.) 5051 5051 - 5052 5052 - Trial version Fri Aug 28 13:14:29 1992 Doug Lea (dl at g.oswego.edu) 5053 5053 - * Based loosely on libg++-1.2X malloc. (It retains some of the overall 5054 5054 - structure of old version, but most details differ.) 5055 5055 - 5056 5056 - */

+4 -5

apps/plugins/lua/rockconf.h

reviewed

··· 23 23 #define _ROCKCONF_H_ 24 24 25 25 #include "plugin.h" 26 26 + #include <tlsf.h> 26 27 27 28 #undef LUAI_THROW 28 29 #undef LUAI_TRY ··· 40 41 #define luai_jmpbuf jmp_buf 41 42 42 43 extern char curpath[MAX_PATH]; 43 43 - void* dlmalloc(size_t bytes); 44 44 - void *dlrealloc(void *ptr, size_t size); 45 45 - void dlfree(void *ptr); 46 44 struct tm *gmtime(const time_t *timep); 47 45 long strtol(const char *nptr, char **endptr, int base); 48 46 unsigned long strtoul(const char *str, char **endptr, int base); ··· 54 52 #define pow lpow 55 53 56 54 /* Simple substitutions */ 57 57 - #define realloc dlrealloc 58 58 - #define free dlfree 55 55 + #define malloc tlsf_malloc 56 56 + #define realloc tlsf_realloc 57 57 + #define free tlsf_free 59 58 #define memchr rb->memchr 60 59 #define snprintf rb->snprintf 61 60 #define strcat rb->strcat

+6 -6

apps/plugins/lua/rocklib.c

reviewed

··· 522 522 int i; 523 523 luaL_checktype(L, pos, LUA_TTABLE); 524 524 int n = luaL_getn(L, pos); 525 525 - const char **lines = (const char**) dlmalloc(n * sizeof(const char*)); 525 525 + const char **lines = (const char**) tlsf_malloc(n * sizeof(const char*)); 526 526 if(lines == NULL) 527 527 luaL_error(L, "Can't allocate %d bytes!", n * sizeof(const char*)); 528 528 for(i=1; i<=n; i++) ··· 548 548 549 549 enum yesno_res result = rb->gui_syncyesno_run(&main_message, yes, no); 550 550 551 551 - dlfree(main_message.message_lines); 551 551 + tlsf_free(main_message.message_lines); 552 552 if(yes) 553 553 - dlfree(yes_message.message_lines); 553 553 + tlsf_free(yes_message.message_lines); 554 554 if(no) 555 555 - dlfree(no_message.message_lines); 555 555 + tlsf_free(no_message.message_lines); 556 556 557 557 lua_pushinteger(L, result); 558 558 return 1; ··· 571 571 start_selected = luaL_optint(L, 3, 0); 572 572 573 573 n = luaL_getn(L, 2); 574 574 - items = (const char**) dlmalloc(n * sizeof(const char*)); 574 574 + items = (const char**) tlsf_malloc(n * sizeof(const char*)); 575 575 if(items == NULL) 576 576 luaL_error(L, "Can't allocate %d bytes!", n * sizeof(const char*)); 577 577 for(i=1; i<=n; i++) ··· 587 587 588 588 int result = rb->do_menu(&menu, &start_selected, NULL, false); 589 589 590 590 - dlfree(items); 590 590 + tlsf_free(items); 591 591 592 592 lua_pushinteger(L, result); 593 593 return 1;

-3

apps/plugins/lua/rocklua.c

reviewed

··· 24 24 #include "lauxlib.h" 25 25 #include "lualib.h" 26 26 #include "rocklib.h" 27 27 - #include "rockmalloc.h" 28 27 #include "luadir.h" 29 28 30 29 ··· 164 163 rb->lcd_clear_display(); 165 164 status = docall(L); 166 165 } 167 167 - 168 168 - dlmalloc_stats(); 169 166 170 167 if (status) { 171 168 DEBUGF("%s\n", lua_tostring(L, -1));

-63

apps/plugins/lua/rockmalloc.c

reviewed

··· 1 1 - /*************************************************************************** 2 2 - * __________ __ ___. 3 3 - * Open \______ \ ____ ____ | | _\_ |__ _______ ___ 4 4 - * Source | _// _ \_/ ___\| |/ /| __ \ / _ \ \/ / 5 5 - * Jukebox | | ( <_> ) \___| < | \_\ ( <_> > < < 6 6 - * Firmware |____|_ /\____/ \___ >__|_ \|___ /\____/__/\_ \ 7 7 - * \/ \/ \/ \/ \/ 8 8 - * $Id$ 9 9 - * 10 10 - * Copyright (C) 2008 Dan Everton (safetydan) 11 11 - * 12 12 - * This program is free software; you can redistribute it and/or 13 13 - * modify it under the terms of the GNU General Public License 14 14 - * as published by the Free Software Foundation; either version 2 15 15 - * of the License, or (at your option) any later version. 16 16 - * 17 17 - * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY 18 18 - * KIND, either express or implied. 19 19 - * 20 20 - ****************************************************************************/ 21 21 - 22 22 - #include "plugin.h" 23 23 - #include "rockmalloc.h" 24 24 - #include "malloc.c" 25 25 - 26 26 - void *rocklua_morecore(int size) 27 27 - { 28 28 - static char *sbrk_top = NULL; 29 29 - static ssize_t total_size = 0; 30 30 - void *ptr = 0; 31 31 - 32 32 - if (size > 0) { 33 33 - size = size + 4 - (size % 4); 34 34 - 35 35 - if (sbrk_top == NULL) { 36 36 - sbrk_top = rb->plugin_get_buffer((size_t *) &total_size); 37 37 - } 38 38 - 39 39 - if (sbrk_top == NULL || size + 4 > abs(total_size)) { 40 40 - /* Try the audio buffer */ 41 41 - sbrk_top = rb->plugin_get_audio_buffer((size_t *) &total_size); 42 42 - 43 43 - if(sbrk_top == NULL || size + 4 > abs(total_size)) { 44 44 - printf("malloc failed for %d!\n", size); 45 45 - return (void *) MFAIL; 46 46 - } 47 47 - } 48 48 - 49 49 - ptr = sbrk_top + 4; 50 50 - *((unsigned int *) sbrk_top) = size; 51 51 - 52 52 - sbrk_top += size + 4; 53 53 - total_size -= size + 4; 54 54 - 55 55 - return ptr; 56 56 - } else if (size < 0) { 57 57 - /* we don't currently support shrink behavior */ 58 58 - return (void *) MFAIL; 59 59 - } else { 60 60 - return sbrk_top; 61 61 - } 62 62 - } 63 63 -

+25 -23

apps/plugins/lua/rockmalloc.h apps/plugins/lua/tlsf_helper.c

reviewed

··· 5 5 * Jukebox | | ( <_> ) \___| < | \_\ ( <_> > < < 6 6 * Firmware |____|_ /\____/ \___ >__|_ \|___ /\____/__/\_ \ 7 7 * \/ \/ \/ \/ \/ 8 8 - * $Id$ 9 8 * 10 10 - * Copyright (C) 2008 Dan Everton (safetydan) 9 9 + * Copyright (C) 2013 Marcin Bukat 11 10 * 12 11 * This program is free software; you can redistribute it and/or 13 12 * modify it under the terms of the GNU General Public License ··· 19 18 * 20 19 ****************************************************************************/ 21 20 22 22 - #ifndef _ROCKMALLOC_H_ 23 23 - #define _ROCKMALLOC_H_ 21 21 + #include "plugin.h" 22 22 + #include <tlsf.h> 24 23 25 25 - #undef WIN32 26 26 - #undef _WIN32 27 27 - #define LACKS_UNISTD_H 28 28 - #define LACKS_SYS_PARAM_H 29 29 - #define LACKS_SYS_MMAN_H 30 30 - #define LACKS_STRINGS_H 31 31 - #define INSECURE 1 32 32 - #define USE_DL_PREFIX 1 33 33 - #define MORECORE_CANNOT_TRIM 1 34 34 - #define HAVE_MMAP 0 35 35 - #define HAVE_MREMAP 0 36 36 - #define NO_MALLINFO 1 37 37 - #define ABORT ((void) 0) 38 38 - /* #define DEBUG */ 39 39 - #define MORECORE rocklua_morecore 24 24 + void *get_new_area(size_t *size) 25 25 + { 26 26 + static char *pluginbuf_ptr = NULL; 27 27 + static char *audiobuf_ptr = NULL; 40 28 41 41 - void *rocklua_morecore(int size); 42 42 - void dlmalloc_stats(void); 29 29 + if (pluginbuf_ptr == NULL) 30 30 + { 31 31 + pluginbuf_ptr = rb->plugin_get_buffer(size); 43 32 44 44 - #define printf DEBUGF 33 33 + /* kill tlsf signature if any */ 34 34 + memset(pluginbuf_ptr, 0, 4); 45 35 46 46 - #endif 36 36 + return pluginbuf_ptr; 37 37 + } 38 38 + 39 39 + if (audiobuf_ptr == NULL) 40 40 + { 41 41 + /* grab audiobuffer */ 42 42 + audiobuf_ptr = rb->plugin_get_audio_buffer(size); 43 43 + 44 44 + return audiobuf_ptr; 45 45 + } 46 46 + 47 47 + return ((void *) ~0); 48 48 + }

+11 -3

lib/tlsf/src/tlsf.c

reviewed

··· 395 395 set_bit (_fl, &_tlsf -> fl_bitmap); \ 396 396 } while(0) 397 397 398 398 + #if defined(ROCKBOX) 399 399 + void * __attribute__((weak)) get_new_area(size_t * size) 400 400 + { 401 401 + (void)size; 402 402 + return ((void *) ~0); 403 403 + } 404 404 + #endif 405 405 + 398 406 #if USE_SBRK || USE_MMAP 399 407 static __inline__ void *get_new_area(size_t * size) 400 408 { ··· 615 623 /******************************************************************/ 616 624 void *ret; 617 625 618 618 - #if USE_MMAP || USE_SBRK 626 626 + #if USE_MMAP || USE_SBRK || defined(ROCKBOX) 619 627 if (!mp) { 620 628 size_t area_size; 621 629 void *area; ··· 657 665 /******************************************************************/ 658 666 void *ret; 659 667 660 660 - #if USE_MMAP || USE_SBRK 668 668 + #if USE_MMAP || USE_SBRK || defined(ROCKBOX) 661 669 if (!mp) { 662 670 return tlsf_malloc(size); 663 671 } ··· 705 713 so they are not longer valid when the function fails */ 706 714 b = FIND_SUITABLE_BLOCK(tlsf, &fl, &sl); 707 715 708 708 - #if USE_MMAP || USE_SBRK 716 716 + #if USE_MMAP || USE_SBRK || defined(ROCKBOX) 709 717 if (!b) { 710 718 size_t area_size; 711 719 void *area;