4 predicate_tree_initialized(false),
5 predicate_tree_entry(new Predicate(NULL, true)),
12 /* Check whether FuncInst with the same type, position, and location
13 * as act has been added to func_inst_map or not. If not, add it.
15 * Note: currently, actions with the same position are filtered out by process_action,
16 * so the collision list of FuncInst is not used. May remove it later.
18 void FuncNode::add_inst(ModelAction *act)
21 const char * position = act->get_position();
23 /* THREAD* actions, ATOMIC_LOCK, ATOMIC_TRYLOCK, and ATOMIC_UNLOCK
24 * actions are not tagged with their source line numbers
29 if ( func_inst_map.contains(position) ) {
30 FuncInst * inst = func_inst_map.get(position);
32 ASSERT(inst->get_type() == act->get_type());
33 if (inst->get_location() != act->get_location())
34 inst->not_single_location();
39 FuncInst * func_inst = new FuncInst(act, this);
41 func_inst_map.put(position, func_inst);
42 inst_list.push_back(func_inst);
45 /* Get the FuncInst with the same type, position, and location
48 * @return FuncInst with the same type, position, and location as act */
49 FuncInst * FuncNode::get_inst(ModelAction *act)
52 const char * position = act->get_position();
54 /* THREAD* actions, ATOMIC_LOCK, ATOMIC_TRYLOCK, and ATOMIC_UNLOCK
55 * actions are not tagged with their source line numbers
60 FuncInst * inst = func_inst_map.get(position);
64 action_type inst_type = inst->get_type();
65 action_type act_type = act->get_type();
67 // else if branch: an RMWRCAS action is converted to a RMW or READ action
68 if (inst_type == act_type)
70 else if (inst_type == ATOMIC_RMWRCAS &&
71 (act_type == ATOMIC_RMW || act_type == ATOMIC_READ))
78 void FuncNode::add_entry_inst(FuncInst * inst)
83 mllnode<FuncInst *> * it;
84 for (it = entry_insts.begin(); it != NULL; it = it->getNext()) {
85 if (inst == it->getVal())
89 entry_insts.push_back(inst);
93 * @brief Convert ModelAdtion list to FuncInst list
94 * @param act_list A list of ModelActions
96 void FuncNode::update_tree(action_list_t * act_list)
100 else if (act_list->size() == 0)
103 /* build inst_list from act_list for later processing */
104 func_inst_list_t inst_list;
105 action_list_t read_act_list;
107 for (sllnode<ModelAction *> * it = act_list->begin(); it != NULL; it = it->getNext()) {
108 ModelAction * act = it->getVal();
109 FuncInst * func_inst = get_inst(act);
111 if (func_inst == NULL)
114 inst_list.push_back(func_inst);
116 // model_print("position: %s ", act->get_position());
119 if (func_inst->is_read())
120 read_act_list.push_back(act);
123 model_print("function %s\n", func_name);
124 update_inst_tree(&inst_list);
125 update_predicate_tree(&read_act_list);
126 deep_update(predicate_tree_entry);
128 print_predicate_tree();
132 * @brief Link FuncInsts in inst_list - add one FuncInst to another's predecessors and successors
133 * @param inst_list A list of FuncInsts
135 void FuncNode::update_inst_tree(func_inst_list_t * inst_list)
137 if (inst_list == NULL)
139 else if (inst_list->size() == 0)
143 sllnode<FuncInst *>* it = inst_list->begin();
144 sllnode<FuncInst *>* prev;
146 /* add the first instruction to the list of entry insts */
147 FuncInst * entry_inst = it->getVal();
148 add_entry_inst(entry_inst);
152 prev = it->getPrev();
154 FuncInst * prev_inst = prev->getVal();
155 FuncInst * curr_inst = it->getVal();
157 prev_inst->add_succ(curr_inst);
158 curr_inst->add_pred(prev_inst);
164 /* @param tid thread id
165 * Store the values read by atomic read actions into thrd_read_map */
166 void FuncNode::store_read(ModelAction * act, uint32_t tid)
170 void * location = act->get_location();
171 uint64_t read_from_val = act->get_reads_from_value();
173 /* resize and initialize */
174 uint32_t old_size = thrd_read_map.size();
175 if (old_size <= tid) {
176 thrd_read_map.resize(tid + 1);
177 for (uint32_t i = old_size; i < tid + 1;i++)
178 thrd_read_map[i] = new read_map_t();
181 read_map_t * read_map = thrd_read_map[tid];
182 read_map->put(location, read_from_val);
184 /* Store the memory locations where atomic reads happen */
185 // read_locations.add(location);
188 uint64_t FuncNode::query_last_read(void * location, uint32_t tid)
190 if (thrd_read_map.size() <= tid)
193 read_map_t * read_map = thrd_read_map[tid];
195 /* last read value not found */
196 if ( !read_map->contains(location) )
199 uint64_t read_val = read_map->get(location);
203 /* @param tid thread id
204 * Reset read map for a thread. This function shall only be called
205 * when a thread exits a function
207 void FuncNode::clear_read_map(uint32_t tid)
209 if (thrd_read_map.size() <= tid)
212 thrd_read_map[tid]->reset();
215 void FuncNode::update_predicate_tree(action_list_t * act_list)
217 if (act_list == NULL || act_list->size() == 0)
220 if (predicate_tree_initialized) {
223 predicate_tree_initialized = true;
225 /* map a FuncInst to the parent of its predicate */
226 HashTable<FuncInst *, Predicate *, uintptr_t, 0> inst_pred_map(128);
227 HashTable<void *, ModelAction *, uintptr_t, 0> loc_act_map(128);
229 sllnode<ModelAction *> *it = act_list->begin();
230 Predicate * curr_pred = predicate_tree_entry;
233 ModelAction * next_act = it->getVal();
234 FuncInst * next_inst = get_inst(next_act);
235 Predicate * old_pred = curr_pred;
237 bool branch_found = follow_branch(&curr_pred, next_inst, next_act, &loc_act_map);
241 Predicate * back_pred = curr_pred->get_backedge();
242 if (back_pred != NULL) {
243 curr_pred = back_pred;
247 if (inst_pred_map.contains(next_inst)) {
248 back_pred = inst_pred_map.get(next_inst);
249 curr_pred->set_backedge(back_pred);
250 curr_pred = back_pred;
255 if (!inst_pred_map.contains(next_inst))
256 inst_pred_map.put(next_inst, old_pred);
259 if ( loc_act_map.contains(next_act->get_location()) ) {
260 Predicate * new_pred1 = new Predicate(next_inst);
261 new_pred1->add_predicate(EQUALITY, next_act->get_location(), true);
263 Predicate * new_pred2 = new Predicate(next_inst);
264 new_pred2->add_predicate(EQUALITY, next_act->get_location(), false);
266 curr_pred->add_child(new_pred1);
267 curr_pred->add_child(new_pred2);
268 new_pred1->set_parent(curr_pred);
269 new_pred2->set_parent(curr_pred);
271 ModelAction * last_act = loc_act_map.get(next_act->get_location());
272 uint64_t last_read = last_act->get_reads_from_value();
273 uint64_t next_read = next_act->get_reads_from_value();
275 if ( last_read == next_read )
276 curr_pred = new_pred1;
278 curr_pred = new_pred2;
280 Predicate * new_pred = new Predicate(next_inst);
281 curr_pred->add_child(new_pred);
282 new_pred->set_parent(curr_pred);
284 curr_pred = new_pred;
288 loc_act_map.put(next_act->get_location(), next_act);
293 void FuncNode::deep_update(Predicate * curr_pred)
295 FuncInst * func_inst = curr_pred->get_func_inst();
296 if (func_inst != NULL && !func_inst->is_single_location()) {
297 bool has_null_pred = false;
298 PredExprSet * pred_expressions = curr_pred->get_pred_expressions();
299 PredExprSetIter * pred_expr_it = pred_expressions->iterator();
300 while (pred_expr_it->hasNext()) {
301 pred_expr * pred_expression = pred_expr_it->next();
302 if (pred_expression->token == NULLITY) {
303 has_null_pred = true;
308 if (!has_null_pred) {
309 // func_inst->print();
310 Predicate * parent = curr_pred->get_parent();
311 curr_pred->add_predicate(NULLITY, NULL, 0);
313 Predicate * another_branch = new Predicate(func_inst);
314 another_branch->add_predicate(NULLITY, NULL, 1);
315 parent->add_child(another_branch);
316 // another_branch.add_children(i);
320 ModelVector<Predicate *> * branches = curr_pred->get_children();
321 for (uint i = 0; i < branches->size(); i++) {
322 Predicate * branch = (*branches)[i];
327 /* Given curr_pred and next_inst, find the branch following curr_pred that contains next_inst and the correct predicate
328 * @return true if branch found, false otherwise.
330 bool FuncNode::follow_branch(Predicate ** curr_pred, FuncInst * next_inst, ModelAction * next_act,
331 HashTable<void *, ModelAction *, uintptr_t, 0> * loc_act_map)
333 /* check if a branch with func_inst and corresponding predicate exists */
334 bool branch_found = false;
335 ModelVector<Predicate *> * branches = (*curr_pred)->get_children();
336 for (uint i = 0; i < branches->size(); i++) {
337 Predicate * branch = (*branches)[i];
338 if (branch->get_func_inst() != next_inst)
341 PredExprSet * pred_expressions = branch->get_pred_expressions();
343 /* no predicate, follow the only branch */
344 if (pred_expressions->getSize() == 0) {
350 PredExprSetIter * pred_expr_it = pred_expressions->iterator();
351 while (pred_expr_it->hasNext()) {
352 pred_expr * pred_expression = pred_expr_it->next();
353 uint64_t last_read, next_read;
354 ModelAction * last_act;
357 switch(pred_expression->token) {
359 last_act = loc_act_map->get(next_act->get_location());
360 last_read = last_act->get_reads_from_value();
361 next_read = next_act->get_reads_from_value();
363 equality = (last_read == next_read);
364 if (equality == pred_expression->value) {
366 // model_print("predicate: token: %d, location: %p, value: %d - ", pred_expression->token, pred_expression->location, pred_expression->value); next_inst->print();
371 next_read = next_act->get_reads_from_value();
372 equality = ((void*)next_read == NULL);
373 //model_print("%s ", next_act->get_position()); next_act->print();
374 if (equality == pred_expression->value) {
380 model_print("unkown predicate token\n");
390 void FuncNode::print_predicate_tree()
392 model_print("digraph function_%s {\n", func_name);
393 predicate_tree_entry->print_pred_subtree();
394 model_print("}\n"); // end of graph
397 /* @param tid thread id
398 * Print the values read by the last read actions for each memory location
401 void FuncNode::print_last_read(uint32_t tid)
403 ASSERT(thrd_read_map.size() > tid);
404 read_map_t * read_map = thrd_read_map[tid];
406 mllnode<void *> * it;
407 for (it = read_locations.begin();it != NULL;it=it->getNext()) {
408 if ( !read_map->contains(it->getVal()) )
411 uint64_t read_val = read_map->get(it->getVal());
412 model_print("last read of thread %d at %p: 0x%x\n", tid, it->getVal(), read_val);