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