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/sysdep.h>
17 #include <xbt/dynar.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_safety.h"
33 #include "src/mc/mc_private.h"
34 #include "src/mc/mc_smx.h"
35 #include "src/mc/mc_dwarf.hpp"
36 #include "src/mc/Frame.hpp"
37 #include "src/mc/ObjectInformation.hpp"
38 #include "src/mc/Variable.hpp"
39 #include "src/mc/mc_private.h"
40 #include "src/mc/mc_snapshot.h"
41 #include "src/mc/mc_dwarf.hpp"
42 #include "src/mc/Type.hpp"
44 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_compare, xbt,
45 "Logging specific to mc_compare in mc");
51 typedef std::array<HeapLocation, 2> HeapLocationPair;
52 typedef std::set<HeapLocationPair> HeapLocationPairs;
54 struct ProcessComparisonState;
55 struct StateComparator;
57 static int compare_heap_area(
58 StateComparator& state,
59 int process_index, const void *area1, const void* area2,
60 Snapshot* snapshot1, Snapshot* snapshot2,
61 HeapLocationPairs* previous, Type* type, int pointer_level);
66 using simgrid::mc::remote;
68 /*********************************** Heap comparison ***********************************/
69 /***************************************************************************************/
79 HeapLocation(int block, int fragment = 0) : block(block), fragment(fragment) {}
81 bool operator==(HeapLocation const& that) const
83 return block == that.block && fragment == that.fragment;
85 bool operator<(HeapLocation const& that) const
87 return std::make_pair(block, fragment)
88 < std::make_pair(that.block, that.fragment);
93 HeapLocationPair makeHeapLocationPair(int block1, int fragment1, int block2, int fragment2)
95 return simgrid::mc::HeapLocationPair{{
96 simgrid::mc::HeapLocation(block1, fragment1),
97 simgrid::mc::HeapLocation(block2, fragment2)
101 struct HeapArea : public HeapLocation {
107 : valid(true), block(block) {}
108 HeapArea(int block, int fragment = 0)
109 : valid(true), block(block), fragment(fragment) {}
112 struct ProcessComparisonState {
113 std::vector<simgrid::mc::IgnoredHeapRegion>* to_ignore = nullptr;
114 std::vector<HeapArea> equals_to;
115 std::vector<simgrid::mc::Type*> types;
116 std::size_t heapsize = 0;
118 void initHeapInformation(xbt_mheap_t heap,
119 std::vector<simgrid::mc::IgnoredHeapRegion>* i);
124 /** A hash which works with more stuff
126 * It can hash pairs: the standard hash currently doesn't include this.
128 template<class X> struct hash : public std::hash<X> {};
130 template<class X, class Y>
131 struct hash<std::pair<X,Y>> {
132 std::size_t operator()(std::pair<X,Y>const& x) const
136 return h1(x.first) ^ h2(x.second);
143 struct StateComparator {
144 s_xbt_mheap_t std_heap_copy;
145 std::size_t heaplimit;
146 std::array<ProcessComparisonState, 2> processStates;
148 std::unordered_set<std::pair<void*, void*>, hash<std::pair<void*, void*>>> compared_pointers;
152 compared_pointers.clear();
155 int initHeapInformation(
156 xbt_mheap_t heap1, xbt_mheap_t heap2,
157 std::vector<simgrid::mc::IgnoredHeapRegion>* i1,
158 std::vector<simgrid::mc::IgnoredHeapRegion>* i2);
160 HeapArea& equals_to1_(std::size_t i, std::size_t j)
162 return processStates[0].equals_to[ MAX_FRAGMENT_PER_BLOCK * i + j];
164 HeapArea& equals_to2_(std::size_t i, std::size_t j)
166 return processStates[1].equals_to[ MAX_FRAGMENT_PER_BLOCK * i + j];
168 Type*& types1_(std::size_t i, std::size_t j)
170 return processStates[0].types[ MAX_FRAGMENT_PER_BLOCK * i + j];
172 Type*& types2_(std::size_t i, std::size_t j)
174 return processStates[1].types[ MAX_FRAGMENT_PER_BLOCK * i + j];
177 HeapArea const& equals_to1_(std::size_t i, std::size_t j) const
179 return processStates[0].equals_to[ MAX_FRAGMENT_PER_BLOCK * i + j];
181 HeapArea const& equals_to2_(std::size_t i, std::size_t j) const
183 return processStates[1].equals_to[ MAX_FRAGMENT_PER_BLOCK * i + j];
185 Type* const& types1_(std::size_t i, std::size_t j) const
187 return processStates[0].types[ MAX_FRAGMENT_PER_BLOCK * i + j];
189 Type* const& types2_(std::size_t i, std::size_t j) const
191 return processStates[1].types[ MAX_FRAGMENT_PER_BLOCK * i + j];
194 /** Check whether two blocks are known to be matching
196 * @param b1 Block of state 1
197 * @param b2 Block of state 2
198 * @return if the blocks are known to be matching
200 bool blocksEqual(int b1, int b2) const
202 return this->equals_to1_(b1, 0).block == b2
203 && this->equals_to2_(b2, 0).block == b1;
206 /** Check whether two fragments are known to be matching
208 * @param b1 Block of state 1
209 * @param f1 Fragment of state 1
210 * @param b2 Block of state 2
211 * @param f2 Fragment of state 2
212 * @return if the fragments are known to be matching
214 int fragmentsEqual(int b1, int f1, int b2, int f2) const
216 return this->equals_to1_(b1, f1).block == b2
217 && this->equals_to1_(b1, f1).fragment == f2
218 && this->equals_to2_(b2, f2).block == b1
219 && this->equals_to2_(b2, f2).fragment == f1;
222 void match_equals(HeapLocationPairs* list);
228 /************************************************************************************/
230 static ssize_t heap_comparison_ignore_size(
231 std::vector<simgrid::mc::IgnoredHeapRegion>* ignore_list,
235 int end = ignore_list->size() - 1;
237 while (start <= end) {
238 unsigned int cursor = (start + end) / 2;
239 simgrid::mc::IgnoredHeapRegion const& region = (*ignore_list)[cursor];
240 if (region.address == address)
242 if (region.address < address)
244 if (region.address > address)
251 static bool is_stack(const void *address)
253 for (auto const& stack : mc_model_checker->process().stack_areas())
254 if (address == stack.address)
259 // TODO, this should depend on the snapshot?
260 static bool is_block_stack(int block)
262 for (auto const& stack : mc_model_checker->process().stack_areas())
263 if (block == stack.block)
271 void StateComparator::match_equals(HeapLocationPairs* list)
273 for (auto const& pair : *list) {
274 if (pair[0].fragment != -1) {
275 this->equals_to1_(pair[0].block, pair[0].fragment) =
276 simgrid::mc::HeapArea(pair[1].block, pair[1].fragment);
277 this->equals_to2_(pair[1].block, pair[1].fragment) =
278 simgrid::mc::HeapArea(pair[0].block, pair[0].fragment);
280 this->equals_to1_(pair[0].block, 0) =
281 simgrid::mc::HeapArea(pair[1].block, pair[1].fragment);
282 this->equals_to2_(pair[1].block, 0) =
283 simgrid::mc::HeapArea(pair[0].block, pair[0].fragment);
288 void ProcessComparisonState::initHeapInformation(xbt_mheap_t heap,
289 std::vector<simgrid::mc::IgnoredHeapRegion>* i)
291 auto heaplimit = ((struct mdesc *) heap)->heaplimit;
292 this->heapsize = ((struct mdesc *) heap)->heapsize;
294 this->equals_to.assign(heaplimit * MAX_FRAGMENT_PER_BLOCK, HeapArea());
295 this->types.assign(heaplimit * MAX_FRAGMENT_PER_BLOCK, nullptr);
298 int StateComparator::initHeapInformation(xbt_mheap_t heap1, xbt_mheap_t heap2,
299 std::vector<simgrid::mc::IgnoredHeapRegion>* i1,
300 std::vector<simgrid::mc::IgnoredHeapRegion>* i2)
302 if ((((struct mdesc *) heap1)->heaplimit !=
303 ((struct mdesc *) heap2)->heaplimit)
305 ((((struct mdesc *) heap1)->heapsize !=
306 ((struct mdesc *) heap2)->heapsize)))
308 this->heaplimit = ((struct mdesc *) heap1)->heaplimit;
309 this->std_heap_copy = *mc_model_checker->process().get_heap();
310 this->processStates[0].initHeapInformation(heap1, i1);
311 this->processStates[1].initHeapInformation(heap2, i2);
315 // TODO, have a robust way to find it in O(1)
317 mc_mem_region_t MC_get_heap_region(simgrid::mc::Snapshot* snapshot)
319 for (auto& region : snapshot->snapshot_regions)
320 if (region->region_type() == simgrid::mc::RegionType::Heap)
322 xbt_die("No heap region");
326 int mmalloc_compare_heap(
327 simgrid::mc::StateComparator& state, simgrid::mc::Snapshot* snapshot1, simgrid::mc::Snapshot* snapshot2)
329 simgrid::mc::Process* process = &mc_model_checker->process();
331 /* Start comparison */
332 size_t i1, i2, j1, j2, k;
333 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
334 int nb_diff1 = 0, nb_diff2 = 0;
336 int equal, res_compare = 0;
338 /* Check busy blocks */
342 malloc_info heapinfo_temp1, heapinfo_temp2;
343 malloc_info heapinfo_temp2b;
345 mc_mem_region_t heap_region1 = MC_get_heap_region(snapshot1);
346 mc_mem_region_t heap_region2 = MC_get_heap_region(snapshot2);
348 // This is the address of std_heap->heapinfo in the application process:
349 void* heapinfo_address = &((xbt_mheap_t) process->heap_address)->heapinfo;
351 // This is in snapshot do not use them directly:
352 const malloc_info* heapinfos1 = snapshot1->read<malloc_info*>(
353 (std::uint64_t)heapinfo_address, simgrid::mc::ProcessIndexMissing);
354 const malloc_info* heapinfos2 = snapshot2->read<malloc_info*>(
355 (std::uint64_t)heapinfo_address, simgrid::mc::ProcessIndexMissing);
357 while (i1 < state.heaplimit) {
359 const malloc_info* heapinfo1 = (const malloc_info*) MC_region_read(heap_region1, &heapinfo_temp1, &heapinfos1[i1], sizeof(malloc_info));
360 const malloc_info* heapinfo2 = (const malloc_info*) MC_region_read(heap_region2, &heapinfo_temp2, &heapinfos2[i1], sizeof(malloc_info));
362 if (heapinfo1->type == MMALLOC_TYPE_FREE || heapinfo1->type == MMALLOC_TYPE_HEAPINFO) { /* Free block */
367 if (heapinfo1->type < 0) {
368 fprintf(stderr, "Unkown mmalloc block type.\n");
373 ((void *) (((ADDR2UINT(i1)) - 1) * BLOCKSIZE +
374 (char *) state.std_heap_copy.heapbase));
376 if (heapinfo1->type == MMALLOC_TYPE_UNFRAGMENTED) { /* Large block */
378 if (is_stack(addr_block1)) {
379 for (k = 0; k < heapinfo1->busy_block.size; k++)
380 state.equals_to1_(i1 + k, 0) = HeapArea(i1, -1);
381 for (k = 0; k < heapinfo2->busy_block.size; k++)
382 state.equals_to2_(i1 + k, 0) = HeapArea(i1, -1);
383 i1 += heapinfo1->busy_block.size;
387 if (state.equals_to1_(i1, 0).valid) {
396 /* Try first to associate to same block in the other heap */
397 if (heapinfo2->type == heapinfo1->type
398 && state.equals_to2_(i1, 0).valid == 0) {
399 addr_block2 = (ADDR2UINT(i1) - 1) * BLOCKSIZE +
400 (char *) state.std_heap_copy.heapbase;
401 res_compare = compare_heap_area(state, simgrid::mc::ProcessIndexMissing,
402 addr_block1, addr_block2, snapshot1, snapshot2,
403 nullptr, nullptr, 0);
404 if (res_compare != 1) {
405 for (k = 1; k < heapinfo2->busy_block.size; k++)
406 state.equals_to2_(i1 + k, 0) = HeapArea(i1, -1);
407 for (k = 1; k < heapinfo1->busy_block.size; k++)
408 state.equals_to1_(i1 + k, 0) = HeapArea(i1, -1);
410 i1 += heapinfo1->busy_block.size;
414 while (i2 < state.heaplimit && !equal) {
416 addr_block2 = (ADDR2UINT(i2) - 1) * BLOCKSIZE +
417 (char *) state.std_heap_copy.heapbase;
424 const malloc_info* heapinfo2b = (const malloc_info*) MC_region_read(heap_region2, &heapinfo_temp2b, &heapinfos2[i2], sizeof(malloc_info));
426 if (heapinfo2b->type != MMALLOC_TYPE_UNFRAGMENTED) {
431 if (state.equals_to2_(i2, 0).valid) {
436 res_compare = compare_heap_area(state, simgrid::mc::ProcessIndexMissing,
437 addr_block1, addr_block2, snapshot1, snapshot2,
438 nullptr, nullptr, 0);
440 if (res_compare != 1) {
441 for (k = 1; k < heapinfo2b->busy_block.size; k++)
442 state.equals_to2_(i2 + k, 0) = HeapArea(i1, -1);
443 for (k = 1; k < heapinfo1->busy_block.size; k++)
444 state.equals_to1_(i1 + k, 0) = HeapArea(i2, -1);
446 i1 += heapinfo1->busy_block.size;
454 XBT_DEBUG("Block %zu not found (size_used = %zu, addr = %p)", i1,
455 heapinfo1->busy_block.busy_size, addr_block1);
456 i1 = state.heaplimit + 1;
461 } else { /* Fragmented block */
463 for (j1 = 0; j1 < (size_t) (BLOCKSIZE >> heapinfo1->type); j1++) {
465 if (heapinfo1->busy_frag.frag_size[j1] == -1) /* Free fragment */
468 if (state.equals_to1_(i1, j1).valid)
472 (void *) ((char *) addr_block1 + (j1 << heapinfo1->type));
477 /* Try first to associate to same fragment in the other heap */
478 if (heapinfo2->type == heapinfo1->type
479 && !state.equals_to2_(i1, j1).valid) {
480 addr_block2 = (ADDR2UINT(i1) - 1) * BLOCKSIZE +
481 (char *) state.std_heap_copy.heapbase;
483 (void *) ((char *) addr_block2 +
484 (j1 << heapinfo2->type));
485 res_compare = compare_heap_area(state, simgrid::mc::ProcessIndexMissing,
486 addr_frag1, addr_frag2, snapshot1, snapshot2,
487 nullptr, nullptr, 0);
488 if (res_compare != 1)
494 while (i2 < state.heaplimit && !equal) {
496 const malloc_info* heapinfo2b = (const malloc_info*) MC_region_read(
497 heap_region2, &heapinfo_temp2b, &heapinfos2[i2],
498 sizeof(malloc_info));
500 if (heapinfo2b->type == MMALLOC_TYPE_FREE || heapinfo2b->type == MMALLOC_TYPE_HEAPINFO) {
505 // We currently do not match fragments with unfragmented blocks (maybe we should).
506 if (heapinfo2b->type == MMALLOC_TYPE_UNFRAGMENTED) {
511 if (heapinfo2b->type < 0) {
512 fprintf(stderr, "Unkown mmalloc block type.\n");
516 for (j2 = 0; j2 < (size_t) (BLOCKSIZE >> heapinfo2b->type);
519 if (i2 == i1 && j2 == j1)
522 if (state.equals_to2_(i2, j2).valid)
525 addr_block2 = (ADDR2UINT(i2) - 1) * BLOCKSIZE +
526 (char *) state.std_heap_copy.heapbase;
528 (void *) ((char *) addr_block2 +
529 (j2 << heapinfo2b->type));
531 res_compare = compare_heap_area(
532 state, simgrid::mc::ProcessIndexMissing,
533 addr_frag1, addr_frag2, snapshot2, snapshot2,
534 nullptr, nullptr, 0);
535 if (res_compare != 1) {
548 ("Block %zu, fragment %zu not found (size_used = %zd, address = %p)\n",
549 i1, j1, heapinfo1->busy_frag.frag_size[j1],
551 i2 = state.heaplimit + 1;
552 i1 = state.heaplimit + 1;
565 /* All blocks/fragments are equal to another block/fragment ? */
568 for(i = 1; i < state.heaplimit; i++) {
569 const malloc_info* heapinfo1 = (const malloc_info*) MC_region_read(
570 heap_region1, &heapinfo_temp1, &heapinfos1[i], sizeof(malloc_info));
572 if (heapinfo1->type == MMALLOC_TYPE_UNFRAGMENTED
573 && i1 == state.heaplimit
574 && heapinfo1->busy_block.busy_size > 0
575 && !state.equals_to1_(i, 0).valid) {
576 XBT_DEBUG("Block %zu not found (size used = %zu)", i,
577 heapinfo1->busy_block.busy_size);
581 if (heapinfo1->type <= 0)
583 for (j = 0; j < (size_t) (BLOCKSIZE >> heapinfo1->type); j++)
584 if (i1 == state.heaplimit
585 && heapinfo1->busy_frag.frag_size[j] > 0
586 && !state.equals_to1_(i, j).valid) {
587 XBT_DEBUG("Block %zu, Fragment %zu not found (size used = %zd)",
588 i, j, heapinfo1->busy_frag.frag_size[j]);
593 if (i1 == state.heaplimit)
594 XBT_DEBUG("Number of blocks/fragments not found in heap1: %d", nb_diff1);
596 for (i=1; i < state.heaplimit; i++) {
597 const malloc_info* heapinfo2 = (const malloc_info*) MC_region_read(
598 heap_region2, &heapinfo_temp2, &heapinfos2[i], sizeof(malloc_info));
599 if (heapinfo2->type == MMALLOC_TYPE_UNFRAGMENTED
600 && i1 == state.heaplimit
601 && heapinfo2->busy_block.busy_size > 0
602 && !state.equals_to2_(i, 0).valid) {
603 XBT_DEBUG("Block %zu not found (size used = %zu)", i,
604 heapinfo2->busy_block.busy_size);
608 if (heapinfo2->type <= 0)
611 for (j = 0; j < (size_t) (BLOCKSIZE >> heapinfo2->type); j++)
612 if (i1 == state.heaplimit
613 && heapinfo2->busy_frag.frag_size[j] > 0
614 && !state.equals_to2_(i, j).valid) {
615 XBT_DEBUG("Block %zu, Fragment %zu not found (size used = %zd)",
616 i, j, heapinfo2->busy_frag.frag_size[j]);
622 if (i1 == state.heaplimit)
623 XBT_DEBUG("Number of blocks/fragments not found in heap2: %d", nb_diff2);
625 return nb_diff1 > 0 || nb_diff2 > 0;
631 * @param real_area1 Process address for state 1
632 * @param real_area2 Process address for state 2
633 * @param snapshot1 Snapshot of state 1
634 * @param snapshot2 Snapshot of state 2
637 * @param check_ignore
639 static int compare_heap_area_without_type(
640 simgrid::mc::StateComparator& state, int process_index,
641 const void *real_area1, const void *real_area2,
642 simgrid::mc::Snapshot* snapshot1,
643 simgrid::mc::Snapshot* snapshot2,
644 HeapLocationPairs* previous, int size,
647 simgrid::mc::Process* process = &mc_model_checker->process();
648 mc_mem_region_t heap_region1 = MC_get_heap_region(snapshot1);
649 mc_mem_region_t heap_region2 = MC_get_heap_region(snapshot2);
651 for (int i = 0; i < size; ) {
653 if (check_ignore > 0) {
654 ssize_t ignore1 = heap_comparison_ignore_size(
655 state.processStates[0].to_ignore, (char *) real_area1 + i);
657 ssize_t ignore2 = heap_comparison_ignore_size(
658 state.processStates[1].to_ignore, (char *) real_area2 + i);
659 if (ignore2 == ignore1) {
672 if (MC_snapshot_region_memcmp(((char *) real_area1) + i, heap_region1, ((char *) real_area2) + i, heap_region2, 1) != 0) {
674 int pointer_align = (i / sizeof(void *)) * sizeof(void *);
675 const void* addr_pointed1 = snapshot1->read(
676 remote((void**)((char *) real_area1 + pointer_align)), process_index);
677 const void* addr_pointed2 = snapshot2->read(
678 remote((void**)((char *) real_area2 + pointer_align)), process_index);
680 if (process->in_maestro_stack(remote(addr_pointed1))
681 && process->in_maestro_stack(remote(addr_pointed2))) {
682 i = pointer_align + sizeof(void *);
686 if (addr_pointed1 > state.std_heap_copy.heapbase
687 && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1)
688 && addr_pointed2 > state.std_heap_copy.heapbase
689 && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2)) {
690 // Both addreses are in the heap:
691 int res_compare = compare_heap_area(state ,process_index,
692 addr_pointed1, addr_pointed2,
693 snapshot1, snapshot2, previous, nullptr, 0);
694 if (res_compare == 1)
696 i = pointer_align + sizeof(void *);
712 * @param real_area1 Process address for state 1
713 * @param real_area2 Process address for state 2
714 * @param snapshot1 Snapshot of state 1
715 * @param snapshot2 Snapshot of state 2
718 * @param area_size either a byte_size or an elements_count (?)
719 * @param check_ignore
720 * @param pointer_level
721 * @return 0 (same), 1 (different), -1 (unknown)
723 static int compare_heap_area_with_type(
724 simgrid::mc::StateComparator& state, int process_index,
725 const void *real_area1, const void *real_area2,
726 simgrid::mc::Snapshot* snapshot1,
727 simgrid::mc::Snapshot* snapshot2,
728 HeapLocationPairs* previous, simgrid::mc::Type* type,
729 int area_size, int check_ignore,
734 // HACK: This should not happen but in pratice, there are some
735 // DW_TAG_typedef without an associated DW_AT_type:
736 //<1><538832>: Abbrev Number: 111 (DW_TAG_typedef)
737 // <538833> DW_AT_name : (indirect string, offset: 0x2292f3): gregset_t
738 // <538837> DW_AT_decl_file : 98
739 // <538838> DW_AT_decl_line : 37
743 if (is_stack(real_area1) && is_stack(real_area2))
746 if (check_ignore > 0) {
747 ssize_t ignore1 = heap_comparison_ignore_size(
748 state.processStates[0].to_ignore, real_area1);
750 && heap_comparison_ignore_size(
751 state.processStates[1].to_ignore, real_area2) == ignore1)
755 simgrid::mc::Type *subtype, *subsubtype;
757 const void *addr_pointed1, *addr_pointed2;
759 mc_mem_region_t heap_region1 = MC_get_heap_region(snapshot1);
760 mc_mem_region_t heap_region2 = MC_get_heap_region(snapshot2);
762 switch (type->type) {
763 case DW_TAG_unspecified_type:
766 case DW_TAG_base_type:
767 if (!type->name.empty() && type->name == "char") { /* String, hence random (arbitrary ?) size */
768 if (real_area1 == real_area2)
771 return MC_snapshot_region_memcmp(real_area1, heap_region1, real_area2, heap_region2, area_size) != 0;
773 if (area_size != -1 && type->byte_size != area_size)
776 return MC_snapshot_region_memcmp(real_area1, heap_region1, real_area2, heap_region2, type->byte_size) != 0;
780 case DW_TAG_enumeration_type:
781 if (area_size != -1 && type->byte_size != area_size)
783 return MC_snapshot_region_memcmp(real_area1, heap_region1, real_area2, heap_region2, type->byte_size) != 0;
786 case DW_TAG_const_type:
787 case DW_TAG_volatile_type:
789 type = type->subtype;
792 case DW_TAG_array_type:
793 subtype = type->subtype;
794 switch (subtype->type) {
795 case DW_TAG_unspecified_type:
798 case DW_TAG_base_type:
799 case DW_TAG_enumeration_type:
800 case DW_TAG_pointer_type:
801 case DW_TAG_reference_type:
802 case DW_TAG_rvalue_reference_type:
803 case DW_TAG_structure_type:
804 case DW_TAG_class_type:
805 case DW_TAG_union_type:
806 if (subtype->full_type)
807 subtype = subtype->full_type;
808 elm_size = subtype->byte_size;
810 // TODO, just remove the type indirection?
811 case DW_TAG_const_type:
813 case DW_TAG_volatile_type:
814 subsubtype = subtype->subtype;
815 if (subsubtype->full_type)
816 subsubtype = subsubtype->full_type;
817 elm_size = subsubtype->byte_size;
823 for (int i = 0; i < type->element_count; i++) {
824 // TODO, add support for variable stride (DW_AT_byte_stride)
826 compare_heap_area_with_type(state, process_index,
827 (char *) real_area1 + (i * elm_size),
828 (char *) real_area2 + (i * elm_size),
829 snapshot1, snapshot2, previous,
830 type->subtype, subtype->byte_size,
831 check_ignore, pointer_level);
837 case DW_TAG_reference_type:
838 case DW_TAG_rvalue_reference_type:
839 case DW_TAG_pointer_type:
840 if (type->subtype && type->subtype->type == DW_TAG_subroutine_type) {
841 addr_pointed1 = snapshot1->read(remote((void**)real_area1), process_index);
842 addr_pointed2 = snapshot2->read(remote((void**)real_area2), process_index);
843 return (addr_pointed1 != addr_pointed2);
846 if (pointer_level <= 1) {
847 addr_pointed1 = snapshot1->read(remote((void**)real_area1), process_index);
848 addr_pointed2 = snapshot2->read(remote((void**)real_area2), process_index);
849 if (addr_pointed1 > state.std_heap_copy.heapbase
850 && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1)
851 && addr_pointed2 > state.std_heap_copy.heapbase
852 && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2))
853 return compare_heap_area(state, process_index,
854 addr_pointed1, addr_pointed2, snapshot1,
855 snapshot2, previous, type->subtype,
858 return (addr_pointed1 != addr_pointed2);
860 for (size_t i = 0; i < (area_size / sizeof(void *)); i++) {
861 addr_pointed1 = snapshot1->read(
862 remote((void**)((char*) real_area1 + i * sizeof(void *))),
864 addr_pointed2 = snapshot2->read(
865 remote((void**)((char*) real_area2 + i * sizeof(void *))),
867 if (addr_pointed1 > state.std_heap_copy.heapbase
868 && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1)
869 && addr_pointed2 > state.std_heap_copy.heapbase
870 && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2))
872 compare_heap_area(state, process_index,
873 addr_pointed1, addr_pointed2, snapshot1,
874 snapshot2, previous, type->subtype,
877 res = (addr_pointed1 != addr_pointed2);
883 case DW_TAG_structure_type:
884 case DW_TAG_class_type:
886 type = type->full_type;
887 if (area_size != -1 && type->byte_size != area_size) {
888 if (area_size <= type->byte_size || area_size % type->byte_size != 0)
890 for (size_t i = 0; i < (size_t)(area_size / type->byte_size); i++) {
891 int res = compare_heap_area_with_type(state, process_index,
892 (char *) real_area1 + i * type->byte_size,
893 (char *) real_area2 + i * type->byte_size,
894 snapshot1, snapshot2, previous, type, -1,
900 for(simgrid::mc::Member& member : type->members) {
901 // TODO, optimize this? (for the offset case)
902 void *real_member1 = simgrid::dwarf::resolve_member(
903 real_area1, type, &member, (simgrid::mc::AddressSpace*) snapshot1, process_index);
904 void *real_member2 = simgrid::dwarf::resolve_member(
905 real_area2, type, &member, (simgrid::mc::AddressSpace*) snapshot2, process_index);
906 int res = compare_heap_area_with_type(
907 state, process_index, real_member1, real_member2,
908 snapshot1, snapshot2,
909 previous, member.type, -1,
917 case DW_TAG_union_type:
918 return compare_heap_area_without_type(state, process_index, real_area1, real_area2,
919 snapshot1, snapshot2, previous,
920 type->byte_size, check_ignore);
927 xbt_die("Unreachable");
930 /** Infer the type of a part of the block from the type of the block
932 * TODO, handle DW_TAG_array_type as well as arrays of the object ((*p)[5], p[5])
934 * TODO, handle subfields ((*p).bar.foo, (*p)[5].bar…)
936 * @param type_id DWARF type ID of the root address
938 * @return DWARF type ID for given offset
940 static simgrid::mc::Type* get_offset_type(void *real_base_address, simgrid::mc::Type* type,
941 int offset, int area_size,
942 simgrid::mc::Snapshot* snapshot, int process_index)
945 // Beginning of the block, the infered variable type if the type of the block:
949 switch (type->type) {
951 case DW_TAG_structure_type:
952 case DW_TAG_class_type:
954 type = type->full_type;
955 if (area_size != -1 && type->byte_size != area_size) {
956 if (area_size > type->byte_size && area_size % type->byte_size == 0)
962 for(simgrid::mc::Member& member : type->members) {
963 if (member.has_offset_location()) {
964 // We have the offset, use it directly (shortcut):
965 if (member.offset() == offset)
968 void *real_member = simgrid::dwarf::resolve_member(
969 real_base_address, type, &member, snapshot, process_index);
970 if ((char*) real_member - (char *) real_base_address == offset)
977 /* FIXME: other cases ? */
985 * @param area1 Process address for state 1
986 * @param area2 Process address for state 2
987 * @param snapshot1 Snapshot of state 1
988 * @param snapshot2 Snapshot of state 2
989 * @param previous Pairs of blocks already compared on the current path (or nullptr)
990 * @param type_id Type of variable
991 * @param pointer_level
992 * @return 0 (same), 1 (different), -1
995 int compare_heap_area(simgrid::mc::StateComparator& state, int process_index,
996 const void *area1, const void *area2,
997 simgrid::mc::Snapshot* snapshot1,
998 simgrid::mc::Snapshot* snapshot2,
999 HeapLocationPairs* previous,
1000 simgrid::mc::Type* type, int pointer_level)
1002 simgrid::mc::Process* process = &mc_model_checker->process();
1005 ssize_t block1, frag1, block2, frag2;
1007 int check_ignore = 0;
1009 void *real_addr_block1, *real_addr_block2, *real_addr_frag1, *real_addr_frag2;
1011 int offset1 = 0, offset2 = 0;
1012 int new_size1 = -1, new_size2 = -1;
1013 simgrid::mc::Type *new_type1 = nullptr, *new_type2 = nullptr;
1015 bool match_pairs = false;
1017 // This is the address of std_heap->heapinfo in the application process:
1018 void* heapinfo_address = &((xbt_mheap_t) process->heap_address)->heapinfo;
1020 const malloc_info* heapinfos1 = snapshot1->read(
1021 remote((const malloc_info**)heapinfo_address), process_index);
1022 const malloc_info* heapinfos2 = snapshot2->read(
1023 remote((const malloc_info**)heapinfo_address), process_index);
1025 malloc_info heapinfo_temp1, heapinfo_temp2;
1027 simgrid::mc::HeapLocationPairs current;
1028 if (previous == nullptr) {
1029 previous = ¤t;
1033 // Get block number:
1036 (char *) state.std_heap_copy.heapbase) / BLOCKSIZE + 1;
1039 (char *) state.std_heap_copy.heapbase) / BLOCKSIZE + 1;
1041 // If either block is a stack block:
1042 if (is_block_stack((int) block1) && is_block_stack((int) block2)) {
1043 previous->insert(simgrid::mc::makeHeapLocationPair(
1044 block1, -1, block2, -1));
1046 state.match_equals(previous);
1050 // If either block is not in the expected area of memory:
1051 if (((char *) area1 < (char *) state.std_heap_copy.heapbase)
1052 || (block1 > (ssize_t) state.processStates[0].heapsize) || (block1 < 1)
1053 || ((char *) area2 < (char *) state.std_heap_copy.heapbase)
1054 || (block2 > (ssize_t) state.processStates[1].heapsize) || (block2 < 1)) {
1058 // Process address of the block:
1059 real_addr_block1 = (ADDR2UINT(block1) - 1) * BLOCKSIZE +
1060 (char *) state.std_heap_copy.heapbase;
1061 real_addr_block2 = (ADDR2UINT(block2) - 1) * BLOCKSIZE +
1062 (char *) state.std_heap_copy.heapbase;
1066 if (type->full_type)
1067 type = type->full_type;
1069 // This assume that for "boring" types (volatile ...) byte_size is absent:
1070 while (type->byte_size == 0 && type->subtype != nullptr)
1071 type = type->subtype;
1074 if (type->type == DW_TAG_pointer_type
1075 || (type->type == DW_TAG_base_type && !type->name.empty()
1076 && type->name == "char"))
1079 type_size = type->byte_size;
1083 mc_mem_region_t heap_region1 = MC_get_heap_region(snapshot1);
1084 mc_mem_region_t heap_region2 = MC_get_heap_region(snapshot2);
1086 const malloc_info* heapinfo1 = (const malloc_info*) MC_region_read(
1087 heap_region1, &heapinfo_temp1, &heapinfos1[block1], sizeof(malloc_info));
1088 const malloc_info* heapinfo2 = (const malloc_info*) MC_region_read(
1089 heap_region2, &heapinfo_temp2, &heapinfos2[block2], sizeof(malloc_info));
1091 if ((heapinfo1->type == MMALLOC_TYPE_FREE || heapinfo1->type==MMALLOC_TYPE_HEAPINFO)
1092 && (heapinfo2->type == MMALLOC_TYPE_FREE || heapinfo2->type ==MMALLOC_TYPE_HEAPINFO)) {
1095 state.match_equals(previous);
1099 if (heapinfo1->type == MMALLOC_TYPE_UNFRAGMENTED
1100 && heapinfo2->type == MMALLOC_TYPE_UNFRAGMENTED) {
1101 /* Complete block */
1103 // TODO, lookup variable type from block type as done for fragmented blocks
1105 offset1 = (char *) area1 - (char *) real_addr_block1;
1106 offset2 = (char *) area2 - (char *) real_addr_block2;
1108 if (state.equals_to1_(block1, 0).valid
1109 && state.equals_to2_(block2, 0).valid
1110 && state.blocksEqual(block1, block2)) {
1112 state.match_equals(previous);
1116 if (type_size != -1) {
1117 if (type_size != (ssize_t) heapinfo1->busy_block.busy_size
1118 && type_size != (ssize_t) heapinfo2->busy_block.busy_size
1119 && (type->name.empty() || type->name == "struct s_smx_context")) {
1121 state.match_equals(previous);
1126 if (heapinfo1->busy_block.size != heapinfo2->busy_block.size)
1128 if (heapinfo1->busy_block.busy_size != heapinfo2->busy_block.busy_size)
1131 if (!previous->insert(simgrid::mc::makeHeapLocationPair(
1132 block1, -1, block2, -1)).second) {
1134 state.match_equals(previous);
1138 size = heapinfo1->busy_block.busy_size;
1140 // Remember (basic) type inference.
1141 // The current data structure only allows us to do this for the whole block.
1142 if (type != nullptr && area1 == real_addr_block1)
1143 state.types1_(block1, 0) = type;
1144 if (type != nullptr && area2 == real_addr_block2)
1145 state.types2_(block2, 0) = type;
1149 state.match_equals(previous);
1156 if (heapinfo1->busy_block.ignore > 0
1157 && heapinfo2->busy_block.ignore == heapinfo1->busy_block.ignore)
1158 check_ignore = heapinfo1->busy_block.ignore;
1160 } else if ((heapinfo1->type > 0) && (heapinfo2->type > 0)) { /* Fragmented block */
1164 ((uintptr_t) (ADDR2UINT(area1) % (BLOCKSIZE))) >> heapinfo1->type;
1166 ((uintptr_t) (ADDR2UINT(area2) % (BLOCKSIZE))) >> heapinfo2->type;
1168 // Process address of the fragment:
1170 (void *) ((char *) real_addr_block1 +
1171 (frag1 << heapinfo1->type));
1173 (void *) ((char *) real_addr_block2 +
1174 (frag2 << heapinfo2->type));
1176 // Check the size of the fragments against the size of the type:
1177 if (type_size != -1) {
1178 if (heapinfo1->busy_frag.frag_size[frag1] == -1
1179 || heapinfo2->busy_frag.frag_size[frag2] == -1) {
1181 state.match_equals(previous);
1185 if (type_size != heapinfo1->busy_frag.frag_size[frag1]
1186 || type_size != heapinfo2->busy_frag.frag_size[frag2]) {
1188 state.match_equals(previous);
1193 // Check if the blocks are already matched together:
1194 if (state.equals_to1_(block1, frag1).valid
1195 && state.equals_to2_(block2, frag2).valid) {
1196 if (offset1==offset2 && state.fragmentsEqual(block1, frag1, block2, frag2)) {
1198 state.match_equals(previous);
1202 // Compare the size of both fragments:
1203 if (heapinfo1->busy_frag.frag_size[frag1] !=
1204 heapinfo2->busy_frag.frag_size[frag2]) {
1205 if (type_size == -1) {
1207 state.match_equals(previous);
1213 // Size of the fragment:
1214 size = heapinfo1->busy_frag.frag_size[frag1];
1216 // Remember (basic) type inference.
1217 // The current data structure only allows us to do this for the whole fragment.
1218 if (type != nullptr && area1 == real_addr_frag1)
1219 state.types1_(block1, frag1) = type;
1220 if (type != nullptr && area2 == real_addr_frag2)
1221 state.types2_(block2, frag2) = type;
1223 // The type of the variable is already known:
1228 // Type inference from the block type.
1229 else if (state.types1_(block1, frag1) != nullptr
1230 || state.types2_(block2, frag2) != nullptr) {
1232 offset1 = (char *) area1 - (char *) real_addr_frag1;
1233 offset2 = (char *) area2 - (char *) real_addr_frag2;
1235 if (state.types1_(block1, frag1) != nullptr
1236 && state.types2_(block2, frag2) != nullptr) {
1238 get_offset_type(real_addr_frag1, state.types1_(block1, frag1),
1239 offset1, size, snapshot1, process_index);
1241 get_offset_type(real_addr_frag2, state.types2_(block2, frag2),
1242 offset1, size, snapshot2, process_index);
1243 } else if (state.types1_(block1, frag1) != nullptr) {
1245 get_offset_type(real_addr_frag1, state.types1_(block1, frag1),
1246 offset1, size, snapshot1, process_index);
1248 get_offset_type(real_addr_frag2, state.types1_(block1, frag1),
1249 offset2, size, snapshot2, process_index);
1250 } else if (state.types2_(block2, frag2) != nullptr) {
1252 get_offset_type(real_addr_frag1, state.types2_(block2, frag2),
1253 offset1, size, snapshot1, process_index);
1255 get_offset_type(real_addr_frag2, state.types2_(block2, frag2),
1256 offset2, size, snapshot2, process_index);
1259 state.match_equals(previous);
1263 if (new_type1 != nullptr && new_type2 != nullptr && new_type1 != new_type2) {
1266 while (type->byte_size == 0 && type->subtype != nullptr)
1267 type = type->subtype;
1268 new_size1 = type->byte_size;
1271 while (type->byte_size == 0 && type->subtype != nullptr)
1272 type = type->subtype;
1273 new_size2 = type->byte_size;
1277 state.match_equals(previous);
1282 if (new_size1 > 0 && new_size1 == new_size2) {
1287 if (offset1 == 0 && offset2 == 0
1288 && !previous->insert(simgrid::mc::makeHeapLocationPair(
1289 block1, frag1, block2, frag2)).second) {
1291 state.match_equals(previous);
1297 state.match_equals(previous);
1301 if ((heapinfo1->busy_frag.ignore[frag1] > 0)
1302 && (heapinfo2->busy_frag.ignore[frag2] ==
1303 heapinfo1->busy_frag.ignore[frag1]))
1304 check_ignore = heapinfo1->busy_frag.ignore[frag1];
1310 /* Start comparison */
1313 compare_heap_area_with_type(state, process_index, area1, area2, snapshot1, snapshot2,
1314 previous, type, size, check_ignore,
1318 compare_heap_area_without_type(state, process_index, area1, area2, snapshot1, snapshot2,
1319 previous, size, check_ignore);
1321 if (res_compare == 1)
1325 state.match_equals(previous);
1332 /************************** Snapshot comparison *******************************/
1333 /******************************************************************************/
1335 static int compare_areas_with_type(simgrid::mc::StateComparator& state,
1337 void* real_area1, simgrid::mc::Snapshot* snapshot1, mc_mem_region_t region1,
1338 void* real_area2, simgrid::mc::Snapshot* snapshot2, mc_mem_region_t region2,
1339 simgrid::mc::Type* type, int pointer_level)
1341 simgrid::mc::Process* process = &mc_model_checker->process();
1343 simgrid::mc::Type* subtype;
1344 simgrid::mc::Type* subsubtype;
1345 int elm_size, i, res;
1348 switch (type->type) {
1349 case DW_TAG_unspecified_type:
1352 case DW_TAG_base_type:
1353 case DW_TAG_enumeration_type:
1354 case DW_TAG_union_type:
1356 return MC_snapshot_region_memcmp(
1357 real_area1, region1, real_area2, region2,
1358 type->byte_size) != 0;
1360 case DW_TAG_typedef:
1361 case DW_TAG_volatile_type:
1362 case DW_TAG_const_type:
1364 type = type->subtype;
1366 case DW_TAG_array_type:
1367 subtype = type->subtype;
1368 switch (subtype->type) {
1369 case DW_TAG_unspecified_type:
1372 case DW_TAG_base_type:
1373 case DW_TAG_enumeration_type:
1374 case DW_TAG_pointer_type:
1375 case DW_TAG_reference_type:
1376 case DW_TAG_rvalue_reference_type:
1377 case DW_TAG_structure_type:
1378 case DW_TAG_class_type:
1379 case DW_TAG_union_type:
1380 if (subtype->full_type)
1381 subtype = subtype->full_type;
1382 elm_size = subtype->byte_size;
1384 case DW_TAG_const_type:
1385 case DW_TAG_typedef:
1386 case DW_TAG_volatile_type:
1387 subsubtype = subtype->subtype;
1388 if (subsubtype->full_type)
1389 subsubtype = subsubtype->full_type;
1390 elm_size = subsubtype->byte_size;
1396 for (i = 0; i < type->element_count; i++) {
1397 size_t off = i * elm_size;
1398 res = compare_areas_with_type(state, process_index,
1399 (char*) real_area1 + off, snapshot1, region1,
1400 (char*) real_area2 + off, snapshot2, region2,
1401 type->subtype, pointer_level);
1406 case DW_TAG_pointer_type:
1407 case DW_TAG_reference_type:
1408 case DW_TAG_rvalue_reference_type:
1410 void* addr_pointed1 = MC_region_read_pointer(region1, real_area1);
1411 void* addr_pointed2 = MC_region_read_pointer(region2, real_area2);
1413 if (type->subtype && type->subtype->type == DW_TAG_subroutine_type)
1414 return (addr_pointed1 != addr_pointed2);
1415 if (addr_pointed1 == nullptr && addr_pointed2 == nullptr)
1417 if (addr_pointed1 == nullptr || addr_pointed2 == nullptr)
1419 if (!state.compared_pointers.insert(
1420 std::make_pair(addr_pointed1, addr_pointed2)).second)
1425 // Some cases are not handled here:
1426 // * the pointers lead to different areas (one to the heap, the other to the RW segment ...);
1427 // * a pointer leads to the read-only segment of the current object;
1428 // * a pointer lead to a different ELF object.
1430 if (addr_pointed1 > process->heap_address
1431 && addr_pointed1 < mc_snapshot_get_heap_end(snapshot1)) {
1433 (addr_pointed2 > process->heap_address
1434 && addr_pointed2 < mc_snapshot_get_heap_end(snapshot2)))
1436 // The pointers are both in the heap:
1437 return simgrid::mc::compare_heap_area(state,
1438 process_index, addr_pointed1, addr_pointed2, snapshot1,
1439 snapshot2, nullptr, type->subtype, pointer_level);
1442 // The pointers are both in the current object R/W segment:
1443 else if (region1->contain(simgrid::mc::remote(addr_pointed1))) {
1444 if (!region2->contain(simgrid::mc::remote(addr_pointed2)))
1447 return (addr_pointed1 != addr_pointed2);
1449 return compare_areas_with_type(state, process_index,
1450 addr_pointed1, snapshot1, region1,
1451 addr_pointed2, snapshot2, region2,
1452 type->subtype, pointer_level);
1455 // TODO, We do not handle very well the case where
1456 // it belongs to a different (non-heap) region from the current one.
1459 return (addr_pointed1 != addr_pointed2);
1463 case DW_TAG_structure_type:
1464 case DW_TAG_class_type:
1465 for(simgrid::mc::Member& member : type->members) {
1466 void *member1 = simgrid::dwarf::resolve_member(
1467 real_area1, type, &member, snapshot1, process_index);
1468 void *member2 = simgrid::dwarf::resolve_member(
1469 real_area2, type, &member, snapshot2, process_index);
1470 mc_mem_region_t subregion1 = mc_get_region_hinted(member1, snapshot1, process_index, region1);
1471 mc_mem_region_t subregion2 = mc_get_region_hinted(member2, snapshot2, process_index, region2);
1473 compare_areas_with_type(state, process_index,
1474 member1, snapshot1, subregion1,
1475 member2, snapshot2, subregion2,
1476 member.type, pointer_level);
1481 case DW_TAG_subroutine_type:
1485 XBT_VERB("Unknown case: %d", type->type);
1492 static int compare_global_variables(
1493 simgrid::mc::StateComparator& state,
1494 simgrid::mc::ObjectInformation* object_info,
1496 mc_mem_region_t r1, mc_mem_region_t r2,
1497 simgrid::mc::Snapshot* snapshot1, simgrid::mc::Snapshot* snapshot2)
1499 xbt_assert(r1 && r2, "Missing region.");
1502 if (r1->storage_type() == simgrid::mc::StorageType::Privatized) {
1503 xbt_assert(process_index >= 0);
1504 if (r2->storage_type() != simgrid::mc::StorageType::Privatized)
1507 size_t process_count = MC_smpi_process_count();
1508 xbt_assert(process_count == r1->privatized_data().size()
1509 && process_count == r2->privatized_data().size());
1511 // Compare the global variables separately for each simulates process:
1512 for (size_t process_index = 0; process_index < process_count; process_index++) {
1513 int is_diff = compare_global_variables(state,
1514 object_info, process_index,
1515 &r1->privatized_data()[process_index],
1516 &r2->privatized_data()[process_index],
1517 snapshot1, snapshot2);
1518 if (is_diff) return 1;
1523 xbt_assert(r1->storage_type() != simgrid::mc::StorageType::Privatized);
1525 xbt_assert(r2->storage_type() != simgrid::mc::StorageType::Privatized);
1527 std::vector<simgrid::mc::Variable>& variables = object_info->global_variables;
1529 for (simgrid::mc::Variable& current_var : variables) {
1531 // If the variable is not in this object, skip it:
1532 // We do not expect to find a pointer to something which is not reachable
1533 // by the global variables.
1534 if ((char *) current_var.address < (char *) object_info->start_rw
1535 || (char *) current_var.address > (char *) object_info->end_rw)
1538 simgrid::mc::Type* bvariable_type = current_var.type;
1539 int res = compare_areas_with_type(state, process_index,
1540 (char *) current_var.address, snapshot1, r1,
1541 (char *) current_var.address, snapshot2, r2,
1544 XBT_VERB("Global variable %s (%p) is different between snapshots",
1545 current_var.name.c_str(),
1546 (char *) current_var.address);
1556 static int compare_local_variables(simgrid::mc::StateComparator& state,
1558 simgrid::mc::Snapshot* snapshot1,
1559 simgrid::mc::Snapshot* snapshot2,
1560 mc_snapshot_stack_t stack1,
1561 mc_snapshot_stack_t stack2)
1563 if (stack1->local_variables.size() != stack2->local_variables.size()) {
1564 XBT_VERB("Different number of local variables");
1568 unsigned int cursor = 0;
1569 local_variable_t current_var1, current_var2;
1571 while (cursor < stack1->local_variables.size()) {
1572 current_var1 = &stack1->local_variables[cursor];
1573 current_var2 = &stack1->local_variables[cursor];
1574 if (current_var1->name != current_var2->name
1575 || current_var1->subprogram != current_var2->subprogram
1576 || current_var1->ip != current_var2->ip) {
1577 // TODO, fix current_varX->subprogram->name to include name if DW_TAG_inlined_subprogram
1579 ("Different name of variable (%s - %s) "
1580 "or frame (%s - %s) or ip (%lu - %lu)",
1581 current_var1->name.c_str(),
1582 current_var2->name.c_str(),
1583 current_var1->subprogram->name.c_str(),
1584 current_var2->subprogram->name.c_str(),
1585 current_var1->ip, current_var2->ip);
1588 // TODO, fix current_varX->subprogram->name to include name if DW_TAG_inlined_subprogram
1590 simgrid::mc::Type* subtype = current_var1->type;
1592 compare_areas_with_type(state, process_index,
1593 current_var1->address, snapshot1, mc_get_snapshot_region(current_var1->address, snapshot1, process_index),
1594 current_var2->address, snapshot2, mc_get_snapshot_region(current_var2->address, snapshot2, process_index),
1598 // TODO, fix current_varX->subprogram->name to include name if DW_TAG_inlined_subprogram
1600 ("Local variable %s (%p - %p) in frame %s "
1601 "is different between snapshots",
1602 current_var1->name.c_str(),
1603 current_var1->address,
1604 current_var2->address,
1605 current_var1->subprogram->name.c_str());
1616 static std::unique_ptr<simgrid::mc::StateComparator> state_comparator;
1618 int snapshot_compare(int num1, simgrid::mc::Snapshot* s1, int num2, simgrid::mc::Snapshot* s2)
1620 // TODO, make this a field of ModelChecker or something similar
1622 if (state_comparator == nullptr)
1623 state_comparator = std::unique_ptr<StateComparator>(new StateComparator());
1625 state_comparator->clear();
1627 simgrid::mc::Process* process = &mc_model_checker->process();
1632 int hash_result = 0;
1634 hash_result = (s1->hash != s2->hash);
1636 XBT_VERB("(%d - %d) Different hash: 0x%" PRIx64 "--0x%" PRIx64, num1, num2, s1->hash, s2->hash);
1641 XBT_VERB("(%d - %d) Same hash: 0x%" PRIx64, num1, num2, s1->hash);
1644 /* Compare enabled processes */
1645 if (s1->enabled_processes != s2->enabled_processes) {
1646 XBT_VERB("(%d - %d) Different enabled processes", num1, num2);
1650 unsigned long i = 0;
1651 size_t size_used1, size_used2;
1654 /* Compare size of stacks */
1655 while (i < s1->stacks.size()) {
1656 size_used1 = s1->stack_sizes[i];
1657 size_used2 = s2->stack_sizes[i];
1658 if (size_used1 != size_used2) {
1660 XBT_DEBUG("(%d - %d) Different size used in stacks: %zu - %zu", num1, num2, size_used1, size_used2);
1665 XBT_VERB("(%d - %d) Different size used in stacks: %zu - %zu", num1, num2, size_used1, size_used2);
1673 /* Init heap information used in heap comparison algorithm */
1674 xbt_mheap_t heap1 = (xbt_mheap_t)s1->read_bytes(
1675 alloca(sizeof(struct mdesc)), sizeof(struct mdesc),
1676 remote(process->heap_address),
1677 simgrid::mc::ProcessIndexMissing, simgrid::mc::ReadOptions::lazy());
1678 xbt_mheap_t heap2 = (xbt_mheap_t)s2->read_bytes(
1679 alloca(sizeof(struct mdesc)), sizeof(struct mdesc),
1680 remote(process->heap_address),
1681 simgrid::mc::ProcessIndexMissing, simgrid::mc::ReadOptions::lazy());
1682 res_init = state_comparator->initHeapInformation(
1683 heap1, heap2, &s1->to_ignore, &s2->to_ignore);
1685 if (res_init == -1) {
1687 XBT_DEBUG("(%d - %d) Different heap information", num1, num2);
1691 XBT_VERB("(%d - %d) Different heap information", num1, num2);
1698 /* Stacks comparison */
1703 for (unsigned int cursor = 0; cursor < s1->stacks.size(); cursor++) {
1704 mc_snapshot_stack_t stack1 = &s1->stacks[cursor];
1705 mc_snapshot_stack_t stack2 = &s2->stacks[cursor];
1707 if (stack1->process_index != stack2->process_index) {
1709 XBT_DEBUG("(%d - %d) Stacks with different process index (%i vs %i)", num1, num2,
1710 stack1->process_index, stack2->process_index);
1712 else diff_local = compare_local_variables(*state_comparator,
1713 stack1->process_index, s1, s2, stack1, stack2);
1714 if (diff_local > 0) {
1716 XBT_DEBUG("(%d - %d) Different local variables between stacks %d", num1,
1723 XBT_VERB("(%d - %d) Different local variables between stacks %d", num1,
1732 size_t regions_count = s1->snapshot_regions.size();
1733 // TODO, raise a difference instead?
1734 xbt_assert(regions_count == s2->snapshot_regions.size());
1736 for (size_t k = 0; k != regions_count; ++k) {
1737 mc_mem_region_t region1 = s1->snapshot_regions[k].get();
1738 mc_mem_region_t region2 = s2->snapshot_regions[k].get();
1741 if (region1->region_type() != simgrid::mc::RegionType::Data)
1744 xbt_assert(region1->region_type() == region2->region_type());
1745 xbt_assert(region1->object_info() == region2->object_info());
1746 xbt_assert(region1->object_info());
1748 std::string const& name = region1->object_info()->file_name;
1750 /* Compare global variables */
1752 compare_global_variables(*state_comparator,
1753 region1->object_info(), simgrid::mc::ProcessIndexDisabled,
1754 region1, region2, s1, s2);
1758 XBT_DEBUG("(%d - %d) Different global variables in %s",
1759 num1, num2, name.c_str());
1763 XBT_VERB("(%d - %d) Different global variables in %s",
1764 num1, num2, name.c_str());
1773 if (simgrid::mc::mmalloc_compare_heap(*state_comparator, s1, s2) > 0) {
1776 XBT_DEBUG("(%d - %d) Different heap (mmalloc_compare)", num1, num2);
1781 XBT_VERB("(%d - %d) Different heap (mmalloc_compare)", num1, num2);
1788 if (errors || hash_result)
1789 XBT_VERB("(%d - %d) Difference found", num1, num2);
1791 XBT_VERB("(%d - %d) No difference found", num1, num2);
1794 #if defined(MC_DEBUG) && defined(MC_VERBOSE)
1796 // * false positive SHOULD be avoided.
1797 // * There MUST not be any false negative.
1799 XBT_VERB("(%d - %d) State equality hash test is %s %s", num1, num2,
1800 (hash_result != 0) == (errors != 0) ? "true" : "false",
1801 !hash_result ? "positive" : "negative");
1805 return errors > 0 || hash_result;