X-Git-Url: http://plrg.eecs.uci.edu/git/?p=c11tester.git;a=blobdiff_plain;f=model.h;h=4b9e3ff53f0082b30efd095b5618186480882d5e;hp=fec8d1f1ea55bf331017f9817515cae7e0d93c34;hb=939c3e18d1214e60cfc680244f8ab3e9bd5404af;hpb=9a416eb64865be1728786eb65b1c4b995cfa194d diff --git a/model.h b/model.h index fec8d1f1..4b9e3ff5 100644 --- a/model.h +++ b/model.h @@ -17,12 +17,16 @@ #include "action.h" #include "clockvector.h" #include "hashtable.h" +#include "workqueue.h" /* Forward declaration */ 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. @@ -30,6 +34,14 @@ class Promise; struct model_params { int maxreads; int maxfuturedelay; + unsigned int fairwindow; + unsigned int enabledcount; +}; + +struct PendingFutureValue { + uint64_t value; + modelclock_t expiration; + ModelAction * act; }; /** @@ -41,9 +53,6 @@ struct model_snapshot_members { 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 */ @@ -78,23 +87,28 @@ public: bool isfeasibleotherthanRMW(); bool isfinalfeasible(); void check_promises(ClockVector *old_cv, ClockVector * merge_cv); - void get_release_seq_heads(ModelAction *act, - std::vector *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;} + /** @brief Alert the model-checker that an incorrectly-ordered + * synchronization was made */ + void set_bad_synchronization() { bad_synchronization = true; } + + const model_params params; + MEMALLOC private: /** The scheduler to use: tracks the running/ready Threads */ Scheduler *scheduler; - + bool thin_air_constraint_may_allow(const ModelAction * writer, const ModelAction *reader); 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 @@ -104,11 +118,16 @@ private: */ 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); + ModelAction * initialize_curr_action(ModelAction *curr); + bool process_read(ModelAction *curr, bool second_part_of_rmw); + bool process_write(ModelAction *curr); + bool process_mutex(ModelAction *curr); + bool process_thread_action(ModelAction *curr); + bool check_action_enabled(ModelAction *curr); bool take_step(); - void check_recency(ModelAction *curr, bool already_added); + void check_recency(ModelAction *curr, const ModelAction *rf); ModelAction * get_last_conflict(ModelAction *act); void set_backtracking(ModelAction *act); Thread * get_next_thread(ModelAction *curr); @@ -117,19 +136,19 @@ private: bool resolve_promises(ModelAction *curr); void compute_promises(ModelAction *curr); - 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 *release_heads) const; - bool resolve_release_sequences(void *location); + 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; @@ -141,25 +160,21 @@ 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; /** - * 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 + * List of acquire actions that might synchronize with one or more + * release sequence. Release sequences might be determined lazily as + * promises are fulfilled and modification orders are established. Each + * ModelAction in this list must be an acquire operation. */ - unsigned int *lazy_sync_size; + std::vector *pending_acq_rel_seq; std::vector *thrd_last_action; NodeStack *node_stack; @@ -186,6 +201,8 @@ private: bool failed_promise; bool too_many_reads; bool asserted; + /** @brief Incorrectly-ordered synchronization was made */ + bool bad_synchronization; }; extern ModelChecker *model;