3 FuncNode::FuncNode(ModelHistory * history) :
5 predicate_tree_initialized(false),
11 predicate_tree_position()
13 predicate_tree_entry = new Predicate(NULL, true);
14 predicate_tree_entry->add_predicate_expr(NOPREDICATE, NULL, true);
16 // memories that are 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 thrd_inst_act_map = new SnapVector<inst_act_map_t *>();
22 //values_may_read_from = new value_set_t();
25 /* Reallocate snapshotted memories when new executions start */
26 void FuncNode::set_new_exec_flag()
28 for (mllnode<FuncInst *> * it = inst_list.begin(); it != NULL; it = it->getNext()) {
29 FuncInst * inst = it->getVal();
30 inst->unset_location();
33 read_locations = new loc_set_t();
34 val_loc_map = new HashTable<uint64_t, loc_set_t *, uint64_t, 0>();
35 loc_may_equal_map = new HashTable<void *, loc_set_t *, uintptr_t, 0>();
36 thrd_inst_act_map = new SnapVector<inst_act_map_t *>();
38 //values_may_read_from = new value_set_t();
41 /* Check whether FuncInst with the same type, position, and location
42 * as act has been added to func_inst_map or not. If not, add it.
44 * Note: currently, actions with the same position are filtered out by process_action,
45 * so the collision list of FuncInst is not used. May remove it later.
47 void FuncNode::add_inst(ModelAction *act)
50 const char * position = act->get_position();
52 /* THREAD* actions, ATOMIC_LOCK, ATOMIC_TRYLOCK, and ATOMIC_UNLOCK
53 * actions are not tagged with their source line numbers
58 if ( func_inst_map.contains(position) ) {
59 FuncInst * inst = func_inst_map.get(position);
61 ASSERT(inst->get_type() == act->get_type());
63 // locations are set to NULL when new executions start
64 if (inst->get_location() == NULL)
65 inst->set_location(act->get_location());
67 if (inst->get_location() != act->get_location())
68 inst->not_single_location();
73 FuncInst * func_inst = new FuncInst(act, this);
75 func_inst_map.put(position, func_inst);
76 inst_list.push_back(func_inst);
79 /* Get the FuncInst with the same type, position, and location
82 * @return FuncInst with the same type, position, and location as act */
83 FuncInst * FuncNode::get_inst(ModelAction *act)
86 const char * position = act->get_position();
88 /* THREAD* actions, ATOMIC_LOCK, ATOMIC_TRYLOCK, and ATOMIC_UNLOCK
89 * actions are not tagged with their source line numbers
94 FuncInst * inst = func_inst_map.get(position);
98 action_type inst_type = inst->get_type();
99 action_type act_type = act->get_type();
101 // else if branch: an RMWRCAS action is converted to a RMW or READ action
102 if (inst_type == act_type)
104 else if (inst_type == ATOMIC_RMWRCAS &&
105 (act_type == ATOMIC_RMW || act_type == ATOMIC_READ))
112 void FuncNode::add_entry_inst(FuncInst * inst)
117 mllnode<FuncInst *> * it;
118 for (it = entry_insts.begin(); it != NULL; it = it->getNext()) {
119 if (inst == it->getVal())
123 entry_insts.push_back(inst);
127 * @brief Convert ModelAdtion list to FuncInst list
128 * @param act_list A list of ModelActions
130 void FuncNode::update_tree(action_list_t * act_list)
132 if (act_list == NULL || act_list->size() == 0)
135 HashTable<void *, value_set_t *, uintptr_t, 4> * write_history = history->getWriteHistory();
137 /* build inst_list from act_list for later processing */
138 func_inst_list_t inst_list;
139 action_list_t rw_act_list;
141 for (sllnode<ModelAction *> * it = act_list->begin(); it != NULL; it = it->getNext()) {
142 ModelAction * act = it->getVal();
143 FuncInst * func_inst = get_inst(act);
145 if (func_inst == NULL)
148 inst_list.push_back(func_inst);
150 if (func_inst->is_write())
151 rw_act_list.push_back(act);
153 if (func_inst->is_read()) {
154 rw_act_list.push_back(act);
155 /* If func_inst may only read_from a single location, then:
157 * The first time an action reads from some location, import all the values that have
158 * been written to this location from ModelHistory and notify ModelHistory that this
159 * FuncNode may read from this location.
161 void * loc = act->get_location();
162 if (!read_locations->contains(loc) && func_inst->is_single_location()) {
163 read_locations->add(loc);
164 value_set_t * write_values = write_history->get(loc);
165 add_to_val_loc_map(write_values, loc);
166 history->add_to_loc_func_nodes_map(loc, this);
171 // model_print("function %s\n", func_name);
172 // print_val_loc_map();
174 update_inst_tree(&inst_list);
175 update_predicate_tree(&rw_act_list);
177 // print_predicate_tree();
181 * @brief Link FuncInsts in inst_list - add one FuncInst to another's predecessors and successors
182 * @param inst_list A list of FuncInsts
184 void FuncNode::update_inst_tree(func_inst_list_t * inst_list)
186 if (inst_list == NULL)
188 else if (inst_list->size() == 0)
192 sllnode<FuncInst *>* it = inst_list->begin();
193 sllnode<FuncInst *>* prev;
195 /* add the first instruction to the list of entry insts */
196 FuncInst * entry_inst = it->getVal();
197 add_entry_inst(entry_inst);
201 prev = it->getPrev();
203 FuncInst * prev_inst = prev->getVal();
204 FuncInst * curr_inst = it->getVal();
206 prev_inst->add_succ(curr_inst);
207 curr_inst->add_pred(prev_inst);
213 void FuncNode::update_predicate_tree(action_list_t * act_list)
215 if (act_list == NULL || act_list->size() == 0)
218 /* map a FuncInst to the its predicate */
219 HashTable<FuncInst *, Predicate *, uintptr_t, 0> inst_pred_map(128);
221 // number FuncInsts to detect loops
222 HashTable<FuncInst *, uint32_t, uintptr_t, 0> inst_id_map(128);
223 uint32_t inst_counter = 0;
225 HashTable<void *, ModelAction *, uintptr_t, 0> loc_act_map(128);
226 HashTable<FuncInst *, ModelAction *, uintptr_t, 0> inst_act_map(128);
228 sllnode<ModelAction *> *it = act_list->begin();
229 Predicate * curr_pred = predicate_tree_entry;
231 ModelAction * next_act = it->getVal();
232 FuncInst * next_inst = get_inst(next_act);
234 SnapVector<Predicate *> unset_predicates = SnapVector<Predicate *>();
235 bool branch_found = follow_branch(&curr_pred, next_inst, next_act, &inst_act_map, &unset_predicates);
237 // A branch with unset predicate expression is detected
238 if (!branch_found && unset_predicates.size() != 0) {
239 ASSERT(unset_predicates.size() == 1);
240 Predicate * one_branch = unset_predicates[0];
242 bool amended = amend_predicate_expr(&curr_pred, next_inst, next_act);
246 curr_pred = one_branch;
252 if (!branch_found && inst_id_map.contains(next_inst)) {
253 FuncInst * curr_inst = curr_pred->get_func_inst();
254 uint32_t curr_id = inst_id_map.get(curr_inst);
255 uint32_t next_id = inst_id_map.get(next_inst);
257 if (curr_id >= next_id) {
258 Predicate * old_pred = inst_pred_map.get(next_inst);
259 Predicate * back_pred = old_pred->get_parent();
261 curr_pred->add_backedge(back_pred);
262 curr_pred = back_pred;
268 // Generate new branches
270 SnapVector<struct half_pred_expr *> half_pred_expressions;
271 infer_predicates(next_inst, next_act, &loc_act_map, &half_pred_expressions);
272 generate_predicates(&curr_pred, next_inst, &half_pred_expressions);
276 inst_pred_map.put(next_inst, curr_pred);
277 if (!inst_id_map.contains(next_inst))
278 inst_id_map.put(next_inst, inst_counter++);
280 loc_act_map.put(next_act->get_location(), next_act);
281 inst_act_map.put(next_inst, next_act);
286 /* Given curr_pred and next_inst, find the branch following curr_pred that
287 * contains next_inst and the correct predicate.
288 * @return true if branch found, false otherwise.
290 bool FuncNode::follow_branch(Predicate ** curr_pred, FuncInst * next_inst, ModelAction * next_act,
291 HashTable<FuncInst *, ModelAction *, uintptr_t, 0> * inst_act_map,
292 SnapVector<Predicate *> * unset_predicates)
294 /* check if a branch with func_inst and corresponding predicate exists */
295 bool branch_found = false;
296 ModelVector<Predicate *> * branches = (*curr_pred)->get_children();
297 for (uint i = 0; i < branches->size(); i++) {
298 Predicate * branch = (*branches)[i];
299 if (branch->get_func_inst() != next_inst)
302 /* check against predicate expressions */
303 bool predicate_correct = true;
304 PredExprSet * pred_expressions = branch->get_pred_expressions();
305 PredExprSetIter * pred_expr_it = pred_expressions->iterator();
307 if (pred_expressions->getSize() == 0) {
308 predicate_correct = false;
309 unset_predicates->push_back(branch);
312 while (pred_expr_it->hasNext()) {
313 pred_expr * pred_expression = pred_expr_it->next();
314 uint64_t last_read, next_read;
317 switch(pred_expression->token) {
319 predicate_correct = true;
322 FuncInst * to_be_compared;
323 ModelAction * last_act;
325 to_be_compared = pred_expression->func_inst;
326 last_act = inst_act_map->get(to_be_compared);
328 last_read = last_act->get_reads_from_value();
329 next_read = next_act->get_reads_from_value();
330 equality = (last_read == next_read);
331 if (equality != pred_expression->value)
332 predicate_correct = false;
336 next_read = next_act->get_reads_from_value();
337 equality = ((void*)next_read == NULL);
338 if (equality != pred_expression->value)
339 predicate_correct = false;
342 predicate_correct = false;
343 model_print("unkown predicate token\n");
348 if (predicate_correct) {
358 void FuncNode::infer_predicates(FuncInst * next_inst, ModelAction * next_act,
359 HashTable<void *, ModelAction *, uintptr_t, 0> * loc_act_map,
360 SnapVector<struct half_pred_expr *> * half_pred_expressions)
362 void * loc = next_act->get_location();
364 if (next_inst->is_read()) {
365 if ( loc_act_map->contains(loc) ) {
366 ModelAction * last_act = loc_act_map->get(loc);
367 FuncInst * last_inst = get_inst(last_act);
368 struct half_pred_expr * expression = new half_pred_expr(EQUALITY, last_inst);
369 half_pred_expressions->push_back(expression);
370 } else if ( next_inst->is_single_location() ){
371 loc_set_t * loc_may_equal = loc_may_equal_map->get(loc);
373 if (loc_may_equal != NULL) {
374 loc_set_iter * loc_it = loc_may_equal->iterator();
375 while (loc_it->hasNext()) {
376 void * neighbor = loc_it->next();
377 if (loc_act_map->contains(neighbor)) {
378 ModelAction * last_act = loc_act_map->get(neighbor);
379 FuncInst * last_inst = get_inst(last_act);
381 struct half_pred_expr * expression = new half_pred_expr(EQUALITY, last_inst);
382 half_pred_expressions->push_back(expression);
387 // next_inst is not single location
388 uint64_t read_val = next_act->get_reads_from_value();
390 // only infer NULLITY predicate when it is actually NULL.
391 if ( (void*)read_val == NULL) {
392 struct half_pred_expr * expression = new half_pred_expr(NULLITY, NULL);
393 half_pred_expressions->push_back(expression);
397 // TODO: when next_act is a write action, do anything?
401 /* Able to generate complex predicates when there are multiple predciate expressions */
402 void FuncNode::generate_predicates(Predicate ** curr_pred, FuncInst * next_inst,
403 SnapVector<struct half_pred_expr *> * half_pred_expressions)
405 if (half_pred_expressions->size() == 0) {
406 Predicate * new_pred = new Predicate(next_inst);
407 (*curr_pred)->add_child(new_pred);
408 new_pred->set_parent(*curr_pred);
410 /* entry predicates and predicates containing write actions
411 * have no predicate expressions */
412 if ( (*curr_pred)->is_entry_predicate() )
413 new_pred->add_predicate_expr(NOPREDICATE, NULL, true);
414 else if (next_inst->is_write())
415 new_pred->add_predicate_expr(NOPREDICATE, NULL, true);
420 SnapVector<Predicate *> predicates;
422 struct half_pred_expr * half_expr = (*half_pred_expressions)[0];
423 predicates.push_back(new Predicate(next_inst));
424 predicates.push_back(new Predicate(next_inst));
426 predicates[0]->add_predicate_expr(half_expr->token, half_expr->func_inst, true);
427 predicates[1]->add_predicate_expr(half_expr->token, half_expr->func_inst, false);
429 for (uint i = 1; i < half_pred_expressions->size(); i++) {
430 half_expr = (*half_pred_expressions)[i];
432 uint old_size = predicates.size();
433 for (uint j = 0; j < old_size; j++) {
434 Predicate * pred = predicates[j];
435 Predicate * new_pred = new Predicate(next_inst);
436 new_pred->copy_predicate_expr(pred);
438 pred->add_predicate_expr(half_expr->token, half_expr->func_inst, true);
439 new_pred->add_predicate_expr(half_expr->token, half_expr->func_inst, false);
441 predicates.push_back(new_pred);
445 for (uint i = 0; i < predicates.size(); i++) {
446 Predicate * pred= predicates[i];
447 (*curr_pred)->add_child(pred);
448 pred->set_parent(*curr_pred);
452 /* Amend predicates that contain no predicate expressions. Currenlty only amend with NULLITY predicates */
453 bool FuncNode::amend_predicate_expr(Predicate ** curr_pred, FuncInst * next_inst, ModelAction * next_act)
455 // there should only be only child
456 Predicate * unset_pred = (*curr_pred)->get_children()->back();
457 uint64_t read_val = next_act->get_reads_from_value();
459 // only generate NULLITY predicate when it is actually NULL.
460 if ( !next_inst->is_single_location() && (void*)read_val == NULL ) {
461 Predicate * new_pred = new Predicate(next_inst);
463 (*curr_pred)->add_child(new_pred);
464 new_pred->set_parent(*curr_pred);
466 unset_pred->add_predicate_expr(NULLITY, NULL, false);
467 new_pred->add_predicate_expr(NULLITY, NULL, true);
475 void FuncNode::add_to_val_loc_map(uint64_t val, void * loc)
477 loc_set_t * locations = val_loc_map->get(val);
479 if (locations == NULL) {
480 locations = new loc_set_t();
481 val_loc_map->put(val, locations);
484 update_loc_may_equal_map(loc, locations);
486 // values_may_read_from->add(val);
489 void FuncNode::add_to_val_loc_map(value_set_t * values, void * loc)
494 value_set_iter * it = values->iterator();
495 while (it->hasNext()) {
496 uint64_t val = it->next();
497 add_to_val_loc_map(val, loc);
501 void FuncNode::update_loc_may_equal_map(void * new_loc, loc_set_t * old_locations)
503 if ( old_locations->contains(new_loc) )
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::init_predicate_tree_position(thread_id_t tid)
531 int thread_id = id_to_int(tid);
532 if (predicate_tree_position.size() <= (uint) thread_id)
533 predicate_tree_position.resize(thread_id + 1);
535 predicate_tree_position[thread_id] = predicate_tree_entry;
538 void FuncNode::set_predicate_tree_position(thread_id_t tid, Predicate * pred)
540 int thread_id = id_to_int(tid);
541 predicate_tree_position[thread_id] = pred;
544 Predicate * FuncNode::get_predicate_tree_position(thread_id_t tid)
546 int thread_id = id_to_int(tid);
547 return predicate_tree_position[thread_id];
550 void FuncNode::init_inst_act_map(thread_id_t tid)
552 int thread_id = id_to_int(tid);
553 uint old_size = thrd_inst_act_map->size();
555 if (thrd_inst_act_map->size() <= (uint) thread_id) {
556 uint new_size = thread_id + 1;
557 thrd_inst_act_map->resize(new_size);
559 for (uint i = old_size; i < new_size; i++)
560 (*thrd_inst_act_map)[i] = new inst_act_map_t(128);
564 void FuncNode::reset_inst_act_map(thread_id_t tid)
566 int thread_id = id_to_int(tid);
567 inst_act_map_t * map = (*thrd_inst_act_map)[thread_id];
571 void FuncNode::update_inst_act_map(thread_id_t tid, ModelAction * read_act)
573 int thread_id = id_to_int(tid);
574 inst_act_map_t * map = (*thrd_inst_act_map)[thread_id];
575 FuncInst * read_inst = get_inst(read_act);
576 map->put(read_inst, read_act);
579 inst_act_map_t * FuncNode::get_inst_act_map(thread_id_t tid)
581 int thread_id = id_to_int(tid);
582 return (*thrd_inst_act_map)[thread_id];
585 void FuncNode::print_predicate_tree()
587 model_print("digraph function_%s {\n", func_name);
588 predicate_tree_entry->print_pred_subtree();
589 model_print("}\n"); // end of graph
592 void FuncNode::print_val_loc_map()
595 value_set_iter * val_it = values_may_read_from->iterator();
596 while (val_it->hasNext()) {
597 uint64_t value = val_it->next();
598 model_print("val %llx: ", value);
600 loc_set_t * locations = val_loc_map->get(value);
601 loc_set_iter * loc_it = locations->iterator();
602 while (loc_it->hasNext()) {
603 void * location = loc_it->next();
604 model_print("%p ", location);