1 /* mm_diff - Memory snapshooting and comparison */
3 /* Copyright (c) 2008-2012. The SimGrid Team. All rights reserved. */
5 /* This program is free software; you can redistribute it and/or modify it
6 * under the terms of the license (GNU LGPL) which comes with this package. */
8 #include "xbt/ex_interface.h" /* internals of backtrace setup */
11 #include "xbt/mmalloc.h"
12 #include "mc/datatypes.h"
14 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mm_diff, xbt,
15 "Logging specific to mm_diff in mmalloc");
17 xbt_dynar_t mc_heap_comparison_ignore;
18 xbt_dynar_t stacks_areas;
19 void *maestro_stack_start, *maestro_stack_end;
22 /********************************* Backtrace ***********************************/
23 /******************************************************************************/
25 static void mmalloc_backtrace_block_display(void* heapinfo, int block){
29 /* if (((malloc_info *)heapinfo)[block].busy_block.bt_size == 0) { */
30 /* fprintf(stderr, "No backtrace available for that block, sorry.\n"); */
34 /* memcpy(&e.bt,&(((malloc_info *)heapinfo)[block].busy_block.bt),sizeof(void*)*XBT_BACKTRACE_SIZE); */
35 /* e.used = ((malloc_info *)heapinfo)[block].busy_block.bt_size; */
37 /* xbt_ex_setup_backtrace(&e); */
38 /* if (e.used == 0) { */
39 /* fprintf(stderr, "(backtrace not set)\n"); */
40 /* } else if (e.bt_strings == NULL) { */
41 /* fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet"); */
45 /* fprintf(stderr, "Backtrace of where the block %d was malloced (%d frames):\n", block ,e.used); */
46 /* for (i = 0; i < e.used; i++) /\* no need to display "xbt_backtrace_display" *\/{ */
47 /* fprintf(stderr, "%d ---> %s\n",i, e.bt_strings[i] + 4); */
52 static void mmalloc_backtrace_fragment_display(void* heapinfo, int block, int frag){
56 /* memcpy(&e.bt,&(((malloc_info *)heapinfo)[block].busy_frag.bt[frag]),sizeof(void*)*XBT_BACKTRACE_SIZE); */
57 /* e.used = XBT_BACKTRACE_SIZE; */
59 /* xbt_ex_setup_backtrace(&e); */
60 /* if (e.used == 0) { */
61 /* fprintf(stderr, "(backtrace not set)\n"); */
62 /* } else if (e.bt_strings == NULL) { */
63 /* fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet"); */
67 /* fprintf(stderr, "Backtrace of where the fragment %d in block %d was malloced (%d frames):\n", frag, block ,e.used); */
68 /* for (i = 0; i < e.used; i++) /\* no need to display "xbt_backtrace_display" *\/{ */
69 /* fprintf(stderr, "%d ---> %s\n",i, e.bt_strings[i] + 4); */
75 static void mmalloc_backtrace_display(void *addr){
77 /* size_t block, frag_nb; */
80 /* xbt_mheap_t heap = __mmalloc_current_heap ?: (xbt_mheap_t) mmalloc_preinit(); */
82 /* block = (((char*) (addr) - (char*) heap -> heapbase) / BLOCKSIZE + 1); */
84 /* type = heap->heapinfo[block].type; */
87 /* case -1 : /\* Free block *\/ */
88 /* fprintf(stderr, "Asked to display the backtrace of a block that is free. I'm puzzled\n"); */
91 /* case 0: /\* Large block *\/ */
92 /* mmalloc_backtrace_block_display(heap->heapinfo, block); */
94 /* default: /\* Fragmented block *\/ */
95 /* frag_nb = RESIDUAL(addr, BLOCKSIZE) >> type; */
96 /* if(heap->heapinfo[block].busy_frag.frag_size[frag_nb] == -1){ */
97 /* fprintf(stderr , "Asked to display the backtrace of a fragment that is free. I'm puzzled\n"); */
100 /* mmalloc_backtrace_fragment_display(heap->heapinfo, block, frag_nb); */
106 static int compare_backtrace(int b1, int f1, int b2, int f2){
109 for(i=0; i< XBT_BACKTRACE_SIZE; i++){
110 if(heapinfo1[b1].busy_frag.bt[f1][i] != heapinfo2[b2].busy_frag.bt[f2][i]){
111 //mmalloc_backtrace_fragment_display((void*)heapinfo1, b1, f1);
112 //mmalloc_backtrace_fragment_display((void*)heapinfo2, b2, f2);
117 for(i=0; i< heapinfo1[b1].busy_block.bt_size; i++){
118 if(heapinfo1[b1].busy_block.bt[i] != heapinfo2[b2].busy_block.bt[i]){
119 //mmalloc_backtrace_block_display((void*)heapinfo1, b1);
120 //mmalloc_backtrace_block_display((void*)heapinfo2, b2);
129 /*********************************** Heap comparison ***********************************/
130 /***************************************************************************************/
132 __thread void *s_heap = NULL, *heapbase1 = NULL, *heapbase2 = NULL;
133 __thread malloc_info *heapinfo1 = NULL, *heapinfo2 = NULL;
134 __thread size_t heaplimit = 0, heapsize1 = 0, heapsize2 = 0;
135 __thread xbt_dynar_t to_ignore1 = NULL, to_ignore2 = NULL;
136 __thread heap_area_t **equals_to1, **equals_to2;
138 /*********************************** Free functions ************************************/
140 static void heap_area_pair_free(heap_area_pair_t pair){
145 static void heap_area_pair_free_voidp(void *d){
146 heap_area_pair_free((heap_area_pair_t) * (void **) d);
149 static void heap_area_free(heap_area_t area){
154 /************************************************************************************/
156 static heap_area_t new_heap_area(int block, int fragment){
157 heap_area_t area = NULL;
158 area = xbt_new0(s_heap_area_t, 1);
160 area->fragment = fragment;
165 static int is_new_heap_area_pair(xbt_dynar_t list, int block1, int fragment1, int block2, int fragment2){
167 unsigned int cursor = 0;
168 heap_area_pair_t current_pair;
170 xbt_dynar_foreach(list, cursor, current_pair){
171 if(current_pair->block1 == block1 && current_pair->block2 == block2 && current_pair->fragment1 == fragment1 && current_pair->fragment2 == fragment2)
178 static int add_heap_area_pair(xbt_dynar_t list, int block1, int fragment1, int block2, int fragment2){
180 if(is_new_heap_area_pair(list, block1, fragment1, block2, fragment2)){
181 heap_area_pair_t pair = NULL;
182 pair = xbt_new0(s_heap_area_pair_t, 1);
183 pair->block1 = block1;
184 pair->fragment1 = fragment1;
185 pair->block2 = block2;
186 pair->fragment2 = fragment2;
188 xbt_dynar_push(list, &pair);
196 static size_t heap_comparison_ignore_size(xbt_dynar_t ignore_list, void *address){
198 unsigned int cursor = 0;
200 int end = xbt_dynar_length(ignore_list) - 1;
201 mc_heap_ignore_region_t region;
204 cursor = (start + end) / 2;
205 region = (mc_heap_ignore_region_t)xbt_dynar_get_as(ignore_list, cursor, mc_heap_ignore_region_t);
206 if(region->address == address)
208 if(region->address < address)
210 if(region->address > address)
217 static int is_stack(void *address){
218 unsigned int cursor = 0;
219 stack_region_t stack;
221 xbt_dynar_foreach(stacks_areas, cursor, stack){
222 if(address == stack->address)
229 static int is_block_stack(int block){
230 unsigned int cursor = 0;
231 stack_region_t stack;
233 xbt_dynar_foreach(stacks_areas, cursor, stack){
234 if(block == stack->block)
241 static void match_equals(xbt_dynar_t list){
243 unsigned int cursor = 0;
244 heap_area_pair_t current_pair;
245 heap_area_t previous_area;
247 xbt_dynar_foreach(list, cursor, current_pair){
249 if(current_pair->fragment1 != -1){
251 if(equals_to1[current_pair->block1][current_pair->fragment1] != NULL){
252 previous_area = equals_to1[current_pair->block1][current_pair->fragment1];
253 heap_area_free(equals_to2[previous_area->block][previous_area->fragment]);
254 equals_to2[previous_area->block][previous_area->fragment] = NULL;
255 heap_area_free(previous_area);
257 if(equals_to2[current_pair->block2][current_pair->fragment2] != NULL){
258 previous_area = equals_to2[current_pair->block2][current_pair->fragment2];
259 heap_area_free(equals_to1[previous_area->block][previous_area->fragment]);
260 equals_to1[previous_area->block][previous_area->fragment] = NULL;
261 heap_area_free(previous_area);
264 equals_to1[current_pair->block1][current_pair->fragment1] = new_heap_area(current_pair->block2, current_pair->fragment2);
265 equals_to2[current_pair->block2][current_pair->fragment2] = new_heap_area(current_pair->block1, current_pair->fragment1);
269 if(equals_to1[current_pair->block1][0] != NULL){
270 previous_area = equals_to1[current_pair->block1][0];
271 heap_area_free(equals_to2[previous_area->block][0]);
272 equals_to2[previous_area->block][0] = NULL;
273 heap_area_free(previous_area);
275 if(equals_to2[current_pair->block2][0] != NULL){
276 previous_area = equals_to2[current_pair->block2][0];
277 heap_area_free(equals_to1[previous_area->block][0]);
278 equals_to1[previous_area->block][0] = NULL;
279 heap_area_free(previous_area);
282 equals_to1[current_pair->block1][0] = new_heap_area(current_pair->block2, current_pair->fragment2);
283 equals_to2[current_pair->block2][0] = new_heap_area(current_pair->block1, current_pair->fragment1);
290 static int equal_blocks(int b1, int b2){
292 if(equals_to1[b1][0]->block == b2 && equals_to2[b2][0]->block == b1)
298 static int equal_fragments(int b1, int f1, int b2, int f2){
300 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)
306 int init_heap_information(xbt_mheap_t heap1, xbt_mheap_t heap2, xbt_dynar_t i1, xbt_dynar_t i2){
308 if((((struct mdesc *)heap1)->heaplimit != ((struct mdesc *)heap2)->heaplimit) || ((((struct mdesc *)heap1)->heapsize != ((struct mdesc *)heap2)->heapsize) ))
313 heaplimit = ((struct mdesc *)heap1)->heaplimit;
315 s_heap = (char *)mmalloc_get_current_heap() - STD_HEAP_SIZE - getpagesize();
317 heapbase1 = (char *)heap1 + BLOCKSIZE;
318 heapbase2 = (char *)heap2 + BLOCKSIZE;
320 heapinfo1 = (malloc_info *)((char *)heap1 + ((uintptr_t)((char *)((struct mdesc *)heap1)->heapinfo - (char *)s_heap)));
321 heapinfo2 = (malloc_info *)((char *)heap2 + ((uintptr_t)((char *)((struct mdesc *)heap2)->heapinfo - (char *)s_heap)));
323 heapsize1 = heap1->heapsize;
324 heapsize2 = heap2->heapsize;
329 equals_to1 = malloc(heaplimit * sizeof(heap_area_t *));
330 for(i=0; i<=heaplimit; i++){
331 equals_to1[i] = malloc(MAX_FRAGMENT_PER_BLOCK * sizeof(heap_area_t));
332 for(j=0; j<MAX_FRAGMENT_PER_BLOCK; j++)
333 equals_to1[i][j] = NULL;
337 equals_to2 = malloc(heaplimit * sizeof(heap_area_t *));
338 for(i=0; i<=heaplimit; i++){
339 equals_to2[i] = malloc(MAX_FRAGMENT_PER_BLOCK * sizeof(heap_area_t));
340 for(j=0; j<MAX_FRAGMENT_PER_BLOCK; j++)
341 equals_to2[i][j] = NULL;
345 MC_ignore_global_variable("heaplimit");
346 MC_ignore_global_variable("s_heap");
347 MC_ignore_global_variable("heapbase1");
348 MC_ignore_global_variable("heapbase2");
349 MC_ignore_global_variable("heapinfo1");
350 MC_ignore_global_variable("heapinfo2");
351 MC_ignore_global_variable("heapsize1");
352 MC_ignore_global_variable("heapsize2");
353 MC_ignore_global_variable("to_ignore1");
354 MC_ignore_global_variable("to_ignore2");
355 MC_ignore_global_variable("equals_to1");
356 MC_ignore_global_variable("equals_to2");
363 void reset_heap_information(){
367 for(i=0; i<heaplimit; i++){
368 for(j=0; j<MAX_FRAGMENT_PER_BLOCK;j++){
369 heap_area_free(equals_to1[i][j]);
370 equals_to1[i][j] = NULL;
371 heap_area_free(equals_to2[i][j]);
372 equals_to2[i][j] = NULL;
379 s_heap = NULL, heapbase1 = NULL, heapbase2 = NULL;
380 heapinfo1 = NULL, heapinfo2 = NULL;
381 heaplimit = 0, heapsize1 = 0, heapsize2 = 0;
382 to_ignore1 = NULL, to_ignore2 = NULL;
383 equals_to1 = NULL, equals_to2 = NULL;
387 int mmalloc_compare_heap(xbt_mheap_t heap1, xbt_mheap_t heap2){
389 if(heap1 == NULL && heap2 == NULL){
390 XBT_DEBUG("Malloc descriptors null");
394 /* Start comparison */
395 size_t i1, i2, j1, j2, k;
396 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
397 int nb_diff1 = 0, nb_diff2 = 0;
399 xbt_dynar_t previous = xbt_dynar_new(sizeof(heap_area_pair_t), heap_area_pair_free_voidp);
401 int equal, res_compare = 0;
403 /* Check busy blocks*/
407 while(i1 <= heaplimit){
409 if(heapinfo1[i1].type == -1){ /* Free block */
414 addr_block1 = ((void*) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)s_heap)->heapbase));
416 if(heapinfo1[i1].type == 0){ /* Large block */
418 if(is_stack(addr_block1)){
419 for(k=0; k < heapinfo1[i1].busy_block.size; k++)
420 equals_to1[i1+k][0] = new_heap_area(i1, -1);
421 for(k=0; k < heapinfo2[i1].busy_block.size; k++)
422 equals_to2[i1+k][0] = new_heap_area(i1, -1);
423 i1 += heapinfo1[i1].busy_block.size;
427 if(equals_to1[i1][0] != NULL){
436 /* Try first to associate to same block in the other heap */
437 if(heapinfo2[i1].type == heapinfo1[i1].type){
439 if(equals_to2[i1][0] == NULL){
441 addr_block2 = ((void*) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)s_heap)->heapbase));
443 res_compare = compare_heap_area(addr_block1, addr_block2, NULL, NULL, NULL, NULL, 0);
445 if(res_compare == 0){
446 for(k=1; k < heapinfo2[i1].busy_block.size; k++)
447 equals_to2[i1+k][0] = new_heap_area(i1, -1);
448 for(k=1; k < heapinfo1[i1].busy_block.size; k++)
449 equals_to1[i1+k][0] = new_heap_area(i1, -1);
451 i1 += heapinfo1[i1].busy_block.size;
454 xbt_dynar_reset(previous);
460 while(i2 <= heaplimit && !equal){
462 addr_block2 = ((void*) (((ADDR2UINT(i2)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)s_heap)->heapbase));
469 if(heapinfo2[i2].type != 0){
474 if(equals_to2[i2][0] != NULL){
479 res_compare = compare_heap_area(addr_block1, addr_block2, NULL, NULL, NULL, NULL, 0);
481 if(res_compare == 0){
482 for(k=1; k < heapinfo2[i2].busy_block.size; k++)
483 equals_to2[i2+k][0] = new_heap_area(i1, -1);
484 for(k=1; k < heapinfo1[i1].busy_block.size; k++)
485 equals_to1[i1+k][0] = new_heap_area(i2, -1);
487 i1 += heapinfo1[i1].busy_block.size;
490 xbt_dynar_reset(previous);
497 XBT_DEBUG("Block %zu not found (size_used = %zu, addr = %p)", i1, heapinfo1[i1].busy_block.busy_size, addr_block1);
503 }else{ /* Fragmented block */
505 for(j1=0; j1 < (size_t) (BLOCKSIZE >> heapinfo1[i1].type); j1++){
507 if(heapinfo1[i1].busy_frag.frag_size[j1] == -1) /* Free fragment */
510 if(equals_to1[i1][j1] != NULL)
513 addr_frag1 = (void*) ((char *)addr_block1 + (j1 << heapinfo1[i1].type));
518 /* Try first to associate to same fragment in the other heap */
519 if(heapinfo2[i1].type == heapinfo1[i1].type){
521 if(equals_to2[i1][j1] == NULL){
523 addr_block2 = ((void*) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)s_heap)->heapbase));
524 addr_frag2 = (void*) ((char *)addr_block2 + (j1 << ((xbt_mheap_t)s_heap)->heapinfo[i1].type));
526 res_compare = compare_heap_area(addr_frag1, addr_frag2, NULL, NULL, NULL, NULL, 0);
531 xbt_dynar_reset(previous);
537 while(i2 <= heaplimit && !equal){
539 if(heapinfo2[i2].type <= 0){
544 for(j2=0; j2 < (size_t) (BLOCKSIZE >> heapinfo2[i2].type); j2++){
546 if(i2 == i1 && j2 == j1)
549 if(equals_to2[i2][j2] != NULL)
552 addr_block2 = ((void*) (((ADDR2UINT(i2)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)s_heap)->heapbase));
553 addr_frag2 = (void*) ((char *)addr_block2 + (j2 <<((xbt_mheap_t)s_heap)->heapinfo[i2].type));
555 res_compare = compare_heap_area(addr_frag1, addr_frag2, NULL, NULL, NULL, NULL, 0);
557 if(res_compare == 0){
559 xbt_dynar_reset(previous);
563 xbt_dynar_reset(previous);
572 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);
587 /* All blocks/fragments are equal to another block/fragment ? */
589 void *real_addr_frag1 = NULL, *real_addr_block1 = NULL, *real_addr_block2 = NULL, *real_addr_frag2 = NULL;
592 if(heapinfo1[i].type == 0){
594 if(heapinfo1[i].busy_block.busy_size > 0){
595 if(equals_to1[i][0] == NULL){
596 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
597 addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase1));
598 XBT_DEBUG("Block %zu (%p) not found (size used = %zu)", i, addr_block1, heapinfo1[i].busy_block.busy_size);
599 //mmalloc_backtrace_block_display((void*)heapinfo1, i);
606 if(heapinfo1[i].type > 0){
607 addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase1));
608 real_addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)((struct mdesc *)s_heap)->heapbase));
609 for(j=0; j < (size_t) (BLOCKSIZE >> heapinfo1[i].type); j++){
611 if(heapinfo1[i].busy_frag.frag_size[j] > 0){
612 if(equals_to1[i][j] == NULL){
613 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
614 addr_frag1 = (void*) ((char *)addr_block1 + (j << heapinfo1[i].type));
615 real_addr_frag1 = (void*) ((char *)real_addr_block1 + (j << ((struct mdesc *)s_heap)->heapinfo[i].type));
616 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]);
617 //mmalloc_backtrace_fragment_display((void*)heapinfo1, i, j);
629 XBT_DEBUG("Number of blocks/fragments not found in heap1 : %d", nb_diff1);
634 if(heapinfo2[i].type == 0){
636 if(heapinfo2[i].busy_block.busy_size > 0){
637 if(equals_to2[i][0] == NULL){
638 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
639 addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase2));
640 XBT_DEBUG("Block %zu (%p) not found (size used = %zu)", i, addr_block2, heapinfo2[i].busy_block.busy_size);
641 //mmalloc_backtrace_block_display((void*)heapinfo2, i);
648 if(heapinfo2[i].type > 0){
649 addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase2));
650 real_addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)((struct mdesc *)s_heap)->heapbase));
651 for(j=0; j < (size_t) (BLOCKSIZE >> heapinfo2[i].type); j++){
653 if(heapinfo2[i].busy_frag.frag_size[j] > 0){
654 if(equals_to2[i][j] == NULL){
655 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
656 addr_frag2 = (void*) ((char *)addr_block2 + (j << heapinfo2[i].type));
657 real_addr_frag2 = (void*) ((char *)real_addr_block2 + (j << ((struct mdesc *)s_heap)->heapinfo[i].type));
658 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]);
659 //mmalloc_backtrace_fragment_display((void*)heapinfo2, i, j);
671 XBT_DEBUG("Number of blocks/fragments not found in heap2 : %d", nb_diff2);
673 xbt_dynar_free(&previous);
674 real_addr_frag1 = NULL, real_addr_block1 = NULL, real_addr_block2 = NULL, real_addr_frag2 = NULL;
676 return ((nb_diff1 > 0) || (nb_diff2 > 0));
679 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){
682 void *addr_pointed1, *addr_pointed2;
683 int pointer_align, ignore1, ignore2, res_compare;
687 if(check_ignore > 0){
688 if((ignore1 = heap_comparison_ignore_size(to_ignore1, (char *)real_area1 + i)) > 0){
689 if((ignore2 = heap_comparison_ignore_size(to_ignore2, (char *)real_area2 + i)) == ignore1){
697 if(memcmp(((char *)area1) + i, ((char *)area2) + i, 1) != 0){
699 pointer_align = (i / sizeof(void*)) * sizeof(void*);
700 addr_pointed1 = *((void **)((char *)area1 + pointer_align));
701 addr_pointed2 = *((void **)((char *)area2 + pointer_align));
703 if(addr_pointed1 > maestro_stack_start && addr_pointed1 < maestro_stack_end && addr_pointed2 > maestro_stack_start && addr_pointed2 < maestro_stack_end){
704 i = pointer_align + sizeof(void *);
706 }else if((addr_pointed1 > s_heap) && ((char *)addr_pointed1 < (char *)s_heap + STD_HEAP_SIZE)
707 && (addr_pointed2 > s_heap) && ((char *)addr_pointed2 < (char *)s_heap + STD_HEAP_SIZE)){
708 res_compare = compare_heap_area(addr_pointed1, addr_pointed2, previous, all_types, other_types, NULL, 0);
709 if(res_compare != 0){
712 i = pointer_align + sizeof(void *);
729 static int compare_heap_area_with_type(void *real_area1, void *real_area2, void *area1, void *area2,
730 xbt_dynar_t previous, xbt_dict_t all_types, xbt_dict_t other_types, char *type_id,
731 int area_size, int check_ignore, int pointer_level){
733 if(is_stack(real_area1) && is_stack(real_area2))
736 size_t ignore1, ignore2;
738 if((check_ignore > 0) && ((ignore1 = heap_comparison_ignore_size(to_ignore1, real_area1)) > 0) && ((ignore2 = heap_comparison_ignore_size(to_ignore2, real_area2)) == ignore1))
741 dw_type_t type = xbt_dict_get_or_null(all_types, type_id);
742 dw_type_t subtype, subsubtype;
743 int res, elm_size, i, switch_types = 0;
744 unsigned int cursor = 0;
746 void *addr_pointed1, *addr_pointed2;;
751 if((check_ignore > 0) && ((ignore1 = heap_comparison_ignore_size(to_ignore1, real_area1)) > 0) && ((ignore2 = heap_comparison_ignore_size(to_ignore2, real_area2)) == ignore1))
753 if(strcmp(type->name, "char") == 0){ /* String, hence random (arbitrary ?) size */
754 return (memcmp(area1, area2, area_size) != 0);
756 if(area_size != -1 && type->size != area_size)
759 return (memcmp(area1, area2, type->size) != 0);
762 case e_dw_enumeration_type:
763 if((check_ignore > 0) && ((ignore1 = heap_comparison_ignore_size(to_ignore1, real_area1)) > 0) && ((ignore2 = heap_comparison_ignore_size(to_ignore2, real_area2)) == ignore1))
765 if(area_size != -1 && type->size != area_size)
768 return (memcmp(area1, area2, type->size) != 0);
771 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);
773 case e_dw_const_type:
776 case e_dw_array_type:
777 subtype = xbt_dict_get_or_null(all_types, type->dw_type_id);
778 switch(subtype->type){
780 case e_dw_enumeration_type:
781 case e_dw_pointer_type:
782 case e_dw_structure_type:
783 case e_dw_union_type:
784 if(subtype->size == 0){ /*declaration of the type, need the complete description */
785 type_desc = get_type_description(all_types, subtype->name);
787 subtype = xbt_dict_get_or_null(all_types, type_desc);
789 subtype = xbt_dict_get_or_null(other_types, get_type_description(other_types, subtype->name));
793 elm_size = subtype->size;
796 case e_dw_volatile_type:
797 subsubtype = xbt_dict_get_or_null(all_types, subtype->dw_type_id);
798 if(subsubtype->size == 0){ /*declaration of the type, need the complete description */
799 type_desc = get_type_description(all_types, subsubtype->name);
801 subsubtype = xbt_dict_get_or_null(all_types, type_desc);
803 subsubtype = xbt_dict_get_or_null(other_types, get_type_description(other_types, subtype->name));
807 elm_size = subsubtype->size;
813 for(i=0; i<type->size; i++){
815 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);
817 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);
822 case e_dw_pointer_type:
823 if(type->dw_type_id && ((dw_type_t)xbt_dict_get_or_null(all_types, type->dw_type_id))->type == e_dw_subroutine_type){
824 addr_pointed1 = *((void **)(area1));
825 addr_pointed2 = *((void **)(area2));
826 return (addr_pointed1 != addr_pointed2);;
829 if(pointer_level > 1){ /* Array of pointers */
830 for(i=0; i<(area_size/sizeof(void *)); i++){
831 addr_pointed1 = *((void **)((char *)area1 + (i*sizeof(void *))));
832 addr_pointed2 = *((void **)((char *)area2 + (i*sizeof(void *))));
833 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)
834 res = compare_heap_area(addr_pointed1, addr_pointed2, previous, all_types, other_types, type->dw_type_id, pointer_level);
836 res = (addr_pointed1 != addr_pointed2);
841 addr_pointed1 = *((void **)(area1));
842 addr_pointed2 = *((void **)(area2));
843 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)
844 return compare_heap_area(addr_pointed1, addr_pointed2, previous, all_types, other_types, type->dw_type_id, pointer_level);
846 return (addr_pointed1 != addr_pointed2);
850 case e_dw_structure_type:
851 if(type->size == 0){ /*declaration of the structure, need the complete description */
852 type_desc = get_type_description(all_types, type->name);
854 type = xbt_dict_get_or_null(all_types, type_desc);
856 type = xbt_dict_get_or_null(other_types, get_type_description(other_types, type->name));
860 if(area_size != -1 && type->size != area_size){
861 if(area_size>type->size && area_size%type->size == 0){
862 for(i=0; i<(area_size/type->size); i++){
864 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);
866 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);
875 xbt_dynar_foreach(type->members, cursor, member){
877 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);
879 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);
885 case e_dw_union_type:
886 if((check_ignore > 0) && ((ignore1 = heap_comparison_ignore_size(to_ignore1, real_area1)) > 0) && ((ignore2 = heap_comparison_ignore_size(to_ignore2, real_area2)) == ignore1))
888 return compare_heap_area_without_type(real_area1, real_area2, area1, area2, previous, all_types, other_types, type->size, check_ignore);
890 case e_dw_volatile_type:
891 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);
901 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){
904 ssize_t block1, frag1, block2, frag2;
906 int check_ignore = 0;
908 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
909 void *area1_to_compare, *area2_to_compare;
910 dw_type_t type = NULL;
915 if(previous == NULL){
916 previous = xbt_dynar_new(sizeof(heap_area_pair_t), heap_area_pair_free_voidp);
920 block1 = ((char*)area1 - (char*)((xbt_mheap_t)s_heap)->heapbase) / BLOCKSIZE + 1;
921 block2 = ((char*)area2 - (char*)((xbt_mheap_t)s_heap)->heapbase) / BLOCKSIZE + 1;
923 if(is_block_stack((int)block1) && is_block_stack((int)block2)){
924 add_heap_area_pair(previous, block1, -1, block2, -1);
926 match_equals(previous);
927 xbt_dynar_free(&previous);
932 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)){
934 xbt_dynar_free(&previous);
939 addr_block1 = ((void*) (((ADDR2UINT(block1)) - 1) * BLOCKSIZE + (char*)heapbase1));
940 addr_block2 = ((void*) (((ADDR2UINT(block2)) - 1) * BLOCKSIZE + (char*)heapbase2));
942 if((heapinfo1[block1].type == -1) && (heapinfo2[block2].type == -1)){ /* Free block */
945 match_equals(previous);
946 xbt_dynar_free(&previous);
950 }else if((heapinfo1[block1].type == 0) && (heapinfo2[block2].type == 0)){ /* Complete block */
952 if(equals_to1[block1][0] != NULL && equals_to2[block2][0] != NULL){
953 if(equal_blocks(block1, block2)){
955 match_equals(previous);
956 xbt_dynar_free(&previous);
963 type = xbt_dict_get_or_null(all_types, type_id);
964 if(strcmp(type->name, "char") ==0){
969 type_desc = get_type_description(all_types, type->name);
971 type = xbt_dict_get_or_null(all_types, type_desc);
973 type = xbt_dict_get_or_null(other_types, get_type_description(other_types, type->name));
975 if(strcmp(type->name, "s_smx_context") != 0){
977 if(heapinfo1[block1].busy_block.busy_size != type->size && heapinfo2[block2].busy_block.busy_size != type->size)
983 if(heapinfo1[block1].busy_block.size != heapinfo2[block2].busy_block.size){
985 xbt_dynar_free(&previous);
990 if(heapinfo1[block1].busy_block.busy_size != heapinfo2[block2].busy_block.busy_size){
992 xbt_dynar_free(&previous);
997 if(!add_heap_area_pair(previous, block1, -1, block2, -1)){
999 match_equals(previous);
1000 xbt_dynar_free(&previous);
1005 size = heapinfo1[block1].busy_block.busy_size;
1009 match_equals(previous);
1010 xbt_dynar_free(&previous);
1018 area1_to_compare = addr_block1;
1019 area2_to_compare = addr_block2;
1021 if((heapinfo1[block1].busy_block.ignore > 0) && (heapinfo2[block2].busy_block.ignore == heapinfo1[block1].busy_block.ignore))
1022 check_ignore = heapinfo1[block1].busy_block.ignore;
1024 }else if((heapinfo1[block1].type > 0) && (heapinfo2[block2].type > 0)){ /* Fragmented block */
1026 frag1 = ((uintptr_t) (ADDR2UINT (area1) % (BLOCKSIZE))) >> heapinfo1[block1].type;
1027 frag2 = ((uintptr_t) (ADDR2UINT (area2) % (BLOCKSIZE))) >> heapinfo2[block2].type;
1029 addr_frag1 = (void*) ((char *)addr_block1 + (frag1 << heapinfo1[block1].type));
1030 addr_frag2 = (void*) ((char *)addr_block2 + (frag2 << heapinfo2[block2].type));
1032 area1_to_compare = addr_frag1;
1033 area2_to_compare = addr_frag2;
1036 type = xbt_dict_get_or_null(all_types, type_id);
1037 if(strcmp(type->name, "char") ==0){
1041 if(type->size == 0 || type->type == e_dw_pointer_type){
1042 if(!type->dw_type_id){
1043 type_desc = get_type_description(all_types, type->name);
1045 type = xbt_dict_get_or_null(all_types, type_desc);
1047 type = xbt_dict_get_or_null(other_types, get_type_description(other_types, type->name));
1049 type = xbt_dict_get_or_null(all_types, type->dw_type_id);
1053 if(heapinfo1[block1].busy_frag.frag_size[frag1] != type->size || heapinfo2[block2].busy_frag.frag_size[frag2] != type->size)
1058 if(equals_to1[block1][frag1] != NULL && equals_to2[block2][frag2] != NULL){
1059 if(equal_fragments(block1, frag1, block2, frag2)){
1061 match_equals(previous);
1062 xbt_dynar_free(&previous);
1068 if(heapinfo1[block1].busy_frag.frag_size[frag1] != heapinfo2[block2].busy_frag.frag_size[frag2]){
1070 xbt_dynar_free(&previous);
1075 if(!add_heap_area_pair(previous, block1, frag1, block2, frag2)){
1077 match_equals(previous);
1078 xbt_dynar_free(&previous);
1083 size = heapinfo1[block1].busy_frag.frag_size[frag1];
1087 match_equals(previous);
1088 xbt_dynar_free(&previous);
1093 if((heapinfo1[block1].busy_frag.ignore[frag1] > 0) && ( heapinfo2[block2].busy_frag.ignore[frag2] == heapinfo1[block1].busy_frag.ignore[frag1]))
1094 check_ignore = heapinfo1[block1].busy_frag.ignore[frag1];
1099 xbt_dynar_free(&previous);
1106 /* Start comparison*/
1107 if(type_id != NULL){
1108 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);
1109 if(res_compare != 0){
1111 xbt_dynar_free(&previous);
1115 res_compare = compare_heap_area_without_type(area1, area2, area1_to_compare, area2_to_compare, previous, all_types, other_types, size, check_ignore);
1116 if(res_compare != 0){
1118 xbt_dynar_free(&previous);
1124 match_equals(previous);
1125 xbt_dynar_free(&previous);
1131 /*********************************************** Miscellaneous ***************************************************/
1132 /****************************************************************************************************************/
1135 int get_pointed_area_size(void *area, int heap){
1138 malloc_info *heapinfo;
1141 heapinfo = heapinfo1;
1143 heapinfo = heapinfo2;
1145 block = ((char*)area - (char*)((xbt_mheap_t)s_heap)->heapbase) / BLOCKSIZE + 1;
1147 if(((char *)area < (char*)((xbt_mheap_t)s_heap)->heapbase) || (block > heapsize1) || (block < 1))
1150 if(heapinfo[block].type == -1){ /* Free block */
1152 }else if(heapinfo[block].type == 0){ /* Complete block */
1153 return (int)heapinfo[block].busy_block.busy_size;
1155 frag = ((uintptr_t) (ADDR2UINT (area) % (BLOCKSIZE))) >> heapinfo[block].type;
1156 return (int)heapinfo[block].busy_frag.frag_size[frag];
1161 char *get_type_description(xbt_dict_t types, char *type_name){
1163 xbt_dict_cursor_t dict_cursor;
1167 xbt_dict_foreach(types, dict_cursor, type_origin, type){
1168 if(type->name && (strcmp(type->name, type_name) == 0) && type->size > 0){
1169 xbt_dict_cursor_free(&dict_cursor);
1174 xbt_dict_cursor_free(&dict_cursor);
1180 #define max( a, b ) ( ((a) > (b)) ? (a) : (b) )
1183 int mmalloc_linear_compare_heap(xbt_mheap_t heap1, xbt_mheap_t heap2){
1185 if(heap1 == NULL && heap1 == NULL){
1186 XBT_DEBUG("Malloc descriptors null");
1190 if(heap1->heaplimit != heap2->heaplimit){
1191 XBT_DEBUG("Different limit of valid info table indices");
1195 /* Heap information */
1196 heaplimit = ((struct mdesc *)heap1)->heaplimit;
1198 s_heap = (char *)mmalloc_get_current_heap() - STD_HEAP_SIZE - getpagesize();
1200 heapbase1 = (char *)heap1 + BLOCKSIZE;
1201 heapbase2 = (char *)heap2 + BLOCKSIZE;
1203 heapinfo1 = (malloc_info *)((char *)heap1 + ((uintptr_t)((char *)heap1->heapinfo - (char *)s_heap)));
1204 heapinfo2 = (malloc_info *)((char *)heap2 + ((uintptr_t)((char *)heap2->heapinfo - (char *)s_heap)));
1206 heapsize1 = heap1->heapsize;
1207 heapsize2 = heap2->heapsize;
1209 /* Start comparison */
1211 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
1215 /* Check busy blocks*/
1219 while(i <= heaplimit){
1221 addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase1));
1222 addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase2));
1224 if(heapinfo1[i].type != heapinfo2[i].type){
1226 distance += BLOCKSIZE;
1227 XBT_DEBUG("Different type of blocks (%zu) : %d - %d -> distance = %d", i, heapinfo1[i].type, heapinfo2[i].type, distance);
1232 if(heapinfo1[i].type == -1){ /* Free block */
1237 if(heapinfo1[i].type == 0){ /* Large block */
1239 if(heapinfo1[i].busy_block.size != heapinfo2[i].busy_block.size){
1240 distance += BLOCKSIZE * max(heapinfo1[i].busy_block.size, heapinfo2[i].busy_block.size);
1241 i += max(heapinfo1[i].busy_block.size, heapinfo2[i].busy_block.size);
1242 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);
1246 /*if(heapinfo1[i].busy_block.busy_size != heapinfo2[i].busy_block.busy_size){
1247 distance += max(heapinfo1[i].busy_block.busy_size, heapinfo2[i].busy_block.busy_size);
1248 i += max(heapinfo1[i].busy_block.size, heapinfo2[i].busy_block.size);
1249 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);
1255 //while(k < (heapinfo1[i].busy_block.busy_size)){
1256 while(k < heapinfo1[i].busy_block.size * BLOCKSIZE){
1257 if(memcmp((char *)addr_block1 + k, (char *)addr_block2 + k, 1) != 0){
1265 }else { /* Fragmented block */
1267 for(j=0; j < (size_t) (BLOCKSIZE >> heapinfo1[i].type); j++){
1269 addr_frag1 = (void*) ((char *)addr_block1 + (j << heapinfo1[i].type));
1270 addr_frag2 = (void*) ((char *)addr_block2 + (j << heapinfo2[i].type));
1272 if(heapinfo1[i].busy_frag.frag_size[j] == 0 && heapinfo2[i].busy_frag.frag_size[j] == 0){
1277 /*if(heapinfo1[i].busy_frag.frag_size[j] != heapinfo2[i].busy_frag.frag_size[j]){
1278 distance += max(heapinfo1[i].busy_frag.frag_size[j], heapinfo2[i].busy_frag.frag_size[j]);
1279 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);
1285 //while(k < max(heapinfo1[i].busy_frag.frag_size[j], heapinfo2[i].busy_frag.frag_size[j])){
1286 while(k < (BLOCKSIZE / (BLOCKSIZE >> heapinfo1[i].type))){
1287 if(memcmp((char *)addr_frag1 + k, (char *)addr_frag2 + k, 1) != 0){