1 /* Copyright (c) 2015-2023. 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 #ifndef SIMGRID_MC_TRANSITION_HPP
7 #define SIMGRID_MC_TRANSITION_HPP
9 #include "simgrid/forward.h" // aid_t
11 #include "xbt/utility.hpp" // XBT_DECLARE_ENUM_CLASS
16 namespace simgrid::mc {
18 /** An element in the recorded path
20 * At each decision point, we need to record which process transition
21 * is triggered and potentially which value is associated with this
22 * transition. The value is used to find which communication is triggered
23 * in things like waitany and for associating a given value of MC_random()
27 /* Global statistics */
28 static unsigned long executed_transitions_;
29 static unsigned long replayed_transitions_;
31 friend State; // FIXME remove this once we have a proper class to handle the statistics
34 /* Ordering is important here. depends() implementations only consider subsequent types in this ordering */
35 XBT_DECLARE_ENUM_CLASS(Type,
36 /* First because indep with anybody including themselves */
37 RANDOM, ACTOR_JOIN, ACTOR_SLEEP,
38 /* high priority because indep with almost everybody */
40 /* high priority because they can rewrite themselves to *_WAIT */
42 /* BARRIER transitions sorted alphabetically */
43 BARRIER_ASYNC_LOCK, BARRIER_WAIT,
44 /* Alphabetical ordering of COMM_* */
45 COMM_ASYNC_RECV, COMM_ASYNC_SEND, COMM_TEST, COMM_WAIT,
47 MUTEX_ASYNC_LOCK, MUTEX_TEST, MUTEX_TRYLOCK, MUTEX_UNLOCK, MUTEX_WAIT,
48 /* alphabetical ordering of SEM transitions */
49 SEM_ASYNC_LOCK, SEM_UNLOCK, SEM_WAIT,
50 /* UNKNOWN must be last */
52 Type type_ = Type::UNKNOWN;
56 /** The user function call that caused this transition to exist. Format: >>filename:line:function()<< */
57 std::string call_location_ = "";
59 /* Which transition was executed for this simcall
61 * Some simcalls can lead to different transitions:
63 * * waitany/testany can trigger on different messages;
65 * * random can produce different values.
67 int times_considered_ = 0;
69 Transition() = default;
70 Transition(Type type, aid_t issuer, int times_considered)
71 : type_(type), aid_(issuer), times_considered_(times_considered)
74 virtual ~Transition();
76 /** Returns a textual representation of the transition. Pointer adresses are omitted if verbose=false */
77 virtual std::string to_string(bool verbose = false) const;
78 /** Returns something like >>label = "desc", color = c<< to describe the transition in dot format */
79 virtual std::string dot_string() const;
81 std::string const& get_call_location() const { return call_location_; }
83 /* Moves the application toward a path that was already explored, but don't change the current transition */
84 void replay(RemoteApp& app) const;
86 virtual bool depends(const Transition* other) const { return true; }
89 The reversible race detector should only be used if we already have the assumption
90 this <* other (see Source set: a foundation for ODPOR). In particular this means that :
92 - proc(this) != proc(other)
93 - there is no event e s.t. this --> e --> other
95 @note: It is safe to assume that there is indeed a race between the two events in the execution;
96 indeed, the question the method answers is only sensible in the context of a race
98 virtual bool reversible_race(const Transition* other) const
100 xbt_die("%s unimplemented for %s", __func__, to_c_str(type_));
103 /* Returns the total amount of transitions executed so far (for statistics) */
104 static unsigned long get_executed_transitions() { return executed_transitions_; }
105 /* Returns the total amount of transitions replayed so far while backtracing (for statistics) */
106 static unsigned long get_replayed_transitions() { return replayed_transitions_; }
109 /** Make a new transition from serialized description */
110 Transition* deserialize_transition(aid_t issuer, int times_considered, std::stringstream& stream);
112 } // namespace simgrid::mc