predicate.cc

   1 #include "funcinst.h"
   2 #include "predicate.h"
   3 #include "concretepredicate.h"
   4
   5 Predicate::Predicate(FuncInst * func_inst, bool is_entry, bool is_exit) :
   6         func_inst(func_inst),
   7         entry_predicate(is_entry),
   8         exit_predicate(is_exit),
   9         does_write(false),
  10         depth(0),
  11         weight(100),
  12         exploration_count(0),
  13         store_visible_count(0),
  14         total_checking_count(0),
  15         pred_expressions(16),
  16         children(),
  17         parent(NULL),
  18         exit(NULL),
  19         backedges(16)
  20 {}
  21
  22 Predicate::~Predicate()
  23 {
  24         // parent and func_inst should not be deleted
  25         pred_expressions.reset();
  26         backedges.reset();
  27         children.clear();
  28 }
  29
  30 unsigned int pred_expr_hash(struct pred_expr * expr)
  31 {
  32         return (unsigned int)((uintptr_t)expr);
  33 }
  34
  35 bool pred_expr_equal(struct pred_expr * p1, struct pred_expr * p2)
  36 {
  37         if (p1->token != p2->token)
  38                 return false;
  39         if (p1->token == EQUALITY && p1->func_inst != p2->func_inst)
  40                 return false;
  41         if (p1->value != p2->value)
  42                 return false;
  43         return true;
  44 }
  45
  46 void Predicate::add_predicate_expr(token_t token, FuncInst * func_inst, bool value)
  47 {
  48         struct pred_expr *ptr = new pred_expr(token, func_inst, value);
  49         pred_expressions.add(ptr);
  50 }
  51
  52 void Predicate::add_child(Predicate * child)
  53 {
  54         /* check duplication? */
  55         children.push_back(child);
  56 }
  57
  58 void Predicate::set_parent(Predicate * parent_pred)
  59 {
  60         parent = parent_pred;
  61         depth = parent_pred->get_depth() + 1;
  62 }
  63
  64 void Predicate::set_exit(Predicate * exit_pred)
  65 {
  66         exit = exit_pred;
  67 }
  68
  69 void Predicate::copy_predicate_expr(Predicate * other)
  70 {
  71         PredExprSet * other_pred_expressions = other->get_pred_expressions();
  72         PredExprSetIter * it = other_pred_expressions->iterator();
  73
  74         while (it->hasNext()) {
  75                 struct pred_expr * ptr = it->next();
  76                 struct pred_expr * copy = new pred_expr(ptr->token, ptr->func_inst, ptr->value);
  77                 pred_expressions.add(copy);
  78         }
  79
  80         delete it;
  81 }
  82
  83 /* Evaluate predicate expressions against the given inst_act_map */
  84 ConcretePredicate * Predicate::evaluate(thread_id_t tid)
  85 {
  86         /*
  87            ConcretePredicate * concrete = new ConcretePredicate(tid);
  88            PredExprSetIter * it = pred_expressions.iterator();
  89
  90            while (it->hasNext()) {
  91                 struct pred_expr * ptr = it->next();
  92                 uint64_t value = 0;
  93
  94                 switch(ptr->token) {
  95                 case NOPREDICATE:
  96                         break;
  97                 case EQUALITY:
  98                         FuncInst * to_be_compared;
  99                         ModelAction * last_act;
 100
 101                         to_be_compared = ptr->func_inst;
 102                         last_act = inst_act_map->get(to_be_compared);
 103                         value = last_act->get_reads_from_value();
 104                         break;
 105                 case NULLITY:
 106                         break;
 107                 default:
 108                         break;
 109                 }
 110
 111                 concrete->add_expression(ptr->token, value, ptr->value);
 112            }
 113
 114            delete it;
 115            return concrete;
 116          */
 117
 118         return NULL;
 119 }
 120
 121 void Predicate::print_predicate()
 122 {
 123         model_print("\"%p\" [shape=box, label=\"", this);
 124         if (entry_predicate) {
 125                 model_print("entry node\"];\n");
 126                 return;
 127         }
 128
 129         if (exit_predicate) {
 130                 model_print("exit node\"];\n");
 131                 return;
 132         }
 133
 134         model_print("depth: %u; weight: %g\n", depth, weight);
 135
 136         func_inst->print();
 137
 138         if (pred_expressions.getSize() == 0)
 139                 model_print("predicate unset\n");
 140
 141         PredExprSetIter * it = pred_expressions.iterator();
 142         while (it->hasNext()) {
 143                 struct pred_expr * expr = it->next();
 144                 FuncInst * inst = expr->func_inst;
 145                 switch (expr->token) {
 146                 case NOPREDICATE:
 147                         break;
 148                 case EQUALITY:
 149                         model_print("predicate token: equality, position: %s, value: %d\n", inst->get_position(), expr->value);
 150                         break;
 151                 case NULLITY:
 152                         model_print("predicate token: nullity, value: %d\n", expr->value);
 153                         break;
 154                 default:
 155                         model_print("unknown predicate token\n");
 156                         break;
 157                 }
 158         }
 159
 160         if (does_write) {
 161                 model_print("Does write\n");
 162         }
 163
 164         double prob = (double) store_visible_count / total_checking_count;
 165         model_print("Total checks: %d, visible count: %d; prob: %f\n", total_checking_count, store_visible_count, prob);
 166         model_print("Exploration count: %d, failure count: %d", exploration_count, failure_count);
 167         model_print("\"];\n");
 168
 169         delete it;
 170 }
 171
 172 void Predicate::print_pred_subtree()
 173 {
 174         print_predicate();
 175         for (uint i = 0;i < children.size();i++) {
 176                 Predicate * child = children[i];
 177                 child->print_pred_subtree();
 178                 model_print("\"%p\" -> \"%p\"\n", this, child);
 179         }
 180
 181         PredSetIter * it = backedges.iterator();
 182         while (it->hasNext()) {
 183                 Predicate * backedge = it->next();
 184                 model_print("\"%p\" -> \"%p\"[style=dashed, color=grey]\n", this, backedge);
 185         }
 186
 187         if (exit) {
 188                 model_print("\"%p\" -> \"%p\"[style=dashed, color=red]\n", this, exit);
 189         }
 190
 191         delete it;
 192 }