2 * @brief Core model checker.
15 #include "libthreads.h"
18 #include "clockvector.h"
19 #include "hashtable.h"
21 /* Forward declaration */
27 * Model checker parameter structure. Holds run-time configuration options for
33 /** @brief The central structure for model-checking */
36 ModelChecker(struct model_params params);
39 /** @returns the context for the main model-checking system thread */
40 ucontext_t * get_system_context() { return &system_context; }
42 /** Prints an execution summary with trace information. */
45 void add_thread(Thread *t);
46 void remove_thread(Thread *t);
47 Thread * get_thread(thread_id_t tid) { return thread_map->get(id_to_int(tid)); }
49 thread_id_t get_next_id();
50 int get_num_threads();
51 modelclock_t get_next_seq_num();
53 /** @return The currently executing Thread. */
54 Thread * get_current_thread() { return scheduler->get_current_thread(); }
57 int switch_to_master(ModelAction *act);
58 ClockVector * get_cv(thread_id_t tid);
59 ModelAction * get_parent_action(thread_id_t tid);
60 bool next_execution();
62 bool isfinalfeasible();
63 void check_promises(ClockVector *old_cv, ClockVector * merge_cv);
64 void get_release_seq_heads(ModelAction *act,
65 std::vector<const ModelAction *> *release_heads);
67 void finish_execution();
68 bool isfeasibleprefix();
72 /** The scheduler to use: tracks the running/ready Threads */
76 modelclock_t used_sequence_numbers;
79 const model_params params;
82 * Stores the ModelAction for the current thread action. Call this
83 * immediately before switching from user- to system-context to pass
85 * @param act The ModelAction created by the user-thread action
87 void set_current_action(ModelAction *act) { current_action = act; }
88 Thread * check_current_action(ModelAction *curr);
92 ModelAction * get_last_conflict(ModelAction *act);
93 void set_backtracking(ModelAction *act);
94 Thread * get_next_replay_thread();
95 ModelAction * get_next_backtrack();
96 void reset_to_initial_state();
97 bool resolve_promises(ModelAction *curr);
98 void compute_promises(ModelAction *curr);
100 void add_action_to_lists(ModelAction *act);
101 ModelAction * get_last_action(thread_id_t tid);
102 ModelAction * get_last_seq_cst(const void *location);
103 void build_reads_from_past(ModelAction *curr);
104 ModelAction * process_rmw(ModelAction *curr);
105 void post_r_modification_order(ModelAction *curr, const ModelAction *rf);
106 bool r_modification_order(ModelAction *curr, const ModelAction *rf);
107 bool w_modification_order(ModelAction *curr);
108 bool release_seq_head(const ModelAction *rf,
109 std::vector<const ModelAction *> *release_heads) const;
110 bool resolve_release_sequences(void *location);
112 ModelAction *current_action;
113 ModelAction *diverge;
116 ucontext_t system_context;
117 action_list_t *action_trace;
118 HashTable<int, Thread *, int> *thread_map;
120 /** Per-object list of actions. Maps an object (i.e., memory location)
121 * to a trace of all actions performed on the object. */
122 HashTable<const void *, action_list_t, uintptr_t, 4> *obj_map;
124 HashTable<void *, std::vector<action_list_t>, uintptr_t, 4 > *obj_thrd_map;
125 std::vector<Promise *> *promises;
128 * Collection of lists of objects that might synchronize with one or
129 * more release sequence. Release sequences might be determined lazily
130 * as promises are fulfilled and modification orders are established.
131 * This structure maps its lists by object location. Each ModelAction
132 * in the lists should be an acquire operation.
134 HashTable<void *, std::list<ModelAction *>, uintptr_t, 4> *lazy_sync_with_release;
136 std::vector<ModelAction *> *thrd_last_action;
137 NodeStack *node_stack;
138 ModelAction *next_backtrack;
141 * @brief The modification order graph
143 * A direceted acyclic graph recording observations of the modification
144 * order on all the atomic objects in the system. This graph should
145 * never contain any cycles, as that represents a violation of the
146 * memory model (total ordering). This graph really consists of many
147 * disjoint (unconnected) subgraphs, each graph corresponding to a
148 * separate ordering on a distinct object.
150 * The edges in this graph represent the "ordered before" relation,
151 * such that <tt>a --> b</tt> means <tt>a</tt> was ordered before
154 CycleGraph *mo_graph;
159 extern ModelChecker *model;
161 #endif /* __MODEL_H__ */