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;
139 size_t heaplimit, heapsize1, heapsize2;
140 xbt_dynar_t to_ignore1, to_ignore2;
141 heap_area_t **equals_to1, **equals_to2;
142 type_name **types1, **types2;
145 __thread struct s_mm_diff* mm_diff_info = NULL;
147 /*********************************** Free functions ************************************/
149 static void heap_area_pair_free(heap_area_pair_t pair){
154 static void heap_area_pair_free_voidp(void *d){
155 heap_area_pair_free((heap_area_pair_t) * (void **) d);
158 static void heap_area_free(heap_area_t area){
163 /************************************************************************************/
165 static heap_area_t new_heap_area(int block, int fragment){
166 heap_area_t area = NULL;
167 area = xbt_new0(s_heap_area_t, 1);
169 area->fragment = fragment;
174 static int is_new_heap_area_pair(xbt_dynar_t list, int block1, int fragment1, int block2, int fragment2){
176 unsigned int cursor = 0;
177 heap_area_pair_t current_pair;
179 xbt_dynar_foreach(list, cursor, current_pair){
180 if(current_pair->block1 == block1 && current_pair->block2 == block2 && current_pair->fragment1 == fragment1 && current_pair->fragment2 == fragment2)
187 static int add_heap_area_pair(xbt_dynar_t list, int block1, int fragment1, int block2, int fragment2){
189 if(is_new_heap_area_pair(list, block1, fragment1, block2, fragment2)){
190 heap_area_pair_t pair = NULL;
191 pair = xbt_new0(s_heap_area_pair_t, 1);
192 pair->block1 = block1;
193 pair->fragment1 = fragment1;
194 pair->block2 = block2;
195 pair->fragment2 = fragment2;
197 xbt_dynar_push(list, &pair);
205 static ssize_t heap_comparison_ignore_size(xbt_dynar_t ignore_list, void *address){
207 unsigned int cursor = 0;
209 int end = xbt_dynar_length(ignore_list) - 1;
210 mc_heap_ignore_region_t region;
213 cursor = (start + end) / 2;
214 region = (mc_heap_ignore_region_t)xbt_dynar_get_as(ignore_list, cursor, mc_heap_ignore_region_t);
215 if(region->address == address)
217 if(region->address < address)
219 if(region->address > address)
226 static int is_stack(void *address){
227 unsigned int cursor = 0;
228 stack_region_t stack;
230 xbt_dynar_foreach(stacks_areas, cursor, stack){
231 if(address == stack->address)
238 static int is_block_stack(int block){
239 unsigned int cursor = 0;
240 stack_region_t stack;
242 xbt_dynar_foreach(stacks_areas, cursor, stack){
243 if(block == stack->block)
250 static void match_equals(struct s_mm_diff *state, xbt_dynar_t list){
252 unsigned int cursor = 0;
253 heap_area_pair_t current_pair;
254 heap_area_t previous_area;
256 xbt_dynar_foreach(list, cursor, current_pair){
258 if(current_pair->fragment1 != -1){
260 if(state->equals_to1[current_pair->block1][current_pair->fragment1] != NULL){
261 previous_area = state->equals_to1[current_pair->block1][current_pair->fragment1];
262 heap_area_free(state->equals_to2[previous_area->block][previous_area->fragment]);
263 state->equals_to2[previous_area->block][previous_area->fragment] = NULL;
264 heap_area_free(previous_area);
266 if(state->equals_to2[current_pair->block2][current_pair->fragment2] != NULL){
267 previous_area = state->equals_to2[current_pair->block2][current_pair->fragment2];
268 heap_area_free(state->equals_to1[previous_area->block][previous_area->fragment]);
269 state->equals_to1[previous_area->block][previous_area->fragment] = NULL;
270 heap_area_free(previous_area);
273 state->equals_to1[current_pair->block1][current_pair->fragment1] = new_heap_area(current_pair->block2, current_pair->fragment2);
274 state->equals_to2[current_pair->block2][current_pair->fragment2] = new_heap_area(current_pair->block1, current_pair->fragment1);
278 if(state->equals_to1[current_pair->block1][0] != NULL){
279 previous_area = state->equals_to1[current_pair->block1][0];
280 heap_area_free(state->equals_to2[previous_area->block][0]);
281 state->equals_to2[previous_area->block][0] = NULL;
282 heap_area_free(previous_area);
284 if(state->equals_to2[current_pair->block2][0] != NULL){
285 previous_area = state->equals_to2[current_pair->block2][0];
286 heap_area_free(state->equals_to1[previous_area->block][0]);
287 state->equals_to1[previous_area->block][0] = NULL;
288 heap_area_free(previous_area);
291 state->equals_to1[current_pair->block1][0] = new_heap_area(current_pair->block2, current_pair->fragment2);
292 state->equals_to2[current_pair->block2][0] = new_heap_area(current_pair->block1, current_pair->fragment1);
299 static int equal_blocks(struct s_mm_diff *state, int b1, int b2){
301 if(state->equals_to1[b1][0]->block == b2 && state->equals_to2[b2][0]->block == b1)
307 static int equal_fragments(struct s_mm_diff *state, int b1, int f1, int b2, int f2){
309 if(state->equals_to1[b1][f1]->block == b2
310 && state->equals_to1[b1][f1]->fragment == f2
311 && state->equals_to2[b2][f2]->block == b1
312 && state->equals_to2[b2][f2]->fragment == f1)
318 int init_heap_information(xbt_mheap_t heap1, xbt_mheap_t heap2, xbt_dynar_t i1, xbt_dynar_t i2){
319 if(mm_diff_info==NULL) {
320 mm_diff_info = xbt_new0(struct s_mm_diff, 1);
322 struct s_mm_diff *state = mm_diff_info;
324 if((((struct mdesc *)heap1)->heaplimit != ((struct mdesc *)heap2)->heaplimit)
325 || ((((struct mdesc *)heap1)->heapsize != ((struct mdesc *)heap2)->heapsize) ))
330 state->heaplimit = ((struct mdesc *)heap1)->heaplimit;
332 state->s_heap = (char *)mmalloc_get_current_heap() - STD_HEAP_SIZE - getpagesize();
334 state->heapbase1 = (char *)heap1 + BLOCKSIZE;
335 state->heapbase2 = (char *)heap2 + BLOCKSIZE;
337 state->heapinfo1 = (malloc_info *)((char *)heap1 + ((uintptr_t)((char *)((struct mdesc *)heap1)->heapinfo - (char *)state->s_heap)));
338 state->heapinfo2 = (malloc_info *)((char *)heap2 + ((uintptr_t)((char *)((struct mdesc *)heap2)->heapinfo - (char *)state->s_heap)));
340 state->heapsize1 = heap1->heapsize;
341 state->heapsize2 = heap2->heapsize;
343 state->to_ignore1 = i1;
344 state-> to_ignore2 = i2;
346 state->equals_to1 = malloc(state->heaplimit * sizeof(heap_area_t *));
347 state->types1 = malloc(state->heaplimit * sizeof(type_name *));
348 for(i=0; i<=state->heaplimit; i++){
349 state->equals_to1[i] = malloc(MAX_FRAGMENT_PER_BLOCK * sizeof(heap_area_t));
350 state->types1[i] = malloc(MAX_FRAGMENT_PER_BLOCK * sizeof(type_name));
351 for(j=0; j<MAX_FRAGMENT_PER_BLOCK; j++){
352 state->equals_to1[i][j] = NULL;
353 state->types1[i][j] = NULL;
357 state->equals_to2 = malloc(state->heaplimit * sizeof(heap_area_t *));
358 state->types2 = malloc(state->heaplimit * sizeof(type_name *));
359 for(i=0; i<=state->heaplimit; i++){
360 state->equals_to2[i] = malloc(MAX_FRAGMENT_PER_BLOCK * sizeof(heap_area_t));
361 state->types2[i] = malloc(MAX_FRAGMENT_PER_BLOCK * sizeof(type_name));
362 for(j=0; j<MAX_FRAGMENT_PER_BLOCK; j++){
363 state->equals_to2[i][j] = NULL;
364 state->types2[i][j] = NULL;
369 MC_ignore_global_variable("mm_diff_info");
376 void reset_heap_information(){
378 struct s_mm_diff *state = mm_diff_info;
382 for(i=0; i<=state->heaplimit; i++){
383 for(j=0; j<MAX_FRAGMENT_PER_BLOCK;j++){
384 heap_area_free(state->equals_to1[i][j]);
385 state->equals_to1[i][j] = NULL;
386 heap_area_free(state->equals_to2[i][j]);
387 state-> equals_to2[i][j] = NULL;
388 xbt_free(state->types1[i][j]);
389 state->types1[i][j] = NULL;
390 xbt_free(state->types2[i][j]);
391 state->types2[i][j] = NULL;
393 free(state->equals_to1[i]);
394 free(state->equals_to2[i]);
395 free(state->types1[i]);
396 free(state->types2[i]);
399 free(state->equals_to1);
400 free(state->equals_to2);
404 state->s_heap = NULL, state->heapbase1 = NULL, state->heapbase2 = NULL;
405 state->heapinfo1 = NULL, state->heapinfo2 = NULL;
406 state->heaplimit = 0, state->heapsize1 = 0, state->heapsize2 = 0;
407 state->to_ignore1 = NULL, state->to_ignore2 = NULL;
408 state->equals_to1 = NULL, state->equals_to2 = NULL;
409 state->types1 = NULL, state->types2 = NULL;
413 int mmalloc_compare_heap(xbt_mheap_t heap1, xbt_mheap_t heap2, mc_object_info_t info, mc_object_info_t other_info){
415 struct s_mm_diff *state = mm_diff_info;
417 if(heap1 == NULL && heap2 == NULL){
418 XBT_DEBUG("Malloc descriptors null");
422 /* Start comparison */
423 size_t i1, i2, j1, j2, k;
424 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
425 int nb_diff1 = 0, nb_diff2 = 0;
427 xbt_dynar_t previous = xbt_dynar_new(sizeof(heap_area_pair_t), heap_area_pair_free_voidp);
429 int equal, res_compare = 0;
431 /* Check busy blocks*/
435 while(i1 <= state->heaplimit){
437 if(state->heapinfo1[i1].type == -1){ /* Free block */
442 addr_block1 = ((void*) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)state->s_heap)->heapbase));
444 if(state->heapinfo1[i1].type == 0){ /* Large block */
446 if(is_stack(addr_block1)){
447 for(k=0; k < state->heapinfo1[i1].busy_block.size; k++)
448 state->equals_to1[i1+k][0] = new_heap_area(i1, -1);
449 for(k=0; k < state->heapinfo2[i1].busy_block.size; k++)
450 state->equals_to2[i1+k][0] = new_heap_area(i1, -1);
451 i1 += state->heapinfo1[i1].busy_block.size;
455 if(state->equals_to1[i1][0] != NULL){
464 /* Try first to associate to same block in the other heap */
465 if(state->heapinfo2[i1].type == state->heapinfo1[i1].type){
467 if(state->equals_to2[i1][0] == NULL){
469 addr_block2 = ((void*) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)state->s_heap)->heapbase));
471 res_compare = compare_heap_area(addr_block1, addr_block2, NULL, info, other_info, NULL, 0);
473 if(res_compare != 1){
474 for(k=1; k < state->heapinfo2[i1].busy_block.size; k++)
475 state->equals_to2[i1+k][0] = new_heap_area(i1, -1);
476 for(k=1; k < state->heapinfo1[i1].busy_block.size; k++)
477 state->equals_to1[i1+k][0] = new_heap_area(i1, -1);
479 i1 += state->heapinfo1[i1].busy_block.size;
482 xbt_dynar_reset(previous);
488 while(i2 <= state->heaplimit && !equal){
490 addr_block2 = ((void*) (((ADDR2UINT(i2)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)state->s_heap)->heapbase));
497 if(state->heapinfo2[i2].type != 0){
502 if(state->equals_to2[i2][0] != NULL){
507 res_compare = compare_heap_area(addr_block1, addr_block2, NULL, info, other_info, NULL, 0);
509 if(res_compare != 1 ){
510 for(k=1; k < state->heapinfo2[i2].busy_block.size; k++)
511 state->equals_to2[i2+k][0] = new_heap_area(i1, -1);
512 for(k=1; k < state->heapinfo1[i1].busy_block.size; k++)
513 state->equals_to1[i1+k][0] = new_heap_area(i2, -1);
515 i1 += state->heapinfo1[i1].busy_block.size;
518 xbt_dynar_reset(previous);
525 XBT_DEBUG("Block %zu not found (size_used = %zu, addr = %p)", i1, state->heapinfo1[i1].busy_block.busy_size, addr_block1);
526 i1 = state->heaplimit + 1;
531 }else{ /* Fragmented block */
533 for(j1=0; j1 < (size_t) (BLOCKSIZE >> state->heapinfo1[i1].type); j1++){
535 if(state->heapinfo1[i1].busy_frag.frag_size[j1] == -1) /* Free fragment */
538 if(state->equals_to1[i1][j1] != NULL)
541 addr_frag1 = (void*) ((char *)addr_block1 + (j1 << state->heapinfo1[i1].type));
546 /* Try first to associate to same fragment in the other heap */
547 if(state->heapinfo2[i1].type == state->heapinfo1[i1].type){
549 if(state->equals_to2[i1][j1] == NULL){
551 addr_block2 = ((void*) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)state->s_heap)->heapbase));
552 addr_frag2 = (void*) ((char *)addr_block2 + (j1 << ((xbt_mheap_t)state->s_heap)->heapinfo[i1].type));
554 res_compare = compare_heap_area(addr_frag1, addr_frag2, NULL, info, other_info, NULL, 0);
559 xbt_dynar_reset(previous);
565 while(i2 <= state->heaplimit && !equal){
567 if(state->heapinfo2[i2].type <= 0){
572 for(j2=0; j2 < (size_t) (BLOCKSIZE >> state->heapinfo2[i2].type); j2++){
574 if(i2 == i1 && j2 == j1)
577 if(state->equals_to2[i2][j2] != NULL)
580 addr_block2 = ((void*) (((ADDR2UINT(i2)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)state->s_heap)->heapbase));
581 addr_frag2 = (void*) ((char *)addr_block2 + (j2 <<((xbt_mheap_t)state->s_heap)->heapinfo[i2].type));
583 res_compare = compare_heap_area(addr_frag1, addr_frag2, NULL, info, other_info, NULL, 0);
585 if(res_compare != 1){
587 xbt_dynar_reset(previous);
591 xbt_dynar_reset(previous);
600 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);
601 i2 = state->heaplimit + 1;
602 i1 = state->heaplimit + 1;
615 /* All blocks/fragments are equal to another block/fragment ? */
617 void *real_addr_frag1 = NULL, *real_addr_block1 = NULL, *real_addr_block2 = NULL, *real_addr_frag2 = NULL;
619 while(i<=state->heaplimit){
620 if(state->heapinfo1[i].type == 0){
621 if(i1 == state->heaplimit){
622 if(state->heapinfo1[i].busy_block.busy_size > 0){
623 if(state->equals_to1[i][0] == NULL){
624 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
625 addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)state->heapbase1));
626 XBT_DEBUG("Block %zu (%p) not found (size used = %zu)", i, addr_block1, state->heapinfo1[i].busy_block.busy_size);
627 //mmalloc_backtrace_block_display((void*)heapinfo1, i);
634 if(state->heapinfo1[i].type > 0){
635 addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)state->heapbase1));
636 real_addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)((struct mdesc *)state->s_heap)->heapbase));
637 for(j=0; j < (size_t) (BLOCKSIZE >> state->heapinfo1[i].type); j++){
638 if(i1== state->heaplimit){
639 if(state->heapinfo1[i].busy_frag.frag_size[j] > 0){
640 if(state->equals_to1[i][j] == NULL){
641 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
642 addr_frag1 = (void*) ((char *)addr_block1 + (j << state->heapinfo1[i].type));
643 real_addr_frag1 = (void*) ((char *)real_addr_block1 + (j << ((struct mdesc *)state->s_heap)->heapinfo[i].type));
644 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]);
645 //mmalloc_backtrace_fragment_display((void*)heapinfo1, i, j);
656 if(i1 == state->heaplimit)
657 XBT_DEBUG("Number of blocks/fragments not found in heap1 : %d", nb_diff1);
661 while(i<=state->heaplimit){
662 if(state->heapinfo2[i].type == 0){
663 if(i1 == state->heaplimit){
664 if(state->heapinfo2[i].busy_block.busy_size > 0){
665 if(state->equals_to2[i][0] == NULL){
666 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
667 addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)state->heapbase2));
668 XBT_DEBUG("Block %zu (%p) not found (size used = %zu)", i, addr_block2, state->heapinfo2[i].busy_block.busy_size);
669 //mmalloc_backtrace_block_display((void*)heapinfo2, i);
676 if(state->heapinfo2[i].type > 0){
677 addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)state->heapbase2));
678 real_addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)((struct mdesc *)state->s_heap)->heapbase));
679 for(j=0; j < (size_t) (BLOCKSIZE >> state->heapinfo2[i].type); j++){
680 if(i1 == state->heaplimit){
681 if(state->heapinfo2[i].busy_frag.frag_size[j] > 0){
682 if(state->equals_to2[i][j] == NULL){
683 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
684 addr_frag2 = (void*) ((char *)addr_block2 + (j << state->heapinfo2[i].type));
685 real_addr_frag2 = (void*) ((char *)real_addr_block2 + (j << ((struct mdesc *)state->s_heap)->heapinfo[i].type));
686 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]);
687 //mmalloc_backtrace_fragment_display((void*)heapinfo2, i, j);
698 if(i1 == state->heaplimit)
699 XBT_DEBUG("Number of blocks/fragments not found in heap2 : %d", nb_diff2);
701 xbt_dynar_free(&previous);
702 real_addr_frag1 = NULL, real_addr_block1 = NULL, real_addr_block2 = NULL, real_addr_frag2 = NULL;
704 return ((nb_diff1 > 0) || (nb_diff2 > 0));
707 static int compare_heap_area_without_type(struct s_mm_diff *state, void *real_area1, void *real_area2, void *area1, void *area2, xbt_dynar_t previous, mc_object_info_t info, mc_object_info_t other_info, int size, int check_ignore){
710 void *addr_pointed1, *addr_pointed2;
711 int pointer_align, res_compare;
712 ssize_t ignore1, ignore2;
716 if(check_ignore > 0){
717 if((ignore1 = heap_comparison_ignore_size(state->to_ignore1, (char *)real_area1 + i)) != -1){
718 if((ignore2 = heap_comparison_ignore_size(state->to_ignore2, (char *)real_area2 + i)) == ignore1){
731 if(memcmp(((char *)area1) + i, ((char *)area2) + i, 1) != 0){
733 pointer_align = (i / sizeof(void*)) * sizeof(void*);
734 addr_pointed1 = *((void **)((char *)area1 + pointer_align));
735 addr_pointed2 = *((void **)((char *)area2 + pointer_align));
737 if(addr_pointed1 > maestro_stack_start && addr_pointed1 < maestro_stack_end && addr_pointed2 > maestro_stack_start && addr_pointed2 < maestro_stack_end){
738 i = pointer_align + sizeof(void *);
740 }else if((addr_pointed1 > state->s_heap) && ((char *)addr_pointed1 < (char *)state->s_heap + STD_HEAP_SIZE)
741 && (addr_pointed2 > state->s_heap) && ((char *)addr_pointed2 < (char *)state->s_heap + STD_HEAP_SIZE)){
742 res_compare = compare_heap_area(addr_pointed1, addr_pointed2, previous, info, other_info, NULL, 0);
743 if(res_compare == 1){
746 i = pointer_align + sizeof(void *);
762 // area_size is either a byte_size or an elements_count?&
763 static int compare_heap_area_with_type(struct s_mm_diff *state, void *real_area1, void *real_area2, void *area1, void *area2,
764 xbt_dynar_t previous, mc_object_info_t info, mc_object_info_t other_info, char *type_id,
765 int area_size, int check_ignore, int pointer_level){
767 if(is_stack(real_area1) && is_stack(real_area2))
770 ssize_t ignore1, ignore2;
772 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)){
776 dw_type_t type = xbt_dict_get_or_null(info->types, type_id);
777 dw_type_t subtype, subsubtype;
778 int res, elm_size, i, switch_types = 0;
779 unsigned int cursor = 0;
781 void *addr_pointed1, *addr_pointed2;;
784 case DW_TAG_unspecified_type:
787 case DW_TAG_base_type:
788 if(type->name!=NULL && strcmp(type->name, "char") == 0){ /* String, hence random (arbitrary ?) size */
789 if(real_area1 == real_area2)
792 return (memcmp(area1, area2, area_size) != 0);
794 if(area_size != -1 && type->byte_size != area_size)
797 return (memcmp(area1, area2, type->byte_size) != 0);
801 case DW_TAG_enumeration_type:
802 if(area_size != -1 && type->byte_size != area_size)
805 return (memcmp(area1, area2, type->byte_size) != 0);
808 case DW_TAG_const_type:
809 case DW_TAG_volatile_type:
810 return compare_heap_area_with_type(state, real_area1, real_area2, area1, area2, previous, info, other_info, type->dw_type_id, area_size, check_ignore, pointer_level);
812 case DW_TAG_array_type:
813 subtype = xbt_dict_get_or_null(info->types, type->dw_type_id);
814 switch(subtype->type){
815 case DW_TAG_unspecified_type:
818 case DW_TAG_base_type:
819 case DW_TAG_enumeration_type:
820 case DW_TAG_pointer_type:
821 case DW_TAG_reference_type:
822 case DW_TAG_rvalue_reference_type:
823 case DW_TAG_structure_type:
824 case DW_TAG_class_type:
825 case DW_TAG_union_type:
826 if(subtype->byte_size == 0){ /*declaration of the type, need the complete description */
827 subtype = xbt_dict_get_or_null(other_info->types_by_name, subtype->name);
830 elm_size = subtype->byte_size;
832 // TODO, just remove the type indirection?
833 case DW_TAG_const_type:
835 case DW_TAG_volatile_type:
836 subsubtype = subtype->subtype;
837 if(subsubtype->byte_size == 0){ /*declaration of the type, need the complete description */
838 subsubtype = xbt_dict_get_or_null(other_info->types_by_name, subtype->name);
841 elm_size = subsubtype->byte_size;
847 for(i=0; i<type->element_count; i++){
848 // TODO, add support for variable stride (DW_AT_byte_stride)
850 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), previous, other_info, info, type->dw_type_id, subtype->byte_size, check_ignore, pointer_level);
852 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), previous, info, other_info, type->dw_type_id, subtype->byte_size, check_ignore, pointer_level);
857 case DW_TAG_reference_type:
858 case DW_TAG_rvalue_reference_type:
859 case DW_TAG_pointer_type:
860 if(type->dw_type_id && ((dw_type_t)xbt_dict_get_or_null(info->types, type->dw_type_id))->type == DW_TAG_subroutine_type){
861 addr_pointed1 = *((void **)(area1));
862 addr_pointed2 = *((void **)(area2));
863 return (addr_pointed1 != addr_pointed2);;
866 if(pointer_level > 1){ /* Array of pointers */
867 for(i=0; i<(area_size/sizeof(void *)); i++){
868 addr_pointed1 = *((void **)((char *)area1 + (i*sizeof(void *))));
869 addr_pointed2 = *((void **)((char *)area2 + (i*sizeof(void *))));
870 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)
871 res = compare_heap_area(addr_pointed1, addr_pointed2, previous, info, other_info, type->dw_type_id, pointer_level);
873 res = (addr_pointed1 != addr_pointed2);
878 addr_pointed1 = *((void **)(area1));
879 addr_pointed2 = *((void **)(area2));
880 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)
881 return compare_heap_area(addr_pointed1, addr_pointed2, previous, info, other_info, type->dw_type_id, pointer_level);
883 return (addr_pointed1 != addr_pointed2);
887 case DW_TAG_structure_type:
888 case DW_TAG_class_type:
889 if(type->byte_size == 0){ /*declaration of the structure, need the complete description */
890 dw_type_t full_type = xbt_dict_get_or_null(info->types_by_name, type->name);
894 type = xbt_dict_get_or_null(other_info->types_by_name, type->name);
898 if(area_size != -1 && type->byte_size != area_size){
899 if(area_size>type->byte_size && area_size%type->byte_size == 0){
900 for(i=0; i<(area_size/type->byte_size); i++){
902 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), previous, other_info, info, type_id, -1, check_ignore, 0);
904 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), previous, info, other_info, type_id, -1, check_ignore, 0);
913 xbt_dynar_foreach(type->members, cursor, member){
915 res = compare_heap_area_with_type(state, (char *)real_area1 + member->offset, (char *)real_area2 + member->offset, (char *)area1 + member->offset, (char *)area2 + member->offset, previous, other_info, info, member->dw_type_id, -1, check_ignore, 0);
917 res = compare_heap_area_with_type(state, (char *)real_area1 + member->offset, (char *)real_area2 + member->offset, (char *)area1 + member->offset, (char *)area2 + member->offset, previous, info, other_info, member->dw_type_id, -1, check_ignore, 0);
924 case DW_TAG_union_type:
925 return compare_heap_area_without_type(state, real_area1, real_area2, area1, area2, previous, info, other_info, type->byte_size, check_ignore);
935 static char* get_offset_type(char* type_id, int offset, mc_object_info_t info, mc_object_info_t other_info, int area_size, int *switch_type){
936 dw_type_t type = xbt_dict_get_or_null(info->types, type_id);
938 type = xbt_dict_get_or_null(other_info->types, type_id);
942 case DW_TAG_structure_type :
943 case DW_TAG_class_type:
944 if(type->byte_size == 0){ /*declaration of the structure, need the complete description */
945 if(*switch_type == 0){
946 dw_type_t full_type = xbt_dict_get_or_null(info->types_by_name, type->name);
950 type = xbt_dict_get_or_null(other_info->types_by_name, type->name);
954 dw_type_t full_type = xbt_dict_get_or_null(other_info->types_by_name, type->name);
958 type = xbt_dict_get_or_null(info->types_by_name, type->name);
964 if(area_size != -1 && type->byte_size != area_size){
965 if(area_size>type->byte_size && area_size%type->byte_size == 0)
970 unsigned int cursor = 0;
972 xbt_dynar_foreach(type->members, cursor, member){
973 if(member->offset == offset)
974 return member->dw_type_id;
980 /* FIXME : other cases ? */
986 int compare_heap_area(void *area1, void* area2, xbt_dynar_t previous, mc_object_info_t info, mc_object_info_t other_info, char *type_id, int pointer_level){
988 struct s_mm_diff* state = mm_diff_info;
991 ssize_t block1, frag1, block2, frag2;
993 int check_ignore = 0;
995 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2, *real_addr_block1, *real_addr_block2, *real_addr_frag1, *real_addr_frag2;
996 void *area1_to_compare, *area2_to_compare;
997 dw_type_t type = NULL;
999 int offset1 =0, offset2 = 0;
1000 int new_size1 = -1, new_size2 = -1;
1001 char *new_type_id1 = NULL, *new_type_id2 = NULL;
1002 int switch_type = 0;
1004 int match_pairs = 0;
1006 if(previous == NULL){
1007 previous = xbt_dynar_new(sizeof(heap_area_pair_t), heap_area_pair_free_voidp);
1011 block1 = ((char*)area1 - (char*)((xbt_mheap_t)state->s_heap)->heapbase) / BLOCKSIZE + 1;
1012 block2 = ((char*)area2 - (char*)((xbt_mheap_t)state->s_heap)->heapbase) / BLOCKSIZE + 1;
1014 if(is_block_stack((int)block1) && is_block_stack((int)block2)){
1015 add_heap_area_pair(previous, block1, -1, block2, -1);
1017 match_equals(state, previous);
1018 xbt_dynar_free(&previous);
1023 if(((char *)area1 < (char*)((xbt_mheap_t)state->s_heap)->heapbase) || (block1 > state->heapsize1) || (block1 < 1) || ((char *)area2 < (char*)((xbt_mheap_t)state->s_heap)->heapbase) || (block2 > state->heapsize2) || (block2 < 1)){
1025 xbt_dynar_free(&previous);
1030 addr_block1 = ((void*) (((ADDR2UINT(block1)) - 1) * BLOCKSIZE + (char*)state->heapbase1));
1031 addr_block2 = ((void*) (((ADDR2UINT(block2)) - 1) * BLOCKSIZE + (char*)state->heapbase2));
1033 real_addr_block1 = ((void*) (((ADDR2UINT(block1)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)state->s_heap)->heapbase));
1034 real_addr_block2 = ((void*) (((ADDR2UINT(block2)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)state->s_heap)->heapbase));
1037 type = xbt_dict_get_or_null(info->types, type_id);
1038 if(type->byte_size == 0){
1039 if(type->subtype == NULL){
1040 dw_type_t full_type = xbt_dict_get_or_null(info->types_by_name, type->name);
1044 type = xbt_dict_get_or_null(other_info->types_by_name, type->name);
1046 type = type->subtype;
1049 if((type->type == DW_TAG_pointer_type) || ((type->type == DW_TAG_base_type) && type->name!=NULL && (!strcmp(type->name, "char"))))
1052 type_size = type->byte_size;
1055 if((state->heapinfo1[block1].type == -1) && (state->heapinfo2[block2].type == -1)){ /* Free block */
1058 match_equals(state, previous);
1059 xbt_dynar_free(&previous);
1063 }else if((state->heapinfo1[block1].type == 0) && (state->heapinfo2[block2].type == 0)){ /* Complete block */
1065 if(state->equals_to1[block1][0] != NULL && state->equals_to2[block2][0] != NULL){
1066 if(equal_blocks(state, block1, block2)){
1068 match_equals(state, previous);
1069 xbt_dynar_free(&previous);
1075 if(type_size != -1){
1076 if(type_size != state->heapinfo1[block1].busy_block.busy_size
1077 && type_size != state->heapinfo2[block2].busy_block.busy_size
1078 && type->name!=NULL && !strcmp(type->name, "s_smx_context")){
1080 match_equals(state, previous);
1081 xbt_dynar_free(&previous);
1087 if(state->heapinfo1[block1].busy_block.size != state->heapinfo2[block2].busy_block.size){
1089 xbt_dynar_free(&previous);
1094 if(state->heapinfo1[block1].busy_block.busy_size != state->heapinfo2[block2].busy_block.busy_size){
1096 xbt_dynar_free(&previous);
1101 if(!add_heap_area_pair(previous, block1, -1, block2, -1)){
1103 match_equals(state, previous);
1104 xbt_dynar_free(&previous);
1109 size = state->heapinfo1[block1].busy_block.busy_size;
1111 if(type_id != NULL){
1112 xbt_free(state->types1[block1][0]);
1113 xbt_free(state->types2[block2][0]);
1114 state->types1[block1][0] = strdup(type_id);
1115 state->types2[block2][0] = strdup(type_id);
1120 match_equals(state, previous);
1121 xbt_dynar_free(&previous);
1129 area1_to_compare = addr_block1;
1130 area2_to_compare = addr_block2;
1132 if((state->heapinfo1[block1].busy_block.ignore > 0) && (state->heapinfo2[block2].busy_block.ignore == state->heapinfo1[block1].busy_block.ignore))
1133 check_ignore = state->heapinfo1[block1].busy_block.ignore;
1135 }else if((state->heapinfo1[block1].type > 0) && (state->heapinfo2[block2].type > 0)){ /* Fragmented block */
1137 frag1 = ((uintptr_t) (ADDR2UINT (area1) % (BLOCKSIZE))) >> state->heapinfo1[block1].type;
1138 frag2 = ((uintptr_t) (ADDR2UINT (area2) % (BLOCKSIZE))) >> state->heapinfo2[block2].type;
1140 addr_frag1 = (void*) ((char *)addr_block1 + (frag1 << state->heapinfo1[block1].type));
1141 addr_frag2 = (void*) ((char *)addr_block2 + (frag2 << state->heapinfo2[block2].type));
1143 real_addr_frag1 = (void*) ((char *)real_addr_block1 + (frag1 << ((xbt_mheap_t)state->s_heap)->heapinfo[block1].type));
1144 real_addr_frag2 = (void*) ((char *)real_addr_block2 + (frag2 << ((xbt_mheap_t)state->s_heap)->heapinfo[block2].type));
1146 if(type_size != -1){
1147 if(state->heapinfo1[block1].busy_frag.frag_size[frag1] == -1 || state->heapinfo2[block2].busy_frag.frag_size[frag2] == -1){
1149 match_equals(state, previous);
1150 xbt_dynar_free(&previous);
1154 if(type_size != state->heapinfo1[block1].busy_frag.frag_size[frag1]|| type_size != state->heapinfo2[block2].busy_frag.frag_size[frag2]){
1156 match_equals(state, previous);
1157 xbt_dynar_free(&previous);
1163 if(state->equals_to1[block1][frag1] != NULL && state->equals_to2[block2][frag2] != NULL){
1164 if(equal_fragments(state, block1, frag1, block2, frag2)){
1166 match_equals(state, previous);
1167 xbt_dynar_free(&previous);
1173 if(state->heapinfo1[block1].busy_frag.frag_size[frag1] != state->heapinfo2[block2].busy_frag.frag_size[frag2]){
1174 if(type_size == -1){
1176 match_equals(state, previous);
1177 xbt_dynar_free(&previous);
1182 xbt_dynar_free(&previous);
1188 size = state->heapinfo1[block1].busy_frag.frag_size[frag1];
1190 if(type_id != NULL){
1191 xbt_free(state->types1[block1][frag1]);
1192 xbt_free(state->types2[block2][frag2]);
1193 state->types1[block1][frag1] = strdup(type_id);
1194 state->types2[block2][frag2] = strdup(type_id);
1197 if(real_addr_frag1 != area1 || real_addr_frag2 != area2){
1198 offset1 = (char *)area1 - (char *)real_addr_frag1;
1199 offset2 = (char *)area2 - (char *)real_addr_frag2;
1200 if(state->types1[block1][frag1] != NULL && state->types2[block2][frag2] != NULL){
1201 new_type_id1 = get_offset_type(state->types1[block1][frag1], offset1, info, other_info, size, &switch_type);
1202 new_type_id2 = get_offset_type(state->types2[block2][frag2], offset1, info, other_info, size, &switch_type);
1203 }else if(state->types1[block1][frag1] != NULL){
1204 new_type_id1 = get_offset_type(state->types1[block1][frag1], offset1, info, other_info, size, &switch_type);
1205 new_type_id2 = get_offset_type(state->types1[block1][frag1], offset2, info, other_info, size, &switch_type);
1206 }else if(state->types2[block2][frag2] != NULL){
1207 new_type_id1 = get_offset_type(state->types2[block2][frag2], offset1, info, other_info, size, &switch_type);
1208 new_type_id2 = get_offset_type(state->types2[block2][frag2], offset2, info, other_info, size, &switch_type);
1211 match_equals(state, previous);
1212 xbt_dynar_free(&previous);
1217 if(new_type_id1 != NULL && new_type_id2 != NULL && !strcmp(new_type_id1, new_type_id2)){
1219 type = xbt_dict_get_or_null(other_info->types, new_type_id1);
1220 while(type->byte_size == 0 && type->dw_type_id != NULL)
1221 type = xbt_dict_get_or_null(other_info->types, type->dw_type_id);
1222 new_size1 = type->byte_size;
1223 type = xbt_dict_get_or_null(other_info->types, new_type_id2);
1224 while(type->byte_size == 0 && type->dw_type_id != NULL)
1225 type = xbt_dict_get_or_null(other_info->types, type->dw_type_id);
1226 new_size2 = type->byte_size;
1228 type = xbt_dict_get_or_null(info->types, new_type_id1);
1229 while(type->byte_size == 0 && type->dw_type_id != NULL)
1230 type = xbt_dict_get_or_null(info->types, type->dw_type_id);
1231 new_size1 = type->byte_size;
1232 type = xbt_dict_get_or_null(info->types, new_type_id2);
1233 while(type->byte_size == 0 && type->dw_type_id != NULL)
1234 type = xbt_dict_get_or_null(info->types, type->dw_type_id);
1235 new_size2 = type->byte_size;
1239 match_equals(state, previous);
1240 xbt_dynar_free(&previous);
1246 area1_to_compare = (char *)addr_frag1 + offset1;
1247 area2_to_compare = (char *)addr_frag2 + offset2;
1249 if(new_size1 > 0 && new_size1 == new_size2){
1250 type_id = new_type_id1;
1254 if(offset1 == 0 && offset2 == 0){
1255 if(!add_heap_area_pair(previous, block1, frag1, block2, frag2)){
1257 match_equals(state, previous);
1258 xbt_dynar_free(&previous);
1266 match_equals(state, previous);
1267 xbt_dynar_free(&previous);
1272 if((state->heapinfo1[block1].busy_frag.ignore[frag1] > 0) && ( state->heapinfo2[block2].busy_frag.ignore[frag2] == state->heapinfo1[block1].busy_frag.ignore[frag1]))
1273 check_ignore = state->heapinfo1[block1].busy_frag.ignore[frag1];
1278 xbt_dynar_free(&previous);
1285 /* Start comparison*/
1286 if(type_id != NULL){
1288 res_compare = compare_heap_area_with_type(state, area1, area2, area1_to_compare, area2_to_compare, previous, other_info, info, type_id, size, check_ignore, pointer_level);
1290 res_compare = compare_heap_area_with_type(state, area1, area2, area1_to_compare, area2_to_compare, previous, info, other_info, type_id, size, check_ignore, pointer_level);
1291 if(res_compare == 1){
1293 xbt_dynar_free(&previous);
1298 res_compare = compare_heap_area_without_type(state, area1, area2, area1_to_compare, area2_to_compare, previous, other_info, info, size, check_ignore);
1300 res_compare = compare_heap_area_without_type(state, area1, area2, area1_to_compare, area2_to_compare, previous, info, other_info, size, check_ignore);
1301 if(res_compare == 1){
1303 xbt_dynar_free(&previous);
1309 match_equals(state, previous);
1310 xbt_dynar_free(&previous);
1316 /*********************************************** Miscellaneous ***************************************************/
1317 /****************************************************************************************************************/
1320 static int get_pointed_area_size(void *area, int heap){
1322 struct s_mm_diff *state = mm_diff_info;
1325 malloc_info *heapinfo;
1328 heapinfo = state->heapinfo1;
1330 heapinfo = state->heapinfo2;
1332 block = ((char*)area - (char*)((xbt_mheap_t)state->s_heap)->heapbase) / BLOCKSIZE + 1;
1334 if(((char *)area < (char*)((xbt_mheap_t)state->s_heap)->heapbase) || (block > state->heapsize1) || (block < 1))
1337 if(heapinfo[block].type == -1){ /* Free block */
1339 }else if(heapinfo[block].type == 0){ /* Complete block */
1340 return (int)heapinfo[block].busy_block.busy_size;
1342 frag = ((uintptr_t) (ADDR2UINT (area) % (BLOCKSIZE))) >> heapinfo[block].type;
1343 return (int)heapinfo[block].busy_frag.frag_size[frag];
1349 char *get_type_description(mc_object_info_t info, char *type_name){
1351 xbt_dict_cursor_t dict_cursor;
1355 xbt_dict_foreach(info->types, dict_cursor, type_origin, type){
1356 if(type->name && (strcmp(type->name, type_name) == 0) && type->byte_size > 0){
1357 xbt_dict_cursor_free(&dict_cursor);
1362 xbt_dict_cursor_free(&dict_cursor);
1368 #define max( a, b ) ( ((a) > (b)) ? (a) : (b) )
1372 int mmalloc_linear_compare_heap(xbt_mheap_t heap1, xbt_mheap_t heap2){
1374 struct s_mm_diff *state = mm_diff_info;
1376 if(heap1 == NULL && heap1 == NULL){
1377 XBT_DEBUG("Malloc descriptors null");
1381 if(heap1->heaplimit != heap2->heaplimit){
1382 XBT_DEBUG("Different limit of valid info table indices");
1386 /* Heap information */
1387 state->heaplimit = ((struct mdesc *)heap1)->heaplimit;
1389 state->s_heap = (char *)mmalloc_get_current_heap() - STD_HEAP_SIZE - getpagesize();
1391 state->heapbase1 = (char *)heap1 + BLOCKSIZE;
1392 state->heapbase2 = (char *)heap2 + BLOCKSIZE;
1394 state->heapinfo1 = (malloc_info *)((char *)heap1 + ((uintptr_t)((char *)heap1->heapinfo - (char *)state->s_heap)));
1395 state->heapinfo2 = (malloc_info *)((char *)heap2 + ((uintptr_t)((char *)heap2->heapinfo - (char *)state->s_heap)));
1397 state->heapsize1 = heap1->heapsize;
1398 state->heapsize2 = heap2->heapsize;
1400 /* Start comparison */
1402 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
1406 /* Check busy blocks*/
1410 while(i <= state->heaplimit){
1412 addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)state->heapbase1));
1413 addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)state->heapbase2));
1415 if(state->heapinfo1[i].type != state->heapinfo2[i].type){
1417 distance += BLOCKSIZE;
1418 XBT_DEBUG("Different type of blocks (%zu) : %d - %d -> distance = %d", i, state->heapinfo1[i].type, state->heapinfo2[i].type, distance);
1423 if(state->heapinfo1[i].type == -1){ /* Free block */
1428 if(state->heapinfo1[i].type == 0){ /* Large block */
1430 if(state->heapinfo1[i].busy_block.size != state->heapinfo2[i].busy_block.size){
1431 distance += BLOCKSIZE * max(state->heapinfo1[i].busy_block.size, state->heapinfo2[i].busy_block.size);
1432 i += max(state->heapinfo1[i].busy_block.size, state->heapinfo2[i].busy_block.size);
1433 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);
1437 /*if(heapinfo1[i].busy_block.busy_size != heapinfo2[i].busy_block.busy_size){
1438 distance += max(heapinfo1[i].busy_block.busy_size, heapinfo2[i].busy_block.busy_size);
1439 i += max(heapinfo1[i].busy_block.size, heapinfo2[i].busy_block.size);
1440 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);
1446 //while(k < (heapinfo1[i].busy_block.busy_size)){
1447 while(k < state->heapinfo1[i].busy_block.size * BLOCKSIZE){
1448 if(memcmp((char *)addr_block1 + k, (char *)addr_block2 + k, 1) != 0){
1456 }else { /* Fragmented block */
1458 for(j=0; j < (size_t) (BLOCKSIZE >> state->heapinfo1[i].type); j++){
1460 addr_frag1 = (void*) ((char *)addr_block1 + (j << state->heapinfo1[i].type));
1461 addr_frag2 = (void*) ((char *)addr_block2 + (j << state->heapinfo2[i].type));
1463 if(state->heapinfo1[i].busy_frag.frag_size[j] == 0 && state->heapinfo2[i].busy_frag.frag_size[j] == 0){
1468 /*if(heapinfo1[i].busy_frag.frag_size[j] != heapinfo2[i].busy_frag.frag_size[j]){
1469 distance += max(heapinfo1[i].busy_frag.frag_size[j], heapinfo2[i].busy_frag.frag_size[j]);
1470 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);
1476 //while(k < max(heapinfo1[i].busy_frag.frag_size[j], heapinfo2[i].busy_frag.frag_size[j])){
1477 while(k < (BLOCKSIZE / (BLOCKSIZE >> state->heapinfo1[i].type))){
1478 if(memcmp((char *)addr_frag1 + k, (char *)addr_frag2 + k, 1) != 0){