X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;f=funcnode.h;h=9e3bc69d5e2b184891e0fe5a7b5d36c59557e110;hb=fcc90758629b11f123081c80bb3c37e7ca2a4608;hp=2a7061d6b810a4708fd4779f526f1bb37da64487;hpb=9270d9d61d990f6b73cc2e6657aa19d36b0ea1e5;p=c11tester.git

diff --git a/funcnode.h b/funcnode.h
index 2a7061d6..9e3bc69d 100644
--- a/funcnode.h
+++ b/funcnode.h
@@ -1,51 +1,123 @@
-#include "action.h"
-#include "funcinst.h"
-#include "hashtable.h"
+#ifndef __FUNCNODE_H__
+#define __FUNCNODE_H__
 
-class ModelAction;
+#include "hashset.h"
+#include "hashfunction.h"
+#include "classlist.h"
+#include "threads-model.h"
+
+#define MAX_DIST 10
 
 typedef ModelList<FuncInst *> func_inst_list_mt;
+typedef enum edge_type {
+	IN_EDGE, OUT_EDGE, BI_EDGE
+} edge_type_t;
 
 class FuncNode {
 public:
-	FuncNode();
+	FuncNode(ModelHistory * history);
 	~FuncNode();
 
 	uint32_t get_func_id() { return func_id; }
 	const char * get_func_name() { return func_name; }
 	void set_func_id(uint32_t id) { func_id = id; }
 	void set_func_name(const char * name) { func_name = name; }
+	void set_new_exec_flag();
 
-	FuncInst * get_or_add_action(ModelAction *act);
+	void add_inst(ModelAction *act);
+	FuncInst * create_new_inst(ModelAction *act);
+	FuncInst * get_inst(ModelAction *act);
 
 	HashTable<const char *, FuncInst *, uintptr_t, 4, model_malloc, model_calloc, model_free> * getFuncInstMap() { return &func_inst_map; }
 	func_inst_list_mt * get_inst_list() { return &inst_list; }
 	func_inst_list_mt * get_entry_insts() { return &entry_insts; }
 	void add_entry_inst(FuncInst * inst);
 
-	void store_read(ModelAction * act, uint32_t tid);
-	void print_last_read(uint32_t tid);
+	void update_tree(action_list_t * act_list);
+	void update_inst_tree(func_inst_list_t * inst_list);
+	void update_predicate_tree(action_list_t * act_list);
+	bool follow_branch(Predicate ** curr_pred, FuncInst * next_inst, ModelAction * next_act, SnapVector<Predicate *> * unset_predicates);
+
+	void incr_exit_count() { exit_count++; }
+	uint32_t get_exit_count() { return exit_count; }
+
+	SnapList<action_list_t *> * get_action_list_buffer() { return action_list_buffer; }
+
+	void add_to_val_loc_map(uint64_t val, void * loc);
+	void add_to_val_loc_map(value_set_t * values, void * loc);
+	void update_loc_may_equal_map(void * new_loc, loc_set_t * old_locations);
+
+	void init_predicate_tree_position(thread_id_t tid);
+	void set_predicate_tree_position(thread_id_t tid, Predicate * pred);
+	Predicate * get_predicate_tree_position(thread_id_t tid);
+
+	void init_inst_act_map(thread_id_t tid);
+	void reset_inst_act_map(thread_id_t tid);
+	void update_inst_act_map(thread_id_t tid, ModelAction * read_act);
+	inst_act_map_t * get_inst_act_map(thread_id_t tid);
+
+	void add_out_edge(FuncNode * other);
+	ModelList<FuncNode *> * get_out_edges() { return &out_edges; }
+	int compute_distance(FuncNode * target, int max_step = MAX_DIST);
+
+	void print_predicate_tree();
+	void print_val_loc_map();
+	void print_last_read(thread_id_t tid);
 
 	MEMALLOC
 private:
 	uint32_t func_id;
 	const char * func_name;
+	ModelHistory * history;
+	Predicate * predicate_tree_entry;	// A dummy node whose children are the real entries
+	Predicate * predicate_tree_exit;	// A dummy node
+
+
+	uint32_t exit_count;
+	uint32_t marker;
+
+	void incr_marker() { marker++; }
 
-	/* Use source line number as the key of hashtable, to check if 
+	/* Use source line number as the key of hashtable, to check if
 	 * atomic operation with this line number has been added or not
-	 *
-	 * To do: cds_atomic_compare_exchange contains three atomic operations
-	 * that are feeded with the same source line number by llvm pass
 	 */
 	HashTable<const char *, FuncInst *, uintptr_t, 4, model_malloc, model_calloc, model_free> func_inst_map;
 
-	/* list of all atomic actions in this function */
+	/* List of all atomic actions in this function */
 	func_inst_list_mt inst_list;
 
-	/* possible entry atomic actions in this function */
+	/* Possible entry atomic actions in this function */
 	func_inst_list_mt entry_insts;
 
-	/* Store the values read by atomic read actions per thread for each memory location */
-	HashTable<void *, ModelVector<uint64_t> *, uintptr_t, 4, model_malloc, model_calloc, model_free> loc_thrd_read_map;
-	ModelList<void *> read_locations;
+	void infer_predicates(FuncInst * next_inst, ModelAction * next_act, HashTable<void *, ModelAction *, uintptr_t, 0> * loc_act_map, SnapVector<struct half_pred_expr *> * half_pred_expressions);
+	void generate_predicates(Predicate ** curr_pred, FuncInst * next_inst, SnapVector<struct half_pred_expr *> * half_pred_expressions);
+	bool amend_predicate_expr(Predicate ** curr_pred, FuncInst * next_inst, ModelAction * next_act);
+
+	/* Store action_lists when calls to update_tree are deferred */
+	SnapList<action_list_t *> * action_list_buffer;
+
+	/* Set of locations read by this FuncNode */
+	loc_set_t * read_locations;
+
+	/* Set of locations written to by this FuncNode */
+	loc_set_t * write_locations;
+
+	/* Keeps track of locations that have the same values written to */
+	HashTable<uint64_t, loc_set_t *, uint64_t, 0, snapshot_malloc, snapshot_calloc, snapshot_free, int64_hash> * val_loc_map;
+
+	/* Keeps track of locations that may share the same value as key, deduced from val_loc_map */
+	HashTable<void *, loc_set_t *, uintptr_t, 0> * loc_may_equal_map;
+
+	// value_set_t * values_may_read_from;
+
+	/* Run-time position in the predicate tree for each thread */
+	ModelVector<Predicate *> predicate_tree_position;
+
+	/* Store the relation between this FuncNode and other FuncNodes */
+	HashTable<FuncNode *, edge_type_t, uintptr_t, 0, model_malloc, model_calloc, model_free> edge_table;
+
+	/* FuncNodes that follow this node */
+	ModelList<FuncNode *> out_edges;
 };
+
+#endif	/* __FUNCNODE_H__ */