1 /* Copyright (c) 2011-2015. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
13 #include <xbt/automaton.h>
15 #include <xbt/sysdep.h>
16 #include <xbt/dynar.h>
17 #include <xbt/dynar.hpp>
20 #include "src/mc/mc_comm_pattern.h"
21 #include "src/mc/mc_safety.h"
22 #include "src/mc/LivenessChecker.hpp"
23 #include "src/mc/mc_private.h"
24 #include "src/mc/Process.hpp"
25 #include "src/mc/mc_smx.h"
27 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_visited, mc,
28 "Logging specific to state equaity detection mechanisms");
33 std::vector<std::unique_ptr<simgrid::mc::VisitedState>> visited_states;
36 * \brief Save the current state
37 * \return Snapshot of the current state.
39 VisitedState::VisitedState()
41 simgrid::mc::Process* process = &(mc_model_checker->process());
42 this->heap_bytes_used = mmalloc_get_bytes_used_remote(
43 process->get_heap()->heaplimit,
44 process->get_malloc_info());
47 mc_model_checker->process().simix_processes().size();
49 this->system_state = simgrid::mc::take_snapshot(mc_stats->expanded_states);
50 this->num = mc_stats->expanded_states;
54 VisitedState::~VisitedState()
58 static void prune_visited_states()
60 while (visited_states.size() > (std::size_t) _sg_mc_visited) {
61 XBT_DEBUG("Try to remove visited state (maximum number of stored states reached)");
62 auto min_element = std::min_element(visited_states.begin(), visited_states.end(),
63 [](std::unique_ptr<simgrid::mc::VisitedState>& a, std::unique_ptr<simgrid::mc::VisitedState>& b) {
64 return a->num < b->num;
66 xbt_assert(min_element != visited_states.end());
68 visited_states.erase(min_element);
69 XBT_DEBUG("Remove visited state (maximum number of stored states reached)");
73 static int snapshot_compare(simgrid::mc::VisitedState* state1, simgrid::mc::VisitedState* state2)
75 simgrid::mc::Snapshot* s1 = state1->system_state.get();
76 simgrid::mc::Snapshot* s2 = state2->system_state.get();
77 int num1 = state1->num;
78 int num2 = state2->num;
79 return snapshot_compare(num1, s1, num2, s2);
83 * \brief Checks whether a given state has already been visited by the algorithm.
85 std::unique_ptr<simgrid::mc::VisitedState> is_visited_state(simgrid::mc::State* graph_state, bool compare_snpashots)
89 std::unique_ptr<simgrid::mc::VisitedState> new_state =
90 std::unique_ptr<simgrid::mc::VisitedState>(new VisitedState());
91 graph_state->system_state = new_state->system_state;
92 graph_state->in_visited_states = 1;
93 XBT_DEBUG("Snapshot %p of visited state %d (exploration stack state %d)", new_state->system_state, new_state->num, graph_state->num);
95 auto range = std::equal_range(visited_states.begin(), visited_states.end(),
96 new_state.get(), simgrid::mc::DerefAndCompareByNbProcessesAndUsedHeap());
98 if (compare_snpashots) {
100 for (auto i = range.first; i != range.second; ++i) {
101 auto& visited_state = *i;
102 if (snapshot_compare(visited_state.get(), new_state.get()) == 0) {
103 // The state has been visited:
105 std::unique_ptr<simgrid::mc::VisitedState> old_state =
106 std::move(visited_state);
108 if (old_state->other_num == -1)
109 new_state->other_num = old_state->num;
111 new_state->other_num = old_state->other_num;
113 if (dot_output == nullptr)
114 XBT_DEBUG("State %d already visited ! (equal to state %d)",
115 new_state->num, old_state->num);
118 "State %d already visited ! (equal to state %d (state %d in dot_output))",
119 new_state->num, old_state->num, new_state->other_num);
121 /* Replace the old state with the new one (with a bigger num)
122 (when the max number of visited states is reached, the oldest
123 one is removed according to its number (= with the min number) */
124 XBT_DEBUG("Replace visited state %d with the new visited state %d",
125 old_state->num, new_state->num);
127 visited_state = std::move(new_state);
128 return std::move(old_state);
133 XBT_DEBUG("Insert new visited state %d (total : %lu)", new_state->num, (unsigned long) visited_states.size());
134 visited_states.insert(range.first, std::move(new_state));
135 prune_visited_states();