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
  31  *      -XX:CompileCommand=compileonly,compiler.loopopt.Test6860469::C
  32  *      compiler.loopopts.Test6860469
  33  */
  34 
  35 package compiler.loopopts;
  36 
  37 public class Test6860469 {
  38 
  39     private static final int H = 16;
  40     private static final int F = 9;
  41 
  42     static int[] fl = new int[1 << F];
  43 
  44     static int C(int ll, int f) {
  45         int max = -1;
  46         int min = H + 1;
  47 
  48         if (ll != 0) {
  49             if (ll < min) {
  50                 min = ll;
  51             }
  52             if (ll > max) {
  53                 max = ll;
  54             }
  55         }
  56 
  57         if (f > max) {
  58             f = max;
  59         }
  60         if (min > f) {
  61             min = f;
  62         }
  63 
  64         for (int mc = 1 >> max - f; mc <= 0; mc++) {
  65             int i = mc << (32 - f);
  66             fl[i] = max;
  67         }
  68 
  69         return min;
  70     }
  71 
  72     public static void main(String argv[]) {
  73         C(0, 10);
  74     }
  75 }