X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;f=model.h;h=0701d467d21f12eeedcad6e88787103b33966e97;hb=c7f10b7c489c0c186bfe34dd1d87ae8b89d501ff;hp=3d3eba78db81ee8a2904c1e14ed37102e4c4a930;hpb=65a0c0d8d991b2775d15934b07cb51b422a5d20b;p=model-checker.git diff --git a/model.h b/model.h index 3d3eba7..0701d46 100644 --- a/model.h +++ b/model.h @@ -24,6 +24,9 @@ class NodeStack; class CycleGraph; class Promise; +/** @brief Shorthand for a list of release sequence heads */ +typedef std::vector< const ModelAction *, MyAlloc > rel_heads_list_t; + /** * Model checker parameter structure. Holds run-time configuration options for * the model checker. @@ -31,6 +34,8 @@ class Promise; struct model_params { int maxreads; int maxfuturedelay; + unsigned int fairwindow; + unsigned int enabledcount; }; struct PendingFutureValue { @@ -85,11 +90,11 @@ public: bool isfeasibleotherthanRMW(); bool isfinalfeasible(); void check_promises(ClockVector *old_cv, ClockVector * merge_cv); - void get_release_seq_heads(ModelAction *act, - std::vector< const ModelAction *, MyAlloc > *release_heads); + void get_release_seq_heads(ModelAction *act, rel_heads_list_t *release_heads); void finish_execution(); bool isfeasibleprefix(); void set_assert() {asserted=true;} + const model_params params; MEMALLOC private: @@ -100,8 +105,8 @@ private: bool has_asserted() {return asserted;} void reset_asserted() {asserted=false;} int num_executions; + int num_feasible_executions; bool promises_expired(); - const model_params params; /** * Stores the ModelAction for the current thread action. Call this @@ -111,12 +116,15 @@ private: */ void set_current_action(ModelAction *act) { priv->current_action = act; } Thread * check_current_action(ModelAction *curr); + ModelAction * initialize_curr_action(ModelAction *curr); bool process_read(ModelAction *curr, bool second_part_of_rmw); bool process_write(ModelAction *curr); + void process_mutex(ModelAction *curr); + bool check_action_enabled(ModelAction *curr); bool take_step(); - void check_recency(ModelAction *curr, bool already_added); + void check_recency(ModelAction *curr); ModelAction * get_last_conflict(ModelAction *act); void set_backtracking(ModelAction *act); Thread * get_next_thread(ModelAction *curr); @@ -127,16 +135,17 @@ private: void check_curr_backtracking(ModelAction * curr); void add_action_to_lists(ModelAction *act); - ModelAction * get_last_action(thread_id_t tid); - ModelAction * get_last_seq_cst(const void *location); + ModelAction * get_last_action(thread_id_t tid) const; + ModelAction * get_last_seq_cst(ModelAction *curr) const; + ModelAction * get_last_unlock(ModelAction *curr) const; void build_reads_from_past(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< const ModelAction *, MyAlloc > *release_heads) const; + bool release_seq_head(const ModelAction *rf, rel_heads_list_t *release_heads) const; bool resolve_release_sequences(void *location, work_queue_t *work_queue); + void do_complete_join(ModelAction *join); ModelAction *diverge; @@ -148,6 +157,10 @@ private: * to a trace of all actions performed on the object. */ HashTable *obj_map; + /** Per-object list of actions. Maps an object (i.e., memory location) + * to a trace of all actions performed on the object. */ + HashTable *lock_waiters_map; + HashTable, uintptr_t, 4 > *obj_thrd_map; std::vector *promises; std::vector *futurevalues; @@ -159,7 +172,7 @@ private: * 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; + HashTable *lazy_sync_with_release; /** * Represents the total size of the