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),
19 Predicate::~Predicate()
21 // parent and func_inst should not be deleted
22 pred_expressions.reset();
27 unsigned int pred_expr_hash(struct pred_expr * expr)
29 return (unsigned int)((uintptr_t)expr);
32 bool pred_expr_equal(struct pred_expr * p1, struct pred_expr * p2)
34 if (p1->token != p2->token)
36 if (p1->token == EQUALITY && p1->func_inst != p2->func_inst)
38 if (p1->value != p2->value)
43 void Predicate::add_predicate_expr(token_t token, FuncInst * func_inst, bool value)
45 struct pred_expr *ptr = new pred_expr(token, func_inst, value);
46 pred_expressions.add(ptr);
49 void Predicate::add_child(Predicate * child)
51 /* check duplication? */
52 children.push_back(child);
55 void Predicate::copy_predicate_expr(Predicate * other)
57 PredExprSet * other_pred_expressions = other->get_pred_expressions();
58 PredExprSetIter * it = other_pred_expressions->iterator();
60 while (it->hasNext()) {
61 struct pred_expr * ptr = it->next();
62 struct pred_expr * copy = new pred_expr(ptr->token, ptr->func_inst, ptr->value);
63 pred_expressions.add(copy);
67 /* Evaluate predicate expressions against the given inst_act_map */
68 ConcretePredicate * Predicate::evaluate(inst_act_map_t * inst_act_map, thread_id_t tid)
70 ConcretePredicate * concrete = new ConcretePredicate(tid);
71 PredExprSetIter * it = pred_expressions.iterator();
73 while (it->hasNext()) {
74 struct pred_expr * ptr = it->next();
81 FuncInst * to_be_compared;
82 ModelAction * last_act;
84 to_be_compared = ptr->func_inst;
85 last_act = inst_act_map->get(to_be_compared);
86 value = last_act->get_reads_from_value();
94 concrete->add_expression(ptr->token, value, ptr->value);
100 void Predicate::print_predicate()
102 model_print("\"%p\" [shape=box, label=\"\n", this);
103 if (entry_predicate) {
104 model_print("entry node\"];\n");
108 if (exit_predicate) {
109 model_print("exit node\"];\n");
115 PredExprSetIter * it = pred_expressions.iterator();
117 if (pred_expressions.getSize() == 0)
118 model_print("predicate unset\n");
120 while (it->hasNext()) {
121 struct pred_expr * expr = it->next();
122 FuncInst * inst = expr->func_inst;
123 switch (expr->token) {
127 model_print("predicate token: equality, position: %s, value: %d\n", inst->get_position(), expr->value);
130 model_print("predicate token: nullity, value: %d\n", expr->value);
133 model_print("unknown predicate token\n");
139 model_print("Does write\n");
141 model_print("Count: %d, failed count: %d\n", exploration_count, failure_count);
142 model_print("\"];\n");
145 void Predicate::print_pred_subtree()
148 for (uint i = 0; i < children.size(); i++) {
149 Predicate * child = children[i];
150 child->print_pred_subtree();
151 model_print("\"%p\" -> \"%p\"\n", this, child);
154 PredSetIter * it = backedges.iterator();
155 while (it->hasNext()) {
156 Predicate * backedge = it->next();
157 model_print("\"%p\" -> \"%p\"[style=dashed, color=grey]\n", this, backedge);
161 model_print("\"%p\" -> \"%p\"[style=dashed, color=red]\n", this, exit);