3 Predicate::Predicate(FuncInst * func_inst, bool is_entry) :
5 entry_predicate(is_entry),
12 Predicate::~Predicate()
14 // parent and func_inst should not be deleted
15 pred_expressions.reset();
20 unsigned int pred_expr_hash(struct pred_expr * expr)
22 return (unsigned int)((uintptr_t)expr);
25 bool pred_expr_equal(struct pred_expr * p1, struct pred_expr * p2)
27 if (p1->token != p2->token)
29 if (p1->token == EQUALITY && p1->func_inst != p2->func_inst)
31 if (p1->value != p2->value)
36 void Predicate::add_predicate_expr(token_t token, FuncInst * func_inst, bool value)
38 struct pred_expr *ptr = new pred_expr(token, func_inst, value);
39 pred_expressions.add(ptr);
42 void Predicate::add_child(Predicate * child)
44 /* check duplication? */
45 children.push_back(child);
48 void Predicate::copy_predicate_expr(Predicate * other)
50 PredExprSet * other_pred_expressions = other->get_pred_expressions();
51 PredExprSetIter * it = other_pred_expressions->iterator();
53 while (it->hasNext()) {
54 struct pred_expr * ptr = it->next();
55 struct pred_expr * copy = new pred_expr(ptr->token, ptr->func_inst, ptr->value);
56 pred_expressions.add(copy);
60 void Predicate::print_predicate()
62 model_print("\"%p\" [shape=box, label=\"\n", this);
63 if (entry_predicate) {
64 model_print("entry node\"];\n");
70 PredExprSetIter * it = pred_expressions.iterator();
72 if (pred_expressions.getSize() == 0)
73 model_print("predicate unset\n");
75 while (it->hasNext()) {
76 struct pred_expr * expr = it->next();
77 FuncInst * inst = expr->func_inst;
78 switch (expr->token) {
82 model_print("predicate token: equality, position: %s, value: %d\n", inst->get_position(), expr->value);
85 model_print("predicate token: nullity, value: %d\n", expr->value);
88 model_print("unknown predicate token\n");
92 model_print("\"];\n");
95 void Predicate::print_pred_subtree()
98 for (uint i = 0; i < children.size(); i++) {
99 Predicate * child = children[i];
100 child->print_pred_subtree();
101 model_print("\"%p\" -> \"%p\"\n", this, child);
104 PredSetIter * it = backedges.iterator();
105 while (it->hasNext()) {
106 Predicate * backedge = it->next();
107 model_print("\"%p\" -> \"%p\"[style=dashed, color=grey]\n", this, backedge);