Lines Matching refs:results_length

255   const unsigned results_length = inputs_length;  in Test1Op()  local
256 Td * results = new Td[results_length]; in Test1Op()
267 for (unsigned d = 0; d < results_length; d++) { in Test1Op()
272 printf("const unsigned kExpectedCount_%s = %u;\n", name, results_length); in Test1Op()
275 VIXL_CHECK(expected_length == results_length); in Test1Op()
370 const unsigned results_length = inputs_length * inputs_length; in Test2Op() local
371 T * results = new T[results_length]; in Test2Op()
381 for (unsigned d = 0; d < results_length; d++) { in Test2Op()
386 printf("const unsigned kExpectedCount_%s = %u;\n", name, results_length); in Test2Op()
389 VIXL_CHECK(expected_length == results_length); in Test2Op()
500 const unsigned results_length = inputs_length * inputs_length * inputs_length; in Test3Op() local
501 T * results = new T[results_length]; in Test3Op()
511 for (unsigned d = 0; d < results_length; d++) { in Test3Op()
516 printf("const unsigned kExpectedCount_%s = %u;\n", name, results_length); in Test3Op()
519 VIXL_CHECK(expected_length == results_length); in Test3Op()
627 const unsigned results_length = inputs_length * inputs_length; in TestCmp() local
628 uint8_t * results = new uint8_t[results_length]; in TestCmp()
638 for (unsigned d = 0; d < results_length; d++) { in TestCmp()
644 printf("const unsigned kExpectedCount_%s = %u;\n", name, results_length); in TestCmp()
647 VIXL_CHECK(expected_length == results_length); in TestCmp()
746 const unsigned results_length = inputs_length; in TestCmpZero() local
747 uint8_t * results = new uint8_t[results_length]; in TestCmpZero()
757 for (unsigned d = 0; d < results_length; d++) { in TestCmpZero()
763 printf("const unsigned kExpectedCount_%s = %u;\n", name, results_length); in TestCmpZero()
766 VIXL_CHECK(expected_length == results_length); in TestCmpZero()
912 const unsigned results_length = inputs_length; in TestFPToS() local
913 Td * results = new Td[results_length]; in TestFPToS()
930 for (unsigned d = 0; d < results_length; d++) { in TestFPToS()
946 printf("const unsigned kExpectedCount_%s = %u;\n", name, results_length); in TestFPToS()
949 VIXL_CHECK(expected_length == results_length); in TestFPToS()
989 const unsigned results_length = inputs_length; in TestFPToU() local
990 Td * results = new Td[results_length]; in TestFPToU()
1002 for (unsigned d = 0; d < results_length; d++) { in TestFPToU()
1006 printf("const unsigned kExpectedCount_%s = %u;\n", name, results_length); in TestFPToU()
1009 VIXL_CHECK(expected_length == results_length); in TestFPToU()
1052 const unsigned results_length = inputs_length * (d_bits + 1); in TestFPToFixedS() local
1053 Td * results = new Td[results_length]; in TestFPToFixedS()
1068 for (unsigned d = 0; d < results_length; d++) { in TestFPToFixedS()
1084 printf("const unsigned kExpectedCount_%s = %u;\n", name, results_length); in TestFPToFixedS()
1087 VIXL_CHECK(expected_length == results_length); in TestFPToFixedS()
1132 const unsigned results_length = inputs_length * (d_bits + 1); in TestFPToFixedU() local
1133 Td * results = new Td[results_length]; in TestFPToFixedU()
1142 for (unsigned d = 0; d < results_length; d++) { in TestFPToFixedU()
1146 printf("const unsigned kExpectedCount_%s = %u;\n", name, results_length); in TestFPToFixedU()
1149 VIXL_CHECK(expected_length == results_length); in TestFPToFixedU()
1278 const unsigned results_length = inputs_n_length; in Test1OpNEON() local
1279 Td* results = new Td[results_length * vd_lane_count]; in Test1OpNEON()
1292 for (unsigned iteration = 0; iteration < results_length; iteration++) { in Test1OpNEON()
1307 results_length); in Test1OpNEON()
1310 VIXL_CHECK(expected_length == results_length); in Test1OpNEON()
1469 const unsigned results_length = inputs_n_length; in Test1OpAcrossNEON() local
1470 Td* results = new Td[results_length * vd_lane_count]; in Test1OpAcrossNEON()
1483 for (unsigned iteration = 0; iteration < results_length; iteration++) { in Test1OpAcrossNEON()
1498 results_length); in Test1OpAcrossNEON()
1501 VIXL_CHECK(expected_length == results_length); in Test1OpAcrossNEON()
1699 const unsigned results_length = inputs_n_length * inputs_m_length; in Test2OpNEON() local
1700 Td* results = new Td[results_length * vd_lane_count]; in Test2OpNEON()
1714 for (unsigned iteration = 0; iteration < results_length; iteration++) { in Test2OpNEON()
1729 results_length); in Test2OpNEON()
1732 VIXL_CHECK(expected_length == results_length); in Test2OpNEON()
1934 const unsigned results_length = inputs_n_length * inputs_m_length * in TestByElementNEON() local
1936 Td* results = new Td[results_length * vd_lane_count]; in TestByElementNEON()
1951 for (unsigned iteration = 0; iteration < results_length; iteration++) { in TestByElementNEON()
1966 results_length); in TestByElementNEON()
1969 VIXL_CHECK(expected_length == results_length); in TestByElementNEON()
2147 const unsigned results_length = inputs_n_length * inputs_m_length; in Test2OpImmNEON() local
2148 Td* results = new Td[results_length * vd_lane_count]; in Test2OpImmNEON()
2161 for (unsigned iteration = 0; iteration < results_length; iteration++) { in Test2OpImmNEON()
2176 results_length); in Test2OpImmNEON()
2179 VIXL_CHECK(expected_length == results_length); in Test2OpImmNEON()
2359 const unsigned results_length = inputs_n_length * in TestOpImmOpImmNEON() local
2362 Td* results = new Td[results_length * vd_lane_count]; in TestOpImmOpImmNEON()
2380 for (unsigned iteration = 0; iteration < results_length; iteration++) { in TestOpImmOpImmNEON()
2395 results_length); in TestOpImmOpImmNEON()
2398 VIXL_CHECK(expected_length == results_length); in TestOpImmOpImmNEON()