OpenJDK / bsd-port / jdk9 / hotspot
changeset 8651:3393f1245e55
Merge
author | tschatzl |
---|---|
date | Thu, 25 Jun 2015 15:43:16 +0000 |
parents | 2f8eba9d2f69 825306677064 |
children | b8fe5e3e7eda |
files | |
diffstat | 3 files changed, 28 insertions(+), 30 deletions(-) [+] |
line wrap: on
line diff
--- a/src/share/vm/gc/shared/collectedHeap.cpp Thu Jun 25 13:23:36 2015 +0000 +++ b/src/share/vm/gc/shared/collectedHeap.cpp Thu Jun 25 15:43:16 2015 +0000 @@ -488,19 +488,17 @@ DEBUG_ONLY(fill_args_check(start, words);) HandleMark hm; // Free handles before leaving. -#ifdef _LP64 - // A single array can fill ~8G, so multiple objects are needed only in 64-bit. - // First fill with arrays, ensuring that any remaining space is big enough to - // fill. The remainder is filled with a single object. + // Multiple objects may be required depending on the filler array maximum size. Fill + // the range up to that with objects that are filler_array_max_size sized. The + // remainder is filled with a single object. const size_t min = min_fill_size(); const size_t max = filler_array_max_size(); while (words > max) { - const size_t cur = words - max >= min ? max : max - min; + const size_t cur = (words - max) >= min ? max : max - min; fill_with_array(start, cur, zap); start += cur; words -= cur; } -#endif fill_with_object_impl(start, words, zap); }
--- a/test/testlibrary/ctw/Makefile Thu Jun 25 13:23:36 2015 +0000 +++ b/test/testlibrary/ctw/Makefile Thu Jun 25 15:43:16 2015 +0000 @@ -8,7 +8,7 @@ # # This code is distributed in the hope that it will be useful, but WITHOUT # ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or -# FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License +# FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License # version 2 for more details (a copy is included in the LICENSE file that # accompanied this code). #
--- a/test/testlibrary/ctw/README Thu Jun 25 13:23:36 2015 +0000 +++ b/test/testlibrary/ctw/README Thu Jun 25 15:43:16 2015 +0000 @@ -1,26 +1,26 @@ -# -# Copyright (c) 2013, Oracle and/or its affiliates. All rights reserved. -# DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. -# -# This code is free software; you can redistribute it and/or modify it -# under the terms of the GNU General Public License version 2 only, as -# published by the Free Software Foundation. -# -# This code is distributed in the hope that it will be useful, but WITHOUT -# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or -# FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -# version 2 for more details (a copy is included in the LICENSE file that -# accompanied this code). -# -# You should have received a copy of the GNU General Public License version -# 2 along with this work; if not, write to the Free Software Foundation, -# Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. -# -# Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA -# or visit www.oracle.com if you need additional information or have any -# questions. -# -# + +Copyright (c) 2013, Oracle and/or its affiliates. All rights reserved. +DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. + +This code is free software; you can redistribute it and/or modify it +under the terms of the GNU General Public License version 2 only, as +published by the Free Software Foundation. + +This code is distributed in the hope that it will be useful, but WITHOUT +ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or +FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License +version 2 for more details (a copy is included in the LICENSE file that +accompanied this code). + +You should have received a copy of the GNU General Public License version +2 along with this work; if not, write to the Free Software Foundation, +Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. + +Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA +or visit www.oracle.com if you need additional information or have any +questions. + + DESCRIPTION