X-Git-Url: http://plrg.eecs.uci.edu/git/?p=c11tester.git;a=blobdiff_plain;f=cyclegraph.cc;h=44f5a28bc15b69cc3289a4906b298341845ae324;hp=672a3986fc58b058ccfe32855ff07103a1e93266;hb=5fa2efec1354b2781ff0b29460ec8e9b8fa75991;hpb=023ee9d106760070dd0c1f22119c1831844b3b8f diff --git a/cyclegraph.cc b/cyclegraph.cc index 672a3986..44f5a28b 100644 --- a/cyclegraph.cc +++ b/cyclegraph.cc @@ -6,11 +6,9 @@ /** Initializes a CycleGraph object. */ CycleGraph::CycleGraph() : - discovered(new HashTable(16)), + discovered(new HashTable(16)), hasCycles(false), - oldCycles(false), - hasRMWViolation(false), - oldRMWViolation(false) + oldCycles(false) { } @@ -33,14 +31,62 @@ void CycleGraph::putNode(const ModelAction *act, CycleNode *node) #endif } +/** + * Add a CycleNode to the graph, corresponding to a Promise + * @param promise The Promise that should be added + * @param node The CycleNode that corresponds to the Promise + */ +void CycleGraph::putNode(const Promise *promise, CycleNode *node) +{ + const ModelAction *reader = promise->get_action(); + readerToPromiseNode.put(reader, node); +#if SUPPORT_MOD_ORDER_DUMP + nodeList.push_back(node); +#endif +} + +/** + * @brief Remove the Promise node from the graph + * @param promise The promise to remove from the graph + */ +void CycleGraph::erasePromiseNode(const Promise *promise) +{ + const ModelAction *reader = promise->get_action(); + readerToPromiseNode.put(reader, NULL); +#if SUPPORT_MOD_ORDER_DUMP + /* Remove the promise node from nodeList */ + CycleNode *node = getNode_noCreate(promise); + for (unsigned int i = 0; i < nodeList.size(); ) + if (nodeList[i] == node) + nodeList.erase(nodeList.begin() + i); + else + i++; +#endif +} + +/** @return The corresponding CycleNode, if exists; otherwise NULL */ +CycleNode * CycleGraph::getNode_noCreate(const ModelAction *act) const +{ + return actionToNode.get(act); +} + +/** @return The corresponding CycleNode, if exists; otherwise NULL */ +CycleNode * CycleGraph::getNode_noCreate(const Promise *promise) const +{ + return readerToPromiseNode.get(promise->get_action()); +} + /** * @brief Returns the CycleNode corresponding to a given ModelAction + * + * Gets (or creates, if none exist) a CycleNode corresponding to a ModelAction + * * @param action The ModelAction to find a node for * @return The CycleNode paired with this action */ CycleNode * CycleGraph::getNode(const ModelAction *action) { - CycleNode *node = actionToNode.get(action); + CycleNode *node = getNode_noCreate(action); if (node == NULL) { node = new CycleNode(action); putNode(action, node); @@ -49,59 +95,161 @@ CycleNode * CycleGraph::getNode(const ModelAction *action) } /** - * Adds an edge between two ModelActions. The ModelAction @a to is ordered - * after the ModelAction @a from. - * @param to The edge points to this ModelAction - * @param from The edge comes from this ModelAction + * @brief Returns a CycleNode corresponding to a promise + * + * Gets (or creates, if none exist) a CycleNode corresponding to a promised + * value. + * + * @param promise The Promise generated by a reader + * @return The CycleNode corresponding to the Promise */ -void CycleGraph::addEdge(const ModelAction *from, const ModelAction *to) +CycleNode * CycleGraph::getNode(const Promise *promise) { - ASSERT(from); - ASSERT(to); + CycleNode *node = getNode_noCreate(promise); + if (node == NULL) { + node = new CycleNode(promise); + putNode(promise, node); + } + return node; +} - CycleNode *fromnode = getNode(from); - CycleNode *tonode = getNode(to); +/** + * @return false if the resolution results in a cycle; true otherwise + */ +bool CycleGraph::resolvePromise(ModelAction *reader, ModelAction *writer, + promise_list_t *mustResolve) +{ + CycleNode *promise_node = readerToPromiseNode.get(reader); + CycleNode *w_node = actionToNode.get(writer); + ASSERT(promise_node); + + if (w_node) + return mergeNodes(w_node, promise_node, mustResolve); + /* No existing write-node; just convert the promise-node */ + promise_node->resolvePromise(writer); + erasePromiseNode(promise_node->getPromise()); + putNode(writer, promise_node); + return true; +} + +/** + * @brief Merge two CycleNodes that represent the same write + * + * Note that this operation cannot be rolled back. + * + * @param w_node The write ModelAction node with which to merge + * @param p_node The Promise node to merge. Will be destroyed after this + * function. + * @param mustMerge Return (pass-by-reference) any additional Promises that + * must also be merged with w_node + * + * @return false if the merge results in a cycle; true otherwise + */ +bool CycleGraph::mergeNodes(CycleNode *w_node, CycleNode *p_node, + promise_list_t *mustMerge) +{ + ASSERT(!w_node->is_promise()); + ASSERT(p_node->is_promise()); - if (!hasCycles) { - // Reflexive edges are cycles - hasCycles = (from == to); + const Promise *promise = p_node->getPromise(); + if (!promise->is_compatible(w_node->getAction())) { + hasCycles = true; + return false; } - if (!hasCycles) { - // Check for Cycles - hasCycles = checkReachable(tonode, fromnode); + + /* Transfer the RMW */ + CycleNode *promise_rmw = p_node->getRMW(); + if (promise_rmw && promise_rmw != w_node->getRMW() && w_node->setRMW(promise_rmw)) { + hasCycles = true; + return false; } - if (fromnode->addEdge(tonode)) - rollbackvector.push_back(fromnode); + /* Transfer back edges to w_node */ + while (p_node->getNumBackEdges() > 0) { + CycleNode *back = p_node->removeBackEdge(); + if (back == w_node) + continue; + if (back->is_promise()) { + if (checkReachable(w_node, back)) { + /* Edge would create cycle; merge instead */ + mustMerge->push_back(back->getPromise()); + if (!mergeNodes(w_node, back, mustMerge)) + return false; + } else + back->addEdge(w_node); + } else + addNodeEdge(back, w_node); + } + /* Transfer forward edges to w_node */ + while (p_node->getNumEdges() > 0) { + CycleNode *forward = p_node->removeEdge(); + if (forward == w_node) + continue; + if (forward->is_promise()) { + if (checkReachable(forward, w_node)) { + mustMerge->push_back(forward->getPromise()); + if (!mergeNodes(w_node, forward, mustMerge)) + return false; + } else + w_node->addEdge(forward); + } else + addNodeEdge(w_node, forward); + } - CycleNode *rmwnode = fromnode->getRMW(); + erasePromiseNode(promise); + /* Not deleting p_node, to maintain consistency if mergeNodes() fails */ + + return !hasCycles; +} + +/** + * Adds an edge between two CycleNodes. + * @param fromnode The edge comes from this CycleNode + * @param tonode The edge points to this CycleNode + * @return True, if new edge(s) are added; otherwise false + */ +bool CycleGraph::addNodeEdge(CycleNode *fromnode, CycleNode *tonode) +{ + bool added; + + if (!hasCycles) + hasCycles = checkReachable(tonode, fromnode); + + if ((added = fromnode->addEdge(tonode))) + rollbackvector.push_back(fromnode); /* * If the fromnode has a rmwnode that is not the tonode, we should add * an edge between its rmwnode and the tonode - * - * If tonode is also a rmw, don't do this check as the execution is - * doomed and we'll catch the problem elsewhere, but we want to allow - * for the possibility of sending to's write value to rmwnode */ - if (rmwnode != NULL && !to->is_rmw()) { - if (!hasCycles) { - // Check for Cycles + CycleNode *rmwnode = fromnode->getRMW(); + if (rmwnode && rmwnode != tonode) { + if (!hasCycles) hasCycles = checkReachable(tonode, rmwnode); - } - if (rmwnode->addEdge(tonode)) + if (rmwnode->addEdge(tonode)) { rollbackvector.push_back(rmwnode); + added = true; + } } + return added; } -/** Handles special case of a RMW action. The ModelAction rmw reads - * from the ModelAction from. The key differences are: (1) no write - * can occur in between the rmw and the from action. Only one RMW - * action can read from a given write. +/** + * @brief Add an edge between a write and the RMW which reads from it + * + * Handles special case of a RMW action, where the ModelAction rmw reads from + * the ModelAction/Promise from. The key differences are: + * (1) no write can occur in between the rmw and the from action. + * (2) Only one RMW action can read from a given write. + * + * @param from The edge comes from this ModelAction/Promise + * @param rmw The edge points to this ModelAction; this action must read from + * the ModelAction/Promise from */ -void CycleGraph::addRMWEdge(const ModelAction *from, const ModelAction *rmw) +template +void CycleGraph::addRMWEdge(const T *from, const ModelAction *rmw) { ASSERT(from); ASSERT(rmw); @@ -110,11 +258,10 @@ void CycleGraph::addRMWEdge(const ModelAction *from, const ModelAction *rmw) CycleNode *rmwnode = getNode(rmw); /* Two RMW actions cannot read from the same write. */ - if (fromnode->setRMW(rmwnode)) { - hasRMWViolation = true; - } else { + if (fromnode->setRMW(rmwnode)) + hasCycles = true; + else rmwrollbackvector.push_back(fromnode); - } /* Transfer all outgoing edges from the from node to the rmw node */ /* This process should not add a cycle because either: @@ -131,34 +278,87 @@ void CycleGraph::addRMWEdge(const ModelAction *from, const ModelAction *rmw) } } + addNodeEdge(fromnode, rmwnode); +} +/* Instantiate two forms of CycleGraph::addRMWEdge */ +template void CycleGraph::addRMWEdge(const ModelAction *from, const ModelAction *rmw); +template void CycleGraph::addRMWEdge(const Promise *from, const ModelAction *rmw); - if (!hasCycles) { - // Reflexive edges are cycles - hasCycles = (from == rmw); - } - if (!hasCycles) { - // With promises we could be setting up a cycle here if we aren't - // careful...avoid it.. - hasCycles = checkReachable(rmwnode, fromnode); - } - if (fromnode->addEdge(rmwnode)) - rollbackvector.push_back(fromnode); +/** + * @brief Adds an edge between objects + * + * This function will add an edge between any two objects which can be + * associated with a CycleNode. That is, if they have a CycleGraph::getNode + * implementation. + * + * The object to is ordered after the object from. + * + * @param to The edge points to this object, of type T + * @param from The edge comes from this object, of type U + * @return True, if new edge(s) are added; otherwise false + */ +template +bool CycleGraph::addEdge(const T *from, const U *to) +{ + ASSERT(from); + ASSERT(to); + + CycleNode *fromnode = getNode(from); + CycleNode *tonode = getNode(to); + + return addNodeEdge(fromnode, tonode); } +/* Instantiate four forms of CycleGraph::addEdge */ +template bool CycleGraph::addEdge(const ModelAction *from, const ModelAction *to); +template bool CycleGraph::addEdge(const ModelAction *from, const Promise *to); +template bool CycleGraph::addEdge(const Promise *from, const ModelAction *to); +template bool CycleGraph::addEdge(const Promise *from, const Promise *to); #if SUPPORT_MOD_ORDER_DUMP + +static void print_node(const CycleNode *node, FILE *file, int label) +{ + modelclock_t idx; + if (node->is_promise()) { + const Promise *promise = node->getPromise(); + idx = promise->get_action()->get_seq_number(); + fprintf(file, "P%u", idx); + if (label) { + int first = 1; + fprintf(file, " [label=\"P%u, T", idx); + for (unsigned int i = 0 ; i < model->get_num_threads(); i++) + if (promise->thread_is_available(int_to_id(i))) { + fprintf(file, "%s%u", first ? "": ",", i); + first = 0; + } + fprintf(file, "\"]"); + } + } else { + const ModelAction *act = node->getAction(); + idx = act->get_seq_number(); + fprintf(file, "N%u", idx); + if (label) + fprintf(file, " [label=\"N%u, T%u\"]", idx, act->get_tid()); + } +} + void CycleGraph::dumpNodes(FILE *file) const { for (unsigned int i = 0; i < nodeList.size(); i++) { - CycleNode *cn = nodeList[i]; - const ModelAction *action = cn->getAction(); - fprintf(file, "N%u [label=\"%u, T%u\"];\n", action->get_seq_number(), action->get_seq_number(), action->get_tid()); - if (cn->getRMW() != NULL) { - fprintf(file, "N%u -> N%u[style=dotted];\n", action->get_seq_number(), cn->getRMW()->getAction()->get_seq_number()); + CycleNode *n = nodeList[i]; + print_node(n, file, 1); + fprintf(file, ";\n"); + if (n->getRMW() != NULL) { + print_node(n, file, 0); + fprintf(file, " -> "); + print_node(n->getRMW(), file, 0); + fprintf(file, "[style=dotted];\n"); } - for (unsigned int j = 0; j < cn->getNumEdges(); j++) { - CycleNode *dst = cn->getEdge(j); - const ModelAction *dstaction = dst->getAction(); - fprintf(file, "N%u -> N%u;\n", action->get_seq_number(), dstaction->get_seq_number()); + for (unsigned int j = 0; j < n->getNumEdges(); j++) { + print_node(n, file, 0); + fprintf(file, " -> "); + print_node(n->getEdge(j), file, 0); + fprintf(file, ";\n"); } } } @@ -175,38 +375,21 @@ void CycleGraph::dumpGraphToFile(const char *filename) const } #endif -/** - * Checks whether one ModelAction can reach another. - * @param from The ModelAction from which to begin exploration - * @param to The ModelAction to reach - * @return True, @a from can reach @a to; otherwise, false - */ -bool CycleGraph::checkReachable(const ModelAction *from, const ModelAction *to) const -{ - CycleNode *fromnode = actionToNode.get(from); - CycleNode *tonode = actionToNode.get(to); - - if (!fromnode || !tonode) - return false; - - return checkReachable(fromnode, tonode); -} - /** * Checks whether one CycleNode can reach another. * @param from The CycleNode from which to begin exploration * @param to The CycleNode to reach * @return True, @a from can reach @a to; otherwise, false */ -bool CycleGraph::checkReachable(CycleNode *from, CycleNode *to) const +bool CycleGraph::checkReachable(const CycleNode *from, const CycleNode *to) const { - std::vector< CycleNode *, ModelAlloc > queue; + std::vector< const CycleNode *, ModelAlloc > queue; discovered->reset(); queue.push_back(from); discovered->put(from, from); while (!queue.empty()) { - CycleNode *node = queue.back(); + const CycleNode *node = queue.back(); queue.pop_back(); if (node == to) return true; @@ -222,6 +405,32 @@ bool CycleGraph::checkReachable(CycleNode *from, CycleNode *to) const return false; } +/** + * Checks whether one ModelAction/Promise can reach another ModelAction/Promise + * @param from The ModelAction or Promise from which to begin exploration + * @param to The ModelAction or Promise to reach + * @return True, @a from can reach @a to; otherwise, false + */ +template +bool CycleGraph::checkReachable(const T *from, const U *to) const +{ + CycleNode *fromnode = getNode_noCreate(from); + CycleNode *tonode = getNode_noCreate(to); + + if (!fromnode || !tonode) + return false; + + return checkReachable(fromnode, tonode); +} +/* Instantiate three forms of CycleGraph::checkReachable */ +template bool CycleGraph::checkReachable(const ModelAction *from, + const ModelAction *to) const; +template bool CycleGraph::checkReachable(const ModelAction *from, + const Promise *to) const; +template bool CycleGraph::checkReachable(const Promise *from, + const ModelAction *to) const; + +/** @return True, if the promise has failed; false otherwise */ bool CycleGraph::checkPromise(const ModelAction *fromact, Promise *promise) const { std::vector< CycleNode *, ModelAlloc > queue; @@ -234,9 +443,11 @@ bool CycleGraph::checkPromise(const ModelAction *fromact, Promise *promise) cons CycleNode *node = queue.back(); queue.pop_back(); - if (promise->increment_threads(node->getAction()->get_tid())) { + if (node->getPromise() == promise) + return true; + if (!node->is_promise() && + promise->eliminate_thread(node->getAction()->get_tid())) return true; - } for (unsigned int i = 0; i < node->getNumEdges(); i++) { CycleNode *next = node->getEdge(i); @@ -251,36 +462,31 @@ bool CycleGraph::checkPromise(const ModelAction *fromact, Promise *promise) cons void CycleGraph::startChanges() { - ASSERT(rollbackvector.size() == 0); - ASSERT(rmwrollbackvector.size() == 0); + ASSERT(rollbackvector.empty()); + ASSERT(rmwrollbackvector.empty()); ASSERT(oldCycles == hasCycles); - ASSERT(oldRMWViolation == hasRMWViolation); } /** Commit changes to the cyclegraph. */ void CycleGraph::commitChanges() { - rollbackvector.resize(0); - rmwrollbackvector.resize(0); + rollbackvector.clear(); + rmwrollbackvector.clear(); oldCycles = hasCycles; - oldRMWViolation = hasRMWViolation; } /** Rollback changes to the previous commit. */ void CycleGraph::rollbackChanges() { - for (unsigned int i = 0; i < rollbackvector.size(); i++) { - rollbackvector[i]->popEdge(); - } + for (unsigned int i = 0; i < rollbackvector.size(); i++) + rollbackvector[i]->removeEdge(); - for (unsigned int i = 0; i < rmwrollbackvector.size(); i++) { + for (unsigned int i = 0; i < rmwrollbackvector.size(); i++) rmwrollbackvector[i]->clearRMW(); - } hasCycles = oldCycles; - hasRMWViolation = oldRMWViolation; - rollbackvector.resize(0); - rmwrollbackvector.resize(0); + rollbackvector.clear(); + rmwrollbackvector.clear(); } /** @returns whether a CycleGraph contains cycles. */ @@ -289,17 +495,24 @@ bool CycleGraph::checkForCycles() const return hasCycles; } -bool CycleGraph::checkForRMWViolation() const -{ - return hasRMWViolation; -} - /** * @brief Constructor for a CycleNode * @param act The ModelAction for this node */ CycleNode::CycleNode(const ModelAction *act) : action(act), + promise(NULL), + hasRMW(NULL) +{ +} + +/** + * @brief Constructor for a Promise CycleNode + * @param promise The Promise which was generated + */ +CycleNode::CycleNode(const Promise *promise) : + action(NULL), + promise(promise), hasRMW(NULL) { } @@ -319,9 +532,68 @@ unsigned int CycleNode::getNumEdges() const return edges.size(); } +CycleNode * CycleNode::getBackEdge(unsigned int i) const +{ + return back_edges[i]; +} + +unsigned int CycleNode::getNumBackEdges() const +{ + return back_edges.size(); +} + +/** + * @brief Remove an element from a vector + * @param v The vector + * @param n The element to remove + * @return True if the element was found; false otherwise + */ +template +static bool vector_remove_node(std::vector >& v, const T n) +{ + for (unsigned int i = 0; i < v.size(); i++) { + if (v[i] == n) { + v.erase(v.begin() + i); + return true; + } + } + return false; +} + +/** + * @brief Remove a (forward) edge from this CycleNode + * @return The CycleNode which was popped, if one exists; otherwise NULL + */ +CycleNode * CycleNode::removeEdge() +{ + if (edges.empty()) + return NULL; + + CycleNode *ret = edges.back(); + edges.pop_back(); + vector_remove_node(ret->back_edges, this); + return ret; +} + +/** + * @brief Remove a (back) edge from this CycleNode + * @return The CycleNode which was popped, if one exists; otherwise NULL + */ +CycleNode * CycleNode::removeBackEdge() +{ + if (back_edges.empty()) + return NULL; + + CycleNode *ret = back_edges.back(); + back_edges.pop_back(); + vector_remove_node(ret->edges, this); + return ret; +} + /** * Adds an edge from this CycleNode to another CycleNode. * @param node The node to which we add a directed edge + * @return True if this edge is a new edge; false otherwise */ bool CycleNode::addEdge(CycleNode *node) { @@ -329,6 +601,7 @@ bool CycleNode::addEdge(CycleNode *node) if (edges[i] == node) return false; edges.push_back(node); + node->back_edges.push_back(this); return true; } @@ -351,3 +624,19 @@ bool CycleNode::setRMW(CycleNode *node) hasRMW = node; return false; } + +/** + * Convert a Promise CycleNode into a concrete-valued CycleNode. Should only be + * used when there's no existing ModelAction CycleNode for this write. + * + * @param writer The ModelAction which wrote the future value represented by + * this CycleNode + */ +void CycleNode::resolvePromise(const ModelAction *writer) +{ + ASSERT(is_promise()); + ASSERT(promise->is_compatible(writer)); + action = writer; + promise = NULL; + ASSERT(!is_promise()); +}