+ /** The scheduler to use: tracks the running/ready Threads */
+ Scheduler *scheduler;
+
+ bool sleep_can_read_from(ModelAction * curr, const ModelAction *write);
+ bool thin_air_constraint_may_allow(const ModelAction * writer, const ModelAction *reader);
+ bool mo_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();
+ void execute_sleep_set();
+ void wake_up_sleeping_actions(ModelAction * curr);
+ modelclock_t get_next_seq_num();
+
+ /**
+ * 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) { 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);
+ bool process_mutex(ModelAction *curr);
+ bool process_thread_action(ModelAction *curr);
+ void process_relseq_fixup(ModelAction *curr, work_queue_t *work_queue);
+ bool check_action_enabled(ModelAction *curr);
+
+ bool take_step();
+
+ 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);
+ ModelAction * get_next_backtrack();
+ void reset_to_initial_state();
+ bool resolve_promises(ModelAction *curr);
+ void compute_promises(ModelAction *curr);
+ void compute_relseq_breakwrites(ModelAction *curr);
+
+ void check_curr_backtracking(ModelAction * curr);
+ void add_action_to_lists(ModelAction *act);
+ 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_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);
+
+ ModelAction *diverge;
+ ModelAction *earliest_diverge;
+
+ 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;
+
+ /** 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> *lock_waiters_map;
+
+ HashTable<void *, std::vector<action_list_t>, uintptr_t, 4 > *obj_thrd_map;
+ std::vector< Promise *, SnapshotAlloc<Promise *> > *promises;
+ std::vector< struct PendingFutureValue, SnapshotAlloc<struct PendingFutureValue> > *futurevalues;
+
+ /**
+ * 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< struct release_seq *, SnapshotAlloc<struct release_seq *> > *pending_rel_seqs;
+
+ std::vector< ModelAction *, SnapshotAlloc<ModelAction *> > *thrd_last_action;
+ NodeStack *node_stack;
+
+ /** Private data members that should be snapshotted. They are grouped
+ * together for efficiency and maintainability. */
+ struct model_snapshot_members *priv;
+
+ /** A special model-checker Thread; used for associating with
+ * model-checker-related ModelAcitons */
+ Thread *model_thread;
+
+ /**
+ * @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 <tt>a --> b</tt> means <tt>a</tt> was ordered before
+ * <tt>b</tt>.
+ */
+ CycleGraph *mo_graph;
+ bool failed_promise;
+ bool too_many_reads;
+ bool asserted;
+ /** @brief Incorrectly-ordered synchronization was made */
+ bool bad_synchronization;