5 #include "hashfunction.h"
7 #include "threads-model.h"
11 typedef ModelList<FuncInst *> func_inst_list_mt;
12 typedef ModelList<Predicate *> predicate_trace_t;
14 typedef HashTable<void *, FuncInst *, uintptr_t, 0, model_malloc, model_calloc, model_free> loc_inst_map_t;
15 typedef HashTable<FuncInst *, uint32_t, uintptr_t, 0, model_malloc, model_calloc, model_free> inst_id_map_t;
16 typedef HashTable<FuncInst *, Predicate *, uintptr_t, 0, model_malloc, model_calloc, model_free> inst_pred_map_t;
18 typedef enum edge_type {
19 IN_EDGE, OUT_EDGE, BI_EDGE
24 FuncNode(ModelHistory * history);
27 uint32_t get_func_id() { return func_id; }
28 const char * get_func_name() { return func_name; }
29 void set_func_id(uint32_t id) { func_id = id; }
30 void set_func_name(const char * name) { func_name = name; }
31 void set_new_exec_flag();
33 void add_inst(ModelAction *act);
34 FuncInst * create_new_inst(ModelAction *act);
35 FuncInst * get_inst(ModelAction *act);
37 func_inst_list_mt * get_inst_list() { return &inst_list; }
38 func_inst_list_mt * get_entry_insts() { return &entry_insts; }
39 void add_entry_inst(FuncInst * inst);
41 void function_entry_handler(thread_id_t tid);
42 void function_exit_handler(thread_id_t tid);
44 void update_tree(ModelAction * act);
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 Predicate * get_predicate_tree_position(thread_id_t tid);
52 void add_predicate_to_trace(thread_id_t tid, Predicate *pred);
54 uint32_t get_marker(thread_id_t tid);
55 int get_recursion_depth(thread_id_t tid);
56 uint64_t get_associated_read(thread_id_t tid, FuncInst * inst);
58 void add_out_edge(FuncNode * other);
59 ModelList<FuncNode *> * get_out_edges() { return &out_edges; }
60 int compute_distance(FuncNode * target, int max_step = MAX_DIST);
62 void print_predicate_tree();
67 const char * func_name;
68 ModelHistory * history;
69 Predicate * predicate_tree_entry; // A dummy node whose children are the real entries
70 Predicate * predicate_tree_exit; // A dummy node
72 uint32_t inst_counter;
74 ModelVector< ModelVector<uint32_t> *> thrd_markers;
75 ModelVector<int> thrd_recursion_depth; // Recursion depth starts from 0 to match with vector indexes.
77 void init_marker(thread_id_t tid);
79 /* Use source line number as the key of hashtable, to check if
80 * atomic operation with this line number has been added or not
82 HashTable<const char *, FuncInst *, uintptr_t, 4, model_malloc, model_calloc, model_free> func_inst_map;
84 /* List of all atomic actions in this function */
85 func_inst_list_mt inst_list;
87 /* Possible entry atomic actions in this function */
88 func_inst_list_mt entry_insts;
90 /* Map a FuncInst to the its predicate when updating predicate trees */
91 ModelVector< ModelVector<inst_pred_map_t *> * > thrd_inst_pred_maps;
93 /* Number FuncInsts to detect loops when updating predicate trees */
94 ModelVector< ModelVector<inst_id_map_t *> *> thrd_inst_id_maps;
96 /* Detect read actions at the same locations when updating predicate trees */
97 ModelVector< ModelVector<loc_inst_map_t *> *> thrd_loc_inst_maps;
99 void init_local_maps(thread_id_t tid);
100 void reset_local_maps(thread_id_t tid);
102 void update_inst_tree(func_inst_list_t * inst_list);
103 void update_predicate_tree(ModelAction * act);
104 bool follow_branch(Predicate ** curr_pred, FuncInst * next_inst, ModelAction * next_act, Predicate ** unset_predicate);
106 void infer_predicates(FuncInst * next_inst, ModelAction * next_act, SnapVector<struct half_pred_expr *> * half_pred_expressions);
107 void generate_predicates(Predicate * curr_pred, FuncInst * next_inst, SnapVector<struct half_pred_expr *> * half_pred_expressions);
108 bool amend_predicate_expr(Predicate * curr_pred, FuncInst * next_inst, ModelAction * next_act);
110 /* Set of locations read by this FuncNode */
111 loc_set_t * read_locations;
113 /* Set of locations written to by this FuncNode */
114 loc_set_t * write_locations;
116 /* Keeps track of locations that have the same values written to */
117 HashTable<uint64_t, loc_set_t *, uint64_t, 0, snapshot_malloc, snapshot_calloc, snapshot_free, int64_hash> * val_loc_map;
119 /* Keeps track of locations that may share the same value as key, deduced from val_loc_map */
120 HashTable<void *, loc_set_t *, uintptr_t, 0> * loc_may_equal_map;
122 // value_set_t * values_may_read_from;
124 /* Run-time position in the predicate tree for each thread
125 * The inner vector is used to deal with recursive functions. */
126 ModelVector< ModelVector<Predicate *> * > thrd_predicate_tree_position;
128 ModelVector< ModelVector<predicate_trace_t *> * > thrd_predicate_trace;
130 void set_predicate_tree_position(thread_id_t tid, Predicate * pred);
132 void init_predicate_tree_data_structure(thread_id_t tid);
133 void reset_predicate_tree_data_structure(thread_id_t tid);
135 /* Store the relation between this FuncNode and other FuncNodes */
136 HashTable<FuncNode *, edge_type_t, uintptr_t, 0, model_malloc, model_calloc, model_free> edge_table;
138 /* FuncNodes that follow this node */
139 ModelList<FuncNode *> out_edges;
141 void update_predicate_tree_weight(thread_id_t tid);
144 #endif /* __FUNCNODE_H__ */