-/*
- * GMQCC performs tons of allocations, constructions, and crazyness
- * all around. When trying to optimizes systems, or just get fancy
- * statistics out of the compiler, it's often printf mess. This file
- * implements the statistics system of the compiler. I.E the allocator
- * we use to track allocations, and other systems of interest.
- */
-#define ST_SIZE 1024
-
-typedef struct stat_mem_block_s {
- const char *file;
- size_t line;
- size_t size;
- struct stat_mem_block_s *next;
- struct stat_mem_block_s *prev;
-} stat_mem_block_t;
-
-typedef struct {
- size_t key;
- size_t value;
-} stat_size_entry_t, **stat_size_table_t;
-
-static uint64_t stat_mem_allocated = 0;
-static uint64_t stat_mem_deallocated = 0;
-static uint64_t stat_mem_allocated_total = 0;
-static uint64_t stat_mem_deallocated_total = 0;
-static uint64_t stat_mem_high = 0;
-static uint64_t stat_mem_peak = 0;
-static uint64_t stat_mem_strdups = 0;
-static uint64_t stat_used_strdups = 0;
-static uint64_t stat_used_vectors = 0;
-static uint64_t stat_used_hashtables = 0;
-static uint64_t stat_type_vectors = 0;
-static uint64_t stat_type_hashtables = 0;
-static stat_size_table_t stat_size_vectors = NULL;
-static stat_size_table_t stat_size_hashtables = NULL;
-static stat_mem_block_t *stat_mem_block_root = NULL;
-
-/*
- * A tiny size_t key-value hashtbale for tracking vector and hashtable
- * sizes. We can use it for other things too, if we need to. This is
- * very TIGHT, and efficent in terms of space though.
- */
-static stat_size_table_t stat_size_new(void) {
- return (stat_size_table_t)memset(
- mem_a(sizeof(stat_size_entry_t*) * ST_SIZE),
- 0, ST_SIZE * sizeof(stat_size_entry_t*)
- );
-}
-
-static void stat_size_del(stat_size_table_t table) {
- size_t i = 0;
- for (; i < ST_SIZE; i++) if(table[i]) mem_d(table[i]);
- mem_d(table);
-}
-
-static stat_size_entry_t *stat_size_get(stat_size_table_t table, size_t key) {
- size_t hash = (key % ST_SIZE);
- while (table[hash] && table[hash]->key != key)
- hash = (hash + 1) % ST_SIZE;
- return table[hash];
-}
-static void stat_size_put(stat_size_table_t table, size_t key, size_t value) {
- size_t hash = (key % ST_SIZE);
- while (table[hash] && table[hash]->key != key)
- hash = (hash + 1) % ST_SIZE;
- table[hash] = (stat_size_entry_t*)mem_a(sizeof(stat_size_entry_t));
- table[hash]->key = key;
- table[hash]->value = value;
-}
-
-/*
- * A basic header of information wrapper allocator. Simply stores
- * information as a header, returns the memory + 1 past it, can be
- * retrieved again with - 1. Where type is stat_mem_block_t*.
- */
-void *stat_mem_allocate(size_t size, size_t line, const char *file) {
- stat_mem_block_t *info = (stat_mem_block_t*)malloc(sizeof(stat_mem_block_t) + size);
- void *data = (void*)(info + 1);
-
- if(!info)
- return NULL;
-
- info->line = line;
- info->size = size;
- info->file = file;
- info->prev = NULL;
- info->next = stat_mem_block_root;
-
- if (stat_mem_block_root)
- stat_mem_block_root->prev = info;
-
- stat_mem_block_root = info;
- stat_mem_allocated += size;
- stat_mem_high += size;
- stat_mem_allocated_total ++;
-
- if (stat_mem_high > stat_mem_peak)
- stat_mem_peak = stat_mem_high;
-
- return data;
-}
-
-void stat_mem_deallocate(void *ptr) {
- stat_mem_block_t *info = NULL;
-
- if (!ptr)
- return;
-
- info = ((stat_mem_block_t*)ptr - 1);
-
- stat_mem_deallocated += info->size;
- stat_mem_high -= info->size;
- stat_mem_deallocated_total ++;
-
- if (info->prev) info->prev->next = info->next;
- if (info->next) info->next->prev = info->prev;
-
- /* move ahead */
- if (info == stat_mem_block_root)
- stat_mem_block_root = info->next;
-
- free(info);
-}
-
-void *stat_mem_reallocate(void *ptr, size_t size, size_t line, const char *file) {
- stat_mem_block_t *oldinfo = NULL;
- stat_mem_block_t *newinfo;
-
- if (!ptr)
- return stat_mem_allocate(size, line, file);
-
- /* stay consistent with glic */
- if (!size) {
- stat_mem_deallocate(ptr);
- return NULL;
- }
-
- oldinfo = ((stat_mem_block_t*)ptr - 1);
- newinfo = ((stat_mem_block_t*)malloc(sizeof(stat_mem_block_t) + size));
-
- if (!newinfo) {
- stat_mem_deallocate(ptr);
- return NULL;
- }
-
- memcpy(newinfo+1, oldinfo+1, oldinfo->size);
-
- if (oldinfo->prev) oldinfo->prev->next = oldinfo->next;
- if (oldinfo->next) oldinfo->next->prev = oldinfo->prev;
-
- /* move ahead */
- if (oldinfo == stat_mem_block_root)
- stat_mem_block_root = oldinfo->next;
-
- newinfo->line = line;
- newinfo->size = size;
- newinfo->file = file;
- newinfo->prev = NULL;
- newinfo->next = stat_mem_block_root;
-
- if (stat_mem_block_root)
- stat_mem_block_root->prev = newinfo;
-
- stat_mem_block_root = newinfo;
- stat_mem_allocated -= oldinfo->size;
- stat_mem_high -= oldinfo->size;
- stat_mem_allocated += newinfo->size;
- stat_mem_high += newinfo->size;
-
- if (stat_mem_high > stat_mem_peak)
- stat_mem_peak = stat_mem_high;
-
- free(oldinfo);
-
- return newinfo + 1;
-}
-