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),
11 store_visible_count(0),
12 total_checking_count(0),
20 Predicate::~Predicate()
22 // parent and func_inst should not be deleted
23 pred_expressions.reset();
28 unsigned int pred_expr_hash(struct pred_expr * expr)
30 return (unsigned int)((uintptr_t)expr);
33 bool pred_expr_equal(struct pred_expr * p1, struct pred_expr * p2)
35 if (p1->token != p2->token)
37 if (p1->token == EQUALITY && p1->func_inst != p2->func_inst)
39 if (p1->value != p2->value)
44 void Predicate::add_predicate_expr(token_t token, FuncInst * func_inst, bool value)
46 struct pred_expr *ptr = new pred_expr(token, func_inst, value);
47 pred_expressions.add(ptr);
50 void Predicate::add_child(Predicate * child)
52 /* check duplication? */
53 children.push_back(child);
56 void Predicate::copy_predicate_expr(Predicate * other)
58 PredExprSet * other_pred_expressions = other->get_pred_expressions();
59 PredExprSetIter * it = other_pred_expressions->iterator();
61 while (it->hasNext()) {
62 struct pred_expr * ptr = it->next();
63 struct pred_expr * copy = new pred_expr(ptr->token, ptr->func_inst, ptr->value);
64 pred_expressions.add(copy);
68 /* Return the single child branch of this predicate.
69 * Return NULL if this predicate has no children.
71 Predicate * Predicate::get_single_child(FuncInst * inst)
73 int size = children.size();
77 /* Should only have one child */
79 Predicate * child = children[0];
81 ASSERT(child->get_func_inst() == inst);
86 /* Evaluate predicate expressions against the given inst_act_map */
87 ConcretePredicate * Predicate::evaluate(inst_act_map_t * inst_act_map, thread_id_t tid)
89 ConcretePredicate * concrete = new ConcretePredicate(tid);
90 PredExprSetIter * it = pred_expressions.iterator();
92 while (it->hasNext()) {
93 struct pred_expr * ptr = it->next();
100 FuncInst * to_be_compared;
101 ModelAction * last_act;
103 to_be_compared = ptr->func_inst;
104 last_act = inst_act_map->get(to_be_compared);
105 value = last_act->get_reads_from_value();
113 concrete->add_expression(ptr->token, value, ptr->value);
119 void Predicate::print_predicate()
121 model_print("\"%p\" [shape=box, label=\"\n", this);
122 if (entry_predicate) {
123 model_print("entry node\"];\n");
127 if (exit_predicate) {
128 model_print("exit node\"];\n");
134 if (pred_expressions.getSize() == 0)
135 model_print("predicate unset\n");
137 PredExprSetIter * it = pred_expressions.iterator();
138 while (it->hasNext()) {
139 struct pred_expr * expr = it->next();
140 FuncInst * inst = expr->func_inst;
141 switch (expr->token) {
145 model_print("predicate token: equality, position: %s, value: %d\n", inst->get_position(), expr->value);
148 model_print("predicate token: nullity, value: %d\n", expr->value);
151 model_print("unknown predicate token\n");
157 model_print("Does write\n");
160 double prob = (double) store_visible_count / total_checking_count;
161 model_print("Total checks: %d, visible count: %d; prob: %f\n", total_checking_count, store_visible_count, prob);
162 model_print("Exploration count: %d", exploration_count);
163 model_print("\"];\n");
166 void Predicate::print_pred_subtree()
169 for (uint i = 0;i < children.size();i++) {
170 Predicate * child = children[i];
171 child->print_pred_subtree();
172 model_print("\"%p\" -> \"%p\"\n", this, child);
175 PredSetIter * it = backedges.iterator();
176 while (it->hasNext()) {
177 Predicate * backedge = it->next();
178 model_print("\"%p\" -> \"%p\"[style=dashed, color=grey]\n", this, backedge);
182 model_print("\"%p\" -> \"%p\"[style=dashed, color=red]\n", this, exit);