* the model checker.
*/
struct model_params {
+ int maxreads;
+ int maxfuturedelay;
+};
+
+/**
+ * Structure for holding small ModelChecker members that should be snapshotted
+ */
+struct model_snapshot_members {
+ ModelAction *current_action;
+ int next_thread_id;
+ modelclock_t used_sequence_numbers;
+ Thread *nextThread;
+ ModelAction *next_backtrack;
+
+ /** @see ModelChecker::lazy_sync_size */
+ unsigned int lazy_sync_size;
};
/** @brief The central structure for model-checking */
/** 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 * get_thread(ModelAction *act) { return get_thread(act->get_tid()); }
thread_id_t get_next_id();
int get_num_threads();
int switch_to_master(ModelAction *act);
ClockVector * get_cv(thread_id_t tid);
+ ModelAction * get_parent_action(thread_id_t tid);
bool next_execution();
bool isfeasible();
+ bool isfeasibleotherthanRMW();
bool isfinalfeasible();
void check_promises(ClockVector *old_cv, ClockVector * merge_cv);
void get_release_seq_heads(ModelAction *act,
std::vector<const ModelAction *> *release_heads);
-
void finish_execution();
+ bool isfeasibleprefix();
+ void set_assert() {asserted=true;}
MEMALLOC
private:
/** The scheduler to use: tracks the running/ready Threads */
Scheduler *scheduler;
+
+ bool ensure_rmw_acyclic(const ModelAction * read, const ModelAction *write);
- int next_thread_id;
- modelclock_t used_sequence_numbers;
- int num_executions;
+ bool thin_air_constraint_may_allow(const ModelAction * writer, const ModelAction *reader);
+ bool has_asserted() {return asserted;}
+ void reset_asserted() {asserted=false;}
+ int num_executions;
+ bool promises_expired();
const model_params params;
/**
* 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();
+ void set_current_action(ModelAction *act) { priv->current_action = act; }
+ Thread * check_current_action(ModelAction *curr);
+ bool process_read(ModelAction *curr, Thread * th, bool second_part_of_rmw);
bool take_step();
+ void check_recency(ModelAction *curr, bool already_added);
ModelAction * get_last_conflict(ModelAction *act);
void set_backtracking(ModelAction *act);
- thread_id_t get_next_replay_thread();
+ 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 check_curr_backtracking(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);
bool w_modification_order(ModelAction *curr);
bool release_seq_head(const ModelAction *rf,
std::vector<const ModelAction *> *release_heads) const;
+ bool resolve_release_sequences(void *location);
- ModelAction *current_action;
ModelAction *diverge;
- thread_id_t nextThread;
ucontext_t system_context;
action_list_t *action_trace;
*/
HashTable<void *, std::list<ModelAction *>, uintptr_t, 4> *lazy_sync_with_release;
+ /**
+ * Represents the total size of the
+ * ModelChecker::lazy_sync_with_release lists. This count should be
+ * snapshotted, so it is actually a pointer to a location within
+ * ModelChecker::priv
+ */
+ unsigned int *lazy_sync_size;
+
std::vector<ModelAction *> *thrd_last_action;
NodeStack *node_stack;
- ModelAction *next_backtrack;
+
+ /** Private data members that should be snapshotted. They are grouped
+ * together for efficiency and maintainability. */
+ struct model_snapshot_members *priv;
/**
* @brief The modification order graph
*
- * A direceted acyclic graph recording observations of the modification
+ * 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
* <tt>b</tt>.
*/
CycleGraph *mo_graph;
-
bool failed_promise;
+ bool too_many_reads;
+ bool asserted;
+ bool rmw_cycle;
};
extern ModelChecker *model;