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->headersize != mdp2->headersize){
134 fprintf(stderr, "Different size of the file header for the mapped files\n");
138 if(mdp1->refcount != mdp2->refcount){
139 fprintf(stderr, "Different number of processes that attached the heap\n");
143 if(strcmp(mdp1->magic, mdp2->magic) != 0){
144 fprintf(stderr,"Different magic number\n");
148 if(mdp1->flags != mdp2->flags){
149 fprintf(stderr,"Different flags\n");
153 if(mdp1->heapsize != mdp2->heapsize){
154 fprintf(stderr,"Different number of info entries\n");
158 if(mdp1->heapbase != mdp2->heapbase){
159 fprintf(stderr,"Different first block of the heap\n");
163 if(mdp1->heapindex != mdp2->heapindex){
164 fprintf(stderr,"Different index for the heap table : %zu - %zu\n", mdp1->heapindex, mdp2->heapindex);
168 if(mdp1->base != mdp2->base){
169 fprintf(stderr,"Different base address of the memory region\n");
173 if(mdp1->breakval != mdp2->breakval){
174 fprintf(stderr,"Different current location in the memory region\n");
178 if(mdp1->top != mdp2->top){
179 fprintf(stderr,"Different end of the current location in the memory region\n");
183 if(mdp1->heaplimit != mdp2->heaplimit){
184 fprintf(stderr,"Different limit of valid info table indices\n");
188 if(mdp1->fd != mdp2->fd){
189 fprintf(stderr,"Different file descriptor for the file to which this malloc heap is mapped\n");
193 if(mdp1->version != mdp2->version){
194 fprintf(stderr,"Different version of the mmalloc package\n");
199 void* s_heap = (char *)mmalloc_get_current_heap() - STD_HEAP_SIZE - getpagesize();
201 void *heapbase1 = (char *)mdp1 + BLOCKSIZE;
202 void *heapbase2 = (char *)mdp2 + BLOCKSIZE;
205 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
206 size_t frag_size = 0; /* FIXME: arbitrary initialization */
212 int total_distance = 0;
215 void *address_pointed1, *address_pointed2;
217 int block_pointed1, block_pointed2;
218 void *addr_block_pointed1, *addr_block_pointed2;
219 int frag_pointed1, frag_pointed2;
221 /* Check busy blocks*/
223 while(i < mdp1->heaplimit){
225 if(mdp1->heapinfo[i].type != mdp2->heapinfo[i].type){
226 fprintf(stderr,"Different type of block : %d - %d\n", mdp1->heapinfo[i].type, mdp2->heapinfo[i].type);
230 addr_block1 = (char*)heapbase1 + ((i-1)*BLOCKSIZE);
231 addr_block2 = (char*)heapbase2 + ((i-1)*BLOCKSIZE);
233 if(mdp1->heapinfo[i].type == 0){ /* busy large block */
235 if(mdp1->heapinfo[i].busy_block.size != mdp2->heapinfo[i].busy_block.size){
236 fprintf(stderr,"Different size of a large cluster : %zu - %zu\n", mdp1->heapinfo[i].busy_block.size, mdp2->heapinfo[i].busy_block.size);
241 if(mdp1->heapinfo[i].busy_block.busy_size != mdp2->heapinfo[i].busy_block.busy_size){
242 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);
248 /* Hamming distance on different blocks */
251 //for(k=0;k<mdp1->heapinfo[i].busy_block.size * BLOCKSIZE;k++){
252 for(k=0;k<mdp1->heapinfo[i].busy_block.busy_size;k++){
253 if(memcmp(((char *)addr_block1) + k, ((char *)addr_block2) + k, 1) != 0){
254 //fprintf(stderr, "Different byte (offset=%d) (%p - %p) in block %zu\n", k, (char *)addr_block1 + k, (char *)addr_block2 + k, i); fflush(NULL);
255 pointer_align = (k / sizeof(void*)) * sizeof(void*);
256 address_pointed1 = *((void **)((char *)addr_block1 + pointer_align));
257 address_pointed2 = *((void **)((char *)addr_block2 + pointer_align));
258 if(((address_pointed1 > (void *)s_heap) && (address_pointed1 < mdp1->breakval)) && ((address_pointed2 > (void *)s_heap) && (address_pointed2 < mdp2->breakval))){
259 block_pointed1 = ((char*)address_pointed1 - (char*)((struct mdesc*)s_heap)->heapbase) / BLOCKSIZE + 1;
260 block_pointed2 = ((char*)address_pointed2 - (char*)((struct mdesc*)s_heap)->heapbase) / BLOCKSIZE + 1;
261 //fprintf(stderr, "Blocks pointed : %d - %d\n", block_pointed1, block_pointed2);
262 if(mdp1->heapinfo[block_pointed1].type == mdp2->heapinfo[block_pointed2].type){
263 if(mdp1->heapinfo[block_pointed1].type == 0){ // Large block
264 while(mdp1->heapinfo[block_pointed1].busy_block.size == 0)
266 while(mdp2->heapinfo[block_pointed2].busy_block.size == 0)
268 if(mdp1->heapinfo[block_pointed1].busy_block.busy_size == mdp2->heapinfo[block_pointed2].busy_block.busy_size){
269 addr_block_pointed1 = (char*)heapbase1 + ((block_pointed1 - 1)*BLOCKSIZE);
270 addr_block_pointed2 = (char*)heapbase2 + ((block_pointed2 - 1)*BLOCKSIZE);
272 fprintf(stderr, "Memcmp between blocks %d and %d (size = %zu)\n", block_pointed1, block_pointed2, mdp1->heapinfo[block_pointed1].busy_block.busy_size);
273 if(memcmp(addr_block_pointed1, addr_block_pointed2, mdp1->heapinfo[block_pointed1].busy_block.busy_size) != 0){
276 fprintf(stderr, "False difference detected\n");
281 }else{ // Fragmented block
282 address_pointed1 = (char*)mdp1 + ((char*)address_pointed1 - (char*)s_heap);
283 address_pointed2 = (char*)mdp2 + ((char*)address_pointed2 - (char*)s_heap);
284 addr_block_pointed1 = (char*)heapbase1 + ((block_pointed1 - 1)*BLOCKSIZE);
285 addr_block_pointed2 = (char*)heapbase2 + ((block_pointed2 - 1)*BLOCKSIZE);
287 while(address_pointed1 > (void*)((char*)addr_block_pointed1 + ((frag_pointed1 +1 ) * frag_size))){
291 while(address_pointed2 > (void*)((char*)addr_block_pointed2 + ((frag_pointed2 +1) * frag_size))){
294 if(mdp1->heapinfo[block_pointed1].busy_frag.frag_size[frag_pointed1] == mdp2->heapinfo[block_pointed2].busy_frag.frag_size[frag_pointed2]){
295 fprintf(stderr, "Memcmp between fragments %d (block %d) and %d (block %d) (size = %d)\n", frag_pointed1, block_pointed1, frag_pointed2, block_pointed2, mdp1->heapinfo[block_pointed1].busy_frag.frag_size[frag_pointed1]);
296 if(memcmp((char*)addr_block_pointed1 + (frag_pointed1 * frag_size), (char*)addr_block_pointed2 + (frag_pointed2 * frag_size), mdp1->heapinfo[block_pointed1].busy_frag.frag_size[frag_pointed1]) != 0){
299 fprintf(stderr, "False difference detected\n");
319 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);
321 fprintf(stderr, "Hamming distance between blocks : %d\n", distance);
322 mmalloc_backtrace_block_display(mdp1, i);
323 mmalloc_backtrace_block_display(mdp2, i);
325 total_distance += distance;
333 if(mdp1->heapinfo[i].type > 0){ /* busy fragmented block */
335 if(mdp1->heapinfo[i].type != mdp2->heapinfo[i].type){
336 fprintf(stderr,"Different size of fragments in fragmented block %zu : %d - %d\n", i, mdp1->heapinfo[i].type, mdp2->heapinfo[i].type); fflush(NULL);
340 if(mdp1->heapinfo[i].busy_frag.nfree != mdp2->heapinfo[i].busy_frag.nfree){
341 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);
345 if(mdp1->heapinfo[i].busy_frag.first != mdp2->heapinfo[i].busy_frag.first){
346 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);
350 frag_size = pow(2, mdp1->heapinfo[i].type);
352 for(j=0; j< (BLOCKSIZE/frag_size); j++){
354 if(mdp1->heapinfo[i].busy_frag.frag_size[j] != mdp2->heapinfo[i].busy_frag.frag_size[j]){
355 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);
359 if(mdp1->heapinfo[i].busy_frag.frag_size[j] > 0){
361 addr_frag1 = (char *)addr_block1 + (j * frag_size);
362 addr_frag2 = (char *)addr_block2 + (j * frag_size);
365 /* Hamming distance on different blocks */
367 //for(k=0;k<frag_size;k++){
368 for(k=0;k<mdp1->heapinfo[i].busy_frag.frag_size[j];k++){
369 if(memcmp(((char *)addr_frag1) + k, ((char *)addr_frag2) + k, 1) != 0){
370 //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);
371 pointer_align = (k / sizeof(void*)) * sizeof(void*);
372 address_pointed1 = *((void **)((char *)addr_frag1 + pointer_align));
373 address_pointed2 = *((void **)((char *)addr_frag2 + pointer_align));
374 if(((address_pointed1 > (void *)s_heap) && (address_pointed1 < mdp1->breakval)) && ((address_pointed2 > (void *)s_heap) && (address_pointed2 < mdp2->breakval))){
375 block_pointed1 = ((char*)address_pointed1 - (char*)((struct mdesc*)s_heap)->heapbase) / BLOCKSIZE + 1;
376 block_pointed2 = ((char*)address_pointed2 - (char*)((struct mdesc*)s_heap)->heapbase) / BLOCKSIZE + 1;
377 //fprintf(stderr, "Blocks pointed : %d - %d\n", block_pointed1, block_pointed2);
378 if(mdp1->heapinfo[block_pointed1].type == mdp2->heapinfo[block_pointed2].type){
379 if(mdp1->heapinfo[block_pointed1].type == 0){ // Large block
380 while(mdp1->heapinfo[block_pointed1].busy_block.size == 0)
382 while(mdp2->heapinfo[block_pointed2].busy_block.size == 0)
384 if(mdp1->heapinfo[block_pointed1].busy_block.busy_size == mdp2->heapinfo[block_pointed2].busy_block.busy_size){
385 addr_block_pointed1 = (char*)heapbase1 + ((block_pointed1 - 1)*BLOCKSIZE);
386 addr_block_pointed2 = (char*)heapbase2 + ((block_pointed2 - 1)*BLOCKSIZE);
387 fprintf(stderr, "Memcmp between blocks %d and %d (size = %zu)\n", block_pointed1, block_pointed2, mdp1->heapinfo[block_pointed1].busy_block.busy_size);
388 if(memcmp(addr_block_pointed1, addr_block_pointed2, mdp1->heapinfo[block_pointed1].busy_block.busy_size) != 0){
391 fprintf(stderr, "False difference detected\n");
396 }else{ // Fragmented block
397 address_pointed1 = (char*)mdp1 + ((char*)address_pointed1 - (char*)s_heap);
398 address_pointed2 = (char*)mdp2 + ((char*)address_pointed2 - (char*)s_heap);
399 addr_block_pointed1 = (char*)heapbase1 + ((block_pointed1 - 1)*BLOCKSIZE);
400 addr_block_pointed2 = (char*)heapbase2 + ((block_pointed2 - 1)*BLOCKSIZE);
402 while(address_pointed1 > (void*)((char*)addr_block_pointed1 + ((frag_pointed1 + 1) * frag_size))){
406 while(address_pointed2 > (void*)((char*)addr_block_pointed2 + ((frag_pointed2 + 1) * frag_size))){
409 if(mdp1->heapinfo[block_pointed1].busy_frag.frag_size[frag_pointed1] == mdp2->heapinfo[block_pointed2].busy_frag.frag_size[frag_pointed2]){
410 fprintf(stderr, "Memcmp between fragments %d (block %d) and %d (block %d) (size = %d)\n", frag_pointed1, block_pointed1, frag_pointed2, block_pointed2, mdp1->heapinfo[block_pointed1].busy_frag.frag_size[frag_pointed1]);
411 if(memcmp((char*)addr_block_pointed1 + (frag_pointed1 * frag_size), (char*)addr_block_pointed2 + (frag_pointed2 * frag_size), mdp1->heapinfo[block_pointed1].busy_frag.frag_size[frag_pointed1]) != 0){
414 fprintf(stderr, "False difference detected\n");
431 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);
432 fprintf(stderr, "Hamming distance between fragments : %d\n", distance);
433 mmalloc_backtrace_fragment_display(mdp1, i, j);
434 mmalloc_backtrace_fragment_display(mdp2, i, j);
436 total_distance += distance;
445 }else{ /* free block */
456 fprintf(stderr, "Hamming distance between heap regions : %d\n", total_distance);
462 /* void *get_end_addr_heap(void *heap){ */
464 /* FILE *fp; /\* File pointer to process's proc maps file *\/ */
465 /* char *line = NULL; /\* Temporal storage for each line that is readed *\/ */
466 /* ssize_t read; /\* Number of bytes readed *\/ */
467 /* size_t n = 0; /\* Amount of bytes to read by getline *\/ */
469 /* fp = fopen("/proc/self/maps", "r"); */
472 /* perror("fopen failed"); */
475 /* xbt_dynar_t lfields = NULL; */
476 /* xbt_dynar_t start_end = NULL; */
477 /* void *start_addr; */
478 /* void *end_addr; */
480 /* while ((read = getline(&line, &n, fp)) != -1) { */
482 /* xbt_str_trim(line, NULL); */
483 /* xbt_str_strip_spaces(line); */
484 /* lfields = xbt_str_split(line,NULL); */
486 /* start_end = xbt_str_split(xbt_dynar_get_as(lfields, 0, char*), "-"); */
487 /* start_addr = (void *) strtoul(xbt_dynar_get_as(start_end, 0, char*), NULL, 16); */
488 /* end_addr = (void *) strtoul(xbt_dynar_get_as(start_end, 1, char*), NULL, 16); */
490 /* if(start_addr == heap){ */
493 /* xbt_dynar_reset(lfields); */
494 /* xbt_free(lfields); */
495 /* xbt_dynar_reset(start_end); */
496 /* xbt_free(start_end); */
497 /* return end_addr; */
502 /* xbt_dynar_reset(lfields); */
503 /* xbt_free(lfields); */
504 /* xbt_dynar_reset(start_end); */
505 /* xbt_free(start_end); */
514 void mmalloc_display_info_heap(xbt_mheap_t h){