src/xbt/mmalloc/mm_diff.c

   1 /* mm_diff - Memory snapshooting and comparison                             */
   2
   3 /* Copyright (c) 2008-2012. The SimGrid Team. All rights reserved.          */
   4
   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. */
   7
   8 #include "xbt/ex_interface.h" /* internals of backtrace setup */
   9 #include "xbt/str.h"
  10 #include "mc/mc.h"
  11 #include "xbt/mmalloc.h"
  12
  13 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mm_diff, xbt,
  14                                 "Logging specific to mm_diff in mmalloc");
  15
  16 extern char *xbt_binary_name;
  17
  18 xbt_dynar_t mc_heap_comparison_ignore;
  19 xbt_dynar_t stacks_areas;
  20
  21 static void heap_area_pair_free(heap_area_pair_t pair);
  22 static void heap_area_pair_free_voidp(void *d);
  23 static int add_heap_area_pair(xbt_dynar_t list, int block1, int fragment1, int block2, int fragment2);
  24 static int is_new_heap_area_pair(xbt_dynar_t list, int block1, int fragment1, int block2, int fragment2);
  25 static heap_area_t new_heap_area(int block, int fragment);
  26
  27 static int compare_area(void *area1, void* area2, size_t size, xbt_dynar_t previous, int check_ignore);
  28 static void match_equals(xbt_dynar_t list, xbt_dynar_t *equals);
  29
  30 static int in_mc_comparison_ignore(int block, int fragment);
  31 static size_t heap_comparison_ignore_size(void *address);
  32 static void add_heap_equality(xbt_dynar_t *equals, void *a1, void *a2);
  33 static void remove_heap_equality(xbt_dynar_t *equals, int address, void *a);
  34
  35 static char* is_stack(void *address);
  36
  37 void mmalloc_backtrace_block_display(void* heapinfo, int block){
  38
  39   xbt_ex_t e;
  40
  41   if (((malloc_info *)heapinfo)[block].busy_block.bt_size == 0) {
  42     fprintf(stderr, "No backtrace available for that block, sorry.\n");
  43     return;
  44   }
  45
  46   memcpy(&e.bt,&(((malloc_info *)heapinfo)[block].busy_block.bt),sizeof(void*)*XBT_BACKTRACE_SIZE);
  47   e.used = ((malloc_info *)heapinfo)[block].busy_block.bt_size;
  48
  49   xbt_ex_setup_backtrace(&e);
  50   if (e.used == 0) {
  51     fprintf(stderr, "(backtrace not set)\n");
  52   } else if (e.bt_strings == NULL) {
  53     fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet");
  54   } else {
  55     int i;
  56
  57     fprintf(stderr, "Backtrace of where the block %d was malloced (%d frames):\n", block ,e.used);
  58     for (i = 0; i < e.used; i++)       /* no need to display "xbt_backtrace_display" */{
  59       fprintf(stderr, "%d ---> %s\n",i, e.bt_strings[i] + 4);
  60     }
  61   }
  62
  63 }
  64
  65 void mmalloc_backtrace_fragment_display(void* heapinfo, int block, int frag){
  66
  67   xbt_ex_t e;
  68
  69   memcpy(&e.bt,&(((malloc_info *)heapinfo)[block].busy_frag.bt[frag]),sizeof(void*)*XBT_BACKTRACE_SIZE);
  70   e.used = XBT_BACKTRACE_SIZE;
  71
  72   xbt_ex_setup_backtrace(&e);
  73   if (e.used == 0) {
  74     fprintf(stderr, "(backtrace not set)\n");
  75   } else if (e.bt_strings == NULL) {
  76     fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet");
  77   } else {
  78     int i;
  79
  80     fprintf(stderr, "Backtrace of where the fragment %d in block %d was malloced (%d frames):\n", frag, block ,e.used);
  81     for (i = 0; i < e.used; i++)       /* no need to display "xbt_backtrace_display" */{
  82       fprintf(stderr, "%d ---> %s\n",i, e.bt_strings[i] + 4);
  83     }
  84   }
  85
  86 }
  87
  88 void mmalloc_backtrace_display(void *addr){
  89
  90   size_t block, frag_nb;
  91   int type;
  92
  93   xbt_mheap_t heap = __mmalloc_current_heap ?: (xbt_mheap_t) mmalloc_preinit();
  94
  95   block = (((char*) (addr) - (char*) heap -> heapbase) / BLOCKSIZE + 1);
  96
  97   type = heap->heapinfo[block].type;
  98
  99   switch(type){
 100   case -1 : /* Free block */
 101     fprintf(stderr, "Asked to display the backtrace of a block that is free. I'm puzzled\n");
 102     xbt_abort();
 103     break;
 104   case 0: /* Large block */
 105     mmalloc_backtrace_block_display(heap->heapinfo, block);
 106     break;
 107   default: /* Fragmented block */
 108     frag_nb = RESIDUAL(addr, BLOCKSIZE) >> type;
 109     if(heap->heapinfo[block].busy_frag.frag_size[frag_nb] == -1){
 110       fprintf(stderr , "Asked to display the backtrace of a fragment that is free. I'm puzzled\n");
 111       xbt_abort();
 112     }
 113     mmalloc_backtrace_fragment_display(heap->heapinfo, block, frag_nb);
 114     break;
 115   }
 116
 117 }
 118
 119
 120 void *s_heap, *heapbase1, *heapbase2;
 121 malloc_info *heapinfo1, *heapinfo2;
 122 size_t heaplimit, heapsize1, heapsize2;
 123
 124 int ignore_done = 0;
 125
 126 int mmalloc_compare_heap(xbt_mheap_t heap1, xbt_mheap_t heap2, xbt_dynar_t *stack1, xbt_dynar_t *stack2, xbt_dynar_t *equals){
 127
 128   if(heap1 == NULL && heap1 == NULL){
 129     XBT_DEBUG("Malloc descriptors null");
 130     return 0;
 131   }
 132
 133   if(heap1->heaplimit != heap2->heaplimit){
 134     XBT_DEBUG("Different limit of valid info table indices");
 135     return 1;
 136   }
 137
 138   /* Heap information */
 139   heaplimit = ((struct mdesc *)heap1)->heaplimit;
 140
 141   s_heap = (char *)mmalloc_get_current_heap() - STD_HEAP_SIZE - getpagesize();
 142
 143   heapbase1 = (char *)heap1 + BLOCKSIZE;
 144   heapbase2 = (char *)heap2 + BLOCKSIZE;
 145
 146   heapinfo1 = (malloc_info *)((char *)heap1 + ((uintptr_t)((char *)heap1->heapinfo - (char *)s_heap)));
 147   heapinfo2 = (malloc_info *)((char *)heap2 + ((uintptr_t)((char *)heap2->heapinfo - (char *)s_heap)));
 148
 149   heapsize1 = heap1->heapsize;
 150   heapsize2 = heap2->heapsize;
 151
 152   /* Start comparison */
 153   size_t i1, i2, j1, j2, k, current_block, current_fragment;
 154   void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
 155   void *real_addr_block1, *real_addr_block2;
 156   char *stack_name;
 157   int nb_block1=0, nb_frag1=0, nb_block2=0, nb_frag2=0;
 158
 159   xbt_dynar_t previous = xbt_dynar_new(sizeof(heap_area_pair_t), heap_area_pair_free_voidp);
 160
 161   int equal, res_compare;
 162
 163   /* Init equal information */
 164   i1 = 1;
 165
 166   while(i1<=heaplimit){
 167     if(heapinfo1[i1].type == 0){
 168       if(heapinfo1[i1].busy_block.busy_size > 0)
 169         nb_block1++;
 170       heapinfo1[i1].busy_block.equal_to = NULL;
 171     }
 172     if(heapinfo1[i1].type > 0){
 173       for(j1=0; j1 < (size_t) (BLOCKSIZE >> heapinfo1[i1].type); j1++){
 174         if(heapinfo1[i1].busy_frag.frag_size[j1] > 0)
 175           nb_frag1++;
 176         heapinfo1[i1].busy_frag.equal_to[j1] = NULL;
 177       }
 178     }
 179     i1++;
 180   }
 181
 182   i2 = 1;
 183
 184   while(i2<=heaplimit){
 185     if(heapinfo2[i2].type == 0){
 186       if(heapinfo2[i2].busy_block.busy_size > 0)
 187         nb_block2++;
 188       heapinfo2[i2].busy_block.equal_to = NULL;
 189     }
 190     if(heapinfo2[i2].type > 0){
 191       for(j2=0; j2 < (size_t) (BLOCKSIZE >> heapinfo2[i2].type); j2++){
 192         if(heapinfo2[i2].busy_frag.frag_size[j2] > 0)
 193           nb_frag2++;
 194         heapinfo2[i2].busy_frag.equal_to[j2] = NULL;
 195       }
 196     }
 197     i2++;
 198   }
 199
 200   if(nb_block1 != nb_block2 || nb_frag1 != nb_frag2){
 201     XBT_DEBUG("Different number of busy blocks (%d - %d) or busy fragments (%d - %d)", nb_block1, nb_block2, nb_frag1, nb_frag2);
 202     return 1;
 203   }
 204
 205   /* Check busy blocks*/
 206
 207   i1 = 1;
 208
 209   while(i1 <= heaplimit){
 210
 211     current_block = i1;
 212
 213     if(heapinfo1[i1].type == -1){ /* Free block */
 214       i1++;
 215       continue;
 216     }
 217
 218     addr_block1 = ((void*) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE + (char*)heapbase1));
 219     real_addr_block1 = (char*)((xbt_mheap_t)s_heap)->heapbase + (((char *)addr_block1) - (char *)heapbase1);
 220
 221     if(heapinfo1[i1].type == 0){  /* Large block */
 222
 223       if((stack_name = is_stack(real_addr_block1)) != NULL){
 224         stack_region_t stack = xbt_new0(s_stack_region_t, 1);
 225         stack->address = addr_block1;
 226         stack->process_name = strdup(stack_name);
 227         stack->size = heapinfo1[i1].busy_block.busy_size;
 228         xbt_dynar_push(*stack1, &stack);
 229       }
 230
 231       if(heapinfo1[i1].busy_block.busy_size == 0){
 232         i1++;
 233         continue;
 234       }
 235
 236       if(heapinfo1[i1].busy_block.equal_to != NULL){
 237         i1++;
 238         continue;
 239       }
 240
 241       i2 = 1;
 242       equal = 0;
 243
 244       /* Try first to associate to same block in the other heap */
 245       if(heapinfo2[current_block].type == heapinfo1[current_block].type){
 246
 247         if(heapinfo2[current_block].busy_block.equal_to == NULL){
 248
 249           if(heapinfo1[current_block].busy_block.busy_size == heapinfo2[current_block].busy_block.busy_size){
 250
 251             addr_block2 = ((void*) (((ADDR2UINT(current_block)) - 1) * BLOCKSIZE + (char*)heapbase2));
 252             real_addr_block2 = (char*)((xbt_mheap_t)s_heap)->heapbase + (((char *)addr_block2) - (char *)heapbase2);
 253
 254             if((stack_name = is_stack(real_addr_block2)) != NULL){
 255               stack_region_t stack = xbt_new0(s_stack_region_t, 1);
 256               stack->address = addr_block2;
 257               stack->process_name = strdup(stack_name);
 258               stack->size = heapinfo2[current_block].busy_block.busy_size;
 259               xbt_dynar_push(*stack2, &stack);
 260             }
 261
 262             add_heap_area_pair(previous, current_block, -1, current_block, -1);
 263
 264             if(ignore_done < xbt_dynar_length(mc_heap_comparison_ignore)){
 265               if(in_mc_comparison_ignore((int)current_block, -1))
 266                 res_compare = compare_area(addr_block1, addr_block2, heapinfo1[current_block].busy_block.busy_size, previous, 1);
 267               else
 268                 res_compare = compare_area(addr_block1, addr_block2, heapinfo1[current_block].busy_block.busy_size, previous, 0);
 269             }else{
 270               res_compare = compare_area(addr_block1, addr_block2, heapinfo1[current_block].busy_block.busy_size, previous, 0);
 271             }
 272
 273             if(res_compare == 0){
 274               for(k=1; k < heapinfo2[current_block].busy_block.size; k++)
 275                 heapinfo2[current_block+k].busy_block.equal_to = new_heap_area(i1, -1);
 276               for(k=1; k < heapinfo1[current_block].busy_block.size; k++)
 277                 heapinfo1[current_block+k].busy_block.equal_to = new_heap_area(i1, -1);
 278               equal = 1;
 279               match_equals(previous, equals);
 280               i1 = i1 + heapinfo1[current_block].busy_block.size;
 281             }
 282
 283             xbt_dynar_reset(previous);
 284
 285           }
 286
 287         }
 288
 289       }
 290
 291       while(i2 <= heaplimit && !equal){
 292
 293         addr_block2 = ((void*) (((ADDR2UINT(i2)) - 1) * BLOCKSIZE + (char*)heapbase2));
 294         real_addr_block2 = (char*)((xbt_mheap_t)s_heap)->heapbase + (((char *)addr_block2) - (char *)heapbase2);
 295
 296         if((stack_name = is_stack(real_addr_block2)) != NULL){
 297           stack_region_t stack = xbt_new0(s_stack_region_t, 1);
 298           stack->address = addr_block2;
 299           stack->process_name = strdup(stack_name);
 300           stack->size = heapinfo2[i2].busy_block.busy_size;
 301           xbt_dynar_push(*stack2, &stack);
 302         }
 303
 304         if(i2 == current_block){
 305           i2++;
 306           continue;
 307         }
 308
 309         if(heapinfo2[i2].type != 0){
 310           i2++;
 311           continue;
 312         }
 313
 314         if(heapinfo2[i2].busy_block.equal_to != NULL){
 315           i2++;
 316           continue;
 317         }
 318
 319         if(heapinfo1[i1].busy_block.size != heapinfo2[i2].busy_block.size){
 320           i2++;
 321           continue;
 322         }
 323
 324         if(heapinfo1[i1].busy_block.busy_size != heapinfo2[i2].busy_block.busy_size){
 325           i2++;
 326           continue;
 327         }
 328
 329         /* Comparison */
 330         add_heap_area_pair(previous, i1, -1, i2, -1);
 331
 332         if(ignore_done < xbt_dynar_length(mc_heap_comparison_ignore)){
 333           if(in_mc_comparison_ignore((int)i1, -1))
 334             res_compare = compare_area(addr_block1, addr_block2, heapinfo1[i1].busy_block.busy_size, previous, 1);
 335           else
 336             res_compare = compare_area(addr_block1, addr_block2, heapinfo1[i1].busy_block.busy_size, previous, 0);
 337         }else{
 338           res_compare = compare_area(addr_block1, addr_block2, heapinfo1[i1].busy_block.busy_size, previous, 0);
 339         }
 340
 341         if(res_compare == 0){
 342           for(k=1; k < heapinfo2[i2].busy_block.size; k++)
 343             heapinfo2[i2+k].busy_block.equal_to = new_heap_area(i1, -1);
 344           for(k=1; k < heapinfo1[i1].busy_block.size; k++)
 345             heapinfo1[i1+k].busy_block.equal_to = new_heap_area(i2, -1);
 346           equal = 1;
 347           match_equals(previous, equals);
 348           i1 = i1 + heapinfo1[i1].busy_block.size;
 349         }
 350
 351         xbt_dynar_reset(previous);
 352
 353         i2++;
 354
 355       }
 356
 357       if(!equal)
 358         i1++;
 359
 360     }else{ /* Fragmented block */
 361
 362       for(j1=0; j1 < (size_t) (BLOCKSIZE >> heapinfo1[i1].type); j1++){
 363
 364         current_fragment = j1;
 365
 366         if(heapinfo1[i1].busy_frag.frag_size[j1] == -1) /* Free fragment */
 367           continue;
 368
 369         if(heapinfo1[i1].busy_frag.equal_to[j1] != NULL)
 370           continue;
 371
 372         addr_frag1 = (void*) ((char *)addr_block1 + (j1 << heapinfo1[i1].type));
 373
 374         i2 = 1;
 375         equal = 0;
 376
 377         /* Try first to associate to same fragment in the other heap */
 378         if(heapinfo2[current_block].type == heapinfo1[current_block].type){
 379
 380           if(heapinfo2[current_block].busy_frag.equal_to[current_fragment] == NULL){
 381
 382               if(heapinfo1[current_block].busy_frag.frag_size[current_fragment] == heapinfo2[current_block].busy_frag.frag_size[current_fragment]){
 383
 384                 addr_block2 = ((void*) (((ADDR2UINT(current_block)) - 1) * BLOCKSIZE + (char*)heapbase2));
 385                 addr_frag2 = (void*) ((char *)addr_block2 + (current_fragment << heapinfo2[current_block].type));
 386
 387                 add_heap_area_pair(previous, current_block, current_fragment, current_block, current_fragment);
 388
 389                 if(ignore_done < xbt_dynar_length(mc_heap_comparison_ignore)){
 390                   if(in_mc_comparison_ignore((int)current_block, (int)current_fragment))
 391                     res_compare = compare_area(addr_frag1, addr_frag2, heapinfo1[current_block].busy_frag.frag_size[current_fragment], previous, 1);
 392                   else
 393                     res_compare = compare_area(addr_frag1, addr_frag2, heapinfo1[current_block].busy_frag.frag_size[current_fragment], previous, 0);
 394                 }else{
 395                   res_compare = compare_area(addr_frag1, addr_frag2, heapinfo1[current_block].busy_frag.frag_size[current_fragment], previous, 0);
 396                 }
 397
 398                 if(res_compare == 0){
 399                   equal = 1;
 400                   match_equals(previous, equals);
 401                 }
 402
 403                 xbt_dynar_reset(previous);
 404
 405               }
 406
 407             }
 408
 409         }
 410
 411         while(i2 <= heaplimit && !equal){
 412
 413
 414           if(heapinfo2[i2].type <= 0){
 415             i2++;
 416             continue;
 417           }
 418
 419           for(j2=0; j2 < (size_t) (BLOCKSIZE >> heapinfo2[i2].type); j2++){
 420
 421             if(heapinfo2[i2].type == heapinfo1[i1].type && i2 == current_block && j2 == current_fragment)
 422               continue;
 423
 424             if(heapinfo2[i2].busy_frag.equal_to[j2] != NULL)
 425               continue;
 426
 427             if(heapinfo1[i1].busy_frag.frag_size[j1] != heapinfo2[i2].busy_frag.frag_size[j2]) /* Different size_used */
 428               continue;
 429
 430             addr_block2 = ((void*) (((ADDR2UINT(i2)) - 1) * BLOCKSIZE + (char*)heapbase2));
 431             addr_frag2 = (void*) ((char *)addr_block2 + (j2 << heapinfo2[i2].type));
 432
 433             /* Comparison */
 434             add_heap_area_pair(previous, i1, j1, i2, j2);
 435
 436             if(ignore_done < xbt_dynar_length(mc_heap_comparison_ignore)){
 437               if(in_mc_comparison_ignore((int)i1, (int)j1))
 438                 res_compare = compare_area(addr_frag1, addr_frag2, heapinfo1[i1].busy_frag.frag_size[j1], previous, 1);
 439               else
 440                 res_compare = compare_area(addr_frag1, addr_frag2, heapinfo1[i1].busy_frag.frag_size[j1], previous, 0);
 441             }else{
 442               res_compare = compare_area(addr_frag1, addr_frag2, heapinfo1[i1].busy_frag.frag_size[j1], previous, 0);
 443             }
 444
 445             if(res_compare == 0){
 446               equal = 1;
 447               match_equals(previous, equals);
 448               break;
 449             }
 450
 451             xbt_dynar_reset(previous);
 452
 453           }
 454
 455           i2++;
 456
 457         }
 458
 459       }
 460
 461       i1++;
 462
 463     }
 464
 465   }
 466
 467   /* All blocks/fragments are equal to another block/fragment ? */
 468   size_t i = 1, j = 0;
 469   int nb_diff1 = 0, nb_diff2 = 0;
 470
 471   while(i<heaplimit){
 472     if(heapinfo1[i].type == 0){
 473       if(heapinfo1[i].busy_block.busy_size > 0){
 474         if(heapinfo1[i].busy_block.equal_to == NULL){
 475           if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
 476             addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase1));
 477             XBT_DEBUG("Block %zu (%p) not found (size used = %zu)", i, addr_block1, heapinfo1[i].busy_block.busy_size);
 478             mmalloc_backtrace_block_display((void*)heapinfo1, i);
 479           }
 480           nb_diff1++;
 481         }else{
 482           xbt_free(heapinfo1[i].busy_block.equal_to);
 483         }
 484       }
 485     }
 486     if(heapinfo1[i].type > 0){
 487       addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase1));
 488       for(j=0; j < (size_t) (BLOCKSIZE >> heapinfo1[i].type); j++){
 489         if(heapinfo1[i].busy_frag.frag_size[j] > 0){
 490           if(heapinfo1[i].busy_frag.equal_to[j] == NULL){
 491             if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
 492               addr_frag1 = (void*) ((char *)addr_block1 + (j << heapinfo1[i].type));
 493               XBT_DEBUG("Block %zu, Fragment %zu (%p) not found (size used = %d)", i, j, addr_frag1, heapinfo1[i].busy_frag.frag_size[j]);
 494               mmalloc_backtrace_fragment_display((void*)heapinfo1, i, j);
 495             }
 496             nb_diff1++;
 497           }else{
 498             xbt_free(heapinfo1[i].busy_frag.equal_to[j]);
 499           }
 500         }
 501       }
 502     }
 503
 504     i++;
 505   }
 506
 507   XBT_DEBUG("Different blocks or fragments in heap1 : %d", nb_diff1);
 508
 509   i = 1;
 510
 511   while(i<heaplimit){
 512     if(heapinfo2[i].type == 0){
 513       if(heapinfo2[i].busy_block.busy_size > 0){
 514         if(heapinfo2[i].busy_block.equal_to == NULL){
 515           if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
 516             addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase2));
 517             XBT_DEBUG("Block %zu (%p) not found (size used = %zu)", i, addr_block2, heapinfo2[i].busy_block.busy_size);
 518             mmalloc_backtrace_block_display((void*)heapinfo2, i);
 519           }
 520           nb_diff2++;
 521         }else{
 522           xbt_free(heapinfo2[i].busy_block.equal_to);
 523         }
 524       }
 525     }
 526     if(heapinfo2[i].type > 0){
 527       addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase2));
 528       for(j=0; j < (size_t) (BLOCKSIZE >> heapinfo2[i].type); j++){
 529         if(heapinfo2[i].busy_frag.frag_size[j] > 0){
 530           if(heapinfo2[i].busy_frag.equal_to[j] == NULL){
 531             if(XBT_LOG_ISENABLED(mm_diff, xbt_log_priority_debug)){
 532               addr_frag2 = (void*) ((char *)addr_block2 + (j << heapinfo2[i].type));
 533               XBT_DEBUG( "Block %zu, Fragment %zu (%p) not found (size used = %d)", i, j, addr_frag2, heapinfo2[i].busy_frag.frag_size[j]);
 534               mmalloc_backtrace_fragment_display((void*)heapinfo2, i, j);
 535             }
 536             nb_diff2++;
 537           }else{
 538             xbt_free(heapinfo2[i].busy_frag.equal_to[j]);
 539           }
 540         }
 541       }
 542     }
 543     i++;
 544   }
 545
 546   XBT_DEBUG("Different blocks or fragments in heap2 : %d", nb_diff2);
 547
 548   xbt_dynar_free(&previous);
 549   ignore_done = 0;
 550
 551   return ((nb_diff1 > 0) || (nb_diff2 > 0));
 552
 553 }
 554
 555 static heap_area_t new_heap_area(int block, int fragment){
 556   heap_area_t area = NULL;
 557   area = xbt_new0(s_heap_area_t, 1);
 558   area->block = block;
 559   area->fragment = fragment;
 560   return area;
 561 }
 562
 563 static int in_mc_comparison_ignore(int block, int fragment){
 564
 565   unsigned int cursor = 0;
 566   int start = 0;
 567   int end = xbt_dynar_length(mc_heap_comparison_ignore) - 1;
 568   mc_heap_ignore_region_t region;
 569
 570   while(start <= end){
 571     cursor = (start + end) / 2;
 572     region = (mc_heap_ignore_region_t)xbt_dynar_get_as(mc_heap_comparison_ignore, cursor, mc_heap_ignore_region_t);
 573     if(region->block == block){
 574       if(region->fragment == fragment)
 575         return 1;
 576       if(region->fragment < fragment)
 577         start = cursor + 1;
 578       if(region->fragment > fragment)
 579         end = cursor - 1;
 580     }
 581     if(region->block < block)
 582       start = cursor + 1;
 583     if(region->block > block)
 584       end = cursor - 1;
 585   }
 586
 587   return 0;
 588 }
 589
 590 static size_t heap_comparison_ignore_size(void *address){
 591   unsigned int cursor = 0;
 592   int start = 0;
 593   int end = xbt_dynar_length(mc_heap_comparison_ignore) - 1;
 594   mc_heap_ignore_region_t region;
 595
 596   while(start <= end){
 597     cursor = (start + end) / 2;
 598     region = (mc_heap_ignore_region_t)xbt_dynar_get_as(mc_heap_comparison_ignore, cursor, mc_heap_ignore_region_t);
 599     if(region->address == address)
 600       return region->size;
 601     if(region->address < address)
 602       start = cursor + 1;
 603     if(region->address > address)
 604       end = cursor - 1;
 605   }
 606
 607   return 0;
 608 }
 609
 610
 611 static int compare_area(void *area1, void* area2, size_t size, xbt_dynar_t previous, int check_ignore){
 612
 613   size_t i = 0, pointer_align = 0, ignore1 = 0, ignore2 = 0;
 614   void *address_pointed1, *address_pointed2, *addr_block_pointed1, *addr_block_pointed2, *addr_frag_pointed1, *addr_frag_pointed2;
 615   size_t block_pointed1, block_pointed2, frag_pointed1, frag_pointed2;
 616   int res_compare;
 617   void *current_area1, *current_area2;
 618
 619   while(i<size){
 620
 621     if(check_ignore){
 622
 623       current_area1 = (char*)((xbt_mheap_t)s_heap)->heapbase + ((((char *)area1) + i) - (char *)heapbase1);
 624       if((ignore1 = heap_comparison_ignore_size(current_area1)) > 0){
 625         current_area2 = (char*)((xbt_mheap_t)s_heap)->heapbase + ((((char *)area2) + i) - (char *)heapbase2);
 626         if((ignore2 = heap_comparison_ignore_size(current_area2))  == ignore1){
 627           i = i + ignore2;
 628           ignore_done++;
 629           continue;
 630         }
 631       }
 632
 633     }
 634
 635     if(memcmp(((char *)area1) + i, ((char *)area2) + i, 1) != 0){
 636
 637       /* Check pointer difference */
 638       pointer_align = (i / sizeof(void*)) * sizeof(void*);
 639       address_pointed1 = *((void **)((char *)area1 + pointer_align));
 640       address_pointed2 = *((void **)((char *)area2 + pointer_align));
 641
 642       /* Get pointed blocks number */
 643       block_pointed1 = ((char*)address_pointed1 - (char*)((xbt_mheap_t)s_heap)->heapbase) / BLOCKSIZE + 1;
 644       block_pointed2 = ((char*)address_pointed2 - (char*)((xbt_mheap_t)s_heap)->heapbase) / BLOCKSIZE + 1;
 645
 646       /* Check if valid blocks number */
 647       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)
 648         return 1;
 649
 650       if(heapinfo1[block_pointed1].type == heapinfo2[block_pointed2].type){ /* Same type of block (large or fragmented) */
 651
 652         addr_block_pointed1 = ((void*) (((ADDR2UINT(block_pointed1)) - 1) * BLOCKSIZE + (char*)heapbase1));
 653         addr_block_pointed2 = ((void*) (((ADDR2UINT(block_pointed2)) - 1) * BLOCKSIZE + (char*)heapbase2));
 654
 655         if(heapinfo1[block_pointed1].type == 0){ /* Large block */
 656
 657           if(heapinfo1[block_pointed1].busy_block.size != heapinfo2[block_pointed2].busy_block.size){
 658             return 1;
 659           }
 660
 661           if(heapinfo1[block_pointed1].busy_block.busy_size != heapinfo2[block_pointed2].busy_block.busy_size){
 662             return 1;
 663           }
 664
 665           if(add_heap_area_pair(previous, block_pointed1, -1, block_pointed2, -1)){
 666
 667             if(ignore_done < xbt_dynar_length(mc_heap_comparison_ignore)){
 668               if(in_mc_comparison_ignore(block_pointed1, -1))
 669                 res_compare = compare_area(addr_block_pointed1, addr_block_pointed2, heapinfo1[block_pointed1].busy_block.busy_size, previous, 1);
 670               else
 671                 res_compare = compare_area(addr_block_pointed1, addr_block_pointed2, heapinfo1[block_pointed1].busy_block.busy_size, previous, 0);
 672             }else{
 673               res_compare = compare_area(addr_block_pointed1, addr_block_pointed2, heapinfo1[block_pointed1].busy_block.busy_size, previous, 0);
 674             }
 675
 676             if(res_compare == 1)
 677               return 1;
 678
 679           }
 680
 681         }else{ /* Fragmented block */
 682
 683           /* Get pointed fragments number */
 684           frag_pointed1 = ((uintptr_t) (ADDR2UINT (address_pointed1) % (BLOCKSIZE))) >> heapinfo1[block_pointed1].type;
 685           frag_pointed2 = ((uintptr_t) (ADDR2UINT (address_pointed2) % (BLOCKSIZE))) >> heapinfo2[block_pointed2].type;
 686
 687           if(heapinfo1[block_pointed1].busy_frag.frag_size[frag_pointed1] != heapinfo2[block_pointed2].busy_frag.frag_size[frag_pointed2]) /* Different size_used */
 688             return 1;
 689
 690           addr_frag_pointed1 = (void*) ((char *)addr_block_pointed1 + (frag_pointed1 << heapinfo1[block_pointed1].type));
 691           addr_frag_pointed2 = (void*) ((char *)addr_block_pointed2 + (frag_pointed2 << heapinfo2[block_pointed2].type));
 692
 693           if(add_heap_area_pair(previous, block_pointed1, frag_pointed1, block_pointed2, frag_pointed2)){
 694
 695             if(ignore_done < xbt_dynar_length(mc_heap_comparison_ignore)){
 696               if(in_mc_comparison_ignore(block_pointed1, frag_pointed1))
 697                 res_compare = compare_area(addr_frag_pointed1, addr_frag_pointed2, heapinfo1[block_pointed1].busy_frag.frag_size[frag_pointed1], previous, 1);
 698               else
 699                 res_compare = compare_area(addr_frag_pointed1, addr_frag_pointed2, heapinfo1[block_pointed1].busy_frag.frag_size[frag_pointed1], previous, 0);
 700             }else{
 701               res_compare = compare_area(addr_frag_pointed1, addr_frag_pointed2, heapinfo1[block_pointed1].busy_frag.frag_size[frag_pointed1], previous, 0);
 702             }
 703
 704             if(res_compare == 1)
 705               return 1;
 706
 707           }
 708
 709         }
 710
 711       }else{
 712
 713         if((heapinfo1[block_pointed1].type > 0) && (heapinfo2[block_pointed2].type > 0)){
 714
 715           addr_block_pointed1 = ((void*) (((ADDR2UINT(block_pointed1)) - 1) * BLOCKSIZE + (char*)heapbase1));
 716           addr_block_pointed2 = ((void*) (((ADDR2UINT(block_pointed2)) - 1) * BLOCKSIZE + (char*)heapbase2));
 717
 718           frag_pointed1 = ((uintptr_t) (ADDR2UINT (address_pointed1) % (BLOCKSIZE))) >> heapinfo1[block_pointed1].type;
 719           frag_pointed2 = ((uintptr_t) (ADDR2UINT (address_pointed2) % (BLOCKSIZE))) >> heapinfo2[block_pointed2].type;
 720
 721           if(heapinfo1[block_pointed1].busy_frag.frag_size[frag_pointed1] != heapinfo2[block_pointed2].busy_frag.frag_size[frag_pointed2]) /* Different size_used */
 722             return 1;
 723
 724           addr_frag_pointed1 = (void*) ((char *)addr_block_pointed1 + (frag_pointed1 << heapinfo1[block_pointed1].type));
 725           addr_frag_pointed2 = (void*) ((char *)addr_block_pointed2 + (frag_pointed2 << heapinfo2[block_pointed2].type));
 726
 727           if(add_heap_area_pair(previous, block_pointed1, frag_pointed1, block_pointed2, frag_pointed2)){
 728
 729             if(ignore_done < xbt_dynar_length(mc_heap_comparison_ignore)){
 730               if(in_mc_comparison_ignore(block_pointed1, frag_pointed1))
 731                 res_compare = compare_area(addr_frag_pointed1, addr_frag_pointed2, heapinfo1[block_pointed1].busy_frag.frag_size[frag_pointed1], previous, 1);
 732               else
 733                 res_compare = compare_area(addr_frag_pointed1, addr_frag_pointed2, heapinfo1[block_pointed1].busy_frag.frag_size[frag_pointed1], previous, 0);
 734             }else{
 735               res_compare = compare_area(addr_frag_pointed1, addr_frag_pointed2, heapinfo1[block_pointed1].busy_frag.frag_size[frag_pointed1], previous, 0);
 736             }
 737
 738             if(res_compare == 1)
 739               return 1;
 740
 741           }
 742
 743         }else{
 744           return 1;
 745         }
 746
 747       }
 748
 749       i = pointer_align + sizeof(void *);
 750
 751     }else{
 752
 753       i++;
 754
 755     }
 756   }
 757
 758   return 0;
 759
 760
 761 }
 762
 763 static void heap_area_pair_free(heap_area_pair_t pair){
 764   if (pair){
 765     free(pair);
 766     pair = NULL;
 767   }
 768 }
 769
 770 static void heap_area_pair_free_voidp(void *d)
 771 {
 772   heap_area_pair_free((heap_area_pair_t) * (void **) d);
 773 }
 774
 775 static int add_heap_area_pair(xbt_dynar_t list, int block1, int fragment1, int block2, int fragment2){
 776
 777   if(is_new_heap_area_pair(list, block1, fragment1, block2, fragment2)){
 778     heap_area_pair_t pair = NULL;
 779     pair = xbt_new0(s_heap_area_pair_t, 1);
 780     pair->block1 = block1;
 781     pair->fragment1 = fragment1;
 782     pair->block2 = block2;
 783     pair->fragment2 = fragment2;
 784
 785     xbt_dynar_push(list, &pair);
 786
 787     return 1;
 788   }
 789
 790   return 0;
 791 }
 792
 793 static int is_new_heap_area_pair(xbt_dynar_t list, int block1, int fragment1, int block2, int fragment2){
 794
 795   unsigned int cursor = 0;
 796   heap_area_pair_t current_pair;
 797
 798   xbt_dynar_foreach(list, cursor, current_pair){
 799     if(current_pair->block1 == block1 && current_pair->block2 == block2 && current_pair->fragment1 == fragment1 && current_pair->fragment2 == fragment2)
 800       return 0;
 801   }
 802
 803   return 1;
 804 }
 805
 806 static void match_equals(xbt_dynar_t list, xbt_dynar_t *equals){
 807
 808   unsigned int cursor = 0;
 809   heap_area_pair_t current_pair;
 810   heap_area_t previous_area;
 811
 812   void *real_addr_block1, *real_addr_block2, *real_addr_frag1, *real_addr_frag2;
 813
 814   xbt_dynar_foreach(list, cursor, current_pair){
 815
 816     if(current_pair->fragment1 != -1){
 817
 818       real_addr_block1 = ((void*) (((ADDR2UINT((size_t)current_pair->block1)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)s_heap)->heapbase));
 819       real_addr_frag1 = (void*) ((char *)real_addr_block1 + (current_pair->fragment1 << heapinfo1[current_pair->block1].type));
 820       real_addr_block2 = ((void*) (((ADDR2UINT((size_t)current_pair->block2)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)s_heap)->heapbase));
 821       real_addr_frag2 = (void*) ((char *)real_addr_block2 + (current_pair->fragment2 << heapinfo2[current_pair->block2].type));
 822
 823       if(heapinfo1[current_pair->block1].busy_frag.equal_to[current_pair->fragment1] != NULL){
 824         remove_heap_equality(equals, 1, real_addr_frag1);
 825         previous_area = heapinfo1[current_pair->block1].busy_frag.equal_to[current_pair->fragment1];
 826         xbt_free( heapinfo2[previous_area->block].busy_frag.equal_to[previous_area->fragment]);
 827         heapinfo2[previous_area->block].busy_frag.equal_to[previous_area->fragment] = NULL;
 828         xbt_free(heapinfo1[current_pair->block1].busy_frag.equal_to[current_pair->fragment1]);
 829       }
 830       if(heapinfo2[current_pair->block2].busy_frag.equal_to[current_pair->fragment2] != NULL){
 831         remove_heap_equality(equals, 2, real_addr_frag2);
 832         previous_area = heapinfo2[current_pair->block2].busy_frag.equal_to[current_pair->fragment2];
 833         xbt_free(heapinfo1[previous_area->block].busy_frag.equal_to[previous_area->fragment]);
 834         heapinfo1[previous_area->block].busy_frag.equal_to[previous_area->fragment] = NULL;
 835         xbt_free(heapinfo2[current_pair->block2].busy_frag.equal_to[current_pair->fragment2]);
 836       }
 837
 838       if(real_addr_frag1 != real_addr_frag2)
 839         add_heap_equality(equals, real_addr_frag1, real_addr_frag2);
 840
 841       heapinfo1[current_pair->block1].busy_frag.equal_to[current_pair->fragment1] = new_heap_area(current_pair->block2, current_pair->fragment2);
 842       heapinfo2[current_pair->block2].busy_frag.equal_to[current_pair->fragment2] = new_heap_area(current_pair->block1, current_pair->fragment1);
 843
 844     }else{
 845
 846       real_addr_block1 = ((void*) (((ADDR2UINT((size_t)current_pair->block1)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)s_heap)->heapbase));
 847       real_addr_block2 = ((void*) (((ADDR2UINT((size_t)current_pair->block2)) - 1) * BLOCKSIZE + (char*)((xbt_mheap_t)s_heap)->heapbase));
 848
 849       if(heapinfo1[current_pair->block1].busy_block.equal_to != NULL){
 850         remove_heap_equality(equals, 1, real_addr_block1);
 851         previous_area = heapinfo1[current_pair->block1].busy_block.equal_to;
 852         xbt_free(heapinfo2[previous_area->block].busy_block.equal_to);
 853         heapinfo2[previous_area->block].busy_block.equal_to = NULL;
 854         xbt_free(heapinfo1[current_pair->block1].busy_block.equal_to);
 855       }
 856       if(heapinfo2[current_pair->block2].busy_block.equal_to != NULL){
 857         remove_heap_equality(equals, 2, real_addr_block2);
 858         previous_area = heapinfo2[current_pair->block2].busy_block.equal_to;
 859         xbt_free(heapinfo1[previous_area->block].busy_block.equal_to);
 860         heapinfo1[previous_area->block].busy_block.equal_to = NULL;
 861         xbt_free(heapinfo2[current_pair->block2].busy_block.equal_to);
 862       }
 863
 864       if(real_addr_block1 != real_addr_block2)
 865         add_heap_equality(equals, real_addr_block1, real_addr_block2);
 866
 867       heapinfo1[current_pair->block1].busy_block.equal_to = new_heap_area(current_pair->block2, current_pair->fragment2);
 868       heapinfo2[current_pair->block2].busy_block.equal_to = new_heap_area(current_pair->block1, current_pair->fragment1);
 869
 870     }
 871   }
 872
 873
 874 }
 875
 876 #ifndef max
 877 #define max( a, b ) ( ((a) > (b)) ? (a) : (b) )
 878 #endif
 879
 880 int mmalloc_linear_compare_heap(xbt_mheap_t heap1, xbt_mheap_t heap2){
 881
 882   if(heap1 == NULL && heap1 == NULL){
 883     XBT_DEBUG("Malloc descriptors null");
 884     return 0;
 885   }
 886
 887   if(heap1->heaplimit != heap2->heaplimit){
 888     XBT_DEBUG("Different limit of valid info table indices");
 889     return 1;
 890   }
 891
 892   /* Heap information */
 893   heaplimit = ((struct mdesc *)heap1)->heaplimit;
 894
 895   s_heap = (char *)mmalloc_get_current_heap() - STD_HEAP_SIZE - getpagesize();
 896
 897   heapbase1 = (char *)heap1 + BLOCKSIZE;
 898   heapbase2 = (char *)heap2 + BLOCKSIZE;
 899
 900   heapinfo1 = (malloc_info *)((char *)heap1 + ((uintptr_t)((char *)heap1->heapinfo - (char *)s_heap)));
 901   heapinfo2 = (malloc_info *)((char *)heap2 + ((uintptr_t)((char *)heap2->heapinfo - (char *)s_heap)));
 902
 903   heapsize1 = heap1->heapsize;
 904   heapsize2 = heap2->heapsize;
 905
 906   /* Start comparison */
 907   size_t i, j, k;
 908   void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
 909
 910   int distance = 0;
 911
 912   /* Check busy blocks*/
 913
 914   i = 1;
 915
 916   while(i <= heaplimit){
 917
 918     addr_block1 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase1));
 919     addr_block2 = ((void*) (((ADDR2UINT(i)) - 1) * BLOCKSIZE + (char*)heapbase2));
 920
 921     if(heapinfo1[i].type != heapinfo2[i].type){
 922
 923       distance += BLOCKSIZE;
 924       XBT_DEBUG("Different type of blocks (%zu) : %d - %d -> distance = %d", i, heapinfo1[i].type, heapinfo2[i].type, distance);
 925       i++;
 926
 927     }else{
 928
 929       if(heapinfo1[i].type == -1){ /* Free block */
 930         i++;
 931         continue;
 932       }
 933
 934       if(heapinfo1[i].type == 0){ /* Large block */
 935
 936         if(heapinfo1[i].busy_block.size != heapinfo2[i].busy_block.size){
 937           distance += BLOCKSIZE * max(heapinfo1[i].busy_block.size, heapinfo2[i].busy_block.size);
 938           i += max(heapinfo1[i].busy_block.size, heapinfo2[i].busy_block.size);
 939           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);
 940           continue;
 941         }
 942
 943         /*if(heapinfo1[i].busy_block.busy_size != heapinfo2[i].busy_block.busy_size){
 944           distance += max(heapinfo1[i].busy_block.busy_size, heapinfo2[i].busy_block.busy_size);
 945           i += max(heapinfo1[i].busy_block.size, heapinfo2[i].busy_block.size);
 946           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);
 947           continue;
 948           }*/
 949
 950         k = 0;
 951
 952         //while(k < (heapinfo1[i].busy_block.busy_size)){
 953         while(k < heapinfo1[i].busy_block.size * BLOCKSIZE){
 954           if(memcmp((char *)addr_block1 + k, (char *)addr_block2 + k, 1) != 0){
 955             distance ++;
 956           }
 957           k++;
 958         }
 959
 960         i++;
 961
 962       }else { /* Fragmented block */
 963
 964         for(j=0; j < (size_t) (BLOCKSIZE >> heapinfo1[i].type); j++){
 965
 966           addr_frag1 = (void*) ((char *)addr_block1 + (j << heapinfo1[i].type));
 967           addr_frag2 = (void*) ((char *)addr_block2 + (j << heapinfo2[i].type));
 968
 969           if(heapinfo1[i].busy_frag.frag_size[j] == 0 && heapinfo2[i].busy_frag.frag_size[j] == 0){
 970             continue;
 971           }
 972
 973
 974           /*if(heapinfo1[i].busy_frag.frag_size[j] != heapinfo2[i].busy_frag.frag_size[j]){
 975             distance += max(heapinfo1[i].busy_frag.frag_size[j], heapinfo2[i].busy_frag.frag_size[j]);
 976             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);
 977             continue;
 978             }*/
 979
 980           k=0;
 981
 982           //while(k < max(heapinfo1[i].busy_frag.frag_size[j], heapinfo2[i].busy_frag.frag_size[j])){
 983           while(k < (BLOCKSIZE / (BLOCKSIZE >> heapinfo1[i].type))){
 984             if(memcmp((char *)addr_frag1 + k, (char *)addr_frag2 + k, 1) != 0){
 985               distance ++;
 986             }
 987             k++;
 988           }
 989
 990         }
 991
 992         i++;
 993
 994       }
 995
 996     }
 997
 998   }
 999
