2 * Copyright (C) 2012, 2013
6 * Permission is hereby granted, free of charge, to any person obtaining a copy of
7 * this software and associated documentation files (the "Software"), to deal in
8 * the Software without restriction, including without limitation the rights to
9 * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
10 * of the Software, and to permit persons to whom the Software is furnished to do
11 * so, subject to the following conditions:
13 * The above copyright notice and this permission notice shall be included in all
14 * copies or substantial portions of the Software.
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
19 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
31 * GMQCC performs tons of allocations, constructions, and crazyness
32 * all around. When trying to optimizes systems, or just get fancy
33 * statistics out of the compiler, it's often printf mess. This file
34 * implements the statistics system of the compiler. I.E the allocator
35 * we use to track allocations, and other systems of interest.
39 typedef struct stat_mem_block_s {
43 struct stat_mem_block_s *next;
44 struct stat_mem_block_s *prev;
50 } stat_size_entry_t, **stat_size_table_t;
52 static uint64_t stat_mem_allocated = 0;
53 static uint64_t stat_mem_deallocated = 0;
54 static uint64_t stat_mem_allocated_total = 0;
55 static uint64_t stat_mem_deallocated_total = 0;
56 static uint64_t stat_mem_high = 0;
57 static uint64_t stat_mem_peak = 0;
58 static uint64_t stat_mem_strdups = 0;
59 static uint64_t stat_used_strdups = 0;
60 static uint64_t stat_used_vectors = 0;
61 static uint64_t stat_used_hashtables = 0;
62 static uint64_t stat_type_vectors = 0;
63 static uint64_t stat_type_hashtables = 0;
64 static stat_size_table_t stat_size_vectors = NULL;
65 static stat_size_table_t stat_size_hashtables = NULL;
66 static stat_mem_block_t *stat_mem_block_root = NULL;
69 * A tiny size_t key-value hashtbale for tracking vector and hashtable
70 * sizes. We can use it for other things too, if we need to. This is
71 * very TIGHT, and efficent in terms of space though.
73 static stat_size_table_t stat_size_new(void) {
74 return (stat_size_table_t)memset(
75 mem_a(sizeof(stat_size_entry_t*) * ST_SIZE),
76 0, ST_SIZE * sizeof(stat_size_entry_t*)
80 static void stat_size_del(stat_size_table_t table) {
82 for (; i < ST_SIZE; i++) if(table[i]) mem_d(table[i]);
86 static stat_size_entry_t *stat_size_get(stat_size_table_t table, size_t key) {
87 size_t hash = (key % ST_SIZE);
88 while (table[hash] && table[hash]->key != key)
89 hash = (hash + 1) % ST_SIZE;
92 static void stat_size_put(stat_size_table_t table, size_t key, size_t value) {
93 size_t hash = (key % ST_SIZE);
94 while (table[hash] && table[hash]->key != key)
95 hash = (hash + 1) % ST_SIZE;
96 table[hash] = (stat_size_entry_t*)mem_a(sizeof(stat_size_entry_t));
97 table[hash]->key = key;
98 table[hash]->value = value;
102 * A basic header of information wrapper allocator. Simply stores
103 * information as a header, returns the memory + 1 past it, can be
104 * retrieved again with - 1. Where type is stat_mem_block_t*.
106 void *stat_mem_allocate(size_t size, size_t line, const char *file) {
107 stat_mem_block_t *info = (stat_mem_block_t*)malloc(sizeof(stat_mem_block_t) + size);
108 void *data = (void*)(info + 1);
110 if(GMQCC_UNLIKELY(!info))
117 info->next = stat_mem_block_root;
119 /* unlikely since it only happens once */
120 if (GMQCC_UNLIKELY(stat_mem_block_root != NULL))
121 stat_mem_block_root->prev = info;
123 stat_mem_block_root = info;
124 stat_mem_allocated += size;
125 stat_mem_high += size;
126 stat_mem_allocated_total ++;
128 if (stat_mem_high > stat_mem_peak)
129 stat_mem_peak = stat_mem_high;
134 void stat_mem_deallocate(void *ptr) {
135 stat_mem_block_t *info = NULL;
137 if (GMQCC_UNLIKELY(!ptr))
140 info = ((stat_mem_block_t*)ptr - 1);
142 stat_mem_deallocated += info->size;
143 stat_mem_high -= info->size;
144 stat_mem_deallocated_total ++;
146 if (info->prev) info->prev->next = info->next;
147 if (info->next) info->next->prev = info->prev;
150 if (info == stat_mem_block_root)
151 stat_mem_block_root = info->next;
156 void *stat_mem_reallocate(void *ptr, size_t size, size_t line, const char *file) {
157 stat_mem_block_t *oldinfo = NULL;
158 stat_mem_block_t *newinfo;
160 if (GMQCC_UNLIKELY(!ptr))
161 return stat_mem_allocate(size, line, file);
163 /* stay consistent with glibc */
164 if (GMQCC_UNLIKELY(!size)) {
165 stat_mem_deallocate(ptr);
169 oldinfo = ((stat_mem_block_t*)ptr - 1);
170 newinfo = ((stat_mem_block_t*)malloc(sizeof(stat_mem_block_t) + size));
172 if (GMQCC_UNLIKELY(!newinfo)) {
173 stat_mem_deallocate(ptr);
177 memcpy(newinfo+1, oldinfo+1, oldinfo->size);
179 if (oldinfo->prev) oldinfo->prev->next = oldinfo->next;
180 if (oldinfo->next) oldinfo->next->prev = oldinfo->prev;
183 if (oldinfo == stat_mem_block_root)
184 stat_mem_block_root = oldinfo->next;
186 newinfo->line = line;
187 newinfo->size = size;
188 newinfo->file = file;
189 newinfo->prev = NULL;
190 newinfo->next = stat_mem_block_root;
193 * likely since the only time there is no root is when it's
194 * being initialized first.
196 if (GMQCC_LIKELY(stat_mem_block_root != NULL))
197 stat_mem_block_root->prev = newinfo;
199 stat_mem_block_root = newinfo;
200 stat_mem_allocated -= oldinfo->size;
201 stat_mem_high -= oldinfo->size;
202 stat_mem_allocated += newinfo->size;
203 stat_mem_high += newinfo->size;
205 if (stat_mem_high > stat_mem_peak)
206 stat_mem_peak = stat_mem_high;
213 * strdup does it's own malloc, we need to track malloc. We don't want
214 * to overwrite malloc though, infact, we can't really hook it at all
215 * without library specific assumptions. So we re implement strdup.
217 char *stat_mem_strdup(const char *src, size_t line, const char *file, bool empty) {
225 if (((!empty) ? len : true) && (ptr = (char*)stat_mem_allocate(len + 1, line, file))) {
226 memcpy(ptr, src, len);
230 stat_used_strdups ++;
231 stat_mem_strdups += len;
236 * The reallocate function for resizing vectors.
238 void _util_vec_grow(void **a, size_t i, size_t s) {
239 vector_t *d = vec_meta(*a);
241 stat_size_entry_t *e = NULL;
245 m = 2 * d->allocated + i;
246 p = mem_r(d, s * m + sizeof(vector_t));
249 p = mem_a(s * m + sizeof(vector_t));
250 ((vector_t*)p)->used = 0;
254 if (!stat_size_vectors)
255 stat_size_vectors = stat_size_new();
257 if ((e = stat_size_get(stat_size_vectors, s))) {
260 stat_size_put(stat_size_vectors, s, 1); /* start off with 1 */
264 *a = (vector_t*)p + 1;
265 vec_meta(*a)->allocated = m;
269 * Hash table for generic data, based on dynamic memory allocations
270 * all around. This is the internal interface, please look for
271 * EXPOSED INTERFACE comment below
273 typedef struct hash_node_t {
274 char *key; /* the key for this node in table */
275 void *value; /* pointer to the data as void* */
276 struct hash_node_t *next; /* next node (linked list) */
280 * This is a patched version of the Murmur2 hashing function to use
281 * a proper pre-mix and post-mix setup. Infact this is Murmur3 for
282 * the most part just reinvented.
284 * Murmur 2 contains an inner loop such as:
297 * The two u32s that form the key are the same value x (pulled from data)
298 * this premix stage will perform the same results for both values. Unrolled
299 * this produces just:
309 * This appears to be fine, except what happens when m == 1? well x
310 * cancels out entierly, leaving just:
315 * So all keys hash to the same value, but how often does m == 1?
316 * well, it turns out testing x for all possible values yeilds only
317 * 172,013,942 unique results instead of 2^32. So nearly ~4.6 bits
318 * are cancelled out on average!
320 * This means we have a 14.5% (rounded) chance of colliding more, which
321 * results in another bucket/chain for the hashtable.
323 * We fix it buy upgrading the pre and post mix ssystems to align with murmur
327 #define GMQCC_ROTL32(X, R) (((X) << (R)) | ((X) >> (32 - (R))))
328 GMQCC_INLINE size_t util_hthash(hash_table_t *ht, const char *key) {
329 const unsigned char *data = (const unsigned char *)key;
330 const size_t len = strlen(key);
331 const size_t block = len / 4;
332 const uint32_t mask1 = 0xCC9E2D51;
333 const uint32_t mask2 = 0x1B873593;
334 const uint32_t *blocks = (const uint32_t*)(data + block * 4);
335 const unsigned char *tail = (const unsigned char *)(data + block * 4);
339 uint32_t h = 0x1EF0 ^ len;
341 for (i = -block; i; i++) {
344 k = GMQCC_ROTL32(k, 15);
347 h = GMQCC_ROTL32(h, 13);
348 h = h * 5 + 0xE6546B64;
360 k = GMQCC_ROTL32(k, 15);
372 return (size_t) (h % ht->size);
376 /* We keep the old for reference */
377 GMQCC_INLINE size_t util_hthash(hash_table_t *ht, const char *key) {
378 const uint32_t mix = 0x5BD1E995;
379 const uint32_t rot = 24;
380 size_t size = strlen(key);
381 uint32_t hash = 0x1EF0 /* LICRC TAB */ ^ size;
383 const unsigned char *data = (const unsigned char*)key;
386 alias = (data[0] | (data[1] << 8) | (data[2] << 16) | (data[3] << 24));
388 alias ^= alias >> rot;
399 case 3: hash ^= data[2] << 16;
400 case 2: hash ^= data[1] << 8;
401 case 1: hash ^= data[0];
409 return (size_t) (hash % ht->size);
413 static hash_node_t *_util_htnewpair(const char *key, void *value) {
415 if (!(node = (hash_node_t*)mem_a(sizeof(hash_node_t))))
418 if (!(node->key = util_strdupe(key))) {
430 * EXPOSED INTERFACE for the hashtable implementation
431 * util_htnew(size) -- to make a new hashtable
432 * util_htset(table, key, value, sizeof(value)) -- to set something in the table
433 * util_htget(table, key) -- to get something from the table
434 * util_htdel(table) -- to delete the table
436 hash_table_t *util_htnew(size_t size) {
437 hash_table_t *hashtable = NULL;
438 stat_size_entry_t *find = NULL;
443 if (!stat_size_hashtables)
444 stat_size_hashtables = stat_size_new();
446 if (!(hashtable = (hash_table_t*)mem_a(sizeof(hash_table_t))))
449 if (!(hashtable->table = (hash_node_t**)mem_a(sizeof(hash_node_t*) * size))) {
454 if ((find = stat_size_get(stat_size_hashtables, size)))
457 stat_type_hashtables++;
458 stat_size_put(stat_size_hashtables, size, 1);
461 hashtable->size = size;
462 memset(hashtable->table, 0, sizeof(hash_node_t*) * size);
464 stat_used_hashtables++;
468 void util_htseth(hash_table_t *ht, const char *key, size_t bin, void *value) {
469 hash_node_t *newnode = NULL;
470 hash_node_t *next = NULL;
471 hash_node_t *last = NULL;
473 next = ht->table[bin];
475 while (next && next->key && strcmp(key, next->key) > 0)
476 last = next, next = next->next;
478 /* already in table, do a replace */
479 if (next && next->key && strcmp(key, next->key) == 0) {
482 /* not found, grow a pair man :P */
483 newnode = _util_htnewpair(key, value);
484 if (next == ht->table[bin]) {
485 newnode->next = next;
486 ht->table[bin] = newnode;
488 last->next = newnode;
490 newnode->next = next;
491 last->next = newnode;
496 void util_htset(hash_table_t *ht, const char *key, void *value) {
497 util_htseth(ht, key, util_hthash(ht, key), value);
500 void *util_htgeth(hash_table_t *ht, const char *key, size_t bin) {
501 hash_node_t *pair = ht->table[bin];
503 while (pair && pair->key && strcmp(key, pair->key) > 0)
506 if (!pair || !pair->key || strcmp(key, pair->key) != 0)
512 void *util_htget(hash_table_t *ht, const char *key) {
513 return util_htgeth(ht, key, util_hthash(ht, key));
516 void *code_util_str_htgeth(hash_table_t *ht, const char *key, size_t bin);
517 void *code_util_str_htgeth(hash_table_t *ht, const char *key, size_t bin) {
522 keylen = strlen(key);
524 pair = ht->table[bin];
525 while (pair && pair->key) {
526 len = strlen(pair->key);
532 cmp = strcmp(key, pair->key);
540 cmp = strcmp(key, pair->key + len - keylen);
542 uintptr_t up = (uintptr_t)pair->value;
552 * Free all allocated data in a hashtable, this is quite the amount
555 void util_htrem(hash_table_t *ht, void (*callback)(void *data)) {
558 for (; i < ht->size; ++i) {
559 hash_node_t *n = ht->table[i];
579 void util_htrmh(hash_table_t *ht, const char *key, size_t bin, void (*cb)(void*)) {
580 hash_node_t **pair = &ht->table[bin];
583 while (*pair && (*pair)->key && strcmp(key, (*pair)->key) > 0)
584 pair = &(*pair)->next;
587 if (!tmp || !tmp->key || strcmp(key, tmp->key) != 0)
598 void util_htrm(hash_table_t *ht, const char *key, void (*cb)(void*)) {
599 util_htrmh(ht, key, util_hthash(ht, key), cb);
602 void util_htdel(hash_table_t *ht) {
603 util_htrem(ht, NULL);
607 * The following functions below implement printing / dumping of statistical
610 static void stat_dump_mem_contents(stat_mem_block_t *memory, uint16_t cols) {
612 for (i = 0; i < memory->size + ((memory->size % cols) ? (cols - memory->size % cols) : 0); i++) {
613 if (i % cols == 0) con_out(" 0x%06X: ", i);
614 if (i < memory->size) con_out("%02X " , 0xFF & ((unsigned char*)(memory + 1))[i]);
617 if ((uint16_t)(i % cols) == (cols - 1)) {
618 for (j = i - (cols - 1); j <= i; j++) {
622 : (util_isprint(((unsigned char*)(memory + 1))[j]))
623 ? 0xFF & ((unsigned char*)(memory + 1)) [j]
632 static void stat_dump_mem_leaks(void) {
633 stat_mem_block_t *info;
634 for (info = stat_mem_block_root; info; info = info->next) {
635 con_out("lost: %u (bytes) at %s:%u\n",
641 stat_dump_mem_contents(info, OPTS_OPTION_U16(OPTION_MEMDUMPCOLS));
645 static void stat_dump_mem_info(void) {
646 con_out("Memory Information:\n\
647 Total allocations: %llu\n\
648 Total deallocations: %llu\n\
649 Total allocated: %f (MB)\n\
650 Total deallocated: %f (MB)\n\
651 Total peak memory: %f (MB)\n\
652 Total leaked memory: %f (MB) in %llu allocations\n",
653 stat_mem_allocated_total,
654 stat_mem_deallocated_total,
655 (float)(stat_mem_allocated) / 1048576.0f,
656 (float)(stat_mem_deallocated) / 1048576.0f,
657 (float)(stat_mem_peak) / 1048576.0f,
658 (float)(stat_mem_allocated - stat_mem_deallocated) / 1048576.0f,
659 stat_mem_allocated_total - stat_mem_deallocated_total
663 static void stat_dump_stats_table(stat_size_table_t table, const char *string, uint64_t *size) {
669 for (i = 0, j = 1; i < ST_SIZE; i++) {
670 stat_size_entry_t *entry;
672 if (!(entry = table[i]))
675 con_out(string, (unsigned)j, (unsigned)entry->key, (unsigned)entry->value);
679 *size += entry->key * entry->value;
684 if (OPTS_OPTION_BOOL(OPTION_MEMCHK) ||
685 OPTS_OPTION_BOOL(OPTION_STATISTICS)) {
688 con_out("Memory Statistics:\n\
689 Total vectors allocated: %llu\n\
690 Total string duplicates: %llu\n\
691 Total string duplicate memory: %f (MB)\n\
692 Total hashtables allocated: %llu\n\
693 Total unique vector sizes: %llu\n",
696 (float)(stat_mem_strdups) / 1048576.0f,
697 stat_used_hashtables,
701 stat_dump_stats_table (
703 " %2u| # of %5u byte vectors: %u\n",
708 " Total unique hashtable sizes: %llu\n",
712 stat_dump_stats_table (
713 stat_size_hashtables,
714 " %2u| # of %5u element hashtables: %u\n",
719 " Total vector memory: %f (MB)\n\n",
720 (float)(mem) / 1048576.0f
724 if (stat_size_vectors)
725 stat_size_del(stat_size_vectors);
726 if (stat_size_hashtables)
727 stat_size_del(stat_size_hashtables);
729 if (OPTS_OPTION_BOOL(OPTION_DEBUG) ||
730 OPTS_OPTION_BOOL(OPTION_MEMCHK))
731 stat_dump_mem_info();
733 if (OPTS_OPTION_BOOL(OPTION_DEBUG))
734 stat_dump_mem_leaks();