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(0),
  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
  81 /* Return the single child branch of this predicate.
  82  * Return NULL if this predicate has no children.
  83  */
  84 Predicate * Predicate::get_single_child(FuncInst * inst)
  85 {
  86         int size = children.size();
  87         if (size == 0)
  88                 return NULL;
  89
  90         /* Should only have one child */
  91         ASSERT(size == 1);
  92         Predicate * child = children[0];
  93
  94         ASSERT(child->get_func_inst() == inst);
  95
  96         return child;
  97 }
  98
  99 /* Evaluate predicate expressions against the given inst_act_map */
 100 ConcretePredicate * Predicate::evaluate(inst_act_map_t * inst_act_map, thread_id_t tid)
 101 {
 102         ConcretePredicate * concrete = new ConcretePredicate(tid);
 103         PredExprSetIter * it = pred_expressions.iterator();
 104
 105         while (it->hasNext()) {
 106                 struct pred_expr * ptr = it->next();
 107                 uint64_t value = 0;
 108
 109                 switch(ptr->token) {
 110                 case NOPREDICATE:
 111                         break;
 112                 case EQUALITY:
 113                         FuncInst * to_be_compared;
 114                         ModelAction * last_act;
 115
 116                         to_be_compared = ptr->func_inst;
 117                         last_act = inst_act_map->get(to_be_compared);
 118                         value = last_act->get_reads_from_value();
 119                         break;
 120                 case NULLITY:
 121                         break;
 122                 default:
 123                         break;
 124                 }
 125
 126                 concrete->add_expression(ptr->token, value, ptr->value);
 127         }
 128
 129         return concrete;
 130 }
 131
 132 void Predicate::print_predicate()
 133 {
 134         model_print("\"%p\" [shape=box, label=\"", this);
 135         if (entry_predicate) {
 136                 model_print("entry node\"];\n");
 137                 return;
 138         }
 139
 140         if (exit_predicate) {
 141                 model_print("exit node\"];\n");
 142                 return;
 143         }
 144
 145         model_print("depth: %u; weight: %g\n", depth, weight);
 146
 147         func_inst->print();
 148
 149         if (pred_expressions.getSize() == 0)
 150                 model_print("predicate unset\n");
 151
 152         PredExprSetIter * it = pred_expressions.iterator();
 153         while (it->hasNext()) {
 154                 struct pred_expr * expr = it->next();
 155                 FuncInst * inst = expr->func_inst;
 156                 switch (expr->token) {
 157                 case NOPREDICATE:
 158                         break;
 159                 case EQUALITY:
 160                         model_print("predicate token: equality, position: %s, value: %d\n", inst->get_position(), expr->value);
 161                         break;
 162                 case NULLITY:
 163                         model_print("predicate token: nullity, value: %d\n", expr->value);
 164                         break;
 165                 default:
 166                         model_print("unknown predicate token\n");
 167                         break;
 168                 }
 169         }
 170
 171         if (does_write) {
 172                 model_print("Does write\n");
 173         }
 174
 175         double prob = (double) store_visible_count / total_checking_count;
 176         model_print("Total checks: %d, visible count: %d; prob: %f\n", total_checking_count, store_visible_count, prob);
 177         model_print("Exploration count: %d", exploration_count);
 178         model_print("\"];\n");
 179 }
 180
 181 void Predicate::print_pred_subtree()
 182 {
 183         print_predicate();
 184         for (uint i = 0;i < children.size();i++) {
 185                 Predicate * child = children[i];
 186                 child->print_pred_subtree();
 187                 model_print("\"%p\" -> \"%p\"\n", this, child);
 188         }
 189
 190         PredSetIter * it = backedges.iterator();
 191         while (it->hasNext()) {
 192                 Predicate * backedge = it->next();
 193                 model_print("\"%p\" -> \"%p\"[style=dashed, color=grey]\n", this, backedge);
 194         }
 195
 196         if (exit) {
 197                 model_print("\"%p\" -> \"%p\"[style=dashed, color=red]\n", this, exit);
 198         }
 199 }