+/* Given curr_pred and next_inst, find the branch following curr_pred that contains next_inst and the correct predicate
+ * @return true if branch found, false otherwise.
+ */
+bool FuncNode::follow_branch(Predicate ** curr_pred, FuncInst * next_inst,
+ HashTable<FuncInst *, uint64_t, uintptr_t, 4> * read_val_map, HashTable<void *, FuncInst *, uintptr_t, 4> * loc_inst_map)
+{
+ /* check if a branch with func_inst and corresponding predicate exists */
+ bool branch_found = false;
+ ModelVector<Predicate *> * branches = (*curr_pred)->get_children();
+ for (uint i = 0; i < branches->size(); i++) {
+ Predicate * branch = (*branches)[i];
+ if (branch->get_func_inst() != next_inst)
+ continue;
+
+ PredExprSet * pred_expressions = branch->get_pred_expressions();
+
+ /* no predicate, follow the only branch */
+ if (pred_expressions->getSize() == 0) {
+// model_print("no predicate exists: "); next_inst->print();
+ *curr_pred = branch;
+ branch_found = true;
+ break;
+ }
+
+ PredExprSetIter * pred_expr_it = pred_expressions->iterator();
+ while (pred_expr_it->hasNext()) {
+ pred_expr * pred_expression = pred_expr_it->next();
+ uint64_t last_read, curr_read;
+ FuncInst * last_inst;
+ bool equality;
+
+ switch(pred_expression->token) {
+ case EQUALITY:
+ last_inst = loc_inst_map->get(next_inst->get_location());
+ last_read = read_val_map->get(last_inst);
+ curr_read = read_val_map->get(next_inst);
+ equality = (last_read == curr_read);
+ if (equality == pred_expression->value) {
+ *curr_pred = branch;
+// model_print("predicate: token: %d, location: %p, value: %d - ", pred_expression->token, pred_expression->location, pred_expression->value); next_inst->print();
+ branch_found = true;
+ }
+ break;
+ case NULLITY:
+ break;
+ default:
+ model_print("unkown predicate token\n");
+ break;
+ }
+ }
+
+ }
+
+ return branch_found;
+}