amalloc.c 2.61 KB
Newer Older
1 2 3 4 5 6 7
/*
 * debugging malloc()/realloc()/calloc()/free() that attempts
 * to keep track of just what's been allocated today.
 */

#include <stdio.h>
#include <stdlib.h>
8
#include "config.h"
9 10 11

#define MAGIC 0x1f2e3d4c

12
struct alist { int magic, size, index; int *end; struct alist *next, *last; };
13 14 15 16 17 18 19

static struct alist list =  { 0, 0, 0, 0 };

static int mallocs=0;
static int reallocs=0;
static int frees=0;

20 21 22 23 24 25 26 27 28 29
static int index = 0;

static void
die(char *msg, int index)
{
    fprintf(stderr, msg, index);
    abort();
}


30
void *
31
acalloc(int count, int size)
32
{
33 34 35 36 37 38
    struct alist *ret;

    if ( size > 1 ) {
	count *= size;
	size = 1;
    }
39

40
    if ( ret = calloc(count + sizeof(struct alist) + sizeof(int), size) ) {
41 42
	ret->magic = MAGIC;
	ret->size = size * count;
43 44 45
	ret->index = index ++;
	ret->end = (int*)(count + (char*) (ret + 1));
	*(ret->end) = ~MAGIC;
46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75
	if ( list.next ) {
	    ret->next = list.next;
	    ret->last = &list;
	    ret->next->last = ret;
	    list.next = ret;
	}
	else {
	    ret->last = ret->next = &list;
	    list.next = list.last = ret;
	}
	++mallocs;
	return ret+1;
    }
    return 0;
}


void*
amalloc(int size)
{
    return acalloc(size,1);
}


void
afree(void *ptr)
{
    struct alist *p2 = ((struct alist*)ptr)-1;

    if ( p2->magic == MAGIC ) {
76 77
	if ( ! (p2->end && *(p2->end) == ~MAGIC) )
	    die("goddam: corrupted memory block %d in free()!\n", p2->index);
78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94
	p2->last->next = p2->next;
	p2->next->last = p2->last;
	++frees;
	free(p2);
    }
    else
	free(ptr);
}


void *
arealloc(void *ptr, int size)
{
    struct alist *p2 = ((struct alist*)ptr)-1;
    struct alist save;

    if ( p2->magic == MAGIC ) {
95 96
	if ( ! (p2->end && *(p2->end) == ~MAGIC) )
	    die("goddam: corrupted memory block %d in realloc()!\n", p2->index);
97 98
	save.next = p2->next;
	save.last = p2->last;
99
	p2 = realloc(p2, sizeof(int) + sizeof(*p2) + size);
100 101 102

	if ( p2 ) {
	    p2->size = size;
103 104
	    p2->end = (int*)(size + (char*) (p2 + 1));
	    *(p2->end) = ~MAGIC;
105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136
	    p2->next->last = p2;
	    p2->last->next = p2;
	    ++reallocs;
	    return p2+1;
	}
	else {
	    save.next->last = save.last;
	    save.last->next = save.next;
	    return 0;
	}
    }
    return realloc(ptr, size);
}


void
adump()
{
    struct alist *p;


    for ( p = list.next; p && (p != &list); p = p->next ) {
	fprintf(stderr, "allocated: %d byte%s\n", p->size, (p->size==1) ? "" : "s");
	fprintf(stderr, "           [%.*s]\n", p->size, (char*)(p+1));
    }

    if ( getenv("AMALLOC_STATISTICS") ) {
	fprintf(stderr, "%d malloc%s\n", mallocs, (mallocs==1)?"":"s");
	fprintf(stderr, "%d realloc%s\n", reallocs, (reallocs==1)?"":"s");
	fprintf(stderr, "%d free%s\n", frees, (frees==1)?"":"s");
    }
}