funcnode.cc

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