#include <list>
#include <map>
+#include <cstddef>
#include "schedule.h"
#include "libthreads.h"
TreeNode *node;
};
+class Backtrack {
+public:
+ Backtrack(ModelAction *d, action_list_t *t) {
+ diverge = d;
+ actionTrace = t;
+ iter = actionTrace->begin();
+ }
+ ModelAction *get_diverge() { return diverge; }
+ action_list_t *get_trace() { return actionTrace; }
+ void advance_state() { iter++; }
+ ModelAction *get_state() {
+ return iter == actionTrace->end() ? NULL : *iter;
+ }
+private:
+ ModelAction *diverge;
+ action_list_t *actionTrace;
+ /* points to position in actionTrace as we replay */
+ action_list_t::iterator iter;
+};
+
class ModelChecker {
public:
ModelChecker();
void add_system_thread(Thread *t);
void set_current_action(ModelAction *act) { current_action = act; }
- ModelAction *get_last_conflict(ModelAction *act);
void check_current_action(void);
- void set_backtracking(ModelAction *act);
void print_trace(void);
+ Thread *schedule_next_thread();
int add_thread(Thread *t);
Thread *get_thread(thread_id_t tid) { return thread_map[tid]; }
void assign_id(Thread *t);
int switch_to_master(ModelAction *act);
+
+ bool next_execution();
private:
int used_thread_id;
+
+ ModelAction *get_last_conflict(ModelAction *act);
+ void set_backtracking(ModelAction *act);
+ thread_id_t advance_backtracking_state();
+ thread_id_t get_next_replay_thread();
+
class ModelAction *current_action;
+ Backtrack *exploring;
+ thread_id_t nextThread;
+
action_list_t *action_trace;
std::map<thread_id_t, class Thread *> thread_map;
class TreeNode *rootNode, *currentNode;
+ std::list<class Backtrack *> backtrack_list;
};
extern ModelChecker *model;