X-Git-Url: http://plrg.eecs.uci.edu/git/?p=c11tester.git;a=blobdiff_plain;f=cyclegraph.h;h=bb2ab2d87b4370065ff64fa9dfcac45e86f2ce39;hp=0bb01c4c15ec608aa06a1892103635c4973ed039;hb=a11a861e697310b5fd8abe52dff49fc8a66eeb78;hpb=50b95c3747f4fe79b2ab1a1a6fc303224e16e418

diff --git a/cyclegraph.h b/cyclegraph.h
index 0bb01c4c..bb2ab2d8 100644
--- a/cyclegraph.h
+++ b/cyclegraph.h
@@ -1,72 +1,132 @@
-/** @file cyclegraph.h @brief Data structure to track ordering
- *  constraints on modification order.  The idea is to see whether a
- *  total order exists that satisfies the ordering constriants.*/
+/**
+ * @file cyclegraph.h
+ * @brief Data structure to track ordering constraints on modification order
+ *
+ * Used to determine whether a total order exists that satisfies the ordering
+ * constraints.
+ */
 
-#ifndef CYCLEGRAPH_H
-#define CYCLEGRAPH_H
+#ifndef __CYCLEGRAPH_H__
+#define __CYCLEGRAPH_H__
 
 #include "hashtable.h"
 #include <vector>
 #include <inttypes.h>
+#include "config.h"
+#include "mymemory.h"
 
+class Promise;
 class CycleNode;
 class ModelAction;
 
+typedef std::vector< const Promise *, ModelAlloc<const Promise *> > promise_list_t;
+
 /** @brief A graph of Model Actions for tracking cycles. */
 class CycleGraph {
  public:
 	CycleGraph();
 	~CycleGraph();
-	void addEdge(const ModelAction *from, const ModelAction *to);
-	bool checkForCycles();
-	void addRMWEdge(const ModelAction *from, const ModelAction *rmw);
 
-	bool checkReachable(const ModelAction *from, const ModelAction *to);
+	template <typename T, typename U>
+	bool addEdge(const T *from, const U *to);
+
+	template <typename T>
+	void addRMWEdge(const T *from, const ModelAction *rmw);
+
+	bool checkForCycles() const;
+	bool checkPromise(const ModelAction *from, Promise *p) const;
+
+	template <typename T, typename U>
+	bool checkReachable(const T *from, const U *to) const;
+
+	void startChanges();
 	void commitChanges();
 	void rollbackChanges();
+#if SUPPORT_MOD_ORDER_DUMP
+	void dumpNodes(FILE *file) const;
+	void dumpGraphToFile(const char *filename) const;
+#endif
 
+	bool resolvePromise(ModelAction *reader, ModelAction *writer,
+			promise_list_t *mustResolve);
+
+	SNAPSHOTALLOC
  private:
-	CycleNode * getNode(const ModelAction *);
+	bool addNodeEdge(CycleNode *fromnode, CycleNode *tonode);
+	void putNode(const ModelAction *act, CycleNode *node);
+	void putNode(const Promise *promise, CycleNode *node);
+	void erasePromiseNode(const Promise *promise);
+	CycleNode * getNode(const ModelAction *act);
+	CycleNode * getNode(const Promise *promise);
+	CycleNode * getNode_noCreate(const ModelAction *act) const;
+	CycleNode * getNode_noCreate(const Promise *promise) const;
+	bool mergeNodes(CycleNode *node1, CycleNode *node2,
+			promise_list_t *mustMerge);
+
+	HashTable<const CycleNode *, const CycleNode *, uintptr_t, 4, model_malloc, model_calloc, model_free> *discovered;
 
 	/** @brief A table for mapping ModelActions to CycleNodes */
 	HashTable<const ModelAction *, CycleNode *, uintptr_t, 4> actionToNode;
+	/** @brief A table for mapping reader ModelActions to Promise
+	 *  CycleNodes */
+	HashTable<const ModelAction *, CycleNode *, uintptr_t, 4> readerToPromiseNode;
 
-	bool checkReachable(CycleNode *from, CycleNode *to);
+#if SUPPORT_MOD_ORDER_DUMP
+	std::vector<CycleNode *> nodeList;
+#endif
+
+	bool checkReachable(const CycleNode *from, const CycleNode *to) const;
 
 	/** @brief A flag: true if this graph contains cycles */
 	bool hasCycles;
-
 	bool oldCycles;
 
-	std::vector<CycleNode *> rollbackvector;
-	std::vector<CycleNode *> rmwrollbackvector;
+	std::vector< CycleNode *, SnapshotAlloc<CycleNode *> > rollbackvector;
+	std::vector< CycleNode *, SnapshotAlloc<CycleNode *> > rmwrollbackvector;
 };
 
-/** @brief A node within a CycleGraph; corresponds to one ModelAction */
+/**
+ * @brief A node within a CycleGraph; corresponds either to one ModelAction or
+ * to a promised future value
+ */
 class CycleNode {
  public:
-	CycleNode(const ModelAction *action);
-	void addEdge(CycleNode * node);
-	std::vector<CycleNode *> * getEdges();
-	bool setRMW(CycleNode *);
-	CycleNode* getRMW();
-	void popEdge() {
-		edges.pop_back();
-	};
-	void clearRMW() {
-		hasRMW=NULL;
-	}
+	CycleNode(const ModelAction *act);
+	CycleNode(const Promise *promise);
+	bool addEdge(CycleNode *node);
+	CycleNode * getEdge(unsigned int i) const;
+	unsigned int getNumEdges() const;
+	CycleNode * getBackEdge(unsigned int i) const;
+	unsigned int getNumBackEdges() const;
+	CycleNode * removeEdge();
+	CycleNode * removeBackEdge();
 
+	bool setRMW(CycleNode *);
+	CycleNode * getRMW() const;
+	void clearRMW() { hasRMW = NULL; }
+	const ModelAction * getAction() const { return action; }
+	const Promise * getPromise() const { return promise; }
+	bool is_promise() const { return !action; }
+	void resolvePromise(const ModelAction *writer);
+
+	SNAPSHOTALLOC
  private:
 	/** @brief The ModelAction that this node represents */
 	const ModelAction *action;
 
+	/** @brief The promise represented by this node; only valid when action
+	 * is NULL */
+	const Promise *promise;
+
 	/** @brief The edges leading out from this node */
-	std::vector<CycleNode *> edges;
+	std::vector< CycleNode *, SnapshotAlloc<CycleNode *> > edges;
+
+	/** @brief The edges leading into this node */
+	std::vector< CycleNode *, SnapshotAlloc<CycleNode *> > back_edges;
 
 	/** Pointer to a RMW node that reads from this node, or NULL, if none
 	 * exists */
-	CycleNode * hasRMW;
+	CycleNode *hasRMW;
 };
 
-#endif
+#endif /* __CYCLEGRAPH_H__ */