1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-26 04:32:44 +01:00
llvm-mirror/test/CodeGen/ARM/2012-11-14-subs_carry.ll
Hal Finkel a037cc62b6 [SelectionDAG] Swap commutative binops before constant-based folding
In searching for a fix for the underlying code-quality bug highlighted by
r246937 (that SDAG simplification can lead to us generating an ISD::OR node
with a constant zero LHS), I ran across this:

We generically canonicalize commutative binary-operation nodes in SDAG getNode
so that, if only one operand is a constant, it will be on the RHS.  However, we
were doing this only after a bunch of constant-based simplification checks that
all assume this canonical form (that any constant will be on the RHS). Moving
the operand-swapping canonicalization prior to these checks seems like the
right thing to do (and, as it turns out, causes SDAG to completely fold away the
computation in test/CodeGen/ARM/2012-11-14-subs_carry.ll, just like InstCombine
would do).

llvm-svn: 246938
2015-09-06 05:42:13 +00:00

36 lines
805 B
LLVM

; RUN: llc < %s -mtriple=thumbv7-apple-ios -arm-atomic-cfg-tidy=0 | FileCheck %s
;CHECK-LABEL: foo:
;CHECK: movs r0, #0
;CHECK-NEXT: bx lr
; Note: This test case originally checked, per r167963, for:
; adds
; adc
; bx
; But SDAG now, like InstCombine, can fold everything away.
;rdar://12028498
define i32 @foo() nounwind ssp {
entry:
%tmp2 = zext i32 3 to i64
br label %bug_block
bug_block:
%tmp410 = and i64 1031, 1647010
%tmp411 = and i64 %tmp2, -211
%tmp412 = shl i64 %tmp410, %tmp2
%tmp413 = shl i64 %tmp411, %tmp2
%tmp415 = and i64 %tmp413, 1
%tmp420 = xor i64 0, %tmp415
%tmp421 = and i64 %tmp412, %tmp415
%tmp422 = shl i64 %tmp421, 1
br label %finish
finish:
%tmp423 = lshr i64 %tmp422, 32
%tmp424 = trunc i64 %tmp423 to i32
ret i32 %tmp424
}