Mercurial > jdk8-mips64-public > hotspot / file comparison
comparison: test/compiler/6956668/Test6956668.java
test/compiler/6956668/Test6956668.java
- changeset 2940
- 33e2b8f1d466
- parent 0
- f90c822e73f8
equal
deleted
inserted
replaced
| 2939:b2cb497dec28 | 2940:33e2b8f1d466 |
|---|---|
| 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 6956668 | |
| 28 * @summary misbehavior of XOR operator (^) with int | |
| 29 * | |
| 30 * @run main/othervm -Xbatch Test6956668 | |
| 31 */ | |
| 32 | |
| 33 | |
| 34 public class Test6956668 { | |
| 35 | |
| 36 public static int bitTest() { | |
| 37 int result = 0; | |
| 38 | |
| 39 int testValue = 73; | |
| 40 int bitCount = Integer.bitCount(testValue); | |
| 41 | |
| 42 if (testValue != 0) { | |
| 43 int gap = Long.numberOfTrailingZeros(testValue); | |
| 44 testValue >>>= gap; | |
| 45 | |
| 46 while (testValue != 0) { | |
| 47 result++; | |
| 48 | |
| 49 if ((testValue ^= 0x1) != 0) { | |
| 50 gap = Long.numberOfTrailingZeros(testValue); | |
| 51 testValue >>>= gap; | |
| 52 } | |
| 53 } | |
| 54 } | |
| 55 | |
| 56 if (bitCount != result) { | |
| 57 System.out.println("ERROR: " + bitCount + " != " + result); | |
| 58 System.exit(97); | |
| 59 } | |
| 60 | |
| 61 return (result); | |
| 62 } | |
| 63 | |
| 64 public static void main(String[] args) { | |
| 65 for (int i = 0; i < 100000; i++) { | |
| 66 int ct = bitTest(); | |
| 67 } | |
| 68 } | |
| 69 } |
