static void rem_memblock(MemHead *memh) { remlink(membase,&memh->next); if (memh->prev){ if (memh->next) MEMNEXT(memh->prev)->nextname = MEMNEXT(memh->next)->name; else MEMNEXT(memh->prev)->nextname = 0; } totblock--; mem_in_use -= memh->len; free(memh); }
void MEM_printmemlist() { MemHead *membl; membl = (MemHead*)membase->first; // (MemHead*) Added by Swanny 19/05/05 if (membl) membl = MEMNEXT(membl); while(membl) { print_error("%s len: %d %p\n",membl->name,membl->len, membl+1); if(membl->next) membl= MEMNEXT(membl->next); else break; } }
/* Prints in python syntax for easy */ static void MEM_printmemlist_internal( int pydict ) { MemHead *membl; mem_lock_thread(); membl = membase->first; if (membl) membl = MEMNEXT(membl); if (pydict) { print_error("# membase_debug.py\n"); print_error("membase = [\\\n"); } while(membl) { if (pydict) { fprintf(stderr, "{'len':" SIZET_FORMAT ", 'name':'''%s''', 'pointer':'%p'},\\\n", SIZET_ARG(membl->len), membl->name, (void *)(membl+1)); } else { #ifdef DEBUG_MEMCOUNTER print_error("%s len: " SIZET_FORMAT " %p, count: %d\n", membl->name, SIZET_ARG(membl->len), membl+1, membl->_count); #else print_error("%s len: " SIZET_FORMAT " %p\n", membl->name, SIZET_ARG(membl->len), membl+1); #endif } if(membl->next) membl= MEMNEXT(membl->next); else break; } if (pydict) { fprintf(stderr, "]\n\n"); fprintf(stderr, "mb_userinfo = {}\n" "totmem = 0\n" "for mb_item in membase:\n" "\tmb_item_user_size = mb_userinfo.setdefault(mb_item['name'], [0,0])\n" "\tmb_item_user_size[0] += 1 # Add a user\n" "\tmb_item_user_size[1] += mb_item['len'] # Increment the size\n" "\ttotmem += mb_item['len']\n" "print '(membase) items:', len(membase), '| unique-names:', len(mb_userinfo), '| total-mem:', totmem\n" "mb_userinfo_sort = mb_userinfo.items()\n" "for sort_name, sort_func in (('size', lambda a: -a[1][1]), ('users', lambda a: -a[1][0]), ('name', lambda a: a[0])):\n" "\tprint '\\nSorting by:', sort_name\n" "\tmb_userinfo_sort.sort(key = sort_func)\n" "\tfor item in mb_userinfo_sort:\n" "\t\tprint 'name:%%s, users:%%i, len:%%i' %% (item[0], item[1][0], item[1][1])\n" ); } mem_unlock_thread(); }
void *MEM_callocN(unsigned int len, char *str) { MemHead *memh; MemTail *memt; len = (len + 3 ) & ~3; /* allocate in units of 4 */ memh= (MemHead *)calloc(len+sizeof(MemHead)+sizeof(MemTail),1); if(memh!=0) { memh->tag1 = MEMTAG1; memh->name = str; memh->nextname = 0; memh->len = len; /* memh->level = 0; */ memh->tag2 = MEMTAG2; memt = (MemTail *)(((char *) memh) + sizeof(MemHead) + len); memt->tag3 = MEMTAG3; addtail(membase,&memh->next); if (memh->next) memh->nextname = MEMNEXT(memh->next)->name; totblock++; mem_in_use += len; return (++memh); } print_error("Calloc returns nill: len=%d in %s\n",len,str); return 0; }
void MEM_callbackmemlist(void (*func)(void*)) { MemHead *membl; mem_lock_thread(); membl = membase->first; if (membl) membl = MEMNEXT(membl); while(membl) { func(membl+1); if(membl->next) membl= MEMNEXT(membl->next); else break; } mem_unlock_thread(); }
static void rem_memblock(MemHead *memh) { remlink(membase,&memh->next); if (memh->prev) { if (memh->next) MEMNEXT(memh->prev)->nextname = MEMNEXT(memh->next)->name; else MEMNEXT(memh->prev)->nextname = NULL; } totblock--; mem_in_use -= memh->len; if(memh->mmap) { mmap_in_use -= memh->len; if (munmap(memh, memh->len + sizeof(MemHead) + sizeof(MemTail))) printf("Couldn't unmap memory %s\n", memh->name); } else { if(malloc_debug_memset && memh->len) memset(memh+1, 255, memh->len); free(memh); } }
short MEM_testN(void *vmemh) { MemHead *membl; mem_lock_thread(); membl = membase->first; if (membl) membl = MEMNEXT(membl); while(membl) { if (vmemh == membl+1) { mem_unlock_thread(); return 1; } if(membl->next) membl= MEMNEXT(membl->next); else break; } mem_unlock_thread(); print_error("Memoryblock %p: pointer not in memlist\n", vmemh); return 0; }
static void make_memhead_header(MemHead *memh, size_t len, const char *str) { MemTail *memt; memh->tag1 = MEMTAG1; memh->name = str; memh->nextname = NULL; memh->len = len; memh->mmap = 0; memh->tag2 = MEMTAG2; memt = (MemTail *)(((char *) memh) + sizeof(MemHead) + len); memt->tag3 = MEMTAG3; addtail(membase,&memh->next); if (memh->next) memh->nextname = MEMNEXT(memh->next)->name; totblock++; mem_in_use += len; peak_mem = mem_in_use > peak_mem ? mem_in_use : peak_mem; }
static const char *check_memlist(MemHead *memh) { MemHead *forw,*back,*forwok,*backok; const char *name; forw = membase->first; if (forw) forw = MEMNEXT(forw); forwok = NULL; while(forw){ if (forw->tag1 != MEMTAG1 || forw->tag2 != MEMTAG2) break; forwok = forw; if (forw->next) forw = MEMNEXT(forw->next); else forw = NULL; } back = (MemHead *) membase->last; if (back) back = MEMNEXT(back); backok = NULL; while(back){ if (back->tag1 != MEMTAG1 || back->tag2 != MEMTAG2) break; backok = back; if (back->prev) back = MEMNEXT(back->prev); else back = NULL; } if (forw != back) return ("MORE THAN 1 MEMORYBLOCK CORRUPT"); if (forw == NULL && back == NULL){ /* geen foute headers gevonden dan maar op zoek naar memblock*/ forw = membase->first; if (forw) forw = MEMNEXT(forw); forwok = NULL; while(forw){ if (forw == memh) break; if (forw->tag1 != MEMTAG1 || forw->tag2 != MEMTAG2) break; forwok = forw; if (forw->next) forw = MEMNEXT(forw->next); else forw = NULL; } if (forw == NULL) return NULL; back = (MemHead *) membase->last; if (back) back = MEMNEXT(back); backok = NULL; while(back){ if (back == memh) break; if (back->tag1 != MEMTAG1 || back->tag2 != MEMTAG2) break; backok = back; if (back->prev) back = MEMNEXT(back->prev); else back = NULL; } } if (forwok) name = forwok->nextname; else name = "No name found"; if (forw == memh){ /* voor alle zekerheid wordt dit block maar uit de lijst gehaald */ if (forwok){ if (backok){ forwok->next = (MemHead *)&backok->next; backok->prev = (MemHead *)&forwok->next; forwok->nextname = backok->name; } else{ forwok->next = NULL; membase->last = (struct localLink *) &forwok->next; /* membase->last = (struct Link *) &forwok->next; */ } } else{ if (backok){ backok->prev = NULL; membase->first = &backok->next; } else{ membase->first = membase->last = NULL; } } } else{ MemorY_ErroR(name,"Additional error in header"); return("Additional error in header"); } return(name); }
void MEM_printmemlist_stats(void) { MemHead *membl; MemPrintBlock *pb, *printblock; int totpb, a, b; mem_lock_thread(); /* put memory blocks into array */ printblock= malloc(sizeof(MemPrintBlock)*totblock); pb= printblock; totpb= 0; membl = membase->first; if (membl) membl = MEMNEXT(membl); while(membl) { pb->name= membl->name; pb->len= membl->len; pb->items= 1; totpb++; pb++; if(membl->next) membl= MEMNEXT(membl->next); else break; } /* sort by name and add together blocks with the same name */ qsort(printblock, totpb, sizeof(MemPrintBlock), compare_name); for(a=0, b=0; a<totpb; a++) { if(a == b) { continue; } else if(strcmp(printblock[a].name, printblock[b].name) == 0) { printblock[b].len += printblock[a].len; printblock[b].items++; } else { b++; memcpy(&printblock[b], &printblock[a], sizeof(MemPrintBlock)); } } totpb= b+1; /* sort by length and print */ qsort(printblock, totpb, sizeof(MemPrintBlock), compare_len); printf("\ntotal memory len: %.3f MB\n", (double)mem_in_use/(double)(1024*1024)); printf(" ITEMS TOTAL-MiB AVERAGE-KiB TYPE\n"); for(a=0, pb=printblock; a<totpb; a++, pb++) printf("%6d (%8.3f %8.3f) %s\n", pb->items, (double)pb->len/(double)(1024*1024), (double)pb->len/1024.0/(double)pb->items, pb->name); free(printblock); mem_unlock_thread(); #if 0 /* GLIBC only */ malloc_stats(); #endif }