RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 11:42:57 +01:00
Code Issues Projects Releases Wiki Activity

Don't use std::copy and std::copy_backward, run 10% faster.

Browse Source 
Sometimes std::copy can become a memmove call, and that is not a good idea when
copying relatively few bytes as we are doing. We also get a small win by
changing two loops into one.

llvm-svn: 120265
This commit is contained in:
Jakob Stoklund Olesen 2010-11-28 22:17:14 +00:00
parent 36f332e23a
commit a5f9163586
1 changed files with 8 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
include/llvm/ADT/IntervalMap.h
View File

@ -103,7 +103,6 @@
#include "llvm/ADT/PointerIntPair.h"
#include "llvm/Support/Allocator.h"
#include "llvm/Support/RecyclingAllocator.h"
#include <limits>
#include <iterator>
// FIXME: Remove debugging code.
@ -211,8 +210,10 @@ public:
unsigned j, unsigned Count) {
assert(i + Count <= M && "Invalid source range");
assert(j + Count <= N && "Invalid dest range");
std::copy(Other.first + i, Other.first + i + Count, first + j);
std::copy(Other.second + i, Other.second + i + Count, second + j);
for (unsigned e = i + Count; i != e; ++i, ++j) {
first[j] = Other.first[i];
second[j] = Other.second[i];
}
}
/// moveLeft - Move elements to the left.
@ -231,8 +232,10 @@ public:
void moveRight(unsigned i, unsigned j, unsigned Count) {
assert(i <= j && "Use moveLeft shift elements left");
assert(j + Count <= N && "Invalid range");
std::copy_backward(first + i, first + i + Count, first + j + Count);
std::copy_backward(second + i, second + i + Count, second + j + Count);
while (Count--) {
first[j + Count] = first[i + Count];
second[j + Count] = second[i + Count];
}
}
/// erase - Erase elements [i;j).