Wed, 09 Apr 2008 11:19:15 -0700
Added tag jdk7-b25 for changeset 58039502942e
duke@1 | 1 | /* |
duke@1 | 2 | * Copyright 2001 Sun Microsystems, Inc. All Rights Reserved. |
duke@1 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@1 | 4 | * |
duke@1 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@1 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@1 | 7 | * published by the Free Software Foundation. |
duke@1 | 8 | * |
duke@1 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@1 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@1 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@1 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@1 | 13 | * accompanied this code). |
duke@1 | 14 | * |
duke@1 | 15 | * You should have received a copy of the GNU General Public License version |
duke@1 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@1 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@1 | 18 | * |
duke@1 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@1 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@1 | 21 | * have any questions. |
duke@1 | 22 | */ |
duke@1 | 23 | |
duke@1 | 24 | /* |
duke@1 | 25 | * @test |
duke@1 | 26 | * @bug 4387704 |
duke@1 | 27 | * @summary Check correct generation of bitwise assignment access method. |
duke@1 | 28 | * @author Neal Gafter (gafter) |
duke@1 | 29 | * |
duke@1 | 30 | * @compile BitwiseAssignment.java |
duke@1 | 31 | * @run main BitwiseAssignment |
duke@1 | 32 | */ |
duke@1 | 33 | |
duke@1 | 34 | public class BitwiseAssignment { |
duke@1 | 35 | private static class Inner { |
duke@1 | 36 | private int data = 4711; |
duke@1 | 37 | } |
duke@1 | 38 | |
duke@1 | 39 | public static void main(String[] args) { |
duke@1 | 40 | { |
duke@1 | 41 | Inner inner1 = new Inner(); |
duke@1 | 42 | inner1.data ^= 42; |
duke@1 | 43 | |
duke@1 | 44 | Inner inner2 = new Inner(); |
duke@1 | 45 | inner2.data = inner2.data ^ 42; |
duke@1 | 46 | if (inner1.data != inner2.data) throw new Error("Failed inner ^="); |
duke@1 | 47 | } |
duke@1 | 48 | |
duke@1 | 49 | { |
duke@1 | 50 | Inner inner1 = new Inner(); |
duke@1 | 51 | inner1.data |= 42; |
duke@1 | 52 | |
duke@1 | 53 | Inner inner2 = new Inner(); |
duke@1 | 54 | inner2.data = inner2.data | 42; |
duke@1 | 55 | if (inner1.data != inner2.data) throw new Error("Failed inner |="); |
duke@1 | 56 | } |
duke@1 | 57 | |
duke@1 | 58 | { |
duke@1 | 59 | Inner inner1 = new Inner(); |
duke@1 | 60 | inner1.data &= 4211; |
duke@1 | 61 | |
duke@1 | 62 | Inner inner2 = new Inner(); |
duke@1 | 63 | inner2.data = inner2.data & 4211; |
duke@1 | 64 | if (inner1.data != inner2.data) throw new Error("Failed inner &="); |
duke@1 | 65 | } |
duke@1 | 66 | } |
duke@1 | 67 | } |