1 /*

     2  * Copyright 2009 Google Inc.  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 6860469

    28  * @summary remix_address_expressions reshapes address expression with bad control

    29  *

    30  * @run main/othervm -Xcomp -XX:CompileOnly=Test.C Test

    31  */

    32 

    33 public class Test {

    34 

    35   private static final int H = 16;

    36   private static final int F = 9;

    37 

    38   static int[] fl = new int[1 << F];

    39 

    40   static int C(int ll, int f) {

    41     int max = -1;

    42     int min = H + 1;

    43 

    44     if (ll != 0) {

    45       if (ll < min) {

    46         min = ll;

    47       }

    48       if (ll > max) {

    49         max = ll;

    50       }

    51     }

    52 

    53     if (f > max) {

    54       f = max;

    55     }

    56     if (min > f) {

    57       min = f;

    58     }

    59 

    60     for (int mc = 1 >> max - f; mc <= 0; mc++) {

    61       int i = mc << (32 - f);

    62       fl[i] = max;

    63     }

    64 

    65     return min;

    66   }

    67 

    68   public static void main(String argv[]) {

    69     C(0, 10);

    70   }

    71 }