Skip to content

[CodeGen] Use std::tie to implement a comparison functor (NFC) #146252

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jun 29, 2025
Merged

[CodeGen] Use std::tie to implement a comparison functor (NFC) #146252

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
28 changes: 14 additions & 14 deletions llvm/lib/CodeGen/MachineScheduler.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1290,13 +1290,13 @@ LLVM_DUMP_METHOD void ScheduleDAGMI::dumpScheduleTraceTopDown() const {
SchedModel.getWriteProcResEnd(SC)));

if (MISchedSortResourcesInTrace)
llvm::stable_sort(ResourcesIt,
[](const MCWriteProcResEntry &LHS,
const MCWriteProcResEntry &RHS) -> bool {
return LHS.AcquireAtCycle < RHS.AcquireAtCycle ||
(LHS.AcquireAtCycle == RHS.AcquireAtCycle &&
LHS.ReleaseAtCycle < RHS.ReleaseAtCycle);
});
llvm::stable_sort(
ResourcesIt,
[](const MCWriteProcResEntry &LHS,
const MCWriteProcResEntry &RHS) -> bool {
return std::tie(LHS.AcquireAtCycle, LHS.ReleaseAtCycle) <
std::tie(RHS.AcquireAtCycle, RHS.ReleaseAtCycle);
});
for (const MCWriteProcResEntry &PI : ResourcesIt) {
C = FirstCycle;
const std::string ResName =
Expand Down Expand Up @@ -1371,13 +1371,13 @@ LLVM_DUMP_METHOD void ScheduleDAGMI::dumpScheduleTraceBottomUp() const {
SchedModel.getWriteProcResEnd(SC)));

if (MISchedSortResourcesInTrace)
llvm::stable_sort(ResourcesIt,
[](const MCWriteProcResEntry &LHS,
const MCWriteProcResEntry &RHS) -> bool {
return LHS.AcquireAtCycle < RHS.AcquireAtCycle ||
(LHS.AcquireAtCycle == RHS.AcquireAtCycle &&
LHS.ReleaseAtCycle < RHS.ReleaseAtCycle);
});
llvm::stable_sort(
ResourcesIt,
[](const MCWriteProcResEntry &LHS,
const MCWriteProcResEntry &RHS) -> bool {
return std::tie(LHS.AcquireAtCycle, LHS.ReleaseAtCycle) <
std::tie(RHS.AcquireAtCycle, RHS.ReleaseAtCycle);
});
for (const MCWriteProcResEntry &PI : ResourcesIt) {
C = FirstCycle;
const std::string ResName =
Expand Down
Loading