mirror of
https://github.com/RPCS3/llvm.git
synced 2025-02-11 13:29:36 +00:00
7c9c6ed761
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
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@230794 91177308-0d34-0410-b5e6-96231b3b80d8
70 lines
1.6 KiB
LLVM
70 lines
1.6 KiB
LLVM
; Test if the !invariant.load metadata is maintained by GVN.
|
|
; RUN: opt -basicaa -gvn -S < %s | FileCheck %s
|
|
|
|
define i32 @test1(i32* nocapture %p, i8* nocapture %q) {
|
|
; CHECK-LABEL: test1
|
|
; CHECK: %x = load i32, i32* %p, align 4, !invariant.load !0
|
|
; CHECK-NOT: %y = load
|
|
entry:
|
|
%x = load i32, i32* %p, align 4, !invariant.load !0
|
|
%conv = trunc i32 %x to i8
|
|
store i8 %conv, i8* %q, align 1
|
|
%y = load i32, i32* %p, align 4, !invariant.load !0
|
|
%add = add i32 %y, 1
|
|
ret i32 %add
|
|
}
|
|
|
|
define i32 @test2(i32* nocapture %p, i8* nocapture %q) {
|
|
; CHECK-LABEL: test2
|
|
; CHECK-NOT: !invariant.load
|
|
; CHECK-NOT: %y = load
|
|
entry:
|
|
%x = load i32, i32* %p, align 4
|
|
%conv = trunc i32 %x to i8
|
|
store i8 %conv, i8* %q, align 1
|
|
%y = load i32, i32* %p, align 4, !invariant.load !0
|
|
%add = add i32 %y, 1
|
|
ret i32 %add
|
|
}
|
|
|
|
; With the invariant.load metadata, what would otherwise
|
|
; be a case for PRE becomes a full redundancy.
|
|
define i32 @test3(i1 %cnd, i32* %p, i32* %q) {
|
|
; CHECK-LABEL: test3
|
|
; CHECK-NOT: load
|
|
entry:
|
|
%v1 = load i32, i32* %p
|
|
br i1 %cnd, label %bb1, label %bb2
|
|
|
|
bb1:
|
|
store i32 5, i32* %q
|
|
br label %bb2
|
|
|
|
bb2:
|
|
%v2 = load i32, i32* %p, !invariant.load !0
|
|
%res = sub i32 %v1, %v2
|
|
ret i32 %res
|
|
}
|
|
|
|
; This test is here to document a case which doesn't optimize
|
|
; as well as it could.
|
|
define i32 @test4(i1 %cnd, i32* %p, i32* %q) {
|
|
; CHECK-LABEL: test4
|
|
; %v2 is redundant, but GVN currently doesn't catch that
|
|
entry:
|
|
%v1 = load i32, i32* %p, !invariant.load !0
|
|
br i1 %cnd, label %bb1, label %bb2
|
|
|
|
bb1:
|
|
store i32 5, i32* %q
|
|
br label %bb2
|
|
|
|
bb2:
|
|
%v2 = load i32, i32* %p
|
|
%res = sub i32 %v1, %v2
|
|
ret i32 %res
|
|
}
|
|
|
|
!0 = !{ }
|
|
|