3 Predicate::Predicate(FuncInst * func_inst, bool is_entry) :
5 entry_predicate(is_entry),
13 Predicate::~Predicate()
15 // parent and func_inst should not be deleted
16 pred_expressions.reset();
21 unsigned int pred_expr_hash(struct pred_expr * expr)
23 return (unsigned int)((uintptr_t)expr);
26 bool pred_expr_equal(struct pred_expr * p1, struct pred_expr * p2)
28 if (p1->token != p2->token)
30 if (p1->token == EQUALITY && p1->func_inst != p2->func_inst)
32 if (p1->value != p2->value)
37 void Predicate::add_predicate_expr(token_t token, FuncInst * func_inst, bool value)
39 struct pred_expr *ptr = new pred_expr(token, func_inst, value);
40 pred_expressions.add(ptr);
43 void Predicate::add_child(Predicate * child)
45 /* check duplication? */
46 children.push_back(child);
49 void Predicate::copy_predicate_expr(Predicate * other)
51 PredExprSet * other_pred_expressions = other->get_pred_expressions();
52 PredExprSetIter * it = other_pred_expressions->iterator();
54 while (it->hasNext()) {
55 struct pred_expr * ptr = it->next();
56 struct pred_expr * copy = new pred_expr(ptr->token, ptr->func_inst, ptr->value);
57 pred_expressions.add(copy);
61 /* Evaluate predicate expressions against the given inst_act_map */
62 SnapVector<struct concrete_pred_expr> Predicate::evaluate(inst_act_map_t * inst_act_map)
64 SnapVector<struct concrete_pred_expr> concrete_exprs;
65 PredExprSetIter * it = pred_expressions.iterator();
67 while (it->hasNext()) {
68 struct pred_expr * ptr = it->next();
75 FuncInst * to_be_compared;
76 ModelAction * last_act;
78 to_be_compared = ptr->func_inst;
79 last_act = inst_act_map->get(to_be_compared);
80 value = last_act->get_reads_from_value();
88 concrete_exprs.push_back(concrete_pred_expr(ptr->token, value, ptr->value));
91 return concrete_exprs;
94 void Predicate::print_predicate()
96 model_print("\"%p\" [shape=box, label=\"\n", this);
97 if (entry_predicate) {
98 model_print("entry node\"];\n");
104 PredExprSetIter * it = pred_expressions.iterator();
106 if (pred_expressions.getSize() == 0)
107 model_print("predicate unset\n");
109 while (it->hasNext()) {
110 struct pred_expr * expr = it->next();
111 FuncInst * inst = expr->func_inst;
112 switch (expr->token) {
116 model_print("predicate token: equality, position: %s, value: %d\n", inst->get_position(), expr->value);
119 model_print("predicate token: nullity, value: %d\n", expr->value);
122 model_print("unknown predicate token\n");
128 model_print("Does write\n");
130 model_print("\"];\n");
133 void Predicate::print_pred_subtree()
136 for (uint i = 0; i < children.size(); i++) {
137 Predicate * child = children[i];
138 child->print_pred_subtree();
139 model_print("\"%p\" -> \"%p\"\n", this, child);
142 PredSetIter * it = backedges.iterator();
143 while (it->hasNext()) {
144 Predicate * backedge = it->next();
145 model_print("\"%p\" -> \"%p\"[style=dashed, color=grey]\n", this, backedge);