- CycleNode * getNode(ModelAction *);
- HashTable<class ModelAction *, class CycleNode *, uintptr_t, 4> actionToNode;
- bool checkReachable(CycleNode *from, CycleNode *to);
-
+ void putNode(const ModelAction *act, CycleNode *node);
+ CycleNode * getNode(const ModelAction *);
+ HashTable<CycleNode *, 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;
+#if SUPPORT_MOD_ORDER_DUMP
+ std::vector<CycleNode *> nodeList;
+#endif
+
+ bool checkReachable(CycleNode *from, CycleNode *to) const;
+
+ /** @brief A flag: true if this graph contains cycles */