#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),
+ failure_count(0),
+ sleep_score(0),
pred_expressions(16),
children(),
parent(NULL),
+ exit(NULL),
backedges(16)
{}
return concrete;
}
+void Predicate::incr_expl_count()
+{
+ exploration_count++;
+}
+
+void Predicate::incr_fail_count()
+{
+ failure_count++;
+}
+
+void Predicate::incr_sleep_score(uint32_t amount)
+{
+ if (sleep_score + amount > 100)
+ sleep_score = 100;
+ else
+ sleep_score += amount;
+}
+
+void Predicate::decr_sleep_score(uint32_t amount)
+{
+ if (sleep_score > amount)
+ sleep_score -= amount;
+ else
+ sleep_score = 0;
+}
+
void Predicate::print_predicate()
{
model_print("\"%p\" [shape=box, label=\"\n", this);
return;
}
+ if (exit_predicate) {
+ model_print("exit node\"];\n");
+ return;
+ }
+
func_inst->print();
PredExprSetIter * it = pred_expressions.iterator();
if (does_write) {
model_print("Does write\n");
}
- model_print("Count: %d\n", exploration_count);
+ model_print("Count: %d, failed count: %d\n", exploration_count, failure_count);
model_print("\"];\n");
}
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);
+ }
}