Mercurial > hg > truffle

comparison test/compiler/5091921/Test7020614.java @ 3345:bad7ecd0b6ed

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
5091921: Sign flip issues in loop optimizer Summary: Fix integer overflow problem in the code generated by loop optimizer. Reviewed-by: never
author kvn
date Wed, 04 May 2011 13:12:42 -0700
parents
children
comparison
equal deleted inserted replaced
3344:0139aac70fb5 3345:bad7ecd0b6ed
1 /*
2 * Copyright (c) 2011, 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 /**
26 * @test
27 * @bug 7020614
28 * @summary "-server" mode optimizer makes code hang
29 *
30 * @run main/othervm/timeout=30 -Xbatch Test7020614
31 */
32
33 public class Test7020614 {
34
35 private static final int ITERATIONS = 1000;
36 private static int doNotOptimizeOut = 0;
37
38 public static long bitCountShort() {
39 long t0 = System.currentTimeMillis();
40 int sum = 0;
41 for (int it = 0; it < ITERATIONS; ++it) {
42 short value = 0;
43 do {
44 sum += Integer.bitCount(value);
45 } while (++value != 0);
46 }
47 doNotOptimizeOut += sum;
48 return System.currentTimeMillis() - t0;
49 }
50
51 public static void main(String[] args) {
52 for (int i = 0; i < 4; ++i) {
53 System.out.println((i + 1) + ": " + bitCountShort());
54 }
55 System.out.println("doNotOptimizeOut value: " + doNotOptimizeOut);
56 }
57 }
58