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 thrd_func_list->resize( id + 1 );
31 thrd_func_inst_lists->resize( id + 1 );
34 SnapList<func_inst_list_t *> * func_inst_lists = thrd_func_inst_lists->at(id);
36 if (func_inst_lists == NULL) {
37 func_inst_lists = new SnapList< func_inst_list_t *>();
38 thrd_func_inst_lists->at(id) = func_inst_lists;
41 (*thrd_func_list)[id].push_back(func_id);
42 func_inst_lists->push_back( new func_inst_list_t() );
44 if ( func_nodes.size() <= func_id )
45 resize_func_nodes( func_id + 1 );
48 /* @param func_id a non-zero value */
49 void ModelHistory::exit_function(const uint32_t func_id, thread_id_t tid)
51 uint32_t id = id_to_int(tid);
52 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
53 SnapVector< SnapList<func_inst_list_t *> *> *
54 thrd_func_inst_lists = model->get_execution()->get_thrd_func_inst_lists();
56 SnapList<func_inst_list_t *> * func_inst_lists = thrd_func_inst_lists->at(id);
57 uint32_t last_func_id = (*thrd_func_list)[id].back();
59 if (last_func_id == func_id) {
60 /* clear read map upon exiting functions */
61 FuncNode * func_node = func_nodes[func_id];
62 func_node->clear_read_map(tid);
64 func_inst_list_t * curr_inst_list = func_inst_lists->back();
65 func_node->link_insts(curr_inst_list);
67 (*thrd_func_list)[id].pop_back();
68 func_inst_lists->pop_back();
70 model_print("trying to exit with a wrong function id\n");
71 model_print("--- last_func: %d, func_id: %d\n", last_func_id, func_id);
73 //model_print("thread %d exiting func %d\n", tid, func_id);
76 void ModelHistory::resize_func_nodes(uint32_t new_size)
78 uint32_t old_size = func_nodes.size();
80 if ( old_size < new_size )
81 func_nodes.resize(new_size);
83 for (uint32_t id = old_size; id < new_size; id++) {
84 const char * func_name = func_map_rev[id];
85 FuncNode * func_node = new FuncNode();
86 func_node->set_func_id(id);
87 func_node->set_func_name(func_name);
88 func_nodes[id] = func_node;
92 void ModelHistory::process_action(ModelAction *act, thread_id_t tid)
94 /* return if thread i has not entered any function or has exited
96 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
97 SnapVector< SnapList<func_inst_list_t *> *> *
98 thrd_func_inst_lists = model->get_execution()->get_thrd_func_inst_lists();
100 uint32_t id = id_to_int(tid);
101 if ( thrd_func_list->size() <= id )
104 /* get the function id that thread i is currently in */
105 uint32_t func_id = (*thrd_func_list)[id].back();
106 SnapList<func_inst_list_t *> * func_inst_lists = thrd_func_inst_lists->at(id);
108 if ( func_nodes.size() <= func_id )
109 resize_func_nodes( func_id + 1 );
111 FuncNode * func_node = func_nodes[func_id];
112 ASSERT (func_node != NULL);
114 /* add corresponding FuncInst to func_node */
115 FuncInst * inst = func_node->get_or_add_action(act);
121 func_node->store_read(act, tid);
123 if (inst->is_write())
124 func_node->add_to_write_history(act->get_location(), act->get_write_value());
126 /* add to curr_inst_list */
127 func_inst_list_t * curr_inst_list = func_inst_lists->back();
128 ASSERT(curr_inst_list != NULL);
129 curr_inst_list->push_back(inst);
132 /* return the FuncNode given its func_id */
133 FuncNode * ModelHistory::get_func_node(uint32_t func_id)
135 if (func_nodes.size() <= func_id) // this node has not been added
138 return func_nodes[func_id];
141 uint64_t ModelHistory::query_last_read(void * location, thread_id_t tid)
143 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
144 uint32_t id = id_to_int(tid);
146 ASSERT( thrd_func_list->size() > id );
147 uint32_t func_id = (*thrd_func_list)[id].back();
148 FuncNode * func_node = func_nodes[func_id];
150 uint64_t last_read_val = 0xdeadbeef;
151 if (func_node != NULL) {
152 last_read_val = func_node->query_last_read(location, tid);
155 return last_read_val;
158 void ModelHistory::add_to_write_history(void * location, uint64_t write_val)
160 write_set_t * write_set = write_history.get(location);
162 if (write_set == NULL) {
163 write_set = new write_set_t();
164 write_history.put(location, write_set);
167 write_set->add(write_val);
168 write_locations.add(location);
171 void ModelHistory::print_write()
175 void ModelHistory::print_func_node()
177 /* function id starts with 1 */
178 for (uint32_t i = 1; i < func_nodes.size(); i++) {
179 FuncNode * func_node = func_nodes[i];
181 func_inst_list_mt * entry_insts = func_node->get_entry_insts();
182 model_print("function %s has entry actions\n", func_node->get_func_name());
184 func_inst_list_mt::iterator it;
185 for (it = entry_insts->begin();it != entry_insts->end();it++) {
186 FuncInst *inst = *it;
187 model_print("type: %d, at: %s\n", inst->get_type(), inst->get_position());
190 func_inst_list_mt * inst_list = funcNode->get_inst_list();
192 model_print("function %s has following actions\n", funcNode->get_func_name());
193 func_inst_list_mt::iterator it;
194 for (it = inst_list->begin(); it != inst_list->end(); it++) {
195 FuncInst *inst = *it;
196 model_print("type: %d, at: %s\n", inst->get_type(), inst->get_position());