2 #include "concretepredicate.h"
4 Predicate::Predicate(FuncInst * func_inst, bool is_entry) :
6 entry_predicate(is_entry),
14 Predicate::~Predicate()
16 // parent and func_inst should not be deleted
17 pred_expressions.reset();
22 unsigned int pred_expr_hash(struct pred_expr * expr)
24 return (unsigned int)((uintptr_t)expr);
27 bool pred_expr_equal(struct pred_expr * p1, struct pred_expr * p2)
29 if (p1->token != p2->token)
31 if (p1->token == EQUALITY && p1->func_inst != p2->func_inst)
33 if (p1->value != p2->value)
38 void Predicate::add_predicate_expr(token_t token, FuncInst * func_inst, bool value)
40 struct pred_expr *ptr = new pred_expr(token, func_inst, value);
41 pred_expressions.add(ptr);
44 void Predicate::add_child(Predicate * child)
46 /* check duplication? */
47 children.push_back(child);
50 void Predicate::copy_predicate_expr(Predicate * other)
52 PredExprSet * other_pred_expressions = other->get_pred_expressions();
53 PredExprSetIter * it = other_pred_expressions->iterator();
55 while (it->hasNext()) {
56 struct pred_expr * ptr = it->next();
57 struct pred_expr * copy = new pred_expr(ptr->token, ptr->func_inst, ptr->value);
58 pred_expressions.add(copy);
62 /* Evaluate predicate expressions against the given inst_act_map */
63 ConcretePredicate * Predicate::evaluate(inst_act_map_t * inst_act_map, thread_id_t tid)
65 ConcretePredicate * concrete = new ConcretePredicate(tid);
66 PredExprSetIter * it = pred_expressions.iterator();
68 while (it->hasNext()) {
69 struct pred_expr * ptr = it->next();
76 FuncInst * to_be_compared;
77 ModelAction * last_act;
79 to_be_compared = ptr->func_inst;
80 last_act = inst_act_map->get(to_be_compared);
81 value = last_act->get_reads_from_value();
89 concrete->add_expression(ptr->token, value, ptr->value);
96 void Predicate::print_predicate()
98 model_print("\"%p\" [shape=box, label=\"\n", this);
99 if (entry_predicate) {
100 model_print("entry node\"];\n");
106 PredExprSetIter * it = pred_expressions.iterator();
108 if (pred_expressions.getSize() == 0)
109 model_print("predicate unset\n");
111 while (it->hasNext()) {
112 struct pred_expr * expr = it->next();
113 FuncInst * inst = expr->func_inst;
114 switch (expr->token) {
118 model_print("predicate token: equality, position: %s, value: %d\n", inst->get_position(), expr->value);
121 model_print("predicate token: nullity, value: %d\n", expr->value);
124 model_print("unknown predicate token\n");
130 model_print("Does write\n");
132 model_print("\"];\n");
135 void Predicate::print_pred_subtree()
138 for (uint i = 0; i < children.size(); i++) {
139 Predicate * child = children[i];
140 child->print_pred_subtree();
141 model_print("\"%p\" -> \"%p\"\n", this, child);
144 PredSetIter * it = backedges.iterator();
145 while (it->hasNext()) {
146 Predicate * backedge = it->next();
147 model_print("\"%p\" -> \"%p\"[style=dashed, color=grey]\n", this, backedge);