mirror of
https://github.com/webmproject/libwebp.git
synced 2024-11-20 04:18:26 +01:00
instrument memory allocation routines for debugging
Some tracing code is activated by PRINT_MEM_INFO flag. For debugging only! (not thread-safe, and slow). Change-Id: I282c623c960f97d474a35b600981b761ef89ace9
This commit is contained in:
parent
38e2db3e16
commit
2aa187360d
@ -14,9 +14,110 @@
|
|||||||
#include <stdlib.h>
|
#include <stdlib.h>
|
||||||
#include "./utils.h"
|
#include "./utils.h"
|
||||||
|
|
||||||
|
// If defined, will print extra info like total memory used, number of
|
||||||
|
// alloc/free etc. For debugging/tuning purpose only (it's slow, and not
|
||||||
|
// multi-thread safe!).
|
||||||
|
// An interesting alternative is valgrind's 'massif' tool:
|
||||||
|
// http://valgrind.org/docs/manual/ms-manual.html
|
||||||
|
// Here is an example command line:
|
||||||
|
/* valgrind --tool=massif --massif-out-file=massif.out \
|
||||||
|
--stacks=yes --alloc-fn=WebPSafeAlloc --alloc-fn=WebPSafeCalloc
|
||||||
|
ms_print massif.out
|
||||||
|
*/
|
||||||
|
|
||||||
|
// #define PRINT_MEM_INFO
|
||||||
|
#define PRINT_MEM_TRAFFIC // print fine traffic details
|
||||||
|
|
||||||
//------------------------------------------------------------------------------
|
//------------------------------------------------------------------------------
|
||||||
// Checked memory allocation
|
// Checked memory allocation
|
||||||
|
|
||||||
|
#if defined(PRINT_MEM_INFO)
|
||||||
|
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <stdlib.h> // for abort()
|
||||||
|
|
||||||
|
static int num_malloc_calls = 0;
|
||||||
|
static int num_calloc_calls = 0;
|
||||||
|
static int num_free_calls = 0;
|
||||||
|
|
||||||
|
typedef struct MemBlock MemBlock;
|
||||||
|
struct MemBlock {
|
||||||
|
void* ptr_;
|
||||||
|
size_t size_;
|
||||||
|
MemBlock* next_;
|
||||||
|
};
|
||||||
|
|
||||||
|
static MemBlock* all_blocks = NULL;
|
||||||
|
static size_t total_mem = 0;
|
||||||
|
static size_t high_water_mark = 0;
|
||||||
|
|
||||||
|
static int exit_registered = 0;
|
||||||
|
static void PrintMemInfo(void) {
|
||||||
|
fprintf(stderr, "\nMEMORY INFO:\n");
|
||||||
|
fprintf(stderr, "num calls to: malloc = %d\n", num_malloc_calls);
|
||||||
|
fprintf(stderr, " calloc = %d\n", num_calloc_calls);
|
||||||
|
fprintf(stderr, " free = %d\n", num_free_calls);
|
||||||
|
fprintf(stderr, "total_mem: %u\n", (uint32_t)total_mem);
|
||||||
|
fprintf(stderr, "high-water mark: %u\n", (uint32_t)high_water_mark);
|
||||||
|
while (all_blocks != NULL) {
|
||||||
|
MemBlock* b = all_blocks;
|
||||||
|
all_blocks = b->next_;
|
||||||
|
free(b);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
static void Increment(int* const v) {
|
||||||
|
if (!exit_registered) {
|
||||||
|
atexit(PrintMemInfo);
|
||||||
|
exit_registered = 1;
|
||||||
|
}
|
||||||
|
++*v;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void AddMem(void* ptr, size_t size) {
|
||||||
|
if (ptr != NULL) {
|
||||||
|
MemBlock* b = (MemBlock*)malloc(sizeof(*b));
|
||||||
|
if (b == NULL) abort();
|
||||||
|
b->next_ = all_blocks;
|
||||||
|
all_blocks = b;
|
||||||
|
b->ptr_ = ptr;
|
||||||
|
b->size_ = size;
|
||||||
|
total_mem += size;
|
||||||
|
#if defined(PRINT_MEM_TRAFFIC)
|
||||||
|
fprintf(stderr, "Mem: %u (+%u)\n", (uint32_t)total_mem, (uint32_t)size);
|
||||||
|
#endif
|
||||||
|
if (total_mem > high_water_mark) high_water_mark = total_mem;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
static void SubMem(void* ptr) {
|
||||||
|
if (ptr != NULL) {
|
||||||
|
MemBlock** b = &all_blocks;
|
||||||
|
// Inefficient search, but that's just for debugging.
|
||||||
|
while (*b != NULL && (*b)->ptr_ != ptr) b = &(*b)->next_;
|
||||||
|
if (*b == NULL) {
|
||||||
|
fprintf(stderr, "Invalid pointer free! (%p)\n", ptr);
|
||||||
|
abort();
|
||||||
|
}
|
||||||
|
{
|
||||||
|
MemBlock* block = *b;
|
||||||
|
*b = block->next_;
|
||||||
|
total_mem -= block->size_;
|
||||||
|
#if defined(PRINT_MEM_TRAFFIC)
|
||||||
|
fprintf(stderr, "Mem: %u (-%u)\n",
|
||||||
|
(uint32_t)total_mem, (uint32_t)block->size_);
|
||||||
|
#endif
|
||||||
|
free(block);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
#else
|
||||||
|
#define Increment(v) do {} while(0)
|
||||||
|
#define AddMem(p, s) do {} while(0)
|
||||||
|
#define SubMem(p) do {} while(0)
|
||||||
|
#endif
|
||||||
|
|
||||||
// Returns 0 in case of overflow of nmemb * size.
|
// Returns 0 in case of overflow of nmemb * size.
|
||||||
static int CheckSizeArgumentsOverflow(uint64_t nmemb, size_t size) {
|
static int CheckSizeArgumentsOverflow(uint64_t nmemb, size_t size) {
|
||||||
const uint64_t total_size = nmemb * size;
|
const uint64_t total_size = nmemb * size;
|
||||||
@ -27,18 +128,28 @@ static int CheckSizeArgumentsOverflow(uint64_t nmemb, size_t size) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
void* WebPSafeMalloc(uint64_t nmemb, size_t size) {
|
void* WebPSafeMalloc(uint64_t nmemb, size_t size) {
|
||||||
|
void* ptr;
|
||||||
|
Increment(&num_malloc_calls);
|
||||||
if (!CheckSizeArgumentsOverflow(nmemb, size)) return NULL;
|
if (!CheckSizeArgumentsOverflow(nmemb, size)) return NULL;
|
||||||
assert(nmemb * size > 0);
|
assert(nmemb * size > 0);
|
||||||
return malloc((size_t)(nmemb * size));
|
ptr = malloc((size_t)(nmemb * size));
|
||||||
|
AddMem(ptr, (size_t)(nmemb * size));
|
||||||
|
return ptr;
|
||||||
}
|
}
|
||||||
|
|
||||||
void* WebPSafeCalloc(uint64_t nmemb, size_t size) {
|
void* WebPSafeCalloc(uint64_t nmemb, size_t size) {
|
||||||
|
void* ptr;
|
||||||
|
Increment(&num_calloc_calls);
|
||||||
if (!CheckSizeArgumentsOverflow(nmemb, size)) return NULL;
|
if (!CheckSizeArgumentsOverflow(nmemb, size)) return NULL;
|
||||||
assert(nmemb * size > 0);
|
assert(nmemb * size > 0);
|
||||||
return calloc((size_t)nmemb, size);
|
ptr = calloc((size_t)nmemb, size);
|
||||||
|
AddMem(ptr, (size_t)(nmemb * size));
|
||||||
|
return ptr;
|
||||||
}
|
}
|
||||||
|
|
||||||
void WebPSafeFree(void* const ptr) {
|
void WebPSafeFree(void* const ptr) {
|
||||||
|
Increment(&num_free_calls);
|
||||||
|
SubMem(ptr);
|
||||||
free(ptr);
|
free(ptr);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user