The main repository for the StreamModule project.
Revision | 135d651ff1aecc1008d1e2de82b91c9bb0a39599 (tree) |
---|---|
Time | 2018-06-06 21:08:44 |
Author | Eric Hopper <hopper@omni...> |
Commiter | Eric Hopper |
Merge cleanup changes on master.
@@ -12,3 +12,28 @@ | ||
12 | 12 | ^config\.status$ |
13 | 13 | ^configure$ |
14 | 14 | ^distbin/proclibsrc\.pl$ |
15 | +^EHnet\+\+/tests/testinetaddr$ | |
16 | +^StrMod/tests/server$ | |
17 | +^StrMod/tests/echoserv$ | |
18 | +^StrMod/tests/multitest$ | |
19 | +^StrMod/tests/testdist$ | |
20 | +^StrMod/tests/teststr$ | |
21 | +^StrMod/tests/testchunk$ | |
22 | +^StrMod/tests/testecho$ | |
23 | +^StrMod/tests/testextent$ | |
24 | +^StrMod/tests/testGV$ | |
25 | +^StrMod/tests/testserial$ | |
26 | +^StrMod/tests/teststrfd$ | |
27 | +^StrMod/tests/testsplit$ | |
28 | +^StrMod/tests/testsock$ | |
29 | +^StrMod/tests/ttelnet$ | |
30 | +^StrMod/tests/testPreAlloc$ | |
31 | +^StrMod/tests/infinite$ | |
32 | +^StrMod/tests/tstelnet$ | |
33 | +^StrMod/tests/testvisitor$ | |
34 | +^StrMod/tests/routetest$ | |
35 | +^UniEvent/tests/testsimple$ | |
36 | +^UniEvent/tests/testUPoll$ | |
37 | +^UniEvent/tests/testsig$ | |
38 | +^UniEvent/tests/testtimer$ | |
39 | +^UniEvent/tests/testupoll$ |
@@ -1,1 +0,0 @@ | ||
1 | -testinetaddr |
@@ -1,1 +0,0 @@ | ||
1 | -refcnt |
@@ -1,109 +0,0 @@ | ||
1 | -/* | |
2 | - * Copyright 1991-2010 Eric M. Hopper <hopper@omnifarious.org> | |
3 | - * | |
4 | - * This program is free software; you can redistribute it and/or modify it | |
5 | - * under the terms of the GNU Lesser General Public License as published | |
6 | - * by the Free Software Foundation; either version 2 of the License, or | |
7 | - * (at your option) any later version. | |
8 | - * | |
9 | - * This program is distributed in the hope that it will be useful, but | |
10 | - * WITHOUT ANY WARRANTY; without even the implied warranty of | |
11 | - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
12 | - * Lesser General Public License for more details. | |
13 | - * | |
14 | - * You should have received a copy of the GNU Lesser General Public | |
15 | - * License along with this program; if not, write to the Free Software | |
16 | - * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. | |
17 | - */ | |
18 | - | |
19 | -/* $Header$ */ | |
20 | - | |
21 | -// For a log, see ../ChangeLog | |
22 | -// | |
23 | -// Revision 1.1 1997/05/12 16:24:40 hopper | |
24 | -// Preliminary, possibly incomplete test of RefCountPtr classes. | |
25 | -// | |
26 | - | |
27 | -#include <iostream> | |
28 | -#include "LCore/RefCounting.h" | |
29 | -#include "LCore/RefCountPtr.h" | |
30 | -#include "LCore/RefCountPtrT.h" | |
31 | - | |
32 | -using std::ostream; | |
33 | - | |
34 | -static inline ostream &operator <<(ostream &os, const ReferenceCounting &obj) | |
35 | -{ | |
36 | - os << "RC(" << obj.NumReferences() << ")"; | |
37 | - return(os); | |
38 | -} | |
39 | - | |
40 | -static inline ostream &operator <<(ostream &os, const RefCountPtr &ptr) | |
41 | -{ | |
42 | - if (ptr) { | |
43 | - os << "->RC(" << ptr->NumReferences() << ")"; | |
44 | - } else { | |
45 | - os << "->NULL"; | |
46 | - } | |
47 | - return(os); | |
48 | -} | |
49 | - | |
50 | -//--- | |
51 | - | |
52 | -class MyRC : public ReferenceCounting { | |
53 | - public: | |
54 | - static const EH_ClassIdent identifier; | |
55 | - | |
56 | - MyRC(ostream &os) : ReferenceCounting(0), logstr(os) { } | |
57 | - virtual ~MyRC(); | |
58 | - | |
59 | - inline virtual int AreYouA(const ClassIdent &cid) const; | |
60 | - | |
61 | - protected: | |
62 | - inline virtual const ClassIdent *i_GetIdent() const { return(&identifier); } | |
63 | - | |
64 | - private: | |
65 | - ostream &logstr; | |
66 | -}; | |
67 | - | |
68 | -const EH_ClassIdent MyRC::identifier(EH_ClassNum(EH_ClassNum::User0, 0)); | |
69 | - | |
70 | -MyRC::~MyRC() | |
71 | -{ | |
72 | - logstr << "MyRC dying: " << *this << "\n"; | |
73 | -} | |
74 | - | |
75 | -inline int MyRC::AreYouA(const ClassIdent &cid) const | |
76 | -{ | |
77 | - return((identifier == cid) || ReferenceCounting::AreYouA(cid)); | |
78 | -} | |
79 | - | |
80 | -//--- | |
81 | - | |
82 | -int main() | |
83 | -{ | |
84 | - ReferenceCounting obj(1); | |
85 | - RefCountPtrT<MyRC> mptr = new MyRC(cout); | |
86 | - cout << "1: " << obj << endl; | |
87 | - | |
88 | - { | |
89 | - RefCountPtr ptr = &obj; | |
90 | - RefCountPtr &rmptr = mptr; | |
91 | - | |
92 | - cout << "2: " << obj << endl; | |
93 | - ptr = mptr; | |
94 | - cout << "3: mptr == " << mptr << " && obj == " << obj << "\n"; | |
95 | - ptr = 0; | |
96 | - cout << "4: mptr == " << mptr << " && obj == " << obj << "\n"; | |
97 | - ptr = rmptr; | |
98 | - cout << "5: mptr == " << mptr << " && obj == " << obj << "\n"; | |
99 | - rmptr = 0; | |
100 | - cout << "6: mptr == " << mptr << " && obj == " << obj << "\n"; | |
101 | - rmptr = ptr; | |
102 | - cout << "7: mptr == " << mptr << " && obj == " << obj << "\n"; | |
103 | - rmptr = &obj; | |
104 | - cout << "8: mptr == " << mptr << " && obj == " << obj << endl; | |
105 | - } | |
106 | - | |
107 | - cout << "9: " << obj << endl; | |
108 | - return(0); | |
109 | -} |
@@ -1,20 +0,0 @@ | ||
1 | -server | |
2 | -echoserv | |
3 | -multitest | |
4 | -testdist | |
5 | -teststr | |
6 | -testchunk | |
7 | -testecho | |
8 | -testextent | |
9 | -testGV | |
10 | -.dtinfo | |
11 | -testserial | |
12 | -teststrfd | |
13 | -testsplit | |
14 | -testsock | |
15 | -ttelnet | |
16 | -testPreAlloc | |
17 | -infinite | |
18 | -tstelnet | |
19 | -testvisitor | |
20 | -routetest |
@@ -1,3195 +0,0 @@ | ||
1 | -/* | |
2 | - * Since this was released to the public domain, I'm perfectly free to | |
3 | - * recopyrigt it under the LGPL. -) | |
4 | - * | |
5 | - * Copyright 1991-2010 Eric M. Hopper <hopper@omnifarious.org> | |
6 | - * | |
7 | - * This program is free software; you can redistribute it and/or modify it | |
8 | - * under the terms of the GNU Lesser General Public License as published | |
9 | - * by the Free Software Foundation; either version 2 of the License, or | |
10 | - * (at your option) any later version. | |
11 | - * | |
12 | - * This program is distributed in the hope that it will be useful, but | |
13 | - * WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
15 | - * Lesser General Public License for more details. | |
16 | - * | |
17 | - * You should have received a copy of the GNU Lesser General Public | |
18 | - * License along with this program; if not, write to the Free Software | |
19 | - * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. | |
20 | - */ | |
21 | - | |
22 | -/* ---------- To make a malloc.h, start cutting here ------------ */ | |
23 | - | |
24 | -/* | |
25 | - A version of malloc/free/realloc written by Doug Lea and released to the | |
26 | - public domain. Send questions/comments/complaints/performance data | |
27 | - to dl@cs.oswego.edu | |
28 | - | |
29 | -* VERSION 2.6.5 Wed Jun 17 15:55:16 1998 Doug Lea (dl at gee) | |
30 | - | |
31 | - Note: There may be an updated version of this malloc obtainable at | |
32 | - ftp://g.oswego.edu/pub/misc/malloc.c | |
33 | - Check before installing! | |
34 | - | |
35 | - Note: This version differs from 2.6.4 only by correcting a | |
36 | - statement ordering error that could cause failures only | |
37 | - when calls to this malloc are interposed with calls to | |
38 | - other memory allocators. | |
39 | - | |
40 | -* Why use this malloc? | |
41 | - | |
42 | - This is not the fastest, most space-conserving, most portable, or | |
43 | - most tunable malloc ever written. However it is among the fastest | |
44 | - while also being among the most space-conserving, portable and tunable. | |
45 | - Consistent balance across these factors results in a good general-purpose | |
46 | - allocator. For a high-level description, see | |
47 | - http://g.oswego.edu/dl/html/malloc.html | |
48 | - | |
49 | -* Synopsis of public routines | |
50 | - | |
51 | - (Much fuller descriptions are contained in the program documentation below.) | |
52 | - | |
53 | - malloc(size_t n); | |
54 | - Return a pointer to a newly allocated chunk of at least n bytes, or null | |
55 | - if no space is available. | |
56 | - free(Void_t* p); | |
57 | - Release the chunk of memory pointed to by p, or no effect if p is null. | |
58 | - realloc(Void_t* p, size_t n); | |
59 | - Return a pointer to a chunk of size n that contains the same data | |
60 | - as does chunk p up to the minimum of (n, p's size) bytes, or null | |
61 | - if no space is available. The returned pointer may or may not be | |
62 | - the same as p. If p is null, equivalent to malloc. Unless the | |
63 | - #define REALLOC_ZERO_BYTES_FREES below is set, realloc with a | |
64 | - size argument of zero (re)allocates a minimum-sized chunk. | |
65 | - memalign(size_t alignment, size_t n); | |
66 | - Return a pointer to a newly allocated chunk of n bytes, aligned | |
67 | - in accord with the alignment argument, which must be a power of | |
68 | - two. | |
69 | - valloc(size_t n); | |
70 | - Equivalent to memalign(pagesize, n), where pagesize is the page | |
71 | - size of the system (or as near to this as can be figured out from | |
72 | - all the includes/defines below.) | |
73 | - pvalloc(size_t n); | |
74 | - Equivalent to valloc(minimum-page-that-holds(n)), that is, | |
75 | - round up n to nearest pagesize. | |
76 | - calloc(size_t unit, size_t quantity); | |
77 | - Returns a pointer to quantity * unit bytes, with all locations | |
78 | - set to zero. | |
79 | - cfree(Void_t* p); | |
80 | - Equivalent to free(p). | |
81 | - malloc_trim(size_t pad); | |
82 | - Release all but pad bytes of freed top-most memory back | |
83 | - to the system. Return 1 if successful, else 0. | |
84 | - malloc_usable_size(Void_t* p); | |
85 | - Report the number usable allocated bytes associated with allocated | |
86 | - chunk p. This may or may not report more bytes than were requested, | |
87 | - due to alignment and minimum size constraints. | |
88 | - malloc_stats(); | |
89 | - Prints brief summary statistics on stderr. | |
90 | - mallinfo() | |
91 | - Returns (by copy) a struct containing various summary statistics. | |
92 | - mallopt(int parameter_number, int parameter_value) | |
93 | - Changes one of the tunable parameters described below. Returns | |
94 | - 1 if successful in changing the parameter, else 0. | |
95 | - | |
96 | -* Vital statistics: | |
97 | - | |
98 | - Alignment: 8-byte | |
99 | - 8 byte alignment is currently hardwired into the design. This | |
100 | - seems to suffice for all current machines and C compilers. | |
101 | - | |
102 | - Assumed pointer representation: 4 or 8 bytes | |
103 | - Code for 8-byte pointers is untested by me but has worked | |
104 | - reliably by Wolfram Gloger, who contributed most of the | |
105 | - changes supporting this. | |
106 | - | |
107 | - Assumed size_t representation: 4 or 8 bytes | |
108 | - Note that size_t is allowed to be 4 bytes even if pointers are 8. | |
109 | - | |
110 | - Minimum overhead per allocated chunk: 4 or 8 bytes | |
111 | - Each malloced chunk has a hidden overhead of 4 bytes holding size | |
112 | - and status information. | |
113 | - | |
114 | - Minimum allocated size: 4-byte ptrs: 16 bytes (including 4 overhead) | |
115 | - 8-byte ptrs: 24/32 bytes (including, 4/8 overhead) | |
116 | - | |
117 | - When a chunk is freed, 12 (for 4byte ptrs) or 20 (for 8 byte | |
118 | - ptrs but 4 byte size) or 24 (for 8/8) additional bytes are | |
119 | - needed; 4 (8) for a trailing size field | |
120 | - and 8 (16) bytes for free list pointers. Thus, the minimum | |
121 | - allocatable size is 16/24/32 bytes. | |
122 | - | |
123 | - Even a request for zero bytes (i.e., malloc(0)) returns a | |
124 | - pointer to something of the minimum allocatable size. | |
125 | - | |
126 | - Maximum allocated size: 4-byte size_t: 2^31 - 8 bytes | |
127 | - 8-byte size_t: 2^63 - 16 bytes | |
128 | - | |
129 | - It is assumed that (possibly signed) size_t bit values suffice to | |
130 | - represent chunk sizes. `Possibly signed' is due to the fact | |
131 | - that `size_t' may be defined on a system as either a signed or | |
132 | - an unsigned type. To be conservative, values that would appear | |
133 | - as negative numbers are avoided. | |
134 | - Requests for sizes with a negative sign bit will return a | |
135 | - minimum-sized chunk. | |
136 | - | |
137 | - Maximum overhead wastage per allocated chunk: normally 15 bytes | |
138 | - | |
139 | - Alignnment demands, plus the minimum allocatable size restriction | |
140 | - make the normal worst-case wastage 15 bytes (i.e., up to 15 | |
141 | - more bytes will be allocated than were requested in malloc), with | |
142 | - two exceptions: | |
143 | - 1. Because requests for zero bytes allocate non-zero space, | |
144 | - the worst case wastage for a request of zero bytes is 24 bytes. | |
145 | - 2. For requests >= mmap_threshold that are serviced via | |
146 | - mmap(), the worst case wastage is 8 bytes plus the remainder | |
147 | - from a system page (the minimal mmap unit); typically 4096 bytes. | |
148 | - | |
149 | -* Limitations | |
150 | - | |
151 | - Here are some features that are NOT currently supported | |
152 | - | |
153 | - * No user-definable hooks for callbacks and the like. | |
154 | - * No automated mechanism for fully checking that all accesses | |
155 | - to malloced memory stay within their bounds. | |
156 | - * No support for compaction. | |
157 | - | |
158 | -* Synopsis of compile-time options: | |
159 | - | |
160 | - People have reported using previous versions of this malloc on all | |
161 | - versions of Unix, sometimes by tweaking some of the defines | |
162 | - below. It has been tested most extensively on Solaris and | |
163 | - Linux. It is also reported to work on WIN32 platforms. | |
164 | - People have also reported adapting this malloc for use in | |
165 | - stand-alone embedded systems. | |
166 | - | |
167 | - The implementation is in straight, hand-tuned ANSI C. Among other | |
168 | - consequences, it uses a lot of macros. Because of this, to be at | |
169 | - all usable, this code should be compiled using an optimizing compiler | |
170 | - (for example gcc -O2) that can simplify expressions and control | |
171 | - paths. | |
172 | - | |
173 | - __STD_C (default: derived from C compiler defines) | |
174 | - Nonzero if using ANSI-standard C compiler, a C++ compiler, or | |
175 | - a C compiler sufficiently close to ANSI to get away with it. | |
176 | - DEBUG (default: NOT defined) | |
177 | - Define to enable debugging. Adds fairly extensive assertion-based | |
178 | - checking to help track down memory errors, but noticeably slows down | |
179 | - execution. | |
180 | - REALLOC_ZERO_BYTES_FREES (default: NOT defined) | |
181 | - Define this if you think that realloc(p, 0) should be equivalent | |
182 | - to free(p). Otherwise, since malloc returns a unique pointer for | |
183 | - malloc(0), so does realloc(p, 0). | |
184 | - HAVE_MEMCPY (default: defined) | |
185 | - Define if you are not otherwise using ANSI STD C, but still | |
186 | - have memcpy and memset in your C library and want to use them. | |
187 | - Otherwise, simple internal versions are supplied. | |
188 | - USE_MEMCPY (default: 1 if HAVE_MEMCPY is defined, 0 otherwise) | |
189 | - Define as 1 if you want the C library versions of memset and | |
190 | - memcpy called in realloc and calloc (otherwise macro versions are used). | |
191 | - At least on some platforms, the simple macro versions usually | |
192 | - outperform libc versions. | |
193 | - HAVE_MMAP (default: defined as 1) | |
194 | - Define to non-zero to optionally make malloc() use mmap() to | |
195 | - allocate very large blocks. | |
196 | - HAVE_MREMAP (default: defined as 0 unless Linux libc set) | |
197 | - Define to non-zero to optionally make realloc() use mremap() to | |
198 | - reallocate very large blocks. | |
199 | - malloc_getpagesize (default: derived from system #includes) | |
200 | - Either a constant or routine call returning the system page size. | |
201 | - HAVE_USR_INCLUDE_MALLOC_H (default: NOT defined) | |
202 | - Optionally define if you are on a system with a /usr/include/malloc.h | |
203 | - that declares struct mallinfo. It is not at all necessary to | |
204 | - define this even if you do, but will ensure consistency. | |
205 | - INTERNAL_SIZE_T (default: size_t) | |
206 | - Define to a 32-bit type (probably `unsigned int') if you are on a | |
207 | - 64-bit machine, yet do not want or need to allow malloc requests of | |
208 | - greater than 2^31 to be handled. This saves space, especially for | |
209 | - very small chunks. | |
210 | - INTERNAL_LINUX_C_LIB (default: NOT defined) | |
211 | - Defined only when compiled as part of Linux libc. | |
212 | - Also note that there is some odd internal name-mangling via defines | |
213 | - (for example, internally, `malloc' is named `mALLOc') needed | |
214 | - when compiling in this case. These look funny but don't otherwise | |
215 | - affect anything. | |
216 | - WIN32 (default: undefined) | |
217 | - Define this on MS win (95, nt) platforms to compile in sbrk emulation. | |
218 | - LACKS_UNISTD_H (default: undefined) | |
219 | - Define this if your system does not have a <unistd.h>. | |
220 | - MORECORE (default: sbrk) | |
221 | - The name of the routine to call to obtain more memory from the system. | |
222 | - MORECORE_FAILURE (default: -1) | |
223 | - The value returned upon failure of MORECORE. | |
224 | - MORECORE_CLEARS (default 1) | |
225 | - True (1) if the routine mapped to MORECORE zeroes out memory (which | |
226 | - holds for sbrk). | |
227 | - DEFAULT_TRIM_THRESHOLD | |
228 | - DEFAULT_TOP_PAD | |
229 | - DEFAULT_MMAP_THRESHOLD | |
230 | - DEFAULT_MMAP_MAX | |
231 | - Default values of tunable parameters (described in detail below) | |
232 | - controlling interaction with host system routines (sbrk, mmap, etc). | |
233 | - These values may also be changed dynamically via mallopt(). The | |
234 | - preset defaults are those that give best performance for typical | |
235 | - programs/systems. | |
236 | - | |
237 | - | |
238 | -*/ | |
239 | - | |
240 | - | |
241 | - | |
242 | - | |
243 | -/* Preliminaries */ | |
244 | - | |
245 | -#ifndef __STD_C | |
246 | -#ifdef __STDC__ | |
247 | -#define __STD_C 1 | |
248 | -#else | |
249 | -#if __cplusplus | |
250 | -#define __STD_C 1 | |
251 | -#else | |
252 | -#define __STD_C 0 | |
253 | -#endif /*__cplusplus*/ | |
254 | -#endif /*__STDC__*/ | |
255 | -#endif /*__STD_C*/ | |
256 | - | |
257 | -#ifndef Void_t | |
258 | -#if __STD_C | |
259 | -#define Void_t void | |
260 | -#else | |
261 | -#define Void_t char | |
262 | -#endif | |
263 | -#endif /*Void_t*/ | |
264 | - | |
265 | -#if __STD_C | |
266 | -#include <stddef.h> /* for size_t */ | |
267 | -#else | |
268 | -#include <sys/types.h> | |
269 | -#endif | |
270 | - | |
271 | -#ifdef __cplusplus | |
272 | -extern "C" { | |
273 | -#endif | |
274 | - | |
275 | -#include <stdio.h> /* needed for malloc_stats */ | |
276 | - | |
277 | - | |
278 | -/* | |
279 | - Compile-time options | |
280 | -*/ | |
281 | - | |
282 | - | |
283 | -/* | |
284 | - Debugging: | |
285 | - | |
286 | - Because freed chunks may be overwritten with link fields, this | |
287 | - malloc will often die when freed memory is overwritten by user | |
288 | - programs. This can be very effective (albeit in an annoying way) | |
289 | - in helping track down dangling pointers. | |
290 | - | |
291 | - If you compile with -DDEBUG, a number of assertion checks are | |
292 | - enabled that will catch more memory errors. You probably won't be | |
293 | - able to make much sense of the actual assertion errors, but they | |
294 | - should help you locate incorrectly overwritten memory. The | |
295 | - checking is fairly extensive, and will slow down execution | |
296 | - noticeably. Calling malloc_stats or mallinfo with DEBUG set will | |
297 | - attempt to check every non-mmapped allocated and free chunk in the | |
298 | - course of computing the summmaries. (By nature, mmapped regions | |
299 | - cannot be checked very much automatically.) | |
300 | - | |
301 | - Setting DEBUG may also be helpful if you are trying to modify | |
302 | - this code. The assertions in the check routines spell out in more | |
303 | - detail the assumptions and invariants underlying the algorithms. | |
304 | - | |
305 | -*/ | |
306 | - | |
307 | -#if DEBUG | |
308 | -#include <assert.h> | |
309 | -#else | |
310 | -#define assert(x) ((void)0) | |
311 | -#endif | |
312 | - | |
313 | - | |
314 | -/* | |
315 | - INTERNAL_SIZE_T is the word-size used for internal bookkeeping | |
316 | - of chunk sizes. On a 64-bit machine, you can reduce malloc | |
317 | - overhead by defining INTERNAL_SIZE_T to be a 32 bit `unsigned int' | |
318 | - at the expense of not being able to handle requests greater than | |
319 | - 2^31. This limitation is hardly ever a concern; you are encouraged | |
320 | - to set this. However, the default version is the same as size_t. | |
321 | -*/ | |
322 | - | |
323 | -#ifndef INTERNAL_SIZE_T | |
324 | -#define INTERNAL_SIZE_T size_t | |
325 | -#endif | |
326 | - | |
327 | -/* | |
328 | - REALLOC_ZERO_BYTES_FREES should be set if a call to | |
329 | - realloc with zero bytes should be the same as a call to free. | |
330 | - Some people think it should. Otherwise, since this malloc | |
331 | - returns a unique pointer for malloc(0), so does realloc(p, 0). | |
332 | -*/ | |
333 | - | |
334 | - | |
335 | -/* #define REALLOC_ZERO_BYTES_FREES */ | |
336 | - | |
337 | - | |
338 | -/* | |
339 | - WIN32 causes an emulation of sbrk to be compiled in | |
340 | - mmap-based options are not currently supported in WIN32. | |
341 | -*/ | |
342 | - | |
343 | -/* #define WIN32 */ | |
344 | -#ifdef WIN32 | |
345 | -#define MORECORE wsbrk | |
346 | -#define HAVE_MMAP 0 | |
347 | -#endif | |
348 | - | |
349 | - | |
350 | -/* | |
351 | - HAVE_MEMCPY should be defined if you are not otherwise using | |
352 | - ANSI STD C, but still have memcpy and memset in your C library | |
353 | - and want to use them in calloc and realloc. Otherwise simple | |
354 | - macro versions are defined here. | |
355 | - | |
356 | - USE_MEMCPY should be defined as 1 if you actually want to | |
357 | - have memset and memcpy called. People report that the macro | |
358 | - versions are often enough faster than libc versions on many | |
359 | - systems that it is better to use them. | |
360 | - | |
361 | -*/ | |
362 | - | |
363 | -#define HAVE_MEMCPY | |
364 | - | |
365 | -#ifndef USE_MEMCPY | |
366 | -#ifdef HAVE_MEMCPY | |
367 | -#define USE_MEMCPY 1 | |
368 | -#else | |
369 | -#define USE_MEMCPY 0 | |
370 | -#endif | |
371 | -#endif | |
372 | - | |
373 | -#if (__STD_C || defined(HAVE_MEMCPY)) | |
374 | - | |
375 | -#if __STD_C | |
376 | -void* memset(void*, int, size_t); | |
377 | -void* memcpy(void*, const void*, size_t); | |
378 | -#else | |
379 | -Void_t* memset(); | |
380 | -Void_t* memcpy(); | |
381 | -#endif | |
382 | -#endif | |
383 | - | |
384 | -#if USE_MEMCPY | |
385 | - | |
386 | -/* The following macros are only invoked with (2n+1)-multiples of | |
387 | - INTERNAL_SIZE_T units, with a positive integer n. This is exploited | |
388 | - for fast inline execution when n is small. */ | |
389 | - | |
390 | -#define MALLOC_ZERO(charp, nbytes) \ | |
391 | -do { \ | |
392 | - INTERNAL_SIZE_T mzsz = (nbytes); \ | |
393 | - if(mzsz <= 9*sizeof(mzsz)) { \ | |
394 | - INTERNAL_SIZE_T* mz = (INTERNAL_SIZE_T*) (charp); \ | |
395 | - if(mzsz >= 5*sizeof(mzsz)) { *mz++ = 0; \ | |
396 | - *mz++ = 0; \ | |
397 | - if(mzsz >= 7*sizeof(mzsz)) { *mz++ = 0; \ | |
398 | - *mz++ = 0; \ | |
399 | - if(mzsz >= 9*sizeof(mzsz)) { *mz++ = 0; \ | |
400 | - *mz++ = 0; }}} \ | |
401 | - *mz++ = 0; \ | |
402 | - *mz++ = 0; \ | |
403 | - *mz = 0; \ | |
404 | - } else memset((charp), 0, mzsz); \ | |
405 | -} while(0) | |
406 | - | |
407 | -#define MALLOC_COPY(dest,src,nbytes) \ | |
408 | -do { \ | |
409 | - INTERNAL_SIZE_T mcsz = (nbytes); \ | |
410 | - if(mcsz <= 9*sizeof(mcsz)) { \ | |
411 | - INTERNAL_SIZE_T* mcsrc = (INTERNAL_SIZE_T*) (src); \ | |
412 | - INTERNAL_SIZE_T* mcdst = (INTERNAL_SIZE_T*) (dest); \ | |
413 | - if(mcsz >= 5*sizeof(mcsz)) { *mcdst++ = *mcsrc++; \ | |
414 | - *mcdst++ = *mcsrc++; \ | |
415 | - if(mcsz >= 7*sizeof(mcsz)) { *mcdst++ = *mcsrc++; \ | |
416 | - *mcdst++ = *mcsrc++; \ | |
417 | - if(mcsz >= 9*sizeof(mcsz)) { *mcdst++ = *mcsrc++; \ | |
418 | - *mcdst++ = *mcsrc++; }}} \ | |
419 | - *mcdst++ = *mcsrc++; \ | |
420 | - *mcdst++ = *mcsrc++; \ | |
421 | - *mcdst = *mcsrc ; \ | |
422 | - } else memcpy(dest, src, mcsz); \ | |
423 | -} while(0) | |
424 | - | |
425 | -#else /* !USE_MEMCPY */ | |
426 | - | |
427 | -/* Use Duff's device for good zeroing/copying performance. */ | |
428 | - | |
429 | -#define MALLOC_ZERO(charp, nbytes) \ | |
430 | -do { \ | |
431 | - INTERNAL_SIZE_T* mzp = (INTERNAL_SIZE_T*)(charp); \ | |
432 | - long mctmp = (nbytes)/sizeof(INTERNAL_SIZE_T), mcn; \ | |
433 | - if (mctmp < 8) mcn = 0; else { mcn = (mctmp-1)/8; mctmp %= 8; } \ | |
434 | - switch (mctmp) { \ | |
435 | - case 0: for(;;) { *mzp++ = 0; \ | |
436 | - case 7: *mzp++ = 0; \ | |
437 | - case 6: *mzp++ = 0; \ | |
438 | - case 5: *mzp++ = 0; \ | |
439 | - case 4: *mzp++ = 0; \ | |
440 | - case 3: *mzp++ = 0; \ | |
441 | - case 2: *mzp++ = 0; \ | |
442 | - case 1: *mzp++ = 0; if(mcn <= 0) break; mcn--; } \ | |
443 | - } \ | |
444 | -} while(0) | |
445 | - | |
446 | -#define MALLOC_COPY(dest,src,nbytes) \ | |
447 | -do { \ | |
448 | - INTERNAL_SIZE_T* mcsrc = (INTERNAL_SIZE_T*) src; \ | |
449 | - INTERNAL_SIZE_T* mcdst = (INTERNAL_SIZE_T*) dest; \ | |
450 | - long mctmp = (nbytes)/sizeof(INTERNAL_SIZE_T), mcn; \ | |
451 | - if (mctmp < 8) mcn = 0; else { mcn = (mctmp-1)/8; mctmp %= 8; } \ | |
452 | - switch (mctmp) { \ | |
453 | - case 0: for(;;) { *mcdst++ = *mcsrc++; \ | |
454 | - case 7: *mcdst++ = *mcsrc++; \ | |
455 | - case 6: *mcdst++ = *mcsrc++; \ | |
456 | - case 5: *mcdst++ = *mcsrc++; \ | |
457 | - case 4: *mcdst++ = *mcsrc++; \ | |
458 | - case 3: *mcdst++ = *mcsrc++; \ | |
459 | - case 2: *mcdst++ = *mcsrc++; \ | |
460 | - case 1: *mcdst++ = *mcsrc++; if(mcn <= 0) break; mcn--; } \ | |
461 | - } \ | |
462 | -} while(0) | |
463 | - | |
464 | -#endif | |
465 | - | |
466 | - | |
467 | -/* | |
468 | - Define HAVE_MMAP to optionally make malloc() use mmap() to | |
469 | - allocate very large blocks. These will be returned to the | |
470 | - operating system immediately after a free(). | |
471 | -*/ | |
472 | - | |
473 | -#ifndef HAVE_MMAP | |
474 | -#define HAVE_MMAP 1 | |
475 | -#endif | |
476 | - | |
477 | -/* | |
478 | - Define HAVE_MREMAP to make realloc() use mremap() to re-allocate | |
479 | - large blocks. This is currently only possible on Linux with | |
480 | - kernel versions newer than 1.3.77. | |
481 | -*/ | |
482 | - | |
483 | -#ifndef HAVE_MREMAP | |
484 | -#ifdef INTERNAL_LINUX_C_LIB | |
485 | -#define HAVE_MREMAP 1 | |
486 | -#else | |
487 | -#define HAVE_MREMAP 0 | |
488 | -#endif | |
489 | -#endif | |
490 | - | |
491 | -#if HAVE_MMAP | |
492 | - | |
493 | -#include <unistd.h> | |
494 | -#include <fcntl.h> | |
495 | -#include <sys/mman.h> | |
496 | - | |
497 | -#if !defined(MAP_ANONYMOUS) && defined(MAP_ANON) | |
498 | -#define MAP_ANONYMOUS MAP_ANON | |
499 | -#endif | |
500 | - | |
501 | -#endif /* HAVE_MMAP */ | |
502 | - | |
503 | -/* | |
504 | - Access to system page size. To the extent possible, this malloc | |
505 | - manages memory from the system in page-size units. | |
506 | - | |
507 | - The following mechanics for getpagesize were adapted from | |
508 | - bsd/gnu getpagesize.h | |
509 | -*/ | |
510 | - | |
511 | -#ifndef LACKS_UNISTD_H | |
512 | -# include <unistd.h> | |
513 | -#endif | |
514 | - | |
515 | -#ifndef malloc_getpagesize | |
516 | -# ifdef _SC_PAGESIZE /* some SVR4 systems omit an underscore */ | |
517 | -# ifndef _SC_PAGE_SIZE | |
518 | -# define _SC_PAGE_SIZE _SC_PAGESIZE | |
519 | -# endif | |
520 | -# endif | |
521 | -# ifdef _SC_PAGE_SIZE | |
522 | -# define malloc_getpagesize sysconf(_SC_PAGE_SIZE) | |
523 | -# else | |
524 | -# if defined(BSD) || defined(DGUX) || defined(HAVE_GETPAGESIZE) | |
525 | - extern size_t getpagesize(); | |
526 | -# define malloc_getpagesize getpagesize() | |
527 | -# else | |
528 | -# include <sys/param.h> | |
529 | -# ifdef EXEC_PAGESIZE | |
530 | -# define malloc_getpagesize EXEC_PAGESIZE | |
531 | -# else | |
532 | -# ifdef NBPG | |
533 | -# ifndef CLSIZE | |
534 | -# define malloc_getpagesize NBPG | |
535 | -# else | |
536 | -# define malloc_getpagesize (NBPG * CLSIZE) | |
537 | -# endif | |
538 | -# else | |
539 | -# ifdef NBPC | |
540 | -# define malloc_getpagesize NBPC | |
541 | -# else | |
542 | -# ifdef PAGESIZE | |
543 | -# define malloc_getpagesize PAGESIZE | |
544 | -# else | |
545 | -# define malloc_getpagesize (4096) /* just guess */ | |
546 | -# endif | |
547 | -# endif | |
548 | -# endif | |
549 | -# endif | |
550 | -# endif | |
551 | -# endif | |
552 | -#endif | |
553 | - | |
554 | - | |
555 | - | |
556 | -/* | |
557 | - | |
558 | - This version of malloc supports the standard SVID/XPG mallinfo | |
559 | - routine that returns a struct containing the same kind of | |
560 | - information you can get from malloc_stats. It should work on | |
561 | - any SVID/XPG compliant system that has a /usr/include/malloc.h | |
562 | - defining struct mallinfo. (If you'd like to install such a thing | |
563 | - yourself, cut out the preliminary declarations as described above | |
564 | - and below and save them in a malloc.h file. But there's no | |
565 | - compelling reason to bother to do this.) | |
566 | - | |
567 | - The main declaration needed is the mallinfo struct that is returned | |
568 | - (by-copy) by mallinfo(). The SVID/XPG malloinfo struct contains a | |
569 | - bunch of fields, most of which are not even meaningful in this | |
570 | - version of malloc. Some of these fields are are instead filled by | |
571 | - mallinfo() with other numbers that might possibly be of interest. | |
572 | - | |
573 | - HAVE_USR_INCLUDE_MALLOC_H should be set if you have a | |
574 | - /usr/include/malloc.h file that includes a declaration of struct | |
575 | - mallinfo. If so, it is included; else an SVID2/XPG2 compliant | |
576 | - version is declared below. These must be precisely the same for | |
577 | - mallinfo() to work. | |
578 | - | |
579 | -*/ | |
580 | - | |
581 | -/* #define HAVE_USR_INCLUDE_MALLOC_H */ | |
582 | - | |
583 | -#if HAVE_USR_INCLUDE_MALLOC_H | |
584 | -#include "/usr/include/malloc.h" | |
585 | -#else | |
586 | - | |
587 | -/* SVID2/XPG mallinfo structure */ | |
588 | - | |
589 | -struct mallinfo { | |
590 | - int arena; /* total space allocated from system */ | |
591 | - int ordblks; /* number of non-inuse chunks */ | |
592 | - int smblks; /* unused -- always zero */ | |
593 | - int hblks; /* number of mmapped regions */ | |
594 | - int hblkhd; /* total space in mmapped regions */ | |
595 | - int usmblks; /* unused -- always zero */ | |
596 | - int fsmblks; /* unused -- always zero */ | |
597 | - int uordblks; /* total allocated space */ | |
598 | - int fordblks; /* total non-inuse space */ | |
599 | - int keepcost; /* top-most, releasable (via malloc_trim) space */ | |
600 | -}; | |
601 | - | |
602 | -/* SVID2/XPG mallopt options */ | |
603 | - | |
604 | -#define M_MXFAST 1 /* UNUSED in this malloc */ | |
605 | -#define M_NLBLKS 2 /* UNUSED in this malloc */ | |
606 | -#define M_GRAIN 3 /* UNUSED in this malloc */ | |
607 | -#define M_KEEP 4 /* UNUSED in this malloc */ | |
608 | - | |
609 | -#endif | |
610 | - | |
611 | -/* mallopt options that actually do something */ | |
612 | - | |
613 | -#define M_TRIM_THRESHOLD -1 | |
614 | -#define M_TOP_PAD -2 | |
615 | -#define M_MMAP_THRESHOLD -3 | |
616 | -#define M_MMAP_MAX -4 | |
617 | - | |
618 | - | |
619 | - | |
620 | -#ifndef DEFAULT_TRIM_THRESHOLD | |
621 | -#define DEFAULT_TRIM_THRESHOLD (128 * 1024) | |
622 | -#endif | |
623 | - | |
624 | -/* | |
625 | - M_TRIM_THRESHOLD is the maximum amount of unused top-most memory | |
626 | - to keep before releasing via malloc_trim in free(). | |
627 | - | |
628 | - Automatic trimming is mainly useful in long-lived programs. | |
629 | - Because trimming via sbrk can be slow on some systems, and can | |
630 | - sometimes be wasteful (in cases where programs immediately | |
631 | - afterward allocate more large chunks) the value should be high | |
632 | - enough so that your overall system performance would improve by | |
633 | - releasing. | |
634 | - | |
635 | - The trim threshold and the mmap control parameters (see below) | |
636 | - can be traded off with one another. Trimming and mmapping are | |
637 | - two different ways of releasing unused memory back to the | |
638 | - system. Between these two, it is often possible to keep | |
639 | - system-level demands of a long-lived program down to a bare | |
640 | - minimum. For example, in one test suite of sessions measuring | |
641 | - the XF86 X server on Linux, using a trim threshold of 128K and a | |
642 | - mmap threshold of 192K led to near-minimal long term resource | |
643 | - consumption. | |
644 | - | |
645 | - If you are using this malloc in a long-lived program, it should | |
646 | - pay to experiment with these values. As a rough guide, you | |
647 | - might set to a value close to the average size of a process | |
648 | - (program) running on your system. Releasing this much memory | |
649 | - would allow such a process to run in memory. Generally, it's | |
650 | - worth it to tune for trimming rather tham memory mapping when a | |
651 | - program undergoes phases where several large chunks are | |
652 | - allocated and released in ways that can reuse each other's | |
653 | - storage, perhaps mixed with phases where there are no such | |
654 | - chunks at all. And in well-behaved long-lived programs, | |
655 | - controlling release of large blocks via trimming versus mapping | |
656 | - is usually faster. | |
657 | - | |
658 | - However, in most programs, these parameters serve mainly as | |
659 | - protection against the system-level effects of carrying around | |
660 | - massive amounts of unneeded memory. Since frequent calls to | |
661 | - sbrk, mmap, and munmap otherwise degrade performance, the default | |
662 | - parameters are set to relatively high values that serve only as | |
663 | - safeguards. | |
664 | - | |
665 | - The default trim value is high enough to cause trimming only in | |
666 | - fairly extreme (by current memory consumption standards) cases. | |
667 | - It must be greater than page size to have any useful effect. To | |
668 | - disable trimming completely, you can set to (unsigned long)(-1); | |
669 | - | |
670 | - | |
671 | -*/ | |
672 | - | |
673 | - | |
674 | -#ifndef DEFAULT_TOP_PAD | |
675 | -#define DEFAULT_TOP_PAD (0) | |
676 | -#endif | |
677 | - | |
678 | -/* | |
679 | - M_TOP_PAD is the amount of extra `padding' space to allocate or | |
680 | - retain whenever sbrk is called. It is used in two ways internally: | |
681 | - | |
682 | - * When sbrk is called to extend the top of the arena to satisfy | |
683 | - a new malloc request, this much padding is added to the sbrk | |
684 | - request. | |
685 | - | |
686 | - * When malloc_trim is called automatically from free(), | |
687 | - it is used as the `pad' argument. | |
688 | - | |
689 | - In both cases, the actual amount of padding is rounded | |
690 | - so that the end of the arena is always a system page boundary. | |
691 | - | |
692 | - The main reason for using padding is to avoid calling sbrk so | |
693 | - often. Having even a small pad greatly reduces the likelihood | |
694 | - that nearly every malloc request during program start-up (or | |
695 | - after trimming) will invoke sbrk, which needlessly wastes | |
696 | - time. | |
697 | - | |
698 | - Automatic rounding-up to page-size units is normally sufficient | |
699 | - to avoid measurable overhead, so the default is 0. However, in | |
700 | - systems where sbrk is relatively slow, it can pay to increase | |
701 | - this value, at the expense of carrying around more memory than | |
702 | - the program needs. | |
703 | - | |
704 | -*/ | |
705 | - | |
706 | - | |
707 | -#ifndef DEFAULT_MMAP_THRESHOLD | |
708 | -#define DEFAULT_MMAP_THRESHOLD (128 * 1024) | |
709 | -#endif | |
710 | - | |
711 | -/* | |
712 | - | |
713 | - M_MMAP_THRESHOLD is the request size threshold for using mmap() | |
714 | - to service a request. Requests of at least this size that cannot | |
715 | - be allocated using already-existing space will be serviced via mmap. | |
716 | - (If enough normal freed space already exists it is used instead.) | |
717 | - | |
718 | - Using mmap segregates relatively large chunks of memory so that | |
719 | - they can be individually obtained and released from the host | |
720 | - system. A request serviced through mmap is never reused by any | |
721 | - other request (at least not directly; the system may just so | |
722 | - happen to remap successive requests to the same locations). | |
723 | - | |
724 | - Segregating space in this way has the benefit that mmapped space | |
725 | - can ALWAYS be individually released back to the system, which | |
726 | - helps keep the system level memory demands of a long-lived | |
727 | - program low. Mapped memory can never become `locked' between | |
728 | - other chunks, as can happen with normally allocated chunks, which | |
729 | - menas that even trimming via malloc_trim would not release them. | |
730 | - | |
731 | - However, it has the disadvantages that: | |
732 | - | |
733 | - 1. The space cannot be reclaimed, consolidated, and then | |
734 | - used to service later requests, as happens with normal chunks. | |
735 | - 2. It can lead to more wastage because of mmap page alignment | |
736 | - requirements | |
737 | - 3. It causes malloc performance to be more dependent on host | |
738 | - system memory management support routines which may vary in | |
739 | - implementation quality and may impose arbitrary | |
740 | - limitations. Generally, servicing a request via normal | |
741 | - malloc steps is faster than going through a system's mmap. | |
742 | - | |
743 | - All together, these considerations should lead you to use mmap | |
744 | - only for relatively large requests. | |
745 | - | |
746 | - | |
747 | -*/ | |
748 | - | |
749 | - | |
750 | - | |
751 | -#ifndef DEFAULT_MMAP_MAX | |
752 | -#if HAVE_MMAP | |
753 | -#define DEFAULT_MMAP_MAX (64) | |
754 | -#else | |
755 | -#define DEFAULT_MMAP_MAX (0) | |
756 | -#endif | |
757 | -#endif | |
758 | - | |
759 | -/* | |
760 | - M_MMAP_MAX is the maximum number of requests to simultaneously | |
761 | - service using mmap. This parameter exists because: | |
762 | - | |
763 | - 1. Some systems have a limited number of internal tables for | |
764 | - use by mmap. | |
765 | - 2. In most systems, overreliance on mmap can degrade overall | |
766 | - performance. | |
767 | - 3. If a program allocates many large regions, it is probably | |
768 | - better off using normal sbrk-based allocation routines that | |
769 | - can reclaim and reallocate normal heap memory. Using a | |
770 | - small value allows transition into this mode after the | |
771 | - first few allocations. | |
772 | - | |
773 | - Setting to 0 disables all use of mmap. If HAVE_MMAP is not set, | |
774 | - the default value is 0, and attempts to set it to non-zero values | |
775 | - in mallopt will fail. | |
776 | -*/ | |
777 | - | |
778 | - | |
779 | - | |
780 | - | |
781 | -/* | |
782 | - | |
783 | - Special defines for linux libc | |
784 | - | |
785 | - Except when compiled using these special defines for Linux libc | |
786 | - using weak aliases, this malloc is NOT designed to work in | |
787 | - multithreaded applications. No semaphores or other concurrency | |
788 | - control are provided to ensure that multiple malloc or free calls | |
789 | - don't run at the same time, which could be disasterous. A single | |
790 | - semaphore could be used across malloc, realloc, and free (which is | |
791 | - essentially the effect of the linux weak alias approach). It would | |
792 | - be hard to obtain finer granularity. | |
793 | - | |
794 | -*/ | |
795 | - | |
796 | - | |
797 | -#ifdef INTERNAL_LINUX_C_LIB | |
798 | - | |
799 | -#if __STD_C | |
800 | - | |
801 | -Void_t * __default_morecore_init (ptrdiff_t); | |
802 | -Void_t *(*__morecore)(ptrdiff_t) = __default_morecore_init; | |
803 | - | |
804 | -#else | |
805 | - | |
806 | -Void_t * __default_morecore_init (); | |
807 | -Void_t *(*__morecore)() = __default_morecore_init; | |
808 | - | |
809 | -#endif | |
810 | - | |
811 | -#define MORECORE (*__morecore) | |
812 | -#define MORECORE_FAILURE 0 | |
813 | -#define MORECORE_CLEARS 1 | |
814 | - | |
815 | -#else /* INTERNAL_LINUX_C_LIB */ | |
816 | - | |
817 | -#if __STD_C | |
818 | -extern Void_t* sbrk(ptrdiff_t); | |
819 | -#else | |
820 | -extern Void_t* sbrk(); | |
821 | -#endif | |
822 | - | |
823 | -#ifndef MORECORE | |
824 | -#define MORECORE sbrk | |
825 | -#endif | |
826 | - | |
827 | -#ifndef MORECORE_FAILURE | |
828 | -#define MORECORE_FAILURE -1 | |
829 | -#endif | |
830 | - | |
831 | -#ifndef MORECORE_CLEARS | |
832 | -#define MORECORE_CLEARS 1 | |
833 | -#endif | |
834 | - | |
835 | -#endif /* INTERNAL_LINUX_C_LIB */ | |
836 | - | |
837 | -#if defined(INTERNAL_LINUX_C_LIB) && defined(__ELF__) | |
838 | - | |
839 | -#define cALLOc __libc_calloc | |
840 | -#define fREe __libc_free | |
841 | -#define mALLOc __libc_malloc | |
842 | -#define mEMALIGn __libc_memalign | |
843 | -#define rEALLOc __libc_realloc | |
844 | -#define vALLOc __libc_valloc | |
845 | -#define pvALLOc __libc_pvalloc | |
846 | -#define mALLINFo __libc_mallinfo | |
847 | -#define mALLOPt __libc_mallopt | |
848 | - | |
849 | -#pragma weak calloc = __libc_calloc | |
850 | -#pragma weak free = __libc_free | |
851 | -#pragma weak cfree = __libc_free | |
852 | -#pragma weak malloc = __libc_malloc | |
853 | -#pragma weak memalign = __libc_memalign | |
854 | -#pragma weak realloc = __libc_realloc | |
855 | -#pragma weak valloc = __libc_valloc | |
856 | -#pragma weak pvalloc = __libc_pvalloc | |
857 | -#pragma weak mallinfo = __libc_mallinfo | |
858 | -#pragma weak mallopt = __libc_mallopt | |
859 | - | |
860 | -#else | |
861 | - | |
862 | - | |
863 | -#define cALLOc calloc | |
864 | -#define fREe free | |
865 | -#define mALLOc malloc | |
866 | -#define mEMALIGn memalign | |
867 | -#define rEALLOc realloc | |
868 | -#define vALLOc valloc | |
869 | -#define pvALLOc pvalloc | |
870 | -#define mALLINFo mallinfo | |
871 | -#define mALLOPt mallopt | |
872 | - | |
873 | -#endif | |
874 | - | |
875 | -/* Public routines */ | |
876 | - | |
877 | -#if __STD_C | |
878 | - | |
879 | -Void_t* mALLOc(size_t); | |
880 | -void fREe(Void_t*); | |
881 | -Void_t* rEALLOc(Void_t*, size_t); | |
882 | -Void_t* mEMALIGn(size_t, size_t); | |
883 | -Void_t* vALLOc(size_t); | |
884 | -Void_t* pvALLOc(size_t); | |
885 | -Void_t* cALLOc(size_t, size_t); | |
886 | -void cfree(Void_t*); | |
887 | -int malloc_trim(size_t); | |
888 | -size_t malloc_usable_size(Void_t*); | |
889 | -void malloc_stats(); | |
890 | -int mALLOPt(int, int); | |
891 | -struct mallinfo mALLINFo(void); | |
892 | -#else | |
893 | -Void_t* mALLOc(); | |
894 | -void fREe(); | |
895 | -Void_t* rEALLOc(); | |
896 | -Void_t* mEMALIGn(); | |
897 | -Void_t* vALLOc(); | |
898 | -Void_t* pvALLOc(); | |
899 | -Void_t* cALLOc(); | |
900 | -void cfree(); | |
901 | -int malloc_trim(); | |
902 | -size_t malloc_usable_size(); | |
903 | -void malloc_stats(); | |
904 | -int mALLOPt(); | |
905 | -struct mallinfo mALLINFo(); | |
906 | -#endif | |
907 | - | |
908 | - | |
909 | -#ifdef __cplusplus | |
910 | -}; /* end of extern "C" */ | |
911 | -#endif | |
912 | - | |
913 | -/* ---------- To make a malloc.h, end cutting here ------------ */ | |
914 | - | |
915 | - | |
916 | -/* | |
917 | - Emulation of sbrk for WIN32 | |
918 | - All code within the ifdef WIN32 is untested by me. | |
919 | -*/ | |
920 | - | |
921 | - | |
922 | -#ifdef WIN32 | |
923 | - | |
924 | -#define AlignPage(add) (((add) + (malloc_getpagesize-1)) & | |
925 | -~(malloc_getpagesize-1)) | |
926 | - | |
927 | -/* resrve 64MB to insure large contiguous space */ | |
928 | -#define RESERVED_SIZE (1024*1024*64) | |
929 | -#define NEXT_SIZE (2048*1024) | |
930 | -#define TOP_MEMORY ((unsigned long)2*1024*1024*1024) | |
931 | - | |
932 | -struct GmListElement; | |
933 | -typedef struct GmListElement GmListElement; | |
934 | - | |
935 | -struct GmListElement | |
936 | -{ | |
937 | - GmListElement* next; | |
938 | - void* base; | |
939 | -}; | |
940 | - | |
941 | -static GmListElement* head = 0; | |
942 | -static unsigned int gNextAddress = 0; | |
943 | -static unsigned int gAddressBase = 0; | |
944 | -static unsigned int gAllocatedSize = 0; | |
945 | - | |
946 | -static | |
947 | -GmListElement* makeGmListElement (void* bas) | |
948 | -{ | |
949 | - GmListElement* this; | |
950 | - this = (GmListElement*)(void*)LocalAlloc (0, sizeof (GmListElement)); | |
951 | - ASSERT (this); | |
952 | - if (this) | |
953 | - { | |
954 | - this->base = bas; | |
955 | - this->next = head; | |
956 | - head = this; | |
957 | - } | |
958 | - return this; | |
959 | -} | |
960 | - | |
961 | -void gcleanup () | |
962 | -{ | |
963 | - BOOL rval; | |
964 | - ASSERT ( (head == NULL) || (head->base == (void*)gAddressBase)); | |
965 | - if (gAddressBase && (gNextAddress - gAddressBase)) | |
966 | - { | |
967 | - rval = VirtualFree ((void*)gAddressBase, | |
968 | - gNextAddress - gAddressBase, | |
969 | - MEM_DECOMMIT); | |
970 | - ASSERT (rval); | |
971 | - } | |
972 | - while (head) | |
973 | - { | |
974 | - GmListElement* next = head->next; | |
975 | - rval = VirtualFree (head->base, 0, MEM_RELEASE); | |
976 | - ASSERT (rval); | |
977 | - LocalFree (head); | |
978 | - head = next; | |
979 | - } | |
980 | -} | |
981 | - | |
982 | -static | |
983 | -void* findRegion (void* start_address, unsigned long size) | |
984 | -{ | |
985 | - MEMORY_BASIC_INFORMATION info; | |
986 | - while ((unsigned long)start_address < TOP_MEMORY) | |
987 | - { | |
988 | - VirtualQuery (start_address, &info, sizeof (info)); | |
989 | - if (info.State != MEM_FREE) | |
990 | - start_address = (char*)info.BaseAddress + info.RegionSize; | |
991 | - else if (info.RegionSize >= size) | |
992 | - return start_address; | |
993 | - else | |
994 | - start_address = (char*)info.BaseAddress + info.RegionSize; | |
995 | - } | |
996 | - return NULL; | |
997 | - | |
998 | -} | |
999 | - | |
1000 | - | |
1001 | -void* wsbrk (long size) | |
1002 | -{ | |
1003 | - void* tmp; | |
1004 | - if (size > 0) | |
1005 | - { | |
1006 | - if (gAddressBase == 0) | |
1007 | - { | |
1008 | - gAllocatedSize = max (RESERVED_SIZE, AlignPage (size)); | |
1009 | - gNextAddress = gAddressBase = | |
1010 | - (unsigned int)VirtualAlloc (NULL, gAllocatedSize, | |
1011 | - MEM_RESERVE, PAGE_NOACCESS); | |
1012 | - } else if (AlignPage (gNextAddress + size) > (gAddressBase + | |
1013 | -gAllocatedSize)) | |
1014 | - { | |
1015 | - long new_size = max (NEXT_SIZE, AlignPage (size)); | |
1016 | - void* new_address = (void*)(gAddressBase+gAllocatedSize); | |
1017 | - do | |
1018 | - { | |
1019 | - new_address = findRegion (new_address, new_size); | |
1020 | - | |
1021 | - if (new_address == 0) | |
1022 | - return (void*)-1; | |
1023 | - | |
1024 | - gAddressBase = gNextAddress = | |
1025 | - (unsigned int)VirtualAlloc (new_address, new_size, | |
1026 | - MEM_RESERVE, PAGE_NOACCESS); | |
1027 | - // repeat in case of race condition | |
1028 | - // The region that we found has been snagged | |
1029 | - // by another thread | |
1030 | - } | |
1031 | - while (gAddressBase == 0); | |
1032 | - | |
1033 | - ASSERT (new_address == (void*)gAddressBase); | |
1034 | - | |
1035 | - gAllocatedSize = new_size; | |
1036 | - | |
1037 | - if (!makeGmListElement ((void*)gAddressBase)) | |
1038 | - return (void*)-1; | |
1039 | - } | |
1040 | - if ((size + gNextAddress) > AlignPage (gNextAddress)) | |
1041 | - { | |
1042 | - void* res; | |
1043 | - res = VirtualAlloc ((void*)AlignPage (gNextAddress), | |
1044 | - (size + gNextAddress - | |
1045 | - AlignPage (gNextAddress)), | |
1046 | - MEM_COMMIT, PAGE_READWRITE); | |
1047 | - if (res == 0) | |
1048 | - return (void*)-1; | |
1049 | - } | |
1050 | - tmp = (void*)gNextAddress; | |
1051 | - gNextAddress = (unsigned int)tmp + size; | |
1052 | - return tmp; | |
1053 | - } | |
1054 | - else if (size < 0) | |
1055 | - { | |
1056 | - unsigned int alignedGoal = AlignPage (gNextAddress + size); | |
1057 | - /* Trim by releasing the virtual memory */ | |
1058 | - if (alignedGoal >= gAddressBase) | |
1059 | - { | |
1060 | - VirtualFree ((void*)alignedGoal, gNextAddress - alignedGoal, | |
1061 | - MEM_DECOMMIT); | |
1062 | - gNextAddress = gNextAddress + size; | |
1063 | - return (void*)gNextAddress; | |
1064 | - } | |
1065 | - else | |
1066 | - { | |
1067 | - VirtualFree ((void*)gAddressBase, gNextAddress - gAddressBase, | |
1068 | - MEM_DECOMMIT); | |
1069 | - gNextAddress = gAddressBase; | |
1070 | - return (void*)-1; | |
1071 | - } | |
1072 | - } | |
1073 | - else | |
1074 | - { | |
1075 | - return (void*)gNextAddress; | |
1076 | - } | |
1077 | -} | |
1078 | - | |
1079 | -#endif | |
1080 | - | |
1081 | - | |
1082 | - | |
1083 | -/* | |
1084 | - Type declarations | |
1085 | -*/ | |
1086 | - | |
1087 | - | |
1088 | -struct malloc_chunk | |
1089 | -{ | |
1090 | - INTERNAL_SIZE_T prev_size; /* Size of previous chunk (if free). */ | |
1091 | - INTERNAL_SIZE_T size; /* Size in bytes, including overhead. */ | |
1092 | - struct malloc_chunk* fd; /* double links -- used only if free. */ | |
1093 | - struct malloc_chunk* bk; | |
1094 | -}; | |
1095 | - | |
1096 | -typedef struct malloc_chunk* mchunkptr; | |
1097 | - | |
1098 | -/* | |
1099 | - | |
1100 | - malloc_chunk details: | |
1101 | - | |
1102 | - (The following includes lightly edited explanations by Colin Plumb.) | |
1103 | - | |
1104 | - Chunks of memory are maintained using a `boundary tag' method as | |
1105 | - described in e.g., Knuth or Standish. (See the paper by Paul | |
1106 | - Wilson ftp://ftp.cs.utexas.edu/pub/garbage/allocsrv.ps for a | |
1107 | - survey of such techniques.) Sizes of free chunks are stored both | |
1108 | - in the front of each chunk and at the end. This makes | |
1109 | - consolidating fragmented chunks into bigger chunks very fast. The | |
1110 | - size fields also hold bits representing whether chunks are free or | |
1111 | - in use. | |
1112 | - | |
1113 | - An allocated chunk looks like this: | |
1114 | - | |
1115 | - | |
1116 | - chunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | |
1117 | - | Size of previous chunk, if allocated | | | |
1118 | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | |
1119 | - | Size of chunk, in bytes |P| | |
1120 | - mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | |
1121 | - | User data starts here... . | |
1122 | - . . | |
1123 | - . (malloc_usable_space() bytes) . | |
1124 | - . | | |
1125 | -nextchunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | |
1126 | - | Size of chunk | | |
1127 | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | |
1128 | - | |
1129 | - | |
1130 | - Where "chunk" is the front of the chunk for the purpose of most of | |
1131 | - the malloc code, but "mem" is the pointer that is returned to the | |
1132 | - user. "Nextchunk" is the beginning of the next contiguous chunk. | |
1133 | - | |
1134 | - Chunks always begin on even word boundries, so the mem portion | |
1135 | - (which is returned to the user) is also on an even word boundary, and | |
1136 | - thus double-word aligned. | |
1137 | - | |
1138 | - Free chunks are stored in circular doubly-linked lists, and look like this: | |
1139 | - | |
1140 | - chunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | |
1141 | - | Size of previous chunk | | |
1142 | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | |
1143 | - `head:' | Size of chunk, in bytes |P| | |
1144 | - mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | |
1145 | - | Forward pointer to next chunk in list | | |
1146 | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | |
1147 | - | Back pointer to previous chunk in list | | |
1148 | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | |
1149 | - | Unused space (may be 0 bytes long) . | |
1150 | - . . | |
1151 | - . | | |
1152 | -nextchunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | |
1153 | - `foot:' | Size of chunk, in bytes | | |
1154 | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | |
1155 | - | |
1156 | - The P (PREV_INUSE) bit, stored in the unused low-order bit of the | |
1157 | - chunk size (which is always a multiple of two words), is an in-use | |
1158 | - bit for the *previous* chunk. If that bit is *clear*, then the | |
1159 | - word before the current chunk size contains the previous chunk | |
1160 | - size, and can be used to find the front of the previous chunk. | |
1161 | - (The very first chunk allocated always has this bit set, | |
1162 | - preventing access to non-existent (or non-owned) memory.) | |
1163 | - | |
1164 | - Note that the `foot' of the current chunk is actually represented | |
1165 | - as the prev_size of the NEXT chunk. (This makes it easier to | |
1166 | - deal with alignments etc). | |
1167 | - | |
1168 | - The two exceptions to all this are | |
1169 | - | |
1170 | - 1. The special chunk `top', which doesn't bother using the | |
1171 | - trailing size field since there is no | |
1172 | - next contiguous chunk that would have to index off it. (After | |
1173 | - initialization, `top' is forced to always exist. If it would | |
1174 | - become less than MINSIZE bytes long, it is replenished via | |
1175 | - malloc_extend_top.) | |
1176 | - | |
1177 | - 2. Chunks allocated via mmap, which have the second-lowest-order | |
1178 | - bit (IS_MMAPPED) set in their size fields. Because they are | |
1179 | - never merged or traversed from any other chunk, they have no | |
1180 | - foot size or inuse information. | |
1181 | - | |
1182 | - Available chunks are kept in any of several places (all declared below): | |
1183 | - | |
1184 | - * `av': An array of chunks serving as bin headers for consolidated | |
1185 | - chunks. Each bin is doubly linked. The bins are approximately | |
1186 | - proportionally (log) spaced. There are a lot of these bins | |
1187 | - (128). This may look excessive, but works very well in | |
1188 | - practice. All procedures maintain the invariant that no | |
1189 | - consolidated chunk physically borders another one. Chunks in | |
1190 | - bins are kept in size order, with ties going to the | |
1191 | - approximately least recently used chunk. | |
1192 | - | |
1193 | - The chunks in each bin are maintained in decreasing sorted order by | |
1194 | - size. This is irrelevant for the small bins, which all contain | |
1195 | - the same-sized chunks, but facilitates best-fit allocation for | |
1196 | - larger chunks. (These lists are just sequential. Keeping them in | |
1197 | - order almost never requires enough traversal to warrant using | |
1198 | - fancier ordered data structures.) Chunks of the same size are | |
1199 | - linked with the most recently freed at the front, and allocations | |
1200 | - are taken from the back. This results in LRU or FIFO allocation | |
1201 | - order, which tends to give each chunk an equal opportunity to be | |
1202 | - consolidated with adjacent freed chunks, resulting in larger free | |
1203 | - chunks and less fragmentation. | |
1204 | - | |
1205 | - * `top': The top-most available chunk (i.e., the one bordering the | |
1206 | - end of available memory) is treated specially. It is never | |
1207 | - included in any bin, is used only if no other chunk is | |
1208 | - available, and is released back to the system if it is very | |
1209 | - large (see M_TRIM_THRESHOLD). | |
1210 | - | |
1211 | - * `last_remainder': A bin holding only the remainder of the | |
1212 | - most recently split (non-top) chunk. This bin is checked | |
1213 | - before other non-fitting chunks, so as to provide better | |
1214 | - locality for runs of sequentially allocated chunks. | |
1215 | - | |
1216 | - * Implicitly, through the host system's memory mapping tables. | |
1217 | - If supported, requests greater than a threshold are usually | |
1218 | - serviced via calls to mmap, and then later released via munmap. | |
1219 | - | |
1220 | -*/ | |
1221 | - | |
1222 | - | |
1223 | - | |
1224 | - | |
1225 | - | |
1226 | - | |
1227 | -/* sizes, alignments */ | |
1228 | - | |
1229 | -#define SIZE_SZ (sizeof(INTERNAL_SIZE_T)) | |
1230 | -#define MALLOC_ALIGNMENT (SIZE_SZ + SIZE_SZ) | |
1231 | -#define MALLOC_ALIGN_MASK (MALLOC_ALIGNMENT - 1) | |
1232 | -#define MINSIZE (sizeof(struct malloc_chunk)) | |
1233 | - | |
1234 | -/* conversion from malloc headers to user pointers, and back */ | |
1235 | - | |
1236 | -#define chunk2mem(p) ((Void_t*)((char*)(p) + 2*SIZE_SZ)) | |
1237 | -#define mem2chunk(mem) ((mchunkptr)((char*)(mem) - 2*SIZE_SZ)) | |
1238 | - | |
1239 | -/* pad request bytes into a usable size */ | |
1240 | - | |
1241 | -#define request2size(req) \ | |
1242 | - (((long)((req) + (SIZE_SZ + MALLOC_ALIGN_MASK)) < \ | |
1243 | - (long)(MINSIZE + MALLOC_ALIGN_MASK)) ? MINSIZE : \ | |
1244 | - (((req) + (SIZE_SZ + MALLOC_ALIGN_MASK)) & ~(MALLOC_ALIGN_MASK))) | |
1245 | - | |
1246 | -/* Check if m has acceptable alignment */ | |
1247 | - | |
1248 | -#define aligned_OK(m) (((unsigned long)((m)) & (MALLOC_ALIGN_MASK)) == 0) | |
1249 | - | |
1250 | - | |
1251 | - | |
1252 | - | |
1253 | -/* | |
1254 | - Physical chunk operations | |
1255 | -*/ | |
1256 | - | |
1257 | - | |
1258 | -/* size field is or'ed with PREV_INUSE when previous adjacent chunk in use */ | |
1259 | - | |
1260 | -#define PREV_INUSE 0x1 | |
1261 | - | |
1262 | -/* size field is or'ed with IS_MMAPPED if the chunk was obtained with mmap() */ | |
1263 | - | |
1264 | -#define IS_MMAPPED 0x2 | |
1265 | - | |
1266 | -/* Bits to mask off when extracting size */ | |
1267 | - | |
1268 | -#define SIZE_BITS (PREV_INUSE|IS_MMAPPED) | |
1269 | - | |
1270 | - | |
1271 | -/* Ptr to next physical malloc_chunk. */ | |
1272 | - | |
1273 | -#define next_chunk(p) ((mchunkptr)( ((char*)(p)) + ((p)->size & ~PREV_INUSE) )) | |
1274 | - | |
1275 | -/* Ptr to previous physical malloc_chunk */ | |
1276 | - | |
1277 | -#define prev_chunk(p)\ | |
1278 | - ((mchunkptr)( ((char*)(p)) - ((p)->prev_size) )) | |
1279 | - | |
1280 | - | |
1281 | -/* Treat space at ptr + offset as a chunk */ | |
1282 | - | |
1283 | -#define chunk_at_offset(p, s) ((mchunkptr)(((char*)(p)) + (s))) | |
1284 | - | |
1285 | - | |
1286 | - | |
1287 | - | |
1288 | -/* | |
1289 | - Dealing with use bits | |
1290 | -*/ | |
1291 | - | |
1292 | -/* extract p's inuse bit */ | |
1293 | - | |
1294 | -#define inuse(p)\ | |
1295 | -((((mchunkptr)(((char*)(p))+((p)->size & ~PREV_INUSE)))->size) & PREV_INUSE) | |
1296 | - | |
1297 | -/* extract inuse bit of previous chunk */ | |
1298 | - | |
1299 | -#define prev_inuse(p) ((p)->size & PREV_INUSE) | |
1300 | - | |
1301 | -/* check for mmap()'ed chunk */ | |
1302 | - | |
1303 | -#define chunk_is_mmapped(p) ((p)->size & IS_MMAPPED) | |
1304 | - | |
1305 | -/* set/clear chunk as in use without otherwise disturbing */ | |
1306 | - | |
1307 | -#define set_inuse(p)\ | |
1308 | -((mchunkptr)(((char*)(p)) + ((p)->size & ~PREV_INUSE)))->size |= PREV_INUSE | |
1309 | - | |
1310 | -#define clear_inuse(p)\ | |
1311 | -((mchunkptr)(((char*)(p)) + ((p)->size & ~PREV_INUSE)))->size &= ~(PREV_INUSE) | |
1312 | - | |
1313 | -/* check/set/clear inuse bits in known places */ | |
1314 | - | |
1315 | -#define inuse_bit_at_offset(p, s)\ | |
1316 | - (((mchunkptr)(((char*)(p)) + (s)))->size & PREV_INUSE) | |
1317 | - | |
1318 | -#define set_inuse_bit_at_offset(p, s)\ | |
1319 | - (((mchunkptr)(((char*)(p)) + (s)))->size |= PREV_INUSE) | |
1320 | - | |
1321 | -#define clear_inuse_bit_at_offset(p, s)\ | |
1322 | - (((mchunkptr)(((char*)(p)) + (s)))->size &= ~(PREV_INUSE)) | |
1323 | - | |
1324 | - | |
1325 | - | |
1326 | - | |
1327 | -/* | |
1328 | - Dealing with size fields | |
1329 | -*/ | |
1330 | - | |
1331 | -/* Get size, ignoring use bits */ | |
1332 | - | |
1333 | -#define chunksize(p) ((p)->size & ~(SIZE_BITS)) | |
1334 | - | |
1335 | -/* Set size at head, without disturbing its use bit */ | |
1336 | - | |
1337 | -#define set_head_size(p, s) ((p)->size = (((p)->size & PREV_INUSE) | (s))) | |
1338 | - | |
1339 | -/* Set size/use ignoring previous bits in header */ | |
1340 | - | |
1341 | -#define set_head(p, s) ((p)->size = (s)) | |
1342 | - | |
1343 | -/* Set size at footer (only when chunk is not in use) */ | |
1344 | - | |
1345 | -#define set_foot(p, s) (((mchunkptr)((char*)(p) + (s)))->prev_size = (s)) | |
1346 | - | |
1347 | - | |
1348 | - | |
1349 | - | |
1350 | - | |
1351 | -/* | |
1352 | - Bins | |
1353 | - | |
1354 | - The bins, `av_' are an array of pairs of pointers serving as the | |
1355 | - heads of (initially empty) doubly-linked lists of chunks, laid out | |
1356 | - in a way so that each pair can be treated as if it were in a | |
1357 | - malloc_chunk. (This way, the fd/bk offsets for linking bin heads | |
1358 | - and chunks are the same). | |
1359 | - | |
1360 | - Bins for sizes < 512 bytes contain chunks of all the same size, spaced | |
1361 | - 8 bytes apart. Larger bins are approximately logarithmically | |
1362 | - spaced. (See the table below.) The `av_' array is never mentioned | |
1363 | - directly in the code, but instead via bin access macros. | |
1364 | - | |
1365 | - Bin layout: | |
1366 | - | |
1367 | - 64 bins of size 8 | |
1368 | - 32 bins of size 64 | |
1369 | - 16 bins of size 512 | |
1370 | - 8 bins of size 4096 | |
1371 | - 4 bins of size 32768 | |
1372 | - 2 bins of size 262144 | |
1373 | - 1 bin of size what's left | |
1374 | - | |
1375 | - There is actually a little bit of slop in the numbers in bin_index | |
1376 | - for the sake of speed. This makes no difference elsewhere. | |
1377 | - | |
1378 | - The special chunks `top' and `last_remainder' get their own bins, | |
1379 | - (this is implemented via yet more trickery with the av_ array), | |
1380 | - although `top' is never properly linked to its bin since it is | |
1381 | - always handled specially. | |
1382 | - | |
1383 | -*/ | |
1384 | - | |
1385 | -#define NAV 128 /* number of bins */ | |
1386 | - | |
1387 | -typedef struct malloc_chunk* mbinptr; | |
1388 | - | |
1389 | -/* access macros */ | |
1390 | - | |
1391 | -#define bin_at(i) ((mbinptr)((char*)&(av_[2*(i) + 2]) - 2*SIZE_SZ)) | |
1392 | -#define next_bin(b) ((mbinptr)((char*)(b) + 2 * sizeof(mbinptr))) | |
1393 | -#define prev_bin(b) ((mbinptr)((char*)(b) - 2 * sizeof(mbinptr))) | |
1394 | - | |
1395 | -/* | |
1396 | - The first 2 bins are never indexed. The corresponding av_ cells are instead | |
1397 | - used for bookkeeping. This is not to save space, but to simplify | |
1398 | - indexing, maintain locality, and avoid some initialization tests. | |
1399 | -*/ | |
1400 | - | |
1401 | -#define top (bin_at(0)->fd) /* The topmost chunk */ | |
1402 | -#define last_remainder (bin_at(1)) /* remainder from last split */ | |
1403 | - | |
1404 | - | |
1405 | -/* | |
1406 | - Because top initially points to its own bin with initial | |
1407 | - zero size, thus forcing extension on the first malloc request, | |
1408 | - we avoid having any special code in malloc to check whether | |
1409 | - it even exists yet. But we still need to in malloc_extend_top. | |
1410 | -*/ | |
1411 | - | |
1412 | -#define initial_top ((mchunkptr)(bin_at(0))) | |
1413 | - | |
1414 | -/* Helper macro to initialize bins */ | |
1415 | - | |
1416 | -#define IAV(i) bin_at(i), bin_at(i) | |
1417 | - | |
1418 | -static mbinptr av_[NAV * 2 + 2] = { | |
1419 | - 0, 0, | |
1420 | - IAV(0), IAV(1), IAV(2), IAV(3), IAV(4), IAV(5), IAV(6), IAV(7), | |
1421 | - IAV(8), IAV(9), IAV(10), IAV(11), IAV(12), IAV(13), IAV(14), IAV(15), | |
1422 | - IAV(16), IAV(17), IAV(18), IAV(19), IAV(20), IAV(21), IAV(22), IAV(23), | |
1423 | - IAV(24), IAV(25), IAV(26), IAV(27), IAV(28), IAV(29), IAV(30), IAV(31), | |
1424 | - IAV(32), IAV(33), IAV(34), IAV(35), IAV(36), IAV(37), IAV(38), IAV(39), | |
1425 | - IAV(40), IAV(41), IAV(42), IAV(43), IAV(44), IAV(45), IAV(46), IAV(47), | |
1426 | - IAV(48), IAV(49), IAV(50), IAV(51), IAV(52), IAV(53), IAV(54), IAV(55), | |
1427 | - IAV(56), IAV(57), IAV(58), IAV(59), IAV(60), IAV(61), IAV(62), IAV(63), | |
1428 | - IAV(64), IAV(65), IAV(66), IAV(67), IAV(68), IAV(69), IAV(70), IAV(71), | |
1429 | - IAV(72), IAV(73), IAV(74), IAV(75), IAV(76), IAV(77), IAV(78), IAV(79), | |
1430 | - IAV(80), IAV(81), IAV(82), IAV(83), IAV(84), IAV(85), IAV(86), IAV(87), | |
1431 | - IAV(88), IAV(89), IAV(90), IAV(91), IAV(92), IAV(93), IAV(94), IAV(95), | |
1432 | - IAV(96), IAV(97), IAV(98), IAV(99), IAV(100), IAV(101), IAV(102), IAV(103), | |
1433 | - IAV(104), IAV(105), IAV(106), IAV(107), IAV(108), IAV(109), IAV(110), IAV(111), | |
1434 | - IAV(112), IAV(113), IAV(114), IAV(115), IAV(116), IAV(117), IAV(118), IAV(119), | |
1435 | - IAV(120), IAV(121), IAV(122), IAV(123), IAV(124), IAV(125), IAV(126), IAV(127) | |
1436 | -}; | |
1437 | - | |
1438 | - | |
1439 | - | |
1440 | -/* field-extraction macros */ | |
1441 | - | |
1442 | -#define first(b) ((b)->fd) | |
1443 | -#define last(b) ((b)->bk) | |
1444 | - | |
1445 | -/* | |
1446 | - Indexing into bins | |
1447 | -*/ | |
1448 | - | |
1449 | -#define bin_index(sz) \ | |
1450 | -(((((unsigned long)(sz)) >> 9) == 0) ? (((unsigned long)(sz)) >> 3): \ | |
1451 | - ((((unsigned long)(sz)) >> 9) <= 4) ? 56 + (((unsigned long)(sz)) >> 6): \ | |
1452 | - ((((unsigned long)(sz)) >> 9) <= 20) ? 91 + (((unsigned long)(sz)) >> 9): \ | |
1453 | - ((((unsigned long)(sz)) >> 9) <= 84) ? 110 + (((unsigned long)(sz)) >> 12): \ | |
1454 | - ((((unsigned long)(sz)) >> 9) <= 340) ? 119 + (((unsigned long)(sz)) >> 15): \ | |
1455 | - ((((unsigned long)(sz)) >> 9) <= 1364) ? 124 + (((unsigned long)(sz)) >> 18): \ | |
1456 | - 126) | |
1457 | -/* | |
1458 | - bins for chunks < 512 are all spaced 8 bytes apart, and hold | |
1459 | - identically sized chunks. This is exploited in malloc. | |
1460 | -*/ | |
1461 | - | |
1462 | -#define MAX_SMALLBIN 63 | |
1463 | -#define MAX_SMALLBIN_SIZE 512 | |
1464 | -#define SMALLBIN_WIDTH 8 | |
1465 | - | |
1466 | -#define smallbin_index(sz) (((unsigned long)(sz)) >> 3) | |
1467 | - | |
1468 | -/* | |
1469 | - Requests are `small' if both the corresponding and the next bin are small | |
1470 | -*/ | |
1471 | - | |
1472 | -#define is_small_request(nb) (nb < MAX_SMALLBIN_SIZE - SMALLBIN_WIDTH) | |
1473 | - | |
1474 | - | |
1475 | - | |
1476 | -/* | |
1477 | - To help compensate for the large number of bins, a one-level index | |
1478 | - structure is used for bin-by-bin searching. `binblocks' is a | |
1479 | - one-word bitvector recording whether groups of BINBLOCKWIDTH bins | |
1480 | - have any (possibly) non-empty bins, so they can be skipped over | |
1481 | - all at once during during traversals. The bits are NOT always | |
1482 | - cleared as soon as all bins in a block are empty, but instead only | |
1483 | - when all are noticed to be empty during traversal in malloc. | |
1484 | -*/ | |
1485 | - | |
1486 | -#define BINBLOCKWIDTH 4 /* bins per block */ | |
1487 | - | |
1488 | -#define binblocks (bin_at(0)->size) /* bitvector of nonempty blocks */ | |
1489 | - | |
1490 | -/* bin<->block macros */ | |
1491 | - | |
1492 | -#define idx2binblock(ix) ((unsigned)1 << (ix / BINBLOCKWIDTH)) | |
1493 | -#define mark_binblock(ii) (binblocks |= idx2binblock(ii)) | |
1494 | -#define clear_binblock(ii) (binblocks &= ~(idx2binblock(ii))) | |
1495 | - | |
1496 | - | |
1497 | - | |
1498 | - | |
1499 | - | |
1500 | -/* Other static bookkeeping data */ | |
1501 | - | |
1502 | -/* variables holding tunable values */ | |
1503 | - | |
1504 | -static unsigned long trim_threshold = DEFAULT_TRIM_THRESHOLD; | |
1505 | -static unsigned long top_pad = DEFAULT_TOP_PAD; | |
1506 | -static unsigned int n_mmaps_max = DEFAULT_MMAP_MAX; | |
1507 | -static unsigned long mmap_threshold = DEFAULT_MMAP_THRESHOLD; | |
1508 | - | |
1509 | -/* The first value returned from sbrk */ | |
1510 | -static char* sbrk_base = (char*)(-1); | |
1511 | - | |
1512 | -/* The maximum memory obtained from system via sbrk */ | |
1513 | -static unsigned long max_sbrked_mem = 0; | |
1514 | - | |
1515 | -/* The maximum via either sbrk or mmap */ | |
1516 | -static unsigned long max_total_mem = 0; | |
1517 | - | |
1518 | -/* internal working copy of mallinfo */ | |
1519 | -static struct mallinfo current_mallinfo = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }; | |
1520 | - | |
1521 | -/* The total memory obtained from system via sbrk */ | |
1522 | -#define sbrked_mem (current_mallinfo.arena) | |
1523 | - | |
1524 | -/* Tracking mmaps */ | |
1525 | - | |
1526 | -static unsigned int n_mmaps = 0; | |
1527 | -static unsigned int max_n_mmaps = 0; | |
1528 | -static unsigned long mmapped_mem = 0; | |
1529 | -static unsigned long max_mmapped_mem = 0; | |
1530 | - | |
1531 | - | |
1532 | - | |
1533 | -/* | |
1534 | - Debugging support | |
1535 | -*/ | |
1536 | - | |
1537 | -#if DEBUG | |
1538 | - | |
1539 | - | |
1540 | -/* | |
1541 | - These routines make a number of assertions about the states | |
1542 | - of data structures that should be true at all times. If any | |
1543 | - are not true, it's very likely that a user program has somehow | |
1544 | - trashed memory. (It's also possible that there is a coding error | |
1545 | - in malloc. In which case, please report it!) | |
1546 | -*/ | |
1547 | - | |
1548 | -#if __STD_C | |
1549 | -static void do_check_chunk(mchunkptr p) | |
1550 | -#else | |
1551 | -static void do_check_chunk(p) mchunkptr p; | |
1552 | -#endif | |
1553 | -{ | |
1554 | - INTERNAL_SIZE_T sz = p->size & ~PREV_INUSE; | |
1555 | - | |
1556 | - /* No checkable chunk is mmapped */ | |
1557 | - assert(!chunk_is_mmapped(p)); | |
1558 | - | |
1559 | - /* Check for legal address ... */ | |
1560 | - assert((char*)p >= sbrk_base); | |
1561 | - if (p != top) | |
1562 | - assert((char*)p + sz <= (char*)top); | |
1563 | - else | |
1564 | - assert((char*)p + sz <= sbrk_base + sbrked_mem); | |
1565 | - | |
1566 | -} | |
1567 | - | |
1568 | - | |
1569 | -#if __STD_C | |
1570 | -static void do_check_free_chunk(mchunkptr p) | |
1571 | -#else | |
1572 | -static void do_check_free_chunk(p) mchunkptr p; | |
1573 | -#endif | |
1574 | -{ | |
1575 | - INTERNAL_SIZE_T sz = p->size & ~PREV_INUSE; | |
1576 | - mchunkptr next = chunk_at_offset(p, sz); | |
1577 | - | |
1578 | - do_check_chunk(p); | |
1579 | - | |
1580 | - /* Check whether it claims to be free ... */ | |
1581 | - assert(!inuse(p)); | |
1582 | - | |
1583 | - /* Unless a special marker, must have OK fields */ | |
1584 | - if ((long)sz >= (long)MINSIZE) | |
1585 | - { | |
1586 | - assert((sz & MALLOC_ALIGN_MASK) == 0); | |
1587 | - assert(aligned_OK(chunk2mem(p))); | |
1588 | - /* ... matching footer field */ | |
1589 | - assert(next->prev_size == sz); | |
1590 | - /* ... and is fully consolidated */ | |
1591 | - assert(prev_inuse(p)); | |
1592 | - assert (next == top || inuse(next)); | |
1593 | - | |
1594 | - /* ... and has minimally sane links */ | |
1595 | - assert(p->fd->bk == p); | |
1596 | - assert(p->bk->fd == p); | |
1597 | - } | |
1598 | - else /* markers are always of size SIZE_SZ */ | |
1599 | - assert(sz == SIZE_SZ); | |
1600 | -} | |
1601 | - | |
1602 | -#if __STD_C | |
1603 | -static void do_check_inuse_chunk(mchunkptr p) | |
1604 | -#else | |
1605 | -static void do_check_inuse_chunk(p) mchunkptr p; | |
1606 | -#endif | |
1607 | -{ | |
1608 | - mchunkptr next = next_chunk(p); | |
1609 | - do_check_chunk(p); | |
1610 | - | |
1611 | - /* Check whether it claims to be in use ... */ | |
1612 | - assert(inuse(p)); | |
1613 | - | |
1614 | - /* ... and is surrounded by OK chunks. | |
1615 | - Since more things can be checked with free chunks than inuse ones, | |
1616 | - if an inuse chunk borders them and debug is on, it's worth doing them. | |
1617 | - */ | |
1618 | - if (!prev_inuse(p)) | |
1619 | - { | |
1620 | - mchunkptr prv = prev_chunk(p); | |
1621 | - assert(next_chunk(prv) == p); | |
1622 | - do_check_free_chunk(prv); | |
1623 | - } | |
1624 | - if (next == top) | |
1625 | - { | |
1626 | - assert(prev_inuse(next)); | |
1627 | - assert(chunksize(next) >= MINSIZE); | |
1628 | - } | |
1629 | - else if (!inuse(next)) | |
1630 | - do_check_free_chunk(next); | |
1631 | - | |
1632 | -} | |
1633 | - | |
1634 | -#if __STD_C | |
1635 | -static void do_check_malloced_chunk(mchunkptr p, INTERNAL_SIZE_T s) | |
1636 | -#else | |
1637 | -static void do_check_malloced_chunk(p, s) mchunkptr p; INTERNAL_SIZE_T s; | |
1638 | -#endif | |
1639 | -{ | |
1640 | - INTERNAL_SIZE_T sz = p->size & ~PREV_INUSE; | |
1641 | - long room = sz - s; | |
1642 | - | |
1643 | - do_check_inuse_chunk(p); | |
1644 | - | |
1645 | - /* Legal size ... */ | |
1646 | - assert((long)sz >= (long)MINSIZE); | |
1647 | - assert((sz & MALLOC_ALIGN_MASK) == 0); | |
1648 | - assert(room >= 0); | |
1649 | - assert(room < (long)MINSIZE); | |
1650 | - | |
1651 | - /* ... and alignment */ | |
1652 | - assert(aligned_OK(chunk2mem(p))); | |
1653 | - | |
1654 | - | |
1655 | - /* ... and was allocated at front of an available chunk */ | |
1656 | - assert(prev_inuse(p)); | |
1657 | - | |
1658 | -} | |
1659 | - | |
1660 | - | |
1661 | -#define check_free_chunk(P) do_check_free_chunk(P) | |
1662 | -#define check_inuse_chunk(P) do_check_inuse_chunk(P) | |
1663 | -#define check_chunk(P) do_check_chunk(P) | |
1664 | -#define check_malloced_chunk(P,N) do_check_malloced_chunk(P,N) | |
1665 | -#else | |
1666 | -#define check_free_chunk(P) | |
1667 | -#define check_inuse_chunk(P) | |
1668 | -#define check_chunk(P) | |
1669 | -#define check_malloced_chunk(P,N) | |
1670 | -#endif | |
1671 | - | |
1672 | - | |
1673 | - | |
1674 | -/* | |
1675 | - Macro-based internal utilities | |
1676 | -*/ | |
1677 | - | |
1678 | - | |
1679 | -/* | |
1680 | - Linking chunks in bin lists. | |
1681 | - Call these only with variables, not arbitrary expressions, as arguments. | |
1682 | -*/ | |
1683 | - | |
1684 | -/* | |
1685 | - Place chunk p of size s in its bin, in size order, | |
1686 | - putting it ahead of others of same size. | |
1687 | -*/ | |
1688 | - | |
1689 | - | |
1690 | -#define frontlink(P, S, IDX, BK, FD) \ | |
1691 | -{ \ | |
1692 | - if (S < MAX_SMALLBIN_SIZE) \ | |
1693 | - { \ | |
1694 | - IDX = smallbin_index(S); \ | |
1695 | - mark_binblock(IDX); \ | |
1696 | - BK = bin_at(IDX); \ | |
1697 | - FD = BK->fd; \ | |
1698 | - P->bk = BK; \ | |
1699 | - P->fd = FD; \ | |
1700 | - FD->bk = BK->fd = P; \ | |
1701 | - } \ | |
1702 | - else \ | |
1703 | - { \ | |
1704 | - IDX = bin_index(S); \ | |
1705 | - BK = bin_at(IDX); \ | |
1706 | - FD = BK->fd; \ | |
1707 | - if (FD == BK) mark_binblock(IDX); \ | |
1708 | - else \ | |
1709 | - { \ | |
1710 | - while (FD != BK && S < chunksize(FD)) FD = FD->fd; \ | |
1711 | - BK = FD->bk; \ | |
1712 | - } \ | |
1713 | - P->bk = BK; \ | |
1714 | - P->fd = FD; \ | |
1715 | - FD->bk = BK->fd = P; \ | |
1716 | - } \ | |
1717 | -} | |
1718 | - | |
1719 | - | |
1720 | -/* take a chunk off a list */ | |
1721 | - | |
1722 | -#define unlink(P, BK, FD) \ | |
1723 | -{ \ | |
1724 | - BK = P->bk; \ | |
1725 | - FD = P->fd; \ | |
1726 | - FD->bk = BK; \ | |
1727 | - BK->fd = FD; \ | |
1728 | -} \ | |
1729 | - | |
1730 | -/* Place p as the last remainder */ | |
1731 | - | |
1732 | -#define link_last_remainder(P) \ | |
1733 | -{ \ | |
1734 | - last_remainder->fd = last_remainder->bk = P; \ | |
1735 | - P->fd = P->bk = last_remainder; \ | |
1736 | -} | |
1737 | - | |
1738 | -/* Clear the last_remainder bin */ | |
1739 | - | |
1740 | -#define clear_last_remainder \ | |
1741 | - (last_remainder->fd = last_remainder->bk = last_remainder) | |
1742 | - | |
1743 | - | |
1744 | - | |
1745 | - | |
1746 | - | |
1747 | - | |
1748 | -/* Routines dealing with mmap(). */ | |
1749 | - | |
1750 | -#if HAVE_MMAP | |
1751 | - | |
1752 | -#if __STD_C | |
1753 | -static mchunkptr mmap_chunk(size_t size) | |
1754 | -#else | |
1755 | -static mchunkptr mmap_chunk(size) size_t size; | |
1756 | -#endif | |
1757 | -{ | |
1758 | - size_t page_mask = malloc_getpagesize - 1; | |
1759 | - mchunkptr p; | |
1760 | - | |
1761 | -#ifndef MAP_ANONYMOUS | |
1762 | - static int fd = -1; | |
1763 | -#endif | |
1764 | - | |
1765 | - if(n_mmaps >= n_mmaps_max) return 0; /* too many regions */ | |
1766 | - | |
1767 | - /* For mmapped chunks, the overhead is one SIZE_SZ unit larger, because | |
1768 | - * there is no following chunk whose prev_size field could be used. | |
1769 | - */ | |
1770 | - size = (size + SIZE_SZ + page_mask) & ~page_mask; | |
1771 | - | |
1772 | -#ifdef MAP_ANONYMOUS | |
1773 | - p = (mchunkptr)mmap(0, size, PROT_READ|PROT_WRITE, | |
1774 | - MAP_PRIVATE|MAP_ANONYMOUS, -1, 0); | |
1775 | -#else /* !MAP_ANONYMOUS */ | |
1776 | - if (fd < 0) | |
1777 | - { | |
1778 | - fd = open("/dev/zero", O_RDWR); | |
1779 | - if(fd < 0) return 0; | |
1780 | - } | |
1781 | - p = (mchunkptr)mmap(0, size, PROT_READ|PROT_WRITE, MAP_PRIVATE, fd, 0); | |
1782 | -#endif | |
1783 | - | |
1784 | - if(p == (mchunkptr)-1) return 0; | |
1785 | - | |
1786 | - n_mmaps++; | |
1787 | - if (n_mmaps > max_n_mmaps) max_n_mmaps = n_mmaps; | |
1788 | - | |
1789 | - /* We demand that eight bytes into a page must be 8-byte aligned. */ | |
1790 | - assert(aligned_OK(chunk2mem(p))); | |
1791 | - | |
1792 | - /* The offset to the start of the mmapped region is stored | |
1793 | - * in the prev_size field of the chunk; normally it is zero, | |
1794 | - * but that can be changed in memalign(). | |
1795 | - */ | |
1796 | - p->prev_size = 0; | |
1797 | - set_head(p, size|IS_MMAPPED); | |
1798 | - | |
1799 | - mmapped_mem += size; | |
1800 | - if ((unsigned long)mmapped_mem > (unsigned long)max_mmapped_mem) | |
1801 | - max_mmapped_mem = mmapped_mem; | |
1802 | - if ((unsigned long)(mmapped_mem + sbrked_mem) > (unsigned long)max_total_mem) | |
1803 | - max_total_mem = mmapped_mem + sbrked_mem; | |
1804 | - return p; | |
1805 | -} | |
1806 | - | |
1807 | -#if __STD_C | |
1808 | -static void munmap_chunk(mchunkptr p) | |
1809 | -#else | |
1810 | -static void munmap_chunk(p) mchunkptr p; | |
1811 | -#endif | |
1812 | -{ | |
1813 | - INTERNAL_SIZE_T size = chunksize(p); | |
1814 | - int ret; | |
1815 | - | |
1816 | - assert (chunk_is_mmapped(p)); | |
1817 | - assert(! ((char*)p >= sbrk_base && (char*)p < sbrk_base + sbrked_mem)); | |
1818 | - assert((n_mmaps > 0)); | |
1819 | - assert(((p->prev_size + size) & (malloc_getpagesize-1)) == 0); | |
1820 | - | |
1821 | - n_mmaps--; | |
1822 | - mmapped_mem -= (size + p->prev_size); | |
1823 | - | |
1824 | - ret = munmap((char *)p - p->prev_size, size + p->prev_size); | |
1825 | - | |
1826 | - /* munmap returns non-zero on failure */ | |
1827 | - assert(ret == 0); | |
1828 | -} | |
1829 | - | |
1830 | -#if HAVE_MREMAP | |
1831 | - | |
1832 | -#if __STD_C | |
1833 | -static mchunkptr mremap_chunk(mchunkptr p, size_t new_size) | |
1834 | -#else | |
1835 | -static mchunkptr mremap_chunk(p, new_size) mchunkptr p; size_t new_size; | |
1836 | -#endif | |
1837 | -{ | |
1838 | - size_t page_mask = malloc_getpagesize - 1; | |
1839 | - INTERNAL_SIZE_T offset = p->prev_size; | |
1840 | - INTERNAL_SIZE_T size = chunksize(p); | |
1841 | - char *cp; | |
1842 | - | |
1843 | - assert (chunk_is_mmapped(p)); | |
1844 | - assert(! ((char*)p >= sbrk_base && (char*)p < sbrk_base + sbrked_mem)); | |
1845 | - assert((n_mmaps > 0)); | |
1846 | - assert(((size + offset) & (malloc_getpagesize-1)) == 0); | |
1847 | - | |
1848 | - /* Note the extra SIZE_SZ overhead as in mmap_chunk(). */ | |
1849 | - new_size = (new_size + offset + SIZE_SZ + page_mask) & ~page_mask; | |
1850 | - | |
1851 | - cp = (char *)mremap((char *)p - offset, size + offset, new_size, 1); | |
1852 | - | |
1853 | - if (cp == (char *)-1) return 0; | |
1854 | - | |
1855 | - p = (mchunkptr)(cp + offset); | |
1856 | - | |
1857 | - assert(aligned_OK(chunk2mem(p))); | |
1858 | - | |
1859 | - assert((p->prev_size == offset)); | |
1860 | - set_head(p, (new_size - offset)|IS_MMAPPED); | |
1861 | - | |
1862 | - mmapped_mem -= size + offset; | |
1863 | - mmapped_mem += new_size; | |
1864 | - if ((unsigned long)mmapped_mem > (unsigned long)max_mmapped_mem) | |
1865 | - max_mmapped_mem = mmapped_mem; | |
1866 | - if ((unsigned long)(mmapped_mem + sbrked_mem) > (unsigned long)max_total_mem) | |
1867 | - max_total_mem = mmapped_mem + sbrked_mem; | |
1868 | - return p; | |
1869 | -} | |
1870 | - | |
1871 | -#endif /* HAVE_MREMAP */ | |
1872 | - | |
1873 | -#endif /* HAVE_MMAP */ | |
1874 | - | |
1875 | - | |
1876 | - | |
1877 | - | |
1878 | -/* | |
1879 | - Extend the top-most chunk by obtaining memory from system. | |
1880 | - Main interface to sbrk (but see also malloc_trim). | |
1881 | -*/ | |
1882 | - | |
1883 | -#if __STD_C | |
1884 | -static void malloc_extend_top(INTERNAL_SIZE_T nb) | |
1885 | -#else | |
1886 | -static void malloc_extend_top(nb) INTERNAL_SIZE_T nb; | |
1887 | -#endif | |
1888 | -{ | |
1889 | - char* brk; /* return value from sbrk */ | |
1890 | - INTERNAL_SIZE_T front_misalign; /* unusable bytes at front of sbrked space */ | |
1891 | - INTERNAL_SIZE_T correction; /* bytes for 2nd sbrk call */ | |
1892 | - char* new_brk; /* return of 2nd sbrk call */ | |
1893 | - INTERNAL_SIZE_T top_size; /* new size of top chunk */ | |
1894 | - | |
1895 | - mchunkptr old_top = top; /* Record state of old top */ | |
1896 | - INTERNAL_SIZE_T old_top_size = chunksize(old_top); | |
1897 | - char* old_end = (char*)(chunk_at_offset(old_top, old_top_size)); | |
1898 | - | |
1899 | - /* Pad request with top_pad plus minimal overhead */ | |
1900 | - | |
1901 | - INTERNAL_SIZE_T sbrk_size = nb + top_pad + MINSIZE; | |
1902 | - unsigned long pagesz = malloc_getpagesize; | |
1903 | - | |
1904 | - /* If not the first time through, round to preserve page boundary */ | |
1905 | - /* Otherwise, we need to correct to a page size below anyway. */ | |
1906 | - /* (We also correct below if an intervening foreign sbrk call.) */ | |
1907 | - | |
1908 | - if (sbrk_base != (char*)(-1)) | |
1909 | - sbrk_size = (sbrk_size + (pagesz - 1)) & ~(pagesz - 1); | |
1910 | - | |
1911 | - brk = (char*)(MORECORE (sbrk_size)); | |
1912 | - | |
1913 | - /* Fail if sbrk failed or if a foreign sbrk call killed our space */ | |
1914 | - if (brk == (char*)(MORECORE_FAILURE) || | |
1915 | - (brk < old_end && old_top != initial_top)) | |
1916 | - return; | |
1917 | - | |
1918 | - sbrked_mem += sbrk_size; | |
1919 | - | |
1920 | - if (brk == old_end) /* can just add bytes to current top */ | |
1921 | - { | |
1922 | - top_size = sbrk_size + old_top_size; | |
1923 | - set_head(top, top_size | PREV_INUSE); | |
1924 | - } | |
1925 | - else | |
1926 | - { | |
1927 | - if (sbrk_base == (char*)(-1)) /* First time through. Record base */ | |
1928 | - sbrk_base = brk; | |
1929 | - else /* Someone else called sbrk(). Count those bytes as sbrked_mem. */ | |
1930 | - sbrked_mem += brk - (char*)old_end; | |
1931 | - | |
1932 | - /* Guarantee alignment of first new chunk made from this space */ | |
1933 | - front_misalign = (unsigned long)chunk2mem(brk) & MALLOC_ALIGN_MASK; | |
1934 | - if (front_misalign > 0) | |
1935 | - { | |
1936 | - correction = (MALLOC_ALIGNMENT) - front_misalign; | |
1937 | - brk += correction; | |
1938 | - } | |
1939 | - else | |
1940 | - correction = 0; | |
1941 | - | |
1942 | - /* Guarantee the next brk will be at a page boundary */ | |
1943 | - correction += pagesz - ((unsigned long)(brk + sbrk_size) & (pagesz - 1)); | |
1944 | - | |
1945 | - /* Allocate correction */ | |
1946 | - new_brk = (char*)(MORECORE (correction)); | |
1947 | - if (new_brk == (char*)(MORECORE_FAILURE)) return; | |
1948 | - | |
1949 | - sbrked_mem += correction; | |
1950 | - | |
1951 | - top = (mchunkptr)brk; | |
1952 | - top_size = new_brk - brk + correction; | |
1953 | - set_head(top, top_size | PREV_INUSE); | |
1954 | - | |
1955 | - if (old_top != initial_top) | |
1956 | - { | |
1957 | - | |
1958 | - /* There must have been an intervening foreign sbrk call. */ | |
1959 | - /* A double fencepost is necessary to prevent consolidation */ | |
1960 | - | |
1961 | - /* If not enough space to do this, then user did something very wrong */ | |
1962 | - if (old_top_size < MINSIZE) | |
1963 | - { | |
1964 | - set_head(top, PREV_INUSE); /* will force null return from malloc */ | |
1965 | - return; | |
1966 | - } | |
1967 | - | |
1968 | - /* Also keep size a multiple of MALLOC_ALIGNMENT */ | |
1969 | - old_top_size = (old_top_size - 3*SIZE_SZ) & ~MALLOC_ALIGN_MASK; | |
1970 | - set_head_size(old_top, old_top_size); | |
1971 | - chunk_at_offset(old_top, old_top_size )->size = | |
1972 | - SIZE_SZ|PREV_INUSE; | |
1973 | - chunk_at_offset(old_top, old_top_size + SIZE_SZ)->size = | |
1974 | - SIZE_SZ|PREV_INUSE; | |
1975 | - /* If possible, release the rest. */ | |
1976 | - if (old_top_size >= MINSIZE) | |
1977 | - fREe(chunk2mem(old_top)); | |
1978 | - } | |
1979 | - } | |
1980 | - | |
1981 | - if ((unsigned long)sbrked_mem > (unsigned long)max_sbrked_mem) | |
1982 | - max_sbrked_mem = sbrked_mem; | |
1983 | - if ((unsigned long)(mmapped_mem + sbrked_mem) > (unsigned long)max_total_mem) | |
1984 | - max_total_mem = mmapped_mem + sbrked_mem; | |
1985 | - | |
1986 | - /* We always land on a page boundary */ | |
1987 | - assert(((unsigned long)((char*)top + top_size) & (pagesz - 1)) == 0); | |
1988 | -} | |
1989 | - | |
1990 | - | |
1991 | - | |
1992 | - | |
1993 | -/* Main public routines */ | |
1994 | - | |
1995 | - | |
1996 | -/* | |
1997 | - Malloc Algorthim: | |
1998 | - | |
1999 | - The requested size is first converted into a usable form, `nb'. | |
2000 | - This currently means to add 4 bytes overhead plus possibly more to | |
2001 | - obtain 8-byte alignment and/or to obtain a size of at least | |
2002 | - MINSIZE (currently 16 bytes), the smallest allocatable size. | |
2003 | - (All fits are considered `exact' if they are within MINSIZE bytes.) | |
2004 | - | |
2005 | - From there, the first successful of the following steps is taken: | |
2006 | - | |
2007 | - 1. The bin corresponding to the request size is scanned, and if | |
2008 | - a chunk of exactly the right size is found, it is taken. | |
2009 | - | |
2010 | - 2. The most recently remaindered chunk is used if it is big | |
2011 | - enough. This is a form of (roving) first fit, used only in | |
2012 | - the absence of exact fits. Runs of consecutive requests use | |
2013 | - the remainder of the chunk used for the previous such request | |
2014 | - whenever possible. This limited use of a first-fit style | |
2015 | - allocation strategy tends to give contiguous chunks | |
2016 | - coextensive lifetimes, which improves locality and can reduce | |
2017 | - fragmentation in the long run. | |
2018 | - | |
2019 | - 3. Other bins are scanned in increasing size order, using a | |
2020 | - chunk big enough to fulfill the request, and splitting off | |
2021 | - any remainder. This search is strictly by best-fit; i.e., | |
2022 | - the smallest (with ties going to approximately the least | |
2023 | - recently used) chunk that fits is selected. | |
2024 | - | |
2025 | - 4. If large enough, the chunk bordering the end of memory | |
2026 | - (`top') is split off. (This use of `top' is in accord with | |
2027 | - the best-fit search rule. In effect, `top' is treated as | |
2028 | - larger (and thus less well fitting) than any other available | |
2029 | - chunk since it can be extended to be as large as necessary | |
2030 | - (up to system limitations). | |
2031 | - | |
2032 | - 5. If the request size meets the mmap threshold and the | |
2033 | - system supports mmap, and there are few enough currently | |
2034 | - allocated mmapped regions, and a call to mmap succeeds, | |
2035 | - the request is allocated via direct memory mapping. | |
2036 | - | |
2037 | - 6. Otherwise, the top of memory is extended by | |
2038 | - obtaining more space from the system (normally using sbrk, | |
2039 | - but definable to anything else via the MORECORE macro). | |
2040 | - Memory is gathered from the system (in system page-sized | |
2041 | - units) in a way that allows chunks obtained across different | |
2042 | - sbrk calls to be consolidated, but does not require | |
2043 | - contiguous memory. Thus, it should be safe to intersperse | |
2044 | - mallocs with other sbrk calls. | |
2045 | - | |
2046 | - | |
2047 | - All allocations are made from the the `lowest' part of any found | |
2048 | - chunk. (The implementation invariant is that prev_inuse is | |
2049 | - always true of any allocated chunk; i.e., that each allocated | |
2050 | - chunk borders either a previously allocated and still in-use chunk, | |
2051 | - or the base of its memory arena.) | |
2052 | - | |
2053 | -*/ | |
2054 | - | |
2055 | -#if __STD_C | |
2056 | -Void_t* mALLOc(size_t bytes) | |
2057 | -#else | |
2058 | -Void_t* mALLOc(bytes) size_t bytes; | |
2059 | -#endif | |
2060 | -{ | |
2061 | - mchunkptr victim; /* inspected/selected chunk */ | |
2062 | - INTERNAL_SIZE_T victim_size; /* its size */ | |
2063 | - int idx; /* index for bin traversal */ | |
2064 | - mbinptr bin; /* associated bin */ | |
2065 | - mchunkptr remainder; /* remainder from a split */ | |
2066 | - long remainder_size; /* its size */ | |
2067 | - int remainder_index; /* its bin index */ | |
2068 | - unsigned long block; /* block traverser bit */ | |
2069 | - int startidx; /* first bin of a traversed block */ | |
2070 | - mchunkptr fwd; /* misc temp for linking */ | |
2071 | - mchunkptr bck; /* misc temp for linking */ | |
2072 | - mbinptr q; /* misc temp */ | |
2073 | - | |
2074 | - INTERNAL_SIZE_T nb = request2size(bytes); /* padded request size; */ | |
2075 | - | |
2076 | - /* Check for exact match in a bin */ | |
2077 | - | |
2078 | - if (is_small_request(nb)) /* Faster version for small requests */ | |
2079 | - { | |
2080 | - idx = smallbin_index(nb); | |
2081 | - | |
2082 | - /* No traversal or size check necessary for small bins. */ | |
2083 | - | |
2084 | - q = bin_at(idx); | |
2085 | - victim = last(q); | |
2086 | - | |
2087 | - /* Also scan the next one, since it would have a remainder < MINSIZE */ | |
2088 | - if (victim == q) | |
2089 | - { | |
2090 | - q = next_bin(q); | |
2091 | - victim = last(q); | |
2092 | - } | |
2093 | - if (victim != q) | |
2094 | - { | |
2095 | - victim_size = chunksize(victim); | |
2096 | - unlink(victim, bck, fwd); | |
2097 | - set_inuse_bit_at_offset(victim, victim_size); | |
2098 | - check_malloced_chunk(victim, nb); | |
2099 | - return chunk2mem(victim); | |
2100 | - } | |
2101 | - | |
2102 | - idx += 2; /* Set for bin scan below. We've already scanned 2 bins. */ | |
2103 | - | |
2104 | - } | |
2105 | - else | |
2106 | - { | |
2107 | - idx = bin_index(nb); | |
2108 | - bin = bin_at(idx); | |
2109 | - | |
2110 | - for (victim = last(bin); victim != bin; victim = victim->bk) | |
2111 | - { | |
2112 | - victim_size = chunksize(victim); | |
2113 | - remainder_size = victim_size - nb; | |
2114 | - | |
2115 | - if (remainder_size >= (long)MINSIZE) /* too big */ | |
2116 | - { | |
2117 | - --idx; /* adjust to rescan below after checking last remainder */ | |
2118 | - break; | |
2119 | - } | |
2120 | - | |
2121 | - else if (remainder_size >= 0) /* exact fit */ | |
2122 | - { | |
2123 | - unlink(victim, bck, fwd); | |
2124 | - set_inuse_bit_at_offset(victim, victim_size); | |
2125 | - check_malloced_chunk(victim, nb); | |
2126 | - return chunk2mem(victim); | |
2127 | - } | |
2128 | - } | |
2129 | - | |
2130 | - ++idx; | |
2131 | - | |
2132 | - } | |
2133 | - | |
2134 | - /* Try to use the last split-off remainder */ | |
2135 | - | |
2136 | - if ( (victim = last_remainder->fd) != last_remainder) | |
2137 | - { | |
2138 | - victim_size = chunksize(victim); | |
2139 | - remainder_size = victim_size - nb; | |
2140 | - | |
2141 | - if (remainder_size >= (long)MINSIZE) /* re-split */ | |
2142 | - { | |
2143 | - remainder = chunk_at_offset(victim, nb); | |
2144 | - set_head(victim, nb | PREV_INUSE); | |
2145 | - link_last_remainder(remainder); | |
2146 | - set_head(remainder, remainder_size | PREV_INUSE); | |
2147 | - set_foot(remainder, remainder_size); | |
2148 | - check_malloced_chunk(victim, nb); | |
2149 | - return chunk2mem(victim); | |
2150 | - } | |
2151 | - | |
2152 | - clear_last_remainder; | |
2153 | - | |
2154 | - if (remainder_size >= 0) /* exhaust */ | |
2155 | - { | |
2156 | - set_inuse_bit_at_offset(victim, victim_size); | |
2157 | - check_malloced_chunk(victim, nb); | |
2158 | - return chunk2mem(victim); | |
2159 | - } | |
2160 | - | |
2161 | - /* Else place in bin */ | |
2162 | - | |
2163 | - frontlink(victim, victim_size, remainder_index, bck, fwd); | |
2164 | - } | |
2165 | - | |
2166 | - /* | |
2167 | - If there are any possibly nonempty big-enough blocks, | |
2168 | - search for best fitting chunk by scanning bins in blockwidth units. | |
2169 | - */ | |
2170 | - | |
2171 | - if ( (block = idx2binblock(idx)) <= binblocks) | |
2172 | - { | |
2173 | - | |
2174 | - /* Get to the first marked block */ | |
2175 | - | |
2176 | - if ( (block & binblocks) == 0) | |
2177 | - { | |
2178 | - /* force to an even block boundary */ | |
2179 | - idx = (idx & ~(BINBLOCKWIDTH - 1)) + BINBLOCKWIDTH; | |
2180 | - block <<= 1; | |
2181 | - while ((block & binblocks) == 0) | |
2182 | - { | |
2183 | - idx += BINBLOCKWIDTH; | |
2184 | - block <<= 1; | |
2185 | - } | |
2186 | - } | |
2187 | - | |
2188 | - /* For each possibly nonempty block ... */ | |
2189 | - for (;;) | |
2190 | - { | |
2191 | - startidx = idx; /* (track incomplete blocks) */ | |
2192 | - q = bin = bin_at(idx); | |
2193 | - | |
2194 | - /* For each bin in this block ... */ | |
2195 | - do | |
2196 | - { | |
2197 | - /* Find and use first big enough chunk ... */ | |
2198 | - | |
2199 | - for (victim = last(bin); victim != bin; victim = victim->bk) | |
2200 | - { | |
2201 | - victim_size = chunksize(victim); | |
2202 | - remainder_size = victim_size - nb; | |
2203 | - | |
2204 | - if (remainder_size >= (long)MINSIZE) /* split */ | |
2205 | - { | |
2206 | - remainder = chunk_at_offset(victim, nb); | |
2207 | - set_head(victim, nb | PREV_INUSE); | |
2208 | - unlink(victim, bck, fwd); | |
2209 | - link_last_remainder(remainder); | |
2210 | - set_head(remainder, remainder_size | PREV_INUSE); | |
2211 | - set_foot(remainder, remainder_size); | |
2212 | - check_malloced_chunk(victim, nb); | |
2213 | - return chunk2mem(victim); | |
2214 | - } | |
2215 | - | |
2216 | - else if (remainder_size >= 0) /* take */ | |
2217 | - { | |
2218 | - set_inuse_bit_at_offset(victim, victim_size); | |
2219 | - unlink(victim, bck, fwd); | |
2220 | - check_malloced_chunk(victim, nb); | |
2221 | - return chunk2mem(victim); | |
2222 | - } | |
2223 | - | |
2224 | - } | |
2225 | - | |
2226 | - bin = next_bin(bin); | |
2227 | - | |
2228 | - } while ((++idx & (BINBLOCKWIDTH - 1)) != 0); | |
2229 | - | |
2230 | - /* Clear out the block bit. */ | |
2231 | - | |
2232 | - do /* Possibly backtrack to try to clear a partial block */ | |
2233 | - { | |
2234 | - if ((startidx & (BINBLOCKWIDTH - 1)) == 0) | |
2235 | - { | |
2236 | - binblocks &= ~block; | |
2237 | - break; | |
2238 | - } | |
2239 | - --startidx; | |
2240 | - q = prev_bin(q); | |
2241 | - } while (first(q) == q); | |
2242 | - | |
2243 | - /* Get to the next possibly nonempty block */ | |
2244 | - | |
2245 | - if ( (block <<= 1) <= binblocks && (block != 0) ) | |
2246 | - { | |
2247 | - while ((block & binblocks) == 0) | |
2248 | - { | |
2249 | - idx += BINBLOCKWIDTH; | |
2250 | - block <<= 1; | |
2251 | - } | |
2252 | - } | |
2253 | - else | |
2254 | - break; | |
2255 | - } | |
2256 | - } | |
2257 | - | |
2258 | - | |
2259 | - /* Try to use top chunk */ | |
2260 | - | |
2261 | - /* Require that there be a remainder, ensuring top always exists */ | |
2262 | - if ( (remainder_size = chunksize(top) - nb) < (long)MINSIZE) | |
2263 | - { | |
2264 | - | |
2265 | -#if HAVE_MMAP | |
2266 | - /* If big and would otherwise need to extend, try to use mmap instead */ | |
2267 | - if ((unsigned long)nb >= (unsigned long)mmap_threshold && | |
2268 | - (victim = mmap_chunk(nb)) != 0) | |
2269 | - return chunk2mem(victim); | |
2270 | -#endif | |
2271 | - | |
2272 | - /* Try to extend */ | |
2273 | - malloc_extend_top(nb); | |
2274 | - if ( (remainder_size = chunksize(top) - nb) < (long)MINSIZE) | |
2275 | - return 0; /* propagate failure */ | |
2276 | - } | |
2277 | - | |
2278 | - victim = top; | |
2279 | - set_head(victim, nb | PREV_INUSE); | |
2280 | - top = chunk_at_offset(victim, nb); | |
2281 | - set_head(top, remainder_size | PREV_INUSE); | |
2282 | - check_malloced_chunk(victim, nb); | |
2283 | - return chunk2mem(victim); | |
2284 | - | |
2285 | -} | |
2286 | - | |
2287 | - | |
2288 | - | |
2289 | - | |
2290 | -/* | |
2291 | - | |
2292 | - free() algorithm : | |
2293 | - | |
2294 | - cases: | |
2295 | - | |
2296 | - 1. free(0) has no effect. | |
2297 | - | |
2298 | - 2. If the chunk was allocated via mmap, it is release via munmap(). | |
2299 | - | |
2300 | - 3. If a returned chunk borders the current high end of memory, | |
2301 | - it is consolidated into the top, and if the total unused | |
2302 | - topmost memory exceeds the trim threshold, malloc_trim is | |
2303 | - called. | |
2304 | - | |
2305 | - 4. Other chunks are consolidated as they arrive, and | |
2306 | - placed in corresponding bins. (This includes the case of | |
2307 | - consolidating with the current `last_remainder'). | |
2308 | - | |
2309 | -*/ | |
2310 | - | |
2311 | - | |
2312 | -#if __STD_C | |
2313 | -void fREe(Void_t* mem) | |
2314 | -#else | |
2315 | -void fREe(mem) Void_t* mem; | |
2316 | -#endif | |
2317 | -{ | |
2318 | - mchunkptr p; /* chunk corresponding to mem */ | |
2319 | - INTERNAL_SIZE_T hd; /* its head field */ | |
2320 | - INTERNAL_SIZE_T sz; /* its size */ | |
2321 | - int idx; /* its bin index */ | |
2322 | - mchunkptr next; /* next contiguous chunk */ | |
2323 | - INTERNAL_SIZE_T nextsz; /* its size */ | |
2324 | - INTERNAL_SIZE_T prevsz; /* size of previous contiguous chunk */ | |
2325 | - mchunkptr bck; /* misc temp for linking */ | |
2326 | - mchunkptr fwd; /* misc temp for linking */ | |
2327 | - int islr; /* track whether merging with last_remainder */ | |
2328 | - | |
2329 | - if (mem == 0) /* free(0) has no effect */ | |
2330 | - return; | |
2331 | - | |
2332 | - p = mem2chunk(mem); | |
2333 | - hd = p->size; | |
2334 | - | |
2335 | -#if HAVE_MMAP | |
2336 | - if (hd & IS_MMAPPED) /* release mmapped memory. */ | |
2337 | - { | |
2338 | - munmap_chunk(p); | |
2339 | - return; | |
2340 | - } | |
2341 | -#endif | |
2342 | - | |
2343 | - check_inuse_chunk(p); | |
2344 | - | |
2345 | - sz = hd & ~PREV_INUSE; | |
2346 | - next = chunk_at_offset(p, sz); | |
2347 | - nextsz = chunksize(next); | |
2348 | - | |
2349 | - if (next == top) /* merge with top */ | |
2350 | - { | |
2351 | - sz += nextsz; | |
2352 | - | |
2353 | - if (!(hd & PREV_INUSE)) /* consolidate backward */ | |
2354 | - { | |
2355 | - prevsz = p->prev_size; | |
2356 | - p = chunk_at_offset(p, -prevsz); | |
2357 | - sz += prevsz; | |
2358 | - unlink(p, bck, fwd); | |
2359 | - } | |
2360 | - | |
2361 | - set_head(p, sz | PREV_INUSE); | |
2362 | - top = p; | |
2363 | - if ((unsigned long)(sz) >= (unsigned long)trim_threshold) | |
2364 | - malloc_trim(top_pad); | |
2365 | - return; | |
2366 | - } | |
2367 | - | |
2368 | - set_head(next, nextsz); /* clear inuse bit */ | |
2369 | - | |
2370 | - islr = 0; | |
2371 | - | |
2372 | - if (!(hd & PREV_INUSE)) /* consolidate backward */ | |
2373 | - { | |
2374 | - prevsz = p->prev_size; | |
2375 | - p = chunk_at_offset(p, -prevsz); | |
2376 | - sz += prevsz; | |
2377 | - | |
2378 | - if (p->fd == last_remainder) /* keep as last_remainder */ | |
2379 | - islr = 1; | |
2380 | - else | |
2381 | - unlink(p, bck, fwd); | |
2382 | - } | |
2383 | - | |
2384 | - if (!(inuse_bit_at_offset(next, nextsz))) /* consolidate forward */ | |
2385 | - { | |
2386 | - sz += nextsz; | |
2387 | - | |
2388 | - if (!islr && next->fd == last_remainder) /* re-insert last_remainder */ | |
2389 | - { | |
2390 | - islr = 1; | |
2391 | - link_last_remainder(p); | |
2392 | - } | |
2393 | - else | |
2394 | - unlink(next, bck, fwd); | |
2395 | - } | |
2396 | - | |
2397 | - | |
2398 | - set_head(p, sz | PREV_INUSE); | |
2399 | - set_foot(p, sz); | |
2400 | - if (!islr) | |
2401 | - frontlink(p, sz, idx, bck, fwd); | |
2402 | -} | |
2403 | - | |
2404 | - | |
2405 | - | |
2406 | - | |
2407 | - | |
2408 | -/* | |
2409 | - | |
2410 | - Realloc algorithm: | |
2411 | - | |
2412 | - Chunks that were obtained via mmap cannot be extended or shrunk | |
2413 | - unless HAVE_MREMAP is defined, in which case mremap is used. | |
2414 | - Otherwise, if their reallocation is for additional space, they are | |
2415 | - copied. If for less, they are just left alone. | |
2416 | - | |
2417 | - Otherwise, if the reallocation is for additional space, and the | |
2418 | - chunk can be extended, it is, else a malloc-copy-free sequence is | |
2419 | - taken. There are several different ways that a chunk could be | |
2420 | - extended. All are tried: | |
2421 | - | |
2422 | - * Extending forward into following adjacent free chunk. | |
2423 | - * Shifting backwards, joining preceding adjacent space | |
2424 | - * Both shifting backwards and extending forward. | |
2425 | - * Extending into newly sbrked space | |
2426 | - | |
2427 | - Unless the #define REALLOC_ZERO_BYTES_FREES is set, realloc with a | |
2428 | - size argument of zero (re)allocates a minimum-sized chunk. | |
2429 | - | |
2430 | - If the reallocation is for less space, and the new request is for | |
2431 | - a `small' (<512 bytes) size, then the newly unused space is lopped | |
2432 | - off and freed. | |
2433 | - | |
2434 | - The old unix realloc convention of allowing the last-free'd chunk | |
2435 | - to be used as an argument to realloc is no longer supported. | |
2436 | - I don't know of any programs still relying on this feature, | |
2437 | - and allowing it would also allow too many other incorrect | |
2438 | - usages of realloc to be sensible. | |
2439 | - | |
2440 | - | |
2441 | -*/ | |
2442 | - | |
2443 | - | |
2444 | -#if __STD_C | |
2445 | -Void_t* rEALLOc(Void_t* oldmem, size_t bytes) | |
2446 | -#else | |
2447 | -Void_t* rEALLOc(oldmem, bytes) Void_t* oldmem; size_t bytes; | |
2448 | -#endif | |
2449 | -{ | |
2450 | - INTERNAL_SIZE_T nb; /* padded request size */ | |
2451 | - | |
2452 | - mchunkptr oldp; /* chunk corresponding to oldmem */ | |
2453 | - INTERNAL_SIZE_T oldsize; /* its size */ | |
2454 | - | |
2455 | - mchunkptr newp; /* chunk to return */ | |
2456 | - INTERNAL_SIZE_T newsize; /* its size */ | |
2457 | - Void_t* newmem; /* corresponding user mem */ | |
2458 | - | |
2459 | - mchunkptr next; /* next contiguous chunk after oldp */ | |
2460 | - INTERNAL_SIZE_T nextsize; /* its size */ | |
2461 | - | |
2462 | - mchunkptr prev; /* previous contiguous chunk before oldp */ | |
2463 | - INTERNAL_SIZE_T prevsize; /* its size */ | |
2464 | - | |
2465 | - mchunkptr remainder; /* holds split off extra space from newp */ | |
2466 | - INTERNAL_SIZE_T remainder_size; /* its size */ | |
2467 | - | |
2468 | - mchunkptr bck; /* misc temp for linking */ | |
2469 | - mchunkptr fwd; /* misc temp for linking */ | |
2470 | - | |
2471 | -#ifdef REALLOC_ZERO_BYTES_FREES | |
2472 | - if (bytes == 0) { fREe(oldmem); return 0; } | |
2473 | -#endif | |
2474 | - | |
2475 | - | |
2476 | - /* realloc of null is supposed to be same as malloc */ | |
2477 | - if (oldmem == 0) return mALLOc(bytes); | |
2478 | - | |
2479 | - newp = oldp = mem2chunk(oldmem); | |
2480 | - newsize = oldsize = chunksize(oldp); | |
2481 | - | |
2482 | - | |
2483 | - nb = request2size(bytes); | |
2484 | - | |
2485 | -#if HAVE_MMAP | |
2486 | - if (chunk_is_mmapped(oldp)) | |
2487 | - { | |
2488 | -#if HAVE_MREMAP | |
2489 | - newp = mremap_chunk(oldp, nb); | |
2490 | - if(newp) return chunk2mem(newp); | |
2491 | -#endif | |
2492 | - /* Note the extra SIZE_SZ overhead. */ | |
2493 | - if(oldsize - SIZE_SZ >= nb) return oldmem; /* do nothing */ | |
2494 | - /* Must alloc, copy, free. */ | |
2495 | - newmem = mALLOc(bytes); | |
2496 | - if (newmem == 0) return 0; /* propagate failure */ | |
2497 | - MALLOC_COPY(newmem, oldmem, oldsize - 2*SIZE_SZ); | |
2498 | - munmap_chunk(oldp); | |
2499 | - return newmem; | |
2500 | - } | |
2501 | -#endif | |
2502 | - | |
2503 | - check_inuse_chunk(oldp); | |
2504 | - | |
2505 | - if ((long)(oldsize) < (long)(nb)) | |
2506 | - { | |
2507 | - | |
2508 | - /* Try expanding forward */ | |
2509 | - | |
2510 | - next = chunk_at_offset(oldp, oldsize); | |
2511 | - if (next == top || !inuse(next)) | |
2512 | - { | |
2513 | - nextsize = chunksize(next); | |
2514 | - | |
2515 | - /* Forward into top only if a remainder */ | |
2516 | - if (next == top) | |
2517 | - { | |
2518 | - if ((long)(nextsize + newsize) >= (long)(nb + MINSIZE)) | |
2519 | - { | |
2520 | - newsize += nextsize; | |
2521 | - top = chunk_at_offset(oldp, nb); | |
2522 | - set_head(top, (newsize - nb) | PREV_INUSE); | |
2523 | - set_head_size(oldp, nb); | |
2524 | - return chunk2mem(oldp); | |
2525 | - } | |
2526 | - } | |
2527 | - | |
2528 | - /* Forward into next chunk */ | |
2529 | - else if (((long)(nextsize + newsize) >= (long)(nb))) | |
2530 | - { | |
2531 | - unlink(next, bck, fwd); | |
2532 | - newsize += nextsize; | |
2533 | - goto split; | |
2534 | - } | |
2535 | - } | |
2536 | - else | |
2537 | - { | |
2538 | - next = 0; | |
2539 | - nextsize = 0; | |
2540 | - } | |
2541 | - | |
2542 | - /* Try shifting backwards. */ | |
2543 | - | |
2544 | - if (!prev_inuse(oldp)) | |
2545 | - { | |
2546 | - prev = prev_chunk(oldp); | |
2547 | - prevsize = chunksize(prev); | |
2548 | - | |
2549 | - /* try forward + backward first to save a later consolidation */ | |
2550 | - | |
2551 | - if (next != 0) | |
2552 | - { | |
2553 | - /* into top */ | |
2554 | - if (next == top) | |
2555 | - { | |
2556 | - if ((long)(nextsize + prevsize + newsize) >= (long)(nb + MINSIZE)) | |
2557 | - { | |
2558 | - unlink(prev, bck, fwd); | |
2559 | - newp = prev; | |
2560 | - newsize += prevsize + nextsize; | |
2561 | - newmem = chunk2mem(newp); | |
2562 | - MALLOC_COPY(newmem, oldmem, oldsize - SIZE_SZ); | |
2563 | - top = chunk_at_offset(newp, nb); | |
2564 | - set_head(top, (newsize - nb) | PREV_INUSE); | |
2565 | - set_head_size(newp, nb); | |
2566 | - return newmem; | |
2567 | - } | |
2568 | - } | |
2569 | - | |
2570 | - /* into next chunk */ | |
2571 | - else if (((long)(nextsize + prevsize + newsize) >= (long)(nb))) | |
2572 | - { | |
2573 | - unlink(next, bck, fwd); | |
2574 | - unlink(prev, bck, fwd); | |
2575 | - newp = prev; | |
2576 | - newsize += nextsize + prevsize; | |
2577 | - newmem = chunk2mem(newp); | |
2578 | - MALLOC_COPY(newmem, oldmem, oldsize - SIZE_SZ); | |
2579 | - goto split; | |
2580 | - } | |
2581 | - } | |
2582 | - | |
2583 | - /* backward only */ | |
2584 | - if (prev != 0 && (long)(prevsize + newsize) >= (long)nb) | |
2585 | - { | |
2586 | - unlink(prev, bck, fwd); | |
2587 | - newp = prev; | |
2588 | - newsize += prevsize; | |
2589 | - newmem = chunk2mem(newp); | |
2590 | - MALLOC_COPY(newmem, oldmem, oldsize - SIZE_SZ); | |
2591 | - goto split; | |
2592 | - } | |
2593 | - } | |
2594 | - | |
2595 | - /* Must allocate */ | |
2596 | - | |
2597 | - newmem = mALLOc (bytes); | |
2598 | - | |
2599 | - if (newmem == 0) /* propagate failure */ | |
2600 | - return 0; | |
2601 | - | |
2602 | - /* Avoid copy if newp is next chunk after oldp. */ | |
2603 | - /* (This can only happen when new chunk is sbrk'ed.) */ | |
2604 | - | |
2605 | - if ( (newp = mem2chunk(newmem)) == next_chunk(oldp)) | |
2606 | - { | |
2607 | - newsize += chunksize(newp); | |
2608 | - newp = oldp; | |
2609 | - goto split; | |
2610 | - } | |
2611 | - | |
2612 | - /* Otherwise copy, free, and exit */ | |
2613 | - MALLOC_COPY(newmem, oldmem, oldsize - SIZE_SZ); | |
2614 | - fREe(oldmem); | |
2615 | - return newmem; | |
2616 | - } | |
2617 | - | |
2618 | - | |
2619 | - split: /* split off extra room in old or expanded chunk */ | |
2620 | - | |
2621 | - if (newsize - nb >= MINSIZE) /* split off remainder */ | |
2622 | - { | |
2623 | - remainder = chunk_at_offset(newp, nb); | |
2624 | - remainder_size = newsize - nb; | |
2625 | - set_head_size(newp, nb); | |
2626 | - set_head(remainder, remainder_size | PREV_INUSE); | |
2627 | - set_inuse_bit_at_offset(remainder, remainder_size); | |
2628 | - fREe(chunk2mem(remainder)); /* let free() deal with it */ | |
2629 | - } | |
2630 | - else | |
2631 | - { | |
2632 | - set_head_size(newp, newsize); | |
2633 | - set_inuse_bit_at_offset(newp, newsize); | |
2634 | - } | |
2635 | - | |
2636 | - check_inuse_chunk(newp); | |
2637 | - return chunk2mem(newp); | |
2638 | -} | |
2639 | - | |
2640 | - | |
2641 | - | |
2642 | - | |
2643 | -/* | |
2644 | - | |
2645 | - memalign algorithm: | |
2646 | - | |
2647 | - memalign requests more than enough space from malloc, finds a spot | |
2648 | - within that chunk that meets the alignment request, and then | |
2649 | - possibly frees the leading and trailing space. | |
2650 | - | |
2651 | - The alignment argument must be a power of two. This property is not | |
2652 | - checked by memalign, so misuse may result in random runtime errors. | |
2653 | - | |
2654 | - 8-byte alignment is guaranteed by normal malloc calls, so don't | |
2655 | - bother calling memalign with an argument of 8 or less. | |
2656 | - | |
2657 | - Overreliance on memalign is a sure way to fragment space. | |
2658 | - | |
2659 | -*/ | |
2660 | - | |
2661 | - | |
2662 | -#if __STD_C | |
2663 | -Void_t* mEMALIGn(size_t alignment, size_t bytes) | |
2664 | -#else | |
2665 | -Void_t* mEMALIGn(alignment, bytes) size_t alignment; size_t bytes; | |
2666 | -#endif | |
2667 | -{ | |
2668 | - INTERNAL_SIZE_T nb; /* padded request size */ | |
2669 | - char* m; /* memory returned by malloc call */ | |
2670 | - mchunkptr p; /* corresponding chunk */ | |
2671 | - char* brk; /* alignment point within p */ | |
2672 | - mchunkptr newp; /* chunk to return */ | |
2673 | - INTERNAL_SIZE_T newsize; /* its size */ | |
2674 | - INTERNAL_SIZE_T leadsize; /* leading space befor alignment point */ | |
2675 | - mchunkptr remainder; /* spare room at end to split off */ | |
2676 | - long remainder_size; /* its size */ | |
2677 | - | |
2678 | - /* If need less alignment than we give anyway, just relay to malloc */ | |
2679 | - | |
2680 | - if (alignment <= MALLOC_ALIGNMENT) return mALLOc(bytes); | |
2681 | - | |
2682 | - /* Otherwise, ensure that it is at least a minimum chunk size */ | |
2683 | - | |
2684 | - if (alignment < MINSIZE) alignment = MINSIZE; | |
2685 | - | |
2686 | - /* Call malloc with worst case padding to hit alignment. */ | |
2687 | - | |
2688 | - nb = request2size(bytes); | |
2689 | - m = (char*)(mALLOc(nb + alignment + MINSIZE)); | |
2690 | - | |
2691 | - if (m == 0) return 0; /* propagate failure */ | |
2692 | - | |
2693 | - p = mem2chunk(m); | |
2694 | - | |
2695 | - if ((((unsigned long)(m)) % alignment) == 0) /* aligned */ | |
2696 | - { | |
2697 | -#if HAVE_MMAP | |
2698 | - if(chunk_is_mmapped(p)) | |
2699 | - return chunk2mem(p); /* nothing more to do */ | |
2700 | -#endif | |
2701 | - } | |
2702 | - else /* misaligned */ | |
2703 | - { | |
2704 | - /* | |
2705 | - Find an aligned spot inside chunk. | |
2706 | - Since we need to give back leading space in a chunk of at | |
2707 | - least MINSIZE, if the first calculation places us at | |
2708 | - a spot with less than MINSIZE leader, we can move to the | |
2709 | - next aligned spot -- we've allocated enough total room so that | |
2710 | - this is always possible. | |
2711 | - */ | |
2712 | - | |
2713 | - brk = (char*)mem2chunk(((unsigned long)(m + alignment - 1)) & -alignment); | |
2714 | - if ((long)(brk - (char*)(p)) < MINSIZE) brk = brk + alignment; | |
2715 | - | |
2716 | - newp = (mchunkptr)brk; | |
2717 | - leadsize = brk - (char*)(p); | |
2718 | - newsize = chunksize(p) - leadsize; | |
2719 | - | |
2720 | -#if HAVE_MMAP | |
2721 | - if(chunk_is_mmapped(p)) | |
2722 | - { | |
2723 | - newp->prev_size = p->prev_size + leadsize; | |
2724 | - set_head(newp, newsize|IS_MMAPPED); | |
2725 | - return chunk2mem(newp); | |
2726 | - } | |
2727 | -#endif | |
2728 | - | |
2729 | - /* give back leader, use the rest */ | |
2730 | - | |
2731 | - set_head(newp, newsize | PREV_INUSE); | |
2732 | - set_inuse_bit_at_offset(newp, newsize); | |
2733 | - set_head_size(p, leadsize); | |
2734 | - fREe(chunk2mem(p)); | |
2735 | - p = newp; | |
2736 | - | |
2737 | - assert (newsize >= nb && (((unsigned long)(chunk2mem(p))) % alignment) == 0); | |
2738 | - } | |
2739 | - | |
2740 | - /* Also give back spare room at the end */ | |
2741 | - | |
2742 | - remainder_size = chunksize(p) - nb; | |
2743 | - | |
2744 | - if (remainder_size >= (long)MINSIZE) | |
2745 | - { | |
2746 | - remainder = chunk_at_offset(p, nb); | |
2747 | - set_head(remainder, remainder_size | PREV_INUSE); | |
2748 | - set_head_size(p, nb); | |
2749 | - fREe(chunk2mem(remainder)); | |
2750 | - } | |
2751 | - | |
2752 | - check_inuse_chunk(p); | |
2753 | - return chunk2mem(p); | |
2754 | - | |
2755 | -} | |
2756 | - | |
2757 | - | |
2758 | - | |
2759 | - | |
2760 | -/* | |
2761 | - valloc just invokes memalign with alignment argument equal | |
2762 | - to the page size of the system (or as near to this as can | |
2763 | - be figured out from all the includes/defines above.) | |
2764 | -*/ | |
2765 | - | |
2766 | -#if __STD_C | |
2767 | -Void_t* vALLOc(size_t bytes) | |
2768 | -#else | |
2769 | -Void_t* vALLOc(bytes) size_t bytes; | |
2770 | -#endif | |
2771 | -{ | |
2772 | - return mEMALIGn (malloc_getpagesize, bytes); | |
2773 | -} | |
2774 | - | |
2775 | -/* | |
2776 | - pvalloc just invokes valloc for the nearest pagesize | |
2777 | - that will accommodate request | |
2778 | -*/ | |
2779 | - | |
2780 | - | |
2781 | -#if __STD_C | |
2782 | -Void_t* pvALLOc(size_t bytes) | |
2783 | -#else | |
2784 | -Void_t* pvALLOc(bytes) size_t bytes; | |
2785 | -#endif | |
2786 | -{ | |
2787 | - size_t pagesize = malloc_getpagesize; | |
2788 | - return mEMALIGn (pagesize, (bytes + pagesize - 1) & ~(pagesize - 1)); | |
2789 | -} | |
2790 | - | |
2791 | -/* | |
2792 | - | |
2793 | - calloc calls malloc, then zeroes out the allocated chunk. | |
2794 | - | |
2795 | -*/ | |
2796 | - | |
2797 | -#if __STD_C | |
2798 | -Void_t* cALLOc(size_t n, size_t elem_size) | |
2799 | -#else | |
2800 | -Void_t* cALLOc(n, elem_size) size_t n; size_t elem_size; | |
2801 | -#endif | |
2802 | -{ | |
2803 | - mchunkptr p; | |
2804 | - INTERNAL_SIZE_T csz; | |
2805 | - | |
2806 | - INTERNAL_SIZE_T sz = n * elem_size; | |
2807 | - | |
2808 | - /* check if expand_top called, in which case don't need to clear */ | |
2809 | -#if MORECORE_CLEARS | |
2810 | - mchunkptr oldtop = top; | |
2811 | - INTERNAL_SIZE_T oldtopsize = chunksize(top); | |
2812 | -#endif | |
2813 | - Void_t* mem = mALLOc (sz); | |
2814 | - | |
2815 | - if (mem == 0) | |
2816 | - return 0; | |
2817 | - else | |
2818 | - { | |
2819 | - p = mem2chunk(mem); | |
2820 | - | |
2821 | - /* Two optional cases in which clearing not necessary */ | |
2822 | - | |
2823 | - | |
2824 | -#if HAVE_MMAP | |
2825 | - if (chunk_is_mmapped(p)) return mem; | |
2826 | -#endif | |
2827 | - | |
2828 | - csz = chunksize(p); | |
2829 | - | |
2830 | -#if MORECORE_CLEARS | |
2831 | - if (p == oldtop && csz > oldtopsize) | |
2832 | - { | |
2833 | - /* clear only the bytes from non-freshly-sbrked memory */ | |
2834 | - csz = oldtopsize; | |
2835 | - } | |
2836 | -#endif | |
2837 | - | |
2838 | - MALLOC_ZERO(mem, csz - SIZE_SZ); | |
2839 | - return mem; | |
2840 | - } | |
2841 | -} | |
2842 | - | |
2843 | -/* | |
2844 | - | |
2845 | - cfree just calls free. It is needed/defined on some systems | |
2846 | - that pair it with calloc, presumably for odd historical reasons. | |
2847 | - | |
2848 | -*/ | |
2849 | - | |
2850 | -#if !defined(INTERNAL_LINUX_C_LIB) || !defined(__ELF__) | |
2851 | -#if __STD_C | |
2852 | -void cfree(Void_t *mem) | |
2853 | -#else | |
2854 | -void cfree(mem) Void_t *mem; | |
2855 | -#endif | |
2856 | -{ | |
2857 | - free(mem); | |
2858 | -} | |
2859 | -#endif | |
2860 | - | |
2861 | - | |
2862 | - | |
2863 | -/* | |
2864 | - | |
2865 | - Malloc_trim gives memory back to the system (via negative | |
2866 | - arguments to sbrk) if there is unused memory at the `high' end of | |
2867 | - the malloc pool. You can call this after freeing large blocks of | |
2868 | - memory to potentially reduce the system-level memory requirements | |
2869 | - of a program. However, it cannot guarantee to reduce memory. Under | |
2870 | - some allocation patterns, some large free blocks of memory will be | |
2871 | - locked between two used chunks, so they cannot be given back to | |
2872 | - the system. | |
2873 | - | |
2874 | - The `pad' argument to malloc_trim represents the amount of free | |
2875 | - trailing space to leave untrimmed. If this argument is zero, | |
2876 | - only the minimum amount of memory to maintain internal data | |
2877 | - structures will be left (one page or less). Non-zero arguments | |
2878 | - can be supplied to maintain enough trailing space to service | |
2879 | - future expected allocations without having to re-obtain memory | |
2880 | - from the system. | |
2881 | - | |
2882 | - Malloc_trim returns 1 if it actually released any memory, else 0. | |
2883 | - | |
2884 | -*/ | |
2885 | - | |
2886 | -#if __STD_C | |
2887 | -int malloc_trim(size_t pad) | |
2888 | -#else | |
2889 | -int malloc_trim(pad) size_t pad; | |
2890 | -#endif | |
2891 | -{ | |
2892 | - long top_size; /* Amount of top-most memory */ | |
2893 | - long extra; /* Amount to release */ | |
2894 | - char* current_brk; /* address returned by pre-check sbrk call */ | |
2895 | - char* new_brk; /* address returned by negative sbrk call */ | |
2896 | - | |
2897 | - unsigned long pagesz = malloc_getpagesize; | |
2898 | - | |
2899 | - top_size = chunksize(top); | |
2900 | - extra = ((top_size - pad - MINSIZE + (pagesz-1)) / pagesz - 1) * pagesz; | |
2901 | - | |
2902 | - if (extra < (long)pagesz) /* Not enough memory to release */ | |
2903 | - return 0; | |
2904 | - | |
2905 | - else | |
2906 | - { | |
2907 | - /* Test to make sure no one else called sbrk */ | |
2908 | - current_brk = (char*)(MORECORE (0)); | |
2909 | - if (current_brk != (char*)(top) + top_size) | |
2910 | - return 0; /* Apparently we don't own memory; must fail */ | |
2911 | - | |
2912 | - else | |
2913 | - { | |
2914 | - new_brk = (char*)(MORECORE (-extra)); | |
2915 | - | |
2916 | - if (new_brk == (char*)(MORECORE_FAILURE)) /* sbrk failed? */ | |
2917 | - { | |
2918 | - /* Try to figure out what we have */ | |
2919 | - current_brk = (char*)(MORECORE (0)); | |
2920 | - top_size = current_brk - (char*)top; | |
2921 | - if (top_size >= (long)MINSIZE) /* if not, we are very very dead! */ | |
2922 | - { | |
2923 | - sbrked_mem = current_brk - sbrk_base; | |
2924 | - set_head(top, top_size | PREV_INUSE); | |
2925 | - } | |
2926 | - check_chunk(top); | |
2927 | - return 0; | |
2928 | - } | |
2929 | - | |
2930 | - else | |
2931 | - { | |
2932 | - /* Success. Adjust top accordingly. */ | |
2933 | - set_head(top, (top_size - extra) | PREV_INUSE); | |
2934 | - sbrked_mem -= extra; | |
2935 | - check_chunk(top); | |
2936 | - return 1; | |
2937 | - } | |
2938 | - } | |
2939 | - } | |
2940 | -} | |
2941 | - | |
2942 | - | |
2943 | - | |
2944 | -/* | |
2945 | - malloc_usable_size: | |
2946 | - | |
2947 | - This routine tells you how many bytes you can actually use in an | |
2948 | - allocated chunk, which may be more than you requested (although | |
2949 | - often not). You can use this many bytes without worrying about | |
2950 | - overwriting other allocated objects. Not a particularly great | |
2951 | - programming practice, but still sometimes useful. | |
2952 | - | |
2953 | -*/ | |
2954 | - | |
2955 | -#if __STD_C | |
2956 | -size_t malloc_usable_size(Void_t* mem) | |
2957 | -#else | |
2958 | -size_t malloc_usable_size(mem) Void_t* mem; | |
2959 | -#endif | |
2960 | -{ | |
2961 | - mchunkptr p; | |
2962 | - if (mem == 0) | |
2963 | - return 0; | |
2964 | - else | |
2965 | - { | |
2966 | - p = mem2chunk(mem); | |
2967 | - if(!chunk_is_mmapped(p)) | |
2968 | - { | |
2969 | - if (!inuse(p)) return 0; | |
2970 | - check_inuse_chunk(p); | |
2971 | - return chunksize(p) - SIZE_SZ; | |
2972 | - } | |
2973 | - return chunksize(p) - 2*SIZE_SZ; | |
2974 | - } | |
2975 | -} | |
2976 | - | |
2977 | - | |
2978 | - | |
2979 | - | |
2980 | -/* Utility to update current_mallinfo for malloc_stats and mallinfo() */ | |
2981 | - | |
2982 | -static void malloc_update_mallinfo() | |
2983 | -{ | |
2984 | - int i; | |
2985 | - mbinptr b; | |
2986 | - mchunkptr p; | |
2987 | -#if DEBUG | |
2988 | - mchunkptr q; | |
2989 | -#endif | |
2990 | - | |
2991 | - INTERNAL_SIZE_T avail = chunksize(top); | |
2992 | - int navail = ((long)(avail) >= (long)MINSIZE)? 1 : 0; | |
2993 | - | |
2994 | - for (i = 1; i < NAV; ++i) | |
2995 | - { | |
2996 | - b = bin_at(i); | |
2997 | - for (p = last(b); p != b; p = p->bk) | |
2998 | - { | |
2999 | -#if DEBUG | |
3000 | - check_free_chunk(p); | |
3001 | - for (q = next_chunk(p); | |
3002 | - q < top && inuse(q) && (long)(chunksize(q)) >= (long)MINSIZE; | |
3003 | - q = next_chunk(q)) | |
3004 | - check_inuse_chunk(q); | |
3005 | -#endif | |
3006 | - avail += chunksize(p); | |
3007 | - navail++; | |
3008 | - } | |
3009 | - } | |
3010 | - | |
3011 | - current_mallinfo.ordblks = navail; | |
3012 | - current_mallinfo.uordblks = sbrked_mem - avail; | |
3013 | - current_mallinfo.fordblks = avail; | |
3014 | - current_mallinfo.hblks = n_mmaps; | |
3015 | - current_mallinfo.hblkhd = mmapped_mem; | |
3016 | - current_mallinfo.keepcost = chunksize(top); | |
3017 | - | |
3018 | -} | |
3019 | - | |
3020 | - | |
3021 | - | |
3022 | -/* | |
3023 | - | |
3024 | - malloc_stats: | |
3025 | - | |
3026 | - Prints on stderr the amount of space obtain from the system (both | |
3027 | - via sbrk and mmap), the maximum amount (which may be more than | |
3028 | - current if malloc_trim and/or munmap got called), the maximum | |
3029 | - number of simultaneous mmap regions used, and the current number | |
3030 | - of bytes allocated via malloc (or realloc, etc) but not yet | |
3031 | - freed. (Note that this is the number of bytes allocated, not the | |
3032 | - number requested. It will be larger than the number requested | |
3033 | - because of alignment and bookkeeping overhead.) | |
3034 | - | |
3035 | -*/ | |
3036 | - | |
3037 | -void malloc_stats() | |
3038 | -{ | |
3039 | - malloc_update_mallinfo(); | |
3040 | - fprintf(stderr, "max system bytes = %10u\n", | |
3041 | - (unsigned int)(max_total_mem)); | |
3042 | - fprintf(stderr, "system bytes = %10u\n", | |
3043 | - (unsigned int)(sbrked_mem + mmapped_mem)); | |
3044 | - fprintf(stderr, "in use bytes = %10u\n", | |
3045 | - (unsigned int)(current_mallinfo.uordblks + mmapped_mem)); | |
3046 | -#if HAVE_MMAP | |
3047 | - fprintf(stderr, "max mmap regions = %10u\n", | |
3048 | - (unsigned int)max_n_mmaps); | |
3049 | -#endif | |
3050 | -} | |
3051 | - | |
3052 | -/* | |
3053 | - mallinfo returns a copy of updated current mallinfo. | |
3054 | -*/ | |
3055 | - | |
3056 | -struct mallinfo mALLINFo() | |
3057 | -{ | |
3058 | - malloc_update_mallinfo(); | |
3059 | - return current_mallinfo; | |
3060 | -} | |
3061 | - | |
3062 | - | |
3063 | - | |
3064 | - | |
3065 | -/* | |
3066 | - mallopt: | |
3067 | - | |
3068 | - mallopt is the general SVID/XPG interface to tunable parameters. | |
3069 | - The format is to provide a (parameter-number, parameter-value) pair. | |
3070 | - mallopt then sets the corresponding parameter to the argument | |
3071 | - value if it can (i.e., so long as the value is meaningful), | |
3072 | - and returns 1 if successful else 0. | |
3073 | - | |
3074 | - See descriptions of tunable parameters above. | |
3075 | - | |
3076 | -*/ | |
3077 | - | |
3078 | -#if __STD_C | |
3079 | -int mALLOPt(int param_number, int value) | |
3080 | -#else | |
3081 | -int mALLOPt(param_number, value) int param_number; int value; | |
3082 | -#endif | |
3083 | -{ | |
3084 | - switch(param_number) | |
3085 | - { | |
3086 | - case M_TRIM_THRESHOLD: | |
3087 | - trim_threshold = value; return 1; | |
3088 | - case M_TOP_PAD: | |
3089 | - top_pad = value; return 1; | |
3090 | - case M_MMAP_THRESHOLD: | |
3091 | - mmap_threshold = value; return 1; | |
3092 | - case M_MMAP_MAX: | |
3093 | -#if HAVE_MMAP | |
3094 | - n_mmaps_max = value; return 1; | |
3095 | -#else | |
3096 | - if (value != 0) return 0; else n_mmaps_max = value; return 1; | |
3097 | -#endif | |
3098 | - | |
3099 | - default: | |
3100 | - return 0; | |
3101 | - } | |
3102 | -} | |
3103 | - | |
3104 | -/* | |
3105 | - | |
3106 | -History: | |
3107 | - | |
3108 | - V2.6.5 Wed Jun 17 15:57:31 1998 Doug Lea (dl at gee) | |
3109 | - * Fixed ordering problem with boundary-stamping | |
3110 | - | |
3111 | - V2.6.3 Sun May 19 08:17:58 1996 Doug Lea (dl at gee) | |
3112 | - * Added pvalloc, as recommended by H.J. Liu | |
3113 | - * Added 64bit pointer support mainly from Wolfram Gloger | |
3114 | - * Added anonymously donated WIN32 sbrk emulation | |
3115 | - * Malloc, calloc, getpagesize: add optimizations from Raymond Nijssen | |
3116 | - * malloc_extend_top: fix mask error that caused wastage after | |
3117 | - foreign sbrks | |
3118 | - * Add linux mremap support code from HJ Liu | |
3119 | - | |
3120 | - V2.6.2 Tue Dec 5 06:52:55 1995 Doug Lea (dl at gee) | |
3121 | - * Integrated most documentation with the code. | |
3122 | - * Add support for mmap, with help from | |
3123 | - Wolfram Gloger (Gloger@lrz.uni-muenchen.de). | |
3124 | - * Use last_remainder in more cases. | |
3125 | - * Pack bins using idea from colin@nyx10.cs.du.edu | |
3126 | - * Use ordered bins instead of best-fit threshhold | |
3127 | - * Eliminate block-local decls to simplify tracing and debugging. | |
3128 | - * Support another case of realloc via move into top | |
3129 | - * Fix error occuring when initial sbrk_base not word-aligned. | |
3130 | - * Rely on page size for units instead of SBRK_UNIT to | |
3131 | - avoid surprises about sbrk alignment conventions. | |
3132 | - * Add mallinfo, mallopt. Thanks to Raymond Nijssen | |
3133 | - (raymond@es.ele.tue.nl) for the suggestion. | |
3134 | - * Add `pad' argument to malloc_trim and top_pad mallopt parameter. | |
3135 | - * More precautions for cases where other routines call sbrk, | |
3136 | - courtesy of Wolfram Gloger (Gloger@lrz.uni-muenchen.de). | |
3137 | - * Added macros etc., allowing use in linux libc from | |
3138 | - H.J. Lu (hjl@gnu.ai.mit.edu) | |
3139 | - * Inverted this history list | |
3140 | - | |
3141 | - V2.6.1 Sat Dec 2 14:10:57 1995 Doug Lea (dl at gee) | |
3142 | - * Re-tuned and fixed to behave more nicely with V2.6.0 changes. | |
3143 | - * Removed all preallocation code since under current scheme | |
3144 | - the work required to undo bad preallocations exceeds | |
3145 | - the work saved in good cases for most test programs. | |
3146 | - * No longer use return list or unconsolidated bins since | |
3147 | - no scheme using them consistently outperforms those that don't | |
3148 | - given above changes. | |
3149 | - * Use best fit for very large chunks to prevent some worst-cases. | |
3150 | - * Added some support for debugging | |
3151 | - | |
3152 | - V2.6.0 Sat Nov 4 07:05:23 1995 Doug Lea (dl at gee) | |
3153 | - * Removed footers when chunks are in use. Thanks to | |
3154 | - Paul Wilson (wilson@cs.texas.edu) for the suggestion. | |
3155 | - | |
3156 | - V2.5.4 Wed Nov 1 07:54:51 1995 Doug Lea (dl at gee) | |
3157 | - * Added malloc_trim, with help from Wolfram Gloger | |
3158 | - (wmglo@Dent.MED.Uni-Muenchen.DE). | |
3159 | - | |
3160 | - V2.5.3 Tue Apr 26 10:16:01 1994 Doug Lea (dl at g) | |
3161 | - | |
3162 | - V2.5.2 Tue Apr 5 16:20:40 1994 Doug Lea (dl at g) | |
3163 | - * realloc: try to expand in both directions | |
3164 | - * malloc: swap order of clean-bin strategy; | |
3165 | - * realloc: only conditionally expand backwards | |
3166 | - * Try not to scavenge used bins | |
3167 | - * Use bin counts as a guide to preallocation | |
3168 | - * Occasionally bin return list chunks in first scan | |
3169 | - * Add a few optimizations from colin@nyx10.cs.du.edu | |
3170 | - | |
3171 | - V2.5.1 Sat Aug 14 15:40:43 1993 Doug Lea (dl at g) | |
3172 | - * faster bin computation & slightly different binning | |
3173 | - * merged all consolidations to one part of malloc proper | |
3174 | - (eliminating old malloc_find_space & malloc_clean_bin) | |
3175 | - * Scan 2 returns chunks (not just 1) | |
3176 | - * Propagate failure in realloc if malloc returns 0 | |
3177 | - * Add stuff to allow compilation on non-ANSI compilers | |
3178 | - from kpv@research.att.com | |
3179 | - | |
3180 | - V2.5 Sat Aug 7 07:41:59 1993 Doug Lea (dl at g.oswego.edu) | |
3181 | - * removed potential for odd address access in prev_chunk | |
3182 | - * removed dependency on getpagesize.h | |
3183 | - * misc cosmetics and a bit more internal documentation | |
3184 | - * anticosmetics: mangled names in macros to evade debugger strangeness | |
3185 | - * tested on sparc, hp-700, dec-mips, rs6000 | |
3186 | - with gcc & native cc (hp, dec only) allowing | |
3187 | - Detlefs & Zorn comparison study (in SIGPLAN Notices.) | |
3188 | - | |
3189 | - Trial version Fri Aug 28 13:14:29 1992 Doug Lea (dl at g.oswego.edu) | |
3190 | - * Based loosely on libg++-1.2X malloc. (It retains some of the overall | |
3191 | - structure of old version, but most details differ.) | |
3192 | - | |
3193 | -*/ | |
3194 | - | |
3195 | - |
@@ -1,5 +0,0 @@ | ||
1 | -testsimple | |
2 | -testUPoll | |
3 | -testsig | |
4 | -testtimer | |
5 | -testupoll |