< prev index next >

test/jdk/jdk/incubator/vector/Short256VectorTests.java

Print this page
rev 55892 : 8222933: [vector] Test failures after api change in JDK-8222752
Summary: Test failure becaues of renaming get() and getElement() functions to lane() in changeset http://hg.openjdk.java.net/panama/dev/rev/82514a6254e6
Reviewed-by: sviswanathan


1217                 av.with(0, (short)4).intoArray(r, i);
1218             }
1219         }
1220 
1221         assertInsertArraysEquals(a, r, (short)4, 0);
1222     }
1223 
1224     @Test(dataProvider = "shortCompareOpProvider")
1225     static void lessThanShort256VectorTests(IntFunction<short[]> fa, IntFunction<short[]> fb) {
1226         short[] a = fa.apply(SPECIES.length());
1227         short[] b = fb.apply(SPECIES.length());
1228 
1229         for (int ic = 0; ic < INVOC_COUNT; ic++) {
1230             for (int i = 0; i < a.length; i += SPECIES.length()) {
1231                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
1232                 ShortVector bv = ShortVector.fromArray(SPECIES, b, i);
1233                 VectorMask<Short> mv = av.lessThan(bv);
1234 
1235                 // Check results as part of computation.
1236                 for (int j = 0; j < SPECIES.length(); j++) {
1237                     Assert.assertEquals(mv.getElement(j), a[i + j] < b[i + j]);
1238                 }
1239             }
1240         }
1241     }
1242 
1243 
1244     @Test(dataProvider = "shortCompareOpProvider")
1245     static void greaterThanShort256VectorTests(IntFunction<short[]> fa, IntFunction<short[]> fb) {
1246         short[] a = fa.apply(SPECIES.length());
1247         short[] b = fb.apply(SPECIES.length());
1248 
1249         for (int ic = 0; ic < INVOC_COUNT; ic++) {
1250             for (int i = 0; i < a.length; i += SPECIES.length()) {
1251                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
1252                 ShortVector bv = ShortVector.fromArray(SPECIES, b, i);
1253                 VectorMask<Short> mv = av.greaterThan(bv);
1254 
1255                 // Check results as part of computation.
1256                 for (int j = 0; j < SPECIES.length(); j++) {
1257                     Assert.assertEquals(mv.getElement(j), a[i + j] > b[i + j]);
1258                 }
1259             }
1260         }
1261     }
1262 
1263 
1264     @Test(dataProvider = "shortCompareOpProvider")
1265     static void equalShort256VectorTests(IntFunction<short[]> fa, IntFunction<short[]> fb) {
1266         short[] a = fa.apply(SPECIES.length());
1267         short[] b = fb.apply(SPECIES.length());
1268 
1269         for (int ic = 0; ic < INVOC_COUNT; ic++) {
1270             for (int i = 0; i < a.length; i += SPECIES.length()) {
1271                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
1272                 ShortVector bv = ShortVector.fromArray(SPECIES, b, i);
1273                 VectorMask<Short> mv = av.equal(bv);
1274 
1275                 // Check results as part of computation.
1276                 for (int j = 0; j < SPECIES.length(); j++) {
1277                     Assert.assertEquals(mv.getElement(j), a[i + j] == b[i + j]);
1278                 }
1279             }
1280         }
1281     }
1282 
1283 
1284     @Test(dataProvider = "shortCompareOpProvider")
1285     static void notEqualShort256VectorTests(IntFunction<short[]> fa, IntFunction<short[]> fb) {
1286         short[] a = fa.apply(SPECIES.length());
1287         short[] b = fb.apply(SPECIES.length());
1288 
1289         for (int ic = 0; ic < INVOC_COUNT; ic++) {
1290             for (int i = 0; i < a.length; i += SPECIES.length()) {
1291                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
1292                 ShortVector bv = ShortVector.fromArray(SPECIES, b, i);
1293                 VectorMask<Short> mv = av.notEqual(bv);
1294 
1295                 // Check results as part of computation.
1296                 for (int j = 0; j < SPECIES.length(); j++) {
1297                     Assert.assertEquals(mv.getElement(j), a[i + j] != b[i + j]);
1298                 }
1299             }
1300         }
1301     }
1302 
1303 
1304     @Test(dataProvider = "shortCompareOpProvider")
1305     static void lessThanEqShort256VectorTests(IntFunction<short[]> fa, IntFunction<short[]> fb) {
1306         short[] a = fa.apply(SPECIES.length());
1307         short[] b = fb.apply(SPECIES.length());
1308 
1309         for (int ic = 0; ic < INVOC_COUNT; ic++) {
1310             for (int i = 0; i < a.length; i += SPECIES.length()) {
1311                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
1312                 ShortVector bv = ShortVector.fromArray(SPECIES, b, i);
1313                 VectorMask<Short> mv = av.lessThanEq(bv);
1314 
1315                 // Check results as part of computation.
1316                 for (int j = 0; j < SPECIES.length(); j++) {
1317                     Assert.assertEquals(mv.getElement(j), a[i + j] <= b[i + j]);
1318                 }
1319             }
1320         }
1321     }
1322 
1323 
1324     @Test(dataProvider = "shortCompareOpProvider")
1325     static void greaterThanEqShort256VectorTests(IntFunction<short[]> fa, IntFunction<short[]> fb) {
1326         short[] a = fa.apply(SPECIES.length());
1327         short[] b = fb.apply(SPECIES.length());
1328 
1329         for (int ic = 0; ic < INVOC_COUNT; ic++) {
1330             for (int i = 0; i < a.length; i += SPECIES.length()) {
1331                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
1332                 ShortVector bv = ShortVector.fromArray(SPECIES, b, i);
1333                 VectorMask<Short> mv = av.greaterThanEq(bv);
1334 
1335                 // Check results as part of computation.
1336                 for (int j = 0; j < SPECIES.length(); j++) {
1337                     Assert.assertEquals(mv.getElement(j), a[i + j] >= b[i + j]);
1338                 }
1339             }
1340         }
1341     }
1342 
1343 
1344     static short blend(short a, short b, boolean mask) {
1345         return mask ? b : a;
1346     }
1347 
1348     @Test(dataProvider = "shortBinaryOpMaskProvider")
1349     static void blendShort256VectorTests(IntFunction<short[]> fa, IntFunction<short[]> fb,
1350                                           IntFunction<boolean[]> fm) {
1351         short[] a = fa.apply(SPECIES.length());
1352         short[] b = fb.apply(SPECIES.length());
1353         short[] r = fr.apply(SPECIES.length());
1354         boolean[] mask = fm.apply(SPECIES.length());
1355         VectorMask<Short> vmask = VectorMask.fromValues(SPECIES, mask);
1356 
1357         for (int ic = 0; ic < INVOC_COUNT; ic++) {


1380         }
1381 
1382         assertRearrangeArraysEquals(a, r, order, SPECIES.length());
1383     }
1384 
1385 
1386 
1387 
1388     @Test(dataProvider = "shortUnaryOpProvider")
1389     static void getShort256VectorTests(IntFunction<short[]> fa) {
1390         short[] a = fa.apply(SPECIES.length());
1391         short[] r = fr.apply(SPECIES.length());
1392 
1393         for (int ic = 0; ic < INVOC_COUNT; ic++) {
1394             for (int i = 0; i < a.length; i += SPECIES.length()) {
1395                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
1396                 int num_lanes = SPECIES.length();
1397                 // Manually unroll because full unroll happens after intrinsification.
1398                 // Unroll is needed because get intrinsic requires for index to be a known constant.
1399                 if (num_lanes == 1) {
1400                     r[i]=av.get(0);
1401                 } else if (num_lanes == 2) {
1402                     r[i]=av.get(0);
1403                     r[i+1]=av.get(1);
1404                 } else if (num_lanes == 4) {
1405                     r[i]=av.get(0);
1406                     r[i+1]=av.get(1);
1407                     r[i+2]=av.get(2);
1408                     r[i+3]=av.get(3);
1409                 } else if (num_lanes == 8) {
1410                     r[i]=av.get(0);
1411                     r[i+1]=av.get(1);
1412                     r[i+2]=av.get(2);
1413                     r[i+3]=av.get(3);
1414                     r[i+4]=av.get(4);
1415                     r[i+5]=av.get(5);
1416                     r[i+6]=av.get(6);
1417                     r[i+7]=av.get(7);
1418                 } else if (num_lanes == 16) {
1419                     r[i]=av.get(0);
1420                     r[i+1]=av.get(1);
1421                     r[i+2]=av.get(2);
1422                     r[i+3]=av.get(3);
1423                     r[i+4]=av.get(4);
1424                     r[i+5]=av.get(5);
1425                     r[i+6]=av.get(6);
1426                     r[i+7]=av.get(7);
1427                     r[i+8]=av.get(8);
1428                     r[i+9]=av.get(9);
1429                     r[i+10]=av.get(10);
1430                     r[i+11]=av.get(11);
1431                     r[i+12]=av.get(12);
1432                     r[i+13]=av.get(13);
1433                     r[i+14]=av.get(14);
1434                     r[i+15]=av.get(15);
1435                 } else if (num_lanes == 32) {
1436                     r[i]=av.get(0);
1437                     r[i+1]=av.get(1);
1438                     r[i+2]=av.get(2);
1439                     r[i+3]=av.get(3);
1440                     r[i+4]=av.get(4);
1441                     r[i+5]=av.get(5);
1442                     r[i+6]=av.get(6);
1443                     r[i+7]=av.get(7);
1444                     r[i+8]=av.get(8);
1445                     r[i+9]=av.get(9);
1446                     r[i+10]=av.get(10);
1447                     r[i+11]=av.get(11);
1448                     r[i+12]=av.get(12);
1449                     r[i+13]=av.get(13);
1450                     r[i+14]=av.get(14);
1451                     r[i+15]=av.get(15);
1452                     r[i+16]=av.get(16);
1453                     r[i+17]=av.get(17);
1454                     r[i+18]=av.get(18);
1455                     r[i+19]=av.get(19);
1456                     r[i+20]=av.get(20);
1457                     r[i+21]=av.get(21);
1458                     r[i+22]=av.get(22);
1459                     r[i+23]=av.get(23);
1460                     r[i+24]=av.get(24);
1461                     r[i+25]=av.get(25);
1462                     r[i+26]=av.get(26);
1463                     r[i+27]=av.get(27);
1464                     r[i+28]=av.get(28);
1465                     r[i+29]=av.get(29);
1466                     r[i+30]=av.get(30);
1467                     r[i+31]=av.get(31);
1468                 } else if (num_lanes == 64) {
1469                     r[i]=av.get(0);
1470                     r[i+1]=av.get(1);
1471                     r[i+2]=av.get(2);
1472                     r[i+3]=av.get(3);
1473                     r[i+4]=av.get(4);
1474                     r[i+5]=av.get(5);
1475                     r[i+6]=av.get(6);
1476                     r[i+7]=av.get(7);
1477                     r[i+8]=av.get(8);
1478                     r[i+9]=av.get(9);
1479                     r[i+10]=av.get(10);
1480                     r[i+11]=av.get(11);
1481                     r[i+12]=av.get(12);
1482                     r[i+13]=av.get(13);
1483                     r[i+14]=av.get(14);
1484                     r[i+15]=av.get(15);
1485                     r[i+16]=av.get(16);
1486                     r[i+17]=av.get(17);
1487                     r[i+18]=av.get(18);
1488                     r[i+19]=av.get(19);
1489                     r[i+20]=av.get(20);
1490                     r[i+21]=av.get(21);
1491                     r[i+22]=av.get(22);
1492                     r[i+23]=av.get(23);
1493                     r[i+24]=av.get(24);
1494                     r[i+25]=av.get(25);
1495                     r[i+26]=av.get(26);
1496                     r[i+27]=av.get(27);
1497                     r[i+28]=av.get(28);
1498                     r[i+29]=av.get(29);
1499                     r[i+30]=av.get(30);
1500                     r[i+31]=av.get(31);
1501                     r[i+32]=av.get(32);
1502                     r[i+33]=av.get(33);
1503                     r[i+34]=av.get(34);
1504                     r[i+35]=av.get(35);
1505                     r[i+36]=av.get(36);
1506                     r[i+37]=av.get(37);
1507                     r[i+38]=av.get(38);
1508                     r[i+39]=av.get(39);
1509                     r[i+40]=av.get(40);
1510                     r[i+41]=av.get(41);
1511                     r[i+42]=av.get(42);
1512                     r[i+43]=av.get(43);
1513                     r[i+44]=av.get(44);
1514                     r[i+45]=av.get(45);
1515                     r[i+46]=av.get(46);
1516                     r[i+47]=av.get(47);
1517                     r[i+48]=av.get(48);
1518                     r[i+49]=av.get(49);
1519                     r[i+50]=av.get(50);
1520                     r[i+51]=av.get(51);
1521                     r[i+52]=av.get(52);
1522                     r[i+53]=av.get(53);
1523                     r[i+54]=av.get(54);
1524                     r[i+55]=av.get(55);
1525                     r[i+56]=av.get(56);
1526                     r[i+57]=av.get(57);
1527                     r[i+58]=av.get(58);
1528                     r[i+59]=av.get(59);
1529                     r[i+60]=av.get(60);
1530                     r[i+61]=av.get(61);
1531                     r[i+62]=av.get(62);
1532                     r[i+63]=av.get(63);
1533                 } else {
1534                     for (int j = 0; j < SPECIES.length(); j++) {
1535                         r[i+j]=av.get(j);
1536                     }
1537                 }
1538             }
1539         }
1540 
1541         assertArraysEquals(a, r, Short256VectorTests::get);
1542     }
1543 
1544 
1545 
1546 
1547 
1548 
1549 
1550 
1551 
1552 
1553 
1554 
1555 




