3 FuncNode::FuncNode(ModelHistory * history) :
5 predicate_tree_initialized(false),
13 predicate_tree_entry = new Predicate(NULL, true);
14 predicate_tree_entry->add_predicate_expr(NOPREDICATE, NULL, true);
16 // memory will be reclaimed after each execution
17 read_locations = new loc_set_t();
18 val_loc_map = new HashTable<uint64_t, loc_set_t *, uint64_t, 0>();
19 loc_may_equal_map = new HashTable<void *, loc_set_t *, uintptr_t, 0>();
20 values_may_read_from = new value_set_t();
23 /* Reallocate some snapshotted memories when new executions start */
24 void FuncNode::set_new_exec_flag()
26 // for (uint i = 0; i < thrd_read_map.size(); i++)
27 // thrd_read_map[i] = new read_map_t();
29 for (mllnode<FuncInst *> * it = inst_list.begin(); it != NULL; it = it->getNext()) {
30 FuncInst * inst = it->getVal();
31 inst->reset_location();
34 read_locations = new loc_set_t();
35 val_loc_map = new HashTable<uint64_t, loc_set_t *, uint64_t, 0>();
36 loc_may_equal_map = new HashTable<void *, loc_set_t *, uintptr_t, 0>();
37 values_may_read_from = new value_set_t();
40 /* Check whether FuncInst with the same type, position, and location
41 * as act has been added to func_inst_map or not. If not, add it.
43 * Note: currently, actions with the same position are filtered out by process_action,
44 * so the collision list of FuncInst is not used. May remove it later.
46 void FuncNode::add_inst(ModelAction *act)
49 const char * position = act->get_position();
51 /* THREAD* actions, ATOMIC_LOCK, ATOMIC_TRYLOCK, and ATOMIC_UNLOCK
52 * actions are not tagged with their source line numbers
57 if ( func_inst_map.contains(position) ) {
58 FuncInst * inst = func_inst_map.get(position);
60 ASSERT(inst->get_type() == act->get_type());
62 // locations are set to NULL when new executions start
63 if (inst->get_location() == NULL)
64 inst->set_location(act->get_location());
66 if (inst->get_location() != act->get_location())
67 inst->not_single_location();
72 FuncInst * func_inst = new FuncInst(act, this);
74 func_inst_map.put(position, func_inst);
75 inst_list.push_back(func_inst);
78 /* Get the FuncInst with the same type, position, and location
81 * @return FuncInst with the same type, position, and location as act */
82 FuncInst * FuncNode::get_inst(ModelAction *act)
85 const char * position = act->get_position();
87 /* THREAD* actions, ATOMIC_LOCK, ATOMIC_TRYLOCK, and ATOMIC_UNLOCK
88 * actions are not tagged with their source line numbers
93 FuncInst * inst = func_inst_map.get(position);
97 action_type inst_type = inst->get_type();
98 action_type act_type = act->get_type();
100 // else if branch: an RMWRCAS action is converted to a RMW or READ action
101 if (inst_type == act_type)
103 else if (inst_type == ATOMIC_RMWRCAS &&
104 (act_type == ATOMIC_RMW || act_type == ATOMIC_READ))
111 void FuncNode::add_entry_inst(FuncInst * inst)
116 mllnode<FuncInst *> * it;
117 for (it = entry_insts.begin(); it != NULL; it = it->getNext()) {
118 if (inst == it->getVal())
122 entry_insts.push_back(inst);
126 * @brief Convert ModelAdtion list to FuncInst list
127 * @param act_list A list of ModelActions
129 void FuncNode::update_tree(action_list_t * act_list)
131 if (act_list == NULL || act_list->size() == 0)
134 HashTable<void *, value_set_t *, uintptr_t, 4> * write_history = history->getWriteHistory();
136 /* build inst_list from act_list for later processing */
137 func_inst_list_t inst_list;
138 action_list_t read_act_list;
140 for (sllnode<ModelAction *> * it = act_list->begin(); it != NULL; it = it->getNext()) {
141 ModelAction * act = it->getVal();
142 FuncInst * func_inst = get_inst(act);
144 if (func_inst == NULL)
147 inst_list.push_back(func_inst);
149 if (func_inst->is_read()) {
150 read_act_list.push_back(act);
152 /* the first time an action reads from some location, import all the values that have
153 * been written to this location from ModelHistory and notify ModelHistory that this
154 * FuncNode may read from this location.
156 void * loc = act->get_location();
157 if (!read_locations->contains(loc)) {
158 read_locations->add(loc);
159 value_set_t * write_values = write_history->get(loc);
160 add_to_val_loc_map(write_values, loc);
161 history->add_to_loc_func_nodes_map(loc, this);
166 model_print("function %s\n", func_name);
167 // print_val_loc_map();
169 update_inst_tree(&inst_list);
170 update_predicate_tree(&read_act_list);
172 print_predicate_tree();
176 * @brief Link FuncInsts in inst_list - add one FuncInst to another's predecessors and successors
177 * @param inst_list A list of FuncInsts
179 void FuncNode::update_inst_tree(func_inst_list_t * inst_list)
181 if (inst_list == NULL)
183 else if (inst_list->size() == 0)
187 sllnode<FuncInst *>* it = inst_list->begin();
188 sllnode<FuncInst *>* prev;
190 /* add the first instruction to the list of entry insts */
191 FuncInst * entry_inst = it->getVal();
192 add_entry_inst(entry_inst);
196 prev = it->getPrev();
198 FuncInst * prev_inst = prev->getVal();
199 FuncInst * curr_inst = it->getVal();
201 prev_inst->add_succ(curr_inst);
202 curr_inst->add_pred(prev_inst);
208 /* @param tid thread id
209 * Store the values read by atomic read actions into thrd_read_map */
210 void FuncNode::store_read(ModelAction * act, uint32_t tid)
215 void * location = act->get_location();
216 uint64_t read_from_val = act->get_reads_from_value();
218 // resize and initialize
219 uint32_t old_size = thrd_read_map.size();
220 if (old_size <= tid) {
221 thrd_read_map.resize(tid + 1);
222 for (uint32_t i = old_size; i < tid + 1;i++)
223 thrd_read_map[i] = new read_map_t();
226 read_map_t * read_map = thrd_read_map[tid];
227 read_map->put(location, read_from_val);
231 uint64_t FuncNode::query_last_read(void * location, uint32_t tid)
234 if (thrd_read_map.size() <= tid)
237 read_map_t * read_map = thrd_read_map[tid];
239 // last read value not found
240 if ( !read_map->contains(location) )
243 uint64_t read_val = read_map->get(location);
248 /* @param tid thread id
249 * Reset read map for a thread. This function shall only be called
250 * when a thread exits a function
252 void FuncNode::clear_read_map(uint32_t tid)
255 if (thrd_read_map.size() <= tid)
258 thrd_read_map[tid]->reset();
262 void FuncNode::update_predicate_tree(action_list_t * act_list)
264 if (act_list == NULL || act_list->size() == 0)
267 /* map a FuncInst to the its predicate */
268 HashTable<FuncInst *, Predicate *, uintptr_t, 0> inst_pred_map(128);
270 // number FuncInsts to detect loops
271 HashTable<FuncInst *, uint32_t, uintptr_t, 0> inst_id_map(128);
272 uint32_t inst_counter = 0;
274 HashTable<void *, ModelAction *, uintptr_t, 0> loc_act_map(128);
275 HashTable<FuncInst *, ModelAction *, uintptr_t, 0> inst_act_map(128);
277 sllnode<ModelAction *> *it = act_list->begin();
278 Predicate * curr_pred = predicate_tree_entry;
280 ModelAction * next_act = it->getVal();
281 FuncInst * next_inst = get_inst(next_act);
282 SnapVector<Predicate *> * unset_predicates = new SnapVector<Predicate *>();
284 bool branch_found = follow_branch(&curr_pred, next_inst, next_act, &inst_act_map, unset_predicates);
286 // no predicate expressions, follow the only branch
287 if (!branch_found && unset_predicates->size() != 0) {
288 ASSERT(unset_predicates->size() == 1);
289 Predicate * one_branch = (*unset_predicates)[0];
290 curr_pred = one_branch;
294 delete unset_predicates;
297 if (!branch_found && inst_id_map.contains(next_inst)) {
298 FuncInst * curr_inst = curr_pred->get_func_inst();
299 uint32_t curr_id = inst_id_map.get(curr_inst);
300 uint32_t next_id = inst_id_map.get(next_inst);
302 if (curr_id >= next_id) {
303 Predicate * old_pred = inst_pred_map.get(next_inst);
304 Predicate * back_pred = old_pred->get_parent();
306 curr_pred->add_backedge(back_pred);
307 curr_pred = back_pred;
313 // generate new branches
315 SnapVector<struct half_pred_expr *> half_pred_expressions;
316 void * loc = next_act->get_location();
318 if ( loc_act_map.contains(loc) ) {
319 ModelAction * last_act = loc_act_map.get(loc);
320 FuncInst * last_inst = get_inst(last_act);
321 struct half_pred_expr * expression = new half_pred_expr(EQUALITY, last_inst);
322 half_pred_expressions.push_back(expression);
323 } else if ( next_inst->is_single_location() ){
324 loc_set_t * loc_may_equal = loc_may_equal_map->get(loc);
326 if (loc_may_equal != NULL) {
327 loc_set_iter * loc_it = loc_may_equal->iterator();
328 while (loc_it->hasNext()) {
329 void * neighbor = loc_it->next();
330 if (loc_act_map.contains(neighbor)) {
331 ModelAction * last_act = loc_act_map.get(neighbor);
332 FuncInst * last_inst = get_inst(last_act);
333 struct half_pred_expr * expression = new half_pred_expr(EQUALITY, last_inst);
334 half_pred_expressions.push_back(expression);
339 // next_inst is not single location
340 struct half_pred_expr * expression = new half_pred_expr(NULLITY, NULL);
341 half_pred_expressions.push_back(expression);
344 if (half_pred_expressions.size() == 0) {
345 // no predicate needs to be generated
346 Predicate * new_pred = new Predicate(next_inst);
347 curr_pred->add_child(new_pred);
348 new_pred->set_parent(curr_pred);
350 if (curr_pred->is_entry_predicate())
351 new_pred->add_predicate_expr(NOPREDICATE, NULL, true);
353 curr_pred = new_pred;
355 generate_predicate(&curr_pred, next_inst, &half_pred_expressions);
356 bool branch_found = follow_branch(&curr_pred, next_inst, next_act, &inst_act_map, NULL);
357 ASSERT(branch_found);
361 inst_pred_map.put(next_inst, curr_pred);
362 if (!inst_id_map.contains(next_inst))
363 inst_id_map.put(next_inst, inst_counter++);
365 loc_act_map.put(next_act->get_location(), next_act);
366 inst_act_map.put(next_inst, next_act);
371 /* Given curr_pred and next_inst, find the branch following curr_pred that
372 * contains next_inst and the correct predicate.
373 * @return true if branch found, false otherwise.
375 bool FuncNode::follow_branch(Predicate ** curr_pred, FuncInst * next_inst, ModelAction * next_act,
376 HashTable<FuncInst *, ModelAction *, uintptr_t, 0> * inst_act_map,
377 SnapVector<Predicate *> * unset_predicates)
379 /* check if a branch with func_inst and corresponding predicate exists */
380 bool branch_found = false;
381 ModelVector<Predicate *> * branches = (*curr_pred)->get_children();
382 for (uint i = 0; i < branches->size(); i++) {
383 Predicate * branch = (*branches)[i];
384 if (branch->get_func_inst() != next_inst)
387 /* check against predicate expressions */
388 bool predicate_correct = true;
389 PredExprSet * pred_expressions = branch->get_pred_expressions();
390 PredExprSetIter * pred_expr_it = pred_expressions->iterator();
392 if (pred_expressions->getSize() == 0) {
393 predicate_correct = false;
394 unset_predicates->push_back(branch);
397 while (pred_expr_it->hasNext()) {
398 pred_expr * pred_expression = pred_expr_it->next();
399 uint64_t last_read, next_read;
402 switch(pred_expression->token) {
404 predicate_correct = true;
407 FuncInst * to_be_compared;
408 ModelAction * last_act;
410 to_be_compared = pred_expression->func_inst;
411 last_act = inst_act_map->get(to_be_compared);
413 last_read = last_act->get_reads_from_value();
414 next_read = next_act->get_reads_from_value();
415 equality = (last_read == next_read);
416 if (equality != pred_expression->value)
417 predicate_correct = false;
421 next_read = next_act->get_reads_from_value();
422 equality = ((void*)next_read == NULL);
423 if (equality != pred_expression->value)
424 predicate_correct = false;
427 predicate_correct = false;
428 model_print("unkown predicate token\n");
433 if (predicate_correct) {
443 /* Able to generate complex predicates when there are multiple predciate expressions */
444 void FuncNode::generate_predicate(Predicate ** curr_pred, FuncInst * next_inst,
445 SnapVector<struct half_pred_expr *> * half_pred_expressions)
447 ASSERT(half_pred_expressions->size() != 0);
448 SnapVector<Predicate *> predicates;
450 struct half_pred_expr * half_expr = (*half_pred_expressions)[0];
451 predicates.push_back(new Predicate(next_inst));
452 predicates.push_back(new Predicate(next_inst));
454 predicates[0]->add_predicate_expr(half_expr->token, half_expr->func_inst, true);
455 predicates[1]->add_predicate_expr(half_expr->token, half_expr->func_inst, false);
457 for (uint i = 1; i < half_pred_expressions->size(); i++) {
458 half_expr = (*half_pred_expressions)[i];
460 uint old_size = predicates.size();
461 for (uint j = 0; j < old_size; j++) {
462 Predicate * pred = predicates[j];
463 Predicate * new_pred = new Predicate(next_inst);
464 new_pred->copy_predicate_expr(pred);
466 pred->add_predicate_expr(half_expr->token, half_expr->func_inst, true);
467 new_pred->add_predicate_expr(half_expr->token, half_expr->func_inst, false);
469 predicates.push_back(new_pred);
473 for (uint i = 0; i < predicates.size(); i++) {
474 Predicate * pred= predicates[i];
475 (*curr_pred)->add_child(pred);
476 pred->set_parent(*curr_pred);
481 void FuncNode::add_to_val_loc_map(uint64_t val, void * loc)
483 loc_set_t * locations = val_loc_map->get(val);
485 if (locations == NULL) {
486 locations = new loc_set_t();
487 val_loc_map->put(val, locations);
490 update_loc_may_equal_map(loc, locations);
492 values_may_read_from->add(val);
495 void FuncNode::add_to_val_loc_map(value_set_t * values, void * loc)
497 value_set_iter * it = values->iterator();
498 while (it->hasNext()) {
499 uint64_t val = it->next();
500 add_to_val_loc_map(val, loc);
504 void FuncNode::update_loc_may_equal_map(void * new_loc, loc_set_t * old_locations)
506 loc_set_t * neighbors = loc_may_equal_map->get(new_loc);
508 if (neighbors == NULL) {
509 neighbors = new loc_set_t();
510 loc_may_equal_map->put(new_loc, neighbors);
513 loc_set_iter * loc_it = old_locations->iterator();
514 while (loc_it->hasNext()) {
515 // new_loc: { old_locations, ... }
516 void * member = loc_it->next();
517 neighbors->add(member);
519 // for each i in old_locations, i : { new_loc, ... }
520 loc_set_t * _neighbors = loc_may_equal_map->get(member);
521 if (_neighbors == NULL) {
522 _neighbors = new loc_set_t();
523 loc_may_equal_map->put(member, _neighbors);
525 _neighbors->add(new_loc);
529 void FuncNode::print_predicate_tree()
531 model_print("digraph function_%s {\n", func_name);
532 predicate_tree_entry->print_pred_subtree();
533 model_print("}\n"); // end of graph
536 void FuncNode::print_val_loc_map()
538 value_set_iter * val_it = values_may_read_from->iterator();
539 while (val_it->hasNext()) {
540 uint64_t value = val_it->next();
541 model_print("val %llx: ", value);
543 loc_set_t * locations = val_loc_map->get(value);
544 loc_set_iter * loc_it = locations->iterator();
545 while (loc_it->hasNext()) {
546 void * location = loc_it->next();
547 model_print("%p ", location);
553 /* @param tid thread id
554 * Print the values read by the last read actions for each memory location
557 void FuncNode::print_last_read(uint32_t tid)
559 ASSERT(thrd_read_map.size() > tid);
560 read_map_t * read_map = thrd_read_map[tid];
562 mllnode<void *> * it;
563 for (it = read_locations.begin();it != NULL;it=it->getNext()) {
564 if ( !read_map->contains(it->getVal()) )
567 uint64_t read_val = read_map->get(it->getVal());
568 model_print("last read of thread %d at %p: 0x%x\n", tid, it->getVal(), read_val);