2010-11-01 21:08:20 +00:00
|
|
|
; RUN: opt -instcombine -S < %s | FileCheck %s
|
|
|
|
|
2010-12-09 02:52:17 +00:00
|
|
|
; <rdar://problem/8606771>
|
|
|
|
; CHECK: @main
|
2010-11-01 21:08:20 +00:00
|
|
|
define i32 @main(i32 %argc) nounwind ssp {
|
|
|
|
entry:
|
|
|
|
%tmp3151 = trunc i32 %argc to i8
|
2012-12-04 22:15:32 +00:00
|
|
|
; CHECK: %0 = shl i8 %tmp3151, 5
|
|
|
|
; CHECK: and i8 %0, 64
|
2010-12-20 14:47:04 +00:00
|
|
|
; CHECK-NOT: shl
|
|
|
|
; CHECK-NOT: shr
|
2010-11-01 21:08:20 +00:00
|
|
|
%tmp3161 = or i8 %tmp3151, -17
|
|
|
|
%tmp3162 = and i8 %tmp3151, 122
|
|
|
|
%tmp3163 = xor i8 %tmp3162, -17
|
|
|
|
%tmp4114 = shl i8 %tmp3163, 6
|
|
|
|
%tmp4115 = xor i8 %tmp4114, %tmp3163
|
|
|
|
%tmp4120 = xor i8 %tmp3161, %tmp4115
|
|
|
|
%tmp4126 = lshr i8 %tmp4120, 7
|
|
|
|
%tmp4127 = mul i8 %tmp4126, 64
|
|
|
|
%tmp4086 = zext i8 %tmp4127 to i32
|
|
|
|
; CHECK: ret i32
|
|
|
|
ret i32 %tmp4086
|
|
|
|
}
|
2010-12-09 02:52:17 +00:00
|
|
|
|
|
|
|
; rdar://8739316
|
|
|
|
; CHECK: @foo
|
|
|
|
define i8 @foo(i8 %arg, i8 %arg1) nounwind {
|
|
|
|
bb:
|
|
|
|
%tmp = shl i8 %arg, 7
|
|
|
|
%tmp2 = and i8 %arg1, 84
|
|
|
|
%tmp3 = and i8 %arg1, -118
|
|
|
|
%tmp4 = and i8 %arg1, 33
|
|
|
|
%tmp5 = sub i8 -88, %tmp2
|
|
|
|
%tmp6 = and i8 %tmp5, 84
|
|
|
|
%tmp7 = or i8 %tmp4, %tmp6
|
|
|
|
%tmp8 = xor i8 %tmp, %tmp3
|
|
|
|
%tmp9 = or i8 %tmp7, %tmp8
|
|
|
|
%tmp10 = lshr i8 %tmp8, 7
|
|
|
|
%tmp11 = shl i8 %tmp10, 5
|
|
|
|
|
Reapply r155136 after fixing PR12599.
Original commit message:
Defer some shl transforms to DAGCombine.
The shl instruction is used to represent multiplication by a constant
power of two as well as bitwise left shifts. Some InstCombine
transformations would turn an shl instruction into a bit mask operation,
making it difficult for later analysis passes to recognize the
constsnt multiplication.
Disable those shl transformations, deferring them to DAGCombine time.
An 'shl X, C' instruction is now treated mostly the same was as 'mul X, C'.
These transformations are deferred:
(X >>? C) << C --> X & (-1 << C) (When X >> C has multiple uses)
(X >>? C1) << C2 --> X << (C2-C1) & (-1 << C2) (When C2 > C1)
(X >>? C1) << C2 --> X >>? (C1-C2) & (-1 << C2) (When C1 > C2)
The corresponding exact transformations are preserved, just like
div-exact + mul:
(X >>?,exact C) << C --> X
(X >>?,exact C1) << C2 --> X << (C2-C1)
(X >>?,exact C1) << C2 --> X >>?,exact (C1-C2)
The disabled transformations could also prevent the instruction selector
from recognizing rotate patterns in hash functions and cryptographic
primitives. I have a test case for that, but it is too fragile.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@155362 91177308-0d34-0410-b5e6-96231b3b80d8
2012-04-23 17:39:52 +00:00
|
|
|
; CHECK: %tmp10 = lshr i8 %tmp8, 7
|
|
|
|
; CHECK: %tmp11 = shl nuw nsw i8 %tmp10, 5
|
2010-12-09 02:52:17 +00:00
|
|
|
|
|
|
|
%tmp12 = xor i8 %tmp11, %tmp9
|
|
|
|
ret i8 %tmp12
|
|
|
|
}
|