1 /* Copyright (c) 2008-2019. 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 */
8 #include "src/mc/mc_config.hpp"
9 #include "src/mc/mc_private.hpp"
10 #include "src/mc/mc_smx.hpp"
11 #include "src/mc/sosp/Snapshot.hpp"
13 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_compare, xbt, "Logging specific to mc_compare in mc");
15 using simgrid::mc::remote;
20 /*********************************** Heap comparison ***********************************/
21 /***************************************************************************************/
28 HeapLocation() = default;
29 HeapLocation(int block, int fragment = 0) : block_(block), fragment_(fragment) {}
31 bool operator==(HeapLocation const& that) const
33 return block_ == that.block_ && fragment_ == that.fragment_;
35 bool operator<(HeapLocation const& that) const
37 return std::make_pair(block_, fragment_) < std::make_pair(that.block_, that.fragment_);
41 typedef std::array<HeapLocation, 2> HeapLocationPair;
42 typedef std::set<HeapLocationPair> HeapLocationPairs;
44 struct ProcessComparisonState;
45 struct StateComparator;
48 HeapLocationPair makeHeapLocationPair(int block1, int fragment1, int block2, int fragment2)
50 return HeapLocationPair{{HeapLocation(block1, fragment1), HeapLocation(block2, fragment2)}};
53 class HeapArea : public HeapLocation {
57 explicit HeapArea(int block) : valid_(true) { block_ = block; }
58 HeapArea(int block, int fragment) : valid_(true)
65 class ProcessComparisonState {
67 std::vector<simgrid::mc::IgnoredHeapRegion>* to_ignore = nullptr;
68 std::vector<HeapArea> equals_to;
69 std::vector<simgrid::mc::Type*> types;
70 std::size_t heapsize = 0;
72 void initHeapInformation(xbt_mheap_t heap, std::vector<simgrid::mc::IgnoredHeapRegion>* i);
75 static int compare_heap_area(StateComparator& state, const void* area1, const void* area2, Snapshot* snapshot1,
76 Snapshot* snapshot2, HeapLocationPairs* previous, Type* type, int pointer_level);
78 class StateComparator {
80 s_xbt_mheap_t std_heap_copy;
81 std::size_t heaplimit;
82 std::array<ProcessComparisonState, 2> processStates;
84 std::unordered_set<std::pair<void*, void*>, simgrid::xbt::hash<std::pair<void*, void*>>> compared_pointers;
88 compared_pointers.clear();
91 int initHeapInformation(
92 xbt_mheap_t heap1, xbt_mheap_t heap2,
93 std::vector<simgrid::mc::IgnoredHeapRegion>* i1,
94 std::vector<simgrid::mc::IgnoredHeapRegion>* i2);
96 HeapArea& equals_to1_(std::size_t i, std::size_t j)
98 return processStates[0].equals_to[ MAX_FRAGMENT_PER_BLOCK * i + j];
100 HeapArea& equals_to2_(std::size_t i, std::size_t j)
102 return processStates[1].equals_to[ MAX_FRAGMENT_PER_BLOCK * i + j];
104 Type*& types1_(std::size_t i, std::size_t j)
106 return processStates[0].types[ MAX_FRAGMENT_PER_BLOCK * i + j];
108 Type*& types2_(std::size_t i, std::size_t j)
110 return processStates[1].types[ MAX_FRAGMENT_PER_BLOCK * i + j];
113 HeapArea const& equals_to1_(std::size_t i, std::size_t j) const
115 return processStates[0].equals_to[ MAX_FRAGMENT_PER_BLOCK * i + j];
117 HeapArea const& equals_to2_(std::size_t i, std::size_t j) const
119 return processStates[1].equals_to[ MAX_FRAGMENT_PER_BLOCK * i + j];
121 Type* const& types1_(std::size_t i, std::size_t j) const
123 return processStates[0].types[ MAX_FRAGMENT_PER_BLOCK * i + j];
125 Type* const& types2_(std::size_t i, std::size_t j) const
127 return processStates[1].types[ MAX_FRAGMENT_PER_BLOCK * i + j];
130 /** Check whether two blocks are known to be matching
132 * @param b1 Block of state 1
133 * @param b2 Block of state 2
134 * @return if the blocks are known to be matching
136 bool blocksEqual(int b1, int b2) const
138 return this->equals_to1_(b1, 0).block_ == b2 && this->equals_to2_(b2, 0).block_ == b1;
141 /** Check whether two fragments are known to be matching
143 * @param b1 Block of state 1
144 * @param f1 Fragment of state 1
145 * @param b2 Block of state 2
146 * @param f2 Fragment of state 2
147 * @return if the fragments are known to be matching
149 int fragmentsEqual(int b1, int f1, int b2, int f2) const
151 return this->equals_to1_(b1, f1).block_ == b2 && this->equals_to1_(b1, f1).fragment_ == f2 &&
152 this->equals_to2_(b2, f2).block_ == b1 && this->equals_to2_(b2, f2).fragment_ == f1;
155 void match_equals(HeapLocationPairs* list);
161 /************************************************************************************/
163 static ssize_t heap_comparison_ignore_size(
164 std::vector<simgrid::mc::IgnoredHeapRegion>* ignore_list,
168 int end = ignore_list->size() - 1;
170 while (start <= end) {
171 unsigned int cursor = (start + end) / 2;
172 simgrid::mc::IgnoredHeapRegion const& region = (*ignore_list)[cursor];
173 if (region.address == address)
175 if (region.address < address)
177 if (region.address > address)
184 static bool is_stack(const void *address)
186 for (auto const& stack : mc_model_checker->process().stack_areas())
187 if (address == stack.address)
192 // TODO, this should depend on the snapshot?
193 static bool is_block_stack(int block)
195 for (auto const& stack : mc_model_checker->process().stack_areas())
196 if (block == stack.block)
204 void StateComparator::match_equals(HeapLocationPairs* list)
206 for (auto const& pair : *list) {
207 if (pair[0].fragment_ != -1) {
208 this->equals_to1_(pair[0].block_, pair[0].fragment_) = simgrid::mc::HeapArea(pair[1].block_, pair[1].fragment_);
209 this->equals_to2_(pair[1].block_, pair[1].fragment_) = simgrid::mc::HeapArea(pair[0].block_, pair[0].fragment_);
211 this->equals_to1_(pair[0].block_, 0) = simgrid::mc::HeapArea(pair[1].block_, pair[1].fragment_);
212 this->equals_to2_(pair[1].block_, 0) = simgrid::mc::HeapArea(pair[0].block_, pair[0].fragment_);
217 void ProcessComparisonState::initHeapInformation(xbt_mheap_t heap,
218 std::vector<simgrid::mc::IgnoredHeapRegion>* i)
220 auto heaplimit = heap->heaplimit;
221 this->heapsize = heap->heapsize;
223 this->equals_to.assign(heaplimit * MAX_FRAGMENT_PER_BLOCK, HeapArea());
224 this->types.assign(heaplimit * MAX_FRAGMENT_PER_BLOCK, nullptr);
227 int StateComparator::initHeapInformation(xbt_mheap_t heap1, xbt_mheap_t heap2,
228 std::vector<simgrid::mc::IgnoredHeapRegion>* i1,
229 std::vector<simgrid::mc::IgnoredHeapRegion>* i2)
231 if ((heap1->heaplimit != heap2->heaplimit) || (heap1->heapsize != heap2->heapsize))
233 this->heaplimit = heap1->heaplimit;
234 this->std_heap_copy = *mc_model_checker->process().get_heap();
235 this->processStates[0].initHeapInformation(heap1, i1);
236 this->processStates[1].initHeapInformation(heap2, i2);
240 // TODO, have a robust way to find it in O(1)
241 static inline Region* MC_get_heap_region(Snapshot* snapshot)
243 for (auto const& region : snapshot->snapshot_regions_)
244 if (region->region_type() == simgrid::mc::RegionType::Heap)
246 xbt_die("No heap region");
249 static bool mmalloc_heap_equal(simgrid::mc::StateComparator& state, simgrid::mc::Snapshot* snapshot1,
250 simgrid::mc::Snapshot* snapshot2)
252 simgrid::mc::RemoteClient* process = &mc_model_checker->process();
254 /* Check busy blocks */
257 malloc_info heapinfo_temp1;
258 malloc_info heapinfo_temp2;
259 malloc_info heapinfo_temp2b;
261 simgrid::mc::Region* heap_region1 = MC_get_heap_region(snapshot1);
262 simgrid::mc::Region* heap_region2 = MC_get_heap_region(snapshot2);
264 // This is the address of std_heap->heapinfo in the application process:
265 void* heapinfo_address = &((xbt_mheap_t) process->heap_address)->heapinfo;
267 // This is in snapshot do not use them directly:
268 const malloc_info* heapinfos1 =
269 snapshot1->read<malloc_info*>(RemotePtr<malloc_info*>((std::uint64_t)heapinfo_address));
270 const malloc_info* heapinfos2 =
271 snapshot2->read<malloc_info*>(RemotePtr<malloc_info*>((std::uint64_t)heapinfo_address));
273 while (i1 < state.heaplimit) {
275 const malloc_info* heapinfo1 =
276 (const malloc_info*)heap_region1->read(&heapinfo_temp1, &heapinfos1[i1], sizeof(malloc_info));
277 const malloc_info* heapinfo2 =
278 (const malloc_info*)heap_region2->read(&heapinfo_temp2, &heapinfos2[i1], sizeof(malloc_info));
280 if (heapinfo1->type == MMALLOC_TYPE_FREE || heapinfo1->type == MMALLOC_TYPE_HEAPINFO) { /* Free block */
285 if (heapinfo1->type < 0) {
286 fprintf(stderr, "Unkown mmalloc block type.\n");
290 void* addr_block1 = ((void*)(((ADDR2UINT(i1)) - 1) * BLOCKSIZE + (char*)state.std_heap_copy.heapbase));
292 if (heapinfo1->type == MMALLOC_TYPE_UNFRAGMENTED) { /* Large block */
294 if (is_stack(addr_block1)) {
295 for (size_t k = 0; k < heapinfo1->busy_block.size; k++)
296 state.equals_to1_(i1 + k, 0) = HeapArea(i1, -1);
297 for (size_t k = 0; k < heapinfo2->busy_block.size; k++)
298 state.equals_to2_(i1 + k, 0) = HeapArea(i1, -1);
299 i1 += heapinfo1->busy_block.size;
303 if (state.equals_to1_(i1, 0).valid_) {
311 /* Try first to associate to same block in the other heap */
312 if (heapinfo2->type == heapinfo1->type && state.equals_to2_(i1, 0).valid_ == 0) {
313 void* addr_block2 = (ADDR2UINT(i1) - 1) * BLOCKSIZE + (char*)state.std_heap_copy.heapbase;
314 int res_compare = compare_heap_area(state, addr_block1, addr_block2, snapshot1, snapshot2, nullptr, nullptr, 0);
315 if (res_compare != 1) {
316 for (size_t k = 1; k < heapinfo2->busy_block.size; k++)
317 state.equals_to2_(i1 + k, 0) = HeapArea(i1, -1);
318 for (size_t k = 1; k < heapinfo1->busy_block.size; k++)
319 state.equals_to1_(i1 + k, 0) = HeapArea(i1, -1);
321 i1 += heapinfo1->busy_block.size;
325 while (i2 < state.heaplimit && not equal) {
327 void* addr_block2 = (ADDR2UINT(i2) - 1) * BLOCKSIZE + (char*)state.std_heap_copy.heapbase;
334 const malloc_info* heapinfo2b =
335 (const malloc_info*)heap_region2->read(&heapinfo_temp2b, &heapinfos2[i2], sizeof(malloc_info));
337 if (heapinfo2b->type != MMALLOC_TYPE_UNFRAGMENTED) {
342 if (state.equals_to2_(i2, 0).valid_) {
347 int res_compare = compare_heap_area(state, addr_block1, addr_block2, snapshot1, snapshot2, nullptr, nullptr, 0);
349 if (res_compare != 1) {
350 for (size_t k = 1; k < heapinfo2b->busy_block.size; k++)
351 state.equals_to2_(i2 + k, 0) = HeapArea(i1, -1);
352 for (size_t k = 1; k < heapinfo1->busy_block.size; k++)
353 state.equals_to1_(i1 + k, 0) = HeapArea(i2, -1);
355 i1 += heapinfo1->busy_block.size;
362 XBT_DEBUG("Block %zu not found (size_used = %zu, addr = %p)", i1, heapinfo1->busy_block.busy_size, addr_block1);
366 } else { /* Fragmented block */
368 for (size_t j1 = 0; j1 < (size_t)(BLOCKSIZE >> heapinfo1->type); j1++) {
370 if (heapinfo1->busy_frag.frag_size[j1] == -1) /* Free fragment_ */
373 if (state.equals_to1_(i1, j1).valid_)
376 void* addr_frag1 = (void*)((char*)addr_block1 + (j1 << heapinfo1->type));
381 /* Try first to associate to same fragment_ in the other heap */
382 if (heapinfo2->type == heapinfo1->type && not state.equals_to2_(i1, j1).valid_) {
383 void* addr_block2 = (ADDR2UINT(i1) - 1) * BLOCKSIZE + (char*)state.std_heap_copy.heapbase;
384 void* addr_frag2 = (void*)((char*)addr_block2 + (j1 << heapinfo2->type));
385 int res_compare = compare_heap_area(state, addr_frag1, addr_frag2, snapshot1, snapshot2, nullptr, nullptr, 0);
386 if (res_compare != 1)
390 while (i2 < state.heaplimit && not equal) {
392 const malloc_info* heapinfo2b =
393 (const malloc_info*)heap_region2->read(&heapinfo_temp2b, &heapinfos2[i2], sizeof(malloc_info));
395 if (heapinfo2b->type == MMALLOC_TYPE_FREE || heapinfo2b->type == MMALLOC_TYPE_HEAPINFO) {
400 // We currently do not match fragments with unfragmented blocks (maybe we should).
401 if (heapinfo2b->type == MMALLOC_TYPE_UNFRAGMENTED) {
406 if (heapinfo2b->type < 0) {
407 fprintf(stderr, "Unknown mmalloc block type.\n");
411 for (size_t j2 = 0; j2 < (size_t)(BLOCKSIZE >> heapinfo2b->type); j2++) {
413 if (i2 == i1 && j2 == j1)
416 if (state.equals_to2_(i2, j2).valid_)
419 void* addr_block2 = (ADDR2UINT(i2) - 1) * BLOCKSIZE + (char*)state.std_heap_copy.heapbase;
420 void* addr_frag2 = (void*)((char*)addr_block2 + (j2 << heapinfo2b->type));
423 compare_heap_area(state, addr_frag1, addr_frag2, snapshot1, snapshot2, nullptr, nullptr, 0);
424 if (res_compare != 1) {
434 XBT_DEBUG("Block %zu, fragment_ %zu not found (size_used = %zd, address = %p)\n", i1, j1,
435 heapinfo1->busy_frag.frag_size[j1], addr_frag1);
444 /* All blocks/fragments are equal to another block/fragment_ ? */
445 for (size_t i = 1; i < state.heaplimit; i++) {
446 const malloc_info* heapinfo1 =
447 (const malloc_info*)heap_region1->read(&heapinfo_temp1, &heapinfos1[i], sizeof(malloc_info));
449 if (heapinfo1->type == MMALLOC_TYPE_UNFRAGMENTED && i1 == state.heaplimit && heapinfo1->busy_block.busy_size > 0 &&
450 not state.equals_to1_(i, 0).valid_) {
451 XBT_DEBUG("Block %zu not found (size used = %zu)", i, heapinfo1->busy_block.busy_size);
455 if (heapinfo1->type <= 0)
457 for (size_t j = 0; j < (size_t)(BLOCKSIZE >> heapinfo1->type); j++)
458 if (i1 == state.heaplimit && heapinfo1->busy_frag.frag_size[j] > 0 && not state.equals_to1_(i, j).valid_) {
459 XBT_DEBUG("Block %zu, Fragment %zu not found (size used = %zd)", i, j, heapinfo1->busy_frag.frag_size[j]);
464 for (size_t i = 1; i < state.heaplimit; i++) {
465 const malloc_info* heapinfo2 =
466 (const malloc_info*)heap_region2->read(&heapinfo_temp2, &heapinfos2[i], sizeof(malloc_info));
467 if (heapinfo2->type == MMALLOC_TYPE_UNFRAGMENTED && i1 == state.heaplimit && heapinfo2->busy_block.busy_size > 0 &&
468 not state.equals_to2_(i, 0).valid_) {
469 XBT_DEBUG("Block %zu not found (size used = %zu)", i,
470 heapinfo2->busy_block.busy_size);
474 if (heapinfo2->type <= 0)
477 for (size_t j = 0; j < (size_t)(BLOCKSIZE >> heapinfo2->type); j++)
478 if (i1 == state.heaplimit && heapinfo2->busy_frag.frag_size[j] > 0 && not state.equals_to2_(i, j).valid_) {
479 XBT_DEBUG("Block %zu, Fragment %zu not found (size used = %zd)",
480 i, j, heapinfo2->busy_frag.frag_size[j]);
491 * @param real_area1 Process address for state 1
492 * @param real_area2 Process address for state 2
493 * @param snapshot1 Snapshot of state 1
494 * @param snapshot2 Snapshot of state 2
497 * @param check_ignore
499 static bool heap_area_equal_without_type(simgrid::mc::StateComparator& state, const void* real_area1,
500 const void* real_area2, simgrid::mc::Snapshot* snapshot1,
501 simgrid::mc::Snapshot* snapshot2, HeapLocationPairs* previous, int size,
504 simgrid::mc::RemoteClient* process = &mc_model_checker->process();
505 simgrid::mc::Region* heap_region1 = MC_get_heap_region(snapshot1);
506 simgrid::mc::Region* heap_region2 = MC_get_heap_region(snapshot2);
508 for (int i = 0; i < size; ) {
510 if (check_ignore > 0) {
511 ssize_t ignore1 = heap_comparison_ignore_size(state.processStates[0].to_ignore, (char*)real_area1 + i);
513 ssize_t ignore2 = heap_comparison_ignore_size(state.processStates[1].to_ignore, (char*)real_area2 + i);
514 if (ignore2 == ignore1) {
527 if (MC_snapshot_region_memcmp(((char *) real_area1) + i, heap_region1, ((char *) real_area2) + i, heap_region2, 1) != 0) {
529 int pointer_align = (i / sizeof(void *)) * sizeof(void *);
530 const void* addr_pointed1 = snapshot1->read(remote((void**)((char*)real_area1 + pointer_align)));
531 const void* addr_pointed2 = snapshot2->read(remote((void**)((char*)real_area2 + pointer_align)));
533 if (process->in_maestro_stack(remote(addr_pointed1))
534 && process->in_maestro_stack(remote(addr_pointed2))) {
535 i = pointer_align + sizeof(void *);
539 if (addr_pointed1 > state.std_heap_copy.heapbase
540 && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1)
541 && addr_pointed2 > state.std_heap_copy.heapbase
542 && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2)) {
543 // Both addresses are in the heap:
545 compare_heap_area(state, addr_pointed1, addr_pointed2, snapshot1, snapshot2, previous, nullptr, 0);
546 if (res_compare == 1)
548 i = pointer_align + sizeof(void *);
564 * @param real_area1 Process address for state 1
565 * @param real_area2 Process address for state 2
566 * @param snapshot1 Snapshot of state 1
567 * @param snapshot2 Snapshot of state 2
570 * @param area_size either a byte_size or an elements_count (?)
571 * @param check_ignore
572 * @param pointer_level
573 * @return 0 (same), 1 (different), -1 (unknown)
575 static int compare_heap_area_with_type(simgrid::mc::StateComparator& state, const void* real_area1,
576 const void* real_area2, simgrid::mc::Snapshot* snapshot1,
577 simgrid::mc::Snapshot* snapshot2, HeapLocationPairs* previous,
578 simgrid::mc::Type* type, int area_size, int check_ignore, int pointer_level)
580 // HACK: This should not happen but in pratice, there are some
581 // DW_TAG_typedef without an associated DW_AT_type:
582 //<1><538832>: Abbrev Number: 111 (DW_TAG_typedef)
583 // <538833> DW_AT_name : (indirect string, offset: 0x2292f3): gregset_t
584 // <538837> DW_AT_decl_file : 98
585 // <538838> DW_AT_decl_line : 37
589 if (is_stack(real_area1) && is_stack(real_area2))
592 if (check_ignore > 0) {
593 ssize_t ignore1 = heap_comparison_ignore_size(state.processStates[0].to_ignore, real_area1);
594 if (ignore1 > 0 && heap_comparison_ignore_size(state.processStates[1].to_ignore, real_area2) == ignore1)
598 simgrid::mc::Type* subtype;
599 simgrid::mc::Type* subsubtype;
601 const void* addr_pointed1;
602 const void* addr_pointed2;
604 simgrid::mc::Region* heap_region1 = MC_get_heap_region(snapshot1);
605 simgrid::mc::Region* heap_region2 = MC_get_heap_region(snapshot2);
607 switch (type->type) {
608 case DW_TAG_unspecified_type:
611 case DW_TAG_base_type:
612 if (not type->name.empty() && type->name == "char") { /* String, hence random (arbitrary ?) size */
613 if (real_area1 == real_area2)
616 return MC_snapshot_region_memcmp(real_area1, heap_region1, real_area2, heap_region2, area_size) != 0;
618 if (area_size != -1 && type->byte_size != area_size)
621 return MC_snapshot_region_memcmp(real_area1, heap_region1, real_area2, heap_region2, type->byte_size) != 0;
624 case DW_TAG_enumeration_type:
625 if (area_size != -1 && type->byte_size != area_size)
627 return MC_snapshot_region_memcmp(real_area1, heap_region1, real_area2, heap_region2, type->byte_size) != 0;
630 case DW_TAG_const_type:
631 case DW_TAG_volatile_type:
632 return compare_heap_area_with_type(state, real_area1, real_area2, snapshot1, snapshot2, previous, type->subtype,
633 area_size, check_ignore, pointer_level);
635 case DW_TAG_array_type:
636 subtype = type->subtype;
637 switch (subtype->type) {
638 case DW_TAG_unspecified_type:
641 case DW_TAG_base_type:
642 case DW_TAG_enumeration_type:
643 case DW_TAG_pointer_type:
644 case DW_TAG_reference_type:
645 case DW_TAG_rvalue_reference_type:
646 case DW_TAG_structure_type:
647 case DW_TAG_class_type:
648 case DW_TAG_union_type:
649 if (subtype->full_type)
650 subtype = subtype->full_type;
651 elm_size = subtype->byte_size;
653 // TODO, just remove the type indirection?
654 case DW_TAG_const_type:
656 case DW_TAG_volatile_type:
657 subsubtype = subtype->subtype;
658 if (subsubtype->full_type)
659 subsubtype = subsubtype->full_type;
660 elm_size = subsubtype->byte_size;
665 for (int i = 0; i < type->element_count; i++) {
666 // TODO, add support for variable stride (DW_AT_byte_stride)
667 int res = compare_heap_area_with_type(state, (char*)real_area1 + (i * elm_size),
668 (char*)real_area2 + (i * elm_size), snapshot1, snapshot2, previous,
669 type->subtype, subtype->byte_size, check_ignore, pointer_level);
675 case DW_TAG_reference_type:
676 case DW_TAG_rvalue_reference_type:
677 case DW_TAG_pointer_type:
678 if (type->subtype && type->subtype->type == DW_TAG_subroutine_type) {
679 addr_pointed1 = snapshot1->read(remote((void**)real_area1));
680 addr_pointed2 = snapshot2->read(remote((void**)real_area2));
681 return (addr_pointed1 != addr_pointed2);
684 if (pointer_level <= 1) {
685 addr_pointed1 = snapshot1->read(remote((void**)real_area1));
686 addr_pointed2 = snapshot2->read(remote((void**)real_area2));
687 if (addr_pointed1 > state.std_heap_copy.heapbase && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1) &&
688 addr_pointed2 > state.std_heap_copy.heapbase && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2))
689 return compare_heap_area(state, addr_pointed1, addr_pointed2, snapshot1, snapshot2, previous, type->subtype,
692 return (addr_pointed1 != addr_pointed2);
694 for (size_t i = 0; i < (area_size / sizeof(void*)); i++) {
695 addr_pointed1 = snapshot1->read(remote((void**)((char*)real_area1 + i * sizeof(void*))));
696 addr_pointed2 = snapshot2->read(remote((void**)((char*)real_area2 + i * sizeof(void*))));
698 if (addr_pointed1 > state.std_heap_copy.heapbase && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1) &&
699 addr_pointed2 > state.std_heap_copy.heapbase && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2))
700 res = compare_heap_area(state, addr_pointed1, addr_pointed2, snapshot1, snapshot2, previous, type->subtype,
703 res = (addr_pointed1 != addr_pointed2);
709 case DW_TAG_structure_type:
710 case DW_TAG_class_type:
712 type = type->full_type;
713 if (area_size != -1 && type->byte_size != area_size) {
714 if (area_size <= type->byte_size || area_size % type->byte_size != 0)
716 for (size_t i = 0; i < (size_t)(area_size / type->byte_size); i++) {
717 int res = compare_heap_area_with_type(state, (char*)real_area1 + i * type->byte_size,
718 (char*)real_area2 + i * type->byte_size, snapshot1, snapshot2, previous,
719 type, -1, check_ignore, 0);
724 for (simgrid::mc::Member& member : type->members) {
725 // TODO, optimize this? (for the offset case)
727 simgrid::dwarf::resolve_member(real_area1, type, &member, (simgrid::mc::AddressSpace*)snapshot1);
729 simgrid::dwarf::resolve_member(real_area2, type, &member, (simgrid::mc::AddressSpace*)snapshot2);
730 int res = compare_heap_area_with_type(state, real_member1, real_member2, snapshot1, snapshot2, previous,
731 member.type, -1, check_ignore, 0);
738 case DW_TAG_union_type:
739 return not heap_area_equal_without_type(state, real_area1, real_area2, snapshot1, snapshot2, previous,
740 type->byte_size, check_ignore);
745 /** Infer the type of a part of the block from the type of the block
747 * TODO, handle DW_TAG_array_type as well as arrays of the object ((*p)[5], p[5])
749 * TODO, handle subfields ((*p).bar.foo, (*p)[5].bar…)
751 * @param type DWARF type ID of the root address
753 * @return DWARF type ID for given offset
755 static simgrid::mc::Type* get_offset_type(void* real_base_address, simgrid::mc::Type* type, int offset, int area_size,
756 simgrid::mc::Snapshot* snapshot)
759 // Beginning of the block, the infered variable type if the type of the block:
763 switch (type->type) {
765 case DW_TAG_structure_type:
766 case DW_TAG_class_type:
768 type = type->full_type;
769 if (area_size != -1 && type->byte_size != area_size) {
770 if (area_size > type->byte_size && area_size % type->byte_size == 0)
776 for (simgrid::mc::Member& member : type->members) {
777 if (member.has_offset_location()) {
778 // We have the offset, use it directly (shortcut):
779 if (member.offset() == offset)
782 void* real_member = simgrid::dwarf::resolve_member(real_base_address, type, &member, snapshot);
783 if ((char*)real_member - (char*)real_base_address == offset)
790 /* FIXME: other cases ? */
798 * @param area1 Process address for state 1
799 * @param area2 Process address for state 2
800 * @param snapshot1 Snapshot of state 1
801 * @param snapshot2 Snapshot of state 2
802 * @param previous Pairs of blocks already compared on the current path (or nullptr)
803 * @param type_id Type of variable
804 * @param pointer_level
805 * @return 0 (same), 1 (different), -1
807 static int compare_heap_area(simgrid::mc::StateComparator& state, const void* area1, const void* area2,
808 simgrid::mc::Snapshot* snapshot1, simgrid::mc::Snapshot* snapshot2,
809 HeapLocationPairs* previous, simgrid::mc::Type* type, int pointer_level)
811 simgrid::mc::RemoteClient* process = &mc_model_checker->process();
816 int check_ignore = 0;
824 simgrid::mc::Type* new_type1 = nullptr;
825 simgrid::mc::Type* new_type2 = nullptr;
827 bool match_pairs = false;
829 // This is the address of std_heap->heapinfo in the application process:
830 void* heapinfo_address = &((xbt_mheap_t) process->heap_address)->heapinfo;
832 const malloc_info* heapinfos1 = snapshot1->read(remote((const malloc_info**)heapinfo_address));
833 const malloc_info* heapinfos2 = snapshot2->read(remote((const malloc_info**)heapinfo_address));
835 malloc_info heapinfo_temp1;
836 malloc_info heapinfo_temp2;
838 simgrid::mc::HeapLocationPairs current;
839 if (previous == nullptr) {
845 block1 = ((char*)area1 - (char*)state.std_heap_copy.heapbase) / BLOCKSIZE + 1;
846 block2 = ((char*)area2 - (char*)state.std_heap_copy.heapbase) / BLOCKSIZE + 1;
848 // If either block is a stack block:
849 if (is_block_stack((int) block1) && is_block_stack((int) block2)) {
850 previous->insert(simgrid::mc::makeHeapLocationPair(block1, -1, block2, -1));
852 state.match_equals(previous);
856 // If either block is not in the expected area of memory:
857 if (((char*)area1 < (char*)state.std_heap_copy.heapbase) || (block1 > (ssize_t)state.processStates[0].heapsize) ||
858 (block1 < 1) || ((char*)area2 < (char*)state.std_heap_copy.heapbase) ||
859 (block2 > (ssize_t)state.processStates[1].heapsize) || (block2 < 1)) {
863 // Process address of the block:
864 void* real_addr_block1 = (ADDR2UINT(block1) - 1) * BLOCKSIZE + (char*)state.std_heap_copy.heapbase;
865 void* real_addr_block2 = (ADDR2UINT(block2) - 1) * BLOCKSIZE + (char*)state.std_heap_copy.heapbase;
869 type = type->full_type;
871 // This assume that for "boring" types (volatile ...) byte_size is absent:
872 while (type->byte_size == 0 && type->subtype != nullptr)
873 type = type->subtype;
876 if (type->type == DW_TAG_pointer_type ||
877 (type->type == DW_TAG_base_type && not type->name.empty() && type->name == "char"))
880 type_size = type->byte_size;
884 simgrid::mc::Region* heap_region1 = MC_get_heap_region(snapshot1);
885 simgrid::mc::Region* heap_region2 = MC_get_heap_region(snapshot2);
887 const malloc_info* heapinfo1 =
888 (const malloc_info*)heap_region1->read(&heapinfo_temp1, &heapinfos1[block1], sizeof(malloc_info));
889 const malloc_info* heapinfo2 =
890 (const malloc_info*)heap_region2->read(&heapinfo_temp2, &heapinfos2[block2], sizeof(malloc_info));
892 if ((heapinfo1->type == MMALLOC_TYPE_FREE || heapinfo1->type==MMALLOC_TYPE_HEAPINFO)
893 && (heapinfo2->type == MMALLOC_TYPE_FREE || heapinfo2->type ==MMALLOC_TYPE_HEAPINFO)) {
896 state.match_equals(previous);
900 if (heapinfo1->type == MMALLOC_TYPE_UNFRAGMENTED && heapinfo2->type == MMALLOC_TYPE_UNFRAGMENTED) {
903 // TODO, lookup variable type from block type as done for fragmented blocks
905 if (state.equals_to1_(block1, 0).valid_ && state.equals_to2_(block2, 0).valid_ &&
906 state.blocksEqual(block1, block2)) {
908 state.match_equals(previous);
912 if (type_size != -1 && type_size != (ssize_t)heapinfo1->busy_block.busy_size &&
913 type_size != (ssize_t)heapinfo2->busy_block.busy_size &&
914 (type->name.empty() || type->name == "struct s_smx_context")) {
916 state.match_equals(previous);
920 if (heapinfo1->busy_block.size != heapinfo2->busy_block.size)
922 if (heapinfo1->busy_block.busy_size != heapinfo2->busy_block.busy_size)
925 if (not previous->insert(simgrid::mc::makeHeapLocationPair(block1, -1, block2, -1)).second) {
927 state.match_equals(previous);
931 size = heapinfo1->busy_block.busy_size;
933 // Remember (basic) type inference.
934 // The current data structure only allows us to do this for the whole block.
935 if (type != nullptr && area1 == real_addr_block1)
936 state.types1_(block1, 0) = type;
937 if (type != nullptr && area2 == real_addr_block2)
938 state.types2_(block2, 0) = type;
942 state.match_equals(previous);
946 if (heapinfo1->busy_block.ignore > 0
947 && heapinfo2->busy_block.ignore == heapinfo1->busy_block.ignore)
948 check_ignore = heapinfo1->busy_block.ignore;
950 } else if ((heapinfo1->type > 0) && (heapinfo2->type > 0)) { /* Fragmented block */
953 ssize_t frag1 = ((uintptr_t)(ADDR2UINT(area1) % (BLOCKSIZE))) >> heapinfo1->type;
954 ssize_t frag2 = ((uintptr_t)(ADDR2UINT(area2) % (BLOCKSIZE))) >> heapinfo2->type;
956 // Process address of the fragment_:
957 void* real_addr_frag1 = (void*)((char*)real_addr_block1 + (frag1 << heapinfo1->type));
958 void* real_addr_frag2 = (void*)((char*)real_addr_block2 + (frag2 << heapinfo2->type));
960 // Check the size of the fragments against the size of the type:
961 if (type_size != -1) {
962 if (heapinfo1->busy_frag.frag_size[frag1] == -1 || heapinfo2->busy_frag.frag_size[frag2] == -1) {
964 state.match_equals(previous);
968 if (type_size != heapinfo1->busy_frag.frag_size[frag1]
969 || type_size != heapinfo2->busy_frag.frag_size[frag2]) {
971 state.match_equals(previous);
976 // Check if the blocks are already matched together:
977 if (state.equals_to1_(block1, frag1).valid_ && state.equals_to2_(block2, frag2).valid_ && offset1 == offset2 &&
978 state.fragmentsEqual(block1, frag1, block2, frag2)) {
980 state.match_equals(previous);
983 // Compare the size of both fragments:
984 if (heapinfo1->busy_frag.frag_size[frag1] != heapinfo2->busy_frag.frag_size[frag2]) {
985 if (type_size == -1) {
987 state.match_equals(previous);
993 // Size of the fragment_:
994 size = heapinfo1->busy_frag.frag_size[frag1];
996 // Remember (basic) type inference.
997 // The current data structure only allows us to do this for the whole fragment_.
998 if (type != nullptr && area1 == real_addr_frag1)
999 state.types1_(block1, frag1) = type;
1000 if (type != nullptr && area2 == real_addr_frag2)
1001 state.types2_(block2, frag2) = type;
1003 // The type of the variable is already known:
1005 new_type1 = new_type2 = type;
1007 // Type inference from the block type.
1008 else if (state.types1_(block1, frag1) != nullptr || state.types2_(block2, frag2) != nullptr) {
1010 offset1 = (char*)area1 - (char*)real_addr_frag1;
1011 offset2 = (char*)area2 - (char*)real_addr_frag2;
1013 if (state.types1_(block1, frag1) != nullptr && state.types2_(block2, frag2) != nullptr) {
1014 new_type1 = get_offset_type(real_addr_frag1, state.types1_(block1, frag1), offset1, size, snapshot1);
1015 new_type2 = get_offset_type(real_addr_frag2, state.types2_(block2, frag2), offset1, size, snapshot2);
1016 } else if (state.types1_(block1, frag1) != nullptr) {
1017 new_type1 = get_offset_type(real_addr_frag1, state.types1_(block1, frag1), offset1, size, snapshot1);
1018 new_type2 = get_offset_type(real_addr_frag2, state.types1_(block1, frag1), offset2, size, snapshot2);
1019 } else if (state.types2_(block2, frag2) != nullptr) {
1020 new_type1 = get_offset_type(real_addr_frag1, state.types2_(block2, frag2), offset1, size, snapshot1);
1021 new_type2 = get_offset_type(real_addr_frag2, state.types2_(block2, frag2), offset2, size, snapshot2);
1024 state.match_equals(previous);
1028 if (new_type1 != nullptr && new_type2 != nullptr && new_type1 != new_type2) {
1031 while (type->byte_size == 0 && type->subtype != nullptr)
1032 type = type->subtype;
1033 new_size1 = type->byte_size;
1036 while (type->byte_size == 0 && type->subtype != nullptr)
1037 type = type->subtype;
1038 new_size2 = type->byte_size;
1042 state.match_equals(previous);
1047 if (new_size1 > 0 && new_size1 == new_size2) {
1052 if (offset1 == 0 && offset2 == 0 &&
1053 not previous->insert(simgrid::mc::makeHeapLocationPair(block1, frag1, block2, frag2)).second) {
1055 state.match_equals(previous);
1061 state.match_equals(previous);
1065 if ((heapinfo1->busy_frag.ignore[frag1] > 0) &&
1066 (heapinfo2->busy_frag.ignore[frag2] == heapinfo1->busy_frag.ignore[frag1]))
1067 check_ignore = heapinfo1->busy_frag.ignore[frag1];
1073 /* Start comparison */
1076 res_compare = compare_heap_area_with_type(state, area1, area2, snapshot1, snapshot2, previous, type, size,
1077 check_ignore, pointer_level);
1080 not heap_area_equal_without_type(state, area1, area2, snapshot1, snapshot2, previous, size, check_ignore);
1082 if (res_compare == 1)
1086 state.match_equals(previous);
1093 /************************** Snapshot comparison *******************************/
1094 /******************************************************************************/
1096 static int compare_areas_with_type(simgrid::mc::StateComparator& state, void* real_area1,
1097 simgrid::mc::Snapshot* snapshot1, simgrid::mc::Region* region1, void* real_area2,
1098 simgrid::mc::Snapshot* snapshot2, simgrid::mc::Region* region2,
1099 simgrid::mc::Type* type, int pointer_level)
1101 simgrid::mc::RemoteClient* process = &mc_model_checker->process();
1103 simgrid::mc::Type* subtype;
1104 simgrid::mc::Type* subsubtype;
1109 xbt_assert(type != nullptr);
1110 switch (type->type) {
1111 case DW_TAG_unspecified_type:
1114 case DW_TAG_base_type:
1115 case DW_TAG_enumeration_type:
1116 case DW_TAG_union_type:
1117 return MC_snapshot_region_memcmp(real_area1, region1, real_area2, region2, type->byte_size) != 0;
1118 case DW_TAG_typedef:
1119 case DW_TAG_volatile_type:
1120 case DW_TAG_const_type:
1121 return compare_areas_with_type(state, real_area1, snapshot1, region1, real_area2, snapshot2, region2,
1122 type->subtype, pointer_level);
1123 case DW_TAG_array_type:
1124 subtype = type->subtype;
1125 switch (subtype->type) {
1126 case DW_TAG_unspecified_type:
1129 case DW_TAG_base_type:
1130 case DW_TAG_enumeration_type:
1131 case DW_TAG_pointer_type:
1132 case DW_TAG_reference_type:
1133 case DW_TAG_rvalue_reference_type:
1134 case DW_TAG_structure_type:
1135 case DW_TAG_class_type:
1136 case DW_TAG_union_type:
1137 if (subtype->full_type)
1138 subtype = subtype->full_type;
1139 elm_size = subtype->byte_size;
1141 case DW_TAG_const_type:
1142 case DW_TAG_typedef:
1143 case DW_TAG_volatile_type:
1144 subsubtype = subtype->subtype;
1145 if (subsubtype->full_type)
1146 subsubtype = subsubtype->full_type;
1147 elm_size = subsubtype->byte_size;
1152 for (i = 0; i < type->element_count; i++) {
1153 size_t off = i * elm_size;
1154 res = compare_areas_with_type(state, (char*)real_area1 + off, snapshot1, region1, (char*)real_area2 + off,
1155 snapshot2, region2, type->subtype, pointer_level);
1160 case DW_TAG_pointer_type:
1161 case DW_TAG_reference_type:
1162 case DW_TAG_rvalue_reference_type: {
1163 void* addr_pointed1 = MC_region_read_pointer(region1, real_area1);
1164 void* addr_pointed2 = MC_region_read_pointer(region2, real_area2);
1166 if (type->subtype && type->subtype->type == DW_TAG_subroutine_type)
1167 return (addr_pointed1 != addr_pointed2);
1168 if (addr_pointed1 == nullptr && addr_pointed2 == nullptr)
1170 if (addr_pointed1 == nullptr || addr_pointed2 == nullptr)
1172 if (not state.compared_pointers.insert(std::make_pair(addr_pointed1, addr_pointed2)).second)
1177 // Some cases are not handled here:
1178 // * the pointers lead to different areas (one to the heap, the other to the RW segment ...)
1179 // * a pointer leads to the read-only segment of the current object
1180 // * a pointer lead to a different ELF object
1182 if (addr_pointed1 > process->heap_address && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1)) {
1183 if (not(addr_pointed2 > process->heap_address && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2)))
1185 // The pointers are both in the heap:
1186 return simgrid::mc::compare_heap_area(state, addr_pointed1, addr_pointed2, snapshot1, snapshot2, nullptr,
1187 type->subtype, pointer_level);
1189 } else if (region1->contain(simgrid::mc::remote(addr_pointed1))) {
1190 // The pointers are both in the current object R/W segment:
1191 if (not region2->contain(simgrid::mc::remote(addr_pointed2)))
1193 if (not type->type_id)
1194 return (addr_pointed1 != addr_pointed2);
1196 return compare_areas_with_type(state, addr_pointed1, snapshot1, region1, addr_pointed2, snapshot2, region2,
1197 type->subtype, pointer_level);
1200 // TODO, We do not handle very well the case where
1201 // it belongs to a different (non-heap) region from the current one.
1203 return (addr_pointed1 != addr_pointed2);
1206 case DW_TAG_structure_type:
1207 case DW_TAG_class_type:
1208 for (simgrid::mc::Member& member : type->members) {
1209 void* member1 = simgrid::dwarf::resolve_member(real_area1, type, &member, snapshot1);
1210 void* member2 = simgrid::dwarf::resolve_member(real_area2, type, &member, snapshot2);
1211 simgrid::mc::Region* subregion1 = snapshot1->get_region(member1, region1); // region1 is hinted
1212 simgrid::mc::Region* subregion2 = snapshot2->get_region(member2, region2); // region2 is hinted
1213 res = compare_areas_with_type(state, member1, snapshot1, subregion1, member2, snapshot2, subregion2,
1214 member.type, pointer_level);
1219 case DW_TAG_subroutine_type:
1222 XBT_VERB("Unknown case: %d", type->type);
1229 static bool global_variables_equal(simgrid::mc::StateComparator& state, simgrid::mc::ObjectInformation* object_info,
1230 simgrid::mc::Region* r1, simgrid::mc::Region* r2, simgrid::mc::Snapshot* snapshot1,
1231 simgrid::mc::Snapshot* snapshot2)
1233 xbt_assert(r1 && r2, "Missing region.");
1235 std::vector<simgrid::mc::Variable>& variables = object_info->global_variables;
1237 for (simgrid::mc::Variable const& current_var : variables) {
1239 // If the variable is not in this object, skip it:
1240 // We do not expect to find a pointer to something which is not reachable
1241 // by the global variables.
1242 if ((char *) current_var.address < (char *) object_info->start_rw
1243 || (char *) current_var.address > (char *) object_info->end_rw)
1246 simgrid::mc::Type* bvariable_type = current_var.type;
1247 int res = compare_areas_with_type(state, (char*)current_var.address, snapshot1, r1, (char*)current_var.address,
1248 snapshot2, r2, bvariable_type, 0);
1250 XBT_VERB("Global variable %s (%p) is different between snapshots",
1251 current_var.name.c_str(),
1252 (char *) current_var.address);
1260 static bool local_variables_equal(simgrid::mc::StateComparator& state, simgrid::mc::Snapshot* snapshot1,
1261 simgrid::mc::Snapshot* snapshot2, mc_snapshot_stack_t stack1,
1262 mc_snapshot_stack_t stack2)
1264 if (stack1->local_variables.size() != stack2->local_variables.size()) {
1265 XBT_VERB("Different number of local variables");
1269 for (unsigned int cursor = 0; cursor < stack1->local_variables.size(); cursor++) {
1270 local_variable_t current_var1 = &stack1->local_variables[cursor];
1271 local_variable_t current_var2 = &stack2->local_variables[cursor];
1272 if (current_var1->name != current_var2->name || current_var1->subprogram != current_var2->subprogram ||
1273 current_var1->ip != current_var2->ip) {
1274 // TODO, fix current_varX->subprogram->name to include name if DW_TAG_inlined_subprogram
1275 XBT_VERB("Different name of variable (%s - %s) "
1276 "or frame (%s - %s) or ip (%lu - %lu)",
1277 current_var1->name.c_str(), current_var2->name.c_str(), current_var1->subprogram->name.c_str(),
1278 current_var2->subprogram->name.c_str(), current_var1->ip, current_var2->ip);
1282 if (compare_areas_with_type(state, current_var1->address, snapshot1, snapshot1->get_region(current_var1->address),
1283 current_var2->address, snapshot2, snapshot2->get_region(current_var2->address),
1284 current_var1->type, 0) == 1) {
1285 XBT_VERB("Local variable %s (%p - %p) in frame %s "
1286 "is different between snapshots",
1287 current_var1->name.c_str(), current_var1->address, current_var2->address,
1288 current_var1->subprogram->name.c_str());
1298 static std::unique_ptr<simgrid::mc::StateComparator> state_comparator;
1300 bool snapshot_equal(Snapshot* s1, Snapshot* s2)
1302 // TODO, make this a field of ModelChecker or something similar
1303 if (state_comparator == nullptr)
1304 state_comparator.reset(new StateComparator());
1306 state_comparator->clear();
1308 RemoteClient* process = &mc_model_checker->process();
1310 if (s1->hash_ != s2->hash_) {
1311 XBT_VERB("(%d - %d) Different hash: 0x%" PRIx64 "--0x%" PRIx64, s1->num_state_, s2->num_state_, s1->hash_,
1315 XBT_VERB("(%d - %d) Same hash: 0x%" PRIx64, s1->num_state_, s2->num_state_, s1->hash_);
1317 /* Compare enabled processes */
1318 if (s1->enabled_processes_ != s2->enabled_processes_) {
1319 XBT_VERB("(%d - %d) Different amount of enabled processes", s1->num_state_, s2->num_state_);
1323 /* Compare size of stacks */
1324 for (unsigned long i = 0; i < s1->stacks_.size(); i++) {
1325 size_t size_used1 = s1->stack_sizes_[i];
1326 size_t size_used2 = s2->stack_sizes_[i];
1327 if (size_used1 != size_used2) {
1328 XBT_VERB("(%d - %d) Different size used in stacks: %zu - %zu", s1->num_state_, s2->num_state_, size_used1,
1334 /* Init heap information used in heap comparison algorithm */
1335 xbt_mheap_t heap1 = (xbt_mheap_t)s1->read_bytes(alloca(sizeof(struct mdesc)), sizeof(struct mdesc),
1336 remote(process->heap_address), simgrid::mc::ReadOptions::lazy());
1337 xbt_mheap_t heap2 = (xbt_mheap_t)s2->read_bytes(alloca(sizeof(struct mdesc)), sizeof(struct mdesc),
1338 remote(process->heap_address), simgrid::mc::ReadOptions::lazy());
1339 int res_init = state_comparator->initHeapInformation(heap1, heap2, &s1->to_ignore_, &s2->to_ignore_);
1341 if (res_init == -1) {
1342 XBT_VERB("(%d - %d) Different heap information", s1->num_state_, s2->num_state_);
1346 /* Stacks comparison */
1347 for (unsigned int cursor = 0; cursor < s1->stacks_.size(); cursor++) {
1348 mc_snapshot_stack_t stack1 = &s1->stacks_[cursor];
1349 mc_snapshot_stack_t stack2 = &s2->stacks_[cursor];
1351 if (not local_variables_equal(*state_comparator, s1, s2, stack1, stack2)) {
1352 XBT_VERB("(%d - %d) Different local variables between stacks %u", s1->num_state_, s2->num_state_, cursor + 1);
1357 size_t regions_count = s1->snapshot_regions_.size();
1358 if (regions_count != s2->snapshot_regions_.size())
1361 for (size_t k = 0; k != regions_count; ++k) {
1362 Region* region1 = s1->snapshot_regions_[k].get();
1363 Region* region2 = s2->snapshot_regions_[k].get();
1366 if (region1->region_type() != RegionType::Data)
1369 xbt_assert(region1->region_type() == region2->region_type());
1370 xbt_assert(region1->object_info() == region2->object_info());
1371 xbt_assert(region1->object_info());
1373 /* Compare global variables */
1374 if (not global_variables_equal(*state_comparator, region1->object_info(), region1, region2, s1, s2)) {
1375 std::string const& name = region1->object_info()->file_name;
1376 XBT_VERB("(%d - %d) Different global variables in %s", s1->num_state_, s2->num_state_, name.c_str());
1382 if (not mmalloc_heap_equal(*state_comparator, s1, s2)) {
1383 XBT_VERB("(%d - %d) Different heap (mmalloc_compare)", s1->num_state_, s2->num_state_);
1387 XBT_VERB("(%d - %d) No difference found", s1->num_state_, s2->num_state_);