X-Git-Url: http://plrg.eecs.uci.edu/git/?p=model-checker.git;a=blobdiff_plain;f=model.h;h=d5dc42266769004d542d72f472f6e1029c1a7e5c;hp=8e57876dabf3950e9cd3378eb15d50085a044d73;hb=d4f6c8b91fb6c85bbb5d2ba3477c14fc10383c44;hpb=822674ef74d355637bc3ab2dda6fb63322a1f367 diff --git a/model.h b/model.h index 8e57876..d5dc422 100644 --- a/model.h +++ b/model.h @@ -10,20 +10,19 @@ #include #include -#include "schedule.h" #include "mymemory.h" -#include "libthreads.h" -#include "threads.h" #include "action.h" -#include "clockvector.h" #include "hashtable.h" #include "workqueue.h" #include "config.h" +#include "modeltypes.h" /* Forward declaration */ class NodeStack; class CycleGraph; class Promise; +class Scheduler; +class Thread; /** @brief Shorthand for a list of release sequence heads */ typedef std::vector< const ModelAction *, ModelAlloc > rel_heads_list_t; @@ -50,12 +49,25 @@ struct PendingFutureValue { */ struct model_snapshot_members { ModelAction *current_action; - int next_thread_id; + unsigned int next_thread_id; modelclock_t used_sequence_numbers; Thread *nextThread; ModelAction *next_backtrack; }; +/** @brief Records information regarding a single pending release sequence */ +struct release_seq { + /** @brief The acquire operation */ + ModelAction *acquire; + /** @brief The head of the RMW chain from which 'acquire' reads; may be + * equal to 'release' */ + const ModelAction *rf; + /** @brief The head of the potential longest release sequence chain */ + const ModelAction *release; + /** @brief The write(s) that may break the release sequence */ + std::vector writes; +}; + /** @brief The central structure for model-checking */ class ModelChecker { public: @@ -73,11 +85,11 @@ public: 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)); } - Thread * get_thread(ModelAction *act) { return get_thread(act->get_tid()); } + Thread * get_thread(thread_id_t tid) const; + Thread * get_thread(ModelAction *act) const; thread_id_t get_next_id(); - int get_num_threads(); + unsigned int get_num_threads(); Thread * get_current_thread(); int switch_to_master(ModelAction *act); @@ -87,7 +99,8 @@ public: bool isfeasible(); bool isfeasibleotherthanRMW(); bool isfinalfeasible(); - void check_promises(ClockVector *old_cv, ClockVector * merge_cv); + void mo_check_promises(thread_id_t tid, const ModelAction *write); + void check_promises(thread_id_t tid, ClockVector *old_cv, ClockVector * merge_cv); void get_release_seq_heads(ModelAction *act, rel_heads_list_t *release_heads); void finish_execution(); bool isfeasibleprefix(); @@ -98,6 +111,7 @@ public: void set_bad_synchronization() { bad_synchronization = true; } const model_params params; + Scheduler * get_scheduler() { return scheduler;} MEMALLOC private: @@ -149,7 +163,7 @@ private: 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, rel_heads_list_t *release_heads) const; + bool release_seq_heads(const ModelAction *rf, rel_heads_list_t *release_heads, struct release_seq *pending) const; bool resolve_release_sequences(void *location, work_queue_t *work_queue); void do_complete_join(ModelAction *join); @@ -173,12 +187,12 @@ private: std::vector *futurevalues; /** - * 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. + * List of pending release sequences. Release sequences might be + * determined lazily as promises are fulfilled and modification orders + * are established. Each entry in the list may only be partially + * filled, depending on its pending status. */ - std::vector *pending_acq_rel_seq; + std::vector *pending_rel_seqs; std::vector *thrd_last_action; NodeStack *node_stack;