3 .\" Copyright (c) 1980, 1991, 1993
4 .\" The Regents of the University of California. All rights reserved.
6 .\" This code is derived from software contributed to Berkeley by
7 .\" the American National Standards Committee X3, on Information
8 .\" Processing Systems.
10 .\" Redistribution and use in source and binary forms, with or without
11 .\" modification, are permitted provided that the following conditions
13 .\" 1. Redistributions of source code must retain the above copyright
14 .\" notice, this list of conditions and the following disclaimer.
15 .\" 2. Redistributions in binary form must reproduce the above copyright
16 .\" notice, this list of conditions and the following disclaimer in the
17 .\" documentation and/or other materials provided with the distribution.
18 .\" 3. Neither the name of the University nor the names of its contributors
19 .\" may be used to endorse or promote products derived from this software
20 .\" without specific prior written permission.
22 .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 .\" @(#)malloc.3 8.1 (Berkeley) 6/4/93
35 .\" $FreeBSD: src/lib/libc/stdlib/malloc.3,v 1.73 2007/06/15 22:32:33 jasone Exp $
42 .Nd the default system allocator
51 is a general-purpose concurrent
53 implementation specifically designed to be scalable
54 on modern multi-processor systems.
55 It is the default user space system allocator in
58 When the first call is made to one of the memory allocation
63 various flags that affect the workings of the allocator are set or reset.
64 These are described below.
68 of the file referenced by the symbolic link named
69 .Pa /etc/malloc.conf ,
70 the value of the environment variable
72 and the string pointed to by the global variable
74 will be interpreted, in that order, character by character as flags.
76 Most flags are single letters.
77 Uppercase letters indicate that the behavior is set, or on,
78 and lowercase letters mean that the behavior is not set, or off.
79 The following options are available.
80 .Bl -tag -width "A " -offset 3n
82 All warnings (except for the warning about unknown
83 flags being set) become fatal.
90 when pages within a chunk are no longer in use, but the chunk as a whole cannot
92 This is primarily of use when swapping is a real possibility, due to the high
97 Each byte of new memory allocated by
100 will be initialized to 0xa5.
101 All memory returned by
104 will be initialized to 0x5a.
105 This is intended for debugging and will impact performance negatively.
107 Increase/decrease the virtual memory chunk size by a factor of two.
108 The default chunk size is 1 MB.
109 This option can be specified multiple times.
111 Increase/decrease the number of arenas by a factor of two.
112 The default number of arenas is four times the number of CPUs, or one if there
114 This option can be specified multiple times.
116 Various statistics are printed at program exit via an
119 This has the potential to cause deadlock for a multi-threaded process that exits
120 while one or more threads are executing in the memory allocation functions.
121 Therefore, this option should only be used with care; it is primarily intended
122 as a performance tuning aid during application development.
124 Increase/decrease the size of the allocation quantum by a factor of two.
125 The default quantum is the minimum allowed by the architecture (typically 8 or
127 This option can be specified multiple times.
129 Increase/decrease the size of the maximum size class that is a multiple of the
130 quantum by a factor of two.
131 Above this size, power-of-two spacing is used for size classes.
132 The default value is 512 bytes.
133 This option can be specified multiple times.
140 Consult the source for details on this option.
142 Attempting to allocate zero bytes will return a
144 pointer instead of a valid pointer.
145 (The default behavior is to make a minimal allocation and return a
147 This option is provided for System V compatibility.
148 This option is incompatible with the
152 Rather than return failure for any allocation function,
153 display a diagnostic message on
155 and cause the program to drop
158 This option should be set at compile time by including the following in
160 .Bd -literal -offset indent
161 _malloc_options = "X";
165 Each byte of new memory allocated by
168 will be initialized to 0.
169 Note that this initialization only happens once for each byte, so
171 does not zero memory that was previously allocated.
172 This is intended for debugging and will impact performance negatively.
179 options are intended for testing and debugging.
180 An application which changes its behavior when these options are used
182 .Sh IMPLEMENTATION NOTES
185 allocator uses multiple arenas in order to reduce lock
186 contention for threaded programs on multi-processor systems.
187 This works well with regard to threading scalability, but incurs some costs.
188 There is a small fixed per-arena overhead, and additionally, arenas manage
189 memory completely independently of each other, which means a small fixed
190 increase in overall memory fragmentation.
191 These overheads are not generally an issue,
192 given the number of arenas normally used.
193 Note that using substantially more arenas than the default is not likely to
194 improve performance, mainly due to reduced cache performance.
195 However, it may make sense to reduce the number of arenas if an application
196 does not make much use of the allocation functions.
198 Memory is conceptually broken into equal-sized chunks,
199 where the chunk size is a power of two that is greater than the page size.
200 Chunks are always aligned to multiples of the chunk size.
201 This alignment makes it possible to find
202 metadata for user objects very quickly.
204 User objects are broken into three categories according to size:
207 Small objects are smaller than one page.
209 Large objects are smaller than the chunk size.
211 Huge objects are a multiple of the chunk size.
214 Small and large objects are managed by arenas; huge objects are managed
215 separately in a single data structure that is shared by all threads.
216 Huge objects are used by applications infrequently enough that this single
217 data structure is not a scalability issue.
219 Each chunk that is managed by an arena tracks its contents in a page map as
220 runs of contiguous pages (unused, backing a set of small objects, or backing
222 The combination of chunk alignment and chunk page maps makes it possible to
223 determine all metadata regarding small and large allocations in constant time.
225 Small objects are managed in groups by page runs.
226 Each run maintains a bitmap that tracks which regions are in use.
227 Allocation requests can be grouped as follows.
229 .Bl -bullet -offset 3n
231 Allocation requests that are no more than half the quantum (see the
233 option) are rounded up to the nearest power of two (typically 2, 4, or 8).
235 Allocation requests that are more than half the quantum, but no more than the
236 maximum quantum-multiple size class (see the
238 option) are rounded up to the nearest multiple of the quantum.
240 Allocation requests that are larger than the maximum quantum-multiple size
241 class, but no larger than one half of a page, are rounded up to the nearest
244 Allocation requests that are larger than half of a page, but small enough to
245 fit in an arena-managed chunk (see the
247 option), are rounded up to the nearest run size.
249 Allocation requests that are too large to fit in an arena-managed chunk are
250 rounded up to the nearest multiple of the chunk size.
253 Allocations are packed tightly together, which can be an issue for
254 multi-threaded applications.
255 If you need to assure that allocations do not suffer from cache line sharing,
256 round your allocation requests up to the nearest multiple of the cache line
259 The first thing to do is to set the
262 This option forces a coredump (if possible) at the first sign of trouble,
263 rather than the normal policy of trying to continue if at all possible.
265 It is probably also a good idea to recompile the program with suitable
266 options and symbols for debugger support.
268 If the program starts to give unusual results, coredump or generally behave
269 differently without emitting any of the messages mentioned in the next
270 section, it is likely because it depends on the storage being filled with
272 Try running it with the
275 if that improves the situation, this diagnosis has been confirmed.
276 If the program still misbehaves,
277 the likely problem is accessing memory outside the allocated area.
279 Alternatively, if the symptoms are not easy to reproduce, setting the
281 option may help provoke the problem.
282 In truly difficult cases, the
284 option, if supported by the kernel, can provide a detailed trace of
285 all calls made to these functions.
289 does not provide much detail about the problems it detects;
290 the performance impact for storing such information would be prohibitive.
291 There are a number of allocator implementations available on the Internet
292 which focus on detecting and pinpointing problems by trading performance for
293 extra sanity checks and detailed diagnostics.
295 If any of the memory allocation/deallocation functions detect an error or
296 warning condition, a message will be printed to file descriptor
298 Errors will result in the process dumping core.
301 option is set, all warnings are treated as errors.
304 .\" XXX: The _malloc_message should be documented
305 .\" better in order to be worth mentioning.
309 variable allows the programmer to override the function which emits
310 the text strings forming the errors and warnings if for some reason
313 file descriptor is not suitable for this.
314 Please note that doing anything which tries to allocate memory in
315 this function is likely to result in a crash or deadlock.
317 All messages are prefixed by
318 .Dq Ao Ar progname Ac Ns Li \&: Pq malloc .
320 The following environment variables affect the execution of the allocation
322 .Bl -tag -width ".Ev MALLOC_OPTIONS"
323 .It Ev MALLOC_OPTIONS
324 If the environment variable
326 is set, the characters it contains will be interpreted as flags to the
327 allocation functions.
330 To dump core whenever a problem occurs:
332 .Bd -literal -offset indent
333 ln -s 'A' /etc/malloc.conf
336 To specify in the source that a program does no return value checking
337 on calls to these functions:
338 .Bd -literal -offset indent
339 _malloc_options = "X";
345 .Xr memoryallocators 9
347 .\" XXX: Add more references that could be worth reading.
351 .%T "A Scalable Concurrent malloc(3) Implementation for FreeBSD"
354 .%U http://people.freebsd.org/~jasone/jemalloc/bsdcan2006/jemalloc.pdf
357 .%A Poul-Henning Kamp
358 .%T "Malloc(3) revisited"
359 .%I USENIX Association
360 .%B Proceedings of the FREENIX Track: 1998 USENIX Annual Technical Conference
362 .%U http://www.usenix.org/publications/library/proceedings/usenix98/freenix/kamp.pdf
366 .%A Mark S. Johnstone
369 .%T "Dynamic Storage Allocation: A Survey and Critical Review"
371 .%I University of Texas at Austin
372 .%U ftp://ftp.cs.utexas.edu/pub/garbage/allocsrv.ps
377 allocator became the default system allocator first in
381 In both systems it replaced the older so-called
385 .An Jason Evans Aq jasone@canonware.com