1 /* mm_diff - Memory snapshooting and comparison */
3 /* Copyright (c) 2008-2013. 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"
15 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mm_diff, xbt,
16 "Logging specific to mm_diff in mmalloc");
18 xbt_dynar_t mc_heap_comparison_ignore;
19 xbt_dynar_t stacks_areas;
20 void *maestro_stack_start, *maestro_stack_end;
23 /********************************* Backtrace ***********************************/
24 /******************************************************************************/
26 static void mmalloc_backtrace_block_display(void* heapinfo, int block){
30 /* if (((malloc_info *)heapinfo)[block].busy_block.bt_size == 0) { */
31 /* fprintf(stderr, "No backtrace available for that block, sorry.\n"); */
35 /* memcpy(&e.bt,&(((malloc_info *)heapinfo)[block].busy_block.bt),sizeof(void*)*XBT_BACKTRACE_SIZE); */
36 /* e.used = ((malloc_info *)heapinfo)[block].busy_block.bt_size; */
38 /* xbt_ex_setup_backtrace(&e); */
39 /* if (e.used == 0) { */
40 /* fprintf(stderr, "(backtrace not set)\n"); */
41 /* } else if (e.bt_strings == NULL) { */
42 /* fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet"); */
46 /* fprintf(stderr, "Backtrace of where the block %d was malloced (%d frames):\n", block ,e.used); */
47 /* for (i = 0; i < e.used; i++) /\* no need to display "xbt_backtrace_display" *\/{ */
48 /* fprintf(stderr, "%d ---> %s\n",i, e.bt_strings[i] + 4); */
53 static void mmalloc_backtrace_fragment_display(void* heapinfo, int block, int frag){
57 /* memcpy(&e.bt,&(((malloc_info *)heapinfo)[block].busy_frag.bt[frag]),sizeof(void*)*XBT_BACKTRACE_SIZE); */
58 /* e.used = XBT_BACKTRACE_SIZE; */
60 /* xbt_ex_setup_backtrace(&e); */
61 /* if (e.used == 0) { */
62 /* fprintf(stderr, "(backtrace not set)\n"); */
63 /* } else if (e.bt_strings == NULL) { */
64 /* fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet"); */
68 /* fprintf(stderr, "Backtrace of where the fragment %d in block %d was malloced (%d frames):\n", frag, block ,e.used); */
69 /* for (i = 0; i < e.used; i++) /\* no need to display "xbt_backtrace_display" *\/{ */
70 /* fprintf(stderr, "%d ---> %s\n",i, e.bt_strings[i] + 4); */
76 static void mmalloc_backtrace_display(void *addr){
78 /* size_t block, frag_nb; */
81 /* xbt_mheap_t heap = __mmalloc_current_heap ?: (xbt_mheap_t) mmalloc_preinit(); */
83 /* block = (((char*) (addr) - (char*) heap -> heapbase) / BLOCKSIZE + 1); */
85 /* type = heap->heapinfo[block].type; */
88 /* case -1 : /\* Free block *\/ */
89 /* fprintf(stderr, "Asked to display the backtrace of a block that is free. I'm puzzled\n"); */
92 /* case 0: /\* Large block *\/ */
93 /* mmalloc_backtrace_block_display(heap->heapinfo, block); */
95 /* default: /\* Fragmented block *\/ */
96 /* frag_nb = RESIDUAL(addr, BLOCKSIZE) >> type; */
97 /* if(heap->heapinfo[block].busy_frag.frag_size[frag_nb] == -1){ */
98 /* fprintf(stderr , "Asked to display the backtrace of a fragment that is free. I'm puzzled\n"); */
101 /* mmalloc_backtrace_fragment_display(heap->heapinfo, block, frag_nb); */
107 static int compare_backtrace(int b1, int f1, int b2, int f2){
110 for(i=0; i< XBT_BACKTRACE_SIZE; i++){
111 if(heapinfo1[b1].busy_frag.bt[f1][i] != heapinfo2[b2].busy_frag.bt[f2][i]){
112 //mmalloc_backtrace_fragment_display((void*)heapinfo1, b1, f1);
113 //mmalloc_backtrace_fragment_display((void*)heapinfo2, b2, f2);
118 for(i=0; i< heapinfo1[b1].busy_block.bt_size; i++){
119 if(heapinfo1[b1].busy_block.bt[i] != heapinfo2[b2].busy_block.bt[i]){
120 //mmalloc_backtrace_block_display((void*)heapinfo1, b1);
121 //mmalloc_backtrace_block_display((void*)heapinfo2, b2);
130 /*********************************** Heap comparison ***********************************/
131 /***************************************************************************************/
133 typedef char* type_name;
135 __thread void *s_heap = NULL, *heapbase1 = NULL, *heapbase2 = NULL;
136 __thread malloc_info *heapinfo1 = NULL, *heapinfo2 = NULL;
137 __thread size_t heaplimit = 0, heapsize1 = 0, heapsize2 = 0;
138 __thread xbt_dynar_t to_ignore1 = NULL, to_ignore2 = NULL;
139 __thread heap_area_t **equals_to1, **equals_to2;
140 __thread type_name **types1, **types2;
142 /*********************************** Free functions ************************************/
144 static void heap_area_pair_free(heap_area_pair_t pair){
149 static void heap_area_pair_free_voidp(void *d){
150 heap_area_pair_free((heap_area_pair_t) * (void **) d);
153 static void heap_area_free(heap_area_t area){
158 /************************************************************************************/
160 static heap_area_t new_heap_area(int block, int fragment){
161 heap_area_t area = NULL;
162 area = xbt_new0(s_heap_area_t, 1);
164 area->fragment = fragment;
169 static int is_new_heap_area_pair(xbt_dynar_t list, int block1, int fragment1, int block2, int fragment2){
171 unsigned int cursor = 0;
172 heap_area_pair_t current_pair;
174 xbt_dynar_foreach(list, cursor, current_pair){
175 if(current_pair->block1 == block1 && current_pair->block2 == block2 && current_pair->fragment1 == fragment1 && current_pair->fragment2 == fragment2)
182 static int add_heap_area_pair(xbt_dynar_t list, int block1, int fragment1, int block2, int fragment2){
184 if(is_new_heap_area_pair(list, block1, fragment1, block2, fragment2)){
185 heap_area_pair_t pair = NULL;
186 pair = xbt_new0(s_heap_area_pair_t, 1);
187 pair->block1 = block1;
188 pair->fragment1 = fragment1;
189 pair->block2 = block2;
190 pair->fragment2 = fragment2;
192 xbt_dynar_push(list, &pair);
200 static size_t heap_comparison_ignore_size(xbt_dynar_t ignore_list, void *address){
202 unsigned int cursor = 0;
204 int end = xbt_dynar_length(ignore_list) - 1;
205 mc_heap_ignore_region_t region;
208 cursor = (start + end) / 2;
209 region = (mc_heap_ignore_region_t)xbt_dynar_get_as(ignore_list, cursor, mc_heap_ignore_region_t);
210 if(region->address == address)
212 if(region->address < address)
214 if(region->address > address)
221 static int is_stack(void *address){
222 unsigned int cursor = 0;
223 stack_region_t stack;
225 xbt_dynar_foreach(stacks_areas, cursor, stack){
226 if(address == stack->address)
233 static int is_block_stack(int block){
234 unsigned int cursor = 0;
235 stack_region_t stack;
237 xbt_dynar_foreach(stacks_areas, cursor, stack){
238 if(block == stack->block)
245 static void match_equals(xbt_dynar_t list){
247 unsigned int cursor = 0;
248 heap_area_pair_t current_pair;
249 heap_area_t previous_area;
251 xbt_dynar_foreach(list, cursor, current_pair){
253 if(current_pair->fragment1 != -1){
255 if(equals_to1[current_pair->block1][current_pair->fragment1] != NULL){
256 previous_area = equals_to1[current_pair->block1][current_pair->fragment1];
257 heap_area_free(equals_to2[previous_area->block][previous_area->fragment]);
258 equals_to2[previous_area->block][previous_area->fragment] = NULL;
259 heap_area_free(previous_area);
261 if(equals_to2[current_pair->block2][current_pair->fragment2] != NULL){
262 previous_area = equals_to2[current_pair->block2][current_pair->fragment2];
263 heap_area_free(equals_to1[previous_area->block][previous_area->fragment]);
264 equals_to1[previous_area->block][previous_area->fragment] = NULL;
265 heap_area_free(previous_area);
268 equals_to1[current_pair->block1][current_pair->fragment1] = new_heap_area(current_pair->block2, current_pair->fragment2);
269 equals_to2[current_pair->block2][current_pair->fragment2] = new_heap_area(current_pair->block1, current_pair->fragment1);
273 if(equals_to1[current_pair->block1][0] != NULL){
274 previous_area = equals_to1[current_pair->block1][0];
275 heap_area_free(equals_to2[previous_area->block][0]);
276 equals_to2[previous_area->block][0] = NULL;
277 heap_area_free(previous_area);
279 if(equals_to2[current_pair->block2][0] != NULL){
280 previous_area = equals_to2[current_pair->block2][0];
281 heap_area_free(equals_to1[previous_area->block][0]);
282 equals_to1[previous_area->block][0] = NULL;
283 heap_area_free(previous_area);
286 equals_to1[current_pair->block1][0] = new_heap_area(current_pair->block2, current_pair->fragment2);
287 equals_to2[current_pair->block2][0] = new_heap_area(current_pair->block1, current_pair->fragment1);
294 static int equal_blocks(int b1, int b2){
296 if(equals_to1[b1][0]->block == b2 && equals_to2[b2][0]->block == b1)
302 static int equal_fragments(int b1, int f1, int b2, int f2){
304 if(equals_to1[b1][f1]->block == b2 && equals_to1[b1][f1]->fragment == f2 && equals_to2[b2][f2]->block == b1 && equals_to2[b2][f2]->fragment == f1)
310 int init_heap_information(xbt_mheap_t heap1, xbt_mheap_t heap2, xbt_dynar_t i1, xbt_dynar_t i2){
312 if((((struct mdesc *)heap1)->heaplimit != ((struct mdesc *)heap2)->heaplimit) || ((((struct mdesc *)heap1)->heapsize != ((struct mdesc *)heap2)->heapsize) ))
317 heaplimit = ((struct mdesc *)heap1)->heaplimit;
319 s_heap = (char *)mmalloc_get_current_heap() - STD_HEAP_SIZE - getpagesize();
321 heapbase1 = (char *)heap1 + BLOCKSIZE;
322 heapbase2 = (char *)heap2 + BLOCKSIZE;
324 heapinfo1 = (malloc_info *)((char *)heap1 + ((uintptr_t)((char *)((struct mdesc *)heap1)->heapinfo - (char *)s_heap)));
325 heapinfo2 = (malloc_info *)((char *)heap2 + ((uintptr_t)((char *)((struct mdesc *)heap2)->heapinfo - (char *)s_heap)));
327 heapsize1 = heap1->heapsize;
328 heapsize2 = heap2->heapsize;
333 equals_to1 = malloc(heaplimit * sizeof(heap_area_t *));
334 for(i=0; i<=heaplimit; i++){
335 equals_to1[i] = malloc(MAX_FRAGMENT_PER_BLOCK * sizeof(heap_area_t));
336 for(j=0; j<MAX_FRAGMENT_PER_BLOCK; j++)
337 equals_to1[i][j] = NULL;
340 equals_to2 = malloc(heaplimit * sizeof(heap_area_t *));
341 for(i=0; i<=heaplimit; i++){
342 equals_to2[i] = malloc(MAX_FRAGMENT_PER_BLOCK * sizeof(heap_area_t));
343 for(j=0; j<MAX_FRAGMENT_PER_BLOCK; j++)
344 equals_to2[i][j] = NULL;
347 types1 = malloc(heaplimit * sizeof(type_name *));
348 for(i=0; i<=heaplimit; i++){
349 types1[i] = malloc(MAX_FRAGMENT_PER_BLOCK * sizeof(type_name));
350 for(j=0; j<MAX_FRAGMENT_PER_BLOCK; j++)
354 types2 = malloc(heaplimit * sizeof(type_name *));
355 for(i=0; i<=heaplimit; i++){
356 types2[i] = malloc(MAX_FRAGMENT_PER_BLOCK * sizeof(type_name));
357 for(j=0; j<MAX_FRAGMENT_PER_BLOCK; j++)
362 MC_ignore_global_variable("heaplimit");
363 MC_ignore_global_variable("s_heap");
364 MC_ignore_global_variable("heapbase1");
365 MC_ignore_global_variable("heapbase2");
366 MC_ignore_global_variable("heapinfo1");
367 MC_ignore_global_variable("heapinfo2");
368 MC_ignore_global_variable("heapsize1");
369 MC_ignore_global_variable("heapsize2");
370 MC_ignore_global_variable("to_ignore1");
371 MC_ignore_global_variable("to_ignore2");
372 MC_ignore_global_variable("equals_to1");
373 MC_ignore_global_variable("equals_to2");
374 MC_ignore_global_variable("types1");
375 MC_ignore_global_variable("types2");
382 void reset_heap_information(){
386 for(i=0; i<heaplimit; i++){
387 for(j=0; j<MAX_FRAGMENT_PER_BLOCK;j++){
388 heap_area_free(equals_to1[i][j]);
389 equals_to1[i][j] = NULL;
390 heap_area_free(equals_to2[i][j]);
391 equals_to2[i][j] = NULL;
392 xbt_free(types1[i][j]);
394 xbt_free(types2[i][j]);
408 s_heap = NULL, heapbase1 = NULL, heapbase2 = NULL;
409 heapinfo1 = NULL, heapinfo2 = NULL;
410 heaplimit = 0, heapsize1 = 0, heapsize2 = 0;
411 to_ignore1 = NULL, to_ignore2 = NULL;
412 equals_to1 = NULL, equals_to2 = NULL;
413 types1 = NULL, types2 = NULL;
417 int mmalloc_compare_heap(xbt_mheap_t heap1, xbt_mheap_t heap2){
419 if(heap1 == NULL && heap2 == NULL){
420 XBT_DEBUG("Malloc descriptors null");
424 /* Start comparison */
425 size_t i1, i2, j1, j2, k;
426 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
427 int nb_diff1 = 0, nb_diff2 = 0;
429 xbt_dynar_t previous = xbt_dynar_new(sizeof(heap_area_pair_t), heap_area_pair_free_voidp);
431 int equal, res_compare = 0;
433 /* Check busy blocks*/
437 while(i1 <= heaplimit){
439 if(heapinfo1[i1].type == -1){ /* Free block */
444 addr_block1 = ((void*) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)s_heap)->heapbase));
446 if(heapinfo1[i1].type == 0){ /* Large block */
448 if(is_stack(addr_block1)){
449 for(k=0; k < heapinfo1[i1].busy_block.size; k++)
450 equals_to1[i1+k][0] = new_heap_area(i1, -1);
451 for(k=0; k < heapinfo2[i1].busy_block.size; k++)
452 equals_to2[i1+k][0] = new_heap_area(i1, -1);
453 i1 += heapinfo1[i1].busy_block.size;
457 if(equals_to1[i1][0] != NULL){
466 /* Try first to associate to same block in the other heap */
467 if(heapinfo2[i1].type == heapinfo1[i1].type){
469 if(equals_to2[i1][0] == NULL){
471 addr_block2 = ((void*) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)s_heap)->heapbase));
473 res_compare = compare_heap_area(addr_block1, addr_block2, NULL, NULL, NULL, NULL, 0);
475 if(res_compare == 0){
476 for(k=1; k < heapinfo2[i1].busy_block.size; k++)
477 equals_to2[i1+k][0] = new_heap_area(i1, -1);
478 for(k=1; k < heapinfo1[i1].busy_block.size; k++)
479 equals_to1[i1+k][0] = new_heap_area(i1, -1);
481 i1 += heapinfo1[i1].busy_block.size;
484 xbt_dynar_reset(previous);
490 while(i2 <= heaplimit && !equal){
492 addr_block2 = ((void*) (((ADDR2UINT(i2)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)s_heap)->heapbase));
499 if(heapinfo2[i2].type != 0){
504 if(equals_to2[i2][0] != NULL){
509 res_compare = compare_heap_area(addr_block1, addr_block2, NULL, NULL, NULL, NULL, 0);
511 if(res_compare == 0){
512 for(k=1; k < heapinfo2[i2].busy_block.size; k++)
513 equals_to2[i2+k][0] = new_heap_area(i1, -1);
514 for(k=1; k < heapinfo1[i1].busy_block.size; k++)
515 equals_to1[i1+k][0] = new_heap_area(i2, -1);
517 i1 += heapinfo1[i1].busy_block.size;
520 xbt_dynar_reset(previous);
527 XBT_DEBUG("Block %zu not found (size_used = %zu, addr = %p)", i1, heapinfo1[i1].busy_block.busy_size, addr_block1);
533 }else{ /* Fragmented block */
535 for(j1=0; j1 < (size_t) (BLOCKSIZE >> heapinfo1[i1].type); j1++){
537 if(heapinfo1[i1].busy_frag.frag_size[j1] == -1) /* Free fragment */
540 if(equals_to1[i1][j1] != NULL)
543 addr_frag1 = (void*) ((char *)addr_block1 + (j1 << heapinfo1[i1].type));
548 /* Try first to associate to same fragment in the other heap */
549 if(heapinfo2[i1].type == heapinfo1[i1].type){
551 if(equals_to2[i1][j1] == NULL){
553 addr_block2 = ((void*) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)s_heap)->heapbase));
554 addr_frag2 = (void*) ((char *)addr_block2 + (j1 << ((xbt_mheap_t)s_heap)->heapinfo[i1].type));
556 res_compare = compare_heap_area(addr_frag1, addr_frag2, NULL, NULL, NULL, NULL, 0);
561 xbt_dynar_reset(previous);
567 while(i2 <= heaplimit && !equal){
569 if(heapinfo2[i2].type <= 0){
574 for(j2=0; j2 < (size_t) (BLOCKSIZE >> heapinfo2[i2].type); j2++){
576 if(i2 == i1 && j2 == j1)
579 if(equals_to2[i2][j2] != NULL)
582 addr_block2 = ((void*) (((ADDR2UINT(i2)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)s_heap)->heapbase));
583 addr_frag2 = (void*) ((char *)addr_block2 + (j2 <<((xbt_mheap_t)s_heap)->heapinfo[i2].type));
585 res_compare = compare_heap_area(addr_frag1, addr_frag2, NULL, NULL, NULL, NULL, 0);
587 if(res_compare == 0){
589 xbt_dynar_reset(previous);
593 xbt_dynar_reset(previous);
602 XBT_DEBUG("Block %zu, fragment %zu not found (size_used = %zd, address = %p)\n", i1, j1, heapinfo1[i1].busy_frag.frag_size[j1], addr_frag1);
617 /* All blocks/fragments are equal to another block/fragment ? */
619 void *real_addr_frag1 = NULL, *real_addr_block1 = NULL, *real_addr_block2 = NULL, *real_addr_frag2 = NULL;
622 if(heapinfo1[i].type == 0){
624 if(heapinfo1[i].busy_block.busy_size > 0){
625 if(equals_to1[i][0] == NULL){
626 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
627 addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase1));
628 XBT_DEBUG("Block %zu (%p) not found (size used = %zu)", i, addr_block1, heapinfo1[i].busy_block.busy_size);
629 //mmalloc_backtrace_block_display((void*)heapinfo1, i);
636 if(heapinfo1[i].type > 0){
637 addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase1));
638 real_addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)((struct mdesc *)s_heap)->heapbase));
639 for(j=0; j < (size_t) (BLOCKSIZE >> heapinfo1[i].type); j++){
641 if(heapinfo1[i].busy_frag.frag_size[j] > 0){
642 if(equals_to1[i][j] == NULL){
643 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
644 addr_frag1 = (void*) ((char *)addr_block1 + (j << heapinfo1[i].type));
645 real_addr_frag1 = (void*) ((char *)real_addr_block1 + (j << ((struct mdesc *)s_heap)->heapinfo[i].type));
646 XBT_DEBUG("Block %zu, Fragment %zu (%p - %p) not found (size used = %zd)", i, j, addr_frag1, real_addr_frag1, heapinfo1[i].busy_frag.frag_size[j]);
647 //mmalloc_backtrace_fragment_display((void*)heapinfo1, i, j);
659 XBT_DEBUG("Number of blocks/fragments not found in heap1 : %d", nb_diff1);
664 if(heapinfo2[i].type == 0){
666 if(heapinfo2[i].busy_block.busy_size > 0){
667 if(equals_to2[i][0] == NULL){
668 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
669 addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase2));
670 XBT_DEBUG("Block %zu (%p) not found (size used = %zu)", i, addr_block2, heapinfo2[i].busy_block.busy_size);
671 //mmalloc_backtrace_block_display((void*)heapinfo2, i);
678 if(heapinfo2[i].type > 0){
679 addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase2));
680 real_addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)((struct mdesc *)s_heap)->heapbase));
681 for(j=0; j < (size_t) (BLOCKSIZE >> heapinfo2[i].type); j++){
683 if(heapinfo2[i].busy_frag.frag_size[j] > 0){
684 if(equals_to2[i][j] == NULL){
685 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
686 addr_frag2 = (void*) ((char *)addr_block2 + (j << heapinfo2[i].type));
687 real_addr_frag2 = (void*) ((char *)real_addr_block2 + (j << ((struct mdesc *)s_heap)->heapinfo[i].type));
688 XBT_DEBUG( "Block %zu, Fragment %zu (%p - %p) not found (size used = %zd)", i, j, addr_frag2, real_addr_frag2, heapinfo2[i].busy_frag.frag_size[j]);
689 //mmalloc_backtrace_fragment_display((void*)heapinfo2, i, j);
701 XBT_DEBUG("Number of blocks/fragments not found in heap2 : %d", nb_diff2);
703 xbt_dynar_free(&previous);
704 real_addr_frag1 = NULL, real_addr_block1 = NULL, real_addr_block2 = NULL, real_addr_frag2 = NULL;
706 return ((nb_diff1 > 0) || (nb_diff2 > 0));
709 static int compare_heap_area_without_type(void *real_area1, void *real_area2, void *area1, void *area2, xbt_dynar_t previous, xbt_dict_t all_types, xbt_dict_t other_types, int size, int check_ignore){
712 void *addr_pointed1, *addr_pointed2;
713 int pointer_align, ignore1, ignore2, res_compare;
717 if(check_ignore > 0){
718 if((ignore1 = heap_comparison_ignore_size(to_ignore1, (char *)real_area1 + i)) > 0){
719 if((ignore2 = heap_comparison_ignore_size(to_ignore2, (char *)real_area2 + i)) == ignore1){
727 if(memcmp(((char *)area1) + i, ((char *)area2) + i, 1) != 0){
729 pointer_align = (i / sizeof(void*)) * sizeof(void*);
730 addr_pointed1 = *((void **)((char *)area1 + pointer_align));
731 addr_pointed2 = *((void **)((char *)area2 + pointer_align));
733 if(addr_pointed1 > maestro_stack_start && addr_pointed1 < maestro_stack_end && addr_pointed2 > maestro_stack_start && addr_pointed2 < maestro_stack_end){
734 i = pointer_align + sizeof(void *);
736 }else if((addr_pointed1 > s_heap) && ((char *)addr_pointed1 < (char *)s_heap + STD_HEAP_SIZE)
737 && (addr_pointed2 > s_heap) && ((char *)addr_pointed2 < (char *)s_heap + STD_HEAP_SIZE)){
738 res_compare = compare_heap_area(addr_pointed1, addr_pointed2, previous, all_types, other_types, NULL, 0);
739 if(res_compare == 1){
742 i = pointer_align + sizeof(void *);
759 static int compare_heap_area_with_type(void *real_area1, void *real_area2, void *area1, void *area2,
760 xbt_dynar_t previous, xbt_dict_t all_types, xbt_dict_t other_types, char *type_id,
761 int area_size, int check_ignore, int pointer_level){
763 if(is_stack(real_area1) && is_stack(real_area2))
766 size_t ignore1, ignore2;
768 if((check_ignore > 0) && ((ignore1 = heap_comparison_ignore_size(to_ignore1, real_area1)) > 0) && ((ignore2 = heap_comparison_ignore_size(to_ignore2, real_area2)) == ignore1)){
772 dw_type_t type = xbt_dict_get_or_null(all_types, type_id);
773 dw_type_t subtype, subsubtype;
774 int res, elm_size, i, switch_types = 0;
775 unsigned int cursor = 0;
777 void *addr_pointed1, *addr_pointed2;;
782 if(strcmp(type->name, "char") == 0){ /* String, hence random (arbitrary ?) size */
783 if(real_area1 == real_area2)
786 return (memcmp(area1, area2, area_size) != 0);
788 if(area_size != -1 && type->size != area_size)
791 return (memcmp(area1, area2, type->size) != 0);
795 case e_dw_enumeration_type:
796 if(area_size != -1 && type->size != area_size)
799 return (memcmp(area1, area2, type->size) != 0);
802 return compare_heap_area_with_type(real_area1, real_area2, area1, area2, previous, all_types, other_types, type->dw_type_id, area_size, check_ignore, pointer_level);
804 case e_dw_const_type:
807 case e_dw_array_type:
808 subtype = xbt_dict_get_or_null(all_types, type->dw_type_id);
809 switch(subtype->type){
811 case e_dw_enumeration_type:
812 case e_dw_pointer_type:
813 case e_dw_structure_type:
814 case e_dw_union_type:
815 if(subtype->size == 0){ /*declaration of the type, need the complete description */
816 type_desc = get_type_description(all_types, subtype->name);
818 subtype = xbt_dict_get_or_null(all_types, type_desc);
820 subtype = xbt_dict_get_or_null(other_types, get_type_description(other_types, subtype->name));
824 elm_size = subtype->size;
827 case e_dw_volatile_type:
828 subsubtype = xbt_dict_get_or_null(all_types, subtype->dw_type_id);
829 if(subsubtype->size == 0){ /*declaration of the type, need the complete description */
830 type_desc = get_type_description(all_types, subsubtype->name);
832 subsubtype = xbt_dict_get_or_null(all_types, type_desc);
834 subsubtype = xbt_dict_get_or_null(other_types, get_type_description(other_types, subtype->name));
838 elm_size = subsubtype->size;
844 for(i=0; i<type->size; i++){
846 res = compare_heap_area_with_type((char *)real_area1 + (i*elm_size), (char *)real_area2 + (i*elm_size), (char *)area1 + (i*elm_size), (char *)area2 + (i*elm_size), previous, other_types, all_types, type->dw_type_id, type->size, check_ignore, pointer_level);
848 res = compare_heap_area_with_type((char *)real_area1 + (i*elm_size), (char *)real_area2 + (i*elm_size), (char *)area1 + (i*elm_size), (char *)area2 + (i*elm_size), previous, all_types, other_types, type->dw_type_id, type->size, check_ignore, pointer_level);
853 case e_dw_pointer_type:
854 if(type->dw_type_id && ((dw_type_t)xbt_dict_get_or_null(all_types, type->dw_type_id))->type == e_dw_subroutine_type){
855 addr_pointed1 = *((void **)(area1));
856 addr_pointed2 = *((void **)(area2));
857 return (addr_pointed1 != addr_pointed2);;
860 if(pointer_level > 1){ /* Array of pointers */
861 for(i=0; i<(area_size/sizeof(void *)); i++){
862 addr_pointed1 = *((void **)((char *)area1 + (i*sizeof(void *))));
863 addr_pointed2 = *((void **)((char *)area2 + (i*sizeof(void *))));
864 if(addr_pointed1 > s_heap && (char *)addr_pointed1 < (char*) s_heap + STD_HEAP_SIZE && addr_pointed2 > s_heap && (char *)addr_pointed2 < (char*) s_heap + STD_HEAP_SIZE)
865 res = compare_heap_area(addr_pointed1, addr_pointed2, previous, all_types, other_types, type->dw_type_id, pointer_level);
867 res = (addr_pointed1 != addr_pointed2);
872 addr_pointed1 = *((void **)(area1));
873 addr_pointed2 = *((void **)(area2));
874 if(addr_pointed1 > s_heap && (char *)addr_pointed1 < (char*) s_heap + STD_HEAP_SIZE && addr_pointed2 > s_heap && (char *)addr_pointed2 < (char*) s_heap + STD_HEAP_SIZE)
875 return compare_heap_area(addr_pointed1, addr_pointed2, previous, all_types, other_types, type->dw_type_id, pointer_level);
877 return (addr_pointed1 != addr_pointed2);
881 case e_dw_structure_type:
882 if(type->size == 0){ /*declaration of the structure, need the complete description */
883 type_desc = get_type_description(all_types, type->name);
885 type = xbt_dict_get_or_null(all_types, type_desc);
887 type = xbt_dict_get_or_null(other_types, get_type_description(other_types, type->name));
891 if(area_size != -1 && type->size != area_size){
892 if(area_size>type->size && area_size%type->size == 0){
893 for(i=0; i<(area_size/type->size); i++){
895 res = compare_heap_area_with_type((char *)real_area1 + (i*type->size), (char *)real_area2 + (i*type->size), (char *)area1 + (i*type->size), (char *)area2 + (i*type->size), previous, other_types, all_types, type_id, -1, check_ignore, 0);
897 res = compare_heap_area_with_type((char *)real_area1 + (i*type->size), (char *)real_area2 + (i*type->size), (char *)area1 + (i*type->size), (char *)area2 + (i*type->size), previous, all_types, other_types, type_id, -1, check_ignore, 0);
906 xbt_dynar_foreach(type->members, cursor, member){
908 res = compare_heap_area_with_type((char *)real_area1 + member->offset, (char *)real_area2 + member->offset, (char *)area1 + member->offset, (char *)area2 + member->offset, previous, other_types, all_types, member->dw_type_id, -1, check_ignore, 0);
910 res = compare_heap_area_with_type((char *)real_area1 + member->offset, (char *)real_area2 + member->offset, (char *)area1 + member->offset, (char *)area2 + member->offset, previous, all_types, other_types, member->dw_type_id, -1, check_ignore, 0);
917 case e_dw_union_type:
918 return compare_heap_area_without_type(real_area1, real_area2, area1, area2, previous, all_types, other_types, type->size, check_ignore);
920 case e_dw_volatile_type:
921 return compare_heap_area_with_type(real_area1, real_area2, area1, area2, previous, all_types, other_types, type->dw_type_id, area_size, check_ignore, pointer_level);
931 static char* get_offset_type(char* type_id, int offset, xbt_dict_t all_types, xbt_dict_t other_types, int area_size){
932 dw_type_t type = xbt_dict_get_or_null(all_types, type_id);
935 case e_dw_structure_type :
936 if(type->size == 0){ /*declaration of the structure, need the complete description */
937 type_desc = get_type_description(all_types, type->name);
939 type = xbt_dict_get_or_null(all_types, type_desc);
941 type = xbt_dict_get_or_null(other_types, get_type_description(other_types, type->name));
944 if(area_size != -1 && type->size != area_size){
945 if(area_size>type->size && area_size%type->size == 0)
950 unsigned int cursor = 0;
952 xbt_dynar_foreach(type->members, cursor, member){
953 if(member->offset == offset)
954 return member->dw_type_id;
960 /* FIXME : other cases ? */
966 int compare_heap_area(void *area1, void* area2, xbt_dynar_t previous, xbt_dict_t all_types, xbt_dict_t other_types, char *type_id, int pointer_level){
969 ssize_t block1, frag1, block2, frag2;
971 int check_ignore = 0;
973 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2, *real_addr_block1, *real_addr_block2, *real_addr_frag1, *real_addr_frag2;
974 void *area1_to_compare, *area2_to_compare;
975 dw_type_t type = NULL;
978 int offset1 =0, offset2 = 0;
979 int new_size1 = -1, new_size2 = -1;
980 char *new_type_id1 = NULL, *new_type_id2 = NULL;
984 if(previous == NULL){
985 previous = xbt_dynar_new(sizeof(heap_area_pair_t), heap_area_pair_free_voidp);
989 block1 = ((char*)area1 - (char*)((xbt_mheap_t)s_heap)->heapbase) / BLOCKSIZE + 1;
990 block2 = ((char*)area2 - (char*)((xbt_mheap_t)s_heap)->heapbase) / BLOCKSIZE + 1;
992 if(is_block_stack((int)block1) && is_block_stack((int)block2)){
993 add_heap_area_pair(previous, block1, -1, block2, -1);
995 match_equals(previous);
996 xbt_dynar_free(&previous);
1001 if(((char *)area1 < (char*)((xbt_mheap_t)s_heap)->heapbase) || (block1 > heapsize1) || (block1 < 1) || ((char *)area2 < (char*)((xbt_mheap_t)s_heap)->heapbase) || (block2 > heapsize2) || (block2 < 1)){
1003 xbt_dynar_free(&previous);
1008 addr_block1 = ((void*) (((ADDR2UINT(block1)) - 1) * BLOCKSIZE + (char*)heapbase1));
1009 addr_block2 = ((void*) (((ADDR2UINT(block2)) - 1) * BLOCKSIZE + (char*)heapbase2));
1011 real_addr_block1 = ((void*) (((ADDR2UINT(block1)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)s_heap)->heapbase));
1012 real_addr_block2 = ((void*) (((ADDR2UINT(block2)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)s_heap)->heapbase));
1015 type = xbt_dict_get_or_null(all_types, type_id);
1016 if(type->size == 0){
1017 if(type->dw_type_id == NULL){
1018 type_desc = get_type_description(all_types, type->name);
1020 type = xbt_dict_get_or_null(all_types, type_desc);
1022 type = xbt_dict_get_or_null(other_types, get_type_description(other_types, type->name));
1024 type = xbt_dict_get_or_null(all_types, type->dw_type_id);
1027 if((type->type == e_dw_pointer_type) || ((type->type == e_dw_base_type) && (!strcmp(type->name, "char"))))
1030 type_size = type->size;
1033 if((heapinfo1[block1].type == -1) && (heapinfo2[block2].type == -1)){ /* Free block */
1036 match_equals(previous);
1037 xbt_dynar_free(&previous);
1041 }else if((heapinfo1[block1].type == 0) && (heapinfo2[block2].type == 0)){ /* Complete block */
1043 if(equals_to1[block1][0] != NULL && equals_to2[block2][0] != NULL){
1044 if(equal_blocks(block1, block2)){
1046 match_equals(previous);
1047 xbt_dynar_free(&previous);
1053 if(type_size != -1){
1054 if(type_size != heapinfo1[block1].busy_block.busy_size && type_size != heapinfo2[block2].busy_block.busy_size && !strcmp(type->name, "s_smx_context"))
1058 if(heapinfo1[block1].busy_block.size != heapinfo2[block2].busy_block.size){
1060 xbt_dynar_free(&previous);
1065 if(heapinfo1[block1].busy_block.busy_size != heapinfo2[block2].busy_block.busy_size){
1067 xbt_dynar_free(&previous);
1072 if(!add_heap_area_pair(previous, block1, -1, block2, -1)){
1074 match_equals(previous);
1075 xbt_dynar_free(&previous);
1080 size = heapinfo1[block1].busy_block.busy_size;
1082 if(type_id != NULL){
1083 free(types1[block1][0]);
1084 free(types2[block2][0]);
1085 types1[block1][0] = strdup(type_id);
1086 types2[block2][0] = strdup(type_id);
1091 match_equals(previous);
1092 xbt_dynar_free(&previous);
1100 area1_to_compare = addr_block1;
1101 area2_to_compare = addr_block2;
1103 if((heapinfo1[block1].busy_block.ignore > 0) && (heapinfo2[block2].busy_block.ignore == heapinfo1[block1].busy_block.ignore))
1104 check_ignore = heapinfo1[block1].busy_block.ignore;
1106 }else if((heapinfo1[block1].type > 0) && (heapinfo2[block2].type > 0)){ /* Fragmented block */
1108 frag1 = ((uintptr_t) (ADDR2UINT (area1) % (BLOCKSIZE))) >> heapinfo1[block1].type;
1109 frag2 = ((uintptr_t) (ADDR2UINT (area2) % (BLOCKSIZE))) >> heapinfo2[block2].type;
1111 addr_frag1 = (void*) ((char *)addr_block1 + (frag1 << heapinfo1[block1].type));
1112 addr_frag2 = (void*) ((char *)addr_block2 + (frag2 << heapinfo2[block2].type));
1114 real_addr_frag1 = (void*) ((char *)real_addr_block1 + (frag1 << ((xbt_mheap_t)s_heap)->heapinfo[block1].type));
1115 real_addr_frag2 = (void*) ((char *)real_addr_block2 + (frag2 << ((xbt_mheap_t)s_heap)->heapinfo[block1].type));
1117 if(type_size != -1){
1118 if(heapinfo1[block1].busy_frag.frag_size[frag1] == -1 || heapinfo2[block2].busy_frag.frag_size[frag2] == -1)
1120 if(type_size != heapinfo1[block1].busy_frag.frag_size[frag1] || type_size != heapinfo2[block2].busy_frag.frag_size[frag2])
1124 if(equals_to1[block1][frag1] != NULL && equals_to2[block2][frag2] != NULL){
1125 if(equal_fragments(block1, frag1, block2, frag2)){
1127 match_equals(previous);
1128 xbt_dynar_free(&previous);
1134 if(heapinfo1[block1].busy_frag.frag_size[frag1] != heapinfo2[block2].busy_frag.frag_size[frag2]){
1135 if(type_size == -1){
1139 xbt_dynar_free(&previous);
1145 size = heapinfo1[block1].busy_frag.frag_size[frag1];
1147 if(type_id != NULL){
1148 free(types1[block1][frag1]);
1149 free(types2[block2][frag2]);
1150 types1[block1][frag1] = strdup(type_id);
1151 types2[block2][frag2] = strdup(type_id);
1154 if(real_addr_frag1 != area1 || real_addr_frag2 != area2){
1155 offset1 = (char *)area1 - (char *)real_addr_frag1;
1156 offset2 = (char *)area2 - (char *)real_addr_frag2;
1157 if(types1[block1][frag1] != NULL && types2[block2][frag2] != NULL){
1158 new_type_id1 = get_offset_type(types1[block1][frag1], offset1, all_types, other_types, size);
1159 new_type_id2 = get_offset_type(types2[block2][frag2], offset1, all_types, other_types, size);
1160 }else if(types1[block1][frag1] != NULL){
1161 new_type_id1 = get_offset_type(types1[block1][frag1], offset1, all_types, other_types, size);
1162 new_type_id2 = get_offset_type(types1[block1][frag1], offset2, all_types, other_types, size);
1163 }else if(types2[block2][frag2] != NULL){
1164 new_type_id1 = get_offset_type(types2[block2][frag2], offset1, all_types, other_types, size);
1165 new_type_id2 = get_offset_type(types2[block2][frag2], offset2, all_types, other_types, size);
1168 if(new_type_id1 != NULL && new_type_id2 != NULL && !strcmp(new_type_id1, new_type_id2)){
1169 type = xbt_dict_get_or_null(all_types, new_type_id1);
1170 while(type->size == 0 && type->dw_type_id != NULL)
1171 type = xbt_dict_get_or_null(all_types, type->dw_type_id);
1172 new_size1 = type->size;
1173 type = xbt_dict_get_or_null(all_types, new_type_id2);
1174 while(type->size == 0 && type->dw_type_id != NULL)
1175 type = xbt_dict_get_or_null(all_types, type->dw_type_id);
1176 new_size2 = type->size;
1180 area1_to_compare = (char *)addr_frag1 + offset1;
1181 area2_to_compare = (char *)addr_frag2 + offset2;
1183 if(new_size1 > 0 && new_size1 == new_size2){
1184 type_id = new_type_id1;
1188 if(offset1 == 0 && offset2 == 0){
1189 if(!add_heap_area_pair(previous, block1, frag1, block2, frag2)){
1191 match_equals(previous);
1192 xbt_dynar_free(&previous);
1200 match_equals(previous);
1201 xbt_dynar_free(&previous);
1206 if((heapinfo1[block1].busy_frag.ignore[frag1] > 0) && ( heapinfo2[block2].busy_frag.ignore[frag2] == heapinfo1[block1].busy_frag.ignore[frag1]))
1207 check_ignore = heapinfo1[block1].busy_frag.ignore[frag1];
1212 xbt_dynar_free(&previous);
1219 /* Start comparison*/
1220 if(type_id != NULL){
1221 res_compare = compare_heap_area_with_type(area1, area2, area1_to_compare, area2_to_compare, previous, all_types, other_types, type_id, size, check_ignore, pointer_level);
1222 if(res_compare == 1){
1224 xbt_dynar_free(&previous);
1228 res_compare = compare_heap_area_without_type(area1, area2, area1_to_compare, area2_to_compare, previous, all_types, other_types, size, check_ignore);
1229 if(res_compare == 1){
1231 xbt_dynar_free(&previous);
1237 match_equals(previous);
1238 xbt_dynar_free(&previous);
1244 /*********************************************** Miscellaneous ***************************************************/
1245 /****************************************************************************************************************/
1248 int get_pointed_area_size(void *area, int heap){
1251 malloc_info *heapinfo;
1254 heapinfo = heapinfo1;
1256 heapinfo = heapinfo2;
1258 block = ((char*)area - (char*)((xbt_mheap_t)s_heap)->heapbase) / BLOCKSIZE + 1;
1260 if(((char *)area < (char*)((xbt_mheap_t)s_heap)->heapbase) || (block > heapsize1) || (block < 1))
1263 if(heapinfo[block].type == -1){ /* Free block */
1265 }else if(heapinfo[block].type == 0){ /* Complete block */
1266 return (int)heapinfo[block].busy_block.busy_size;
1268 frag = ((uintptr_t) (ADDR2UINT (area) % (BLOCKSIZE))) >> heapinfo[block].type;
1269 return (int)heapinfo[block].busy_frag.frag_size[frag];
1274 char *get_type_description(xbt_dict_t types, char *type_name){
1276 xbt_dict_cursor_t dict_cursor;
1280 xbt_dict_foreach(types, dict_cursor, type_origin, type){
1281 if(type->name && (strcmp(type->name, type_name) == 0) && type->size > 0){
1282 xbt_dict_cursor_free(&dict_cursor);
1287 xbt_dict_cursor_free(&dict_cursor);
1293 #define max( a, b ) ( ((a) > (b)) ? (a) : (b) )
1296 int mmalloc_linear_compare_heap(xbt_mheap_t heap1, xbt_mheap_t heap2){
1298 if(heap1 == NULL && heap1 == NULL){
1299 XBT_DEBUG("Malloc descriptors null");
1303 if(heap1->heaplimit != heap2->heaplimit){
1304 XBT_DEBUG("Different limit of valid info table indices");
1308 /* Heap information */
1309 heaplimit = ((struct mdesc *)heap1)->heaplimit;
1311 s_heap = (char *)mmalloc_get_current_heap() - STD_HEAP_SIZE - getpagesize();
1313 heapbase1 = (char *)heap1 + BLOCKSIZE;
1314 heapbase2 = (char *)heap2 + BLOCKSIZE;
1316 heapinfo1 = (malloc_info *)((char *)heap1 + ((uintptr_t)((char *)heap1->heapinfo - (char *)s_heap)));
1317 heapinfo2 = (malloc_info *)((char *)heap2 + ((uintptr_t)((char *)heap2->heapinfo - (char *)s_heap)));
1319 heapsize1 = heap1->heapsize;
1320 heapsize2 = heap2->heapsize;
1322 /* Start comparison */
1324 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
1328 /* Check busy blocks*/
1332 while(i <= heaplimit){
1334 addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase1));
1335 addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase2));
1337 if(heapinfo1[i].type != heapinfo2[i].type){
1339 distance += BLOCKSIZE;
1340 XBT_DEBUG("Different type of blocks (%zu) : %d - %d -> distance = %d", i, heapinfo1[i].type, heapinfo2[i].type, distance);
1345 if(heapinfo1[i].type == -1){ /* Free block */
1350 if(heapinfo1[i].type == 0){ /* Large block */
1352 if(heapinfo1[i].busy_block.size != heapinfo2[i].busy_block.size){
1353 distance += BLOCKSIZE * max(heapinfo1[i].busy_block.size, heapinfo2[i].busy_block.size);
1354 i += max(heapinfo1[i].busy_block.size, heapinfo2[i].busy_block.size);
1355 XBT_DEBUG("Different larger of cluster at block %zu : %zu - %zu -> distance = %d", i, heapinfo1[i].busy_block.size, heapinfo2[i].busy_block.size, distance);
1359 /*if(heapinfo1[i].busy_block.busy_size != heapinfo2[i].busy_block.busy_size){
1360 distance += max(heapinfo1[i].busy_block.busy_size, heapinfo2[i].busy_block.busy_size);
1361 i += max(heapinfo1[i].busy_block.size, heapinfo2[i].busy_block.size);
1362 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);
1368 //while(k < (heapinfo1[i].busy_block.busy_size)){
1369 while(k < heapinfo1[i].busy_block.size * BLOCKSIZE){
1370 if(memcmp((char *)addr_block1 + k, (char *)addr_block2 + k, 1) != 0){
1378 }else { /* Fragmented block */
1380 for(j=0; j < (size_t) (BLOCKSIZE >> heapinfo1[i].type); j++){
1382 addr_frag1 = (void*) ((char *)addr_block1 + (j << heapinfo1[i].type));
1383 addr_frag2 = (void*) ((char *)addr_block2 + (j << heapinfo2[i].type));
1385 if(heapinfo1[i].busy_frag.frag_size[j] == 0 && heapinfo2[i].busy_frag.frag_size[j] == 0){
1390 /*if(heapinfo1[i].busy_frag.frag_size[j] != heapinfo2[i].busy_frag.frag_size[j]){
1391 distance += max(heapinfo1[i].busy_frag.frag_size[j], heapinfo2[i].busy_frag.frag_size[j]);
1392 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);
1398 //while(k < max(heapinfo1[i].busy_frag.frag_size[j], heapinfo2[i].busy_frag.frag_size[j])){
1399 while(k < (BLOCKSIZE / (BLOCKSIZE >> heapinfo1[i].type))){
1400 if(memcmp((char *)addr_frag1 + k, (char *)addr_frag2 + k, 1) != 0){