6 #include "concretepredicate.h"
11 FuncNode::FuncNode(ModelHistory * history) :
23 thrd_predicate_tree_position(),
24 thrd_predicate_trace(),
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_inst_act_map(tid);
173 init_local_maps(tid);
174 init_predicate_tree_data_structure(tid);
177 void FuncNode::function_exit_handler(thread_id_t tid)
181 reset_inst_act_map(tid);
182 reset_local_maps(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 update_predicate_tree_weight(tid);
191 reset_predicate_tree_data_structure(tid);
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 Predicate * curr_pred = get_predicate_tree_position(tid);
295 FuncInst * next_inst = get_inst(next_act);
296 next_inst->set_associated_read(tid, next_act->get_reads_from_value(), this_marker);
298 Predicate * unset_predicate = NULL;
299 bool branch_found = follow_branch(&curr_pred, next_inst, next_act, &unset_predicate);
301 // A branch with unset predicate expression is detected
302 if (!branch_found && unset_predicate != NULL) {
303 bool amended = amend_predicate_expr(curr_pred, next_inst, next_act);
307 curr_pred = unset_predicate;
313 if (!branch_found && inst_id_map->contains(next_inst)) {
314 FuncInst * curr_inst = curr_pred->get_func_inst();
315 uint32_t curr_id = inst_id_map->get(curr_inst);
316 uint32_t next_id = inst_id_map->get(next_inst);
318 if (curr_id >= next_id) {
319 Predicate * old_pred = inst_pred_map->get(next_inst);
320 Predicate * back_pred = old_pred->get_parent();
322 // Add to the set of backedges
323 curr_pred->add_backedge(back_pred);
324 curr_pred = back_pred;
330 // Generate new branches
332 SnapVector<struct half_pred_expr *> half_pred_expressions;
333 infer_predicates(next_inst, next_act, &half_pred_expressions);
334 generate_predicates(curr_pred, next_inst, &half_pred_expressions);
338 if (next_act->is_write())
339 curr_pred->set_write(true);
341 if (next_act->is_read()) {
342 /* Only need to store the locations of read actions */
343 loc_inst_map->put(next_inst->get_location(), next_inst);
346 inst_pred_map->put(next_inst, curr_pred);
347 set_predicate_tree_position(tid, curr_pred);
349 if (!inst_id_map->contains(next_inst))
350 inst_id_map->put(next_inst, inst_counter++);
352 curr_pred->incr_expl_count();
353 add_predicate_to_trace(tid, curr_pred);
357 // leaves_tmp_storage.push_back(curr_pred);
360 /* Given curr_pred and next_inst, find the branch following curr_pred that
361 * contains next_inst and the correct predicate.
362 * @return true if branch found, false otherwise.
364 bool FuncNode::follow_branch(Predicate ** curr_pred, FuncInst * next_inst,
365 ModelAction * next_act, Predicate ** unset_predicate)
367 /* Check if a branch with func_inst and corresponding predicate exists */
368 bool branch_found = false;
369 thread_id_t tid = next_act->get_tid();
370 int this_marker = thrd_marker[id_to_int(tid)];
372 ModelVector<Predicate *> * branches = (*curr_pred)->get_children();
373 for (uint i = 0;i < branches->size();i++) {
374 Predicate * branch = (*branches)[i];
375 if (branch->get_func_inst() != next_inst)
378 /* Check against predicate expressions */
379 bool predicate_correct = true;
380 PredExprSet * pred_expressions = branch->get_pred_expressions();
382 /* Only read and rmw actions my have unset predicate expressions */
383 if (pred_expressions->getSize() == 0) {
384 predicate_correct = false;
386 if (*unset_predicate == NULL)
387 *unset_predicate = branch;
394 PredExprSetIter * pred_expr_it = pred_expressions->iterator();
395 while (pred_expr_it->hasNext()) {
396 pred_expr * pred_expression = pred_expr_it->next();
397 uint64_t last_read, next_read;
400 switch(pred_expression->token) {
402 predicate_correct = true;
405 FuncInst * to_be_compared;
406 to_be_compared = pred_expression->func_inst;
408 last_read = to_be_compared->get_associated_read(tid, this_marker);
409 ASSERT(last_read != VALUE_NONE);
411 next_read = next_act->get_reads_from_value();
412 equality = (last_read == next_read);
413 if (equality != pred_expression->value)
414 predicate_correct = false;
418 next_read = next_act->get_reads_from_value();
419 // TODO: implement likely to be null
420 equality = ( (void*) (next_read & 0xffffffff) == NULL);
421 if (equality != pred_expression->value)
422 predicate_correct = false;
425 predicate_correct = false;
426 model_print("unkown predicate token\n");
433 if (predicate_correct) {
443 /* Infer predicate expressions, which are generated in FuncNode::generate_predicates */
444 void FuncNode::infer_predicates(FuncInst * next_inst, ModelAction * next_act,
445 SnapVector<struct half_pred_expr *> * half_pred_expressions)
447 void * loc = next_act->get_location();
448 int thread_id = id_to_int(next_act->get_tid());
449 loc_inst_map_t * loc_inst_map = thrd_loc_inst_map[thread_id];
451 if (next_inst->is_read()) {
453 if ( loc_inst_map->contains(loc) ) {
454 FuncInst * last_inst = loc_inst_map->get(loc);
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_inst_map->contains(neighbor)) {
465 FuncInst * last_inst = loc_inst_map->get(neighbor);
467 struct half_pred_expr * expression = new half_pred_expr(EQUALITY, last_inst);
468 half_pred_expressions->push_back(expression);
475 // next_inst is not single location
476 uint64_t read_val = next_act->get_reads_from_value();
478 // only infer NULLITY predicate when it is actually NULL.
479 if ( (void*)read_val == NULL) {
480 struct half_pred_expr * expression = new half_pred_expr(NULLITY, NULL);
481 half_pred_expressions->push_back(expression);
486 // TODO: do anything here?
490 /* Able to generate complex predicates when there are multiple predciate expressions */
491 void FuncNode::generate_predicates(Predicate * curr_pred, FuncInst * next_inst,
492 SnapVector<struct half_pred_expr *> * half_pred_expressions)
494 if (half_pred_expressions->size() == 0) {
495 Predicate * new_pred = new Predicate(next_inst);
496 curr_pred->add_child(new_pred);
497 new_pred->set_parent(curr_pred);
499 /* Maintain predicate leaves */
500 predicate_leaves.add(new_pred);
501 predicate_leaves.remove(curr_pred);
503 /* entry predicates and predicates containing pure write actions
504 * have no predicate expressions */
505 if ( curr_pred->is_entry_predicate() )
506 new_pred->add_predicate_expr(NOPREDICATE, NULL, true);
507 else if (next_inst->is_write()) {
508 /* next_inst->is_write() <==> pure writes */
509 new_pred->add_predicate_expr(NOPREDICATE, NULL, true);
515 SnapVector<Predicate *> predicates;
517 struct half_pred_expr * half_expr = (*half_pred_expressions)[0];
518 predicates.push_back(new Predicate(next_inst));
519 predicates.push_back(new Predicate(next_inst));
521 predicates[0]->add_predicate_expr(half_expr->token, half_expr->func_inst, true);
522 predicates[1]->add_predicate_expr(half_expr->token, half_expr->func_inst, false);
524 for (uint i = 1;i < half_pred_expressions->size();i++) {
525 half_expr = (*half_pred_expressions)[i];
527 uint old_size = predicates.size();
528 for (uint j = 0;j < old_size;j++) {
529 Predicate * pred = predicates[j];
530 Predicate * new_pred = new Predicate(next_inst);
531 new_pred->copy_predicate_expr(pred);
533 pred->add_predicate_expr(half_expr->token, half_expr->func_inst, true);
534 new_pred->add_predicate_expr(half_expr->token, half_expr->func_inst, false);
536 predicates.push_back(new_pred);
540 for (uint i = 0;i < predicates.size();i++) {
541 Predicate * pred= predicates[i];
542 curr_pred->add_child(pred);
543 pred->set_parent(curr_pred);
545 /* Add new predicate leaves */
546 predicate_leaves.add(pred);
549 /* Remove predicate node that has children */
550 predicate_leaves.remove(curr_pred);
552 /* Free memories allocated by infer_predicate */
553 for (uint i = 0;i < half_pred_expressions->size();i++) {
554 struct half_pred_expr * tmp = (*half_pred_expressions)[i];
559 /* Amend predicates that contain no predicate expressions. Currenlty only amend with NULLITY predicates */
560 bool FuncNode::amend_predicate_expr(Predicate * curr_pred, FuncInst * next_inst, ModelAction * next_act)
562 ModelVector<Predicate *> * children = curr_pred->get_children();
564 Predicate * unset_pred = NULL;
565 for (uint i = 0;i < children->size();i++) {
566 Predicate * child = (*children)[i];
567 if (child->get_func_inst() == next_inst) {
573 uint64_t read_val = next_act->get_reads_from_value();
575 // only generate NULLITY predicate when it is actually NULL.
576 if ( !next_inst->is_single_location() && (void*)read_val == NULL ) {
577 Predicate * new_pred = new Predicate(next_inst);
579 curr_pred->add_child(new_pred);
580 new_pred->set_parent(curr_pred);
582 unset_pred->add_predicate_expr(NULLITY, NULL, false);
583 new_pred->add_predicate_expr(NULLITY, NULL, true);
591 void FuncNode::add_to_val_loc_map(uint64_t val, void * loc)
593 loc_set_t * locations = val_loc_map->get(val);
595 if (locations == NULL) {
596 locations = new loc_set_t();
597 val_loc_map->put(val, locations);
600 update_loc_may_equal_map(loc, locations);
602 // values_may_read_from->add(val);
605 void FuncNode::add_to_val_loc_map(value_set_t * values, void * loc)
610 value_set_iter * it = values->iterator();
611 while (it->hasNext()) {
612 uint64_t val = it->next();
613 add_to_val_loc_map(val, loc);
619 void FuncNode::update_loc_may_equal_map(void * new_loc, loc_set_t * old_locations)
621 if ( old_locations->contains(new_loc) )
624 loc_set_t * neighbors = loc_may_equal_map->get(new_loc);
626 if (neighbors == NULL) {
627 neighbors = new loc_set_t();
628 loc_may_equal_map->put(new_loc, neighbors);
631 loc_set_iter * loc_it = old_locations->iterator();
632 while (loc_it->hasNext()) {
633 // new_loc: { old_locations, ... }
634 void * member = loc_it->next();
635 neighbors->add(member);
637 // for each i in old_locations, i : { new_loc, ... }
638 loc_set_t * _neighbors = loc_may_equal_map->get(member);
639 if (_neighbors == NULL) {
640 _neighbors = new loc_set_t();
641 loc_may_equal_map->put(member, _neighbors);
643 _neighbors->add(new_loc);
649 void FuncNode::set_predicate_tree_position(thread_id_t tid, Predicate * pred)
651 int thread_id = id_to_int(tid);
652 ModelVector<Predicate *> * stack = thrd_predicate_tree_position[thread_id];
653 (*stack)[stack->size() - 1] = pred;
656 /* @return The position of a thread in a predicate tree */
657 Predicate * FuncNode::get_predicate_tree_position(thread_id_t tid)
659 int thread_id = id_to_int(tid);
660 return thrd_predicate_tree_position[thread_id]->back();
663 void FuncNode::add_predicate_to_trace(thread_id_t tid, Predicate * pred)
665 int thread_id = id_to_int(tid);
666 thrd_predicate_trace[thread_id]->back()->push_back(pred);
669 /* Make sure elements of thrd_inst_act_map are initialized properly when threads enter functions */
670 void FuncNode::init_inst_act_map(thread_id_t tid)
672 int thread_id = id_to_int(tid);
673 SnapVector<inst_act_map_t *> * thrd_inst_act_map = history->getThrdInstActMap(func_id);
674 uint old_size = thrd_inst_act_map->size();
676 if (old_size <= (uint) thread_id) {
677 uint new_size = thread_id + 1;
678 thrd_inst_act_map->resize(new_size);
680 for (uint i = old_size;i < new_size;i++)
681 (*thrd_inst_act_map)[i] = new inst_act_map_t(128);
685 /* Reset elements of thrd_inst_act_map when threads exit functions */
686 void FuncNode::reset_inst_act_map(thread_id_t tid)
688 int thread_id = id_to_int(tid);
689 SnapVector<inst_act_map_t *> * thrd_inst_act_map = history->getThrdInstActMap(func_id);
691 inst_act_map_t * map = (*thrd_inst_act_map)[thread_id];
695 void FuncNode::update_inst_act_map(thread_id_t tid, ModelAction * read_act)
697 int thread_id = id_to_int(tid);
698 SnapVector<inst_act_map_t *> * thrd_inst_act_map = history->getThrdInstActMap(func_id);
700 inst_act_map_t * map = (*thrd_inst_act_map)[thread_id];
701 FuncInst * read_inst = get_inst(read_act);
702 map->put(read_inst, read_act);
705 inst_act_map_t * FuncNode::get_inst_act_map(thread_id_t tid)
707 int thread_id = id_to_int(tid);
708 SnapVector<inst_act_map_t *> * thrd_inst_act_map = history->getThrdInstActMap(func_id);
710 return (*thrd_inst_act_map)[thread_id];
713 void FuncNode::set_marker(thread_id_t tid)
716 uint thread_id = id_to_int(tid);
717 for (uint i = thrd_marker.size(); i < thread_id + 1; i++) {
718 thrd_marker.push_back(0);
721 thrd_marker[thread_id] = marker;
724 /* Make sure elements of maps are initialized properly when threads enter functions */
725 void FuncNode::init_local_maps(thread_id_t tid)
727 int thread_id = id_to_int(tid);
728 uint old_size = thrd_loc_inst_map.size();
730 if (old_size <= (uint) thread_id) {
731 uint new_size = thread_id + 1;
733 thrd_loc_inst_map.resize(new_size);
734 thrd_inst_id_map.resize(new_size);
735 thrd_inst_pred_map.resize(new_size);
737 for (uint i = old_size; i < new_size; i++) {
738 thrd_loc_inst_map[i] = new loc_inst_map_t(128);
739 thrd_inst_id_map[i] = new inst_id_map_t(128);
740 thrd_inst_pred_map[i] = new inst_pred_map_t(128);
745 /* Reset elements of maps when threads exit functions */
746 void FuncNode::reset_local_maps(thread_id_t tid)
748 int thread_id = id_to_int(tid);
749 thrd_loc_inst_map[thread_id]->reset();
750 thrd_inst_id_map[thread_id]->reset();
751 thrd_inst_pred_map[thread_id]->reset();
754 void FuncNode::init_predicate_tree_data_structure(thread_id_t tid)
756 int thread_id = id_to_int(tid);
757 int old_size = thrd_predicate_tree_position.size();
759 if (old_size <= thread_id + 1) {
760 thrd_predicate_tree_position.resize(thread_id + 1);
761 thrd_predicate_trace.resize(thread_id + 1);
763 for (int i = old_size; i < thread_id + 1; i++) {
764 thrd_predicate_tree_position[i] = new ModelVector<Predicate *>();
765 thrd_predicate_trace[i] = new ModelVector<predicate_trace_t *>();
769 thrd_predicate_tree_position[thread_id]->push_back(predicate_tree_entry);
770 thrd_predicate_trace[thread_id]->push_back(new predicate_trace_t());
773 void FuncNode::reset_predicate_tree_data_structure(thread_id_t tid)
775 int thread_id = id_to_int(tid);
776 thrd_predicate_tree_position[thread_id]->pop_back();
778 predicate_trace_t * trace = thrd_predicate_trace[thread_id]->back();
780 thrd_predicate_trace[thread_id]->pop_back();
783 /* Add FuncNodes that this node may follow */
784 void FuncNode::add_out_edge(FuncNode * other)
786 if ( !edge_table.contains(other) ) {
787 edge_table.put(other, OUT_EDGE);
788 out_edges.push_back(other);
792 edge_type_t edge = edge_table.get(other);
793 if (edge == IN_EDGE) {
794 edge_table.put(other, BI_EDGE);
795 out_edges.push_back(other);
799 /* Compute the distance between this FuncNode and the target node.
800 * Return -1 if the target node is unreachable or the actual distance
801 * is greater than max_step.
803 int FuncNode::compute_distance(FuncNode * target, int max_step)
807 else if (target == this)
810 SnapList<FuncNode *> queue;
811 HashTable<FuncNode *, int, uintptr_t, 0> distances(128);
813 queue.push_back(this);
814 distances.put(this, 0);
816 while (!queue.empty()) {
817 FuncNode * curr = queue.front();
819 int dist = distances.get(curr);
821 if (max_step <= dist)
824 ModelList<FuncNode *> * outEdges = curr->get_out_edges();
825 mllnode<FuncNode *> * it;
826 for (it = outEdges->begin();it != NULL;it = it->getNext()) {
827 FuncNode * out_node = it->getVal();
829 /* This node has not been visited before */
830 if ( !distances.contains(out_node) ) {
831 if (out_node == target)
834 queue.push_back(out_node);
835 distances.put(out_node, dist + 1);
840 /* Target node is unreachable */
844 void FuncNode::add_failed_predicate(Predicate * pred)
846 failed_predicates.add(pred);
849 /* Implement quick sort to sort leaves before assigning base scores */
850 template<typename _Tp>
851 static int partition(ModelVector<_Tp *> * arr, int low, int high)
853 unsigned int pivot = (*arr)[high] -> get_depth();
856 for (int j = low;j <= high - 1;j ++) {
857 if ( (*arr)[j] -> get_depth() < pivot ) {
859 _Tp * tmp = (*arr)[i];
860 (*arr)[i] = (*arr)[j];
865 _Tp * tmp = (*arr)[i + 1];
866 (*arr)[i + 1] = (*arr)[high];
872 /* Implement quick sort to sort leaves before assigning base scores */
873 template<typename _Tp>
874 static void quickSort(ModelVector<_Tp *> * arr, int low, int high)
877 int pi = partition(arr, low, high);
879 quickSort(arr, low, pi - 1);
880 quickSort(arr, pi + 1, high);
884 void FuncNode::update_predicate_tree_weight(thread_id_t tid)
886 failed_predicates.reset();
888 predicate_trace_t * trace = thrd_predicate_trace[id_to_int(tid)]->back();
890 // Update predicate weights based on prediate trace
891 for (mllnode<Predicate *> * rit = trace->end(); rit != NULL; rit = rit->getPrev()) {
892 Predicate * node = rit->getVal();
894 if (predicate_leaves.contains(node)) {
895 double weight = 100.0 / sqrt(node->get_expl_count() + node->get_fail_count() + 1);
896 node->set_weight(weight);
898 double weight_sum = 0.0;
899 ModelVector<Predicate *> * children = node->get_children();
900 for (uint i = 0;i < children->size();i++) {
901 Predicate * child = (*children)[i];
902 double weight = child->get_weight();
903 weight_sum += weight;
906 double average_weight = (double) weight_sum / (double) children->size();
907 double weight = average_weight * pow(0.9, node->get_depth());
908 node->set_weight(weight);
913 void FuncNode::print_predicate_tree()
915 model_print("digraph function_%s {\n", func_name);
916 predicate_tree_entry->print_pred_subtree();
917 predicate_tree_exit->print_predicate();
918 model_print("}\n"); // end of graph