mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-25 12:29:58 +00:00
Assigning to a local object in a return statement prevents copy elision. NFC.
I added a diagnostic along the lines of `-Wpessimizing-move` to detect `return x = y` suppressing copy elision, but I don't know if the diagnostic is really worth it. Anyway, here are the places where my diagnostic reported that copy elision would have been possible if not for the assignment. P1155R1 in the post-San-Diego WG21 (C++ committee) mailing discusses whether WG21 should fix this pitfall by just changing the core language to permit copy elision in cases like these. (Kona update: The bulk of P1155 is proceeding to CWG review, but specifically *not* the parts that explored the notion of permitting copy-elision in these specific cases.) Reviewed By: dblaikie Author: Arthur O'Dwyer Differential Revision: https://reviews.llvm.org/D54885 llvm-svn: 359236
This commit is contained in:
parent
620cbaeb4e
commit
b4247dfe57
@ -61,7 +61,8 @@ inline MachineBasicBlock::instr_iterator getBundleEnd(
|
||||
MachineBasicBlock::instr_iterator I) {
|
||||
while (I->isBundledWithSucc())
|
||||
++I;
|
||||
return ++I;
|
||||
++I;
|
||||
return I;
|
||||
}
|
||||
|
||||
/// Returns an iterator pointing beyond the bundle containing \p I.
|
||||
@ -69,7 +70,8 @@ inline MachineBasicBlock::const_instr_iterator getBundleEnd(
|
||||
MachineBasicBlock::const_instr_iterator I) {
|
||||
while (I->isBundledWithSucc())
|
||||
++I;
|
||||
return ++I;
|
||||
++I;
|
||||
return I;
|
||||
}
|
||||
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
@ -128,27 +128,32 @@ public:
|
||||
|
||||
BranchProbability operator+(BranchProbability RHS) const {
|
||||
BranchProbability Prob(*this);
|
||||
return Prob += RHS;
|
||||
Prob += RHS;
|
||||
return Prob;
|
||||
}
|
||||
|
||||
BranchProbability operator-(BranchProbability RHS) const {
|
||||
BranchProbability Prob(*this);
|
||||
return Prob -= RHS;
|
||||
Prob -= RHS;
|
||||
return Prob;
|
||||
}
|
||||
|
||||
BranchProbability operator*(BranchProbability RHS) const {
|
||||
BranchProbability Prob(*this);
|
||||
return Prob *= RHS;
|
||||
Prob *= RHS;
|
||||
return Prob;
|
||||
}
|
||||
|
||||
BranchProbability operator*(uint32_t RHS) const {
|
||||
BranchProbability Prob(*this);
|
||||
return Prob *= RHS;
|
||||
Prob *= RHS;
|
||||
return Prob;
|
||||
}
|
||||
|
||||
BranchProbability operator/(uint32_t RHS) const {
|
||||
BranchProbability Prob(*this);
|
||||
return Prob /= RHS;
|
||||
Prob /= RHS;
|
||||
return Prob;
|
||||
}
|
||||
|
||||
bool operator==(BranchProbability RHS) const { return N == RHS.N; }
|
||||
|
@ -297,7 +297,8 @@ reverse_iterator rbegin(StringRef Path, Style style) {
|
||||
I.Path = Path;
|
||||
I.Position = Path.size();
|
||||
I.S = style;
|
||||
return ++I;
|
||||
++I;
|
||||
return I;
|
||||
}
|
||||
|
||||
reverse_iterator rend(StringRef Path) {
|
||||
|
@ -1364,7 +1364,8 @@ PrevCrossBBInst(MachineBasicBlock::const_iterator MBBI) {
|
||||
MBB = MBB->getPrevNode();
|
||||
MBBI = MBB->end();
|
||||
}
|
||||
return --MBBI;
|
||||
--MBBI;
|
||||
return MBBI;
|
||||
}
|
||||
|
||||
static const Constant *getConstantFromPool(const MachineInstr &MI,
|
||||
|
@ -24,10 +24,12 @@ using namespace llvm;
|
||||
/// Moves I before IP. Returns new insert point.
|
||||
static BasicBlock::iterator moveBeforeInsertPoint(BasicBlock::iterator I, BasicBlock::iterator IP) {
|
||||
// If I is IP, move the insert point down.
|
||||
if (I == IP)
|
||||
return ++IP;
|
||||
// Otherwise, move I before IP and return IP.
|
||||
I->moveBefore(&*IP);
|
||||
if (I == IP) {
|
||||
++IP;
|
||||
} else {
|
||||
// Otherwise, move I before IP and return IP.
|
||||
I->moveBefore(&*IP);
|
||||
}
|
||||
return IP;
|
||||
}
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user