Mercurial > jdk8-mips64-public > hotspot / changeset

     1.1 --- a/src/share/vm/opto/loopopts.cpp	Tue Nov 12 13:58:37 2013 +0100
     1.2 +++ b/src/share/vm/opto/loopopts.cpp	Tue Nov 12 13:47:57 2013 +0100
     1.3 @@ -42,6 +42,13 @@
     1.4      // so disable this for now
     1.5      return NULL;
     1.6    }
     1.7 +
     1.8 +  if (n->is_MathExact()) {
     1.9 +    // MathExact has projections that are not correctly handled in the code
    1.10 +    // below.
    1.11 +    return NULL;
    1.12 +  }
    1.13 +
    1.14    int wins = 0;
    1.15    assert(!n->is_CFG(), "");
    1.16    assert(region->is_Region(), "");

     2.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     2.2 +++ b/test/compiler/intrinsics/mathexact/SplitThruPhiTest.java	Tue Nov 12 13:47:57 2013 +0100
     2.3 @@ -0,0 +1,50 @@
     2.4 +/*
     2.5 + * Copyright (c) 2013, Oracle and/or its affiliates. All rights reserved.
     2.6 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
     2.7 + *
     2.8 + * This code is free software; you can redistribute it and/or modify it
     2.9 + * under the terms of the GNU General Public License version 2 only, as
    2.10 + * published by the Free Software Foundation.
    2.11 + *
    2.12 + * This code is distributed in the hope that it will be useful, but WITHOUT
    2.13 + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
    2.14 + * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
    2.15 + * version 2 for more details (a copy is included in the LICENSE file that
    2.16 + * accompanied this code).
    2.17 + *
    2.18 + * You should have received a copy of the GNU General Public License version
    2.19 + * 2 along with this work; if not, write to the Free Software Foundation,
    2.20 + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
    2.21 + *
    2.22 + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
    2.23 + * or visit www.oracle.com if you need additional information or have any
    2.24 + * questions.
    2.25 + */
    2.26 +
    2.27 +/*
    2.28 + * @test
    2.29 + * @bug 8028198
    2.30 + * @summary Verify that split through phi does the right thing
    2.31 + * @compile SplitThruPhiTest.java
    2.32 + * @run main SplitThruPhiTest
    2.33 + *
    2.34 + */
    2.35 +
    2.36 +public class SplitThruPhiTest {
    2.37 +  public static volatile int value = 19;
    2.38 +  public static int store = 0;
    2.39 +  public static void main(String[] args) {
    2.40 +    for (int i = 0; i < 150000; ++i) {
    2.41 +      store = runTest(value);
    2.42 +    }
    2.43 +  }
    2.44 +
    2.45 +  public static int runTest(int val) {
    2.46 +    int result = Math.addExact(val, 1);
    2.47 +    int total = 0;
    2.48 +    for (int i = val; i < 200; i = Math.addExact(i, 1)) {
    2.49 +      total += i;
    2.50 +    }
    2.51 +    return total;
    2.52 +  }
    2.53 +}