1000   return distance;
1001
1002 }
1003
1004 static char * is_stack(void *address){
1005   unsigned int cursor = 0;
1006   stack_region_t stack;
1007
1008   xbt_dynar_foreach(stacks_areas, cursor, stack){
1009     if(address == stack->address)
1010       return stack->process_name;
1011   }
1012
1013   return NULL;
1014 }
1015
1016 static void add_heap_equality(xbt_dynar_t *equals, void *a1, void *a2){
1017
1018   if(xbt_dynar_is_empty(*equals)){
1019
1020     heap_equality_t he = xbt_new0(s_heap_equality_t, 1);
1021     he->address1 = a1;
1022     he->address2 = a2;
1023
1024     xbt_dynar_insert_at(*equals, 0, &he);
1025
1026   }else{
1027
1028     unsigned int cursor = 0;
1029     int start = 0;
1030     int end = xbt_dynar_length(*equals) - 1;
1031     heap_equality_t current_equality = NULL;
1032
1033     while(start <= end){
1034       cursor = (start + end) / 2;
1035       current_equality = (heap_equality_t)xbt_dynar_get_as(*equals, cursor, heap_equality_t);
1036       if(current_equality->address1 == a1){
1037         if(current_equality->address2 == a2)
1038           return;
1039         if(current_equality->address2 < a2)
1040           start = cursor + 1;
1041         if(current_equality->address2 > a2)
1042           end = cursor - 1;
1043       }
1044       if(current_equality->address1 < a1)
1045         start = cursor + 1;
1046       if(current_equality->address1 > a1)
1047         end = cursor - 1;
1048     }
1049
1050     heap_equality_t he = xbt_new0(s_heap_equality_t, 1);
1051     he->address1 = a1;
1052     he->address2 = a2;
1053
1054     if(current_equality->address1 < a1)
1055       xbt_dynar_insert_at(*equals, cursor + 1 , &he);
1056     else
1057        xbt_dynar_insert_at(*equals, cursor, &he);
1058
1059   }
1060
1061 }
1062
1063 static void remove_heap_equality(xbt_dynar_t *equals, int address, void *a){
1064
1065   unsigned int cursor = 0;
1066   heap_equality_t current_equality;
1067   int found = 0;
1068
1069   if(address == 1){
1070
1071     int start = 0;
1072     int end = xbt_dynar_length(*equals) - 1;
1073
1074
1075     while(start <= end && found == 0){
1076       cursor = (start + end) / 2;
1077       current_equality = (heap_equality_t)xbt_dynar_get_as(*equals, cursor, heap_equality_t);
1078       if(current_equality->address1 == a)
1079         found = 1;
1080       if(current_equality->address1 < a)
1081         start = cursor + 1;
1082       if(current_equality->address1 > a)
1083         end = cursor - 1;
1084     }
1085
1086     if(found == 1)
1087       xbt_dynar_remove_at(*equals, cursor, NULL);
1088
1089   }else{
1090
1091     xbt_dynar_foreach(*equals, cursor, current_equality){
1092       if(current_equality->address2 == a){
1093         found = 1;
1094         break;
1095       }
1096     }
1097
1098     if(found == 1)
1099       xbt_dynar_remove_at(*equals, cursor, NULL);
1100
1101   }
1102
1103
1104 }
1105
1106 int is_free_area(void *area, xbt_mheap_t heap){
1107
1108   void *sheap = (char *)mmalloc_get_current_heap() - STD_HEAP_SIZE - getpagesize();
1109   malloc_info *heapinfo = (malloc_info *)((char *)heap + ((uintptr_t)((char *)heap->heapinfo - (char *)sheap)));
1110   size_t heapsize = heap->heapsize;
1111
1112   /* Get block number */
1113   size_t block = ((char*)area - (char*)((xbt_mheap_t)sheap)->heapbase) / BLOCKSIZE + 1;
1114   size_t fragment;
1115
1116   /* Check if valid block number */
1117   if((char *)area < (char*)((xbt_mheap_t)sheap)->heapbase || block > heapsize || block < 1)
1118     return 0;
1119
1120   if(heapinfo[block].type < 0)
1121     return 1;
1122
1123   if(heapinfo[block].type == 0)
1124     return 0;
1125
1126   if(heapinfo[block].type > 0){
1127     fragment = ((uintptr_t) (ADDR2UINT(area) % (BLOCKSIZE))) >> heapinfo[block].type;
1128     if(heapinfo[block].busy_frag.frag_size[fragment] == 0)
1129       return 1;
1130   }
1131
1132   return 0;
1133
1134
1135
1136 }