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 func_id_list_t * func_list = thrd_func_list->at(id);
33 SnapList<func_inst_list_t *> * func_inst_lists = thrd_func_inst_lists->at(id);
35 if (func_list == NULL) {
36 func_list = new func_id_list_t();
37 thrd_func_list->at(id) = func_list;
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 func_list->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 func_id_list_t * func_list = thrd_func_list->at(id);
61 SnapList<func_inst_list_t *> * func_inst_lists = thrd_func_inst_lists->at(id);
63 uint32_t last_func_id = func_list->back();
65 if (last_func_id == func_id) {
66 FuncNode * func_node = func_nodes[func_id];
67 func_node->clear_read_map(tid);
69 func_inst_list_t * curr_inst_list = func_inst_lists->back();
70 func_node->link_insts(curr_inst_list);
72 func_list->pop_back();
73 func_inst_lists->pop_back();
75 model_print("trying to exit with a wrong function id\n");
76 model_print("--- last_func: %d, func_id: %d\n", last_func_id, func_id);
78 //model_print("thread %d exiting func %d\n", tid, func_id);
81 void ModelHistory::resize_func_nodes(uint32_t new_size)
83 uint32_t old_size = func_nodes.size();
85 if ( old_size < new_size )
86 func_nodes.resize(new_size);
88 for (uint32_t id = old_size;id < new_size;id++) {
89 const char * func_name = func_map_rev[id];
90 FuncNode * func_node = new FuncNode();
91 func_node->set_func_id(id);
92 func_node->set_func_name(func_name);
93 func_nodes[id] = func_node;
97 void ModelHistory::process_action(ModelAction *act, thread_id_t tid)
99 /* return if thread i has not entered any function or has exited
100 from all functions */
101 SnapVector<func_id_list_t *> * thrd_func_list = model->get_execution()->get_thrd_func_list();
102 SnapVector< SnapList<func_inst_list_t *> *> *
103 thrd_func_inst_lists = model->get_execution()->get_thrd_func_inst_lists();
105 uint32_t id = id_to_int(tid);
106 if ( thrd_func_list->size() <= id )
108 else if (thrd_func_list->at(id) == NULL)
111 /* get the function id that thread i is currently in */
112 func_id_list_t * func_list = thrd_func_list->at(id);
113 SnapList<func_inst_list_t *> * func_inst_lists = thrd_func_inst_lists->at(id);
115 uint32_t func_id = func_list->back();
117 if ( func_nodes.size() <= func_id )
118 resize_func_nodes( func_id + 1 );
120 FuncNode * func_node = func_nodes[func_id];
121 ASSERT (func_node != NULL);
123 /* add corresponding FuncInst to func_node */
124 FuncInst * inst = func_node->get_or_add_action(act);
129 // if (inst->is_read())
130 // func_node->store_read(act, tid);
132 /* add to curr_inst_list */
133 func_inst_list_t * curr_inst_list = func_inst_lists->back();
134 ASSERT(curr_inst_list != NULL);
135 curr_inst_list->push_back(inst);
138 /* return the FuncNode given its func_id */
139 FuncNode * ModelHistory::get_func_node(uint32_t func_id)
141 if (func_nodes.size() <= func_id) // this node has not been added
144 return func_nodes[func_id];
147 void ModelHistory::print()
149 /* function id starts with 1 */
150 for (uint32_t i = 1;i < func_nodes.size();i++) {
151 FuncNode * func_node = func_nodes[i];
153 func_inst_list_mt * entry_insts = func_node->get_entry_insts();
154 model_print("function %s has entry actions\n", func_node->get_func_name());
156 func_inst_list_mt::iterator it;
157 for (it = entry_insts->begin();it != entry_insts->end();it++) {
158 FuncInst *inst = *it;
159 model_print("type: %d, at: %s\n", inst->get_type(), inst->get_position());
163 func_inst_list_mt * inst_list = funcNode->get_inst_list();
165 model_print("function %s has following actions\n", funcNode->get_func_name());
166 func_inst_list_mt::iterator it;
167 for (it = inst_list->begin(); it != inst_list->end(); it++) {
168 FuncInst *inst = *it;
169 model_print("type: %d, at: %s\n", inst->get_type(), inst->get_position());