summaryrefslogtreecommitdiffstats
path: root/libcxx/test/std/strings/basic.string
diff options
context:
space:
mode:
authorScott Douglass <sdouglass@arm.com>2015-10-05 14:49:54 +0000
committerScott Douglass <sdouglass@arm.com>2015-10-05 14:49:54 +0000
commit953f908173e353fd26053b960a5b52f8e23de2e1 (patch)
tree094773703de694be31ced426add23b9a20978995 /libcxx/test/std/strings/basic.string
parent3fd6c110bea17628828e1d149906312343cac99e (diff)
downloadbcm5719-llvm-953f908173e353fd26053b960a5b52f8e23de2e1.tar.gz
bcm5719-llvm-953f908173e353fd26053b960a5b52f8e23de2e1.zip
[ARM] Modify codegen for memcpy intrinsic to prefer LDM/STM.
We were previously codegen'ing memcpy as regular load/store operations and hoping that the register allocator would allocate registers in ascending order so that we could apply an LDM/STM combine after register allocation. According to the commit that first introduced this code (r37179), we planned to teach the register allocator to allocate the registers in ascending order. This never got implemented, and up to now we've been stuck with very poor codegen. A much simpler approach for achieving better codegen is to create MEMCPY pseudo instructions, attach scratch virtual registers to them and then, post register allocation, expand the MEMCPYs into LDM/STM pairs using the scratch registers. The register allocator will have picked arbitrary registers which we sort when expanding the MEMCPY. This approach also avoids the need to repeatedly calculate offsets which ultimately ought to be eliminated pre-RA in order to decrease register pressure. Fixes PR9199 and PR23768. [This is based on Peter Collingbourne's r238473 which was reverted.] Differential Revision: http://reviews.llvm.org/D13239 Change-Id: I727543c2e94136e0f80b8e22d5642d7b9ee5b458 Author: Peter Collingbourne <peter@pcc.me.uk> llvm-svn: 249322
Diffstat (limited to 'libcxx/test/std/strings/basic.string')
0 files changed, 0 insertions, 0 deletions
OpenPOWER on IntegriCloud