diff options
author | Chris Lattner <sabre@nondot.org> | 2005-09-18 07:22:02 +0000 |
---|---|---|
committer | Chris Lattner <sabre@nondot.org> | 2005-09-18 07:22:02 +0000 |
commit | 7203e158da9ac847f7246e99383d7110c0576a2c (patch) | |
tree | b4a0502fe4e56b2a66887bd6fa773a8258d6d801 /lib/CodeGen/RegAllocIterativeScan.cpp | |
parent | 150f12af7f2e84888787b8aac3561853cf6a9e5a (diff) |
Refactor this code a bit and make it more general. This now compiles:
struct S { unsigned int i : 6, j : 11, k : 15; } b;
void plus2 (unsigned int x) { b.j += x; }
To:
_plus2:
lis r2, ha16(L_b$non_lazy_ptr)
lwz r2, lo16(L_b$non_lazy_ptr)(r2)
lwz r4, 0(r2)
slwi r3, r3, 6
add r3, r4, r3
rlwimi r3, r4, 0, 26, 14
stw r3, 0(r2)
blr
instead of:
_plus2:
lis r2, ha16(L_b$non_lazy_ptr)
lwz r2, lo16(L_b$non_lazy_ptr)(r2)
lwz r4, 0(r2)
rlwinm r5, r4, 26, 21, 31
add r3, r5, r3
rlwimi r4, r3, 6, 15, 25
stw r4, 0(r2)
blr
by eliminating an 'and'.
I'm pretty sure this is as small as we can go :)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@23386 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/CodeGen/RegAllocIterativeScan.cpp')
0 files changed, 0 insertions, 0 deletions