1 /* Copyright (c) 2008-2017. The SimGrid Team. All rights reserved. */
3 /* This program is free software; you can redistribute it and/or modify it
4 * under the terms of the license (GNU LGPL) which comes with this package. */
6 /** \file compare.cpp Memory snapshooting and comparison */
14 #include <unordered_set>
16 #include "xbt/dynar.h"
17 #include "xbt/sysdep.h"
18 #include <xbt/mmalloc.h>
21 #include <mc/datatypes.h>
23 #include "src/internal_config.h"
25 #include "src/xbt/mmalloc/mmprivate.h"
28 #include "src/smpi/private.h"
31 #include "src/mc/mc_forward.hpp"
32 #include "src/mc/mc_private.h"
33 #include "src/mc/mc_smx.h"
34 #include "src/mc/mc_dwarf.hpp"
35 #include "src/mc/Frame.hpp"
36 #include "src/mc/ObjectInformation.hpp"
37 #include "src/mc/Variable.hpp"
38 #include "src/mc/mc_private.h"
39 #include "src/mc/mc_snapshot.h"
40 #include "src/mc/mc_dwarf.hpp"
41 #include "src/mc/Type.hpp"
43 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_compare, xbt, "Logging specific to mc_compare in mc");
49 typedef std::array<HeapLocation, 2> HeapLocationPair;
50 typedef std::set<HeapLocationPair> HeapLocationPairs;
52 struct ProcessComparisonState;
53 struct StateComparator;
55 static int compare_heap_area(
56 StateComparator& state,
57 int process_index, const void *area1, const void* area2,
58 Snapshot* snapshot1, Snapshot* snapshot2,
59 HeapLocationPairs* previous, Type* type, int pointer_level);
64 using simgrid::mc::remote;
66 /*********************************** Heap comparison ***********************************/
67 /***************************************************************************************/
77 HeapLocation(int block, int fragment = 0) : block(block), fragment(fragment) {}
79 bool operator==(HeapLocation const& that) const
81 return block == that.block && fragment == that.fragment;
83 bool operator<(HeapLocation const& that) const
85 return std::make_pair(block, fragment)
86 < std::make_pair(that.block, that.fragment);
91 HeapLocationPair makeHeapLocationPair(int block1, int fragment1, int block2, int fragment2)
93 return simgrid::mc::HeapLocationPair{{
94 simgrid::mc::HeapLocation(block1, fragment1),
95 simgrid::mc::HeapLocation(block2, fragment2)
99 struct HeapArea : public HeapLocation {
105 : valid(true), block(block) {}
106 HeapArea(int block, int fragment = 0)
107 : valid(true), block(block), fragment(fragment) {}
110 struct ProcessComparisonState {
111 std::vector<simgrid::mc::IgnoredHeapRegion>* to_ignore = nullptr;
112 std::vector<HeapArea> equals_to;
113 std::vector<simgrid::mc::Type*> types;
114 std::size_t heapsize = 0;
116 void initHeapInformation(xbt_mheap_t heap, std::vector<simgrid::mc::IgnoredHeapRegion>* i);
121 /** A hash which works with more stuff
123 * It can hash pairs: the standard hash currently doesn't include this.
125 template<class X> struct hash : public std::hash<X> {};
127 template<class X, class Y>
128 struct hash<std::pair<X,Y>> {
129 std::size_t operator()(std::pair<X,Y>const& x) const
133 return h1(x.first) ^ h2(x.second);
140 struct StateComparator {
141 s_xbt_mheap_t std_heap_copy;
142 std::size_t heaplimit;
143 std::array<ProcessComparisonState, 2> processStates;
145 std::unordered_set<std::pair<void*, void*>, hash<std::pair<void*, void*>>> compared_pointers;
149 compared_pointers.clear();
152 int initHeapInformation(
153 xbt_mheap_t heap1, xbt_mheap_t heap2,
154 std::vector<simgrid::mc::IgnoredHeapRegion>* i1,
155 std::vector<simgrid::mc::IgnoredHeapRegion>* i2);
157 HeapArea& equals_to1_(std::size_t i, std::size_t j)
159 return processStates[0].equals_to[ MAX_FRAGMENT_PER_BLOCK * i + j];
161 HeapArea& equals_to2_(std::size_t i, std::size_t j)
163 return processStates[1].equals_to[ MAX_FRAGMENT_PER_BLOCK * i + j];
165 Type*& types1_(std::size_t i, std::size_t j)
167 return processStates[0].types[ MAX_FRAGMENT_PER_BLOCK * i + j];
169 Type*& types2_(std::size_t i, std::size_t j)
171 return processStates[1].types[ MAX_FRAGMENT_PER_BLOCK * i + j];
174 HeapArea const& equals_to1_(std::size_t i, std::size_t j) const
176 return processStates[0].equals_to[ MAX_FRAGMENT_PER_BLOCK * i + j];
178 HeapArea const& equals_to2_(std::size_t i, std::size_t j) const
180 return processStates[1].equals_to[ MAX_FRAGMENT_PER_BLOCK * i + j];
182 Type* const& types1_(std::size_t i, std::size_t j) const
184 return processStates[0].types[ MAX_FRAGMENT_PER_BLOCK * i + j];
186 Type* const& types2_(std::size_t i, std::size_t j) const
188 return processStates[1].types[ MAX_FRAGMENT_PER_BLOCK * i + j];
191 /** Check whether two blocks are known to be matching
193 * @param b1 Block of state 1
194 * @param b2 Block of state 2
195 * @return if the blocks are known to be matching
197 bool blocksEqual(int b1, int b2) const
199 return this->equals_to1_(b1, 0).block == b2
200 && this->equals_to2_(b2, 0).block == b1;
203 /** Check whether two fragments are known to be matching
205 * @param b1 Block of state 1
206 * @param f1 Fragment of state 1
207 * @param b2 Block of state 2
208 * @param f2 Fragment of state 2
209 * @return if the fragments are known to be matching
211 int fragmentsEqual(int b1, int f1, int b2, int f2) const
213 return this->equals_to1_(b1, f1).block == b2
214 && this->equals_to1_(b1, f1).fragment == f2
215 && this->equals_to2_(b2, f2).block == b1
216 && this->equals_to2_(b2, f2).fragment == f1;
219 void match_equals(HeapLocationPairs* list);
225 /************************************************************************************/
227 static ssize_t heap_comparison_ignore_size(
228 std::vector<simgrid::mc::IgnoredHeapRegion>* ignore_list,
232 int end = ignore_list->size() - 1;
234 while (start <= end) {
235 unsigned int cursor = (start + end) / 2;
236 simgrid::mc::IgnoredHeapRegion const& region = (*ignore_list)[cursor];
237 if (region.address == address)
239 if (region.address < address)
241 if (region.address > address)
248 static bool is_stack(const void *address)
250 for (auto const& stack : mc_model_checker->process().stack_areas())
251 if (address == stack.address)
256 // TODO, this should depend on the snapshot?
257 static bool is_block_stack(int block)
259 for (auto const& stack : mc_model_checker->process().stack_areas())
260 if (block == stack.block)
268 void StateComparator::match_equals(HeapLocationPairs* list)
270 for (auto const& pair : *list) {
271 if (pair[0].fragment != -1) {
272 this->equals_to1_(pair[0].block, pair[0].fragment) = simgrid::mc::HeapArea(pair[1].block, pair[1].fragment);
273 this->equals_to2_(pair[1].block, pair[1].fragment) = simgrid::mc::HeapArea(pair[0].block, pair[0].fragment);
275 this->equals_to1_(pair[0].block, 0) = simgrid::mc::HeapArea(pair[1].block, pair[1].fragment);
276 this->equals_to2_(pair[1].block, 0) = simgrid::mc::HeapArea(pair[0].block, pair[0].fragment);
281 void ProcessComparisonState::initHeapInformation(xbt_mheap_t heap,
282 std::vector<simgrid::mc::IgnoredHeapRegion>* i)
284 auto heaplimit = heap->heaplimit;
285 this->heapsize = heap->heapsize;
287 this->equals_to.assign(heaplimit * MAX_FRAGMENT_PER_BLOCK, HeapArea());
288 this->types.assign(heaplimit * MAX_FRAGMENT_PER_BLOCK, nullptr);
291 int StateComparator::initHeapInformation(xbt_mheap_t heap1, xbt_mheap_t heap2,
292 std::vector<simgrid::mc::IgnoredHeapRegion>* i1,
293 std::vector<simgrid::mc::IgnoredHeapRegion>* i2)
295 if ((heap1->heaplimit != heap2->heaplimit) || (heap1->heapsize != heap2->heapsize))
297 this->heaplimit = heap1->heaplimit;
298 this->std_heap_copy = *mc_model_checker->process().get_heap();
299 this->processStates[0].initHeapInformation(heap1, i1);
300 this->processStates[1].initHeapInformation(heap2, i2);
304 // TODO, have a robust way to find it in O(1)
306 mc_mem_region_t MC_get_heap_region(simgrid::mc::Snapshot* snapshot)
308 for (auto& region : snapshot->snapshot_regions)
309 if (region->region_type() == simgrid::mc::RegionType::Heap)
311 xbt_die("No heap region");
315 int mmalloc_compare_heap(
316 simgrid::mc::StateComparator& state, simgrid::mc::Snapshot* snapshot1, simgrid::mc::Snapshot* snapshot2)
318 simgrid::mc::Process* process = &mc_model_checker->process();
320 /* Start comparison */
335 /* Check busy blocks */
338 malloc_info heapinfo_temp1;
339 malloc_info heapinfo_temp2;
340 malloc_info heapinfo_temp2b;
342 mc_mem_region_t heap_region1 = MC_get_heap_region(snapshot1);
343 mc_mem_region_t heap_region2 = MC_get_heap_region(snapshot2);
345 // This is the address of std_heap->heapinfo in the application process:
346 void* heapinfo_address = &((xbt_mheap_t) process->heap_address)->heapinfo;
348 // This is in snapshot do not use them directly:
349 const malloc_info* heapinfos1 = snapshot1->read<malloc_info*>(
350 (std::uint64_t)heapinfo_address, simgrid::mc::ProcessIndexMissing);
351 const malloc_info* heapinfos2 = snapshot2->read<malloc_info*>(
352 (std::uint64_t)heapinfo_address, simgrid::mc::ProcessIndexMissing);
354 while (i1 < state.heaplimit) {
356 const malloc_info* heapinfo1 = (const malloc_info*) MC_region_read(heap_region1, &heapinfo_temp1, &heapinfos1[i1], sizeof(malloc_info));
357 const malloc_info* heapinfo2 = (const malloc_info*) MC_region_read(heap_region2, &heapinfo_temp2, &heapinfos2[i1], sizeof(malloc_info));
359 if (heapinfo1->type == MMALLOC_TYPE_FREE || heapinfo1->type == MMALLOC_TYPE_HEAPINFO) { /* Free block */
364 if (heapinfo1->type < 0) {
365 fprintf(stderr, "Unkown mmalloc block type.\n");
369 addr_block1 = ((void*)(((ADDR2UINT(i1)) - 1) * BLOCKSIZE + (char*)state.std_heap_copy.heapbase));
371 if (heapinfo1->type == MMALLOC_TYPE_UNFRAGMENTED) { /* Large block */
373 if (is_stack(addr_block1)) {
374 for (k = 0; k < heapinfo1->busy_block.size; k++)
375 state.equals_to1_(i1 + k, 0) = HeapArea(i1, -1);
376 for (k = 0; k < heapinfo2->busy_block.size; k++)
377 state.equals_to2_(i1 + k, 0) = HeapArea(i1, -1);
378 i1 += heapinfo1->busy_block.size;
382 if (state.equals_to1_(i1, 0).valid) {
391 /* Try first to associate to same block in the other heap */
392 if (heapinfo2->type == heapinfo1->type
393 && state.equals_to2_(i1, 0).valid == 0) {
394 addr_block2 = (ADDR2UINT(i1) - 1) * BLOCKSIZE + (char*)state.std_heap_copy.heapbase;
395 res_compare = compare_heap_area(state, simgrid::mc::ProcessIndexMissing, addr_block1, addr_block2, snapshot1,
396 snapshot2, nullptr, nullptr, 0);
397 if (res_compare != 1) {
398 for (k = 1; k < heapinfo2->busy_block.size; k++)
399 state.equals_to2_(i1 + k, 0) = HeapArea(i1, -1);
400 for (k = 1; k < heapinfo1->busy_block.size; k++)
401 state.equals_to1_(i1 + k, 0) = HeapArea(i1, -1);
403 i1 += heapinfo1->busy_block.size;
407 while (i2 < state.heaplimit && not equal) {
409 addr_block2 = (ADDR2UINT(i2) - 1) * BLOCKSIZE + (char*)state.std_heap_copy.heapbase;
416 const malloc_info* heapinfo2b = (const malloc_info*) MC_region_read(heap_region2, &heapinfo_temp2b, &heapinfos2[i2], sizeof(malloc_info));
418 if (heapinfo2b->type != MMALLOC_TYPE_UNFRAGMENTED) {
423 if (state.equals_to2_(i2, 0).valid) {
428 res_compare = compare_heap_area(state, simgrid::mc::ProcessIndexMissing,
429 addr_block1, addr_block2, snapshot1, snapshot2,
430 nullptr, nullptr, 0);
432 if (res_compare != 1) {
433 for (k = 1; k < heapinfo2b->busy_block.size; k++)
434 state.equals_to2_(i2 + k, 0) = HeapArea(i1, -1);
435 for (k = 1; k < heapinfo1->busy_block.size; k++)
436 state.equals_to1_(i1 + k, 0) = HeapArea(i2, -1);
438 i1 += heapinfo1->busy_block.size;
445 XBT_DEBUG("Block %zu not found (size_used = %zu, addr = %p)", i1, heapinfo1->busy_block.busy_size, addr_block1);
446 i1 = state.heaplimit + 1;
451 } else { /* Fragmented block */
453 for (j1 = 0; j1 < (size_t) (BLOCKSIZE >> heapinfo1->type); j1++) {
455 if (heapinfo1->busy_frag.frag_size[j1] == -1) /* Free fragment */
458 if (state.equals_to1_(i1, j1).valid)
461 addr_frag1 = (void*)((char*)addr_block1 + (j1 << heapinfo1->type));
466 /* Try first to associate to same fragment in the other heap */
467 if (heapinfo2->type == heapinfo1->type && not state.equals_to2_(i1, j1).valid) {
468 addr_block2 = (ADDR2UINT(i1) - 1) * BLOCKSIZE +
469 (char *) state.std_heap_copy.heapbase;
471 (void *) ((char *) addr_block2 +
472 (j1 << heapinfo2->type));
473 res_compare = compare_heap_area(state, simgrid::mc::ProcessIndexMissing, addr_frag1, addr_frag2, snapshot1,
474 snapshot2, nullptr, nullptr, 0);
475 if (res_compare != 1)
479 while (i2 < state.heaplimit && not equal) {
481 const malloc_info* heapinfo2b = (const malloc_info*) MC_region_read(
482 heap_region2, &heapinfo_temp2b, &heapinfos2[i2],
483 sizeof(malloc_info));
485 if (heapinfo2b->type == MMALLOC_TYPE_FREE || heapinfo2b->type == MMALLOC_TYPE_HEAPINFO) {
490 // We currently do not match fragments with unfragmented blocks (maybe we should).
491 if (heapinfo2b->type == MMALLOC_TYPE_UNFRAGMENTED) {
496 if (heapinfo2b->type < 0) {
497 fprintf(stderr, "Unknown mmalloc block type.\n");
501 for (j2 = 0; j2 < (size_t) (BLOCKSIZE >> heapinfo2b->type);
504 if (i2 == i1 && j2 == j1)
507 if (state.equals_to2_(i2, j2).valid)
510 addr_block2 = (ADDR2UINT(i2) - 1) * BLOCKSIZE + (char*)state.std_heap_copy.heapbase;
511 addr_frag2 = (void*)((char*)addr_block2 + (j2 << heapinfo2b->type));
513 res_compare = compare_heap_area(state, simgrid::mc::ProcessIndexMissing, addr_frag1, addr_frag2, snapshot2,
514 snapshot2, nullptr, nullptr, 0);
515 if (res_compare != 1) {
525 XBT_DEBUG("Block %zu, fragment %zu not found (size_used = %zd, address = %p)\n", i1, j1,
526 heapinfo1->busy_frag.frag_size[j1], addr_frag1);
527 i2 = state.heaplimit + 1;
528 i1 = state.heaplimit + 1;
538 /* All blocks/fragments are equal to another block/fragment ? */
542 for(i = 1; i < state.heaplimit; i++) {
543 const malloc_info* heapinfo1 = (const malloc_info*) MC_region_read(
544 heap_region1, &heapinfo_temp1, &heapinfos1[i], sizeof(malloc_info));
546 if (heapinfo1->type == MMALLOC_TYPE_UNFRAGMENTED && i1 == state.heaplimit && heapinfo1->busy_block.busy_size > 0 &&
547 not state.equals_to1_(i, 0).valid) {
548 XBT_DEBUG("Block %zu not found (size used = %zu)", i, heapinfo1->busy_block.busy_size);
552 if (heapinfo1->type <= 0)
554 for (j = 0; j < (size_t) (BLOCKSIZE >> heapinfo1->type); j++)
555 if (i1 == state.heaplimit && heapinfo1->busy_frag.frag_size[j] > 0 && not state.equals_to1_(i, j).valid) {
556 XBT_DEBUG("Block %zu, Fragment %zu not found (size used = %zd)", i, j, heapinfo1->busy_frag.frag_size[j]);
561 if (i1 == state.heaplimit)
562 XBT_DEBUG("Number of blocks/fragments not found in heap1: %d", nb_diff1);
564 for (i=1; i < state.heaplimit; i++) {
565 const malloc_info* heapinfo2 = (const malloc_info*) MC_region_read(
566 heap_region2, &heapinfo_temp2, &heapinfos2[i], sizeof(malloc_info));
567 if (heapinfo2->type == MMALLOC_TYPE_UNFRAGMENTED && i1 == state.heaplimit && heapinfo2->busy_block.busy_size > 0 &&
568 not state.equals_to2_(i, 0).valid) {
569 XBT_DEBUG("Block %zu not found (size used = %zu)", i,
570 heapinfo2->busy_block.busy_size);
574 if (heapinfo2->type <= 0)
577 for (j = 0; j < (size_t) (BLOCKSIZE >> heapinfo2->type); j++)
578 if (i1 == state.heaplimit && heapinfo2->busy_frag.frag_size[j] > 0 && not state.equals_to2_(i, j).valid) {
579 XBT_DEBUG("Block %zu, Fragment %zu not found (size used = %zd)",
580 i, j, heapinfo2->busy_frag.frag_size[j]);
586 if (i1 == state.heaplimit)
587 XBT_DEBUG("Number of blocks/fragments not found in heap2: %d", nb_diff2);
589 return nb_diff1 > 0 || nb_diff2 > 0;
595 * @param real_area1 Process address for state 1
596 * @param real_area2 Process address for state 2
597 * @param snapshot1 Snapshot of state 1
598 * @param snapshot2 Snapshot of state 2
601 * @param check_ignore
603 static int compare_heap_area_without_type(
604 simgrid::mc::StateComparator& state, int process_index,
605 const void *real_area1, const void *real_area2,
606 simgrid::mc::Snapshot* snapshot1,
607 simgrid::mc::Snapshot* snapshot2,
608 HeapLocationPairs* previous, int size,
611 simgrid::mc::Process* process = &mc_model_checker->process();
612 mc_mem_region_t heap_region1 = MC_get_heap_region(snapshot1);
613 mc_mem_region_t heap_region2 = MC_get_heap_region(snapshot2);
615 for (int i = 0; i < size; ) {
617 if (check_ignore > 0) {
618 ssize_t ignore1 = heap_comparison_ignore_size(
619 state.processStates[0].to_ignore, (char *) real_area1 + i);
621 ssize_t ignore2 = heap_comparison_ignore_size(
622 state.processStates[1].to_ignore, (char *) real_area2 + i);
623 if (ignore2 == ignore1) {
636 if (MC_snapshot_region_memcmp(((char *) real_area1) + i, heap_region1, ((char *) real_area2) + i, heap_region2, 1) != 0) {
638 int pointer_align = (i / sizeof(void *)) * sizeof(void *);
639 const void* addr_pointed1 = snapshot1->read(
640 remote((void**)((char *) real_area1 + pointer_align)), process_index);
641 const void* addr_pointed2 = snapshot2->read(
642 remote((void**)((char *) real_area2 + pointer_align)), process_index);
644 if (process->in_maestro_stack(remote(addr_pointed1))
645 && process->in_maestro_stack(remote(addr_pointed2))) {
646 i = pointer_align + sizeof(void *);
650 if (addr_pointed1 > state.std_heap_copy.heapbase
651 && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1)
652 && addr_pointed2 > state.std_heap_copy.heapbase
653 && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2)) {
654 // Both addreses are in the heap:
655 int res_compare = compare_heap_area(state ,process_index,
656 addr_pointed1, addr_pointed2,
657 snapshot1, snapshot2, previous, nullptr, 0);
658 if (res_compare == 1)
660 i = pointer_align + sizeof(void *);
676 * @param real_area1 Process address for state 1
677 * @param real_area2 Process address for state 2
678 * @param snapshot1 Snapshot of state 1
679 * @param snapshot2 Snapshot of state 2
682 * @param area_size either a byte_size or an elements_count (?)
683 * @param check_ignore
684 * @param pointer_level
685 * @return 0 (same), 1 (different), -1 (unknown)
687 static int compare_heap_area_with_type(
688 simgrid::mc::StateComparator& state, int process_index,
689 const void *real_area1, const void *real_area2,
690 simgrid::mc::Snapshot* snapshot1,
691 simgrid::mc::Snapshot* snapshot2,
692 HeapLocationPairs* previous, simgrid::mc::Type* type,
693 int area_size, int check_ignore,
698 // HACK: This should not happen but in pratice, there are some
699 // DW_TAG_typedef without an associated DW_AT_type:
700 //<1><538832>: Abbrev Number: 111 (DW_TAG_typedef)
701 // <538833> DW_AT_name : (indirect string, offset: 0x2292f3): gregset_t
702 // <538837> DW_AT_decl_file : 98
703 // <538838> DW_AT_decl_line : 37
707 if (is_stack(real_area1) && is_stack(real_area2))
710 if (check_ignore > 0) {
711 ssize_t ignore1 = heap_comparison_ignore_size(
712 state.processStates[0].to_ignore, real_area1);
714 && heap_comparison_ignore_size(
715 state.processStates[1].to_ignore, real_area2) == ignore1)
719 simgrid::mc::Type* subtype;
720 simgrid::mc::Type* subsubtype;
723 const void* addr_pointed1;
724 const void* addr_pointed2;
726 mc_mem_region_t heap_region1 = MC_get_heap_region(snapshot1);
727 mc_mem_region_t heap_region2 = MC_get_heap_region(snapshot2);
729 switch (type->type) {
730 case DW_TAG_unspecified_type:
733 case DW_TAG_base_type:
734 if (not type->name.empty() && type->name == "char") { /* String, hence random (arbitrary ?) size */
735 if (real_area1 == real_area2)
738 return MC_snapshot_region_memcmp(real_area1, heap_region1, real_area2, heap_region2, area_size) != 0;
740 if (area_size != -1 && type->byte_size != area_size)
743 return MC_snapshot_region_memcmp(real_area1, heap_region1, real_area2, heap_region2, type->byte_size) != 0;
747 case DW_TAG_enumeration_type:
748 if (area_size != -1 && type->byte_size != area_size)
750 return MC_snapshot_region_memcmp(real_area1, heap_region1, real_area2, heap_region2, type->byte_size) != 0;
753 case DW_TAG_const_type:
754 case DW_TAG_volatile_type:
756 type = type->subtype;
759 case DW_TAG_array_type:
760 subtype = type->subtype;
761 switch (subtype->type) {
762 case DW_TAG_unspecified_type:
765 case DW_TAG_base_type:
766 case DW_TAG_enumeration_type:
767 case DW_TAG_pointer_type:
768 case DW_TAG_reference_type:
769 case DW_TAG_rvalue_reference_type:
770 case DW_TAG_structure_type:
771 case DW_TAG_class_type:
772 case DW_TAG_union_type:
773 if (subtype->full_type)
774 subtype = subtype->full_type;
775 elm_size = subtype->byte_size;
777 // TODO, just remove the type indirection?
778 case DW_TAG_const_type:
780 case DW_TAG_volatile_type:
781 subsubtype = subtype->subtype;
782 if (subsubtype->full_type)
783 subsubtype = subsubtype->full_type;
784 elm_size = subsubtype->byte_size;
790 for (int i = 0; i < type->element_count; i++) {
791 // TODO, add support for variable stride (DW_AT_byte_stride)
793 compare_heap_area_with_type(state, process_index,
794 (char *) real_area1 + (i * elm_size),
795 (char *) real_area2 + (i * elm_size),
796 snapshot1, snapshot2, previous,
797 type->subtype, subtype->byte_size,
798 check_ignore, pointer_level);
804 case DW_TAG_reference_type:
805 case DW_TAG_rvalue_reference_type:
806 case DW_TAG_pointer_type:
807 if (type->subtype && type->subtype->type == DW_TAG_subroutine_type) {
808 addr_pointed1 = snapshot1->read(remote((void**)real_area1), process_index);
809 addr_pointed2 = snapshot2->read(remote((void**)real_area2), process_index);
810 return (addr_pointed1 != addr_pointed2);
813 if (pointer_level <= 1) {
814 addr_pointed1 = snapshot1->read(remote((void**)real_area1), process_index);
815 addr_pointed2 = snapshot2->read(remote((void**)real_area2), process_index);
816 if (addr_pointed1 > state.std_heap_copy.heapbase
817 && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1)
818 && addr_pointed2 > state.std_heap_copy.heapbase
819 && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2))
820 return compare_heap_area(state, process_index,
821 addr_pointed1, addr_pointed2, snapshot1,
822 snapshot2, previous, type->subtype,
825 return (addr_pointed1 != addr_pointed2);
827 for (size_t i = 0; i < (area_size / sizeof(void *)); i++) {
828 addr_pointed1 = snapshot1->read(
829 remote((void**)((char*) real_area1 + i * sizeof(void *))),
831 addr_pointed2 = snapshot2->read(
832 remote((void**)((char*) real_area2 + i * sizeof(void *))),
834 if (addr_pointed1 > state.std_heap_copy.heapbase
835 && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1)
836 && addr_pointed2 > state.std_heap_copy.heapbase
837 && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2))
839 compare_heap_area(state, process_index,
840 addr_pointed1, addr_pointed2, snapshot1,
841 snapshot2, previous, type->subtype,
844 res = (addr_pointed1 != addr_pointed2);
850 case DW_TAG_structure_type:
851 case DW_TAG_class_type:
853 type = type->full_type;
854 if (area_size != -1 && type->byte_size != area_size) {
855 if (area_size <= type->byte_size || area_size % type->byte_size != 0)
857 for (size_t i = 0; i < (size_t)(area_size / type->byte_size); i++) {
858 int res = compare_heap_area_with_type(state, process_index,
859 (char *) real_area1 + i * type->byte_size,
860 (char *) real_area2 + i * type->byte_size,
861 snapshot1, snapshot2, previous, type, -1,
867 for(simgrid::mc::Member& member : type->members) {
868 // TODO, optimize this? (for the offset case)
869 void *real_member1 = simgrid::dwarf::resolve_member(
870 real_area1, type, &member, (simgrid::mc::AddressSpace*) snapshot1, process_index);
871 void *real_member2 = simgrid::dwarf::resolve_member(
872 real_area2, type, &member, (simgrid::mc::AddressSpace*) snapshot2, process_index);
873 int res = compare_heap_area_with_type(
874 state, process_index, real_member1, real_member2,
875 snapshot1, snapshot2,
876 previous, member.type, -1,
884 case DW_TAG_union_type:
885 return compare_heap_area_without_type(state, process_index, real_area1, real_area2,
886 snapshot1, snapshot2, previous,
887 type->byte_size, check_ignore);
893 xbt_die("Unreachable");
896 /** Infer the type of a part of the block from the type of the block
898 * TODO, handle DW_TAG_array_type as well as arrays of the object ((*p)[5], p[5])
900 * TODO, handle subfields ((*p).bar.foo, (*p)[5].bar…)
902 * @param type DWARF type ID of the root address
904 * @return DWARF type ID for given offset
906 static simgrid::mc::Type* get_offset_type(void *real_base_address, simgrid::mc::Type* type,
907 int offset, int area_size,
908 simgrid::mc::Snapshot* snapshot, int process_index)
911 // Beginning of the block, the infered variable type if the type of the block:
915 switch (type->type) {
917 case DW_TAG_structure_type:
918 case DW_TAG_class_type:
920 type = type->full_type;
921 if (area_size != -1 && type->byte_size != area_size) {
922 if (area_size > type->byte_size && area_size % type->byte_size == 0)
928 for(simgrid::mc::Member& member : type->members) {
929 if (member.has_offset_location()) {
930 // We have the offset, use it directly (shortcut):
931 if (member.offset() == offset)
934 void* real_member = simgrid::dwarf::resolve_member(real_base_address, type, &member, snapshot, process_index);
935 if ((char*)real_member - (char*)real_base_address == offset)
942 /* FIXME: other cases ? */
950 * @param area1 Process address for state 1
951 * @param area2 Process address for state 2
952 * @param snapshot1 Snapshot of state 1
953 * @param snapshot2 Snapshot of state 2
954 * @param previous Pairs of blocks already compared on the current path (or nullptr)
955 * @param type_id Type of variable
956 * @param pointer_level
957 * @return 0 (same), 1 (different), -1
960 int compare_heap_area(simgrid::mc::StateComparator& state, int process_index,
961 const void *area1, const void *area2,
962 simgrid::mc::Snapshot* snapshot1,
963 simgrid::mc::Snapshot* snapshot2,
964 HeapLocationPairs* previous,
965 simgrid::mc::Type* type, int pointer_level)
967 simgrid::mc::Process* process = &mc_model_checker->process();
975 int check_ignore = 0;
977 void* real_addr_block1;
978 void* real_addr_block2;
979 void* real_addr_frag1;
980 void* real_addr_frag2;
987 simgrid::mc::Type* new_type1 = nullptr;
988 simgrid::mc::Type* new_type2 = nullptr;
990 bool match_pairs = false;
992 // This is the address of std_heap->heapinfo in the application process:
993 void* heapinfo_address = &((xbt_mheap_t) process->heap_address)->heapinfo;
995 const malloc_info* heapinfos1 = snapshot1->read(remote((const malloc_info**)heapinfo_address), process_index);
996 const malloc_info* heapinfos2 = snapshot2->read(remote((const malloc_info**)heapinfo_address), process_index);
998 malloc_info heapinfo_temp1, heapinfo_temp2;
1000 simgrid::mc::HeapLocationPairs current;
1001 if (previous == nullptr) {
1002 previous = ¤t;
1006 // Get block number:
1007 block1 = ((char*)area1 - (char*)state.std_heap_copy.heapbase) / BLOCKSIZE + 1;
1008 block2 = ((char*)area2 - (char*)state.std_heap_copy.heapbase) / BLOCKSIZE + 1;
1010 // If either block is a stack block:
1011 if (is_block_stack((int) block1) && is_block_stack((int) block2)) {
1012 previous->insert(simgrid::mc::makeHeapLocationPair(block1, -1, block2, -1));
1014 state.match_equals(previous);
1018 // If either block is not in the expected area of memory:
1019 if (((char*)area1 < (char*)state.std_heap_copy.heapbase) || (block1 > (ssize_t)state.processStates[0].heapsize) ||
1020 (block1 < 1) || ((char*)area2 < (char*)state.std_heap_copy.heapbase) ||
1021 (block2 > (ssize_t)state.processStates[1].heapsize) || (block2 < 1)) {
1025 // Process address of the block:
1026 real_addr_block1 = (ADDR2UINT(block1) - 1) * BLOCKSIZE + (char*)state.std_heap_copy.heapbase;
1027 real_addr_block2 = (ADDR2UINT(block2) - 1) * BLOCKSIZE + (char*)state.std_heap_copy.heapbase;
1030 if (type->full_type)
1031 type = type->full_type;
1033 // This assume that for "boring" types (volatile ...) byte_size is absent:
1034 while (type->byte_size == 0 && type->subtype != nullptr)
1035 type = type->subtype;
1038 if (type->type == DW_TAG_pointer_type ||
1039 (type->type == DW_TAG_base_type && not type->name.empty() && type->name == "char"))
1042 type_size = type->byte_size;
1046 mc_mem_region_t heap_region1 = MC_get_heap_region(snapshot1);
1047 mc_mem_region_t heap_region2 = MC_get_heap_region(snapshot2);
1049 const malloc_info* heapinfo1 = (const malloc_info*) MC_region_read(
1050 heap_region1, &heapinfo_temp1, &heapinfos1[block1], sizeof(malloc_info));
1051 const malloc_info* heapinfo2 = (const malloc_info*) MC_region_read(
1052 heap_region2, &heapinfo_temp2, &heapinfos2[block2], sizeof(malloc_info));
1054 if ((heapinfo1->type == MMALLOC_TYPE_FREE || heapinfo1->type==MMALLOC_TYPE_HEAPINFO)
1055 && (heapinfo2->type == MMALLOC_TYPE_FREE || heapinfo2->type ==MMALLOC_TYPE_HEAPINFO)) {
1058 state.match_equals(previous);
1062 if (heapinfo1->type == MMALLOC_TYPE_UNFRAGMENTED && heapinfo2->type == MMALLOC_TYPE_UNFRAGMENTED) {
1063 /* Complete block */
1065 // TODO, lookup variable type from block type as done for fragmented blocks
1067 offset1 = (char*)area1 - (char*)real_addr_block1;
1068 offset2 = (char*)area2 - (char*)real_addr_block2;
1070 if (state.equals_to1_(block1, 0).valid && state.equals_to2_(block2, 0).valid && state.blocksEqual(block1, block2)) {
1072 state.match_equals(previous);
1076 if (type_size != -1) {
1077 if (type_size != (ssize_t) heapinfo1->busy_block.busy_size
1078 && type_size != (ssize_t) heapinfo2->busy_block.busy_size
1079 && (type->name.empty() || type->name == "struct s_smx_context")) {
1081 state.match_equals(previous);
1086 if (heapinfo1->busy_block.size != heapinfo2->busy_block.size)
1088 if (heapinfo1->busy_block.busy_size != heapinfo2->busy_block.busy_size)
1091 if (not previous->insert(simgrid::mc::makeHeapLocationPair(block1, -1, block2, -1)).second) {
1093 state.match_equals(previous);
1097 size = heapinfo1->busy_block.busy_size;
1099 // Remember (basic) type inference.
1100 // The current data structure only allows us to do this for the whole block.
1101 if (type != nullptr && area1 == real_addr_block1)
1102 state.types1_(block1, 0) = type;
1103 if (type != nullptr && area2 == real_addr_block2)
1104 state.types2_(block2, 0) = type;
1108 state.match_equals(previous);
1115 if (heapinfo1->busy_block.ignore > 0
1116 && heapinfo2->busy_block.ignore == heapinfo1->busy_block.ignore)
1117 check_ignore = heapinfo1->busy_block.ignore;
1119 } else if ((heapinfo1->type > 0) && (heapinfo2->type > 0)) { /* Fragmented block */
1122 frag1 = ((uintptr_t)(ADDR2UINT(area1) % (BLOCKSIZE))) >> heapinfo1->type;
1123 frag2 = ((uintptr_t)(ADDR2UINT(area2) % (BLOCKSIZE))) >> heapinfo2->type;
1125 // Process address of the fragment:
1126 real_addr_frag1 = (void*)((char*)real_addr_block1 + (frag1 << heapinfo1->type));
1127 real_addr_frag2 = (void*)((char*)real_addr_block2 + (frag2 << heapinfo2->type));
1129 // Check the size of the fragments against the size of the type:
1130 if (type_size != -1) {
1131 if (heapinfo1->busy_frag.frag_size[frag1] == -1 || heapinfo2->busy_frag.frag_size[frag2] == -1) {
1133 state.match_equals(previous);
1137 if (type_size != heapinfo1->busy_frag.frag_size[frag1]
1138 || type_size != heapinfo2->busy_frag.frag_size[frag2]) {
1140 state.match_equals(previous);
1145 // Check if the blocks are already matched together:
1146 if (state.equals_to1_(block1, frag1).valid && state.equals_to2_(block2, frag2).valid) {
1147 if (offset1==offset2 && state.fragmentsEqual(block1, frag1, block2, frag2)) {
1149 state.match_equals(previous);
1153 // Compare the size of both fragments:
1154 if (heapinfo1->busy_frag.frag_size[frag1] != heapinfo2->busy_frag.frag_size[frag2]) {
1155 if (type_size == -1) {
1157 state.match_equals(previous);
1163 // Size of the fragment:
1164 size = heapinfo1->busy_frag.frag_size[frag1];
1166 // Remember (basic) type inference.
1167 // The current data structure only allows us to do this for the whole fragment.
1168 if (type != nullptr && area1 == real_addr_frag1)
1169 state.types1_(block1, frag1) = type;
1170 if (type != nullptr && area2 == real_addr_frag2)
1171 state.types2_(block2, frag2) = type;
1173 // The type of the variable is already known:
1178 // Type inference from the block type.
1179 else if (state.types1_(block1, frag1) != nullptr || state.types2_(block2, frag2) != nullptr) {
1181 offset1 = (char*)area1 - (char*)real_addr_frag1;
1182 offset2 = (char*)area2 - (char*)real_addr_frag2;
1184 if (state.types1_(block1, frag1) != nullptr && state.types2_(block2, frag2) != nullptr) {
1186 get_offset_type(real_addr_frag1, state.types1_(block1, frag1), offset1, size, snapshot1, process_index);
1188 get_offset_type(real_addr_frag2, state.types2_(block2, frag2), offset1, size, snapshot2, process_index);
1189 } else if (state.types1_(block1, frag1) != nullptr) {
1191 get_offset_type(real_addr_frag1, state.types1_(block1, frag1), offset1, size, snapshot1, process_index);
1193 get_offset_type(real_addr_frag2, state.types1_(block1, frag1), offset2, size, snapshot2, process_index);
1194 } else if (state.types2_(block2, frag2) != nullptr) {
1196 get_offset_type(real_addr_frag1, state.types2_(block2, frag2), offset1, size, snapshot1, process_index);
1198 get_offset_type(real_addr_frag2, state.types2_(block2, frag2), offset2, size, snapshot2, process_index);
1201 state.match_equals(previous);
1205 if (new_type1 != nullptr && new_type2 != nullptr && new_type1 != new_type2) {
1208 while (type->byte_size == 0 && type->subtype != nullptr)
1209 type = type->subtype;
1210 new_size1 = type->byte_size;
1213 while (type->byte_size == 0 && type->subtype != nullptr)
1214 type = type->subtype;
1215 new_size2 = type->byte_size;
1219 state.match_equals(previous);
1224 if (new_size1 > 0 && new_size1 == new_size2) {
1229 if (offset1 == 0 && offset2 == 0 &&
1230 not previous->insert(simgrid::mc::makeHeapLocationPair(block1, frag1, block2, frag2)).second) {
1232 state.match_equals(previous);
1238 state.match_equals(previous);
1242 if ((heapinfo1->busy_frag.ignore[frag1] > 0) &&
1243 (heapinfo2->busy_frag.ignore[frag2] == heapinfo1->busy_frag.ignore[frag1]))
1244 check_ignore = heapinfo1->busy_frag.ignore[frag1];
1250 /* Start comparison */
1252 res_compare = compare_heap_area_with_type(state, process_index, area1, area2, snapshot1, snapshot2, previous, type,
1253 size, check_ignore, pointer_level);
1255 res_compare = compare_heap_area_without_type(state, process_index, area1, area2, snapshot1, snapshot2, previous,
1256 size, check_ignore);
1258 if (res_compare == 1)
1262 state.match_equals(previous);
1269 /************************** Snapshot comparison *******************************/
1270 /******************************************************************************/
1272 static int compare_areas_with_type(simgrid::mc::StateComparator& state,
1274 void* real_area1, simgrid::mc::Snapshot* snapshot1, mc_mem_region_t region1,
1275 void* real_area2, simgrid::mc::Snapshot* snapshot2, mc_mem_region_t region2,
1276 simgrid::mc::Type* type, int pointer_level)
1278 simgrid::mc::Process* process = &mc_model_checker->process();
1280 simgrid::mc::Type* subtype;
1281 simgrid::mc::Type* subsubtype;
1287 switch (type->type) {
1288 case DW_TAG_unspecified_type:
1291 case DW_TAG_base_type:
1292 case DW_TAG_enumeration_type:
1293 case DW_TAG_union_type:
1294 return MC_snapshot_region_memcmp(real_area1, region1, real_area2, region2, type->byte_size) != 0;
1295 case DW_TAG_typedef:
1296 case DW_TAG_volatile_type:
1297 case DW_TAG_const_type:
1299 type = type->subtype;
1301 case DW_TAG_array_type:
1302 subtype = type->subtype;
1303 switch (subtype->type) {
1304 case DW_TAG_unspecified_type:
1307 case DW_TAG_base_type:
1308 case DW_TAG_enumeration_type:
1309 case DW_TAG_pointer_type:
1310 case DW_TAG_reference_type:
1311 case DW_TAG_rvalue_reference_type:
1312 case DW_TAG_structure_type:
1313 case DW_TAG_class_type:
1314 case DW_TAG_union_type:
1315 if (subtype->full_type)
1316 subtype = subtype->full_type;
1317 elm_size = subtype->byte_size;
1319 case DW_TAG_const_type:
1320 case DW_TAG_typedef:
1321 case DW_TAG_volatile_type:
1322 subsubtype = subtype->subtype;
1323 if (subsubtype->full_type)
1324 subsubtype = subsubtype->full_type;
1325 elm_size = subsubtype->byte_size;
1331 for (i = 0; i < type->element_count; i++) {
1332 size_t off = i * elm_size;
1333 res = compare_areas_with_type(state, process_index,
1334 (char*) real_area1 + off, snapshot1, region1,
1335 (char*) real_area2 + off, snapshot2, region2,
1336 type->subtype, pointer_level);
1341 case DW_TAG_pointer_type:
1342 case DW_TAG_reference_type:
1343 case DW_TAG_rvalue_reference_type:
1345 void* addr_pointed1 = MC_region_read_pointer(region1, real_area1);
1346 void* addr_pointed2 = MC_region_read_pointer(region2, real_area2);
1348 if (type->subtype && type->subtype->type == DW_TAG_subroutine_type)
1349 return (addr_pointed1 != addr_pointed2);
1350 if (addr_pointed1 == nullptr && addr_pointed2 == nullptr)
1352 if (addr_pointed1 == nullptr || addr_pointed2 == nullptr)
1354 if (not state.compared_pointers.insert(std::make_pair(addr_pointed1, addr_pointed2)).second)
1359 // Some cases are not handled here:
1360 // * the pointers lead to different areas (one to the heap, the other to the RW segment ...);
1361 // * a pointer leads to the read-only segment of the current object;
1362 // * a pointer lead to a different ELF object.
1364 if (addr_pointed1 > process->heap_address
1365 && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1)) {
1366 if (not(addr_pointed2 > process->heap_address && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2)))
1368 // The pointers are both in the heap:
1369 return simgrid::mc::compare_heap_area(state,
1370 process_index, addr_pointed1, addr_pointed2, snapshot1,
1371 snapshot2, nullptr, type->subtype, pointer_level);
1374 // The pointers are both in the current object R/W segment:
1375 else if (region1->contain(simgrid::mc::remote(addr_pointed1))) {
1376 if (not region2->contain(simgrid::mc::remote(addr_pointed2)))
1378 if (not type->type_id)
1379 return (addr_pointed1 != addr_pointed2);
1381 return compare_areas_with_type(state, process_index,
1382 addr_pointed1, snapshot1, region1,
1383 addr_pointed2, snapshot2, region2,
1384 type->subtype, pointer_level);
1387 // TODO, We do not handle very well the case where
1388 // it belongs to a different (non-heap) region from the current one.
1391 return (addr_pointed1 != addr_pointed2);
1395 case DW_TAG_structure_type:
1396 case DW_TAG_class_type:
1397 for(simgrid::mc::Member& member : type->members) {
1398 void *member1 = simgrid::dwarf::resolve_member(
1399 real_area1, type, &member, snapshot1, process_index);
1400 void *member2 = simgrid::dwarf::resolve_member(
1401 real_area2, type, &member, snapshot2, process_index);
1402 mc_mem_region_t subregion1 = mc_get_region_hinted(member1, snapshot1, process_index, region1);
1403 mc_mem_region_t subregion2 = mc_get_region_hinted(member2, snapshot2, process_index, region2);
1405 compare_areas_with_type(state, process_index,
1406 member1, snapshot1, subregion1,
1407 member2, snapshot2, subregion2,
1408 member.type, pointer_level);
1413 case DW_TAG_subroutine_type:
1417 XBT_VERB("Unknown case: %d", type->type);
1424 static int compare_global_variables(
1425 simgrid::mc::StateComparator& state,
1426 simgrid::mc::ObjectInformation* object_info,
1428 mc_mem_region_t r1, mc_mem_region_t r2,
1429 simgrid::mc::Snapshot* snapshot1, simgrid::mc::Snapshot* snapshot2)
1431 xbt_assert(r1 && r2, "Missing region.");
1434 if (r1->storage_type() == simgrid::mc::StorageType::Privatized) {
1435 xbt_assert(process_index >= 0);
1436 if (r2->storage_type() != simgrid::mc::StorageType::Privatized)
1439 size_t process_count = MC_smpi_process_count();
1440 xbt_assert(process_count == r1->privatized_data().size()
1441 && process_count == r2->privatized_data().size());
1443 // Compare the global variables separately for each simulates process:
1444 for (size_t process_index = 0; process_index < process_count; process_index++) {
1445 if (compare_global_variables(state,
1446 object_info, process_index,
1447 &r1->privatized_data()[process_index],
1448 &r2->privatized_data()[process_index],
1449 snapshot1, snapshot2))
1455 xbt_assert(r1->storage_type() != simgrid::mc::StorageType::Privatized);
1457 xbt_assert(r2->storage_type() != simgrid::mc::StorageType::Privatized);
1459 std::vector<simgrid::mc::Variable>& variables = object_info->global_variables;
1461 for (simgrid::mc::Variable& current_var : variables) {
1463 // If the variable is not in this object, skip it:
1464 // We do not expect to find a pointer to something which is not reachable
1465 // by the global variables.
1466 if ((char *) current_var.address < (char *) object_info->start_rw
1467 || (char *) current_var.address > (char *) object_info->end_rw)
1470 simgrid::mc::Type* bvariable_type = current_var.type;
1471 int res = compare_areas_with_type(state, process_index,
1472 (char *) current_var.address, snapshot1, r1,
1473 (char *) current_var.address, snapshot2, r2,
1476 XBT_VERB("Global variable %s (%p) is different between snapshots",
1477 current_var.name.c_str(),
1478 (char *) current_var.address);
1488 static int compare_local_variables(simgrid::mc::StateComparator& state,
1490 simgrid::mc::Snapshot* snapshot1,
1491 simgrid::mc::Snapshot* snapshot2,
1492 mc_snapshot_stack_t stack1,
1493 mc_snapshot_stack_t stack2)
1495 if (stack1->local_variables.size() != stack2->local_variables.size()) {
1496 XBT_VERB("Different number of local variables");
1500 unsigned int cursor = 0;
1501 local_variable_t current_var1, current_var2;
1503 while (cursor < stack1->local_variables.size()) {
1504 current_var1 = &stack1->local_variables[cursor];
1505 current_var2 = &stack1->local_variables[cursor];
1506 if (current_var1->name != current_var2->name
1507 || current_var1->subprogram != current_var2->subprogram
1508 || current_var1->ip != current_var2->ip) {
1509 // TODO, fix current_varX->subprogram->name to include name if DW_TAG_inlined_subprogram
1511 ("Different name of variable (%s - %s) "
1512 "or frame (%s - %s) or ip (%lu - %lu)",
1513 current_var1->name.c_str(),
1514 current_var2->name.c_str(),
1515 current_var1->subprogram->name.c_str(),
1516 current_var2->subprogram->name.c_str(),
1517 current_var1->ip, current_var2->ip);
1520 // TODO, fix current_varX->subprogram->name to include name if DW_TAG_inlined_subprogram
1522 simgrid::mc::Type* subtype = current_var1->type;
1524 compare_areas_with_type(state, process_index,
1525 current_var1->address, snapshot1, mc_get_snapshot_region(current_var1->address, snapshot1, process_index),
1526 current_var2->address, snapshot2, mc_get_snapshot_region(current_var2->address, snapshot2, process_index),
1530 // TODO, fix current_varX->subprogram->name to include name if DW_TAG_inlined_subprogram
1532 ("Local variable %s (%p - %p) in frame %s "
1533 "is different between snapshots",
1534 current_var1->name.c_str(),
1535 current_var1->address,
1536 current_var2->address,
1537 current_var1->subprogram->name.c_str());
1548 static std::unique_ptr<simgrid::mc::StateComparator> state_comparator;
1550 int snapshot_compare(int num1, simgrid::mc::Snapshot* s1, int num2, simgrid::mc::Snapshot* s2)
1552 // TODO, make this a field of ModelChecker or something similar
1554 if (state_comparator == nullptr)
1555 state_comparator = std::unique_ptr<StateComparator>(new StateComparator());
1557 state_comparator->clear();
1559 simgrid::mc::Process* process = &mc_model_checker->process();
1563 int hash_result = 0;
1565 hash_result = (s1->hash != s2->hash);
1567 XBT_VERB("(%d - %d) Different hash: 0x%" PRIx64 "--0x%" PRIx64, num1, num2, s1->hash, s2->hash);
1572 XBT_VERB("(%d - %d) Same hash: 0x%" PRIx64, num1, num2, s1->hash);
1575 /* Compare enabled processes */
1576 if (s1->enabled_processes != s2->enabled_processes) {
1577 XBT_VERB("(%d - %d) Different amount of enabled processes", num1, num2);
1581 /* Compare size of stacks */
1583 for (unsigned long i = 0; i < s1->stacks.size(); i++) {
1584 size_t size_used1 = s1->stack_sizes[i];
1585 size_t size_used2 = s2->stack_sizes[i];
1586 if (size_used1 != size_used2) {
1588 XBT_DEBUG("(%d - %d) Different size used in stacks: %zu - %zu", num1, num2, size_used1, size_used2);
1593 XBT_VERB("(%d - %d) Different size used in stacks: %zu - %zu", num1, num2, size_used1, size_used2);
1599 if (is_diff) // do not proceed if there is any stacks that don't match
1602 /* Init heap information used in heap comparison algorithm */
1603 xbt_mheap_t heap1 = (xbt_mheap_t)s1->read_bytes(
1604 alloca(sizeof(struct mdesc)), sizeof(struct mdesc),
1605 remote(process->heap_address),
1606 simgrid::mc::ProcessIndexMissing, simgrid::mc::ReadOptions::lazy());
1607 xbt_mheap_t heap2 = (xbt_mheap_t)s2->read_bytes(
1608 alloca(sizeof(struct mdesc)), sizeof(struct mdesc),
1609 remote(process->heap_address),
1610 simgrid::mc::ProcessIndexMissing, simgrid::mc::ReadOptions::lazy());
1611 int res_init = state_comparator->initHeapInformation(heap1, heap2, &s1->to_ignore, &s2->to_ignore);
1613 if (res_init == -1) {
1615 XBT_DEBUG("(%d - %d) Different heap information", num1, num2);
1619 XBT_VERB("(%d - %d) Different heap information", num1, num2);
1626 /* Stacks comparison */
1628 for (unsigned int cursor = 0; cursor < s1->stacks.size(); cursor++) {
1629 mc_snapshot_stack_t stack1 = &s1->stacks[cursor];
1630 mc_snapshot_stack_t stack2 = &s2->stacks[cursor];
1632 if (stack1->process_index != stack2->process_index) {
1634 XBT_DEBUG("(%d - %d) Stacks with different process index (%i vs %i)", num1, num2,
1635 stack1->process_index, stack2->process_index);
1637 else diff_local = compare_local_variables(*state_comparator,
1638 stack1->process_index, s1, s2, stack1, stack2);
1639 if (diff_local > 0) {
1641 XBT_DEBUG("(%d - %d) Different local variables between stacks %d", num1,
1648 XBT_VERB("(%d - %d) Different local variables between stacks %d", num1,
1657 size_t regions_count = s1->snapshot_regions.size();
1658 // TODO, raise a difference instead?
1659 xbt_assert(regions_count == s2->snapshot_regions.size());
1661 for (size_t k = 0; k != regions_count; ++k) {
1662 mc_mem_region_t region1 = s1->snapshot_regions[k].get();
1663 mc_mem_region_t region2 = s2->snapshot_regions[k].get();
1666 if (region1->region_type() != simgrid::mc::RegionType::Data)
1669 xbt_assert(region1->region_type() == region2->region_type());
1670 xbt_assert(region1->object_info() == region2->object_info());
1671 xbt_assert(region1->object_info());
1673 std::string const& name = region1->object_info()->file_name;
1675 /* Compare global variables */
1676 if (compare_global_variables(*state_comparator, region1->object_info(), simgrid::mc::ProcessIndexDisabled, region1,
1680 XBT_DEBUG("(%d - %d) Different global variables in %s",
1681 num1, num2, name.c_str());
1685 XBT_VERB("(%d - %d) Different global variables in %s",
1686 num1, num2, name.c_str());
1695 if (simgrid::mc::mmalloc_compare_heap(*state_comparator, s1, s2) > 0) {
1698 XBT_DEBUG("(%d - %d) Different heap (mmalloc_compare)", num1, num2);
1703 XBT_VERB("(%d - %d) Different heap (mmalloc_compare)", num1, num2);
1710 if (errors || hash_result)
1711 XBT_VERB("(%d - %d) Difference found", num1, num2);
1713 XBT_VERB("(%d - %d) No difference found", num1, num2);
1716 #if defined(MC_DEBUG) && defined(MC_VERBOSE)
1718 // * false positive SHOULD be avoided.
1719 // * There MUST not be any false negative.
1721 XBT_VERB("(%d - %d) State equality hash test is %s %s", num1, num2,
1722 (hash_result != 0) == (errors != 0) ? "true" : "false", not hash_result ? "positive" : "negative");
1726 return errors > 0 || hash_result;