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 uint oldsize = thrd_func_list->size();
30 thrd_func_list->resize( id + 1 );
31 for(uint i=oldsize;i<id+1;i++) {
32 new(&(*thrd_func_list)[i]) func_id_list_t();
34 thrd_func_inst_lists->resize( id + 1 );
37 SnapList<func_inst_list_t *> * func_inst_lists = thrd_func_inst_lists->at(id);
39 if (func_inst_lists == NULL) {
40 func_inst_lists = new SnapList< func_inst_list_t *>();
41 thrd_func_inst_lists->at(id) = func_inst_lists;
44 (*thrd_func_list)[id].push_back(func_id);
45 func_inst_lists->push_back( new func_inst_list_t() );
47 if ( func_nodes.size() <= func_id )
48 resize_func_nodes( func_id + 1 );
51 /* @param func_id a non-zero value */
52 void ModelHistory::exit_function(const uint32_t func_id, thread_id_t tid)
54 uint32_t id = id_to_int(tid);
55 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
56 SnapVector< SnapList<func_inst_list_t *> *> *
57 thrd_func_inst_lists = model->get_execution()->get_thrd_func_inst_lists();
59 SnapList<func_inst_list_t *> * func_inst_lists = thrd_func_inst_lists->at(id);
60 uint32_t last_func_id = (*thrd_func_list)[id].back();
62 if (last_func_id == func_id) {
63 FuncNode * func_node = func_nodes[func_id];
64 func_node->clear_read_map(tid);
66 func_inst_list_t * curr_inst_list = func_inst_lists->back();
67 func_node->link_insts(curr_inst_list);
69 (*thrd_func_list)[id].pop_back();
70 func_inst_lists->pop_back();
72 model_print("trying to exit with a wrong function id\n");
73 model_print("--- last_func: %d, func_id: %d\n", last_func_id, func_id);
75 //model_print("thread %d exiting func %d\n", tid, func_id);
78 void ModelHistory::resize_func_nodes(uint32_t new_size)
80 uint32_t old_size = func_nodes.size();
82 if ( old_size < new_size )
83 func_nodes.resize(new_size);
85 for (uint32_t id = old_size;id < new_size;id++) {
86 const char * func_name = func_map_rev[id];
87 FuncNode * func_node = new FuncNode();
88 func_node->set_func_id(id);
89 func_node->set_func_name(func_name);
90 func_nodes[id] = func_node;
94 void ModelHistory::process_action(ModelAction *act, thread_id_t tid)
96 /* return if thread i has not entered any function or has exited
98 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
99 SnapVector< SnapList<func_inst_list_t *> *> *
100 thrd_func_inst_lists = model->get_execution()->get_thrd_func_inst_lists();
102 uint32_t id = id_to_int(tid);
103 if ( thrd_func_list->size() <= id )
106 /* get the function id that thread i is currently in */
107 uint32_t func_id = (*thrd_func_list)[id].back();
108 SnapList<func_inst_list_t *> * func_inst_lists = thrd_func_inst_lists->at(id);
110 if ( func_nodes.size() <= func_id )
111 resize_func_nodes( func_id + 1 );
113 FuncNode * func_node = func_nodes[func_id];
114 ASSERT (func_node != NULL);
116 /* add corresponding FuncInst to func_node */
117 FuncInst * inst = func_node->get_or_add_action(act);
122 // if (inst->is_read())
123 // func_node->store_read(act, tid);
125 if (inst->is_write())
126 add_to_write_history(act->get_location(), act->get_write_value());
128 /* add to curr_inst_list */
129 func_inst_list_t * curr_inst_list = func_inst_lists->back();
130 ASSERT(curr_inst_list != NULL);
131 curr_inst_list->push_back(inst);
134 /* return the FuncNode given its func_id */
135 FuncNode * ModelHistory::get_func_node(uint32_t func_id)
137 if (func_nodes.size() <= func_id) // this node has not been added
140 return func_nodes[func_id];
143 uint64_t ModelHistory::query_last_read(void * location, thread_id_t tid)
145 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
146 uint32_t id = id_to_int(tid);
148 ASSERT( thrd_func_list->size() > id );
149 uint32_t func_id = (*thrd_func_list)[id].back();
150 FuncNode * func_node = func_nodes[func_id];
152 uint64_t last_read_val = 0xdeadbeef;
153 if (func_node != NULL) {
154 last_read_val = func_node->query_last_read(location, tid);
157 return last_read_val;
160 void ModelHistory::add_to_write_history(void * location, uint64_t write_val)
162 if ( !write_history.contains(location) )
163 write_history.put(location, new write_set_t() );
165 write_set_t * write_set = write_history.get(location);
166 write_set->add(write_val);
169 void ModelHistory::print()
171 /* function id starts with 1 */
172 for (uint32_t i = 1;i < func_nodes.size();i++) {
173 FuncNode * func_node = func_nodes[i];
175 func_inst_list_mt * entry_insts = func_node->get_entry_insts();
176 model_print("function %s has entry actions\n", func_node->get_func_name());
178 mllnode<FuncInst*>* it;
179 for (it = entry_insts->begin();it != NULL;it=it->getNext()) {
180 FuncInst *inst = it->getVal();
181 model_print("type: %d, at: %s\n", inst->get_type(), inst->get_position());
185 func_inst_list_mt * inst_list = funcNode->get_inst_list();
187 model_print("function %s has following actions\n", funcNode->get_func_name());
188 func_inst_list_mt::iterator it;
189 for (it = inst_list->begin(); it != inst_list->end(); it++) {
190 FuncInst *inst = *it;
191 model_print("type: %d, at: %s\n", inst->get_type(), inst->get_position());