/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* 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
* @bug 8004867
*
* @run main/othervm/timeout=300 -Xbatch -XX:+IgnoreUnrecognizedVMOptions -XX:-TieredCompilation -XX:-OptimizeFill TestIntUnsafeOrdered
* @run main/othervm/timeout=300 -Xbatch -XX:+IgnoreUnrecognizedVMOptions -XX:-TieredCompilation -XX:+OptimizeFill TestIntUnsafeOrdered
*/
public class TestIntUnsafeOrdered {
private static final int BASE;
static {
try {
f.setAccessible(true);
} catch (Exception e) {
throw err;
}
}
if (errn > 0) {
}
}
// Initialize
for (int i=0; i<ARRLEN; i++) {
a1[i] = -1;
a2[i] = -1;
}
for (int i=0; i<ITERS; i++) {
}
// Initialize
for (int i=0; i<ARRLEN; i++) {
a1[i] = -1;
a2[i] = -1;
}
// Test and verify results
int errn = 0;
{
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++) {
}
// Reset for negative stride
for (int i=0; i<ARRLEN; i++) {
a1[i] = -1;
a2[i] = -1;
}
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++) {
}
// Reset for opposite stride
for (int i=0; i<ARRLEN; i++) {
a1[i] = -1;
a2[i] = -1;
}
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++) {
}
// Reset for indexing with offset
for (int i=0; i<ARRLEN; i++) {
a1[i] = -1;
a2[i] = -1;
}
}
}
}
}
}
for (int i=0; i<OFFSET; i++) {
}
// Reset for indexing with invariant offset
for (int i=0; i<ARRLEN; i++) {
a1[i] = -1;
a2[i] = -1;
}
}
}
}
}
}
for (int i=0; i<OFFSET; i++) {
}
// Reset for indexing with scale
for (int i=0; i<ARRLEN; i++) {
a1[i] = -1;
a2[i] = -1;
}
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++) {
if (i%SCALE != 0) {
}
if (i%SCALE != 0) {
}
}
for (int i=0; i<ARRLEN; i++) {
if (i%SCALE != 0) {
}
if (i%SCALE != 0) {
}
}
// Reset for 2 arrays with relative aligned offset
for (int i=0; i<ARRLEN; i++) {
a1[i] = -1;
a2[i] = -1;
}
for (int i=0; i<ALIGN_OFF; i++) {
}
}
for (int i=0; i<ALIGN_OFF; i++) {
a1[i] = 123;
}
}
}
for (int i=0; i<ARRLEN; i++) {
a1[i] = -1;
a2[i] = -1;
}
for (int i=0; i<ALIGN_OFF; i++) {
}
}
}
}
for (int i=0; i<ARRLEN; i++) {
a1[i] = -1;
a2[i] = -1;
}
}
}
for (int i=0; i<ALIGN_OFF; i++) {
}
}
// Reset for 2 arrays with relative unaligned offset
for (int i=0; i<ARRLEN; i++) {
a1[i] = -1;
a2[i] = -1;
}
for (int i=0; i<UNALIGN_OFF; i++) {
}
for (int i=UNALIGN_OFF; i<ARRLEN; i++) {
}
}
}
for (int i=0; i<ARRLEN; i++) {
a1[i] = -1;
a2[i] = -1;
}
for (int i=0; i<UNALIGN_OFF; i++) {
}
for (int i=UNALIGN_OFF; i<ARRLEN; i++) {
}
}
}
for (int i=0; i<ARRLEN; i++) {
a1[i] = -1;
a2[i] = -1;
}
}
}
for (int i=0; i<UNALIGN_OFF; i++) {
}
for (int i=UNALIGN_OFF; i<ARRLEN; i++) {
}
// Reset for aligned overlap initialization
for (int i=0; i<ALIGN_OFF; i++) {
a1[i] = i;
}
a1[i] = -1;
}
for (int i=0; i<ARRLEN; i++) {
int v = i%ALIGN_OFF;
}
for (int i=0; i<ALIGN_OFF; i++) {
}
for (int i=0; i<ALIGN_OFF; i++) {
}
int v = i%ALIGN_OFF;
}
for (int i=0; i<ARRLEN; i++) {
a1[i] = -1;
}
}
}
for (int i=0; i<ARRLEN; i++) {
a1[i] = -1;
}
}
}
// Reset for unaligned overlap initialization
for (int i=0; i<UNALIGN_OFF; i++) {
a1[i] = i;
}
for (int i=UNALIGN_OFF; i<ARRLEN; i++) {
a1[i] = -1;
}
for (int i=0; i<ARRLEN; i++) {
int v = i%UNALIGN_OFF;
}
for (int i=0; i<UNALIGN_OFF; i++) {
}
for (int i=0; i<UNALIGN_OFF; i++) {
}
for (int i=UNALIGN_OFF; i<ARRLEN; i++) {
int v = i%UNALIGN_OFF;
}
for (int i=0; i<ARRLEN; i++) {
a1[i] = -1;
}
}
}
for (int i=0; i<ARRLEN; i++) {
a1[i] = -1;
}
}
}
}
return errn;
// Initialize
for (int i=0; i<ARRLEN; i++) {
a1[i] = -1;
a2[i] = -1;
}
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++) {
}
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++) {
}
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++) {
}
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++) {
}
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++) {
}
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++) {
}
for (int i=0; i<ITERS; i++) {
}
for (int i=0; i<ITERS; i++) {
}
return errn;
}
private final static long byte_offset(int i) {
return ((long)i << 2) + BASE;
}
static void test_ci(int[] a) {
}
}
}
}
static void test_cp(int[] a, int[] b) {
}
}
static void test_2ci(int[] a, int[] b) {
}
}
static void test_2vi(int[] a, int[] b, int c, int d) {
}
}
}
}
}
}
static void test_cp_neg(int[] a, int[] b) {
}
}
static void test_2ci_neg(int[] a, int[] b) {
}
}
static void test_2vi_neg(int[] a, int[] b, int c, int d) {
}
}
}
}
}
}
static void test_cp_oppos(int[] a, int[] b) {
}
}
static void test_2ci_oppos(int[] a, int[] b) {
}
}
static void test_2vi_oppos(int[] a, int[] b, int c, int d) {
}
}
}
}
}
}
static void test_cp_off(int[] a, int[] b) {
}
}
static void test_2ci_off(int[] a, int[] b) {
}
}
static void test_2vi_off(int[] a, int[] b, int c, int d) {
}
}
}
}
}
}
static void test_cp_inv(int[] a, int[] b, int k) {
}
}
static void test_2ci_inv(int[] a, int[] b, int k) {
}
}
static void test_2vi_inv(int[] a, int[] b, int c, int d, int k) {
}
}
}
}
}
}
static void test_cp_scl(int[] a, int[] b) {
}
}
static void test_2ci_scl(int[] a, int[] b) {
}
}
static void test_2vi_scl(int[] a, int[] b, int c, int d) {
}
}
static void test_cp_alndst(int[] a, int[] b) {
}
}
static void test_cp_alnsrc(int[] a, int[] b) {
}
}
static void test_2ci_aln(int[] a, int[] b) {
}
}
static void test_2vi_aln(int[] a, int[] b, int c, int d) {
}
}
static void test_cp_unalndst(int[] a, int[] b) {
}
}
static void test_cp_unalnsrc(int[] a, int[] b) {
}
}
static void test_2ci_unaln(int[] a, int[] b) {
}
}
static void test_2vi_unaln(int[] a, int[] b, int c, int d) {
}
}
return 1;
}
return 0;
}
}