5 #include "hashfunction.h"
7 #include "threads-model.h"
11 typedef ModelList<FuncInst *> func_inst_list_mt;
12 typedef enum edge_type {
13 IN_EDGE, OUT_EDGE, BI_EDGE
18 FuncNode(ModelHistory * history);
21 uint32_t get_func_id() { return func_id; }
22 const char * get_func_name() { return func_name; }
23 void set_func_id(uint32_t id) { func_id = id; }
24 void set_func_name(const char * name) { func_name = name; }
25 void set_new_exec_flag();
27 void add_inst(ModelAction *act);
28 FuncInst * create_new_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, Predicate ** unset_predicate);
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; }
61 int compute_distance(FuncNode * target, int max_step = MAX_DIST);
63 void add_failed_predicate(Predicate * pred);
65 void print_predicate_tree();
70 const char * func_name;
71 ModelHistory * history;
72 Predicate * predicate_tree_entry; // A dummy node whose children are the real entries
73 Predicate * predicate_tree_exit; // A dummy node
78 void incr_marker() { marker++; }
80 /* Use source line number as the key of hashtable, to check if
81 * atomic operation with this line number has been added or not
83 HashTable<const char *, FuncInst *, uintptr_t, 4, model_malloc, model_calloc, model_free> func_inst_map;
85 /* List of all atomic actions in this function */
86 func_inst_list_mt inst_list;
88 /* Possible entry atomic actions in this function */
89 func_inst_list_mt entry_insts;
91 /* Map a FuncInst to the its predicate when updating predicate trees */
92 HashTable<FuncInst *, Predicate *, uintptr_t, 0, model_malloc, model_calloc, model_free> inst_pred_map;
94 /* Number FuncInsts to detect loops when updating predicate trees */
95 HashTable<FuncInst *, uint32_t, uintptr_t, 0, model_malloc, model_calloc, model_free> inst_id_map;
97 /* Delect read actions at the same locations when updating predicate trees */
98 HashTable<void *, ModelAction *, uintptr_t, 0, model_malloc, model_calloc, model_free> loc_act_map;
100 void infer_predicates(FuncInst * next_inst, ModelAction * next_act, SnapVector<struct half_pred_expr *> * half_pred_expressions);
101 void generate_predicates(Predicate * curr_pred, FuncInst * next_inst, SnapVector<struct half_pred_expr *> * half_pred_expressions);
102 bool amend_predicate_expr(Predicate * curr_pred, FuncInst * next_inst, ModelAction * next_act);
104 /* Store action_lists when calls to update_tree are deferred */
105 SnapList<action_list_t *> * action_list_buffer;
107 /* Set of locations read by this FuncNode */
108 loc_set_t * read_locations;
110 /* Set of locations written to by this FuncNode */
111 loc_set_t * write_locations;
113 /* Keeps track of locations that have the same values written to */
114 HashTable<uint64_t, loc_set_t *, uint64_t, 0, snapshot_malloc, snapshot_calloc, snapshot_free, int64_hash> * val_loc_map;
116 /* Keeps track of locations that may share the same value as key, deduced from val_loc_map */
117 HashTable<void *, loc_set_t *, uintptr_t, 0> * loc_may_equal_map;
119 // value_set_t * values_may_read_from;
121 /* Run-time position in the predicate tree for each thread */
122 ModelVector<Predicate *> predicate_tree_position;
124 PredSet predicate_leaves;
125 ModelVector<Predicate *> leaves_tmp_storage;
126 ModelVector<Predicate *> weight_debug_vec;
127 PredSet failed_predicates;
129 /* Store the relation between this FuncNode and other FuncNodes */
130 HashTable<FuncNode *, edge_type_t, uintptr_t, 0, model_malloc, model_calloc, model_free> edge_table;
132 /* FuncNodes that follow this node */
133 ModelList<FuncNode *> out_edges;
135 void assign_initial_weight();
136 void update_predicate_tree_weight();
139 #endif /* __FUNCNODE_H__ */