1 /* Copyright (c) 2008-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 #include "src/mc/explo/udpor/EventSet.hpp"
7 #include "src/mc/explo/udpor/Configuration.hpp"
8 #include "src/mc/explo/udpor/History.hpp"
9 #include "src/mc/explo/udpor/UnfoldingEvent.hpp"
10 #include "src/xbt/utils/iter/variable_for_loop.hpp"
15 namespace simgrid::mc::udpor {
17 EventSet::EventSet(Configuration&& config) : EventSet(config.get_events()) {}
19 void EventSet::remove(const UnfoldingEvent* e)
21 this->events_.erase(e);
24 void EventSet::subtract(const EventSet& other)
26 this->events_ = std::move(subtracting(other).events_);
29 void EventSet::subtract(const Configuration& config)
31 subtract(config.get_events());
34 EventSet EventSet::subtracting(const EventSet& other) const
36 std::unordered_set<const UnfoldingEvent*> result = this->events_;
38 for (const UnfoldingEvent* e : other.events_)
41 return EventSet(std::move(result));
44 EventSet EventSet::subtracting(const Configuration& config) const
46 return subtracting(config.get_events());
49 EventSet EventSet::subtracting(const UnfoldingEvent* e) const
51 auto result = this->events_;
53 return EventSet(std::move(result));
56 void EventSet::insert(const UnfoldingEvent* e)
58 this->events_.insert(e);
61 void EventSet::form_union(const EventSet& other)
63 this->events_ = std::move(make_union(other).events_);
66 void EventSet::form_union(const Configuration& config)
68 form_union(config.get_events());
71 EventSet EventSet::make_union(const UnfoldingEvent* e) const
73 auto result = this->events_;
75 return EventSet(std::move(result));
78 EventSet EventSet::make_union(const EventSet& other) const
80 std::unordered_set<const UnfoldingEvent*> result = this->events_;
82 for (const UnfoldingEvent* e : other.events_)
85 return EventSet(std::move(result));
88 EventSet EventSet::make_union(const Configuration& config) const
90 return make_union(config.get_events());
93 size_t EventSet::size() const
95 return this->events_.size();
98 bool EventSet::empty() const
100 return this->events_.empty();
103 bool EventSet::contains(const UnfoldingEvent* e) const
105 return this->events_.find(e) != this->events_.end();
108 bool EventSet::is_subset_of(const EventSet& other) const
110 // If there is some element not contained in `other`, then
111 // the set difference will contain that element and the
112 // result won't be empty
113 return subtracting(other).empty();
116 bool EventSet::is_valid_configuration() const
118 /// @invariant: A collection of events `E` is a configuration
119 /// if and only if following while following the history of
120 /// each event `e` of `E` you remain in `E`. In other words, you
121 /// only see events from set `E`
123 /// The simple proof is based on the definition of a configuration
124 /// which requires that all events have their history contained
126 const History history(*this);
127 return this->contains(history);
130 bool EventSet::contains(const History& history) const
132 return std::all_of(history.begin(), history.end(), [=](const UnfoldingEvent* e) { return this->contains(e); });
135 bool EventSet::is_maximal() const
137 // A set of events is maximal if no event from
138 // the original set is ruled out when traversing
139 // the history of the events
140 const History history(*this);
141 return *this == history.get_all_maximal_events();
144 bool EventSet::is_conflict_free() const
146 const auto begin = simgrid::xbt::variable_for_loop<const EventSet>{{*this}, {*this}};
147 const auto end = simgrid::xbt::variable_for_loop<const EventSet>();
148 return std::none_of(begin, end, [=](const auto event_pair) {
149 const UnfoldingEvent* e1 = *event_pair[0];
150 const UnfoldingEvent* e2 = *event_pair[1];
151 return e1->conflicts_with(e2);
155 std::vector<const UnfoldingEvent*> EventSet::get_topological_ordering() const
157 // This is essentially an implementation of detecting cycles
158 // in a graph with coloring, except it makes a topological
159 // ordering out of it
161 return std::vector<const UnfoldingEvent*>();
164 std::stack<const UnfoldingEvent*> event_stack;
165 std::vector<const UnfoldingEvent*> topological_ordering;
166 EventSet unknown_events = *this;
167 EventSet temporarily_marked_events;
168 EventSet permanently_marked_events;
170 while (not unknown_events.empty()) {
171 EventSet discovered_events;
172 event_stack.push(*unknown_events.begin());
174 while (not event_stack.empty()) {
175 const UnfoldingEvent* evt = event_stack.top();
176 discovered_events.insert(evt);
178 if (not temporarily_marked_events.contains(evt)) {
179 // If this event hasn't yet been marked, do
180 // so now so that if we both see it
181 // again in a child we can detect a cycle
182 temporarily_marked_events.insert(evt);
184 EventSet immediate_causes = evt->get_immediate_causes();
185 if (!immediate_causes.empty() && immediate_causes.is_subset_of(temporarily_marked_events)) {
186 throw std::invalid_argument("Attempted to perform a topological sort on a configuration "
187 "whose contents contain a cycle. The configuration (and the graph "
188 "connecting all of the events) is an invalid event structure");
190 immediate_causes.subtract(discovered_events);
191 immediate_causes.subtract(permanently_marked_events);
192 std::for_each(immediate_causes.begin(), immediate_causes.end(),
193 [&event_stack](const UnfoldingEvent* cause) { event_stack.push(cause); });
195 unknown_events.remove(evt);
196 temporarily_marked_events.remove(evt);
197 permanently_marked_events.insert(evt);
199 // In moving this event to the end of the list,
200 // we are saying this events "happens before" other
201 // events that are added later.
202 if (this->contains(evt)) {
203 topological_ordering.push_back(evt);
206 // Only now do we remove the event, i.e. once
207 // we've processed the same event twice
212 return topological_ordering;
215 std::vector<const UnfoldingEvent*> EventSet::get_topological_ordering_of_reverse_graph() const
217 // The implementation exploits the property that
218 // a topological sorting S^R of the reverse graph G^R
219 // of some graph G is simply the reverse of any
220 // topological sorting S of G.
221 auto topological_events = get_topological_ordering();
222 std::reverse(topological_events.begin(), topological_events.end());
223 return topological_events;
226 std::vector<const UnfoldingEvent*> EventSet::move_into_vector() const&&
228 std::vector<const UnfoldingEvent*> contents;
229 contents.reserve(size());
231 for (auto&& event : *this) {
232 contents.push_back(event);
238 } // namespace simgrid::mc::udpor