26801
|
1 |
/*
|
|
2 |
* Copyright (c) 2014, Oracle and/or its affiliates. All rights reserved.
|
|
3 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
4 |
*
|
|
5 |
* This code is free software; you can redistribute it and/or modify it
|
|
6 |
* under the terms of the GNU General Public License version 2 only, as
|
|
7 |
* published by the Free Software Foundation.
|
|
8 |
*
|
|
9 |
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
10 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
11 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
12 |
* version 2 for more details (a copy is included in the LICENSE file that
|
|
13 |
* accompanied this code).
|
|
14 |
*
|
|
15 |
* You should have received a copy of the GNU General Public License version
|
|
16 |
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
17 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
18 |
*
|
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
20 |
* or visit www.oracle.com if you need additional information or have any
|
|
21 |
* questions.
|
|
22 |
*
|
|
23 |
*/
|
|
24 |
|
|
25 |
/**
|
|
26 |
* @test
|
|
27 |
* @bug 8057758
|
|
28 |
* @summary MultiplyToLen sets its return type to have a bottom offset which confuses code generation
|
|
29 |
* @run main/othervm -XX:-TieredCompilation -XX:-BackgroundCompilation -XX:-UseOnStackReplacement -XX:TypeProfileLevel=222 TestMultiplyToLenReturnProfile
|
|
30 |
*
|
|
31 |
*/
|
|
32 |
|
|
33 |
|
|
34 |
import java.math.*;
|
|
35 |
|
|
36 |
public class TestMultiplyToLenReturnProfile {
|
|
37 |
|
|
38 |
static BigInteger m(BigInteger i1, BigInteger i2) {
|
|
39 |
BigInteger res = BigInteger.valueOf(0);
|
|
40 |
for (int i = 0; i < 100; i++) {
|
|
41 |
res.add(i1.multiply(i2));
|
|
42 |
}
|
|
43 |
return res;
|
|
44 |
}
|
|
45 |
|
|
46 |
static public void main(String[] args) {
|
|
47 |
BigInteger v = BigInteger.valueOf(Integer.MAX_VALUE).pow(2);
|
|
48 |
for (int i = 0; i < 20000; i++) {
|
|
49 |
m(v, v.add(BigInteger.valueOf(1)));
|
|
50 |
}
|
|
51 |
}
|
|
52 |
}
|