1 /* mc_diff - Memory snapshooting and comparison */
3 /* Copyright (c) 2008-2014. The SimGrid Team.
4 * All rights reserved. */
6 /* This program is free software; you can redistribute it and/or modify it
7 * under the terms of the license (GNU LGPL) which comes with this package. */
9 #include "xbt/ex_interface.h" /* internals of backtrace setup */
12 #include "xbt/mmalloc.h"
13 #include "mc/datatypes.h"
14 #include "mc/mc_private.h"
16 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_diff, xbt,
17 "Logging specific to mc_diff in mc");
19 xbt_dynar_t mc_heap_comparison_ignore;
20 xbt_dynar_t stacks_areas;
21 void *maestro_stack_start, *maestro_stack_end;
24 /********************************* Backtrace ***********************************/
25 /******************************************************************************/
27 static void mmalloc_backtrace_block_display(void *heapinfo, int block)
32 /* if (((malloc_info *)heapinfo)[block].busy_block.bt_size == 0) { */
33 /* fprintf(stderr, "No backtrace available for that block, sorry.\n"); */
37 /* memcpy(&e.bt,&(((malloc_info *)heapinfo)[block].busy_block.bt),sizeof(void*)*XBT_BACKTRACE_SIZE); */
38 /* e.used = ((malloc_info *)heapinfo)[block].busy_block.bt_size; */
40 /* xbt_ex_setup_backtrace(&e); */
41 /* if (e.used == 0) { */
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 %d was malloced (%d frames):\n", block ,e.used); */
49 /* for (i = 0; i < e.used; i++) /\* no need to display "xbt_backtrace_display" *\/{ */
50 /* fprintf(stderr, "%d ---> %s\n",i, e.bt_strings[i] + 4); */
55 static void mmalloc_backtrace_fragment_display(void *heapinfo, int block,
61 /* memcpy(&e.bt,&(((malloc_info *)heapinfo)[block].busy_frag.bt[frag]),sizeof(void*)*XBT_BACKTRACE_SIZE); */
62 /* e.used = XBT_BACKTRACE_SIZE; */
64 /* xbt_ex_setup_backtrace(&e); */
65 /* if (e.used == 0) { */
66 /* fprintf(stderr, "(backtrace not set)\n"); */
67 /* } else if (e.bt_strings == NULL) { */
68 /* fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet"); */
72 /* fprintf(stderr, "Backtrace of where the fragment %d in block %d was malloced (%d frames):\n", frag, block ,e.used); */
73 /* for (i = 0; i < e.used; i++) /\* no need to display "xbt_backtrace_display" *\/{ */
74 /* fprintf(stderr, "%d ---> %s\n",i, e.bt_strings[i] + 4); */
80 static void mmalloc_backtrace_display(void *addr)
83 /* size_t block, frag_nb; */
86 /* xbt_mheap_t heap = __mmalloc_current_heap ?: (xbt_mheap_t) mmalloc_preinit(); */
88 /* block = (((char*) (addr) - (char*) heap -> heapbase) / BLOCKSIZE + 1); */
90 /* type = heap->heapinfo[block].type; */
93 /* case -1 : /\* Free block *\/ */
94 /* fprintf(stderr, "Asked to display the backtrace of a block that is free. I'm puzzled\n"); */
97 /* case 0: /\* Large block *\/ */
98 /* mmalloc_backtrace_block_display(heap->heapinfo, block); */
100 /* default: /\* Fragmented block *\/ */
101 /* frag_nb = RESIDUAL(addr, BLOCKSIZE) >> type; */
102 /* if(heap->heapinfo[block].busy_frag.frag_size[frag_nb] == -1){ */
103 /* fprintf(stderr , "Asked to display the backtrace of a fragment that is free. I'm puzzled\n"); */
106 /* mmalloc_backtrace_fragment_display(heap->heapinfo, block, frag_nb); */
112 static int compare_backtrace(int b1, int f1, int b2, int f2)
116 for(i=0; i< XBT_BACKTRACE_SIZE; i++){
117 if(heapinfo1[b1].busy_frag.bt[f1][i] != heapinfo2[b2].busy_frag.bt[f2][i]){
118 //mmalloc_backtrace_fragment_display((void*)heapinfo1, b1, f1);
119 //mmalloc_backtrace_fragment_display((void*)heapinfo2, b2, f2);
124 for(i=0; i< heapinfo1[b1].busy_block.bt_size; i++){
125 if(heapinfo1[b1].busy_block.bt[i] != heapinfo2[b2].busy_block.bt[i]){
126 //mmalloc_backtrace_block_display((void*)heapinfo1, b1);
127 //mmalloc_backtrace_block_display((void*)heapinfo2, b2);
136 /*********************************** Heap comparison ***********************************/
137 /***************************************************************************************/
139 typedef char *type_name;
142 /** \brief Base address of the real heap */
144 /** \brief Base address of the first heap snapshot */
146 /** \brief Base address of the second heap snapshot */
148 malloc_info *heapinfo1, *heapinfo2;
150 // Number of blocks in the heaps:
151 size_t heapsize1, heapsize2;
152 xbt_dynar_t to_ignore1, to_ignore2;
153 s_heap_area_t *equals_to1, *equals_to2;
154 dw_type_t *types1, *types2;
158 #define equals_to1_(i,j) equals_to1[ MAX_FRAGMENT_PER_BLOCK*(i) + (j)]
159 #define equals_to2_(i,j) equals_to2[ MAX_FRAGMENT_PER_BLOCK*(i) + (j)]
160 #define types1_(i,j) types1[ MAX_FRAGMENT_PER_BLOCK*(i) + (j)]
161 #define types2_(i,j) types2[ MAX_FRAGMENT_PER_BLOCK*(i) + (j)]
163 __thread struct s_mc_diff *mc_diff_info = NULL;
165 /*********************************** Free functions ************************************/
167 static void heap_area_pair_free(heap_area_pair_t pair)
173 static void heap_area_pair_free_voidp(void *d)
175 heap_area_pair_free((heap_area_pair_t) * (void **) d);
178 static void heap_area_free(heap_area_t area)
184 /************************************************************************************/
186 static s_heap_area_t make_heap_area(int block, int fragment)
191 area.fragment = fragment;
196 static int is_new_heap_area_pair(xbt_dynar_t list, int block1, int fragment1,
197 int block2, int fragment2)
200 unsigned int cursor = 0;
201 heap_area_pair_t current_pair;
203 xbt_dynar_foreach(list, cursor, current_pair) {
204 if (current_pair->block1 == block1 && current_pair->block2 == block2
205 && current_pair->fragment1 == fragment1
206 && current_pair->fragment2 == fragment2)
213 static int add_heap_area_pair(xbt_dynar_t list, int block1, int fragment1,
214 int block2, int fragment2)
217 if (is_new_heap_area_pair(list, block1, fragment1, block2, fragment2)) {
218 heap_area_pair_t pair = NULL;
219 pair = xbt_new0(s_heap_area_pair_t, 1);
220 pair->block1 = block1;
221 pair->fragment1 = fragment1;
222 pair->block2 = block2;
223 pair->fragment2 = fragment2;
225 xbt_dynar_push(list, &pair);
233 static ssize_t heap_comparison_ignore_size(xbt_dynar_t ignore_list,
237 unsigned int cursor = 0;
239 int end = xbt_dynar_length(ignore_list) - 1;
240 mc_heap_ignore_region_t region;
242 while (start <= end) {
243 cursor = (start + end) / 2;
245 (mc_heap_ignore_region_t) xbt_dynar_get_as(ignore_list, cursor,
246 mc_heap_ignore_region_t);
247 if (region->address == address)
249 if (region->address < address)
251 if (region->address > address)
258 static int is_stack(void *address)
260 unsigned int cursor = 0;
261 stack_region_t stack;
263 xbt_dynar_foreach(stacks_areas, cursor, stack) {
264 if (address == stack->address)
271 static int is_block_stack(int block)
273 unsigned int cursor = 0;
274 stack_region_t stack;
276 xbt_dynar_foreach(stacks_areas, cursor, stack) {
277 if (block == stack->block)
284 static void match_equals(struct s_mc_diff *state, xbt_dynar_t list)
287 unsigned int cursor = 0;
288 heap_area_pair_t current_pair;
290 xbt_dynar_foreach(list, cursor, current_pair) {
292 if (current_pair->fragment1 != -1) {
294 state->equals_to1_(current_pair->block1, current_pair->fragment1) =
295 make_heap_area(current_pair->block2, current_pair->fragment2);
296 state->equals_to2_(current_pair->block2, current_pair->fragment2) =
297 make_heap_area(current_pair->block1, current_pair->fragment1);
301 state->equals_to1_(current_pair->block1, 0) =
302 make_heap_area(current_pair->block2, current_pair->fragment2);
303 state->equals_to2_(current_pair->block2, 0) =
304 make_heap_area(current_pair->block1, current_pair->fragment1);
311 /** Check whether two blocks are known to be matching
313 * @param state State used
314 * @param b1 Block of state 1
315 * @param b2 Block of state 2
316 * @return if the blocks are known to be matching
318 static int equal_blocks(struct s_mc_diff *state, int b1, int b2)
321 if (state->equals_to1_(b1, 0).block == b2
322 && state->equals_to2_(b2, 0).block == b1)
328 /** Check whether two fragments are known to be matching
330 * @param state State used
331 * @param b1 Block of state 1
332 * @param f1 Fragment of state 1
333 * @param b2 Block of state 2
334 * @param f2 Fragment of state 2
335 * @return if the fragments are known to be matching
337 static int equal_fragments(struct s_mc_diff *state, int b1, int f1, int b2,
341 if (state->equals_to1_(b1, f1).block == b2
342 && state->equals_to1_(b1, f1).fragment == f2
343 && state->equals_to2_(b2, f2).block == b1
344 && state->equals_to2_(b2, f2).fragment == f1)
350 int init_heap_information(xbt_mheap_t heap1, xbt_mheap_t heap2, xbt_dynar_t i1,
353 if (mc_diff_info == NULL) {
354 mc_diff_info = xbt_new0(struct s_mc_diff, 1);
355 mc_diff_info->equals_to1 = NULL;
356 mc_diff_info->equals_to2 = NULL;
357 mc_diff_info->types1 = NULL;
358 mc_diff_info->types2 = NULL;
360 struct s_mc_diff *state = mc_diff_info;
362 if ((((struct mdesc *) heap1)->heaplimit !=
363 ((struct mdesc *) heap2)->heaplimit)
365 ((((struct mdesc *) heap1)->heapsize !=
366 ((struct mdesc *) heap2)->heapsize)))
369 state->heaplimit = ((struct mdesc *) heap1)->heaplimit;
371 // Mamailloute in order to find the base address of the main heap:
373 (char *) mmalloc_get_current_heap() - STD_HEAP_SIZE - xbt_pagesize;
375 state->heapbase1 = (char *) heap1 + BLOCKSIZE;
376 state->heapbase2 = (char *) heap2 + BLOCKSIZE;
379 (malloc_info *) ((char *) heap1 +
381 ((char *) ((struct mdesc *) heap1)->heapinfo -
382 (char *) state->s_heap)));
384 (malloc_info *) ((char *) heap2 +
386 ((char *) ((struct mdesc *) heap2)->heapinfo -
387 (char *) state->s_heap)));
389 state->heapsize1 = heap1->heapsize;
390 state->heapsize2 = heap2->heapsize;
392 state->to_ignore1 = i1;
393 state->to_ignore2 = i2;
395 if (state->heaplimit > state->available) {
397 realloc(state->equals_to1,
398 state->heaplimit * MAX_FRAGMENT_PER_BLOCK *
399 sizeof(s_heap_area_t));
401 realloc(state->types1,
402 state->heaplimit * MAX_FRAGMENT_PER_BLOCK *
403 sizeof(type_name *));
405 realloc(state->equals_to2,
406 state->heaplimit * MAX_FRAGMENT_PER_BLOCK *
407 sizeof(s_heap_area_t));
409 realloc(state->types2,
410 state->heaplimit * MAX_FRAGMENT_PER_BLOCK *
411 sizeof(type_name *));
412 state->available = state->heaplimit;
415 memset(state->equals_to1, 0,
416 state->heaplimit * MAX_FRAGMENT_PER_BLOCK * sizeof(s_heap_area_t));
417 memset(state->equals_to2, 0,
418 state->heaplimit * MAX_FRAGMENT_PER_BLOCK * sizeof(s_heap_area_t));
419 memset(state->types1, 0,
420 state->heaplimit * MAX_FRAGMENT_PER_BLOCK * sizeof(type_name *));
421 memset(state->types2, 0,
422 state->heaplimit * MAX_FRAGMENT_PER_BLOCK * sizeof(type_name *));
424 if (MC_is_active()) {
425 MC_ignore_global_variable("mc_diff_info");
432 void reset_heap_information()
437 int mmalloc_compare_heap(mc_snapshot_t snapshot1, mc_snapshot_t snapshot2,
438 xbt_mheap_t heap1, xbt_mheap_t heap2)
441 struct s_mc_diff *state = mc_diff_info;
443 if (heap1 == NULL && heap2 == NULL) {
444 XBT_DEBUG("Malloc descriptors null");
448 /* Start comparison */
449 size_t i1, i2, j1, j2, k;
450 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
451 int nb_diff1 = 0, nb_diff2 = 0;
453 xbt_dynar_t previous =
454 xbt_dynar_new(sizeof(heap_area_pair_t), heap_area_pair_free_voidp);
456 int equal, res_compare = 0;
458 /* Check busy blocks */
462 while (i1 <= state->heaplimit) {
464 if (state->heapinfo1[i1].type == -1) { /* Free block */
470 ((void *) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE +
471 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
473 if (state->heapinfo1[i1].type == 0) { /* Large block */
475 if (is_stack(addr_block1)) {
476 for (k = 0; k < state->heapinfo1[i1].busy_block.size; k++)
477 state->equals_to1_(i1 + k, 0) = make_heap_area(i1, -1);
478 for (k = 0; k < state->heapinfo2[i1].busy_block.size; k++)
479 state->equals_to2_(i1 + k, 0) = make_heap_area(i1, -1);
480 i1 += state->heapinfo1[i1].busy_block.size;
484 if (state->equals_to1_(i1, 0).valid) {
493 /* Try first to associate to same block in the other heap */
494 if (state->heapinfo2[i1].type == state->heapinfo1[i1].type) {
496 if (state->equals_to2_(i1, 0).valid == 0) {
499 ((void *) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE +
500 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
503 compare_heap_area(addr_block1, addr_block2, snapshot1, snapshot2,
506 if (res_compare != 1) {
507 for (k = 1; k < state->heapinfo2[i1].busy_block.size; k++)
508 state->equals_to2_(i1 + k, 0) = make_heap_area(i1, -1);
509 for (k = 1; k < state->heapinfo1[i1].busy_block.size; k++)
510 state->equals_to1_(i1 + k, 0) = make_heap_area(i1, -1);
512 i1 += state->heapinfo1[i1].busy_block.size;
515 xbt_dynar_reset(previous);
521 while (i2 <= state->heaplimit && !equal) {
524 ((void *) (((ADDR2UINT(i2)) - 1) * BLOCKSIZE +
525 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
532 if (state->heapinfo2[i2].type != 0) {
537 if (state->equals_to2_(i2, 0).valid) {
543 compare_heap_area(addr_block1, addr_block2, snapshot1, snapshot2,
546 if (res_compare != 1) {
547 for (k = 1; k < state->heapinfo2[i2].busy_block.size; k++)
548 state->equals_to2_(i2 + k, 0) = make_heap_area(i1, -1);
549 for (k = 1; k < state->heapinfo1[i1].busy_block.size; k++)
550 state->equals_to1_(i1 + k, 0) = make_heap_area(i2, -1);
552 i1 += state->heapinfo1[i1].busy_block.size;
555 xbt_dynar_reset(previous);
562 XBT_DEBUG("Block %zu not found (size_used = %zu, addr = %p)", i1,
563 state->heapinfo1[i1].busy_block.busy_size, addr_block1);
564 i1 = state->heaplimit + 1;
569 } else { /* Fragmented block */
571 for (j1 = 0; j1 < (size_t) (BLOCKSIZE >> state->heapinfo1[i1].type); j1++) {
573 if (state->heapinfo1[i1].busy_frag.frag_size[j1] == -1) /* Free fragment */
576 if (state->equals_to1_(i1, j1).valid)
580 (void *) ((char *) addr_block1 + (j1 << state->heapinfo1[i1].type));
585 /* Try first to associate to same fragment in the other heap */
586 if (state->heapinfo2[i1].type == state->heapinfo1[i1].type) {
588 if (state->equals_to2_(i1, j1).valid == 0) {
591 ((void *) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE +
592 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
594 (void *) ((char *) addr_block2 +
595 (j1 << state->heapinfo2[i1].type));
598 compare_heap_area(addr_frag1, addr_frag2, snapshot1, snapshot2,
601 if (res_compare != 1)
604 xbt_dynar_reset(previous);
610 while (i2 <= state->heaplimit && !equal) {
612 if (state->heapinfo2[i2].type <= 0) {
617 for (j2 = 0; j2 < (size_t) (BLOCKSIZE >> state->heapinfo2[i2].type);
620 if (i2 == i1 && j2 == j1)
623 if (state->equals_to2_(i2, j2).valid)
627 ((void *) (((ADDR2UINT(i2)) - 1) * BLOCKSIZE +
628 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
630 (void *) ((char *) addr_block2 +
631 (j2 << state->heapinfo2[i2].type));
634 compare_heap_area(addr_frag1, addr_frag2, snapshot2, snapshot2,
637 if (res_compare != 1) {
639 xbt_dynar_reset(previous);
643 xbt_dynar_reset(previous);
653 ("Block %zu, fragment %zu not found (size_used = %zd, address = %p)\n",
654 i1, j1, state->heapinfo1[i1].busy_frag.frag_size[j1],
656 i2 = state->heaplimit + 1;
657 i1 = state->heaplimit + 1;
670 /* All blocks/fragments are equal to another block/fragment ? */
672 void *real_addr_frag1 = NULL, *real_addr_block1 = NULL, *real_addr_block2 =
673 NULL, *real_addr_frag2 = NULL;
675 while (i <= state->heaplimit) {
676 if (state->heapinfo1[i].type == 0) {
677 if (i1 == state->heaplimit) {
678 if (state->heapinfo1[i].busy_block.busy_size > 0) {
679 if (state->equals_to1_(i, 0).valid == 0) {
680 if (XBT_LOG_ISENABLED(mc_diff, xbt_log_priority_debug)) {
682 ((void *) (((ADDR2UINT(i)) - 1) * BLOCKSIZE +
683 (char *) state->heapbase1));
684 XBT_DEBUG("Block %zu (%p) not found (size used = %zu)", i,
685 addr_block1, state->heapinfo1[i].busy_block.busy_size);
686 //mmalloc_backtrace_block_display((void*)heapinfo1, i);
693 if (state->heapinfo1[i].type > 0) {
695 ((void *) (((ADDR2UINT(i)) - 1) * BLOCKSIZE +
696 (char *) state->heapbase1));
698 ((void *) (((ADDR2UINT(i)) - 1) * BLOCKSIZE +
699 (char *) ((struct mdesc *) state->s_heap)->heapbase));
700 for (j = 0; j < (size_t) (BLOCKSIZE >> state->heapinfo1[i].type); j++) {
701 if (i1 == state->heaplimit) {
702 if (state->heapinfo1[i].busy_frag.frag_size[j] > 0) {
703 if (state->equals_to1_(i, j).valid == 0) {
704 if (XBT_LOG_ISENABLED(mc_diff, xbt_log_priority_debug)) {
706 (void *) ((char *) addr_block1 +
707 (j << state->heapinfo1[i].type));
709 (void *) ((char *) real_addr_block1 +
710 (j << state->heapinfo1[i].type));
712 ("Block %zu, Fragment %zu (%p - %p) not found (size used = %zd)",
713 i, j, addr_frag1, real_addr_frag1,
714 state->heapinfo1[i].busy_frag.frag_size[j]);
715 //mmalloc_backtrace_fragment_display((void*)heapinfo1, i, j);
726 if (i1 == state->heaplimit)
727 XBT_DEBUG("Number of blocks/fragments not found in heap1 : %d", nb_diff1);
731 while (i <= state->heaplimit) {
732 if (state->heapinfo2[i].type == 0) {
733 if (i1 == state->heaplimit) {
734 if (state->heapinfo2[i].busy_block.busy_size > 0) {
735 if (state->equals_to2_(i, 0).valid == 0) {
736 if (XBT_LOG_ISENABLED(mc_diff, xbt_log_priority_debug)) {
738 ((void *) (((ADDR2UINT(i)) - 1) * BLOCKSIZE +
739 (char *) state->heapbase2));
740 XBT_DEBUG("Block %zu (%p) not found (size used = %zu)", i,
741 addr_block2, state->heapinfo2[i].busy_block.busy_size);
742 //mmalloc_backtrace_block_display((void*)heapinfo2, i);
749 if (state->heapinfo2[i].type > 0) {
751 ((void *) (((ADDR2UINT(i)) - 1) * BLOCKSIZE +
752 (char *) state->heapbase2));
754 ((void *) (((ADDR2UINT(i)) - 1) * BLOCKSIZE +
755 (char *) ((struct mdesc *) state->s_heap)->heapbase));
756 for (j = 0; j < (size_t) (BLOCKSIZE >> state->heapinfo2[i].type); j++) {
757 if (i1 == state->heaplimit) {
758 if (state->heapinfo2[i].busy_frag.frag_size[j] > 0) {
759 if (state->equals_to2_(i, j).valid == 0) {
760 if (XBT_LOG_ISENABLED(mc_diff, xbt_log_priority_debug)) {
762 (void *) ((char *) addr_block2 +
763 (j << state->heapinfo2[i].type));
765 (void *) ((char *) real_addr_block2 +
766 (j << state->heapinfo2[i].type));
768 ("Block %zu, Fragment %zu (%p - %p) not found (size used = %zd)",
769 i, j, addr_frag2, real_addr_frag2,
770 state->heapinfo2[i].busy_frag.frag_size[j]);
771 //mmalloc_backtrace_fragment_display((void*)heapinfo2, i, j);
782 if (i1 == state->heaplimit)
783 XBT_DEBUG("Number of blocks/fragments not found in heap2 : %d", nb_diff2);
785 xbt_dynar_free(&previous);
786 real_addr_frag1 = NULL, real_addr_block1 = NULL, real_addr_block2 =
787 NULL, real_addr_frag2 = NULL;
789 return ((nb_diff1 > 0) || (nb_diff2 > 0));
795 * @param real_area1 Process address for state 1
796 * @param real_area2 Process address for state 2
797 * @param area1 Snapshot address for state 1
798 * @param area2 Snapshot address for state 2
799 * @param snapshot1 Snapshot of state 1
800 * @param snapshot2 Snapshot of state 2
803 * @param check_ignore
805 static int compare_heap_area_without_type(struct s_mc_diff *state,
806 void *real_area1, void *real_area2,
807 void *area1, void *area2,
808 mc_snapshot_t snapshot1,
809 mc_snapshot_t snapshot2,
810 xbt_dynar_t previous, int size,
815 void *addr_pointed1, *addr_pointed2;
816 int pointer_align, res_compare;
817 ssize_t ignore1, ignore2;
821 if (check_ignore > 0) {
823 heap_comparison_ignore_size(state->to_ignore1,
824 (char *) real_area1 + i)) != -1) {
826 heap_comparison_ignore_size(state->to_ignore2,
827 (char *) real_area2 + i)) == ignore1) {
840 if (memcmp(((char *) area1) + i, ((char *) area2) + i, 1) != 0) {
842 pointer_align = (i / sizeof(void *)) * sizeof(void *);
843 addr_pointed1 = *((void **) ((char *) area1 + pointer_align));
844 addr_pointed2 = *((void **) ((char *) area2 + pointer_align));
846 if (addr_pointed1 > maestro_stack_start
847 && addr_pointed1 < maestro_stack_end
848 && addr_pointed2 > maestro_stack_start
849 && addr_pointed2 < maestro_stack_end) {
850 i = pointer_align + sizeof(void *);
852 } else if (addr_pointed1 > state->s_heap
853 && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1)
854 && addr_pointed2 > state->s_heap
855 && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2)) {
856 // Both addreses are in the heap:
858 compare_heap_area(addr_pointed1, addr_pointed2, snapshot1,
859 snapshot2, previous, NULL, 0);
860 if (res_compare == 1) {
863 i = pointer_align + sizeof(void *);
882 * @param real_area1 Process address for state 1
883 * @param real_area2 Process address for state 2
884 * @param area1 Snapshot address for state 1
885 * @param area2 Snapshot address for state 2
886 * @param snapshot1 Snapshot of state 1
887 * @param snapshot2 Snapshot of state 2
890 * @param area_size either a byte_size or an elements_count (?)
891 * @param check_ignore
892 * @param pointer_level
893 * @return 0 (same), 1 (different), -1 (unknown)
895 static int compare_heap_area_with_type(struct s_mc_diff *state,
896 void *real_area1, void *real_area2,
897 void *area1, void *area2,
898 mc_snapshot_t snapshot1,
899 mc_snapshot_t snapshot2,
900 xbt_dynar_t previous, dw_type_t type,
901 int area_size, int check_ignore,
905 if (is_stack(real_area1) && is_stack(real_area2))
908 ssize_t ignore1, ignore2;
910 if ((check_ignore > 0)
911 && ((ignore1 = heap_comparison_ignore_size(state->to_ignore1, real_area1))
913 && ((ignore2 = heap_comparison_ignore_size(state->to_ignore2, real_area2))
918 dw_type_t subtype, subsubtype;
919 int res, elm_size, i;
920 unsigned int cursor = 0;
922 void *addr_pointed1, *addr_pointed2;;
924 switch (type->type) {
925 case DW_TAG_unspecified_type:
928 case DW_TAG_base_type:
929 if (type->name != NULL && strcmp(type->name, "char") == 0) { /* String, hence random (arbitrary ?) size */
930 if (real_area1 == real_area2)
933 return (memcmp(area1, area2, area_size) != 0);
935 if (area_size != -1 && type->byte_size != area_size)
938 return (memcmp(area1, area2, type->byte_size) != 0);
942 case DW_TAG_enumeration_type:
943 if (area_size != -1 && type->byte_size != area_size)
946 return (memcmp(area1, area2, type->byte_size) != 0);
949 case DW_TAG_const_type:
950 case DW_TAG_volatile_type:
951 return compare_heap_area_with_type(state, real_area1, real_area2, area1,
952 area2, snapshot1, snapshot2, previous,
953 type->subtype, area_size, check_ignore,
956 case DW_TAG_array_type:
957 subtype = type->subtype;
958 switch (subtype->type) {
959 case DW_TAG_unspecified_type:
962 case DW_TAG_base_type:
963 case DW_TAG_enumeration_type:
964 case DW_TAG_pointer_type:
965 case DW_TAG_reference_type:
966 case DW_TAG_rvalue_reference_type:
967 case DW_TAG_structure_type:
968 case DW_TAG_class_type:
969 case DW_TAG_union_type:
970 if (subtype->full_type)
971 subtype = subtype->full_type;
972 elm_size = subtype->byte_size;
974 // TODO, just remove the type indirection?
975 case DW_TAG_const_type:
977 case DW_TAG_volatile_type:
978 subsubtype = subtype->subtype;
979 if (subsubtype->full_type)
980 subsubtype = subsubtype->full_type;
981 elm_size = subsubtype->byte_size;
987 for (i = 0; i < type->element_count; i++) {
988 // TODO, add support for variable stride (DW_AT_byte_stride)
990 compare_heap_area_with_type(state,
991 (char *) real_area1 + (i * elm_size),
992 (char *) real_area2 + (i * elm_size),
993 (char *) area1 + (i * elm_size),
994 (char *) area2 + (i * elm_size),
995 snapshot1, snapshot2, previous,
996 type->subtype, subtype->byte_size,
997 check_ignore, pointer_level);
1002 case DW_TAG_reference_type:
1003 case DW_TAG_rvalue_reference_type:
1004 case DW_TAG_pointer_type:
1005 if (type->subtype && type->subtype->type == DW_TAG_subroutine_type) {
1006 addr_pointed1 = *((void **) (area1));
1007 addr_pointed2 = *((void **) (area2));
1008 return (addr_pointed1 != addr_pointed2);;
1011 if (pointer_level > 1) { /* Array of pointers */
1012 for (i = 0; i < (area_size / sizeof(void *)); i++) {
1013 addr_pointed1 = *((void **) ((char *) area1 + (i * sizeof(void *))));
1014 addr_pointed2 = *((void **) ((char *) area2 + (i * sizeof(void *))));
1015 if (addr_pointed1 > state->s_heap
1016 && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1)
1017 && addr_pointed2 > state->s_heap
1018 && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2))
1020 compare_heap_area(addr_pointed1, addr_pointed2, snapshot1,
1021 snapshot2, previous, type->subtype,
1024 res = (addr_pointed1 != addr_pointed2);
1029 addr_pointed1 = *((void **) (area1));
1030 addr_pointed2 = *((void **) (area2));
1031 if (addr_pointed1 > state->s_heap
1032 && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1)
1033 && addr_pointed2 > state->s_heap
1034 && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2))
1035 return compare_heap_area(addr_pointed1, addr_pointed2, snapshot1,
1036 snapshot2, previous, type->subtype,
1039 return (addr_pointed1 != addr_pointed2);
1043 case DW_TAG_structure_type:
1044 case DW_TAG_class_type:
1045 if (type->full_type)
1046 type = type->full_type;
1047 if (area_size != -1 && type->byte_size != area_size) {
1048 if (area_size > type->byte_size && area_size % type->byte_size == 0) {
1049 for (i = 0; i < (area_size / type->byte_size); i++) {
1051 compare_heap_area_with_type(state,
1052 (char *) real_area1 +
1053 (i * type->byte_size),
1054 (char *) real_area2 +
1055 (i * type->byte_size),
1057 (i * type->byte_size),
1059 (i * type->byte_size), snapshot1,
1060 snapshot2, previous, type, -1,
1070 xbt_dynar_foreach(type->members, cursor, member) {
1071 // TODO, optimize this? (for the offset case)
1072 char *real_member1 =
1073 mc_member_resolve(real_area1, type, member, snapshot1);
1074 char *real_member2 =
1075 mc_member_resolve(real_area2, type, member, snapshot2);
1077 mc_translate_address((uintptr_t) real_member1, snapshot1);
1079 mc_translate_address((uintptr_t) real_member2, snapshot2);
1081 compare_heap_area_with_type(state, real_member1, real_member2,
1082 member1, member2, snapshot1, snapshot2,
1083 previous, member->subtype, -1,
1091 case DW_TAG_union_type:
1092 return compare_heap_area_without_type(state, real_area1, real_area2, area1,
1093 area2, snapshot1, snapshot2, previous,
1094 type->byte_size, check_ignore);
1104 /** Infer the type of a part of the block from the type of the block
1106 * TODO, handle DW_TAG_array_type as well as arrays of the object ((*p)[5], p[5])
1108 * TODO, handle subfields ((*p).bar.foo, (*p)[5].bar…)
1110 * @param type_id DWARF type ID of the root address
1112 * @return DWARF type ID for given offset
1114 static dw_type_t get_offset_type(void *real_base_address, dw_type_t type,
1115 int offset, int area_size,
1116 mc_snapshot_t snapshot)
1119 // Beginning of the block, the infered variable type if the type of the block:
1123 switch (type->type) {
1124 case DW_TAG_structure_type:
1125 case DW_TAG_class_type:
1126 if (type->full_type)
1127 type = type->full_type;
1129 if (area_size != -1 && type->byte_size != area_size) {
1130 if (area_size > type->byte_size && area_size % type->byte_size == 0)
1135 unsigned int cursor = 0;
1137 xbt_dynar_foreach(type->members, cursor, member) {
1139 if (!member->location.size) {
1140 // We have the offset, use it directly (shortcut):
1141 if (member->offset == offset)
1142 return member->subtype;
1145 mc_member_resolve(real_base_address, type, member, snapshot);
1146 if (real_member - (char *) real_base_address == offset)
1147 return member->subtype;
1155 /* FIXME : other cases ? */
1163 * @param area1 Process address for state 1
1164 * @param area2 Process address for state 2
1165 * @param snapshot1 Snapshot of state 1
1166 * @param snapshot2 Snapshot of state 2
1167 * @param previous Pairs of blocks already compared on the current path (or NULL)
1168 * @param type_id Type of variable
1169 * @param pointer_level
1170 * @return 0 (same), 1 (different), -1
1172 int compare_heap_area(void *area1, void *area2, mc_snapshot_t snapshot1,
1173 mc_snapshot_t snapshot2, xbt_dynar_t previous,
1174 dw_type_t type, int pointer_level)
1177 struct s_mc_diff *state = mc_diff_info;
1180 ssize_t block1, frag1, block2, frag2;
1182 int check_ignore = 0;
1184 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2, *real_addr_block1,
1185 *real_addr_block2, *real_addr_frag1, *real_addr_frag2;
1186 void *area1_to_compare, *area2_to_compare;
1188 int offset1 = 0, offset2 = 0;
1189 int new_size1 = -1, new_size2 = -1;
1190 dw_type_t new_type1 = NULL, new_type2 = NULL;
1192 int match_pairs = 0;
1194 if (previous == NULL) {
1196 xbt_dynar_new(sizeof(heap_area_pair_t), heap_area_pair_free_voidp);
1199 // Get block number:
1202 (char *) ((xbt_mheap_t) state->s_heap)->heapbase) / BLOCKSIZE + 1;
1205 (char *) ((xbt_mheap_t) state->s_heap)->heapbase) / BLOCKSIZE + 1;
1207 // If either block is a stack block:
1208 if (is_block_stack((int) block1) && is_block_stack((int) block2)) {
1209 add_heap_area_pair(previous, block1, -1, block2, -1);
1211 match_equals(state, previous);
1212 xbt_dynar_free(&previous);
1216 // If either block is not in the expected area of memory:
1217 if (((char *) area1 < (char *) ((xbt_mheap_t) state->s_heap)->heapbase)
1218 || (block1 > state->heapsize1) || (block1 < 1)
1219 || ((char *) area2 < (char *) ((xbt_mheap_t) state->s_heap)->heapbase)
1220 || (block2 > state->heapsize2) || (block2 < 1)) {
1222 xbt_dynar_free(&previous);
1226 // Snapshot address of the block:
1228 ((void *) (((ADDR2UINT(block1)) - 1) * BLOCKSIZE +
1229 (char *) state->heapbase1));
1231 ((void *) (((ADDR2UINT(block2)) - 1) * BLOCKSIZE +
1232 (char *) state->heapbase2));
1234 // Process address of the block:
1236 ((void *) (((ADDR2UINT(block1)) - 1) * BLOCKSIZE +
1237 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
1239 ((void *) (((ADDR2UINT(block2)) - 1) * BLOCKSIZE +
1240 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
1244 if (type->full_type)
1245 type = type->full_type;
1247 // This assume that for "boring" types (volatile ...) byte_size is absent:
1248 while (type->byte_size == 0 && type->subtype != NULL)
1249 type = type->subtype;
1252 if ((type->type == DW_TAG_pointer_type)
1253 || ((type->type == DW_TAG_base_type) && type->name != NULL
1254 && (!strcmp(type->name, "char"))))
1257 type_size = type->byte_size;
1261 if ((state->heapinfo1[block1].type == -1) && (state->heapinfo2[block2].type == -1)) { /* Free block */
1264 match_equals(state, previous);
1265 xbt_dynar_free(&previous);
1269 } else if ((state->heapinfo1[block1].type == 0) && (state->heapinfo2[block2].type == 0)) { /* Complete block */
1271 // TODO, lookup variable type from block type as done for fragmented blocks
1273 if (state->equals_to1_(block1, 0).valid
1274 && state->equals_to2_(block2, 0).valid) {
1275 if (equal_blocks(state, block1, block2)) {
1277 match_equals(state, previous);
1278 xbt_dynar_free(&previous);
1284 if (type_size != -1) {
1285 if (type_size != state->heapinfo1[block1].busy_block.busy_size
1286 && type_size != state->heapinfo2[block2].busy_block.busy_size
1287 && type->name != NULL && !strcmp(type->name, "s_smx_context")) {
1289 match_equals(state, previous);
1290 xbt_dynar_free(&previous);
1296 if (state->heapinfo1[block1].busy_block.size !=
1297 state->heapinfo2[block2].busy_block.size) {
1299 xbt_dynar_free(&previous);
1304 if (state->heapinfo1[block1].busy_block.busy_size !=
1305 state->heapinfo2[block2].busy_block.busy_size) {
1307 xbt_dynar_free(&previous);
1312 if (!add_heap_area_pair(previous, block1, -1, block2, -1)) {
1314 match_equals(state, previous);
1315 xbt_dynar_free(&previous);
1320 size = state->heapinfo1[block1].busy_block.busy_size;
1322 // Remember (basic) type inference.
1323 // The current data structure only allows us to do this for the whole block.
1324 if (type != NULL && area1 == real_addr_block1) {
1325 state->types1_(block1, 0) = type;
1327 if (type != NULL && area2 == real_addr_block2) {
1328 state->types2_(block2, 0) = type;
1333 match_equals(state, previous);
1334 xbt_dynar_free(&previous);
1342 area1_to_compare = addr_block1;
1343 area2_to_compare = addr_block2;
1345 if ((state->heapinfo1[block1].busy_block.ignore > 0)
1346 && (state->heapinfo2[block2].busy_block.ignore ==
1347 state->heapinfo1[block1].busy_block.ignore))
1348 check_ignore = state->heapinfo1[block1].busy_block.ignore;
1350 } else if ((state->heapinfo1[block1].type > 0) && (state->heapinfo2[block2].type > 0)) { /* Fragmented block */
1354 ((uintptr_t) (ADDR2UINT(area1) % (BLOCKSIZE))) >> state->
1355 heapinfo1[block1].type;
1357 ((uintptr_t) (ADDR2UINT(area2) % (BLOCKSIZE))) >> state->
1358 heapinfo2[block2].type;
1360 // Snapshot address of the fragment:
1362 (void *) ((char *) addr_block1 +
1363 (frag1 << state->heapinfo1[block1].type));
1365 (void *) ((char *) addr_block2 +
1366 (frag2 << state->heapinfo2[block2].type));
1368 // Process address of the fragment:
1370 (void *) ((char *) real_addr_block1 +
1371 (frag1 << state->heapinfo1[block1].type));
1373 (void *) ((char *) real_addr_block2 +
1374 (frag2 << state->heapinfo2[block2].type));
1376 // Check the size of the fragments against the size of the type:
1377 if (type_size != -1) {
1378 if (state->heapinfo1[block1].busy_frag.frag_size[frag1] == -1
1379 || state->heapinfo2[block2].busy_frag.frag_size[frag2] == -1) {
1381 match_equals(state, previous);
1382 xbt_dynar_free(&previous);
1386 if (type_size != state->heapinfo1[block1].busy_frag.frag_size[frag1]
1387 || type_size != state->heapinfo2[block2].busy_frag.frag_size[frag2]) {
1389 match_equals(state, previous);
1390 xbt_dynar_free(&previous);
1395 // Check if the blocks are already matched together:
1396 if (state->equals_to1_(block1, frag1).valid
1397 && state->equals_to2_(block2, frag2).valid) {
1398 if (equal_fragments(state, block1, frag1, block2, frag2)) {
1400 match_equals(state, previous);
1401 xbt_dynar_free(&previous);
1406 // Compare the size of both fragments:
1407 if (state->heapinfo1[block1].busy_frag.frag_size[frag1] !=
1408 state->heapinfo2[block2].busy_frag.frag_size[frag2]) {
1409 if (type_size == -1) {
1411 match_equals(state, previous);
1412 xbt_dynar_free(&previous);
1417 xbt_dynar_free(&previous);
1422 // Size of the fragment:
1423 size = state->heapinfo1[block1].busy_frag.frag_size[frag1];
1425 // Remember (basic) type inference.
1426 // The current data structure only allows us to do this for the whole block.
1427 if (type != NULL && area1 == real_addr_frag1) {
1428 state->types1_(block1, frag1) = type;
1430 if (type != NULL && area2 == real_addr_frag2) {
1431 state->types2_(block2, frag2) = type;
1433 // The type of the variable is already known:
1438 // Type inference from the block type.
1439 else if (state->types1_(block1, frag1) != NULL
1440 || state->types2_(block2, frag2) != NULL) {
1442 offset1 = (char *) area1 - (char *) real_addr_frag1;
1443 offset2 = (char *) area2 - (char *) real_addr_frag2;
1445 if (state->types1_(block1, frag1) != NULL
1446 && state->types2_(block2, frag2) != NULL) {
1448 get_offset_type(real_addr_frag1, state->types1_(block1, frag1),
1449 offset1, size, snapshot1);
1451 get_offset_type(real_addr_frag2, state->types2_(block2, frag2),
1452 offset1, size, snapshot2);
1453 } else if (state->types1_(block1, frag1) != NULL) {
1455 get_offset_type(real_addr_frag1, state->types1_(block1, frag1),
1456 offset1, size, snapshot1);
1458 get_offset_type(real_addr_frag2, state->types1_(block1, frag1),
1459 offset2, size, snapshot2);
1460 } else if (state->types2_(block2, frag2) != NULL) {
1462 get_offset_type(real_addr_frag1, state->types2_(block2, frag2),
1463 offset1, size, snapshot1);
1465 get_offset_type(real_addr_frag2, state->types2_(block2, frag2),
1466 offset2, size, snapshot2);
1469 match_equals(state, previous);
1470 xbt_dynar_free(&previous);
1475 if (new_type1 != NULL && new_type2 != NULL && new_type1 != new_type2) {
1478 while (type->byte_size == 0 && type->subtype != NULL)
1479 type = type->subtype;
1480 new_size1 = type->byte_size;
1483 while (type->byte_size == 0 && type->subtype != NULL)
1484 type = type->subtype;
1485 new_size2 = type->byte_size;
1489 match_equals(state, previous);
1490 xbt_dynar_free(&previous);
1496 area1_to_compare = (char *) addr_frag1 + offset1;
1497 area2_to_compare = (char *) addr_frag2 + offset2;
1499 if (new_size1 > 0 && new_size1 == new_size2) {
1504 if (offset1 == 0 && offset2 == 0) {
1505 if (!add_heap_area_pair(previous, block1, frag1, block2, frag2)) {
1507 match_equals(state, previous);
1508 xbt_dynar_free(&previous);
1516 match_equals(state, previous);
1517 xbt_dynar_free(&previous);
1522 if ((state->heapinfo1[block1].busy_frag.ignore[frag1] > 0)
1523 && (state->heapinfo2[block2].busy_frag.ignore[frag2] ==
1524 state->heapinfo1[block1].busy_frag.ignore[frag1]))
1525 check_ignore = state->heapinfo1[block1].busy_frag.ignore[frag1];
1530 xbt_dynar_free(&previous);
1537 /* Start comparison */
1540 compare_heap_area_with_type(state, area1, area2, area1_to_compare,
1541 area2_to_compare, snapshot1, snapshot2,
1542 previous, type, size, check_ignore,
1546 compare_heap_area_without_type(state, area1, area2, area1_to_compare,
1547 area2_to_compare, snapshot1, snapshot2,
1548 previous, size, check_ignore);
1550 if (res_compare == 1) {
1552 xbt_dynar_free(&previous);
1557 match_equals(state, previous);
1558 xbt_dynar_free(&previous);
1564 /*********************************************** Miscellaneous ***************************************************/
1565 /****************************************************************************************************************/
1568 static int get_pointed_area_size(void *area, int heap)
1571 struct s_mc_diff *state = mc_diff_info;
1574 malloc_info *heapinfo;
1577 heapinfo = state->heapinfo1;
1579 heapinfo = state->heapinfo2;
1583 (char *) ((xbt_mheap_t) state->s_heap)->heapbase) / BLOCKSIZE + 1;
1585 if (((char *) area < (char *) ((xbt_mheap_t) state->s_heap)->heapbase)
1586 || (block > state->heapsize1) || (block < 1))
1589 if (heapinfo[block].type == -1) { /* Free block */
1591 } else if (heapinfo[block].type == 0) { /* Complete block */
1592 return (int) heapinfo[block].busy_block.busy_size;
1595 ((uintptr_t) (ADDR2UINT(area) % (BLOCKSIZE))) >> heapinfo[block].type;
1596 return (int) heapinfo[block].busy_frag.frag_size[frag];
1602 char *get_type_description(mc_object_info_t info, char *type_name)
1605 xbt_dict_cursor_t dict_cursor;
1609 xbt_dict_foreach(info->types, dict_cursor, type_origin, type) {
1610 if (type->name && (strcmp(type->name, type_name) == 0)
1611 && type->byte_size > 0) {
1612 xbt_dict_cursor_free(&dict_cursor);
1617 xbt_dict_cursor_free(&dict_cursor);
1623 #define max( a, b ) ( ((a) > (b)) ? (a) : (b) )
1627 int mmalloc_linear_compare_heap(xbt_mheap_t heap1, xbt_mheap_t heap2)
1630 struct s_mc_diff *state = mc_diff_info;
1632 if (heap1 == NULL && heap1 == NULL) {
1633 XBT_DEBUG("Malloc descriptors null");
1637 if (heap1->heaplimit != heap2->heaplimit) {
1638 XBT_DEBUG("Different limit of valid info table indices");
1642 /* Heap information */
1643 state->heaplimit = ((struct mdesc *) heap1)->heaplimit;
1646 // Mamailloute in order to find the base address of the main heap:
1648 (char *) mmalloc_get_current_heap() - STD_HEAP_SIZE - xbt_pagesize;
1650 state->heapbase1 = (char *) heap1 + BLOCKSIZE;
1651 state->heapbase2 = (char *) heap2 + BLOCKSIZE;
1654 (malloc_info *) ((char *) heap1 +
1656 ((char *) heap1->heapinfo - (char *) state->s_heap)));
1658 (malloc_info *) ((char *) heap2 +
1660 ((char *) heap2->heapinfo - (char *) state->s_heap)));
1662 state->heapsize1 = heap1->heapsize;
1663 state->heapsize2 = heap2->heapsize;
1665 /* Start comparison */
1667 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
1671 /* Check busy blocks */
1675 while (i <= state->heaplimit) {
1678 ((void *) (((ADDR2UINT(i)) - 1) * BLOCKSIZE +
1679 (char *) state->heapbase1));
1681 ((void *) (((ADDR2UINT(i)) - 1) * BLOCKSIZE +
1682 (char *) state->heapbase2));
1684 if (state->heapinfo1[i].type != state->heapinfo2[i].type) {
1686 distance += BLOCKSIZE;
1687 XBT_DEBUG("Different type of blocks (%zu) : %d - %d -> distance = %d", i,
1688 state->heapinfo1[i].type, state->heapinfo2[i].type, distance);
1693 if (state->heapinfo1[i].type == -1) { /* Free block */
1698 if (state->heapinfo1[i].type == 0) { /* Large block */
1700 if (state->heapinfo1[i].busy_block.size !=
1701 state->heapinfo2[i].busy_block.size) {
1703 BLOCKSIZE * max(state->heapinfo1[i].busy_block.size,
1704 state->heapinfo2[i].busy_block.size);
1705 i += max(state->heapinfo1[i].busy_block.size,
1706 state->heapinfo2[i].busy_block.size);
1708 ("Different larger of cluster at block %zu : %zu - %zu -> distance = %d",
1709 i, state->heapinfo1[i].busy_block.size,
1710 state->heapinfo2[i].busy_block.size, distance);
1714 /*if(heapinfo1[i].busy_block.busy_size != heapinfo2[i].busy_block.busy_size){
1715 distance += max(heapinfo1[i].busy_block.busy_size, heapinfo2[i].busy_block.busy_size);
1716 i += max(heapinfo1[i].busy_block.size, heapinfo2[i].busy_block.size);
1717 XBT_DEBUG("Different size used oin large cluster at block %zu : %zu - %zu -> distance = %d", i, heapinfo1[i].busy_block.busy_size, heapinfo2[i].busy_block.busy_size, distance);
1723 //while(k < (heapinfo1[i].busy_block.busy_size)){
1724 while (k < state->heapinfo1[i].busy_block.size * BLOCKSIZE) {
1725 if (memcmp((char *) addr_block1 + k, (char *) addr_block2 + k, 1) !=
1734 } else { /* Fragmented block */
1736 for (j = 0; j < (size_t) (BLOCKSIZE >> state->heapinfo1[i].type); j++) {
1739 (void *) ((char *) addr_block1 + (j << state->heapinfo1[i].type));
1741 (void *) ((char *) addr_block2 + (j << state->heapinfo2[i].type));
1743 if (state->heapinfo1[i].busy_frag.frag_size[j] == 0
1744 && state->heapinfo2[i].busy_frag.frag_size[j] == 0) {
1749 /*if(heapinfo1[i].busy_frag.frag_size[j] != heapinfo2[i].busy_frag.frag_size[j]){
1750 distance += max(heapinfo1[i].busy_frag.frag_size[j], heapinfo2[i].busy_frag.frag_size[j]);
1751 XBT_DEBUG("Different size used in fragment %zu in block %zu : %d - %d -> distance = %d", j, i, heapinfo1[i].busy_frag.frag_size[j], heapinfo2[i].busy_frag.frag_size[j], distance);
1757 //while(k < max(heapinfo1[i].busy_frag.frag_size[j], heapinfo2[i].busy_frag.frag_size[j])){
1758 while (k < (BLOCKSIZE / (BLOCKSIZE >> state->heapinfo1[i].type))) {
1759 if (memcmp((char *) addr_frag1 + k, (char *) addr_frag2 + k, 1) !=