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);
224 static gboolean vtable_set = FALSE;
227 * g_mem_is_system_malloc
229 * Checks whether the allocator used by g_malloc() is the system's
230 * malloc implementation. If it returns %TRUE memory allocated with
231 * <function>malloc()</function> can be used interchangeable with
232 * memory allocated using g_malloc(). This function is useful for
233 * avoiding an extra copy of allocated memory returned by a
234 * non-GLib-based API.
236 * A different allocator can be set using g_mem_set_vtable().
238 * Return value: if %TRUE, <function>malloc()</function> and g_malloc() can be mixed.
241 g_mem_is_system_malloc (void)
247 g_mem_set_vtable (GMemVTable *vtable)
252 if (vtable->malloc && vtable->realloc && vtable->free)
254 glib_mem_vtable.malloc = vtable->malloc;
255 glib_mem_vtable.realloc = vtable->realloc;
256 glib_mem_vtable.free = vtable->free;
257 glib_mem_vtable.calloc = vtable->calloc ? vtable->calloc : fallback_calloc;
258 glib_mem_vtable.try_malloc = vtable->try_malloc ? vtable->try_malloc : glib_mem_vtable.malloc;
259 glib_mem_vtable.try_realloc = vtable->try_realloc ? vtable->try_realloc : glib_mem_vtable.realloc;
262 g_warning (G_STRLOC ": memory allocation vtable lacks one of malloc(), realloc() or free()");
265 g_warning (G_STRLOC ": memory allocation vtable can only be set once at startup");
269 /* --- memory profiling and checking --- */
270 #ifdef G_DISABLE_CHECKS
271 GMemVTable *glib_mem_profiler_table = &glib_mem_vtable;
276 #else /* !G_DISABLE_CHECKS */
283 static guint *profile_data = NULL;
284 static gulong profile_allocs = 0;
285 static gulong profile_mc_allocs = 0;
286 static gulong profile_zinit = 0;
287 static gulong profile_frees = 0;
288 static gulong profile_mc_frees = 0;
289 static GMutex *g_profile_mutex = NULL;
290 #ifdef G_ENABLE_DEBUG
291 static volatile gulong g_trap_free_size = 0;
292 static volatile gulong g_trap_realloc_size = 0;
293 static volatile gulong g_trap_malloc_size = 0;
294 #endif /* G_ENABLE_DEBUG */
296 #define PROFILE_TABLE(f1,f2,f3) ( ( ((f3) << 2) | ((f2) << 1) | (f1) ) * (MEM_PROFILE_TABLE_SIZE + 1))
299 profiler_log (ProfilerJob job,
303 g_mutex_lock (g_profile_mutex);
306 profile_data = standard_malloc ((MEM_PROFILE_TABLE_SIZE + 1) * 8 * sizeof (profile_data[0]));
307 if (!profile_data) /* memory system kiddin' me, eh? */
309 g_mutex_unlock (g_profile_mutex);
314 if (MEM_CHUNK_ROUTINE_COUNT () == 0)
316 if (n_bytes < MEM_PROFILE_TABLE_SIZE)
317 profile_data[n_bytes + PROFILE_TABLE ((job & PROFILER_ALLOC) != 0,
318 (job & PROFILER_RELOC) != 0,
321 profile_data[MEM_PROFILE_TABLE_SIZE + PROFILE_TABLE ((job & PROFILER_ALLOC) != 0,
322 (job & PROFILER_RELOC) != 0,
326 if (job & PROFILER_ALLOC)
328 profile_allocs += n_bytes;
329 if (job & PROFILER_ZINIT)
330 profile_zinit += n_bytes;
333 profile_frees += n_bytes;
338 if (job & PROFILER_ALLOC)
339 profile_mc_allocs += n_bytes;
341 profile_mc_frees += n_bytes;
343 g_mutex_unlock (g_profile_mutex);
347 profile_print_locked (guint *local_data,
350 gboolean need_header = TRUE;
353 for (i = 0; i <= MEM_PROFILE_TABLE_SIZE; i++)
355 glong t_malloc = local_data[i + PROFILE_TABLE (1, 0, success)];
356 glong t_realloc = local_data[i + PROFILE_TABLE (1, 1, success)];
357 glong t_free = local_data[i + PROFILE_TABLE (0, 0, success)];
358 glong t_refree = local_data[i + PROFILE_TABLE (0, 1, success)];
360 if (!t_malloc && !t_realloc && !t_free && !t_refree)
362 else if (need_header)
365 g_print (" blocks of | allocated | freed | allocated | freed | n_bytes \n");
366 g_print (" n_bytes | n_times by | n_times by | n_times by | n_times by | remaining \n");
367 g_print (" | malloc() | free() | realloc() | realloc() | \n");
368 g_print ("===========|============|============|============|============|===========\n");
370 if (i < MEM_PROFILE_TABLE_SIZE)
371 g_print ("%10u | %10ld | %10ld | %10ld | %10ld |%+11ld\n",
372 i, t_malloc, t_free, t_realloc, t_refree,
373 (t_malloc - t_free + t_realloc - t_refree) * i);
374 else if (i >= MEM_PROFILE_TABLE_SIZE)
375 g_print (" >%6u | %10ld | %10ld | %10ld | %10ld | ***\n",
376 i, t_malloc, t_free, t_realloc, t_refree);
379 g_print (" --- none ---\n");
385 guint local_data[(MEM_PROFILE_TABLE_SIZE + 1) * 8 * sizeof (profile_data[0])];
389 gulong local_mc_allocs;
390 gulong local_mc_frees;
392 g_mutex_lock (g_profile_mutex);
394 local_allocs = profile_allocs;
395 local_zinit = profile_zinit;
396 local_frees = profile_frees;
397 local_mc_allocs = profile_mc_allocs;
398 local_mc_frees = profile_mc_frees;
402 g_mutex_unlock (g_profile_mutex);
406 memcpy (local_data, profile_data,
407 (MEM_PROFILE_TABLE_SIZE + 1) * 8 * sizeof (profile_data[0]));
409 g_mutex_unlock (g_profile_mutex);
411 g_print ("GLib Memory statistics (successful operations):\n");
412 profile_print_locked (local_data, TRUE);
413 g_print ("GLib Memory statistics (failing operations):\n");
414 profile_print_locked (local_data, FALSE);
415 g_print ("Total bytes: allocated=%lu, zero-initialized=%lu (%.2f%%), freed=%lu (%.2f%%), remaining=%lu\n",
418 ((gdouble) local_zinit) / local_allocs * 100.0,
420 ((gdouble) local_frees) / local_allocs * 100.0,
421 local_allocs - local_frees);
422 g_print ("MemChunk bytes: allocated=%lu, freed=%lu (%.2f%%), remaining=%lu\n",
425 ((gdouble) local_mc_frees) / local_mc_allocs * 100.0,
426 local_mc_allocs - local_mc_frees);
430 profiler_try_malloc (gsize n_bytes)
434 #ifdef G_ENABLE_DEBUG
435 if (g_trap_malloc_size == n_bytes)
437 #endif /* G_ENABLE_DEBUG */
439 p = standard_malloc (sizeof (gulong) * 2 + n_bytes);
443 p[0] = 0; /* free count */
444 p[1] = n_bytes; /* length */
445 profiler_log (PROFILER_ALLOC, n_bytes, TRUE);
449 profiler_log (PROFILER_ALLOC, n_bytes, FALSE);
455 profiler_malloc (gsize n_bytes)
457 gpointer mem = profiler_try_malloc (n_bytes);
466 profiler_calloc (gsize n_blocks,
469 gsize l = n_blocks * n_block_bytes;
472 #ifdef G_ENABLE_DEBUG
473 if (g_trap_malloc_size == l)
475 #endif /* G_ENABLE_DEBUG */
477 p = standard_calloc (1, sizeof (gulong) * 2 + l);
481 p[0] = 0; /* free count */
482 p[1] = l; /* length */
483 profiler_log (PROFILER_ALLOC | PROFILER_ZINIT, l, TRUE);
488 profiler_log (PROFILER_ALLOC | PROFILER_ZINIT, l, FALSE);
496 profiler_free (gpointer mem)
501 if (p[0]) /* free count */
503 g_warning ("free(%p): memory has been freed %lu times already", p + 2, p[0]);
504 profiler_log (PROFILER_FREE,
510 #ifdef G_ENABLE_DEBUG
511 if (g_trap_free_size == p[1])
513 #endif /* G_ENABLE_DEBUG */
515 profiler_log (PROFILER_FREE,
518 memset (p + 2, 0xaa, p[1]);
520 /* for all those that miss standard_free (p); in this place, yes,
521 * we do leak all memory when profiling, and that is intentional
522 * to catch double frees. patch submissions are futile.
529 profiler_try_realloc (gpointer mem,
536 #ifdef G_ENABLE_DEBUG
537 if (g_trap_realloc_size == n_bytes)
539 #endif /* G_ENABLE_DEBUG */
541 if (mem && p[0]) /* free count */
543 g_warning ("realloc(%p, %u): memory has been freed %lu times already", p + 2, n_bytes, p[0]);
544 profiler_log (PROFILER_ALLOC | PROFILER_RELOC, n_bytes, FALSE);
550 p = standard_realloc (mem ? p : NULL, sizeof (gulong) * 2 + n_bytes);
555 profiler_log (PROFILER_FREE | PROFILER_RELOC, p[1], TRUE);
558 profiler_log (PROFILER_ALLOC | PROFILER_RELOC, p[1], TRUE);
562 profiler_log (PROFILER_ALLOC | PROFILER_RELOC, n_bytes, FALSE);
569 profiler_realloc (gpointer mem,
572 mem = profiler_try_realloc (mem, n_bytes);
580 static GMemVTable profiler_table = {
586 profiler_try_realloc,
588 GMemVTable *glib_mem_profiler_table = &profiler_table;
590 #endif /* !G_DISABLE_CHECKS */
593 /* --- MemChunks --- */
594 typedef struct _GFreeAtom GFreeAtom;
595 typedef struct _GMemArea GMemArea;
604 GMemArea *next; /* the next mem area */
605 GMemArea *prev; /* the previous mem area */
606 gulong index; /* the current index into the "mem" array */
607 gulong free; /* the number of free bytes in this mem area */
608 gulong allocated; /* the number of atoms allocated from this area */
609 gulong mark; /* is this mem area marked for deletion */
610 gchar mem[MEM_AREA_SIZE]; /* the mem array from which atoms get allocated
611 * the actual size of this array is determined by
612 * the mem chunk "area_size". ANSI says that it
613 * must be declared to be the maximum size it
614 * can possibly be (even though the actual size
621 const gchar *name; /* name of this MemChunk...used for debugging output */
622 gint type; /* the type of MemChunk: ALLOC_ONLY or ALLOC_AND_FREE */
623 gint num_mem_areas; /* the number of memory areas */
624 gint num_marked_areas; /* the number of areas marked for deletion */
625 guint atom_size; /* the size of an atom */
626 gulong area_size; /* the size of a memory area */
627 GMemArea *mem_area; /* the current memory area */
628 GMemArea *mem_areas; /* a list of all the mem areas owned by this chunk */
629 GMemArea *free_mem_area; /* the free area...which is about to be destroyed */
630 GFreeAtom *free_atoms; /* the free atoms list */
631 GTree *mem_tree; /* tree of mem areas sorted by memory address */
632 GMemChunk *next; /* pointer to the next chunk */
633 GMemChunk *prev; /* pointer to the previous chunk */
637 #ifndef DISABLE_MEM_POOLS
638 static gulong g_mem_chunk_compute_size (gulong size,
639 gulong min_size) G_GNUC_CONST;
640 static gint g_mem_chunk_area_compare (GMemArea *a,
642 static gint g_mem_chunk_area_search (GMemArea *a,
645 /* here we can't use StaticMutexes, as they depend upon a working
646 * g_malloc, the same holds true for StaticPrivate
648 static GMutex *mem_chunks_lock = NULL;
649 static GMemChunk *mem_chunks = NULL;
652 g_mem_chunk_new (const gchar *name,
657 GMemChunk *mem_chunk;
660 g_return_val_if_fail (atom_size > 0, NULL);
661 g_return_val_if_fail (area_size >= atom_size, NULL);
663 ENTER_MEM_CHUNK_ROUTINE ();
665 area_size = (area_size + atom_size - 1) / atom_size;
666 area_size *= atom_size;
668 mem_chunk = g_new (GMemChunk, 1);
669 mem_chunk->name = name;
670 mem_chunk->type = type;
671 mem_chunk->num_mem_areas = 0;
672 mem_chunk->num_marked_areas = 0;
673 mem_chunk->mem_area = NULL;
674 mem_chunk->free_mem_area = NULL;
675 mem_chunk->free_atoms = NULL;
676 mem_chunk->mem_tree = NULL;
677 mem_chunk->mem_areas = NULL;
678 mem_chunk->atom_size = atom_size;
680 if (mem_chunk->type == G_ALLOC_AND_FREE)
681 mem_chunk->mem_tree = g_tree_new ((GCompareFunc) g_mem_chunk_area_compare);
683 if (mem_chunk->atom_size % G_MEM_ALIGN)
684 mem_chunk->atom_size += G_MEM_ALIGN - (mem_chunk->atom_size % G_MEM_ALIGN);
686 rarea_size = area_size + sizeof (GMemArea) - MEM_AREA_SIZE;
687 rarea_size = g_mem_chunk_compute_size (rarea_size, atom_size + sizeof (GMemArea) - MEM_AREA_SIZE);
688 mem_chunk->area_size = rarea_size - (sizeof (GMemArea) - MEM_AREA_SIZE);
690 g_mutex_lock (mem_chunks_lock);
691 mem_chunk->next = mem_chunks;
692 mem_chunk->prev = NULL;
694 mem_chunks->prev = mem_chunk;
695 mem_chunks = mem_chunk;
696 g_mutex_unlock (mem_chunks_lock);
698 LEAVE_MEM_CHUNK_ROUTINE ();
704 g_mem_chunk_destroy (GMemChunk *mem_chunk)
709 g_return_if_fail (mem_chunk != NULL);
711 ENTER_MEM_CHUNK_ROUTINE ();
713 mem_areas = mem_chunk->mem_areas;
716 temp_area = mem_areas;
717 mem_areas = mem_areas->next;
722 mem_chunk->next->prev = mem_chunk->prev;
724 mem_chunk->prev->next = mem_chunk->next;
726 g_mutex_lock (mem_chunks_lock);
727 if (mem_chunk == mem_chunks)
728 mem_chunks = mem_chunks->next;
729 g_mutex_unlock (mem_chunks_lock);
731 if (mem_chunk->type == G_ALLOC_AND_FREE)
732 g_tree_destroy (mem_chunk->mem_tree);
736 LEAVE_MEM_CHUNK_ROUTINE ();
740 g_mem_chunk_alloc (GMemChunk *mem_chunk)
745 ENTER_MEM_CHUNK_ROUTINE ();
747 g_return_val_if_fail (mem_chunk != NULL, NULL);
749 while (mem_chunk->free_atoms)
751 /* Get the first piece of memory on the "free_atoms" list.
752 * We can go ahead and destroy the list node we used to keep
753 * track of it with and to update the "free_atoms" list to
754 * point to its next element.
756 mem = mem_chunk->free_atoms;
757 mem_chunk->free_atoms = mem_chunk->free_atoms->next;
759 /* Determine which area this piece of memory is allocated from */
760 temp_area = g_tree_search (mem_chunk->mem_tree,
761 (GCompareFunc) g_mem_chunk_area_search,
764 /* If the area has been marked, then it is being destroyed.
765 * (ie marked to be destroyed).
766 * We check to see if all of the segments on the free list that
767 * reference this area have been removed. This occurs when
768 * the ammount of free memory is less than the allocatable size.
769 * If the chunk should be freed, then we place it in the "free_mem_area".
770 * This is so we make sure not to free the mem area here and then
771 * allocate it again a few lines down.
772 * If we don't allocate a chunk a few lines down then the "free_mem_area"
774 * If there is already a "free_mem_area" then we'll just free this mem area.
778 /* Update the "free" memory available in that area */
779 temp_area->free += mem_chunk->atom_size;
781 if (temp_area->free == mem_chunk->area_size)
783 if (temp_area == mem_chunk->mem_area)
784 mem_chunk->mem_area = NULL;
786 if (mem_chunk->free_mem_area)
788 mem_chunk->num_mem_areas -= 1;
791 temp_area->next->prev = temp_area->prev;
793 temp_area->prev->next = temp_area->next;
794 if (temp_area == mem_chunk->mem_areas)
795 mem_chunk->mem_areas = mem_chunk->mem_areas->next;
797 if (mem_chunk->type == G_ALLOC_AND_FREE)
798 g_tree_remove (mem_chunk->mem_tree, temp_area);
802 mem_chunk->free_mem_area = temp_area;
804 mem_chunk->num_marked_areas -= 1;
809 /* Update the number of allocated atoms count.
811 temp_area->allocated += 1;
813 /* The area wasn't marked...return the memory
819 /* If there isn't a current mem area or the current mem area is out of space
820 * then allocate a new mem area. We'll first check and see if we can use
821 * the "free_mem_area". Otherwise we'll just malloc the mem area.
823 if ((!mem_chunk->mem_area) ||
824 ((mem_chunk->mem_area->index + mem_chunk->atom_size) > mem_chunk->area_size))
826 if (mem_chunk->free_mem_area)
828 mem_chunk->mem_area = mem_chunk->free_mem_area;
829 mem_chunk->free_mem_area = NULL;
833 #ifdef ENABLE_GC_FRIENDLY
834 mem_chunk->mem_area = (GMemArea*) g_malloc0 (sizeof (GMemArea) -
836 mem_chunk->area_size);
837 #else /* !ENABLE_GC_FRIENDLY */
838 mem_chunk->mem_area = (GMemArea*) g_malloc (sizeof (GMemArea) -
840 mem_chunk->area_size);
841 #endif /* ENABLE_GC_FRIENDLY */
843 mem_chunk->num_mem_areas += 1;
844 mem_chunk->mem_area->next = mem_chunk->mem_areas;
845 mem_chunk->mem_area->prev = NULL;
847 if (mem_chunk->mem_areas)
848 mem_chunk->mem_areas->prev = mem_chunk->mem_area;
849 mem_chunk->mem_areas = mem_chunk->mem_area;
851 if (mem_chunk->type == G_ALLOC_AND_FREE)
852 g_tree_insert (mem_chunk->mem_tree, mem_chunk->mem_area, mem_chunk->mem_area);
855 mem_chunk->mem_area->index = 0;
856 mem_chunk->mem_area->free = mem_chunk->area_size;
857 mem_chunk->mem_area->allocated = 0;
858 mem_chunk->mem_area->mark = 0;
861 /* Get the memory and modify the state variables appropriately.
863 mem = (gpointer) &mem_chunk->mem_area->mem[mem_chunk->mem_area->index];
864 mem_chunk->mem_area->index += mem_chunk->atom_size;
865 mem_chunk->mem_area->free -= mem_chunk->atom_size;
866 mem_chunk->mem_area->allocated += 1;
870 LEAVE_MEM_CHUNK_ROUTINE ();
876 g_mem_chunk_alloc0 (GMemChunk *mem_chunk)
880 mem = g_mem_chunk_alloc (mem_chunk);
883 memset (mem, 0, mem_chunk->atom_size);
890 g_mem_chunk_free (GMemChunk *mem_chunk,
894 GFreeAtom *free_atom;
896 g_return_if_fail (mem_chunk != NULL);
897 g_return_if_fail (mem != NULL);
899 ENTER_MEM_CHUNK_ROUTINE ();
901 #ifdef ENABLE_GC_FRIENDLY
902 memset (mem, 0, mem_chunk->atom_size);
903 #endif /* ENABLE_GC_FRIENDLY */
905 /* Don't do anything if this is an ALLOC_ONLY chunk
907 if (mem_chunk->type == G_ALLOC_AND_FREE)
909 /* Place the memory on the "free_atoms" list
911 free_atom = (GFreeAtom*) mem;
912 free_atom->next = mem_chunk->free_atoms;
913 mem_chunk->free_atoms = free_atom;
915 temp_area = g_tree_search (mem_chunk->mem_tree,
916 (GCompareFunc) g_mem_chunk_area_search,
919 temp_area->allocated -= 1;
921 if (temp_area->allocated == 0)
924 mem_chunk->num_marked_areas += 1;
928 LEAVE_MEM_CHUNK_ROUTINE ();
931 /* This doesn't free the free_area if there is one */
933 g_mem_chunk_clean (GMemChunk *mem_chunk)
936 GFreeAtom *prev_free_atom;
937 GFreeAtom *temp_free_atom;
940 g_return_if_fail (mem_chunk != NULL);
942 ENTER_MEM_CHUNK_ROUTINE ();
944 if (mem_chunk->type == G_ALLOC_AND_FREE)
946 prev_free_atom = NULL;
947 temp_free_atom = mem_chunk->free_atoms;
949 while (temp_free_atom)
951 mem = (gpointer) temp_free_atom;
953 mem_area = g_tree_search (mem_chunk->mem_tree,
954 (GCompareFunc) g_mem_chunk_area_search,
957 /* If this mem area is marked for destruction then delete the
958 * area and list node and decrement the free mem.
963 prev_free_atom->next = temp_free_atom->next;
965 mem_chunk->free_atoms = temp_free_atom->next;
966 temp_free_atom = temp_free_atom->next;
968 mem_area->free += mem_chunk->atom_size;
969 if (mem_area->free == mem_chunk->area_size)
971 mem_chunk->num_mem_areas -= 1;
972 mem_chunk->num_marked_areas -= 1;
975 mem_area->next->prev = mem_area->prev;
977 mem_area->prev->next = mem_area->next;
978 if (mem_area == mem_chunk->mem_areas)
979 mem_chunk->mem_areas = mem_chunk->mem_areas->next;
980 if (mem_area == mem_chunk->mem_area)
981 mem_chunk->mem_area = NULL;
983 if (mem_chunk->type == G_ALLOC_AND_FREE)
984 g_tree_remove (mem_chunk->mem_tree, mem_area);
990 prev_free_atom = temp_free_atom;
991 temp_free_atom = temp_free_atom->next;
995 LEAVE_MEM_CHUNK_ROUTINE ();
999 g_mem_chunk_reset (GMemChunk *mem_chunk)
1001 GMemArea *mem_areas;
1002 GMemArea *temp_area;
1004 g_return_if_fail (mem_chunk != NULL);
1006 ENTER_MEM_CHUNK_ROUTINE ();
1008 mem_areas = mem_chunk->mem_areas;
1009 mem_chunk->num_mem_areas = 0;
1010 mem_chunk->mem_areas = NULL;
1011 mem_chunk->mem_area = NULL;
1015 temp_area = mem_areas;
1016 mem_areas = mem_areas->next;
1020 mem_chunk->free_atoms = NULL;
1022 if (mem_chunk->mem_tree)
1023 g_tree_destroy (mem_chunk->mem_tree);
1024 mem_chunk->mem_tree = g_tree_new ((GCompareFunc) g_mem_chunk_area_compare);
1026 LEAVE_MEM_CHUNK_ROUTINE ();
1030 g_mem_chunk_print (GMemChunk *mem_chunk)
1032 GMemArea *mem_areas;
1035 g_return_if_fail (mem_chunk != NULL);
1037 mem_areas = mem_chunk->mem_areas;
1042 mem += mem_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 mem_chunk->name, mem, mem_chunk->num_mem_areas);
1052 g_mem_chunk_info (void)
1054 GMemChunk *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 GMemChunk *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 ();