11 typedef ModelList<FuncInst *> func_inst_list_mt;
12 typedef HashTable<FuncInst *, ModelAction *, uintptr_t, 0> inst_act_map_t;
14 typedef enum edge_type {
15 IN_EDGE, OUT_EDGE, BI_EDGE
20 FuncNode(ModelHistory * history);
23 uint32_t get_func_id() { return func_id; }
24 const char * get_func_name() { return func_name; }
25 void set_func_id(uint32_t id) { func_id = id; }
26 void set_func_name(const char * name) { func_name = name; }
27 void set_new_exec_flag();
29 void add_inst(ModelAction *act);
30 FuncInst * get_inst(ModelAction *act);
32 HashTable<const char *, FuncInst *, uintptr_t, 4, model_malloc, model_calloc, model_free> * getFuncInstMap() { return &func_inst_map; }
33 func_inst_list_mt * get_inst_list() { return &inst_list; }
34 func_inst_list_mt * get_entry_insts() { return &entry_insts; }
35 void add_entry_inst(FuncInst * inst);
37 void update_tree(action_list_t * act_list);
38 void update_inst_tree(func_inst_list_t * inst_list);
39 void update_predicate_tree(action_list_t * act_list);
40 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);
42 void incr_exit_count() { exit_count++; }
43 uint32_t get_exit_count() { return exit_count; }
45 SnapList<action_list_t *> * get_action_list_buffer() { return action_list_buffer; }
47 void add_to_val_loc_map(uint64_t val, void * loc);
48 void add_to_val_loc_map(value_set_t * values, void * loc);
49 void update_loc_may_equal_map(void * new_loc, loc_set_t * old_locations);
51 void init_predicate_tree_position(thread_id_t tid);
52 void set_predicate_tree_position(thread_id_t tid, Predicate * pred);
53 Predicate * get_predicate_tree_position(thread_id_t tid);
55 void init_inst_act_map(thread_id_t tid);
56 void reset_inst_act_map(thread_id_t tid);
57 void update_inst_act_map(thread_id_t tid, ModelAction * read_act);
58 inst_act_map_t * get_inst_act_map(thread_id_t tid);
60 void add_out_edge(FuncNode * other);
61 ModelList<FuncNode *> * get_out_edges() { return &out_edges; }
63 void print_predicate_tree();
64 void print_val_loc_map();
65 void print_last_read(thread_id_t tid);
70 const char * func_name;
71 ModelHistory * history;
72 Predicate * predicate_tree_entry; // a dummy node whose children are the real entries
76 /* Use source line number as the key of hashtable, to check if
77 * atomic operation with this line number has been added or not
79 HashTable<const char *, FuncInst *, uintptr_t, 4, model_malloc, model_calloc, model_free> func_inst_map;
81 /* List of all atomic actions in this function */
82 func_inst_list_mt inst_list;
84 /* Possible entry atomic actions in this function */
85 func_inst_list_mt entry_insts;
87 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);
88 void generate_predicates(Predicate ** curr_pred, FuncInst * next_inst, SnapVector<struct half_pred_expr *> * half_pred_expressions);
89 bool amend_predicate_expr(Predicate ** curr_pred, FuncInst * next_inst, ModelAction * next_act);
91 /* Store action_lists when calls to update_tree are deferred */
92 SnapList<action_list_t *> * action_list_buffer;
94 /* read_locations: set of locations read by this FuncNode
95 * val_loc_map: keep track of locations that have the same values written to;
96 * loc_may_equal_map: look up locations that may share the same value as key;
97 * deduced from val_loc_map; */
98 loc_set_t * read_locations;
99 HashTable<uint64_t, loc_set_t *, uint64_t, 0> * val_loc_map;
100 HashTable<void *, loc_set_t *, uintptr_t, 0> * loc_may_equal_map;
101 // value_set_t * values_may_read_from;
103 /* Run-time position in the predicate tree for each thread */
104 ModelVector<Predicate *> predicate_tree_position;
106 /* A run-time map from FuncInst to ModelAction for each thread; needed by NewFuzzer */
107 SnapVector<inst_act_map_t *> * thrd_inst_act_map;
109 /* Store the relation between this FuncNode and other FuncNodes */
110 HashTable<FuncNode *, edge_type_t, uintptr_t, 0, model_malloc, model_calloc, model_free> edge_table;
111 ModelList<FuncNode *> out_edges; /* FuncNodes that follow this node */
114 #endif /* __FUNCNODE_H__ */