- void check_curr_backtracking(ModelAction *curr);
- void add_action_to_lists(ModelAction *act);
- ModelAction * get_last_fence_release(thread_id_t tid) const;
- ModelAction * get_last_seq_cst_write(ModelAction *curr) const;
- ModelAction * get_last_seq_cst_fence(thread_id_t tid, const ModelAction *before_fence) const;
- ModelAction * get_last_unlock(ModelAction *curr) const;
- void build_may_read_from(ModelAction *curr);
- ModelAction * process_rmw(ModelAction *curr);
-
- template <typename rf_type>
- bool r_modification_order(ModelAction *curr, const rf_type *rf);
-
- bool w_modification_order(ModelAction *curr, ModelVector<ModelAction *> *send_fv);
- void get_release_seq_heads(ModelAction *acquire, ModelAction *read, rel_heads_list_t *release_heads);
- 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 add_future_value(const ModelAction *writer, ModelAction *reader);
-
- ModelAction * get_uninitialized_action(const ModelAction *curr) const;
-
- ModelAction *diverge;
- ModelAction *earliest_diverge;
-
- ucontext_t system_context;
- action_list_t * const action_trace;
- HashTable<int, Thread *, int> * const 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> * const 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> * const condvar_waiters_map;
-
- HashTable<void *, SnapVector<action_list_t> *, uintptr_t, 4 > * const obj_thrd_map;
- SnapVector<Promise *> * const promises;
- SnapVector<struct PendingFutureValue> * const 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.
- */
- SnapVector<struct release_seq *> * const pending_rel_seqs;
-
- SnapVector<ModelAction *> * const thrd_last_action;
- SnapVector<ModelAction *> * const thrd_last_fence_release;
- NodeStack * const node_stack;
- ModelVector<TraceAnalysis *> * trace_analyses;
-
-
- /** Private data members that should be snapshotted. They are grouped
- * together for efficiency and maintainability. */
- struct model_snapshot_members * const 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 * const mo_graph;