1 /*
   2  * Copyright (c) 2008, 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  * @test
  26  * @bug 6700047
  27  * @summary C2 failed in idom_no_update
  28  * @run main Test6700047
  29  */
  30 
  31 public class Test6700047 {
  32     static byte[] dummy = new byte[256];
  33 
  34     public static void main(String[] args) {
  35         for (int i = 0; i < 100000; i++) {
  36             intToLeftPaddedAsciiBytes();
  37         }
  38     }
  39 
  40     public static int intToLeftPaddedAsciiBytes() {
  41         int offset = 40;
  42         int q;
  43         int r;
  44         int         i   = 100;
  45         int result = 1;
  46         while (offset > 0) {
  47             q = (i * 52429);
  48             r = i;
  49             offset--;
  50             i = q;
  51             if (i == 0) {
  52                 break;
  53             }
  54         }
  55         if (offset > 0) {
  56             for(int j = 0; j < offset; j++) {
  57                 result++;
  58                 dummy[i] = 0;
  59             }
  60         }
  61         return result;
  62     }
  63 }