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 );
53 /* @param func_id a non-zero value */
54 void ModelHistory::exit_function(const uint32_t func_id, thread_id_t tid)
56 uint32_t id = id_to_int(tid);
57 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
58 SnapVector< SnapList<action_list_t *> *> *
59 thrd_func_act_lists = model->get_execution()->get_thrd_func_act_lists();
61 SnapList<action_list_t *> * func_act_lists = (*thrd_func_act_lists)[id];
62 uint32_t last_func_id = (*thrd_func_list)[id].back();
64 if (last_func_id == func_id) {
65 FuncNode * func_node = func_nodes[func_id];
66 //func_node->clear_read_map(tid);
68 action_list_t * curr_act_list = func_act_lists->back();
70 /* defer the processing of curr_act_list until the function has exits a few times
71 * (currently 2 times) so that more information can be gathered to infer nullity predicates.
73 func_node->incr_exit_count();
74 if (func_node->get_exit_count() >= 2) {
75 ModelList<action_list_t *> * action_list_buffer = func_node->get_action_list_buffer();
76 while (action_list_buffer->size() > 0) {
77 action_list_t * act_list = action_list_buffer->back();
78 action_list_buffer->pop_back();
79 func_node->update_tree(act_list);
82 func_node->update_tree(curr_act_list);
84 func_node->get_action_list_buffer()->push_front(curr_act_list);
86 (*thrd_func_list)[id].pop_back();
87 func_act_lists->pop_back();
89 model_print("trying to exit with a wrong function id\n");
90 model_print("--- last_func: %d, func_id: %d\n", last_func_id, func_id);
92 //model_print("thread %d exiting func %d\n", tid, func_id);
95 void ModelHistory::resize_func_nodes(uint32_t new_size)
97 uint32_t old_size = func_nodes.size();
99 if ( old_size < new_size )
100 func_nodes.resize(new_size);
102 for (uint32_t id = old_size;id < new_size;id++) {
103 const char * func_name = func_map_rev[id];
104 FuncNode * func_node = new FuncNode(this);
105 func_node->set_func_id(id);
106 func_node->set_func_name(func_name);
107 func_nodes[id] = func_node;
111 void ModelHistory::process_action(ModelAction *act, thread_id_t tid)
113 /* return if thread i has not entered any function or has exited
114 from all functions */
115 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
116 SnapVector< SnapList<action_list_t *> *> *
117 thrd_func_act_lists = model->get_execution()->get_thrd_func_act_lists();
119 uint32_t id = id_to_int(tid);
120 if ( thrd_func_list->size() <= id )
123 /* get the function id that thread i is currently in */
124 uint32_t func_id = (*thrd_func_list)[id].back();
125 SnapList<action_list_t *> * func_act_lists = (*thrd_func_act_lists)[id];
127 if (act->is_write()) {
128 void * location = act->get_location();
129 uint64_t value = act->get_write_value();
130 add_to_write_history(location, value);
132 /* update FuncNodes */
133 SnapList<FuncNode *> * func_nodes = loc_func_nodes_map.get(location);
134 sllnode<FuncNode *> * it = NULL;
135 if (func_nodes != NULL)
136 it = func_nodes->begin();
138 for (; it != NULL; it = it->getNext()) {
139 FuncNode * func_node = it->getVal();
140 func_node->add_to_val_loc_map(value, location);
144 /* the following does not care about actions without a position */
145 if (func_id == 0 || act->get_position() == NULL)
148 if ( func_nodes.size() <= func_id )
149 resize_func_nodes( func_id + 1 );
151 FuncNode * func_node = func_nodes[func_id];
153 // if (act->is_read())
154 // func_node->store_read(act, tid);
156 /* add to curr_inst_list */
157 bool second_part_of_rmw = act->is_rmwc() || act->is_rmw();
158 if (!second_part_of_rmw) {
159 action_list_t * curr_act_list = func_act_lists->back();
160 ASSERT(curr_act_list != NULL);
162 ModelAction * last_act = NULL;
163 if (curr_act_list->size() != 0)
164 last_act = curr_act_list->back();
166 // do not add actions with the same sequence number twice
167 if (last_act != NULL && last_act->get_seq_number() == act->get_seq_number())
170 curr_act_list->push_back(act);
171 func_node->add_inst(act);
175 /* return the FuncNode given its func_id */
176 FuncNode * ModelHistory::get_func_node(uint32_t func_id)
178 if (func_nodes.size() <= func_id) // this node has not been added to func_nodes
181 return func_nodes[func_id];
185 uint64_t ModelHistory::query_last_read(void * location, thread_id_t tid)
187 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
188 uint32_t id = id_to_int(tid);
190 ASSERT( thrd_func_list->size() > id );
191 uint32_t func_id = (*thrd_func_list)[id].back();
192 FuncNode * func_node = func_nodes[func_id];
194 uint64_t last_read_val = 0xdeadbeef;
195 if (func_node != NULL) {
196 last_read_val = func_node->query_last_read(location, tid);
199 return last_read_val;
203 void ModelHistory::add_to_write_history(void * location, uint64_t write_val)
205 value_set_t * write_set = write_history.get(location);
207 if (write_set == NULL) {
208 write_set = new value_set_t();
209 write_history.put(location, write_set);
212 write_set->add(write_val);
215 void ModelHistory::add_to_loc_func_nodes_map(void * location, FuncNode * node)
217 SnapList<FuncNode *> * func_node_list = loc_func_nodes_map.get(location);
218 if (func_node_list == NULL) {
219 func_node_list = new SnapList<FuncNode *>();
220 loc_func_nodes_map.put(location, func_node_list);
223 func_node_list->push_back(node);
226 void ModelHistory::set_new_exec_flag()
228 for (uint i = 1; i < func_nodes.size(); i++) {
229 FuncNode * func_node = func_nodes[i];
230 func_node->set_new_exec_flag();
234 void ModelHistory::print_write()
238 void ModelHistory::print_func_node()
240 /* function id starts with 1 */
241 for (uint32_t i = 1; i < func_nodes.size(); i++) {
242 FuncNode * func_node = func_nodes[i];
244 func_inst_list_mt * entry_insts = func_node->get_entry_insts();
245 model_print("function %s has entry actions\n", func_node->get_func_name());
247 mllnode<FuncInst*>* it;
248 for (it = entry_insts->begin();it != NULL;it=it->getNext()) {
249 FuncInst *inst = it->getVal();
250 model_print("type: %d, at: %s\n", inst->get_type(), inst->get_position());
253 func_inst_list_mt * inst_list = funcNode->get_inst_list();
255 model_print("function %s has following actions\n", funcNode->get_func_name());
256 func_inst_list_mt::iterator it;
257 for (it = inst_list->begin(); it != inst_list->end(); it++) {
258 FuncInst *inst = *it;
259 model_print("type: %d, at: %s\n", inst->get_type(), inst->get_position());