Wed, 22 Jan 2014 12:37:28 -0800
Added tag jdk8u5-b05 for changeset b90de55aca30
aoqi@0 | 1 | /* |
aoqi@0 | 2 | * Copyright (c) 2011, Oracle and/or its affiliates. All rights reserved. |
aoqi@0 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
aoqi@0 | 4 | * |
aoqi@0 | 5 | * This code is free software; you can redistribute it and/or modify it |
aoqi@0 | 6 | * under the terms of the GNU General Public License version 2 only, as |
aoqi@0 | 7 | * published by the Free Software Foundation. |
aoqi@0 | 8 | * |
aoqi@0 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
aoqi@0 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
aoqi@0 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
aoqi@0 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
aoqi@0 | 13 | * accompanied this code). |
aoqi@0 | 14 | * |
aoqi@0 | 15 | * You should have received a copy of the GNU General Public License version |
aoqi@0 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
aoqi@0 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
aoqi@0 | 18 | * |
aoqi@0 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
aoqi@0 | 20 | * or visit www.oracle.com if you need additional information or have any |
aoqi@0 | 21 | * questions. |
aoqi@0 | 22 | * |
aoqi@0 | 23 | */ |
aoqi@0 | 24 | |
aoqi@0 | 25 | /** |
aoqi@0 | 26 | * @test |
aoqi@0 | 27 | * @bug 6956668 |
aoqi@0 | 28 | * @summary misbehavior of XOR operator (^) with int |
aoqi@0 | 29 | * |
aoqi@0 | 30 | * @run main/othervm -Xbatch Test6956668 |
aoqi@0 | 31 | */ |
aoqi@0 | 32 | |
aoqi@0 | 33 | |
aoqi@0 | 34 | public class Test6956668 { |
aoqi@0 | 35 | |
aoqi@0 | 36 | public static int bitTest() { |
aoqi@0 | 37 | int result = 0; |
aoqi@0 | 38 | |
aoqi@0 | 39 | int testValue = 73; |
aoqi@0 | 40 | int bitCount = Integer.bitCount(testValue); |
aoqi@0 | 41 | |
aoqi@0 | 42 | if (testValue != 0) { |
aoqi@0 | 43 | int gap = Long.numberOfTrailingZeros(testValue); |
aoqi@0 | 44 | testValue >>>= gap; |
aoqi@0 | 45 | |
aoqi@0 | 46 | while (testValue != 0) { |
aoqi@0 | 47 | result++; |
aoqi@0 | 48 | |
aoqi@0 | 49 | if ((testValue ^= 0x1) != 0) { |
aoqi@0 | 50 | gap = Long.numberOfTrailingZeros(testValue); |
aoqi@0 | 51 | testValue >>>= gap; |
aoqi@0 | 52 | } |
aoqi@0 | 53 | } |
aoqi@0 | 54 | } |
aoqi@0 | 55 | |
aoqi@0 | 56 | if (bitCount != result) { |
aoqi@0 | 57 | System.out.println("ERROR: " + bitCount + " != " + result); |
aoqi@0 | 58 | System.exit(97); |
aoqi@0 | 59 | } |
aoqi@0 | 60 | |
aoqi@0 | 61 | return (result); |
aoqi@0 | 62 | } |
aoqi@0 | 63 | |
aoqi@0 | 64 | public static void main(String[] args) { |
aoqi@0 | 65 | for (int i = 0; i < 100000; i++) { |
aoqi@0 | 66 | int ct = bitTest(); |
aoqi@0 | 67 | } |
aoqi@0 | 68 | } |
aoqi@0 | 69 | } |