mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-12-13 04:30:23 +00:00
[C++11] Use std::tie to simplify compare operators.
No functionality change. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@202751 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
c3835ccef9
commit
9efaf2f2da
@ -173,7 +173,7 @@ namespace llvm {
|
||||
}
|
||||
|
||||
bool operator<(const Segment &Other) const {
|
||||
return start < Other.start || (start == Other.start && end < Other.end);
|
||||
return std::tie(start, end) < std::tie(Other.start, Other.end);
|
||||
}
|
||||
bool operator==(const Segment &Other) const {
|
||||
return start == Other.start && end == Other.end;
|
||||
@ -552,8 +552,7 @@ namespace llvm {
|
||||
bool operator<(const LiveInterval& other) const {
|
||||
const SlotIndex &thisIndex = beginIndex();
|
||||
const SlotIndex &otherIndex = other.beginIndex();
|
||||
return thisIndex < otherIndex ||
|
||||
(thisIndex == otherIndex && reg < other.reg);
|
||||
return std::tie(thisIndex, reg) < std::tie(otherIndex, other.reg);
|
||||
}
|
||||
|
||||
void print(raw_ostream &OS) const;
|
||||
|
@ -120,7 +120,7 @@ public:
|
||||
return !operator==(O);
|
||||
}
|
||||
bool operator<(const SDValue &O) const {
|
||||
return Node < O.Node || (Node == O.Node && ResNo < O.ResNo);
|
||||
return std::tie(Node, ResNo) < std::tie(O.Node, O.ResNo);
|
||||
}
|
||||
|
||||
SDValue getValue(unsigned R) const {
|
||||
|
@ -135,8 +135,7 @@ public:
|
||||
}
|
||||
bool operator!=(const UniqueID &Other) const { return !(*this == Other); }
|
||||
bool operator<(const UniqueID &Other) const {
|
||||
return Device < Other.Device ||
|
||||
(Device == Other.Device && File < Other.File);
|
||||
return std::tie(Device, File) < std::tie(Other.Device, Other.File);
|
||||
}
|
||||
uint64_t getDevice() const { return Device; }
|
||||
uint64_t getFile() const { return File; }
|
||||
|
@ -190,9 +190,8 @@ class RAGreedy : public MachineFunctionPass,
|
||||
void setBrokenHints(unsigned NHints) { BrokenHints = NHints; }
|
||||
|
||||
bool operator<(const EvictionCost &O) const {
|
||||
if (BrokenHints != O.BrokenHints)
|
||||
return BrokenHints < O.BrokenHints;
|
||||
return MaxWeight < O.MaxWeight;
|
||||
return std::tie(BrokenHints, MaxWeight) <
|
||||
std::tie(O.BrokenHints, O.MaxWeight);
|
||||
}
|
||||
};
|
||||
|
||||
|
@ -334,14 +334,10 @@ struct ExprMapKeyType {
|
||||
this->indices == that.indices;
|
||||
}
|
||||
bool operator<(const ExprMapKeyType & that) const {
|
||||
if (this->opcode != that.opcode) return this->opcode < that.opcode;
|
||||
if (this->operands != that.operands) return this->operands < that.operands;
|
||||
if (this->subclassdata != that.subclassdata)
|
||||
return this->subclassdata < that.subclassdata;
|
||||
if (this->subclassoptionaldata != that.subclassoptionaldata)
|
||||
return this->subclassoptionaldata < that.subclassoptionaldata;
|
||||
if (this->indices != that.indices) return this->indices < that.indices;
|
||||
return false;
|
||||
return std::tie(opcode, operands, subclassdata, subclassoptionaldata,
|
||||
indices) <
|
||||
std::tie(that.opcode, that.operands, that.subclassdata,
|
||||
that.subclassoptionaldata, that.indices);
|
||||
}
|
||||
|
||||
bool operator!=(const ExprMapKeyType& that) const {
|
||||
@ -369,17 +365,10 @@ struct InlineAsmKeyType {
|
||||
this->asm_dialect == that.asm_dialect;
|
||||
}
|
||||
bool operator<(const InlineAsmKeyType& that) const {
|
||||
if (this->asm_string != that.asm_string)
|
||||
return this->asm_string < that.asm_string;
|
||||
if (this->constraints != that.constraints)
|
||||
return this->constraints < that.constraints;
|
||||
if (this->has_side_effects != that.has_side_effects)
|
||||
return this->has_side_effects < that.has_side_effects;
|
||||
if (this->is_align_stack != that.is_align_stack)
|
||||
return this->is_align_stack < that.is_align_stack;
|
||||
if (this->asm_dialect != that.asm_dialect)
|
||||
return this->asm_dialect < that.asm_dialect;
|
||||
return false;
|
||||
return std::tie(asm_string, constraints, has_side_effects, is_align_stack,
|
||||
asm_dialect) <
|
||||
std::tie(that.asm_string, that.constraints, that.has_side_effects,
|
||||
that.is_align_stack, that.asm_dialect);
|
||||
}
|
||||
|
||||
bool operator!=(const InlineAsmKeyType& that) const {
|
||||
|
@ -62,12 +62,7 @@ namespace {
|
||||
|
||||
/// Make RetOrArg comparable, so we can put it into a map.
|
||||
bool operator<(const RetOrArg &O) const {
|
||||
if (F != O.F)
|
||||
return F < O.F;
|
||||
else if (Idx != O.Idx)
|
||||
return Idx < O.Idx;
|
||||
else
|
||||
return IsArg < O.IsArg;
|
||||
return std::tie(F, Idx, IsArg) < std::tie(O.F, O.Idx, O.IsArg);
|
||||
}
|
||||
|
||||
/// Make RetOrArg comparable, so we can easily iterate the multimap.
|
||||
|
@ -979,21 +979,11 @@ void Cost::Lose() {
|
||||
|
||||
/// operator< - Choose the lower cost.
|
||||
bool Cost::operator<(const Cost &Other) const {
|
||||
if (NumRegs != Other.NumRegs)
|
||||
return NumRegs < Other.NumRegs;
|
||||
if (AddRecCost != Other.AddRecCost)
|
||||
return AddRecCost < Other.AddRecCost;
|
||||
if (NumIVMuls != Other.NumIVMuls)
|
||||
return NumIVMuls < Other.NumIVMuls;
|
||||
if (NumBaseAdds != Other.NumBaseAdds)
|
||||
return NumBaseAdds < Other.NumBaseAdds;
|
||||
if (ScaleCost != Other.ScaleCost)
|
||||
return ScaleCost < Other.ScaleCost;
|
||||
if (ImmCost != Other.ImmCost)
|
||||
return ImmCost < Other.ImmCost;
|
||||
if (SetupCost != Other.SetupCost)
|
||||
return SetupCost < Other.SetupCost;
|
||||
return false;
|
||||
return std::tie(NumRegs, AddRecCost, NumIVMuls, NumBaseAdds, ScaleCost,
|
||||
ImmCost, SetupCost) <
|
||||
std::tie(Other.NumRegs, Other.AddRecCost, Other.NumIVMuls,
|
||||
Other.NumBaseAdds, Other.ScaleCost, Other.ImmCost,
|
||||
Other.SetupCost);
|
||||
}
|
||||
|
||||
void Cost::print(raw_ostream &OS) const {
|
||||
|
@ -782,11 +782,8 @@ namespace llvm {
|
||||
bool CodeGenRegisterClass::Key::
|
||||
operator<(const CodeGenRegisterClass::Key &B) const {
|
||||
assert(Members && B.Members);
|
||||
if (*Members != *B.Members)
|
||||
return *Members < *B.Members;
|
||||
if (SpillSize != B.SpillSize)
|
||||
return SpillSize < B.SpillSize;
|
||||
return SpillAlignment < B.SpillAlignment;
|
||||
return std::tie(*Members, SpillSize, SpillAlignment) <
|
||||
std::tie(*B.Members, B.SpillSize, B.SpillAlignment);
|
||||
}
|
||||
|
||||
// Returns true if RC is a strict subclass.
|
||||
|
Loading…
Reference in New Issue
Block a user