1 /***************************************************************************/
5 /* Memory debugger (body). */
7 /* Copyright 2001-2006, 2009, 2013 by */
8 /* David Turner, Robert Wilhelm, and Werner Lemberg. */
10 /* This file is part of the FreeType project, and may only be used, */
11 /* modified, and distributed under the terms of the FreeType project */
12 /* license, LICENSE.TXT. By continuing to use, modify, or distribute */
13 /* this file you indicate that you have read the license and */
14 /* understand and accept it fully. */
16 /***************************************************************************/
20 #include FT_CONFIG_CONFIG_H
21 #include FT_INTERNAL_DEBUG_H
22 #include FT_INTERNAL_MEMORY_H
28 #ifdef FT_DEBUG_MEMORY
30 #define KEEPALIVE /* `Keep alive' means that freed blocks aren't released
31 * to the heap. This is useful to detect double-frees
32 * or weird heap corruption, but it uses large amounts of
36 #include FT_CONFIG_STANDARD_LIBRARY_H
38 FT_BASE_DEF( const char* ) _ft_debug_file = 0;
39 FT_BASE_DEF( long ) _ft_debug_lineno = 0;
42 FT_DumpMemory( FT_Memory memory );
45 typedef struct FT_MemSourceRec_* FT_MemSource;
46 typedef struct FT_MemNodeRec_* FT_MemNode;
47 typedef struct FT_MemTableRec_* FT_MemTable;
50 #define FT_MEM_VAL( addr ) ((FT_PtrDist)(FT_Pointer)( addr ))
53 * This structure holds statistics for a single allocation/release
54 * site. This is useful to know where memory operations happen the
57 typedef struct FT_MemSourceRec_
59 const char* file_name;
62 FT_Long cur_blocks; /* current number of allocated blocks */
63 FT_Long max_blocks; /* max. number of allocated blocks */
64 FT_Long all_blocks; /* total number of blocks allocated */
66 FT_Long cur_size; /* current cumulative allocated size */
67 FT_Long max_size; /* maximum cumulative allocated size */
68 FT_Long all_size; /* total cumulative allocated size */
70 FT_Long cur_max; /* current maximum allocated size */
79 * We don't need a resizable array for the memory sources, because
80 * their number is pretty limited within FreeType.
82 #define FT_MEM_SOURCE_BUCKETS 128
85 * This structure holds information related to a single allocated
86 * memory block. If KEEPALIVE is defined, blocks that are freed by
87 * FreeType are never released to the system. Instead, their `size'
88 * field is set to -size. This is mainly useful to detect double frees,
89 * at the price of large memory footprint during execution.
91 typedef struct FT_MemNodeRec_
94 FT_Long size; /* < 0 if the block was freed */
99 const char* free_file_name;
100 FT_Long free_line_no;
109 * The global structure, containing compound statistics and all hash
112 typedef struct FT_MemTableRec_
118 FT_ULong alloc_total;
119 FT_ULong alloc_current;
121 FT_ULong alloc_count;
124 FT_ULong alloc_total_max;
127 FT_ULong alloc_count_max;
129 FT_MemSource sources[FT_MEM_SOURCE_BUCKETS];
134 FT_Pointer memory_user;
137 FT_Realloc_Func realloc;
142 #define FT_MEM_SIZE_MIN 7
143 #define FT_MEM_SIZE_MAX 13845163
145 #define FT_FILENAME( x ) ((x) ? (x) : "unknown file")
149 * Prime numbers are ugly to handle. It would be better to implement
150 * L-Hashing, which is 10% faster and doesn't require divisions.
152 static const FT_UInt ft_mem_primes[] =
193 ft_mem_closest_prime( FT_ULong num )
199 i < sizeof ( ft_mem_primes ) / sizeof ( ft_mem_primes[0] ); i++ )
200 if ( ft_mem_primes[i] > num )
201 return ft_mem_primes[i];
203 return FT_MEM_SIZE_MAX;
208 ft_mem_debug_panic( const char* fmt,
214 printf( "FreeType.Debug: " );
221 exit( EXIT_FAILURE );
226 ft_mem_table_alloc( FT_MemTable table,
229 FT_Memory memory = table->memory;
233 memory->user = table->memory_user;
234 block = table->alloc( memory, size );
235 memory->user = table;
242 ft_mem_table_free( FT_MemTable table,
245 FT_Memory memory = table->memory;
248 memory->user = table->memory_user;
249 table->free( memory, block );
250 memory->user = table;
255 ft_mem_table_resize( FT_MemTable table )
260 new_size = ft_mem_closest_prime( table->nodes );
261 if ( new_size != table->size )
263 FT_MemNode* new_buckets;
267 new_buckets = (FT_MemNode *)
268 ft_mem_table_alloc( table,
269 new_size * sizeof ( FT_MemNode ) );
270 if ( new_buckets == NULL )
273 FT_ARRAY_ZERO( new_buckets, new_size );
275 for ( i = 0; i < table->size; i++ )
277 FT_MemNode node, next, *pnode;
281 node = table->buckets[i];
285 hash = FT_MEM_VAL( node->address ) % new_size;
286 pnode = new_buckets + hash;
288 node->link = pnode[0];
295 if ( table->buckets )
296 ft_mem_table_free( table, table->buckets );
298 table->buckets = new_buckets;
299 table->size = new_size;
305 ft_mem_table_new( FT_Memory memory )
310 table = (FT_MemTable)memory->alloc( memory, sizeof ( *table ) );
316 table->size = FT_MEM_SIZE_MIN;
319 table->memory = memory;
321 table->memory_user = memory->user;
323 table->alloc = memory->alloc;
324 table->realloc = memory->realloc;
325 table->free = memory->free;
327 table->buckets = (FT_MemNode *)
328 memory->alloc( memory,
329 table->size * sizeof ( FT_MemNode ) );
330 if ( table->buckets )
331 FT_ARRAY_ZERO( table->buckets, table->size );
334 memory->free( memory, table );
344 ft_mem_table_destroy( FT_MemTable table )
347 FT_Long leak_count = 0;
351 FT_DumpMemory( table->memory );
353 /* remove all blocks from the table, revealing leaked ones */
354 for ( i = 0; i < table->size; i++ )
356 FT_MemNode *pnode = table->buckets + i, next, node = *pnode;
364 if ( node->size > 0 )
367 "leaked memory block at address %p, size %8ld in (%s:%ld)\n",
368 node->address, node->size,
369 FT_FILENAME( node->source->file_name ),
370 node->source->line_no );
375 ft_mem_table_free( table, node->address );
378 node->address = NULL;
381 ft_mem_table_free( table, node );
384 table->buckets[i] = 0;
387 ft_mem_table_free( table, table->buckets );
388 table->buckets = NULL;
393 /* remove all sources */
394 for ( i = 0; i < FT_MEM_SOURCE_BUCKETS; i++ )
396 FT_MemSource source, next;
399 for ( source = table->sources[i]; source != NULL; source = next )
402 ft_mem_table_free( table, source );
405 table->sources[i] = NULL;
408 printf( "FreeType: total memory allocations = %ld\n",
409 table->alloc_total );
410 printf( "FreeType: maximum memory footprint = %ld\n",
413 ft_mem_table_free( table, table );
415 if ( leak_count > 0 )
417 "FreeType: %ld bytes of memory leaked in %ld blocks\n",
420 printf( "FreeType: no memory leaks detected\n" );
425 ft_mem_table_get_nodep( FT_MemTable table,
429 FT_MemNode *pnode, node;
432 hash = FT_MEM_VAL( address );
433 pnode = table->buckets + ( hash % table->size );
441 if ( node->address == address )
451 ft_mem_table_get_source( FT_MemTable table )
454 FT_MemSource node, *pnode;
457 /* cast to FT_PtrDist first since void* can be larger */
458 /* than FT_UInt32 and GCC 4.1.1 emits a warning */
459 hash = (FT_UInt32)(FT_PtrDist)(void*)_ft_debug_file +
460 (FT_UInt32)( 5 * _ft_debug_lineno );
461 pnode = &table->sources[hash % FT_MEM_SOURCE_BUCKETS];
469 if ( node->file_name == _ft_debug_file &&
470 node->line_no == _ft_debug_lineno )
476 node = (FT_MemSource)ft_mem_table_alloc( table, sizeof ( *node ) );
479 "not enough memory to perform memory debugging\n" );
481 node->file_name = _ft_debug_file;
482 node->line_no = _ft_debug_lineno;
484 node->cur_blocks = 0;
485 node->max_blocks = 0;
486 node->all_blocks = 0;
504 ft_mem_table_set( FT_MemTable table,
509 FT_MemNode *pnode, node;
517 pnode = ft_mem_table_get_nodep( table, address );
521 if ( node->size < 0 )
523 /* This block was already freed. Our memory is now completely */
525 /* This can only happen in keep-alive mode. */
527 "memory heap corrupted (allocating freed block)" );
531 /* This block was already allocated. This means that our memory */
532 /* is also corrupted! */
534 "memory heap corrupted (re-allocating allocated block at"
535 " %p, of size %ld)\n"
536 "org=%s:%d new=%s:%d\n",
537 node->address, node->size,
538 FT_FILENAME( node->source->file_name ), node->source->line_no,
539 FT_FILENAME( _ft_debug_file ), _ft_debug_lineno );
543 /* we need to create a new node in this table */
544 node = (FT_MemNode)ft_mem_table_alloc( table, sizeof ( *node ) );
546 ft_mem_debug_panic( "not enough memory to run memory tests" );
548 node->address = address;
550 node->source = source = ft_mem_table_get_source( table );
554 /* this is an allocation */
555 source->all_blocks++;
556 source->cur_blocks++;
557 if ( source->cur_blocks > source->max_blocks )
558 source->max_blocks = source->cur_blocks;
561 if ( size > (FT_ULong)source->cur_max )
562 source->cur_max = size;
566 /* we are growing or shrinking a reallocated block */
567 source->cur_size += delta;
568 table->alloc_current += delta;
572 /* we are allocating a new block */
573 source->cur_size += size;
574 table->alloc_current += size;
577 source->all_size += size;
579 if ( source->cur_size > source->max_size )
580 source->max_size = source->cur_size;
582 node->free_file_name = NULL;
583 node->free_line_no = 0;
585 node->link = pnode[0];
590 table->alloc_total += size;
592 if ( table->alloc_current > table->alloc_max )
593 table->alloc_max = table->alloc_current;
595 if ( table->nodes * 3 < table->size ||
596 table->size * 3 < table->nodes )
597 ft_mem_table_resize( table );
603 ft_mem_table_remove( FT_MemTable table,
609 FT_MemNode *pnode, node;
612 pnode = ft_mem_table_get_nodep( table, address );
619 if ( node->size < 0 )
621 "freeing memory block at %p more than once at (%s:%ld)\n"
622 "block allocated at (%s:%ld) and released at (%s:%ld)",
624 FT_FILENAME( _ft_debug_file ), _ft_debug_lineno,
625 FT_FILENAME( node->source->file_name ), node->source->line_no,
626 FT_FILENAME( node->free_file_name ), node->free_line_no );
628 /* scramble the node's content for additional safety */
629 FT_MEM_SET( address, 0xF3, node->size );
633 source = node->source;
635 source->cur_blocks--;
636 source->cur_size -= node->size;
638 table->alloc_current -= node->size;
641 if ( table->keep_alive )
643 /* we simply invert the node's size to indicate that the node */
645 node->size = -node->size;
646 node->free_file_name = _ft_debug_file;
647 node->free_line_no = _ft_debug_lineno;
658 ft_mem_table_free( table, node );
660 if ( table->nodes * 3 < table->size ||
661 table->size * 3 < table->nodes )
662 ft_mem_table_resize( table );
667 "trying to free unknown block at %p in (%s:%ld)\n",
669 FT_FILENAME( _ft_debug_file ), _ft_debug_lineno );
675 ft_mem_debug_alloc( FT_Memory memory,
678 FT_MemTable table = (FT_MemTable)memory->user;
683 ft_mem_debug_panic( "negative block size allocation (%ld)", size );
685 /* return NULL if the maximum number of allocations was reached */
686 if ( table->bound_count &&
687 table->alloc_count >= table->alloc_count_max )
690 /* return NULL if this allocation would overflow the maximum heap size */
691 if ( table->bound_total &&
692 table->alloc_total_max - table->alloc_current > (FT_ULong)size )
695 block = (FT_Byte *)ft_mem_table_alloc( table, size );
698 ft_mem_table_set( table, block, (FT_ULong)size, 0 );
700 table->alloc_count++;
703 _ft_debug_file = "<unknown>";
704 _ft_debug_lineno = 0;
706 return (FT_Pointer)block;
711 ft_mem_debug_free( FT_Memory memory,
714 FT_MemTable table = (FT_MemTable)memory->user;
718 ft_mem_debug_panic( "trying to free NULL in (%s:%ld)",
719 FT_FILENAME( _ft_debug_file ),
722 ft_mem_table_remove( table, (FT_Byte*)block, 0 );
724 if ( !table->keep_alive )
725 ft_mem_table_free( table, block );
727 table->alloc_count--;
729 _ft_debug_file = "<unknown>";
730 _ft_debug_lineno = 0;
735 ft_mem_debug_realloc( FT_Memory memory,
740 FT_MemTable table = (FT_MemTable)memory->user;
741 FT_MemNode node, *pnode;
742 FT_Pointer new_block;
745 const char* file_name = FT_FILENAME( _ft_debug_file );
746 FT_Long line_no = _ft_debug_lineno;
749 /* unlikely, but possible */
750 if ( new_size == cur_size )
753 /* the following is valid according to ANSI C */
755 if ( block == NULL || cur_size == 0 )
756 ft_mem_debug_panic( "trying to reallocate NULL in (%s:%ld)",
757 file_name, line_no );
760 /* while the following is allowed in ANSI C also, we abort since */
761 /* such case should be handled by FreeType. */
764 "trying to reallocate %p to size 0 (current is %ld) in (%s:%ld)",
765 block, cur_size, file_name, line_no );
767 /* check `cur_size' value */
768 pnode = ft_mem_table_get_nodep( table, (FT_Byte*)block );
772 "trying to reallocate unknown block at %p in (%s:%ld)",
773 block, file_name, line_no );
775 if ( node->size <= 0 )
777 "trying to reallocate freed block at %p in (%s:%ld)",
778 block, file_name, line_no );
780 if ( node->size != cur_size )
781 ft_mem_debug_panic( "invalid ft_realloc request for %p. cur_size is "
782 "%ld instead of %ld in (%s:%ld)",
783 block, cur_size, node->size, file_name, line_no );
785 /* return NULL if the maximum number of allocations was reached */
786 if ( table->bound_count &&
787 table->alloc_count >= table->alloc_count_max )
790 delta = (FT_Long)( new_size - cur_size );
792 /* return NULL if this allocation would overflow the maximum heap size */
794 table->bound_total &&
795 table->alloc_current + (FT_ULong)delta > table->alloc_total_max )
798 new_block = (FT_Byte *)ft_mem_table_alloc( table, new_size );
799 if ( new_block == NULL )
802 ft_mem_table_set( table, (FT_Byte*)new_block, new_size, delta );
804 ft_memcpy( new_block, block, cur_size < new_size ? cur_size : new_size );
806 ft_mem_table_remove( table, (FT_Byte*)block, delta );
808 _ft_debug_file = "<unknown>";
809 _ft_debug_lineno = 0;
811 if ( !table->keep_alive )
812 ft_mem_table_free( table, block );
819 ft_mem_debug_init( FT_Memory memory )
825 if ( getenv( "FT2_DEBUG_MEMORY" ) )
827 table = ft_mem_table_new( memory );
833 memory->user = table;
834 memory->alloc = ft_mem_debug_alloc;
835 memory->realloc = ft_mem_debug_realloc;
836 memory->free = ft_mem_debug_free;
838 p = getenv( "FT2_ALLOC_TOTAL_MAX" );
841 FT_Long total_max = ft_atol( p );
846 table->bound_total = 1;
847 table->alloc_total_max = (FT_ULong)total_max;
851 p = getenv( "FT2_ALLOC_COUNT_MAX" );
854 FT_Long total_count = ft_atol( p );
857 if ( total_count > 0 )
859 table->bound_count = 1;
860 table->alloc_count_max = (FT_ULong)total_count;
864 p = getenv( "FT2_KEEP_ALIVE" );
867 FT_Long keep_alive = ft_atol( p );
870 if ( keep_alive > 0 )
871 table->keep_alive = 1;
882 ft_mem_debug_done( FT_Memory memory )
884 FT_MemTable table = (FT_MemTable)memory->user;
889 memory->free = table->free;
890 memory->realloc = table->realloc;
891 memory->alloc = table->alloc;
893 ft_mem_table_destroy( table );
901 ft_mem_source_compare( const void* p1,
904 FT_MemSource s1 = *(FT_MemSource*)p1;
905 FT_MemSource s2 = *(FT_MemSource*)p2;
908 if ( s2->max_size > s1->max_size )
910 else if ( s2->max_size < s1->max_size )
918 FT_DumpMemory( FT_Memory memory )
920 FT_MemTable table = (FT_MemTable)memory->user;
925 FT_MemSource* bucket = table->sources;
926 FT_MemSource* limit = bucket + FT_MEM_SOURCE_BUCKETS;
927 FT_MemSource* sources;
933 for ( ; bucket < limit; bucket++ )
935 FT_MemSource source = *bucket;
938 for ( ; source; source = source->link )
942 sources = (FT_MemSource*)ft_mem_table_alloc(
943 table, sizeof ( *sources ) * count );
946 for ( bucket = table->sources; bucket < limit; bucket++ )
948 FT_MemSource source = *bucket;
951 for ( ; source; source = source->link )
952 sources[count++] = source;
955 ft_qsort( sources, count, sizeof ( *sources ), ft_mem_source_compare );
957 printf( "FreeType Memory Dump: "
958 "current=%ld max=%ld total=%ld count=%ld\n",
959 table->alloc_current, table->alloc_max,
960 table->alloc_total, table->alloc_count );
961 printf( " block block sizes sizes sizes source\n" );
962 printf( " count high sum highsum max location\n" );
963 printf( "-------------------------------------------------\n" );
965 fmt = "%6ld %6ld %8ld %8ld %8ld %s:%d\n";
967 for ( nn = 0; nn < count; nn++ )
969 FT_MemSource source = sources[nn];
973 source->cur_blocks, source->max_blocks,
974 source->cur_size, source->max_size, source->cur_max,
975 FT_FILENAME( source->file_name ),
978 printf( "------------------------------------------------\n" );
980 ft_mem_table_free( table, sources );
984 #else /* !FT_DEBUG_MEMORY */
986 /* ANSI C doesn't like empty source files */
987 typedef int _debug_mem_dummy;
989 #endif /* !FT_DEBUG_MEMORY */