src/share/vm/oops/typeArrayKlass.cpp

*** 74,92 ****
    complete_create_array_klass(k, super, CHECK_NULL);
  
    return k();
  }
  
! typeArrayOop typeArrayKlass::allocate(int length, TRAPS) {
    assert(log2_element_size() >= 0, "bad scale");
    if (length >= 0) {
      if (length <= max_length()) {
        size_t size = typeArrayOopDesc::object_size(layout_helper(), length);
        KlassHandle h_k(THREAD, as_klassOop());
        typeArrayOop t;
        CollectedHeap* ch = Universe::heap();
        t = (typeArrayOop)CollectedHeap::array_allocate(h_k, (int)size, length, CHECK_NULL);
        assert(t->is_parsable(), "Don't publish unless parsable");
        return t;
      } else {
        report_java_out_of_memory("Requested array size exceeds VM limit");
        THROW_OOP_0(Universe::out_of_memory_error_array_size());
--- 74,96 ----
    complete_create_array_klass(k, super, CHECK_NULL);
  
    return k();
  }
  
! typeArrayOop typeArrayKlass::allocate_common(int length, bool nozero, TRAPS) {
    assert(log2_element_size() >= 0, "bad scale");
    if (length >= 0) {
      if (length <= max_length()) {
        size_t size = typeArrayOopDesc::object_size(layout_helper(), length);
        KlassHandle h_k(THREAD, as_klassOop());
        typeArrayOop t;
        CollectedHeap* ch = Universe::heap();
+       if (nozero) {
+         t = (typeArrayOop)CollectedHeap::array_allocate_nozero(h_k, (int)size, length, CHECK_NULL);
+       } else {
          t = (typeArrayOop)CollectedHeap::array_allocate(h_k, (int)size, length, CHECK_NULL);
+       }
        assert(t->is_parsable(), "Don't publish unless parsable");
        return t;
      } else {
        report_java_out_of_memory("Requested array size exceeds VM limit");
        THROW_OOP_0(Universe::out_of_memory_error_array_size());