/** Initializes a CycleGraph object. */
CycleGraph::CycleGraph() :
- discovered(new HashTable<CycleNode *, CycleNode *, uintptr_t, 4, model_malloc, model_calloc, model_free>(16)),
+ discovered(new HashTable<const CycleNode *, const CycleNode *, uintptr_t, 4, model_malloc, model_calloc, model_free>(16)),
hasCycles(false),
oldCycles(false),
hasRMWViolation(false),
CycleNode *fromnode = getNode(from);
CycleNode *tonode = getNode(to);
- if (!hasCycles) {
- // Reflexive edges are cycles
- hasCycles = (from == to);
- }
- if (!hasCycles) {
- // Check for Cycles
+ addEdge(fromnode, tonode);
+}
+
+/**
+ * Adds an edge between two CycleNodes.
+ * @param fromnode The edge comes from this CycleNode
+ * @param tonode The edge points to this CycleNode
+ */
+void CycleGraph::addEdge(CycleNode *fromnode, CycleNode *tonode)
+{
+ if (!hasCycles)
hasCycles = checkReachable(tonode, fromnode);
- }
if (fromnode->addEdge(tonode))
rollbackvector.push_back(fromnode);
-
- CycleNode *rmwnode = fromnode->getRMW();
-
/*
* 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))
rollbackvector.push_back(rmwnode);
}
}
-
- 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);
+ addEdge(fromnode, rmwnode);
}
#if SUPPORT_MOD_ORDER_DUMP
* @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<CycleNode *> > queue;
+ std::vector< const CycleNode *, ModelAlloc<const CycleNode *> > 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;
CycleNode *node = queue.back();
queue.pop_back();
- if (promise->increment_threads(node->getAction()->get_tid())) {
+ if (promise->eliminate_thread(node->getAction()->get_tid())) {
return true;
}
/**
* 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)
{