entry_predicate(is_entry),
exit_predicate(is_exit),
does_write(false),
+ depth(0),
+ weight(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::set_exit(Predicate * exit_pred)
+{
+ exit = exit_pred;
+}
+
void Predicate::copy_predicate_expr(Predicate * other)
{
PredExprSet * other_pred_expressions = other->get_pred_expressions();
}
}
+/* Follow the child if any child whose FuncInst matches with inst
+ *
+ * @param inst must be an ATOMIC_WRITE FuncInst
+ * @return NULL if no such child is found.
+ */
+Predicate * Predicate::follow_write_child(FuncInst * inst)
+{
+ ASSERT(inst->get_type() == ATOMIC_WRITE);
+
+ for (uint i = 0; i < children.size(); i++) {
+ Predicate * child = children[i];
+ if (child->get_func_inst() == inst)
+ return child;
+ }
+
+ return NULL;
+}
+
/* 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: %u; weight: %g\n", depth, weight);
+
func_inst->print();
if (pred_expressions.getSize() == 0)