1 .\" Copyright (c) 1993 by Thomas Koenig (ig25@rz.uni-karlsruhe.de)
2 .\" and Copyright i2007, 2012, 2018, Michael Kerrisk <mtk.manpages@gmail.com>
4 .\" %%%LICENSE_START(VERBATIM)
5 .\" Permission is granted to make and distribute verbatim copies of this
6 .\" manual provided the copyright notice and this permission notice are
7 .\" preserved on all copies.
9 .\" Permission is granted to copy and distribute modified versions of this
10 .\" manual under the conditions for verbatim copying, provided that the
11 .\" entire resulting derived work is distributed under the terms of a
12 .\" permission notice identical to this one.
14 .\" Since the Linux kernel and libraries are constantly changing, this
15 .\" manual page may be incorrect or out-of-date. The author(s) assume no
16 .\" responsibility for errors or omissions, or for damages resulting from
17 .\" the use of the information contained herein. The author(s) may not
18 .\" have taken the same level of care in the production of this manual,
19 .\" which is licensed free of charge, as they might when working
22 .\" Formatted or processed versions of this manual, if unaccompanied by
23 .\" the source, must acknowledge the copyright and authors of this work.
26 .\" Modified Sat Jul 24 19:00:59 1993 by Rik Faith (faith@cs.unc.edu)
27 .\" Clarification concerning realloc, iwj10@cus.cam.ac.uk (Ian Jackson), 950701
28 .\" Documented MALLOC_CHECK_, Wolfram Gloger (wmglo@dent.med.uni-muenchen.de)
29 .\" 2007-09-15 mtk: added notes on malloc()'s use of sbrk() and mmap().
31 .\" FIXME . Review http://austingroupbugs.net/view.php?id=374
32 .\" to see what changes are required on this page.
34 .TH MALLOC 3 2021-03-22 "GNU" "Linux Programmer's Manual"
36 malloc, free, calloc, realloc, reallocarray \- allocate and free dynamic memory
39 .B #include <stdlib.h>
41 .BI "void *malloc(size_t " "size" );
42 .BI "void free(void " "*ptr" );
43 .BI "void *calloc(size_t " "nmemb" ", size_t " "size" );
44 .BI "void *realloc(void " "*ptr" ", size_t " "size" );
45 .BI "void *reallocarray(void " "*ptr" ", size_t " nmemb ", size_t " "size" );
49 Feature Test Macro Requirements for glibc (see
50 .BR feature_test_macros (7)):
57 Glibc 2.28 and earlier:
65 bytes and returns a pointer to the allocated memory.
66 .IR "The memory is not initialized" .
73 or a unique pointer value that can later be successfully passed to
78 function frees the memory space pointed to by
80 which must have been returned by a previous call to
87 has already been called before, undefined behavior occurs.
90 is NULL, no operation is performed.
94 function allocates memory for an array of
98 bytes each and returns a pointer to the allocated memory.
99 The memory is set to zero.
108 or a unique pointer value that can later be successfully passed to
110 If the multiplication of
114 would result in integer overflow, then
118 an integer overflow would not be detected in the following call to
120 with the result that an incorrectly sized block of memory would be allocated:
124 malloc(nmemb * size);
130 function changes the size of the memory block pointed to by
135 The contents will be unchanged in the range from the start of the region
136 up to the minimum of the old and new sizes.
137 If the new size is larger than the old size, the added memory will
142 is NULL, then the call is equivalent to
151 is not NULL, then the call is equivalent to
153 (this behavior is nonportable; see NOTES).
156 is NULL, it must have been returned by an earlier call to
161 If the area pointed to was moved, a
167 function changes the size of the memory block pointed to by
169 to be large enough for an array of
171 elements, each of which is
174 It is equivalent to the call
177 realloc(ptr, nmemb * size);
184 fails safely in the case where the multiplication would overflow.
185 If such an overflow occurs,
191 and leaves the original block of memory unchanged.
197 functions return a pointer to the allocated memory,
198 which is suitably aligned for any built-in type.
199 On error, these functions return NULL.
200 NULL may also be returned by a successful call to
205 or by a successful call to
215 function returns no value.
219 function returns a pointer to the newly allocated memory, which is suitably
220 aligned for any built-in type, or NULL if the request failed.
221 The returned pointer may be the same as
223 if the allocation was not moved
224 (e.g., there was room to expand the allocation in-place), or different from
226 if the allocation was moved to a new address.
229 was equal to 0, either NULL or a pointer suitable to be passed to
234 fails, the original block is left untouched; it is not freed or moved.
238 function returns a pointer to the newly allocated memory.
240 it returns NULL and the original block of memory is left untouched.
247 can fail with the following error:
251 Possibly, the application hit the
259 first appeared in glibc in version 2.26.
261 For an explanation of the terms used in this section, see
269 Interface Attribute Value
275 T} Thread safety MT-Safe
285 POSIX.1-2001, POSIX.1-2008, C89, C99.
288 is a nonstandard extension that first appeared in OpenBSD 5.6 and FreeBSD 11.0.
290 By default, Linux follows an optimistic memory allocation strategy.
293 returns non-NULL there is no guarantee that the memory really
295 In case it turns out that the system is out of memory,
296 one or more processes will be killed by the OOM killer.
297 For more information, see the description of
298 .IR /proc/sys/vm/overcommit_memory
300 .IR /proc/sys/vm/oom_adj
303 and the Linux kernel source file
304 .IR Documentation/vm/overcommit\-accounting.rst .
308 allocates memory from the heap, and adjusts the size of the heap
311 When allocating blocks of memory larger than
315 implementation allocates the memory as a private anonymous mapping using
318 is 128\ kB by default, but is adjustable using
321 allocations performed using
323 were unaffected by the
326 since Linux 4.7, this limit is also enforced for allocations performed using
329 To avoid corruption in multithreaded applications,
330 mutexes are used internally to protect the memory-management
331 data structures employed by these functions.
332 In a multithreaded application in which threads simultaneously
333 allocate and free memory,
334 there could be contention for these mutexes.
335 To scalably handle memory allocation in multithreaded applications,
336 glibc creates additional
337 .IR "memory allocation arenas"
338 if mutex contention is detected.
339 Each arena is a large region of memory that is internally allocated
345 and managed with its own mutexes.
357 Glibc assumes that this is done
358 (and the glibc versions of these routines do this); if you
359 use a private malloc implementation that does not set
361 then certain library routines may fail without having
371 are almost always related to heap corruption, such as overflowing
372 an allocated chunk or freeing the same pointer twice.
376 implementation is tunable via environment variables; see
379 .SS Nonportable behavior
389 other implementations may return NULL, and set
391 Portable POSIX programs should avoid it.
395 .\" http://g.oswego.edu/dl/html/malloc.html
396 .\" A Memory Allocator - by Doug Lea
398 .\" http://www.bozemanpass.com/info/linux/malloc/Linux_Heap_Contention.html
399 .\" Linux Heap, Contention in free() - David Boreham
401 .\" http://www.citi.umich.edu/projects/linux-scalability/reports/malloc.html
402 .\" malloc() Performance in a Multithreaded Linux Environment -
403 .\" Check Lever, David Boreham
411 .BR malloc_get_state (3),
414 .BR malloc_usable_size (3),
418 .BR posix_memalign (3)
420 For details of the GNU C library implementation, see
421 .UR https://sourceware.org/glibc/wiki/MallocInternals