7 * @brief Node constructor
9 * Constructs a single Node for use in a NodeStack. Each Node is associated
10 * with exactly one ModelAction (exception: the first Node should be created
11 * as an empty stub, to represent the first thread "choice") and up to one
14 * @param act The ModelAction to associate with this Node. May be NULL.
15 * @param par The parent Node in the NodeStack. May be NULL if there is no
17 * @param nthreads The number of threads which exist at this point in the
20 Node::Node(ModelAction *act, Node *par, int nthreads)
23 num_threads(nthreads),
24 explored_children(num_threads),
25 backtrack(num_threads),
36 /** @brief Node desctructor */
43 /** Prints debugging info for the ModelAction associated with this Node */
49 printf("******** empty action ********\n");
52 /** @brief Prints info about may_read_from set */
53 void Node::print_may_read_from()
55 readfrom_set_t::iterator it;
56 for (it = may_read_from.begin(); it != may_read_from.end(); it++)
60 void Node::set_promise(uint32_t i) {
61 if (i>=promises.size())
62 promises.resize(i+1,0);
66 bool Node::get_promise(uint32_t i) {
67 return (promises[i]==2);
70 bool Node::increment_promises() {
71 for (unsigned int i=0;i<promises.size();i++) {
85 bool Node::promises_empty() {
86 for (unsigned int i=0;i<promises.size();i++)
93 * Adds a value from a weakly ordered future write to backtrack to.
94 * @param value is the value to backtrack to.
97 bool Node::add_future_value(uint64_t value) {
98 for(unsigned int i=0;i<future_values.size();i++)
99 if (future_values[i]==value)
102 future_values.push_back(value);
107 * Checks whether the future_values set for this node is empty.
108 * @return true if the future_values set is empty.
111 bool Node::futurevalues_empty() {
112 return ((future_index+1)>=future_values.size());
117 * Checks if the Thread associated with this thread ID has been explored from
119 * @param tid is the thread ID to check
120 * @return true if this thread choice has been explored already, false
123 bool Node::has_been_explored(thread_id_t tid)
125 int id = id_to_int(tid);
126 return explored_children[id];
130 * Checks if the backtracking set is empty.
131 * @return true if the backtracking set is empty
133 bool Node::backtrack_empty()
135 return (numBacktracks == 0);
140 * Checks whether the readsfrom set for this node is empty.
141 * @return true if the readsfrom set is empty.
143 bool Node::readsfrom_empty() {
144 return ((read_from_index+1)>=may_read_from.size());
150 * Mark the appropriate backtracking information for exploring a thread choice.
151 * @param act The ModelAction to explore
153 void Node::explore_child(ModelAction *act)
155 explore(act->get_tid());
159 * Records a backtracking reference for a thread choice within this Node.
160 * Provides feedback as to whether this thread choice is already set for
162 * @return false if the thread was already set to be backtracked, true
165 bool Node::set_backtrack(thread_id_t id)
167 int i = id_to_int(id);
175 thread_id_t Node::get_next_backtrack()
177 /** @todo Find next backtrack */
179 for (i = 0; i < backtrack.size(); i++)
180 if (backtrack[i] == true)
182 /* Backtrack set was empty? */
183 ASSERT(i != backtrack.size());
185 backtrack[i] = false;
190 bool Node::is_enabled(Thread *t)
192 return id_to_int(t->get_id()) < num_threads;
196 * Add an action to the may_read_from set.
197 * @param act is the action to add
199 void Node::add_read_from(const ModelAction *act)
201 may_read_from.push_back(act);
205 * Gets the next 'future_value' value from this Node. Only valid for a node
206 * where this->action is a 'read'.
207 * @return The first element in future_values
210 uint64_t Node::get_future_value() {
211 ASSERT(future_index<future_values.size());
212 return future_values[future_index];
216 * Gets the next 'may_read_from' action from this Node. Only valid for a node
217 * where this->action is a 'read'.
218 * @todo Perform reads_from backtracking/replay properly, so that this function
219 * may remove elements from may_read_from
220 * @return The first element in may_read_from
222 const ModelAction * Node::get_read_from() {
223 if (read_from_index<may_read_from.size())
224 return may_read_from[read_from_index];
230 * Increments the index into the readsfrom set to explore the next item.
231 * @return Returns false if we have explored all items.
233 bool Node::increment_read_from() {
235 return (read_from_index<may_read_from.size());
239 * Increments the index into the future_values set to explore the next item.
240 * @return Returns false if we have explored all values.
243 bool Node::increment_future_values() {
245 return (future_index<future_values.size());
248 void Node::explore(thread_id_t tid)
250 int i = id_to_int(tid);
252 backtrack[i] = false;
255 explored_children[i] = true;
258 static void clear_node_list(node_list_t *list, node_list_t::iterator start,
259 node_list_t::iterator end)
261 node_list_t::iterator it;
263 for (it = start; it != end; it++)
265 list->erase(start, end);
268 NodeStack::NodeStack()
271 node_list.push_back(new Node());
273 iter = node_list.begin();
276 NodeStack::~NodeStack()
278 clear_node_list(&node_list, node_list.begin(), node_list.end());
281 void NodeStack::print()
283 node_list_t::iterator it;
284 printf("............................................\n");
285 printf("NodeStack printing node_list:\n");
286 for (it = node_list.begin(); it != node_list.end(); it++) {
287 if (it == this->iter)
288 printf("vvv following action is the current iterator vvv\n");
291 printf("............................................\n");
294 ModelAction * NodeStack::explore_action(ModelAction *act)
298 ASSERT(!node_list.empty());
299 node_list_t::iterator it=iter;
302 if (it != node_list.end()) {
304 return (*iter)->get_action();
308 get_head()->explore_child(act);
309 node_list.push_back(new Node(act, get_head(), model->get_num_threads()));
316 * Empties the stack of all trailing nodes after a given position and calls the
317 * destructor for each. This function is provided an offset which determines
318 * how many nodes (relative to the current replay state) to save before popping
320 * @param numAhead gives the number of Nodes (including this Node) to skip over
321 * before removing nodes.
323 void NodeStack::pop_restofstack(int numAhead)
325 /* Diverging from previous execution; clear out remainder of list */
326 node_list_t::iterator it = iter;
329 clear_node_list(&node_list, it, node_list.end());
332 Node * NodeStack::get_head()
334 if (node_list.empty())
339 Node * NodeStack::get_next()
341 node_list_t::iterator it = iter;
342 if (node_list.empty()) {
347 if (it == node_list.end()) {
354 void NodeStack::reset_execution()
356 iter = node_list.begin();