mirror of
https://github.com/Orc/discount.git
synced 2026-09-25 04:10:00 +03:00
david parsons
5c6115c601
--enable-amalloc) replaced malloc and its ilk with
versions that attempt to maintain a linked list of
allocated blocks that can be printed to stderr with
the `adump()` function.
2. Clean up a couple more places where I leak memory
during the first level parse.
3. tweak cstring.h to try to chase down places where
the C compiler might optimize EXPAND() into producing
broken code.
99 lines
1.6 KiB
C
99 lines
1.6 KiB
C
/*
|
|
* debugging malloc()/realloc()/calloc()/free() that attempts
|
|
* to keep track of just what's been allocated today.
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
|
|
#define MAGIC 0x1f2e3d4c
|
|
|
|
struct alist { int magic, size; struct alist *next, *last; };
|
|
|
|
static struct alist list = { 0, 0, 0, 0 };
|
|
|
|
void *
|
|
acalloc(int size, int count)
|
|
{
|
|
struct alist *ret = calloc(size + sizeof(struct alist), count);
|
|
|
|
if ( ret ) {
|
|
ret->magic = MAGIC;
|
|
ret->size = size * count;
|
|
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;
|
|
}
|
|
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 ) {
|
|
p2->last->next = p2->next;
|
|
p2->next->last = p2->last;
|
|
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 ) {
|
|
save.next = p2->next;
|
|
save.last = p2->last;
|
|
p2 = realloc(p2, sizeof(p2) + size);
|
|
|
|
if ( p2 ) {
|
|
p2->size = size;
|
|
p2->next->last = p2;
|
|
p2->last->next = p2;
|
|
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, p+1);
|
|
}
|
|
}
|