3 #include "concretepredicate.h"
5 Predicate::Predicate(FuncInst * func_inst, bool is_entry, bool is_exit) :
7 entry_predicate(is_entry),
8 exit_predicate(is_exit),
13 store_visible_count(0),
14 total_checking_count(0),
22 Predicate::~Predicate()
24 // parent and func_inst should not be deleted
25 pred_expressions.reset();
30 unsigned int pred_expr_hash(struct pred_expr * expr)
32 return (unsigned int)((uintptr_t)expr);
35 bool pred_expr_equal(struct pred_expr * p1, struct pred_expr * p2)
37 if (p1->token != p2->token)
39 if (p1->token == EQUALITY && p1->func_inst != p2->func_inst)
41 if (p1->value != p2->value)
46 void Predicate::add_predicate_expr(token_t token, FuncInst * func_inst, bool value)
48 struct pred_expr *ptr = new pred_expr(token, func_inst, value);
49 pred_expressions.add(ptr);
52 void Predicate::add_child(Predicate * child)
54 /* check duplication? */
55 children.push_back(child);
58 void Predicate::set_parent(Predicate * parent_pred)
61 depth = parent_pred->get_depth() + 1;
64 void Predicate::set_exit(Predicate * exit_pred)
69 void Predicate::copy_predicate_expr(Predicate * other)
71 PredExprSet * other_pred_expressions = other->get_pred_expressions();
72 PredExprSetIter * it = other_pred_expressions->iterator();
74 while (it->hasNext()) {
75 struct pred_expr * ptr = it->next();
76 struct pred_expr * copy = new pred_expr(ptr->token, ptr->func_inst, ptr->value);
77 pred_expressions.add(copy);
81 /* Return the single child branch of this predicate.
82 * Return NULL if this predicate has no children.
84 Predicate * Predicate::get_single_child(FuncInst * inst)
86 int size = children.size();
90 /* Should only have one child */
92 Predicate * child = children[0];
94 ASSERT(child->get_func_inst() == inst);
99 /* Evaluate predicate expressions against the given inst_act_map */
100 ConcretePredicate * Predicate::evaluate(inst_act_map_t * inst_act_map, thread_id_t tid)
102 ConcretePredicate * concrete = new ConcretePredicate(tid);
103 PredExprSetIter * it = pred_expressions.iterator();
105 while (it->hasNext()) {
106 struct pred_expr * ptr = it->next();
113 FuncInst * to_be_compared;
114 ModelAction * last_act;
116 to_be_compared = ptr->func_inst;
117 last_act = inst_act_map->get(to_be_compared);
118 value = last_act->get_reads_from_value();
126 concrete->add_expression(ptr->token, value, ptr->value);
132 void Predicate::print_predicate()
134 model_print("\"%p\" [shape=box, label=\"", this);
135 if (entry_predicate) {
136 model_print("entry node\"];\n");
140 if (exit_predicate) {
141 model_print("exit node\"];\n");
145 model_print("depth: %u; weight: %g\n", depth, weight);
149 if (pred_expressions.getSize() == 0)
150 model_print("predicate unset\n");
152 PredExprSetIter * it = pred_expressions.iterator();
153 while (it->hasNext()) {
154 struct pred_expr * expr = it->next();
155 FuncInst * inst = expr->func_inst;
156 switch (expr->token) {
160 model_print("predicate token: equality, position: %s, value: %d\n", inst->get_position(), expr->value);
163 model_print("predicate token: nullity, value: %d\n", expr->value);
166 model_print("unknown predicate token\n");
172 model_print("Does write\n");
175 double prob = (double) store_visible_count / total_checking_count;
176 model_print("Total checks: %d, visible count: %d; prob: %f\n", total_checking_count, store_visible_count, prob);
177 model_print("Exploration count: %d", exploration_count);
178 model_print("\"];\n");
181 void Predicate::print_pred_subtree()
184 for (uint i = 0;i < children.size();i++) {
185 Predicate * child = children[i];
186 child->print_pred_subtree();
187 model_print("\"%p\" -> \"%p\"\n", this, child);
190 PredSetIter * it = backedges.iterator();
191 while (it->hasNext()) {
192 Predicate * backedge = it->next();
193 model_print("\"%p\" -> \"%p\"[style=dashed, color=grey]\n", this, backedge);
197 model_print("\"%p\" -> \"%p\"[style=dashed, color=red]\n", this, exit);