6 #include "concretepredicate.h"
11 FuncNode::FuncNode(ModelHistory * history) :
22 predicate_tree_position(),
30 predicate_tree_entry = new Predicate(NULL, true);
31 predicate_tree_entry->add_predicate_expr(NOPREDICATE, NULL, true);
33 predicate_tree_exit = new Predicate(NULL, false, true);
34 predicate_tree_exit->set_depth(MAX_DEPTH);
36 /* Snapshot data structures below */
37 read_locations = new loc_set_t();
38 write_locations = new loc_set_t();
39 val_loc_map = new HashTable<uint64_t, loc_set_t *, uint64_t, 0, snapshot_malloc, snapshot_calloc, snapshot_free, int64_hash>();
40 loc_may_equal_map = new HashTable<void *, loc_set_t *, uintptr_t, 0>();
42 //values_may_read_from = new value_set_t();
45 /* Reallocate snapshotted memories when new executions start */
46 void FuncNode::set_new_exec_flag()
48 read_locations = new loc_set_t();
49 write_locations = new loc_set_t();
50 val_loc_map = new HashTable<uint64_t, loc_set_t *, uint64_t, 0, snapshot_malloc, snapshot_calloc, snapshot_free, int64_hash>();
51 loc_may_equal_map = new HashTable<void *, loc_set_t *, uintptr_t, 0>();
53 //values_may_read_from = new value_set_t();
56 /* Check whether FuncInst with the same type, position, and location
57 * as act has been added to func_inst_map or not. If not, add it.
59 void FuncNode::add_inst(ModelAction *act)
62 const char * position = act->get_position();
64 /* THREAD* actions, ATOMIC_LOCK, ATOMIC_TRYLOCK, and ATOMIC_UNLOCK
65 * actions are not tagged with their source line numbers
70 FuncInst * func_inst = func_inst_map.get(position);
72 /* This position has not been inserted into hashtable before */
73 if (func_inst == NULL) {
74 func_inst = create_new_inst(act);
75 func_inst_map.put(position, func_inst);
79 /* Volatile variables that use ++ or -- syntax may result in read and write actions with the same position */
80 if (func_inst->get_type() != act->get_type()) {
81 FuncInst * collision_inst = func_inst->search_in_collision(act);
83 if (collision_inst == NULL) {
84 collision_inst = create_new_inst(act);
85 func_inst->add_to_collision(collision_inst);
88 func_inst = collision_inst;
92 ASSERT(func_inst->get_type() == act->get_type());
93 int curr_execution_number = model->get_execution_number();
95 /* Reset locations when new executions start */
96 if (func_inst->get_execution_number() != curr_execution_number) {
97 func_inst->set_location(act->get_location());
98 func_inst->set_execution_number(curr_execution_number);
101 /* Mark the memory location of such inst as not unique */
102 if (func_inst->get_location() != act->get_location())
103 func_inst->not_single_location();
106 FuncInst * FuncNode::create_new_inst(ModelAction * act)
108 FuncInst * func_inst = new FuncInst(act, this);
109 int exec_num = model->get_execution_number();
110 func_inst->set_execution_number(exec_num);
112 inst_list.push_back(func_inst);
118 /* Get the FuncInst with the same type, position, and location
121 * @return FuncInst with the same type, position, and location as act */
122 FuncInst * FuncNode::get_inst(ModelAction *act)
125 const char * position = act->get_position();
127 /* THREAD* actions, ATOMIC_LOCK, ATOMIC_TRYLOCK, and ATOMIC_UNLOCK
128 * actions are not tagged with their source line numbers
130 if (position == NULL)
133 FuncInst * inst = func_inst_map.get(position);
137 action_type inst_type = inst->get_type();
138 action_type act_type = act->get_type();
140 if (inst_type == act_type) {
143 /* RMWRCAS actions are converted to RMW or READ actions */
144 else if (inst_type == ATOMIC_RMWRCAS &&
145 (act_type == ATOMIC_RMW || act_type == ATOMIC_READ)) {
148 /* Return the FuncInst in the collision list */
150 return inst->search_in_collision(act);
154 void FuncNode::add_entry_inst(FuncInst * inst)
159 mllnode<FuncInst *> * it;
160 for (it = entry_insts.begin();it != NULL;it = it->getNext()) {
161 if (inst == it->getVal())
165 entry_insts.push_back(inst);
168 void FuncNode::function_entry_handler(thread_id_t tid)
172 init_predicate_tree_position(tid);
173 init_inst_act_map(tid);
177 void FuncNode::function_exit_handler(thread_id_t tid)
181 reset_inst_act_map(tid);
184 Predicate * exit_pred = get_predicate_tree_position(tid);
185 if (exit_pred->get_exit() == NULL) {
186 // Exit predicate is unset yet
187 exit_pred->set_exit(predicate_tree_exit);
190 set_predicate_tree_position(tid, NULL);
194 * @brief Convert ModelAdtion list to FuncInst list
195 * @param act_list A list of ModelActions
197 void FuncNode::update_tree(ModelAction * act)
199 HashTable<void *, value_set_t *, uintptr_t, 0> * write_history = history->getWriteHistory();
200 HashSet<ModelAction *, uintptr_t, 2> write_actions;
202 /* build inst_list from act_list for later processing */
203 // func_inst_list_t inst_list;
205 FuncInst * func_inst = get_inst(act);
206 void * loc = act->get_location();
208 if (func_inst == NULL)
211 // inst_list.push_back(func_inst);
213 if (act->is_write()) {
214 if (!write_locations->contains(loc)) {
215 write_locations->add(loc);
216 history->update_loc_wr_func_nodes_map(loc, this);
219 // Do not process writes for now
223 if (act->is_read()) {
225 /* If func_inst may only read_from a single location, then:
227 * The first time an action reads from some location,
228 * import all the values that have been written to this
229 * location from ModelHistory and notify ModelHistory
230 * that this FuncNode may read from this location.
232 if (!read_locations->contains(loc) && func_inst->is_single_location()) {
233 read_locations->add(loc);
234 value_set_t * write_values = write_history->get(loc);
235 add_to_val_loc_map(write_values, loc);
236 history->update_loc_rd_func_nodes_map(loc, this);
240 // update_inst_tree(&inst_list); TODO
241 update_predicate_tree(act);
243 // print_predicate_tree();
247 * @brief Link FuncInsts in inst_list - add one FuncInst to another's predecessors and successors
248 * @param inst_list A list of FuncInsts
250 void FuncNode::update_inst_tree(func_inst_list_t * inst_list)
252 if (inst_list == NULL)
254 else if (inst_list->size() == 0)
258 sllnode<FuncInst *>* it = inst_list->begin();
259 sllnode<FuncInst *>* prev;
261 /* add the first instruction to the list of entry insts */
262 FuncInst * entry_inst = it->getVal();
263 add_entry_inst(entry_inst);
267 prev = it->getPrev();
269 FuncInst * prev_inst = prev->getVal();
270 FuncInst * curr_inst = it->getVal();
272 prev_inst->add_succ(curr_inst);
273 curr_inst->add_pred(prev_inst);
279 void FuncNode::update_predicate_tree(ModelAction * next_act)
281 thread_id_t tid = next_act->get_tid();
282 int thread_id = id_to_int(tid);
285 loc_act_map_t * loc_act_map = thrd_loc_act_map[thread_id];
286 inst_pred_map_t * inst_pred_map = thrd_inst_pred_map[thread_id];
287 inst_id_map_t * inst_id_map = thrd_inst_id_map[thread_id];
289 // Clear the set of leaves encountered in this path
290 // leaves_tmp_storage.clear();
292 Predicate * curr_pred = get_predicate_tree_position(tid);
294 FuncInst * next_inst = get_inst(next_act);
295 next_inst->set_associated_act(next_act, marker);
297 Predicate * unset_predicate = NULL;
298 bool branch_found = follow_branch(&curr_pred, next_inst, next_act, &unset_predicate);
300 // A branch with unset predicate expression is detected
301 if (!branch_found && unset_predicate != NULL) {
302 bool amended = amend_predicate_expr(curr_pred, next_inst, next_act);
306 curr_pred = unset_predicate;
312 if (!branch_found && inst_id_map->contains(next_inst)) {
313 FuncInst * curr_inst = curr_pred->get_func_inst();
314 uint32_t curr_id = inst_id_map->get(curr_inst);
315 uint32_t next_id = inst_id_map->get(next_inst);
317 if (curr_id >= next_id) {
318 Predicate * old_pred = inst_pred_map->get(next_inst);
319 Predicate * back_pred = old_pred->get_parent();
321 // For updating weights
322 leaves_tmp_storage.push_back(curr_pred);
324 // Add to the set of backedges
325 curr_pred->add_backedge(back_pred);
326 curr_pred = back_pred;
331 // Generate new branches
333 SnapVector<struct half_pred_expr *> half_pred_expressions;
334 infer_predicates(next_inst, next_act, &half_pred_expressions);
335 generate_predicates(curr_pred, next_inst, &half_pred_expressions);
339 if (next_act->is_write())
340 curr_pred->set_write(true);
342 if (next_act->is_read()) {
343 /* Only need to store the locations of read actions */
344 loc_act_map->put(next_act->get_location(), next_act);
347 inst_pred_map->put(next_inst, curr_pred);
348 set_predicate_tree_position(tid, curr_pred);
350 if (!inst_id_map->contains(next_inst))
351 inst_id_map->put(next_inst, inst_counter++);
353 curr_pred->incr_expl_count();
357 // leaves_tmp_storage.push_back(curr_pred);
358 // update_predicate_tree_weight();
361 /* Given curr_pred and next_inst, find the branch following curr_pred that
362 * contains next_inst and the correct predicate.
363 * @return true if branch found, false otherwise.
365 bool FuncNode::follow_branch(Predicate ** curr_pred, FuncInst * next_inst,
366 ModelAction * next_act, Predicate ** unset_predicate)
368 /* Check if a branch with func_inst and corresponding predicate exists */
369 bool branch_found = false;
370 ModelVector<Predicate *> * branches = (*curr_pred)->get_children();
371 for (uint i = 0;i < branches->size();i++) {
372 Predicate * branch = (*branches)[i];
373 if (branch->get_func_inst() != next_inst)
376 /* Check against predicate expressions */
377 bool predicate_correct = true;
378 PredExprSet * pred_expressions = branch->get_pred_expressions();
380 /* Only read and rmw actions my have unset predicate expressions */
381 if (pred_expressions->getSize() == 0) {
382 predicate_correct = false;
384 if (*unset_predicate == NULL)
385 *unset_predicate = branch;
392 PredExprSetIter * pred_expr_it = pred_expressions->iterator();
393 while (pred_expr_it->hasNext()) {
394 pred_expr * pred_expression = pred_expr_it->next();
395 uint64_t last_read, next_read;
398 switch(pred_expression->token) {
400 predicate_correct = true;
403 FuncInst * to_be_compared;
404 ModelAction * last_act;
406 to_be_compared = pred_expression->func_inst;
407 last_act = to_be_compared->get_associated_act(marker);
409 last_read = last_act->get_reads_from_value();
410 next_read = next_act->get_reads_from_value();
411 equality = (last_read == next_read);
412 if (equality != pred_expression->value)
413 predicate_correct = false;
417 next_read = next_act->get_reads_from_value();
418 // TODO: implement likely to be null
419 equality = ( (void*) (next_read & 0xffffffff) == NULL);
420 if (equality != pred_expression->value)
421 predicate_correct = false;
424 predicate_correct = false;
425 model_print("unkown predicate token\n");
432 if (predicate_correct) {
442 /* Infer predicate expressions, which are generated in FuncNode::generate_predicates */
443 void FuncNode::infer_predicates(FuncInst * next_inst, ModelAction * next_act,
444 SnapVector<struct half_pred_expr *> * half_pred_expressions)
446 void * loc = next_act->get_location();
447 int thread_id = id_to_int(next_act->get_tid());
448 loc_act_map_t * loc_act_map = thrd_loc_act_map[thread_id];
450 if (next_inst->is_read()) {
452 if ( loc_act_map->contains(loc) ) {
453 ModelAction * last_act = loc_act_map->get(loc);
454 FuncInst * last_inst = get_inst(last_act);
455 struct half_pred_expr * expression = new half_pred_expr(EQUALITY, last_inst);
456 half_pred_expressions->push_back(expression);
457 } else if ( next_inst->is_single_location() ) {
458 loc_set_t * loc_may_equal = loc_may_equal_map->get(loc);
460 if (loc_may_equal != NULL) {
461 loc_set_iter * loc_it = loc_may_equal->iterator();
462 while (loc_it->hasNext()) {
463 void * neighbor = loc_it->next();
464 if (loc_act_map->contains(neighbor)) {
465 ModelAction * last_act = loc_act_map->get(neighbor);
466 FuncInst * last_inst = get_inst(last_act);
468 struct half_pred_expr * expression = new half_pred_expr(EQUALITY, last_inst);
469 half_pred_expressions->push_back(expression);
476 // next_inst is not single location
477 uint64_t read_val = next_act->get_reads_from_value();
479 // only infer NULLITY predicate when it is actually NULL.
480 if ( (void*)read_val == NULL) {
481 struct half_pred_expr * expression = new half_pred_expr(NULLITY, NULL);
482 half_pred_expressions->push_back(expression);
487 // TODO: do anything here?
491 /* Able to generate complex predicates when there are multiple predciate expressions */
492 void FuncNode::generate_predicates(Predicate * curr_pred, FuncInst * next_inst,
493 SnapVector<struct half_pred_expr *> * half_pred_expressions)
495 if (half_pred_expressions->size() == 0) {
496 Predicate * new_pred = new Predicate(next_inst);
497 curr_pred->add_child(new_pred);
498 new_pred->set_parent(curr_pred);
500 /* Maintain predicate leaves */
501 predicate_leaves.add(new_pred);
502 predicate_leaves.remove(curr_pred);
504 /* entry predicates and predicates containing pure write actions
505 * have no predicate expressions */
506 if ( curr_pred->is_entry_predicate() )
507 new_pred->add_predicate_expr(NOPREDICATE, NULL, true);
508 else if (next_inst->is_write()) {
509 /* next_inst->is_write() <==> pure writes */
510 new_pred->add_predicate_expr(NOPREDICATE, NULL, true);
516 SnapVector<Predicate *> predicates;
518 struct half_pred_expr * half_expr = (*half_pred_expressions)[0];
519 predicates.push_back(new Predicate(next_inst));
520 predicates.push_back(new Predicate(next_inst));
522 predicates[0]->add_predicate_expr(half_expr->token, half_expr->func_inst, true);
523 predicates[1]->add_predicate_expr(half_expr->token, half_expr->func_inst, false);
525 for (uint i = 1;i < half_pred_expressions->size();i++) {
526 half_expr = (*half_pred_expressions)[i];
528 uint old_size = predicates.size();
529 for (uint j = 0;j < old_size;j++) {
530 Predicate * pred = predicates[j];
531 Predicate * new_pred = new Predicate(next_inst);
532 new_pred->copy_predicate_expr(pred);
534 pred->add_predicate_expr(half_expr->token, half_expr->func_inst, true);
535 new_pred->add_predicate_expr(half_expr->token, half_expr->func_inst, false);
537 predicates.push_back(new_pred);
541 for (uint i = 0;i < predicates.size();i++) {
542 Predicate * pred= predicates[i];
543 curr_pred->add_child(pred);
544 pred->set_parent(curr_pred);
546 /* Add new predicate leaves */
547 predicate_leaves.add(pred);
550 /* Remove predicate node that has children */
551 predicate_leaves.remove(curr_pred);
553 /* Free memories allocated by infer_predicate */
554 for (uint i = 0;i < half_pred_expressions->size();i++) {
555 struct half_pred_expr * tmp = (*half_pred_expressions)[i];
560 /* Amend predicates that contain no predicate expressions. Currenlty only amend with NULLITY predicates */
561 bool FuncNode::amend_predicate_expr(Predicate * curr_pred, FuncInst * next_inst, ModelAction * next_act)
563 ModelVector<Predicate *> * children = curr_pred->get_children();
565 Predicate * unset_pred = NULL;
566 for (uint i = 0;i < children->size();i++) {
567 Predicate * child = (*children)[i];
568 if (child->get_func_inst() == next_inst) {
574 uint64_t read_val = next_act->get_reads_from_value();
576 // only generate NULLITY predicate when it is actually NULL.
577 if ( !next_inst->is_single_location() && (void*)read_val == NULL ) {
578 Predicate * new_pred = new Predicate(next_inst);
580 curr_pred->add_child(new_pred);
581 new_pred->set_parent(curr_pred);
583 unset_pred->add_predicate_expr(NULLITY, NULL, false);
584 new_pred->add_predicate_expr(NULLITY, NULL, true);
592 void FuncNode::add_to_val_loc_map(uint64_t val, void * loc)
594 loc_set_t * locations = val_loc_map->get(val);
596 if (locations == NULL) {
597 locations = new loc_set_t();
598 val_loc_map->put(val, locations);
601 update_loc_may_equal_map(loc, locations);
603 // values_may_read_from->add(val);
606 void FuncNode::add_to_val_loc_map(value_set_t * values, void * loc)
611 value_set_iter * it = values->iterator();
612 while (it->hasNext()) {
613 uint64_t val = it->next();
614 add_to_val_loc_map(val, loc);
620 void FuncNode::update_loc_may_equal_map(void * new_loc, loc_set_t * old_locations)
622 if ( old_locations->contains(new_loc) )
625 loc_set_t * neighbors = loc_may_equal_map->get(new_loc);
627 if (neighbors == NULL) {
628 neighbors = new loc_set_t();
629 loc_may_equal_map->put(new_loc, neighbors);
632 loc_set_iter * loc_it = old_locations->iterator();
633 while (loc_it->hasNext()) {
634 // new_loc: { old_locations, ... }
635 void * member = loc_it->next();
636 neighbors->add(member);
638 // for each i in old_locations, i : { new_loc, ... }
639 loc_set_t * _neighbors = loc_may_equal_map->get(member);
640 if (_neighbors == NULL) {
641 _neighbors = new loc_set_t();
642 loc_may_equal_map->put(member, _neighbors);
644 _neighbors->add(new_loc);
650 /* Every time a thread enters a function, set its position to the predicate tree entry */
651 void FuncNode::init_predicate_tree_position(thread_id_t tid)
653 int thread_id = id_to_int(tid);
654 if (predicate_tree_position.size() <= (uint) thread_id)
655 predicate_tree_position.resize(thread_id + 1);
657 predicate_tree_position[thread_id] = predicate_tree_entry;
660 void FuncNode::set_predicate_tree_position(thread_id_t tid, Predicate * pred)
662 int thread_id = id_to_int(tid);
663 predicate_tree_position[thread_id] = pred;
666 /* @return The position of a thread in a predicate tree */
667 Predicate * FuncNode::get_predicate_tree_position(thread_id_t tid)
669 int thread_id = id_to_int(tid);
670 return predicate_tree_position[thread_id];
673 /* Make sure elements of thrd_inst_act_map are initialized properly when threads enter functions */
674 void FuncNode::init_inst_act_map(thread_id_t tid)
676 int thread_id = id_to_int(tid);
677 SnapVector<inst_act_map_t *> * thrd_inst_act_map = history->getThrdInstActMap(func_id);
678 uint old_size = thrd_inst_act_map->size();
680 if (old_size <= (uint) thread_id) {
681 uint new_size = thread_id + 1;
682 thrd_inst_act_map->resize(new_size);
684 for (uint i = old_size;i < new_size;i++)
685 (*thrd_inst_act_map)[i] = new inst_act_map_t(128);
689 /* Reset elements of thrd_inst_act_map when threads exit functions */
690 void FuncNode::reset_inst_act_map(thread_id_t tid)
692 int thread_id = id_to_int(tid);
693 SnapVector<inst_act_map_t *> * thrd_inst_act_map = history->getThrdInstActMap(func_id);
695 inst_act_map_t * map = (*thrd_inst_act_map)[thread_id];
699 void FuncNode::update_inst_act_map(thread_id_t tid, ModelAction * read_act)
701 int thread_id = id_to_int(tid);
702 SnapVector<inst_act_map_t *> * thrd_inst_act_map = history->getThrdInstActMap(func_id);
704 inst_act_map_t * map = (*thrd_inst_act_map)[thread_id];
705 FuncInst * read_inst = get_inst(read_act);
706 map->put(read_inst, read_act);
709 inst_act_map_t * FuncNode::get_inst_act_map(thread_id_t tid)
711 int thread_id = id_to_int(tid);
712 SnapVector<inst_act_map_t *> * thrd_inst_act_map = history->getThrdInstActMap(func_id);
714 return (*thrd_inst_act_map)[thread_id];
717 /* Make sure elements of thrd_loc_act_map are initialized properly when threads enter functions */
718 void FuncNode::init_maps(thread_id_t tid)
720 int thread_id = id_to_int(tid);
721 uint old_size = thrd_loc_act_map.size();
723 if (old_size <= (uint) thread_id) {
724 uint new_size = thread_id + 1;
725 thrd_loc_act_map.resize(new_size);
726 thrd_inst_id_map.resize(new_size);
727 thrd_inst_pred_map.resize(new_size);
729 for (uint i = old_size; i < new_size;i++) {
730 thrd_loc_act_map[i] = new loc_act_map_t(128);
731 thrd_inst_id_map[i] = new inst_id_map_t(128);
732 thrd_inst_pred_map[i] = new inst_pred_map_t(128);
737 /* Reset elements of thrd_loc_act_map when threads exit functions */
738 void FuncNode::reset_maps(thread_id_t tid)
740 int thread_id = id_to_int(tid);
741 thrd_loc_act_map[thread_id]->reset();
742 thrd_inst_id_map[thread_id]->reset();
743 thrd_inst_pred_map[thread_id]->reset();
746 /* Add FuncNodes that this node may follow */
747 void FuncNode::add_out_edge(FuncNode * other)
749 if ( !edge_table.contains(other) ) {
750 edge_table.put(other, OUT_EDGE);
751 out_edges.push_back(other);
755 edge_type_t edge = edge_table.get(other);
756 if (edge == IN_EDGE) {
757 edge_table.put(other, BI_EDGE);
758 out_edges.push_back(other);
762 /* Compute the distance between this FuncNode and the target node.
763 * Return -1 if the target node is unreachable or the actual distance
764 * is greater than max_step.
766 int FuncNode::compute_distance(FuncNode * target, int max_step)
770 else if (target == this)
773 SnapList<FuncNode *> queue;
774 HashTable<FuncNode *, int, uintptr_t, 0> distances(128);
776 queue.push_back(this);
777 distances.put(this, 0);
779 while (!queue.empty()) {
780 FuncNode * curr = queue.front();
782 int dist = distances.get(curr);
784 if (max_step <= dist)
787 ModelList<FuncNode *> * outEdges = curr->get_out_edges();
788 mllnode<FuncNode *> * it;
789 for (it = outEdges->begin();it != NULL;it = it->getNext()) {
790 FuncNode * out_node = it->getVal();
792 /* This node has not been visited before */
793 if ( !distances.contains(out_node) ) {
794 if (out_node == target)
797 queue.push_back(out_node);
798 distances.put(out_node, dist + 1);
803 /* Target node is unreachable */
807 void FuncNode::add_failed_predicate(Predicate * pred)
809 failed_predicates.add(pred);
812 /* Implement quick sort to sort leaves before assigning base scores */
813 template<typename _Tp>
814 static int partition(ModelVector<_Tp *> * arr, int low, int high)
816 unsigned int pivot = (*arr)[high] -> get_depth();
819 for (int j = low;j <= high - 1;j ++) {
820 if ( (*arr)[j] -> get_depth() < pivot ) {
822 _Tp * tmp = (*arr)[i];
823 (*arr)[i] = (*arr)[j];
828 _Tp * tmp = (*arr)[i + 1];
829 (*arr)[i + 1] = (*arr)[high];
835 /* Implement quick sort to sort leaves before assigning base scores */
836 template<typename _Tp>
837 static void quickSort(ModelVector<_Tp *> * arr, int low, int high)
840 int pi = partition(arr, low, high);
842 quickSort(arr, low, pi - 1);
843 quickSort(arr, pi + 1, high);
847 void FuncNode::assign_initial_weight()
849 PredSetIter * it = predicate_leaves.iterator();
850 leaves_tmp_storage.clear();
852 while (it->hasNext()) {
853 Predicate * pred = it->next();
854 double weight = 100.0 / sqrt(pred->get_expl_count() + pred->get_fail_count() + 1);
855 pred->set_weight(weight);
856 leaves_tmp_storage.push_back(pred);
860 quickSort(&leaves_tmp_storage, 0, leaves_tmp_storage.size() - 1);
862 // assign scores for internal nodes;
863 while ( !leaves_tmp_storage.empty() ) {
864 Predicate * leaf = leaves_tmp_storage.back();
865 leaves_tmp_storage.pop_back();
867 Predicate * curr = leaf->get_parent();
868 while (curr != NULL) {
869 if (curr->get_weight() != 0) {
874 ModelVector<Predicate *> * children = curr->get_children();
875 double weight_sum = 0;
876 bool has_unassigned_node = false;
878 for (uint i = 0;i < children->size();i++) {
879 Predicate * child = (*children)[i];
881 // If a child has unassigned weight
882 double weight = child->get_weight();
884 has_unassigned_node = true;
887 weight_sum += weight;
890 if (!has_unassigned_node) {
891 double average_weight = (double) weight_sum / (double) children->size();
892 double weight = average_weight * pow(0.9, curr->get_depth());
893 curr->set_weight(weight);
897 curr = curr->get_parent();
902 void FuncNode::update_predicate_tree_weight()
905 // Predicate tree is initially built
906 assign_initial_weight();
910 weight_debug_vec.clear();
912 PredSetIter * it = failed_predicates.iterator();
913 while (it->hasNext()) {
914 Predicate * pred = it->next();
915 leaves_tmp_storage.push_back(pred);
918 failed_predicates.reset();
920 quickSort(&leaves_tmp_storage, 0, leaves_tmp_storage.size() - 1);
921 for (uint i = 0;i < leaves_tmp_storage.size();i++) {
922 Predicate * pred = leaves_tmp_storage[i];
923 double weight = 100.0 / sqrt(pred->get_expl_count() + pred->get_fail_count() + 1);
924 pred->set_weight(weight);
927 // Update weights in internal nodes
928 while ( !leaves_tmp_storage.empty() ) {
929 Predicate * leaf = leaves_tmp_storage.back();
930 leaves_tmp_storage.pop_back();
932 Predicate * curr = leaf->get_parent();
933 while (curr != NULL) {
934 ModelVector<Predicate *> * children = curr->get_children();
935 double weight_sum = 0;
936 bool has_unassigned_node = false;
938 for (uint i = 0;i < children->size();i++) {
939 Predicate * child = (*children)[i];
941 double weight = child->get_weight();
943 weight_sum += weight;
944 else if ( predicate_leaves.contains(child) ) {
945 // If this child is a leaf
946 double weight = 100.0 / sqrt(child->get_expl_count() + 1);
947 child->set_weight(weight);
948 weight_sum += weight;
950 has_unassigned_node = true;
951 weight_debug_vec.push_back(child); // For debugging purpose
956 if (!has_unassigned_node) {
957 double average_weight = (double) weight_sum / (double) children->size();
958 double weight = average_weight * pow(0.9, curr->get_depth());
959 curr->set_weight(weight);
963 curr = curr->get_parent();
967 for (uint i = 0;i < weight_debug_vec.size();i++) {
968 Predicate * tmp = weight_debug_vec[i];
969 ASSERT( tmp->get_weight() != 0 );
973 void FuncNode::print_predicate_tree()
975 model_print("digraph function_%s {\n", func_name);
976 predicate_tree_entry->print_pred_subtree();
977 predicate_tree_exit->print_predicate();
978 model_print("}\n"); // end of graph