X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=nodestack.h;h=7402aa57d107aac938faab66ea13782ffaff3609;hb=f94de5b6daa067501562ed3047bfb6b4939f9435;hp=6c9779497e71f96e0621b37e762fbb199bd0556c;hpb=1bc8782b55cab0503f1b64529f993f0b9e3a1846;p=model-checker.git diff --git a/nodestack.h b/nodestack.h index 6c97794..7402aa5 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); + 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,7 +100,9 @@ private: int num_threads; std::vector< bool, MyAlloc > explored_children; std::vector< bool, MyAlloc > 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. */ @@ -102,10 +112,10 @@ private: std::vector< struct future_value, MyAlloc > future_values; std::vector< promise_t, MyAlloc > 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 @@ -119,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(); @@ -131,7 +141,7 @@ public: MEMALLOC private: node_list_t node_list; - node_list_t::iterator iter; + unsigned int iter; int total_nodes; };