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 MMALLOC_TYPE_HEAPINFO : */
94 /* case MMALLOC_TYPE_FREE : /\* Free block *\/ */
95 /* fprintf(stderr, "Asked to display the backtrace of a block that is free. I'm puzzled\n"); */
98 /* case 0: /\* Large block *\/ */
99 /* mmalloc_backtrace_block_display(heap->heapinfo, block); */
101 /* default: /\* Fragmented block *\/ */
102 /* frag_nb = RESIDUAL(addr, BLOCKSIZE) >> type; */
103 /* if(heap->heapinfo[block].busy_frag.frag_size[frag_nb] == -1){ */
104 /* fprintf(stderr , "Asked to display the backtrace of a fragment that is free. I'm puzzled\n"); */
107 /* mmalloc_backtrace_fragment_display(heap->heapinfo, block, frag_nb); */
113 static int compare_backtrace(int b1, int f1, int b2, int f2)
117 for(i=0; i< XBT_BACKTRACE_SIZE; i++){
118 if(heapinfo1[b1].busy_frag.bt[f1][i] != heapinfo2[b2].busy_frag.bt[f2][i]){
119 //mmalloc_backtrace_fragment_display((void*)heapinfo1, b1, f1);
120 //mmalloc_backtrace_fragment_display((void*)heapinfo2, b2, f2);
125 for(i=0; i< heapinfo1[b1].busy_block.bt_size; i++){
126 if(heapinfo1[b1].busy_block.bt[i] != heapinfo2[b2].busy_block.bt[i]){
127 //mmalloc_backtrace_block_display((void*)heapinfo1, b1);
128 //mmalloc_backtrace_block_display((void*)heapinfo2, b2);
137 /*********************************** Heap comparison ***********************************/
138 /***************************************************************************************/
140 typedef char *type_name;
143 /** \brief Base address of the real heap */
146 // Number of blocks in the heaps:
147 size_t heapsize1, heapsize2;
148 xbt_dynar_t to_ignore1, to_ignore2;
149 s_heap_area_t *equals_to1, *equals_to2;
150 dw_type_t *types1, *types2;
154 #define equals_to1_(i,j) equals_to1[ MAX_FRAGMENT_PER_BLOCK*(i) + (j)]
155 #define equals_to2_(i,j) equals_to2[ MAX_FRAGMENT_PER_BLOCK*(i) + (j)]
156 #define types1_(i,j) types1[ MAX_FRAGMENT_PER_BLOCK*(i) + (j)]
157 #define types2_(i,j) types2[ MAX_FRAGMENT_PER_BLOCK*(i) + (j)]
159 __thread struct s_mc_diff *mc_diff_info = NULL;
161 /*********************************** Free functions ************************************/
163 static void heap_area_pair_free(heap_area_pair_t pair)
169 static void heap_area_pair_free_voidp(void *d)
171 heap_area_pair_free((heap_area_pair_t) * (void **) d);
174 static void heap_area_free(heap_area_t area)
180 /************************************************************************************/
182 static s_heap_area_t make_heap_area(int block, int fragment)
187 area.fragment = fragment;
192 static int is_new_heap_area_pair(xbt_dynar_t list, int block1, int fragment1,
193 int block2, int fragment2)
196 unsigned int cursor = 0;
197 heap_area_pair_t current_pair;
199 xbt_dynar_foreach(list, cursor, current_pair) {
200 if (current_pair->block1 == block1 && current_pair->block2 == block2
201 && current_pair->fragment1 == fragment1
202 && current_pair->fragment2 == fragment2)
209 static int add_heap_area_pair(xbt_dynar_t list, int block1, int fragment1,
210 int block2, int fragment2)
213 if (is_new_heap_area_pair(list, block1, fragment1, block2, fragment2)) {
214 heap_area_pair_t pair = NULL;
215 pair = xbt_new0(s_heap_area_pair_t, 1);
216 pair->block1 = block1;
217 pair->fragment1 = fragment1;
218 pair->block2 = block2;
219 pair->fragment2 = fragment2;
221 xbt_dynar_push(list, &pair);
229 static ssize_t heap_comparison_ignore_size(xbt_dynar_t ignore_list,
233 unsigned int cursor = 0;
235 int end = xbt_dynar_length(ignore_list) - 1;
236 mc_heap_ignore_region_t region;
238 while (start <= end) {
239 cursor = (start + end) / 2;
241 (mc_heap_ignore_region_t) xbt_dynar_get_as(ignore_list, cursor,
242 mc_heap_ignore_region_t);
243 if (region->address == address)
245 if (region->address < address)
247 if (region->address > address)
254 static int is_stack(void *address)
256 unsigned int cursor = 0;
257 stack_region_t stack;
259 xbt_dynar_foreach(stacks_areas, cursor, stack) {
260 if (address == stack->address)
267 // TODO, this should depend on the snapshot?
268 static int is_block_stack(int block)
270 unsigned int cursor = 0;
271 stack_region_t stack;
273 xbt_dynar_foreach(stacks_areas, cursor, stack) {
274 if (block == stack->block)
281 static void match_equals(struct s_mc_diff *state, xbt_dynar_t list)
284 unsigned int cursor = 0;
285 heap_area_pair_t current_pair;
287 xbt_dynar_foreach(list, cursor, current_pair) {
289 if (current_pair->fragment1 != -1) {
291 state->equals_to1_(current_pair->block1, current_pair->fragment1) =
292 make_heap_area(current_pair->block2, current_pair->fragment2);
293 state->equals_to2_(current_pair->block2, current_pair->fragment2) =
294 make_heap_area(current_pair->block1, current_pair->fragment1);
298 state->equals_to1_(current_pair->block1, 0) =
299 make_heap_area(current_pair->block2, current_pair->fragment2);
300 state->equals_to2_(current_pair->block2, 0) =
301 make_heap_area(current_pair->block1, current_pair->fragment1);
308 /** Check whether two blocks are known to be matching
310 * @param state State used
311 * @param b1 Block of state 1
312 * @param b2 Block of state 2
313 * @return if the blocks are known to be matching
315 static int equal_blocks(struct s_mc_diff *state, int b1, int b2)
318 if (state->equals_to1_(b1, 0).block == b2
319 && state->equals_to2_(b2, 0).block == b1)
325 /** Check whether two fragments are known to be matching
327 * @param state State used
328 * @param b1 Block of state 1
329 * @param f1 Fragment of state 1
330 * @param b2 Block of state 2
331 * @param f2 Fragment of state 2
332 * @return if the fragments are known to be matching
334 static int equal_fragments(struct s_mc_diff *state, int b1, int f1, int b2,
338 if (state->equals_to1_(b1, f1).block == b2
339 && state->equals_to1_(b1, f1).fragment == f2
340 && state->equals_to2_(b2, f2).block == b1
341 && state->equals_to2_(b2, f2).fragment == f1)
347 int init_heap_information(xbt_mheap_t heap1, xbt_mheap_t heap2, xbt_dynar_t i1,
350 if (mc_diff_info == NULL) {
351 mc_diff_info = xbt_new0(struct s_mc_diff, 1);
352 mc_diff_info->equals_to1 = NULL;
353 mc_diff_info->equals_to2 = NULL;
354 mc_diff_info->types1 = NULL;
355 mc_diff_info->types2 = NULL;
357 struct s_mc_diff *state = mc_diff_info;
359 if ((((struct mdesc *) heap1)->heaplimit !=
360 ((struct mdesc *) heap2)->heaplimit)
362 ((((struct mdesc *) heap1)->heapsize !=
363 ((struct mdesc *) heap2)->heapsize)))
366 state->heaplimit = ((struct mdesc *) heap1)->heaplimit;
368 // Mamailloute in order to find the base address of the main heap:
370 (char *) mmalloc_get_current_heap() - STD_HEAP_SIZE - xbt_pagesize;
372 state->heapsize1 = heap1->heapsize;
373 state->heapsize2 = heap2->heapsize;
375 state->to_ignore1 = i1;
376 state->to_ignore2 = i2;
378 if (state->heaplimit > state->available) {
380 realloc(state->equals_to1,
381 state->heaplimit * MAX_FRAGMENT_PER_BLOCK *
382 sizeof(s_heap_area_t));
384 realloc(state->types1,
385 state->heaplimit * MAX_FRAGMENT_PER_BLOCK *
386 sizeof(type_name *));
388 realloc(state->equals_to2,
389 state->heaplimit * MAX_FRAGMENT_PER_BLOCK *
390 sizeof(s_heap_area_t));
392 realloc(state->types2,
393 state->heaplimit * MAX_FRAGMENT_PER_BLOCK *
394 sizeof(type_name *));
395 state->available = state->heaplimit;
398 memset(state->equals_to1, 0,
399 state->heaplimit * MAX_FRAGMENT_PER_BLOCK * sizeof(s_heap_area_t));
400 memset(state->equals_to2, 0,
401 state->heaplimit * MAX_FRAGMENT_PER_BLOCK * sizeof(s_heap_area_t));
402 memset(state->types1, 0,
403 state->heaplimit * MAX_FRAGMENT_PER_BLOCK * sizeof(type_name *));
404 memset(state->types2, 0,
405 state->heaplimit * MAX_FRAGMENT_PER_BLOCK * sizeof(type_name *));
411 void reset_heap_information()
416 int mmalloc_compare_heap(mc_snapshot_t snapshot1, mc_snapshot_t snapshot2)
419 struct s_mc_diff *state = mc_diff_info;
421 /* Start comparison */
422 size_t i1, i2, j1, j2, k;
423 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
424 int nb_diff1 = 0, nb_diff2 = 0;
426 int equal, res_compare = 0;
428 /* Check busy blocks */
432 malloc_info heapinfo_temp1, heapinfo_temp2;
433 malloc_info heapinfo_temp2b;
435 mc_mem_region_t heap_region1 = snapshot1->regions[0];
436 mc_mem_region_t heap_region2 = snapshot2->regions[0];
438 // This is in snapshot do not use them directly:
439 malloc_info* heapinfos1 = mc_snapshot_read_pointer(&((xbt_mheap_t)std_heap)->heapinfo, snapshot1, MC_NO_PROCESS_INDEX);
440 malloc_info* heapinfos2 = mc_snapshot_read_pointer(&((xbt_mheap_t)std_heap)->heapinfo, snapshot2, MC_NO_PROCESS_INDEX);
442 while (i1 <= state->heaplimit) {
444 malloc_info* heapinfo1 = mc_snapshot_read_region(&heapinfos1[i1], heap_region1, &heapinfo_temp1, sizeof(malloc_info));
445 malloc_info* heapinfo2 = mc_snapshot_read_region(&heapinfos2[i1], heap_region2, &heapinfo_temp2, sizeof(malloc_info));
447 if (heapinfo1->type == MMALLOC_TYPE_FREE || heapinfo1->type == MMALLOC_TYPE_HEAPINFO) { /* Free block */
448 i1 += heapinfo1->free_block.size;
452 if (heapinfo1->type < 0) {
453 fprintf(stderr, "Unkown mmalloc block type.\n");
458 ((void *) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE +
459 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
461 if (heapinfo1->type == MMALLOC_TYPE_UNFRAGMENTED) { /* Large block */
463 if (is_stack(addr_block1)) {
464 for (k = 0; k < heapinfo1->busy_block.size; k++)
465 state->equals_to1_(i1 + k, 0) = make_heap_area(i1, -1);
466 for (k = 0; k < heapinfo2->busy_block.size; k++)
467 state->equals_to2_(i1 + k, 0) = make_heap_area(i1, -1);
468 i1 += heapinfo1->busy_block.size;
472 if (state->equals_to1_(i1, 0).valid) {
481 /* Try first to associate to same block in the other heap */
482 if (heapinfo2->type == heapinfo1->type) {
484 if (state->equals_to2_(i1, 0).valid == 0) {
487 ((void *) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE +
488 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
491 compare_heap_area(MC_NO_PROCESS_INDEX, addr_block1, addr_block2, snapshot1, snapshot2,
494 if (res_compare != 1) {
495 for (k = 1; k < heapinfo2->busy_block.size; k++)
496 state->equals_to2_(i1 + k, 0) = make_heap_area(i1, -1);
497 for (k = 1; k < heapinfo1->busy_block.size; k++)
498 state->equals_to1_(i1 + k, 0) = make_heap_area(i1, -1);
500 i1 += heapinfo1->busy_block.size;
507 while (i2 <= state->heaplimit && !equal) {
510 ((void *) (((ADDR2UINT(i2)) - 1) * BLOCKSIZE +
511 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
518 malloc_info* heapinfo2b = mc_snapshot_read_region(&heapinfos2[i2], heap_region2, &heapinfo_temp2b, sizeof(malloc_info));
520 if (heapinfo2b->type != MMALLOC_TYPE_UNFRAGMENTED) {
525 if (state->equals_to2_(i2, 0).valid) {
531 compare_heap_area(MC_NO_PROCESS_INDEX, addr_block1, addr_block2, snapshot1, snapshot2,
534 if (res_compare != 1) {
535 for (k = 1; k < heapinfo2b->busy_block.size; k++)
536 state->equals_to2_(i2 + k, 0) = make_heap_area(i1, -1);
537 for (k = 1; k < heapinfo1->busy_block.size; k++)
538 state->equals_to1_(i1 + k, 0) = make_heap_area(i2, -1);
540 i1 += heapinfo1->busy_block.size;
548 XBT_DEBUG("Block %zu not found (size_used = %zu, addr = %p)", i1,
549 heapinfo1->busy_block.busy_size, addr_block1);
550 i1 = state->heaplimit + 1;
555 } else { /* Fragmented block */
557 for (j1 = 0; j1 < (size_t) (BLOCKSIZE >> heapinfo1->type); j1++) {
559 if (heapinfo1->busy_frag.frag_size[j1] == -1) /* Free fragment */
562 if (state->equals_to1_(i1, j1).valid)
566 (void *) ((char *) addr_block1 + (j1 << heapinfo1->type));
571 /* Try first to associate to same fragment in the other heap */
572 if (heapinfo2->type == heapinfo1->type) {
574 if (state->equals_to2_(i1, j1).valid == 0) {
577 ((void *) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE +
578 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
580 (void *) ((char *) addr_block2 +
581 (j1 << heapinfo2->type));
584 compare_heap_area(MC_NO_PROCESS_INDEX, addr_frag1, addr_frag2, snapshot1, snapshot2,
587 if (res_compare != 1)
594 while (i2 <= state->heaplimit && !equal) {
596 malloc_info* heapinfo2b = mc_snapshot_read_region(&heapinfos2[i2], heap_region2, &heapinfo_temp2b, sizeof(malloc_info));
598 if (heapinfo2b->type == MMALLOC_TYPE_FREE || heapinfo2b->type == MMALLOC_TYPE_HEAPINFO) {
599 i2 += heapinfo2b->free_block.size;
603 if (heapinfo2b->type < 0) {
604 fprintf(stderr, "Unkown mmalloc block type.\n");
608 for (j2 = 0; j2 < (size_t) (BLOCKSIZE >> heapinfo2b->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 << heapinfo2b->type));
625 compare_heap_area(MC_NO_PROCESS_INDEX, addr_frag1, addr_frag2, snapshot2, snapshot2,
628 if (res_compare != 1) {
641 ("Block %zu, fragment %zu not found (size_used = %zd, address = %p)\n",
642 i1, j1, heapinfo1->busy_frag.frag_size[j1],
644 i2 = state->heaplimit + 1;
645 i1 = state->heaplimit + 1;
658 /* All blocks/fragments are equal to another block/fragment ? */
661 for(i = 1; i <= state->heaplimit; i++) {
662 malloc_info* heapinfo1 = mc_snapshot_read_region(&heapinfos1[i], heap_region1, &heapinfo_temp1, sizeof(malloc_info));
663 if (heapinfo1->type == MMALLOC_TYPE_UNFRAGMENTED) {
664 if (i1 == state->heaplimit) {
665 if (heapinfo1->busy_block.busy_size > 0) {
666 if (state->equals_to1_(i, 0).valid == 0) {
667 if (XBT_LOG_ISENABLED(mc_diff, xbt_log_priority_debug)) {
669 XBT_DEBUG("Block %zu not found (size used = %zu)", i,
670 heapinfo1->busy_block.busy_size);
671 //mmalloc_backtrace_block_display((void*)heapinfo1, i);
678 if (heapinfo1->type > 0) {
679 for (j = 0; j < (size_t) (BLOCKSIZE >> heapinfo1->type); j++) {
680 if (i1 == state->heaplimit) {
681 if (heapinfo1->busy_frag.frag_size[j] > 0) {
682 if (state->equals_to1_(i, j).valid == 0) {
683 if (XBT_LOG_ISENABLED(mc_diff, xbt_log_priority_debug)) {
684 // TODO, print fragment address
686 ("Block %zu, Fragment %zu not found (size used = %zd)",
688 heapinfo1->busy_frag.frag_size[j]);
689 //mmalloc_backtrace_fragment_display((void*)heapinfo1, i, j);
699 if (i1 == state->heaplimit)
700 XBT_DEBUG("Number of blocks/fragments not found in heap1 : %d", nb_diff1);
702 for (i=1; i <= state->heaplimit; i++) {
703 malloc_info* heapinfo2 = mc_snapshot_read_region(&heapinfos2[i], heap_region2, &heapinfo_temp2, sizeof(malloc_info));
704 if (heapinfo2->type == MMALLOC_TYPE_UNFRAGMENTED) {
705 if (i1 == state->heaplimit) {
706 if (heapinfo2->busy_block.busy_size > 0) {
707 if (state->equals_to2_(i, 0).valid == 0) {
708 if (XBT_LOG_ISENABLED(mc_diff, xbt_log_priority_debug)) {
709 // TODO, print address of the block
710 XBT_DEBUG("Block %zu not found (size used = %zu)", i,
711 heapinfo2->busy_block.busy_size);
712 //mmalloc_backtrace_block_display((void*)heapinfo2, i);
719 if (heapinfo2->type > 0) {
720 for (j = 0; j < (size_t) (BLOCKSIZE >> heapinfo2->type); j++) {
721 if (i1 == state->heaplimit) {
722 if (heapinfo2->busy_frag.frag_size[j] > 0) {
723 if (state->equals_to2_(i, j).valid == 0) {
724 if (XBT_LOG_ISENABLED(mc_diff, xbt_log_priority_debug)) {
725 // TODO, print address of the block
727 ("Block %zu, Fragment %zu not found (size used = %zd)",
729 heapinfo2->busy_frag.frag_size[j]);
730 //mmalloc_backtrace_fragment_display((void*)heapinfo2, i, j);
740 if (i1 == state->heaplimit)
741 XBT_DEBUG("Number of blocks/fragments not found in heap2 : %d", nb_diff2);
743 return ((nb_diff1 > 0) || (nb_diff2 > 0));
749 * @param real_area1 Process address for state 1
750 * @param real_area2 Process address for state 2
751 * @param snapshot1 Snapshot of state 1
752 * @param snapshot2 Snapshot of state 2
755 * @param check_ignore
757 static int compare_heap_area_without_type(struct s_mc_diff *state, int process_index,
758 void *real_area1, void *real_area2,
759 mc_snapshot_t snapshot1,
760 mc_snapshot_t snapshot2,
761 xbt_dynar_t previous, int size,
766 void *addr_pointed1, *addr_pointed2;
767 int pointer_align, res_compare;
768 ssize_t ignore1, ignore2;
770 mc_mem_region_t heap_region1 = snapshot1->regions[0];
771 mc_mem_region_t heap_region2 = snapshot2->regions[0];
775 if (check_ignore > 0) {
777 heap_comparison_ignore_size(state->to_ignore1,
778 (char *) real_area1 + i)) != -1) {
780 heap_comparison_ignore_size(state->to_ignore2,
781 (char *) real_area2 + i)) == ignore1) {
794 if (mc_snapshot_region_memcmp(((char *) real_area1) + i, heap_region1, ((char *) real_area2) + i, heap_region2, 1) != 0) {
796 pointer_align = (i / sizeof(void *)) * sizeof(void *);
797 addr_pointed1 = mc_snapshot_read_pointer((char *) real_area1 + pointer_align, snapshot1, process_index);
798 addr_pointed2 = mc_snapshot_read_pointer((char *) real_area2 + pointer_align, snapshot2, process_index);
800 if (addr_pointed1 > maestro_stack_start
801 && addr_pointed1 < maestro_stack_end
802 && addr_pointed2 > maestro_stack_start
803 && addr_pointed2 < maestro_stack_end) {
804 i = pointer_align + sizeof(void *);
806 } else if (addr_pointed1 > state->s_heap
807 && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1)
808 && addr_pointed2 > state->s_heap
809 && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2)) {
810 // Both addreses are in the heap:
812 compare_heap_area(process_index, addr_pointed1, addr_pointed2, snapshot1,
813 snapshot2, previous, NULL, 0);
814 if (res_compare == 1) {
817 i = pointer_align + sizeof(void *);
836 * @param real_area1 Process address for state 1
837 * @param real_area2 Process address for state 2
838 * @param snapshot1 Snapshot of state 1
839 * @param snapshot2 Snapshot of state 2
842 * @param area_size either a byte_size or an elements_count (?)
843 * @param check_ignore
844 * @param pointer_level
845 * @return 0 (same), 1 (different), -1 (unknown)
847 static int compare_heap_area_with_type(struct s_mc_diff *state, int process_index,
848 void *real_area1, void *real_area2,
849 mc_snapshot_t snapshot1,
850 mc_snapshot_t snapshot2,
851 xbt_dynar_t previous, dw_type_t type,
852 int area_size, int check_ignore,
856 if (is_stack(real_area1) && is_stack(real_area2))
859 ssize_t ignore1, ignore2;
861 if ((check_ignore > 0)
862 && ((ignore1 = heap_comparison_ignore_size(state->to_ignore1, real_area1))
864 && ((ignore2 = heap_comparison_ignore_size(state->to_ignore2, real_area2))
869 dw_type_t subtype, subsubtype;
870 int res, elm_size, i;
871 unsigned int cursor = 0;
873 void *addr_pointed1, *addr_pointed2;;
875 mc_mem_region_t heap_region1 = snapshot1->regions[0];
876 mc_mem_region_t heap_region2 = snapshot2->regions[0];
878 switch (type->type) {
879 case DW_TAG_unspecified_type:
882 case DW_TAG_base_type:
883 if (type->name != NULL && strcmp(type->name, "char") == 0) { /* String, hence random (arbitrary ?) size */
884 if (real_area1 == real_area2)
887 return (mc_snapshot_region_memcmp(real_area1, heap_region1, real_area2, heap_region2, area_size) != 0);
889 if (area_size != -1 && type->byte_size != area_size)
892 return (mc_snapshot_region_memcmp(real_area1, heap_region1, real_area2, heap_region2, type->byte_size) != 0);
896 case DW_TAG_enumeration_type:
897 if (area_size != -1 && type->byte_size != area_size)
900 return (mc_snapshot_region_memcmp(real_area1, heap_region1, real_area2, heap_region2, type->byte_size) != 0);
903 case DW_TAG_const_type:
904 case DW_TAG_volatile_type:
906 type = type->subtype;
909 case DW_TAG_array_type:
910 subtype = type->subtype;
911 switch (subtype->type) {
912 case DW_TAG_unspecified_type:
915 case DW_TAG_base_type:
916 case DW_TAG_enumeration_type:
917 case DW_TAG_pointer_type:
918 case DW_TAG_reference_type:
919 case DW_TAG_rvalue_reference_type:
920 case DW_TAG_structure_type:
921 case DW_TAG_class_type:
922 case DW_TAG_union_type:
923 if (subtype->full_type)
924 subtype = subtype->full_type;
925 elm_size = subtype->byte_size;
927 // TODO, just remove the type indirection?
928 case DW_TAG_const_type:
930 case DW_TAG_volatile_type:
931 subsubtype = subtype->subtype;
932 if (subsubtype->full_type)
933 subsubtype = subsubtype->full_type;
934 elm_size = subsubtype->byte_size;
940 for (i = 0; i < type->element_count; i++) {
941 // TODO, add support for variable stride (DW_AT_byte_stride)
943 compare_heap_area_with_type(state, process_index,
944 (char *) real_area1 + (i * elm_size),
945 (char *) real_area2 + (i * elm_size),
946 snapshot1, snapshot2, previous,
947 type->subtype, subtype->byte_size,
948 check_ignore, pointer_level);
953 case DW_TAG_reference_type:
954 case DW_TAG_rvalue_reference_type:
955 case DW_TAG_pointer_type:
956 if (type->subtype && type->subtype->type == DW_TAG_subroutine_type) {
957 addr_pointed1 = mc_snapshot_read_pointer(real_area1, snapshot1, process_index);
958 addr_pointed2 = mc_snapshot_read_pointer(real_area2, snapshot2, process_index);
959 return (addr_pointed1 != addr_pointed2);;
962 if (pointer_level > 1) { /* Array of pointers */
963 for (i = 0; i < (area_size / sizeof(void *)); i++) {
964 addr_pointed1 = mc_snapshot_read_pointer((char*) real_area1 + i * sizeof(void *), snapshot1, process_index);
965 addr_pointed2 = mc_snapshot_read_pointer((char*) real_area2 + i * sizeof(void *), snapshot2, process_index);
966 if (addr_pointed1 > state->s_heap
967 && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1)
968 && addr_pointed2 > state->s_heap
969 && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2))
971 compare_heap_area(process_index, addr_pointed1, addr_pointed2, snapshot1,
972 snapshot2, previous, type->subtype,
975 res = (addr_pointed1 != addr_pointed2);
980 addr_pointed1 = mc_snapshot_read_pointer(real_area1, snapshot1, process_index);
981 addr_pointed2 = mc_snapshot_read_pointer(real_area2, snapshot2, process_index);
982 if (addr_pointed1 > state->s_heap
983 && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1)
984 && addr_pointed2 > state->s_heap
985 && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2))
986 return compare_heap_area(process_index, addr_pointed1, addr_pointed2, snapshot1,
987 snapshot2, previous, type->subtype,
990 return (addr_pointed1 != addr_pointed2);
994 case DW_TAG_structure_type:
995 case DW_TAG_class_type:
997 type = type->full_type;
998 if (area_size != -1 && type->byte_size != area_size) {
999 if (area_size > type->byte_size && area_size % type->byte_size == 0) {
1000 for (i = 0; i < (area_size / type->byte_size); i++) {
1002 compare_heap_area_with_type(state, process_index,
1003 (char *) real_area1 + i * type->byte_size,
1004 (char *) real_area2 + i * type->byte_size,
1005 snapshot1, snapshot2, previous, type, -1,
1015 xbt_dynar_foreach(type->members, cursor, member) {
1016 // TODO, optimize this? (for the offset case)
1017 char *real_member1 =
1018 mc_member_resolve(real_area1, type, member, snapshot1, process_index);
1019 char *real_member2 =
1020 mc_member_resolve(real_area2, type, member, snapshot2, process_index);
1022 compare_heap_area_with_type(state, process_index, real_member1, real_member2,
1023 snapshot1, snapshot2,
1024 previous, member->subtype, -1,
1032 case DW_TAG_union_type:
1033 return compare_heap_area_without_type(state, process_index, real_area1, real_area2,
1034 snapshot1, snapshot2, previous,
1035 type->byte_size, check_ignore);
1045 /** Infer the type of a part of the block from the type of the block
1047 * TODO, handle DW_TAG_array_type as well as arrays of the object ((*p)[5], p[5])
1049 * TODO, handle subfields ((*p).bar.foo, (*p)[5].bar…)
1051 * @param type_id DWARF type ID of the root address
1053 * @return DWARF type ID for given offset
1055 static dw_type_t get_offset_type(void *real_base_address, dw_type_t type,
1056 int offset, int area_size,
1057 mc_snapshot_t snapshot, int process_index)
1060 // Beginning of the block, the infered variable type if the type of the block:
1064 switch (type->type) {
1065 case DW_TAG_structure_type:
1066 case DW_TAG_class_type:
1067 if (type->full_type)
1068 type = type->full_type;
1070 if (area_size != -1 && type->byte_size != area_size) {
1071 if (area_size > type->byte_size && area_size % type->byte_size == 0)
1076 unsigned int cursor = 0;
1078 xbt_dynar_foreach(type->members, cursor, member) {
1080 if (!member->location.size) {
1081 // We have the offset, use it directly (shortcut):
1082 if (member->offset == offset)
1083 return member->subtype;
1086 mc_member_resolve(real_base_address, type, member, snapshot, process_index);
1087 if (real_member - (char *) real_base_address == offset)
1088 return member->subtype;
1096 /* FIXME : other cases ? */
1104 * @param area1 Process address for state 1
1105 * @param area2 Process address for state 2
1106 * @param snapshot1 Snapshot of state 1
1107 * @param snapshot2 Snapshot of state 2
1108 * @param previous Pairs of blocks already compared on the current path (or NULL)
1109 * @param type_id Type of variable
1110 * @param pointer_level
1111 * @return 0 (same), 1 (different), -1
1113 int compare_heap_area(int process_index, void *area1, void *area2, mc_snapshot_t snapshot1,
1114 mc_snapshot_t snapshot2, xbt_dynar_t previous,
1115 dw_type_t type, int pointer_level)
1118 struct s_mc_diff *state = mc_diff_info;
1121 ssize_t block1, frag1, block2, frag2;
1123 int check_ignore = 0;
1125 void *real_addr_block1, *real_addr_block2, *real_addr_frag1, *real_addr_frag2;
1127 int offset1 = 0, offset2 = 0;
1128 int new_size1 = -1, new_size2 = -1;
1129 dw_type_t new_type1 = NULL, new_type2 = NULL;
1131 int match_pairs = 0;
1133 malloc_info* heapinfos1 = mc_snapshot_read_pointer(&((xbt_mheap_t)std_heap)->heapinfo, snapshot1, process_index);
1134 malloc_info* heapinfos2 = mc_snapshot_read_pointer(&((xbt_mheap_t)std_heap)->heapinfo, snapshot2, process_index);
1136 malloc_info heapinfo_temp1, heapinfo_temp2;
1138 if (previous == NULL) {
1140 xbt_dynar_new(sizeof(heap_area_pair_t), heap_area_pair_free_voidp);
1143 // Get block number:
1146 (char *) ((xbt_mheap_t) state->s_heap)->heapbase) / BLOCKSIZE + 1;
1149 (char *) ((xbt_mheap_t) state->s_heap)->heapbase) / BLOCKSIZE + 1;
1151 // If either block is a stack block:
1152 if (is_block_stack((int) block1) && is_block_stack((int) block2)) {
1153 add_heap_area_pair(previous, block1, -1, block2, -1);
1155 match_equals(state, previous);
1156 xbt_dynar_free(&previous);
1160 // If either block is not in the expected area of memory:
1161 if (((char *) area1 < (char *) ((xbt_mheap_t) state->s_heap)->heapbase)
1162 || (block1 > state->heapsize1) || (block1 < 1)
1163 || ((char *) area2 < (char *) ((xbt_mheap_t) state->s_heap)->heapbase)
1164 || (block2 > state->heapsize2) || (block2 < 1)) {
1166 xbt_dynar_free(&previous);
1171 // Process address of the block:
1173 ((void *) (((ADDR2UINT(block1)) - 1) * BLOCKSIZE +
1174 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
1176 ((void *) (((ADDR2UINT(block2)) - 1) * BLOCKSIZE +
1177 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
1181 if (type->full_type)
1182 type = type->full_type;
1184 // This assume that for "boring" types (volatile ...) byte_size is absent:
1185 while (type->byte_size == 0 && type->subtype != NULL)
1186 type = type->subtype;
1189 if ((type->type == DW_TAG_pointer_type)
1190 || ((type->type == DW_TAG_base_type) && type->name != NULL
1191 && (!strcmp(type->name, "char"))))
1194 type_size = type->byte_size;
1198 mc_mem_region_t heap_region1 = snapshot1->regions[0];
1199 mc_mem_region_t heap_region2 = snapshot2->regions[0];
1201 malloc_info* heapinfo1 = mc_snapshot_read_region(&heapinfos1[block1], heap_region1, &heapinfo_temp1, sizeof(malloc_info));
1202 malloc_info* heapinfo2 = mc_snapshot_read_region(&heapinfos2[block2], heap_region2, &heapinfo_temp2, sizeof(malloc_info));
1204 if ((heapinfo1->type == MMALLOC_TYPE_FREE || heapinfo1->type==MMALLOC_TYPE_HEAPINFO)
1205 && (heapinfo2->type == MMALLOC_TYPE_FREE || heapinfo2->type ==MMALLOC_TYPE_HEAPINFO)) {
1209 match_equals(state, previous);
1210 xbt_dynar_free(&previous);
1214 } else if (heapinfo1->type == MMALLOC_TYPE_UNFRAGMENTED
1215 && heapinfo2->type == MMALLOC_TYPE_UNFRAGMENTED) {
1216 /* Complete block */
1218 // TODO, lookup variable type from block type as done for fragmented blocks
1220 offset1 = (char *) area1 - (char *) real_addr_block1;
1221 offset2 = (char *) area2 - (char *) real_addr_block2;
1223 if (state->equals_to1_(block1, 0).valid
1224 && state->equals_to2_(block2, 0).valid) {
1225 if (equal_blocks(state, block1, block2)) {
1227 match_equals(state, previous);
1228 xbt_dynar_free(&previous);
1234 if (type_size != -1) {
1235 if (type_size != heapinfo1->busy_block.busy_size
1236 && type_size != heapinfo2->busy_block.busy_size
1237 && (type->name == NULL || !strcmp(type->name, "struct s_smx_context"))) {
1239 match_equals(state, previous);
1240 xbt_dynar_free(&previous);
1246 if (heapinfo1->busy_block.size !=
1247 heapinfo2->busy_block.size) {
1249 xbt_dynar_free(&previous);
1254 if (heapinfo1->busy_block.busy_size !=
1255 heapinfo2->busy_block.busy_size) {
1257 xbt_dynar_free(&previous);
1262 if (!add_heap_area_pair(previous, block1, -1, block2, -1)) {
1264 match_equals(state, previous);
1265 xbt_dynar_free(&previous);
1270 size = heapinfo1->busy_block.busy_size;
1272 // Remember (basic) type inference.
1273 // The current data structure only allows us to do this for the whole block.
1274 if (type != NULL && area1 == real_addr_block1) {
1275 state->types1_(block1, 0) = type;
1277 if (type != NULL && area2 == real_addr_block2) {
1278 state->types2_(block2, 0) = type;
1283 match_equals(state, previous);
1284 xbt_dynar_free(&previous);
1292 if ((heapinfo1->busy_block.ignore > 0)
1293 && (heapinfo2->busy_block.ignore ==
1294 heapinfo1->busy_block.ignore))
1295 check_ignore = heapinfo1->busy_block.ignore;
1297 } else if ((heapinfo1->type > 0) && (heapinfo2->type > 0)) { /* Fragmented block */
1301 ((uintptr_t) (ADDR2UINT(area1) % (BLOCKSIZE))) >> heapinfo1->type;
1303 ((uintptr_t) (ADDR2UINT(area2) % (BLOCKSIZE))) >> heapinfo2->type;
1305 // Process address of the fragment:
1307 (void *) ((char *) real_addr_block1 +
1308 (frag1 << heapinfo1->type));
1310 (void *) ((char *) real_addr_block2 +
1311 (frag2 << heapinfo2->type));
1313 // Check the size of the fragments against the size of the type:
1314 if (type_size != -1) {
1315 if (heapinfo1->busy_frag.frag_size[frag1] == -1
1316 || heapinfo2->busy_frag.frag_size[frag2] == -1) {
1318 match_equals(state, previous);
1319 xbt_dynar_free(&previous);
1324 if (type_size != heapinfo1->busy_frag.frag_size[frag1]
1325 || type_size != heapinfo2->busy_frag.frag_size[frag2]) {
1327 match_equals(state, previous);
1328 xbt_dynar_free(&previous);
1334 // Check if the blocks are already matched together:
1335 if (state->equals_to1_(block1, frag1).valid
1336 && state->equals_to2_(block2, frag2).valid) {
1337 if (offset1==offset2 && equal_fragments(state, block1, frag1, block2, frag2)) {
1339 match_equals(state, previous);
1340 xbt_dynar_free(&previous);
1345 // Compare the size of both fragments:
1346 if (heapinfo1->busy_frag.frag_size[frag1] !=
1347 heapinfo2->busy_frag.frag_size[frag2]) {
1348 if (type_size == -1) {
1350 match_equals(state, previous);
1351 xbt_dynar_free(&previous);
1356 xbt_dynar_free(&previous);
1362 // Size of the fragment:
1363 size = heapinfo1->busy_frag.frag_size[frag1];
1365 // Remember (basic) type inference.
1366 // The current data structure only allows us to do this for the whole fragment.
1367 if (type != NULL && area1 == real_addr_frag1) {
1368 state->types1_(block1, frag1) = type;
1370 if (type != NULL && area2 == real_addr_frag2) {
1371 state->types2_(block2, frag2) = type;
1373 // The type of the variable is already known:
1378 // Type inference from the block type.
1379 else if (state->types1_(block1, frag1) != NULL
1380 || state->types2_(block2, frag2) != NULL) {
1382 offset1 = (char *) area1 - (char *) real_addr_frag1;
1383 offset2 = (char *) area2 - (char *) real_addr_frag2;
1385 if (state->types1_(block1, frag1) != NULL
1386 && state->types2_(block2, frag2) != NULL) {
1388 get_offset_type(real_addr_frag1, state->types1_(block1, frag1),
1389 offset1, size, snapshot1, process_index);
1391 get_offset_type(real_addr_frag2, state->types2_(block2, frag2),
1392 offset1, size, snapshot2, process_index);
1393 } else if (state->types1_(block1, frag1) != NULL) {
1395 get_offset_type(real_addr_frag1, state->types1_(block1, frag1),
1396 offset1, size, snapshot1, process_index);
1398 get_offset_type(real_addr_frag2, state->types1_(block1, frag1),
1399 offset2, size, snapshot2, process_index);
1400 } else if (state->types2_(block2, frag2) != NULL) {
1402 get_offset_type(real_addr_frag1, state->types2_(block2, frag2),
1403 offset1, size, snapshot1, process_index);
1405 get_offset_type(real_addr_frag2, state->types2_(block2, frag2),
1406 offset2, size, snapshot2, process_index);
1409 match_equals(state, previous);
1410 xbt_dynar_free(&previous);
1415 if (new_type1 != NULL && new_type2 != NULL && new_type1 != new_type2) {
1418 while (type->byte_size == 0 && type->subtype != NULL)
1419 type = type->subtype;
1420 new_size1 = type->byte_size;
1423 while (type->byte_size == 0 && type->subtype != NULL)
1424 type = type->subtype;
1425 new_size2 = type->byte_size;
1429 match_equals(state, previous);
1430 xbt_dynar_free(&previous);
1436 if (new_size1 > 0 && new_size1 == new_size2) {
1441 if (offset1 == 0 && offset2 == 0) {
1442 if (!add_heap_area_pair(previous, block1, frag1, block2, frag2)) {
1444 match_equals(state, previous);
1445 xbt_dynar_free(&previous);
1453 match_equals(state, previous);
1454 xbt_dynar_free(&previous);
1459 if ((heapinfo1->busy_frag.ignore[frag1] > 0)
1460 && (heapinfo2->busy_frag.ignore[frag2] ==
1461 heapinfo1->busy_frag.ignore[frag1]))
1462 check_ignore = heapinfo1->busy_frag.ignore[frag1];
1467 xbt_dynar_free(&previous);
1474 /* Start comparison */
1477 compare_heap_area_with_type(state, process_index, area1, area2, snapshot1, snapshot2,
1478 previous, type, size, check_ignore,
1482 compare_heap_area_without_type(state, process_index, area1, area2, snapshot1, snapshot2,
1483 previous, size, check_ignore);
1485 if (res_compare == 1) {
1487 xbt_dynar_free(&previous);
1492 match_equals(state, previous);
1493 xbt_dynar_free(&previous);
1499 /*********************************************** Miscellaneous ***************************************************/
1500 /****************************************************************************************************************/
1502 // Not used and broken code:
1506 static int get_pointed_area_size(void *area, int heap)
1509 struct s_mc_diff *state = mc_diff_info;
1512 malloc_info *heapinfo;
1515 heapinfo = state->heapinfo1;
1517 heapinfo = state->heapinfo2;
1521 (char *) ((xbt_mheap_t) state->s_heap)->heapbase) / BLOCKSIZE + 1;
1523 if (((char *) area < (char *) ((xbt_mheap_t) state->s_heap)->heapbase)
1524 || (block > state->heapsize1) || (block < 1))
1527 if (heapinfo[block].type == MMALLOC_TYPE_FREE || heapinfo[block].type == MMALLOC_TYPE_HEAPINFO) { /* Free block */
1529 } else if (heapinfo[block].type == MMALLOC_TYPE_UNFRAGMENTED) { /* Complete block */
1530 return (int) heapinfo[block].busy_block.busy_size;
1533 ((uintptr_t) (ADDR2UINT(area) % (BLOCKSIZE))) >> heapinfo[block].type;
1534 return (int) heapinfo[block].busy_frag.frag_size[frag];
1539 char *get_type_description(mc_object_info_t info, char *type_name)
1542 xbt_dict_cursor_t dict_cursor;
1546 xbt_dict_foreach(info->types, dict_cursor, type_origin, type) {
1547 if (type->name && (strcmp(type->name, type_name) == 0)
1548 && type->byte_size > 0) {
1549 xbt_dict_cursor_free(&dict_cursor);
1554 xbt_dict_cursor_free(&dict_cursor);
1560 #define max( a, b ) ( ((a) > (b)) ? (a) : (b) )
1564 int mmalloc_linear_compare_heap(xbt_mheap_t heap1, xbt_mheap_t heap2)
1567 struct s_mc_diff *state = mc_diff_info;
1569 if (heap1 == NULL && heap1 == NULL) {
1570 XBT_DEBUG("Malloc descriptors null");
1574 if (heap1->heaplimit != heap2->heaplimit) {
1575 XBT_DEBUG("Different limit of valid info table indices");
1579 /* Heap information */
1580 state->heaplimit = ((struct mdesc *) heap1)->heaplimit;
1583 // Mamailloute in order to find the base address of the main heap:
1585 (char *) mmalloc_get_current_heap() - STD_HEAP_SIZE - xbt_pagesize;
1587 state->heapbase1 = (char *) heap1 + BLOCKSIZE;
1588 state->heapbase2 = (char *) heap2 + BLOCKSIZE;
1591 (malloc_info *) ((char *) heap1 +
1593 ((char *) heap1->heapinfo - (char *) state->s_heap)));
1595 (malloc_info *) ((char *) heap2 +
1597 ((char *) heap2->heapinfo - (char *) state->s_heap)));
1599 state->heapsize1 = heap1->heapsize;
1600 state->heapsize2 = heap2->heapsize;
1602 /* Start comparison */
1604 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
1608 /* Check busy blocks */
1612 while (i <= state->heaplimit) {
1615 ((void *) (((ADDR2UINT(i)) - 1) * BLOCKSIZE +
1616 (char *) state->heapbase1));
1618 ((void *) (((ADDR2UINT(i)) - 1) * BLOCKSIZE +
1619 (char *) state->heapbase2));
1621 if (state->heapinfo1[i].type != state->heapinfo2[i].type) {
1623 distance += BLOCKSIZE;
1624 XBT_DEBUG("Different type of blocks (%zu) : %d - %d -> distance = %d", i,
1625 state->heapinfo1[i].type, state->heapinfo2[i].type, distance);
1630 if (state->heapinfo1[i].type == MMALLOC_TYPE_FREE
1631 || state->heapinfo1[i].type == MMALLOC_TYPE_HAPINFO) { /* Free block */
1636 if (state->heapinfo1[i].type == MMALLOC_TYPE_UNFRAGMENTED) { /* Large block */
1638 if (state->heapinfo1[i].busy_block.size !=
1639 state->heapinfo2[i].busy_block.size) {
1641 BLOCKSIZE * max(state->heapinfo1[i].busy_block.size,
1642 state->heapinfo2[i].busy_block.size);
1643 i += max(state->heapinfo1[i].busy_block.size,
1644 state->heapinfo2[i].busy_block.size);
1646 ("Different larger of cluster at block %zu : %zu - %zu -> distance = %d",
1647 i, state->heapinfo1[i].busy_block.size,
1648 state->heapinfo2[i].busy_block.size, distance);
1652 /*if(heapinfo1[i].busy_block.busy_size != heapinfo2[i].busy_block.busy_size){
1653 distance += max(heapinfo1[i].busy_block.busy_size, heapinfo2[i].busy_block.busy_size);
1654 i += max(heapinfo1[i].busy_block.size, heapinfo2[i].busy_block.size);
1655 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);
1661 //while(k < (heapinfo1[i].busy_block.busy_size)){
1662 while (k < state->heapinfo1[i].busy_block.size * BLOCKSIZE) {
1663 if (memcmp((char *) addr_block1 + k, (char *) addr_block2 + k, 1) !=
1672 } else { /* Fragmented block */
1674 for (j = 0; j < (size_t) (BLOCKSIZE >> state->heapinfo1[i].type); j++) {
1677 (void *) ((char *) addr_block1 + (j << state->heapinfo1[i].type));
1679 (void *) ((char *) addr_block2 + (j << state->heapinfo2[i].type));
1681 if (state->heapinfo1[i].busy_frag.frag_size[j] == 0
1682 && state->heapinfo2[i].busy_frag.frag_size[j] == 0) {
1687 /*if(heapinfo1[i].busy_frag.frag_size[j] != heapinfo2[i].busy_frag.frag_size[j]){
1688 distance += max(heapinfo1[i].busy_frag.frag_size[j], heapinfo2[i].busy_frag.frag_size[j]);
1689 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);
1695 //while(k < max(heapinfo1[i].busy_frag.frag_size[j], heapinfo2[i].busy_frag.frag_size[j])){
1696 while (k < (BLOCKSIZE / (BLOCKSIZE >> state->heapinfo1[i].type))) {
1697 if (memcmp((char *) addr_frag1 + k, (char *) addr_frag2 + k, 1) !=