X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/2659419ab673729eb0af805fff60051764b30b04..7436a08438b3bdcccbd3229922a02d641903b682:/src/mc/VisitedState.cpp diff --git a/src/mc/VisitedState.cpp b/src/mc/VisitedState.cpp index 3745922d72..68b1990b15 100644 --- a/src/mc/VisitedState.cpp +++ b/src/mc/VisitedState.cpp @@ -1,5 +1,4 @@ -/* Copyright (c) 2011-2015. The SimGrid Team. - * All rights reserved. */ +/* Copyright (c) 2011-2017. The SimGrid Team. All rights reserved. */ /* This program is free software; you can redistribute it and/or modify it * under the terms of the license (GNU LGPL) which comes with this package. */ @@ -8,13 +7,11 @@ #include #include -#include + +#include #include #include -#include -#include -#include #include "src/mc/mc_comm_pattern.h" #include "src/mc/mc_safety.h" @@ -23,75 +20,67 @@ #include "src/mc/mc_smx.h" #include "src/mc/VisitedState.hpp" -XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_VisitedState, mc, - "Logging specific to state equaity detection mechanisms"); +XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_VisitedState, mc, "Logging specific to state equality detection mechanisms"); namespace simgrid { namespace mc { -std::vector> visited_states; +static int snapshot_compare(simgrid::mc::VisitedState* state1, simgrid::mc::VisitedState* state2) +{ + simgrid::mc::Snapshot* s1 = state1->system_state.get(); + simgrid::mc::Snapshot* s2 = state2->system_state.get(); + int num1 = state1->num; + int num2 = state2->num; + return snapshot_compare(num1, s1, num2, s2); +} -/** - * \brief Save the current state - * \return Snapshot of the current state. - */ -VisitedState::VisitedState() +/** @brief Save the current state */ +VisitedState::VisitedState(unsigned long state_number) { simgrid::mc::Process* process = &(mc_model_checker->process()); this->heap_bytes_used = mmalloc_get_bytes_used_remote( process->get_heap()->heaplimit, process->get_malloc_info()); - this->nb_processes = - mc_model_checker->process().simix_processes().size(); + this->actors_count = mc_model_checker->process().actors().size(); - this->system_state = simgrid::mc::take_snapshot(mc_stats->expanded_states); - this->num = mc_stats->expanded_states; - this->other_num = -1; + this->system_state = simgrid::mc::take_snapshot(state_number); + this->num = state_number; + this->original_num = -1; } VisitedState::~VisitedState() { } -static void prune_visited_states() +void VisitedStates::prune() { - while (visited_states.size() > (std::size_t) _sg_mc_visited) { + while (states_.size() > (std::size_t)_sg_mc_max_visited_states) { XBT_DEBUG("Try to remove visited state (maximum number of stored states reached)"); - auto min_element = std::min_element(visited_states.begin(), visited_states.end(), + auto min_element = boost::range::min_element(states_, [](std::unique_ptr& a, std::unique_ptr& b) { return a->num < b->num; }); - xbt_assert(min_element != visited_states.end()); + xbt_assert(min_element != states_.end()); // and drop it: - visited_states.erase(min_element); + states_.erase(min_element); XBT_DEBUG("Remove visited state (maximum number of stored states reached)"); } } -static int snapshot_compare(simgrid::mc::VisitedState* state1, simgrid::mc::VisitedState* state2) -{ - simgrid::mc::Snapshot* s1 = state1->system_state.get(); - simgrid::mc::Snapshot* s2 = state2->system_state.get(); - int num1 = state1->num; - int num2 = state2->num; - return snapshot_compare(num1, s1, num2, s2); -} - -/** - * \brief Checks whether a given state has already been visited by the algorithm. +/** \brief Checks whether a given state has already been visited by the algorithm. */ -std::unique_ptr is_visited_state(simgrid::mc::State* graph_state, bool compare_snpashots) +std::unique_ptr VisitedStates::addVisitedState( + unsigned long state_number, simgrid::mc::State* graph_state, bool compare_snpashots) { std::unique_ptr new_state = - std::unique_ptr(new VisitedState()); + std::unique_ptr(new VisitedState(state_number)); graph_state->system_state = new_state->system_state; - graph_state->in_visited_states = 1; XBT_DEBUG("Snapshot %p of visited state %d (exploration stack state %d)", new_state->system_state.get(), new_state->num, graph_state->num); - auto range = std::equal_range(visited_states.begin(), visited_states.end(), - new_state.get(), simgrid::mc::DerefAndCompareByNbProcessesAndUsedHeap()); + auto range = + boost::range::equal_range(states_, new_state.get(), simgrid::mc::DerefAndCompareByActorsCountAndUsedHeap()); if (compare_snpashots) for (auto i = range.first; i != range.second; ++i) { @@ -102,18 +91,17 @@ std::unique_ptr is_visited_state(simgrid::mc::State* std::unique_ptr old_state = std::move(visited_state); - if (old_state->other_num == -1) - new_state->other_num = old_state->num; - else - new_state->other_num = old_state->other_num; + if (old_state->original_num == -1) // I'm the copy of an original process + new_state->original_num = old_state->num; + else // I'm the copy of a copy + new_state->original_num = old_state->original_num; if (dot_output == nullptr) XBT_DEBUG("State %d already visited ! (equal to state %d)", - new_state->num, old_state->num); + new_state->num, old_state->num); else - XBT_DEBUG( - "State %d already visited ! (equal to state %d (state %d in dot_output))", - new_state->num, old_state->num, new_state->other_num); + XBT_DEBUG("State %d already visited ! (equal to state %d (state %d in dot_output))", + new_state->num, old_state->num, new_state->original_num); /* Replace the old state with the new one (with a bigger num) (when the max number of visited states is reached, the oldest @@ -122,15 +110,15 @@ std::unique_ptr is_visited_state(simgrid::mc::State* old_state->num, new_state->num); visited_state = std::move(new_state); - return std::move(old_state); + return old_state; } } - XBT_DEBUG("Insert new visited state %d (total : %lu)", new_state->num, (unsigned long) visited_states.size()); - visited_states.insert(range.first, std::move(new_state)); - prune_visited_states(); + XBT_DEBUG("Insert new visited state %d (total : %lu)", new_state->num, (unsigned long) states_.size()); + states_.insert(range.first, std::move(new_state)); + this->prune(); return nullptr; } } -} \ No newline at end of file +}