+/** @brief The central structure for model-checking */
+class ModelChecker {
+public:
+ ModelChecker(struct model_params params);
+ ~ModelChecker();
+
+ /** @returns the context for the main model-checking system thread */
+ ucontext_t * get_system_context() { return &system_context; }
+
+ /** Prints an execution summary with trace information. */
+ void print_summary();
+
+ Thread * schedule_next_thread();
+
+ 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_id_t get_next_id();
+ int get_num_threads();
+ modelclock_t get_next_seq_num();
+
+ /** @return The currently executing Thread. */
+ Thread * get_current_thread() { return scheduler->get_current_thread(); }
+
+ int switch_to_master(ModelAction *act);
+ ClockVector * get_cv(thread_id_t tid);
+ bool next_execution();
+ bool isfeasible();
+ bool isfinalfeasible();
+ void check_promises(ClockVector *old_cv, ClockVector * merge_cv);
+
+ void finish_execution();
+
+ MEMALLOC
+private:
+ /** The scheduler to use: tracks the running/ready Threads */
+ Scheduler *scheduler;
+
+ int next_thread_id;
+ modelclock_t used_sequence_numbers;
+ int num_executions;
+
+ const model_params params;
+
+ /**
+ * Stores the ModelAction for the current thread action. Call this
+ * immediately before switching from user- to system-context to pass
+ * data between them.
+ * @param act The ModelAction created by the user-thread action
+ */
+ void set_current_action(ModelAction *act) { current_action = act; }
+ void check_current_action();
+
+ bool take_step();
+
+ ModelAction * get_last_conflict(ModelAction *act);
+ void set_backtracking(ModelAction *act);
+ thread_id_t get_next_replay_thread();
+ ModelAction * get_next_backtrack();
+ void reset_to_initial_state();
+ void 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 *current_action;
+ ModelAction *diverge;
+ thread_id_t nextThread;
+
+ ucontext_t system_context;
+ action_list_t *action_trace;
+ HashTable<int, Thread *, int> *thread_map;
+
+ /** Per-object list of actions. Maps an object (i.e., memory location)
+ * to a trace of all actions performed on the object. */
+ HashTable<const void *, action_list_t, uintptr_t, 4> *obj_map;
+
+ HashTable<void *, std::vector<action_list_t>, uintptr_t, 4 > *obj_thrd_map;
+ std::vector<Promise *> * promises;
+ std::vector<ModelAction *> *thrd_last_action;
+ NodeStack *node_stack;
+ ModelAction *next_backtrack;
+
+ /**
+ * @brief The modification order graph
+ *
+ * A direceted 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.
+ *
+ * Note that the edges in this graph actually represent the "ordered
+ * after" relation, such that <tt>a --> b</tt> means <tt>a</tt> was
+ * ordered after <tt>b</tt>, or in the traditional sense of
+ * modification order, <tt>b --mo--> a</tt>.
+ */
+ CycleGraph *mo_graph;
+
+ bool failed_promise;
+};