do optimization for FuncNode::update_tree

[c11tester.git] / funcnode.h

diff --git a/funcnode.h b/funcnode.h
index 58fcc7a01ab77a4078429602cc7ed39b73580fc8..4ba239856df8e468a7bf4f6b7518a7a95381bed7 100644 (file)
--- a/funcnode.h
+++ b/funcnode.h
@@ -36,8 +36,8 @@ public:
        void clear_read_map(uint32_t tid);
 
        /* TODO: generate EQUALITY or NULLITY predicate based on write_history in history.cc */
-       void update_predicate_tree(func_inst_list_t * inst_list, HashTable<FuncInst *, uint64_t, uintptr_t, 4> * read_val_map);
-       bool follow_branch(Predicate ** curr_pred, FuncInst * next_inst, HashTable<FuncInst *, uint64_t, uintptr_t, 4> * read_val_map, HashTable<void *, FuncInst *, uintptr_t, 4>* loc_inst_map);
+       void update_predicate_tree(action_list_t * act_list);
+       bool follow_branch(Predicate ** curr_pred, FuncInst * next_inst, ModelAction * next_act, HashTable<void *, ModelAction *, uintptr_t, 0>* loc_act_map);
        void print_predicate_tree();
 
        void print_last_read(uint32_t tid);
@@ -47,6 +47,7 @@ private:
        uint32_t func_id;
        const char * func_name;
        bool predicate_tree_initialized;
+       Predicate * predicate_tree_entry;       // a dummy node whose children are the real entries
 
        /* Use source line number as the key of hashtable, to check if
         * atomic operation with this line number has been added or not
@@ -61,11 +62,6 @@ private:
 
        /* Store the values read by atomic read actions per memory location for each thread */
        ModelVector<read_map_t *> thrd_read_map;
-
-       PredSet predicate_tree_entry;
-
-       /* A FuncInst may correspond to multiple Predicates, so collect them into a PredSet */
-       HashTable<FuncInst *, PredSet *, uintptr_t, 0, model_malloc, model_calloc, model_free> inst_pred_map;
 };
 
 #endif /* __FUNCNODE_H__ */