mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-22 18:54:02 +01:00
[ProfileData] Change std::sort to llvm::sort in response to r327219
Summary: r327219 added wrappers to std::sort which randomly shuffle the container before sorting. This will help in uncovering non-determinism caused due to undefined sorting order of objects having the same key. To make use of that infrastructure we need to invoke llvm::sort instead of std::sort. Note: This patch is one of a series of patches to replace *all* std::sort to llvm::sort. Refer the comments section in D44363 for a list of all the required patches. Reviewers: bogner, vsk, eraman, ruiu Reviewed By: ruiu Subscribers: ruiu, llvm-commits Differential Revision: https://reviews.llvm.org/D45139 llvm-svn: 330057
This commit is contained in:
parent
505b757968
commit
28496b1621
@ -83,7 +83,7 @@ Counter CounterExpressionBuilder::simplify(Counter ExpressionTree) {
|
||||
return Counter::getZero();
|
||||
|
||||
// Group the terms by counter ID.
|
||||
std::sort(Terms.begin(), Terms.end(), [](const Term &LHS, const Term &RHS) {
|
||||
llvm::sort(Terms.begin(), Terms.end(), [](const Term &LHS, const Term &RHS) {
|
||||
return LHS.CounterID < RHS.CounterID;
|
||||
});
|
||||
|
||||
@ -457,8 +457,8 @@ class SegmentBuilder {
|
||||
|
||||
/// Sort a nested sequence of regions from a single file.
|
||||
static void sortNestedRegions(MutableArrayRef<CountedRegion> Regions) {
|
||||
std::sort(Regions.begin(), Regions.end(), [](const CountedRegion &LHS,
|
||||
const CountedRegion &RHS) {
|
||||
llvm::sort(Regions.begin(), Regions.end(), [](const CountedRegion &LHS,
|
||||
const CountedRegion &RHS) {
|
||||
if (LHS.startLoc() != RHS.startLoc())
|
||||
return LHS.startLoc() < RHS.startLoc();
|
||||
if (LHS.endLoc() != RHS.endLoc())
|
||||
@ -555,7 +555,7 @@ std::vector<StringRef> CoverageMapping::getUniqueSourceFiles() const {
|
||||
for (const auto &Function : getCoveredFunctions())
|
||||
Filenames.insert(Filenames.end(), Function.Filenames.begin(),
|
||||
Function.Filenames.end());
|
||||
std::sort(Filenames.begin(), Filenames.end());
|
||||
llvm::sort(Filenames.begin(), Filenames.end());
|
||||
auto Last = std::unique(Filenames.begin(), Filenames.end());
|
||||
Filenames.erase(Last, Filenames.end());
|
||||
return Filenames;
|
||||
|
@ -592,7 +592,7 @@ void FileInfo::print(raw_ostream &InfoOS, StringRef MainFilename,
|
||||
SmallVector<StringRef, 4> Filenames;
|
||||
for (const auto &LI : LineInfo)
|
||||
Filenames.push_back(LI.first());
|
||||
std::sort(Filenames.begin(), Filenames.end());
|
||||
llvm::sort(Filenames.begin(), Filenames.end());
|
||||
|
||||
for (StringRef Filename : Filenames) {
|
||||
auto AllLines = LineConsumer(Filename);
|
||||
|
@ -58,7 +58,7 @@ void SampleProfileSummaryBuilder::addRecord(
|
||||
void ProfileSummaryBuilder::computeDetailedSummary() {
|
||||
if (DetailedSummaryCutoffs.empty())
|
||||
return;
|
||||
std::sort(DetailedSummaryCutoffs.begin(), DetailedSummaryCutoffs.end());
|
||||
llvm::sort(DetailedSummaryCutoffs.begin(), DetailedSummaryCutoffs.end());
|
||||
auto Iter = CountFrequencies.begin();
|
||||
const auto End = CountFrequencies.end();
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user