src/hotspot/share/oops/klass.cpp

*** 52,10 ***
--- 52,11 ---
  #include "prims/jvmtiExport.hpp"
  #include "runtime/atomic.hpp"
  #include "runtime/handles.inline.hpp"
  #include "runtime/perfData.hpp"
  #include "utilities/macros.hpp"
+ #include "utilities/numberSeq.hpp"
  #include "utilities/powerOfTwo.hpp"
  #include "utilities/rotate_bits.hpp"
  #include "utilities/stack.inline.hpp"
  
  void Klass::set_java_mirror(Handle m) {

*** 1346,5 ***
--- 1347,18 ---
    super->print();
    sub->print();
    fatal("%s: %s implements %s: linear_search: %d; table_lookup: %d",
          msg, sub->external_name(), super->external_name(), linear_result, table_result);
  }
+ 
+ static int expanded = 0;
+ static int not_expanded = 0;
+ static NumberSeq seq = NumberSeq();
+ 
+ bool Klass::expand_for_hash(oop obj, markWord m) const {
+   assert(UseCompactObjectHeaders, "only with compact i-hash");
+   {
+     ResourceMark rm;
+     assert((size_t)hash_offset_in_bytes(obj,m ) <= (obj->base_size_given_klass(m, this) * HeapWordSize), "hash offset must be eq or lt base size: hash offset: %d, base size: %zu, class-name: %s", hash_offset_in_bytes(obj, m), obj->base_size_given_klass(m, this) * HeapWordSize, external_name());
+   }
+   return obj->base_size_given_klass(m, this) * HeapWordSize - hash_offset_in_bytes(obj, m) < (int)sizeof(uint32_t);
+ }