# HG changeset patch # User roland # Date 1411031772 0 # Node ID 22d49f390e767925c4ee5b3e1004480f983a6b56 # Parent ed8ab32a293de8c49e69db4f276bfc437158e848# Parent 1b8204b516f5d5255828d2b74bd709c8ca8055f3 Merge diff -r ed8ab32a293d -r 22d49f390e76 hotspot/test/compiler/intrinsics/multiplytolen/TestMultiplyToLenReturnProfile.java --- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/hotspot/test/compiler/intrinsics/multiplytolen/TestMultiplyToLenReturnProfile.java Thu Sep 18 09:16:12 2014 +0000 @@ -0,0 +1,52 @@ +/* + * Copyright (c) 2014, 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. + * + */ + +/** + * @test + * @bug 8057758 + * @summary MultiplyToLen sets its return type to have a bottom offset which confuses code generation + * @run main/othervm -XX:-TieredCompilation -XX:-BackgroundCompilation -XX:-UseOnStackReplacement -XX:TypeProfileLevel=222 TestMultiplyToLenReturnProfile + * + */ + + +import java.math.*; + +public class TestMultiplyToLenReturnProfile { + + static BigInteger m(BigInteger i1, BigInteger i2) { + BigInteger res = BigInteger.valueOf(0); + for (int i = 0; i < 100; i++) { + res.add(i1.multiply(i2)); + } + return res; + } + + static public void main(String[] args) { + BigInteger v = BigInteger.valueOf(Integer.MAX_VALUE).pow(2); + for (int i = 0; i < 20000; i++) { + m(v, v.add(BigInteger.valueOf(1))); + } + } +}