X-Git-Url: http://plrg.eecs.uci.edu/git/?p=c11tester.git;a=blobdiff_plain;f=model.h;h=4e4dcf0ff702b9e825646d0dc56407b81cbed38e;hp=d04fa6208a35a5498c4e8bc54c1067afa5078187;hb=c7affe0434c47a25fb4b571136aea6089ac75592;hpb=34a8b735d1de5aafa72277a40ee3280efc32cd4a

diff --git a/model.h b/model.h
index d04fa620..4e4dcf0f 100644
--- a/model.h
+++ b/model.h
@@ -1,121 +1,123 @@
+/** @file model.h
+ *  @brief Core model checker.
+ */
+
 #ifndef __MODEL_H__
 #define __MODEL_H__
 
 #include <list>
-#include <map>
+#include <vector>
 #include <cstddef>
 #include <ucontext.h>
 
 #include "schedule.h"
+#include "mymemory.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;
-};
+#include "action.h"
+#include "clockvector.h"
+#include "hashtable.h"
 
-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;
-};
+/* Forward declaration */
+class NodeStack;
+class CycleGraph;
+class Promise;
 
+/** @brief The central structure for model-checking */
 class ModelChecker {
 public:
 	ModelChecker();
 	~ModelChecker();
-	class Scheduler *scheduler;
 
+	/** The scheduler to use: tracks the running/ready Threads */
+	Scheduler *scheduler;
+
+	/** Stores the context for the main model-checking system thread (call
+	 * once)
+	 * @param ctxt The system context structure
+	 */
 	void set_system_context(ucontext_t *ctxt) { system_context = ctxt; }
+
+	/** @returns the context for the main model-checking system thread */
 	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);
+
+	/**
+	 * Prints an execution summary with trace information.
+	 * @param feasible Formats outputting according to whether or not the
+	 * current trace is feasible. Defaults to feasible = true.
+	 */
+	void print_summary(bool feasible = true);
+
 	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]; }
+	Thread * get_thread(thread_id_t tid) { return thread_map->get(id_to_int(tid)); }
 
-	int get_next_id();
+	thread_id_t get_next_id();
+	int get_num_threads();
+	modelclock_t get_next_seq_num();
 
 	int switch_to_master(ModelAction *act);
-
+	ClockVector * get_cv(thread_id_t tid);
 	bool next_execution();
+	bool isfeasible();
+	bool isfinalfeasible();
+	void check_promises(ClockVector *old_cv, ClockVector * merge_cv);
+
+	MEMALLOC
 private:
-	int used_thread_id;
+	int next_thread_id;
+	modelclock_t used_sequence_numbers;
 	int num_executions;
 
+	/**
+	 * Stores the ModelAction for the current thread action.  Call this
+	 * immediately before switching from user- to system-context to pass
+	 * data between them.
+	 * @param act The ModelAction created by the user-thread action
+	 */
+	void set_current_action(ModelAction *act) { current_action = act; }
+
 	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();
+	ModelAction * get_next_backtrack();
 	void reset_to_initial_state();
-
-	class ModelAction *current_action;
-	Backtrack *exploring;
+	void resolve_promises(ModelAction *curr);
+	void compute_promises(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);
+	void post_r_modification_order(ModelAction * curr, const ModelAction *rf);
+	void r_modification_order(ModelAction * curr, const ModelAction *rf);
+	void w_modification_order(ModelAction * curr);
+
+	ModelAction *current_action;
+	ModelAction *diverge;
 	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;
+	HashTable<int, Thread *, int> *thread_map;
+
+	/** Per-object list of actions. Maps an object (i.e., memory location)
+	 * to a trace of all actions performed on the object. */
+	HashTable<const void *, action_list_t, uintptr_t, 4> *obj_map;
+
+	HashTable<void *, std::vector<action_list_t>, uintptr_t, 4 > *obj_thrd_map;
+	std::vector<Promise *> * promises;
+	std::vector<ModelAction *> *thrd_last_action;
+	NodeStack *node_stack;
+	ModelAction *next_backtrack;
+	CycleGraph * cyclegraph;
+	bool failed_promise;
 };
 
 extern ModelChecker *model;