diff options
author | Fangrui Song <maskray@google.com> | 2018-09-27 02:13:45 +0000 |
---|---|---|
committer | Fangrui Song <maskray@google.com> | 2018-09-27 02:13:45 +0000 |
commit | 0cac726a00a2be06a959a89efe6587dba28e5822 (patch) | |
tree | ca196a4c9ae371e54d735a6e5ee085de8c885d4f /llvm/utils/TableGen/CodeGenDAGPatterns.cpp | |
parent | f1c96490d425cb2253871936a91083e177e866b0 (diff) | |
download | bcm5719-llvm-0cac726a00a2be06a959a89efe6587dba28e5822.tar.gz bcm5719-llvm-0cac726a00a2be06a959a89efe6587dba28e5822.zip |
llvm::sort(C.begin(), C.end(), ...) -> llvm::sort(C, ...)
Summary: The convenience wrapper in STLExtras is available since rL342102.
Reviewers: dblaikie, javed.absar, JDevlieghere, andreadb
Subscribers: MatzeB, sanjoy, arsenm, dschuff, mehdi_amini, sdardis, nemanjai, jvesely, nhaehnle, sbc100, jgravelle-google, eraman, aheejin, kbarton, JDevlieghere, javed.absar, gbedwell, jrtc27, mgrang, atanasyan, steven_wu, george.burgess.iv, dexonsmith, kristina, jsji, llvm-commits
Differential Revision: https://reviews.llvm.org/D52573
llvm-svn: 343163
Diffstat (limited to 'llvm/utils/TableGen/CodeGenDAGPatterns.cpp')
-rw-r--r-- | llvm/utils/TableGen/CodeGenDAGPatterns.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/llvm/utils/TableGen/CodeGenDAGPatterns.cpp b/llvm/utils/TableGen/CodeGenDAGPatterns.cpp index 4a409f173d6..ed68b09c265 100644 --- a/llvm/utils/TableGen/CodeGenDAGPatterns.cpp +++ b/llvm/utils/TableGen/CodeGenDAGPatterns.cpp @@ -1318,7 +1318,7 @@ std::string PatternToMatch::getPredicateCheck() const { SmallVector<const Predicate*,4> PredList; for (const Predicate &P : Predicates) PredList.push_back(&P); - llvm::sort(PredList.begin(), PredList.end(), deref<llvm::less>()); + llvm::sort(PredList, deref<llvm::less>()); std::string Check; for (unsigned i = 0, e = PredList.size(); i != e; ++i) { @@ -3742,7 +3742,7 @@ std::vector<Predicate> CodeGenDAGPatterns::makePredList(ListInit *L) { } // Sort so that different orders get canonicalized to the same string. - llvm::sort(Preds.begin(), Preds.end()); + llvm::sort(Preds); return Preds; } |