1 /* mc_diff - Memory snapshooting and comparison */
3 /* Copyright (c) 2008-2014. The SimGrid Team.
4 * All rights reserved. */
6 /* This program is free software; you can redistribute it and/or modify it
7 * under the terms of the license (GNU LGPL) which comes with this package. */
9 #include "xbt/ex_interface.h" /* internals of backtrace setup */
12 #include "xbt/mmalloc.h"
13 #include "mc/datatypes.h"
14 #include "mc/mc_private.h"
16 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_diff, xbt,
17 "Logging specific to mc_diff in mc");
19 xbt_dynar_t mc_heap_comparison_ignore;
20 xbt_dynar_t stacks_areas;
21 void *maestro_stack_start, *maestro_stack_end;
24 /********************************* Backtrace ***********************************/
25 /******************************************************************************/
27 static void mmalloc_backtrace_block_display(void *heapinfo, int block)
32 /* if (((malloc_info *)heapinfo)[block].busy_block.bt_size == 0) { */
33 /* fprintf(stderr, "No backtrace available for that block, sorry.\n"); */
37 /* memcpy(&e.bt,&(((malloc_info *)heapinfo)[block].busy_block.bt),sizeof(void*)*XBT_BACKTRACE_SIZE); */
38 /* e.used = ((malloc_info *)heapinfo)[block].busy_block.bt_size; */
40 /* xbt_ex_setup_backtrace(&e); */
41 /* if (e.used == 0) { */
42 /* fprintf(stderr, "(backtrace not set)\n"); */
43 /* } else if (e.bt_strings == NULL) { */
44 /* fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet"); */
48 /* fprintf(stderr, "Backtrace of where the block %d was malloced (%d frames):\n", block ,e.used); */
49 /* for (i = 0; i < e.used; i++) /\* no need to display "xbt_backtrace_display" *\/{ */
50 /* fprintf(stderr, "%d ---> %s\n",i, e.bt_strings[i] + 4); */
55 static void mmalloc_backtrace_fragment_display(void *heapinfo, int block,
61 /* memcpy(&e.bt,&(((malloc_info *)heapinfo)[block].busy_frag.bt[frag]),sizeof(void*)*XBT_BACKTRACE_SIZE); */
62 /* e.used = XBT_BACKTRACE_SIZE; */
64 /* xbt_ex_setup_backtrace(&e); */
65 /* if (e.used == 0) { */
66 /* fprintf(stderr, "(backtrace not set)\n"); */
67 /* } else if (e.bt_strings == NULL) { */
68 /* fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet"); */
72 /* fprintf(stderr, "Backtrace of where the fragment %d in block %d was malloced (%d frames):\n", frag, block ,e.used); */
73 /* for (i = 0; i < e.used; i++) /\* no need to display "xbt_backtrace_display" *\/{ */
74 /* fprintf(stderr, "%d ---> %s\n",i, e.bt_strings[i] + 4); */
80 static void mmalloc_backtrace_display(void *addr)
83 /* size_t block, frag_nb; */
86 /* xbt_mheap_t heap = __mmalloc_current_heap ?: (xbt_mheap_t) mmalloc_preinit(); */
88 /* block = (((char*) (addr) - (char*) heap -> heapbase) / BLOCKSIZE + 1); */
90 /* type = heap->heapinfo[block].type; */
93 /* case -1 : /\* Free block *\/ */
94 /* fprintf(stderr, "Asked to display the backtrace of a block that is free. I'm puzzled\n"); */
97 /* case 0: /\* Large block *\/ */
98 /* mmalloc_backtrace_block_display(heap->heapinfo, block); */
100 /* default: /\* Fragmented block *\/ */
101 /* frag_nb = RESIDUAL(addr, BLOCKSIZE) >> type; */
102 /* if(heap->heapinfo[block].busy_frag.frag_size[frag_nb] == -1){ */
103 /* fprintf(stderr , "Asked to display the backtrace of a fragment that is free. I'm puzzled\n"); */
106 /* mmalloc_backtrace_fragment_display(heap->heapinfo, block, frag_nb); */
112 static int compare_backtrace(int b1, int f1, int b2, int f2)
116 for(i=0; i< XBT_BACKTRACE_SIZE; i++){
117 if(heapinfo1[b1].busy_frag.bt[f1][i] != heapinfo2[b2].busy_frag.bt[f2][i]){
118 //mmalloc_backtrace_fragment_display((void*)heapinfo1, b1, f1);
119 //mmalloc_backtrace_fragment_display((void*)heapinfo2, b2, f2);
124 for(i=0; i< heapinfo1[b1].busy_block.bt_size; i++){
125 if(heapinfo1[b1].busy_block.bt[i] != heapinfo2[b2].busy_block.bt[i]){
126 //mmalloc_backtrace_block_display((void*)heapinfo1, b1);
127 //mmalloc_backtrace_block_display((void*)heapinfo2, b2);
136 /*********************************** Heap comparison ***********************************/
137 /***************************************************************************************/
139 typedef char *type_name;
142 /** \brief Base address of the real heap */
145 // Number of blocks in the heaps:
146 size_t heapsize1, heapsize2;
147 xbt_dynar_t to_ignore1, to_ignore2;
148 s_heap_area_t *equals_to1, *equals_to2;
149 dw_type_t *types1, *types2;
153 #define equals_to1_(i,j) equals_to1[ MAX_FRAGMENT_PER_BLOCK*(i) + (j)]
154 #define equals_to2_(i,j) equals_to2[ MAX_FRAGMENT_PER_BLOCK*(i) + (j)]
155 #define types1_(i,j) types1[ MAX_FRAGMENT_PER_BLOCK*(i) + (j)]
156 #define types2_(i,j) types2[ MAX_FRAGMENT_PER_BLOCK*(i) + (j)]
158 __thread struct s_mc_diff *mc_diff_info = NULL;
160 /*********************************** Free functions ************************************/
162 static void heap_area_pair_free(heap_area_pair_t pair)
168 static void heap_area_pair_free_voidp(void *d)
170 heap_area_pair_free((heap_area_pair_t) * (void **) d);
173 static void heap_area_free(heap_area_t area)
179 /************************************************************************************/
181 static s_heap_area_t make_heap_area(int block, int fragment)
186 area.fragment = fragment;
191 static int is_new_heap_area_pair(xbt_dynar_t list, int block1, int fragment1,
192 int block2, int fragment2)
195 unsigned int cursor = 0;
196 heap_area_pair_t current_pair;
198 xbt_dynar_foreach(list, cursor, current_pair) {
199 if (current_pair->block1 == block1 && current_pair->block2 == block2
200 && current_pair->fragment1 == fragment1
201 && current_pair->fragment2 == fragment2)
208 static int add_heap_area_pair(xbt_dynar_t list, int block1, int fragment1,
209 int block2, int fragment2)
212 if (is_new_heap_area_pair(list, block1, fragment1, block2, fragment2)) {
213 heap_area_pair_t pair = NULL;
214 pair = xbt_new0(s_heap_area_pair_t, 1);
215 pair->block1 = block1;
216 pair->fragment1 = fragment1;
217 pair->block2 = block2;
218 pair->fragment2 = fragment2;
220 xbt_dynar_push(list, &pair);
228 static ssize_t heap_comparison_ignore_size(xbt_dynar_t ignore_list,
232 unsigned int cursor = 0;
234 int end = xbt_dynar_length(ignore_list) - 1;
235 mc_heap_ignore_region_t region;
237 while (start <= end) {
238 cursor = (start + end) / 2;
240 (mc_heap_ignore_region_t) xbt_dynar_get_as(ignore_list, cursor,
241 mc_heap_ignore_region_t);
242 if (region->address == address)
244 if (region->address < address)
246 if (region->address > address)
253 static int is_stack(void *address)
255 unsigned int cursor = 0;
256 stack_region_t stack;
258 xbt_dynar_foreach(stacks_areas, cursor, stack) {
259 if (address == stack->address)
266 // TODO, this should depend on the snapshot?
267 static int is_block_stack(int block)
269 unsigned int cursor = 0;
270 stack_region_t stack;
272 xbt_dynar_foreach(stacks_areas, cursor, stack) {
273 if (block == stack->block)
280 static void match_equals(struct s_mc_diff *state, xbt_dynar_t list)
283 unsigned int cursor = 0;
284 heap_area_pair_t current_pair;
286 xbt_dynar_foreach(list, cursor, current_pair) {
288 if (current_pair->fragment1 != -1) {
290 state->equals_to1_(current_pair->block1, current_pair->fragment1) =
291 make_heap_area(current_pair->block2, current_pair->fragment2);
292 state->equals_to2_(current_pair->block2, current_pair->fragment2) =
293 make_heap_area(current_pair->block1, current_pair->fragment1);
297 state->equals_to1_(current_pair->block1, 0) =
298 make_heap_area(current_pair->block2, current_pair->fragment2);
299 state->equals_to2_(current_pair->block2, 0) =
300 make_heap_area(current_pair->block1, current_pair->fragment1);
307 /** Check whether two blocks are known to be matching
309 * @param state State used
310 * @param b1 Block of state 1
311 * @param b2 Block of state 2
312 * @return if the blocks are known to be matching
314 static int equal_blocks(struct s_mc_diff *state, int b1, int b2)
317 if (state->equals_to1_(b1, 0).block == b2
318 && state->equals_to2_(b2, 0).block == b1)
324 /** Check whether two fragments are known to be matching
326 * @param state State used
327 * @param b1 Block of state 1
328 * @param f1 Fragment of state 1
329 * @param b2 Block of state 2
330 * @param f2 Fragment of state 2
331 * @return if the fragments are known to be matching
333 static int equal_fragments(struct s_mc_diff *state, int b1, int f1, int b2,
337 if (state->equals_to1_(b1, f1).block == b2
338 && state->equals_to1_(b1, f1).fragment == f2
339 && state->equals_to2_(b2, f2).block == b1
340 && state->equals_to2_(b2, f2).fragment == f1)
346 int init_heap_information(xbt_mheap_t heap1, xbt_mheap_t heap2, xbt_dynar_t i1,
349 if (mc_diff_info == NULL) {
350 mc_diff_info = xbt_new0(struct s_mc_diff, 1);
351 mc_diff_info->equals_to1 = NULL;
352 mc_diff_info->equals_to2 = NULL;
353 mc_diff_info->types1 = NULL;
354 mc_diff_info->types2 = NULL;
356 struct s_mc_diff *state = mc_diff_info;
358 if ((((struct mdesc *) heap1)->heaplimit !=
359 ((struct mdesc *) heap2)->heaplimit)
361 ((((struct mdesc *) heap1)->heapsize !=
362 ((struct mdesc *) heap2)->heapsize)))
365 state->heaplimit = ((struct mdesc *) heap1)->heaplimit;
367 // Mamailloute in order to find the base address of the main heap:
369 (char *) mmalloc_get_current_heap() - STD_HEAP_SIZE - xbt_pagesize;
371 state->heapsize1 = heap1->heapsize;
372 state->heapsize2 = heap2->heapsize;
374 state->to_ignore1 = i1;
375 state->to_ignore2 = i2;
377 if (state->heaplimit > state->available) {
379 realloc(state->equals_to1,
380 state->heaplimit * MAX_FRAGMENT_PER_BLOCK *
381 sizeof(s_heap_area_t));
383 realloc(state->types1,
384 state->heaplimit * MAX_FRAGMENT_PER_BLOCK *
385 sizeof(type_name *));
387 realloc(state->equals_to2,
388 state->heaplimit * MAX_FRAGMENT_PER_BLOCK *
389 sizeof(s_heap_area_t));
391 realloc(state->types2,
392 state->heaplimit * MAX_FRAGMENT_PER_BLOCK *
393 sizeof(type_name *));
394 state->available = state->heaplimit;
397 memset(state->equals_to1, 0,
398 state->heaplimit * MAX_FRAGMENT_PER_BLOCK * sizeof(s_heap_area_t));
399 memset(state->equals_to2, 0,
400 state->heaplimit * MAX_FRAGMENT_PER_BLOCK * sizeof(s_heap_area_t));
401 memset(state->types1, 0,
402 state->heaplimit * MAX_FRAGMENT_PER_BLOCK * sizeof(type_name *));
403 memset(state->types2, 0,
404 state->heaplimit * MAX_FRAGMENT_PER_BLOCK * sizeof(type_name *));
410 void reset_heap_information()
415 int mmalloc_compare_heap(mc_snapshot_t snapshot1, mc_snapshot_t snapshot2)
418 struct s_mc_diff *state = mc_diff_info;
420 /* Start comparison */
421 size_t i1, i2, j1, j2, k;
422 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
423 int nb_diff1 = 0, nb_diff2 = 0;
425 xbt_dynar_t previous =
426 xbt_dynar_new(sizeof(heap_area_pair_t), heap_area_pair_free_voidp);
428 int equal, res_compare = 0;
430 /* Check busy blocks */
434 malloc_info heapinfo_temp1, heapinfo_temp2;
435 malloc_info heapinfo_temp2b;
437 mc_mem_region_t heap_region1 = snapshot1->regions[0];
438 mc_mem_region_t heap_region2 = snapshot2->regions[0];
440 // This is in snapshot do not use them directly:
441 malloc_info* heapinfos1 = mc_snapshot_read_pointer(&((xbt_mheap_t)std_heap)->heapinfo, snapshot1);
442 malloc_info* heapinfos2 = mc_snapshot_read_pointer(&((xbt_mheap_t)std_heap)->heapinfo, snapshot2);
444 while (i1 <= state->heaplimit) {
446 // TODO, lookup in the correct region in order to speed it up:
447 malloc_info* heapinfo1 = mc_snapshot_read_region(&heapinfos1[i1], heap_region1, &heapinfo_temp1, sizeof(malloc_info));
448 malloc_info* heapinfo2 = mc_snapshot_read_region(&heapinfos2[i1], heap_region2, &heapinfo_temp2, sizeof(malloc_info));
450 if (heapinfo1->type == -1) { /* Free block */
456 ((void *) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE +
457 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
459 if (heapinfo1->type == 0) { /* Large block */
461 if (is_stack(addr_block1)) {
462 for (k = 0; k < heapinfo1->busy_block.size; k++)
463 state->equals_to1_(i1 + k, 0) = make_heap_area(i1, -1);
464 for (k = 0; k < heapinfo2->busy_block.size; k++)
465 state->equals_to2_(i1 + k, 0) = make_heap_area(i1, -1);
466 i1 += heapinfo1->busy_block.size;
470 if (state->equals_to1_(i1, 0).valid) {
479 /* Try first to associate to same block in the other heap */
480 if (heapinfo2->type == heapinfo1->type) {
482 if (state->equals_to2_(i1, 0).valid == 0) {
485 ((void *) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE +
486 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
489 compare_heap_area(addr_block1, addr_block2, snapshot1, snapshot2,
492 if (res_compare != 1) {
493 for (k = 1; k < heapinfo2->busy_block.size; k++)
494 state->equals_to2_(i1 + k, 0) = make_heap_area(i1, -1);
495 for (k = 1; k < heapinfo1->busy_block.size; k++)
496 state->equals_to1_(i1 + k, 0) = make_heap_area(i1, -1);
498 i1 += heapinfo1->busy_block.size;
501 xbt_dynar_reset(previous);
507 while (i2 <= state->heaplimit && !equal) {
510 ((void *) (((ADDR2UINT(i2)) - 1) * BLOCKSIZE +
511 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
518 malloc_info* heapinfo2b = mc_snapshot_read_region(&heapinfos2[i2], heap_region2, &heapinfo_temp2b, sizeof(malloc_info));
520 if (heapinfo2b->type != 0) {
525 if (state->equals_to2_(i2, 0).valid) {
531 compare_heap_area(addr_block1, addr_block2, snapshot1, snapshot2,
534 if (res_compare != 1) {
535 for (k = 1; k < heapinfo2b->busy_block.size; k++)
536 state->equals_to2_(i2 + k, 0) = make_heap_area(i1, -1);
537 for (k = 1; k < heapinfo1->busy_block.size; k++)
538 state->equals_to1_(i1 + k, 0) = make_heap_area(i2, -1);
540 i1 += heapinfo1->busy_block.size;
543 xbt_dynar_reset(previous);
550 XBT_DEBUG("Block %zu not found (size_used = %zu, addr = %p)", i1,
551 heapinfo1->busy_block.busy_size, addr_block1);
552 i1 = state->heaplimit + 1;
557 } else { /* Fragmented block */
559 for (j1 = 0; j1 < (size_t) (BLOCKSIZE >> heapinfo1->type); j1++) {
561 if (heapinfo1->busy_frag.frag_size[j1] == -1) /* Free fragment */
564 if (state->equals_to1_(i1, j1).valid)
568 (void *) ((char *) addr_block1 + (j1 << heapinfo1->type));
573 /* Try first to associate to same fragment in the other heap */
574 if (heapinfo2->type == heapinfo1->type) {
576 if (state->equals_to2_(i1, j1).valid == 0) {
579 ((void *) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE +
580 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
582 (void *) ((char *) addr_block2 +
583 (j1 << ((xbt_mheap_t) state->s_heap)->heapinfo[i1].
587 compare_heap_area(addr_frag1, addr_frag2, snapshot1, snapshot2,
590 if (res_compare != 1)
593 xbt_dynar_reset(previous);
599 while (i2 <= state->heaplimit && !equal) {
601 malloc_info* heapinfo2b = mc_snapshot_read_region(&heapinfos2[i2], heap_region2, &heapinfo_temp2b, sizeof(malloc_info));
602 if (heapinfo2b->type <= 0) {
607 for (j2 = 0; j2 < (size_t) (BLOCKSIZE >> heapinfo2b->type);
610 if (i2 == i1 && j2 == j1)
613 if (state->equals_to2_(i2, j2).valid)
617 ((void *) (((ADDR2UINT(i2)) - 1) * BLOCKSIZE +
618 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
620 (void *) ((char *) addr_block2 +
621 (j2 << ((xbt_mheap_t) state->s_heap)->heapinfo[i2].
625 compare_heap_area(addr_frag1, addr_frag2, snapshot2, snapshot2,
628 if (res_compare != 1) {
630 xbt_dynar_reset(previous);
634 xbt_dynar_reset(previous);
644 ("Block %zu, fragment %zu not found (size_used = %zd, address = %p)\n",
645 i1, j1, heapinfo1->busy_frag.frag_size[j1],
647 i2 = state->heaplimit + 1;
648 i1 = state->heaplimit + 1;
661 /* All blocks/fragments are equal to another block/fragment ? */
664 for(i = 1; i <= state->heaplimit; i++) {
665 malloc_info* heapinfo1 = mc_snapshot_read_region(&heapinfos1[i], heap_region1, &heapinfo_temp1, sizeof(malloc_info));
666 if (heapinfo1->type == 0) {
667 if (i1 == state->heaplimit) {
668 if (heapinfo1->busy_block.busy_size > 0) {
669 if (state->equals_to1_(i, 0).valid == 0) {
670 if (XBT_LOG_ISENABLED(mc_diff, xbt_log_priority_debug)) {
672 XBT_DEBUG("Block %zu not found (size used = %zu)", i,
673 heapinfo1->busy_block.busy_size);
674 //mmalloc_backtrace_block_display((void*)heapinfo1, i);
681 if (heapinfo1->type > 0) {
682 for (j = 0; j < (size_t) (BLOCKSIZE >> heapinfo1->type); j++) {
683 if (i1 == state->heaplimit) {
684 if (heapinfo1->busy_frag.frag_size[j] > 0) {
685 if (state->equals_to1_(i, j).valid == 0) {
686 if (XBT_LOG_ISENABLED(mc_diff, xbt_log_priority_debug)) {
687 // TODO, print fragment address
689 ("Block %zu, Fragment %zu not found (size used = %zd)",
691 heapinfo1->busy_frag.frag_size[j]);
692 //mmalloc_backtrace_fragment_display((void*)heapinfo1, i, j);
702 if (i1 == state->heaplimit)
703 XBT_DEBUG("Number of blocks/fragments not found in heap1 : %d", nb_diff1);
705 for (i=1; i <= state->heaplimit; i++) {
706 malloc_info* heapinfo2 = mc_snapshot_read_region(&heapinfos2[i], heap_region2, &heapinfo_temp2, sizeof(malloc_info));
707 if (heapinfo2->type == 0) {
708 if (i1 == state->heaplimit) {
709 if (heapinfo2->busy_block.busy_size > 0) {
710 if (state->equals_to2_(i, 0).valid == 0) {
711 if (XBT_LOG_ISENABLED(mc_diff, xbt_log_priority_debug)) {
712 // TODO, print address of the block
713 XBT_DEBUG("Block %zu not found (size used = %zu)", i,
714 heapinfo2->busy_block.busy_size);
715 //mmalloc_backtrace_block_display((void*)heapinfo2, i);
722 if (heapinfo2->type > 0) {
723 for (j = 0; j < (size_t) (BLOCKSIZE >> heapinfo2->type); j++) {
724 if (i1 == state->heaplimit) {
725 if (heapinfo2->busy_frag.frag_size[j] > 0) {
726 if (state->equals_to2_(i, j).valid == 0) {
727 if (XBT_LOG_ISENABLED(mc_diff, xbt_log_priority_debug)) {
728 // TODO, print address of the block
730 ("Block %zu, Fragment %zu not found (size used = %zd)",
732 heapinfo2->busy_frag.frag_size[j]);
733 //mmalloc_backtrace_fragment_display((void*)heapinfo2, i, j);
743 if (i1 == state->heaplimit)
744 XBT_DEBUG("Number of blocks/fragments not found in heap2 : %d", nb_diff2);
746 xbt_dynar_free(&previous);
747 return ((nb_diff1 > 0) || (nb_diff2 > 0));
753 * @param real_area1 Process address for state 1
754 * @param real_area2 Process address for state 2
755 * @param snapshot1 Snapshot of state 1
756 * @param snapshot2 Snapshot of state 2
759 * @param check_ignore
761 static int compare_heap_area_without_type(struct s_mc_diff *state,
762 void *real_area1, void *real_area2,
763 mc_snapshot_t snapshot1,
764 mc_snapshot_t snapshot2,
765 xbt_dynar_t previous, int size,
770 void *addr_pointed1, *addr_pointed2;
771 int pointer_align, res_compare;
772 ssize_t ignore1, ignore2;
774 mc_mem_region_t heap_region1 = snapshot1->regions[0];
775 mc_mem_region_t heap_region2 = snapshot2->regions[0];
779 if (check_ignore > 0) {
781 heap_comparison_ignore_size(state->to_ignore1,
782 (char *) real_area1 + i)) != -1) {
784 heap_comparison_ignore_size(state->to_ignore2,
785 (char *) real_area2 + i)) == ignore1) {
798 if (mc_snapshot_region_memcp(((char *) real_area1) + i, heap_region1, ((char *) real_area2) + i, heap_region2, 1) != 0) {
800 pointer_align = (i / sizeof(void *)) * sizeof(void *);
801 addr_pointed1 = mc_snapshot_read_pointer((char *) real_area1 + pointer_align, snapshot1);
802 addr_pointed2 = mc_snapshot_read_pointer((char *) real_area2 + pointer_align, snapshot2);
804 if (addr_pointed1 > maestro_stack_start
805 && addr_pointed1 < maestro_stack_end
806 && addr_pointed2 > maestro_stack_start
807 && addr_pointed2 < maestro_stack_end) {
808 i = pointer_align + sizeof(void *);
810 } else if (addr_pointed1 > state->s_heap
811 && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1)
812 && addr_pointed2 > state->s_heap
813 && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2)) {
814 // Both addreses are in the heap:
816 compare_heap_area(addr_pointed1, addr_pointed2, snapshot1,
817 snapshot2, previous, NULL, 0);
818 if (res_compare == 1) {
821 i = pointer_align + sizeof(void *);
840 * @param real_area1 Process address for state 1
841 * @param real_area2 Process address for state 2
842 * @param snapshot1 Snapshot of state 1
843 * @param snapshot2 Snapshot of state 2
846 * @param area_size either a byte_size or an elements_count (?)
847 * @param check_ignore
848 * @param pointer_level
849 * @return 0 (same), 1 (different), -1 (unknown)
851 static int compare_heap_area_with_type(struct s_mc_diff *state,
852 void *real_area1, void *real_area2,
853 mc_snapshot_t snapshot1,
854 mc_snapshot_t snapshot2,
855 xbt_dynar_t previous, dw_type_t type,
856 int area_size, int check_ignore,
860 if (is_stack(real_area1) && is_stack(real_area2))
863 ssize_t ignore1, ignore2;
865 if ((check_ignore > 0)
866 && ((ignore1 = heap_comparison_ignore_size(state->to_ignore1, real_area1))
868 && ((ignore2 = heap_comparison_ignore_size(state->to_ignore2, real_area2))
873 dw_type_t subtype, subsubtype;
874 int res, elm_size, i;
875 unsigned int cursor = 0;
877 void *addr_pointed1, *addr_pointed2;;
879 mc_mem_region_t heap_region1 = snapshot1->regions[0];
880 mc_mem_region_t heap_region2 = snapshot2->regions[0];
882 switch (type->type) {
883 case DW_TAG_unspecified_type:
886 case DW_TAG_base_type:
887 if (type->name != NULL && strcmp(type->name, "char") == 0) { /* String, hence random (arbitrary ?) size */
888 if (real_area1 == real_area2)
891 return (mc_snapshot_region_memcp(real_area1, heap_region1, real_area2, heap_region2, area_size) != 0);
893 if (area_size != -1 && type->byte_size != area_size)
896 return (mc_snapshot_region_memcp(real_area1, heap_region1, real_area2, heap_region2, type->byte_size) != 0);
900 case DW_TAG_enumeration_type:
901 if (area_size != -1 && type->byte_size != area_size)
904 return (mc_snapshot_region_memcp(real_area1, heap_region1, real_area2, heap_region2, type->byte_size) != 0);
907 case DW_TAG_const_type:
908 case DW_TAG_volatile_type:
910 type = type->subtype;
913 case DW_TAG_array_type:
914 subtype = type->subtype;
915 switch (subtype->type) {
916 case DW_TAG_unspecified_type:
919 case DW_TAG_base_type:
920 case DW_TAG_enumeration_type:
921 case DW_TAG_pointer_type:
922 case DW_TAG_reference_type:
923 case DW_TAG_rvalue_reference_type:
924 case DW_TAG_structure_type:
925 case DW_TAG_class_type:
926 case DW_TAG_union_type:
927 if (subtype->full_type)
928 subtype = subtype->full_type;
929 elm_size = subtype->byte_size;
931 // TODO, just remove the type indirection?
932 case DW_TAG_const_type:
934 case DW_TAG_volatile_type:
935 subsubtype = subtype->subtype;
936 if (subsubtype->full_type)
937 subsubtype = subsubtype->full_type;
938 elm_size = subsubtype->byte_size;
944 for (i = 0; i < type->element_count; i++) {
945 // TODO, add support for variable stride (DW_AT_byte_stride)
947 compare_heap_area_with_type(state,
948 (char *) real_area1 + (i * elm_size),
949 (char *) real_area2 + (i * elm_size),
950 snapshot1, snapshot2, previous,
951 type->subtype, subtype->byte_size,
952 check_ignore, pointer_level);
957 case DW_TAG_reference_type:
958 case DW_TAG_rvalue_reference_type:
959 case DW_TAG_pointer_type:
960 if (type->subtype && type->subtype->type == DW_TAG_subroutine_type) {
961 addr_pointed1 = mc_snapshot_read_pointer(real_area1, snapshot1);
962 addr_pointed2 = mc_snapshot_read_pointer(real_area2, snapshot2);
963 return (addr_pointed1 != addr_pointed2);;
966 if (pointer_level > 1) { /* Array of pointers */
967 for (i = 0; i < (area_size / sizeof(void *)); i++) {
968 addr_pointed1 = mc_snapshot_read_pointer((char*) real_area1 + i * sizeof(void *), snapshot1);
969 addr_pointed2 = mc_snapshot_read_pointer((char*) real_area2 + i * sizeof(void *), snapshot2);
970 if (addr_pointed1 > state->s_heap
971 && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1)
972 && addr_pointed2 > state->s_heap
973 && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2))
975 compare_heap_area(addr_pointed1, addr_pointed2, snapshot1,
976 snapshot2, previous, type->subtype,
979 res = (addr_pointed1 != addr_pointed2);
984 addr_pointed1 = mc_snapshot_read_pointer(real_area1, snapshot1);
985 addr_pointed2 = mc_snapshot_read_pointer(real_area2, snapshot2);
986 if (addr_pointed1 > state->s_heap
987 && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1)
988 && addr_pointed2 > state->s_heap
989 && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2))
990 return compare_heap_area(addr_pointed1, addr_pointed2, snapshot1,
991 snapshot2, previous, type->subtype,
994 return (addr_pointed1 != addr_pointed2);
998 case DW_TAG_structure_type:
999 case DW_TAG_class_type:
1000 if (type->full_type)
1001 type = type->full_type;
1002 if (area_size != -1 && type->byte_size != area_size) {
1003 if (area_size > type->byte_size && area_size % type->byte_size == 0) {
1004 for (i = 0; i < (area_size / type->byte_size); i++) {
1006 compare_heap_area_with_type(state,
1007 (char *) real_area1 + i * type->byte_size,
1008 (char *) real_area2 + i * type->byte_size,
1009 snapshot1, snapshot2, previous, type, -1,
1019 xbt_dynar_foreach(type->members, cursor, member) {
1020 // TODO, optimize this? (for the offset case)
1021 char *real_member1 =
1022 mc_member_resolve(real_area1, type, member, snapshot1);
1023 char *real_member2 =
1024 mc_member_resolve(real_area2, type, member, snapshot2);
1026 compare_heap_area_with_type(state, real_member1, real_member2,
1027 snapshot1, snapshot2,
1028 previous, member->subtype, -1,
1036 case DW_TAG_union_type:
1037 return compare_heap_area_without_type(state, real_area1, real_area2,
1038 snapshot1, snapshot2, previous,
1039 type->byte_size, check_ignore);
1049 /** Infer the type of a part of the block from the type of the block
1051 * TODO, handle DW_TAG_array_type as well as arrays of the object ((*p)[5], p[5])
1053 * TODO, handle subfields ((*p).bar.foo, (*p)[5].bar…)
1055 * @param type_id DWARF type ID of the root address
1057 * @return DWARF type ID for given offset
1059 static dw_type_t get_offset_type(void *real_base_address, dw_type_t type,
1060 int offset, int area_size,
1061 mc_snapshot_t snapshot)
1064 // Beginning of the block, the infered variable type if the type of the block:
1068 switch (type->type) {
1069 case DW_TAG_structure_type:
1070 case DW_TAG_class_type:
1071 if (type->full_type)
1072 type = type->full_type;
1074 if (area_size != -1 && type->byte_size != area_size) {
1075 if (area_size > type->byte_size && area_size % type->byte_size == 0)
1080 unsigned int cursor = 0;
1082 xbt_dynar_foreach(type->members, cursor, member) {
1084 if (!member->location.size) {
1085 // We have the offset, use it directly (shortcut):
1086 if (member->offset == offset)
1087 return member->subtype;
1090 mc_member_resolve(real_base_address, type, member, snapshot);
1091 if (real_member - (char *) real_base_address == offset)
1092 return member->subtype;
1100 /* FIXME : other cases ? */
1108 * @param area1 Process address for state 1
1109 * @param area2 Process address for state 2
1110 * @param snapshot1 Snapshot of state 1
1111 * @param snapshot2 Snapshot of state 2
1112 * @param previous Pairs of blocks already compared on the current path (or NULL)
1113 * @param type_id Type of variable
1114 * @param pointer_level
1115 * @return 0 (same), 1 (different), -1
1117 int compare_heap_area(void *area1, void *area2, mc_snapshot_t snapshot1,
1118 mc_snapshot_t snapshot2, xbt_dynar_t previous,
1119 dw_type_t type, int pointer_level)
1122 struct s_mc_diff *state = mc_diff_info;
1125 ssize_t block1, frag1, block2, frag2;
1127 int check_ignore = 0;
1129 void *real_addr_block1, *real_addr_block2, *real_addr_frag1, *real_addr_frag2;
1132 int offset1 = 0, offset2 = 0;
1133 int new_size1 = -1, new_size2 = -1;
1134 dw_type_t new_type1 = NULL, new_type2 = NULL;
1136 int match_pairs = 0;
1138 malloc_info* heapinfos1 = mc_snapshot_read_pointer(&((xbt_mheap_t)std_heap)->heapinfo, snapshot1);
1139 malloc_info* heapinfos2 = mc_snapshot_read_pointer(&((xbt_mheap_t)std_heap)->heapinfo, snapshot2);
1141 malloc_info heapinfo_temp1, heapinfo_temp2;
1143 if (previous == NULL) {
1145 xbt_dynar_new(sizeof(heap_area_pair_t), heap_area_pair_free_voidp);
1148 // Get block number:
1151 (char *) ((xbt_mheap_t) state->s_heap)->heapbase) / BLOCKSIZE + 1;
1154 (char *) ((xbt_mheap_t) state->s_heap)->heapbase) / BLOCKSIZE + 1;
1156 // If either block is a stack block:
1157 if (is_block_stack((int) block1) && is_block_stack((int) block2)) {
1158 add_heap_area_pair(previous, block1, -1, block2, -1);
1160 match_equals(state, previous);
1161 xbt_dynar_free(&previous);
1165 // If either block is not in the expected area of memory:
1166 if (((char *) area1 < (char *) ((xbt_mheap_t) state->s_heap)->heapbase)
1167 || (block1 > state->heapsize1) || (block1 < 1)
1168 || ((char *) area2 < (char *) ((xbt_mheap_t) state->s_heap)->heapbase)
1169 || (block2 > state->heapsize2) || (block2 < 1)) {
1171 xbt_dynar_free(&previous);
1176 // Process address of the block:
1178 ((void *) (((ADDR2UINT(block1)) - 1) * BLOCKSIZE +
1179 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
1181 ((void *) (((ADDR2UINT(block2)) - 1) * BLOCKSIZE +
1182 (char *) ((xbt_mheap_t) state->s_heap)->heapbase));
1186 if (type->full_type)
1187 type = type->full_type;
1189 // This assume that for "boring" types (volatile ...) byte_size is absent:
1190 while (type->byte_size == 0 && type->subtype != NULL)
1191 type = type->subtype;
1194 if ((type->type == DW_TAG_pointer_type)
1195 || ((type->type == DW_TAG_base_type) && type->name != NULL
1196 && (!strcmp(type->name, "char"))))
1199 type_size = type->byte_size;
1203 mc_mem_region_t heap_region1 = snapshot1->regions[0];
1204 mc_mem_region_t heap_region2 = snapshot2->regions[0];
1206 malloc_info* heapinfo1 = mc_snapshot_read_region(&heapinfos1[block1], heap_region1, &heapinfo_temp1, sizeof(malloc_info));
1207 malloc_info* heapinfo2 = mc_snapshot_read_region(&heapinfos2[block2], heap_region2, &heapinfo_temp2, sizeof(malloc_info));
1209 if ((heapinfo1->type == -1) && (heapinfo2->type == -1)) { /* Free block */
1212 match_equals(state, previous);
1213 xbt_dynar_free(&previous);
1217 } else if ((heapinfo1->type == 0) && (heapinfo2->type == 0)) { /* Complete block */
1219 // TODO, lookup variable type from block type as done for fragmented blocks
1221 if (state->equals_to1_(block1, 0).valid
1222 && state->equals_to2_(block2, 0).valid) {
1223 if (equal_blocks(state, block1, block2)) {
1225 match_equals(state, previous);
1226 xbt_dynar_free(&previous);
1232 if (type_size != -1) {
1233 if (type_size != heapinfo1->busy_block.busy_size
1234 && type_size != heapinfo2->busy_block.busy_size
1235 && type->name != NULL && !strcmp(type->name, "s_smx_context")) {
1237 match_equals(state, previous);
1238 xbt_dynar_free(&previous);
1244 if (heapinfo1->busy_block.size !=
1245 heapinfo2->busy_block.size) {
1247 xbt_dynar_free(&previous);
1252 if (heapinfo1->busy_block.busy_size !=
1253 heapinfo2->busy_block.busy_size) {
1255 xbt_dynar_free(&previous);
1260 if (!add_heap_area_pair(previous, block1, -1, block2, -1)) {
1262 match_equals(state, previous);
1263 xbt_dynar_free(&previous);
1268 size = heapinfo1->busy_block.busy_size;
1270 // Remember (basic) type inference.
1271 // The current data structure only allows us to do this for the whole block.
1272 if (type != NULL && area1 == real_addr_block1) {
1273 state->types1_(block1, 0) = type;
1275 if (type != NULL && area2 == real_addr_block2) {
1276 state->types2_(block2, 0) = type;
1281 match_equals(state, previous);
1282 xbt_dynar_free(&previous);
1290 if ((heapinfo1->busy_block.ignore > 0)
1291 && (heapinfo2->busy_block.ignore ==
1292 heapinfo1->busy_block.ignore))
1293 check_ignore = heapinfo1->busy_block.ignore;
1295 } else if ((heapinfo1->type > 0) && (heapinfo2->type > 0)) { /* Fragmented block */
1299 ((uintptr_t) (ADDR2UINT(area1) % (BLOCKSIZE))) >> heapinfo1->type;
1301 ((uintptr_t) (ADDR2UINT(area2) % (BLOCKSIZE))) >> heapinfo2->type;
1303 // Process address of the fragment:
1305 (void *) ((char *) real_addr_block1 +
1306 (frag1 << ((xbt_mheap_t) state->s_heap)->heapinfo[block1].
1309 (void *) ((char *) real_addr_block2 +
1310 (frag2 << ((xbt_mheap_t) state->s_heap)->heapinfo[block2].
1313 // Check the size of the fragments against the size of the type:
1314 if (type_size != -1) {
1315 if (heapinfo1->busy_frag.frag_size[frag1] == -1
1316 || heapinfo2->busy_frag.frag_size[frag2] == -1) {
1318 match_equals(state, previous);
1319 xbt_dynar_free(&previous);
1323 if (type_size != heapinfo1->busy_frag.frag_size[frag1]
1324 || type_size != heapinfo2->busy_frag.frag_size[frag2]) {
1326 match_equals(state, previous);
1327 xbt_dynar_free(&previous);
1332 // Check if the blocks are already matched together:
1333 if (state->equals_to1_(block1, frag1).valid
1334 && state->equals_to2_(block2, frag2).valid) {
1335 if (equal_fragments(state, block1, frag1, block2, frag2)) {
1337 match_equals(state, previous);
1338 xbt_dynar_free(&previous);
1343 // Compare the size of both fragments:
1344 if (heapinfo1->busy_frag.frag_size[frag1] !=
1345 heapinfo2->busy_frag.frag_size[frag2]) {
1346 if (type_size == -1) {
1348 match_equals(state, previous);
1349 xbt_dynar_free(&previous);
1354 xbt_dynar_free(&previous);
1359 // Size of the fragment:
1360 size = heapinfo1->busy_frag.frag_size[frag1];
1362 // Remember (basic) type inference.
1363 // The current data structure only allows us to do this for the whole block.
1364 if (type != NULL && area1 == real_addr_frag1) {
1365 state->types1_(block1, frag1) = type;
1367 if (type != NULL && area2 == real_addr_frag2) {
1368 state->types2_(block2, frag2) = type;
1370 // The type of the variable is already known:
1375 // Type inference from the block type.
1376 else if (state->types1_(block1, frag1) != NULL
1377 || state->types2_(block2, frag2) != NULL) {
1379 offset1 = (char *) area1 - (char *) real_addr_frag1;
1380 offset2 = (char *) area2 - (char *) real_addr_frag2;
1382 if (state->types1_(block1, frag1) != NULL
1383 && state->types2_(block2, frag2) != NULL) {
1385 get_offset_type(real_addr_frag1, state->types1_(block1, frag1),
1386 offset1, size, snapshot1);
1388 get_offset_type(real_addr_frag2, state->types2_(block2, frag2),
1389 offset1, size, snapshot2);
1390 } else if (state->types1_(block1, frag1) != NULL) {
1392 get_offset_type(real_addr_frag1, state->types1_(block1, frag1),
1393 offset1, size, snapshot1);
1395 get_offset_type(real_addr_frag2, state->types1_(block1, frag1),
1396 offset2, size, snapshot2);
1397 } else if (state->types2_(block2, frag2) != NULL) {
1399 get_offset_type(real_addr_frag1, state->types2_(block2, frag2),
1400 offset1, size, snapshot1);
1402 get_offset_type(real_addr_frag2, state->types2_(block2, frag2),
1403 offset2, size, snapshot2);
1406 match_equals(state, previous);
1407 xbt_dynar_free(&previous);
1412 if (new_type1 != NULL && new_type2 != NULL && new_type1 != new_type2) {
1415 while (type->byte_size == 0 && type->subtype != NULL)
1416 type = type->subtype;
1417 new_size1 = type->byte_size;
1420 while (type->byte_size == 0 && type->subtype != NULL)
1421 type = type->subtype;
1422 new_size2 = type->byte_size;
1426 match_equals(state, previous);
1427 xbt_dynar_free(&previous);
1433 if (new_size1 > 0 && new_size1 == new_size2) {
1438 if (offset1 == 0 && offset2 == 0) {
1439 if (!add_heap_area_pair(previous, block1, frag1, block2, frag2)) {
1441 match_equals(state, previous);
1442 xbt_dynar_free(&previous);
1450 match_equals(state, previous);
1451 xbt_dynar_free(&previous);
1456 if ((heapinfo1->busy_frag.ignore[frag1] > 0)
1457 && (heapinfo2->busy_frag.ignore[frag2] ==
1458 heapinfo1->busy_frag.ignore[frag1]))
1459 check_ignore = heapinfo1->busy_frag.ignore[frag1];
1464 xbt_dynar_free(&previous);
1471 /* Start comparison */
1474 compare_heap_area_with_type(state, area1, area2, snapshot1, snapshot2,
1475 previous, type, size, check_ignore,
1479 compare_heap_area_without_type(state, area1, area2, snapshot1, snapshot2,
1480 previous, size, check_ignore);
1482 if (res_compare == 1) {
1484 xbt_dynar_free(&previous);
1489 match_equals(state, previous);
1490 xbt_dynar_free(&previous);
1496 /*********************************************** Miscellaneous ***************************************************/
1497 /****************************************************************************************************************/
1499 // Not used and broken code:
1503 static int get_pointed_area_size(void *area, int heap)
1506 struct s_mc_diff *state = mc_diff_info;
1509 malloc_info *heapinfo;
1512 heapinfo = state->heapinfo1;
1514 heapinfo = state->heapinfo2;
1518 (char *) ((xbt_mheap_t) state->s_heap)->heapbase) / BLOCKSIZE + 1;
1520 if (((char *) area < (char *) ((xbt_mheap_t) state->s_heap)->heapbase)
1521 || (block > state->heapsize1) || (block < 1))
1524 if (heapinfo[block].type == -1) { /* Free block */
1526 } else if (heapinfo[block].type == 0) { /* Complete block */
1527 return (int) heapinfo[block].busy_block.busy_size;
1530 ((uintptr_t) (ADDR2UINT(area) % (BLOCKSIZE))) >> heapinfo[block].type;
1531 return (int) heapinfo[block].busy_frag.frag_size[frag];
1536 char *get_type_description(mc_object_info_t info, char *type_name)
1539 xbt_dict_cursor_t dict_cursor;
1543 xbt_dict_foreach(info->types, dict_cursor, type_origin, type) {
1544 if (type->name && (strcmp(type->name, type_name) == 0)
1545 && type->byte_size > 0) {
1546 xbt_dict_cursor_free(&dict_cursor);
1551 xbt_dict_cursor_free(&dict_cursor);
1557 #define max( a, b ) ( ((a) > (b)) ? (a) : (b) )
1561 int mmalloc_linear_compare_heap(xbt_mheap_t heap1, xbt_mheap_t heap2)
1564 struct s_mc_diff *state = mc_diff_info;
1566 if (heap1 == NULL && heap1 == NULL) {
1567 XBT_DEBUG("Malloc descriptors null");
1571 if (heap1->heaplimit != heap2->heaplimit) {
1572 XBT_DEBUG("Different limit of valid info table indices");
1576 /* Heap information */
1577 state->heaplimit = ((struct mdesc *) heap1)->heaplimit;
1580 // Mamailloute in order to find the base address of the main heap:
1582 (char *) mmalloc_get_current_heap() - STD_HEAP_SIZE - xbt_pagesize;
1584 state->heapbase1 = (char *) heap1 + BLOCKSIZE;
1585 state->heapbase2 = (char *) heap2 + BLOCKSIZE;
1588 (malloc_info *) ((char *) heap1 +
1590 ((char *) heap1->heapinfo - (char *) state->s_heap)));
1592 (malloc_info *) ((char *) heap2 +
1594 ((char *) heap2->heapinfo - (char *) state->s_heap)));
1596 state->heapsize1 = heap1->heapsize;
1597 state->heapsize2 = heap2->heapsize;
1599 /* Start comparison */
1601 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
1605 /* Check busy blocks */
1609 while (i <= state->heaplimit) {
1612 ((void *) (((ADDR2UINT(i)) - 1) * BLOCKSIZE +
1613 (char *) state->heapbase1));
1615 ((void *) (((ADDR2UINT(i)) - 1) * BLOCKSIZE +
1616 (char *) state->heapbase2));
1618 if (state->heapinfo1[i].type != state->heapinfo2[i].type) {
1620 distance += BLOCKSIZE;
1621 XBT_DEBUG("Different type of blocks (%zu) : %d - %d -> distance = %d", i,
1622 state->heapinfo1[i].type, state->heapinfo2[i].type, distance);
1627 if (state->heapinfo1[i].type == -1) { /* Free block */
1632 if (state->heapinfo1[i].type == 0) { /* Large block */
1634 if (state->heapinfo1[i].busy_block.size !=
1635 state->heapinfo2[i].busy_block.size) {
1637 BLOCKSIZE * max(state->heapinfo1[i].busy_block.size,
1638 state->heapinfo2[i].busy_block.size);
1639 i += max(state->heapinfo1[i].busy_block.size,
1640 state->heapinfo2[i].busy_block.size);
1642 ("Different larger of cluster at block %zu : %zu - %zu -> distance = %d",
1643 i, state->heapinfo1[i].busy_block.size,
1644 state->heapinfo2[i].busy_block.size, distance);
1648 /*if(heapinfo1[i].busy_block.busy_size != heapinfo2[i].busy_block.busy_size){
1649 distance += max(heapinfo1[i].busy_block.busy_size, heapinfo2[i].busy_block.busy_size);
1650 i += max(heapinfo1[i].busy_block.size, heapinfo2[i].busy_block.size);
1651 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);
1657 //while(k < (heapinfo1[i].busy_block.busy_size)){
1658 while (k < state->heapinfo1[i].busy_block.size * BLOCKSIZE) {
1659 if (memcmp((char *) addr_block1 + k, (char *) addr_block2 + k, 1) !=
1668 } else { /* Fragmented block */
1670 for (j = 0; j < (size_t) (BLOCKSIZE >> state->heapinfo1[i].type); j++) {
1673 (void *) ((char *) addr_block1 + (j << state->heapinfo1[i].type));
1675 (void *) ((char *) addr_block2 + (j << state->heapinfo2[i].type));
1677 if (state->heapinfo1[i].busy_frag.frag_size[j] == 0
1678 && state->heapinfo2[i].busy_frag.frag_size[j] == 0) {
1683 /*if(heapinfo1[i].busy_frag.frag_size[j] != heapinfo2[i].busy_frag.frag_size[j]){
1684 distance += max(heapinfo1[i].busy_frag.frag_size[j], heapinfo2[i].busy_frag.frag_size[j]);
1685 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);
1691 //while(k < max(heapinfo1[i].busy_frag.frag_size[j], heapinfo2[i].busy_frag.frag_size[j])){
1692 while (k < (BLOCKSIZE / (BLOCKSIZE >> state->heapinfo1[i].type))) {
1693 if (memcmp((char *) addr_frag1 + k, (char *) addr_frag2 + k, 1) !=