X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;f=nodestack.h;h=8ad329eeaf04f09eb4037c6d9dc6931e8cc1524a;hb=e6789461057e3395ba78575b85c114b553f4ed19;hp=bd64c4aa859d64f7a2eddcf9282ac9fbb5b1ed16;hpb=9fd8ac15f03e8ca01a20563e06c44b8b93090892;p=c11tester.git diff --git a/nodestack.h b/nodestack.h index bd64c4aa..8ad329ee 100644 --- a/nodestack.h +++ b/nodestack.h @@ -1,61 +1,204 @@ +/** @file nodestack.h + * @brief Stack of operations for use in backtracking. +*/ + #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; + +struct fairness_info { + unsigned int enabled_count; + unsigned int turns; + bool priority; +}; + +typedef enum { + READ_FROM_PAST, + READ_FROM_PROMISE, + READ_FROM_FUTURE, + READ_FROM_NONE, +} read_from_type_t; + +#define YIELD_E 1 +#define YIELD_D 2 +#define YIELD_S 4 +#define YIELD_P 8 +#define YIELD_INDEX(tid1, tid2, num_threads) (tid1*num_threads+tid2) + +/** + * @brief A single node in a NodeStack + * + * Represents a single node in the NodeStack. Each Node is associated with up + * to one action and up to one parent node. A node holds information + * regarding the last action performed (the "associated action"), the thread + * choices that have been explored (explored_children) and should be explored + * (backtrack), and the actions that the last action may read from. + */ class Node { public: - Node(ModelAction *act = NULL, Node *parent = NULL); + 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 clear_backtracking(); + 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; } + void set_uninit_action(ModelAction *act) { uninit_action = act; } + ModelAction * get_uninit_action() const { return uninit_action; } + + bool has_priority(thread_id_t tid) const; + void update_yield(Scheduler *); + bool has_priority_over(thread_id_t tid, thread_id_t tid2) 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; } + + read_from_type_t get_read_from_status(); + bool increment_read_from(); + bool read_from_empty() const; + unsigned int read_from_size() const; + + void print_read_from_past(); + void add_read_from_past(const ModelAction *act); + const ModelAction * get_read_from_past() const; + const ModelAction * get_read_from_past(int i) const; + int get_read_from_past_size() const; + + void add_read_from_promise(const ModelAction *reader); + Promise * get_read_from_promise() const; + Promise * get_read_from_promise(int i) const; + int get_read_from_promise_size() const; + + bool add_future_value(struct future_value fv); + struct future_value get_future_value() const; - void print(); + void set_promise(unsigned int i); + bool get_promise(unsigned int i) const; + bool increment_promise(); + bool promise_empty() const; + void clear_promise_resolutions(); - static int get_total_nodes() { return total_nodes; } + 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; MEMALLOC private: void explore(thread_id_t tid); + int get_yield_data(int tid1, int tid2) const; + bool read_from_past_empty() const; + bool increment_read_from_past(); + bool read_from_promise_empty() const; + bool increment_read_from_promise(); + bool future_value_empty() const; + bool increment_future_value(); + read_from_type_t read_from_status; + + ModelAction * const action; + + /** @brief ATOMIC_UNINIT action which was created at this Node */ + ModelAction *uninit_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 past ModelActions that this the action at this Node may + * read from. Only meaningful if this Node represents a 'read' action. + */ + std::vector< const ModelAction *, ModelAlloc< const ModelAction * > > read_from_past; + unsigned int read_from_past_idx; - static int total_nodes; - ModelAction *action; - int num_threads; - std::vector explored_children; - std::vector backtrack; + std::vector< const ModelAction *, ModelAlloc > read_from_promises; + int read_from_promise_idx; + + std::vector< struct future_value, ModelAlloc > future_values; + int future_index; + + std::vector< bool, ModelAlloc > resolve_promise; + int resolve_promise_idx; + + std::vector< const ModelAction *, ModelAlloc > relseq_break_writes; + int relseq_break_index; + + int misc_index; + int misc_max; + int * yield_data; }; -typedef std::list > node_list_t; +typedef std::vector< Node *, ModelAlloc< Node * > > node_list_t; +/** + * @brief A stack of nodes + * + * Holds a Node linked-list that can be used for holding backtracking, + * may-read-from, and replay information. It is used primarily as a + * stack-like structure, in that backtracking points and replay nodes are + * only removed from the top (most recent). + */ 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; }; #endif /* __NODESTACK_H__ */