diff options
author | Mandeep Singh Grang <mgrang@codeaurora.org> | 2018-03-20 01:17:18 +0000 |
---|---|---|
committer | Mandeep Singh Grang <mgrang@codeaurora.org> | 2018-03-20 01:17:18 +0000 |
commit | a9e74a9165cef68f3c77dd4013b848c31d85a8f9 (patch) | |
tree | 63512de2421e1221c1fef27c98a8cba5d0dfd1ca | |
parent | 9e72c541f626109f1f11394781f40d239c50d130 (diff) | |
download | bcm5719-llvm-a9e74a9165cef68f3c77dd4013b848c31d85a8f9.tar.gz bcm5719-llvm-a9e74a9165cef68f3c77dd4013b848c31d85a8f9.zip |
Revert "[compiler-rt] Change std::sort to llvm::sort in response to r327219"
This reverts commit 2ee210e1963e03aacc0f71c50e4994bb5c66586e.
llvm-svn: 327936
5 files changed, 14 insertions, 14 deletions
diff --git a/compiler-rt/lib/asan/tests/asan_mem_test.cc b/compiler-rt/lib/asan/tests/asan_mem_test.cc index c02c2e36463..c3208868464 100644 --- a/compiler-rt/lib/asan/tests/asan_mem_test.cc +++ b/compiler-rt/lib/asan/tests/asan_mem_test.cc @@ -82,7 +82,7 @@ static bool AllocateTwoAdjacentArrays(char **x1, char **x2, size_t size) { for (size_t i = 0; i < 1000U && !res; i++) { v.push_back(reinterpret_cast<uintptr_t>(new char[size])); if (i == 0) continue; - llvm::sort(v.begin(), v.end()); + sort(v.begin(), v.end()); for (size_t j = 1; j < v.size(); j++) { assert(v[j] > v[j-1]); if ((size_t)(v[j] - v[j-1]) < size * 2) { diff --git a/compiler-rt/lib/fuzzer/FuzzerCorpus.h b/compiler-rt/lib/fuzzer/FuzzerCorpus.h index 7dd6dd6a94e..2da929835f4 100644 --- a/compiler-rt/lib/fuzzer/FuzzerCorpus.h +++ b/compiler-rt/lib/fuzzer/FuzzerCorpus.h @@ -83,7 +83,7 @@ class InputCorpus { II.NumFeatures = NumFeatures; II.MayDeleteFile = MayDeleteFile; II.UniqFeatureSet = FeatureSet; - llvm::sort(II.UniqFeatureSet.begin(), II.UniqFeatureSet.end()); + std::sort(II.UniqFeatureSet.begin(), II.UniqFeatureSet.end()); ComputeSHA1(U.data(), U.size(), II.Sha1); Hashes.insert(Sha1ToString(II.Sha1)); UpdateCorpusDistribution(); diff --git a/compiler-rt/lib/fuzzer/FuzzerMerge.cpp b/compiler-rt/lib/fuzzer/FuzzerMerge.cpp index 321f2654c73..5f3052a39c1 100644 --- a/compiler-rt/lib/fuzzer/FuzzerMerge.cpp +++ b/compiler-rt/lib/fuzzer/FuzzerMerge.cpp @@ -100,7 +100,7 @@ bool Merger::Parse(std::istream &IS, bool ParseCoverage) { TmpFeatures.clear(); // use a vector from outer scope to avoid resizes. while (ISS1 >> std::hex >> N) TmpFeatures.push_back(N); - llvm::sort(TmpFeatures.begin(), TmpFeatures.end()); + std::sort(TmpFeatures.begin(), TmpFeatures.end()); Files[CurrentFileIdx].Features = TmpFeatures; } } else { @@ -148,12 +148,12 @@ size_t Merger::Merge(const Set<uint32_t> &InitialFeatures, // Sort. Give preference to // * smaller files // * files with more features. - llvm::sort(Files.begin() + NumFilesInFirstCorpus, Files.end(), - [&](const MergeFileInfo &a, const MergeFileInfo &b) -> bool { - if (a.Size != b.Size) - return a.Size < b.Size; - return a.Features.size() > b.Features.size(); - }); + std::sort(Files.begin() + NumFilesInFirstCorpus, Files.end(), + [&](const MergeFileInfo &a, const MergeFileInfo &b) -> bool { + if (a.Size != b.Size) + return a.Size < b.Size; + return a.Features.size() > b.Features.size(); + }); // One greedy pass: add the file's features to AllFeatures. // If new features were added, add this file to NewFiles. @@ -321,10 +321,10 @@ void Fuzzer::CrashResistantMerge(const Vector<std::string> &Args, Vector<SizedFile> AllFiles; GetSizedFilesFromDir(Corpora[0], &AllFiles); size_t NumFilesInFirstCorpus = AllFiles.size(); - llvm::sort(AllFiles.begin(), AllFiles.end()); + std::sort(AllFiles.begin(), AllFiles.end()); for (size_t i = 1; i < Corpora.size(); i++) GetSizedFilesFromDir(Corpora[i], &AllFiles); - llvm::sort(AllFiles.begin() + NumFilesInFirstCorpus, AllFiles.end()); + std::sort(AllFiles.begin() + NumFilesInFirstCorpus, AllFiles.end()); Printf("MERGE-OUTER: %zd files, %zd in the initial corpus\n", AllFiles.size(), NumFilesInFirstCorpus); WriteNewControlFile(CFPath, AllFiles, NumFilesInFirstCorpus); diff --git a/compiler-rt/lib/sanitizer_common/tests/sanitizer_common_test.cc b/compiler-rt/lib/sanitizer_common/tests/sanitizer_common_test.cc index 1f9eea59a8f..576649cea35 100644 --- a/compiler-rt/lib/sanitizer_common/tests/sanitizer_common_test.cc +++ b/compiler-rt/lib/sanitizer_common/tests/sanitizer_common_test.cc @@ -209,7 +209,7 @@ TEST(SanitizerCommon, InternalLowerBoundVsStdLowerBound) { data[j] = create_item(i, j); } - llvm::sort(data.begin(), data.end()); + std::sort(data.begin(), data.end()); for (size_t j = 0; j < i; ++j) { int val = create_item(i, j); diff --git a/compiler-rt/lib/sanitizer_common/tests/sanitizer_linux_test.cc b/compiler-rt/lib/sanitizer_common/tests/sanitizer_linux_test.cc index d53c1e76356..8a6afab65ad 100644 --- a/compiler-rt/lib/sanitizer_common/tests/sanitizer_linux_test.cc +++ b/compiler-rt/lib/sanitizer_common/tests/sanitizer_linux_test.cc @@ -131,8 +131,8 @@ static std::vector<pid_t> ReadTidsToVector(ThreadLister *thread_lister) { } static bool Includes(std::vector<pid_t> first, std::vector<pid_t> second) { - llvm::sort(first.begin(), first.end()); - llvm::sort(second.begin(), second.end()); + std::sort(first.begin(), first.end()); + std::sort(second.begin(), second.end()); return std::includes(first.begin(), first.end(), second.begin(), second.end()); } |