1 /*
   2  * Copyright (c) 1997, 2017, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #include "precompiled.hpp"
  26 #include "interpreter/oopMapCache.hpp"
  27 #include "logging/log.hpp"
  28 #include "logging/logStream.hpp"
  29 #include "memory/allocation.inline.hpp"
  30 #include "memory/resourceArea.hpp"
  31 #include "oops/oop.inline.hpp"
  32 #include "runtime/handles.inline.hpp"
  33 #include "runtime/signature.hpp"
  34 
  35 class OopMapCacheEntry: private InterpreterOopMap {
  36   friend class InterpreterOopMap;
  37   friend class OopMapForCacheEntry;
  38   friend class OopMapCache;
  39   friend class VerifyClosure;
  40 
  41  private:
  42   OopMapCacheEntry* _next;
  43 
  44  protected:
  45   // Initialization
  46   void fill(const methodHandle& method, int bci);
  47   // fills the bit mask for native calls
  48   void fill_for_native(const methodHandle& method);
  49   void set_mask(CellTypeState* vars, CellTypeState* stack, int stack_top);
  50 
  51   // Deallocate bit masks and initialize fields
  52   void flush();
  53 
  54  private:
  55   void allocate_bit_mask();   // allocates the bit mask on C heap f necessary
  56   void deallocate_bit_mask(); // allocates the bit mask on C heap f necessary
  57   bool verify_mask(CellTypeState *vars, CellTypeState *stack, int max_locals, int stack_top);
  58 
  59  public:
  60   OopMapCacheEntry() : InterpreterOopMap() {
  61     _next = NULL;
  62 #ifdef ASSERT
  63     _resource_allocate_bit_mask = false;
  64 #endif
  65   }
  66 };
  67 
  68 
  69 // Implementation of OopMapForCacheEntry
  70 // (subclass of GenerateOopMap, initializes an OopMapCacheEntry for a given method and bci)
  71 
  72 class OopMapForCacheEntry: public GenerateOopMap {
  73   OopMapCacheEntry *_entry;
  74   int               _bci;
  75   int               _stack_top;
  76 
  77   virtual bool report_results() const     { return false; }
  78   virtual bool possible_gc_point          (BytecodeStream *bcs);
  79   virtual void fill_stackmap_prolog       (int nof_gc_points);
  80   virtual void fill_stackmap_epilog       ();
  81   virtual void fill_stackmap_for_opcodes  (BytecodeStream *bcs,
  82                                            CellTypeState* vars,
  83                                            CellTypeState* stack,
  84                                            int stack_top);
  85   virtual void fill_init_vars             (GrowableArray<intptr_t> *init_vars);
  86 
  87  public:
  88   OopMapForCacheEntry(const methodHandle& method, int bci, OopMapCacheEntry *entry);
  89 
  90   // Computes stack map for (method,bci) and initialize entry
  91   void compute_map(TRAPS);
  92   int  size();
  93 };
  94 
  95 
  96 OopMapForCacheEntry::OopMapForCacheEntry(const methodHandle& method, int bci, OopMapCacheEntry* entry) : GenerateOopMap(method) {
  97   _bci       = bci;
  98   _entry     = entry;
  99   _stack_top = -1;
 100 }
 101 
 102 
 103 void OopMapForCacheEntry::compute_map(TRAPS) {
 104   assert(!method()->is_native(), "cannot compute oop map for native methods");
 105   // First check if it is a method where the stackmap is always empty
 106   if (method()->code_size() == 0 || method()->max_locals() + method()->max_stack() == 0) {
 107     _entry->set_mask_size(0);
 108   } else {
 109     ResourceMark rm;
 110     GenerateOopMap::compute_map(CATCH);
 111     result_for_basicblock(_bci);
 112   }
 113 }
 114 
 115 
 116 bool OopMapForCacheEntry::possible_gc_point(BytecodeStream *bcs) {
 117   return false; // We are not reporting any result. We call result_for_basicblock directly
 118 }
 119 
 120 
 121 void OopMapForCacheEntry::fill_stackmap_prolog(int nof_gc_points) {
 122   // Do nothing
 123 }
 124 
 125 
 126 void OopMapForCacheEntry::fill_stackmap_epilog() {
 127   // Do nothing
 128 }
 129 
 130 
 131 void OopMapForCacheEntry::fill_init_vars(GrowableArray<intptr_t> *init_vars) {
 132   // Do nothing
 133 }
 134 
 135 
 136 void OopMapForCacheEntry::fill_stackmap_for_opcodes(BytecodeStream *bcs,
 137                                                     CellTypeState* vars,
 138                                                     CellTypeState* stack,
 139                                                     int stack_top) {
 140   // Only interested in one specific bci
 141   if (bcs->bci() == _bci) {
 142     _entry->set_mask(vars, stack, stack_top);
 143     _stack_top = stack_top;
 144   }
 145 }
 146 
 147 
 148 int OopMapForCacheEntry::size() {
 149   assert(_stack_top != -1, "compute_map must be called first");
 150   return ((method()->is_static()) ? 0 : 1) + method()->max_locals() + _stack_top;
 151 }
 152 
 153 
 154 // Implementation of InterpreterOopMap and OopMapCacheEntry
 155 
 156 class VerifyClosure : public OffsetClosure {
 157  private:
 158   OopMapCacheEntry* _entry;
 159   bool              _failed;
 160 
 161  public:
 162   VerifyClosure(OopMapCacheEntry* entry)         { _entry = entry; _failed = false; }
 163   void offset_do(int offset)                     { if (!_entry->is_oop(offset)) _failed = true; }
 164   bool failed() const                            { return _failed; }
 165 };
 166 
 167 InterpreterOopMap::InterpreterOopMap() {
 168   initialize();
 169 #ifdef ASSERT
 170   _resource_allocate_bit_mask = true;
 171 #endif
 172 }
 173 
 174 InterpreterOopMap::~InterpreterOopMap() {
 175   // The expection is that the bit mask was allocated
 176   // last in this resource area.  That would make the free of the
 177   // bit_mask effective (see how FREE_RESOURCE_ARRAY does a free).
 178   // If it was not allocated last, there is not a correctness problem
 179   // but the space for the bit_mask is not freed.
 180   assert(_resource_allocate_bit_mask, "Trying to free C heap space");
 181   if (mask_size() > small_mask_limit) {
 182     FREE_RESOURCE_ARRAY(uintptr_t, _bit_mask[0], mask_word_size());
 183   }
 184 }
 185 
 186 bool InterpreterOopMap::is_empty() const {
 187   bool result = _method == NULL;
 188   assert(_method != NULL || (_bci == 0 &&
 189     (_mask_size == 0 || _mask_size == USHRT_MAX) &&
 190     _bit_mask[0] == 0), "Should be completely empty");
 191   return result;
 192 }
 193 
 194 void InterpreterOopMap::initialize() {
 195   _method    = NULL;
 196   _mask_size = USHRT_MAX;  // This value should cause a failure quickly
 197   _bci       = 0;
 198   _expression_stack_size = 0;
 199   _num_oops  = 0;
 200   for (int i = 0; i < N; i++) _bit_mask[i] = 0;
 201 }
 202 
 203 void InterpreterOopMap::iterate_oop(OffsetClosure* oop_closure) const {
 204   int n = number_of_entries();
 205   int word_index = 0;
 206   uintptr_t value = 0;
 207   uintptr_t mask = 0;
 208   // iterate over entries
 209   for (int i = 0; i < n; i++, mask <<= bits_per_entry) {
 210     // get current word
 211     if (mask == 0) {
 212       value = bit_mask()[word_index++];
 213       mask = 1;
 214     }
 215     // test for oop
 216     if ((value & (mask << oop_bit_number)) != 0) oop_closure->offset_do(i);
 217   }
 218 }
 219 
 220 void InterpreterOopMap::print() const {
 221   int n = number_of_entries();
 222   tty->print("oop map for ");
 223   method()->print_value();
 224   tty->print(" @ %d = [%d] { ", bci(), n);
 225   for (int i = 0; i < n; i++) {
 226     if (is_dead(i)) tty->print("%d+ ", i);
 227     else
 228     if (is_oop(i)) tty->print("%d ", i);
 229   }
 230   tty->print_cr("}");
 231 }
 232 
 233 class MaskFillerForNative: public NativeSignatureIterator {
 234  private:
 235   uintptr_t * _mask;                             // the bit mask to be filled
 236   int         _size;                             // the mask size in bits
 237 
 238   void set_one(int i) {
 239     i *= InterpreterOopMap::bits_per_entry;
 240     assert(0 <= i && i < _size, "offset out of bounds");
 241     _mask[i / BitsPerWord] |= (((uintptr_t) 1 << InterpreterOopMap::oop_bit_number) << (i % BitsPerWord));
 242   }
 243 
 244  public:
 245   void pass_int()                                { /* ignore */ }
 246   void pass_long()                               { /* ignore */ }
 247   void pass_float()                              { /* ignore */ }
 248   void pass_double()                             { /* ignore */ }
 249   void pass_object()                             { set_one(offset()); }
 250 
 251   MaskFillerForNative(const methodHandle& method, uintptr_t* mask, int size) : NativeSignatureIterator(method) {
 252     _mask   = mask;
 253     _size   = size;
 254     // initialize with 0
 255     int i = (size + BitsPerWord - 1) / BitsPerWord;
 256     while (i-- > 0) _mask[i] = 0;
 257   }
 258 
 259   void generate() {
 260     NativeSignatureIterator::iterate();
 261   }
 262 };
 263 
 264 bool OopMapCacheEntry::verify_mask(CellTypeState* vars, CellTypeState* stack, int max_locals, int stack_top) {
 265   // Check mask includes map
 266   VerifyClosure blk(this);
 267   iterate_oop(&blk);
 268   if (blk.failed()) return false;
 269 
 270   // Check if map is generated correctly
 271   // (Use ?: operator to make sure all 'true' & 'false' are represented exactly the same so we can use == afterwards)
 272   Log(interpreter, oopmap) logv;
 273   LogStream st(logv.trace());
 274 
 275   st.print("Locals (%d): ", max_locals);
 276   for(int i = 0; i < max_locals; i++) {
 277     bool v1 = is_oop(i)               ? true : false;
 278     bool v2 = vars[i].is_reference()  ? true : false;
 279     assert(v1 == v2, "locals oop mask generation error");
 280     st.print("%d", v1 ? 1 : 0);
 281   }
 282   st.cr();
 283 
 284   st.print("Stack (%d): ", stack_top);
 285   for(int j = 0; j < stack_top; j++) {
 286     bool v1 = is_oop(max_locals + j)  ? true : false;
 287     bool v2 = stack[j].is_reference() ? true : false;
 288     assert(v1 == v2, "stack oop mask generation error");
 289     st.print("%d", v1 ? 1 : 0);
 290   }
 291   st.cr();
 292   return true;
 293 }
 294 
 295 void OopMapCacheEntry::allocate_bit_mask() {
 296   if (mask_size() > small_mask_limit) {
 297     assert(_bit_mask[0] == 0, "bit mask should be new or just flushed");
 298     _bit_mask[0] = (intptr_t)
 299       NEW_C_HEAP_ARRAY(uintptr_t, mask_word_size(), mtClass);
 300   }
 301 }
 302 
 303 void OopMapCacheEntry::deallocate_bit_mask() {
 304   if (mask_size() > small_mask_limit && _bit_mask[0] != 0) {
 305     assert(!Thread::current()->resource_area()->contains((void*)_bit_mask[0]),
 306       "This bit mask should not be in the resource area");
 307     FREE_C_HEAP_ARRAY(uintptr_t, _bit_mask[0]);
 308     debug_only(_bit_mask[0] = 0;)
 309   }
 310 }
 311 
 312 
 313 void OopMapCacheEntry::fill_for_native(const methodHandle& mh) {
 314   assert(mh->is_native(), "method must be native method");
 315   set_mask_size(mh->size_of_parameters() * bits_per_entry);
 316   allocate_bit_mask();
 317   // fill mask for parameters
 318   MaskFillerForNative mf(mh, bit_mask(), mask_size());
 319   mf.generate();
 320 }
 321 
 322 
 323 void OopMapCacheEntry::fill(const methodHandle& method, int bci) {
 324   HandleMark hm;
 325   // Flush entry to deallocate an existing entry
 326   flush();
 327   set_method(method());
 328   set_bci(bci);
 329   if (method->is_native()) {
 330     // Native method activations have oops only among the parameters and one
 331     // extra oop following the parameters (the mirror for static native methods).
 332     fill_for_native(method);
 333   } else {
 334     EXCEPTION_MARK;
 335     OopMapForCacheEntry gen(method, bci, this);
 336     gen.compute_map(CATCH);
 337   }
 338 }
 339 
 340 
 341 void OopMapCacheEntry::set_mask(CellTypeState *vars, CellTypeState *stack, int stack_top) {
 342   // compute bit mask size
 343   int max_locals = method()->max_locals();
 344   int n_entries = max_locals + stack_top;
 345   set_mask_size(n_entries * bits_per_entry);
 346   allocate_bit_mask();
 347   set_expression_stack_size(stack_top);
 348 
 349   // compute bits
 350   int word_index = 0;
 351   uintptr_t value = 0;
 352   uintptr_t mask = 1;
 353 
 354   _num_oops = 0;
 355   CellTypeState* cell = vars;
 356   for (int entry_index = 0; entry_index < n_entries; entry_index++, mask <<= bits_per_entry, cell++) {
 357     // store last word
 358     if (mask == 0) {
 359       bit_mask()[word_index++] = value;
 360       value = 0;
 361       mask = 1;
 362     }
 363 
 364     // switch to stack when done with locals
 365     if (entry_index == max_locals) {
 366       cell = stack;
 367     }
 368 
 369     // set oop bit
 370     if ( cell->is_reference()) {
 371       value |= (mask << oop_bit_number );
 372       _num_oops++;
 373     }
 374 
 375     // set dead bit
 376     if (!cell->is_live()) {
 377       value |= (mask << dead_bit_number);
 378       assert(!cell->is_reference(), "dead value marked as oop");
 379     }
 380   }
 381 
 382   // make sure last word is stored
 383   bit_mask()[word_index] = value;
 384 
 385   // verify bit mask
 386   assert(verify_mask(vars, stack, max_locals, stack_top), "mask could not be verified");
 387 }
 388 
 389 void OopMapCacheEntry::flush() {
 390   deallocate_bit_mask();
 391   initialize();
 392 }
 393 
 394 
 395 // Implementation of OopMapCache
 396 
 397 void InterpreterOopMap::resource_copy(OopMapCacheEntry* from) {
 398   assert(_resource_allocate_bit_mask,
 399     "Should not resource allocate the _bit_mask");
 400 
 401   set_method(from->method());
 402   set_bci(from->bci());
 403   set_mask_size(from->mask_size());
 404   set_expression_stack_size(from->expression_stack_size());
 405   _num_oops = from->num_oops();
 406 
 407   // Is the bit mask contained in the entry?
 408   if (from->mask_size() <= small_mask_limit) {
 409     memcpy((void *)_bit_mask, (void *)from->_bit_mask,
 410       mask_word_size() * BytesPerWord);
 411   } else {
 412     // The expectation is that this InterpreterOopMap is a recently created
 413     // and empty. It is used to get a copy of a cached entry.
 414     // If the bit mask has a value, it should be in the
 415     // resource area.
 416     assert(_bit_mask[0] == 0 ||
 417       Thread::current()->resource_area()->contains((void*)_bit_mask[0]),
 418       "The bit mask should have been allocated from a resource area");
 419     // Allocate the bit_mask from a Resource area for performance.  Allocating
 420     // from the C heap as is done for OopMapCache has a significant
 421     // performance impact.
 422     _bit_mask[0] = (uintptr_t) NEW_RESOURCE_ARRAY(uintptr_t, mask_word_size());
 423     assert(_bit_mask[0] != 0, "bit mask was not allocated");
 424     memcpy((void*) _bit_mask[0], (void*) from->_bit_mask[0],
 425       mask_word_size() * BytesPerWord);
 426   }
 427 }
 428 
 429 inline unsigned int OopMapCache::hash_value_for(const methodHandle& method, int bci) const {
 430   // We use method->code_size() rather than method->identity_hash() below since
 431   // the mark may not be present if a pointer to the method is already reversed.
 432   return   ((unsigned int) bci)
 433          ^ ((unsigned int) method->max_locals()         << 2)
 434          ^ ((unsigned int) method->code_size()          << 4)
 435          ^ ((unsigned int) method->size_of_parameters() << 6);
 436 }
 437 
 438 OopMapCacheEntry* volatile OopMapCache::_old_entries = NULL;
 439 
 440 OopMapCache::OopMapCache() {
 441   _array  = NEW_C_HEAP_ARRAY(OopMapCacheEntry*, _size, mtClass);
 442   for(int i = 0; i < _size; i++) _array[i] = NULL;
 443 }
 444 
 445 
 446 OopMapCache::~OopMapCache() {
 447   assert(_array != NULL, "sanity check");
 448   // Deallocate oop maps that are allocated out-of-line
 449   flush();
 450   // Deallocate array
 451   FREE_C_HEAP_ARRAY(OopMapCacheEntry*, _array);
 452 }
 453 
 454 OopMapCacheEntry* OopMapCache::entry_at(int i) const {
 455   return OrderAccess::load_acquire(&(_array[i % _size]));
 456 }
 457 
 458 bool OopMapCache::put_at(int i, OopMapCacheEntry* entry, OopMapCacheEntry* old) {
 459   return Atomic::cmpxchg(entry, &_array[i % _size], old) == old;
 460 }
 461 
 462 void OopMapCache::flush() {
 463   for (int i = 0; i < _size; i++) {
 464     OopMapCacheEntry* entry = _array[i];
 465     if (entry != NULL) {
 466       _array[i] = NULL;  // no barrier, only called in OopMapCache destructor
 467       entry->flush();
 468       FREE_C_HEAP_OBJ(entry);
 469     }
 470   }
 471 }
 472 
 473 void OopMapCache::flush_obsolete_entries() {
 474   assert(SafepointSynchronize::is_at_safepoint(), "called by RedefineClasses in a safepoint");
 475   for (int i = 0; i < _size; i++) {
 476     OopMapCacheEntry* entry = _array[i];
 477     if (entry != NULL && !entry->is_empty() && entry->method()->is_old()) {
 478       // Cache entry is occupied by an old redefined method and we don't want
 479       // to pin it down so flush the entry.
 480       if (log_is_enabled(Debug, redefine, class, oopmap)) {
 481         ResourceMark rm;
 482         log_debug(redefine, class, interpreter, oopmap)
 483           ("flush: %s(%s): cached entry @%d",
 484            entry->method()->name()->as_C_string(), entry->method()->signature()->as_C_string(), i);
 485       }
 486       _array[i] = NULL;
 487       entry->flush();
 488       FREE_C_HEAP_OBJ(entry);
 489     }
 490   }
 491 }
 492 
 493 // Called by GC for thread root scan during a safepoint only.  The other interpreted frame oopmaps
 494 // are generated locally and not cached.
 495 void OopMapCache::lookup(const methodHandle& method,
 496                          int bci,
 497                          InterpreterOopMap* entry_for) {
 498   assert(SafepointSynchronize::is_at_safepoint(), "called by GC in a safepoint");
 499   int probe = hash_value_for(method, bci);
 500   int i;
 501   OopMapCacheEntry* entry = NULL;
 502 
 503   if (log_is_enabled(Debug, interpreter, oopmap)) {
 504     static int count = 0;
 505     ResourceMark rm;
 506     log_debug(interpreter, oopmap)
 507           ("%d - Computing oopmap at bci %d for %s at hash %d", ++count, bci,
 508            method()->name_and_sig_as_C_string(), probe);
 509   }
 510 
 511   // Search hashtable for match
 512   for(i = 0; i < _probe_depth; i++) {
 513     entry = entry_at(probe + i);
 514     if (entry != NULL && !entry->is_empty() && entry->match(method, bci)) {
 515       entry_for->resource_copy(entry);
 516       assert(!entry_for->is_empty(), "A non-empty oop map should be returned");
 517       log_debug(interpreter, oopmap)("- found at hash %d", probe + i);
 518       return;
 519     }
 520   }
 521 
 522   // Entry is not in hashtable.
 523   // Compute entry
 524 
 525   OopMapCacheEntry* tmp = NEW_C_HEAP_OBJ(OopMapCacheEntry, mtClass);
 526   tmp->initialize();
 527   tmp->fill(method, bci);
 528   entry_for->resource_copy(tmp);
 529 
 530   if (method->should_not_be_cached()) {
 531     // It is either not safe or not a good idea to cache this Method*
 532     // at this time. We give the caller of lookup() a copy of the
 533     // interesting info via parameter entry_for, but we don't add it to
 534     // the cache. See the gory details in Method*.cpp.
 535     FREE_C_HEAP_OBJ(tmp);
 536     return;
 537   }
 538 
 539   // First search for an empty slot
 540   for(i = 0; i < _probe_depth; i++) {
 541     entry = entry_at(probe + i);
 542     if (entry == NULL) {
 543       if (put_at(probe + i, tmp, NULL)) {
 544         assert(!entry_for->is_empty(), "A non-empty oop map should be returned");
 545         return;
 546       }
 547     }
 548   }
 549 
 550   log_debug(interpreter, oopmap)("*** collision in oopmap cache - flushing item ***");
 551 
 552   // No empty slot (uncommon case). Use (some approximation of a) LRU algorithm
 553   // where the first entry in the collision array is replaced with the new one.
 554   OopMapCacheEntry* old = entry_at(probe + 0);
 555   if (put_at(probe + 0, tmp, old)) {
 556     enqueue_for_cleanup(old);
 557   } else {
 558     enqueue_for_cleanup(tmp);
 559   }
 560 
 561   assert(!entry_for->is_empty(), "A non-empty oop map should be returned");
 562   return;
 563 }
 564 
 565 void OopMapCache::enqueue_for_cleanup(OopMapCacheEntry* entry) {
 566   bool success = false;
 567   OopMapCacheEntry* head;
 568   do {
 569     head = _old_entries;
 570     entry->_next = head;
 571     success = Atomic::cmpxchg(entry, &_old_entries, head) == head;
 572   } while (!success);
 573 
 574   if (log_is_enabled(Debug, interpreter, oopmap)) {
 575     ResourceMark rm;
 576     log_debug(interpreter, oopmap)("enqueue %s at bci %d for cleanup",
 577                           entry->method()->name_and_sig_as_C_string(), entry->bci());
 578   }
 579 }
 580 
 581 // This is called after GC threads are done and nothing is accessing the old_entries
 582 // list, so no synchronization needed.
 583 void OopMapCache::cleanup_old_entries() {
 584   OopMapCacheEntry* entry = _old_entries;
 585   _old_entries = NULL;
 586   while (entry != NULL) {
 587     if (log_is_enabled(Debug, interpreter, oopmap)) {
 588       ResourceMark rm;
 589       log_debug(interpreter, oopmap)("cleanup entry %s at bci %d",
 590                           entry->method()->name_and_sig_as_C_string(), entry->bci());
 591     }
 592     OopMapCacheEntry* next = entry->_next;
 593     entry->flush();
 594     FREE_C_HEAP_OBJ(entry);
 595     entry = next;
 596   }
 597 }
 598 
 599 void OopMapCache::compute_one_oop_map(const methodHandle& method, int bci, InterpreterOopMap* entry) {
 600   // Due to the invariants above it's tricky to allocate a temporary OopMapCacheEntry on the stack
 601   OopMapCacheEntry* tmp = NEW_C_HEAP_ARRAY(OopMapCacheEntry, 1, mtClass);
 602   tmp->initialize();
 603   tmp->fill(method, bci);
 604   entry->resource_copy(tmp);
 605   FREE_C_HEAP_ARRAY(OopMapCacheEntry, tmp);
 606 }