diff src/share/vm/gc_interface/collectedHeap.cpp @ 14909:4ca6dc0799b6

Backout jdk9 merge
author Gilles Duboscq <duboscq@ssw.jku.at>
date Tue, 01 Apr 2014 13:57:07 +0200
parents d8041d695d19
children a29e6e7b7a86
line wrap: on
line diff
--- a/src/share/vm/gc_interface/collectedHeap.cpp	Tue Apr 01 14:09:03 2014 +0200
+++ b/src/share/vm/gc_interface/collectedHeap.cpp	Tue Apr 01 13:57:07 2014 +0200
@@ -323,21 +323,6 @@
   assert(thread->deferred_card_mark().is_empty(), "invariant");
 }
 
-size_t CollectedHeap::max_tlab_size() const {
-  // TLABs can't be bigger than we can fill with a int[Integer.MAX_VALUE].
-  // This restriction could be removed by enabling filling with multiple arrays.
-  // If we compute that the reasonable way as
-  //    header_size + ((sizeof(jint) * max_jint) / HeapWordSize)
-  // we'll overflow on the multiply, so we do the divide first.
-  // We actually lose a little by dividing first,
-  // but that just makes the TLAB  somewhat smaller than the biggest array,
-  // which is fine, since we'll be able to fill that.
-  size_t max_int_size = typeArrayOopDesc::header_size(T_INT) +
-              sizeof(jint) *
-              ((juint) max_jint / (size_t) HeapWordSize);
-  return align_size_down(max_int_size, MinObjAlignment);
-}
-
 // Helper for ReduceInitialCardMarks. For performance,
 // compiled code may elide card-marks for initializing stores
 // to a newly allocated object along the fast-path. We