entry_predicate(is_entry),
exit_predicate(is_exit),
does_write(false),
+ depth(0),
exploration_count(0),
store_visible_count(0),
total_checking_count(0),
children.push_back(child);
}
+void Predicate::set_parent(Predicate * parent_pred)
+{
+ parent = parent_pred;
+ depth = parent_pred->get_depth() + 1;
+}
+
void Predicate::copy_predicate_expr(Predicate * other)
{
PredExprSet * other_pred_expressions = other->get_pred_expressions();
}
}
+/* Return the single child branch of this predicate.
+ * Return NULL if this predicate has no children.
+ */
+Predicate * Predicate::get_single_child(FuncInst * inst)
+{
+ int size = children.size();
+ if (size == 0)
+ return NULL;
+
+ /* Should only have one child */
+ ASSERT(size == 1);
+ Predicate * child = children[0];
+
+ ASSERT(child->get_func_inst() == inst);
+
+ return child;
+}
+
/* Evaluate predicate expressions against the given inst_act_map */
ConcretePredicate * Predicate::evaluate(inst_act_map_t * inst_act_map, thread_id_t tid)
{
void Predicate::print_predicate()
{
- model_print("\"%p\" [shape=box, label=\"\n", this);
+ model_print("\"%p\" [shape=box, label=\"", this);
if (entry_predicate) {
model_print("entry node\"];\n");
return;
return;
}
+ model_print("depth: %d\n", depth);
+
func_inst->print();
if (pred_expressions.getSize() == 0)