6 #include "concretepredicate.h"
11 FuncNode::FuncNode(ModelHistory * history) :
23 predicate_tree_position(),
31 predicate_tree_entry = new Predicate(NULL, true);
32 predicate_tree_entry->add_predicate_expr(NOPREDICATE, NULL, true);
34 predicate_tree_exit = new Predicate(NULL, false, true);
35 predicate_tree_exit->set_depth(MAX_DEPTH);
37 /* Snapshot data structures below */
38 read_locations = new loc_set_t();
39 write_locations = new loc_set_t();
40 val_loc_map = new HashTable<uint64_t, loc_set_t *, uint64_t, 0, snapshot_malloc, snapshot_calloc, snapshot_free, int64_hash>();
41 loc_may_equal_map = new HashTable<void *, loc_set_t *, uintptr_t, 0>();
43 //values_may_read_from = new value_set_t();
46 /* Reallocate snapshotted memories when new executions start */
47 void FuncNode::set_new_exec_flag()
49 read_locations = new loc_set_t();
50 write_locations = new loc_set_t();
51 val_loc_map = new HashTable<uint64_t, loc_set_t *, uint64_t, 0, snapshot_malloc, snapshot_calloc, snapshot_free, int64_hash>();
52 loc_may_equal_map = new HashTable<void *, loc_set_t *, uintptr_t, 0>();
54 //values_may_read_from = new value_set_t();
57 /* Check whether FuncInst with the same type, position, and location
58 * as act has been added to func_inst_map or not. If not, add it.
60 void FuncNode::add_inst(ModelAction *act)
63 const char * position = act->get_position();
65 /* THREAD* actions, ATOMIC_LOCK, ATOMIC_TRYLOCK, and ATOMIC_UNLOCK
66 * actions are not tagged with their source line numbers
71 FuncInst * func_inst = func_inst_map.get(position);
73 /* This position has not been inserted into hashtable before */
74 if (func_inst == NULL) {
75 func_inst = create_new_inst(act);
76 func_inst_map.put(position, func_inst);
80 /* Volatile variables that use ++ or -- syntax may result in read and write actions with the same position */
81 if (func_inst->get_type() != act->get_type()) {
82 FuncInst * collision_inst = func_inst->search_in_collision(act);
84 if (collision_inst == NULL) {
85 collision_inst = create_new_inst(act);
86 func_inst->add_to_collision(collision_inst);
89 func_inst = collision_inst;
93 ASSERT(func_inst->get_type() == act->get_type());
94 int curr_execution_number = model->get_execution_number();
96 /* Reset locations when new executions start */
97 if (func_inst->get_execution_number() != curr_execution_number) {
98 func_inst->set_location(act->get_location());
99 func_inst->set_execution_number(curr_execution_number);
102 /* Mark the memory location of such inst as not unique */
103 if (func_inst->get_location() != act->get_location())
104 func_inst->not_single_location();
107 FuncInst * FuncNode::create_new_inst(ModelAction * act)
109 FuncInst * func_inst = new FuncInst(act, this);
110 int exec_num = model->get_execution_number();
111 func_inst->set_execution_number(exec_num);
113 inst_list.push_back(func_inst);
119 /* Get the FuncInst with the same type, position, and location
122 * @return FuncInst with the same type, position, and location as act */
123 FuncInst * FuncNode::get_inst(ModelAction *act)
126 const char * position = act->get_position();
128 /* THREAD* actions, ATOMIC_LOCK, ATOMIC_TRYLOCK, and ATOMIC_UNLOCK
129 * actions are not tagged with their source line numbers
131 if (position == NULL)
134 FuncInst * inst = func_inst_map.get(position);
138 action_type inst_type = inst->get_type();
139 action_type act_type = act->get_type();
141 if (inst_type == act_type) {
144 /* RMWRCAS actions are converted to RMW or READ actions */
145 else if (inst_type == ATOMIC_RMWRCAS &&
146 (act_type == ATOMIC_RMW || act_type == ATOMIC_READ)) {
149 /* Return the FuncInst in the collision list */
151 return inst->search_in_collision(act);
155 void FuncNode::add_entry_inst(FuncInst * inst)
160 mllnode<FuncInst *> * it;
161 for (it = entry_insts.begin();it != NULL;it = it->getNext()) {
162 if (inst == it->getVal())
166 entry_insts.push_back(inst);
169 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 int thread_id = id_to_int(tid);
191 predicate_tree_position[thread_id]->pop_back();
195 * @brief Convert ModelAdtion list to FuncInst list
196 * @param act_list A list of ModelActions
198 void FuncNode::update_tree(ModelAction * act)
200 bool should_process = act->is_read() || act->is_write();
204 HashTable<void *, value_set_t *, uintptr_t, 0> * write_history = history->getWriteHistory();
206 /* build inst_list from act_list for later processing */
207 // func_inst_list_t inst_list;
209 FuncInst * func_inst = get_inst(act);
210 void * loc = act->get_location();
212 if (func_inst == NULL)
215 // inst_list.push_back(func_inst);
217 if (act->is_write()) {
218 if (!write_locations->contains(loc)) {
219 write_locations->add(loc);
220 history->update_loc_wr_func_nodes_map(loc, this);
223 // Do not process writes for now
227 if (act->is_read()) {
229 /* If func_inst may only read_from a single location, then:
231 * The first time an action reads from some location,
232 * import all the values that have been written to this
233 * location from ModelHistory and notify ModelHistory
234 * that this FuncNode may read from this location.
236 if (!read_locations->contains(loc) && func_inst->is_single_location()) {
237 read_locations->add(loc);
238 value_set_t * write_values = write_history->get(loc);
239 add_to_val_loc_map(write_values, loc);
240 history->update_loc_rd_func_nodes_map(loc, this);
244 // update_inst_tree(&inst_list); TODO
245 update_predicate_tree(act);
247 // print_predicate_tree();
251 * @brief Link FuncInsts in inst_list - add one FuncInst to another's predecessors and successors
252 * @param inst_list A list of FuncInsts
254 void FuncNode::update_inst_tree(func_inst_list_t * inst_list)
256 if (inst_list == NULL)
258 else if (inst_list->size() == 0)
262 sllnode<FuncInst *>* it = inst_list->begin();
263 sllnode<FuncInst *>* prev;
265 /* add the first instruction to the list of entry insts */
266 FuncInst * entry_inst = it->getVal();
267 add_entry_inst(entry_inst);
271 prev = it->getPrev();
273 FuncInst * prev_inst = prev->getVal();
274 FuncInst * curr_inst = it->getVal();
276 prev_inst->add_succ(curr_inst);
277 curr_inst->add_pred(prev_inst);
283 void FuncNode::update_predicate_tree(ModelAction * next_act)
285 thread_id_t tid = next_act->get_tid();
286 int thread_id = id_to_int(tid);
287 int this_marker = thrd_marker[thread_id];
289 loc_inst_map_t * loc_inst_map = thrd_loc_inst_map[thread_id];
290 inst_pred_map_t * inst_pred_map = thrd_inst_pred_map[thread_id];
291 inst_id_map_t * inst_id_map = thrd_inst_id_map[thread_id];
293 // Clear the set of leaves encountered in this path
294 // leaves_tmp_storage.clear();
296 Predicate * curr_pred = get_predicate_tree_position(tid);
298 FuncInst * next_inst = get_inst(next_act);
299 next_inst->set_associated_read(tid, next_act->get_reads_from_value(), this_marker);
301 Predicate * unset_predicate = NULL;
302 bool branch_found = follow_branch(&curr_pred, next_inst, next_act, &unset_predicate);
304 // A branch with unset predicate expression is detected
305 if (!branch_found && unset_predicate != NULL) {
306 bool amended = amend_predicate_expr(curr_pred, next_inst, next_act);
310 curr_pred = unset_predicate;
316 if (!branch_found && inst_id_map->contains(next_inst)) {
317 FuncInst * curr_inst = curr_pred->get_func_inst();
318 uint32_t curr_id = inst_id_map->get(curr_inst);
319 uint32_t next_id = inst_id_map->get(next_inst);
321 if (curr_id >= next_id) {
322 Predicate * old_pred = inst_pred_map->get(next_inst);
323 Predicate * back_pred = old_pred->get_parent();
325 // For updating weights
326 leaves_tmp_storage.push_back(curr_pred);
328 // Add to the set of backedges
329 curr_pred->add_backedge(back_pred);
330 curr_pred = back_pred;
336 // Generate new branches
338 SnapVector<struct half_pred_expr *> half_pred_expressions;
339 infer_predicates(next_inst, next_act, &half_pred_expressions);
340 generate_predicates(curr_pred, next_inst, &half_pred_expressions);
344 if (next_act->is_write())
345 curr_pred->set_write(true);
347 if (next_act->is_read()) {
348 /* Only need to store the locations of read actions */
349 loc_inst_map->put(next_inst->get_location(), next_inst);
352 inst_pred_map->put(next_inst, curr_pred);
353 set_predicate_tree_position(tid, curr_pred);
355 if (!inst_id_map->contains(next_inst))
356 inst_id_map->put(next_inst, inst_counter++);
358 curr_pred->incr_expl_count();
362 // leaves_tmp_storage.push_back(curr_pred);
363 // update_predicate_tree_weight();
366 /* Given curr_pred and next_inst, find the branch following curr_pred that
367 * contains next_inst and the correct predicate.
368 * @return true if branch found, false otherwise.
370 bool FuncNode::follow_branch(Predicate ** curr_pred, FuncInst * next_inst,
371 ModelAction * next_act, Predicate ** unset_predicate)
373 /* Check if a branch with func_inst and corresponding predicate exists */
374 bool branch_found = false;
375 thread_id_t tid = next_act->get_tid();
376 int this_marker = thrd_marker[id_to_int(tid)];
378 ModelVector<Predicate *> * branches = (*curr_pred)->get_children();
379 for (uint i = 0;i < branches->size();i++) {
380 Predicate * branch = (*branches)[i];
381 if (branch->get_func_inst() != next_inst)
384 /* Check against predicate expressions */
385 bool predicate_correct = true;
386 PredExprSet * pred_expressions = branch->get_pred_expressions();
388 /* Only read and rmw actions my have unset predicate expressions */
389 if (pred_expressions->getSize() == 0) {
390 predicate_correct = false;
392 if (*unset_predicate == NULL)
393 *unset_predicate = branch;
400 PredExprSetIter * pred_expr_it = pred_expressions->iterator();
401 while (pred_expr_it->hasNext()) {
402 pred_expr * pred_expression = pred_expr_it->next();
403 uint64_t last_read, next_read;
406 switch(pred_expression->token) {
408 predicate_correct = true;
411 FuncInst * to_be_compared;
412 to_be_compared = pred_expression->func_inst;
414 last_read = to_be_compared->get_associated_read(tid, this_marker);
415 ASSERT(last_read != VALUE_NONE);
417 next_read = next_act->get_reads_from_value();
418 equality = (last_read == next_read);
419 if (equality != pred_expression->value)
420 predicate_correct = false;
424 next_read = next_act->get_reads_from_value();
425 // TODO: implement likely to be null
426 equality = ( (void*) (next_read & 0xffffffff) == NULL);
427 if (equality != pred_expression->value)
428 predicate_correct = false;
431 predicate_correct = false;
432 model_print("unkown predicate token\n");
439 if (predicate_correct) {
449 /* Infer predicate expressions, which are generated in FuncNode::generate_predicates */
450 void FuncNode::infer_predicates(FuncInst * next_inst, ModelAction * next_act,
451 SnapVector<struct half_pred_expr *> * half_pred_expressions)
453 void * loc = next_act->get_location();
454 int thread_id = id_to_int(next_act->get_tid());
455 loc_inst_map_t * loc_inst_map = thrd_loc_inst_map[thread_id];
457 if (next_inst->is_read()) {
459 if ( loc_inst_map->contains(loc) ) {
460 FuncInst * last_inst = loc_inst_map->get(loc);
461 struct half_pred_expr * expression = new half_pred_expr(EQUALITY, last_inst);
462 half_pred_expressions->push_back(expression);
463 } else if ( next_inst->is_single_location() ) {
464 loc_set_t * loc_may_equal = loc_may_equal_map->get(loc);
466 if (loc_may_equal != NULL) {
467 loc_set_iter * loc_it = loc_may_equal->iterator();
468 while (loc_it->hasNext()) {
469 void * neighbor = loc_it->next();
470 if (loc_inst_map->contains(neighbor)) {
471 FuncInst * last_inst = loc_inst_map->get(neighbor);
473 struct half_pred_expr * expression = new half_pred_expr(EQUALITY, last_inst);
474 half_pred_expressions->push_back(expression);
481 // next_inst is not single location
482 uint64_t read_val = next_act->get_reads_from_value();
484 // only infer NULLITY predicate when it is actually NULL.
485 if ( (void*)read_val == NULL) {
486 struct half_pred_expr * expression = new half_pred_expr(NULLITY, NULL);
487 half_pred_expressions->push_back(expression);
492 // TODO: do anything here?
496 /* Able to generate complex predicates when there are multiple predciate expressions */
497 void FuncNode::generate_predicates(Predicate * curr_pred, FuncInst * next_inst,
498 SnapVector<struct half_pred_expr *> * half_pred_expressions)
500 if (half_pred_expressions->size() == 0) {
501 Predicate * new_pred = new Predicate(next_inst);
502 curr_pred->add_child(new_pred);
503 new_pred->set_parent(curr_pred);
505 /* Maintain predicate leaves */
506 predicate_leaves.add(new_pred);
507 predicate_leaves.remove(curr_pred);
509 /* entry predicates and predicates containing pure write actions
510 * have no predicate expressions */
511 if ( curr_pred->is_entry_predicate() )
512 new_pred->add_predicate_expr(NOPREDICATE, NULL, true);
513 else if (next_inst->is_write()) {
514 /* next_inst->is_write() <==> pure writes */
515 new_pred->add_predicate_expr(NOPREDICATE, NULL, true);
521 SnapVector<Predicate *> predicates;
523 struct half_pred_expr * half_expr = (*half_pred_expressions)[0];
524 predicates.push_back(new Predicate(next_inst));
525 predicates.push_back(new Predicate(next_inst));
527 predicates[0]->add_predicate_expr(half_expr->token, half_expr->func_inst, true);
528 predicates[1]->add_predicate_expr(half_expr->token, half_expr->func_inst, false);
530 for (uint i = 1;i < half_pred_expressions->size();i++) {
531 half_expr = (*half_pred_expressions)[i];
533 uint old_size = predicates.size();
534 for (uint j = 0;j < old_size;j++) {
535 Predicate * pred = predicates[j];
536 Predicate * new_pred = new Predicate(next_inst);
537 new_pred->copy_predicate_expr(pred);
539 pred->add_predicate_expr(half_expr->token, half_expr->func_inst, true);
540 new_pred->add_predicate_expr(half_expr->token, half_expr->func_inst, false);
542 predicates.push_back(new_pred);
546 for (uint i = 0;i < predicates.size();i++) {
547 Predicate * pred= predicates[i];
548 curr_pred->add_child(pred);
549 pred->set_parent(curr_pred);
551 /* Add new predicate leaves */
552 predicate_leaves.add(pred);
555 /* Remove predicate node that has children */
556 predicate_leaves.remove(curr_pred);
558 /* Free memories allocated by infer_predicate */
559 for (uint i = 0;i < half_pred_expressions->size();i++) {
560 struct half_pred_expr * tmp = (*half_pred_expressions)[i];
565 /* Amend predicates that contain no predicate expressions. Currenlty only amend with NULLITY predicates */
566 bool FuncNode::amend_predicate_expr(Predicate * curr_pred, FuncInst * next_inst, ModelAction * next_act)
568 ModelVector<Predicate *> * children = curr_pred->get_children();
570 Predicate * unset_pred = NULL;
571 for (uint i = 0;i < children->size();i++) {
572 Predicate * child = (*children)[i];
573 if (child->get_func_inst() == next_inst) {
579 uint64_t read_val = next_act->get_reads_from_value();
581 // only generate NULLITY predicate when it is actually NULL.
582 if ( !next_inst->is_single_location() && (void*)read_val == NULL ) {
583 Predicate * new_pred = new Predicate(next_inst);
585 curr_pred->add_child(new_pred);
586 new_pred->set_parent(curr_pred);
588 unset_pred->add_predicate_expr(NULLITY, NULL, false);
589 new_pred->add_predicate_expr(NULLITY, NULL, true);
597 void FuncNode::add_to_val_loc_map(uint64_t val, void * loc)
599 loc_set_t * locations = val_loc_map->get(val);
601 if (locations == NULL) {
602 locations = new loc_set_t();
603 val_loc_map->put(val, locations);
606 update_loc_may_equal_map(loc, locations);
608 // values_may_read_from->add(val);
611 void FuncNode::add_to_val_loc_map(value_set_t * values, void * loc)
616 value_set_iter * it = values->iterator();
617 while (it->hasNext()) {
618 uint64_t val = it->next();
619 add_to_val_loc_map(val, loc);
625 void FuncNode::update_loc_may_equal_map(void * new_loc, loc_set_t * old_locations)
627 if ( old_locations->contains(new_loc) )
630 loc_set_t * neighbors = loc_may_equal_map->get(new_loc);
632 if (neighbors == NULL) {
633 neighbors = new loc_set_t();
634 loc_may_equal_map->put(new_loc, neighbors);
637 loc_set_iter * loc_it = old_locations->iterator();
638 while (loc_it->hasNext()) {
639 // new_loc: { old_locations, ... }
640 void * member = loc_it->next();
641 neighbors->add(member);
643 // for each i in old_locations, i : { new_loc, ... }
644 loc_set_t * _neighbors = loc_may_equal_map->get(member);
645 if (_neighbors == NULL) {
646 _neighbors = new loc_set_t();
647 loc_may_equal_map->put(member, _neighbors);
649 _neighbors->add(new_loc);
655 void FuncNode::init_predicate_tree_position(thread_id_t tid)
657 int thread_id = id_to_int(tid);
658 int old_size = predicate_tree_position.size();
660 if (old_size <= thread_id + 1) {
661 predicate_tree_position.resize(thread_id + 1);
663 for (int i = old_size; i < thread_id + 1; i++)
664 predicate_tree_position[i] = new ModelVector<Predicate *>();
667 predicate_tree_position[thread_id]->push_back(predicate_tree_entry);
670 void FuncNode::set_predicate_tree_position(thread_id_t tid, Predicate * pred)
672 int thread_id = id_to_int(tid);
673 ModelVector<Predicate *> * stack = predicate_tree_position[thread_id];
674 (*stack)[stack->size() - 1] = pred;
677 /* @return The position of a thread in a predicate tree */
678 Predicate * FuncNode::get_predicate_tree_position(thread_id_t tid)
680 int thread_id = id_to_int(tid);
681 return predicate_tree_position[thread_id]->back();
684 /* Make sure elements of thrd_inst_act_map are initialized properly when threads enter functions */
685 void FuncNode::init_inst_act_map(thread_id_t tid)
687 int thread_id = id_to_int(tid);
688 SnapVector<inst_act_map_t *> * thrd_inst_act_map = history->getThrdInstActMap(func_id);
689 uint old_size = thrd_inst_act_map->size();
691 if (old_size <= (uint) thread_id) {
692 uint new_size = thread_id + 1;
693 thrd_inst_act_map->resize(new_size);
695 for (uint i = old_size;i < new_size;i++)
696 (*thrd_inst_act_map)[i] = new inst_act_map_t(128);
700 /* Reset elements of thrd_inst_act_map when threads exit functions */
701 void FuncNode::reset_inst_act_map(thread_id_t tid)
703 int thread_id = id_to_int(tid);
704 SnapVector<inst_act_map_t *> * thrd_inst_act_map = history->getThrdInstActMap(func_id);
706 inst_act_map_t * map = (*thrd_inst_act_map)[thread_id];
710 void FuncNode::update_inst_act_map(thread_id_t tid, ModelAction * read_act)
712 int thread_id = id_to_int(tid);
713 SnapVector<inst_act_map_t *> * thrd_inst_act_map = history->getThrdInstActMap(func_id);
715 inst_act_map_t * map = (*thrd_inst_act_map)[thread_id];
716 FuncInst * read_inst = get_inst(read_act);
717 map->put(read_inst, read_act);
720 inst_act_map_t * FuncNode::get_inst_act_map(thread_id_t tid)
722 int thread_id = id_to_int(tid);
723 SnapVector<inst_act_map_t *> * thrd_inst_act_map = history->getThrdInstActMap(func_id);
725 return (*thrd_inst_act_map)[thread_id];
728 void FuncNode::set_marker(thread_id_t tid)
731 uint thread_id = id_to_int(tid);
732 for (uint i = thrd_marker.size(); i < thread_id + 1; i++) {
733 thrd_marker.push_back(0);
736 thrd_marker[thread_id] = marker;
739 /* Make sure elements of maps are initialized properly when threads enter functions */
740 void FuncNode::init_maps(thread_id_t tid)
742 int thread_id = id_to_int(tid);
743 uint old_size = thrd_loc_inst_map.size();
745 if (old_size <= (uint) thread_id) {
746 uint new_size = thread_id + 1;
747 thrd_loc_inst_map.resize(new_size);
748 thrd_inst_id_map.resize(new_size);
749 thrd_inst_pred_map.resize(new_size);
751 for (uint i = old_size; i < new_size; i++) {
752 thrd_loc_inst_map[i] = new loc_inst_map_t(128);
753 thrd_inst_id_map[i] = new inst_id_map_t(128);
754 thrd_inst_pred_map[i] = new inst_pred_map_t(128);
759 /* Reset elements of maps when threads exit functions */
760 void FuncNode::reset_maps(thread_id_t tid)
762 int thread_id = id_to_int(tid);
763 thrd_loc_inst_map[thread_id]->reset();
764 thrd_inst_id_map[thread_id]->reset();
765 thrd_inst_pred_map[thread_id]->reset();
768 /* Add FuncNodes that this node may follow */
769 void FuncNode::add_out_edge(FuncNode * other)
771 if ( !edge_table.contains(other) ) {
772 edge_table.put(other, OUT_EDGE);
773 out_edges.push_back(other);
777 edge_type_t edge = edge_table.get(other);
778 if (edge == IN_EDGE) {
779 edge_table.put(other, BI_EDGE);
780 out_edges.push_back(other);
784 /* Compute the distance between this FuncNode and the target node.
785 * Return -1 if the target node is unreachable or the actual distance
786 * is greater than max_step.
788 int FuncNode::compute_distance(FuncNode * target, int max_step)
792 else if (target == this)
795 SnapList<FuncNode *> queue;
796 HashTable<FuncNode *, int, uintptr_t, 0> distances(128);
798 queue.push_back(this);
799 distances.put(this, 0);
801 while (!queue.empty()) {
802 FuncNode * curr = queue.front();
804 int dist = distances.get(curr);
806 if (max_step <= dist)
809 ModelList<FuncNode *> * outEdges = curr->get_out_edges();
810 mllnode<FuncNode *> * it;
811 for (it = outEdges->begin();it != NULL;it = it->getNext()) {
812 FuncNode * out_node = it->getVal();
814 /* This node has not been visited before */
815 if ( !distances.contains(out_node) ) {
816 if (out_node == target)
819 queue.push_back(out_node);
820 distances.put(out_node, dist + 1);
825 /* Target node is unreachable */
829 void FuncNode::add_failed_predicate(Predicate * pred)
831 failed_predicates.add(pred);
834 /* Implement quick sort to sort leaves before assigning base scores */
835 template<typename _Tp>
836 static int partition(ModelVector<_Tp *> * arr, int low, int high)
838 unsigned int pivot = (*arr)[high] -> get_depth();
841 for (int j = low;j <= high - 1;j ++) {
842 if ( (*arr)[j] -> get_depth() < pivot ) {
844 _Tp * tmp = (*arr)[i];
845 (*arr)[i] = (*arr)[j];
850 _Tp * tmp = (*arr)[i + 1];
851 (*arr)[i + 1] = (*arr)[high];
857 /* Implement quick sort to sort leaves before assigning base scores */
858 template<typename _Tp>
859 static void quickSort(ModelVector<_Tp *> * arr, int low, int high)
862 int pi = partition(arr, low, high);
864 quickSort(arr, low, pi - 1);
865 quickSort(arr, pi + 1, high);
869 void FuncNode::assign_initial_weight()
871 PredSetIter * it = predicate_leaves.iterator();
872 leaves_tmp_storage.clear();
874 while (it->hasNext()) {
875 Predicate * pred = it->next();
876 double weight = 100.0 / sqrt(pred->get_expl_count() + pred->get_fail_count() + 1);
877 pred->set_weight(weight);
878 leaves_tmp_storage.push_back(pred);
882 quickSort(&leaves_tmp_storage, 0, leaves_tmp_storage.size() - 1);
884 // assign scores for internal nodes;
885 while ( !leaves_tmp_storage.empty() ) {
886 Predicate * leaf = leaves_tmp_storage.back();
887 leaves_tmp_storage.pop_back();
889 Predicate * curr = leaf->get_parent();
890 while (curr != NULL) {
891 if (curr->get_weight() != 0) {
896 ModelVector<Predicate *> * children = curr->get_children();
897 double weight_sum = 0;
898 bool has_unassigned_node = false;
900 for (uint i = 0;i < children->size();i++) {
901 Predicate * child = (*children)[i];
903 // If a child has unassigned weight
904 double weight = child->get_weight();
906 has_unassigned_node = true;
909 weight_sum += weight;
912 if (!has_unassigned_node) {
913 double average_weight = (double) weight_sum / (double) children->size();
914 double weight = average_weight * pow(0.9, curr->get_depth());
915 curr->set_weight(weight);
919 curr = curr->get_parent();
924 void FuncNode::update_predicate_tree_weight()
927 // Predicate tree is initially built
928 assign_initial_weight();
932 weight_debug_vec.clear();
934 PredSetIter * it = failed_predicates.iterator();
935 while (it->hasNext()) {
936 Predicate * pred = it->next();
937 leaves_tmp_storage.push_back(pred);
940 failed_predicates.reset();
942 quickSort(&leaves_tmp_storage, 0, leaves_tmp_storage.size() - 1);
943 for (uint i = 0;i < leaves_tmp_storage.size();i++) {
944 Predicate * pred = leaves_tmp_storage[i];
945 double weight = 100.0 / sqrt(pred->get_expl_count() + pred->get_fail_count() + 1);
946 pred->set_weight(weight);
949 // Update weights in internal nodes
950 while ( !leaves_tmp_storage.empty() ) {
951 Predicate * leaf = leaves_tmp_storage.back();
952 leaves_tmp_storage.pop_back();
954 Predicate * curr = leaf->get_parent();
955 while (curr != NULL) {
956 ModelVector<Predicate *> * children = curr->get_children();
957 double weight_sum = 0;
958 bool has_unassigned_node = false;
960 for (uint i = 0;i < children->size();i++) {
961 Predicate * child = (*children)[i];
963 double weight = child->get_weight();
965 weight_sum += weight;
966 else if ( predicate_leaves.contains(child) ) {
967 // If this child is a leaf
968 double weight = 100.0 / sqrt(child->get_expl_count() + 1);
969 child->set_weight(weight);
970 weight_sum += weight;
972 has_unassigned_node = true;
973 weight_debug_vec.push_back(child); // For debugging purpose
978 if (!has_unassigned_node) {
979 double average_weight = (double) weight_sum / (double) children->size();
980 double weight = average_weight * pow(0.9, curr->get_depth());
981 curr->set_weight(weight);
985 curr = curr->get_parent();
989 for (uint i = 0;i < weight_debug_vec.size();i++) {
990 Predicate * tmp = weight_debug_vec[i];
991 ASSERT( tmp->get_weight() != 0 );
995 void FuncNode::print_predicate_tree()
997 model_print("digraph function_%s {\n", func_name);
998 predicate_tree_entry->print_pred_subtree();
999 predicate_tree_exit->print_predicate();
1000 model_print("}\n"); // end of graph