1 /* malloc.c -- Implementation File (module.c template V1.0)
2 Copyright (C) 1995, 2003 Free Software Foundation, Inc.
3 Contributed by James Craig Burley.
5 This file is part of GNU Fortran.
7 GNU Fortran is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU Fortran is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU Fortran; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA
26 Fast pool-based memory allocation.
36 /* Externals defined here. */
38 struct _malloc_root_ malloc_root_
42 &malloc_root_.malloc_pool_image_,
43 &malloc_root_.malloc_pool_image_,
44 (mallocPool) &malloc_root_.malloc_pool_image_.eldest,
45 (mallocPool) &malloc_root_.malloc_pool_image_.eldest,
46 (mallocArea_) &malloc_root_.malloc_pool_image_.first,
47 (mallocArea_) &malloc_root_.malloc_pool_image_.first,
50 0, 0, 0, 0, 0, 0, 0, { '/' }
57 /* Simple definitions and enumerations. */
60 /* Internal typedefs. */
63 /* Private include files. */
66 /* Internal structure definitions. */
69 /* Static objects accessed by functions in this module. */
71 static void *malloc_reserve_ = NULL; /* For crashes. */
73 static const char *const malloc_types_[] =
74 {"KS", "KSR", "NF", "NFR", "US", "USR"};
77 /* Static functions (internal). */
79 static void malloc_kill_area_ (mallocPool pool, mallocArea_ a);
81 static void malloc_verify_area_ (mallocPool pool, mallocArea_ a);
84 /* Internal macros. */
87 #define malloc_kill_(ptr,s) do {memset((ptr),127,(s));free((ptr));} while(0)
89 #define malloc_kill_(ptr,s) free((ptr))
92 /* malloc_kill_area_ -- Kill storage area and its object
94 malloc_kill_area_(mallocPool pool,mallocArea_ area);
96 Does the actual killing of a storage area. */
99 malloc_kill_area_ (mallocPool pool UNUSED, mallocArea_ a)
102 assert (strcmp (a->name, ((char *) (a->where)) + a->size) == 0);
104 malloc_kill_ (a->where, a->size);
105 a->next->previous = a->previous;
106 a->previous->next = a->next;
108 pool->freed += a->size;
112 offsetof (struct _malloc_area_, name)
113 + strlen (a->name) + 1);
116 /* malloc_verify_area_ -- Verify storage area and its object
118 malloc_verify_area_(mallocPool pool,mallocArea_ area);
120 Does the actual verifying of a storage area. */
124 malloc_verify_area_ (mallocPool pool UNUSED, mallocArea_ a UNUSED)
126 mallocSize s = a->size;
128 assert (strcmp (a->name, ((char *) (a->where)) + s) == 0);
132 /* malloc_init -- Initialize malloc cluster
136 Call malloc_init before you do anything else. */
141 if (malloc_reserve_ != NULL)
143 malloc_reserve_ = xmalloc (20 * 1024); /* In case of crash, free this first. */
146 /* malloc_pool_display -- Display a pool
149 malloc_pool_display(p);
151 Displays information associated with the pool and its subpools. */
154 malloc_pool_display (mallocPool p UNUSED)
160 fprintf (dmpout, "Pool \"%s\": bytes allocated=%lu, freed=%lu, old sizes=%lu, new sizes\
161 =%lu,\n allocations=%lu, frees=%lu, resizes=%lu, uses=%lu\n Subpools:\n",
162 p->name, p->allocated, p->freed, p->old_sizes, p->new_sizes, p->allocations,
163 p->frees, p->resizes, p->uses);
165 for (q = p->eldest; q != (mallocPool) & p->eldest; q = q->next)
166 fprintf (dmpout, " \"%s\"\n", q->name);
168 fprintf (dmpout, " Storage areas:\n");
170 for (a = p->first; a != (mallocArea_) & p->first; a = a->next)
172 fprintf (dmpout, " ");
178 /* malloc_pool_kill -- Destroy a pool
183 Releases all storage associated with the pool and its subpools. */
186 malloc_pool_kill (mallocPool p)
195 malloc_pool_display (p);
198 assert (p->next->previous == p);
199 assert (p->previous->next == p);
201 /* Kill off all the subpools. */
203 while ((q = p->eldest) != (mallocPool) &p->eldest)
205 q->uses = 1; /* Force the kill. */
206 malloc_pool_kill (q);
209 /* Now free all the storage areas. */
211 while ((a = p->first) != (mallocArea_) & p->first)
213 malloc_kill_area_ (p, a);
216 /* Now remove from list of sibling pools. */
218 p->next->previous = p->previous;
219 p->previous->next = p->next;
221 /* Finally, free the pool itself. */
224 offsetof (struct _malloc_pool_, name)
225 + strlen (p->name) + 1);
228 /* malloc_pool_new -- Make a new pool
231 p = malloc_pool_new("My new pool",malloc_pool_image(),1024);
233 Makes a new pool with the given name and default new-chunk allocation. */
236 malloc_pool_new (const char *name, mallocPool parent,
237 unsigned long chunks UNUSED)
242 parent = malloc_pool_image ();
244 p = malloc_new_ (offsetof (struct _malloc_pool_, name)
245 + (MALLOC_DEBUG ? strlen (name) + 1 : 0));
246 p->next = (mallocPool) &(parent->eldest);
247 p->previous = parent->youngest;
248 parent->youngest->next = p;
249 parent->youngest = p;
250 p->eldest = (mallocPool) &(p->eldest);
251 p->youngest = (mallocPool) &(p->eldest);
252 p->first = (mallocArea_) &(p->first);
253 p->last = (mallocArea_) &(p->first);
256 p->allocated = p->freed = p->old_sizes = p->new_sizes = p->allocations
257 = p->frees = p->resizes = 0;
258 strcpy (p->name, name);
263 /* malloc_pool_use -- Use an existing pool
266 p = malloc_pool_new(pool);
268 Increments use count for pool; means a matching malloc_pool_kill must
269 be performed before a subsequent one will actually kill the pool. */
272 malloc_pool_use (mallocPool pool)
278 /* malloc_display_ -- Display info on a mallocArea_
286 malloc_display_ (mallocArea_ a UNUSED)
289 fprintf (dmpout, "At %08lX, size=%" mallocSize_f "u, type=%s, \"%s\"\n",
290 (unsigned long) a->where, a->size, malloc_types_[a->type], a->name);
294 /* malloc_find_inpool_ -- Find mallocArea_ for object in pool
299 a = malloc_find_inpool_(pool,ptr);
301 Search for object in list of mallocArea_s, die if not found. */
304 malloc_find_inpool_ (mallocPool pool, void *ptr)
307 mallocArea_ b = (mallocArea_) &pool->first;
310 for (a = pool->first; a != (mallocArea_) &pool->first; a = a->next)
312 assert (("Infinite loop detected" != NULL) && (a != b));
319 assert ("Couldn't find object in pool!" == NULL);
323 /* malloc_kill_inpool_ -- Kill object
325 malloc_kill_inpool_(NULL,MALLOC_typeUS_,ptr,size_in_bytes);
327 Find the mallocArea_ for the pointer, make sure the type is proper, and
328 kill both of them. */
331 malloc_kill_inpool_ (mallocPool pool, mallocType_ type UNUSED,
332 void *ptr, mallocSize s UNUSED)
337 pool = malloc_pool_image ();
340 assert ((pool == malloc_pool_image ())
341 || malloc_pool_find_ (pool, malloc_pool_image ()));
344 a = malloc_find_inpool_ (pool, ptr);
346 assert (a->type == type);
347 if ((type != MALLOC_typeUS_) && (type != MALLOC_typeUSR_))
348 assert (a->size == s);
350 malloc_kill_area_ (pool, a);
353 /* malloc_new_ -- Allocate new object, die if unable
355 ptr = malloc_new_(size_in_bytes);
357 Call malloc, bomb if it returns NULL. */
360 malloc_new_ (mallocSize s)
365 #if MALLOC_DEBUG && 0
366 assert (s == (mallocSize) ss);/* Else alloc is too big for this
372 memset (ptr, 126, ss); /* Catch some kinds of errors more
378 /* malloc_new_inpool_ -- Allocate new object, die if unable
380 ptr = malloc_new_inpool_(NULL,MALLOC_typeUS_,"object",size_in_bytes);
382 Allocate the structure and allocate a mallocArea_ to describe it, then
383 add it to the list of mallocArea_s for the pool. */
386 malloc_new_inpool_ (mallocPool pool, mallocType_ type, const char *name, mallocSize s)
393 pool = malloc_pool_image ();
396 assert ((pool == malloc_pool_image ())
397 || malloc_pool_find_ (pool, malloc_pool_image ()));
400 ptr = malloc_new_ (s + (i = (MALLOC_DEBUG ? strlen (name) + 1 : 0)));
402 strcpy (((char *) (ptr)) + s, name);
404 a = malloc_new_ (offsetof (struct _malloc_area_, name) + i);
406 { /* A little optimization to speed up killing
407 of non-permanent stuff. */
409 case MALLOC_typeKPR_:
410 a->next = (mallocArea_) &pool->first;
414 a->next = pool->first;
417 a->previous = a->next->previous;
418 a->next->previous = a;
419 a->previous->next = a;
424 strcpy (a->name, name);
425 pool->allocated += s;
431 /* malloc_new_zinpool_ -- Allocate new zeroed object, die if unable
433 ptr = malloc_new_zinpool_(NULL,MALLOC_typeUS_,"object",size_in_bytes,0);
435 Like malloc_new_inpool_, but zeros out all the bytes in the area (assuming
439 malloc_new_zinpool_ (mallocPool pool, mallocType_ type, const char *name, mallocSize s,
444 ptr = malloc_new_inpool_ (pool, type, name, s);
449 /* malloc_pool_find_ -- See if pool is a descendant of another pool
451 if (malloc_pool_find_(target_pool,parent_pool)) ...;
453 Recursive descent on each of the children of the parent pool, after
454 first checking the children themselves. */
457 malloc_pool_find_ (mallocPool pool, mallocPool parent)
461 for (p = parent->eldest; p != (mallocPool) & parent->eldest; p = p->next)
463 if ((p == pool) || malloc_pool_find_ (pool, p))
469 /* malloc_resize_inpool_ -- Resize existing object in pool
471 ptr = malloc_resize_inpool_(NULL,MALLOC_typeUSR_,ptr,new_size,old_size);
473 Find the object's mallocArea_, check it out, then do the resizing. */
476 malloc_resize_inpool_ (mallocPool pool, mallocType_ type UNUSED,
477 void *ptr, mallocSize ns, mallocSize os UNUSED)
482 pool = malloc_pool_image ();
485 assert ((pool == malloc_pool_image ())
486 || malloc_pool_find_ (pool, malloc_pool_image ()));
489 a = malloc_find_inpool_ (pool, ptr);
491 assert (a->type == type);
492 if ((type == MALLOC_typeKSR_) || (type == MALLOC_typeKPR_))
493 assert (a->size == os);
494 assert (strcmp (a->name, ((char *) (ptr)) + os) == 0);
496 ptr = malloc_resize_ (ptr, ns + (MALLOC_DEBUG ? strlen (a->name) + 1: 0));
500 strcpy (((char *) (ptr)) + ns, a->name);
501 pool->old_sizes += os;
502 pool->new_sizes += ns;
508 /* malloc_resize_ -- Reallocate object, die if unable
510 ptr = malloc_resize_(ptr,size_in_bytes);
512 Call realloc, bomb if it returns NULL. */
515 malloc_resize_ (void *ptr, mallocSize s)
519 #if MALLOC_DEBUG && 0
520 assert (s == (mallocSize) ss);/* Too big if failure here. */
523 ptr = xrealloc (ptr, ss);
527 /* malloc_verify_inpool_ -- Verify object
529 Find the mallocArea_ for the pointer, make sure the type is proper, and
530 verify both of them. */
533 malloc_verify_inpool_ (mallocPool pool UNUSED, mallocType_ type UNUSED,
534 void *ptr UNUSED, mallocSize s UNUSED)
540 pool = malloc_pool_image ();
542 assert ((pool == malloc_pool_image ())
543 || malloc_pool_find_ (pool, malloc_pool_image ()));
545 a = malloc_find_inpool_ (pool, ptr);
546 assert (a->type == type);
547 if ((type != MALLOC_typeUS_) && (type != MALLOC_typeUSR_))
548 assert (a->size == s);
549 malloc_verify_area_ (pool, a);