11 /** @brief Constructor */
12 ModelHistory::ModelHistory() :
13 func_counter(1), /* function id starts with 1 */
20 void ModelHistory::enter_function(const uint32_t func_id, thread_id_t tid)
22 //model_print("thread %d entering func %d\n", tid, func_id);
23 uint32_t id = id_to_int(tid);
24 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
25 SnapVector< SnapList<func_inst_list_t *> *> *
26 thrd_func_inst_lists = model->get_execution()->get_thrd_func_inst_lists();
28 if ( thrd_func_list->size() <= id ) {
29 thrd_func_list->resize( id + 1 );
30 thrd_func_inst_lists->resize( id + 1 );
33 SnapList<func_inst_list_t *> * func_inst_lists = thrd_func_inst_lists->at(id);
35 if (func_inst_lists == NULL) {
36 func_inst_lists = new SnapList< func_inst_list_t *>();
37 thrd_func_inst_lists->at(id) = func_inst_lists;
40 (*thrd_func_list)[id].push_back(func_id);
41 func_inst_lists->push_back( new func_inst_list_t() );
43 if ( func_nodes.size() <= func_id )
44 resize_func_nodes( func_id + 1 );
47 /* @param func_id a non-zero value */
48 void ModelHistory::exit_function(const uint32_t func_id, thread_id_t tid)
50 uint32_t id = id_to_int(tid);
51 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
52 SnapVector< SnapList<func_inst_list_t *> *> *
53 thrd_func_inst_lists = model->get_execution()->get_thrd_func_inst_lists();
55 SnapList<func_inst_list_t *> * func_inst_lists = thrd_func_inst_lists->at(id);
56 uint32_t last_func_id = (*thrd_func_list)[id].back();
58 if (last_func_id == func_id) {
59 /* clear read map upon exiting functions */
60 FuncNode * func_node = func_nodes[func_id];
61 func_node->clear_read_map(tid);
63 func_inst_list_t * curr_inst_list = func_inst_lists->back();
64 func_node->link_insts(curr_inst_list);
66 (*thrd_func_list)[id].pop_back();
67 func_inst_lists->pop_back();
69 model_print("trying to exit with a wrong function id\n");
70 model_print("--- last_func: %d, func_id: %d\n", last_func_id, func_id);
72 //model_print("thread %d exiting func %d\n", tid, func_id);
75 void ModelHistory::resize_func_nodes(uint32_t new_size)
77 uint32_t old_size = func_nodes.size();
79 if ( old_size < new_size )
80 func_nodes.resize(new_size);
82 for (uint32_t id = old_size; id < new_size; id++) {
83 const char * func_name = func_map_rev[id];
84 FuncNode * func_node = new FuncNode();
85 func_node->set_func_id(id);
86 func_node->set_func_name(func_name);
87 func_nodes[id] = func_node;
91 void ModelHistory::process_action(ModelAction *act, thread_id_t tid)
93 /* return if thread i has not entered any function or has exited
95 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
96 SnapVector< SnapList<func_inst_list_t *> *> *
97 thrd_func_inst_lists = model->get_execution()->get_thrd_func_inst_lists();
99 uint32_t id = id_to_int(tid);
100 if ( thrd_func_list->size() <= id )
103 /* get the function id that thread i is currently in */
104 uint32_t func_id = (*thrd_func_list)[id].back();
105 SnapList<func_inst_list_t *> * func_inst_lists = thrd_func_inst_lists->at(id);
107 if ( func_nodes.size() <= func_id )
108 resize_func_nodes( func_id + 1 );
110 FuncNode * func_node = func_nodes[func_id];
111 ASSERT (func_node != NULL);
113 /* add corresponding FuncInst to func_node */
114 FuncInst * inst = func_node->get_or_add_action(act);
120 func_node->store_read(act, tid);
122 if (inst->is_write())
123 add_to_write_history(act->get_location(), act->get_write_value());
125 /* add to curr_inst_list */
126 func_inst_list_t * curr_inst_list = func_inst_lists->back();
127 ASSERT(curr_inst_list != NULL);
128 curr_inst_list->push_back(inst);
131 /* return the FuncNode given its func_id */
132 FuncNode * ModelHistory::get_func_node(uint32_t func_id)
134 if (func_nodes.size() <= func_id) // this node has not been added
137 return func_nodes[func_id];
140 uint64_t ModelHistory::query_last_read(void * location, thread_id_t tid)
142 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
143 uint32_t id = id_to_int(tid);
145 ASSERT( thrd_func_list->size() > id );
146 uint32_t func_id = (*thrd_func_list)[id].back();
147 FuncNode * func_node = func_nodes[func_id];
149 uint64_t last_read_val = 0xdeadbeef;
150 if (func_node != NULL) {
151 last_read_val = func_node->query_last_read(location, tid);
154 return last_read_val;
157 void ModelHistory::add_to_write_history(void * location, uint64_t write_val)
159 if ( !write_history.contains(location) )
160 write_history.put(location, new write_set_t() );
162 write_set_t * write_set = write_history.get(location);
163 write_set->add(write_val);
166 void ModelHistory::print()
168 /* function id starts with 1 */
169 for (uint32_t i = 1;i < func_nodes.size();i++) {
170 FuncNode * func_node = func_nodes[i];
172 func_inst_list_mt * entry_insts = func_node->get_entry_insts();
173 model_print("function %s has entry actions\n", func_node->get_func_name());
175 func_inst_list_mt::iterator it;
176 for (it = entry_insts->begin();it != entry_insts->end();it++) {
177 FuncInst *inst = *it;
178 model_print("type: %d, at: %s\n", inst->get_type(), inst->get_position());
182 func_inst_list_mt * inst_list = funcNode->get_inst_list();
184 model_print("function %s has following actions\n", funcNode->get_func_name());
185 func_inst_list_mt::iterator it;
186 for (it = inst_list->begin(); it != inst_list->end(); it++) {
187 FuncInst *inst = *it;
188 model_print("type: %d, at: %s\n", inst->get_type(), inst->get_position());