X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=cyclegraph.h;h=bb2ab2d87b4370065ff64fa9dfcac45e86f2ce39;hb=09c3eb5539455e82dcb357fbce82bf5974c3a37c;hp=6b3d93e5e45ec661d3acd4db987796b9b1adaea6;hpb=023ee9d106760070dd0c1f22119c1831844b3b8f;p=model-checker.git diff --git a/cyclegraph.h b/cyclegraph.h index 6b3d93e..bb2ab2d 100644 --- a/cyclegraph.h +++ b/cyclegraph.h @@ -19,17 +19,26 @@ class Promise; class CycleNode; class ModelAction; +typedef std::vector< const Promise *, ModelAlloc > 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); + + template + bool addEdge(const T *from, const U *to); + + template + void addRMWEdge(const T *from, const ModelAction *rmw); + bool checkForCycles() const; - bool checkForRMWViolation() const; - void addRMWEdge(const ModelAction *from, const ModelAction *rmw); bool checkPromise(const ModelAction *from, Promise *p) const; - bool checkReachable(const ModelAction *from, const ModelAction *to) const; + + template + bool checkReachable(const T *from, const U *to) const; + void startChanges(); void commitChanges(); void rollbackChanges(); @@ -38,57 +47,83 @@ class CycleGraph { void dumpGraphToFile(const char *filename) const; #endif + bool resolvePromise(ModelAction *reader, ModelAction *writer, + promise_list_t *mustResolve); + SNAPSHOTALLOC private: + bool addNodeEdge(CycleNode *fromnode, CycleNode *tonode); void putNode(const ModelAction *act, CycleNode *node); - CycleNode * getNode(const ModelAction *); - HashTable *discovered; + 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 *discovered; /** @brief A table for mapping ModelActions to CycleNodes */ HashTable actionToNode; + /** @brief A table for mapping reader ModelActions to Promise + * CycleNodes */ + HashTable readerToPromiseNode; + #if SUPPORT_MOD_ORDER_DUMP std::vector nodeList; #endif - bool checkReachable(CycleNode *from, CycleNode *to) const; + bool checkReachable(const CycleNode *from, const CycleNode *to) const; /** @brief A flag: true if this graph contains cycles */ bool hasCycles; bool oldCycles; - bool hasRMWViolation; - bool oldRMWViolation; - std::vector< CycleNode *, SnapshotAlloc > rollbackvector; std::vector< CycleNode *, SnapshotAlloc > 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 *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; } - - void popEdge() { - edges.pop_back(); - } - void clearRMW() { - hasRMW = NULL; - } + 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 *, SnapshotAlloc > edges; + /** @brief The edges leading into this node */ + std::vector< CycleNode *, SnapshotAlloc > back_edges; + /** Pointer to a RMW node that reads from this node, or NULL, if none * exists */ CycleNode *hasRMW;