mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-24 11:42:57 +01:00
ab043ff680
Essentially the same as the GEP change in r230786.
A similar migration script can be used to update test cases, though a few more
test case improvements/changes were required this time around: (r229269-r229278)
import fileinput
import sys
import re
pat = re.compile(r"((?:=|:|^)\s*load (?:atomic )?(?:volatile )?(.*?))(| addrspace\(\d+\) *)\*($| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$)")
for line in sys.stdin:
sys.stdout.write(re.sub(pat, r"\1, \2\3*\4", line))
Reviewers: rafael, dexonsmith, grosser
Differential Revision: http://reviews.llvm.org/D7649
llvm-svn: 230794
533 lines
16 KiB
LLVM
533 lines
16 KiB
LLVM
; RUN: opt -codegenprepare -mtriple=arm64-apple=ios -S -o - %s | FileCheck --check-prefix=OPT %s
|
|
; RUN: llc < %s -march=arm64 | FileCheck %s
|
|
%struct.X = type { i8, i8, [2 x i8] }
|
|
%struct.Y = type { i32, i8 }
|
|
%struct.Z = type { i8, i8, [2 x i8], i16 }
|
|
%struct.A = type { i64, i8 }
|
|
|
|
define void @foo(%struct.X* nocapture %x, %struct.Y* nocapture %y) nounwind optsize ssp {
|
|
; CHECK-LABEL: foo:
|
|
; CHECK: ubfx
|
|
; CHECK-NOT: and
|
|
; CHECK: ret
|
|
|
|
%tmp = bitcast %struct.X* %x to i32*
|
|
%tmp1 = load i32, i32* %tmp, align 4
|
|
%b = getelementptr inbounds %struct.Y, %struct.Y* %y, i64 0, i32 1
|
|
%bf.clear = lshr i32 %tmp1, 3
|
|
%bf.clear.lobit = and i32 %bf.clear, 1
|
|
%frombool = trunc i32 %bf.clear.lobit to i8
|
|
store i8 %frombool, i8* %b, align 1
|
|
ret void
|
|
}
|
|
|
|
define i32 @baz(i64 %cav1.coerce) nounwind {
|
|
; CHECK-LABEL: baz:
|
|
; CHECK: sbfx w0, w0, #0, #4
|
|
%tmp = trunc i64 %cav1.coerce to i32
|
|
%tmp1 = shl i32 %tmp, 28
|
|
%bf.val.sext = ashr exact i32 %tmp1, 28
|
|
ret i32 %bf.val.sext
|
|
}
|
|
|
|
define i32 @bar(i64 %cav1.coerce) nounwind {
|
|
; CHECK-LABEL: bar:
|
|
; CHECK: sbfx w0, w0, #4, #6
|
|
%tmp = trunc i64 %cav1.coerce to i32
|
|
%cav1.sroa.0.1.insert = shl i32 %tmp, 22
|
|
%tmp1 = ashr i32 %cav1.sroa.0.1.insert, 26
|
|
ret i32 %tmp1
|
|
}
|
|
|
|
define void @fct1(%struct.Z* nocapture %x, %struct.A* nocapture %y) nounwind optsize ssp {
|
|
; CHECK-LABEL: fct1:
|
|
; CHECK: ubfx
|
|
; CHECK-NOT: and
|
|
; CHECK: ret
|
|
|
|
%tmp = bitcast %struct.Z* %x to i64*
|
|
%tmp1 = load i64, i64* %tmp, align 4
|
|
%b = getelementptr inbounds %struct.A, %struct.A* %y, i64 0, i32 0
|
|
%bf.clear = lshr i64 %tmp1, 3
|
|
%bf.clear.lobit = and i64 %bf.clear, 1
|
|
store i64 %bf.clear.lobit, i64* %b, align 8
|
|
ret void
|
|
}
|
|
|
|
define i64 @fct2(i64 %cav1.coerce) nounwind {
|
|
; CHECK-LABEL: fct2:
|
|
; CHECK: sbfx x0, x0, #0, #36
|
|
%tmp = shl i64 %cav1.coerce, 28
|
|
%bf.val.sext = ashr exact i64 %tmp, 28
|
|
ret i64 %bf.val.sext
|
|
}
|
|
|
|
define i64 @fct3(i64 %cav1.coerce) nounwind {
|
|
; CHECK-LABEL: fct3:
|
|
; CHECK: sbfx x0, x0, #4, #38
|
|
%cav1.sroa.0.1.insert = shl i64 %cav1.coerce, 22
|
|
%tmp1 = ashr i64 %cav1.sroa.0.1.insert, 26
|
|
ret i64 %tmp1
|
|
}
|
|
|
|
define void @fct4(i64* nocapture %y, i64 %x) nounwind optsize inlinehint ssp {
|
|
entry:
|
|
; CHECK-LABEL: fct4:
|
|
; CHECK: ldr [[REG1:x[0-9]+]],
|
|
; CHECK-NEXT: bfxil [[REG1]], x1, #16, #24
|
|
; CHECK-NEXT: str [[REG1]],
|
|
; CHECK-NEXT: ret
|
|
%0 = load i64, i64* %y, align 8
|
|
%and = and i64 %0, -16777216
|
|
%shr = lshr i64 %x, 16
|
|
%and1 = and i64 %shr, 16777215
|
|
%or = or i64 %and, %and1
|
|
store i64 %or, i64* %y, align 8
|
|
ret void
|
|
}
|
|
|
|
define void @fct5(i32* nocapture %y, i32 %x) nounwind optsize inlinehint ssp {
|
|
entry:
|
|
; CHECK-LABEL: fct5:
|
|
; CHECK: ldr [[REG1:w[0-9]+]],
|
|
; CHECK-NEXT: bfxil [[REG1]], w1, #16, #3
|
|
; CHECK-NEXT: str [[REG1]],
|
|
; CHECK-NEXT: ret
|
|
%0 = load i32, i32* %y, align 8
|
|
%and = and i32 %0, -8
|
|
%shr = lshr i32 %x, 16
|
|
%and1 = and i32 %shr, 7
|
|
%or = or i32 %and, %and1
|
|
store i32 %or, i32* %y, align 8
|
|
ret void
|
|
}
|
|
|
|
; Check if we can still catch bfm instruction when we drop some low bits
|
|
define void @fct6(i32* nocapture %y, i32 %x) nounwind optsize inlinehint ssp {
|
|
entry:
|
|
; CHECK-LABEL: fct6:
|
|
; CHECK: ldr [[REG1:w[0-9]+]],
|
|
; CHECK-NEXT: bfxil [[REG1]], w1, #16, #3
|
|
; lsr is an alias of ubfm
|
|
; CHECK-NEXT: lsr [[REG2:w[0-9]+]], [[REG1]], #2
|
|
; CHECK-NEXT: str [[REG2]],
|
|
; CHECK-NEXT: ret
|
|
%0 = load i32, i32* %y, align 8
|
|
%and = and i32 %0, -8
|
|
%shr = lshr i32 %x, 16
|
|
%and1 = and i32 %shr, 7
|
|
%or = or i32 %and, %and1
|
|
%shr1 = lshr i32 %or, 2
|
|
store i32 %shr1, i32* %y, align 8
|
|
ret void
|
|
}
|
|
|
|
|
|
; Check if we can still catch bfm instruction when we drop some high bits
|
|
define void @fct7(i32* nocapture %y, i32 %x) nounwind optsize inlinehint ssp {
|
|
entry:
|
|
; CHECK-LABEL: fct7:
|
|
; CHECK: ldr [[REG1:w[0-9]+]],
|
|
; CHECK-NEXT: bfxil [[REG1]], w1, #16, #3
|
|
; lsl is an alias of ubfm
|
|
; CHECK-NEXT: lsl [[REG2:w[0-9]+]], [[REG1]], #2
|
|
; CHECK-NEXT: str [[REG2]],
|
|
; CHECK-NEXT: ret
|
|
%0 = load i32, i32* %y, align 8
|
|
%and = and i32 %0, -8
|
|
%shr = lshr i32 %x, 16
|
|
%and1 = and i32 %shr, 7
|
|
%or = or i32 %and, %and1
|
|
%shl = shl i32 %or, 2
|
|
store i32 %shl, i32* %y, align 8
|
|
ret void
|
|
}
|
|
|
|
|
|
; Check if we can still catch bfm instruction when we drop some low bits
|
|
; (i64 version)
|
|
define void @fct8(i64* nocapture %y, i64 %x) nounwind optsize inlinehint ssp {
|
|
entry:
|
|
; CHECK-LABEL: fct8:
|
|
; CHECK: ldr [[REG1:x[0-9]+]],
|
|
; CHECK-NEXT: bfxil [[REG1]], x1, #16, #3
|
|
; lsr is an alias of ubfm
|
|
; CHECK-NEXT: lsr [[REG2:x[0-9]+]], [[REG1]], #2
|
|
; CHECK-NEXT: str [[REG2]],
|
|
; CHECK-NEXT: ret
|
|
%0 = load i64, i64* %y, align 8
|
|
%and = and i64 %0, -8
|
|
%shr = lshr i64 %x, 16
|
|
%and1 = and i64 %shr, 7
|
|
%or = or i64 %and, %and1
|
|
%shr1 = lshr i64 %or, 2
|
|
store i64 %shr1, i64* %y, align 8
|
|
ret void
|
|
}
|
|
|
|
|
|
; Check if we can still catch bfm instruction when we drop some high bits
|
|
; (i64 version)
|
|
define void @fct9(i64* nocapture %y, i64 %x) nounwind optsize inlinehint ssp {
|
|
entry:
|
|
; CHECK-LABEL: fct9:
|
|
; CHECK: ldr [[REG1:x[0-9]+]],
|
|
; CHECK-NEXT: bfxil [[REG1]], x1, #16, #3
|
|
; lsr is an alias of ubfm
|
|
; CHECK-NEXT: lsl [[REG2:x[0-9]+]], [[REG1]], #2
|
|
; CHECK-NEXT: str [[REG2]],
|
|
; CHECK-NEXT: ret
|
|
%0 = load i64, i64* %y, align 8
|
|
%and = and i64 %0, -8
|
|
%shr = lshr i64 %x, 16
|
|
%and1 = and i64 %shr, 7
|
|
%or = or i64 %and, %and1
|
|
%shl = shl i64 %or, 2
|
|
store i64 %shl, i64* %y, align 8
|
|
ret void
|
|
}
|
|
|
|
; Check if we can catch bfm instruction when lsb is 0 (i.e., no lshr)
|
|
; (i32 version)
|
|
define void @fct10(i32* nocapture %y, i32 %x) nounwind optsize inlinehint ssp {
|
|
entry:
|
|
; CHECK-LABEL: fct10:
|
|
; CHECK: ldr [[REG1:w[0-9]+]],
|
|
; CHECK-NEXT: bfxil [[REG1]], w1, #0, #3
|
|
; lsl is an alias of ubfm
|
|
; CHECK-NEXT: lsl [[REG2:w[0-9]+]], [[REG1]], #2
|
|
; CHECK-NEXT: str [[REG2]],
|
|
; CHECK-NEXT: ret
|
|
%0 = load i32, i32* %y, align 8
|
|
%and = and i32 %0, -8
|
|
%and1 = and i32 %x, 7
|
|
%or = or i32 %and, %and1
|
|
%shl = shl i32 %or, 2
|
|
store i32 %shl, i32* %y, align 8
|
|
ret void
|
|
}
|
|
|
|
; Check if we can catch bfm instruction when lsb is 0 (i.e., no lshr)
|
|
; (i64 version)
|
|
define void @fct11(i64* nocapture %y, i64 %x) nounwind optsize inlinehint ssp {
|
|
entry:
|
|
; CHECK-LABEL: fct11:
|
|
; CHECK: ldr [[REG1:x[0-9]+]],
|
|
; CHECK-NEXT: bfxil [[REG1]], x1, #0, #3
|
|
; lsl is an alias of ubfm
|
|
; CHECK-NEXT: lsl [[REG2:x[0-9]+]], [[REG1]], #2
|
|
; CHECK-NEXT: str [[REG2]],
|
|
; CHECK-NEXT: ret
|
|
%0 = load i64, i64* %y, align 8
|
|
%and = and i64 %0, -8
|
|
%and1 = and i64 %x, 7
|
|
%or = or i64 %and, %and1
|
|
%shl = shl i64 %or, 2
|
|
store i64 %shl, i64* %y, align 8
|
|
ret void
|
|
}
|
|
|
|
define zeroext i1 @fct12bis(i32 %tmp2) unnamed_addr nounwind ssp align 2 {
|
|
; CHECK-LABEL: fct12bis:
|
|
; CHECK-NOT: and
|
|
; CHECK: ubfx w0, w0, #11, #1
|
|
%and.i.i = and i32 %tmp2, 2048
|
|
%tobool.i.i = icmp ne i32 %and.i.i, 0
|
|
ret i1 %tobool.i.i
|
|
}
|
|
|
|
; Check if we can still catch bfm instruction when we drop some high bits
|
|
; and some low bits
|
|
define void @fct12(i32* nocapture %y, i32 %x) nounwind optsize inlinehint ssp {
|
|
entry:
|
|
; CHECK-LABEL: fct12:
|
|
; CHECK: ldr [[REG1:w[0-9]+]],
|
|
; CHECK-NEXT: bfxil [[REG1]], w1, #16, #3
|
|
; lsr is an alias of ubfm
|
|
; CHECK-NEXT: ubfx [[REG2:w[0-9]+]], [[REG1]], #2, #28
|
|
; CHECK-NEXT: str [[REG2]],
|
|
; CHECK-NEXT: ret
|
|
%0 = load i32, i32* %y, align 8
|
|
%and = and i32 %0, -8
|
|
%shr = lshr i32 %x, 16
|
|
%and1 = and i32 %shr, 7
|
|
%or = or i32 %and, %and1
|
|
%shl = shl i32 %or, 2
|
|
%shr2 = lshr i32 %shl, 4
|
|
store i32 %shr2, i32* %y, align 8
|
|
ret void
|
|
}
|
|
|
|
; Check if we can still catch bfm instruction when we drop some high bits
|
|
; and some low bits
|
|
; (i64 version)
|
|
define void @fct13(i64* nocapture %y, i64 %x) nounwind optsize inlinehint ssp {
|
|
entry:
|
|
; CHECK-LABEL: fct13:
|
|
; CHECK: ldr [[REG1:x[0-9]+]],
|
|
; CHECK-NEXT: bfxil [[REG1]], x1, #16, #3
|
|
; lsr is an alias of ubfm
|
|
; CHECK-NEXT: ubfx [[REG2:x[0-9]+]], [[REG1]], #2, #60
|
|
; CHECK-NEXT: str [[REG2]],
|
|
; CHECK-NEXT: ret
|
|
%0 = load i64, i64* %y, align 8
|
|
%and = and i64 %0, -8
|
|
%shr = lshr i64 %x, 16
|
|
%and1 = and i64 %shr, 7
|
|
%or = or i64 %and, %and1
|
|
%shl = shl i64 %or, 2
|
|
%shr2 = lshr i64 %shl, 4
|
|
store i64 %shr2, i64* %y, align 8
|
|
ret void
|
|
}
|
|
|
|
|
|
; Check if we can still catch bfm instruction when we drop some high bits
|
|
; and some low bits
|
|
define void @fct14(i32* nocapture %y, i32 %x, i32 %x1) nounwind optsize inlinehint ssp {
|
|
entry:
|
|
; CHECK-LABEL: fct14:
|
|
; CHECK: ldr [[REG1:w[0-9]+]],
|
|
; CHECK-NEXT: bfxil [[REG1]], w1, #16, #8
|
|
; lsr is an alias of ubfm
|
|
; CHECK-NEXT: lsr [[REG2:w[0-9]+]], [[REG1]], #4
|
|
; CHECK-NEXT: bfxil [[REG2]], w2, #5, #3
|
|
; lsl is an alias of ubfm
|
|
; CHECK-NEXT: lsl [[REG3:w[0-9]+]], [[REG2]], #2
|
|
; CHECK-NEXT: str [[REG3]],
|
|
; CHECK-NEXT: ret
|
|
%0 = load i32, i32* %y, align 8
|
|
%and = and i32 %0, -256
|
|
%shr = lshr i32 %x, 16
|
|
%and1 = and i32 %shr, 255
|
|
%or = or i32 %and, %and1
|
|
%shl = lshr i32 %or, 4
|
|
%and2 = and i32 %shl, -8
|
|
%shr1 = lshr i32 %x1, 5
|
|
%and3 = and i32 %shr1, 7
|
|
%or1 = or i32 %and2, %and3
|
|
%shl1 = shl i32 %or1, 2
|
|
store i32 %shl1, i32* %y, align 8
|
|
ret void
|
|
}
|
|
|
|
; Check if we can still catch bfm instruction when we drop some high bits
|
|
; and some low bits
|
|
; (i64 version)
|
|
define void @fct15(i64* nocapture %y, i64 %x, i64 %x1) nounwind optsize inlinehint ssp {
|
|
entry:
|
|
; CHECK-LABEL: fct15:
|
|
; CHECK: ldr [[REG1:x[0-9]+]],
|
|
; CHECK-NEXT: bfxil [[REG1]], x1, #16, #8
|
|
; lsr is an alias of ubfm
|
|
; CHECK-NEXT: lsr [[REG2:x[0-9]+]], [[REG1]], #4
|
|
; CHECK-NEXT: bfxil [[REG2]], x2, #5, #3
|
|
; lsl is an alias of ubfm
|
|
; CHECK-NEXT: lsl [[REG3:x[0-9]+]], [[REG2]], #2
|
|
; CHECK-NEXT: str [[REG3]],
|
|
; CHECK-NEXT: ret
|
|
%0 = load i64, i64* %y, align 8
|
|
%and = and i64 %0, -256
|
|
%shr = lshr i64 %x, 16
|
|
%and1 = and i64 %shr, 255
|
|
%or = or i64 %and, %and1
|
|
%shl = lshr i64 %or, 4
|
|
%and2 = and i64 %shl, -8
|
|
%shr1 = lshr i64 %x1, 5
|
|
%and3 = and i64 %shr1, 7
|
|
%or1 = or i64 %and2, %and3
|
|
%shl1 = shl i64 %or1, 2
|
|
store i64 %shl1, i64* %y, align 8
|
|
ret void
|
|
}
|
|
|
|
; Check if we can still catch bfm instruction when we drop some high bits
|
|
; and some low bits and a masking operation has to be kept
|
|
define void @fct16(i32* nocapture %y, i32 %x) nounwind optsize inlinehint ssp {
|
|
entry:
|
|
; CHECK-LABEL: fct16:
|
|
; CHECK: ldr [[REG1:w[0-9]+]],
|
|
; Create the constant
|
|
; CHECK: movz [[REGCST:w[0-9]+]], #0x1a, lsl #16
|
|
; CHECK: movk [[REGCST]], #0x8160
|
|
; Do the masking
|
|
; CHECK: and [[REG2:w[0-9]+]], [[REG1]], [[REGCST]]
|
|
; CHECK-NEXT: bfxil [[REG2]], w1, #16, #3
|
|
; lsr is an alias of ubfm
|
|
; CHECK-NEXT: ubfx [[REG3:w[0-9]+]], [[REG2]], #2, #28
|
|
; CHECK-NEXT: str [[REG3]],
|
|
; CHECK-NEXT: ret
|
|
%0 = load i32, i32* %y, align 8
|
|
%and = and i32 %0, 1737056
|
|
%shr = lshr i32 %x, 16
|
|
%and1 = and i32 %shr, 7
|
|
%or = or i32 %and, %and1
|
|
%shl = shl i32 %or, 2
|
|
%shr2 = lshr i32 %shl, 4
|
|
store i32 %shr2, i32* %y, align 8
|
|
ret void
|
|
}
|
|
|
|
|
|
; Check if we can still catch bfm instruction when we drop some high bits
|
|
; and some low bits and a masking operation has to be kept
|
|
; (i64 version)
|
|
define void @fct17(i64* nocapture %y, i64 %x) nounwind optsize inlinehint ssp {
|
|
entry:
|
|
; CHECK-LABEL: fct17:
|
|
; CHECK: ldr [[REG1:x[0-9]+]],
|
|
; Create the constant
|
|
; CHECK: movz w[[REGCST:[0-9]+]], #0x1a, lsl #16
|
|
; CHECK: movk w[[REGCST]], #0x8160
|
|
; Do the masking
|
|
; CHECK: and [[REG2:x[0-9]+]], [[REG1]], x[[REGCST]]
|
|
; CHECK-NEXT: bfxil [[REG2]], x1, #16, #3
|
|
; lsr is an alias of ubfm
|
|
; CHECK-NEXT: ubfx [[REG3:x[0-9]+]], [[REG2]], #2, #60
|
|
; CHECK-NEXT: str [[REG3]],
|
|
; CHECK-NEXT: ret
|
|
%0 = load i64, i64* %y, align 8
|
|
%and = and i64 %0, 1737056
|
|
%shr = lshr i64 %x, 16
|
|
%and1 = and i64 %shr, 7
|
|
%or = or i64 %and, %and1
|
|
%shl = shl i64 %or, 2
|
|
%shr2 = lshr i64 %shl, 4
|
|
store i64 %shr2, i64* %y, align 8
|
|
ret void
|
|
}
|
|
|
|
define i64 @fct18(i32 %xor72) nounwind ssp {
|
|
; CHECK-LABEL: fct18:
|
|
; CHECK: ubfx x0, x0, #9, #8
|
|
%shr81 = lshr i32 %xor72, 9
|
|
%conv82 = zext i32 %shr81 to i64
|
|
%result = and i64 %conv82, 255
|
|
ret i64 %result
|
|
}
|
|
|
|
; Using the access to the global array to keep the instruction and control flow.
|
|
@first_ones = external global [65536 x i8]
|
|
|
|
; Function Attrs: nounwind readonly ssp
|
|
define i32 @fct19(i64 %arg1) nounwind readonly ssp {
|
|
; CHECK-LABEL: fct19:
|
|
entry:
|
|
%x.sroa.1.0.extract.shift = lshr i64 %arg1, 16
|
|
%x.sroa.1.0.extract.trunc = trunc i64 %x.sroa.1.0.extract.shift to i16
|
|
%x.sroa.3.0.extract.shift = lshr i64 %arg1, 32
|
|
%x.sroa.5.0.extract.shift = lshr i64 %arg1, 48
|
|
%tobool = icmp eq i64 %x.sroa.5.0.extract.shift, 0
|
|
br i1 %tobool, label %if.end, label %if.then
|
|
|
|
if.then: ; preds = %entry
|
|
%arrayidx3 = getelementptr inbounds [65536 x i8], [65536 x i8]* @first_ones, i64 0, i64 %x.sroa.5.0.extract.shift
|
|
%0 = load i8, i8* %arrayidx3, align 1
|
|
%conv = zext i8 %0 to i32
|
|
br label %return
|
|
|
|
; OPT-LABEL: if.end
|
|
if.end: ; preds = %entry
|
|
; OPT: lshr
|
|
; CHECK: ubfx [[REG1:x[0-9]+]], [[REG2:x[0-9]+]], #32, #16
|
|
%x.sroa.3.0.extract.trunc = trunc i64 %x.sroa.3.0.extract.shift to i16
|
|
%tobool6 = icmp eq i16 %x.sroa.3.0.extract.trunc, 0
|
|
; CHECK: cbz
|
|
br i1 %tobool6, label %if.end13, label %if.then7
|
|
|
|
; OPT-LABEL: if.then7
|
|
if.then7: ; preds = %if.end
|
|
; OPT: lshr
|
|
; "and" should be combined to "ubfm" while "ubfm" should be removed by cse.
|
|
; So neither of them should be in the assemble code.
|
|
; CHECK-NOT: and
|
|
; CHECK-NOT: ubfm
|
|
%idxprom10 = and i64 %x.sroa.3.0.extract.shift, 65535
|
|
%arrayidx11 = getelementptr inbounds [65536 x i8], [65536 x i8]* @first_ones, i64 0, i64 %idxprom10
|
|
%1 = load i8, i8* %arrayidx11, align 1
|
|
%conv12 = zext i8 %1 to i32
|
|
%add = add nsw i32 %conv12, 16
|
|
br label %return
|
|
|
|
; OPT-LABEL: if.end13
|
|
if.end13: ; preds = %if.end
|
|
; OPT: lshr
|
|
; OPT: trunc
|
|
; CHECK: ubfx [[REG3:x[0-9]+]], [[REG4:x[0-9]+]], #16, #16
|
|
%tobool16 = icmp eq i16 %x.sroa.1.0.extract.trunc, 0
|
|
; CHECK: cbz
|
|
br i1 %tobool16, label %return, label %if.then17
|
|
|
|
; OPT-LABEL: if.then17
|
|
if.then17: ; preds = %if.end13
|
|
; OPT: lshr
|
|
; "and" should be combined to "ubfm" while "ubfm" should be removed by cse.
|
|
; So neither of them should be in the assemble code.
|
|
; CHECK-NOT: and
|
|
; CHECK-NOT: ubfm
|
|
%idxprom20 = and i64 %x.sroa.1.0.extract.shift, 65535
|
|
%arrayidx21 = getelementptr inbounds [65536 x i8], [65536 x i8]* @first_ones, i64 0, i64 %idxprom20
|
|
%2 = load i8, i8* %arrayidx21, align 1
|
|
%conv22 = zext i8 %2 to i32
|
|
%add23 = add nsw i32 %conv22, 32
|
|
br label %return
|
|
|
|
return: ; preds = %if.end13, %if.then17, %if.then7, %if.then
|
|
; CHECK: ret
|
|
%retval.0 = phi i32 [ %conv, %if.then ], [ %add, %if.then7 ], [ %add23, %if.then17 ], [ 64, %if.end13 ]
|
|
ret i32 %retval.0
|
|
}
|
|
|
|
; Make sure we do not assert if the immediate in and is bigger than i64.
|
|
; PR19503.
|
|
; OPT-LABEL: @fct20
|
|
; OPT: lshr
|
|
; OPT-NOT: lshr
|
|
; OPT: ret
|
|
; CHECK-LABEL: fct20:
|
|
; CHECK: ret
|
|
define i80 @fct20(i128 %a, i128 %b) {
|
|
entry:
|
|
%shr = lshr i128 %a, 18
|
|
%conv = trunc i128 %shr to i80
|
|
%tobool = icmp eq i128 %b, 0
|
|
br i1 %tobool, label %then, label %end
|
|
then:
|
|
%and = and i128 %shr, 483673642326615442599424
|
|
%conv2 = trunc i128 %and to i80
|
|
br label %end
|
|
end:
|
|
%conv3 = phi i80 [%conv, %entry], [%conv2, %then]
|
|
ret i80 %conv3
|
|
}
|
|
|
|
; Check if we can still catch UBFX when "AND" is used by SHL.
|
|
; CHECK-LABEL: fct21:
|
|
; CHECK: ubfx
|
|
@arr = external global [8 x [64 x i64]]
|
|
define i64 @fct21(i64 %x) {
|
|
entry:
|
|
%shr = lshr i64 %x, 4
|
|
%and = and i64 %shr, 15
|
|
%arrayidx = getelementptr inbounds [8 x [64 x i64]], [8 x [64 x i64]]* @arr, i64 0, i64 0, i64 %and
|
|
%0 = load i64, i64* %arrayidx, align 8
|
|
ret i64 %0
|
|
}
|
|
|
|
define i16 @test_ignored_rightbits(i32 %dst, i32 %in) {
|
|
; CHECK-LABEL: test_ignored_rightbits:
|
|
|
|
%positioned_field = shl i32 %in, 3
|
|
%positioned_masked_field = and i32 %positioned_field, 120
|
|
%masked_dst = and i32 %dst, 7
|
|
%insertion = or i32 %masked_dst, %positioned_masked_field
|
|
; CHECK: {{bfm|bfi|bfxil}}
|
|
|
|
%shl16 = shl i32 %insertion, 8
|
|
%or18 = or i32 %shl16, %insertion
|
|
%conv19 = trunc i32 %or18 to i16
|
|
; CHECK: bfi {{w[0-9]+}}, {{w[0-9]+}}, #8, #7
|
|
|
|
ret i16 %conv19
|
|
}
|