Add an exit node in predicate trees

[c11tester.git] / predicate.cc

diff --git a/predicate.cc b/predicate.cc
index a64737e80e0dc511f93f2381583cddf207c04a86..0f7c620d5e48a471c94ad9ee3e5d070900d51712 100644 (file)
--- a/predicate.cc
+++ b/predicate.cc
@@ -2,14 +2,16 @@
 #include "predicate.h"
 #include "concretepredicate.h"
 
-Predicate::Predicate(FuncInst * func_inst, bool is_entry) :
+Predicate::Predicate(FuncInst * func_inst, bool is_entry, bool is_exit) :
        func_inst(func_inst),
        entry_predicate(is_entry),
+       exit_predicate(is_exit),
        does_write(false),
        exploration_count(0),
        pred_expressions(16),
        children(),
        parent(NULL),
+       exit(NULL),
        backedges(16)
 {}
 
@@ -102,6 +104,11 @@ void Predicate::print_predicate()
                return;
        }
 
+       if (exit_predicate) {
+               model_print("exit node\"];\n");
+               return;
+       }
+
        func_inst->print();
 
        PredExprSetIter * it = pred_expressions.iterator();
@@ -148,4 +155,8 @@ void Predicate::print_pred_subtree()
                Predicate * backedge = it->next();
                model_print("\"%p\" -> \"%p\"[style=dashed, color=grey]\n", this, backedge);
        }
+
+       if (exit) {
+               model_print("\"%p\" -> \"%p\"[style=dashed, color=red]\n", this, exit);
+       }
 }