* @param value is the value to backtrack to.
* @return True if the future value was successully added; false otherwise
*/
-bool Node::add_future_value(struct future_value& fv)
+bool Node::add_future_value(struct future_value fv)
{
uint64_t value = fv.value;
modelclock_t expiration = fv.expiration;
return int_to_id(i);
}
+void Node::clear_backtracking()
+{
+ for (unsigned int i = 0; i < backtrack.size(); i++)
+ backtrack[i] = false;
+ for (unsigned int i = 0; i < explored_children.size(); i++)
+ explored_children[i] = false;
+}
+
bool Node::is_enabled(Thread *t) const
{
int thread_id = id_to_int(t->get_id());
if (model->params.fairwindow != 0 && head_idx > (int)model->params.fairwindow)
prevfairness = node_list[head_idx - model->params.fairwindow];
}
- node_list.push_back(new Node(act, head, model->get_num_threads(), prevfairness));
+
+ int next_threads = model->get_num_threads();
+ if (act->get_type() == THREAD_CREATE)
+ next_threads++;
+ node_list.push_back(new Node(act, head, next_threads, prevfairness));
total_nodes++;
head_idx++;
return NULL;
for (unsigned int i = it; i < node_list.size(); i++)
delete node_list[i];
node_list.resize(it);
+ node_list.back()->clear_backtracking();
}
Node * NodeStack::get_head() const