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"
13 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mm_diff, xbt,
14 "Logging specific to mm_diff in mmalloc");
16 xbt_dynar_t mc_heap_comparison_ignore;
17 xbt_dynar_t stacks_areas;
19 static void heap_area_pair_free(heap_area_pair_t pair);
20 static void heap_area_pair_free_voidp(void *d);
21 static int add_heap_area_pair(xbt_dynar_t list, int block1, int fragment1, int block2, int fragment2);
22 static int is_new_heap_area_pair(xbt_dynar_t list, int block1, int fragment1, int block2, int fragment2);
23 static heap_area_t new_heap_area(int block, int fragment);
25 static int compare_area(void *area1, void* area2, size_t size, xbt_dynar_t previous, int check_ignore);
26 static void match_equals(xbt_dynar_t list, xbt_dynar_t *equals);
28 static int in_mc_comparison_ignore(int block, int fragment);
29 static size_t heap_comparison_ignore_size(void *address);
30 static void add_heap_equality(xbt_dynar_t *equals, void *a1, void *a2);
31 static void remove_heap_equality(xbt_dynar_t *equals, int address, void *a);
33 static char* is_stack(void *address);
35 void mmalloc_backtrace_block_display(void* heapinfo, int block){
39 /* if (((malloc_info *)heapinfo)[block].busy_block.bt_size == 0) { */
40 /* fprintf(stderr, "No backtrace available for that block, sorry.\n"); */
44 /* memcpy(&e.bt,&(((malloc_info *)heapinfo)[block].busy_block.bt),sizeof(void*)*XBT_BACKTRACE_SIZE); */
45 /* e.used = ((malloc_info *)heapinfo)[block].busy_block.bt_size; */
47 /* xbt_ex_setup_backtrace(&e); */
48 /* if (e.used == 0) { */
49 /* fprintf(stderr, "(backtrace not set)\n"); */
50 /* } else if (e.bt_strings == NULL) { */
51 /* fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet"); */
55 /* fprintf(stderr, "Backtrace of where the block %d was malloced (%d frames):\n", block ,e.used); */
56 /* for (i = 0; i < e.used; i++) /\* no need to display "xbt_backtrace_display" *\/{ */
57 /* fprintf(stderr, "%d ---> %s\n",i, e.bt_strings[i] + 4); */
62 void mmalloc_backtrace_fragment_display(void* heapinfo, int block, int frag){
66 /* memcpy(&e.bt,&(((malloc_info *)heapinfo)[block].busy_frag.bt[frag]),sizeof(void*)*XBT_BACKTRACE_SIZE); */
67 /* e.used = XBT_BACKTRACE_SIZE; */
69 /* xbt_ex_setup_backtrace(&e); */
70 /* if (e.used == 0) { */
71 /* fprintf(stderr, "(backtrace not set)\n"); */
72 /* } else if (e.bt_strings == NULL) { */
73 /* fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet"); */
77 /* fprintf(stderr, "Backtrace of where the fragment %d in block %d was malloced (%d frames):\n", frag, block ,e.used); */
78 /* for (i = 0; i < e.used; i++) /\* no need to display "xbt_backtrace_display" *\/{ */
79 /* fprintf(stderr, "%d ---> %s\n",i, e.bt_strings[i] + 4); */
85 void mmalloc_backtrace_display(void *addr){
87 /* size_t block, frag_nb; */
90 /* xbt_mheap_t heap = __mmalloc_current_heap ?: (xbt_mheap_t) mmalloc_preinit(); */
92 /* block = (((char*) (addr) - (char*) heap -> heapbase) / BLOCKSIZE + 1); */
94 /* type = heap->heapinfo[block].type; */
97 /* case -1 : /\* Free block *\/ */
98 /* fprintf(stderr, "Asked to display the backtrace of a block that is free. I'm puzzled\n"); */
101 /* case 0: /\* Large block *\/ */
102 /* mmalloc_backtrace_block_display(heap->heapinfo, block); */
104 /* default: /\* Fragmented block *\/ */
105 /* frag_nb = RESIDUAL(addr, BLOCKSIZE) >> type; */
106 /* if(heap->heapinfo[block].busy_frag.frag_size[frag_nb] == -1){ */
107 /* fprintf(stderr , "Asked to display the backtrace of a fragment that is free. I'm puzzled\n"); */
110 /* mmalloc_backtrace_fragment_display(heap->heapinfo, block, frag_nb); */
116 void *s_heap = NULL, *heapbase1 = NULL, *heapbase2 = NULL;
117 malloc_info *heapinfo1 = NULL, *heapinfo2 = NULL;
118 size_t heaplimit = 0, heapsize1 = 0, heapsize2 = 0;
122 int mmalloc_compare_heap(xbt_mheap_t heap1, xbt_mheap_t heap2, xbt_dynar_t *stack1, xbt_dynar_t *stack2, xbt_dynar_t *equals){
124 if(heap1 == NULL && heap1 == NULL){
125 XBT_DEBUG("Malloc descriptors null");
129 if(heap1->heaplimit != heap2->heaplimit){
130 XBT_DEBUG("Different limit of valid info table indices");
134 /* Heap information */
135 heaplimit = ((struct mdesc *)heap1)->heaplimit;
137 s_heap = (char *)mmalloc_get_current_heap() - STD_HEAP_SIZE - getpagesize();
139 heapbase1 = (char *)heap1 + BLOCKSIZE;
140 heapbase2 = (char *)heap2 + BLOCKSIZE;
142 heapinfo1 = (malloc_info *)((char *)heap1 + ((uintptr_t)((char *)heap1->heapinfo - (char *)s_heap)));
143 heapinfo2 = (malloc_info *)((char *)heap2 + ((uintptr_t)((char *)heap2->heapinfo - (char *)s_heap)));
145 heapsize1 = heap1->heapsize;
146 heapsize2 = heap2->heapsize;
148 /* Start comparison */
149 size_t i1, i2, j1, j2, k, current_block, current_fragment;
150 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
151 void *real_addr_block1, *real_addr_block2;
154 xbt_dynar_t previous = xbt_dynar_new(sizeof(heap_area_pair_t), heap_area_pair_free_voidp);
156 int equal, res_compare = 0;
158 /* Check busy blocks*/
162 while(i1 <= heaplimit){
166 if(heapinfo1[i1].type == -1){ /* Free block */
171 addr_block1 = ((void*) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE + (char*)heapbase1));
172 real_addr_block1 = (char*)((xbt_mheap_t)s_heap)->heapbase + (((char *)addr_block1) - (char *)heapbase1);
174 if(heapinfo1[i1].type == 0){ /* Large block */
176 if((xbt_dynar_length(*stack1) < xbt_dynar_length(stacks_areas)) && ((stack_name = is_stack(real_addr_block1)) != NULL)){
177 stack_region_t stack = xbt_new0(s_stack_region_t, 1);
178 stack->address = addr_block1;
179 stack->process_name = strdup(stack_name);
180 stack->size = heapinfo1[i1].busy_block.busy_size;
181 xbt_dynar_push(*stack1, &stack);
185 if(heapinfo1[i1].busy_block.busy_size == 0){
190 if(heapinfo1[i1].busy_block.equal_to != NULL){
199 /* Try first to associate to same block in the other heap */
200 if(heapinfo2[current_block].type == heapinfo1[current_block].type){
202 if(heapinfo2[current_block].busy_block.equal_to == NULL){
204 if(heapinfo1[current_block].busy_block.busy_size == heapinfo2[current_block].busy_block.busy_size){
206 addr_block2 = ((void*) (((ADDR2UINT(current_block)) - 1) * BLOCKSIZE + (char*)heapbase2));
207 real_addr_block2 = (char*)((xbt_mheap_t)s_heap)->heapbase + (((char *)addr_block2) - (char *)heapbase2);
209 if((xbt_dynar_length(*stack2) < xbt_dynar_length(stacks_areas)) && ((stack_name = is_stack(real_addr_block2)) != NULL)){
210 stack_region_t stack = xbt_new0(s_stack_region_t, 1);
211 stack->address = addr_block2;
212 stack->process_name = strdup(stack_name);
213 stack->size = heapinfo2[current_block].busy_block.busy_size;
214 xbt_dynar_push(*stack2, &stack);
218 add_heap_area_pair(previous, current_block, -1, current_block, -1);
220 if(res_compare != -1){
221 if((ignore_done < xbt_dynar_length(mc_heap_comparison_ignore)) && heapinfo1[current_block].busy_block.ignore == 1){
222 res_compare = compare_area(addr_block1, addr_block2, heapinfo1[current_block].busy_block.busy_size, previous, 1);
224 res_compare = compare_area(addr_block1, addr_block2, heapinfo1[current_block].busy_block.busy_size, previous, 0);
228 if(res_compare == 0 || res_compare == -1){
229 for(k=1; k < heapinfo2[current_block].busy_block.size; k++)
230 heapinfo2[current_block+k].busy_block.equal_to = new_heap_area(i1, -1);
231 for(k=1; k < heapinfo1[current_block].busy_block.size; k++)
232 heapinfo1[current_block+k].busy_block.equal_to = new_heap_area(i1, -1);
234 match_equals(previous, equals);
235 i1 = i1 + heapinfo1[current_block].busy_block.size;
238 xbt_dynar_reset(previous);
246 while(i2 <= heaplimit && !equal){
248 addr_block2 = ((void*) (((ADDR2UINT(i2)) - 1) * BLOCKSIZE + (char*)heapbase2));
249 real_addr_block2 = (char*)((xbt_mheap_t)s_heap)->heapbase + (((char *)addr_block2) - (char *)heapbase2);
251 if((xbt_dynar_length(*stack2) < xbt_dynar_length(stacks_areas)) && ((stack_name = is_stack(real_addr_block2)) != NULL)){
252 stack_region_t stack = xbt_new0(s_stack_region_t, 1);
253 stack->address = addr_block2;
254 stack->process_name = strdup(stack_name);
255 stack->size = heapinfo2[i2].busy_block.busy_size;
256 xbt_dynar_push(*stack2, &stack);
260 if(i2 == current_block){
265 if(heapinfo2[i2].type != 0){
270 if(heapinfo2[i2].busy_block.equal_to != NULL){
275 if(heapinfo1[i1].busy_block.size != heapinfo2[i2].busy_block.size){
280 if(heapinfo1[i1].busy_block.busy_size != heapinfo2[i2].busy_block.busy_size){
286 add_heap_area_pair(previous, i1, -1, i2, -1);
288 if(res_compare != -1){
289 if((ignore_done < xbt_dynar_length(mc_heap_comparison_ignore)) && heapinfo1[i1].busy_block.ignore == 1){
290 res_compare = compare_area(addr_block1, addr_block2, heapinfo1[i1].busy_block.busy_size, previous, 1);
292 res_compare = compare_area(addr_block1, addr_block2, heapinfo1[i1].busy_block.busy_size, previous, 0);
296 if(res_compare == 0 || res_compare == -1){
297 for(k=1; k < heapinfo2[i2].busy_block.size; k++)
298 heapinfo2[i2+k].busy_block.equal_to = new_heap_area(i1, -1);
299 for(k=1; k < heapinfo1[i1].busy_block.size; k++)
300 heapinfo1[i1+k].busy_block.equal_to = new_heap_area(i2, -1);
302 match_equals(previous, equals);
303 i1 = i1 + heapinfo1[i1].busy_block.size;
306 xbt_dynar_reset(previous);
315 }else{ /* Fragmented block */
317 for(j1=0; j1 < (size_t) (BLOCKSIZE >> heapinfo1[i1].type); j1++){
319 current_fragment = j1;
321 if(heapinfo1[i1].busy_frag.frag_size[j1] == -1) /* Free fragment */
324 if(heapinfo1[i1].busy_frag.equal_to[j1] != NULL)
327 addr_frag1 = (void*) ((char *)addr_block1 + (j1 << heapinfo1[i1].type));
332 /* Try first to associate to same fragment in the other heap */
333 if(heapinfo2[current_block].type == heapinfo1[current_block].type){
335 if(heapinfo2[current_block].busy_frag.equal_to[current_fragment] == NULL){
337 if(heapinfo1[current_block].busy_frag.frag_size[current_fragment] == heapinfo2[current_block].busy_frag.frag_size[current_fragment]){
339 addr_block2 = ((void*) (((ADDR2UINT(current_block)) - 1) * BLOCKSIZE + (char*)heapbase2));
340 addr_frag2 = (void*) ((char *)addr_block2 + (current_fragment << heapinfo2[current_block].type));
342 add_heap_area_pair(previous, current_block, current_fragment, current_block, current_fragment);
344 if((ignore_done < xbt_dynar_length(mc_heap_comparison_ignore)) && (heapinfo1[current_block].busy_frag.ignore[current_fragment] == 1)){
345 res_compare = compare_area(addr_frag1, addr_frag2, heapinfo1[current_block].busy_frag.frag_size[current_fragment], previous, 1);
347 res_compare = compare_area(addr_frag1, addr_frag2, heapinfo1[current_block].busy_frag.frag_size[current_fragment], previous, 0);
350 if(res_compare == 0){
352 match_equals(previous, equals);
355 xbt_dynar_reset(previous);
362 while(i2 <= heaplimit && !equal){
365 if(heapinfo2[i2].type <= 0){
370 for(j2=0; j2 < (size_t) (BLOCKSIZE >> heapinfo2[i2].type); j2++){
372 if(heapinfo2[i2].type == heapinfo1[i1].type && i2 == current_block && j2 == current_fragment)
375 if(heapinfo2[i2].busy_frag.equal_to[j2] != NULL)
378 if(heapinfo1[i1].busy_frag.frag_size[j1] != heapinfo2[i2].busy_frag.frag_size[j2]) /* Different size_used */
381 addr_block2 = ((void*) (((ADDR2UINT(i2)) - 1) * BLOCKSIZE + (char*)heapbase2));
382 addr_frag2 = (void*) ((char *)addr_block2 + (j2 << heapinfo2[i2].type));
385 add_heap_area_pair(previous, i1, j1, i2, j2);
387 if((ignore_done < xbt_dynar_length(mc_heap_comparison_ignore)) && (heapinfo1[i1].busy_frag.ignore[j1] == 1)){
388 res_compare = compare_area(addr_frag1, addr_frag2, heapinfo1[i1].busy_frag.frag_size[j1], previous, 1);
390 res_compare = compare_area(addr_frag1, addr_frag2, heapinfo1[i1].busy_frag.frag_size[j1], previous, 0);
393 if(res_compare == 0){
395 match_equals(previous, equals);
396 xbt_dynar_reset(previous);
400 xbt_dynar_reset(previous);
416 /* All blocks/fragments are equal to another block/fragment ? */
418 int nb_diff1 = 0, nb_diff2 = 0;
421 if(heapinfo1[i].type == 0){
422 if(heapinfo1[i].busy_block.busy_size > 0){
423 if(heapinfo1[i].busy_block.equal_to == NULL){
424 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
425 addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase1));
426 XBT_DEBUG("Block %zu (%p) not found (size used = %zu)", i, addr_block1, heapinfo1[i].busy_block.busy_size);
427 //mmalloc_backtrace_block_display((void*)heapinfo1, i);
432 xbt_free(heapinfo1[i].busy_block.equal_to);
433 heapinfo1[i].busy_block.equal_to = NULL;
435 if(heapinfo1[i].type > 0){
436 addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase1));
437 for(j=0; j < (size_t) (BLOCKSIZE >> heapinfo1[i].type); j++){
438 if(heapinfo1[i].busy_frag.frag_size[j] > 0){
439 if(heapinfo1[i].busy_frag.equal_to[j] == NULL){
440 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
441 addr_frag1 = (void*) ((char *)addr_block1 + (j << heapinfo1[i].type));
442 XBT_DEBUG("Block %zu, Fragment %zu (%p) not found (size used = %d)", i, j, addr_frag1, heapinfo1[i].busy_frag.frag_size[j]);
443 //mmalloc_backtrace_fragment_display((void*)heapinfo1, i, j);
448 xbt_free(heapinfo1[i].busy_frag.equal_to[j]);
449 heapinfo1[i].busy_frag.equal_to[j] = NULL;
455 XBT_DEBUG("Different blocks or fragments in heap1 : %d", nb_diff1);
460 if(heapinfo2[i].type == 0){
461 if(heapinfo2[i].busy_block.busy_size > 0){
462 if(heapinfo2[i].busy_block.equal_to == NULL){
463 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
464 addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase2));
465 XBT_DEBUG("Block %zu (%p) not found (size used = %zu)", i, addr_block2, heapinfo2[i].busy_block.busy_size);
466 //mmalloc_backtrace_block_display((void*)heapinfo2, i);
471 xbt_free(heapinfo2[i].busy_block.equal_to);
472 heapinfo2[i].busy_block.equal_to = NULL;
474 if(heapinfo2[i].type > 0){
475 addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase2));
476 for(j=0; j < (size_t) (BLOCKSIZE >> heapinfo2[i].type); j++){
477 if(heapinfo2[i].busy_frag.frag_size[j] > 0){
478 if(heapinfo2[i].busy_frag.equal_to[j] == NULL){
479 if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
480 addr_frag2 = (void*) ((char *)addr_block2 + (j << heapinfo2[i].type));
481 XBT_DEBUG( "Block %zu, Fragment %zu (%p) not found (size used = %d)", i, j, addr_frag2, heapinfo2[i].busy_frag.frag_size[j]);
482 //mmalloc_backtrace_fragment_display((void*)heapinfo2, i, j);
487 xbt_free(heapinfo2[i].busy_frag.equal_to[j]);
488 heapinfo2[i].busy_frag.equal_to[j] = NULL;
494 XBT_DEBUG("Different blocks or fragments in heap2 : %d", nb_diff2);
496 xbt_dynar_free(&previous);
498 s_heap = NULL, heapbase1 = NULL, heapbase2 = NULL;
499 heapinfo1 = NULL, heapinfo2 = NULL;
500 heaplimit = 0, heapsize1 = 0, heapsize2 = 0;
502 return ((nb_diff1 > 0) || (nb_diff2 > 0));
505 static heap_area_t new_heap_area(int block, int fragment){
506 heap_area_t area = NULL;
507 area = xbt_new0(s_heap_area_t, 1);
509 area->fragment = fragment;
513 static int in_mc_comparison_ignore(int block, int fragment){
515 unsigned int cursor = 0;
517 int end = xbt_dynar_length(mc_heap_comparison_ignore) - 1;
518 mc_heap_ignore_region_t region;
521 cursor = (start + end) / 2;
522 region = (mc_heap_ignore_region_t)xbt_dynar_get_as(mc_heap_comparison_ignore, cursor, mc_heap_ignore_region_t);
523 if(region->block == block){
524 if(region->fragment == fragment)
526 if(region->fragment < fragment)
528 if(region->fragment > fragment)
531 if(region->block < block)
533 if(region->block > block)
540 static size_t heap_comparison_ignore_size(void *address){
541 unsigned int cursor = 0;
543 int end = xbt_dynar_length(mc_heap_comparison_ignore) - 1;
544 mc_heap_ignore_region_t region;
547 cursor = (start + end) / 2;
548 region = (mc_heap_ignore_region_t)xbt_dynar_get_as(mc_heap_comparison_ignore, cursor, mc_heap_ignore_region_t);
549 if(region->address == address)
551 if(region->address < address)
553 if(region->address > address)
561 static int compare_area(void *area1, void* area2, size_t size, xbt_dynar_t previous, int check_ignore){
563 size_t i = 0, pointer_align = 0, ignore1 = 0, ignore2 = 0;
564 void *address_pointed1, *address_pointed2, *addr_block_pointed1, *addr_block_pointed2, *addr_frag_pointed1, *addr_frag_pointed2;
565 size_t block_pointed1, block_pointed2, frag_pointed1, frag_pointed2;
567 void *current_area1, *current_area2;
573 current_area1 = (char*)((xbt_mheap_t)s_heap)->heapbase + ((((char *)area1) + i) - (char *)heapbase1);
574 if((ignore1 = heap_comparison_ignore_size(current_area1)) > 0){
575 current_area2 = (char*)((xbt_mheap_t)s_heap)->heapbase + ((((char *)area2) + i) - (char *)heapbase2);
576 if((ignore2 = heap_comparison_ignore_size(current_area2)) == ignore1){
585 if(memcmp(((char *)area1) + i, ((char *)area2) + i, 1) != 0){
587 /* Check pointer difference */
588 pointer_align = (i / sizeof(void*)) * sizeof(void*);
589 address_pointed1 = *((void **)((char *)area1 + pointer_align));
590 address_pointed2 = *((void **)((char *)area2 + pointer_align));
592 /* Get pointed blocks number */
593 block_pointed1 = ((char*)address_pointed1 - (char*)((xbt_mheap_t)s_heap)->heapbase) / BLOCKSIZE + 1;
594 block_pointed2 = ((char*)address_pointed2 - (char*)((xbt_mheap_t)s_heap)->heapbase) / BLOCKSIZE + 1;
596 /* Check if valid blocks number */
597 if((char *)address_pointed1 < (char*)((xbt_mheap_t)s_heap)->heapbase || block_pointed1 > heapsize1 || block_pointed1 < 1 || (char *)address_pointed2 < (char*)((xbt_mheap_t)s_heap)->heapbase || block_pointed2 > heapsize2 || block_pointed2 < 1)
600 if(heapinfo1[block_pointed1].type == heapinfo2[block_pointed2].type){ /* Same type of block (large or fragmented) */
602 addr_block_pointed1 = ((void*) (((ADDR2UINT(block_pointed1)) - 1) * BLOCKSIZE + (char*)heapbase1));
603 addr_block_pointed2 = ((void*) (((ADDR2UINT(block_pointed2)) - 1) * BLOCKSIZE + (char*)heapbase2));
605 if(heapinfo1[block_pointed1].type == 0){ /* Large block */
607 if(heapinfo1[block_pointed1].busy_block.size != heapinfo2[block_pointed2].busy_block.size){
611 if(heapinfo1[block_pointed1].busy_block.busy_size != heapinfo2[block_pointed2].busy_block.busy_size){
615 if(add_heap_area_pair(previous, block_pointed1, -1, block_pointed2, -1)){
617 if((ignore_done < xbt_dynar_length(mc_heap_comparison_ignore)) && (heapinfo1[block_pointed1].busy_block.ignore == 1)){
618 res_compare = compare_area(addr_block_pointed1, addr_block_pointed2, heapinfo1[block_pointed1].busy_block.busy_size, previous, 1);
620 res_compare = compare_area(addr_block_pointed1, addr_block_pointed2, heapinfo1[block_pointed1].busy_block.busy_size, previous, 0);
628 }else{ /* Fragmented block */
630 /* Get pointed fragments number */
631 frag_pointed1 = ((uintptr_t) (ADDR2UINT (address_pointed1) % (BLOCKSIZE))) >> heapinfo1[block_pointed1].type;
632 frag_pointed2 = ((uintptr_t) (ADDR2UINT (address_pointed2) % (BLOCKSIZE))) >> heapinfo2[block_pointed2].type;
634 if(heapinfo1[block_pointed1].busy_frag.frag_size[frag_pointed1] != heapinfo2[block_pointed2].busy_frag.frag_size[frag_pointed2]) /* Different size_used */
637 addr_frag_pointed1 = (void*) ((char *)addr_block_pointed1 + (frag_pointed1 << heapinfo1[block_pointed1].type));
638 addr_frag_pointed2 = (void*) ((char *)addr_block_pointed2 + (frag_pointed2 << heapinfo2[block_pointed2].type));
640 if(add_heap_area_pair(previous, block_pointed1, frag_pointed1, block_pointed2, frag_pointed2)){
642 if((ignore_done < xbt_dynar_length(mc_heap_comparison_ignore)) && (heapinfo1[block_pointed1].busy_frag.ignore[frag_pointed1] == 1)){
643 res_compare = compare_area(addr_frag_pointed1, addr_frag_pointed2, heapinfo1[block_pointed1].busy_frag.frag_size[frag_pointed1], previous, 1);
645 res_compare = compare_area(addr_frag_pointed1, addr_frag_pointed2, heapinfo1[block_pointed1].busy_frag.frag_size[frag_pointed1], previous, 0);
657 if((heapinfo1[block_pointed1].type > 0) && (heapinfo2[block_pointed2].type > 0)){
659 addr_block_pointed1 = ((void*) (((ADDR2UINT(block_pointed1)) - 1) * BLOCKSIZE + (char*)heapbase1));
660 addr_block_pointed2 = ((void*) (((ADDR2UINT(block_pointed2)) - 1) * BLOCKSIZE + (char*)heapbase2));
662 frag_pointed1 = ((uintptr_t) (ADDR2UINT (address_pointed1) % (BLOCKSIZE))) >> heapinfo1[block_pointed1].type;
663 frag_pointed2 = ((uintptr_t) (ADDR2UINT (address_pointed2) % (BLOCKSIZE))) >> heapinfo2[block_pointed2].type;
665 if(heapinfo1[block_pointed1].busy_frag.frag_size[frag_pointed1] != heapinfo2[block_pointed2].busy_frag.frag_size[frag_pointed2]) /* Different size_used */
668 addr_frag_pointed1 = (void*) ((char *)addr_block_pointed1 + (frag_pointed1 << heapinfo1[block_pointed1].type));
669 addr_frag_pointed2 = (void*) ((char *)addr_block_pointed2 + (frag_pointed2 << heapinfo2[block_pointed2].type));
671 if(add_heap_area_pair(previous, block_pointed1, frag_pointed1, block_pointed2, frag_pointed2)){
673 if((ignore_done < xbt_dynar_length(mc_heap_comparison_ignore)) && (heapinfo1[block_pointed1].busy_frag.ignore[frag_pointed1] == 1)){
674 res_compare = compare_area(addr_frag_pointed1, addr_frag_pointed2, heapinfo1[block_pointed1].busy_frag.frag_size[frag_pointed1], previous, 1);
676 res_compare = compare_area(addr_frag_pointed1, addr_frag_pointed2, heapinfo1[block_pointed1].busy_frag.frag_size[frag_pointed1], previous, 0);
690 i = pointer_align + sizeof(void *);
704 static void heap_area_pair_free(heap_area_pair_t pair){
711 static void heap_area_pair_free_voidp(void *d)
713 heap_area_pair_free((heap_area_pair_t) * (void **) d);
716 static int add_heap_area_pair(xbt_dynar_t list, int block1, int fragment1, int block2, int fragment2){
718 if(is_new_heap_area_pair(list, block1, fragment1, block2, fragment2)){
719 heap_area_pair_t pair = NULL;
720 pair = xbt_new0(s_heap_area_pair_t, 1);
721 pair->block1 = block1;
722 pair->fragment1 = fragment1;
723 pair->block2 = block2;
724 pair->fragment2 = fragment2;
726 xbt_dynar_push(list, &pair);
734 static int is_new_heap_area_pair(xbt_dynar_t list, int block1, int fragment1, int block2, int fragment2){
736 unsigned int cursor = 0;
737 heap_area_pair_t current_pair;
739 xbt_dynar_foreach(list, cursor, current_pair){
740 if(current_pair->block1 == block1 && current_pair->block2 == block2 && current_pair->fragment1 == fragment1 && current_pair->fragment2 == fragment2)
747 static void match_equals(xbt_dynar_t list, xbt_dynar_t *equals){
749 unsigned int cursor = 0;
750 heap_area_pair_t current_pair;
751 heap_area_t previous_area;
753 void *real_addr_block1, *real_addr_block2, *real_addr_frag1, *real_addr_frag2;
755 xbt_dynar_foreach(list, cursor, current_pair){
757 if(current_pair->fragment1 != -1){
759 real_addr_block1 = ((void*) (((ADDR2UINT((size_t)current_pair->block1)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)s_heap)->heapbase));
760 real_addr_frag1 = (void*) ((char *)real_addr_block1 + (current_pair->fragment1 << heapinfo1[current_pair->block1].type));
761 real_addr_block2 = ((void*) (((ADDR2UINT((size_t)current_pair->block2)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)s_heap)->heapbase));
762 real_addr_frag2 = (void*) ((char *)real_addr_block2 + (current_pair->fragment2 << heapinfo2[current_pair->block2].type));
764 if(heapinfo1[current_pair->block1].busy_frag.equal_to[current_pair->fragment1] != NULL){
765 remove_heap_equality(equals, 1, real_addr_frag1);
766 previous_area = heapinfo1[current_pair->block1].busy_frag.equal_to[current_pair->fragment1];
767 xbt_free(heapinfo2[previous_area->block].busy_frag.equal_to[previous_area->fragment]);
768 heapinfo2[previous_area->block].busy_frag.equal_to[previous_area->fragment] = NULL;
769 xbt_free(previous_area);
771 if(heapinfo2[current_pair->block2].busy_frag.equal_to[current_pair->fragment2] != NULL){
772 remove_heap_equality(equals, 2, real_addr_frag2);
773 previous_area = heapinfo2[current_pair->block2].busy_frag.equal_to[current_pair->fragment2];
774 xbt_free(heapinfo1[previous_area->block].busy_frag.equal_to[previous_area->fragment]);
775 heapinfo1[previous_area->block].busy_frag.equal_to[previous_area->fragment] = NULL;
776 xbt_free(previous_area);
779 if(real_addr_frag1 != real_addr_frag2)
780 add_heap_equality(equals, real_addr_frag1, real_addr_frag2);
782 heapinfo1[current_pair->block1].busy_frag.equal_to[current_pair->fragment1] = new_heap_area(current_pair->block2, current_pair->fragment2);
783 heapinfo2[current_pair->block2].busy_frag.equal_to[current_pair->fragment2] = new_heap_area(current_pair->block1, current_pair->fragment1);
787 real_addr_block1 = ((void*) (((ADDR2UINT((size_t)current_pair->block1)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)s_heap)->heapbase));
788 real_addr_block2 = ((void*) (((ADDR2UINT((size_t)current_pair->block2)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)s_heap)->heapbase));
790 if(heapinfo1[current_pair->block1].busy_block.equal_to != NULL){
791 remove_heap_equality(equals, 1, real_addr_block1);
792 previous_area = heapinfo1[current_pair->block1].busy_block.equal_to;
793 xbt_free(heapinfo2[previous_area->block].busy_block.equal_to);
794 heapinfo2[previous_area->block].busy_block.equal_to = NULL;
795 xbt_free(previous_area);
797 if(heapinfo2[current_pair->block2].busy_block.equal_to != NULL){
798 remove_heap_equality(equals, 2, real_addr_block2);
799 previous_area = heapinfo2[current_pair->block2].busy_block.equal_to;
800 xbt_free(heapinfo1[previous_area->block].busy_block.equal_to);
801 heapinfo1[previous_area->block].busy_block.equal_to = NULL;
802 xbt_free(previous_area);
805 if(real_addr_block1 != real_addr_block2)
806 add_heap_equality(equals, real_addr_block1, real_addr_block2);
808 heapinfo1[current_pair->block1].busy_block.equal_to = new_heap_area(current_pair->block2, current_pair->fragment2);
809 heapinfo2[current_pair->block2].busy_block.equal_to = new_heap_area(current_pair->block1, current_pair->fragment1);
818 #define max( a, b ) ( ((a) > (b)) ? (a) : (b) )
821 int mmalloc_linear_compare_heap(xbt_mheap_t heap1, xbt_mheap_t heap2){
823 if(heap1 == NULL && heap1 == NULL){
824 XBT_DEBUG("Malloc descriptors null");
828 if(heap1->heaplimit != heap2->heaplimit){
829 XBT_DEBUG("Different limit of valid info table indices");
833 /* Heap information */
834 heaplimit = ((struct mdesc *)heap1)->heaplimit;
836 s_heap = (char *)mmalloc_get_current_heap() - STD_HEAP_SIZE - getpagesize();
838 heapbase1 = (char *)heap1 + BLOCKSIZE;
839 heapbase2 = (char *)heap2 + BLOCKSIZE;
841 heapinfo1 = (malloc_info *)((char *)heap1 + ((uintptr_t)((char *)heap1->heapinfo - (char *)s_heap)));
842 heapinfo2 = (malloc_info *)((char *)heap2 + ((uintptr_t)((char *)heap2->heapinfo - (char *)s_heap)));
844 heapsize1 = heap1->heapsize;
845 heapsize2 = heap2->heapsize;
847 /* Start comparison */
849 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
853 /* Check busy blocks*/
857 while(i <= heaplimit){
859 addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase1));
860 addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase2));
862 if(heapinfo1[i].type != heapinfo2[i].type){
864 distance += BLOCKSIZE;
865 XBT_DEBUG("Different type of blocks (%zu) : %d - %d -> distance = %d", i, heapinfo1[i].type, heapinfo2[i].type, distance);
870 if(heapinfo1[i].type == -1){ /* Free block */
875 if(heapinfo1[i].type == 0){ /* Large block */
877 if(heapinfo1[i].busy_block.size != heapinfo2[i].busy_block.size){
878 distance += BLOCKSIZE * max(heapinfo1[i].busy_block.size, heapinfo2[i].busy_block.size);
879 i += max(heapinfo1[i].busy_block.size, heapinfo2[i].busy_block.size);
880 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);
884 /*if(heapinfo1[i].busy_block.busy_size != heapinfo2[i].busy_block.busy_size){
885 distance += max(heapinfo1[i].busy_block.busy_size, heapinfo2[i].busy_block.busy_size);
886 i += max(heapinfo1[i].busy_block.size, heapinfo2[i].busy_block.size);
887 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);
893 //while(k < (heapinfo1[i].busy_block.busy_size)){
894 while(k < heapinfo1[i].busy_block.size * BLOCKSIZE){
895 if(memcmp((char *)addr_block1 + k, (char *)addr_block2 + k, 1) != 0){
903 }else { /* Fragmented block */
905 for(j=0; j < (size_t) (BLOCKSIZE >> heapinfo1[i].type); j++){
907 addr_frag1 = (void*) ((char *)addr_block1 + (j << heapinfo1[i].type));
908 addr_frag2 = (void*) ((char *)addr_block2 + (j << heapinfo2[i].type));
910 if(heapinfo1[i].busy_frag.frag_size[j] == 0 && heapinfo2[i].busy_frag.frag_size[j] == 0){
915 /*if(heapinfo1[i].busy_frag.frag_size[j] != heapinfo2[i].busy_frag.frag_size[j]){
916 distance += max(heapinfo1[i].busy_frag.frag_size[j], heapinfo2[i].busy_frag.frag_size[j]);
917 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);
923 //while(k < max(heapinfo1[i].busy_frag.frag_size[j], heapinfo2[i].busy_frag.frag_size[j])){
924 while(k < (BLOCKSIZE / (BLOCKSIZE >> heapinfo1[i].type))){
925 if(memcmp((char *)addr_frag1 + k, (char *)addr_frag2 + k, 1) != 0){
945 static char* is_stack(void *address){
946 unsigned int cursor = 0;
947 stack_region_t stack;
949 xbt_dynar_foreach(stacks_areas, cursor, stack){
950 if(address == stack->address)
951 return stack->process_name;
957 static void add_heap_equality(xbt_dynar_t *equals, void *a1, void *a2){
959 if(xbt_dynar_is_empty(*equals)){
961 heap_equality_t he = xbt_new0(s_heap_equality_t, 1);
965 xbt_dynar_insert_at(*equals, 0, &he);
969 unsigned int cursor = 0;
971 int end = xbt_dynar_length(*equals) - 1;
972 heap_equality_t current_equality = NULL;
975 cursor = (start + end) / 2;
976 current_equality = (heap_equality_t)xbt_dynar_get_as(*equals, cursor, heap_equality_t);
977 if(current_equality->address1 == a1){
978 if(current_equality->address2 == a2)
980 if(current_equality->address2 < a2)
982 if(current_equality->address2 > a2)
985 if(current_equality->address1 < a1)
987 if(current_equality->address1 > a1)
991 heap_equality_t he = xbt_new0(s_heap_equality_t, 1);
995 if(current_equality->address1 < a1)
996 xbt_dynar_insert_at(*equals, cursor + 1 , &he);
998 xbt_dynar_insert_at(*equals, cursor, &he);
1004 static void remove_heap_equality(xbt_dynar_t *equals, int address, void *a){
1006 unsigned int cursor = 0;
1007 heap_equality_t current_equality;
1013 int end = xbt_dynar_length(*equals) - 1;
1016 while(start <= end && found == 0){
1017 cursor = (start + end) / 2;
1018 current_equality = (heap_equality_t)xbt_dynar_get_as(*equals, cursor, heap_equality_t);
1019 if(current_equality->address1 == a)
1021 if(current_equality->address1 < a)
1023 if(current_equality->address1 > a)
1028 xbt_dynar_remove_at(*equals, cursor, NULL);
1032 xbt_dynar_foreach(*equals, cursor, current_equality){
1033 if(current_equality->address2 == a){
1040 xbt_dynar_remove_at(*equals, cursor, NULL);
1046 int is_free_area(void *area, xbt_mheap_t heap){
1048 void *sheap = (char *)mmalloc_get_current_heap() - STD_HEAP_SIZE - getpagesize();
1049 malloc_info *heapinfo = (malloc_info *)((char *)heap + ((uintptr_t)((char *)heap->heapinfo - (char *)sheap)));
1050 size_t heapsize = heap->heapsize;
1052 /* Get block number */
1053 size_t block = ((char*)area - (char*)((xbt_mheap_t)sheap)->heapbase) / BLOCKSIZE + 1;
1056 /* Check if valid block number */
1057 if((char *)area < (char*)((xbt_mheap_t)sheap)->heapbase || block > heapsize || block < 1)
1060 if(heapinfo[block].type < 0)
1063 if(heapinfo[block].type == 0)
1066 if(heapinfo[block].type > 0){
1067 fragment = ((uintptr_t) (ADDR2UINT(area) % (BLOCKSIZE))) >> heapinfo[block].type;
1068 if(heapinfo[block].busy_frag.frag_size[fragment] == 0)