test/compiler/intrinsics/mathexact/SplitThruPhiTest.java

Tue, 12 Nov 2013 13:47:57 +0100

author
rbackman
date
Tue, 12 Nov 2013 13:47:57 +0100
changeset 6101
f675976a61e7
parent 0
f90c822e73f8
child 6152
9949533a8623
permissions
-rw-r--r--

8028198: SIGSEGV in PhaseIdealLoop::build_loop_late_post
Reviewed-by: iveresov, kvn

aoqi@0 1 /*
aoqi@0 2 * Copyright (c) 2013, Oracle and/or its affiliates. All rights reserved.
aoqi@0 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
aoqi@0 4 *
aoqi@0 5 * This code is free software; you can redistribute it and/or modify it
aoqi@0 6 * under the terms of the GNU General Public License version 2 only, as
aoqi@0 7 * published by the Free Software Foundation.
aoqi@0 8 *
aoqi@0 9 * This code is distributed in the hope that it will be useful, but WITHOUT
aoqi@0 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
aoqi@0 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
aoqi@0 12 * version 2 for more details (a copy is included in the LICENSE file that
aoqi@0 13 * accompanied this code).
aoqi@0 14 *
aoqi@0 15 * You should have received a copy of the GNU General Public License version
aoqi@0 16 * 2 along with this work; if not, write to the Free Software Foundation,
aoqi@0 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
aoqi@0 18 *
aoqi@0 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
aoqi@0 20 * or visit www.oracle.com if you need additional information or have any
aoqi@0 21 * questions.
aoqi@0 22 */
aoqi@0 23
aoqi@0 24 /*
aoqi@0 25 * @test
aoqi@0 26 * @bug 8028198
aoqi@0 27 * @summary Verify that split through phi does the right thing
aoqi@0 28 * @compile SplitThruPhiTest.java
aoqi@0 29 * @run main SplitThruPhiTest
aoqi@0 30 *
aoqi@0 31 */
aoqi@0 32
aoqi@0 33 public class SplitThruPhiTest {
aoqi@0 34 public static volatile int value = 19;
aoqi@0 35 public static int store = 0;
aoqi@0 36 public static void main(String[] args) {
aoqi@0 37 for (int i = 0; i < 150000; ++i) {
aoqi@0 38 store = runTest(value);
aoqi@0 39 }
aoqi@0 40 }
aoqi@0 41
aoqi@0 42 public static int runTest(int val) {
aoqi@0 43 int result = Math.addExact(val, 1);
aoqi@0 44 int total = 0;
aoqi@0 45 for (int i = val; i < 200; i = Math.addExact(i, 1)) {
aoqi@0 46 total += i;
aoqi@0 47 }
aoqi@0 48 return total;
aoqi@0 49 }
aoqi@0 50 }

mercurial