diff options
author | Kazu Hirata <kazu@google.com> | 2024-06-23 10:38:51 -0700 |
---|---|---|
committer | GitHub <noreply@github.com> | 2024-06-23 10:38:51 -0700 |
commit | 05d167fc201b4f2e96108be0d682f6800a70c23d (patch) | |
tree | 66c423f73e113ebffb1d6a6ec93d7ca579c5dfed | |
parent | 21fac2d1d060b0f9b11a746718e58d4cd1ee97e5 (diff) | |
download | llvm-05d167fc201b4f2e96108be0d682f6800a70c23d.zip llvm-05d167fc201b4f2e96108be0d682f6800a70c23d.tar.gz llvm-05d167fc201b4f2e96108be0d682f6800a70c23d.tar.bz2 |
[llvm] Use llvm::sort (NFC) (#96434)
-rw-r--r-- | llvm/lib/CodeGen/AssignmentTrackingAnalysis.cpp | 9 | ||||
-rw-r--r-- | llvm/lib/CodeGen/MLRegAllocEvictAdvisor.cpp | 6 | ||||
-rw-r--r-- | llvm/lib/DWARFLinker/Parallel/ArrayList.h | 2 | ||||
-rw-r--r-- | llvm/lib/ExecutionEngine/Orc/Core.cpp | 5 | ||||
-rw-r--r-- | llvm/lib/ExecutionEngine/Orc/Debugging/DebugInfoSupport.cpp | 2 | ||||
-rw-r--r-- | llvm/lib/ProfileData/InstrProfReader.cpp | 2 | ||||
-rw-r--r-- | llvm/lib/Target/AMDGPU/AMDGPUIGroupLP.cpp | 5 | ||||
-rw-r--r-- | llvm/lib/Target/ARM/ARMBaseInstrInfo.cpp | 4 | ||||
-rw-r--r-- | llvm/lib/Target/NVPTX/NVVMReflect.cpp | 2 | ||||
-rw-r--r-- | llvm/lib/Target/PowerPC/PPCMergeStringPool.cpp | 2 | ||||
-rw-r--r-- | llvm/lib/Transforms/IPO/MemProfContextDisambiguation.cpp | 6 | ||||
-rw-r--r-- | llvm/lib/Transforms/Utils/CodeLayout.cpp | 33 | ||||
-rw-r--r-- | llvm/tools/llvm-jitlink/llvm-jitlink.cpp | 7 | ||||
-rw-r--r-- | llvm/utils/TableGen/ARMTargetDefEmitter.cpp | 2 | ||||
-rw-r--r-- | llvm/utils/TableGen/ExegesisEmitter.cpp | 3 |
15 files changed, 41 insertions, 49 deletions
diff --git a/llvm/lib/CodeGen/AssignmentTrackingAnalysis.cpp b/llvm/lib/CodeGen/AssignmentTrackingAnalysis.cpp index 8afd750..0124175 100644 --- a/llvm/lib/CodeGen/AssignmentTrackingAnalysis.cpp +++ b/llvm/lib/CodeGen/AssignmentTrackingAnalysis.cpp @@ -2231,11 +2231,10 @@ static AssignmentTrackingLowering::OverlapMap buildOverlapMapAndRecordDeclares( // order of fragment size - there should be no duplicates. for (auto &Pair : FragmentMap) { SmallVector<DebugVariable, 8> &Frags = Pair.second; - std::sort(Frags.begin(), Frags.end(), - [](const DebugVariable &Next, const DebugVariable &Elmt) { - return Elmt.getFragmentOrDefault().SizeInBits > - Next.getFragmentOrDefault().SizeInBits; - }); + llvm::sort(Frags, [](const DebugVariable &Next, const DebugVariable &Elmt) { + return Elmt.getFragmentOrDefault().SizeInBits > + Next.getFragmentOrDefault().SizeInBits; + }); // Check for duplicates. assert(std::adjacent_find(Frags.begin(), Frags.end()) == Frags.end()); } diff --git a/llvm/lib/CodeGen/MLRegAllocEvictAdvisor.cpp b/llvm/lib/CodeGen/MLRegAllocEvictAdvisor.cpp index f3a961f..b8b4679 100644 --- a/llvm/lib/CodeGen/MLRegAllocEvictAdvisor.cpp +++ b/llvm/lib/CodeGen/MLRegAllocEvictAdvisor.cpp @@ -963,9 +963,9 @@ void extractInstructionFeatures( // frequency vector, mapping each instruction to its associated MBB. // Start off by sorting the segments based on the beginning slot index. - std::sort( - LRPosInfo.begin(), LRPosInfo.end(), - [](LRStartEndInfo A, LRStartEndInfo B) { return A.Begin < B.Begin; }); + llvm::sort(LRPosInfo, [](LRStartEndInfo A, LRStartEndInfo B) { + return A.Begin < B.Begin; + }); size_t InstructionIndex = 0; size_t CurrentSegmentIndex = 0; SlotIndex CurrentIndex = LRPosInfo[0].Begin; diff --git a/llvm/lib/DWARFLinker/Parallel/ArrayList.h b/llvm/lib/DWARFLinker/Parallel/ArrayList.h index c48f828..1dc7bfa 100644 --- a/llvm/lib/DWARFLinker/Parallel/ArrayList.h +++ b/llvm/lib/DWARFLinker/Parallel/ArrayList.h @@ -82,7 +82,7 @@ public: forEach([&](T &Item) { SortedItems.push_back(Item); }); if (SortedItems.size()) { - std::sort(SortedItems.begin(), SortedItems.end(), Comparator); + llvm::sort(SortedItems, Comparator); size_t SortedItemIdx = 0; forEach([&](T &Item) { Item = SortedItems[SortedItemIdx++]; }); diff --git a/llvm/lib/ExecutionEngine/Orc/Core.cpp b/llvm/lib/ExecutionEngine/Orc/Core.cpp index f03dd43..6ff009a 100644 --- a/llvm/lib/ExecutionEngine/Orc/Core.cpp +++ b/llvm/lib/ExecutionEngine/Orc/Core.cpp @@ -1155,8 +1155,9 @@ void JITDylib::dump(raw_ostream &OS) { std::vector<std::pair<SymbolStringPtr, SymbolTableEntry *>> SymbolsSorted; for (auto &KV : Symbols) SymbolsSorted.emplace_back(KV.first, &KV.second); - std::sort(SymbolsSorted.begin(), SymbolsSorted.end(), - [](const auto &L, const auto &R) { return *L.first < *R.first; }); + llvm::sort(SymbolsSorted, [](const auto &L, const auto &R) { + return *L.first < *R.first; + }); for (auto &KV : SymbolsSorted) { OS << " \"" << *KV.first << "\": "; diff --git a/llvm/lib/ExecutionEngine/Orc/Debugging/DebugInfoSupport.cpp b/llvm/lib/ExecutionEngine/Orc/Debugging/DebugInfoSupport.cpp index 5a058bd..60efa0c 100644 --- a/llvm/lib/ExecutionEngine/Orc/Debugging/DebugInfoSupport.cpp +++ b/llvm/lib/ExecutionEngine/Orc/Debugging/DebugInfoSupport.cpp @@ -50,7 +50,7 @@ static void preserveDWARFSection(LinkGraph &G, Section &Sec) { static SmallVector<char, 0> getSectionData(Section &Sec) { SmallVector<char, 0> SecData; SmallVector<Block *, 8> SecBlocks(Sec.blocks().begin(), Sec.blocks().end()); - std::sort(SecBlocks.begin(), SecBlocks.end(), [](Block *LHS, Block *RHS) { + llvm::sort(SecBlocks, [](Block *LHS, Block *RHS) { return LHS->getAddress() < RHS->getAddress(); }); // Convert back to what object file would have, one blob of section content diff --git a/llvm/lib/ProfileData/InstrProfReader.cpp b/llvm/lib/ProfileData/InstrProfReader.cpp index e18ce5d3..987fbad 100644 --- a/llvm/lib/ProfileData/InstrProfReader.cpp +++ b/llvm/lib/ProfileData/InstrProfReader.cpp @@ -476,7 +476,7 @@ RawInstrProfReader<IntPtrT>::getTemporalProfTraces( return TemporalProfTraces; } // Sort functions by their timestamps to build the trace. - std::sort(TemporalProfTimestamps.begin(), TemporalProfTimestamps.end()); + llvm::sort(TemporalProfTimestamps); TemporalProfTraceTy Trace; if (Weight) Trace.Weight = *Weight; diff --git a/llvm/lib/Target/AMDGPU/AMDGPUIGroupLP.cpp b/llvm/lib/Target/AMDGPU/AMDGPUIGroupLP.cpp index 86f28a5..b26a15b 100644 --- a/llvm/lib/Target/AMDGPU/AMDGPUIGroupLP.cpp +++ b/llvm/lib/Target/AMDGPU/AMDGPUIGroupLP.cpp @@ -612,10 +612,7 @@ void PipelineSolver::populateReadyList( } if (UseCostHeur) { - std::sort(ReadyList.begin(), ReadyList.end(), - [](std::pair<int, int> A, std::pair<int, int> B) { - return A.second < B.second; - }); + llvm::sort(ReadyList, llvm::less_second()); } assert(ReadyList.size() == CurrSU.second.size()); diff --git a/llvm/lib/Target/ARM/ARMBaseInstrInfo.cpp b/llvm/lib/Target/ARM/ARMBaseInstrInfo.cpp index e81e6bb..ccb6034 100644 --- a/llvm/lib/Target/ARM/ARMBaseInstrInfo.cpp +++ b/llvm/lib/Target/ARM/ARMBaseInstrInfo.cpp @@ -6886,8 +6886,8 @@ bool ARMPipelinerLoopInfo::tooMuchRegisterPressure(SwingSchedulerDAG &SSD, ++Stage) { std::deque<SUnit *> Instrs = SMS.getInstructions(Cycle + Stage * SMS.getInitiationInterval()); - std::sort(Instrs.begin(), Instrs.end(), - [](SUnit *A, SUnit *B) { return A->NodeNum > B->NodeNum; }); + llvm::sort(Instrs, + [](SUnit *A, SUnit *B) { return A->NodeNum > B->NodeNum; }); for (SUnit *SU : Instrs) ProposedSchedule.push_back(SU); } diff --git a/llvm/lib/Target/NVPTX/NVVMReflect.cpp b/llvm/lib/Target/NVPTX/NVVMReflect.cpp index 4024953..c02e487 100644 --- a/llvm/lib/Target/NVPTX/NVVMReflect.cpp +++ b/llvm/lib/Target/NVPTX/NVVMReflect.cpp @@ -208,7 +208,7 @@ static bool runNVVMReflect(Function &F, unsigned SmVersion) { // Removing via isInstructionTriviallyDead may add duplicates to the ToRemove // array. Filter out the duplicates before starting to erase from parent. - std::sort(ToRemove.begin(), ToRemove.end()); + llvm::sort(ToRemove); auto NewLastIter = llvm::unique(ToRemove); ToRemove.erase(NewLastIter, ToRemove.end()); diff --git a/llvm/lib/Target/PowerPC/PPCMergeStringPool.cpp b/llvm/lib/Target/PowerPC/PPCMergeStringPool.cpp index 309938a..af028de 100644 --- a/llvm/lib/Target/PowerPC/PPCMergeStringPool.cpp +++ b/llvm/lib/Target/PowerPC/PPCMergeStringPool.cpp @@ -244,7 +244,7 @@ bool PPCMergeStringPool::mergeModuleStringPool(Module &M) { return false; // Sort the global constants to make access more efficient. - std::sort(MergeableStrings.begin(), MergeableStrings.end(), CompareConstants); + llvm::sort(MergeableStrings, CompareConstants); SmallVector<Constant *> ConstantsInStruct; for (GlobalVariable *GV : MergeableStrings) diff --git a/llvm/lib/Transforms/IPO/MemProfContextDisambiguation.cpp b/llvm/lib/Transforms/IPO/MemProfContextDisambiguation.cpp index c1e5ab1..0001d07 100644 --- a/llvm/lib/Transforms/IPO/MemProfContextDisambiguation.cpp +++ b/llvm/lib/Transforms/IPO/MemProfContextDisambiguation.cpp @@ -2203,7 +2203,7 @@ void CallsiteContextGraph<DerivedCCG, FuncTy, CallTy>::ContextNode::print( // Make a copy of the computed context ids that we can sort for stability. auto ContextIds = getContextIds(); std::vector<uint32_t> SortedIds(ContextIds.begin(), ContextIds.end()); - std::sort(SortedIds.begin(), SortedIds.end()); + llvm::sort(SortedIds); for (auto Id : SortedIds) OS << " " << Id; OS << "\n"; @@ -2238,7 +2238,7 @@ void CallsiteContextGraph<DerivedCCG, FuncTy, CallTy>::ContextEdge::print( << " AllocTypes: " << getAllocTypeString(AllocTypes); OS << " ContextIds:"; std::vector<uint32_t> SortedIds(ContextIds.begin(), ContextIds.end()); - std::sort(SortedIds.begin(), SortedIds.end()); + llvm::sort(SortedIds); for (auto Id : SortedIds) OS << " " << Id; } @@ -2380,7 +2380,7 @@ private: std::string IdString = "ContextIds:"; if (ContextIds.size() < 100) { std::vector<uint32_t> SortedIds(ContextIds.begin(), ContextIds.end()); - std::sort(SortedIds.begin(), SortedIds.end()); + llvm::sort(SortedIds); for (auto Id : SortedIds) IdString += (" " + Twine(Id)).str(); } else { diff --git a/llvm/lib/Transforms/Utils/CodeLayout.cpp b/llvm/lib/Transforms/Utils/CodeLayout.cpp index 95edd27..dbadad3 100644 --- a/llvm/lib/Transforms/Utils/CodeLayout.cpp +++ b/llvm/lib/Transforms/Utils/CodeLayout.cpp @@ -986,16 +986,15 @@ private: } // Sorting chains by density in the decreasing order. - std::sort(SortedChains.begin(), SortedChains.end(), - [&](const ChainT *L, const ChainT *R) { - // Place the entry point at the beginning of the order. - if (L->isEntry() != R->isEntry()) - return L->isEntry(); - - // Compare by density and break ties by chain identifiers. - return std::make_tuple(-L->density(), L->Id) < - std::make_tuple(-R->density(), R->Id); - }); + llvm::sort(SortedChains, [&](const ChainT *L, const ChainT *R) { + // Place the entry point at the beginning of the order. + if (L->isEntry() != R->isEntry()) + return L->isEntry(); + + // Compare by density and break ties by chain identifiers. + return std::make_tuple(-L->density(), L->Id) < + std::make_tuple(-R->density(), R->Id); + }); // Collect the nodes in the order specified by their chains. std::vector<uint64_t> Order; @@ -1355,14 +1354,12 @@ private: } // Sort chains by density in the decreasing order. - std::sort(SortedChains.begin(), SortedChains.end(), - [&](const ChainT *L, const ChainT *R) { - const double DL = ChainDensity[L]; - const double DR = ChainDensity[R]; - // Compare by density and break ties by chain identifiers. - return std::make_tuple(-DL, L->Id) < - std::make_tuple(-DR, R->Id); - }); + llvm::sort(SortedChains, [&](const ChainT *L, const ChainT *R) { + const double DL = ChainDensity[L]; + const double DR = ChainDensity[R]; + // Compare by density and break ties by chain identifiers. + return std::make_tuple(-DL, L->Id) < std::make_tuple(-DR, R->Id); + }); // Collect the nodes in the order specified by their chains. std::vector<uint64_t> Order; diff --git a/llvm/tools/llvm-jitlink/llvm-jitlink.cpp b/llvm/tools/llvm-jitlink/llvm-jitlink.cpp index bff05b9..acf663a 100644 --- a/llvm/tools/llvm-jitlink/llvm-jitlink.cpp +++ b/llvm/tools/llvm-jitlink/llvm-jitlink.cpp @@ -1259,10 +1259,9 @@ Error Session::FileInfo::registerMultiStubEntry( Sym.getTargetFlags()); // Let's keep stubs ordered by ascending address. - std::sort(Entry.begin(), Entry.end(), - [](const MemoryRegionInfo &L, const MemoryRegionInfo &R) { - return L.getTargetAddress() < R.getTargetAddress(); - }); + llvm::sort(Entry, [](const MemoryRegionInfo &L, const MemoryRegionInfo &R) { + return L.getTargetAddress() < R.getTargetAddress(); + }); return Error::success(); } diff --git a/llvm/utils/TableGen/ARMTargetDefEmitter.cpp b/llvm/utils/TableGen/ARMTargetDefEmitter.cpp index e22f353..c414374 100644 --- a/llvm/utils/TableGen/ARMTargetDefEmitter.cpp +++ b/llvm/utils/TableGen/ARMTargetDefEmitter.cpp @@ -45,7 +45,7 @@ static void EmitARMTargetDef(RecordKeeper &RK, raw_ostream &OS) { const auto MarchB = B->getValueAsString("MArchName"); return MarchA.compare(MarchB) < 0; // A lexographically less than B }; - std::sort(SortedExtensions.begin(), SortedExtensions.end(), Alphabetical); + llvm::sort(SortedExtensions, Alphabetical); // The ARMProcFamilyEnum values are initialised by SubtargetFeature defs // which set the ARMProcFamily field. We can generate the enum from these defs diff --git a/llvm/utils/TableGen/ExegesisEmitter.cpp b/llvm/utils/TableGen/ExegesisEmitter.cpp index d48c7f3..be2c430 100644 --- a/llvm/utils/TableGen/ExegesisEmitter.cpp +++ b/llvm/utils/TableGen/ExegesisEmitter.cpp @@ -140,8 +140,7 @@ void ExegesisEmitter::emitPfmCountersInfo(const Record &Def, ValidationCounter->getValueAsDef("EventType")->getName(), getPfmCounterId(ValidationCounter->getValueAsString("Counter"))}); } - std::sort(ValidationCounters.begin(), ValidationCounters.end(), - EventNumberLess); + llvm::sort(ValidationCounters, EventNumberLess); OS << "\nstatic const std::pair<ValidationEvent, const char*> " << Target << Def.getName() << "ValidationCounters[] = {\n"; for (const ValidationCounterInfo &VCI : ValidationCounters) { |