11 typedef ModelList<FuncInst *> func_inst_list_mt;
13 typedef enum edge_type {
14 IN_EDGE, OUT_EDGE, BI_EDGE
19 FuncNode(ModelHistory * history);
22 uint32_t get_func_id() { return func_id; }
23 const char * get_func_name() { return func_name; }
24 void set_func_id(uint32_t id) { func_id = id; }
25 void set_func_name(const char * name) { func_name = name; }
26 void set_new_exec_flag();
28 void add_inst(ModelAction *act);
29 FuncInst * get_inst(ModelAction *act);
31 HashTable<const char *, FuncInst *, uintptr_t, 4, model_malloc, model_calloc, model_free> * getFuncInstMap() { return &func_inst_map; }
32 func_inst_list_mt * get_inst_list() { return &inst_list; }
33 func_inst_list_mt * get_entry_insts() { return &entry_insts; }
34 void add_entry_inst(FuncInst * inst);
36 void update_tree(action_list_t * act_list);
37 void update_inst_tree(func_inst_list_t * inst_list);
38 void update_predicate_tree(action_list_t * act_list);
39 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);
41 void incr_exit_count() { exit_count++; }
42 uint32_t get_exit_count() { return exit_count; }
44 SnapList<action_list_t *> * get_action_list_buffer() { return action_list_buffer; }
46 void add_to_val_loc_map(uint64_t val, void * loc);
47 void add_to_val_loc_map(value_set_t * values, void * loc);
48 void update_loc_may_equal_map(void * new_loc, loc_set_t * old_locations);
50 void init_predicate_tree_position(thread_id_t tid);
51 void set_predicate_tree_position(thread_id_t tid, Predicate * pred);
52 Predicate * get_predicate_tree_position(thread_id_t tid);
54 void init_inst_act_map(thread_id_t tid);
55 void reset_inst_act_map(thread_id_t tid);
56 void update_inst_act_map(thread_id_t tid, ModelAction * read_act);
57 inst_act_map_t * get_inst_act_map(thread_id_t tid);
59 void add_out_edge(FuncNode * other);
60 ModelList<FuncNode *> * get_out_edges() { return &out_edges; }
62 void print_predicate_tree();
63 void print_val_loc_map();
64 void print_last_read(thread_id_t tid);
69 const char * func_name;
70 ModelHistory * history;
71 Predicate * predicate_tree_entry; // a dummy node whose children are the real entries
75 /* Use source line number as the key of hashtable, to check if
76 * atomic operation with this line number has been added or not
78 HashTable<const char *, FuncInst *, uintptr_t, 4, model_malloc, model_calloc, model_free> func_inst_map;
80 /* List of all atomic actions in this function */
81 func_inst_list_mt inst_list;
83 /* Possible entry atomic actions in this function */
84 func_inst_list_mt entry_insts;
86 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);
87 void generate_predicates(Predicate ** curr_pred, FuncInst * next_inst, SnapVector<struct half_pred_expr *> * half_pred_expressions);
88 bool amend_predicate_expr(Predicate ** curr_pred, FuncInst * next_inst, ModelAction * next_act);
90 /* Store action_lists when calls to update_tree are deferred */
91 SnapList<action_list_t *> * action_list_buffer;
93 /* Set of locations read by this FuncNode */
94 loc_set_t * read_locations;
96 /* Set of locations written to by this FuncNode */
97 loc_set_t * write_locations;
99 /* Keeps track of locations that have the same values written to */
100 HashTable<uint64_t, loc_set_t *, uint64_t, 0> * val_loc_map;
102 /* Keeps track of locations that may share the same value as key, deduced from val_loc_map */
103 HashTable<void *, loc_set_t *, uintptr_t, 0> * loc_may_equal_map;
105 // value_set_t * values_may_read_from;
107 /* Run-time position in the predicate tree for each thread */
108 ModelVector<Predicate *> predicate_tree_position;
110 /* A run-time map from FuncInst to ModelAction for each thread; needed by NewFuzzer */
111 SnapVector<inst_act_map_t *> * thrd_inst_act_map;
113 /* Store the relation between this FuncNode and other FuncNodes */
114 HashTable<FuncNode *, edge_type_t, uintptr_t, 0, model_malloc, model_calloc, model_free> edge_table;
116 /* FuncNodes that follow this node */
117 ModelList<FuncNode *> out_edges;
120 #endif /* __FUNCNODE_H__ */