mirror of
https://github.com/RPCSX/llvm.git
synced 2025-01-12 07:22:12 +00:00
1ef70ff39b
Now that `Metadata` is typeless, reflect that in the assembly. These
are the matching assembly changes for the metadata/value split in
r223802.
- Only use the `metadata` type when referencing metadata from a call
intrinsic -- i.e., only when it's used as a `Value`.
- Stop pretending that `ValueAsMetadata` is wrapped in an `MDNode`
when referencing it from call intrinsics.
So, assembly like this:
define @foo(i32 %v) {
call void @llvm.foo(metadata !{i32 %v}, metadata !0)
call void @llvm.foo(metadata !{i32 7}, metadata !0)
call void @llvm.foo(metadata !1, metadata !0)
call void @llvm.foo(metadata !3, metadata !0)
call void @llvm.foo(metadata !{metadata !3}, metadata !0)
ret void, !bar !2
}
!0 = metadata !{metadata !2}
!1 = metadata !{i32* @global}
!2 = metadata !{metadata !3}
!3 = metadata !{}
turns into this:
define @foo(i32 %v) {
call void @llvm.foo(metadata i32 %v, metadata !0)
call void @llvm.foo(metadata i32 7, metadata !0)
call void @llvm.foo(metadata i32* @global, metadata !0)
call void @llvm.foo(metadata !3, metadata !0)
call void @llvm.foo(metadata !{!3}, metadata !0)
ret void, !bar !2
}
!0 = !{!2}
!1 = !{i32* @global}
!2 = !{!3}
!3 = !{}
I wrote an upgrade script that handled almost all of the tests in llvm
and many of the tests in cfe (even handling many `CHECK` lines). I've
attached it (or will attach it in a moment if you're speedy) to PR21532
to help everyone update their out-of-tree testcases.
This is part of PR21532.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@224257 91177308-0d34-0410-b5e6-96231b3b80d8
121 lines
2.9 KiB
LLVM
121 lines
2.9 KiB
LLVM
; RUN: opt < %s -instcombine -S | FileCheck %s
|
|
|
|
define void @test1(i32* %P) {
|
|
store i32 undef, i32* %P
|
|
store i32 123, i32* undef
|
|
store i32 124, i32* null
|
|
ret void
|
|
; CHECK-LABEL: @test1(
|
|
; CHECK-NEXT: store i32 123, i32* undef
|
|
; CHECK-NEXT: store i32 undef, i32* null
|
|
; CHECK-NEXT: ret void
|
|
}
|
|
|
|
define void @test2(i32* %P) {
|
|
%X = load i32* %P ; <i32> [#uses=1]
|
|
%Y = add i32 %X, 0 ; <i32> [#uses=1]
|
|
store i32 %Y, i32* %P
|
|
ret void
|
|
; CHECK-LABEL: @test2(
|
|
; CHECK-NEXT: ret void
|
|
}
|
|
|
|
;; Simple sinking tests
|
|
|
|
; "if then else"
|
|
define i32 @test3(i1 %C) {
|
|
%A = alloca i32
|
|
br i1 %C, label %Cond, label %Cond2
|
|
|
|
Cond:
|
|
store i32 -987654321, i32* %A
|
|
br label %Cont
|
|
|
|
Cond2:
|
|
store i32 47, i32* %A
|
|
br label %Cont
|
|
|
|
Cont:
|
|
%V = load i32* %A
|
|
ret i32 %V
|
|
; CHECK-LABEL: @test3(
|
|
; CHECK-NOT: alloca
|
|
; CHECK: Cont:
|
|
; CHECK-NEXT: %storemerge = phi i32 [ 47, %Cond2 ], [ -987654321, %Cond ]
|
|
; CHECK-NEXT: ret i32 %storemerge
|
|
}
|
|
|
|
; "if then"
|
|
define i32 @test4(i1 %C) {
|
|
%A = alloca i32
|
|
store i32 47, i32* %A
|
|
br i1 %C, label %Cond, label %Cont
|
|
|
|
Cond:
|
|
store i32 -987654321, i32* %A
|
|
br label %Cont
|
|
|
|
Cont:
|
|
%V = load i32* %A
|
|
ret i32 %V
|
|
; CHECK-LABEL: @test4(
|
|
; CHECK-NOT: alloca
|
|
; CHECK: Cont:
|
|
; CHECK-NEXT: %storemerge = phi i32 [ -987654321, %Cond ], [ 47, %0 ]
|
|
; CHECK-NEXT: ret i32 %storemerge
|
|
}
|
|
|
|
; "if then"
|
|
define void @test5(i1 %C, i32* %P) {
|
|
store i32 47, i32* %P, align 1
|
|
br i1 %C, label %Cond, label %Cont
|
|
|
|
Cond:
|
|
store i32 -987654321, i32* %P, align 1
|
|
br label %Cont
|
|
|
|
Cont:
|
|
ret void
|
|
; CHECK-LABEL: @test5(
|
|
; CHECK: Cont:
|
|
; CHECK-NEXT: %storemerge = phi i32
|
|
; CHECK-NEXT: store i32 %storemerge, i32* %P, align 1
|
|
; CHECK-NEXT: ret void
|
|
}
|
|
|
|
|
|
; PR14753 - merging two stores should preserve the TBAA tag.
|
|
define void @test6(i32 %n, float* %a, i32* %gi) nounwind uwtable ssp {
|
|
entry:
|
|
store i32 42, i32* %gi, align 4, !tbaa !0
|
|
br label %for.cond
|
|
|
|
for.cond: ; preds = %for.body, %entry
|
|
%storemerge = phi i32 [ 0, %entry ], [ %inc, %for.body ]
|
|
%0 = load i32* %gi, align 4, !tbaa !0
|
|
%cmp = icmp slt i32 %0, %n
|
|
br i1 %cmp, label %for.body, label %for.end
|
|
|
|
for.body: ; preds = %for.cond
|
|
%idxprom = sext i32 %0 to i64
|
|
%arrayidx = getelementptr inbounds float* %a, i64 %idxprom
|
|
store float 0.000000e+00, float* %arrayidx, align 4, !tbaa !3
|
|
%1 = load i32* %gi, align 4, !tbaa !0
|
|
%inc = add nsw i32 %1, 1
|
|
store i32 %inc, i32* %gi, align 4, !tbaa !0
|
|
br label %for.cond
|
|
|
|
for.end: ; preds = %for.cond
|
|
ret void
|
|
; CHECK-LABEL: @test6(
|
|
; CHECK: for.cond:
|
|
; CHECK-NEXT: phi i32 [ 42
|
|
; CHECK-NEXT: store i32 %storemerge, i32* %gi, align 4, !tbaa !0
|
|
}
|
|
|
|
!0 = !{!4, !4, i64 0}
|
|
!1 = !{!"omnipotent char", !2}
|
|
!2 = !{!"Simple C/C++ TBAA"}
|
|
!3 = !{!"float", !1}
|
|
!4 = !{!"int", !1}
|