kenmirrors/asterisk
1
0
Fork 0
mirror of https://github.com/asterisk/asterisk.git synced 2025-09-04 11:58:52 +00:00
Code Issues Packages Projects Releases Wiki Activity

Print anomlies at free / show memory allocations time

Browse Source 
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@6694 65c4cc65-6c06-0410-ace0-fbb531ad65f3
This commit is contained in:
Mark Spencer
2005-09-29 04:34:11 +00:00
parent d45b683bdd
commit 6c54fa36dd
1 changed files with 43 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

44
astmm.c
View File

@@ -56,6 +56,8 @@ ASTERISK_FILE_VERSION(__FILE__, "$Revision$")
#undef free
#undef vasprintf
#define FENCE_MAGIC 0xdeadbeef
static FILE *mmlog;
static struct ast_region {
@@ -65,6 +67,7 @@ static struct ast_region {
int lineno;
int which;
size_t len;
unsigned int fence;
unsigned char data[0];
} *regions[SOME_PRIME];
@@ -78,8 +81,9 @@ static inline void *__ast_alloc_region(size_t size, int which, const char *file,
{
struct ast_region *reg;
void *ptr = NULL;
unsigned int *fence;
int hash;
reg = malloc(size + sizeof(struct ast_region));
reg = malloc(size + sizeof(struct ast_region) + sizeof(unsigned int));
ast_mutex_lock(&reglock);
if (reg) {
ast_copy_string(reg->file, file, sizeof(reg->file));
@@ -93,6 +97,9 @@ static inline void *__ast_alloc_region(size_t size, int which, const char *file,
hash = HASH(ptr);
reg->next = regions[hash];
regions[hash] = reg;
reg->fence = FENCE_MAGIC;
fence = (ptr + reg->len);
*fence = FENCE_MAGIC;
}
ast_mutex_unlock(&reglock);
if (!reg) {
@@ -128,6 +135,8 @@ static void __ast_free_region(void *ptr, const char *file, int lineno, const cha
{
int hash = HASH(ptr);
struct ast_region *reg, *prev = NULL;
unsigned int *fence;
ast_mutex_lock(&reglock);
reg = regions[hash];
while (reg) {
@@ -144,6 +153,21 @@ static void __ast_free_region(void *ptr, const char *file, int lineno, const cha
}
ast_mutex_unlock(&reglock);
if (reg) {
fence = (unsigned int *)(reg->data + reg->len);
if (reg->fence != FENCE_MAGIC) {
fprintf(stderr, "WARNING: Low fence violation at %p, in %s of %s, line %d\n", reg->data, reg->func, reg->file, reg->lineno);
if (mmlog) {
fprintf(mmlog, "%ld - WARNING: Low fence violation at %p, in %s of %s, line %d\n", time(NULL), reg->data, reg->func, reg->file, reg->lineno);
fflush(mmlog);
}
}
if (*fence != FENCE_MAGIC) {
fprintf(stderr, "WARNING: High fence violation at %p, in %s of %s, line %d\n", reg->data, reg->func, reg->file, reg->lineno);
if (mmlog) {
fprintf(mmlog, "%ld - WARNING: High fence violation at %p, in %s of %s, line %d\n", time(NULL), reg->data, reg->func, reg->file, reg->lineno);
fflush(mmlog);
}
}
free(reg);
} else {
fprintf(stderr, "WARNING: Freeing unused memory at %p, in %s of %s, line %d\n", ptr, func, file, lineno);
@@ -254,6 +278,7 @@ static int handle_show_memory(int fd, int argc, char *argv[])
struct ast_region *reg;
unsigned int len = 0;
int count = 0;
unsigned int *fence;
if (argc > 3)
fn = argv[3];
@@ -263,6 +288,23 @@ static int handle_show_memory(int fd, int argc, char *argv[])
for (x = 0; x < SOME_PRIME; x++) {
reg = regions[x];
while (reg) {
if (!fn || !strcasecmp(fn, reg->file) || !strcasecmp(fn, "anomolies")) {
fence = (unsigned int *)(reg->data + reg->len);
if (reg->fence != FENCE_MAGIC) {
fprintf(stderr, "WARNING: Low fence violation at %p, in %s of %s, line %d\n", reg->data, reg->func, reg->file, reg->lineno);
if (mmlog) {
fprintf(mmlog, "%ld - WARNING: Low fence violation at %p, in %s of %s, line %d\n", time(NULL), reg->data, reg->func, reg-> file, reg->lineno);
fflush(mmlog);
}
}
if (*fence != FENCE_MAGIC) {
fprintf(stderr, "WARNING: High fence violation at %p, in %s of %s, line %d\n", reg->data, reg->func, reg->file, reg->lineno);
if (mmlog) {
fprintf(mmlog, "%ld - WARNING: High fence violation at %p, in %s of %s, line %d\n", time(NULL), reg->data, reg->func, reg->file, reg->lineno);
fflush(mmlog);
}
}
}
if (!fn || !strcasecmp(fn, reg->file)) {
ast_cli(fd, "%10d bytes allocated in %20s at line %5d of %s\n", (int) reg->len, reg->func, reg->lineno, reg->file);
len += reg->len;