Mercurial > hg > graal-compiler

comparison test/compiler/6700047/Test6700047.java @ 251:020a0b730379

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
6700047: C2 failed in idom_no_update Summary: partial peeling shouldn't place clones into loop Reviewed-by: kvn
author never
date Fri, 25 Jul 2008 15:54:23 -0700
parents
children ee8f06bfb27c
comparison
equal deleted inserted replaced
250:6ca61c728c2d 251:020a0b730379
1 /*
2 * Copyright 2008 Sun Microsystems, 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
20 * CA 95054 USA or visit www.sun.com if you need additional information or
21 * have any 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 public static void main(String[] args) {
33 for (int i = 0; i < 100000; i++) {
34 intToLeftPaddedAsciiBytes();
35 }
36 }
37
38 public static int intToLeftPaddedAsciiBytes() {
39 int offset = 40;
40 int q;
41 int r;
42 int i = 100;
43 int result = 1;
44 while (offset > 0) {
45 q = (i * 52429);
46 r = i;
47 offset--;
48 i = q;
49 if (i == 0) {
50 break;
51 }
52 }
53 if (offset > 0) {
54 for(int j = 0; j < offset; j++) {
55 result++;
56 }
57 }
58 return result;
59 }
60 }