entry_predicate(is_entry),
exit_predicate(is_exit),
does_write(false),
+ depth(0),
+ weight(100),
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();
struct pred_expr * copy = new pred_expr(ptr->token, ptr->func_inst, ptr->value);
pred_expressions.add(copy);
}
-}
-/* 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;
+ delete it;
}
/* Evaluate predicate expressions against the given inst_act_map */
-ConcretePredicate * Predicate::evaluate(inst_act_map_t * inst_act_map, thread_id_t tid)
+ConcretePredicate * Predicate::evaluate(thread_id_t tid)
{
+ /*
ConcretePredicate * concrete = new ConcretePredicate(tid);
PredExprSetIter * it = pred_expressions.iterator();
concrete->add_expression(ptr->token, value, ptr->value);
}
+ delete it;
return concrete;
+ */
+
+ return NULL;
}
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)
double prob = (double) store_visible_count / total_checking_count;
model_print("Total checks: %d, visible count: %d; prob: %f\n", total_checking_count, store_visible_count, prob);
- model_print("Exploration count: %d", exploration_count);
+ model_print("Exploration count: %d, failure count: %d", exploration_count, failure_count);
model_print("\"];\n");
+
+ delete it;
}
void Predicate::print_pred_subtree()
if (exit) {
model_print("\"%p\" -> \"%p\"[style=dashed, color=red]\n", this, exit);
}
+
+ delete it;
}