1367 av.with(0, (long)4).intoArray(r, i);
1368 }
1369 }
1370
1371 assertInsertArraysEquals(a, r, (long)4, 0);
1372 }
1373
1374 @Test(dataProvider = "longCompareOpProvider")
1375 static void lessThanLong512VectorTests(IntFunction<long[]> fa, IntFunction<long[]> fb) {
1376 long[] a = fa.apply(SPECIES.length());
1377 long[] b = fb.apply(SPECIES.length());
1378
1379 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1380 for (int i = 0; i < a.length; i += SPECIES.length()) {
1381 LongVector av = LongVector.fromArray(SPECIES, a, i);
1382 LongVector bv = LongVector.fromArray(SPECIES, b, i);
1383 VectorMask<Long> mv = av.lessThan(bv);
1384
1385 // Check results as part of computation.
1386 for (int j = 0; j < SPECIES.length(); j++) {
1387 Assert.assertEquals(mv.getElement(j), a[i + j] < b[i + j]);
1388 }
1389 }
1390 }
1391 }
1392
1393
1394 @Test(dataProvider = "longCompareOpProvider")
1395 static void greaterThanLong512VectorTests(IntFunction<long[]> fa, IntFunction<long[]> fb) {
1396 long[] a = fa.apply(SPECIES.length());
1397 long[] b = fb.apply(SPECIES.length());
1398
1399 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1400 for (int i = 0; i < a.length; i += SPECIES.length()) {
1401 LongVector av = LongVector.fromArray(SPECIES, a, i);
1402 LongVector bv = LongVector.fromArray(SPECIES, b, i);
1403 VectorMask<Long> mv = av.greaterThan(bv);
1404
1405 // Check results as part of computation.
1406 for (int j = 0; j < SPECIES.length(); j++) {
1407 Assert.assertEquals(mv.getElement(j), a[i + j] > b[i + j]);
1408 }
1409 }
1410 }
1411 }
1412
1413
1414 @Test(dataProvider = "longCompareOpProvider")
1415 static void equalLong512VectorTests(IntFunction<long[]> fa, IntFunction<long[]> fb) {
1416 long[] a = fa.apply(SPECIES.length());
1417 long[] b = fb.apply(SPECIES.length());
1418
1419 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1420 for (int i = 0; i < a.length; i += SPECIES.length()) {
1421 LongVector av = LongVector.fromArray(SPECIES, a, i);
1422 LongVector bv = LongVector.fromArray(SPECIES, b, i);
1423 VectorMask<Long> mv = av.equal(bv);
1424
1425 // Check results as part of computation.
1426 for (int j = 0; j < SPECIES.length(); j++) {
1427 Assert.assertEquals(mv.getElement(j), a[i + j] == b[i + j]);
1428 }
1429 }
1430 }
1431 }
1432
1433
1434 @Test(dataProvider = "longCompareOpProvider")
1435 static void notEqualLong512VectorTests(IntFunction<long[]> fa, IntFunction<long[]> fb) {
1436 long[] a = fa.apply(SPECIES.length());
1437 long[] b = fb.apply(SPECIES.length());
1438
1439 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1440 for (int i = 0; i < a.length; i += SPECIES.length()) {
1441 LongVector av = LongVector.fromArray(SPECIES, a, i);
1442 LongVector bv = LongVector.fromArray(SPECIES, b, i);
1443 VectorMask<Long> mv = av.notEqual(bv);
1444
1445 // Check results as part of computation.
1446 for (int j = 0; j < SPECIES.length(); j++) {
1447 Assert.assertEquals(mv.getElement(j), a[i + j] != b[i + j]);
1448 }
1449 }
1450 }
1451 }
1452
1453
1454 @Test(dataProvider = "longCompareOpProvider")
1455 static void lessThanEqLong512VectorTests(IntFunction<long[]> fa, IntFunction<long[]> fb) {
1456 long[] a = fa.apply(SPECIES.length());
1457 long[] b = fb.apply(SPECIES.length());
1458
1459 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1460 for (int i = 0; i < a.length; i += SPECIES.length()) {
1461 LongVector av = LongVector.fromArray(SPECIES, a, i);
1462 LongVector bv = LongVector.fromArray(SPECIES, b, i);
1463 VectorMask<Long> mv = av.lessThanEq(bv);
1464
1465 // Check results as part of computation.
1466 for (int j = 0; j < SPECIES.length(); j++) {
1467 Assert.assertEquals(mv.getElement(j), a[i + j] <= b[i + j]);
1468 }
1469 }
1470 }
1471 }
1472
1473
1474 @Test(dataProvider = "longCompareOpProvider")
1475 static void greaterThanEqLong512VectorTests(IntFunction<long[]> fa, IntFunction<long[]> fb) {
1476 long[] a = fa.apply(SPECIES.length());
1477 long[] b = fb.apply(SPECIES.length());
1478
1479 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1480 for (int i = 0; i < a.length; i += SPECIES.length()) {
1481 LongVector av = LongVector.fromArray(SPECIES, a, i);
1482 LongVector bv = LongVector.fromArray(SPECIES, b, i);
1483 VectorMask<Long> mv = av.greaterThanEq(bv);
1484
1485 // Check results as part of computation.
1486 for (int j = 0; j < SPECIES.length(); j++) {
1487 Assert.assertEquals(mv.getElement(j), a[i + j] >= b[i + j]);
1488 }
1489 }
1490 }
1491 }
1492
1493
1494 static long blend(long a, long b, boolean mask) {
1495 return mask ? b : a;
1496 }
1497
1498 @Test(dataProvider = "longBinaryOpMaskProvider")
1499 static void blendLong512VectorTests(IntFunction<long[]> fa, IntFunction<long[]> fb,
1500 IntFunction<boolean[]> fm) {
1501 long[] a = fa.apply(SPECIES.length());
1502 long[] b = fb.apply(SPECIES.length());
1503 long[] r = fr.apply(SPECIES.length());
1504 boolean[] mask = fm.apply(SPECIES.length());
1505 VectorMask<Long> vmask = VectorMask.fromValues(SPECIES, mask);
1506
1507 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1530 }
1531
1532 assertRearrangeArraysEquals(a, r, order, SPECIES.length());
1533 }
1534
1535
1536
1537
1538 @Test(dataProvider = "longUnaryOpProvider")
1539 static void getLong512VectorTests(IntFunction<long[]> fa) {
1540 long[] a = fa.apply(SPECIES.length());
1541 long[] r = fr.apply(SPECIES.length());
1542
1543 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1544 for (int i = 0; i < a.length; i += SPECIES.length()) {
1545 LongVector av = LongVector.fromArray(SPECIES, a, i);
1546 int num_lanes = SPECIES.length();
1547 // Manually unroll because full unroll happens after intrinsification.
1548 // Unroll is needed because get intrinsic requires for index to be a known constant.
1549 if (num_lanes == 1) {
1550 r[i]=av.get(0);
1551 } else if (num_lanes == 2) {
1552 r[i]=av.get(0);
1553 r[i+1]=av.get(1);
1554 } else if (num_lanes == 4) {
1555 r[i]=av.get(0);
1556 r[i+1]=av.get(1);
1557 r[i+2]=av.get(2);
1558 r[i+3]=av.get(3);
1559 } else if (num_lanes == 8) {
1560 r[i]=av.get(0);
1561 r[i+1]=av.get(1);
1562 r[i+2]=av.get(2);
1563 r[i+3]=av.get(3);
1564 r[i+4]=av.get(4);
1565 r[i+5]=av.get(5);
1566 r[i+6]=av.get(6);
1567 r[i+7]=av.get(7);
1568 } else if (num_lanes == 16) {
1569 r[i]=av.get(0);
1570 r[i+1]=av.get(1);
1571 r[i+2]=av.get(2);
1572 r[i+3]=av.get(3);
1573 r[i+4]=av.get(4);
1574 r[i+5]=av.get(5);
1575 r[i+6]=av.get(6);
1576 r[i+7]=av.get(7);
1577 r[i+8]=av.get(8);
1578 r[i+9]=av.get(9);
1579 r[i+10]=av.get(10);
1580 r[i+11]=av.get(11);
1581 r[i+12]=av.get(12);
1582 r[i+13]=av.get(13);
1583 r[i+14]=av.get(14);
1584 r[i+15]=av.get(15);
1585 } else if (num_lanes == 32) {
1586 r[i]=av.get(0);
1587 r[i+1]=av.get(1);
1588 r[i+2]=av.get(2);
1589 r[i+3]=av.get(3);
1590 r[i+4]=av.get(4);
1591 r[i+5]=av.get(5);
1592 r[i+6]=av.get(6);
1593 r[i+7]=av.get(7);
1594 r[i+8]=av.get(8);
1595 r[i+9]=av.get(9);
1596 r[i+10]=av.get(10);
1597 r[i+11]=av.get(11);
1598 r[i+12]=av.get(12);
1599 r[i+13]=av.get(13);
1600 r[i+14]=av.get(14);
1601 r[i+15]=av.get(15);
1602 r[i+16]=av.get(16);
1603 r[i+17]=av.get(17);
1604 r[i+18]=av.get(18);
1605 r[i+19]=av.get(19);
1606 r[i+20]=av.get(20);
1607 r[i+21]=av.get(21);
1608 r[i+22]=av.get(22);
1609 r[i+23]=av.get(23);
1610 r[i+24]=av.get(24);
1611 r[i+25]=av.get(25);
1612 r[i+26]=av.get(26);
1613 r[i+27]=av.get(27);
1614 r[i+28]=av.get(28);
1615 r[i+29]=av.get(29);
1616 r[i+30]=av.get(30);
1617 r[i+31]=av.get(31);
1618 } else if (num_lanes == 64) {
1619 r[i]=av.get(0);
1620 r[i+1]=av.get(1);
1621 r[i+2]=av.get(2);
1622 r[i+3]=av.get(3);
1623 r[i+4]=av.get(4);
1624 r[i+5]=av.get(5);
1625 r[i+6]=av.get(6);
1626 r[i+7]=av.get(7);
1627 r[i+8]=av.get(8);
1628 r[i+9]=av.get(9);
1629 r[i+10]=av.get(10);
1630 r[i+11]=av.get(11);
1631 r[i+12]=av.get(12);
1632 r[i+13]=av.get(13);
1633 r[i+14]=av.get(14);
1634 r[i+15]=av.get(15);
1635 r[i+16]=av.get(16);
1636 r[i+17]=av.get(17);
1637 r[i+18]=av.get(18);
1638 r[i+19]=av.get(19);
1639 r[i+20]=av.get(20);
1640 r[i+21]=av.get(21);
1641 r[i+22]=av.get(22);
1642 r[i+23]=av.get(23);
1643 r[i+24]=av.get(24);
1644 r[i+25]=av.get(25);
1645 r[i+26]=av.get(26);
1646 r[i+27]=av.get(27);
1647 r[i+28]=av.get(28);
1648 r[i+29]=av.get(29);
1649 r[i+30]=av.get(30);
1650 r[i+31]=av.get(31);
1651 r[i+32]=av.get(32);
1652 r[i+33]=av.get(33);
1653 r[i+34]=av.get(34);
1654 r[i+35]=av.get(35);
1655 r[i+36]=av.get(36);
1656 r[i+37]=av.get(37);
1657 r[i+38]=av.get(38);
1658 r[i+39]=av.get(39);
1659 r[i+40]=av.get(40);
1660 r[i+41]=av.get(41);
1661 r[i+42]=av.get(42);
1662 r[i+43]=av.get(43);
1663 r[i+44]=av.get(44);
1664 r[i+45]=av.get(45);
1665 r[i+46]=av.get(46);
1666 r[i+47]=av.get(47);
1667 r[i+48]=av.get(48);
1668 r[i+49]=av.get(49);
1669 r[i+50]=av.get(50);
1670 r[i+51]=av.get(51);
1671 r[i+52]=av.get(52);
1672 r[i+53]=av.get(53);
1673 r[i+54]=av.get(54);
1674 r[i+55]=av.get(55);
1675 r[i+56]=av.get(56);
1676 r[i+57]=av.get(57);
1677 r[i+58]=av.get(58);
1678 r[i+59]=av.get(59);
1679 r[i+60]=av.get(60);
1680 r[i+61]=av.get(61);
1681 r[i+62]=av.get(62);
1682 r[i+63]=av.get(63);
1683 } else {
1684 for (int j = 0; j < SPECIES.length(); j++) {
1685 r[i+j]=av.get(j);
1686 }
1687 }
1688 }
1689 }
1690
1691 assertArraysEquals(a, r, Long512VectorTests::get);
1692 }
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
|
1367 av.with(0, (long)4).intoArray(r, i);
1368 }
1369 }
1370
1371 assertInsertArraysEquals(a, r, (long)4, 0);
1372 }
1373
1374 @Test(dataProvider = "longCompareOpProvider")
1375 static void lessThanLong512VectorTests(IntFunction<long[]> fa, IntFunction<long[]> fb) {
1376 long[] a = fa.apply(SPECIES.length());
1377 long[] b = fb.apply(SPECIES.length());
1378
1379 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1380 for (int i = 0; i < a.length; i += SPECIES.length()) {
1381 LongVector av = LongVector.fromArray(SPECIES, a, i);
1382 LongVector bv = LongVector.fromArray(SPECIES, b, i);
1383 VectorMask<Long> mv = av.lessThan(bv);
1384
1385 // Check results as part of computation.
1386 for (int j = 0; j < SPECIES.length(); j++) {
1387 Assert.assertEquals(mv.lane(j), a[i + j] < b[i + j]);
1388 }
1389 }
1390 }
1391 }
1392
1393
1394 @Test(dataProvider = "longCompareOpProvider")
1395 static void greaterThanLong512VectorTests(IntFunction<long[]> fa, IntFunction<long[]> fb) {
1396 long[] a = fa.apply(SPECIES.length());
1397 long[] b = fb.apply(SPECIES.length());
1398
1399 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1400 for (int i = 0; i < a.length; i += SPECIES.length()) {
1401 LongVector av = LongVector.fromArray(SPECIES, a, i);
1402 LongVector bv = LongVector.fromArray(SPECIES, b, i);
1403 VectorMask<Long> mv = av.greaterThan(bv);
1404
1405 // Check results as part of computation.
1406 for (int j = 0; j < SPECIES.length(); j++) {
1407 Assert.assertEquals(mv.lane(j), a[i + j] > b[i + j]);
1408 }
1409 }
1410 }
1411 }
1412
1413
1414 @Test(dataProvider = "longCompareOpProvider")
1415 static void equalLong512VectorTests(IntFunction<long[]> fa, IntFunction<long[]> fb) {
1416 long[] a = fa.apply(SPECIES.length());
1417 long[] b = fb.apply(SPECIES.length());
1418
1419 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1420 for (int i = 0; i < a.length; i += SPECIES.length()) {
1421 LongVector av = LongVector.fromArray(SPECIES, a, i);
1422 LongVector bv = LongVector.fromArray(SPECIES, b, i);
1423 VectorMask<Long> mv = av.equal(bv);
1424
1425 // Check results as part of computation.
1426 for (int j = 0; j < SPECIES.length(); j++) {
1427 Assert.assertEquals(mv.lane(j), a[i + j] == b[i + j]);
1428 }
1429 }
1430 }
1431 }
1432
1433
1434 @Test(dataProvider = "longCompareOpProvider")
1435 static void notEqualLong512VectorTests(IntFunction<long[]> fa, IntFunction<long[]> fb) {
1436 long[] a = fa.apply(SPECIES.length());
1437 long[] b = fb.apply(SPECIES.length());
1438
1439 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1440 for (int i = 0; i < a.length; i += SPECIES.length()) {
1441 LongVector av = LongVector.fromArray(SPECIES, a, i);
1442 LongVector bv = LongVector.fromArray(SPECIES, b, i);
1443 VectorMask<Long> mv = av.notEqual(bv);
1444
1445 // Check results as part of computation.
1446 for (int j = 0; j < SPECIES.length(); j++) {
1447 Assert.assertEquals(mv.lane(j), a[i + j] != b[i + j]);
1448 }
1449 }
1450 }
1451 }
1452
1453
1454 @Test(dataProvider = "longCompareOpProvider")
1455 static void lessThanEqLong512VectorTests(IntFunction<long[]> fa, IntFunction<long[]> fb) {
1456 long[] a = fa.apply(SPECIES.length());
1457 long[] b = fb.apply(SPECIES.length());
1458
1459 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1460 for (int i = 0; i < a.length; i += SPECIES.length()) {
1461 LongVector av = LongVector.fromArray(SPECIES, a, i);
1462 LongVector bv = LongVector.fromArray(SPECIES, b, i);
1463 VectorMask<Long> mv = av.lessThanEq(bv);
1464
1465 // Check results as part of computation.
1466 for (int j = 0; j < SPECIES.length(); j++) {
1467 Assert.assertEquals(mv.lane(j), a[i + j] <= b[i + j]);
1468 }
1469 }
1470 }
1471 }
1472
1473
1474 @Test(dataProvider = "longCompareOpProvider")
1475 static void greaterThanEqLong512VectorTests(IntFunction<long[]> fa, IntFunction<long[]> fb) {
1476 long[] a = fa.apply(SPECIES.length());
1477 long[] b = fb.apply(SPECIES.length());
1478
1479 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1480 for (int i = 0; i < a.length; i += SPECIES.length()) {
1481 LongVector av = LongVector.fromArray(SPECIES, a, i);
1482 LongVector bv = LongVector.fromArray(SPECIES, b, i);
1483 VectorMask<Long> mv = av.greaterThanEq(bv);
1484
1485 // Check results as part of computation.
1486 for (int j = 0; j < SPECIES.length(); j++) {
1487 Assert.assertEquals(mv.lane(j), a[i + j] >= b[i + j]);
1488 }
1489 }
1490 }
1491 }
1492
1493
1494 static long blend(long a, long b, boolean mask) {
1495 return mask ? b : a;
1496 }
1497
1498 @Test(dataProvider = "longBinaryOpMaskProvider")
1499 static void blendLong512VectorTests(IntFunction<long[]> fa, IntFunction<long[]> fb,
1500 IntFunction<boolean[]> fm) {
1501 long[] a = fa.apply(SPECIES.length());
1502 long[] b = fb.apply(SPECIES.length());
1503 long[] r = fr.apply(SPECIES.length());
1504 boolean[] mask = fm.apply(SPECIES.length());
1505 VectorMask<Long> vmask = VectorMask.fromValues(SPECIES, mask);
1506
1507 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1530 }
1531
1532 assertRearrangeArraysEquals(a, r, order, SPECIES.length());
1533 }
1534
1535
1536
1537
1538 @Test(dataProvider = "longUnaryOpProvider")
1539 static void getLong512VectorTests(IntFunction<long[]> fa) {
1540 long[] a = fa.apply(SPECIES.length());
1541 long[] r = fr.apply(SPECIES.length());
1542
1543 for (int ic = 0; ic < INVOC_COUNT; ic++) {
1544 for (int i = 0; i < a.length; i += SPECIES.length()) {
1545 LongVector av = LongVector.fromArray(SPECIES, a, i);
1546 int num_lanes = SPECIES.length();
1547 // Manually unroll because full unroll happens after intrinsification.
1548 // Unroll is needed because get intrinsic requires for index to be a known constant.
1549 if (num_lanes == 1) {
1550 r[i]=av.lane(0);
1551 } else if (num_lanes == 2) {
1552 r[i]=av.lane(0);
1553 r[i+1]=av.lane(1);
1554 } else if (num_lanes == 4) {
1555 r[i]=av.lane(0);
1556 r[i+1]=av.lane(1);
1557 r[i+2]=av.lane(2);
1558 r[i+3]=av.lane(3);
1559 } else if (num_lanes == 8) {
1560 r[i]=av.lane(0);
1561 r[i+1]=av.lane(1);
1562 r[i+2]=av.lane(2);
1563 r[i+3]=av.lane(3);
1564 r[i+4]=av.lane(4);
1565 r[i+5]=av.lane(5);
1566 r[i+6]=av.lane(6);
1567 r[i+7]=av.lane(7);
1568 } else if (num_lanes == 16) {
1569 r[i]=av.lane(0);
1570 r[i+1]=av.lane(1);
1571 r[i+2]=av.lane(2);
1572 r[i+3]=av.lane(3);
1573 r[i+4]=av.lane(4);
1574 r[i+5]=av.lane(5);
1575 r[i+6]=av.lane(6);
1576 r[i+7]=av.lane(7);
1577 r[i+8]=av.lane(8);
1578 r[i+9]=av.lane(9);
1579 r[i+10]=av.lane(10);
1580 r[i+11]=av.lane(11);
1581 r[i+12]=av.lane(12);
1582 r[i+13]=av.lane(13);
1583 r[i+14]=av.lane(14);
1584 r[i+15]=av.lane(15);
1585 } else if (num_lanes == 32) {
1586 r[i]=av.lane(0);
1587 r[i+1]=av.lane(1);
1588 r[i+2]=av.lane(2);
1589 r[i+3]=av.lane(3);
1590 r[i+4]=av.lane(4);
1591 r[i+5]=av.lane(5);
1592 r[i+6]=av.lane(6);
1593 r[i+7]=av.lane(7);
1594 r[i+8]=av.lane(8);
1595 r[i+9]=av.lane(9);
1596 r[i+10]=av.lane(10);
1597 r[i+11]=av.lane(11);
1598 r[i+12]=av.lane(12);
1599 r[i+13]=av.lane(13);
1600 r[i+14]=av.lane(14);
1601 r[i+15]=av.lane(15);
1602 r[i+16]=av.lane(16);
1603 r[i+17]=av.lane(17);
1604 r[i+18]=av.lane(18);
1605 r[i+19]=av.lane(19);
1606 r[i+20]=av.lane(20);
1607 r[i+21]=av.lane(21);
1608 r[i+22]=av.lane(22);
1609 r[i+23]=av.lane(23);
1610 r[i+24]=av.lane(24);
1611 r[i+25]=av.lane(25);
1612 r[i+26]=av.lane(26);
1613 r[i+27]=av.lane(27);
1614 r[i+28]=av.lane(28);
1615 r[i+29]=av.lane(29);
1616 r[i+30]=av.lane(30);
1617 r[i+31]=av.lane(31);
1618 } else if (num_lanes == 64) {
1619 r[i]=av.lane(0);
1620 r[i+1]=av.lane(1);
1621 r[i+2]=av.lane(2);
1622 r[i+3]=av.lane(3);
1623 r[i+4]=av.lane(4);
1624 r[i+5]=av.lane(5);
1625 r[i+6]=av.lane(6);
1626 r[i+7]=av.lane(7);
1627 r[i+8]=av.lane(8);
1628 r[i+9]=av.lane(9);
1629 r[i+10]=av.lane(10);
1630 r[i+11]=av.lane(11);
1631 r[i+12]=av.lane(12);
1632 r[i+13]=av.lane(13);
1633 r[i+14]=av.lane(14);
1634 r[i+15]=av.lane(15);
1635 r[i+16]=av.lane(16);
1636 r[i+17]=av.lane(17);
1637 r[i+18]=av.lane(18);
1638 r[i+19]=av.lane(19);
1639 r[i+20]=av.lane(20);
1640 r[i+21]=av.lane(21);
1641 r[i+22]=av.lane(22);
1642 r[i+23]=av.lane(23);
1643 r[i+24]=av.lane(24);
1644 r[i+25]=av.lane(25);
1645 r[i+26]=av.lane(26);
1646 r[i+27]=av.lane(27);
1647 r[i+28]=av.lane(28);
1648 r[i+29]=av.lane(29);
1649 r[i+30]=av.lane(30);
1650 r[i+31]=av.lane(31);
1651 r[i+32]=av.lane(32);
1652 r[i+33]=av.lane(33);
1653 r[i+34]=av.lane(34);
1654 r[i+35]=av.lane(35);
1655 r[i+36]=av.lane(36);
1656 r[i+37]=av.lane(37);
1657 r[i+38]=av.lane(38);
1658 r[i+39]=av.lane(39);
1659 r[i+40]=av.lane(40);
1660 r[i+41]=av.lane(41);
1661 r[i+42]=av.lane(42);
1662 r[i+43]=av.lane(43);
1663 r[i+44]=av.lane(44);
1664 r[i+45]=av.lane(45);
1665 r[i+46]=av.lane(46);
1666 r[i+47]=av.lane(47);
1667 r[i+48]=av.lane(48);
1668 r[i+49]=av.lane(49);
1669 r[i+50]=av.lane(50);
1670 r[i+51]=av.lane(51);
1671 r[i+52]=av.lane(52);
1672 r[i+53]=av.lane(53);
1673 r[i+54]=av.lane(54);
1674 r[i+55]=av.lane(55);
1675 r[i+56]=av.lane(56);
1676 r[i+57]=av.lane(57);
1677 r[i+58]=av.lane(58);
1678 r[i+59]=av.lane(59);
1679 r[i+60]=av.lane(60);
1680 r[i+61]=av.lane(61);
1681 r[i+62]=av.lane(62);
1682 r[i+63]=av.lane(63);
1683 } else {
1684 for (int j = 0; j < SPECIES.length(); j++) {
1685 r[i+j]=av.lane(j);
1686 }
1687 }
1688 }
1689 }
1690
1691 assertArraysEquals(a, r, Long512VectorTests::get);
1692 }
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
|