11 /** @brief Constructor */
12 ModelHistory::ModelHistory() :
13 func_counter(1), /* function id starts with 1 */
17 write_history(), // snapshot data structure
18 loc_func_nodes_map() // shapshot data structure
21 void ModelHistory::enter_function(const uint32_t func_id, thread_id_t tid)
23 //model_print("thread %d entering func %d\n", tid, func_id);
24 uint id = id_to_int(tid);
25 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
26 SnapVector< SnapList<action_list_t *> *> *
27 thrd_func_act_lists = model->get_execution()->get_thrd_func_act_lists();
29 if ( thrd_func_list->size() <= id ) {
30 uint oldsize = thrd_func_list->size();
31 thrd_func_list->resize( id + 1 );
32 for (uint i = oldsize; i < id + 1; i++) {
33 new (&(*thrd_func_list)[i]) func_id_list_t();
34 // push 0 as a dummy function id to a void seg fault
35 (*thrd_func_list)[i].push_back(0);
38 thrd_func_act_lists->resize( id + 1 );
39 for (uint i = oldsize; i < id + 1; i++) {
40 (*thrd_func_act_lists)[i] = new SnapList<action_list_t *>();
44 SnapList<action_list_t *> * func_act_lists = (*thrd_func_act_lists)[id];
46 (*thrd_func_list)[id].push_back(func_id);
47 func_act_lists->push_back( new action_list_t() );
49 if ( func_nodes.size() <= func_id )
50 resize_func_nodes( func_id + 1 );
52 FuncNode * func_node = func_nodes[func_id];
53 func_node->init_predicate_tree_position(tid);
54 func_node->init_inst_act_map(tid);
57 /* @param func_id a non-zero value */
58 void ModelHistory::exit_function(const uint32_t func_id, thread_id_t tid)
60 uint32_t id = id_to_int(tid);
61 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
62 SnapVector< SnapList<action_list_t *> *> *
63 thrd_func_act_lists = model->get_execution()->get_thrd_func_act_lists();
65 SnapList<action_list_t *> * func_act_lists = (*thrd_func_act_lists)[id];
66 uint32_t last_func_id = (*thrd_func_list)[id].back();
68 if (last_func_id == func_id) {
69 FuncNode * func_node = func_nodes[func_id];
70 func_node->set_predicate_tree_position(tid, NULL);
71 func_node->reset_inst_act_map(tid);
73 action_list_t * curr_act_list = func_act_lists->back();
75 /* defer the processing of curr_act_list until the function has exits a few times
76 * (currently twice) so that more information can be gathered to infer nullity predicates.
78 func_node->incr_exit_count();
79 if (func_node->get_exit_count() >= 2) {
80 SnapList<action_list_t *> * action_list_buffer = func_node->get_action_list_buffer();
81 while (action_list_buffer->size() > 0) {
82 action_list_t * act_list = action_list_buffer->back();
83 action_list_buffer->pop_back();
84 func_node->update_tree(act_list);
87 func_node->update_tree(curr_act_list);
89 func_node->get_action_list_buffer()->push_front(curr_act_list);
91 (*thrd_func_list)[id].pop_back();
92 func_act_lists->pop_back();
94 model_print("trying to exit with a wrong function id\n");
95 model_print("--- last_func: %d, func_id: %d\n", last_func_id, func_id);
97 //model_print("thread %d exiting func %d\n", tid, func_id);
100 void ModelHistory::resize_func_nodes(uint32_t new_size)
102 uint32_t old_size = func_nodes.size();
104 if ( old_size < new_size )
105 func_nodes.resize(new_size);
107 for (uint32_t id = old_size; id < new_size; id++) {
108 const char * func_name = func_map_rev[id];
109 FuncNode * func_node = new FuncNode(this);
110 func_node->set_func_id(id);
111 func_node->set_func_name(func_name);
112 func_nodes[id] = func_node;
116 void ModelHistory::process_action(ModelAction *act, thread_id_t tid)
118 /* return if thread i has not entered any function or has exited
119 from all functions */
120 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
121 SnapVector< SnapList<action_list_t *> *> *
122 thrd_func_act_lists = model->get_execution()->get_thrd_func_act_lists();
124 uint32_t id = id_to_int(tid);
125 if ( thrd_func_list->size() <= id )
128 /* get the function id that thread i is currently in */
129 uint32_t func_id = (*thrd_func_list)[id].back();
130 SnapList<action_list_t *> * func_act_lists = (*thrd_func_act_lists)[id];
132 if (act->is_write()) {
133 void * location = act->get_location();
134 uint64_t value = act->get_write_value();
135 add_to_write_history(location, value);
137 /* update FuncNodes */
138 SnapList<FuncNode *> * func_nodes = loc_func_nodes_map.get(location);
139 sllnode<FuncNode *> * it = NULL;
140 if (func_nodes != NULL)
141 it = func_nodes->begin();
143 for (; it != NULL; it = it->getNext()) {
144 FuncNode * func_node = it->getVal();
145 func_node->add_to_val_loc_map(value, location);
149 /* the following does not care about actions without a position */
150 if (func_id == 0 || act->get_position() == NULL)
153 bool second_part_of_rmw = act->is_rmwc() || act->is_rmw();
155 action_list_t * curr_act_list = func_act_lists->back();
156 ASSERT(curr_act_list != NULL);
158 ModelAction * last_act = NULL;
159 if (curr_act_list->size() != 0)
160 last_act = curr_act_list->back();
162 /* skip actions that are paused by fuzzer (sequence number is 0),
163 * that are second part of a read modify write or actions with the same sequence number */
164 modelclock_t curr_seq_number = act->get_seq_number();
165 if (curr_seq_number == 0 || second_part_of_rmw ||
166 (last_act != NULL && last_act->get_seq_number() == curr_seq_number) )
169 if ( func_nodes.size() <= func_id )
170 resize_func_nodes( func_id + 1 );
172 FuncNode * func_node = func_nodes[func_id];
174 /* add to curr_inst_list */
175 curr_act_list->push_back(act);
176 func_node->add_inst(act);
178 if (act->is_read()) {
179 func_node->update_inst_act_map(tid, act);
181 Fuzzer * fuzzer = model->get_execution()->getFuzzer();
182 Predicate * selected_branch = fuzzer->get_selected_child_branch(tid);
183 func_node->set_predicate_tree_position(tid, selected_branch);
187 /* return the FuncNode given its func_id */
188 FuncNode * ModelHistory::get_func_node(uint32_t func_id)
190 if (func_nodes.size() <= func_id) // this node has not been added to func_nodes
193 return func_nodes[func_id];
196 void ModelHistory::add_to_write_history(void * location, uint64_t write_val)
198 value_set_t * write_set = write_history.get(location);
200 if (write_set == NULL) {
201 write_set = new value_set_t();
202 write_history.put(location, write_set);
205 write_set->add(write_val);
208 void ModelHistory::add_to_loc_func_nodes_map(void * location, FuncNode * node)
210 SnapList<FuncNode *> * func_node_list = loc_func_nodes_map.get(location);
211 if (func_node_list == NULL) {
212 func_node_list = new SnapList<FuncNode *>();
213 loc_func_nodes_map.put(location, func_node_list);
216 func_node_list->push_back(node);
219 /* Reallocate some snapshotted memories when new executions start */
220 void ModelHistory::set_new_exec_flag()
222 for (uint i = 1; i < func_nodes.size(); i++) {
223 FuncNode * func_node = func_nodes[i];
224 func_node->set_new_exec_flag();
228 void ModelHistory::print_write()
232 void ModelHistory::print_func_node()
234 /* function id starts with 1 */
235 for (uint32_t i = 1; i < func_nodes.size(); i++) {
236 FuncNode * func_node = func_nodes[i];
238 func_inst_list_mt * entry_insts = func_node->get_entry_insts();
239 model_print("function %s has entry actions\n", func_node->get_func_name());
241 mllnode<FuncInst*>* it;
242 for (it = entry_insts->begin();it != NULL;it=it->getNext()) {
243 FuncInst *inst = it->getVal();
244 model_print("type: %d, at: %s\n", inst->get_type(), inst->get_position());
247 func_inst_list_mt * inst_list = funcNode->get_inst_list();
249 model_print("function %s has following actions\n", funcNode->get_func_name());
250 func_inst_list_mt::iterator it;
251 for (it = inst_list->begin(); it != inst_list->end(); it++) {
252 FuncInst *inst = *it;
253 model_print("type: %d, at: %s\n", inst->get_type(), inst->get_position());