mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-19 02:52:53 +02:00
6064535152
Essentially takes the lld/Common/Threads.h wrappers and moves them to the llvm/Support/Paralle.h algorithm header. The changes are: - Remove policy parameter, since all clients use `par`. - Rename the methods to `parallelSort` etc to match LLVM style, since they are no longer C++17 pstl compatible. - Move algorithms from llvm::parallel:: to llvm::, since they have "parallel" in the name and are no longer overloads of the regular algorithms. - Add range overloads - Use the sequential algorithm directly when 1 thread is requested (skips task grouping) - Fix the index type of parallelForEachN to size_t. Nobody in LLVM was using any other parameter, and it made overload resolution hard for for_each_n(par, 0, foo.size(), ...) because 0 is int, not size_t. Remove Threads.h and update LLD for that. This is a prerequisite for parallel public symbol processing in the PDB library, which is in LLVM. Reviewed By: MaskRay, aganea Differential Revision: https://reviews.llvm.org/D79390
53 lines
1.5 KiB
C++
53 lines
1.5 KiB
C++
//===- llvm/unittest/Support/ParallelTest.cpp -----------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
///
|
|
/// \file
|
|
/// Parallel.h unit tests.
|
|
///
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/Support/Parallel.h"
|
|
#include "gtest/gtest.h"
|
|
#include <array>
|
|
#include <random>
|
|
|
|
uint32_t array[1024 * 1024];
|
|
|
|
using namespace llvm;
|
|
|
|
// Tests below are hanging up on mingw. Investigating.
|
|
#if !defined(__MINGW32__)
|
|
|
|
TEST(Parallel, sort) {
|
|
std::mt19937 randEngine;
|
|
std::uniform_int_distribution<uint32_t> dist;
|
|
|
|
for (auto &i : array)
|
|
i = dist(randEngine);
|
|
|
|
parallelSort(std::begin(array), std::end(array));
|
|
ASSERT_TRUE(llvm::is_sorted(array));
|
|
}
|
|
|
|
TEST(Parallel, parallel_for) {
|
|
// We need to test the case with a TaskSize > 1. We are white-box testing
|
|
// here. The TaskSize is calculated as (End - Begin) / 1024 at the time of
|
|
// writing.
|
|
uint32_t range[2050];
|
|
std::fill(range, range + 2050, 1);
|
|
parallelForEachN(0, 2049, [&range](size_t I) { ++range[I]; });
|
|
|
|
uint32_t expected[2049];
|
|
std::fill(expected, expected + 2049, 2);
|
|
ASSERT_TRUE(std::equal(range, range + 2049, expected));
|
|
// Check that we don't write past the end of the requested range.
|
|
ASSERT_EQ(range[2049], 1u);
|
|
}
|
|
|
|
#endif
|