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 xbt_dynar_t mmalloc_ignore;
19 typedef struct s_heap_area_pair{
24 }s_heap_area_pair_t, *heap_area_pair_t;
26 static void heap_area_pair_free(heap_area_pair_t pair);
27 static void heap_area_pair_free_voidp(void *d);
28 static int add_heap_area_pair(xbt_dynar_t list, int block1, int fragment1, int block2, int fragment2);
29 static int is_new_heap_area_pair(xbt_dynar_t list, int block1, int fragment1, int block2, int fragment2);
31 static int compare_area(void *area1, void* area2, size_t size, xbt_dynar_t previous, int check_ignore);
32 static void match_equals(xbt_dynar_t list);
34 static int in_mmalloc_ignore(int block, int fragment);
35 static size_t heap_comparison_ignore(void *address);
37 void mmalloc_backtrace_block_display(void* heapinfo, int block){
41 if (((malloc_info *)heapinfo)[block].busy_block.bt_size == 0) {
42 XBT_DEBUG("No backtrace available for that block, sorry.");
46 memcpy(&e.bt,&(((malloc_info *)heapinfo)[block].busy_block.bt),sizeof(void*)*XBT_BACKTRACE_SIZE);
47 e.used = ((malloc_info *)heapinfo)[block].busy_block.bt_size;
49 xbt_ex_setup_backtrace(&e);
51 XBT_DEBUG("(backtrace not set)");
52 } else if (e.bt_strings == NULL) {
53 XBT_DEBUG("(backtrace not ready to be computed. %s)",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet");
57 XBT_DEBUG("Backtrace of where the block %d was malloced (%d frames):", block ,e.used);
58 for (i = 0; i < e.used; i++) /* no need to display "xbt_backtrace_display" */{
59 XBT_DEBUG("%d ---> %s",i, e.bt_strings[i] + 4);
65 void mmalloc_backtrace_fragment_display(void* heapinfo, int block, int frag){
69 memcpy(&e.bt,&(((malloc_info *)heapinfo)[block].busy_frag.bt[frag]),sizeof(void*)*XBT_BACKTRACE_SIZE);
70 e.used = XBT_BACKTRACE_SIZE;
72 xbt_ex_setup_backtrace(&e);
74 XBT_DEBUG("(backtrace not set)");
75 } else if (e.bt_strings == NULL) {
76 XBT_DEBUG("(backtrace not ready to be computed. %s)",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet");
80 XBT_DEBUG("Backtrace of where the fragment %d in block %d was malloced (%d frames):", frag, block ,e.used);
81 for (i = 0; i < e.used; i++) /* no need to display "xbt_backtrace_display" */{
82 XBT_DEBUG("%d ---> %s",i, e.bt_strings[i] + 4);
88 void *s_heap, *heapbase1, *heapbase2;
89 malloc_info *heapinfo1, *heapinfo2;
90 size_t heaplimit, heapsize1, heapsize2;
94 int mmalloc_compare_heap(xbt_mheap_t heap1, xbt_mheap_t heap2){
96 if(heap1 == NULL && heap1 == NULL){
97 XBT_DEBUG("Malloc descriptors null");
101 if(heap1->heaplimit != heap2->heaplimit){
102 XBT_DEBUG("Different limit of valid info table indices");
106 /* Heap information */
107 heaplimit = ((struct mdesc *)heap1)->heaplimit;
109 s_heap = (char *)mmalloc_get_current_heap() - STD_HEAP_SIZE - getpagesize();
111 heapbase1 = (char *)heap1 + BLOCKSIZE;
112 heapbase2 = (char *)heap2 + BLOCKSIZE;
114 heapinfo1 = (malloc_info *)((char *)heap1 + ((uintptr_t)((char *)heap1->heapinfo - (char *)s_heap)));
115 heapinfo2 = (malloc_info *)((char *)heap2 + ((uintptr_t)((char *)heap2->heapinfo - (char *)s_heap)));
117 heapsize1 = heap1->heapsize;
118 heapsize2 = heap2->heapsize;
120 /* Start comparison */
121 size_t i1, i2, j1, j2, k;
122 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
123 size_t frag_size1, frag_size2;
125 xbt_dynar_t previous = xbt_dynar_new(sizeof(heap_area_pair_t), heap_area_pair_free_voidp);
127 int equal, res_compare;
131 /* Init equal information */
134 while(i1<=heaplimit){
135 if(heapinfo1[i1].type == 0){
136 heapinfo1[i1].busy_block.equal_to = -1;
138 if(heapinfo1[i1].type > 0){
139 for(j1=0; j1 < MAX_FRAGMENT_PER_BLOCK; j1++){
140 heapinfo1[i1].busy_frag.equal_to[j1] = -1;
148 while(i2<=heaplimit){
149 if(heapinfo2[i2].type == 0){
150 heapinfo2[i2].busy_block.equal_to = -1;
152 if(heapinfo2[i2].type > 0){
153 for(j2=0; j2 < MAX_FRAGMENT_PER_BLOCK; j2++){
154 heapinfo2[i2].busy_frag.equal_to[j2] = -1;
160 /* Check busy blocks*/
164 while(i1 < heaplimit){
169 if(heapinfo1[i1].type == -1){ /* Free block */
174 addr_block1 = ((void*) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE + (char*)heapbase1));
176 if(heapinfo1[i1].type == 0){ /* Large block */
178 while(i2 <= heaplimit && !equal){
180 if(heapinfo2[i2].type != 0){
185 if(heapinfo2[i2].busy_block.equal_to == 1){
190 if(heapinfo1[i1].busy_block.size != heapinfo2[i2].busy_block.size){
195 if(heapinfo1[i1].busy_block.busy_size != heapinfo2[i2].busy_block.busy_size){
200 addr_block2 = ((void*) (((ADDR2UINT(i2)) - 1) * BLOCKSIZE + (char*)heapbase2));
203 add_heap_area_pair(previous, i1, -1, i2, -1);
205 if(ignore_done < xbt_dynar_length(mmalloc_ignore)){
206 if(in_mmalloc_ignore((int)i1, -1))
207 res_compare = compare_area(addr_block1, addr_block2, heapinfo1[i1].busy_block.busy_size, previous, 1);
209 res_compare = compare_area(addr_block1, addr_block2, heapinfo1[i1].busy_block.busy_size, previous, 0);
211 res_compare = compare_area(addr_block1, addr_block2, heapinfo1[i1].busy_block.busy_size, previous, 0);
215 for(k=1; k < heapinfo2[i2].busy_block.size; k++)
216 heapinfo2[i2+k].busy_block.equal_to = 1;
217 for(k=1; k < heapinfo1[i1].busy_block.size; k++)
218 heapinfo1[i1+k].busy_block.equal_to = 1;
220 match_equals(previous);
223 xbt_dynar_reset(previous);
229 }else{ /* Fragmented block */
231 frag_size1 = 1 << heapinfo1[i1].type;
233 for(j1=0; j1 < (size_t) (BLOCKSIZE >> heapinfo1[i1].type); j1++){
235 if(heapinfo1[i1].busy_frag.frag_size[j1] == 0) /* Free fragment */
238 addr_frag1 = (void*) ((char *)addr_block1 + (j1 * frag_size1));
243 while(i2 <= heaplimit && !equal){
245 if(heapinfo2[i2].type <= 0){
250 frag_size2 = 1 << heapinfo2[i2].type;
252 for(j2=0; j2 < (size_t) (BLOCKSIZE >> heapinfo2[i2].type); j2++){
254 if(heapinfo2[i2].busy_frag.equal_to[j2] == 1){
258 if(heapinfo1[i1].busy_frag.frag_size[j1] != heapinfo2[i2].busy_frag.frag_size[j2]){ /* Different size_used */
262 addr_block2 = ((void*) (((ADDR2UINT(i2)) - 1) * BLOCKSIZE + (char*)heapbase2));
263 addr_frag2 = (void*) ((char *)addr_block2 + (j2 * frag_size2));
266 add_heap_area_pair(previous, i1, j1, i2, j2);
268 if(ignore_done < xbt_dynar_length(mmalloc_ignore)){
269 if(in_mmalloc_ignore((int)i1, (int)j1))
270 res_compare = compare_area(addr_frag1, addr_frag2, heapinfo1[i1].busy_frag.frag_size[j1], previous, 1);
272 res_compare = compare_area(addr_frag1, addr_frag2, heapinfo1[i1].busy_frag.frag_size[j1], previous, 0);
274 res_compare = compare_area(addr_frag1, addr_frag2, heapinfo1[i1].busy_frag.frag_size[j1], previous, 0);
279 match_equals(previous);
280 xbt_dynar_reset(previous);
284 xbt_dynar_reset(previous);
300 /* All blocks/fragments are equal to another block/fragment ? */
302 int nb_diff1 = 0, nb_diff2 = 0;
303 size_t frag_size = 0;
306 if(heapinfo1[i].type == 0){
307 if(heapinfo1[i].busy_block.busy_size > 0){
308 if(heapinfo1[i].busy_block.equal_to == -1){
309 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
310 addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase1));
311 XBT_DEBUG("Block %zu (%p) not found (size used = %zu)", i, addr_block1, heapinfo1[i].busy_block.busy_size);
312 mmalloc_backtrace_block_display((void*)heapinfo1, i);
318 if(heapinfo1[i].type > 0){
319 frag_size = 1 << heapinfo1[i].type;
320 for(j=0; j < (size_t) (BLOCKSIZE >> heapinfo1[i].type); j++){
321 if(heapinfo1[i].busy_frag.frag_size[j] > 0){
322 if(heapinfo1[i].busy_frag.equal_to[j] == -1){
323 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
324 addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase1));
325 addr_frag1 = (void*) ((char *)addr_block1 + (j * frag_size));
326 XBT_DEBUG("Block %zu, Fragment %zu (%p) not found (size used = %d)", i, j, addr_frag1, heapinfo1[i].busy_frag.frag_size[j]);
327 mmalloc_backtrace_fragment_display((void*)heapinfo1, i, j);
338 XBT_DEBUG("Different blocks or fragments in heap1 : %d\n", nb_diff1);
343 if(heapinfo2[i].type == 0){
344 if(heapinfo2[i].busy_block.busy_size > 0){
345 if(heapinfo2[i].busy_block.equal_to == -1){
346 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
347 addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase2));
348 XBT_DEBUG("Block %zu (%p) not found (size used = %zu)", i, addr_block2, heapinfo2[i].busy_block.busy_size);
349 mmalloc_backtrace_block_display((void*)heapinfo2, i);
355 if(heapinfo2[i].type > 0){
356 frag_size = 1 << heapinfo2[i].type;
357 for(j=0; j < (size_t) (BLOCKSIZE >> heapinfo2[i].type); j++){
358 if(heapinfo2[i].busy_frag.frag_size[j] > 0){
359 if(heapinfo2[i].busy_frag.equal_to[j] == -1){
360 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
361 addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase2));
362 addr_frag2 = (void*) ((char *)addr_block2 + (j * frag_size));
363 XBT_DEBUG( "Block %zu, Fragment %zu (%p) not found (size used = %d)", i, j, addr_frag2, heapinfo2[i].busy_frag.frag_size[j]);
364 mmalloc_backtrace_fragment_display((void*)heapinfo2, i, j);
374 XBT_DEBUG("Different blocks or fragments in heap2 : %d\n", nb_diff2);
376 xbt_dynar_free(&previous);
378 return ((nb_diff1 > 0) || (nb_diff2 > 0));
382 static int in_mmalloc_ignore(int block, int fragment){
384 unsigned int cursor = 0;
386 int end = xbt_dynar_length(mmalloc_ignore) - 1;
387 mc_ignore_region_t region;
390 cursor = (start + end) / 2;
391 region = (mc_ignore_region_t)xbt_dynar_get_as(mmalloc_ignore, cursor, mc_ignore_region_t);
392 if(region->block == block){
393 if(region->fragment == fragment)
395 if(region->fragment < fragment)
397 if(region->fragment > fragment)
400 if(region->block < block)
402 if(region->block > block)
409 static size_t heap_comparison_ignore(void *address){
410 unsigned int cursor = 0;
412 int end = xbt_dynar_length(mmalloc_ignore) - 1;
413 mc_ignore_region_t region;
416 cursor = (start + end) / 2;
417 region = (mc_ignore_region_t)xbt_dynar_get_as(mmalloc_ignore, cursor, mc_ignore_region_t);
418 if(region->address == address)
420 if(region->address < address)
422 if(region->address > address)
430 static int compare_area(void *area1, void* area2, size_t size, xbt_dynar_t previous, int check_ignore){
432 size_t i = 0, pointer_align = 0, ignore1 = 0, ignore2 = 0;
433 void *address_pointed1, *address_pointed2, *addr_block_pointed1, *addr_block_pointed2, *addr_frag_pointed1, *addr_frag_pointed2;
434 size_t block_pointed1, block_pointed2, frag_pointed1, frag_pointed2;
435 size_t frag_size, frag_size1, frag_size2;
437 void *current_area1, *current_area2;
443 current_area1 = (char*)((xbt_mheap_t)s_heap)->heapbase + ((((char *)area1) + i) - (char *)heapbase1);
444 if((ignore1 = heap_comparison_ignore(current_area1)) > 0){
445 current_area2 = (char*)((xbt_mheap_t)s_heap)->heapbase + ((((char *)area2) + i) - (char *)heapbase2);
446 if((ignore2 = heap_comparison_ignore(current_area2)) == ignore1){
455 if(memcmp(((char *)area1) + i, ((char *)area2) + i, 1) != 0){
457 /* Check pointer difference */
458 pointer_align = (i / sizeof(void*)) * sizeof(void*);
459 address_pointed1 = *((void **)((char *)area1 + pointer_align));
460 address_pointed2 = *((void **)((char *)area2 + pointer_align));
462 /* Get pointed blocks number */
463 block_pointed1 = ((char*)address_pointed1 - (char*)((xbt_mheap_t)s_heap)->heapbase) / BLOCKSIZE + 1;
464 block_pointed2 = ((char*)address_pointed2 - (char*)((xbt_mheap_t)s_heap)->heapbase) / BLOCKSIZE + 1;
466 /* Check if valid blocks number */
467 if((char *)address_pointed1 < (char*)((xbt_mheap_t)s_heap)->heapbase || block_pointed1 > heapsize1 || block_pointed1 < 1 || (char *)address_pointed2 < (char*)((xbt_mheap_t)s_heap)->heapbase || block_pointed2 > heapsize2 || block_pointed2 < 1)
470 if(heapinfo1[block_pointed1].type == heapinfo2[block_pointed2].type){ /* Same type of block (large or fragmented) */
472 addr_block_pointed1 = ((void*) (((ADDR2UINT(block_pointed1)) - 1) * BLOCKSIZE + (char*)heapbase1));
473 addr_block_pointed2 = ((void*) (((ADDR2UINT(block_pointed2)) - 1) * BLOCKSIZE + (char*)heapbase2));
475 if(heapinfo1[block_pointed1].type == 0){ /* Large block */
477 if(heapinfo1[block_pointed1].busy_block.size != heapinfo2[block_pointed2].busy_block.size){
481 if(heapinfo1[block_pointed1].busy_block.busy_size != heapinfo2[block_pointed2].busy_block.busy_size){
485 if(add_heap_area_pair(previous, block_pointed1, -1, block_pointed2, -1)){
487 if(ignore_done < xbt_dynar_length(mmalloc_ignore)){
488 if(in_mmalloc_ignore(block_pointed1, -1))
489 res_compare = compare_area(addr_block_pointed1, addr_block_pointed2, heapinfo1[block_pointed1].busy_block.busy_size, previous, 1);
491 res_compare = compare_area(addr_block_pointed1, addr_block_pointed2, heapinfo1[block_pointed1].busy_block.busy_size, previous, 0);
493 res_compare = compare_area(addr_block_pointed1, addr_block_pointed2, heapinfo1[block_pointed1].busy_block.busy_size, previous, 0);
501 }else{ /* Fragmented block */
503 /* Get pointed fragments number */
504 frag_pointed1 = ((uintptr_t) (ADDR2UINT (address_pointed1) % (BLOCKSIZE))) >> heapinfo1[block_pointed1].type;
505 frag_pointed2 = ((uintptr_t) (ADDR2UINT (address_pointed2) % (BLOCKSIZE))) >> heapinfo2[block_pointed2].type;
507 if(heapinfo1[block_pointed1].busy_frag.frag_size[frag_pointed1] != heapinfo2[block_pointed2].busy_frag.frag_size[frag_pointed2]) /* Different size_used */
510 frag_size = 1 << heapinfo1[block_pointed1].type;
512 addr_frag_pointed1 = (void*) ((char *)addr_block_pointed1 + (frag_pointed1 * frag_size));
513 addr_frag_pointed2 = (void*) ((char *)addr_block_pointed2 + (frag_pointed2 * frag_size));
515 if(add_heap_area_pair(previous, block_pointed1, frag_pointed1, block_pointed2, frag_pointed2)){
517 if(ignore_done < xbt_dynar_length(mmalloc_ignore)){
518 if(in_mmalloc_ignore(block_pointed1, frag_pointed1))
519 res_compare = compare_area(addr_frag_pointed1, addr_frag_pointed2, heapinfo1[block_pointed1].busy_frag.frag_size[frag_pointed1], previous, 1);
521 res_compare = compare_area(addr_frag_pointed1, addr_frag_pointed2, heapinfo1[block_pointed1].busy_frag.frag_size[frag_pointed1], previous, 0);
523 res_compare = compare_area(addr_frag_pointed1, addr_frag_pointed2, heapinfo1[block_pointed1].busy_frag.frag_size[frag_pointed1], previous, 0);
535 if((heapinfo1[block_pointed1].type > 0) && (heapinfo2[block_pointed2].type > 0)){
537 addr_block_pointed1 = ((void*) (((ADDR2UINT(block_pointed1)) - 1) * BLOCKSIZE + (char*)heapbase1));
538 addr_block_pointed2 = ((void*) (((ADDR2UINT(block_pointed2)) - 1) * BLOCKSIZE + (char*)heapbase2));
540 frag_pointed1 = ((uintptr_t) (ADDR2UINT (address_pointed1) % (BLOCKSIZE))) >> heapinfo1[block_pointed1].type;
541 frag_pointed2 = ((uintptr_t) (ADDR2UINT (address_pointed2) % (BLOCKSIZE))) >> heapinfo2[block_pointed2].type;
543 if(heapinfo1[block_pointed1].busy_frag.frag_size[frag_pointed1] != heapinfo2[block_pointed2].busy_frag.frag_size[frag_pointed2]) /* Different size_used */
546 frag_size1 = 1 << heapinfo1[block_pointed1].type;
547 frag_size2 = 1 << heapinfo1[block_pointed2].type;
549 addr_frag_pointed1 = (void*) ((char *)addr_block_pointed1 + (frag_pointed1 * frag_size1));
550 addr_frag_pointed2 = (void*) ((char *)addr_block_pointed2 + (frag_pointed2 * frag_size2));
552 if(add_heap_area_pair(previous, block_pointed1, frag_pointed1, block_pointed2, frag_pointed2)){
554 if(ignore_done < xbt_dynar_length(mmalloc_ignore)){
555 if(in_mmalloc_ignore(block_pointed1, frag_pointed1))
556 res_compare = compare_area(addr_frag_pointed1, addr_frag_pointed2, heapinfo1[block_pointed1].busy_frag.frag_size[frag_pointed1], previous, 1);
558 res_compare = compare_area(addr_frag_pointed1, addr_frag_pointed2, heapinfo1[block_pointed1].busy_frag.frag_size[frag_pointed1], previous, 0);
560 res_compare = compare_area(addr_frag_pointed1, addr_frag_pointed2, heapinfo1[block_pointed1].busy_frag.frag_size[frag_pointed1], previous, 0);
574 i = pointer_align + sizeof(void *);
588 static void heap_area_pair_free(heap_area_pair_t pair){
595 static void heap_area_pair_free_voidp(void *d)
597 heap_area_pair_free((heap_area_pair_t) * (void **) d);
600 static int add_heap_area_pair(xbt_dynar_t list, int block1, int fragment1, int block2, int fragment2){
602 if(is_new_heap_area_pair(list, block1, fragment1, block2, fragment2)){
603 heap_area_pair_t pair = NULL;
604 pair = xbt_new0(s_heap_area_pair_t, 1);
605 pair->block1 = block1;
606 pair->fragment1 = fragment1;
607 pair->block2 = block2;
608 pair->fragment2 = fragment2;
610 xbt_dynar_push(list, &pair);
618 static int is_new_heap_area_pair(xbt_dynar_t list, int block1, int fragment1, int block2, int fragment2){
620 unsigned int cursor = 0;
621 heap_area_pair_t current_pair;
623 xbt_dynar_foreach(list, cursor, current_pair){
624 if(current_pair->block1 == block1 && current_pair->block2 == block2 && current_pair->fragment1 == fragment1 && current_pair->fragment2 == fragment2)
631 static void match_equals(xbt_dynar_t list){
633 unsigned int cursor = 0;
634 heap_area_pair_t current_pair;
636 xbt_dynar_foreach(list, cursor, current_pair){
637 if(current_pair->fragment1 != -1){
638 heapinfo1[current_pair->block1].busy_frag.equal_to[current_pair->fragment1] = 1;
639 heapinfo2[current_pair->block2].busy_frag.equal_to[current_pair->fragment2] = 1;
641 heapinfo1[current_pair->block1].busy_block.equal_to = 1;
642 heapinfo2[current_pair->block2].busy_block.equal_to = 1;