1217                 av.with(0, (short)4).intoArray(r, i);
1218             }
1219         }
1220 
1221         assertInsertArraysEquals(a, r, (short)4, 0);
1222     }
1223 
1224     @Test(dataProvider = "shortCompareOpProvider")
1225     static void lessThanShort256VectorTests(IntFunction<short[]> fa, IntFunction<short[]> fb) {
1226         short[] a = fa.apply(SPECIES.length());
1227         short[] b = fb.apply(SPECIES.length());
1228 
1229         for (int ic = 0; ic < INVOC_COUNT; ic++) {
1230             for (int i = 0; i < a.length; i += SPECIES.length()) {
1231                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
1232                 ShortVector bv = ShortVector.fromArray(SPECIES, b, i);
1233                 VectorMask<Short> mv = av.lessThan(bv);
1234 
1235                 // Check results as part of computation.
1236                 for (int j = 0; j < SPECIES.length(); j++) {
1237                     Assert.assertEquals(mv.lane(j), a[i + j] < b[i + j]);
1238                 }
1239             }
1240         }
1241     }
1242 
1243 
1244     @Test(dataProvider = "shortCompareOpProvider")
1245     static void greaterThanShort256VectorTests(IntFunction<short[]> fa, IntFunction<short[]> fb) {
1246         short[] a = fa.apply(SPECIES.length());
1247         short[] b = fb.apply(SPECIES.length());
1248 
1249         for (int ic = 0; ic < INVOC_COUNT; ic++) {
1250             for (int i = 0; i < a.length; i += SPECIES.length()) {
1251                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
1252                 ShortVector bv = ShortVector.fromArray(SPECIES, b, i);
1253                 VectorMask<Short> mv = av.greaterThan(bv);
1254 
1255                 // Check results as part of computation.
1256                 for (int j = 0; j < SPECIES.length(); j++) {
1257                     Assert.assertEquals(mv.lane(j), a[i + j] > b[i + j]);
1258                 }
1259             }
1260         }
1261     }
1262 
1263 
1264     @Test(dataProvider = "shortCompareOpProvider")
1265     static void equalShort256VectorTests(IntFunction<short[]> fa, IntFunction<short[]> fb) {
1266         short[] a = fa.apply(SPECIES.length());
1267         short[] b = fb.apply(SPECIES.length());
1268 
1269         for (int ic = 0; ic < INVOC_COUNT; ic++) {
1270             for (int i = 0; i < a.length; i += SPECIES.length()) {
1271                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
1272                 ShortVector bv = ShortVector.fromArray(SPECIES, b, i);
1273                 VectorMask<Short> mv = av.equal(bv);
1274 
1275                 // Check results as part of computation.
1276                 for (int j = 0; j < SPECIES.length(); j++) {
1277                     Assert.assertEquals(mv.lane(j), a[i + j] == b[i + j]);
1278                 }
1279             }
1280         }
1281     }
1282 
1283 
1284     @Test(dataProvider = "shortCompareOpProvider")
1285     static void notEqualShort256VectorTests(IntFunction<short[]> fa, IntFunction<short[]> fb) {
1286         short[] a = fa.apply(SPECIES.length());
1287         short[] b = fb.apply(SPECIES.length());
1288 
1289         for (int ic = 0; ic < INVOC_COUNT; ic++) {
1290             for (int i = 0; i < a.length; i += SPECIES.length()) {
1291                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
1292                 ShortVector bv = ShortVector.fromArray(SPECIES, b, i);
1293                 VectorMask<Short> mv = av.notEqual(bv);
1294 
1295                 // Check results as part of computation.
1296                 for (int j = 0; j < SPECIES.length(); j++) {
1297                     Assert.assertEquals(mv.lane(j), a[i + j] != b[i + j]);
1298                 }
1299             }
1300         }
1301     }
1302 
1303 
1304     @Test(dataProvider = "shortCompareOpProvider")
1305     static void lessThanEqShort256VectorTests(IntFunction<short[]> fa, IntFunction<short[]> fb) {
1306         short[] a = fa.apply(SPECIES.length());
1307         short[] b = fb.apply(SPECIES.length());
1308 
1309         for (int ic = 0; ic < INVOC_COUNT; ic++) {
1310             for (int i = 0; i < a.length; i += SPECIES.length()) {
1311                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
1312                 ShortVector bv = ShortVector.fromArray(SPECIES, b, i);
1313                 VectorMask<Short> mv = av.lessThanEq(bv);
1314 
1315                 // Check results as part of computation.
1316                 for (int j = 0; j < SPECIES.length(); j++) {
1317                     Assert.assertEquals(mv.lane(j), a[i + j] <= b[i + j]);
1318                 }
1319             }
1320         }
1321     }
1322 
1323 
1324     @Test(dataProvider = "shortCompareOpProvider")
1325     static void greaterThanEqShort256VectorTests(IntFunction<short[]> fa, IntFunction<short[]> fb) {
1326         short[] a = fa.apply(SPECIES.length());
1327         short[] b = fb.apply(SPECIES.length());
1328 
1329         for (int ic = 0; ic < INVOC_COUNT; ic++) {
1330             for (int i = 0; i < a.length; i += SPECIES.length()) {
1331                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
1332                 ShortVector bv = ShortVector.fromArray(SPECIES, b, i);
1333                 VectorMask<Short> mv = av.greaterThanEq(bv);
1334 
1335                 // Check results as part of computation.
1336                 for (int j = 0; j < SPECIES.length(); j++) {
1337                     Assert.assertEquals(mv.lane(j), a[i + j] >= b[i + j]);
1338                 }
1339             }
1340         }
1341     }
1342 
1343 
1344     static short blend(short a, short b, boolean mask) {
1345         return mask ? b : a;
1346     }
1347 
1348     @Test(dataProvider = "shortBinaryOpMaskProvider")
1349     static void blendShort256VectorTests(IntFunction<short[]> fa, IntFunction<short[]> fb,
1350                                           IntFunction<boolean[]> fm) {
1351         short[] a = fa.apply(SPECIES.length());
1352         short[] b = fb.apply(SPECIES.length());
1353         short[] r = fr.apply(SPECIES.length());
1354         boolean[] mask = fm.apply(SPECIES.length());
1355         VectorMask<Short> vmask = VectorMask.fromValues(SPECIES, mask);
1356 
1357         for (int ic = 0; ic < INVOC_COUNT; ic++) {


1380         }
1381 
1382         assertRearrangeArraysEquals(a, r, order, SPECIES.length());
1383     }
1384 
1385 
1386 
1387 
1388     @Test(dataProvider = "shortUnaryOpProvider")
1389     static void getShort256VectorTests(IntFunction<short[]> fa) {
1390         short[] a = fa.apply(SPECIES.length());
1391         short[] r = fr.apply(SPECIES.length());
1392 
1393         for (int ic = 0; ic < INVOC_COUNT; ic++) {
1394             for (int i = 0; i < a.length; i += SPECIES.length()) {
1395                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
1396                 int num_lanes = SPECIES.length();
1397                 // Manually unroll because full unroll happens after intrinsification.
1398                 // Unroll is needed because get intrinsic requires for index to be a known constant.
1399                 if (num_lanes == 1) {
1400                     r[i]=av.lane(0);
1401                 } else if (num_lanes == 2) {
1402                     r[i]=av.lane(0);
1403                     r[i+1]=av.lane(1);
1404                 } else if (num_lanes == 4) {
1405                     r[i]=av.lane(0);
1406                     r[i+1]=av.lane(1);
1407                     r[i+2]=av.lane(2);
1408                     r[i+3]=av.lane(3);
1409                 } else if (num_lanes == 8) {
1410                     r[i]=av.lane(0);
1411                     r[i+1]=av.lane(1);
1412                     r[i+2]=av.lane(2);
1413                     r[i+3]=av.lane(3);
1414                     r[i+4]=av.lane(4);
1415                     r[i+5]=av.lane(5);
1416                     r[i+6]=av.lane(6);
1417                     r[i+7]=av.lane(7);
1418                 } else if (num_lanes == 16) {
1419                     r[i]=av.lane(0);
1420                     r[i+1]=av.lane(1);
1421                     r[i+2]=av.lane(2);
1422                     r[i+3]=av.lane(3);
1423                     r[i+4]=av.lane(4);
1424                     r[i+5]=av.lane(5);
1425                     r[i+6]=av.lane(6);
1426                     r[i+7]=av.lane(7);
1427                     r[i+8]=av.lane(8);
1428                     r[i+9]=av.lane(9);
1429                     r[i+10]=av.lane(10);
1430                     r[i+11]=av.lane(11);
1431                     r[i+12]=av.lane(12);
1432                     r[i+13]=av.lane(13);
1433                     r[i+14]=av.lane(14);
1434                     r[i+15]=av.lane(15);
1435                 } else if (num_lanes == 32) {
1436                     r[i]=av.lane(0);
1437                     r[i+1]=av.lane(1);
1438                     r[i+2]=av.lane(2);
1439                     r[i+3]=av.lane(3);
1440                     r[i+4]=av.lane(4);
1441                     r[i+5]=av.lane(5);
1442                     r[i+6]=av.lane(6);
1443                     r[i+7]=av.lane(7);
1444                     r[i+8]=av.lane(8);
1445                     r[i+9]=av.lane(9);
1446                     r[i+10]=av.lane(10);
1447                     r[i+11]=av.lane(11);
1448                     r[i+12]=av.lane(12);
1449                     r[i+13]=av.lane(13);
1450                     r[i+14]=av.lane(14);
1451                     r[i+15]=av.lane(15);
1452                     r[i+16]=av.lane(16);
1453                     r[i+17]=av.lane(17);
1454                     r[i+18]=av.lane(18);
1455                     r[i+19]=av.lane(19);
1456                     r[i+20]=av.lane(20);
1457                     r[i+21]=av.lane(21);
1458                     r[i+22]=av.lane(22);
1459                     r[i+23]=av.lane(23);
1460                     r[i+24]=av.lane(24);
1461                     r[i+25]=av.lane(25);
1462                     r[i+26]=av.lane(26);
1463                     r[i+27]=av.lane(27);
1464                     r[i+28]=av.lane(28);
1465                     r[i+29]=av.lane(29);
1466                     r[i+30]=av.lane(30);
1467                     r[i+31]=av.lane(31);
1468                 } else if (num_lanes == 64) {
1469                     r[i]=av.lane(0);
1470                     r[i+1]=av.lane(1);
1471                     r[i+2]=av.lane(2);
1472                     r[i+3]=av.lane(3);
1473                     r[i+4]=av.lane(4);
1474                     r[i+5]=av.lane(5);
1475                     r[i+6]=av.lane(6);
1476                     r[i+7]=av.lane(7);
1477                     r[i+8]=av.lane(8);
1478                     r[i+9]=av.lane(9);
1479                     r[i+10]=av.lane(10);
1480                     r[i+11]=av.lane(11);
1481                     r[i+12]=av.lane(12);
1482                     r[i+13]=av.lane(13);
1483                     r[i+14]=av.lane(14);
1484                     r[i+15]=av.lane(15);
1485                     r[i+16]=av.lane(16);
1486                     r[i+17]=av.lane(17);
1487                     r[i+18]=av.lane(18);
1488                     r[i+19]=av.lane(19);
1489                     r[i+20]=av.lane(20);
1490                     r[i+21]=av.lane(21);
1491                     r[i+22]=av.lane(22);
1492                     r[i+23]=av.lane(23);
1493                     r[i+24]=av.lane(24);
1494                     r[i+25]=av.lane(25);
1495                     r[i+26]=av.lane(26);
1496                     r[i+27]=av.lane(27);
1497                     r[i+28]=av.lane(28);
1498                     r[i+29]=av.lane(29);
1499                     r[i+30]=av.lane(30);
1500                     r[i+31]=av.lane(31);
1501                     r[i+32]=av.lane(32);
1502                     r[i+33]=av.lane(33);
1503                     r[i+34]=av.lane(34);
1504                     r[i+35]=av.lane(35);
1505                     r[i+36]=av.lane(36);
1506                     r[i+37]=av.lane(37);
1507                     r[i+38]=av.lane(38);
1508                     r[i+39]=av.lane(39);
1509                     r[i+40]=av.lane(40);
1510                     r[i+41]=av.lane(41);
1511                     r[i+42]=av.lane(42);
1512                     r[i+43]=av.lane(43);
1513                     r[i+44]=av.lane(44);
1514                     r[i+45]=av.lane(45);
1515                     r[i+46]=av.lane(46);
1516                     r[i+47]=av.lane(47);
1517                     r[i+48]=av.lane(48);
1518                     r[i+49]=av.lane(49);
1519                     r[i+50]=av.lane(50);
1520                     r[i+51]=av.lane(51);
1521                     r[i+52]=av.lane(52);
1522                     r[i+53]=av.lane(53);
1523                     r[i+54]=av.lane(54);
1524                     r[i+55]=av.lane(55);
1525                     r[i+56]=av.lane(56);
1526                     r[i+57]=av.lane(57);
1527                     r[i+58]=av.lane(58);
1528                     r[i+59]=av.lane(59);
1529                     r[i+60]=av.lane(60);
1530                     r[i+61]=av.lane(61);
1531                     r[i+62]=av.lane(62);
1532                     r[i+63]=av.lane(63);
1533                 } else {
1534                     for (int j = 0; j < SPECIES.length(); j++) {
1535                         r[i+j]=av.lane(j);
1536                     }
1537                 }
1538             }
1539         }
1540 
1541         assertArraysEquals(a, r, Short256VectorTests::get);
1542     }
1543 
1544 
1545 
1546 
1547 
1548 
1549 
1550 
1551 
1552 
1553 
1554 
1555 


< prev index next >