| /* | |
| * Copyright (c) 2019, 2023, Oracle and/or its affiliates. All rights reserved. | |
| * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. | |
| * | |
| * This code is free software; you can redistribute it and/or modify it | |
| * under the terms of the GNU General Public License version 2 only, as | |
| * published by the Free Software Foundation. | |
| * | |
| * This code is distributed in the hope that it will be useful, but WITHOUT | |
| * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| * version 2 for more details (a copy is included in the LICENSE file that | |
| * accompanied this code). | |
| * | |
| * You should have received a copy of the GNU General Public License version | |
| * 2 along with this work; if not, write to the Free Software Foundation, | |
| * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
| * | |
| * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA | |
| * or visit www.oracle.com if you need additional information or have any | |
| * questions. | |
| * | |
| */ | |
| /* | |
| * @test | |
| * @run testng TestVarHandleCombinators | |
| */ | |
| import java.lang.foreign.Arena; | |
| import java.lang.foreign.ValueLayout; | |
| import org.testng.annotations.Test; | |
| import java.lang.foreign.MemorySegment; | |
| import java.lang.invoke.MethodHandles; | |
| import java.lang.invoke.VarHandle; | |
| import java.nio.ByteOrder; | |
| import static org.testng.Assert.assertEquals; | |
| public class TestVarHandleCombinators { | |
| @Test | |
| public void testElementAccess() { | |
| VarHandle vh = ValueLayout.JAVA_BYTE.varHandle(); | |
| byte[] arr = { 0, 0, -1, 0 }; | |
| MemorySegment segment = MemorySegment.ofArray(arr); | |
| assertEquals((byte) vh.get(segment, 2), (byte) -1); | |
| } | |
| @Test(expectedExceptions = IllegalArgumentException.class) | |
| public void testUnalignedElement() { | |
| VarHandle vh = ValueLayout.JAVA_BYTE.withByteAlignment(4).varHandle(); | |
| MemorySegment segment = MemorySegment.ofArray(new byte[4]); | |
| vh.get(segment, 2L); //should throw | |
| //FIXME: the VH only checks the alignment of the segment, which is fine if the VH is derived from layouts, | |
| //FIXME: but not if the VH is just created from scratch - we need a VH variable to govern this property, | |
| //FIXME: at least until the VM is fixed | |
| } | |
| @Test | |
| public void testAlign() { | |
| VarHandle vh = ValueLayout.JAVA_BYTE.withByteAlignment(2).varHandle(); | |
| Arena scope = Arena.ofAuto(); | |
| MemorySegment segment = scope.allocate(1L, 2); | |
| vh.set(segment, 0L, (byte) 10); // fine, memory region is aligned | |
| assertEquals((byte) vh.get(segment, 0L), (byte) 10); | |
| } | |
| @Test | |
| public void testByteOrderLE() { | |
| VarHandle vh = ValueLayout.JAVA_SHORT_UNALIGNED.withOrder(ByteOrder.LITTLE_ENDIAN).varHandle(); | |
| byte[] arr = new byte[2]; | |
| MemorySegment segment = MemorySegment.ofArray(arr); | |
| vh.set(segment, 0L, (short) 0xFF); | |
| assertEquals(arr[0], (byte) 0xFF); | |
| assertEquals(arr[1], (byte) 0); | |
| } | |
| @Test | |
| public void testByteOrderBE() { | |
| VarHandle vh = ValueLayout.JAVA_SHORT_UNALIGNED.withOrder(ByteOrder.BIG_ENDIAN).varHandle(); | |
| byte[] arr = new byte[2]; | |
| MemorySegment segment = MemorySegment.ofArray(arr); | |
| vh.set(segment, 0L, (short) 0xFF); | |
| assertEquals(arr[0], (byte) 0); | |
| assertEquals(arr[1], (byte) 0xFF); | |
| } | |
| @Test | |
| public void testNestedSequenceAccess() { | |
| int outer_size = 10; | |
| int inner_size = 5; | |
| //[10 : [5 : [x32 i32]]] | |
| VarHandle vh = ValueLayout.JAVA_INT.varHandle(); | |
| int count = 0; | |
| try (Arena arena = Arena.ofConfined()) { | |
| MemorySegment segment = arena.allocate(inner_size * outer_size * 8, 4); | |
| for (long i = 0; i < outer_size; i++) { | |
| for (long j = 0; j < inner_size; j++) { | |
| vh.set(segment, i * 40 + j * 8, count); | |
| assertEquals( | |
| (int)vh.get(segment.asSlice(i * inner_size * 8), j * 8), | |
| count); | |
| count++; | |
| } | |
| } | |
| } | |
| } | |
| } |