X-Git-Url: http://plrg.eecs.uci.edu/git/?p=c11tester.git;a=blobdiff_plain;f=nodestack.h;h=fa356d0e9ae666db61bb993423b7b915df2c815b;hp=d3eab13561149cb6ca89da2d1928332ead695e4a;hb=5881b6573197c0366e2380cf28f78189c3fde312;hpb=6d7624344faab763eb30f3a6424f51538b7292a5

diff --git a/nodestack.h b/nodestack.h
index d3eab135..fa356d0e 100644
--- a/nodestack.h
+++ b/nodestack.h
@@ -1,66 +1,83 @@
 /** @file nodestack.h
  *  @brief Stack of operations for use in backtracking.
-*/
+ */
 
 #ifndef __NODESTACK_H__
 #define __NODESTACK_H__
 
-#include <list>
-#include <vector>
 #include <cstddef>
-#include "threads.h"
-#include "mymemory.h"
+#include <inttypes.h>
 
-class ModelAction;
+#include "mymemory.h"
+#include "schedule.h"
+#include "stl-model.h"
+#include "classlist.h"
 
+/**
+ * @brief A single node in a NodeStack
+ *
+ * Represents a single node in the NodeStack. Each Node is associated with up
+ * to one action and up to one parent node. A node holds information
+ * regarding the last action performed (the "associated action"), the thread
+ * choices that have been explored (explored_children) and should be explored
+ * (backtrack), and the actions that the last action may read from.
+ */
 class Node {
 public:
-	Node(ModelAction *act = NULL, int nthreads = 1);
+	Node(ModelAction *act);
 	~Node();
-	/* return true = thread choice has already been explored */
-	bool has_been_explored(thread_id_t tid);
-	/* return true = backtrack set is empty */
-	bool backtrack_empty();
-	void explore_child(ModelAction *act);
-	/* return false = thread was already in backtrack */
-	bool set_backtrack(thread_id_t id);
-	thread_id_t get_next_backtrack();
-	bool is_enabled(Thread *t);
-	ModelAction * get_action() { return action; }
 
-	void print();
+	ModelAction * get_action() const { return action; }
+	void set_uninit_action(ModelAction *act) { uninit_action = act; }
+	ModelAction * get_uninit_action() const { return uninit_action; }
+	void print() const;
 
 	MEMALLOC
 private:
-	void explore(thread_id_t tid);
+	ModelAction * const action;
 
-	ModelAction *action;
-	int num_threads;
-	std::vector< bool, MyAlloc<bool> > explored_children;
-	std::vector< bool, MyAlloc<bool> > backtrack;
+	/** @brief ATOMIC_UNINIT action which was created at this Node */
+	ModelAction *uninit_action;
 };
 
-typedef std::list<class Node *, MyAlloc< class Node * > > node_list_t;
+typedef ModelVector<Node *> node_list_t;
 
+/**
+ * @brief A stack of nodes
+ *
+ * Holds a Node linked-list that can be used for holding backtracking,
+ * may-read-from, and replay information. It is used primarily as a
+ * stack-like structure, in that backtracking points and replay nodes are
+ * only removed from the top (most recent).
+ */
 class NodeStack {
 public:
 	NodeStack();
 	~NodeStack();
+
+	void register_engine(const ModelExecution *exec);
 	ModelAction * explore_action(ModelAction *act);
-	Node * get_head();
-	Node * get_next();
+	Node * get_head() const;
+	Node * get_next() const;
 	void reset_execution();
-
-	int get_total_nodes() { return total_nodes; }
-
-	void print();
+	void full_reset();
+	void print() const;
 
 	MEMALLOC
 private:
 	node_list_t node_list;
-	node_list_t::iterator iter;
+	const struct model_params * get_params() const;
+
+	/** @brief The model-checker execution object */
+	const ModelExecution *execution;
 
-	int total_nodes;
+	/**
+	 * @brief the index position of the current head Node
+	 *
+	 * This index is relative to node_list. The index should point to the
+	 * current head Node. It is negative when the list is empty.
+	 */
+	int head_idx;
 };
 
-#endif /* __NODESTACK_H__ */
+#endif	/* __NODESTACK_H__ */