1 /* GLIB - Library of useful routines for C programming
2 * Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public
6 * License as published by the Free Software Foundation; either
7 * version 2 of the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful,
10 * but 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.
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with this library; if not, write to the
16 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
17 * Boston, MA 02111-1307, USA.
21 * Modified by the GLib Team and others 1997-2000. See the AUTHORS
22 * file for a list of people on the GLib Team. See the ChangeLog
23 * files for a list of changes. These files are distributed with
24 * GLib at ftp://ftp.gtk.org/pub/gtk/.
41 * having DISABLE_MEM_POOLS defined, disables mem_chunks alltogether, their
42 * allocations are performed through ordinary g_malloc/g_free.
43 * having G_DISABLE_CHECKS defined disables use of glib_mem_profiler_table and
45 * REALLOC_0_WORKS is defined if g_realloc (NULL, x) works.
46 * SANE_MALLOC_PROTOS is defined if the systems malloc() and friends functions
47 * match the corresponding GLib prototypes, keep configure.in and gmem.h in sync here.
48 * if ENABLE_GC_FRIENDLY is defined, freed memory should be 0-wiped.
51 #define MEM_PROFILE_TABLE_SIZE 4096
53 #define MEM_AREA_SIZE 4L
55 #ifdef G_DISABLE_CHECKS
56 # define ENTER_MEM_CHUNK_ROUTINE()
57 # define LEAVE_MEM_CHUNK_ROUTINE()
58 # define IN_MEM_CHUNK_ROUTINE() FALSE
59 #else /* !G_DISABLE_CHECKS */
60 static GPrivate* mem_chunk_recursion = NULL;
61 # define MEM_CHUNK_ROUTINE_COUNT() GPOINTER_TO_UINT (g_private_get (mem_chunk_recursion))
62 # define ENTER_MEM_CHUNK_ROUTINE() g_private_set (mem_chunk_recursion, GUINT_TO_POINTER (MEM_CHUNK_ROUTINE_COUNT () + 1))
63 # define LEAVE_MEM_CHUNK_ROUTINE() g_private_set (mem_chunk_recursion, GUINT_TO_POINTER (MEM_CHUNK_ROUTINE_COUNT () - 1))
64 #endif /* !G_DISABLE_CHECKS */
66 #ifndef REALLOC_0_WORKS
68 standard_realloc (gpointer mem,
72 return malloc (n_bytes);
74 return realloc (mem, n_bytes);
76 #endif /* !REALLOC_0_WORKS */
78 #ifdef SANE_MALLOC_PROTOS
79 # define standard_malloc malloc
80 # ifdef REALLOC_0_WORKS
81 # define standard_realloc realloc
82 # endif /* REALLOC_0_WORKS */
83 # define standard_free free
84 # define standard_calloc calloc
85 # define standard_try_malloc malloc
86 # define standard_try_realloc realloc
87 #else /* !SANE_MALLOC_PROTOS */
89 standard_malloc (gsize n_bytes)
91 return malloc (n_bytes);
93 # ifdef REALLOC_0_WORKS
95 standard_realloc (gpointer mem,
98 return realloc (mem, n_bytes);
100 # endif /* REALLOC_0_WORKS */
102 standard_free (gpointer mem)
107 standard_calloc (gsize n_blocks,
110 return calloc (n_blocks, n_bytes);
112 #define standard_try_malloc standard_malloc
113 #define standard_try_realloc standard_realloc
114 #endif /* !SANE_MALLOC_PROTOS */
117 /* --- variables --- */
118 static GMemVTable glib_mem_vtable = {
124 standard_try_realloc,
128 /* --- functions --- */
130 g_malloc (gulong n_bytes)
136 mem = glib_mem_vtable.malloc (n_bytes);
140 g_error ("%s: failed to allocate %lu bytes", G_STRLOC, n_bytes);
147 g_malloc0 (gulong n_bytes)
153 mem = glib_mem_vtable.calloc (1, n_bytes);
157 g_error ("%s: failed to allocate %lu bytes", G_STRLOC, n_bytes);
164 g_realloc (gpointer mem,
169 mem = glib_mem_vtable.realloc (mem, n_bytes);
173 g_error ("%s: failed to allocate %lu bytes", G_STRLOC, n_bytes);
177 glib_mem_vtable.free (mem);
183 g_free (gpointer mem)
186 glib_mem_vtable.free (mem);
190 g_try_malloc (gulong n_bytes)
193 return glib_mem_vtable.try_malloc (n_bytes);
199 g_try_realloc (gpointer mem,
203 return glib_mem_vtable.try_realloc (mem, n_bytes);
206 glib_mem_vtable.free (mem);
212 fallback_calloc (gsize n_blocks,
215 gsize l = n_blocks * n_block_bytes;
216 gpointer mem = glib_mem_vtable.malloc (l);
225 g_mem_set_vtable (GMemVTable *vtable)
227 gboolean vtable_set = FALSE;
232 if (vtable->malloc && vtable->realloc && vtable->free)
234 glib_mem_vtable.malloc = vtable->malloc;
235 glib_mem_vtable.realloc = vtable->realloc;
236 glib_mem_vtable.free = vtable->free;
237 glib_mem_vtable.calloc = vtable->calloc ? vtable->calloc : fallback_calloc;
238 glib_mem_vtable.try_malloc = vtable->try_malloc ? vtable->try_malloc : glib_mem_vtable.malloc;
239 glib_mem_vtable.try_realloc = vtable->try_realloc ? vtable->try_realloc : glib_mem_vtable.realloc;
242 g_warning (G_STRLOC ": memory allocation vtable lacks one of malloc(), realloc() or free()");
245 g_warning (G_STRLOC ": memory allocation vtable can only be set once at startup");
249 /* --- memory profiling and checking --- */
250 #ifdef G_DISABLE_CHECKS
251 GMemVTable *glib_mem_profiler_table = &glib_mem_vtable;
256 #else /* !G_DISABLE_CHECKS */
263 static guint *profile_data = NULL;
264 static gulong profile_allocs = 0;
265 static gulong profile_mc_allocs = 0;
266 static gulong profile_zinit = 0;
267 static gulong profile_frees = 0;
268 static gulong profile_mc_frees = 0;
269 static GMutex *g_profile_mutex = NULL;
270 #ifdef G_ENABLE_DEBUG
271 static volatile gulong g_trap_free_size = 0;
272 static volatile gulong g_trap_realloc_size = 0;
273 static volatile gulong g_trap_malloc_size = 0;
274 #endif /* G_ENABLE_DEBUG */
276 #define PROFILE_TABLE(f1,f2,f3) ( ( ((f3) << 2) | ((f2) << 1) | (f1) ) * (MEM_PROFILE_TABLE_SIZE + 1))
279 profiler_log (ProfilerJob job,
283 g_mutex_lock (g_profile_mutex);
286 profile_data = standard_malloc ((MEM_PROFILE_TABLE_SIZE + 1) * 8 * sizeof (profile_data[0]));
287 if (!profile_data) /* memory system kiddin' me, eh? */
289 g_mutex_unlock (g_profile_mutex);
294 if (MEM_CHUNK_ROUTINE_COUNT () == 0)
296 if (n_bytes < MEM_PROFILE_TABLE_SIZE)
297 profile_data[n_bytes + PROFILE_TABLE ((job & PROFILER_ALLOC) != 0,
298 (job & PROFILER_RELOC) != 0,
301 profile_data[MEM_PROFILE_TABLE_SIZE + PROFILE_TABLE ((job & PROFILER_ALLOC) != 0,
302 (job & PROFILER_RELOC) != 0,
306 if (job & PROFILER_ALLOC)
308 profile_allocs += n_bytes;
309 if (job & PROFILER_ZINIT)
310 profile_zinit += n_bytes;
313 profile_frees += n_bytes;
318 if (job & PROFILER_ALLOC)
319 profile_mc_allocs += n_bytes;
321 profile_mc_frees += n_bytes;
323 g_mutex_unlock (g_profile_mutex);
327 profile_print_locked (guint *local_data,
330 gboolean need_header = TRUE;
333 for (i = 0; i <= MEM_PROFILE_TABLE_SIZE; i++)
335 glong t_malloc = local_data[i + PROFILE_TABLE (1, 0, success)];
336 glong t_realloc = local_data[i + PROFILE_TABLE (1, 1, success)];
337 glong t_free = local_data[i + PROFILE_TABLE (0, 0, success)];
338 glong t_refree = local_data[i + PROFILE_TABLE (0, 1, success)];
340 if (!t_malloc && !t_realloc && !t_free && !t_refree)
342 else if (need_header)
345 g_print (" blocks of | allocated | freed | allocated | freed | n_bytes \n");
346 g_print (" n_bytes | n_times by | n_times by | n_times by | n_times by | remaining \n");
347 g_print (" | malloc() | free() | realloc() | realloc() | \n");
348 g_print ("===========|============|============|============|============|===========\n");
350 if (i < MEM_PROFILE_TABLE_SIZE)
351 g_print ("%10u | %10ld | %10ld | %10ld | %10ld |%+11ld\n",
352 i, t_malloc, t_free, t_realloc, t_refree,
353 (t_malloc - t_free + t_realloc - t_refree) * i);
354 else if (i >= MEM_PROFILE_TABLE_SIZE)
355 g_print (" >%6u | %10ld | %10ld | %10ld | %10ld | ***\n",
356 i, t_malloc, t_free, t_realloc, t_refree);
359 g_print (" --- none ---\n");
365 guint local_data[(MEM_PROFILE_TABLE_SIZE + 1) * 8 * sizeof (profile_data[0])];
369 gulong local_mc_allocs;
370 gulong local_mc_frees;
372 g_mutex_lock (g_profile_mutex);
374 local_allocs = profile_allocs;
375 local_zinit = profile_zinit;
376 local_frees = profile_frees;
377 local_mc_allocs = profile_mc_allocs;
378 local_mc_frees = profile_mc_frees;
382 g_mutex_unlock (g_profile_mutex);
386 memcpy (local_data, profile_data,
387 (MEM_PROFILE_TABLE_SIZE + 1) * 8 * sizeof (profile_data[0]));
389 g_mutex_unlock (g_profile_mutex);
391 g_print ("GLib Memory statistics (successful operations):\n");
392 profile_print_locked (local_data, TRUE);
393 g_print ("GLib Memory statistics (failing operations):\n");
394 profile_print_locked (local_data, FALSE);
395 g_print ("Total bytes: allocated=%lu, zero-initialized=%lu (%.2f%%), freed=%lu (%.2f%%), remaining=%lu\n",
398 ((gdouble) local_zinit) / local_allocs * 100.0,
400 ((gdouble) local_frees) / local_allocs * 100.0,
401 local_allocs - local_frees);
402 g_print ("MemChunk bytes: allocated=%lu, freed=%lu (%.2f%%), remaining=%lu\n",
405 ((gdouble) local_mc_frees) / local_mc_allocs * 100.0,
406 local_mc_allocs - local_mc_frees);
410 profiler_try_malloc (gsize n_bytes)
414 #ifdef G_ENABLE_DEBUG
415 if (g_trap_malloc_size == n_bytes)
417 #endif /* G_ENABLE_DEBUG */
419 p = standard_malloc (sizeof (gulong) * 2 + n_bytes);
423 p[0] = 0; /* free count */
424 p[1] = n_bytes; /* length */
425 profiler_log (PROFILER_ALLOC, n_bytes, TRUE);
429 profiler_log (PROFILER_ALLOC, n_bytes, FALSE);
435 profiler_malloc (gsize n_bytes)
437 gpointer mem = profiler_try_malloc (n_bytes);
446 profiler_calloc (gsize n_blocks,
449 gsize l = n_blocks * n_block_bytes;
452 #ifdef G_ENABLE_DEBUG
453 if (g_trap_malloc_size == l)
455 #endif /* G_ENABLE_DEBUG */
457 p = standard_calloc (1, sizeof (gulong) * 2 + l);
461 p[0] = 0; /* free count */
462 p[1] = l; /* length */
463 profiler_log (PROFILER_ALLOC | PROFILER_ZINIT, l, TRUE);
468 profiler_log (PROFILER_ALLOC | PROFILER_ZINIT, l, FALSE);
476 profiler_free (gpointer mem)
481 if (p[0]) /* free count */
483 g_warning ("free(%p): memory has been freed %lu times already", p + 2, p[0]);
484 profiler_log (PROFILER_FREE,
490 #ifdef G_ENABLE_DEBUG
491 if (g_trap_free_size == p[1])
493 #endif /* G_ENABLE_DEBUG */
495 profiler_log (PROFILER_FREE,
498 memset (p + 2, 0xaa, p[1]);
500 /* for all those that miss standard_free (p); in this place, yes,
501 * we do leak all memory when profiling, and that is intentional
502 * to catch double frees. patch submissions are futile.
509 profiler_try_realloc (gpointer mem,
516 #ifdef G_ENABLE_DEBUG
517 if (g_trap_realloc_size == n_bytes)
519 #endif /* G_ENABLE_DEBUG */
521 if (mem && p[0]) /* free count */
523 g_warning ("realloc(%p, %u): memory has been freed %lu times already", p + 2, n_bytes, p[0]);
524 profiler_log (PROFILER_ALLOC | PROFILER_RELOC, n_bytes, FALSE);
530 p = standard_realloc (mem ? p : NULL, sizeof (gulong) * 2 + n_bytes);
535 profiler_log (PROFILER_FREE | PROFILER_RELOC, p[1], TRUE);
538 profiler_log (PROFILER_ALLOC | PROFILER_RELOC, p[1], TRUE);
542 profiler_log (PROFILER_ALLOC | PROFILER_RELOC, n_bytes, FALSE);
549 profiler_realloc (gpointer mem,
552 mem = profiler_try_realloc (mem, n_bytes);
560 static GMemVTable profiler_table = {
566 profiler_try_realloc,
568 GMemVTable *glib_mem_profiler_table = &profiler_table;
570 #endif /* !G_DISABLE_CHECKS */
573 /* --- MemChunks --- */
574 typedef struct _GFreeAtom GFreeAtom;
575 typedef struct _GMemArea GMemArea;
576 typedef struct _GRealMemChunk GRealMemChunk;
585 GMemArea *next; /* the next mem area */
586 GMemArea *prev; /* the previous mem area */
587 gulong index; /* the current index into the "mem" array */
588 gulong free; /* the number of free bytes in this mem area */
589 gulong allocated; /* the number of atoms allocated from this area */
590 gulong mark; /* is this mem area marked for deletion */
591 gchar mem[MEM_AREA_SIZE]; /* the mem array from which atoms get allocated
592 * the actual size of this array is determined by
593 * the mem chunk "area_size". ANSI says that it
594 * must be declared to be the maximum size it
595 * can possibly be (even though the actual size
600 struct _GRealMemChunk
602 const gchar *name; /* name of this MemChunk...used for debugging output */
603 gint type; /* the type of MemChunk: ALLOC_ONLY or ALLOC_AND_FREE */
604 gint num_mem_areas; /* the number of memory areas */
605 gint num_marked_areas; /* the number of areas marked for deletion */
606 guint atom_size; /* the size of an atom */
607 gulong area_size; /* the size of a memory area */
608 GMemArea *mem_area; /* the current memory area */
609 GMemArea *mem_areas; /* a list of all the mem areas owned by this chunk */
610 GMemArea *free_mem_area; /* the free area...which is about to be destroyed */
611 GFreeAtom *free_atoms; /* the free atoms list */
612 GTree *mem_tree; /* tree of mem areas sorted by memory address */
613 GRealMemChunk *next; /* pointer to the next chunk */
614 GRealMemChunk *prev; /* pointer to the previous chunk */
618 #ifndef DISABLE_MEM_POOLS
619 static gulong g_mem_chunk_compute_size (gulong size,
620 gulong min_size) G_GNUC_CONST;
621 static gint g_mem_chunk_area_compare (GMemArea *a,
623 static gint g_mem_chunk_area_search (GMemArea *a,
626 /* here we can't use StaticMutexes, as they depend upon a working
627 * g_malloc, the same holds true for StaticPrivate
629 static GMutex *mem_chunks_lock = NULL;
630 static GRealMemChunk *mem_chunks = NULL;
633 g_mem_chunk_new (const gchar *name,
638 GRealMemChunk *mem_chunk;
641 g_return_val_if_fail (atom_size > 0, NULL);
642 g_return_val_if_fail (area_size >= atom_size, NULL);
644 ENTER_MEM_CHUNK_ROUTINE ();
646 area_size = (area_size + atom_size - 1) / atom_size;
647 area_size *= atom_size;
649 mem_chunk = g_new (struct _GRealMemChunk, 1);
650 mem_chunk->name = name;
651 mem_chunk->type = type;
652 mem_chunk->num_mem_areas = 0;
653 mem_chunk->num_marked_areas = 0;
654 mem_chunk->mem_area = NULL;
655 mem_chunk->free_mem_area = NULL;
656 mem_chunk->free_atoms = NULL;
657 mem_chunk->mem_tree = NULL;
658 mem_chunk->mem_areas = NULL;
659 mem_chunk->atom_size = atom_size;
661 if (mem_chunk->type == G_ALLOC_AND_FREE)
662 mem_chunk->mem_tree = g_tree_new ((GCompareFunc) g_mem_chunk_area_compare);
664 if (mem_chunk->atom_size % G_MEM_ALIGN)
665 mem_chunk->atom_size += G_MEM_ALIGN - (mem_chunk->atom_size % G_MEM_ALIGN);
667 rarea_size = area_size + sizeof (GMemArea) - MEM_AREA_SIZE;
668 rarea_size = g_mem_chunk_compute_size (rarea_size, atom_size + sizeof (GMemArea) - MEM_AREA_SIZE);
669 mem_chunk->area_size = rarea_size - (sizeof (GMemArea) - MEM_AREA_SIZE);
671 g_mutex_lock (mem_chunks_lock);
672 mem_chunk->next = mem_chunks;
673 mem_chunk->prev = NULL;
675 mem_chunks->prev = mem_chunk;
676 mem_chunks = mem_chunk;
677 g_mutex_unlock (mem_chunks_lock);
679 LEAVE_MEM_CHUNK_ROUTINE ();
681 return ((GMemChunk*) mem_chunk);
685 g_mem_chunk_destroy (GMemChunk *mem_chunk)
687 GRealMemChunk *rmem_chunk;
691 g_return_if_fail (mem_chunk != NULL);
693 ENTER_MEM_CHUNK_ROUTINE ();
695 rmem_chunk = (GRealMemChunk*) mem_chunk;
697 mem_areas = rmem_chunk->mem_areas;
700 temp_area = mem_areas;
701 mem_areas = mem_areas->next;
705 if (rmem_chunk->next)
706 rmem_chunk->next->prev = rmem_chunk->prev;
707 if (rmem_chunk->prev)
708 rmem_chunk->prev->next = rmem_chunk->next;
710 g_mutex_lock (mem_chunks_lock);
711 if (rmem_chunk == mem_chunks)
712 mem_chunks = mem_chunks->next;
713 g_mutex_unlock (mem_chunks_lock);
715 if (rmem_chunk->type == G_ALLOC_AND_FREE)
716 g_tree_destroy (rmem_chunk->mem_tree);
720 LEAVE_MEM_CHUNK_ROUTINE ();
724 g_mem_chunk_alloc (GMemChunk *mem_chunk)
726 GRealMemChunk *rmem_chunk;
730 ENTER_MEM_CHUNK_ROUTINE ();
732 g_return_val_if_fail (mem_chunk != NULL, NULL);
734 rmem_chunk = (GRealMemChunk*) mem_chunk;
736 while (rmem_chunk->free_atoms)
738 /* Get the first piece of memory on the "free_atoms" list.
739 * We can go ahead and destroy the list node we used to keep
740 * track of it with and to update the "free_atoms" list to
741 * point to its next element.
743 mem = rmem_chunk->free_atoms;
744 rmem_chunk->free_atoms = rmem_chunk->free_atoms->next;
746 /* Determine which area this piece of memory is allocated from */
747 temp_area = g_tree_search (rmem_chunk->mem_tree,
748 (GCompareFunc) g_mem_chunk_area_search,
751 /* If the area has been marked, then it is being destroyed.
752 * (ie marked to be destroyed).
753 * We check to see if all of the segments on the free list that
754 * reference this area have been removed. This occurs when
755 * the ammount of free memory is less than the allocatable size.
756 * If the chunk should be freed, then we place it in the "free_mem_area".
757 * This is so we make sure not to free the mem area here and then
758 * allocate it again a few lines down.
759 * If we don't allocate a chunk a few lines down then the "free_mem_area"
761 * If there is already a "free_mem_area" then we'll just free this mem area.
765 /* Update the "free" memory available in that area */
766 temp_area->free += rmem_chunk->atom_size;
768 if (temp_area->free == rmem_chunk->area_size)
770 if (temp_area == rmem_chunk->mem_area)
771 rmem_chunk->mem_area = NULL;
773 if (rmem_chunk->free_mem_area)
775 rmem_chunk->num_mem_areas -= 1;
778 temp_area->next->prev = temp_area->prev;
780 temp_area->prev->next = temp_area->next;
781 if (temp_area == rmem_chunk->mem_areas)
782 rmem_chunk->mem_areas = rmem_chunk->mem_areas->next;
784 if (rmem_chunk->type == G_ALLOC_AND_FREE)
785 g_tree_remove (rmem_chunk->mem_tree, temp_area);
789 rmem_chunk->free_mem_area = temp_area;
791 rmem_chunk->num_marked_areas -= 1;
796 /* Update the number of allocated atoms count.
798 temp_area->allocated += 1;
800 /* The area wasn't marked...return the memory
806 /* If there isn't a current mem area or the current mem area is out of space
807 * then allocate a new mem area. We'll first check and see if we can use
808 * the "free_mem_area". Otherwise we'll just malloc the mem area.
810 if ((!rmem_chunk->mem_area) ||
811 ((rmem_chunk->mem_area->index + rmem_chunk->atom_size) > rmem_chunk->area_size))
813 if (rmem_chunk->free_mem_area)
815 rmem_chunk->mem_area = rmem_chunk->free_mem_area;
816 rmem_chunk->free_mem_area = NULL;
820 #ifdef ENABLE_GC_FRIENDLY
821 rmem_chunk->mem_area = (GMemArea*) g_malloc0 (sizeof (GMemArea) -
823 rmem_chunk->area_size);
824 #else /* !ENABLE_GC_FRIENDLY */
825 rmem_chunk->mem_area = (GMemArea*) g_malloc (sizeof (GMemArea) -
827 rmem_chunk->area_size);
828 #endif /* ENABLE_GC_FRIENDLY */
830 rmem_chunk->num_mem_areas += 1;
831 rmem_chunk->mem_area->next = rmem_chunk->mem_areas;
832 rmem_chunk->mem_area->prev = NULL;
834 if (rmem_chunk->mem_areas)
835 rmem_chunk->mem_areas->prev = rmem_chunk->mem_area;
836 rmem_chunk->mem_areas = rmem_chunk->mem_area;
838 if (rmem_chunk->type == G_ALLOC_AND_FREE)
839 g_tree_insert (rmem_chunk->mem_tree, rmem_chunk->mem_area, rmem_chunk->mem_area);
842 rmem_chunk->mem_area->index = 0;
843 rmem_chunk->mem_area->free = rmem_chunk->area_size;
844 rmem_chunk->mem_area->allocated = 0;
845 rmem_chunk->mem_area->mark = 0;
848 /* Get the memory and modify the state variables appropriately.
850 mem = (gpointer) &rmem_chunk->mem_area->mem[rmem_chunk->mem_area->index];
851 rmem_chunk->mem_area->index += rmem_chunk->atom_size;
852 rmem_chunk->mem_area->free -= rmem_chunk->atom_size;
853 rmem_chunk->mem_area->allocated += 1;
857 LEAVE_MEM_CHUNK_ROUTINE ();
863 g_mem_chunk_alloc0 (GMemChunk *mem_chunk)
867 mem = g_mem_chunk_alloc (mem_chunk);
870 GRealMemChunk *rmem_chunk = (GRealMemChunk*) mem_chunk;
872 memset (mem, 0, rmem_chunk->atom_size);
879 g_mem_chunk_free (GMemChunk *mem_chunk,
882 GRealMemChunk *rmem_chunk;
884 GFreeAtom *free_atom;
886 g_return_if_fail (mem_chunk != NULL);
887 g_return_if_fail (mem != NULL);
889 ENTER_MEM_CHUNK_ROUTINE ();
891 rmem_chunk = (GRealMemChunk*) mem_chunk;
893 #ifdef ENABLE_GC_FRIENDLY
894 memset (mem, 0, rmem_chunk->atom_size);
895 #endif /* ENABLE_GC_FRIENDLY */
897 /* Don't do anything if this is an ALLOC_ONLY chunk
899 if (rmem_chunk->type == G_ALLOC_AND_FREE)
901 /* Place the memory on the "free_atoms" list
903 free_atom = (GFreeAtom*) mem;
904 free_atom->next = rmem_chunk->free_atoms;
905 rmem_chunk->free_atoms = free_atom;
907 temp_area = g_tree_search (rmem_chunk->mem_tree,
908 (GCompareFunc) g_mem_chunk_area_search,
911 temp_area->allocated -= 1;
913 if (temp_area->allocated == 0)
916 rmem_chunk->num_marked_areas += 1;
920 LEAVE_MEM_CHUNK_ROUTINE ();
923 /* This doesn't free the free_area if there is one */
925 g_mem_chunk_clean (GMemChunk *mem_chunk)
927 GRealMemChunk *rmem_chunk;
929 GFreeAtom *prev_free_atom;
930 GFreeAtom *temp_free_atom;
933 g_return_if_fail (mem_chunk != NULL);
935 ENTER_MEM_CHUNK_ROUTINE ();
937 rmem_chunk = (GRealMemChunk*) mem_chunk;
939 if (rmem_chunk->type == G_ALLOC_AND_FREE)
941 prev_free_atom = NULL;
942 temp_free_atom = rmem_chunk->free_atoms;
944 while (temp_free_atom)
946 mem = (gpointer) temp_free_atom;
948 mem_area = g_tree_search (rmem_chunk->mem_tree,
949 (GCompareFunc) g_mem_chunk_area_search,
952 /* If this mem area is marked for destruction then delete the
953 * area and list node and decrement the free mem.
958 prev_free_atom->next = temp_free_atom->next;
960 rmem_chunk->free_atoms = temp_free_atom->next;
961 temp_free_atom = temp_free_atom->next;
963 mem_area->free += rmem_chunk->atom_size;
964 if (mem_area->free == rmem_chunk->area_size)
966 rmem_chunk->num_mem_areas -= 1;
967 rmem_chunk->num_marked_areas -= 1;
970 mem_area->next->prev = mem_area->prev;
972 mem_area->prev->next = mem_area->next;
973 if (mem_area == rmem_chunk->mem_areas)
974 rmem_chunk->mem_areas = rmem_chunk->mem_areas->next;
975 if (mem_area == rmem_chunk->mem_area)
976 rmem_chunk->mem_area = NULL;
978 if (rmem_chunk->type == G_ALLOC_AND_FREE)
979 g_tree_remove (rmem_chunk->mem_tree, mem_area);
985 prev_free_atom = temp_free_atom;
986 temp_free_atom = temp_free_atom->next;
990 LEAVE_MEM_CHUNK_ROUTINE ();
994 g_mem_chunk_reset (GMemChunk *mem_chunk)
996 GRealMemChunk *rmem_chunk;
1000 g_return_if_fail (mem_chunk != NULL);
1002 ENTER_MEM_CHUNK_ROUTINE ();
1004 rmem_chunk = (GRealMemChunk*) mem_chunk;
1006 mem_areas = rmem_chunk->mem_areas;
1007 rmem_chunk->num_mem_areas = 0;
1008 rmem_chunk->mem_areas = NULL;
1009 rmem_chunk->mem_area = NULL;
1013 temp_area = mem_areas;
1014 mem_areas = mem_areas->next;
1018 rmem_chunk->free_atoms = NULL;
1020 if (rmem_chunk->mem_tree)
1021 g_tree_destroy (rmem_chunk->mem_tree);
1022 rmem_chunk->mem_tree = g_tree_new ((GCompareFunc) g_mem_chunk_area_compare);
1024 LEAVE_MEM_CHUNK_ROUTINE ();
1028 g_mem_chunk_print (GMemChunk *mem_chunk)
1030 GRealMemChunk *rmem_chunk;
1031 GMemArea *mem_areas;
1034 g_return_if_fail (mem_chunk != NULL);
1036 rmem_chunk = (GRealMemChunk*) mem_chunk;
1037 mem_areas = rmem_chunk->mem_areas;
1042 mem += rmem_chunk->area_size - mem_areas->free;
1043 mem_areas = mem_areas->next;
1046 g_log (g_log_domain_glib, G_LOG_LEVEL_INFO,
1047 "%s: %ld bytes using %d mem areas",
1048 rmem_chunk->name, mem, rmem_chunk->num_mem_areas);
1052 g_mem_chunk_info (void)
1054 GRealMemChunk *mem_chunk;
1058 g_mutex_lock (mem_chunks_lock);
1059 mem_chunk = mem_chunks;
1063 mem_chunk = mem_chunk->next;
1065 g_mutex_unlock (mem_chunks_lock);
1067 g_log (g_log_domain_glib, G_LOG_LEVEL_INFO, "%d mem chunks", count);
1069 g_mutex_lock (mem_chunks_lock);
1070 mem_chunk = mem_chunks;
1071 g_mutex_unlock (mem_chunks_lock);
1075 g_mem_chunk_print ((GMemChunk*) mem_chunk);
1076 mem_chunk = mem_chunk->next;
1081 g_blow_chunks (void)
1083 GRealMemChunk *mem_chunk;
1085 g_mutex_lock (mem_chunks_lock);
1086 mem_chunk = mem_chunks;
1087 g_mutex_unlock (mem_chunks_lock);
1090 g_mem_chunk_clean ((GMemChunk*) mem_chunk);
1091 mem_chunk = mem_chunk->next;
1096 g_mem_chunk_compute_size (gulong size,
1100 gulong lower, upper;
1103 while (power_of_2 < size)
1106 lower = power_of_2 >> 1;
1109 if (size - lower < upper - size && lower >= min_size)
1116 g_mem_chunk_area_compare (GMemArea *a,
1119 if (a->mem > b->mem)
1121 else if (a->mem < b->mem)
1127 g_mem_chunk_area_search (GMemArea *a,
1132 if (addr < &a->mem[a->index])
1139 #else /* DISABLE_MEM_POOLS */
1142 guint alloc_size; /* the size of an atom */
1146 g_mem_chunk_new (const gchar *name,
1151 GMinimalMemChunk *mem_chunk;
1153 g_return_val_if_fail (atom_size > 0, NULL);
1155 mem_chunk = g_new (GMinimalMemChunk, 1);
1156 mem_chunk->alloc_size = atom_size;
1158 return ((GMemChunk*) mem_chunk);
1162 g_mem_chunk_destroy (GMemChunk *mem_chunk)
1164 g_return_if_fail (mem_chunk != NULL);
1170 g_mem_chunk_alloc (GMemChunk *mem_chunk)
1172 GMinimalMemChunk *minimal = (GMinimalMemChunk *)mem_chunk;
1174 g_return_val_if_fail (mem_chunk != NULL, NULL);
1176 return g_malloc (minimal->alloc_size);
1180 g_mem_chunk_alloc0 (GMemChunk *mem_chunk)
1182 GMinimalMemChunk *minimal = (GMinimalMemChunk *)mem_chunk;
1184 g_return_val_if_fail (mem_chunk != NULL, NULL);
1186 return g_malloc0 (minimal->alloc_size);
1190 g_mem_chunk_free (GMemChunk *mem_chunk,
1193 g_return_if_fail (mem_chunk != NULL);
1198 void g_mem_chunk_clean (GMemChunk *mem_chunk) {}
1199 void g_mem_chunk_reset (GMemChunk *mem_chunk) {}
1200 void g_mem_chunk_print (GMemChunk *mem_chunk) {}
1201 void g_mem_chunk_info (void) {}
1202 void g_blow_chunks (void) {}
1204 #endif /* DISABLE_MEM_POOLS */
1207 /* generic allocators
1209 struct _GAllocator /* from gmem.c */
1212 guint16 n_preallocs;
1213 guint is_unused : 1;
1216 GMemChunk *mem_chunk;
1217 gpointer dummy; /* implementation specific */
1221 g_allocator_new (const gchar *name,
1224 GAllocator *allocator;
1226 g_return_val_if_fail (name != NULL, NULL);
1228 allocator = g_new0 (GAllocator, 1);
1229 allocator->name = g_strdup (name);
1230 allocator->n_preallocs = CLAMP (n_preallocs, 1, 65535);
1231 allocator->is_unused = TRUE;
1232 allocator->type = 0;
1233 allocator->last = NULL;
1234 allocator->mem_chunk = NULL;
1235 allocator->dummy = NULL;
1241 g_allocator_free (GAllocator *allocator)
1243 g_return_if_fail (allocator != NULL);
1244 g_return_if_fail (allocator->is_unused == TRUE);
1246 g_free (allocator->name);
1247 if (allocator->mem_chunk)
1248 g_mem_chunk_destroy (allocator->mem_chunk);
1256 #ifndef DISABLE_MEM_POOLS
1257 mem_chunks_lock = g_mutex_new ();
1259 #ifndef G_DISABLE_CHECKS
1260 mem_chunk_recursion = g_private_new (NULL);
1261 g_profile_mutex = g_mutex_new ();