experiment with adding NULLITY predicate

[c11tester.git] / predicate.cc

diff --git a/predicate.cc b/predicate.cc
index 4458e8b9733c8954db417a7944daa2cc0c50620c..128ac3dc4155ddcec0a8cbda9143b9d0e4fa5089 100644 (file)
--- a/predicate.cc
+++ b/predicate.cc
@@ -1,9 +1,12 @@
 #include "predicate.h"
 
-Predicate::Predicate(FuncInst * func_inst) :
+Predicate::Predicate(FuncInst * func_inst, bool is_entry) :
        func_inst(func_inst),
-       predicates(),
-       children()
+       entry_predicate(is_entry),
+       pred_expressions(),
+       children(),
+       parent(NULL),
+       backedge(NULL)
 {}
 
 unsigned int pred_expr_hash(struct pred_expr * expr)
@@ -25,7 +28,7 @@ bool pred_expr_equal(struct pred_expr * p1, struct pred_expr * p2)
 void Predicate::add_predicate(token_t token, void * location, bool value)
 {
        struct pred_expr *ptr = new pred_expr(token, location, value);
-       predicates.add(ptr);
+       pred_expressions.add(ptr);
 }
 
 void Predicate::add_child(Predicate * child)
@@ -36,17 +39,24 @@ void Predicate::add_child(Predicate * child)
 
 void Predicate::print_predicate()
 {
-       //model_print("self: %p ", this);
+       model_print("\"%p\" [shape=box, label=\"\n", this);
+       if (entry_predicate) {
+               model_print("entry node\"];\n");
+               return;
+       }
+
        func_inst->print();
-       PredSetIter * it = predicates.iterator();
 
-       if (predicates.getSize() == 0)
+       PredExprSetIter * it = pred_expressions.iterator();
+
+       if (pred_expressions.getSize() == 0)
                model_print("no predicate\n");
 
        while (it->hasNext()) {
                struct pred_expr * expr = it->next();
-               model_print("token: %d, location: %p, value: %d\n", expr->token, expr->location, expr->value);
+               model_print("predicate: token: %d, location: %p, value: %d\n", expr->token, expr->location, expr->value);
        }
+       model_print("\"];\n");
 }
 
 void Predicate::print_pred_subtree()
@@ -54,7 +64,10 @@ void Predicate::print_pred_subtree()
        print_predicate();
        for (uint i = 0; i < children.size(); i++) {
                Predicate * child = children[i];
-//             model_print("parent: %p - ", this);
                child->print_pred_subtree();
+               model_print("\"%p\" -> \"%p\"\n", this, child);
        }
+
+       if (backedge != NULL)
+               model_print("\"%p\" -> \"%p\"[style=dashed, color=grey]\n", this, backedge);
 }