3 Predicate::Predicate(FuncInst * func_inst, bool is_entry) :
5 entry_predicate(is_entry),
11 unsigned int pred_expr_hash(struct pred_expr * expr)
13 return (unsigned int)((uintptr_t)expr);
16 bool pred_expr_equal(struct pred_expr * p1, struct pred_expr * p2)
18 if (p1->token != p2->token)
20 if (p1->token == EQUALITY && p1->location != p2->location)
22 if (p1->value != p2->value)
27 void Predicate::add_predicate(token_t token, void * location, bool value)
29 struct pred_expr *ptr = new pred_expr(token, location, value);
30 pred_expressions.add(ptr);
33 void Predicate::add_child(Predicate * child)
35 /* check duplication? */
36 children.push_back(child);
39 void Predicate::add_parent(Predicate * parent)
41 /* check duplication? */
42 parents.push_back(parent);
45 void Predicate::print_predicate()
47 model_print("\"%p\" [shape=box, label=\"\n", this);
48 if (entry_predicate) {
49 model_print("entry node\"];\n");
55 PredExprSetIter * it = pred_expressions.iterator();
57 if (pred_expressions.getSize() == 0)
58 model_print("no predicate\n");
60 while (it->hasNext()) {
61 struct pred_expr * expr = it->next();
62 model_print("predicate: token: %d, location: %p, value: %d\n", expr->token, expr->location, expr->value);
64 model_print("\"];\n");
67 void Predicate::print_pred_subtree()
70 for (uint i = 0; i < children.size(); i++) {
71 Predicate * child = children[i];
72 child->print_pred_subtree();
73 model_print("\"%p\" -> \"%p\"\n", this, child);
77 model_print("\"%p\" -> \"%p\"[style=dashed, color=grey]\n", this, backedge);