diff options
| author | Benjamin Kramer <benny.kra@googlemail.com> | 2015-02-28 10:11:12 +0000 |
|---|---|---|
| committer | Benjamin Kramer <benny.kra@googlemail.com> | 2015-02-28 10:11:12 +0000 |
| commit | 4f6ac16292f5435cd00782757e6794f2bf6b64f5 (patch) | |
| tree | bbba5b9d8e7f5e816bce01feb0dd5c3c62365821 /llvm/lib/Target/X86/X86InstrInfo.cpp | |
| parent | b759340fc82a209e36455af5e9dc4e6c0d9e7dfb (diff) | |
| download | bcm5719-llvm-4f6ac16292f5435cd00782757e6794f2bf6b64f5.tar.gz bcm5719-llvm-4f6ac16292f5435cd00782757e6794f2bf6b64f5.zip | |
Replace std::copy with a back inserter with vector append where feasible
All of the cases were just appending from random access iterators to a
vector. Using insert/append can grow the vector to the perfect size
directly and moves the growing out of the loop. No intended functionalty
change.
llvm-svn: 230845
Diffstat (limited to 'llvm/lib/Target/X86/X86InstrInfo.cpp')
| -rw-r--r-- | llvm/lib/Target/X86/X86InstrInfo.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/llvm/lib/Target/X86/X86InstrInfo.cpp b/llvm/lib/Target/X86/X86InstrInfo.cpp index f5b9680d0bb..ea4e25188da 100644 --- a/llvm/lib/Target/X86/X86InstrInfo.cpp +++ b/llvm/lib/Target/X86/X86InstrInfo.cpp @@ -5559,7 +5559,7 @@ X86InstrInfo::unfoldMemoryOperand(SelectionDAG &DAG, SDNode *N, } if (Load) BeforeOps.push_back(SDValue(Load, 0)); - std::copy(AfterOps.begin(), AfterOps.end(), std::back_inserter(BeforeOps)); + BeforeOps.insert(BeforeOps.end(), AfterOps.begin(), AfterOps.end()); SDNode *NewNode= DAG.getMachineNode(Opc, dl, VTs, BeforeOps); NewNodes.push_back(NewNode); |

