+#define __STDC_FORMAT_MACROS
+#include <inttypes.h>
+
#include <string.h>
#include "nodestack.h"
misc_index(0),
misc_max(0)
{
- if (act) {
- act->set_node(this);
- int currtid = id_to_int(act->get_tid());
- int prevtid = (prevfairness != NULL) ? id_to_int(prevfairness->action->get_tid()) : 0;
-
- if (model->params.fairwindow != 0) {
- for (int i = 0; i < nthreads; i++) {
- ASSERT(i < ((int)fairness.size()));
- struct fairness_info *fi = &fairness[i];
- struct fairness_info *prevfi = (par != NULL) && (i < par->get_num_threads()) ? &par->fairness[i] : NULL;
- if (prevfi) {
- *fi = *prevfi;
- }
- if (parent->is_enabled(int_to_id(i))) {
- fi->enabled_count++;
- }
- if (i == currtid) {
- fi->turns++;
- fi->priority = false;
- }
- /* Do window processing */
- if (prevfairness != NULL) {
- if (prevfairness->parent->is_enabled(int_to_id(i)))
- fi->enabled_count--;
- if (i == prevtid) {
- fi->turns--;
- }
- /* Need full window to start evaluating
- * conditions
- * If we meet the enabled count and
- * have no turns, give us priority */
- if ((fi->enabled_count >= model->params.enabledcount) &&
- (fi->turns == 0))
- fi->priority = true;
+ ASSERT(act);
+ act->set_node(this);
+ int currtid = id_to_int(act->get_tid());
+ int prevtid = prevfairness ? id_to_int(prevfairness->action->get_tid()) : 0;
+
+ if (model->params.fairwindow != 0) {
+ for (int i = 0; i < num_threads; i++) {
+ ASSERT(i < ((int)fairness.size()));
+ struct fairness_info *fi = &fairness[i];
+ struct fairness_info *prevfi = (parent && i < parent->get_num_threads()) ? &parent->fairness[i] : NULL;
+ if (prevfi) {
+ *fi = *prevfi;
+ }
+ if (parent && parent->is_enabled(int_to_id(i))) {
+ fi->enabled_count++;
+ }
+ if (i == currtid) {
+ fi->turns++;
+ fi->priority = false;
+ }
+ /* Do window processing */
+ if (prevfairness != NULL) {
+ if (prevfairness->parent->is_enabled(int_to_id(i)))
+ fi->enabled_count--;
+ if (i == prevtid) {
+ fi->turns--;
}
+ /* Need full window to start evaluating
+ * conditions
+ * If we meet the enabled count and have no
+ * turns, give us priority */
+ if ((fi->enabled_count >= model->params.enabledcount) &&
+ (fi->turns == 0))
+ fi->priority = true;
}
}
}
/** @brief Node desctructor */
Node::~Node()
{
- if (action)
- delete action;
+ delete action;
if (enabled_array)
model_free(enabled_array);
}
/** Prints debugging info for the ModelAction associated with this Node */
void Node::print()
{
- if (action)
- action->print();
- else
- model_print("******** empty action ********\n");
+ action->print();
+ model_print(" backtrack: %s", backtrack_empty() ? "empty" : "non-empty ");
+ for (int i = 0; i < (int)backtrack.size(); i++)
+ if (backtrack[i] == true)
+ model_print("[%d]", i);
+ model_print("\n");
+ model_print(" future values: %s", future_value_empty() ? "empty" : "non-empty ");
+ for (int i = future_index + 1; i < (int)future_values.size(); i++)
+ model_print("[%#" PRIx64 "]", future_values[i].value);
+ model_print("\n");
+
+ model_print(" read-from: %s", read_from_empty() ? "empty" : "non-empty ");
+ for (int i = read_from_index + 1; i < (int)may_read_from.size(); i++)
+ model_print("[%d]", may_read_from[i]->get_seq_number());
+ model_print("\n");
+
+ model_print(" promises: %s\n", promise_empty() ? "empty" : "non-empty");
+ model_print(" misc: %s\n", misc_empty() ? "empty" : "non-empty");
+ model_print(" rel seq break: %s\n", relseq_break_empty() ? "empty" : "non-empty");
}
/** @brief Prints info about may_read_from set */
* Sets a promise to explore meeting with the given node.
* @param i is the promise index.
*/
-void Node::set_promise(unsigned int i, bool is_rmw) {
+void Node::set_promise(unsigned int i, bool is_rmw)
+{
if (i >= promises.size())
promises.resize(i + 1, PROMISE_IGNORE);
if (promises[i] == PROMISE_IGNORE) {
* Increments to the next combination of promises.
* @return true if we have a valid combination.
*/
-bool Node::increment_promise() {
+bool Node::increment_promise()
+{
DBG();
unsigned int rmw_count = 0;
for (unsigned int i = 0; i < promises.size(); i++) {
if (promises[i] == (PROMISE_RMW|PROMISE_FULFILLED))
rmw_count++;
}
-
+
for (unsigned int i = 0; i < promises.size(); i++) {
if ((promises[i] & PROMISE_MASK) == PROMISE_UNFULFILLED) {
if ((rmw_count > 0) && (promises[i] & PROMISE_RMW)) {
bool Node::promise_empty() const
{
bool fulfilledrmw = false;
- for (int i = promises.size() - 1 ; i >= 0; i--) {
+ for (int i = promises.size() - 1; i >= 0; i--) {
if (promises[i] == PROMISE_UNFULFILLED)
return false;
if (!fulfilledrmw && ((promises[i]&PROMISE_MASK) == PROMISE_UNFULFILLED))
return true;
}
-
void Node::set_misc_max(int i)
{
misc_max = i;
return misc_index;
}
-bool Node::increment_misc() {
- return (misc_index<misc_max)&&((++misc_index)<misc_max);
+bool Node::increment_misc()
+{
+ return (misc_index < misc_max) && ((++misc_index) < misc_max);
}
bool Node::misc_empty() const
return (misc_index + 1) >= misc_max;
}
-
/**
* Adds a value from a weakly ordered future write to backtrack to. This
* operation may "fail" if the future value has already been run (within some
* @param value is the value to backtrack to.
* @return True if the future value was successully added; false otherwise
*/
-bool Node::add_future_value(uint64_t value, modelclock_t expiration) {
+bool Node::add_future_value(uint64_t value, modelclock_t expiration)
+{
int idx = -1; /* Highest index where value is found */
for (unsigned int i = 0; i < future_values.size(); i++) {
if (future_values[i].value == value) {
* Mark the appropriate backtracking information for exploring a thread choice.
* @param act The ModelAction to explore
*/
-void Node::explore_child(ModelAction *act, enabled_type_t * is_enabled)
+void Node::explore_child(ModelAction *act, enabled_type_t *is_enabled)
{
if (!enabled_array)
enabled_array = (enabled_type_t *)model_malloc(sizeof(enabled_type_t) * num_threads);
if (is_enabled != NULL)
- memcpy(enabled_array, is_enabled, sizeof(enabled_type_t)*num_threads);
+ memcpy(enabled_array, is_enabled, sizeof(enabled_type_t) * num_threads);
else {
- for(int i = 0; i < num_threads; i++)
+ for (int i = 0; i < num_threads; i++)
enabled_array[i] = THREAD_DISABLED;
}
bool Node::set_backtrack(thread_id_t id)
{
int i = id_to_int(id);
- ASSERT(i<((int)backtrack.size()));
+ ASSERT(i < ((int)backtrack.size()));
if (backtrack[i])
return false;
backtrack[i] = true;
}
/**
- * Gets the next 'future_value' value from this Node. Only valid for a node
- * where this->action is a 'read'.
+ * Gets the next 'future_value' from this Node. Only valid for a node where
+ * this->action is a 'read'.
* @return The first element in future_values
*/
-uint64_t Node::get_future_value() const
-{
- ASSERT(future_index >= 0 && future_index<((int)future_values.size()));
- return future_values[future_index].value;
-}
-
-modelclock_t Node::get_future_value_expiration() const
+struct future_value Node::get_future_value() const
{
- ASSERT(future_index >= 0 && future_index<((int)future_values.size()));
- return future_values[future_index].expiration;
+ ASSERT(future_index >= 0 && future_index < ((int)future_values.size()));
+ return future_values[future_index];
}
-
int Node::get_read_from_size() const
{
return may_read_from.size();
}
-const ModelAction * Node::get_read_from_at(int i) {
+const ModelAction * Node::get_read_from_at(int i) const
+{
return may_read_from[i];
}
* Increments the index into the readsfrom set to explore the next item.
* @return Returns false if we have explored all items.
*/
-bool Node::increment_read_from() {
+bool Node::increment_read_from()
+{
DBG();
promises.clear();
if (read_from_index < may_read_from.size()) {
* Increments the index into the future_values set to explore the next item.
* @return Returns false if we have explored all values.
*/
-bool Node::increment_future_value() {
+bool Node::increment_future_value()
+{
DBG();
promises.clear();
if (future_index < ((int)future_values.size())) {
void Node::explore(thread_id_t tid)
{
int i = id_to_int(tid);
- ASSERT(i<((int)backtrack.size()));
+ ASSERT(i < ((int)backtrack.size()));
if (backtrack[i]) {
backtrack[i] = false;
numBacktracks--;
}
NodeStack::NodeStack() :
- node_list(1, new Node()),
- head_idx(0),
+ node_list(),
+ head_idx(-1),
total_nodes(0)
{
total_nodes++;
{
DBG();
- ASSERT(!node_list.empty());
-
if ((head_idx + 1) < (int)node_list.size()) {
head_idx++;
return node_list[head_idx]->get_action();
}
/* Record action */
- get_head()->explore_child(act, is_enabled);
+ Node *head = get_head();
Node *prevfairness = NULL;
- 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, get_head(), model->get_num_threads(), prevfairness));
+ if (head) {
+ head->explore_child(act, is_enabled);
+ 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));
total_nodes++;
head_idx++;
return NULL;
{
/* Diverging from previous execution; clear out remainder of list */
unsigned int it = head_idx + numAhead;
- for(unsigned int i = it; i < node_list.size(); i++)
+ for (unsigned int i = it; i < node_list.size(); i++)
delete node_list[i];
node_list.resize(it);
}
Node * NodeStack::get_head() const
{
- if (node_list.empty())
+ if (node_list.empty() || head_idx < 0)
return NULL;
return node_list[head_idx];
}
void NodeStack::reset_execution()
{
- head_idx = 0;
+ head_idx = -1;
}