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 *));
428 void reset_heap_information()
433 int mmalloc_compare_heap(mc_snapshot_t snapshot1, mc_snapshot_t snapshot2)
436 struct s_mc_diff *state = mc_diff_info;
438 /* Start comparison */
439 size_t i1, i2, j1, j2, k;
440 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
441 int nb_diff1 = 0, nb_diff2 = 0;
443 xbt_dynar_t previous =
444 xbt_dynar_new(sizeof(heap_area_pair_t), heap_area_pair_free_voidp);
446 int equal, res_compare = 0;
448 /* Check busy blocks */
452 while (i1 <= state->heaplimit) {
454 if (state->heapinfo1[i1].type == -1) { /* Free block */
460 ((void *) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE +
461 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
463 if (state->heapinfo1[i1].type == 0) { /* Large block */
465 if (is_stack(addr_block1)) {
466 for (k = 0; k < state->heapinfo1[i1].busy_block.size; k++)
467 state->equals_to1_(i1 + k, 0) = make_heap_area(i1, -1);
468 for (k = 0; k < state->heapinfo2[i1].busy_block.size; k++)
469 state->equals_to2_(i1 + k, 0) = make_heap_area(i1, -1);
470 i1 += state->heapinfo1[i1].busy_block.size;
474 if (state->equals_to1_(i1, 0).valid) {
483 /* Try first to associate to same block in the other heap */
484 if (state->heapinfo2[i1].type == state->heapinfo1[i1].type) {
486 if (state->equals_to2_(i1, 0).valid == 0) {
489 ((void *) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE +
490 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
493 compare_heap_area(addr_block1, addr_block2, snapshot1, snapshot2,
496 if (res_compare != 1) {
497 for (k = 1; k < state->heapinfo2[i1].busy_block.size; k++)
498 state->equals_to2_(i1 + k, 0) = make_heap_area(i1, -1);
499 for (k = 1; k < state->heapinfo1[i1].busy_block.size; k++)
500 state->equals_to1_(i1 + k, 0) = make_heap_area(i1, -1);
502 i1 += state->heapinfo1[i1].busy_block.size;
505 xbt_dynar_reset(previous);
511 while (i2 <= state->heaplimit && !equal) {
514 ((void *) (((ADDR2UINT(i2)) - 1) * BLOCKSIZE +
515 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
522 if (state->heapinfo2[i2].type != 0) {
527 if (state->equals_to2_(i2, 0).valid) {
533 compare_heap_area(addr_block1, addr_block2, snapshot1, snapshot2,
536 if (res_compare != 1) {
537 for (k = 1; k < state->heapinfo2[i2].busy_block.size; k++)
538 state->equals_to2_(i2 + k, 0) = make_heap_area(i1, -1);
539 for (k = 1; k < state->heapinfo1[i1].busy_block.size; k++)
540 state->equals_to1_(i1 + k, 0) = make_heap_area(i2, -1);
542 i1 += state->heapinfo1[i1].busy_block.size;
545 xbt_dynar_reset(previous);
552 XBT_DEBUG("Block %zu not found (size_used = %zu, addr = %p)", i1,
553 state->heapinfo1[i1].busy_block.busy_size, addr_block1);
554 i1 = state->heaplimit + 1;
559 } else { /* Fragmented block */
561 for (j1 = 0; j1 < (size_t) (BLOCKSIZE >> state->heapinfo1[i1].type); j1++) {
563 if (state->heapinfo1[i1].busy_frag.frag_size[j1] == -1) /* Free fragment */
566 if (state->equals_to1_(i1, j1).valid)
570 (void *) ((char *) addr_block1 + (j1 << state->heapinfo1[i1].type));
575 /* Try first to associate to same fragment in the other heap */
576 if (state->heapinfo2[i1].type == state->heapinfo1[i1].type) {
578 if (state->equals_to2_(i1, j1).valid == 0) {
581 ((void *) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE +
582 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
584 (void *) ((char *) addr_block2 +
585 (j1 << ((xbt_mheap_t) state->s_heap)->heapinfo[i1].
589 compare_heap_area(addr_frag1, addr_frag2, snapshot1, snapshot2,
592 if (res_compare != 1)
595 xbt_dynar_reset(previous);
601 while (i2 <= state->heaplimit && !equal) {
603 if (state->heapinfo2[i2].type <= 0) {
608 for (j2 = 0; j2 < (size_t) (BLOCKSIZE >> state->heapinfo2[i2].type);
611 if (i2 == i1 && j2 == j1)
614 if (state->equals_to2_(i2, j2).valid)
618 ((void *) (((ADDR2UINT(i2)) - 1) * BLOCKSIZE +
619 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
621 (void *) ((char *) addr_block2 +
622 (j2 << ((xbt_mheap_t) state->s_heap)->heapinfo[i2].
626 compare_heap_area(addr_frag1, addr_frag2, snapshot2, snapshot2,
629 if (res_compare != 1) {
631 xbt_dynar_reset(previous);
635 xbt_dynar_reset(previous);
645 ("Block %zu, fragment %zu not found (size_used = %zd, address = %p)\n",
646 i1, j1, state->heapinfo1[i1].busy_frag.frag_size[j1],
648 i2 = state->heaplimit + 1;
649 i1 = state->heaplimit + 1;
662 /* All blocks/fragments are equal to another block/fragment ? */
664 void *real_addr_frag1 = NULL, *real_addr_block1 = NULL, *real_addr_block2 =
665 NULL, *real_addr_frag2 = NULL;
667 while (i <= state->heaplimit) {
668 if (state->heapinfo1[i].type == 0) {
669 if (i1 == state->heaplimit) {
670 if (state->heapinfo1[i].busy_block.busy_size > 0) {
671 if (state->equals_to1_(i, 0).valid == 0) {
672 if (XBT_LOG_ISENABLED(mc_diff, xbt_log_priority_debug)) {
674 ((void *) (((ADDR2UINT(i)) - 1) * BLOCKSIZE +
675 (char *) state->heapbase1));
676 XBT_DEBUG("Block %zu (%p) not found (size used = %zu)", i,
677 addr_block1, state->heapinfo1[i].busy_block.busy_size);
678 //mmalloc_backtrace_block_display((void*)heapinfo1, i);
685 if (state->heapinfo1[i].type > 0) {
687 ((void *) (((ADDR2UINT(i)) - 1) * BLOCKSIZE +
688 (char *) state->heapbase1));
690 ((void *) (((ADDR2UINT(i)) - 1) * BLOCKSIZE +
691 (char *) ((struct mdesc *) state->s_heap)->heapbase));
692 for (j = 0; j < (size_t) (BLOCKSIZE >> state->heapinfo1[i].type); j++) {
693 if (i1 == state->heaplimit) {
694 if (state->heapinfo1[i].busy_frag.frag_size[j] > 0) {
695 if (state->equals_to1_(i, j).valid == 0) {
696 if (XBT_LOG_ISENABLED(mc_diff, xbt_log_priority_debug)) {
698 (void *) ((char *) addr_block1 +
699 (j << state->heapinfo1[i].type));
701 (void *) ((char *) real_addr_block1 +
702 (j << ((struct mdesc *) state->s_heap)->
705 ("Block %zu, Fragment %zu (%p - %p) not found (size used = %zd)",
706 i, j, addr_frag1, real_addr_frag1,
707 state->heapinfo1[i].busy_frag.frag_size[j]);
708 //mmalloc_backtrace_fragment_display((void*)heapinfo1, i, j);
719 if (i1 == state->heaplimit)
720 XBT_DEBUG("Number of blocks/fragments not found in heap1 : %d", nb_diff1);
724 while (i <= state->heaplimit) {
725 if (state->heapinfo2[i].type == 0) {
726 if (i1 == state->heaplimit) {
727 if (state->heapinfo2[i].busy_block.busy_size > 0) {
728 if (state->equals_to2_(i, 0).valid == 0) {
729 if (XBT_LOG_ISENABLED(mc_diff, xbt_log_priority_debug)) {
731 ((void *) (((ADDR2UINT(i)) - 1) * BLOCKSIZE +
732 (char *) state->heapbase2));
733 XBT_DEBUG("Block %zu (%p) not found (size used = %zu)", i,
734 addr_block2, state->heapinfo2[i].busy_block.busy_size);
735 //mmalloc_backtrace_block_display((void*)heapinfo2, i);
742 if (state->heapinfo2[i].type > 0) {
744 ((void *) (((ADDR2UINT(i)) - 1) * BLOCKSIZE +
745 (char *) state->heapbase2));
747 ((void *) (((ADDR2UINT(i)) - 1) * BLOCKSIZE +
748 (char *) ((struct mdesc *) state->s_heap)->heapbase));
749 for (j = 0; j < (size_t) (BLOCKSIZE >> state->heapinfo2[i].type); j++) {
750 if (i1 == state->heaplimit) {
751 if (state->heapinfo2[i].busy_frag.frag_size[j] > 0) {
752 if (state->equals_to2_(i, j).valid == 0) {
753 if (XBT_LOG_ISENABLED(mc_diff, xbt_log_priority_debug)) {
755 (void *) ((char *) addr_block2 +
756 (j << state->heapinfo2[i].type));
758 (void *) ((char *) real_addr_block2 +
759 (j << ((struct mdesc *) state->s_heap)->
762 ("Block %zu, Fragment %zu (%p - %p) not found (size used = %zd)",
763 i, j, addr_frag2, real_addr_frag2,
764 state->heapinfo2[i].busy_frag.frag_size[j]);
765 //mmalloc_backtrace_fragment_display((void*)heapinfo2, i, j);
776 if (i1 == state->heaplimit)
777 XBT_DEBUG("Number of blocks/fragments not found in heap2 : %d", nb_diff2);
779 xbt_dynar_free(&previous);
780 real_addr_frag1 = NULL, real_addr_block1 = NULL, real_addr_block2 =
781 NULL, real_addr_frag2 = NULL;
783 return ((nb_diff1 > 0) || (nb_diff2 > 0));
789 * @param real_area1 Process address for state 1
790 * @param real_area2 Process address for state 2
791 * @param area1 Snapshot address for state 1
792 * @param area2 Snapshot address for state 2
793 * @param snapshot1 Snapshot of state 1
794 * @param snapshot2 Snapshot of state 2
797 * @param check_ignore
799 static int compare_heap_area_without_type(struct s_mc_diff *state,
800 void *real_area1, void *real_area2,
801 void *area1, void *area2,
802 mc_snapshot_t snapshot1,
803 mc_snapshot_t snapshot2,
804 xbt_dynar_t previous, int size,
809 void *addr_pointed1, *addr_pointed2;
810 int pointer_align, res_compare;
811 ssize_t ignore1, ignore2;
815 if (check_ignore > 0) {
817 heap_comparison_ignore_size(state->to_ignore1,
818 (char *) real_area1 + i)) != -1) {
820 heap_comparison_ignore_size(state->to_ignore2,
821 (char *) real_area2 + i)) == ignore1) {
834 if (memcmp(((char *) area1) + i, ((char *) area2) + i, 1) != 0) {
836 pointer_align = (i / sizeof(void *)) * sizeof(void *);
837 addr_pointed1 = *((void **) ((char *) area1 + pointer_align));
838 addr_pointed2 = *((void **) ((char *) area2 + pointer_align));
840 if (addr_pointed1 > maestro_stack_start
841 && addr_pointed1 < maestro_stack_end
842 && addr_pointed2 > maestro_stack_start
843 && addr_pointed2 < maestro_stack_end) {
844 i = pointer_align + sizeof(void *);
846 } else if (addr_pointed1 > state->s_heap
847 && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1)
848 && addr_pointed2 > state->s_heap
849 && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2)) {
850 // Both addreses are in the heap:
852 compare_heap_area(addr_pointed1, addr_pointed2, snapshot1,
853 snapshot2, previous, NULL, 0);
854 if (res_compare == 1) {
857 i = pointer_align + sizeof(void *);
876 * @param real_area1 Process address for state 1
877 * @param real_area2 Process address for state 2
878 * @param area1 Snapshot address for state 1
879 * @param area2 Snapshot address for state 2
880 * @param snapshot1 Snapshot of state 1
881 * @param snapshot2 Snapshot of state 2
884 * @param area_size either a byte_size or an elements_count (?)
885 * @param check_ignore
886 * @param pointer_level
887 * @return 0 (same), 1 (different), -1 (unknown)
889 static int compare_heap_area_with_type(struct s_mc_diff *state,
890 void *real_area1, void *real_area2,
891 void *area1, void *area2,
892 mc_snapshot_t snapshot1,
893 mc_snapshot_t snapshot2,
894 xbt_dynar_t previous, dw_type_t type,
895 int area_size, int check_ignore,
899 if (is_stack(real_area1) && is_stack(real_area2))
902 ssize_t ignore1, ignore2;
904 if ((check_ignore > 0)
905 && ((ignore1 = heap_comparison_ignore_size(state->to_ignore1, real_area1))
907 && ((ignore2 = heap_comparison_ignore_size(state->to_ignore2, real_area2))
912 dw_type_t subtype, subsubtype;
913 int res, elm_size, i;
914 unsigned int cursor = 0;
916 void *addr_pointed1, *addr_pointed2;;
918 switch (type->type) {
919 case DW_TAG_unspecified_type:
922 case DW_TAG_base_type:
923 if (type->name != NULL && strcmp(type->name, "char") == 0) { /* String, hence random (arbitrary ?) size */
924 if (real_area1 == real_area2)
927 return (memcmp(area1, area2, area_size) != 0);
929 if (area_size != -1 && type->byte_size != area_size)
932 return (memcmp(area1, area2, type->byte_size) != 0);
936 case DW_TAG_enumeration_type:
937 if (area_size != -1 && type->byte_size != area_size)
940 return (memcmp(area1, area2, type->byte_size) != 0);
943 case DW_TAG_const_type:
944 case DW_TAG_volatile_type:
945 return compare_heap_area_with_type(state, real_area1, real_area2, area1,
946 area2, snapshot1, snapshot2, previous,
947 type->subtype, area_size, check_ignore,
950 case DW_TAG_array_type:
951 subtype = type->subtype;
952 switch (subtype->type) {
953 case DW_TAG_unspecified_type:
956 case DW_TAG_base_type:
957 case DW_TAG_enumeration_type:
958 case DW_TAG_pointer_type:
959 case DW_TAG_reference_type:
960 case DW_TAG_rvalue_reference_type:
961 case DW_TAG_structure_type:
962 case DW_TAG_class_type:
963 case DW_TAG_union_type:
964 if (subtype->full_type)
965 subtype = subtype->full_type;
966 elm_size = subtype->byte_size;
968 // TODO, just remove the type indirection?
969 case DW_TAG_const_type:
971 case DW_TAG_volatile_type:
972 subsubtype = subtype->subtype;
973 if (subsubtype->full_type)
974 subsubtype = subsubtype->full_type;
975 elm_size = subsubtype->byte_size;
981 for (i = 0; i < type->element_count; i++) {
982 // TODO, add support for variable stride (DW_AT_byte_stride)
984 compare_heap_area_with_type(state,
985 (char *) real_area1 + (i * elm_size),
986 (char *) real_area2 + (i * elm_size),
987 (char *) area1 + (i * elm_size),
988 (char *) area2 + (i * elm_size),
989 snapshot1, snapshot2, previous,
990 type->subtype, subtype->byte_size,
991 check_ignore, pointer_level);
996 case DW_TAG_reference_type:
997 case DW_TAG_rvalue_reference_type:
998 case DW_TAG_pointer_type:
999 if (type->subtype && type->subtype->type == DW_TAG_subroutine_type) {
1000 addr_pointed1 = *((void **) (area1));
1001 addr_pointed2 = *((void **) (area2));
1002 return (addr_pointed1 != addr_pointed2);;
1005 if (pointer_level > 1) { /* Array of pointers */
1006 for (i = 0; i < (area_size / sizeof(void *)); i++) {
1007 addr_pointed1 = *((void **) ((char *) area1 + (i * sizeof(void *))));
1008 addr_pointed2 = *((void **) ((char *) area2 + (i * sizeof(void *))));
1009 if (addr_pointed1 > state->s_heap
1010 && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1)
1011 && addr_pointed2 > state->s_heap
1012 && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2))
1014 compare_heap_area(addr_pointed1, addr_pointed2, snapshot1,
1015 snapshot2, previous, type->subtype,
1018 res = (addr_pointed1 != addr_pointed2);
1023 addr_pointed1 = *((void **) (area1));
1024 addr_pointed2 = *((void **) (area2));
1025 if (addr_pointed1 > state->s_heap
1026 && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1)
1027 && addr_pointed2 > state->s_heap
1028 && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2))
1029 return compare_heap_area(addr_pointed1, addr_pointed2, snapshot1,
1030 snapshot2, previous, type->subtype,
1033 return (addr_pointed1 != addr_pointed2);
1037 case DW_TAG_structure_type:
1038 case DW_TAG_class_type:
1039 if (type->full_type)
1040 type = type->full_type;
1041 if (area_size != -1 && type->byte_size != area_size) {
1042 if (area_size > type->byte_size && area_size % type->byte_size == 0) {
1043 for (i = 0; i < (area_size / type->byte_size); i++) {
1045 compare_heap_area_with_type(state,
1046 (char *) real_area1 +
1047 (i * type->byte_size),
1048 (char *) real_area2 +
1049 (i * type->byte_size),
1051 (i * type->byte_size),
1053 (i * type->byte_size), snapshot1,
1054 snapshot2, previous, type, -1,
1064 xbt_dynar_foreach(type->members, cursor, member) {
1065 // TODO, optimize this? (for the offset case)
1066 char *real_member1 =
1067 mc_member_resolve(real_area1, type, member, snapshot1);
1068 char *real_member2 =
1069 mc_member_resolve(real_area2, type, member, snapshot2);
1071 mc_translate_address((uintptr_t) real_member1, snapshot1);
1073 mc_translate_address((uintptr_t) real_member2, snapshot2);
1075 compare_heap_area_with_type(state, real_member1, real_member2,
1076 member1, member2, snapshot1, snapshot2,
1077 previous, member->subtype, -1,
1085 case DW_TAG_union_type:
1086 return compare_heap_area_without_type(state, real_area1, real_area2, area1,
1087 area2, snapshot1, snapshot2, previous,
1088 type->byte_size, check_ignore);
1098 /** Infer the type of a part of the block from the type of the block
1100 * TODO, handle DW_TAG_array_type as well as arrays of the object ((*p)[5], p[5])
1102 * TODO, handle subfields ((*p).bar.foo, (*p)[5].bar…)
1104 * @param type_id DWARF type ID of the root address
1106 * @return DWARF type ID for given offset
1108 static dw_type_t get_offset_type(void *real_base_address, dw_type_t type,
1109 int offset, int area_size,
1110 mc_snapshot_t snapshot)
1113 // Beginning of the block, the infered variable type if the type of the block:
1117 switch (type->type) {
1118 case DW_TAG_structure_type:
1119 case DW_TAG_class_type:
1120 if (type->full_type)
1121 type = type->full_type;
1123 if (area_size != -1 && type->byte_size != area_size) {
1124 if (area_size > type->byte_size && area_size % type->byte_size == 0)
1129 unsigned int cursor = 0;
1131 xbt_dynar_foreach(type->members, cursor, member) {
1133 if (!member->location.size) {
1134 // We have the offset, use it directly (shortcut):
1135 if (member->offset == offset)
1136 return member->subtype;
1139 mc_member_resolve(real_base_address, type, member, snapshot);
1140 if (real_member - (char *) real_base_address == offset)
1141 return member->subtype;
1149 /* FIXME : other cases ? */
1157 * @param area1 Process address for state 1
1158 * @param area2 Process address for state 2
1159 * @param snapshot1 Snapshot of state 1
1160 * @param snapshot2 Snapshot of state 2
1161 * @param previous Pairs of blocks already compared on the current path (or NULL)
1162 * @param type_id Type of variable
1163 * @param pointer_level
1164 * @return 0 (same), 1 (different), -1
1166 int compare_heap_area(void *area1, void *area2, mc_snapshot_t snapshot1,
1167 mc_snapshot_t snapshot2, xbt_dynar_t previous,
1168 dw_type_t type, int pointer_level)
1171 struct s_mc_diff *state = mc_diff_info;
1174 ssize_t block1, frag1, block2, frag2;
1176 int check_ignore = 0;
1178 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2, *real_addr_block1,
1179 *real_addr_block2, *real_addr_frag1, *real_addr_frag2;
1180 void *area1_to_compare, *area2_to_compare;
1182 int offset1 = 0, offset2 = 0;
1183 int new_size1 = -1, new_size2 = -1;
1184 dw_type_t new_type1 = NULL, new_type2 = NULL;
1186 int match_pairs = 0;
1188 if (previous == NULL) {
1190 xbt_dynar_new(sizeof(heap_area_pair_t), heap_area_pair_free_voidp);
1193 // Get block number:
1196 (char *) ((xbt_mheap_t) state->s_heap)->heapbase) / BLOCKSIZE + 1;
1199 (char *) ((xbt_mheap_t) state->s_heap)->heapbase) / BLOCKSIZE + 1;
1201 // If either block is a stack block:
1202 if (is_block_stack((int) block1) && is_block_stack((int) block2)) {
1203 add_heap_area_pair(previous, block1, -1, block2, -1);
1205 match_equals(state, previous);
1206 xbt_dynar_free(&previous);
1210 // If either block is not in the expected area of memory:
1211 if (((char *) area1 < (char *) ((xbt_mheap_t) state->s_heap)->heapbase)
1212 || (block1 > state->heapsize1) || (block1 < 1)
1213 || ((char *) area2 < (char *) ((xbt_mheap_t) state->s_heap)->heapbase)
1214 || (block2 > state->heapsize2) || (block2 < 1)) {
1216 xbt_dynar_free(&previous);
1220 // Snapshot address of the block:
1222 ((void *) (((ADDR2UINT(block1)) - 1) * BLOCKSIZE +
1223 (char *) state->heapbase1));
1225 ((void *) (((ADDR2UINT(block2)) - 1) * BLOCKSIZE +
1226 (char *) state->heapbase2));
1228 // Process address of the block:
1230 ((void *) (((ADDR2UINT(block1)) - 1) * BLOCKSIZE +
1231 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
1233 ((void *) (((ADDR2UINT(block2)) - 1) * BLOCKSIZE +
1234 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
1238 if (type->full_type)
1239 type = type->full_type;
1241 // This assume that for "boring" types (volatile ...) byte_size is absent:
1242 while (type->byte_size == 0 && type->subtype != NULL)
1243 type = type->subtype;
1246 if ((type->type == DW_TAG_pointer_type)
1247 || ((type->type == DW_TAG_base_type) && type->name != NULL
1248 && (!strcmp(type->name, "char"))))
1251 type_size = type->byte_size;
1255 if ((state->heapinfo1[block1].type == -1) && (state->heapinfo2[block2].type == -1)) { /* Free block */
1258 match_equals(state, previous);
1259 xbt_dynar_free(&previous);
1263 } else if ((state->heapinfo1[block1].type == 0) && (state->heapinfo2[block2].type == 0)) { /* Complete block */
1265 // TODO, lookup variable type from block type as done for fragmented blocks
1267 if (state->equals_to1_(block1, 0).valid
1268 && state->equals_to2_(block2, 0).valid) {
1269 if (equal_blocks(state, block1, block2)) {
1271 match_equals(state, previous);
1272 xbt_dynar_free(&previous);
1278 if (type_size != -1) {
1279 if (type_size != state->heapinfo1[block1].busy_block.busy_size
1280 && type_size != state->heapinfo2[block2].busy_block.busy_size
1281 && type->name != NULL && !strcmp(type->name, "s_smx_context")) {
1283 match_equals(state, previous);
1284 xbt_dynar_free(&previous);
1290 if (state->heapinfo1[block1].busy_block.size !=
1291 state->heapinfo2[block2].busy_block.size) {
1293 xbt_dynar_free(&previous);
1298 if (state->heapinfo1[block1].busy_block.busy_size !=
1299 state->heapinfo2[block2].busy_block.busy_size) {
1301 xbt_dynar_free(&previous);
1306 if (!add_heap_area_pair(previous, block1, -1, block2, -1)) {
1308 match_equals(state, previous);
1309 xbt_dynar_free(&previous);
1314 size = state->heapinfo1[block1].busy_block.busy_size;
1316 // Remember (basic) type inference.
1317 // The current data structure only allows us to do this for the whole block.
1318 if (type != NULL && area1 == real_addr_block1) {
1319 state->types1_(block1, 0) = type;
1321 if (type != NULL && area2 == real_addr_block2) {
1322 state->types2_(block2, 0) = type;
1327 match_equals(state, previous);
1328 xbt_dynar_free(&previous);
1336 area1_to_compare = addr_block1;
1337 area2_to_compare = addr_block2;
1339 if ((state->heapinfo1[block1].busy_block.ignore > 0)
1340 && (state->heapinfo2[block2].busy_block.ignore ==
1341 state->heapinfo1[block1].busy_block.ignore))
1342 check_ignore = state->heapinfo1[block1].busy_block.ignore;
1344 } else if ((state->heapinfo1[block1].type > 0) && (state->heapinfo2[block2].type > 0)) { /* Fragmented block */
1348 ((uintptr_t) (ADDR2UINT(area1) % (BLOCKSIZE))) >> state->
1349 heapinfo1[block1].type;
1351 ((uintptr_t) (ADDR2UINT(area2) % (BLOCKSIZE))) >> state->
1352 heapinfo2[block2].type;
1354 // Snapshot address of the fragment:
1356 (void *) ((char *) addr_block1 +
1357 (frag1 << state->heapinfo1[block1].type));
1359 (void *) ((char *) addr_block2 +
1360 (frag2 << state->heapinfo2[block2].type));
1362 // Process address of the fragment:
1364 (void *) ((char *) real_addr_block1 +
1365 (frag1 << ((xbt_mheap_t) state->s_heap)->heapinfo[block1].
1368 (void *) ((char *) real_addr_block2 +
1369 (frag2 << ((xbt_mheap_t) state->s_heap)->heapinfo[block2].
1372 // Check the size of the fragments against the size of the type:
1373 if (type_size != -1) {
1374 if (state->heapinfo1[block1].busy_frag.frag_size[frag1] == -1
1375 || state->heapinfo2[block2].busy_frag.frag_size[frag2] == -1) {
1377 match_equals(state, previous);
1378 xbt_dynar_free(&previous);
1382 if (type_size != state->heapinfo1[block1].busy_frag.frag_size[frag1]
1383 || type_size != state->heapinfo2[block2].busy_frag.frag_size[frag2]) {
1385 match_equals(state, previous);
1386 xbt_dynar_free(&previous);
1391 // Check if the blocks are already matched together:
1392 if (state->equals_to1_(block1, frag1).valid
1393 && state->equals_to2_(block2, frag2).valid) {
1394 if (equal_fragments(state, block1, frag1, block2, frag2)) {
1396 match_equals(state, previous);
1397 xbt_dynar_free(&previous);
1402 // Compare the size of both fragments:
1403 if (state->heapinfo1[block1].busy_frag.frag_size[frag1] !=
1404 state->heapinfo2[block2].busy_frag.frag_size[frag2]) {
1405 if (type_size == -1) {
1407 match_equals(state, previous);
1408 xbt_dynar_free(&previous);
1413 xbt_dynar_free(&previous);
1418 // Size of the fragment:
1419 size = state->heapinfo1[block1].busy_frag.frag_size[frag1];
1421 // Remember (basic) type inference.
1422 // The current data structure only allows us to do this for the whole block.
1423 if (type != NULL && area1 == real_addr_frag1) {
1424 state->types1_(block1, frag1) = type;
1426 if (type != NULL && area2 == real_addr_frag2) {
1427 state->types2_(block2, frag2) = type;
1429 // The type of the variable is already known:
1434 // Type inference from the block type.
1435 else if (state->types1_(block1, frag1) != NULL
1436 || state->types2_(block2, frag2) != NULL) {
1438 offset1 = (char *) area1 - (char *) real_addr_frag1;
1439 offset2 = (char *) area2 - (char *) real_addr_frag2;
1441 if (state->types1_(block1, frag1) != NULL
1442 && state->types2_(block2, frag2) != NULL) {
1444 get_offset_type(real_addr_frag1, state->types1_(block1, frag1),
1445 offset1, size, snapshot1);
1447 get_offset_type(real_addr_frag2, state->types2_(block2, frag2),
1448 offset1, size, snapshot2);
1449 } else if (state->types1_(block1, frag1) != NULL) {
1451 get_offset_type(real_addr_frag1, state->types1_(block1, frag1),
1452 offset1, size, snapshot1);
1454 get_offset_type(real_addr_frag2, state->types1_(block1, frag1),
1455 offset2, size, snapshot2);
1456 } else if (state->types2_(block2, frag2) != NULL) {
1458 get_offset_type(real_addr_frag1, state->types2_(block2, frag2),
1459 offset1, size, snapshot1);
1461 get_offset_type(real_addr_frag2, state->types2_(block2, frag2),
1462 offset2, size, snapshot2);
1465 match_equals(state, previous);
1466 xbt_dynar_free(&previous);
1471 if (new_type1 != NULL && new_type2 != NULL && new_type1 != new_type2) {
1474 while (type->byte_size == 0 && type->subtype != NULL)
1475 type = type->subtype;
1476 new_size1 = type->byte_size;
1479 while (type->byte_size == 0 && type->subtype != NULL)
1480 type = type->subtype;
1481 new_size2 = type->byte_size;
1485 match_equals(state, previous);
1486 xbt_dynar_free(&previous);
1492 area1_to_compare = (char *) addr_frag1 + offset1;
1493 area2_to_compare = (char *) addr_frag2 + offset2;
1495 if (new_size1 > 0 && new_size1 == new_size2) {
1500 if (offset1 == 0 && offset2 == 0) {
1501 if (!add_heap_area_pair(previous, block1, frag1, block2, frag2)) {
1503 match_equals(state, previous);
1504 xbt_dynar_free(&previous);
1512 match_equals(state, previous);
1513 xbt_dynar_free(&previous);
1518 if ((state->heapinfo1[block1].busy_frag.ignore[frag1] > 0)
1519 && (state->heapinfo2[block2].busy_frag.ignore[frag2] ==
1520 state->heapinfo1[block1].busy_frag.ignore[frag1]))
1521 check_ignore = state->heapinfo1[block1].busy_frag.ignore[frag1];
1526 xbt_dynar_free(&previous);
1533 /* Start comparison */
1536 compare_heap_area_with_type(state, area1, area2, area1_to_compare,
1537 area2_to_compare, snapshot1, snapshot2,
1538 previous, type, size, check_ignore,
1542 compare_heap_area_without_type(state, area1, area2, area1_to_compare,
1543 area2_to_compare, snapshot1, snapshot2,
1544 previous, size, check_ignore);
1546 if (res_compare == 1) {
1548 xbt_dynar_free(&previous);
1553 match_equals(state, previous);
1554 xbt_dynar_free(&previous);
1560 /*********************************************** Miscellaneous ***************************************************/
1561 /****************************************************************************************************************/
1564 static int get_pointed_area_size(void *area, int heap)
1567 struct s_mc_diff *state = mc_diff_info;
1570 malloc_info *heapinfo;
1573 heapinfo = state->heapinfo1;
1575 heapinfo = state->heapinfo2;
1579 (char *) ((xbt_mheap_t) state->s_heap)->heapbase) / BLOCKSIZE + 1;
1581 if (((char *) area < (char *) ((xbt_mheap_t) state->s_heap)->heapbase)
1582 || (block > state->heapsize1) || (block < 1))
1585 if (heapinfo[block].type == -1) { /* Free block */
1587 } else if (heapinfo[block].type == 0) { /* Complete block */
1588 return (int) heapinfo[block].busy_block.busy_size;
1591 ((uintptr_t) (ADDR2UINT(area) % (BLOCKSIZE))) >> heapinfo[block].type;
1592 return (int) heapinfo[block].busy_frag.frag_size[frag];
1598 char *get_type_description(mc_object_info_t info, char *type_name)
1601 xbt_dict_cursor_t dict_cursor;
1605 xbt_dict_foreach(info->types, dict_cursor, type_origin, type) {
1606 if (type->name && (strcmp(type->name, type_name) == 0)
1607 && type->byte_size > 0) {
1608 xbt_dict_cursor_free(&dict_cursor);
1613 xbt_dict_cursor_free(&dict_cursor);
1619 #define max( a, b ) ( ((a) > (b)) ? (a) : (b) )
1623 int mmalloc_linear_compare_heap(xbt_mheap_t heap1, xbt_mheap_t heap2)
1626 struct s_mc_diff *state = mc_diff_info;
1628 if (heap1 == NULL && heap1 == NULL) {
1629 XBT_DEBUG("Malloc descriptors null");
1633 if (heap1->heaplimit != heap2->heaplimit) {
1634 XBT_DEBUG("Different limit of valid info table indices");
1638 /* Heap information */
1639 state->heaplimit = ((struct mdesc *) heap1)->heaplimit;
1642 // Mamailloute in order to find the base address of the main heap:
1644 (char *) mmalloc_get_current_heap() - STD_HEAP_SIZE - xbt_pagesize;
1646 state->heapbase1 = (char *) heap1 + BLOCKSIZE;
1647 state->heapbase2 = (char *) heap2 + BLOCKSIZE;
1650 (malloc_info *) ((char *) heap1 +
1652 ((char *) heap1->heapinfo - (char *) state->s_heap)));
1654 (malloc_info *) ((char *) heap2 +
1656 ((char *) heap2->heapinfo - (char *) state->s_heap)));
1658 state->heapsize1 = heap1->heapsize;
1659 state->heapsize2 = heap2->heapsize;
1661 /* Start comparison */
1663 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
1667 /* Check busy blocks */
1671 while (i <= state->heaplimit) {
1674 ((void *) (((ADDR2UINT(i)) - 1) * BLOCKSIZE +
1675 (char *) state->heapbase1));
1677 ((void *) (((ADDR2UINT(i)) - 1) * BLOCKSIZE +
1678 (char *) state->heapbase2));
1680 if (state->heapinfo1[i].type != state->heapinfo2[i].type) {
1682 distance += BLOCKSIZE;
1683 XBT_DEBUG("Different type of blocks (%zu) : %d - %d -> distance = %d", i,
1684 state->heapinfo1[i].type, state->heapinfo2[i].type, distance);
1689 if (state->heapinfo1[i].type == -1) { /* Free block */
1694 if (state->heapinfo1[i].type == 0) { /* Large block */
1696 if (state->heapinfo1[i].busy_block.size !=
1697 state->heapinfo2[i].busy_block.size) {
1699 BLOCKSIZE * max(state->heapinfo1[i].busy_block.size,
1700 state->heapinfo2[i].busy_block.size);
1701 i += max(state->heapinfo1[i].busy_block.size,
1702 state->heapinfo2[i].busy_block.size);
1704 ("Different larger of cluster at block %zu : %zu - %zu -> distance = %d",
1705 i, state->heapinfo1[i].busy_block.size,
1706 state->heapinfo2[i].busy_block.size, distance);
1710 /*if(heapinfo1[i].busy_block.busy_size != heapinfo2[i].busy_block.busy_size){
1711 distance += max(heapinfo1[i].busy_block.busy_size, heapinfo2[i].busy_block.busy_size);
1712 i += max(heapinfo1[i].busy_block.size, heapinfo2[i].busy_block.size);
1713 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);
1719 //while(k < (heapinfo1[i].busy_block.busy_size)){
1720 while (k < state->heapinfo1[i].busy_block.size * BLOCKSIZE) {
1721 if (memcmp((char *) addr_block1 + k, (char *) addr_block2 + k, 1) !=
1730 } else { /* Fragmented block */
1732 for (j = 0; j < (size_t) (BLOCKSIZE >> state->heapinfo1[i].type); j++) {
1735 (void *) ((char *) addr_block1 + (j << state->heapinfo1[i].type));
1737 (void *) ((char *) addr_block2 + (j << state->heapinfo2[i].type));
1739 if (state->heapinfo1[i].busy_frag.frag_size[j] == 0
1740 && state->heapinfo2[i].busy_frag.frag_size[j] == 0) {
1745 /*if(heapinfo1[i].busy_frag.frag_size[j] != heapinfo2[i].busy_frag.frag_size[j]){
1746 distance += max(heapinfo1[i].busy_frag.frag_size[j], heapinfo2[i].busy_frag.frag_size[j]);
1747 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);
1753 //while(k < max(heapinfo1[i].busy_frag.frag_size[j], heapinfo2[i].busy_frag.frag_size[j])){
1754 while (k < (BLOCKSIZE / (BLOCKSIZE >> state->heapinfo1[i].type))) {
1755 if (memcmp((char *) addr_frag1 + k, (char *) addr_frag2 + k, 1) !=