tree: fix header for potential multiple inclusions

[c11tester.git] / model.h

diff --git a/model.h b/model.h
index a9016338508eac25e4f1b97bc76a3e429d51fa40..d04fa6208a35a5498c4e8bc54c1067afa5078187 100644 (file)
--- a/model.h
+++ b/model.h
@@ -1,20 +1,121 @@
 #ifndef __MODEL_H__
 #define __MODEL_H__
 
+#include <list>
+#include <map>
+#include <cstddef>
+#include <ucontext.h>
+
 #include "schedule.h"
+#include "libthreads.h"
+#include "libatomic.h"
+#include "threads.h"
+#include "tree.h"
+
+#define VALUE_NONE -1
+
+typedef enum action_type {
+       THREAD_CREATE,
+       THREAD_YIELD,
+       THREAD_JOIN,
+       ATOMIC_READ,
+       ATOMIC_WRITE
+} action_type_t;
+
+typedef std::list<class ModelAction *> action_list_t;
+
+class ModelAction {
+public:
+       ModelAction(action_type_t type, memory_order order, void *loc, int value);
+       void print(void);
+
+       thread_id_t get_tid() { return tid; }
+       action_type get_type() { return type; }
+       memory_order get_mo() { return order; }
+       void * get_location() { return location; }
+
+       TreeNode * get_node() { return node; }
+       void set_node(TreeNode *n) { node = n; }
+
+       bool is_read();
+       bool is_write();
+       bool is_acquire();
+       bool is_release();
+       bool same_var(ModelAction *act);
+       bool same_thread(ModelAction *act);
+       bool is_dependent(ModelAction *act);
+private:
+       action_type type;
+       memory_order order;
+       void *location;
+       thread_id_t tid;
+       int value;
+       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();
        ~ModelChecker();
        class Scheduler *scheduler;
-       struct thread *system_thread;
 
-       void add_system_thread(struct thread *t);
-       void assign_id(struct thread *t);
+       void set_system_context(ucontext_t *ctxt) { system_context = ctxt; }
+       ucontext_t * get_system_context(void) { return system_context; }
+
+       void set_current_action(ModelAction *act) { current_action = act; }
+       void check_current_action(void);
+       void print_summary(void);
+       Thread * schedule_next_thread();
+
+       int add_thread(Thread *t);
+       void remove_thread(Thread *t);
+       Thread * get_thread(thread_id_t tid) { return thread_map[tid]; }
 
+       int get_next_id();
+
+       int switch_to_master(ModelAction *act);
+
+       bool next_execution();
 private:
        int used_thread_id;
+       int num_executions;
+
+       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();
+
+       class ModelAction *current_action;
+       Backtrack *exploring;
+       thread_id_t nextThread;
+
+       ucontext_t *system_context;
+       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;