X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=nodestack.h;h=fca063e7a4f86c2462f75a01f006d9c911487a26;hb=f8990cc12e0a21702f9af0b017518fba0b279668;hp=b391645b3af7a458e9271fc1bd60d762c5935605;hpb=fa47e498d6eb6a97d25bc255df1c08bf66bc4c40;p=model-checker.git

diff --git a/nodestack.h b/nodestack.h
index b391645..fca063e 100644
--- a/nodestack.h
+++ b/nodestack.h
@@ -8,10 +8,13 @@
 #include <list>
 #include <vector>
 #include <cstddef>
-#include "threads.h"
+#include <inttypes.h>
+
 #include "mymemory.h"
+#include "modeltypes.h"
 
 class ModelAction;
+class Thread;
 
 /**
  * A flag used for the promise counting/combination problem within a node,
@@ -26,6 +29,18 @@ typedef enum {
 	PROMISE_FULFILLED /**< This promise is applicable and fulfilled */
 } promise_t;
 
+struct future_value {
+	uint64_t value;
+	modelclock_t expiration;
+};
+
+struct fairness_info {
+	unsigned int enabled_count;
+	unsigned int turns;
+	bool priority;
+};
+
+
 /**
  * @brief A single node in a NodeStack
  *
@@ -37,26 +52,29 @@ typedef enum {
  */
 class Node {
 public:
-	Node(ModelAction *act = NULL, Node *par = NULL, int nthreads = 1);
+	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);
+	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; }
 
-	bool add_future_value(uint64_t value);
+	bool add_future_value(uint64_t value, modelclock_t expiration);
 	uint64_t get_future_value();
+	modelclock_t get_future_value_expiration();
 	bool increment_future_value();
 	bool future_value_empty();
 
@@ -82,22 +100,24 @@ private:
 	ModelAction *action;
 	Node *parent;
 	int num_threads;
-	std::vector< bool, MyAlloc<bool> > explored_children;
-	std::vector< bool, MyAlloc<bool> > backtrack;
+	std::vector< bool, ModelAlloc<bool> > explored_children;
+	std::vector< bool, ModelAlloc<bool> > backtrack;
+	std::vector< struct fairness_info, ModelAlloc< struct fairness_info> > fairness;
 	int numBacktracks;
+	bool *enabled_array;
 
 	/** The set of ModelActions that this the action at this Node may read
 	 *  from. Only meaningful if this Node represents a 'read' action. */
-	std::vector< const ModelAction *, MyAlloc< const ModelAction * > > may_read_from;
+	std::vector< const ModelAction *, ModelAlloc< const ModelAction * > > may_read_from;
 
 	unsigned int read_from_index;
 
-	std::vector< uint64_t, MyAlloc< uint64_t > > future_values;
-	std::vector< promise_t, MyAlloc<promise_t> > promises;
-	unsigned int future_index;
+	std::vector< struct future_value, ModelAlloc<struct future_value> > future_values;
+	std::vector< promise_t, ModelAlloc<promise_t> > promises;
+	int future_index;
 };
 
-typedef std::list< Node *, MyAlloc< Node * > > node_list_t;
+typedef std::vector< Node *, ModelAlloc< Node * > > node_list_t;
 
 /**
  * @brief A stack of nodes
@@ -111,7 +131,7 @@ class NodeStack {
 public:
 	NodeStack();
 	~NodeStack();
-	ModelAction * explore_action(ModelAction *act);
+	ModelAction * explore_action(ModelAction *act, bool * is_enabled);
 	Node * get_head();
 	Node * get_next();
 	void reset_execution();
@@ -123,7 +143,7 @@ public:
 	MEMALLOC
 private:
 	node_list_t node_list;
-	node_list_t::iterator iter;
+	unsigned int iter;
 
 	int total_nodes;
 };