[libc] Reduce the sizes of some math tests that take longest time.

[gchatelet]

Thx @lntue !
Can you document why you picked those values ?

[lntue]

In D151256#4367469, @gchatelet wrote:

Thx @lntue !
Can you document why you picked those values ?

They are actually just some random-ish numbers such that the time it takes for each test is reduced to few seconds on my computer. Maybe I will document the recommended runtime for unit tests when updating the math function page.

[gchatelet]

Ok SGTM

libc/test/src/math/RemQuoTest.h

for (UIntType v = FPBits::MIN_SUBNORMAL, w = FPBits::MAX_SUBNORMAL;
       mpfr::BinaryOutput<T> result;
       mpfr::BinaryInput<T> input{x, y};
       result.f = func(x, y, &result.i);
       ASSERT_MPFR_MATCH(mpfr::Operation::RemQuo, input, result, 0.0);
     }
   }
 
   void testNormalRange(RemQuoFunc func) {
-    constexpr UIntType COUNT = 1000001;
+    constexpr UIntType COUNT = 234561;
     constexpr UIntType STEP = (FPBits::MAX_NORMAL - FPBits::MIN_NORMAL) / COUNT;
     for (UIntType v = FPBits::MIN_NORMAL, w = FPBits::MAX_NORMAL;
          v <= FPBits::MAX_NORMAL && w >= FPBits::MIN_NORMAL;
          v += STEP, w -= STEP) {
       T x = T(FPBits(v)), y = T(FPBits(w));
       mpfr::BinaryOutput<T> result;
       mpfr::BinaryInput<T> input{x, y};
       result.f = func(x, y, &result.i);

libc/test/src/math/SqrtTest.h

void test_denormal_values(SqrtFunc func) {
     constexpr UIntType STEP = HIDDEN_BIT / COUNT;
     for (UIntType i = 0, v = 0; i <= COUNT; ++i, v += STEP) {
       T x = __llvm_libc::cpp::bit_cast<T>(v);
       test_all_rounding_modes(func, x);
     }
   }
 
   void test_normal_range(SqrtFunc func) {
-    constexpr UIntType COUNT = 10'000'001;
+    constexpr UIntType COUNT = 1'234'561;
     constexpr UIntType STEP = UIntType(-1) / COUNT;
     for (UIntType i = 0, v = 0; i <= COUNT; ++i, v += STEP) {
       T x = __llvm_libc::cpp::bit_cast<T>(v);
       if (isnan(x) || (x < 0)) {
         continue;
       }
       test_all_rounding_modes(func, x);
     }

libc/test/src/math/asinhf_test.cpp

TEST(LlvmLibcAsinhfTest, SpecialNumbers) {
   EXPECT_FP_EQ(inf, __llvm_libc::asinhf(inf));
   EXPECT_MATH_ERRNO(0);
 
   EXPECT_FP_EQ(neg_inf, __llvm_libc::asinhf(neg_inf));
   EXPECT_MATH_ERRNO(0);
 }
 
 TEST(LlvmLibcAsinhfTest, InFloatRange) {
-  constexpr uint32_t COUNT = 1000000;
+  constexpr uint32_t COUNT = 234561;
   constexpr uint32_t STEP = UINT32_MAX / COUNT;
   for (uint32_t i = 0, v = 0; i <= COUNT; ++i, v += STEP) {
     float x = float(FPBits_t(v));
     if (isnan(x) || isinf(x))
       continue;
     ASSERT_MPFR_MATCH_ALL_ROUNDING(mpfr::Operation::Asinh, x,
                                    __llvm_libc::asinhf(x), 0.5);
     ASSERT_MPFR_MATCH_ALL_ROUNDING(mpfr::Operation::Asinh, -x,

libc/test/src/math/log10_test.cpp

TEST(LlvmLibcLog10Test, AllExponents) {
   double x = 0x1.0p-1074;
   for (int i = -1074; i < 1024; ++i, x *= 2.0) {
     ASSERT_MPFR_MATCH_ALL_ROUNDING(mpfr::Operation::Log10, x,
                                    __llvm_libc::log10(x), 0.5);
   }
 }
 
 TEST(LlvmLibcLog10Test, InDoubleRange) {
-  constexpr uint64_t COUNT = 1234561;
+  constexpr uint64_t COUNT = 234561;
   constexpr uint64_t START = 0x3FD0'0000'0000'0000ULL; // 0.25
   constexpr uint64_t STOP = 0x4010'0000'0000'0000ULL;  // 4.0
   // constexpr uint64_t START = 0x3FF0'0000'0000'0000ULL;  // 1.0
   // constexpr uint64_t STOP = 0x4000'0000'0000'0000ULL;   // 2.0
   constexpr uint64_t STEP = (STOP - START) / COUNT;
 
   auto test = [&](mpfr::RoundingMode rounding_mode) {
     mpfr::ForceRoundingMode __r(rounding_mode);

libc/test/src/math/log1p_test.cpp

TEST(LlvmLibcLog1pTest, AllExponents) {
   double x = 0x1.0p-1074;
   for (int i = -1074; i < 1024; ++i, x *= 2.0) {
     ASSERT_MPFR_MATCH_ALL_ROUNDING(mpfr::Operation::Log1p, x,
                                    __llvm_libc::log1p(x), 0.5);
   }
 }
 
 TEST(LlvmLibcLog1pTest, InDoubleRange) {
-  constexpr uint64_t COUNT = 1234561;
+  constexpr uint64_t COUNT = 234561;
 
   auto test = [&](uint64_t start, uint64_t stop,
                   mpfr::RoundingMode rounding_mode) {
     mpfr::ForceRoundingMode __r(rounding_mode);
     uint64_t fails = 0;
     uint64_t count = 0;
     uint64_t cc = 0;
     double mx, mr = 0.0;

libc/test/src/math/log2_test.cpp

TEST(LlvmLibcLog2Test, AllExponents) {
   double x = 0x1.0p-1074;
   for (int i = -1074; i < 1024; ++i, x *= 2.0) {
     ASSERT_MPFR_MATCH_ALL_ROUNDING(mpfr::Operation::Log2, x,
                                    __llvm_libc::log2(x), 0.5);
   }
 }
 
 TEST(LlvmLibcLog2Test, InDoubleRange) {
-  constexpr uint64_t COUNT = 1234561;
+  constexpr uint64_t COUNT = 234561;
   constexpr uint64_t START = 0x3FD0'0000'0000'0000ULL; // 0.25
   constexpr uint64_t STOP = 0x4010'0000'0000'0000ULL;  // 4.0
   // constexpr uint64_t START = 0x3FF0'0000'0000'0000ULL;  // 1.0
   // constexpr uint64_t STOP = 0x4000'0000'0000'0000ULL;   // 2.0
   constexpr uint64_t STEP = (STOP - START) / COUNT;
 
   auto test = [&](mpfr::RoundingMode rounding_mode) {
     mpfr::ForceRoundingMode __r(rounding_mode);

libc/test/src/math/log_test.cpp

TEST(LlvmLibcLogTest, AllExponents) {
   double x = 0x1.0p-1074;
   for (int i = -1074; i < 1024; ++i, x *= 2.0) {
     ASSERT_MPFR_MATCH_ALL_ROUNDING(mpfr::Operation::Log, x, __llvm_libc::log(x),
                                    0.5);
   }
 }
 
 TEST(LlvmLibcLogTest, InDoubleRange) {
-  constexpr uint64_t COUNT = 1234561;
+  constexpr uint64_t COUNT = 234561;
   constexpr uint64_t START = 0x3FD0'0000'0000'0000ULL; // 0.25
   constexpr uint64_t STOP = 0x4010'0000'0000'0000ULL;  // 4.0
   // constexpr uint64_t START = 0x3FF0'0000'0000'0000ULL;  // 1.0
   // constexpr uint64_t STOP = 0x4000'0000'0000'0000ULL;   // 2.0
   constexpr uint64_t STEP = (STOP - START) / COUNT;
 
   auto test = [&](mpfr::RoundingMode rounding_mode) {
     mpfr::ForceRoundingMode __r(rounding_mode);

libc/test/src/math/sincosf_test.cpp

#define EXPECT_SINCOS_MATCH_ALL_ROUNDING(input)                                \
     __llvm_libc::sincosf(input, &sin, &cos);                                   \
     EXPECT_MPFR_MATCH(mpfr::Operation::Sin, input, sin, 0.5,                   \
                       mpfr::RoundingMode::TowardZero);                         \
     EXPECT_MPFR_MATCH(mpfr::Operation::Cos, input, cos, 0.5,                   \
                       mpfr::RoundingMode::TowardZero);                         \
   }
 
 TEST(LlvmLibcSinCosfTest, InFloatRange) {
-  constexpr uint32_t COUNT = 1000000;
+  constexpr uint32_t COUNT = 234561;
   constexpr uint32_t STEP = UINT32_MAX / COUNT;
   for (uint32_t i = 0, v = 0; i <= COUNT; ++i, v += STEP) {
     float x = float(FPBits((v)));
     if (isnan(x) || isinf(x))
       continue;
 
     EXPECT_SINCOS_MATCH_ALL_ROUNDING(x);
     EXPECT_SINCOS_MATCH_ALL_ROUNDING(-x);