X-Git-Url: http://plrg.eecs.uci.edu/git/?p=model-checker.git;a=blobdiff_plain;f=cyclegraph.h;h=7e7d180e0c1bd7a73de4653b657896f5a1df3a29;hp=45e49fb7bec3950656054e02f92b06aa5cf3ae65;hb=f7a2a9682e6edbf7db5b07d1022436fb0f7c5594;hpb=ecf4c35df39672c99e638045087266d2cd098cfa diff --git a/cyclegraph.h b/cyclegraph.h index 45e49fb..7e7d180 100644 --- a/cyclegraph.h +++ b/cyclegraph.h @@ -9,11 +9,13 @@ #ifndef __CYCLEGRAPH_H__ #define __CYCLEGRAPH_H__ -#include "hashtable.h" -#include #include +#include + +#include "hashtable.h" #include "config.h" #include "mymemory.h" +#include "stl-model.h" class Promise; class CycleNode; @@ -24,75 +26,107 @@ 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(); #if SUPPORT_MOD_ORDER_DUMP void dumpNodes(FILE *file) const; void dumpGraphToFile(const char *filename) const; + + void dot_print_node(FILE *file, const ModelAction *act); + template + void dot_print_edge(FILE *file, const T *from, const U *to, const char *prop); #endif + bool resolvePromise(const Promise *promise, ModelAction *writer); + SNAPSHOTALLOC private: + bool addNodeEdge(CycleNode *fromnode, CycleNode *tonode); void putNode(const ModelAction *act, CycleNode *node); - CycleNode * getNode(const ModelAction *); + 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); + HashTable *discovered; + ModelVector * queue; + /** @brief A table for mapping ModelActions to CycleNodes */ HashTable actionToNode; + /** @brief A table for mapping Promises to CycleNodes */ + HashTable promiseToNode; + #if SUPPORT_MOD_ORDER_DUMP - std::vector nodeList; + SnapVector nodeList; #endif bool checkReachable(const CycleNode *from, const CycleNode *to) const; /** @brief A flag: true if this graph contains cycles */ bool hasCycles; + /** @brief The previous value of CycleGraph::hasCycles, for rollback */ bool oldCycles; - bool hasRMWViolation; - bool oldRMWViolation; - - std::vector< CycleNode *, SnapshotAlloc > rollbackvector; - std::vector< CycleNode *, SnapshotAlloc > rmwrollbackvector; + SnapVector rollbackvector; + SnapVector 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; + SnapVector edges; /** @brief The edges leading into this node */ - std::vector< CycleNode *, SnapshotAlloc > back_edges; + SnapVector back_edges; /** Pointer to a RMW node that reads from this node, or NULL, if none * exists */