TestShortVect.java revision 3969
2362N/A * Copyright (c) 2012, Oracle and/or its affiliates. All rights reserved. 1878N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 1878N/A * This code is free software; you can redistribute it and/or modify it 1878N/A * under the terms of the GNU General Public License version 2 only, as 1878N/A * published by the Free Software Foundation. 1878N/A * This code is distributed in the hope that it will be useful, but WITHOUT 1878N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 1878N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 1878N/A * version 2 for more details (a copy is included in the LICENSE file that 1878N/A * You should have received a copy of the GNU General Public License version 1878N/A * 2 along with this work; if not, write to the Free Software Foundation, 1878N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 2362N/A * or visit www.oracle.com if you need additional information or have any 1878N/A * @summary assert(_in[req-1] == this) failed: Must pass arg count to 'new' // Test and verify results for (
int i=
0; i<
ARRLEN; i++) {
for (
int i=
0; i<
ARRLEN; i++) {
for (
int i=
0; i<
ARRLEN; i++) {
for (
int i=
0; i<
ARRLEN; i++) {
for (
int i=
0; i<
ARRLEN; i++) {
errn +=
verify(
"test_unrl_addi: ", i,
a0[i], (
short)(i+(i&
3)));
for (
int i=
0; i<
ARRLEN; i++) {
errn +=
verify(
"test_unrl_lsai: ", i,
a0[i], (
short)(i<<(i&
3)));
for (
int i=
0; i<
ITERS; i++) {
for (
int i=
0; i<
ITERS; i++) {
for (
int i=
0; i<
ITERS; i++) {
for (
int i=
0; i<
ITERS; i++) {
for (
int i=
0; i<
ITERS; i++) {
for (
int i=
0; i<
ITERS; i++) {
a0[i] = (
short)(
a1[i]+(i&
3));
a0[i] = (
short)(
a1[i]<<(i&
3));
a0[i+
0] = (
short)(
a1[i+
0]+
0);
a0[i+
1] = (
short)(
a1[i+
1]+
1);
a0[i+
2] = (
short)(
a1[i+
2]+
2);
a0[i+
3] = (
short)(
a1[i+
3]+
3);
a0[i] = (
short)(
a1[i]+(i&
3));
a0[i+
0] = (
short)(
a1[i+
0]<<
0);
a0[i+
1] = (
short)(
a1[i+
1]<<
1);
a0[i+
2] = (
short)(
a1[i+
2]<<
2);
a0[i+
3] = (
short)(
a1[i+
3]<<
3);
a0[i] = (
short)(
a1[i]<<(i&
3));