1 /* mm_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(mm_diff, xbt,
17 "Logging specific to mm_diff in mmalloc");
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){
31 /* if (((malloc_info *)heapinfo)[block].busy_block.bt_size == 0) { */
32 /* fprintf(stderr, "No backtrace available for that block, sorry.\n"); */
36 /* memcpy(&e.bt,&(((malloc_info *)heapinfo)[block].busy_block.bt),sizeof(void*)*XBT_BACKTRACE_SIZE); */
37 /* e.used = ((malloc_info *)heapinfo)[block].busy_block.bt_size; */
39 /* xbt_ex_setup_backtrace(&e); */
40 /* if (e.used == 0) { */
41 /* fprintf(stderr, "(backtrace not set)\n"); */
42 /* } else if (e.bt_strings == NULL) { */
43 /* fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet"); */
47 /* fprintf(stderr, "Backtrace of where the block %d was malloced (%d frames):\n", block ,e.used); */
48 /* for (i = 0; i < e.used; i++) /\* no need to display "xbt_backtrace_display" *\/{ */
49 /* fprintf(stderr, "%d ---> %s\n",i, e.bt_strings[i] + 4); */
54 static void mmalloc_backtrace_fragment_display(void* heapinfo, int block, int frag){
58 /* memcpy(&e.bt,&(((malloc_info *)heapinfo)[block].busy_frag.bt[frag]),sizeof(void*)*XBT_BACKTRACE_SIZE); */
59 /* e.used = XBT_BACKTRACE_SIZE; */
61 /* xbt_ex_setup_backtrace(&e); */
62 /* if (e.used == 0) { */
63 /* fprintf(stderr, "(backtrace not set)\n"); */
64 /* } else if (e.bt_strings == NULL) { */
65 /* fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet"); */
69 /* fprintf(stderr, "Backtrace of where the fragment %d in block %d was malloced (%d frames):\n", frag, block ,e.used); */
70 /* for (i = 0; i < e.used; i++) /\* no need to display "xbt_backtrace_display" *\/{ */
71 /* fprintf(stderr, "%d ---> %s\n",i, e.bt_strings[i] + 4); */
77 static void mmalloc_backtrace_display(void *addr){
79 /* size_t block, frag_nb; */
82 /* xbt_mheap_t heap = __mmalloc_current_heap ?: (xbt_mheap_t) mmalloc_preinit(); */
84 /* block = (((char*) (addr) - (char*) heap -> heapbase) / BLOCKSIZE + 1); */
86 /* type = heap->heapinfo[block].type; */
89 /* case -1 : /\* Free block *\/ */
90 /* fprintf(stderr, "Asked to display the backtrace of a block that is free. I'm puzzled\n"); */
93 /* case 0: /\* Large block *\/ */
94 /* mmalloc_backtrace_block_display(heap->heapinfo, block); */
96 /* default: /\* Fragmented block *\/ */
97 /* frag_nb = RESIDUAL(addr, BLOCKSIZE) >> type; */
98 /* if(heap->heapinfo[block].busy_frag.frag_size[frag_nb] == -1){ */
99 /* fprintf(stderr , "Asked to display the backtrace of a fragment that is free. I'm puzzled\n"); */
102 /* mmalloc_backtrace_fragment_display(heap->heapinfo, block, frag_nb); */
108 static int compare_backtrace(int b1, int f1, int b2, int f2){
111 for(i=0; i< XBT_BACKTRACE_SIZE; i++){
112 if(heapinfo1[b1].busy_frag.bt[f1][i] != heapinfo2[b2].busy_frag.bt[f2][i]){
113 //mmalloc_backtrace_fragment_display((void*)heapinfo1, b1, f1);
114 //mmalloc_backtrace_fragment_display((void*)heapinfo2, b2, f2);
119 for(i=0; i< heapinfo1[b1].busy_block.bt_size; i++){
120 if(heapinfo1[b1].busy_block.bt[i] != heapinfo2[b2].busy_block.bt[i]){
121 //mmalloc_backtrace_block_display((void*)heapinfo1, b1);
122 //mmalloc_backtrace_block_display((void*)heapinfo2, b2);
131 /*********************************** Heap comparison ***********************************/
132 /***************************************************************************************/
134 typedef char* type_name;
137 void *s_heap, *heapbase1, *heapbase2;
138 malloc_info *heapinfo1, *heapinfo2;
140 // Number of blocks in the heaps:
141 size_t heapsize1, heapsize2;
142 xbt_dynar_t to_ignore1, to_ignore2;
143 heap_area_t **equals_to1, **equals_to2;
144 dw_type_t **types1, **types2;
147 __thread struct s_mm_diff* mm_diff_info = NULL;
149 /*********************************** Free functions ************************************/
151 static void heap_area_pair_free(heap_area_pair_t pair){
156 static void heap_area_pair_free_voidp(void *d){
157 heap_area_pair_free((heap_area_pair_t) * (void **) d);
160 static void heap_area_free(heap_area_t area){
165 /************************************************************************************/
167 static heap_area_t new_heap_area(int block, int fragment){
168 heap_area_t area = NULL;
169 area = xbt_new0(s_heap_area_t, 1);
171 area->fragment = fragment;
176 static int is_new_heap_area_pair(xbt_dynar_t list, int block1, int fragment1, int block2, int fragment2){
178 unsigned int cursor = 0;
179 heap_area_pair_t current_pair;
181 xbt_dynar_foreach(list, cursor, current_pair){
182 if(current_pair->block1 == block1 && current_pair->block2 == block2 && current_pair->fragment1 == fragment1 && current_pair->fragment2 == fragment2)
189 static int add_heap_area_pair(xbt_dynar_t list, int block1, int fragment1, int block2, int fragment2){
191 if(is_new_heap_area_pair(list, block1, fragment1, block2, fragment2)){
192 heap_area_pair_t pair = NULL;
193 pair = xbt_new0(s_heap_area_pair_t, 1);
194 pair->block1 = block1;
195 pair->fragment1 = fragment1;
196 pair->block2 = block2;
197 pair->fragment2 = fragment2;
199 xbt_dynar_push(list, &pair);
207 static ssize_t heap_comparison_ignore_size(xbt_dynar_t ignore_list, void *address){
209 unsigned int cursor = 0;
211 int end = xbt_dynar_length(ignore_list) - 1;
212 mc_heap_ignore_region_t region;
215 cursor = (start + end) / 2;
216 region = (mc_heap_ignore_region_t)xbt_dynar_get_as(ignore_list, cursor, mc_heap_ignore_region_t);
217 if(region->address == address)
219 if(region->address < address)
221 if(region->address > address)
228 static int is_stack(void *address){
229 unsigned int cursor = 0;
230 stack_region_t stack;
232 xbt_dynar_foreach(stacks_areas, cursor, stack){
233 if(address == stack->address)
240 static int is_block_stack(int block){
241 unsigned int cursor = 0;
242 stack_region_t stack;
244 xbt_dynar_foreach(stacks_areas, cursor, stack){
245 if(block == stack->block)
252 static void match_equals(struct s_mm_diff *state, xbt_dynar_t list){
254 unsigned int cursor = 0;
255 heap_area_pair_t current_pair;
256 heap_area_t previous_area;
258 xbt_dynar_foreach(list, cursor, current_pair){
260 if(current_pair->fragment1 != -1){
262 if(state->equals_to1[current_pair->block1][current_pair->fragment1] != NULL){
263 previous_area = state->equals_to1[current_pair->block1][current_pair->fragment1];
264 heap_area_free(state->equals_to2[previous_area->block][previous_area->fragment]);
265 state->equals_to2[previous_area->block][previous_area->fragment] = NULL;
266 heap_area_free(previous_area);
268 if(state->equals_to2[current_pair->block2][current_pair->fragment2] != NULL){
269 previous_area = state->equals_to2[current_pair->block2][current_pair->fragment2];
270 heap_area_free(state->equals_to1[previous_area->block][previous_area->fragment]);
271 state->equals_to1[previous_area->block][previous_area->fragment] = NULL;
272 heap_area_free(previous_area);
275 state->equals_to1[current_pair->block1][current_pair->fragment1] = new_heap_area(current_pair->block2, current_pair->fragment2);
276 state->equals_to2[current_pair->block2][current_pair->fragment2] = new_heap_area(current_pair->block1, current_pair->fragment1);
280 if(state->equals_to1[current_pair->block1][0] != NULL){
281 previous_area = state->equals_to1[current_pair->block1][0];
282 heap_area_free(state->equals_to2[previous_area->block][0]);
283 state->equals_to2[previous_area->block][0] = NULL;
284 heap_area_free(previous_area);
286 if(state->equals_to2[current_pair->block2][0] != NULL){
287 previous_area = state->equals_to2[current_pair->block2][0];
288 heap_area_free(state->equals_to1[previous_area->block][0]);
289 state->equals_to1[previous_area->block][0] = NULL;
290 heap_area_free(previous_area);
293 state->equals_to1[current_pair->block1][0] = new_heap_area(current_pair->block2, current_pair->fragment2);
294 state->equals_to2[current_pair->block2][0] = new_heap_area(current_pair->block1, current_pair->fragment1);
301 /** Check whether two blocks are known to be matching
303 * @param state State used
304 * @param b1 Block of state 1
305 * @param b2 Block of state 2
306 * @return if the blocks are known to be matching
308 static int equal_blocks(struct s_mm_diff *state, int b1, int b2){
310 if(state->equals_to1[b1][0]->block == b2 && state->equals_to2[b2][0]->block == b1)
316 /** Check whether two fragments are known to be matching
318 * @param state State used
319 * @param b1 Block of state 1
320 * @param f1 Fragment of state 1
321 * @param b2 Block of state 2
322 * @param f2 Fragment of state 2
323 * @return if the fragments are known to be matching
325 static int equal_fragments(struct s_mm_diff *state, int b1, int f1, int b2, int f2){
327 if(state->equals_to1[b1][f1]->block == b2
328 && state->equals_to1[b1][f1]->fragment == f2
329 && state->equals_to2[b2][f2]->block == b1
330 && state->equals_to2[b2][f2]->fragment == f1)
336 int init_heap_information(xbt_mheap_t heap1, xbt_mheap_t heap2, xbt_dynar_t i1, xbt_dynar_t i2){
337 if(mm_diff_info==NULL) {
338 mm_diff_info = xbt_new0(struct s_mm_diff, 1);
340 struct s_mm_diff *state = mm_diff_info;
342 if((((struct mdesc *)heap1)->heaplimit != ((struct mdesc *)heap2)->heaplimit)
343 || ((((struct mdesc *)heap1)->heapsize != ((struct mdesc *)heap2)->heapsize) ))
348 state->heaplimit = ((struct mdesc *)heap1)->heaplimit;
350 state->s_heap = (char *)mmalloc_get_current_heap() - STD_HEAP_SIZE - xbt_pagesize;
352 state->heapbase1 = (char *)heap1 + BLOCKSIZE;
353 state->heapbase2 = (char *)heap2 + BLOCKSIZE;
355 state->heapinfo1 = (malloc_info *)((char *)heap1 + ((uintptr_t)((char *)((struct mdesc *)heap1)->heapinfo - (char *)state->s_heap)));
356 state->heapinfo2 = (malloc_info *)((char *)heap2 + ((uintptr_t)((char *)((struct mdesc *)heap2)->heapinfo - (char *)state->s_heap)));
358 state->heapsize1 = heap1->heapsize;
359 state->heapsize2 = heap2->heapsize;
361 state->to_ignore1 = i1;
362 state-> to_ignore2 = i2;
364 state->equals_to1 = malloc(state->heaplimit * sizeof(heap_area_t *));
365 state->types1 = malloc(state->heaplimit * sizeof(type_name *));
366 for(i=0; i<=state->heaplimit; i++){
367 state->equals_to1[i] = malloc(MAX_FRAGMENT_PER_BLOCK * sizeof(heap_area_t));
368 state->types1[i] = malloc(MAX_FRAGMENT_PER_BLOCK * sizeof(type_name));
369 for(j=0; j<MAX_FRAGMENT_PER_BLOCK; j++){
370 state->equals_to1[i][j] = NULL;
371 state->types1[i][j] = NULL;
375 state->equals_to2 = malloc(state->heaplimit * sizeof(heap_area_t *));
376 state->types2 = malloc(state->heaplimit * sizeof(type_name *));
377 for(i=0; i<=state->heaplimit; i++){
378 state->equals_to2[i] = malloc(MAX_FRAGMENT_PER_BLOCK * sizeof(heap_area_t));
379 state->types2[i] = malloc(MAX_FRAGMENT_PER_BLOCK * sizeof(type_name));
380 for(j=0; j<MAX_FRAGMENT_PER_BLOCK; j++){
381 state->equals_to2[i][j] = NULL;
382 state->types2[i][j] = NULL;
387 MC_ignore_global_variable("mm_diff_info");
394 void reset_heap_information(){
396 struct s_mm_diff *state = mm_diff_info;
400 for(i=0; i<=state->heaplimit; i++){
401 for(j=0; j<MAX_FRAGMENT_PER_BLOCK;j++){
402 heap_area_free(state->equals_to1[i][j]);
403 state->equals_to1[i][j] = NULL;
404 heap_area_free(state->equals_to2[i][j]);
405 state-> equals_to2[i][j] = NULL;
406 state->types1[i][j] = NULL;
407 state->types2[i][j] = NULL;
409 free(state->equals_to1[i]);
410 free(state->equals_to2[i]);
411 free(state->types1[i]);
412 free(state->types2[i]);
415 free(state->equals_to1);
416 free(state->equals_to2);
420 state->s_heap = NULL, state->heapbase1 = NULL, state->heapbase2 = NULL;
421 state->heapinfo1 = NULL, state->heapinfo2 = NULL;
422 state->heaplimit = 0, state->heapsize1 = 0, state->heapsize2 = 0;
423 state->to_ignore1 = NULL, state->to_ignore2 = NULL;
424 state->equals_to1 = NULL, state->equals_to2 = NULL;
425 state->types1 = NULL, state->types2 = NULL;
429 int mmalloc_compare_heap(mc_snapshot_t snapshot1, mc_snapshot_t snapshot2, xbt_mheap_t heap1, xbt_mheap_t heap2){
431 struct s_mm_diff *state = mm_diff_info;
433 if(heap1 == NULL && heap2 == NULL){
434 XBT_DEBUG("Malloc descriptors null");
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 = xbt_dynar_new(sizeof(heap_area_pair_t), heap_area_pair_free_voidp);
445 int equal, res_compare = 0;
447 /* Check busy blocks*/
451 while(i1 <= state->heaplimit){
453 if(state->heapinfo1[i1].type == -1){ /* Free block */
458 addr_block1 = ((void*) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)state->s_heap)->heapbase));
460 if(state->heapinfo1[i1].type == 0){ /* Large block */
462 if(is_stack(addr_block1)){
463 for(k=0; k < state->heapinfo1[i1].busy_block.size; k++)
464 state->equals_to1[i1+k][0] = new_heap_area(i1, -1);
465 for(k=0; k < state->heapinfo2[i1].busy_block.size; k++)
466 state->equals_to2[i1+k][0] = new_heap_area(i1, -1);
467 i1 += state->heapinfo1[i1].busy_block.size;
471 if(state->equals_to1[i1][0] != NULL){
480 /* Try first to associate to same block in the other heap */
481 if(state->heapinfo2[i1].type == state->heapinfo1[i1].type){
483 if(state->equals_to2[i1][0] == NULL){
485 addr_block2 = ((void*) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)state->s_heap)->heapbase));
487 res_compare = compare_heap_area(addr_block1, addr_block2, snapshot1, snapshot2, NULL, NULL, 0);
489 if(res_compare != 1){
490 for(k=1; k < state->heapinfo2[i1].busy_block.size; k++)
491 state->equals_to2[i1+k][0] = new_heap_area(i1, -1);
492 for(k=1; k < state->heapinfo1[i1].busy_block.size; k++)
493 state->equals_to1[i1+k][0] = new_heap_area(i1, -1);
495 i1 += state->heapinfo1[i1].busy_block.size;
498 xbt_dynar_reset(previous);
504 while(i2 <= state->heaplimit && !equal){
506 addr_block2 = ((void*) (((ADDR2UINT(i2)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)state->s_heap)->heapbase));
513 if(state->heapinfo2[i2].type != 0){
518 if(state->equals_to2[i2][0] != NULL){
523 res_compare = compare_heap_area(addr_block1, addr_block2, snapshot1, snapshot2, NULL, NULL, 0);
525 if(res_compare != 1 ){
526 for(k=1; k < state->heapinfo2[i2].busy_block.size; k++)
527 state->equals_to2[i2+k][0] = new_heap_area(i1, -1);
528 for(k=1; k < state->heapinfo1[i1].busy_block.size; k++)
529 state->equals_to1[i1+k][0] = new_heap_area(i2, -1);
531 i1 += state->heapinfo1[i1].busy_block.size;
534 xbt_dynar_reset(previous);
541 XBT_DEBUG("Block %zu not found (size_used = %zu, addr = %p)", i1, state->heapinfo1[i1].busy_block.busy_size, addr_block1);
542 i1 = state->heaplimit + 1;
547 }else{ /* Fragmented block */
549 for(j1=0; j1 < (size_t) (BLOCKSIZE >> state->heapinfo1[i1].type); j1++){
551 if(state->heapinfo1[i1].busy_frag.frag_size[j1] == -1) /* Free fragment */
554 if(state->equals_to1[i1][j1] != NULL)
557 addr_frag1 = (void*) ((char *)addr_block1 + (j1 << state->heapinfo1[i1].type));
562 /* Try first to associate to same fragment in the other heap */
563 if(state->heapinfo2[i1].type == state->heapinfo1[i1].type){
565 if(state->equals_to2[i1][j1] == NULL){
567 addr_block2 = ((void*) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)state->s_heap)->heapbase));
568 addr_frag2 = (void*) ((char *)addr_block2 + (j1 << ((xbt_mheap_t)state->s_heap)->heapinfo[i1].type));
570 res_compare = compare_heap_area(addr_frag1, addr_frag2, snapshot1, snapshot2, NULL, NULL, 0);
575 xbt_dynar_reset(previous);
581 while(i2 <= state->heaplimit && !equal){
583 if(state->heapinfo2[i2].type <= 0){
588 for(j2=0; j2 < (size_t) (BLOCKSIZE >> state->heapinfo2[i2].type); j2++){
590 if(i2 == i1 && j2 == j1)
593 if(state->equals_to2[i2][j2] != NULL)
596 addr_block2 = ((void*) (((ADDR2UINT(i2)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)state->s_heap)->heapbase));
597 addr_frag2 = (void*) ((char *)addr_block2 + (j2 <<((xbt_mheap_t)state->s_heap)->heapinfo[i2].type));
599 res_compare = compare_heap_area(addr_frag1, addr_frag2, snapshot2, snapshot2, NULL, NULL, 0);
601 if(res_compare != 1){
603 xbt_dynar_reset(previous);
607 xbt_dynar_reset(previous);
616 XBT_DEBUG("Block %zu, fragment %zu not found (size_used = %zd, address = %p)\n", i1, j1, state->heapinfo1[i1].busy_frag.frag_size[j1], addr_frag1);
617 i2 = state->heaplimit + 1;
618 i1 = state->heaplimit + 1;
631 /* All blocks/fragments are equal to another block/fragment ? */
633 void *real_addr_frag1 = NULL, *real_addr_block1 = NULL, *real_addr_block2 = NULL, *real_addr_frag2 = NULL;
635 while(i<=state->heaplimit){
636 if(state->heapinfo1[i].type == 0){
637 if(i1 == state->heaplimit){
638 if(state->heapinfo1[i].busy_block.busy_size > 0){
639 if(state->equals_to1[i][0] == NULL){
640 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
641 addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)state->heapbase1));
642 XBT_DEBUG("Block %zu (%p) not found (size used = %zu)", i, addr_block1, state->heapinfo1[i].busy_block.busy_size);
643 //mmalloc_backtrace_block_display((void*)heapinfo1, i);
650 if(state->heapinfo1[i].type > 0){
651 addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)state->heapbase1));
652 real_addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)((struct mdesc *)state->s_heap)->heapbase));
653 for(j=0; j < (size_t) (BLOCKSIZE >> state->heapinfo1[i].type); j++){
654 if(i1== state->heaplimit){
655 if(state->heapinfo1[i].busy_frag.frag_size[j] > 0){
656 if(state->equals_to1[i][j] == NULL){
657 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
658 addr_frag1 = (void*) ((char *)addr_block1 + (j << state->heapinfo1[i].type));
659 real_addr_frag1 = (void*) ((char *)real_addr_block1 + (j << ((struct mdesc *)state->s_heap)->heapinfo[i].type));
660 XBT_DEBUG("Block %zu, Fragment %zu (%p - %p) not found (size used = %zd)", i, j, addr_frag1, real_addr_frag1, state->heapinfo1[i].busy_frag.frag_size[j]);
661 //mmalloc_backtrace_fragment_display((void*)heapinfo1, i, j);
672 if(i1 == state->heaplimit)
673 XBT_DEBUG("Number of blocks/fragments not found in heap1 : %d", nb_diff1);
677 while(i<=state->heaplimit){
678 if(state->heapinfo2[i].type == 0){
679 if(i1 == state->heaplimit){
680 if(state->heapinfo2[i].busy_block.busy_size > 0){
681 if(state->equals_to2[i][0] == NULL){
682 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
683 addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)state->heapbase2));
684 XBT_DEBUG("Block %zu (%p) not found (size used = %zu)", i, addr_block2, state->heapinfo2[i].busy_block.busy_size);
685 //mmalloc_backtrace_block_display((void*)heapinfo2, i);
692 if(state->heapinfo2[i].type > 0){
693 addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)state->heapbase2));
694 real_addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)((struct mdesc *)state->s_heap)->heapbase));
695 for(j=0; j < (size_t) (BLOCKSIZE >> state->heapinfo2[i].type); j++){
696 if(i1 == state->heaplimit){
697 if(state->heapinfo2[i].busy_frag.frag_size[j] > 0){
698 if(state->equals_to2[i][j] == NULL){
699 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
700 addr_frag2 = (void*) ((char *)addr_block2 + (j << state->heapinfo2[i].type));
701 real_addr_frag2 = (void*) ((char *)real_addr_block2 + (j << ((struct mdesc *)state->s_heap)->heapinfo[i].type));
702 XBT_DEBUG( "Block %zu, Fragment %zu (%p - %p) not found (size used = %zd)", i, j, addr_frag2, real_addr_frag2, state->heapinfo2[i].busy_frag.frag_size[j]);
703 //mmalloc_backtrace_fragment_display((void*)heapinfo2, i, j);
714 if(i1 == state->heaplimit)
715 XBT_DEBUG("Number of blocks/fragments not found in heap2 : %d", nb_diff2);
717 xbt_dynar_free(&previous);
718 real_addr_frag1 = NULL, real_addr_block1 = NULL, real_addr_block2 = NULL, real_addr_frag2 = NULL;
720 return ((nb_diff1 > 0) || (nb_diff2 > 0));
726 * @param real_area1 Process address for state 1
727 * @param real_area2 Process address for state 2
728 * @param area1 Snapshot address for state 1
729 * @param area2 Snapshot address for state 2
730 * @param snapshot1 Snapshot of state 1
731 * @param snapshot2 Snapshot of state 2
734 * @param check_ignore
736 static int compare_heap_area_without_type(struct s_mm_diff *state, void *real_area1, void *real_area2, void *area1, void *area2, mc_snapshot_t snapshot1, mc_snapshot_t snapshot2, xbt_dynar_t previous, int size, int check_ignore){
739 void *addr_pointed1, *addr_pointed2;
740 int pointer_align, res_compare;
741 ssize_t ignore1, ignore2;
745 if(check_ignore > 0){
746 if((ignore1 = heap_comparison_ignore_size(state->to_ignore1, (char *)real_area1 + i)) != -1){
747 if((ignore2 = heap_comparison_ignore_size(state->to_ignore2, (char *)real_area2 + i)) == ignore1){
760 if(memcmp(((char *)area1) + i, ((char *)area2) + i, 1) != 0){
762 pointer_align = (i / sizeof(void*)) * sizeof(void*);
763 addr_pointed1 = *((void **)((char *)area1 + pointer_align));
764 addr_pointed2 = *((void **)((char *)area2 + pointer_align));
766 if(addr_pointed1 > maestro_stack_start && addr_pointed1 < maestro_stack_end && addr_pointed2 > maestro_stack_start && addr_pointed2 < maestro_stack_end){
767 i = pointer_align + sizeof(void *);
769 }else if((addr_pointed1 > state->s_heap) && ((char *)addr_pointed1 < (char *)state->s_heap + STD_HEAP_SIZE)
770 && (addr_pointed2 > state->s_heap) && ((char *)addr_pointed2 < (char *)state->s_heap + STD_HEAP_SIZE)){
771 res_compare = compare_heap_area(addr_pointed1, addr_pointed2, snapshot1, snapshot2, previous, NULL, 0);
772 if(res_compare == 1){
775 i = pointer_align + sizeof(void *);
794 * @param real_area1 Process address for state 1
795 * @param real_area2 Process address for state 2
796 * @param area1 Snapshot address for state 1
797 * @param area2 Snapshot address for state 2
798 * @param snapshot1 Snapshot of state 1
799 * @param snapshot2 Snapshot of state 2
802 * @param area_size either a byte_size or an elements_count (?)
803 * @param check_ignore
804 * @param pointer_level
805 * @return 0 (same), 1 (different), -1 (unknown)
807 static int compare_heap_area_with_type(struct s_mm_diff *state, void *real_area1, void *real_area2, void *area1, void *area2,
808 mc_snapshot_t snapshot1, mc_snapshot_t snapshot2,
809 xbt_dynar_t previous, dw_type_t type,
810 int area_size, int check_ignore, int pointer_level){
812 if(is_stack(real_area1) && is_stack(real_area2))
815 ssize_t ignore1, ignore2;
817 if((check_ignore > 0) && ((ignore1 = heap_comparison_ignore_size(state->to_ignore1, real_area1)) > 0) && ((ignore2 = heap_comparison_ignore_size(state->to_ignore2, real_area2)) == ignore1)){
821 dw_type_t subtype, subsubtype;
822 int res, elm_size, i;
823 unsigned int cursor = 0;
825 void *addr_pointed1, *addr_pointed2;;
828 case DW_TAG_unspecified_type:
831 case DW_TAG_base_type:
832 if(type->name!=NULL && strcmp(type->name, "char") == 0){ /* String, hence random (arbitrary ?) size */
833 if(real_area1 == real_area2)
836 return (memcmp(area1, area2, area_size) != 0);
838 if(area_size != -1 && type->byte_size != area_size)
841 return (memcmp(area1, area2, type->byte_size) != 0);
845 case DW_TAG_enumeration_type:
846 if(area_size != -1 && type->byte_size != area_size)
849 return (memcmp(area1, area2, type->byte_size) != 0);
852 case DW_TAG_const_type:
853 case DW_TAG_volatile_type:
854 return compare_heap_area_with_type(state, real_area1, real_area2, area1, area2, snapshot1, snapshot2, previous, type->subtype, area_size, check_ignore, pointer_level);
856 case DW_TAG_array_type:
857 subtype = type->subtype;
858 switch(subtype->type){
859 case DW_TAG_unspecified_type:
862 case DW_TAG_base_type:
863 case DW_TAG_enumeration_type:
864 case DW_TAG_pointer_type:
865 case DW_TAG_reference_type:
866 case DW_TAG_rvalue_reference_type:
867 case DW_TAG_structure_type:
868 case DW_TAG_class_type:
869 case DW_TAG_union_type:
870 if(subtype->full_type)
871 subtype = subtype->full_type;
872 elm_size = subtype->byte_size;
874 // TODO, just remove the type indirection?
875 case DW_TAG_const_type:
877 case DW_TAG_volatile_type:
878 subsubtype = subtype->subtype;
879 if(subsubtype->full_type)
880 subsubtype = subsubtype->full_type;
881 elm_size = subsubtype->byte_size;
887 for(i=0; i<type->element_count; i++){
888 // TODO, add support for variable stride (DW_AT_byte_stride)
889 res = compare_heap_area_with_type(state, (char *)real_area1 + (i*elm_size), (char *)real_area2 + (i*elm_size), (char *)area1 + (i*elm_size), (char *)area2 + (i*elm_size), snapshot1, snapshot2, previous, type->subtype, subtype->byte_size, check_ignore, pointer_level);
894 case DW_TAG_reference_type:
895 case DW_TAG_rvalue_reference_type:
896 case DW_TAG_pointer_type:
897 if(type->subtype && type->subtype->type == DW_TAG_subroutine_type){
898 addr_pointed1 = *((void **)(area1));
899 addr_pointed2 = *((void **)(area2));
900 return (addr_pointed1 != addr_pointed2);;
903 if(pointer_level > 1){ /* Array of pointers */
904 for(i=0; i<(area_size/sizeof(void *)); i++){
905 addr_pointed1 = *((void **)((char *)area1 + (i*sizeof(void *))));
906 addr_pointed2 = *((void **)((char *)area2 + (i*sizeof(void *))));
907 if(addr_pointed1 > state->s_heap && (char *)addr_pointed1 < (char*) state->s_heap + STD_HEAP_SIZE && addr_pointed2 > state->s_heap && (char *)addr_pointed2 < (char*) state->s_heap + STD_HEAP_SIZE)
908 res = compare_heap_area(addr_pointed1, addr_pointed2, snapshot1, snapshot2, previous, type->subtype, pointer_level);
910 res = (addr_pointed1 != addr_pointed2);
915 addr_pointed1 = *((void **)(area1));
916 addr_pointed2 = *((void **)(area2));
917 if(addr_pointed1 > state->s_heap && (char *)addr_pointed1 < (char*) state->s_heap + STD_HEAP_SIZE && addr_pointed2 > state->s_heap && (char *)addr_pointed2 < (char*) state->s_heap + STD_HEAP_SIZE)
918 return compare_heap_area(addr_pointed1, addr_pointed2, snapshot1, snapshot2, previous, type->subtype, pointer_level);
920 return (addr_pointed1 != addr_pointed2);
924 case DW_TAG_structure_type:
925 case DW_TAG_class_type:
927 type = type->full_type;
928 if(area_size != -1 && type->byte_size != area_size){
929 if(area_size>type->byte_size && area_size%type->byte_size == 0){
930 for(i=0; i<(area_size/type->byte_size); i++){
931 res = compare_heap_area_with_type(state, (char *)real_area1 + (i*type->byte_size), (char *)real_area2 + (i*type->byte_size), (char *)area1 + (i*type->byte_size), (char *)area2 + (i*type->byte_size), snapshot1, snapshot2, previous, type, -1, check_ignore, 0);
940 xbt_dynar_foreach(type->members, cursor, member){
941 // TODO, optimize this? (for the offset case)
942 char* real_member1 = mc_member_resolve(real_area1, type, member, snapshot1);
943 char* real_member2 = mc_member_resolve(real_area2, type, member, snapshot2);
944 char* member1 = mc_translate_address((uintptr_t)real_member1, snapshot1);
945 char* member2 = mc_translate_address((uintptr_t)real_member2, snapshot2);
946 res = compare_heap_area_with_type(state, real_member1, real_member2, member1, member2, snapshot1, snapshot2, previous, member->subtype, -1, check_ignore, 0);
953 case DW_TAG_union_type:
954 return compare_heap_area_without_type(state, real_area1, real_area2, area1, area2, snapshot1, snapshot2, previous, type->byte_size, check_ignore);
964 /** Infer the type of a part of the block from the type of the block
966 * TODO, handle DW_TAG_array_type as well as arrays of the object ((*p)[5], p[5])
968 * TODO, handle subfields ((*p).bar.foo, (*p)[5].bar…)
970 * @param type_id DWARF type ID of the root address
972 * @return DWARF type ID for given offset
974 static dw_type_t get_offset_type(void* real_base_address, dw_type_t type, int offset, int area_size, mc_snapshot_t snapshot){
976 // Beginning of the block, the infered variable type if the type of the block:
981 case DW_TAG_structure_type :
982 case DW_TAG_class_type:
984 type = type->full_type;
986 if(area_size != -1 && type->byte_size != area_size){
987 if(area_size>type->byte_size && area_size%type->byte_size == 0)
992 unsigned int cursor = 0;
994 xbt_dynar_foreach(type->members, cursor, member){
996 if(!member->location.size) {
997 // We have the offset, use it directly (shortcut):
998 if(member->offset == offset)
999 return member->subtype;
1001 char* real_member = mc_member_resolve(real_base_address, type, member, snapshot);
1002 if(real_member - (char*)real_base_address == offset)
1003 return member->subtype;
1011 /* FIXME : other cases ? */
1019 * @param area1 Process address for state 1
1020 * @param area2 Process address for state 2
1021 * @param snapshot1 Snapshot of state 1
1022 * @param snapshot2 Snapshot of state 2
1023 * @param previous Pairs of blocks already compared on the current path (or NULL)
1024 * @param type_id Type of variable
1025 * @param pointer_level
1026 * @return 0 (same), 1 (different), -1
1028 int compare_heap_area(void *area1, void* area2, mc_snapshot_t snapshot1, mc_snapshot_t snapshot2, xbt_dynar_t previous, dw_type_t type, int pointer_level){
1030 struct s_mm_diff* state = mm_diff_info;
1033 ssize_t block1, frag1, block2, frag2;
1035 int check_ignore = 0;
1037 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2, *real_addr_block1, *real_addr_block2, *real_addr_frag1, *real_addr_frag2;
1038 void *area1_to_compare, *area2_to_compare;
1040 int offset1 =0, offset2 = 0;
1041 int new_size1 = -1, new_size2 = -1;
1042 dw_type_t new_type1 = NULL, new_type2 = NULL;
1044 int match_pairs = 0;
1046 if(previous == NULL){
1047 previous = xbt_dynar_new(sizeof(heap_area_pair_t), heap_area_pair_free_voidp);
1051 // Get block number:
1052 block1 = ((char*)area1 - (char*)((xbt_mheap_t)state->s_heap)->heapbase) / BLOCKSIZE + 1;
1053 block2 = ((char*)area2 - (char*)((xbt_mheap_t)state->s_heap)->heapbase) / BLOCKSIZE + 1;
1055 // If either block is a stack block:
1056 if(is_block_stack((int)block1) && is_block_stack((int)block2)){
1057 add_heap_area_pair(previous, block1, -1, block2, -1);
1059 match_equals(state, previous);
1060 xbt_dynar_free(&previous);
1065 // If either block is not in the expected area of memory:
1066 if(((char *)area1 < (char*)((xbt_mheap_t)state->s_heap)->heapbase) || (block1 > state->heapsize1) || (block1 < 1)
1067 || ((char *)area2 < (char*)((xbt_mheap_t)state->s_heap)->heapbase) || (block2 > state->heapsize2) || (block2 < 1)){
1069 xbt_dynar_free(&previous);
1074 // Snapshot address of the block:
1075 addr_block1 = ((void*) (((ADDR2UINT(block1)) - 1) * BLOCKSIZE + (char*)state->heapbase1));
1076 addr_block2 = ((void*) (((ADDR2UINT(block2)) - 1) * BLOCKSIZE + (char*)state->heapbase2));
1078 // Process address of the block:
1079 real_addr_block1 = ((void*) (((ADDR2UINT(block1)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)state->s_heap)->heapbase));
1080 real_addr_block2 = ((void*) (((ADDR2UINT(block2)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)state->s_heap)->heapbase));
1085 type = type->full_type;
1087 // This assume that for "boring" types (volatile ...) byte_size is absent:
1088 while(type->byte_size == 0 && type->subtype!=NULL)
1089 type = type->subtype;
1092 if((type->type == DW_TAG_pointer_type) || ((type->type == DW_TAG_base_type) && type->name!=NULL && (!strcmp(type->name, "char"))))
1095 type_size = type->byte_size;
1099 if((state->heapinfo1[block1].type == -1) && (state->heapinfo2[block2].type == -1)){ /* Free block */
1102 match_equals(state, previous);
1103 xbt_dynar_free(&previous);
1107 }else if((state->heapinfo1[block1].type == 0) && (state->heapinfo2[block2].type == 0)){ /* Complete block */
1109 // TODO, lookup variable type from block type as done for fragmented blocks
1111 if(state->equals_to1[block1][0] != NULL && state->equals_to2[block2][0] != NULL){
1112 if(equal_blocks(state, block1, block2)){
1114 match_equals(state, previous);
1115 xbt_dynar_free(&previous);
1121 if(type_size != -1){
1122 if(type_size != state->heapinfo1[block1].busy_block.busy_size
1123 && type_size != state->heapinfo2[block2].busy_block.busy_size
1124 && type->name!=NULL && !strcmp(type->name, "s_smx_context")){
1126 match_equals(state, previous);
1127 xbt_dynar_free(&previous);
1133 if(state->heapinfo1[block1].busy_block.size != state->heapinfo2[block2].busy_block.size){
1135 xbt_dynar_free(&previous);
1140 if(state->heapinfo1[block1].busy_block.busy_size != state->heapinfo2[block2].busy_block.busy_size){
1142 xbt_dynar_free(&previous);
1147 if(!add_heap_area_pair(previous, block1, -1, block2, -1)){
1149 match_equals(state, previous);
1150 xbt_dynar_free(&previous);
1155 size = state->heapinfo1[block1].busy_block.busy_size;
1157 // Remember (basic) type inference.
1158 // The current data structure only allows us to do this for the whole block.
1159 if (type != NULL && area1==real_addr_block1) {
1160 xbt_free(state->types1[block1][0]);
1161 state->types1[block1][0] = type;
1163 if (type != NULL && area2==real_addr_block2) {
1164 xbt_free(state->types2[block2][0]);
1165 state->types2[block2][0] = type;
1170 match_equals(state, previous);
1171 xbt_dynar_free(&previous);
1179 area1_to_compare = addr_block1;
1180 area2_to_compare = addr_block2;
1182 if((state->heapinfo1[block1].busy_block.ignore > 0) && (state->heapinfo2[block2].busy_block.ignore == state->heapinfo1[block1].busy_block.ignore))
1183 check_ignore = state->heapinfo1[block1].busy_block.ignore;
1185 }else if((state->heapinfo1[block1].type > 0) && (state->heapinfo2[block2].type > 0)){ /* Fragmented block */
1188 frag1 = ((uintptr_t) (ADDR2UINT (area1) % (BLOCKSIZE))) >> state->heapinfo1[block1].type;
1189 frag2 = ((uintptr_t) (ADDR2UINT (area2) % (BLOCKSIZE))) >> state->heapinfo2[block2].type;
1191 // Snapshot address of the fragment:
1192 addr_frag1 = (void*) ((char *)addr_block1 + (frag1 << state->heapinfo1[block1].type));
1193 addr_frag2 = (void*) ((char *)addr_block2 + (frag2 << state->heapinfo2[block2].type));
1195 // Process address of the fragment:
1196 real_addr_frag1 = (void*) ((char *)real_addr_block1 + (frag1 << ((xbt_mheap_t)state->s_heap)->heapinfo[block1].type));
1197 real_addr_frag2 = (void*) ((char *)real_addr_block2 + (frag2 << ((xbt_mheap_t)state->s_heap)->heapinfo[block2].type));
1199 // Check the size of the fragments against the size of the type:
1200 if(type_size != -1){
1201 if(state->heapinfo1[block1].busy_frag.frag_size[frag1] == -1 || state->heapinfo2[block2].busy_frag.frag_size[frag2] == -1){
1203 match_equals(state, previous);
1204 xbt_dynar_free(&previous);
1208 if(type_size != state->heapinfo1[block1].busy_frag.frag_size[frag1]|| type_size != state->heapinfo2[block2].busy_frag.frag_size[frag2]){
1210 match_equals(state, previous);
1211 xbt_dynar_free(&previous);
1217 // Check if the blocks are already matched together:
1218 if(state->equals_to1[block1][frag1] != NULL && state->equals_to2[block2][frag2] != NULL){
1219 if(equal_fragments(state, block1, frag1, block2, frag2)){
1221 match_equals(state, previous);
1222 xbt_dynar_free(&previous);
1228 // Compare the size of both fragments:
1229 if(state->heapinfo1[block1].busy_frag.frag_size[frag1] != state->heapinfo2[block2].busy_frag.frag_size[frag2]){
1230 if(type_size == -1){
1232 match_equals(state, previous);
1233 xbt_dynar_free(&previous);
1238 xbt_dynar_free(&previous);
1244 // Size of the fragment:
1245 size = state->heapinfo1[block1].busy_frag.frag_size[frag1];
1247 // Remember (basic) type inference.
1248 // The current data structure only allows us to do this for the whole block.
1249 if(type != NULL && area1==real_addr_frag1){
1250 state->types1[block1][frag1] = type;
1252 if(type != NULL && area2==real_addr_frag2) {
1253 state->types2[block2][frag2] = type;
1256 // The type of the variable is already known:
1262 // Type inference from the block type.
1263 else if(state->types1[block1][frag1] != NULL || state->types2[block2][frag2] != NULL) {
1265 offset1 = (char *)area1 - (char *)real_addr_frag1;
1266 offset2 = (char *)area2 - (char *)real_addr_frag2;
1268 if(state->types1[block1][frag1] != NULL && state->types2[block2][frag2] != NULL){
1269 new_type1 = get_offset_type(real_addr_frag1, state->types1[block1][frag1], offset1, size, snapshot1);
1270 new_type2 = get_offset_type(real_addr_frag2, state->types2[block2][frag2], offset1, size, snapshot2);
1271 }else if(state->types1[block1][frag1] != NULL){
1272 new_type1 = get_offset_type(real_addr_frag1, state->types1[block1][frag1], offset1, size, snapshot1);
1273 new_type2 = get_offset_type(real_addr_frag2, state->types1[block1][frag1], offset2, size, snapshot2);
1274 }else if(state->types2[block2][frag2] != NULL){
1275 new_type1 = get_offset_type(real_addr_frag1, state->types2[block2][frag2], offset1, size, snapshot1);
1276 new_type2 = get_offset_type(real_addr_frag2, state->types2[block2][frag2], offset2, size, snapshot2);
1279 match_equals(state, previous);
1280 xbt_dynar_free(&previous);
1285 if(new_type1 != NULL && new_type2 != NULL && new_type1!=new_type2){
1288 while(type->byte_size == 0 && type->subtype != NULL)
1289 type = type->subtype;
1290 new_size1 = type->byte_size;
1293 while(type->byte_size == 0 && type->subtype != NULL)
1294 type = type->subtype;
1295 new_size2 = type->byte_size;
1299 match_equals(state, previous);
1300 xbt_dynar_free(&previous);
1306 area1_to_compare = (char *)addr_frag1 + offset1;
1307 area2_to_compare = (char *)addr_frag2 + offset2;
1309 if(new_size1 > 0 && new_size1 == new_size2){
1314 if(offset1 == 0 && offset2 == 0){
1315 if(!add_heap_area_pair(previous, block1, frag1, block2, frag2)){
1317 match_equals(state, previous);
1318 xbt_dynar_free(&previous);
1326 match_equals(state, previous);
1327 xbt_dynar_free(&previous);
1332 if((state->heapinfo1[block1].busy_frag.ignore[frag1] > 0) && ( state->heapinfo2[block2].busy_frag.ignore[frag2] == state->heapinfo1[block1].busy_frag.ignore[frag1]))
1333 check_ignore = state->heapinfo1[block1].busy_frag.ignore[frag1];
1338 xbt_dynar_free(&previous);
1345 /* Start comparison*/
1347 res_compare = compare_heap_area_with_type(state, area1, area2, area1_to_compare, area2_to_compare, snapshot1, snapshot2, previous, type, size, check_ignore, pointer_level);
1349 res_compare = compare_heap_area_without_type(state, area1, area2, area1_to_compare, area2_to_compare, snapshot1, snapshot2, previous, size, check_ignore);
1351 if(res_compare == 1){
1353 xbt_dynar_free(&previous);
1358 match_equals(state, previous);
1359 xbt_dynar_free(&previous);
1365 /*********************************************** Miscellaneous ***************************************************/
1366 /****************************************************************************************************************/
1369 static int get_pointed_area_size(void *area, int heap){
1371 struct s_mm_diff *state = mm_diff_info;
1374 malloc_info *heapinfo;
1377 heapinfo = state->heapinfo1;
1379 heapinfo = state->heapinfo2;
1381 block = ((char*)area - (char*)((xbt_mheap_t)state->s_heap)->heapbase) / BLOCKSIZE + 1;
1383 if(((char *)area < (char*)((xbt_mheap_t)state->s_heap)->heapbase) || (block > state->heapsize1) || (block < 1))
1386 if(heapinfo[block].type == -1){ /* Free block */
1388 }else if(heapinfo[block].type == 0){ /* Complete block */
1389 return (int)heapinfo[block].busy_block.busy_size;
1391 frag = ((uintptr_t) (ADDR2UINT (area) % (BLOCKSIZE))) >> heapinfo[block].type;
1392 return (int)heapinfo[block].busy_frag.frag_size[frag];
1398 char *get_type_description(mc_object_info_t info, char *type_name){
1400 xbt_dict_cursor_t dict_cursor;
1404 xbt_dict_foreach(info->types, dict_cursor, type_origin, type){
1405 if(type->name && (strcmp(type->name, type_name) == 0) && type->byte_size > 0){
1406 xbt_dict_cursor_free(&dict_cursor);
1411 xbt_dict_cursor_free(&dict_cursor);
1417 #define max( a, b ) ( ((a) > (b)) ? (a) : (b) )
1421 int mmalloc_linear_compare_heap(xbt_mheap_t heap1, xbt_mheap_t heap2){
1423 struct s_mm_diff *state = mm_diff_info;
1425 if(heap1 == NULL && heap1 == NULL){
1426 XBT_DEBUG("Malloc descriptors null");
1430 if(heap1->heaplimit != heap2->heaplimit){
1431 XBT_DEBUG("Different limit of valid info table indices");
1435 /* Heap information */
1436 state->heaplimit = ((struct mdesc *)heap1)->heaplimit;
1438 state->s_heap = (char *)mmalloc_get_current_heap() - STD_HEAP_SIZE - xbt_pagesize;
1440 state->heapbase1 = (char *)heap1 + BLOCKSIZE;
1441 state->heapbase2 = (char *)heap2 + BLOCKSIZE;
1443 state->heapinfo1 = (malloc_info *)((char *)heap1 + ((uintptr_t)((char *)heap1->heapinfo - (char *)state->s_heap)));
1444 state->heapinfo2 = (malloc_info *)((char *)heap2 + ((uintptr_t)((char *)heap2->heapinfo - (char *)state->s_heap)));
1446 state->heapsize1 = heap1->heapsize;
1447 state->heapsize2 = heap2->heapsize;
1449 /* Start comparison */
1451 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
1455 /* Check busy blocks*/
1459 while(i <= state->heaplimit){
1461 addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)state->heapbase1));
1462 addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)state->heapbase2));
1464 if(state->heapinfo1[i].type != state->heapinfo2[i].type){
1466 distance += BLOCKSIZE;
1467 XBT_DEBUG("Different type of blocks (%zu) : %d - %d -> distance = %d", i, state->heapinfo1[i].type, state->heapinfo2[i].type, distance);
1472 if(state->heapinfo1[i].type == -1){ /* Free block */
1477 if(state->heapinfo1[i].type == 0){ /* Large block */
1479 if(state->heapinfo1[i].busy_block.size != state->heapinfo2[i].busy_block.size){
1480 distance += BLOCKSIZE * max(state->heapinfo1[i].busy_block.size, state->heapinfo2[i].busy_block.size);
1481 i += max(state->heapinfo1[i].busy_block.size, state->heapinfo2[i].busy_block.size);
1482 XBT_DEBUG("Different larger of cluster at block %zu : %zu - %zu -> distance = %d", i, state->heapinfo1[i].busy_block.size, state->heapinfo2[i].busy_block.size, distance);
1486 /*if(heapinfo1[i].busy_block.busy_size != heapinfo2[i].busy_block.busy_size){
1487 distance += max(heapinfo1[i].busy_block.busy_size, heapinfo2[i].busy_block.busy_size);
1488 i += max(heapinfo1[i].busy_block.size, heapinfo2[i].busy_block.size);
1489 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);
1495 //while(k < (heapinfo1[i].busy_block.busy_size)){
1496 while(k < state->heapinfo1[i].busy_block.size * BLOCKSIZE){
1497 if(memcmp((char *)addr_block1 + k, (char *)addr_block2 + k, 1) != 0){
1505 }else { /* Fragmented block */
1507 for(j=0; j < (size_t) (BLOCKSIZE >> state->heapinfo1[i].type); j++){
1509 addr_frag1 = (void*) ((char *)addr_block1 + (j << state->heapinfo1[i].type));
1510 addr_frag2 = (void*) ((char *)addr_block2 + (j << state->heapinfo2[i].type));
1512 if(state->heapinfo1[i].busy_frag.frag_size[j] == 0 && state->heapinfo2[i].busy_frag.frag_size[j] == 0){
1517 /*if(heapinfo1[i].busy_frag.frag_size[j] != heapinfo2[i].busy_frag.frag_size[j]){
1518 distance += max(heapinfo1[i].busy_frag.frag_size[j], heapinfo2[i].busy_frag.frag_size[j]);
1519 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);
1525 //while(k < max(heapinfo1[i].busy_frag.frag_size[j], heapinfo2[i].busy_frag.frag_size[j])){
1526 while(k < (BLOCKSIZE / (BLOCKSIZE >> state->heapinfo1[i].type))){
1527 if(memcmp((char *)addr_frag1 + k, (char *)addr_frag2 + k, 1) != 0){