SNAPSHOTALLOC
private:
+ void putNode(const ModelAction *act, CycleNode *node);
CycleNode * getNode(const ModelAction *);
- HashTable<CycleNode *, CycleNode *, uintptr_t, 4, model_malloc, model_calloc, model_free> *discovered;
+ 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;
std::vector<CycleNode *> 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 addEdge(CycleNode *node);
CycleNode * getEdge(unsigned int i) const;
unsigned int getNumEdges() const;
+ CycleNode * getBackEdge(unsigned int i) const;
+ unsigned int getNumBackEdges() const;
bool setRMW(CycleNode *);
CycleNode * getRMW() const;
const ModelAction * getAction() const { return action; }
/** @brief The edges leading out from this node */
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;