11 /** @brief Constructor */
12 ModelHistory::ModelHistory() :
13 func_counter(1), /* function id starts with 1 */
19 void ModelHistory::enter_function(const uint32_t func_id, thread_id_t tid)
21 //model_print("thread %d entering func %d\n", tid, func_id);
22 uint32_t id = id_to_int(tid);
23 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
24 SnapVector< SnapList<func_inst_list_t *> *> *
25 thrd_func_inst_lists = model->get_execution()->get_thrd_func_inst_lists();
27 if ( thrd_func_list->size() <= id ) {
28 thrd_func_list->resize( id + 1 );
29 thrd_func_inst_lists->resize( id + 1 );
32 SnapList<func_inst_list_t *> * func_inst_lists = thrd_func_inst_lists->at(id);
34 if (func_inst_lists == NULL) {
35 func_inst_lists = new SnapList< func_inst_list_t *>();
36 thrd_func_inst_lists->at(id) = func_inst_lists;
39 (*thrd_func_list)[id].push_back(func_id);
40 func_inst_lists->push_back( new func_inst_list_t() );
42 if ( func_nodes.size() <= func_id )
43 resize_func_nodes( func_id + 1 );
46 /* @param func_id a non-zero value */
47 void ModelHistory::exit_function(const uint32_t func_id, thread_id_t tid)
49 uint32_t id = id_to_int(tid);
50 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
51 SnapVector< SnapList<func_inst_list_t *> *> *
52 thrd_func_inst_lists = model->get_execution()->get_thrd_func_inst_lists();
54 SnapList<func_inst_list_t *> * func_inst_lists = thrd_func_inst_lists->at(id);
55 uint32_t last_func_id = (*thrd_func_list)[id].back();
57 if (last_func_id == func_id) {
58 /* clear read map upon exiting functions */
59 FuncNode * func_node = func_nodes[func_id];
60 func_node->clear_read_map(tid);
62 func_inst_list_t * curr_inst_list = func_inst_lists->back();
63 func_node->link_insts(curr_inst_list);
65 (*thrd_func_list)[id].pop_back();
66 func_inst_lists->pop_back();
68 model_print("trying to exit with a wrong function id\n");
69 model_print("--- last_func: %d, func_id: %d\n", last_func_id, func_id);
71 //model_print("thread %d exiting func %d\n", tid, func_id);
74 void ModelHistory::resize_func_nodes(uint32_t new_size)
76 uint32_t old_size = func_nodes.size();
78 if ( old_size < new_size )
79 func_nodes.resize(new_size);
81 for (uint32_t id = old_size; id < new_size; id++) {
82 const char * func_name = func_map_rev[id];
83 FuncNode * func_node = new FuncNode();
84 func_node->set_func_id(id);
85 func_node->set_func_name(func_name);
86 func_nodes[id] = func_node;
90 void ModelHistory::process_action(ModelAction *act, thread_id_t tid)
92 /* return if thread i has not entered any function or has exited
94 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
95 SnapVector< SnapList<func_inst_list_t *> *> *
96 thrd_func_inst_lists = model->get_execution()->get_thrd_func_inst_lists();
98 uint32_t id = id_to_int(tid);
99 if ( thrd_func_list->size() <= id )
101 // else if ( (*thrd_func_list)[id] == NULL)
104 /* get the function id that thread i is currently in */
105 SnapList<func_inst_list_t *> * func_inst_lists = thrd_func_inst_lists->at(id);
107 uint32_t func_id = (*thrd_func_list)[id].back();
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 /* add to curr_inst_list */
124 func_inst_list_t * curr_inst_list = func_inst_lists->back();
125 ASSERT(curr_inst_list != NULL);
126 curr_inst_list->push_back(inst);
129 /* return the FuncNode given its func_id */
130 FuncNode * ModelHistory::get_func_node(uint32_t func_id)
132 if (func_nodes.size() <= func_id) // this node has not been added
135 return func_nodes[func_id];
138 uint64_t ModelHistory::query_last_read(void * location, thread_id_t tid)
140 SnapVector<func_id_list_t> * thrd_func_list = model->get_execution()->get_thrd_func_list();
141 uint32_t id = id_to_int(tid);
143 ASSERT( thrd_func_list->size() > id );
144 uint32_t func_id = (*thrd_func_list)[id].back();
145 FuncNode * func_node = func_nodes[func_id];
147 uint64_t last_read_val = 0xdeadbeef;
148 if (func_node != NULL) {
149 last_read_val = func_node->query_last_read(location, tid);
152 return last_read_val;
155 void ModelHistory::print()
157 /* function id starts with 1 */
158 for (uint32_t i = 1;i < func_nodes.size();i++) {
159 FuncNode * func_node = func_nodes[i];
161 func_inst_list_mt * entry_insts = func_node->get_entry_insts();
162 model_print("function %s has entry actions\n", func_node->get_func_name());
164 func_inst_list_mt::iterator it;
165 for (it = entry_insts->begin();it != entry_insts->end();it++) {
166 FuncInst *inst = *it;
167 model_print("type: %d, at: %s\n", inst->get_type(), inst->get_position());
171 func_inst_list_mt * inst_list = funcNode->get_inst_list();
173 model_print("function %s has following actions\n", funcNode->get_func_name());
174 func_inst_list_mt::iterator it;
175 for (it = inst_list->begin(); it != inst_list->end(); it++) {
176 FuncInst *inst = *it;
177 model_print("type: %d, at: %s\n", inst->get_type(), inst->get_position());