X-Git-Url: http://plrg.eecs.uci.edu/git/?p=c11tester.git;a=blobdiff_plain;f=nodestack.h;h=7402aa57d107aac938faab66ea13782ffaff3609;hp=3262a569d0e5da24689c46c706752a3b718c9a69;hb=f8bac60ca108ab3d7729c0254ff80819e6d8c121;hpb=15190694fd79202132be5f6e056fa5c00893664e

diff --git a/nodestack.h b/nodestack.h
index 3262a569..7402aa57 100644
--- a/nodestack.h
+++ b/nodestack.h
@@ -32,6 +32,12 @@ struct future_value {
 	modelclock_t expiration;
 };
 
+struct fairness_info {
+	unsigned int enabled_count;
+	unsigned int turns;
+	bool priority;
+};
+
 
 /**
  * @brief A single node in a NodeStack
@@ -44,20 +50,22 @@ struct future_value {
  */
 class Node {
 public:
-	Node(ModelAction *act = NULL, Node *par = NULL, int nthreads = 1, bool *enabled_array = NULL);
+	Node(ModelAction *act = NULL, Node *par = NULL, int nthreads = 1, Node *prevfairness = NULL);
 	~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);
+	void explore_child(ModelAction *act, bool * is_enabled);
 	/* 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);
+	bool is_enabled(thread_id_t tid);
 	ModelAction * get_action() { return action; }
-
+	bool has_priority(thread_id_t tid) {return fairness[id_to_int(tid)].priority;}
+	int get_num_threads() {return num_threads;}
 	/** @return the parent Node to this Node; that is, the action that
 	 * occurred previously in the stack. */
 	Node * get_parent() const { return parent; }
@@ -92,6 +100,7 @@ private:
 	int num_threads;
 	std::vector< bool, MyAlloc<bool> > explored_children;
 	std::vector< bool, MyAlloc<bool> > backtrack;
+	std::vector< struct fairness_info, MyAlloc< struct fairness_info> > fairness;
 	int numBacktracks;
 	bool *enabled_array;
 
@@ -103,10 +112,10 @@ private:
 
 	std::vector< struct future_value, MyAlloc<struct future_value> > future_values;
 	std::vector< promise_t, MyAlloc<promise_t> > promises;
-	unsigned int future_index;
+	int future_index;
 };
 
-typedef std::list< Node *, MyAlloc< Node * > > node_list_t;
+typedef std::vector< Node *, MyAlloc< Node * > > node_list_t;
 
 /**
  * @brief A stack of nodes
@@ -132,7 +141,7 @@ public:
 	MEMALLOC
 private:
 	node_list_t node_list;
-	node_list_t::iterator iter;
+	unsigned int iter;
 
 	int total_nodes;
 };