11 typedef ModelList<FuncInst *> func_inst_list_mt;
12 typedef HashTable<FuncInst *, ModelAction *, uintptr_t, 0> inst_act_map_t;
16 FuncNode(ModelHistory * history);
19 uint32_t get_func_id() { return func_id; }
20 const char * get_func_name() { return func_name; }
21 void set_func_id(uint32_t id) { func_id = id; }
22 void set_func_name(const char * name) { func_name = name; }
23 void set_new_exec_flag();
25 void add_inst(ModelAction *act);
26 FuncInst * get_inst(ModelAction *act);
28 HashTable<const char *, FuncInst *, uintptr_t, 4, model_malloc, model_calloc, model_free> * getFuncInstMap() { return &func_inst_map; }
29 func_inst_list_mt * get_inst_list() { return &inst_list; }
30 func_inst_list_mt * get_entry_insts() { return &entry_insts; }
31 void add_entry_inst(FuncInst * inst);
33 void update_tree(action_list_t * act_list);
34 void update_inst_tree(func_inst_list_t * inst_list);
35 void update_predicate_tree(action_list_t * act_list);
36 bool follow_branch(Predicate ** curr_pred, FuncInst * next_inst, ModelAction * next_act, HashTable<FuncInst *, ModelAction *, uintptr_t, 0> * inst_act_map, SnapVector<Predicate *> * unset_predicates);
38 void incr_exit_count() { exit_count++; }
39 uint32_t get_exit_count() { return exit_count; }
41 SnapList<action_list_t *> * get_action_list_buffer() { return action_list_buffer; }
43 void add_to_val_loc_map(uint64_t val, void * loc);
44 void add_to_val_loc_map(value_set_t * values, void * loc);
45 void update_loc_may_equal_map(void * new_loc, loc_set_t * old_locations);
47 void init_predicate_tree_position(thread_id_t tid);
48 void set_predicate_tree_position(thread_id_t tid, Predicate * pred);
49 Predicate * get_predicate_tree_position(thread_id_t tid);
51 void init_inst_act_map(thread_id_t tid);
52 void reset_inst_act_map(thread_id_t tid);
53 void update_inst_act_map(thread_id_t tid, ModelAction * read_act);
54 inst_act_map_t * get_inst_act_map(thread_id_t tid);
56 void print_predicate_tree();
57 void print_val_loc_map();
58 void print_last_read(thread_id_t tid);
63 const char * func_name;
64 ModelHistory * history;
65 bool predicate_tree_initialized;
66 Predicate * predicate_tree_entry; // a dummy node whose children are the real entries
70 /* Use source line number as the key of hashtable, to check if
71 * atomic operation with this line number has been added or not
73 HashTable<const char *, FuncInst *, uintptr_t, 4, model_malloc, model_calloc, model_free> func_inst_map;
75 /* List of all atomic actions in this function */
76 func_inst_list_mt inst_list;
78 /* Possible entry atomic actions in this function */
79 func_inst_list_mt entry_insts;
81 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);
82 void generate_predicates(Predicate ** curr_pred, FuncInst * next_inst, SnapVector<struct half_pred_expr *> * half_pred_expressions);
83 bool amend_predicate_expr(Predicate ** curr_pred, FuncInst * next_inst, ModelAction * next_act);
85 /* Store action_lists when calls to update_tree are deferred */
86 SnapList<action_list_t *> * action_list_buffer;
88 /* read_locations: set of locations read by this FuncNode
89 * val_loc_map: keep track of locations that have the same values written to;
90 * loc_may_equal_map: look up locations that may share the same value as key;
91 * deduced from val_loc_map; */
92 loc_set_t * read_locations;
93 HashTable<uint64_t, loc_set_t *, uint64_t, 0> * val_loc_map;
94 HashTable<void *, loc_set_t *, uintptr_t, 0> * loc_may_equal_map;
95 // value_set_t * values_may_read_from;
97 /* Run-time position in the predicate tree for each thread */
98 ModelVector<Predicate *> predicate_tree_position;
100 /* A run-time map from FuncInst to ModelAction for each thread; needed by NewFuzzer */
101 SnapVector<inst_act_map_t *> * thrd_inst_act_map;
104 #endif /* __FUNCNODE_H__ */