-/** @brief Prints info about read_from_past set */
-void Node::print_read_from_past()
-{
- for (unsigned int i = 0; i < read_from_past.size(); i++)
- read_from_past[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, bool is_rmw)
-{
- if (i >= promises.size())
- promises.resize(i + 1, PROMISE_IGNORE);
- if (promises[i] == PROMISE_IGNORE) {
- promises[i] = PROMISE_UNFULFILLED;
- if (is_rmw)
- promises[i] |= PROMISE_RMW;
- }
-}
-
-/**
- * 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) const
-{
- return (i < promises.size()) && ((promises[i] & PROMISE_MASK) == PROMISE_FULFILLED);
-}
-
-/**
- * Increments to the next combination of promises.
- * @return true if we have a valid combination.
- */
-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)) {
- //sending our value to two rmws... not going to work..try next combination
- continue;
- }
- promises[i] = (promises[i] & PROMISE_RMW) | PROMISE_FULFILLED;
- while (i > 0) {
- i--;
- if ((promises[i] & PROMISE_MASK) == PROMISE_FULFILLED)
- promises[i] = (promises[i] & PROMISE_RMW) | PROMISE_UNFULFILLED;
- }
- return true;
- } else if (promises[i] == (PROMISE_RMW|PROMISE_FULFILLED)) {
- rmw_count--;
- }
- }
- return false;
-}
-
-/**
- * Returns whether the promise set is empty.
- * @return true if we have explored all promise combinations.
- */
-bool Node::promise_empty() const
-{
- bool fulfilledrmw = false;
- 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 false;
- if (promises[i] == (PROMISE_FULFILLED | PROMISE_RMW))
- fulfilledrmw = true;
- }
- return true;
-}
-
-void Node::set_misc_max(int i)
-{
- misc_max = i;
-}
-
-int Node::get_misc() const
-{
- return misc_index;
-}
-
-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
- * sloppiness window of this expiration), or if the futurevalues set has
- * reached its maximum.
- * @see model_params.maxfuturevalues
- *
- * @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)
-{
- uint64_t value = fv.value;
- modelclock_t expiration = fv.expiration;
- thread_id_t tid = fv.tid;
- 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 && future_values[i].tid == tid) {
- if (expiration <= future_values[i].expiration)
- return false;
- idx = i;
- }
- }
- if (idx > future_index) {
- /* Future value hasn't been explored; update expiration */
- future_values[idx].expiration = expiration;
- return true;
- } else if (idx >= 0 && expiration <= future_values[idx].expiration + model->params.expireslop) {
- /* Future value has been explored and is within the "sloppy" window */
- return false;
- }
-
- /* Limit the size of the future-values set */
- if (model->params.maxfuturevalues > 0 &&
- (int)future_values.size() >= model->params.maxfuturevalues)
- return false;
-
- future_values.push_back(fv);
- 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() const
-{
- return ((future_index + 1) >= ((int)future_values.size()));
-}