X-Git-Url: http://plrg.eecs.uci.edu/git/?p=c11tester.git;a=blobdiff_plain;f=predicate.cc;h=7710705174860433473b7f8d7a995e198d40a212;hp=5695452853f93cbc5c887c25acdff6c9e63fc4cd;hb=25b12680719a51fc81d1681a280e076920dcaabc;hpb=41757c6c33945d547c0afa3b9456009e941540f3

diff --git a/predicate.cc b/predicate.cc
index 56954528..77107051 100644
--- a/predicate.cc
+++ b/predicate.cc
@@ -1,20 +1,26 @@
+#include "funcinst.h"
 #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),
+	depth(0),
+	exploration_count(0),
+	store_visible_count(0),
+	total_checking_count(0),
 	pred_expressions(16),
 	children(),
 	parent(NULL),
+	exit(NULL),
 	backedges(16)
 {}
 
 Predicate::~Predicate()
 {
-//	if (func_inst)
-//		delete func_inst;
-
-	// parent should not be deleted
+	// parent and func_inst should not be deleted
 	pred_expressions.reset();
 	backedges.reset();
 	children.clear();
@@ -22,7 +28,7 @@ Predicate::~Predicate()
 
 unsigned int pred_expr_hash(struct pred_expr * expr)
 {
-        return (unsigned int)((uintptr_t)expr);
+	return (unsigned int)((uintptr_t)expr);
 }
 
 bool pred_expr_equal(struct pred_expr * p1, struct pred_expr * p2)
@@ -48,6 +54,12 @@ void Predicate::add_child(Predicate * child)
 	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();
@@ -60,45 +72,110 @@ void Predicate::copy_predicate_expr(Predicate * other)
 	}
 }
 
+/* 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)
+{
+	ConcretePredicate * concrete = new ConcretePredicate(tid);
+	PredExprSetIter * it = pred_expressions.iterator();
+
+	while (it->hasNext()) {
+		struct pred_expr * ptr = it->next();
+		uint64_t value = 0;
+
+		switch(ptr->token) {
+		case NOPREDICATE:
+			break;
+		case EQUALITY:
+			FuncInst * to_be_compared;
+			ModelAction * last_act;
+
+			to_be_compared = ptr->func_inst;
+			last_act = inst_act_map->get(to_be_compared);
+			value = last_act->get_reads_from_value();
+			break;
+		case NULLITY:
+			break;
+		default:
+			break;
+		}
+
+		concrete->add_expression(ptr->token, value, ptr->value);
+	}
+
+	return concrete;
+}
+
 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;
 	}
 
-	func_inst->print();
+	if (exit_predicate) {
+		model_print("exit node\"];\n");
+		return;
+	}
 
-	PredExprSetIter * it = pred_expressions.iterator();
+	model_print("depth: %d\n", depth);
+
+	func_inst->print();
 
 	if (pred_expressions.getSize() == 0)
 		model_print("predicate unset\n");
 
+	PredExprSetIter * it = pred_expressions.iterator();
 	while (it->hasNext()) {
 		struct pred_expr * expr = it->next();
 		FuncInst * inst = expr->func_inst;
 		switch (expr->token) {
-			case NOPREDICATE:
-				break;
-			case EQUALITY:
-				model_print("predicate token: equality, position: %s, value: %d\n", inst->get_position(), expr->value);
-				break;
-			case NULLITY:
-				model_print("predicate token: nullity, value: %d\n", expr->value);
-				break;
-			default:
-				model_print("unknown predicate token\n");
-				break;
+		case NOPREDICATE:
+			break;
+		case EQUALITY:
+			model_print("predicate token: equality, position: %s, value: %d\n", inst->get_position(), expr->value);
+			break;
+		case NULLITY:
+			model_print("predicate token: nullity, value: %d\n", expr->value);
+			break;
+		default:
+			model_print("unknown predicate token\n");
+			break;
 		}
 	}
+
+	if (does_write) {
+		model_print("Does write\n");
+	}
+
+	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("\"];\n");
 }
 
 void Predicate::print_pred_subtree()
 {
 	print_predicate();
-	for (uint i = 0; i < children.size(); i++) {
+	for (uint i = 0;i < children.size();i++) {
 		Predicate * child = children[i];
 		child->print_pred_subtree();
 		model_print("\"%p\" -> \"%p\"\n", this, child);
@@ -109,4 +186,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);
+	}
 }