1 /* mm_diff - Memory snapshooting and comparison */
3 /* Copyright (c) 2008-2012. The SimGrid Team. All rights reserved. */
5 /* This program is free software; you can redistribute it and/or modify it
6 * under the terms of the license (GNU LGPL) which comes with this package. */
8 #include "xbt/ex_interface.h" /* internals of backtrace setup */
12 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mm_diff, xbt,
13 "Logging specific to mm_diff in mmalloc");
15 extern char *xbt_binary_name;
17 void mmalloc_backtrace_display(xbt_mheap_t mdp, void *ptr){
18 size_t block = BLOCK(ptr);
22 if ((char *) ptr < (char *) mdp->heapbase || block > mdp->heapsize) {
23 fprintf(stderr,"Ouch, this pointer is not mine. I cannot display its backtrace. I refuse it to death!!\n");
27 type = mdp->heapinfo[block].type;
30 //fprintf(stderr,"Only full blocks are backtraced for now. Ignoring your request.\n");
33 if (mdp->heapinfo[block].busy_block.bt_size == 0) {
34 fprintf(stderr,"No backtrace available for that block, sorry.\n");
38 memcpy(&e.bt,&(mdp->heapinfo[block].busy_block.bt),sizeof(void*)*XBT_BACKTRACE_SIZE);
39 e.used = mdp->heapinfo[block].busy_block.bt_size;
41 xbt_ex_setup_backtrace(&e);
43 fprintf(stderr, "(backtrace not set)\n");
44 } else if (e.bt_strings == NULL) {
45 fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet");
49 fprintf(stderr, "Backtrace of where the block %p was malloced (%d frames):\n",ptr,e.used);
50 for (i = 0; i < e.used; i++) /* no need to display "xbt_backtrace_display" */{
51 fprintf(stderr,"%d",i);fflush(NULL);
52 fprintf(stderr, "---> %s\n", e.bt_strings[i] + 4);
58 void mmalloc_backtrace_block_display(xbt_mheap_t mdp, size_t block){
63 type = mdp->heapinfo[block].type;
66 fprintf(stderr,"Only full blocks are backtraced for now. Ignoring your request.\n");
69 if (mdp->heapinfo[block].busy_block.bt_size == 0) {
70 fprintf(stderr,"No backtrace available for that block, sorry.\n");
74 memcpy(&e.bt,&(mdp->heapinfo[block].busy_block.bt),sizeof(void*)*XBT_BACKTRACE_SIZE);
75 e.used = mdp->heapinfo[block].busy_block.bt_size;
77 xbt_ex_setup_backtrace(&e);
79 fprintf(stderr, "(backtrace not set)\n");
80 } else if (e.bt_strings == NULL) {
81 fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet");
85 fprintf(stderr, "Backtrace of where the block %zu was malloced (%d frames):\n", block ,e.used);
86 for (i = 0; i < e.used; i++) /* no need to display "xbt_backtrace_display" */{
87 fprintf(stderr,"%d",i);fflush(NULL);
88 fprintf(stderr, "---> %s\n", e.bt_strings[i] + 4);
93 void mmalloc_backtrace_fragment_display(xbt_mheap_t mdp, size_t block, size_t frag){
97 memcpy(&e.bt,&(mdp->heapinfo[block].busy_frag.bt[frag]),sizeof(void*)*XBT_BACKTRACE_SIZE);
98 e.used = XBT_BACKTRACE_SIZE;
100 xbt_ex_setup_backtrace(&e);
102 fprintf(stderr, "(backtrace not set)\n");
103 } else if (e.bt_strings == NULL) {
104 fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet");
108 fprintf(stderr, "Backtrace of where the fragment %zu in block %zu was malloced (%d frames):\n", frag, block ,e.used);
109 for (i = 0; i < e.used; i++) /* no need to display "xbt_backtrace_display" */{
110 fprintf(stderr,"%d",i);fflush(NULL);
111 fprintf(stderr, "---> %s\n", e.bt_strings[i] + 4);
116 int mmalloc_compare_heap(xbt_mheap_t mdp1, xbt_mheap_t mdp2){
118 if(mdp1 == NULL && mdp2 == NULL){
119 fprintf(stderr, "Malloc descriptors null\n");
123 int errors = mmalloc_compare_mdesc(mdp1, mdp2);
129 int mmalloc_compare_mdesc(struct mdesc *mdp1, struct mdesc *mdp2){
133 if(mdp1->heaplimit != mdp2->heaplimit){
134 fprintf(stderr,"Different limit of valid info table indices\n");
138 void* s_heap = (char *)mmalloc_get_current_heap() - STD_HEAP_SIZE - getpagesize();
140 void *heapbase1 = (char *)mdp1 + BLOCKSIZE;
141 void *heapbase2 = (char *)mdp2 + BLOCKSIZE;
143 void * breakval1 = (char *)mdp1 + ((char *)mdp1->breakval - (char *)s_heap);
144 void * breakval2 = (char *)mdp2 + ((char *)mdp2->breakval - (char *)s_heap);
147 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
154 int total_distance = 0;
157 void *address_pointed1, *address_pointed2;
159 int block_pointed1, block_pointed2, frag_pointed1, frag_pointed2;
160 void *addr_block_pointed1, *addr_block_pointed2;
162 /* Check busy blocks*/
164 while(i < mdp1->heaplimit){
166 if(mdp1->heapinfo[i].type != mdp2->heapinfo[i].type){
167 fprintf(stderr,"Different type of block : %d - %d\n", mdp1->heapinfo[i].type, mdp2->heapinfo[i].type);
171 /* Get address of block i in each heap */
172 addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase1));
173 xbt_assert(addr_block1 < breakval1, "Block address out of heap memory used");
175 addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase2));
176 xbt_assert(addr_block2 < breakval2, "Block address out of heap memory used");
178 if(mdp1->heapinfo[i].type == 0){ /* busy large block */
180 if(mdp1->heapinfo[i].busy_block.size != mdp2->heapinfo[i].busy_block.size){
181 fprintf(stderr,"Different size of a large cluster : %zu - %zu\n", mdp1->heapinfo[i].busy_block.size, mdp2->heapinfo[i].busy_block.size);
186 if(mdp1->heapinfo[i].busy_block.busy_size != mdp2->heapinfo[i].busy_block.busy_size){
187 fprintf(stderr,"Different busy_size of a large cluster : %zu - %zu\n", mdp1->heapinfo[i].busy_block.busy_size, mdp2->heapinfo[i].busy_block.busy_size);
192 /* Hamming distance on different blocks */
196 for(k=0;k<mdp1->heapinfo[i].busy_block.busy_size;k++){
198 if(memcmp(((char *)addr_block1) + k, ((char *)addr_block2) + k, 1) != 0){
200 fprintf(stderr, "Different byte (offset=%d) (%p - %p) in block %zu\n", k, (char *)addr_block1 + k, (char *)addr_block2 + k, i); fflush(NULL);
202 /* Check if pointer difference */
203 pointer_align = (k >> sizeof(void*)) * sizeof(void*);
204 address_pointed1 = *((void **)((char *)addr_block1 + pointer_align));
205 address_pointed2 = *((void **)((char *)addr_block2 + pointer_align));
207 fprintf(stderr, "Addresses pointed : %p - %p\n", address_pointed1, address_pointed2);
209 block_pointed1 = ((char*)address_pointed1 - (char*)((struct mdesc*)s_heap)->heapbase) / BLOCKSIZE + 1;
210 block_pointed2 = ((char*)address_pointed2 - (char*)((struct mdesc*)s_heap)->heapbase) / BLOCKSIZE + 1;
212 fprintf(stderr, "Blocks pointed : %d - %d\n", block_pointed1, block_pointed2);
214 if((char *) address_pointed1 < (char*)((struct mdesc*)s_heap)->heapbase || block_pointed1 > mdp1->heapsize || block_pointed1 < 1 || (char *) address_pointed2 < (char*)((struct mdesc*)s_heap)->heapbase || block_pointed2 > mdp2->heapsize || block_pointed2 < 1) {
215 fprintf(stderr, "Unknown pointer ! \n");
221 addr_block_pointed1 = ((void*) (((ADDR2UINT((size_t)block_pointed1)) - 1) * BLOCKSIZE + (char*)heapbase1));
222 addr_block_pointed2 = ((void*) (((ADDR2UINT((size_t)block_pointed2)) - 1) * BLOCKSIZE + (char*)heapbase2));
224 if(mdp1->heapinfo[block_pointed1].type == mdp2->heapinfo[block_pointed2].type){
226 if(mdp1->heapinfo[block_pointed1].type == 0){ // Large block
228 if(mdp1->heapinfo[block_pointed1].busy_block.busy_size == mdp2->heapinfo[block_pointed2].busy_block.busy_size){
230 if(memcmp(addr_block_pointed1, addr_block_pointed2, mdp1->heapinfo[block_pointed1].busy_block.busy_size) != 0){
233 fprintf(stderr, "False difference detected\n");
240 }else{ // Fragmented block
242 frag_pointed1 = ((char *)address_pointed1 - (char *)((void*) (((ADDR2UINT((size_t)block_pointed1)) - 1) * BLOCKSIZE + (char*)((struct mdesc*)s_heap)->heapbase))) / pow( 2, mdp1->heapinfo[block_pointed1].type);
243 frag_pointed2 = ((char *)address_pointed2 - (char *)((void*) (((ADDR2UINT((size_t)block_pointed2)) - 1) * BLOCKSIZE + (char*)((struct mdesc*)s_heap)->heapbase))) / pow( 2, mdp1->heapinfo[block_pointed1].type);
245 fprintf(stderr, "Fragments pointed : %d - %d\n", frag_pointed1, frag_pointed2);
247 if((frag_pointed1 < 0) || (frag_pointed1 > (BLOCKSIZE / pow( 2, mdp1->heapinfo[block_pointed1].type))) || (frag_pointed2 < 0) || (frag_pointed2 > (BLOCKSIZE / pow( 2, mdp1->heapinfo[block_pointed1].type)))){
248 fprintf(stderr, "Unknown pointer ! \n");
254 fprintf(stderr, "Size used in fragments pointed : %d - %d\n", mdp1->heapinfo[block_pointed1].busy_frag.frag_size[frag_pointed1], mdp2->heapinfo[block_pointed2].busy_frag.frag_size[frag_pointed2]);
256 if(mdp1->heapinfo[block_pointed1].busy_frag.frag_size[frag_pointed1] == mdp2->heapinfo[block_pointed2].busy_frag.frag_size[frag_pointed2]){
258 if(memcmp(addr_block_pointed1, addr_block_pointed2, mdp1->heapinfo[block_pointed1].busy_frag.frag_size[frag_pointed1]) != 0){
261 fprintf(stderr, "False difference detected\n");
270 fprintf(stderr, "Pointers on blocks with different types \n");
279 fprintf(stderr,"\nDifferent data in large block %zu (size = %zu (in blocks), busy_size = %zu (in bytes))\n", i, mdp1->heapinfo[i].busy_block.size, mdp1->heapinfo[i].busy_block.busy_size);
281 fprintf(stderr, "Hamming distance between blocks : %d\n", distance);
282 mmalloc_backtrace_block_display(mdp1, i);
283 mmalloc_backtrace_block_display(mdp2, i);
284 fprintf(stderr, "\n");
286 total_distance += distance;
293 if(mdp1->heapinfo[i].type > 0){ /* busy fragmented block */
295 if(mdp1->heapinfo[i].type != mdp2->heapinfo[i].type){
296 fprintf(stderr,"Different size of fragments in fragmented block %zu : %d - %d\n", i, mdp1->heapinfo[i].type, mdp2->heapinfo[i].type); fflush(NULL);
300 if(mdp1->heapinfo[i].busy_frag.nfree != mdp2->heapinfo[i].busy_frag.nfree){
301 fprintf(stderr,"Different free fragments in fragmented block %zu : %zu - %zu\n", i, mdp1->heapinfo[i].busy_frag.nfree, mdp2->heapinfo[i].busy_frag.nfree); fflush(NULL);
305 if(mdp1->heapinfo[i].busy_frag.first != mdp2->heapinfo[i].busy_frag.first){
306 fprintf(stderr,"Different busy_size of a large cluster : %zu - %zu\n", mdp1->heapinfo[i].busy_block.busy_size, mdp2->heapinfo[i].busy_block.busy_size); fflush(NULL);
310 frag_size = pow(2, mdp1->heapinfo[i].type);
312 for(j=0; j< (BLOCKSIZE/frag_size); j++){
314 if(mdp1->heapinfo[i].busy_frag.frag_size[j] != mdp2->heapinfo[i].busy_frag.frag_size[j]){
315 fprintf(stderr,"Different busy_size for fragment %zu in block %zu : %hu - %hu\n", j, i, mdp1->heapinfo[i].busy_frag.frag_size[j], mdp2->heapinfo[i].busy_frag.frag_size[j]); fflush(NULL);
319 if(mdp1->heapinfo[i].busy_frag.frag_size[j] > 0){
321 addr_frag1 = (char *)addr_block1 + (j * frag_size);
322 xbt_assert(addr_frag1 < breakval1, "Fragment address out of heap memory used");
324 addr_frag2 = (char *)addr_block2 + (j * frag_size);
325 xbt_assert(addr_frag1 < breakval1, "Fragment address out of heap memory used");
327 /* Hamming distance on different blocks */
330 for(k=0;k<mdp1->heapinfo[i].busy_frag.frag_size[j];k++){
332 if(memcmp(((char *)addr_frag1) + k, ((char *)addr_frag2) + k, 1) != 0){
334 fprintf(stderr, "Different byte (offset=%d) (%p - %p) in fragment %zu in block %zu\n", k, (char *)addr_frag1 + k, (char *)addr_frag2 + k, j, i); fflush(NULL);
336 pointer_align = (k / sizeof(void*)) * sizeof(void*);
337 address_pointed1 = *((void **)((char *)addr_frag1 + pointer_align));
338 address_pointed2 = *((void **)((char *)addr_frag2 + pointer_align));
340 fprintf(stderr, "Addresses pointed : %p - %p\n", address_pointed1, address_pointed2);
342 block_pointed1 = ((char*)address_pointed1 - (char*)((struct mdesc*)s_heap)->heapbase) / BLOCKSIZE + 1;
343 block_pointed2 = ((char*)address_pointed2 - (char*)((struct mdesc*)s_heap)->heapbase) / BLOCKSIZE + 1;
345 fprintf(stderr, "Blocks pointed : %d - %d\n", block_pointed1, block_pointed2);
347 if((char *) address_pointed1 < (char*)((struct mdesc*)s_heap)->heapbase || block_pointed1 > mdp1->heapsize || block_pointed1 < 1 || (char *) address_pointed2 < (char*)((struct mdesc*)s_heap)->heapbase || block_pointed2 > mdp2->heapsize || block_pointed2 < 1) {
348 fprintf(stderr, "Unknown pointer ! \n");
354 addr_block_pointed1 = ((void*) (((ADDR2UINT((size_t)block_pointed1)) - 1) * BLOCKSIZE + (char*)heapbase1));
355 addr_block_pointed2 = ((void*) (((ADDR2UINT((size_t)block_pointed2)) - 1) * BLOCKSIZE + (char*)heapbase2));
357 if(mdp1->heapinfo[block_pointed1].type == mdp2->heapinfo[block_pointed2].type){
359 if(mdp1->heapinfo[block_pointed1].type == 0){ // Large block
361 if(mdp1->heapinfo[block_pointed1].busy_block.busy_size == mdp2->heapinfo[block_pointed2].busy_block.busy_size){
363 if(memcmp(addr_block_pointed1, addr_block_pointed2, mdp1->heapinfo[block_pointed1].busy_block.busy_size) != 0){
366 fprintf(stderr, "False difference detected\n");
373 }else{ // Fragmented block
375 frag_pointed1 = ((char *)address_pointed1 - (char *)((void*) (((ADDR2UINT((size_t)block_pointed1)) - 1) * BLOCKSIZE + (char*)((struct mdesc*)s_heap)->heapbase))) / pow( 2, mdp1->heapinfo[block_pointed1].type);
376 frag_pointed2 = ((char *)address_pointed2 - (char *)((void*) (((ADDR2UINT((size_t)block_pointed2)) - 1) * BLOCKSIZE + (char*)((struct mdesc*)s_heap)->heapbase))) / pow( 2, mdp1->heapinfo[block_pointed1].type);
378 fprintf(stderr, "Fragments pointed : %d - %d\n", frag_pointed1, frag_pointed2);
380 if((frag_pointed1 < 0) || (frag_pointed1 > (BLOCKSIZE / pow( 2, mdp1->heapinfo[block_pointed1].type))) || (frag_pointed2 < 0) || (frag_pointed2 > (BLOCKSIZE / pow( 2, mdp1->heapinfo[block_pointed1].type)))){
381 fprintf(stderr, "Unknown pointer ! \n");
387 fprintf(stderr, "Size used in fragments pointed : %d - %d\n", mdp1->heapinfo[block_pointed1].busy_frag.frag_size[frag_pointed1], mdp2->heapinfo[block_pointed2].busy_frag.frag_size[frag_pointed2]);
389 if(mdp1->heapinfo[block_pointed1].busy_frag.frag_size[frag_pointed1] == mdp2->heapinfo[block_pointed2].busy_frag.frag_size[frag_pointed2]){
391 if(memcmp(addr_block_pointed1, addr_block_pointed2, mdp1->heapinfo[block_pointed1].busy_frag.frag_size[frag_pointed1]) != 0){
394 fprintf(stderr, "False difference detected\n");
403 fprintf(stderr, "Pointers on blocks with different types \n");
411 fprintf(stderr,"\nDifferent data in fragment %zu (size = %zu, size used = %hu) in block %zu \n", j, frag_size, mdp1->heapinfo[i].busy_frag.frag_size[j], i);
412 fprintf(stderr, "Hamming distance between fragments : %d\n", distance);
413 mmalloc_backtrace_fragment_display(mdp1, i, j);
414 mmalloc_backtrace_fragment_display(mdp2, i, j);
415 fprintf(stderr, "\n");
417 total_distance += distance;
426 }else{ /* free block */
437 fprintf(stderr, "Hamming distance between heap regions : %d\n", total_distance);
443 /* void *get_end_addr_heap(void *heap){ */
445 /* FILE *fp; /\* File pointer to process's proc maps file *\/ */
446 /* char *line = NULL; /\* Temporal storage for each line that is readed *\/ */
447 /* ssize_t read; /\* Number of bytes readed *\/ */
448 /* size_t n = 0; /\* Amount of bytes to read by getline *\/ */
450 /* fp = fopen("/proc/self/maps", "r"); */
453 /* perror("fopen failed"); */
456 /* xbt_dynar_t lfields = NULL; */
457 /* xbt_dynar_t start_end = NULL; */
458 /* void *start_addr; */
459 /* void *end_addr; */
461 /* while ((read = getline(&line, &n, fp)) != -1) { */
463 /* xbt_str_trim(line, NULL); */
464 /* xbt_str_strip_spaces(line); */
465 /* lfields = xbt_str_split(line,NULL); */
467 /* start_end = xbt_str_split(xbt_dynar_get_as(lfields, 0, char*), "-"); */
468 /* start_addr = (void *) strtoul(xbt_dynar_get_as(start_end, 0, char*), NULL, 16); */
469 /* end_addr = (void *) strtoul(xbt_dynar_get_as(start_end, 1, char*), NULL, 16); */
471 /* if(start_addr == heap){ */
474 /* xbt_dynar_reset(lfields); */
475 /* xbt_free(lfields); */
476 /* xbt_dynar_reset(start_end); */
477 /* xbt_free(start_end); */
478 /* return end_addr; */
483 /* xbt_dynar_reset(lfields); */
484 /* xbt_free(lfields); */
485 /* xbt_dynar_reset(start_end); */
486 /* xbt_free(start_end); */
495 void mmalloc_display_info_heap(xbt_mheap_t h){