A couple potential optimizations inspired by comment 4 in PR6773.
authorEli Friedman <eli.friedman@gmail.com>
Wed, 14 Jul 2010 06:58:26 +0000 (06:58 +0000)
committerEli Friedman <eli.friedman@gmail.com>
Wed, 14 Jul 2010 06:58:26 +0000 (06:58 +0000)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@108328 91177308-0d34-0410-b5e6-96231b3b80d8

lib/Target/ARM/README.txt

index 85d5ca05913cb6b05b743beb66b483005dee3707..83c4f67bd7904188d84f582ca1c968e6226c50c2 100644 (file)
@@ -590,3 +590,44 @@ than the Z bit, we'll need additional logic to reverse the conditionals
 associated with the comparison. Perhaps a pseudo-instruction for the comparison,
 with a post-codegen pass to clean up and handle the condition codes?
 See PR5694 for testcase.
+
+//===---------------------------------------------------------------------===//
+
+Given the following on armv5:
+int test1(int A, int B) {
+  return (A&-8388481)|(B&8388480);
+}
+
+We currently generate:
+       ldr     r2, .LCPI0_0
+       and     r0, r0, r2
+       ldr     r2, .LCPI0_1
+       and     r1, r1, r2
+       orr     r0, r1, r0
+       bx      lr
+
+We should be able to replace the second ldr+and with a bic (i.e. reuse the
+constant which was already loaded).  Not sure what's necessary to do that.
+
+//===---------------------------------------------------------------------===//
+
+Given the following on ARMv7:
+int test1(int A, int B) {
+  return (A&-8388481)|(B&8388480);
+}
+
+We currently generate:
+       bfc     r0, #7, #16
+       movw    r2, #:lower16:8388480
+       movt    r2, #:upper16:8388480
+       and     r1, r1, r2
+       orr     r0, r1, r0
+       bx      lr
+
+The following is much shorter:
+       lsr     r1, r1, #7
+       bfi     r0, r1, #7, #16
+       bx      lr
+
+
+//===---------------------------------------------------------------------===//