|
| 1 | +#ifndef MEM_H |
| 2 | +#define MEM_H |
| 3 | + |
| 4 | +#include <cstdio> |
| 5 | +#include <cstdlib> |
| 6 | +#include <new> |
| 7 | +#include <cstdio> |
| 8 | +#include <map> |
| 9 | + |
| 10 | +constexpr unsigned long catalogue_range = 60000; |
| 11 | + |
| 12 | + |
| 13 | +struct MemoryUsage{ |
| 14 | + |
| 15 | + ~MemoryUsage(){PrintUsage("Destructor");} |
| 16 | + uint32_t total_allocated = 0; |
| 17 | + uint32_t total_freed = 0; |
| 18 | + |
| 19 | + uint32_t CurrentUsage(){return total_allocated - total_freed;} |
| 20 | + |
| 21 | + void PrintUsage(std::string label=""){ |
| 22 | + if(label!="") printf("(%s): ",label.c_str()); |
| 23 | + printf("total_allocated = %u, total_freed = %u, current_usage = %u\n", total_allocated, total_freed, CurrentUsage()); |
| 24 | + } |
| 25 | + |
| 26 | + void Clear(){ |
| 27 | + total_allocated = 0; |
| 28 | + total_freed = 0; |
| 29 | + } |
| 30 | + void CatalogueAdd(void* ptr, size_t size){ |
| 31 | + |
| 32 | + unsigned long i=0; |
| 33 | + for(; i<catalogue_range; i++){ |
| 34 | + if(catalogue_ptr[i]==0){ |
| 35 | + catalogue_ptr[i]=(unsigned long) ptr; |
| 36 | + catalogue_size[i]=size; |
| 37 | + break; |
| 38 | + } |
| 39 | + } |
| 40 | + if(i==catalogue_range) printf("INSUFFICENT CATALOGUE SIZE\n"); |
| 41 | + |
| 42 | + |
| 43 | + } |
| 44 | + |
| 45 | + unsigned long CatalogueDel(void* ptr){ |
| 46 | + unsigned long ret=0; |
| 47 | + unsigned long tmp_ptr=(unsigned long) ptr; |
| 48 | + unsigned long i=0; |
| 49 | + for(; i<catalogue_range; i++){ |
| 50 | + if(catalogue_ptr[i]==tmp_ptr){ |
| 51 | + ret = catalogue_size[i]; |
| 52 | + catalogue_ptr[i]=0; |
| 53 | + catalogue_size[i]=0; |
| 54 | + break; |
| 55 | + |
| 56 | + } |
| 57 | + } |
| 58 | + if(i==catalogue_range) printf("NOT KNOWN IN CATALOGUE (probably trying to delete twice)\n"); |
| 59 | + return ret; |
| 60 | + |
| 61 | + } |
| 62 | + |
| 63 | + unsigned long catalogue_ptr[catalogue_range]; |
| 64 | + unsigned long catalogue_size[catalogue_range]; |
| 65 | + |
| 66 | +}; |
| 67 | + |
| 68 | +static MemoryUsage memory_usage; |
| 69 | + |
| 70 | +/* |
| 71 | + void* operator new(size_t size){ |
| 72 | + printf("calling new\n"); |
| 73 | + |
| 74 | + memory_usage.total_allocated += size; |
| 75 | + |
| 76 | + return malloc(size); |
| 77 | + } |
| 78 | + |
| 79 | + void operator delete (void* memory, size_t size){ |
| 80 | + printf("calling delete\n"); |
| 81 | + memory_usage.total_freed += size; |
| 82 | + |
| 83 | + free(memory); |
| 84 | + } |
| 85 | +
|
| 86 | + void operator delete[] (void* memory, size_t size){ |
| 87 | + printf("calling delete[]\n"); |
| 88 | + memory_usage.total_freed += size; |
| 89 | + |
| 90 | + ::delete[](memory); |
| 91 | + } |
| 92 | +
|
| 93 | +
|
| 94 | +void operator delete (void* memory){ |
| 95 | + printf("calling delete no size\n"); |
| 96 | +
|
| 97 | + free(memory); |
| 98 | + } |
| 99 | +
|
| 100 | +
|
| 101 | +void operator delete[] (void* memory){ |
| 102 | + printf("calling delete[] no size\n"); |
| 103 | +
|
| 104 | + ::delete[] (memory); |
| 105 | + } |
| 106 | +*/ |
| 107 | + |
| 108 | + |
| 109 | +// no inline, required by [replacement.functions]/3 |
| 110 | +void* operator new(std::size_t sz) |
| 111 | +{ |
| 112 | + memory_usage.total_allocated += sz; |
| 113 | + void* tmp= std::malloc(sz); |
| 114 | + // std::printf("1) new(size_t), size = %zu p =%p\n", sz,tmp); |
| 115 | + memory_usage.CatalogueAdd(tmp,sz); |
| 116 | + return tmp; |
| 117 | + /* |
| 118 | + if (sz == 0) |
| 119 | + ++sz; // avoid std::malloc(0) which may return nullptr on success |
| 120 | + |
| 121 | + if (void *ptr = std::malloc(sz)) |
| 122 | + return ptr; |
| 123 | + |
| 124 | + throw std::bad_alloc{}; // required by [new.delete.single]/3 |
| 125 | + */ |
| 126 | +} |
| 127 | + |
| 128 | +// no inline, required by [replacement.functions]/3 |
| 129 | +void* operator new[](std::size_t sz) |
| 130 | +{ |
| 131 | + void* tmp = std::malloc(sz); |
| 132 | + memory_usage.CatalogueAdd(tmp,sz); |
| 133 | + //std::printf("2) new[](size_t), size = %zu, p = %p\n", sz, tmp); |
| 134 | + memory_usage.total_allocated += sz; |
| 135 | + return tmp; |
| 136 | + /*if (sz == 0) |
| 137 | + ++sz; // avoid std::malloc(0) which may return nullptr on success |
| 138 | + |
| 139 | + if (void *ptr = std::malloc(sz)) |
| 140 | + return ptr; |
| 141 | + |
| 142 | + throw std::bad_alloc{}; // required by [new.delete.single]/3 |
| 143 | + */ |
| 144 | +} |
| 145 | + |
| 146 | +void operator delete(void* ptr) noexcept |
| 147 | +{ |
| 148 | + // std::printf("3) delete(void*) p=%p\n",ptr); |
| 149 | + memory_usage.total_freed += memory_usage.CatalogueDel(ptr); |
| 150 | + |
| 151 | + |
| 152 | + std::free(ptr); |
| 153 | +} |
| 154 | +void operator delete(void* ptr, std::size_t size) noexcept; |
| 155 | +void operator delete(void* ptr, std::size_t size) noexcept |
| 156 | +{ |
| 157 | + //std::printf("4) delete(void*, size_t), size = %zu\n", size); |
| 158 | + memory_usage.total_freed += size; |
| 159 | + memory_usage.CatalogueDel(ptr); |
| 160 | + std::free(ptr); |
| 161 | +} |
| 162 | + |
| 163 | +void operator delete[](void* ptr) noexcept |
| 164 | +{ |
| 165 | + unsigned long size=memory_usage.CatalogueDel(ptr); |
| 166 | + //std::printf("5) delete[](void* ptr) p = %p, size = %u\n", ptr, size); |
| 167 | + memory_usage.total_freed += size; |
| 168 | + std::free(ptr); |
| 169 | +} |
| 170 | + |
| 171 | +void operator delete[](void* ptr, std::size_t size) noexcept; |
| 172 | +void operator delete[](void* ptr, std::size_t size) noexcept |
| 173 | +{ |
| 174 | + //std::printf("6) delete[](void*, size_t), size = %zu\n", size); |
| 175 | + memory_usage.total_freed += size; |
| 176 | + memory_usage.CatalogueDel(ptr); |
| 177 | + std::free(ptr); |
| 178 | +} |
| 179 | + |
| 180 | + |
| 181 | + |
| 182 | +#endif |
0 commit comments