funcnode.cc

   1 #include "funcnode.h"
   2
   3 FuncNode::FuncNode(ModelHistory * history) :
   4         history(history),
   5         predicate_tree_initialized(false),
   6         exit_count(0),
   7         func_inst_map(),
   8         inst_list(),
   9         entry_insts(),
  10 //      thrd_read_map(),
  11         action_list_buffer()
  12 {
  13         predicate_tree_entry = new Predicate(NULL, true);
  14         predicate_tree_entry->add_predicate_expr(NOPREDICATE, NULL, true);
  15
  16         // memory will be reclaimed after each execution
  17         read_locations = new loc_set_t();
  18         val_loc_map = new HashTable<uint64_t, loc_set_t *, uint64_t, 0>();
  19         loc_may_equal_map = new HashTable<void *, loc_set_t *, uintptr_t, 0>();
  20         values_may_read_from = new value_set_t();
  21 }
  22
  23 /* Reallocate some snapshotted memories when new executions start */
  24 void FuncNode::set_new_exec_flag()
  25 {
  26 //      for (uint i = 0; i < thrd_read_map.size(); i++)
  27 //              thrd_read_map[i] = new read_map_t();
  28
  29         for (mllnode<FuncInst *> * it = inst_list.begin(); it != NULL; it = it->getNext()) {
  30                 FuncInst * inst = it->getVal();
  31                 inst->reset_location();
  32         }
  33
  34         read_locations = new loc_set_t();
  35         val_loc_map = new HashTable<uint64_t, loc_set_t *, uint64_t, 0>();
  36         loc_may_equal_map = new HashTable<void *, loc_set_t *, uintptr_t, 0>();
  37         values_may_read_from = new value_set_t();
  38 }
  39
  40 /* Check whether FuncInst with the same type, position, and location
  41  * as act has been added to func_inst_map or not. If not, add it.
  42  *
  43  * Note: currently, actions with the same position are filtered out by process_action,
  44  * so the collision list of FuncInst is not used. May remove it later.
  45  */
  46 void FuncNode::add_inst(ModelAction *act)
  47 {
  48         ASSERT(act);
  49         const char * position = act->get_position();
  50
  51         /* THREAD* actions, ATOMIC_LOCK, ATOMIC_TRYLOCK, and ATOMIC_UNLOCK
  52          * actions are not tagged with their source line numbers
  53          */
  54         if (position == NULL)
  55                 return;
  56
  57         if ( func_inst_map.contains(position) ) {
  58                 FuncInst * inst = func_inst_map.get(position);
  59
  60                 ASSERT(inst->get_type() == act->get_type());
  61
  62                 // locations are set to NULL when new executions start
  63                 if (inst->get_location() == NULL)
  64                         inst->set_location(act->get_location());
  65
  66                 if (inst->get_location() != act->get_location())
  67                         inst->not_single_location();
  68
  69                 return;
  70         }
  71
  72         FuncInst * func_inst = new FuncInst(act, this);
  73
  74         func_inst_map.put(position, func_inst);
  75         inst_list.push_back(func_inst);
  76 }
  77
  78 /* Get the FuncInst with the same type, position, and location
  79  * as act
  80  *
  81  * @return FuncInst with the same type, position, and location as act */
  82 FuncInst * FuncNode::get_inst(ModelAction *act)
  83 {
  84         ASSERT(act);
  85         const char * position = act->get_position();
  86
  87         /* THREAD* actions, ATOMIC_LOCK, ATOMIC_TRYLOCK, and ATOMIC_UNLOCK
  88          * actions are not tagged with their source line numbers
  89          */
  90         if (position == NULL)
  91                 return NULL;
  92
  93         FuncInst * inst = func_inst_map.get(position);
  94         if (inst == NULL)
  95                 return NULL;
  96
  97         action_type inst_type = inst->get_type();
  98         action_type act_type = act->get_type();
  99
 100         // else if branch: an RMWRCAS action is converted to a RMW or READ action
 101         if (inst_type == act_type)
 102                 return inst;
 103         else if (inst_type == ATOMIC_RMWRCAS &&
 104                         (act_type == ATOMIC_RMW || act_type == ATOMIC_READ))
 105                 return inst;
 106
 107         return NULL;
 108 }
 109
 110
 111 void FuncNode::add_entry_inst(FuncInst * inst)
 112 {
 113         if (inst == NULL)
 114                 return;
 115
 116         mllnode<FuncInst *> * it;
 117         for (it = entry_insts.begin(); it != NULL; it = it->getNext()) {
 118                 if (inst == it->getVal())
 119                         return;
 120         }
 121
 122         entry_insts.push_back(inst);
 123 }
 124
 125 /**
 126  * @brief Convert ModelAdtion list to FuncInst list
 127  * @param act_list A list of ModelActions
 128  */
 129 void FuncNode::update_tree(action_list_t * act_list)
 130 {
 131         if (act_list == NULL || act_list->size() == 0)
 132                 return;
 133
 134         HashTable<void *, value_set_t *, uintptr_t, 4> * write_history = history->getWriteHistory();
 135
 136         /* build inst_list from act_list for later processing */
 137         func_inst_list_t inst_list;
 138         action_list_t read_act_list;
 139
 140         for (sllnode<ModelAction *> * it = act_list->begin(); it != NULL; it = it->getNext()) {
 141                 ModelAction * act = it->getVal();
 142                 FuncInst * func_inst = get_inst(act);
 143
 144                 if (func_inst == NULL)
 145                         continue;
 146
 147                 inst_list.push_back(func_inst);
 148
 149                 if (func_inst->is_read()) {
 150                         read_act_list.push_back(act);
 151
 152                         /* the first time an action reads from some location, import all the values that have
 153                          * been written to this location from ModelHistory and notify ModelHistory that this
 154                          * FuncNode may read from this location.
 155                          */
 156                         void * loc = act->get_location();
 157                         if (!read_locations->contains(loc)) {
 158                                 read_locations->add(loc);
 159                                 value_set_t * write_values = write_history->get(loc);
 160                                 add_to_val_loc_map(write_values, loc);
 161                                 history->add_to_loc_func_nodes_map(loc, this);
 162                         }
 163                 }
 164         }
 165
 166         model_print("function %s\n", func_name);
 167 //      print_val_loc_map();
 168
 169         update_inst_tree(&inst_list);
 170         update_predicate_tree(&read_act_list);
 171
 172         print_predicate_tree();
 173 }
 174
 175 /**
 176  * @brief Link FuncInsts in inst_list  - add one FuncInst to another's predecessors and successors
 177  * @param inst_list A list of FuncInsts
 178  */
 179 void FuncNode::update_inst_tree(func_inst_list_t * inst_list)
 180 {
 181         if (inst_list == NULL)
 182                 return;
 183         else if (inst_list->size() == 0)
 184                 return;
 185
 186         /* start linking */
 187         sllnode<FuncInst *>* it = inst_list->begin();
 188         sllnode<FuncInst *>* prev;
 189
 190         /* add the first instruction to the list of entry insts */
 191         FuncInst * entry_inst = it->getVal();
 192         add_entry_inst(entry_inst);
 193
 194         it = it->getNext();
 195         while (it != NULL) {
 196                 prev = it->getPrev();
 197
 198                 FuncInst * prev_inst = prev->getVal();
 199                 FuncInst * curr_inst = it->getVal();
 200
 201                 prev_inst->add_succ(curr_inst);
 202                 curr_inst->add_pred(prev_inst);
 203
 204                 it = it->getNext();
 205         }
 206 }
 207
 208 /* @param tid thread id
 209  * Store the values read by atomic read actions into thrd_read_map */
 210 void FuncNode::store_read(ModelAction * act, uint32_t tid)
 211 {
 212 /*
 213         ASSERT(act);
 214
 215         void * location = act->get_location();
 216         uint64_t read_from_val = act->get_reads_from_value();
 217
 218         // resize and initialize
 219         uint32_t old_size = thrd_read_map.size();
 220         if (old_size <= tid) {
 221                 thrd_read_map.resize(tid + 1);
 222                 for (uint32_t i = old_size; i < tid + 1;i++)
 223                         thrd_read_map[i] = new read_map_t();
 224         }
 225
 226         read_map_t * read_map = thrd_read_map[tid];
 227         read_map->put(location, read_from_val);
 228 */
 229 }
 230
 231 uint64_t FuncNode::query_last_read(void * location, uint32_t tid)
 232 {
 233 /*
 234         if (thrd_read_map.size() <= tid)
 235                 return VALUE_NONE;
 236
 237         read_map_t * read_map = thrd_read_map[tid];
 238
 239         // last read value not found
 240         if ( !read_map->contains(location) )
 241                 return VALUE_NONE;
 242
 243         uint64_t read_val = read_map->get(location);
 244         return read_val;
 245 */
 246 }
 247
 248 /* @param tid thread id
 249  * Reset read map for a thread. This function shall only be called
 250  * when a thread exits a function
 251  */
 252 void FuncNode::clear_read_map(uint32_t tid)
 253 {
 254 /*
 255         if (thrd_read_map.size() <= tid)
 256                 return;
 257
 258         thrd_read_map[tid]->reset();
 259 */
 260 }
 261
 262 void FuncNode::update_predicate_tree(action_list_t * act_list)
 263 {
 264         if (act_list == NULL || act_list->size() == 0)
 265                 return;
 266
 267         /* map a FuncInst to the its predicate */
 268         HashTable<FuncInst *, Predicate *, uintptr_t, 0> inst_pred_map(128);
 269
 270         // number FuncInsts to detect loops
 271         HashTable<FuncInst *, uint32_t, uintptr_t, 0> inst_id_map(128);
 272         uint32_t inst_counter = 0;
 273
 274         HashTable<void *, ModelAction *, uintptr_t, 0> loc_act_map(128);
 275         HashTable<FuncInst *, ModelAction *, uintptr_t, 0> inst_act_map(128);
 276
 277         sllnode<ModelAction *> *it = act_list->begin();
 278         Predicate * curr_pred = predicate_tree_entry;
 279         while (it != NULL) {
 280                 ModelAction * next_act = it->getVal();
 281                 FuncInst * next_inst = get_inst(next_act);
 282                 SnapVector<Predicate *> * unset_predicates = new SnapVector<Predicate *>();
 283
 284                 bool branch_found = follow_branch(&curr_pred, next_inst, next_act, &inst_act_map, unset_predicates);
 285
 286                 // no predicate expressions, follow the only branch
 287                 if (!branch_found && unset_predicates->size() != 0) {
 288                         ASSERT(unset_predicates->size() == 1);
 289                         Predicate * one_branch = (*unset_predicates)[0];
 290                         curr_pred = one_branch;
 291                         branch_found = true;
 292                 }
 293
 294                 delete unset_predicates;
 295
 296                 // detect loops
 297                 if (!branch_found && inst_id_map.contains(next_inst)) {
 298                         FuncInst * curr_inst = curr_pred->get_func_inst();
 299                         uint32_t curr_id = inst_id_map.get(curr_inst);
 300                         uint32_t next_id = inst_id_map.get(next_inst);
 301
 302                         if (curr_id >= next_id) {
 303                                 Predicate * old_pred = inst_pred_map.get(next_inst);
 304                                 Predicate * back_pred = old_pred->get_parent();
 305
 306                                 curr_pred->add_backedge(back_pred);
 307                                 curr_pred = back_pred;
 308
 309                                 continue;
 310                         }
 311                 }
 312
 313                 // generate new branches
 314                 if (!branch_found) {
 315                         SnapVector<struct half_pred_expr *> half_pred_expressions;
 316                         void * loc = next_act->get_location();
 317
 318                         if ( loc_act_map.contains(loc) ) {
 319                                 ModelAction * last_act = loc_act_map.get(loc);
 320                                 FuncInst * last_inst = get_inst(last_act);
 321                                 struct half_pred_expr * expression = new half_pred_expr(EQUALITY, last_inst);
 322                                 half_pred_expressions.push_back(expression);
 323                         } else if ( next_inst->is_single_location() ){
 324                                 loc_set_t * loc_may_equal = loc_may_equal_map->get(loc);
 325
 326                                 if (loc_may_equal != NULL) {
 327                                         loc_set_iter * loc_it = loc_may_equal->iterator();
 328                                         while (loc_it->hasNext()) {
 329                                                 void * neighbor = loc_it->next();
 330                                                 if (loc_act_map.contains(neighbor)) {
 331                                                         ModelAction * last_act = loc_act_map.get(neighbor);
 332                                                         FuncInst * last_inst = get_inst(last_act);
 333                                                         struct half_pred_expr * expression = new half_pred_expr(EQUALITY, last_inst);
 334                                                         half_pred_expressions.push_back(expression);
 335                                                 }
 336                                         }
 337                                 }
 338                         } else {
 339                                 // next_inst is not single location
 340                                 struct half_pred_expr * expression = new half_pred_expr(NULLITY, NULL);
 341                                 half_pred_expressions.push_back(expression);
 342                         }
 343
 344                         if (half_pred_expressions.size() == 0) {
 345                                 // no predicate needs to be generated
 346                                 Predicate * new_pred = new Predicate(next_inst);
 347                                 curr_pred->add_child(new_pred);
 348                                 new_pred->set_parent(curr_pred);
 349
 350                                 if (curr_pred->is_entry_predicate())
 351                                         new_pred->add_predicate_expr(NOPREDICATE, NULL, true);
 352
 353                                 curr_pred = new_pred;
 354                         } else {
 355                                 generate_predicate(&curr_pred, next_inst, &half_pred_expressions);
 356                                 bool branch_found = follow_branch(&curr_pred, next_inst, next_act, &inst_act_map, NULL);
 357                                 ASSERT(branch_found);
 358                         }
 359                 }
 360
 361                 inst_pred_map.put(next_inst, curr_pred);
 362                 if (!inst_id_map.contains(next_inst))
 363                         inst_id_map.put(next_inst, inst_counter++);
 364
 365                 loc_act_map.put(next_act->get_location(), next_act);
 366                 inst_act_map.put(next_inst, next_act);
 367                 it = it->getNext();
 368         }
 369 }
 370
 371 /* Given curr_pred and next_inst, find the branch following curr_pred that
 372  * contains next_inst and the correct predicate.
 373  * @return true if branch found, false otherwise.
 374  */
 375 bool FuncNode::follow_branch(Predicate ** curr_pred, FuncInst * next_inst, ModelAction * next_act,
 376         HashTable<FuncInst *, ModelAction *, uintptr_t, 0> * inst_act_map,
 377         SnapVector<Predicate *> * unset_predicates)
 378 {
 379         /* check if a branch with func_inst and corresponding predicate exists */
 380         bool branch_found = false;
 381         ModelVector<Predicate *> * branches = (*curr_pred)->get_children();
 382         for (uint i = 0; i < branches->size(); i++) {
 383                 Predicate * branch = (*branches)[i];
 384                 if (branch->get_func_inst() != next_inst)
 385                         continue;
 386
 387                 /* check against predicate expressions */
 388                 bool predicate_correct = true;
 389                 PredExprSet * pred_expressions = branch->get_pred_expressions();
 390                 PredExprSetIter * pred_expr_it = pred_expressions->iterator();
 391
 392                 if (pred_expressions->getSize() == 0) {
 393                         predicate_correct = false;
 394                         unset_predicates->push_back(branch);
 395                 }
 396
 397                 while (pred_expr_it->hasNext()) {
 398                         pred_expr * pred_expression = pred_expr_it->next();
 399                         uint64_t last_read, next_read;
 400                         bool equality;
 401
 402                         switch(pred_expression->token) {
 403                                 case NOPREDICATE:
 404                                         predicate_correct = true;
 405                                         break;
 406                                 case EQUALITY:
 407                                         FuncInst * to_be_compared;
 408                                         ModelAction * last_act;
 409
 410                                         to_be_compared = pred_expression->func_inst;
 411                                         last_act = inst_act_map->get(to_be_compared);
 412
 413                                         last_read = last_act->get_reads_from_value();
 414                                         next_read = next_act->get_reads_from_value();
 415                                         equality = (last_read == next_read);
 416                                         if (equality != pred_expression->value)
 417                                                 predicate_correct = false;
 418
 419                                         break;
 420                                 case NULLITY:
 421                                         next_read = next_act->get_reads_from_value();
 422                                         equality = ((void*)next_read == NULL);
 423                                         if (equality != pred_expression->value)
 424                                                 predicate_correct = false;
 425                                         break;
 426                                 default:
 427                                         predicate_correct = false;
 428                                         model_print("unkown predicate token\n");
 429                                         break;
 430                         }
 431                 }
 432
 433                 if (predicate_correct) {
 434                         *curr_pred = branch;
 435                         branch_found = true;
 436                         break;
 437                 }
 438         }
 439
 440         return branch_found;
 441 }
 442
 443 /* Able to generate complex predicates when there are multiple predciate expressions */
 444 void FuncNode::generate_predicate(Predicate ** curr_pred, FuncInst * next_inst,
 445         SnapVector<struct half_pred_expr *> * half_pred_expressions)
 446 {
 447         ASSERT(half_pred_expressions->size() != 0);
 448         SnapVector<Predicate *> predicates;
 449
 450         struct half_pred_expr * half_expr = (*half_pred_expressions)[0];
 451         predicates.push_back(new Predicate(next_inst));
 452         predicates.push_back(new Predicate(next_inst));
 453
 454         predicates[0]->add_predicate_expr(half_expr->token, half_expr->func_inst, true);
 455         predicates[1]->add_predicate_expr(half_expr->token, half_expr->func_inst, false);
 456
 457         for (uint i = 1; i < half_pred_expressions->size(); i++) {
 458                 half_expr = (*half_pred_expressions)[i];
 459
 460                 uint old_size = predicates.size();
 461                 for (uint j = 0; j < old_size; j++) {
 462                         Predicate * pred = predicates[j];
 463                         Predicate * new_pred = new Predicate(next_inst);
 464                         new_pred->copy_predicate_expr(pred);
 465
 466                         pred->add_predicate_expr(half_expr->token, half_expr->func_inst, true);
 467                         new_pred->add_predicate_expr(half_expr->token, half_expr->func_inst, false);
 468
 469                         predicates.push_back(new_pred);
 470                 }
 471         }
 472
 473         for (uint i = 0; i < predicates.size(); i++) {
 474                 Predicate * pred= predicates[i];
 475                 (*curr_pred)->add_child(pred);
 476                 pred->set_parent(*curr_pred);
 477         }
 478 }
 479
 480
 481 void FuncNode::add_to_val_loc_map(uint64_t val, void * loc)
 482 {
 483         loc_set_t * locations = val_loc_map->get(val);
 484
 485         if (locations == NULL) {
 486                 locations = new loc_set_t();
 487                 val_loc_map->put(val, locations);
 488         }
 489
 490         update_loc_may_equal_map(loc, locations);
 491         locations->add(loc);
 492         values_may_read_from->add(val);
 493 }
 494
 495 void FuncNode::add_to_val_loc_map(value_set_t * values, void * loc)
 496 {
 497         value_set_iter * it = values->iterator();
 498         while (it->hasNext()) {
 499                 uint64_t val = it->next();
 500                 add_to_val_loc_map(val, loc);
 501         }
 502 }
 503
 504 void FuncNode::update_loc_may_equal_map(void * new_loc, loc_set_t * old_locations)
 505 {
 506         loc_set_t * neighbors = loc_may_equal_map->get(new_loc);
 507
 508         if (neighbors == NULL) {
 509                 neighbors = new loc_set_t();
 510                 loc_may_equal_map->put(new_loc, neighbors);
 511         }
 512
 513         loc_set_iter * loc_it = old_locations->iterator();
 514         while (loc_it->hasNext()) {
 515                 // new_loc: { old_locations, ... }
 516                 void * member = loc_it->next();
 517                 neighbors->add(member);
 518
 519                 // for each i in old_locations, i : { new_loc, ... }
 520                 loc_set_t * _neighbors = loc_may_equal_map->get(member);
 521                 if (_neighbors == NULL) {
 522                         _neighbors = new loc_set_t();
 523                         loc_may_equal_map->put(member, _neighbors);
 524                 }
 525                 _neighbors->add(new_loc);
 526         }
 527 }
 528
 529 void FuncNode::print_predicate_tree()
 530 {
 531         model_print("digraph function_%s {\n", func_name);
 532         predicate_tree_entry->print_pred_subtree();
 533         model_print("}\n");     // end of graph
 534 }
 535
 536 void FuncNode::print_val_loc_map()
 537 {
 538         value_set_iter * val_it = values_may_read_from->iterator();
 539         while (val_it->hasNext()) {
 540                 uint64_t value = val_it->next();
 541                 model_print("val %llx: ", value);
 542
 543                 loc_set_t * locations = val_loc_map->get(value);
 544                 loc_set_iter * loc_it = locations->iterator();
 545                 while (loc_it->hasNext()) {
 546                         void * location = loc_it->next();
 547                         model_print("%p ", location);
 548                 }
 549                 model_print("\n");
 550         }
 551 }
 552
 553 /* @param tid thread id
 554  * Print the values read by the last read actions for each memory location
 555  */
 556 /*
 557 void FuncNode::print_last_read(uint32_t tid)
 558 {
 559         ASSERT(thrd_read_map.size() > tid);
 560         read_map_t * read_map = thrd_read_map[tid];
 561
 562         mllnode<void *> * it;
 563         for (it = read_locations.begin();it != NULL;it=it->getNext()) {
 564                 if ( !read_map->contains(it->getVal()) )
 565                         break;
 566
 567                 uint64_t read_val = read_map->get(it->getVal());
 568                 model_print("last read of thread %d at %p: 0x%x\n", tid, it->getVal(), read_val);
 569         }
 570 }
 571 */