- 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;
- CycleGraph * cyclegraph;
- bool failed_promise;
+ 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;
+
+ /** 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;
+
+ /** @brief The cumulative execution stats */
+ struct execution_stats stats;
+ void record_stats();
+
+ void print_infeasibility(const char *prefix) const;
+ bool is_feasible_prefix_ignore_relseq() const;
+ bool is_infeasible() const;
+ bool is_deadlocked() const;
+ bool is_circular_wait(const Thread *t) const;
+ bool is_complete_execution() const;
+ bool have_bug_reports() const;
+ void print_bugs() const;
+ void print_execution(bool printbugs) const;
+ void print_stats() const;
+
+ friend void user_main_wrapper();