mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2025-02-28 08:16:05 +00:00
[llvm] Change 2 instances of std::sort to llvm::sort
llvm-svn: 337192
This commit is contained in:
parent
e61ead194c
commit
59a561aa1a
@ -134,7 +134,7 @@ rescheduleLexographically(std::vector<MachineInstr *> instructions,
|
||||
StringInstrMap.push_back({(i == std::string::npos) ? S : S.substr(i), II});
|
||||
}
|
||||
|
||||
std::sort(StringInstrMap.begin(), StringInstrMap.end(),
|
||||
llvm::sort(StringInstrMap.begin(), StringInstrMap.end(),
|
||||
[](const StringInstrPair &a, const StringInstrPair &b) -> bool {
|
||||
return (a.first < b.first);
|
||||
});
|
||||
|
@ -144,7 +144,7 @@ void GSIHashStreamBuilder::finalizeBuckets(uint32_t RecordZeroOffset) {
|
||||
// can properly early-out when it detects the record won't be found. The
|
||||
// algorithm used here corredsponds to the function
|
||||
// caseInsensitiveComparePchPchCchCch in the reference implementation.
|
||||
std::sort(Bucket.begin(), Bucket.end(),
|
||||
llvm::sort(Bucket.begin(), Bucket.end(),
|
||||
[](const std::pair<StringRef, PSHashRecord> &Left,
|
||||
const std::pair<StringRef, PSHashRecord> &Right) {
|
||||
return gsiRecordLess(Left.first, Right.first);
|
||||
|
Loading…
x
Reference in New Issue
Block a user