#include <list>
#include <map>
+#include <vector>
#include <cstddef>
#include <ucontext.h>
#include "schedule.h"
+#include "mymemory.h"
+#include <utility>
#include "libthreads.h"
#include "libatomic.h"
#include "threads.h"
/* Forward declaration */
class TreeNode;
-
-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 Backtrack;
class ModelChecker {
public:
int switch_to_master(ModelAction *act);
bool next_execution();
+ MEMALLOC
private:
int next_thread_id;
int used_sequence_numbers;
ModelAction * get_last_conflict(ModelAction *act);
void set_backtracking(ModelAction *act);
- thread_id_t advance_backtracking_state();
thread_id_t get_next_replay_thread();
Backtrack * get_next_backtrack();
void reset_to_initial_state();
ucontext_t *system_context;
action_list_t *action_trace;
- std::map<int, class Thread *> thread_map;
+ std::map<int, class Thread *, std::less< int >, MyAlloc< std::pair< const int, class Thread * > > > thread_map;
class TreeNode *rootNode, *currentNode;
- std::list<class Backtrack *> backtrack_list;
+ std::list<class Backtrack *, MyAlloc< class Backtrack * > > backtrack_list;
};
extern ModelChecker *model;