do optimization for FuncNode::update_tree

[c11tester.git] / funcnode.h

diff --git a/funcnode.h b/funcnode.h
index 4fcbb94050051ebf7e38a18d9932bd29c99a4a96..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 clear_read_map(uint32_t tid);
 
        /* TODO: generate EQUALITY or NULLITY predicate based on write_history in history.cc */

-       void update_predicate_tree(action_list_t * act_list, HashTable<ModelAction *, FuncInst *, uintptr_t, 4> * act_inst_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);
        void print_predicate_tree();
 
        void print_last_read(uint32_t tid);