mem_check.cc 6.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326
  1. /*
  2. * Copyright [2021] JD.com, Inc.
  3. *
  4. * Licensed under the Apache License, Version 2.0 (the "License");
  5. * you may not use this file except in compliance with the License.
  6. * You may obtain a copy of the License at
  7. *
  8. * http://www.apache.org/licenses/LICENSE-2.0
  9. *
  10. * Unless required by applicable law or agreed to in writing, software
  11. * distributed under the License is distributed on an "AS IS" BASIS,
  12. * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  13. * See the License for the specific language governing permissions and
  14. * limitations under the License.
  15. */
  16. #include <malloc.h>
  17. #include <string.h>
  18. #if MEMCHECK
  19. #include <map>
  20. #include "lock/lock.h"
  21. #include "log/log.h"
  22. #define HASHBASE 4097
  23. static Mutex lock;
  24. struct location_t {
  25. const char *ret;
  26. int ln;
  27. };
  28. struct location_cmp {
  29. bool operator()(const location_t &a, const location_t &b) const
  30. {
  31. return a.ret < b.ret || (a.ret == b.ret && a.ln < b.ln) ? true :
  32. false;
  33. }
  34. };
  35. struct count_t {
  36. unsigned long count;
  37. unsigned long size;
  38. void add(unsigned long s)
  39. {
  40. count++;
  41. size += s;
  42. }
  43. };
  44. struct slot_t {
  45. struct slot_t *next;
  46. void *ptr;
  47. size_t size;
  48. struct location_t loc;
  49. };
  50. static struct slot_t *freelist;
  51. static struct slot_t *usedlist[HASHBASE];
  52. static int bypass = 1;
  53. static unsigned long totalsize;
  54. static unsigned long maxsize;
  55. void add_ptr(void *ptr, size_t size, const char *ret, int ln)
  56. {
  57. struct slot_t *s = freelist;
  58. if (s)
  59. freelist = s->next;
  60. else
  61. s = (struct slot_t *)malloc(sizeof(struct slot_t));
  62. unsigned n = ((unsigned long)ptr) % HASHBASE;
  63. s->ptr = ptr;
  64. s->size = size;
  65. s->loc.ret = ret;
  66. s->loc.ln = ln;
  67. s->next = usedlist[n];
  68. usedlist[n] = s;
  69. totalsize += size;
  70. if (size >= 1 << 20)
  71. log4cplus_debug("large memory allocated size=%ld", (long)size);
  72. if (totalsize > maxsize)
  73. maxsize = totalsize;
  74. }
  75. void del_ptr(void *ptr)
  76. {
  77. unsigned n = ((unsigned long)ptr) % HASHBASE;
  78. struct slot_t **ps = &usedlist[n];
  79. while (*ps) {
  80. if ((*ps)->ptr == ptr) {
  81. struct slot_t *s = *ps;
  82. totalsize -= s->size;
  83. *ps = s->next;
  84. s->next = freelist;
  85. freelist = s;
  86. return;
  87. }
  88. ps = &(*ps)->next;
  89. }
  90. }
  91. void enable_memchecker(void)
  92. {
  93. bypass = 0;
  94. }
  95. void dump_non_delete(void)
  96. {
  97. bypass = 1;
  98. while (freelist) {
  99. struct slot_t *s = freelist;
  100. freelist = freelist->next;
  101. free(s);
  102. }
  103. std::map<location_t, count_t, location_cmp> m;
  104. for (unsigned int n = 0; n < HASHBASE; n++) {
  105. while (usedlist[n]) {
  106. struct slot_t *s = usedlist[n];
  107. usedlist[n] = s->next;
  108. m[s->loc].add(s->size);
  109. free(s);
  110. }
  111. }
  112. for (std::map<location_t, count_t, location_cmp>::iterator i =
  113. m.begin();
  114. i != m.end(); i++) {
  115. const location_t &loc = i->first;
  116. const count_t &val = i->second;
  117. if (loc.ln == 0)
  118. log4cplus_info("remain %ld %ld ret@%p", val.count,
  119. val.size, loc.ret);
  120. else
  121. log4cplus_info("remain %ld %ld %s(%d)", val.count,
  122. val.size, loc.ret, loc.ln);
  123. }
  124. log4cplus_info("Maximum Memory allocated: %lu\n", maxsize);
  125. }
  126. void report_mallinfo(void)
  127. {
  128. struct mallinfo mi = mallinfo();
  129. log4cplus_debug("mallinfo. arena: %d\n", mi.arena);
  130. log4cplus_debug("mallinfo. ordblks: %d\n", mi.ordblks);
  131. log4cplus_debug("mallinfo. smblks: %d\n", mi.smblks);
  132. log4cplus_debug("mallinfo. hblks: %d\n", mi.hblks);
  133. log4cplus_debug("mallinfo. usmblks: %d\n", mi.usmblks);
  134. log4cplus_debug("mallinfo. fsmblks: %d\n", mi.fsmblks);
  135. log4cplus_debug("mallinfo.uordblks: %d\n", mi.uordblks);
  136. log4cplus_debug("mallinfo.fordblks: %d\n", mi.fordblks);
  137. log4cplus_debug("mallinfo.keepcost: %d\n", mi.keepcost);
  138. }
  139. unsigned long count_virtual_size(void)
  140. {
  141. FILE *fp = fopen("/proc/self/maps", "r");
  142. char buf[256];
  143. buf[sizeof(buf) - 1] = '\0';
  144. unsigned long total = 0;
  145. while (fgets(buf, sizeof(buf) - 1, fp) != NULL) {
  146. unsigned long start, end;
  147. char r, w, x, p;
  148. if (sscanf(buf, "%lx-%lx %c%c%c%c", &start, &end, &r, &w, &x,
  149. &p) != 6)
  150. continue;
  151. if (r == '-' && w == '-' && x == '-')
  152. continue;
  153. if (r != 'r')
  154. continue;
  155. if (p == 's')
  156. continue;
  157. total += end - start;
  158. }
  159. fclose(fp);
  160. return total;
  161. }
  162. unsigned long count_alloc_size(void)
  163. {
  164. return totalsize;
  165. }
  166. void *operator new(size_t size)
  167. {
  168. const char *ret = (const char *)__builtin_return_address(0);
  169. ScopedLock a(lock);
  170. void *p = malloc(size);
  171. if (bypass == 0) {
  172. if (p == NULL)
  173. log4cplus_error("ret@%p: operator new(%ld) failed", ret,
  174. (long)size);
  175. else
  176. add_ptr(p, size, ret, 0);
  177. }
  178. return p;
  179. }
  180. void operator delete(void *p)
  181. {
  182. ScopedLock a(lock);
  183. if (bypass == 0) {
  184. if (p)
  185. del_ptr(p);
  186. }
  187. return free(p);
  188. }
  189. void *operator new[](size_t size)
  190. {
  191. const char *ret = (const char *)__builtin_return_address(0);
  192. ScopedLock a(lock);
  193. void *p = malloc(size);
  194. if (bypass == 0) {
  195. if (p == NULL)
  196. log4cplus_error("ret@%p: operator new(%ld) failed", ret,
  197. (long)size);
  198. else
  199. add_ptr(p, size, ret, 0);
  200. }
  201. return p;
  202. }
  203. void operator delete[](void *p)
  204. {
  205. ScopedLock a(lock);
  206. if (bypass == 0) {
  207. if (p)
  208. del_ptr(p);
  209. }
  210. return free(p);
  211. }
  212. extern "C" void *malloc_debug(size_t size, const char *fn, int ln)
  213. {
  214. ScopedLock a(lock);
  215. void *p = malloc(size);
  216. if (bypass == 0) {
  217. if (p == NULL)
  218. log4cplus_error("%s(%d): malloc(%ld) failed", fn, ln,
  219. (long)size);
  220. else
  221. add_ptr(p, size, fn, ln);
  222. }
  223. return p;
  224. }
  225. extern "C" void *calloc_debug(size_t size, size_t nmem, const char *fn, int ln)
  226. {
  227. ScopedLock a(lock);
  228. void *p = calloc(size, nmem);
  229. if (bypass == 0) {
  230. if (p == NULL)
  231. log4cplus_error("%s(%d): calloc(%ld, %ld) failed", fn,
  232. ln, (long)size, (long)nmem);
  233. else
  234. add_ptr(p, size * nmem, fn, ln);
  235. }
  236. return p;
  237. }
  238. extern "C" void *realloc_debug(void *o, size_t size, const char *fn, int ln)
  239. {
  240. ScopedLock a(lock);
  241. void *p = realloc(o, size);
  242. if (bypass == 0) {
  243. if (p == NULL)
  244. log4cplus_error("%s(%d): realloc(%p, %ld) failed", fn,
  245. ln, o, (long)size);
  246. else {
  247. del_ptr(o);
  248. add_ptr(p, size, fn, ln);
  249. }
  250. }
  251. return p;
  252. }
  253. extern "C" char *strdup_debug(const char *o, const char *fn, int ln)
  254. {
  255. ScopedLock a(lock);
  256. char *p = strdup(o);
  257. if (bypass == 0) {
  258. long size = strlen(o) + 1;
  259. if (p == NULL)
  260. log4cplus_error("%s(%d): strdup(%ld) failed", fn, ln,
  261. size);
  262. else
  263. add_ptr(p, size, fn, ln);
  264. }
  265. return p;
  266. }
  267. extern "C" void free_debug(void *p, const char *fn, int lnp)
  268. {
  269. ScopedLock a(lock);
  270. if (bypass == 0) {
  271. if (p)
  272. del_ptr(p);
  273. }
  274. return free(p);
  275. }
  276. #else
  277. void *operator new(size_t size)
  278. {
  279. return calloc(1, size);
  280. }
  281. void operator delete(void *p)
  282. {
  283. return free(p);
  284. }
  285. void dump_non_delete(void)
  286. {
  287. }
  288. #endif