X-Git-Url: http://plrg.eecs.uci.edu/git/?p=model-checker.git;a=blobdiff_plain;f=nodestack.h;h=47c72678aa13cffb9294e6a7d842860136e37baf;hp=c09b628b4ffc9a8f91a7997f628f3234c1e6b7df;hb=6c69f716484f7a5acee72e0f02813fb98f4ac2ad;hpb=b81be9611238c9485f1912fa1e9cab26b5df6fb6 diff --git a/nodestack.h b/nodestack.h index c09b628..47c7267 100644 --- a/nodestack.h +++ b/nodestack.h @@ -5,15 +5,38 @@ #ifndef __NODESTACK_H__ #define __NODESTACK_H__ -#include #include #include -#include "threads.h" +#include + #include "mymemory.h" +#include "schedule.h" +#include "promise.h" class ModelAction; +class Thread; + +/** + * A flag used for the promise counting/combination problem within a node, + * denoting whether a particular Promise is + *
  1. @b applicable: can be satisfied by this Node's ModelAction and
    2. + *
  2. @b fulfilled: satisfied by this Node's ModelAction under the current + * configuration.
+ */ -typedef std::list< const ModelAction *, MyAlloc< const ModelAction * > > readfrom_set_t; +#define PROMISE_IGNORE 0 /**< This promise is inapplicable; ignore it */ +#define PROMISE_UNFULFILLED 1 /**< This promise is applicable but unfulfilled */ +#define PROMISE_FULFILLED 2 /**< This promise is applicable and fulfilled */ +#define PROMISE_MASK 0xf +#define PROMISE_RMW 0x10 + +typedef int promise_t; + +struct fairness_info { + unsigned int enabled_count; + unsigned int turns; + bool priority; +}; /** * @brief A single node in a NodeStack @@ -26,45 +49,90 @@ typedef std::list< const ModelAction *, MyAlloc< const ModelAction * > > readfro */ class Node { public: - Node(ModelAction *act = NULL, Node *par = NULL, int nthreads = 1); + Node(ModelAction *act, Node *par, int nthreads, Node *prevfairness); ~Node(); /* return true = thread choice has already been explored */ - bool has_been_explored(thread_id_t tid); + bool has_been_explored(thread_id_t tid) const; /* return true = backtrack set is empty */ - bool backtrack_empty(); - void explore_child(ModelAction *act); + bool backtrack_empty() const; + + void explore_child(ModelAction *act, enabled_type_t *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); - ModelAction * get_action() { return action; } + bool is_enabled(Thread *t) const; + bool is_enabled(thread_id_t tid) const; + enabled_type_t enabled_status(thread_id_t tid) const; + ModelAction * get_action() const { return action; } + bool has_priority(thread_id_t tid) const; + int get_num_threads() const { 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; } - void add_read_from(const ModelAction *act); + bool add_future_value(struct future_value& fv); + struct future_value get_future_value() const; + bool increment_future_value(); + bool future_value_empty() const; - void print(); + void add_read_from(const ModelAction *act); + const ModelAction * get_read_from() const; + bool increment_read_from(); + bool read_from_empty() const; + int get_read_from_size() const; + const ModelAction * get_read_from_at(int i) const; + + void set_promise(unsigned int i, bool is_rmw); + bool get_promise(unsigned int i) const; + bool increment_promise(); + bool promise_empty() const; + enabled_type_t *get_enabled_array() {return enabled_array;} + + void set_misc_max(int i); + int get_misc() const; + bool increment_misc(); + bool misc_empty() const; + + void add_relseq_break(const ModelAction *write); + const ModelAction * get_relseq_break() const; + bool increment_relseq_break(); + bool relseq_break_empty() const; + + void print() const; void print_may_read_from(); MEMALLOC private: void explore(thread_id_t tid); - ModelAction *action; - Node *parent; - int num_threads; - std::vector< bool, MyAlloc > explored_children; - std::vector< bool, MyAlloc > backtrack; + ModelAction * const action; + Node * const parent; + const int num_threads; + std::vector< bool, ModelAlloc > explored_children; + std::vector< bool, ModelAlloc > backtrack; + std::vector< struct fairness_info, ModelAlloc< struct fairness_info> > fairness; int numBacktracks; + enabled_type_t *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. */ - readfrom_set_t may_read_from; + std::vector< const ModelAction *, ModelAlloc< const ModelAction * > > may_read_from; + + unsigned int read_from_index; + + std::vector< struct future_value, ModelAlloc > future_values; + std::vector< promise_t, ModelAlloc > promises; + int future_index; + + std::vector< const ModelAction *, ModelAlloc > relseq_break_writes; + int relseq_break_index; + + int misc_index; + int misc_max; }; -typedef std::list< Node *, MyAlloc< Node * > > node_list_t; +typedef std::vector< Node *, ModelAlloc< Node * > > node_list_t; /** * @brief A stack of nodes @@ -78,19 +146,26 @@ class NodeStack { public: NodeStack(); ~NodeStack(); - ModelAction * explore_action(ModelAction *act); - Node * get_head(); - Node * get_next(); + ModelAction * explore_action(ModelAction *act, enabled_type_t * is_enabled); + Node * get_head() const; + Node * get_next() const; void reset_execution(); - + void pop_restofstack(int numAhead); int get_total_nodes() { return total_nodes; } - void print(); + void print() const; MEMALLOC private: node_list_t node_list; - node_list_t::iterator iter; + + /** + * @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; int total_nodes; };