X-Git-Url: http://plrg.eecs.uci.edu/git/?p=model-checker.git;a=blobdiff_plain;f=model.h;h=c3e5830211c9276ec7b5004504fbb9472df32069;hp=86e0b1e7b05a8174a05d8a3f28dc7132432962d5;hb=50b95c3747f4fe79b2ab1a1a6fc303224e16e418;hpb=0cb167b8fb332e4d9726badd0aa58e943bb4b459 diff --git a/model.h b/model.h index 86e0b1e..c3e5830 100644 --- a/model.h +++ b/model.h @@ -28,6 +28,21 @@ class Promise; * the model checker. */ struct model_params { + int maxreads; +}; + +/** + * Structure for holding small ModelChecker members that should be snapshotted + */ +struct model_snapshot_members { + ModelAction *current_action; + int next_thread_id; + modelclock_t used_sequence_numbers; + Thread *nextThread; + ModelAction *next_backtrack; + + /** @see ModelChecker::lazy_sync_size */ + unsigned int lazy_sync_size; }; /** @brief The central structure for model-checking */ @@ -36,23 +51,13 @@ public: ModelChecker(struct model_params params); ~ModelChecker(); - /** Stores the context for the main model-checking system thread (call - * once) - * @param ctxt The system context structure - */ - void set_system_context(ucontext_t *ctxt) { system_context = ctxt; } - /** @returns the context for the main model-checking system thread */ - ucontext_t * get_system_context(void) { return system_context; } - - void check_current_action(void); + ucontext_t * get_system_context() { return &system_context; } /** Prints an execution summary with trace information. */ void print_summary(); - Thread * schedule_next_thread(); - - int add_thread(Thread *t); + void add_thread(Thread *t); void remove_thread(Thread *t); Thread * get_thread(thread_id_t tid) { return thread_map->get(id_to_int(tid)); } @@ -65,20 +70,25 @@ public: int switch_to_master(ModelAction *act); ClockVector * get_cv(thread_id_t tid); + ModelAction * get_parent_action(thread_id_t tid); bool next_execution(); bool isfeasible(); bool isfinalfeasible(); void check_promises(ClockVector *old_cv, ClockVector * merge_cv); + void get_release_seq_heads(ModelAction *act, + std::vector *release_heads); void finish_execution(); + bool isfeasibleprefix(); + void set_assert() {asserted=true;} MEMALLOC private: /** The scheduler to use: tracks the running/ready Threads */ Scheduler *scheduler; - int next_thread_id; - modelclock_t used_sequence_numbers; + bool has_asserted() {return asserted;} + void reset_asserted() {asserted=false;} int num_executions; const model_params params; @@ -89,33 +99,36 @@ private: * data between them. * @param act The ModelAction created by the user-thread action */ - void set_current_action(ModelAction *act) { current_action = act; } + void set_current_action(ModelAction *act) { priv->current_action = act; } + Thread * check_current_action(ModelAction *curr); + bool process_read(ModelAction *curr, Thread * th, bool second_part_of_rmw); bool take_step(); + void check_recency(ModelAction *curr, bool already_added); ModelAction * get_last_conflict(ModelAction *act); void set_backtracking(ModelAction *act); - thread_id_t get_next_replay_thread(); + Thread * get_next_thread(ModelAction *curr); ModelAction * get_next_backtrack(); void reset_to_initial_state(); - void resolve_promises(ModelAction *curr); + bool resolve_promises(ModelAction *curr); void compute_promises(ModelAction *curr); void add_action_to_lists(ModelAction *act); ModelAction * get_last_action(thread_id_t tid); - ModelAction * get_parent_action(thread_id_t tid); ModelAction * get_last_seq_cst(const void *location); void build_reads_from_past(ModelAction *curr); - ModelAction * process_rmw(ModelAction * curr); - void post_r_modification_order(ModelAction * curr, const ModelAction *rf); - void r_modification_order(ModelAction * curr, const ModelAction *rf); - void w_modification_order(ModelAction * curr); + ModelAction * process_rmw(ModelAction *curr); + void post_r_modification_order(ModelAction *curr, const ModelAction *rf); + bool r_modification_order(ModelAction *curr, const ModelAction *rf); + bool w_modification_order(ModelAction *curr); + bool release_seq_head(const ModelAction *rf, + std::vector *release_heads) const; + bool resolve_release_sequences(void *location); - ModelAction *current_action; ModelAction *diverge; - thread_id_t nextThread; - ucontext_t *system_context; + ucontext_t system_context; action_list_t *action_trace; HashTable *thread_map; @@ -124,12 +137,50 @@ private: HashTable *obj_map; HashTable, uintptr_t, 4 > *obj_thrd_map; - std::vector * promises; + std::vector *promises; + + /** + * Collection of lists of objects that might synchronize with one or + * more release sequence. Release sequences might be determined lazily + * as promises are fulfilled and modification orders are established. + * This structure maps its lists by object location. Each ModelAction + * in the lists should be an acquire operation. + */ + HashTable, uintptr_t, 4> *lazy_sync_with_release; + + /** + * Represents the total size of the + * ModelChecker::lazy_sync_with_release lists. This count should be + * snapshotted, so it is actually a pointer to a location within + * ModelChecker::priv + */ + unsigned int *lazy_sync_size; + std::vector *thrd_last_action; NodeStack *node_stack; - ModelAction *next_backtrack; - CycleGraph * cyclegraph; + + /** Private data members that should be snapshotted. They are grouped + * together for efficiency and maintainability. */ + struct model_snapshot_members *priv; + + /** + * @brief The modification order graph + * + * A directed acyclic graph recording observations of the modification + * order on all the atomic objects in the system. This graph should + * never contain any cycles, as that represents a violation of the + * memory model (total ordering). This graph really consists of many + * disjoint (unconnected) subgraphs, each graph corresponding to a + * separate ordering on a distinct object. + * + * The edges in this graph represent the "ordered before" relation, + * such that a --> b means a was ordered before + * b. + */ + CycleGraph *mo_graph; bool failed_promise; + bool too_many_reads; + bool asserted; }; extern ModelChecker *model;