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 */
11 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mm_diff, xbt,
12 "Logging specific to mm_diff in mmalloc");
14 extern char *xbt_binary_name;
16 void mmalloc_backtrace_display(xbt_mheap_t mdp, void *ptr){
17 size_t block = BLOCK(ptr);
21 if ((char *) ptr < (char *) mdp->heapbase || block > mdp->heapsize) {
22 fprintf(stderr,"Ouch, this pointer is not mine. I cannot display its backtrace. I refuse it to death!!\n");
26 type = mdp->heapinfo[block].type;
29 //fprintf(stderr,"Only full blocks are backtraced for now. Ignoring your request.\n");
32 if (mdp->heapinfo[block].busy_block.bt_size == 0) {
33 fprintf(stderr,"No backtrace available for that block, sorry.\n");
37 memcpy(&e.bt,&(mdp->heapinfo[block].busy_block.bt),sizeof(void*)*XBT_BACKTRACE_SIZE);
38 e.used = mdp->heapinfo[block].busy_block.bt_size;
40 xbt_ex_setup_backtrace(&e);
42 fprintf(stderr, "(backtrace not set)\n");
43 } else if (e.bt_strings == NULL) {
44 fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet");
48 fprintf(stderr, "Backtrace of where the block %p was malloced (%d frames):\n",ptr,e.used);
49 for (i = 0; i < e.used; i++) /* no need to display "xbt_backtrace_display" */{
50 fprintf(stderr,"%d",i);fflush(NULL);
51 fprintf(stderr, "---> %s\n", e.bt_strings[i] + 4);
57 void mmalloc_backtrace_block_display(xbt_mheap_t mdp, size_t block){
62 type = mdp->heapinfo[block].type;
65 fprintf(stderr,"Only full blocks are backtraced for now. Ignoring your request.\n");
68 if (mdp->heapinfo[block].busy_block.bt_size == 0) {
69 fprintf(stderr,"No backtrace available for that block, sorry.\n");
73 memcpy(&e.bt,&(mdp->heapinfo[block].busy_block.bt),sizeof(void*)*XBT_BACKTRACE_SIZE);
74 e.used = mdp->heapinfo[block].busy_block.bt_size;
76 xbt_ex_setup_backtrace(&e);
78 fprintf(stderr, "(backtrace not set)\n");
79 } else if (e.bt_strings == NULL) {
80 fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet");
84 fprintf(stderr, "Backtrace of where the block %zu was malloced (%d frames):\n", block ,e.used);
85 for (i = 0; i < e.used; i++) /* no need to display "xbt_backtrace_display" */{
86 fprintf(stderr,"%d",i);fflush(NULL);
87 fprintf(stderr, "---> %s\n", e.bt_strings[i] + 4);
92 void mmalloc_backtrace_fragment_display(xbt_mheap_t mdp, size_t block, size_t frag){
96 memcpy(&e.bt,&(mdp->heapinfo[block].busy_frag.bt[frag]),sizeof(void*)*XBT_BACKTRACE_SIZE);
97 e.used = XBT_BACKTRACE_SIZE;
99 xbt_ex_setup_backtrace(&e);
101 fprintf(stderr, "(backtrace not set)\n");
102 } else if (e.bt_strings == NULL) {
103 fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet");
107 fprintf(stderr, "Backtrace of where the fragment %zu in block %zu was malloced (%d frames):\n", frag, block ,e.used);
108 for (i = 0; i < e.used; i++) /* no need to display "xbt_backtrace_display" */{
109 fprintf(stderr,"%d",i);fflush(NULL);
110 fprintf(stderr, "---> %s\n", e.bt_strings[i] + 4);
115 int mmalloc_compare_heap(xbt_mheap_t mdp1, xbt_mheap_t mdp2){
117 if(mdp1 == NULL && mdp2 == NULL){
118 fprintf(stderr, "Malloc descriptors null\n");
122 int errors = mmalloc_compare_mdesc(mdp1, mdp2);
128 int mmalloc_compare_mdesc(struct mdesc *mdp1, struct mdesc *mdp2){
132 /*if(mdp1->headersize != mdp2->headersize){
133 fprintf(stderr, "Different size of the file header for the mapped files\n");
137 if(mdp1->refcount != mdp2->refcount){
138 fprintf(stderr, "Different number of processes that attached the heap\n");
142 if(strcmp(mdp1->magic, mdp2->magic) != 0){
143 fprintf(stderr,"Different magic number\n");
147 if(mdp1->flags != mdp2->flags){
148 fprintf(stderr,"Different flags\n");
152 if(mdp1->heapsize != mdp2->heapsize){
153 fprintf(stderr,"Different number of info entries\n");
157 if(mdp1->heapbase != mdp2->heapbase){
158 fprintf(stderr,"Different first block of the heap\n");
162 if(mdp1->heapindex != mdp2->heapindex){
163 fprintf(stderr,"Different index for the heap table : %zu - %zu\n", mdp1->heapindex, mdp2->heapindex);
167 if(mdp1->base != mdp2->base){
168 fprintf(stderr,"Different base address of the memory region\n");
172 if(mdp1->breakval != mdp2->breakval){
173 fprintf(stderr,"Different current location in the memory region\n");
177 if(mdp1->top != mdp2->top){
178 fprintf(stderr,"Different end of the current location in the memory region\n");
182 if(mdp1->heaplimit != mdp2->heaplimit){
183 fprintf(stderr,"Different limit of valid info table indices\n");
187 if(mdp1->fd != mdp2->fd){
188 fprintf(stderr,"Different file descriptor for the file to which this malloc heap is mapped\n");
192 if(mdp1->version != mdp2->version){
193 fprintf(stderr,"Different version of the mmalloc package\n");
197 //void* heapbase1 = (char *)mdp1 + ((char *)mdp1->heapbase - (char *)s_heap);
198 //void* heapbase2 = (char *)mdp2 + ((char *)mdp2->heapbase - (char *)s_heap);
200 xbt_mheap_t s_heap = mmalloc_get_current_heap();
202 void *heapbase1 = (char *)mdp1 + BLOCKSIZE;
203 void *heapbase2 = (char *)mdp2 + BLOCKSIZE;
206 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
207 size_t frag_size = 0; /* FIXME: arbitrary initialization */
208 /* size_t frag_size_pointed; FIXME: unused */
214 int total_distance = 0;
216 void *end_heap = get_end_addr_heap(s_heap);
219 void *address_pointed1, *address_pointed2;
221 int block_pointed1, block_pointed2;
222 void *addr_block_pointed1, *addr_block_pointed2;
223 int frag_pointed1, frag_pointed2;
227 /* Check busy blocks*/
229 while(i < mdp1->heaplimit){
231 if(mdp1->heapinfo[i].type != mdp2->heapinfo[i].type){
232 fprintf(stderr,"Different type of block : %d - %d\n", mdp1->heapinfo[i].type, mdp2->heapinfo[i].type);
236 //fprintf(stderr, "i = %zu, type = %d", i, mdp1->heapinfo[i].type);
238 //addr_block1 = (void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase1);
239 //addr_block2 = (void*) (((ADDR2UINT(1)) - 1) * BLOCKSIZE + (char*)heapbase2);
241 addr_block1 = (char*)heapbase1 + ((i-1)*BLOCKSIZE);
242 addr_block2 = (char*)heapbase2 + ((i-1)*BLOCKSIZE);
244 if(mdp1->heapinfo[i].type == 0){ /* busy large block */
246 if(mdp1->heapinfo[i].busy_block.size != mdp2->heapinfo[i].busy_block.size){
247 fprintf(stderr,"Different size of a large cluster : %zu - %zu\n", mdp1->heapinfo[i].busy_block.size, mdp2->heapinfo[i].busy_block.size);
252 if(mdp1->heapinfo[i].busy_block.busy_size != mdp2->heapinfo[i].busy_block.busy_size){
253 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);
259 /* Hamming distance on different blocks */
262 //for(k=0;k<mdp1->heapinfo[i].busy_block.size * BLOCKSIZE;k++){
263 for(k=0;k<mdp1->heapinfo[i].busy_block.busy_size;k++){
264 if(memcmp(((char *)addr_block1) + k, ((char *)addr_block2) + k, 1) != 0){
265 //fprintf(stderr, "Different byte (offset=%d) (%p - %p) in block %zu\n", k, (char *)addr_block1 + k, (char *)addr_block2 + k, i); fflush(NULL);
266 pointer_align = (k / sizeof(void*)) * sizeof(void*);
267 address_pointed1 = *((void **)((char *)addr_block1 + pointer_align));
268 address_pointed2 = *((void **)((char *)addr_block2 + pointer_align));
269 if(((address_pointed1 > (void *)s_heap) && (address_pointed1 < end_heap)) && ((address_pointed2 > (void *)s_heap) && (address_pointed2 < end_heap))){
270 block_pointed1 = ((char*)address_pointed1 - (char*)((struct mdesc*)s_heap)->heapbase) / BLOCKSIZE + 1;
271 block_pointed2 = ((char*)address_pointed2 - (char*)((struct mdesc*)s_heap)->heapbase) / BLOCKSIZE + 1;
272 //fprintf(stderr, "Blocks pointed : %d - %d\n", block_pointed1, block_pointed2);
273 if(mdp1->heapinfo[block_pointed1].type == mdp2->heapinfo[block_pointed2].type){
274 if(mdp1->heapinfo[block_pointed1].type == 0){ // Large block
275 while(mdp1->heapinfo[block_pointed1].busy_block.size == 0)
277 while(mdp2->heapinfo[block_pointed2].busy_block.size == 0)
279 if(mdp1->heapinfo[block_pointed1].busy_block.busy_size == mdp2->heapinfo[block_pointed2].busy_block.busy_size){
280 //addr_block_pointed1 = (void*) (((ADDR2UINT((size_t)block_pointed1)) - 1) * BLOCKSIZE + (char*)heapbase1);
281 //addr_block_pointed2 = (void*) (((ADDR2UINT((size_t)block_pointed2)) - 1) * BLOCKSIZE + (char*)heapbase2);
282 addr_block_pointed1 = (char*)heapbase1 + ((block_pointed1 - 1)*BLOCKSIZE);
283 addr_block_pointed2 = (char*)heapbase2 + ((block_pointed2 - 1)*BLOCKSIZE);
285 fprintf(stderr, "Memcmp between blocks %d and %d (size = %zu)\n", block_pointed1, block_pointed2, mdp1->heapinfo[block_pointed1].busy_block.busy_size);
286 if(memcmp(addr_block_pointed1, addr_block_pointed2, mdp1->heapinfo[block_pointed1].busy_block.busy_size) != 0){
289 fprintf(stderr, "False difference detected\n");
294 }else{ // Fragmented block
295 address_pointed1 = (char*)mdp1 + ((char*)address_pointed1 - (char*)s_heap);
296 address_pointed2 = (char*)mdp2 + ((char*)address_pointed2 - (char*)s_heap);
297 //addr_block_pointed1 = (void*) (((ADDR2UINT((size_t)block_pointed1)) - 1) * BLOCKSIZE + (char*)heapbase1);
298 //addr_block_pointed2 = (void*) (((ADDR2UINT((size_t)block_pointed2)) - 1) * BLOCKSIZE + (char*)heapbase2);
299 addr_block_pointed1 = (char*)heapbase1 + ((block_pointed1 - 1)*BLOCKSIZE);
300 addr_block_pointed2 = (char*)heapbase2 + ((block_pointed2 - 1)*BLOCKSIZE);
302 while(address_pointed1 > (void*)((char*)addr_block_pointed1 + ((frag_pointed1 +1 ) * frag_size))){
306 while(address_pointed2 > (void*)((char*)addr_block_pointed2 + ((frag_pointed2 +1) * frag_size))){
309 if(mdp1->heapinfo[block_pointed1].busy_frag.frag_size[frag_pointed1] == mdp2->heapinfo[block_pointed2].busy_frag.frag_size[frag_pointed2]){
310 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]);
311 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){
314 fprintf(stderr, "False difference detected\n");
334 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);
336 fprintf(stderr, "Hamming distance between blocks : %d\n", distance);
337 mmalloc_backtrace_block_display(mdp1, i);
338 mmalloc_backtrace_block_display(mdp2, i);
340 total_distance += distance;
348 if(mdp1->heapinfo[i].type > 0){ /* busy fragmented block */
350 if(mdp1->heapinfo[i].type != mdp2->heapinfo[i].type){
351 fprintf(stderr,"Different size of fragments in fragmented block %zu : %d - %d\n", i, mdp1->heapinfo[i].type, mdp2->heapinfo[i].type); fflush(NULL);
355 if(mdp1->heapinfo[i].busy_frag.nfree != mdp2->heapinfo[i].busy_frag.nfree){
356 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);
360 if(mdp1->heapinfo[i].busy_frag.first != mdp2->heapinfo[i].busy_frag.first){
361 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);
365 //fprintf(stderr,"\n");
367 frag_size = pow(2, mdp1->heapinfo[i].type);
369 for(j=0; j< (BLOCKSIZE/frag_size); j++){
371 if(mdp1->heapinfo[i].busy_frag.frag_size[j] != mdp2->heapinfo[i].busy_frag.frag_size[j]){
372 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);
376 if(mdp1->heapinfo[i].busy_frag.frag_size[j] > 0){
378 addr_frag1 = (char *)addr_block1 + (j * frag_size);
379 addr_frag2 = (char *)addr_block2 + (j * frag_size);
382 /* Hamming distance on different blocks */
384 //for(k=0;k<frag_size;k++){
385 for(k=0;k<mdp1->heapinfo[i].busy_frag.frag_size[j];k++){
386 if(memcmp(((char *)addr_frag1) + k, ((char *)addr_frag2) + k, 1) != 0){
387 //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);
388 pointer_align = (k / sizeof(void*)) * sizeof(void*);
389 address_pointed1 = *((void **)((char *)addr_frag1 + pointer_align));
390 address_pointed2 = *((void **)((char *)addr_frag2 + pointer_align));
391 if(((address_pointed1 > (void *)s_heap) && (address_pointed1 < end_heap)) && ((address_pointed2 > (void *)s_heap) && (address_pointed2 < end_heap))){
392 block_pointed1 = ((char*)address_pointed1 - (char*)((struct mdesc*)s_heap)->heapbase) / BLOCKSIZE + 1;
393 block_pointed2 = ((char*)address_pointed2 - (char*)((struct mdesc*)s_heap)->heapbase) / BLOCKSIZE + 1;
394 //fprintf(stderr, "Blocks pointed : %d - %d\n", block_pointed1, block_pointed2);
395 if(mdp1->heapinfo[block_pointed1].type == mdp2->heapinfo[block_pointed2].type){
396 if(mdp1->heapinfo[block_pointed1].type == 0){ // Large block
397 while(mdp1->heapinfo[block_pointed1].busy_block.size == 0)
399 while(mdp2->heapinfo[block_pointed2].busy_block.size == 0)
401 if(mdp1->heapinfo[block_pointed1].busy_block.busy_size == mdp2->heapinfo[block_pointed2].busy_block.busy_size){
402 //addr_block_pointed1 = (void*) (((ADDR2UINT((size_t)block_pointed1)) - 1) * BLOCKSIZE + (char*)heapbase1);
403 //addr_block_pointed2 = (void*) (((ADDR2UINT((size_t)block_pointed2)) - 1) * BLOCKSIZE + (char*)heapbase2);
404 addr_block_pointed1 = (char*)heapbase1 + ((block_pointed1 - 1)*BLOCKSIZE);
405 addr_block_pointed2 = (char*)heapbase2 + ((block_pointed2 - 1)*BLOCKSIZE);
406 fprintf(stderr, "Memcmp between blocks %d and %d (size = %zu)\n", block_pointed1, block_pointed2, mdp1->heapinfo[block_pointed1].busy_block.busy_size);
407 if(memcmp(addr_block_pointed1, addr_block_pointed2, mdp1->heapinfo[block_pointed1].busy_block.busy_size) != 0){
410 fprintf(stderr, "False difference detected\n");
415 }else{ // Fragmented block
416 address_pointed1 = (char*)mdp1 + ((char*)address_pointed1 - (char*)s_heap);
417 address_pointed2 = (char*)mdp2 + ((char*)address_pointed2 - (char*)s_heap);
418 //addr_block_pointed1 = (void*) (((ADDR2UINT((size_t)block_pointed1)) - 1) * BLOCKSIZE + (char*)heapbase1);
419 //addr_block_pointed2 = (void*) (((ADDR2UINT((size_t)block_pointed2)) - 1) * BLOCKSIZE + (char*)heapbase2);
420 addr_block_pointed1 = (char*)heapbase1 + ((block_pointed1 - 1)*BLOCKSIZE);
421 addr_block_pointed2 = (char*)heapbase2 + ((block_pointed2 - 1)*BLOCKSIZE);
423 while(address_pointed1 > (void*)((char*)addr_block_pointed1 + ((frag_pointed1 + 1) * frag_size))){
427 while(address_pointed2 > (void*)((char*)addr_block_pointed2 + ((frag_pointed2 + 1) * frag_size))){
430 if(mdp1->heapinfo[block_pointed1].busy_frag.frag_size[frag_pointed1] == mdp2->heapinfo[block_pointed2].busy_frag.frag_size[frag_pointed2]){
431 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]);
432 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){
435 fprintf(stderr, "False difference detected\n");
452 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);
453 fprintf(stderr, "Hamming distance between fragments : %d\n", distance);
454 mmalloc_backtrace_fragment_display(mdp1, i, j);
455 mmalloc_backtrace_fragment_display(mdp2, i, j);
457 total_distance += distance;
466 }else{ /* free block */
470 //fprintf(stderr,"\n");
478 //free(pointed_address1);
479 //free(pointed_address2);
481 fprintf(stderr, "Hamming distance between heap regions : %d\n", total_distance);
487 void *get_end_addr_heap(void *heap){
489 FILE *fp; /* File pointer to process's proc maps file */
490 char *line = NULL; /* Temporal storage for each line that is readed */
491 ssize_t read; /* Number of bytes readed */
492 size_t n = 0; /* Amount of bytes to read by getline */
494 fp = fopen("/proc/self/maps", "r");
497 perror("fopen failed");
500 xbt_dynar_t lfields = NULL;
501 xbt_dynar_t start_end = NULL;
505 while ((read = getline(&line, &n, fp)) != -1) {
507 xbt_str_trim(line, NULL);
508 xbt_str_strip_spaces(line);
509 lfields = xbt_str_split(line,NULL);
511 start_end = xbt_str_split(xbt_dynar_get_as(lfields, 0, char*), "-");
512 start_addr = (void *) strtoul(xbt_dynar_get_as(start_end, 0, char*), NULL, 16);
513 end_addr = (void *) strtoul(xbt_dynar_get_as(start_end, 1, char*), NULL, 16);
515 if(start_addr == heap){
518 xbt_dynar_reset(lfields);
520 xbt_dynar_reset(start_end);
527 xbt_dynar_reset(lfields);
529 xbt_dynar_reset(start_end);
539 void mmalloc_display_info_heap(xbt_mheap_t h){