Predicate::Predicate(FuncInst * func_inst, bool is_entry) :
func_inst(func_inst),
entry_predicate(is_entry),
- pred_expressions(),
+ pred_expressions(16),
children(),
parent(NULL),
- backedge(NULL)
+ backedges(16)
{}
+Predicate::~Predicate()
+{
+ // parent and func_inst should not be deleted
+ pred_expressions.reset();
+ backedges.reset();
+ children.clear();
+}
+
unsigned int pred_expr_hash(struct pred_expr * expr)
{
return (unsigned int)((uintptr_t)expr);
PredExprSetIter * it = pred_expressions.iterator();
if (pred_expressions.getSize() == 0)
- model_print("no predicate\n");
+ model_print("predicate unset\n");
while (it->hasNext()) {
struct pred_expr * expr = it->next();
FuncInst * inst = expr->func_inst;
switch (expr->token) {
+ case NOPREDICATE:
+ break;
case EQUALITY:
model_print("predicate token: equality, position: %s, value: %d\n", inst->get_position(), expr->value);
break;
model_print("\"%p\" -> \"%p\"\n", this, child);
}
- if (backedge != NULL)
+ PredSetIter * it = backedges.iterator();
+ while (it->hasNext()) {
+ Predicate * backedge = it->next();
model_print("\"%p\" -> \"%p\"[style=dashed, color=grey]\n", this, backedge);
+ }
}