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 snapshotting 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 explicit 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 class HeapArea : public HeapLocation {
48 explicit HeapArea(int block) : valid_(true) { block_ = block; }
49 HeapArea(int block, int fragment) : valid_(true)
56 class ProcessComparisonState {
58 const std::vector<simgrid::mc::IgnoredHeapRegion>* to_ignore = nullptr;
59 std::vector<HeapArea> equals_to;
60 std::vector<simgrid::mc::Type*> types;
61 std::size_t heapsize = 0;
63 void initHeapInformation(xbt_mheap_t heap, const std::vector<simgrid::mc::IgnoredHeapRegion>& i);
66 class StateComparator {
68 s_xbt_mheap_t std_heap_copy;
69 std::size_t heaplimit;
70 std::array<ProcessComparisonState, 2> processStates;
72 std::unordered_set<std::pair<const void*, const void*>, simgrid::xbt::hash<std::pair<const void*, const void*>>>
77 compared_pointers.clear();
80 int initHeapInformation(xbt_mheap_t heap1, xbt_mheap_t heap2, const std::vector<simgrid::mc::IgnoredHeapRegion>& i1,
81 const std::vector<simgrid::mc::IgnoredHeapRegion>& i2);
83 template <int rank> HeapArea& equals_to_(std::size_t i, std::size_t j)
85 return processStates[rank - 1].equals_to[MAX_FRAGMENT_PER_BLOCK * i + j];
87 template <int rank> Type*& types_(std::size_t i, std::size_t j)
89 return processStates[rank - 1].types[MAX_FRAGMENT_PER_BLOCK * i + j];
92 template <int rank> HeapArea const& equals_to_(std::size_t i, std::size_t j) const
94 return processStates[rank - 1].equals_to[MAX_FRAGMENT_PER_BLOCK * i + j];
96 template <int rank> Type* const& types_(std::size_t i, std::size_t j) const
98 return processStates[rank - 1].types[MAX_FRAGMENT_PER_BLOCK * i + j];
101 /** Check whether two blocks are known to be matching
103 * @param b1 Block of state 1
104 * @param b2 Block of state 2
105 * @return if the blocks are known to be matching
107 bool blocksEqual(int b1, int b2) const
109 return this->equals_to_<1>(b1, 0).block_ == b2 && this->equals_to_<2>(b2, 0).block_ == b1;
112 /** Check whether two fragments are known to be matching
114 * @param b1 Block of state 1
115 * @param f1 Fragment of state 1
116 * @param b2 Block of state 2
117 * @param f2 Fragment of state 2
118 * @return if the fragments are known to be matching
120 int fragmentsEqual(int b1, int f1, int b2, int f2) const
122 return this->equals_to_<1>(b1, f1).block_ == b2 && this->equals_to_<1>(b1, f1).fragment_ == f2 &&
123 this->equals_to_<2>(b2, f2).block_ == b1 && this->equals_to_<2>(b2, f2).fragment_ == f1;
126 void match_equals(HeapLocationPairs* list);
132 /************************************************************************************/
134 static ssize_t heap_comparison_ignore_size(const std::vector<simgrid::mc::IgnoredHeapRegion>* ignore_list,
138 int end = ignore_list->size() - 1;
140 while (start <= end) {
141 unsigned int cursor = (start + end) / 2;
142 simgrid::mc::IgnoredHeapRegion const& region = (*ignore_list)[cursor];
143 if (region.address == address)
145 if (region.address < address)
147 if (region.address > address)
154 static bool is_stack(const void *address)
156 for (auto const& stack : mc_model_checker->process().stack_areas())
157 if (address == stack.address)
162 // TODO, this should depend on the snapshot?
163 static bool is_block_stack(int block)
165 for (auto const& stack : mc_model_checker->process().stack_areas())
166 if (block == stack.block)
174 void StateComparator::match_equals(HeapLocationPairs* list)
176 for (auto const& pair : *list) {
177 if (pair[0].fragment_ != -1) {
178 this->equals_to_<1>(pair[0].block_, pair[0].fragment_) = simgrid::mc::HeapArea(pair[1].block_, pair[1].fragment_);
179 this->equals_to_<2>(pair[1].block_, pair[1].fragment_) = simgrid::mc::HeapArea(pair[0].block_, pair[0].fragment_);
181 this->equals_to_<1>(pair[0].block_, 0) = simgrid::mc::HeapArea(pair[1].block_, pair[1].fragment_);
182 this->equals_to_<2>(pair[1].block_, 0) = simgrid::mc::HeapArea(pair[0].block_, pair[0].fragment_);
187 void ProcessComparisonState::initHeapInformation(xbt_mheap_t heap, const std::vector<simgrid::mc::IgnoredHeapRegion>& i)
189 auto heaplimit = heap->heaplimit;
190 this->heapsize = heap->heapsize;
191 this->to_ignore = &i;
192 this->equals_to.assign(heaplimit * MAX_FRAGMENT_PER_BLOCK, HeapArea());
193 this->types.assign(heaplimit * MAX_FRAGMENT_PER_BLOCK, nullptr);
196 int StateComparator::initHeapInformation(xbt_mheap_t heap1, xbt_mheap_t heap2,
197 const std::vector<simgrid::mc::IgnoredHeapRegion>& i1,
198 const std::vector<simgrid::mc::IgnoredHeapRegion>& i2)
200 if ((heap1->heaplimit != heap2->heaplimit) || (heap1->heapsize != heap2->heapsize))
202 this->heaplimit = heap1->heaplimit;
203 this->std_heap_copy = *mc_model_checker->process().get_heap();
204 this->processStates[0].initHeapInformation(heap1, i1);
205 this->processStates[1].initHeapInformation(heap2, i2);
209 // TODO, have a robust way to find it in O(1)
210 static inline Region* MC_get_heap_region(const Snapshot& snapshot)
212 for (auto const& region : snapshot.snapshot_regions_)
213 if (region->region_type() == simgrid::mc::RegionType::Heap)
215 xbt_die("No heap region");
218 static bool heap_area_differ(StateComparator& state, const void* area1, const void* area2, const Snapshot& snapshot1,
219 const Snapshot& snapshot2, HeapLocationPairs* previous, Type* type, int pointer_level);
221 static bool mmalloc_heap_differ(simgrid::mc::StateComparator& state, const simgrid::mc::Snapshot& snapshot1,
222 const simgrid::mc::Snapshot& snapshot2)
224 const simgrid::mc::RemoteClient& process = mc_model_checker->process();
226 /* Check busy blocks */
229 malloc_info heapinfo_temp1;
230 malloc_info heapinfo_temp2;
231 malloc_info heapinfo_temp2b;
233 simgrid::mc::Region* heap_region1 = MC_get_heap_region(snapshot1);
234 simgrid::mc::Region* heap_region2 = MC_get_heap_region(snapshot2);
236 // This is the address of std_heap->heapinfo in the application process:
237 void* heapinfo_address = &((xbt_mheap_t)process.heap_address)->heapinfo;
239 // This is in snapshot do not use them directly:
240 const malloc_info* heapinfos1 =
241 snapshot1.read<malloc_info*>(RemotePtr<malloc_info*>((std::uint64_t)heapinfo_address));
242 const malloc_info* heapinfos2 =
243 snapshot2.read<malloc_info*>(RemotePtr<malloc_info*>((std::uint64_t)heapinfo_address));
245 while (i1 < state.heaplimit) {
246 const malloc_info* heapinfo1 =
247 (const malloc_info*)heap_region1->read(&heapinfo_temp1, &heapinfos1[i1], sizeof(malloc_info));
248 const malloc_info* heapinfo2 =
249 (const malloc_info*)heap_region2->read(&heapinfo_temp2, &heapinfos2[i1], sizeof(malloc_info));
251 if (heapinfo1->type == MMALLOC_TYPE_FREE || heapinfo1->type == MMALLOC_TYPE_HEAPINFO) { /* Free block */
256 xbt_assert(heapinfo1->type >= 0, "Unkown mmalloc block type: %d", heapinfo1->type);
258 void* addr_block1 = ((void*)(((ADDR2UINT(i1)) - 1) * BLOCKSIZE + (char*)state.std_heap_copy.heapbase));
260 if (heapinfo1->type == MMALLOC_TYPE_UNFRAGMENTED) { /* Large block */
261 if (is_stack(addr_block1)) {
262 for (size_t k = 0; k < heapinfo1->busy_block.size; k++)
263 state.equals_to_<1>(i1 + k, 0) = HeapArea(i1, -1);
264 for (size_t k = 0; k < heapinfo2->busy_block.size; k++)
265 state.equals_to_<2>(i1 + k, 0) = HeapArea(i1, -1);
266 i1 += heapinfo1->busy_block.size;
270 if (state.equals_to_<1>(i1, 0).valid_) {
278 /* Try first to associate to same block in the other heap */
279 if (heapinfo2->type == heapinfo1->type && state.equals_to_<2>(i1, 0).valid_ == 0) {
280 void* addr_block2 = (ADDR2UINT(i1) - 1) * BLOCKSIZE + (char*)state.std_heap_copy.heapbase;
281 if (not heap_area_differ(state, addr_block1, addr_block2, snapshot1, snapshot2, nullptr, nullptr, 0)) {
282 for (size_t k = 1; k < heapinfo2->busy_block.size; k++)
283 state.equals_to_<2>(i1 + k, 0) = HeapArea(i1, -1);
284 for (size_t k = 1; k < heapinfo1->busy_block.size; k++)
285 state.equals_to_<1>(i1 + k, 0) = HeapArea(i1, -1);
287 i1 += heapinfo1->busy_block.size;
291 while (i2 < state.heaplimit && not equal) {
292 void* addr_block2 = (ADDR2UINT(i2) - 1) * BLOCKSIZE + (char*)state.std_heap_copy.heapbase;
299 const malloc_info* heapinfo2b =
300 (const malloc_info*)heap_region2->read(&heapinfo_temp2b, &heapinfos2[i2], sizeof(malloc_info));
302 if (heapinfo2b->type != MMALLOC_TYPE_UNFRAGMENTED) {
307 if (state.equals_to_<2>(i2, 0).valid_) {
312 if (not heap_area_differ(state, addr_block1, addr_block2, snapshot1, snapshot2, nullptr, nullptr, 0)) {
313 for (size_t k = 1; k < heapinfo2b->busy_block.size; k++)
314 state.equals_to_<2>(i2 + k, 0) = HeapArea(i1, -1);
315 for (size_t k = 1; k < heapinfo1->busy_block.size; k++)
316 state.equals_to_<1>(i1 + k, 0) = HeapArea(i2, -1);
318 i1 += heapinfo1->busy_block.size;
325 XBT_DEBUG("Block %zu not found (size_used = %zu, addr = %p)", i1, heapinfo1->busy_block.busy_size, addr_block1);
329 } else { /* Fragmented block */
331 for (size_t j1 = 0; j1 < (size_t)(BLOCKSIZE >> heapinfo1->type); j1++) {
333 if (heapinfo1->busy_frag.frag_size[j1] == -1) /* Free fragment_ */
336 if (state.equals_to_<1>(i1, j1).valid_)
339 void* addr_frag1 = (void*)((char*)addr_block1 + (j1 << heapinfo1->type));
344 /* Try first to associate to same fragment_ in the other heap */
345 if (heapinfo2->type == heapinfo1->type && not state.equals_to_<2>(i1, j1).valid_) {
346 void* addr_block2 = (ADDR2UINT(i1) - 1) * BLOCKSIZE + (char*)state.std_heap_copy.heapbase;
347 void* addr_frag2 = (void*)((char*)addr_block2 + (j1 << heapinfo2->type));
348 if (not heap_area_differ(state, addr_frag1, addr_frag2, snapshot1, snapshot2, nullptr, nullptr, 0))
352 while (i2 < state.heaplimit && not equal) {
353 const malloc_info* heapinfo2b =
354 (const malloc_info*)heap_region2->read(&heapinfo_temp2b, &heapinfos2[i2], sizeof(malloc_info));
356 if (heapinfo2b->type == MMALLOC_TYPE_FREE || heapinfo2b->type == MMALLOC_TYPE_HEAPINFO) {
361 // We currently do not match fragments with unfragmented blocks (maybe we should).
362 if (heapinfo2b->type == MMALLOC_TYPE_UNFRAGMENTED) {
367 xbt_assert(heapinfo2b->type >= 0, "Unkown mmalloc block type: %d", heapinfo2b->type);
369 for (size_t j2 = 0; j2 < (size_t)(BLOCKSIZE >> heapinfo2b->type); j2++) {
370 if (i2 == i1 && j2 == j1)
373 if (state.equals_to_<2>(i2, j2).valid_)
376 void* addr_block2 = (ADDR2UINT(i2) - 1) * BLOCKSIZE + (char*)state.std_heap_copy.heapbase;
377 void* addr_frag2 = (void*)((char*)addr_block2 + (j2 << heapinfo2b->type));
379 if (not heap_area_differ(state, addr_frag1, addr_frag2, snapshot1, snapshot2, nullptr, nullptr, 0)) {
389 XBT_DEBUG("Block %zu, fragment_ %zu not found (size_used = %zd, address = %p)\n", i1, j1,
390 heapinfo1->busy_frag.frag_size[j1], addr_frag1);
399 /* All blocks/fragments are equal to another block/fragment_ ? */
400 for (size_t i = 1; i < state.heaplimit; i++) {
401 const malloc_info* heapinfo1 =
402 (const malloc_info*)heap_region1->read(&heapinfo_temp1, &heapinfos1[i], sizeof(malloc_info));
404 if (heapinfo1->type == MMALLOC_TYPE_UNFRAGMENTED && i1 == state.heaplimit && heapinfo1->busy_block.busy_size > 0 &&
405 not state.equals_to_<1>(i, 0).valid_) {
406 XBT_DEBUG("Block %zu not found (size used = %zu)", i, heapinfo1->busy_block.busy_size);
410 if (heapinfo1->type <= 0)
412 for (size_t j = 0; j < (size_t)(BLOCKSIZE >> heapinfo1->type); j++)
413 if (i1 == state.heaplimit && heapinfo1->busy_frag.frag_size[j] > 0 && not state.equals_to_<1>(i, j).valid_) {
414 XBT_DEBUG("Block %zu, Fragment %zu not found (size used = %zd)", i, j, heapinfo1->busy_frag.frag_size[j]);
419 for (size_t i = 1; i < state.heaplimit; i++) {
420 const malloc_info* heapinfo2 =
421 (const malloc_info*)heap_region2->read(&heapinfo_temp2, &heapinfos2[i], sizeof(malloc_info));
422 if (heapinfo2->type == MMALLOC_TYPE_UNFRAGMENTED && i1 == state.heaplimit && heapinfo2->busy_block.busy_size > 0 &&
423 not state.equals_to_<2>(i, 0).valid_) {
424 XBT_DEBUG("Block %zu not found (size used = %zu)", i,
425 heapinfo2->busy_block.busy_size);
429 if (heapinfo2->type <= 0)
432 for (size_t j = 0; j < (size_t)(BLOCKSIZE >> heapinfo2->type); j++)
433 if (i1 == state.heaplimit && heapinfo2->busy_frag.frag_size[j] > 0 && not state.equals_to_<2>(i, j).valid_) {
434 XBT_DEBUG("Block %zu, Fragment %zu not found (size used = %zd)",
435 i, j, heapinfo2->busy_frag.frag_size[j]);
446 * @param real_area1 Process address for state 1
447 * @param real_area2 Process address for state 2
448 * @param snapshot1 Snapshot of state 1
449 * @param snapshot2 Snapshot of state 2
452 * @param check_ignore
453 * @return true when different, false otherwise (same or unknown)
455 static bool heap_area_differ_without_type(simgrid::mc::StateComparator& state, const void* real_area1,
456 const void* real_area2, const simgrid::mc::Snapshot& snapshot1,
457 const simgrid::mc::Snapshot& snapshot2, HeapLocationPairs* previous, int size,
460 const simgrid::mc::RemoteClient& process = mc_model_checker->process();
461 simgrid::mc::Region* heap_region1 = MC_get_heap_region(snapshot1);
462 simgrid::mc::Region* heap_region2 = MC_get_heap_region(snapshot2);
464 for (int i = 0; i < size; ) {
465 if (check_ignore > 0) {
466 ssize_t ignore1 = heap_comparison_ignore_size(state.processStates[0].to_ignore, (const char*)real_area1 + i);
468 ssize_t ignore2 = heap_comparison_ignore_size(state.processStates[1].to_ignore, (const char*)real_area2 + i);
469 if (ignore2 == ignore1) {
481 if (MC_snapshot_region_memcmp((const char*)real_area1 + i, heap_region1, (const char*)real_area2 + i, heap_region2,
483 int pointer_align = (i / sizeof(void *)) * sizeof(void *);
484 const void* addr_pointed1 = snapshot1.read(remote((void* const*)((const char*)real_area1 + pointer_align)));
485 const void* addr_pointed2 = snapshot2.read(remote((void* const*)((const char*)real_area2 + pointer_align)));
487 if (process.in_maestro_stack(remote(addr_pointed1)) && process.in_maestro_stack(remote(addr_pointed2))) {
488 i = pointer_align + sizeof(void *);
492 if (snapshot1.on_heap(addr_pointed1) && snapshot2.on_heap(addr_pointed2)) {
493 // Both addresses are in the heap:
494 if (heap_area_differ(state, addr_pointed1, addr_pointed2, snapshot1, snapshot2, previous, nullptr, 0))
496 i = pointer_align + sizeof(void *);
512 * @param real_area1 Process address for state 1
513 * @param real_area2 Process address for state 2
514 * @param snapshot1 Snapshot of state 1
515 * @param snapshot2 Snapshot of state 2
518 * @param area_size either a byte_size or an elements_count (?)
519 * @param check_ignore
520 * @param pointer_level
521 * @return true when different, false otherwise (same or unknown)
523 static bool heap_area_differ_with_type(simgrid::mc::StateComparator& state, const void* real_area1,
524 const void* real_area2, const simgrid::mc::Snapshot& snapshot1,
525 const simgrid::mc::Snapshot& snapshot2, HeapLocationPairs* previous,
526 simgrid::mc::Type* type, int area_size, int check_ignore, int pointer_level)
528 // HACK: This should not happen but in practice, there are some
529 // DW_TAG_typedef without an associated DW_AT_type:
530 //<1><538832>: Abbrev Number: 111 (DW_TAG_typedef)
531 // <538833> DW_AT_name : (indirect string, offset: 0x2292f3): gregset_t
532 // <538837> DW_AT_decl_file : 98
533 // <538838> DW_AT_decl_line : 37
537 if (is_stack(real_area1) && is_stack(real_area2))
540 if (check_ignore > 0) {
541 ssize_t ignore1 = heap_comparison_ignore_size(state.processStates[0].to_ignore, real_area1);
542 if (ignore1 > 0 && heap_comparison_ignore_size(state.processStates[1].to_ignore, real_area2) == ignore1)
546 simgrid::mc::Type* subtype;
547 simgrid::mc::Type* subsubtype;
549 const void* addr_pointed1;
550 const void* addr_pointed2;
552 simgrid::mc::Region* heap_region1 = MC_get_heap_region(snapshot1);
553 simgrid::mc::Region* heap_region2 = MC_get_heap_region(snapshot2);
555 switch (type->type) {
556 case DW_TAG_unspecified_type:
559 case DW_TAG_base_type:
560 if (not type->name.empty() && type->name == "char") { /* String, hence random (arbitrary ?) size */
561 if (real_area1 == real_area2)
564 return MC_snapshot_region_memcmp(real_area1, heap_region1, real_area2, heap_region2, area_size) != 0;
566 if (area_size != -1 && type->byte_size != area_size)
569 return MC_snapshot_region_memcmp(real_area1, heap_region1, real_area2, heap_region2, type->byte_size) != 0;
572 case DW_TAG_enumeration_type:
573 if (area_size != -1 && type->byte_size != area_size)
575 return MC_snapshot_region_memcmp(real_area1, heap_region1, real_area2, heap_region2, type->byte_size) != 0;
578 case DW_TAG_const_type:
579 case DW_TAG_volatile_type:
580 return heap_area_differ_with_type(state, real_area1, real_area2, snapshot1, snapshot2, previous, type->subtype,
581 area_size, check_ignore, pointer_level);
583 case DW_TAG_array_type:
584 subtype = type->subtype;
585 switch (subtype->type) {
586 case DW_TAG_unspecified_type:
589 case DW_TAG_base_type:
590 case DW_TAG_enumeration_type:
591 case DW_TAG_pointer_type:
592 case DW_TAG_reference_type:
593 case DW_TAG_rvalue_reference_type:
594 case DW_TAG_structure_type:
595 case DW_TAG_class_type:
596 case DW_TAG_union_type:
597 if (subtype->full_type)
598 subtype = subtype->full_type;
599 elm_size = subtype->byte_size;
601 // TODO, just remove the type indirection?
602 case DW_TAG_const_type:
604 case DW_TAG_volatile_type:
605 subsubtype = subtype->subtype;
606 if (subsubtype->full_type)
607 subsubtype = subsubtype->full_type;
608 elm_size = subsubtype->byte_size;
613 for (int i = 0; i < type->element_count; i++) {
614 // TODO, add support for variable stride (DW_AT_byte_stride)
615 if (heap_area_differ_with_type(state, (const char*)real_area1 + (i * elm_size),
616 (const char*)real_area2 + (i * elm_size), snapshot1, snapshot2, previous,
617 type->subtype, subtype->byte_size, check_ignore, pointer_level))
622 case DW_TAG_reference_type:
623 case DW_TAG_rvalue_reference_type:
624 case DW_TAG_pointer_type:
625 if (type->subtype && type->subtype->type == DW_TAG_subroutine_type) {
626 addr_pointed1 = snapshot1.read(remote((void* const*)real_area1));
627 addr_pointed2 = snapshot2.read(remote((void* const*)real_area2));
628 return (addr_pointed1 != addr_pointed2);
631 if (pointer_level <= 1) {
632 addr_pointed1 = snapshot1.read(remote((void* const*)real_area1));
633 addr_pointed2 = snapshot2.read(remote((void* const*)real_area2));
634 if (snapshot1.on_heap(addr_pointed1) && snapshot2.on_heap(addr_pointed2))
635 return heap_area_differ(state, addr_pointed1, addr_pointed2, snapshot1, snapshot2, previous, type->subtype,
638 return (addr_pointed1 != addr_pointed2);
640 for (size_t i = 0; i < (area_size / sizeof(void*)); i++) {
641 addr_pointed1 = snapshot1.read(remote((void* const*)((const char*)real_area1 + i * sizeof(void*))));
642 addr_pointed2 = snapshot2.read(remote((void* const*)((const char*)real_area2 + i * sizeof(void*))));
643 bool differ = snapshot1.on_heap(addr_pointed1) && snapshot2.on_heap(addr_pointed2)
644 ? heap_area_differ(state, addr_pointed1, addr_pointed2, snapshot1, snapshot2, previous,
645 type->subtype, pointer_level)
646 : addr_pointed1 != addr_pointed2;
652 case DW_TAG_structure_type:
653 case DW_TAG_class_type:
655 type = type->full_type;
656 if (type->byte_size == 0)
658 if (area_size != -1 && type->byte_size != area_size) {
659 if (area_size <= type->byte_size || area_size % type->byte_size != 0)
661 for (size_t i = 0; i < (size_t)(area_size / type->byte_size); i++) {
662 if (heap_area_differ_with_type(state, (const char*)real_area1 + i * type->byte_size,
663 (const char*)real_area2 + i * type->byte_size, snapshot1, snapshot2, previous,
664 type, -1, check_ignore, 0))
668 for (simgrid::mc::Member& member : type->members) {
669 // TODO, optimize this? (for the offset case)
670 void* real_member1 = simgrid::dwarf::resolve_member(real_area1, type, &member, &snapshot1);
671 void* real_member2 = simgrid::dwarf::resolve_member(real_area2, type, &member, &snapshot2);
672 if (heap_area_differ_with_type(state, real_member1, real_member2, snapshot1, snapshot2, previous,
673 member.type, -1, check_ignore, 0))
679 case DW_TAG_union_type:
680 return heap_area_differ_without_type(state, real_area1, real_area2, snapshot1, snapshot2, previous,
681 type->byte_size, check_ignore);
688 /** Infer the type of a part of the block from the type of the block
690 * TODO, handle DW_TAG_array_type as well as arrays of the object ((*p)[5], p[5])
692 * TODO, handle subfields ((*p).bar.foo, (*p)[5].bar…)
694 * @param type DWARF type ID of the root address
696 * @return DWARF type ID for given offset
698 static simgrid::mc::Type* get_offset_type(void* real_base_address, simgrid::mc::Type* type, int offset, int area_size,
699 const simgrid::mc::Snapshot& snapshot)
701 // Beginning of the block, the inferred variable type if the type of the block:
705 switch (type->type) {
706 case DW_TAG_structure_type:
707 case DW_TAG_class_type:
709 type = type->full_type;
710 if (area_size != -1 && type->byte_size != area_size) {
711 if (area_size > type->byte_size && area_size % type->byte_size == 0)
717 for (simgrid::mc::Member& member : type->members) {
718 if (member.has_offset_location()) {
719 // We have the offset, use it directly (shortcut):
720 if (member.offset() == offset)
723 void* real_member = simgrid::dwarf::resolve_member(real_base_address, type, &member, &snapshot);
724 if ((char*)real_member - (char*)real_base_address == offset)
731 /* FIXME: other cases ? */
738 * @param area1 Process address for state 1
739 * @param area2 Process address for state 2
740 * @param snapshot1 Snapshot of state 1
741 * @param snapshot2 Snapshot of state 2
742 * @param previous Pairs of blocks already compared on the current path (or nullptr)
743 * @param type_id Type of variable
744 * @param pointer_level
745 * @return true when different, false otherwise (same or unknown)
747 static bool heap_area_differ(simgrid::mc::StateComparator& state, const void* area1, const void* area2,
748 const simgrid::mc::Snapshot& snapshot1, const simgrid::mc::Snapshot& snapshot2,
749 HeapLocationPairs* previous, simgrid::mc::Type* type, int pointer_level)
751 const simgrid::mc::RemoteClient& process = mc_model_checker->process();
756 int check_ignore = 0;
764 simgrid::mc::Type* new_type1 = nullptr;
765 simgrid::mc::Type* new_type2 = nullptr;
767 bool match_pairs = false;
769 // This is the address of std_heap->heapinfo in the application process:
770 void* heapinfo_address = &((xbt_mheap_t)process.heap_address)->heapinfo;
772 const malloc_info* heapinfos1 = snapshot1.read(remote((const malloc_info**)heapinfo_address));
773 const malloc_info* heapinfos2 = snapshot2.read(remote((const malloc_info**)heapinfo_address));
775 malloc_info heapinfo_temp1;
776 malloc_info heapinfo_temp2;
778 simgrid::mc::HeapLocationPairs current;
779 if (previous == nullptr) {
785 block1 = ((char*)area1 - (char*)state.std_heap_copy.heapbase) / BLOCKSIZE + 1;
786 block2 = ((char*)area2 - (char*)state.std_heap_copy.heapbase) / BLOCKSIZE + 1;
788 // If either block is a stack block:
789 if (is_block_stack((int) block1) && is_block_stack((int) block2)) {
790 previous->insert(HeapLocationPair{{HeapLocation(block1, -1), HeapLocation(block2, -1)}});
792 state.match_equals(previous);
796 // If either block is not in the expected area of memory:
797 if (((char*)area1 < (char*)state.std_heap_copy.heapbase) || (block1 > (ssize_t)state.processStates[0].heapsize) ||
798 (block1 < 1) || ((char*)area2 < (char*)state.std_heap_copy.heapbase) ||
799 (block2 > (ssize_t)state.processStates[1].heapsize) || (block2 < 1)) {
803 // Process address of the block:
804 void* real_addr_block1 = (ADDR2UINT(block1) - 1) * BLOCKSIZE + (char*)state.std_heap_copy.heapbase;
805 void* real_addr_block2 = (ADDR2UINT(block2) - 1) * BLOCKSIZE + (char*)state.std_heap_copy.heapbase;
809 type = type->full_type;
811 // This assume that for "boring" types (volatile ...) byte_size is absent:
812 while (type->byte_size == 0 && type->subtype != nullptr)
813 type = type->subtype;
816 if (type->type == DW_TAG_pointer_type ||
817 (type->type == DW_TAG_base_type && not type->name.empty() && type->name == "char"))
820 type_size = type->byte_size;
823 simgrid::mc::Region* heap_region1 = MC_get_heap_region(snapshot1);
824 simgrid::mc::Region* heap_region2 = MC_get_heap_region(snapshot2);
826 const malloc_info* heapinfo1 =
827 (const malloc_info*)heap_region1->read(&heapinfo_temp1, &heapinfos1[block1], sizeof(malloc_info));
828 const malloc_info* heapinfo2 =
829 (const malloc_info*)heap_region2->read(&heapinfo_temp2, &heapinfos2[block2], sizeof(malloc_info));
831 if ((heapinfo1->type == MMALLOC_TYPE_FREE || heapinfo1->type==MMALLOC_TYPE_HEAPINFO)
832 && (heapinfo2->type == MMALLOC_TYPE_FREE || heapinfo2->type ==MMALLOC_TYPE_HEAPINFO)) {
835 state.match_equals(previous);
839 if (heapinfo1->type == MMALLOC_TYPE_UNFRAGMENTED && heapinfo2->type == MMALLOC_TYPE_UNFRAGMENTED) {
842 // TODO, lookup variable type from block type as done for fragmented blocks
844 if (state.equals_to_<1>(block1, 0).valid_ && state.equals_to_<2>(block2, 0).valid_ &&
845 state.blocksEqual(block1, block2)) {
847 state.match_equals(previous);
851 if (type_size != -1 && type_size != (ssize_t)heapinfo1->busy_block.busy_size &&
852 type_size != (ssize_t)heapinfo2->busy_block.busy_size &&
853 (type->name.empty() || type->name == "struct s_smx_context")) {
855 state.match_equals(previous);
859 if (heapinfo1->busy_block.size != heapinfo2->busy_block.size ||
860 heapinfo1->busy_block.busy_size != heapinfo2->busy_block.busy_size)
863 if (not previous->insert(HeapLocationPair{{HeapLocation(block1, -1), HeapLocation(block2, -1)}}).second) {
865 state.match_equals(previous);
869 size = heapinfo1->busy_block.busy_size;
871 // Remember (basic) type inference.
872 // The current data structure only allows us to do this for the whole block.
873 if (type != nullptr && area1 == real_addr_block1)
874 state.types_<1>(block1, 0) = type;
875 if (type != nullptr && area2 == real_addr_block2)
876 state.types_<2>(block2, 0) = type;
880 state.match_equals(previous);
884 if (heapinfo1->busy_block.ignore > 0
885 && heapinfo2->busy_block.ignore == heapinfo1->busy_block.ignore)
886 check_ignore = heapinfo1->busy_block.ignore;
888 } else if ((heapinfo1->type > 0) && (heapinfo2->type > 0)) { /* Fragmented block */
890 ssize_t frag1 = ((uintptr_t)(ADDR2UINT(area1) % (BLOCKSIZE))) >> heapinfo1->type;
891 ssize_t frag2 = ((uintptr_t)(ADDR2UINT(area2) % (BLOCKSIZE))) >> heapinfo2->type;
893 // Process address of the fragment_:
894 void* real_addr_frag1 = (void*)((char*)real_addr_block1 + (frag1 << heapinfo1->type));
895 void* real_addr_frag2 = (void*)((char*)real_addr_block2 + (frag2 << heapinfo2->type));
897 // Check the size of the fragments against the size of the type:
898 if (type_size != -1) {
899 if (heapinfo1->busy_frag.frag_size[frag1] == -1 || heapinfo2->busy_frag.frag_size[frag2] == -1) {
901 state.match_equals(previous);
905 if (type_size != heapinfo1->busy_frag.frag_size[frag1]
906 || type_size != heapinfo2->busy_frag.frag_size[frag2]) {
908 state.match_equals(previous);
913 // Check if the blocks are already matched together:
914 if (state.equals_to_<1>(block1, frag1).valid_ && state.equals_to_<2>(block2, frag2).valid_ && offset1 == offset2 &&
915 state.fragmentsEqual(block1, frag1, block2, frag2)) {
917 state.match_equals(previous);
920 // Compare the size of both fragments:
921 if (heapinfo1->busy_frag.frag_size[frag1] != heapinfo2->busy_frag.frag_size[frag2]) {
922 if (type_size == -1) {
924 state.match_equals(previous);
930 // Size of the fragment_:
931 size = heapinfo1->busy_frag.frag_size[frag1];
933 // Remember (basic) type inference.
934 // The current data structure only allows us to do this for the whole fragment_.
935 if (type != nullptr && area1 == real_addr_frag1)
936 state.types_<1>(block1, frag1) = type;
937 if (type != nullptr && area2 == real_addr_frag2)
938 state.types_<2>(block2, frag2) = type;
940 // The type of the variable is already known:
942 new_type1 = new_type2 = type;
944 // Type inference from the block type.
945 else if (state.types_<1>(block1, frag1) != nullptr || state.types_<2>(block2, frag2) != nullptr) {
946 offset1 = (char*)area1 - (char*)real_addr_frag1;
947 offset2 = (char*)area2 - (char*)real_addr_frag2;
949 if (state.types_<1>(block1, frag1) != nullptr && state.types_<2>(block2, frag2) != nullptr) {
950 new_type1 = get_offset_type(real_addr_frag1, state.types_<1>(block1, frag1), offset1, size, snapshot1);
951 new_type2 = get_offset_type(real_addr_frag2, state.types_<2>(block2, frag2), offset1, size, snapshot2);
952 } else if (state.types_<1>(block1, frag1) != nullptr) {
953 new_type1 = get_offset_type(real_addr_frag1, state.types_<1>(block1, frag1), offset1, size, snapshot1);
954 new_type2 = get_offset_type(real_addr_frag2, state.types_<1>(block1, frag1), offset2, size, snapshot2);
955 } else if (state.types_<2>(block2, frag2) != nullptr) {
956 new_type1 = get_offset_type(real_addr_frag1, state.types_<2>(block2, frag2), offset1, size, snapshot1);
957 new_type2 = get_offset_type(real_addr_frag2, state.types_<2>(block2, frag2), offset2, size, snapshot2);
960 state.match_equals(previous);
964 if (new_type1 != nullptr && new_type2 != nullptr && new_type1 != new_type2) {
967 while (type->byte_size == 0 && type->subtype != nullptr)
968 type = type->subtype;
969 new_size1 = type->byte_size;
972 while (type->byte_size == 0 && type->subtype != nullptr)
973 type = type->subtype;
974 new_size2 = type->byte_size;
978 state.match_equals(previous);
983 if (new_size1 > 0 && new_size1 == new_size2) {
988 if (offset1 == 0 && offset2 == 0 &&
989 not previous->insert(HeapLocationPair{{HeapLocation(block1, frag1), HeapLocation(block2, frag2)}}).second) {
991 state.match_equals(previous);
997 state.match_equals(previous);
1001 if ((heapinfo1->busy_frag.ignore[frag1] > 0) &&
1002 (heapinfo2->busy_frag.ignore[frag2] == heapinfo1->busy_frag.ignore[frag1]))
1003 check_ignore = heapinfo1->busy_frag.ignore[frag1];
1008 /* Start comparison */
1010 type ? heap_area_differ_with_type(state, area1, area2, snapshot1, snapshot2, previous, type, size, check_ignore,
1012 : heap_area_differ_without_type(state, area1, area2, snapshot1, snapshot2, previous, size, check_ignore);
1017 state.match_equals(previous);
1024 /************************** Snapshot comparison *******************************/
1025 /******************************************************************************/
1027 static bool areas_differ_with_type(simgrid::mc::StateComparator& state, const void* real_area1,
1028 const simgrid::mc::Snapshot& snapshot1, simgrid::mc::Region* region1,
1029 const void* real_area2, const simgrid::mc::Snapshot& snapshot2,
1030 simgrid::mc::Region* region2, simgrid::mc::Type* type, int pointer_level)
1032 simgrid::mc::Type* subtype;
1033 simgrid::mc::Type* subsubtype;
1037 xbt_assert(type != nullptr);
1038 switch (type->type) {
1039 case DW_TAG_unspecified_type:
1042 case DW_TAG_base_type:
1043 case DW_TAG_enumeration_type:
1044 case DW_TAG_union_type:
1045 return MC_snapshot_region_memcmp(real_area1, region1, real_area2, region2, type->byte_size) != 0;
1046 case DW_TAG_typedef:
1047 case DW_TAG_volatile_type:
1048 case DW_TAG_const_type:
1049 return areas_differ_with_type(state, real_area1, snapshot1, region1, real_area2, snapshot2, region2,
1050 type->subtype, pointer_level);
1051 case DW_TAG_array_type:
1052 subtype = type->subtype;
1053 switch (subtype->type) {
1054 case DW_TAG_unspecified_type:
1057 case DW_TAG_base_type:
1058 case DW_TAG_enumeration_type:
1059 case DW_TAG_pointer_type:
1060 case DW_TAG_reference_type:
1061 case DW_TAG_rvalue_reference_type:
1062 case DW_TAG_structure_type:
1063 case DW_TAG_class_type:
1064 case DW_TAG_union_type:
1065 if (subtype->full_type)
1066 subtype = subtype->full_type;
1067 elm_size = subtype->byte_size;
1069 case DW_TAG_const_type:
1070 case DW_TAG_typedef:
1071 case DW_TAG_volatile_type:
1072 subsubtype = subtype->subtype;
1073 if (subsubtype->full_type)
1074 subsubtype = subsubtype->full_type;
1075 elm_size = subsubtype->byte_size;
1080 for (i = 0; i < type->element_count; i++) {
1081 size_t off = i * elm_size;
1082 if (areas_differ_with_type(state, (const char*)real_area1 + off, snapshot1, region1,
1083 (const char*)real_area2 + off, snapshot2, region2, type->subtype, pointer_level))
1087 case DW_TAG_pointer_type:
1088 case DW_TAG_reference_type:
1089 case DW_TAG_rvalue_reference_type: {
1090 const void* addr_pointed1 = MC_region_read_pointer(region1, real_area1);
1091 const void* addr_pointed2 = MC_region_read_pointer(region2, real_area2);
1093 if (type->subtype && type->subtype->type == DW_TAG_subroutine_type)
1094 return (addr_pointed1 != addr_pointed2);
1095 if (addr_pointed1 == nullptr && addr_pointed2 == nullptr)
1097 if (addr_pointed1 == nullptr || addr_pointed2 == nullptr)
1099 if (not state.compared_pointers.insert(std::make_pair(addr_pointed1, addr_pointed2)).second)
1104 // Some cases are not handled here:
1105 // * the pointers lead to different areas (one to the heap, the other to the RW segment ...)
1106 // * a pointer leads to the read-only segment of the current object
1107 // * a pointer lead to a different ELF object
1109 if (snapshot1.on_heap(addr_pointed1)) {
1110 if (not snapshot2.on_heap(addr_pointed2))
1112 // The pointers are both in the heap:
1113 return simgrid::mc::heap_area_differ(state, addr_pointed1, addr_pointed2, snapshot1, snapshot2, nullptr,
1114 type->subtype, pointer_level);
1116 } else if (region1->contain(simgrid::mc::remote(addr_pointed1))) {
1117 // The pointers are both in the current object R/W segment:
1118 if (not region2->contain(simgrid::mc::remote(addr_pointed2)))
1120 if (not type->type_id)
1121 return (addr_pointed1 != addr_pointed2);
1123 return areas_differ_with_type(state, addr_pointed1, snapshot1, region1, addr_pointed2, snapshot2, region2,
1124 type->subtype, pointer_level);
1126 // TODO, We do not handle very well the case where
1127 // it belongs to a different (non-heap) region from the current one.
1129 return (addr_pointed1 != addr_pointed2);
1132 case DW_TAG_structure_type:
1133 case DW_TAG_class_type:
1134 for (simgrid::mc::Member& member : type->members) {
1135 void* member1 = simgrid::dwarf::resolve_member(real_area1, type, &member, &snapshot1);
1136 void* member2 = simgrid::dwarf::resolve_member(real_area2, type, &member, &snapshot2);
1137 simgrid::mc::Region* subregion1 = snapshot1.get_region(member1, region1); // region1 is hinted
1138 simgrid::mc::Region* subregion2 = snapshot2.get_region(member2, region2); // region2 is hinted
1139 if (areas_differ_with_type(state, member1, snapshot1, subregion1, member2, snapshot2, subregion2, member.type,
1144 case DW_TAG_subroutine_type:
1147 XBT_VERB("Unknown case: %d", type->type);
1154 static bool global_variables_differ(simgrid::mc::StateComparator& state, simgrid::mc::ObjectInformation* object_info,
1155 simgrid::mc::Region* r1, simgrid::mc::Region* r2,
1156 const simgrid::mc::Snapshot& snapshot1, const simgrid::mc::Snapshot& snapshot2)
1158 xbt_assert(r1 && r2, "Missing region.");
1160 const std::vector<simgrid::mc::Variable>& variables = object_info->global_variables;
1162 for (simgrid::mc::Variable const& current_var : variables) {
1163 // If the variable is not in this object, skip it:
1164 // We do not expect to find a pointer to something which is not reachable
1165 // by the global variables.
1166 if ((char *) current_var.address < (char *) object_info->start_rw
1167 || (char *) current_var.address > (char *) object_info->end_rw)
1170 simgrid::mc::Type* bvariable_type = current_var.type;
1171 if (areas_differ_with_type(state, current_var.address, snapshot1, r1, current_var.address, snapshot2, r2,
1172 bvariable_type, 0)) {
1173 XBT_VERB("Global variable %s (%p) is different between snapshots", current_var.name.c_str(), current_var.address);
1181 static bool local_variables_differ(simgrid::mc::StateComparator& state, const simgrid::mc::Snapshot& snapshot1,
1182 const simgrid::mc::Snapshot& snapshot2, const_mc_snapshot_stack_t stack1,
1183 const_mc_snapshot_stack_t stack2)
1185 if (stack1->local_variables.size() != stack2->local_variables.size()) {
1186 XBT_VERB("Different number of local variables");
1190 for (unsigned int cursor = 0; cursor < stack1->local_variables.size(); cursor++) {
1191 const_local_variable_t current_var1 = &stack1->local_variables[cursor];
1192 const_local_variable_t current_var2 = &stack2->local_variables[cursor];
1193 if (current_var1->name != current_var2->name || current_var1->subprogram != current_var2->subprogram ||
1194 current_var1->ip != current_var2->ip) {
1195 // TODO, fix current_varX->subprogram->name to include name if DW_TAG_inlined_subprogram
1196 XBT_VERB("Different name of variable (%s - %s) or frame (%s - %s) or ip (%lu - %lu)", current_var1->name.c_str(),
1197 current_var2->name.c_str(), current_var1->subprogram->name.c_str(),
1198 current_var2->subprogram->name.c_str(), current_var1->ip, current_var2->ip);
1202 if (areas_differ_with_type(state, current_var1->address, snapshot1, snapshot1.get_region(current_var1->address),
1203 current_var2->address, snapshot2, snapshot2.get_region(current_var2->address),
1204 current_var1->type, 0)) {
1205 XBT_VERB("Local variable %s (%p - %p) in frame %s is different between snapshots", current_var1->name.c_str(),
1206 current_var1->address, current_var2->address, current_var1->subprogram->name.c_str());
1216 bool snapshot_equal(const Snapshot* s1, const Snapshot* s2)
1218 // TODO, make this a field of ModelChecker or something similar
1219 static StateComparator state_comparator;
1221 const RemoteClient& process = mc_model_checker->process();
1223 if (s1->hash_ != s2->hash_) {
1224 XBT_VERB("(%d - %d) Different hash: 0x%" PRIx64 "--0x%" PRIx64, s1->num_state_, s2->num_state_, s1->hash_,
1228 XBT_VERB("(%d - %d) Same hash: 0x%" PRIx64, s1->num_state_, s2->num_state_, s1->hash_);
1230 /* Compare enabled processes */
1231 if (s1->enabled_processes_ != s2->enabled_processes_) {
1232 XBT_VERB("(%d - %d) Different amount of enabled processes", s1->num_state_, s2->num_state_);
1236 /* Compare size of stacks */
1237 for (unsigned long i = 0; i < s1->stacks_.size(); i++) {
1238 size_t size_used1 = s1->stack_sizes_[i];
1239 size_t size_used2 = s2->stack_sizes_[i];
1240 if (size_used1 != size_used2) {
1241 XBT_VERB("(%d - %d) Different size used in stacks: %zu - %zu", s1->num_state_, s2->num_state_, size_used1,
1247 /* Init heap information used in heap comparison algorithm */
1249 static_cast<xbt_mheap_t>(s1->read_bytes(alloca(sizeof(struct mdesc)), sizeof(struct mdesc),
1250 remote(process.heap_address), simgrid::mc::ReadOptions::lazy()));
1252 static_cast<xbt_mheap_t>(s2->read_bytes(alloca(sizeof(struct mdesc)), sizeof(struct mdesc),
1253 remote(process.heap_address), simgrid::mc::ReadOptions::lazy()));
1254 if (state_comparator.initHeapInformation(heap1, heap2, s1->to_ignore_, s2->to_ignore_) == -1) {
1255 XBT_VERB("(%d - %d) Different heap information", s1->num_state_, s2->num_state_);
1259 /* Stacks comparison */
1260 for (unsigned int cursor = 0; cursor < s1->stacks_.size(); cursor++) {
1261 const_mc_snapshot_stack_t stack1 = &s1->stacks_[cursor];
1262 const_mc_snapshot_stack_t stack2 = &s2->stacks_[cursor];
1264 if (local_variables_differ(state_comparator, *s1, *s2, stack1, stack2)) {
1265 XBT_VERB("(%d - %d) Different local variables between stacks %u", s1->num_state_, s2->num_state_, cursor + 1);
1270 size_t regions_count = s1->snapshot_regions_.size();
1271 if (regions_count != s2->snapshot_regions_.size())
1274 for (size_t k = 0; k != regions_count; ++k) {
1275 Region* region1 = s1->snapshot_regions_[k].get();
1276 Region* region2 = s2->snapshot_regions_[k].get();
1279 if (region1->region_type() != RegionType::Data)
1282 xbt_assert(region1->region_type() == region2->region_type());
1283 xbt_assert(region1->object_info() == region2->object_info());
1284 xbt_assert(region1->object_info());
1286 /* Compare global variables */
1287 if (global_variables_differ(state_comparator, region1->object_info(), region1, region2, *s1, *s2)) {
1288 std::string const& name = region1->object_info()->file_name;
1289 XBT_VERB("(%d - %d) Different global variables in %s", s1->num_state_, s2->num_state_, name.c_str());
1295 if (mmalloc_heap_differ(state_comparator, *s1, *s2)) {
1296 XBT_VERB("(%d - %d) Different heap (mmalloc_compare)", s1->num_state_, s2->num_state_);
1300 XBT_VERB("(%d - %d) No difference found", s1->num_state_, s2->num_state_);