+/** @brief Prints info about may_read_from set */
+void Node::print_may_read_from()
+{
+ for (unsigned int i = 0; i < may_read_from.size(); i++)
+ may_read_from[i]->print();
+}
+
+/**
+ * Sets a promise to explore meeting with the given node.
+ * @param i is the promise index.
+ */
+void Node::set_promise(unsigned int i) {
+ if (i >= promises.size())
+ promises.resize(i + 1, PROMISE_IGNORE);
+ promises[i] = PROMISE_UNFULFILLED;
+}
+
+/**
+ * Looks up whether a given promise should be satisfied by this node.
+ * @param i The promise index.
+ * @return true if the promise should be satisfied by the given model action.
+ */
+bool Node::get_promise(unsigned int i) {
+ return (i < promises.size()) && (promises[i] == PROMISE_FULFILLED);
+}
+
+/**
+ * Increments to the next combination of promises.
+ * @return true if we have a valid combination.
+ */
+bool Node::increment_promise() {
+ for (unsigned int i = 0; i < promises.size(); i++) {
+ if (promises[i] == PROMISE_UNFULFILLED) {
+ promises[i] = PROMISE_FULFILLED;
+ while (i > 0) {
+ i--;
+ if (promises[i] == PROMISE_FULFILLED)
+ promises[i] = PROMISE_UNFULFILLED;
+ }
+ return true;
+ }
+ }
+ return false;
+}
+
+/**
+ * Returns whether the promise set is empty.
+ * @return true if we have explored all promise combinations.
+ */
+bool Node::promise_empty() {
+ for (unsigned int i = 0; i < promises.size();i++)
+ if (promises[i] == PROMISE_UNFULFILLED)
+ return false;
+ return true;
+}
+
+/**
+ * Adds a value from a weakly ordered future write to backtrack to.
+ * @param value is the value to backtrack to.
+ */
+bool Node::add_future_value(uint64_t value) {
+ for (unsigned int i = 0; i < future_values.size(); i++)
+ if (future_values[i] == value)
+ return false;
+
+ future_values.push_back(value);
+ return true;
+}
+
+/**
+ * Checks whether the future_values set for this node is empty.
+ * @return true if the future_values set is empty.
+ */
+bool Node::future_value_empty() {
+ return ((future_index + 1) >= future_values.size());
+}
+