Lines Matching defs:results_length
327 const unsigned results_length = inputs_length;
328 Td* results = new Td[results_length];
345 for (unsigned d = 0; d < results_length; d++) {
351 printf("const unsigned kExpectedCount_%s = %u;\n", name, results_length);
354 VIXL_CHECK(expected_length == results_length);
481 const unsigned results_length = inputs_length * inputs_length;
482 T* results = new T[results_length];
497 for (unsigned d = 0; d < results_length; d++) {
503 printf("const unsigned kExpectedCount_%s = %u;\n", name, results_length);
506 VIXL_CHECK(expected_length == results_length);
633 const unsigned results_length = inputs_length * inputs_length * inputs_length;
634 T* results = new T[results_length];
649 for (unsigned d = 0; d < results_length; d++) {
655 printf("const unsigned kExpectedCount_%s = %u;\n", name, results_length);
658 VIXL_CHECK(expected_length == results_length);
776 const unsigned results_length = inputs_length * inputs_length;
777 uint8_t* results = new uint8_t[results_length];
792 for (unsigned d = 0; d < results_length; d++) {
798 printf("const unsigned kExpectedCount_%s = %u;\n", name, results_length);
801 VIXL_CHECK(expected_length == results_length);
907 const unsigned results_length = inputs_length;
908 uint8_t* results = new uint8_t[results_length];
923 for (unsigned d = 0; d < results_length; d++) {
929 printf("const unsigned kExpectedCount_%s = %u;\n", name, results_length);
932 VIXL_CHECK(expected_length == results_length);
1118 const unsigned results_length = inputs_length;
1119 Td* results = new Td[results_length];
1142 for (unsigned d = 0; d < results_length; d++) {
1158 printf("const unsigned kExpectedCount_%s = %u;\n", name, results_length);
1161 VIXL_CHECK(expected_length == results_length);
1209 const unsigned results_length = inputs_length;
1210 Td* results = new Td[results_length];
1227 for (unsigned d = 0; d < results_length; d++) {
1231 printf("const unsigned kExpectedCount_%s = %u;\n", name, results_length);
1234 VIXL_CHECK(expected_length == results_length);
1285 const unsigned results_length = inputs_length * (d_bits + 1);
1286 Td* results = new Td[results_length];
1307 for (unsigned d = 0; d < results_length; d++) {
1323 printf("const unsigned kExpectedCount_%s = %u;\n", name, results_length);
1326 VIXL_CHECK(expected_length == results_length);
1381 const unsigned results_length = inputs_length * (d_bits + 1);
1382 Td* results = new Td[results_length];
1397 for (unsigned d = 0; d < results_length; d++) {
1401 printf("const unsigned kExpectedCount_%s = %u;\n", name, results_length);
1404 VIXL_CHECK(expected_length == results_length);
1551 const unsigned results_length = inputs_n_length;
1552 Td* results = new Td[results_length * vd_lane_count];
1569 for (unsigned iteration = 0; iteration < results_length; iteration++) {
1584 results_length);
1587 VIXL_CHECK(expected_length == results_length);
1758 const unsigned results_length = inputs_n_length;
1759 Td* results = new Td[results_length * vd_lanes_per_q];
1776 for (unsigned iteration = 0; iteration < results_length; iteration++) {
1791 results_length);
1794 VIXL_CHECK(expected_length == results_length);
2015 const unsigned results_length = inputs_n_length * inputs_m_length;
2016 Td* results = new Td[results_length * vd_lane_count];
2037 for (unsigned iteration = 0; iteration < results_length; iteration++) {
2052 results_length);
2055 VIXL_CHECK(expected_length == results_length);
2279 const unsigned results_length =
2281 Td* results = new Td[results_length * vd_lane_count];
2305 for (unsigned iteration = 0; iteration < results_length; iteration++) {
2320 results_length);
2323 VIXL_CHECK(expected_length == results_length);
2513 const unsigned results_length = inputs_n_length * inputs_m_length;
2514 Td* results = new Td[results_length * vd_lane_count];
2533 for (unsigned iteration = 0; iteration < results_length; iteration++) {
2548 results_length);
2551 VIXL_CHECK(expected_length == results_length);
2738 const unsigned results_length =
2741 Td* results = new Td[results_length * vd_lane_count];
2763 for (unsigned iteration = 0; iteration < results_length; iteration++) {
2778 results_length);
2781 VIXL_CHECK(expected_length == results_length);