-/*
- value_set_iter * val_it = values_may_read_from->iterator();
- while (val_it->hasNext()) {
- uint64_t value = val_it->next();
- model_print("val %llx: ", value);
-
- loc_set_t * locations = val_loc_map->get(value);
- loc_set_iter * loc_it = locations->iterator();
- while (loc_it->hasNext()) {
- void * location = loc_it->next();
- model_print("%p ", location);
+ PredSetIter * it = predicate_leaves.iterator();
+ SnapVector<Predicate *> leaves;
+ while (it->hasNext()) {
+ Predicate * pred = it->next();
+ double weight = 100.0 / sqrt(pred->get_expl_count() + 1);
+ pred->set_weight(weight);
+ leaves.push_back(pred);
+ }
+
+ quickSort(&leaves, 0, leaves.size() - 1);
+
+ // assign scores for internal nodes;
+ while ( !leaves.empty() ) {
+ Predicate * leaf = leaves.back();
+ leaves.pop_back();
+
+ Predicate * curr = leaf->get_parent();
+ while (curr != NULL) {
+ if (curr->get_weight() != 0) {
+ // Has been exlpored
+ break;
+ }
+
+ ModelVector<Predicate *> * children = curr->get_children();
+ double weight_sum = 0;
+ bool has_unassigned_node = false;
+
+ for (uint i = 0; i < children->size(); i++) {
+ Predicate * child = (*children)[i];
+
+ // If a child has unassigned weight
+ double weight = child->get_weight();
+ if (weight == 0) {
+ has_unassigned_node = true;
+ break;
+ } else
+ weight_sum += weight;
+ }
+
+ if (!has_unassigned_node) {
+ double average_weight = (double) weight_sum / (double) children->size();
+ double weight = average_weight * pow(0.9, curr->get_depth());
+ curr->set_weight(weight);
+ } else
+ break;
+
+ curr = curr->get_parent();