11 typedef ModelList<FuncInst *> func_inst_list_mt;
12 typedef HashTable<void *, uint64_t, uintptr_t, 4> read_map_t;
13 typedef HashTable<FuncInst *, ModelAction *, uintptr_t, 0> inst_act_map_t;
17 FuncNode(ModelHistory * history);
20 uint32_t get_func_id() { return func_id; }
21 const char * get_func_name() { return func_name; }
22 void set_func_id(uint32_t id) { func_id = id; }
23 void set_func_name(const char * name) { func_name = name; }
24 void set_new_exec_flag();
26 void add_inst(ModelAction *act);
27 FuncInst * get_inst(ModelAction *act);
29 HashTable<const char *, FuncInst *, uintptr_t, 4, model_malloc, model_calloc, model_free> * getFuncInstMap() { return &func_inst_map; }
30 func_inst_list_mt * get_inst_list() { return &inst_list; }
31 func_inst_list_mt * get_entry_insts() { return &entry_insts; }
32 void add_entry_inst(FuncInst * inst);
34 void update_tree(action_list_t * act_list);
35 void update_inst_tree(func_inst_list_t * inst_list);
37 void update_predicate_tree(action_list_t * act_list);
38 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);
39 void generate_predicate(Predicate ** curr_pred, FuncInst * next_inst, SnapVector<struct half_pred_expr *> * half_pred_expressions);
40 bool amend_predicate_expr(Predicate ** curr_pred, FuncInst * next_inst, ModelAction * next_act);
42 void incr_exit_count() { exit_count++; }
43 uint32_t get_exit_count() { return exit_count; }
45 ModelList<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 print_predicate_tree();
61 void print_val_loc_map();
62 void print_last_read(thread_id_t tid);
67 const char * func_name;
68 ModelHistory * history;
69 bool predicate_tree_initialized;
70 Predicate * predicate_tree_entry; // a dummy node whose children are the real entries
74 /* Use source line number as the key of hashtable, to check if
75 * atomic operation with this line number has been added or not
77 HashTable<const char *, FuncInst *, uintptr_t, 4, model_malloc, model_calloc, model_free> func_inst_map;
79 /* List of all atomic actions in this function */
80 func_inst_list_mt inst_list;
82 /* Possible entry atomic actions in this function */
83 func_inst_list_mt entry_insts;
85 /* Store the values read by atomic read actions per memory location for each thread */
86 //ModelVector<read_map_t *> thrd_read_map;
88 /* Store action_lists when calls to update_tree are deferred */
89 ModelList<action_list_t *> action_list_buffer;
91 /* read_locations: set of locations read by this FuncNode
92 * val_loc_map: keep track of locations that have the same values written to;
93 * loc_may_equal_map: deduced from val_loc_map;
95 loc_set_t * read_locations;
96 HashTable<uint64_t, loc_set_t *, uint64_t, 0> * val_loc_map;
97 HashTable<void *, loc_set_t *, uintptr_t, 0> * loc_may_equal_map;
98 // value_set_t * values_may_read_from;
100 /* run-time position in the predicate tree for each thread */
101 ModelVector<Predicate *> predicate_tree_position;
103 SnapVector<inst_act_map_t *> * thrd_inst_act_map;
106 #endif /* __FUNCNODE_H__ */