predicate.cc

   1 #include "predicate.h"
   2
   3 Predicate::Predicate(FuncInst * func_inst, bool is_entry) :
   4         func_inst(func_inst),
   5         entry_predicate(is_entry),
   6         pred_expressions(16),
   7         children(),
   8         parent(NULL),
   9         backedges(16)
  10 {}
  11
  12 Predicate::~Predicate()
  13 {
  14         // parent and func_inst should not be deleted
  15         pred_expressions.reset();
  16         backedges.reset();
  17         children.clear();
  18 }
  19
  20 unsigned int pred_expr_hash(struct pred_expr * expr)
  21 {
  22         return (unsigned int)((uintptr_t)expr);
  23 }
  24
  25 bool pred_expr_equal(struct pred_expr * p1, struct pred_expr * p2)
  26 {
  27         if (p1->token != p2->token)
  28                 return false;
  29         if (p1->token == EQUALITY && p1->func_inst != p2->func_inst)
  30                 return false;
  31         if (p1->value != p2->value)
  32                 return false;
  33         return true;
  34 }
  35
  36 void Predicate::add_predicate_expr(token_t token, FuncInst * func_inst, bool value)
  37 {
  38         struct pred_expr *ptr = new pred_expr(token, func_inst, value);
  39         pred_expressions.add(ptr);
  40 }
  41
  42 void Predicate::add_child(Predicate * child)
  43 {
  44         /* check duplication? */
  45         children.push_back(child);
  46 }
  47
  48 void Predicate::copy_predicate_expr(Predicate * other)
  49 {
  50         PredExprSet * other_pred_expressions = other->get_pred_expressions();
  51         PredExprSetIter * it = other_pred_expressions->iterator();
  52
  53         while (it->hasNext()) {
  54                 struct pred_expr * ptr = it->next();
  55                 struct pred_expr * copy = new pred_expr(ptr->token, ptr->func_inst, ptr->value);
  56                 pred_expressions.add(copy);
  57         }
  58 }
  59
  60 void Predicate::print_predicate()
  61 {
  62         model_print("\"%p\" [shape=box, label=\"\n", this);
  63         if (entry_predicate) {
  64                 model_print("entry node\"];\n");
  65                 return;
  66         }
  67
  68         func_inst->print();
  69
  70         PredExprSetIter * it = pred_expressions.iterator();
  71
  72         if (pred_expressions.getSize() == 0)
  73                 model_print("predicate unset\n");
  74
  75         while (it->hasNext()) {
  76                 struct pred_expr * expr = it->next();
  77                 FuncInst * inst = expr->func_inst;
  78                 switch (expr->token) {
  79                         case NOPREDICATE:
  80                                 break;
  81                         case EQUALITY:
  82                                 model_print("predicate token: equality, position: %s, value: %d\n", inst->get_position(), expr->value);
  83                                 break;
  84                         case NULLITY:
  85                                 model_print("predicate token: nullity, value: %d\n", expr->value);
  86                                 break;
  87                         default:
  88                                 model_print("unknown predicate token\n");
  89                                 break;
  90                 }
  91         }
  92         model_print("\"];\n");
  93 }
  94
  95 void Predicate::print_pred_subtree()
  96 {
  97         print_predicate();
  98         for (uint i = 0; i < children.size(); i++) {
  99                 Predicate * child = children[i];
 100                 child->print_pred_subtree();
 101                 model_print("\"%p\" -> \"%p\"\n", this, child);
 102         }
 103
 104         PredSetIter * it = backedges.iterator();
 105         while (it->hasNext()) {
 106                 Predicate * backedge = it->next();
 107                 model_print("\"%p\" -> \"%p\"[style=dashed, color=grey]\n", this, backedge);
 108         }
 109 }