11 /** @brief Constructor */
12 ModelHistory::ModelHistory() :
13 func_counter(1), /* function id starts with 1 */
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 uint32_t id = id_to_int(tid);
25 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
26 SnapVector< SnapList<func_inst_list_t *> *> *
27 thrd_func_inst_lists = model->get_execution()->get_thrd_func_inst_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();
35 thrd_func_inst_lists->resize( id + 1 );
38 SnapList<func_inst_list_t *> * func_inst_lists = thrd_func_inst_lists->at(id);
40 if (func_inst_lists == NULL) {
41 func_inst_lists = new SnapList< func_inst_list_t *>();
42 thrd_func_inst_lists->at(id) = func_inst_lists;
45 (*thrd_func_list)[id].push_back(func_id);
46 func_inst_lists->push_back( new func_inst_list_t() );
48 if ( func_nodes.size() <= func_id )
49 resize_func_nodes( func_id + 1 );
52 /* @param func_id a non-zero value */
53 void ModelHistory::exit_function(const uint32_t func_id, thread_id_t tid)
55 uint32_t id = id_to_int(tid);
56 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
57 SnapVector< SnapList<func_inst_list_t *> *> *
58 thrd_func_inst_lists = model->get_execution()->get_thrd_func_inst_lists();
60 SnapList<func_inst_list_t *> * func_inst_lists = thrd_func_inst_lists->at(id);
61 uint32_t last_func_id = (*thrd_func_list)[id].back();
63 if (last_func_id == func_id) {
64 FuncNode * func_node = func_nodes[func_id];
65 func_node->clear_read_map(tid);
67 func_inst_list_t * curr_inst_list = func_inst_lists->back();
68 func_node->link_insts(curr_inst_list);
70 (*thrd_func_list)[id].pop_back();
71 func_inst_lists->pop_back();
73 model_print("trying to exit with a wrong function id\n");
74 model_print("--- last_func: %d, func_id: %d\n", last_func_id, func_id);
76 //model_print("thread %d exiting func %d\n", tid, func_id);
79 void ModelHistory::resize_func_nodes(uint32_t new_size)
81 uint32_t old_size = func_nodes.size();
83 if ( old_size < new_size )
84 func_nodes.resize(new_size);
86 for (uint32_t id = old_size;id < new_size;id++) {
87 const char * func_name = func_map_rev[id];
88 FuncNode * func_node = new FuncNode();
89 func_node->set_func_id(id);
90 func_node->set_func_name(func_name);
91 func_nodes[id] = func_node;
95 void ModelHistory::process_action(ModelAction *act, thread_id_t tid)
97 /* return if thread i has not entered any function or has exited
99 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
100 SnapVector< SnapList<func_inst_list_t *> *> *
101 thrd_func_inst_lists = model->get_execution()->get_thrd_func_inst_lists();
103 uint32_t id = id_to_int(tid);
104 if ( thrd_func_list->size() <= id )
107 /* get the function id that thread i is currently in */
108 uint32_t func_id = (*thrd_func_list)[id].back();
109 SnapList<func_inst_list_t *> * func_inst_lists = thrd_func_inst_lists->at(id);
111 if ( func_nodes.size() <= func_id )
112 resize_func_nodes( func_id + 1 );
114 FuncNode * func_node = func_nodes[func_id];
115 ASSERT (func_node != NULL);
117 /* add corresponding FuncInst to func_node */
118 FuncInst * inst = func_node->get_or_add_action(act);
123 // if (inst->is_read())
124 // func_node->store_read(act, tid);
126 if (inst->is_write())
127 add_to_write_history(act->get_location(), act->get_write_value());
129 /* add to curr_inst_list */
130 func_inst_list_t * curr_inst_list = func_inst_lists->back();
131 ASSERT(curr_inst_list != NULL);
132 curr_inst_list->push_back(inst);
135 /* return the FuncNode given its func_id */
136 FuncNode * ModelHistory::get_func_node(uint32_t func_id)
138 if (func_nodes.size() <= func_id) // this node has not been added
141 return func_nodes[func_id];
144 uint64_t ModelHistory::query_last_read(void * location, thread_id_t tid)
146 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
147 uint32_t id = id_to_int(tid);
149 ASSERT( thrd_func_list->size() > id );
150 uint32_t func_id = (*thrd_func_list)[id].back();
151 FuncNode * func_node = func_nodes[func_id];
153 uint64_t last_read_val = 0xdeadbeef;
154 if (func_node != NULL) {
155 last_read_val = func_node->query_last_read(location, tid);
158 return last_read_val;
161 void ModelHistory::add_to_write_history(void * location, uint64_t write_val)
163 write_set_t * write_set = write_history.get(location);
165 if (write_set == NULL) {
166 write_set = new write_set_t();
167 write_history.put(location, write_set);
170 write_set->add(write_val);
171 write_locations.add(location);
174 void ModelHistory::print_write()
178 void ModelHistory::print_func_node()
180 /* function id starts with 1 */
181 for (uint32_t i = 1; i < func_nodes.size(); i++) {
182 FuncNode * func_node = func_nodes[i];
184 func_inst_list_mt * entry_insts = func_node->get_entry_insts();
185 model_print("function %s has entry actions\n", func_node->get_func_name());
187 mllnode<FuncInst*>* it;
188 for (it = entry_insts->begin();it != NULL;it=it->getNext()) {
189 FuncInst *inst = it->getVal();
190 model_print("type: %d, at: %s\n", inst->get_type(), inst->get_position());
193 func_inst_list_mt * inst_list = funcNode->get_inst_list();
195 model_print("function %s has following actions\n", funcNode->get_func_name());
196 func_inst_list_mt::iterator it;
197 for (it = inst_list->begin(); it != inst_list->end(); it++) {
198 FuncInst *inst = *it;
199 model_print("type: %d, at: %s\n", inst->get_type(), inst->get_position());