X-Git-Url: http://plrg.eecs.uci.edu/git/?p=model-checker.git;a=blobdiff_plain;f=nodestack.h;h=1f7d3e4ad3fee660027e974261b8083b3a99e0c3;hp=68604675cec7363f29864b10c98e5a4788add85c;hb=939c3e18d1214e60cfc680244f8ab3e9bd5404af;hpb=061b34a5d84d00df340550d75f664be5e174276c

diff --git a/nodestack.h b/nodestack.h
index 6860467..1f7d3e4 100644
--- a/nodestack.h
+++ b/nodestack.h
@@ -10,9 +10,35 @@
 #include <cstddef>
 #include "threads.h"
 #include "mymemory.h"
+#include "clockvector.h"
 
 class ModelAction;
 
+/**
+ * A flag used for the promise counting/combination problem within a node,
+ * denoting whether a particular Promise is
+ * <ol><li>@b applicable: can be satisfied by this Node's ModelAction and</li>
+ * <li>@b fulfilled: satisfied by this Node's ModelAction under the current
+ * configuration.</li></ol>
+ */
+typedef enum {
+	PROMISE_IGNORE = 0, /**< This promise is inapplicable; ignore it */
+	PROMISE_UNFULFILLED, /**< This promise is applicable but unfulfilled */
+	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
  *
@@ -24,26 +50,29 @@ class ModelAction;
  */
 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) {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; }
 
-	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();
 
@@ -51,6 +80,8 @@ public:
 	const ModelAction * get_read_from();
 	bool increment_read_from();
 	bool read_from_empty();
+	int get_read_from_size();
+	const ModelAction * get_read_from_at(int i);
 
 	void set_promise(unsigned int i);
 	bool get_promise(unsigned int i);
@@ -69,7 +100,9 @@ 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;
 
 	/** The set of ModelActions that this the action at this Node may read
 	 *  from. Only meaningful if this Node represents a 'read' action. */
@@ -77,12 +110,12 @@ private:
 
 	unsigned int read_from_index;
 
-	std::vector< uint64_t, MyAlloc< uint64_t > > future_values;
-	std::vector< unsigned int, MyAlloc<unsigned int> > promises;
+	std::vector< struct future_value, MyAlloc<struct future_value> > future_values;
+	std::vector< promise_t, MyAlloc<promise_t> > promises;
 	unsigned 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
@@ -96,7 +129,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();
@@ -108,7 +141,7 @@ public:
 	MEMALLOC
 private:
 	node_list_t node_list;
-	node_list_t::iterator iter;
+	unsigned int iter;
 
 	int total_nodes;
 };