Importing rustc-1.52.1
Change-Id: I3598a97301b4b2e71385e5a519f6d2ad946548b6
diff --git a/src/llvm-project/llvm/unittests/Support/ParallelTest.cpp b/src/llvm-project/llvm/unittests/Support/ParallelTest.cpp
index 2283c51..f4bd10b 100644
--- a/src/llvm-project/llvm/unittests/Support/ParallelTest.cpp
+++ b/src/llvm-project/llvm/unittests/Support/ParallelTest.cpp
@@ -49,4 +49,47 @@
ASSERT_EQ(range[2049], 1u);
}
+TEST(Parallel, TransformReduce) {
+ // Sum an empty list, check that it works.
+ auto identity = [](uint32_t v) { return v; };
+ uint32_t sum = parallelTransformReduce(ArrayRef<uint32_t>(), 0U,
+ std::plus<uint32_t>(), identity);
+ EXPECT_EQ(sum, 0U);
+
+ // Sum the lengths of these strings in parallel.
+ const char *strs[] = {"a", "ab", "abc", "abcd", "abcde", "abcdef"};
+ size_t lenSum =
+ parallelTransformReduce(strs, static_cast<size_t>(0), std::plus<size_t>(),
+ [](const char *s) { return strlen(s); });
+ EXPECT_EQ(lenSum, static_cast<size_t>(21));
+
+ // Check that we handle non-divisible task sizes as above.
+ uint32_t range[2050];
+ std::fill(std::begin(range), std::end(range), 1);
+ sum = parallelTransformReduce(range, 0U, std::plus<uint32_t>(), identity);
+ EXPECT_EQ(sum, 2050U);
+
+ std::fill(std::begin(range), std::end(range), 2);
+ sum = parallelTransformReduce(range, 0U, std::plus<uint32_t>(), identity);
+ EXPECT_EQ(sum, 4100U);
+
+ // Avoid one large task.
+ uint32_t range2[3060];
+ std::fill(std::begin(range2), std::end(range2), 1);
+ sum = parallelTransformReduce(range2, 0U, std::plus<uint32_t>(), identity);
+ EXPECT_EQ(sum, 3060U);
+}
+
+TEST(Parallel, ForEachError) {
+ int nums[] = {1, 2, 3, 4, 5, 6};
+ Error e = parallelForEachError(nums, [](int v) -> Error {
+ if ((v & 1) == 0)
+ return createStringError(std::errc::invalid_argument, "asdf");
+ return Error::success();
+ });
+ EXPECT_TRUE(e.isA<ErrorList>());
+ std::string errText = toString(std::move(e));
+ EXPECT_EQ(errText, std::string("asdf\nasdf\nasdf"));
+}
+
#endif
