6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-12-13 20:32:21 +00:00
Code Issues Projects Releases Wiki Activity

Hopefully final tweak to this testcase

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@5626 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2003-02-26 16:18:00 +00:00
parent 7b9b1f9ad3
commit 24a0bee387
2 changed files with 10 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
test/Analysis/BasicAA/licmtest.ll
View File

@ -1,10 +1,9 @@
; Test that LICM uses basicaa to do alias analysis, which is capable of ; Test that LICM uses basicaa to do alias analysis, which is capable of
; disambiguating some obvious cases. The ToRemove load should be eliminated ; disambiguating some obvious cases. If LICM is able to disambiguate the
; in this testcase. This testcase was carefully contrived so that GCSE would ; two pointers, then the load should be hoisted, and the store sunk. Thus
; not be able to eliminate the load itself, without licm's help. This is ; the loop becomes empty and can be deleted by ADCE.
; because, for GCSE, the load is killed by the dummy basic block.
; RUN: if as < %s | opt -basicaa -licm -load-vn -gcse -instcombine | dis | grep ToRemove ; RUN: if as < %s | opt -basicaa -licm --adce | dis | grep Loop
; RUN: then exit 1 ; RUN: then exit 1
; RUN: else exit 0 ; RUN: else exit 0
; RUN: fi ; RUN: fi
@ -15,7 +14,7 @@ implementation
int %test(bool %c) { int %test(bool %c) {
%Atmp = load int* %A %Atmp = load int* %A
br bool %c, label %Dummy, label %Loop br label %Loop
Loop: Loop:
%ToRemove = load int* %A %ToRemove = load int* %A
store int %Atmp, int* %B ; Store cannot alias %A store int %Atmp, int* %B ; Store cannot alias %A
@ -24,9 +23,5 @@ Loop:
Out: Out:
%X = sub int %ToRemove, %Atmp %X = sub int %ToRemove, %Atmp
ret int %X ret int %X
Dummy:
store int 7, int* %A
br label %Loop
} }

15
test/Transforms/BasicAA/licmtest.ll
View File

@ -1,10 +1,9 @@
; Test that LICM uses basicaa to do alias analysis, which is capable of ; Test that LICM uses basicaa to do alias analysis, which is capable of
; disambiguating some obvious cases. The ToRemove load should be eliminated ; disambiguating some obvious cases. If LICM is able to disambiguate the
; in this testcase. This testcase was carefully contrived so that GCSE would ; two pointers, then the load should be hoisted, and the store sunk. Thus
; not be able to eliminate the load itself, without licm's help. This is ; the loop becomes empty and can be deleted by ADCE.
; because, for GCSE, the load is killed by the dummy basic block.
; RUN: if as < %s | opt -basicaa -licm -load-vn -gcse -instcombine | dis | grep ToRemove ; RUN: if as < %s | opt -basicaa -licm --adce | dis | grep Loop
; RUN: then exit 1 ; RUN: then exit 1
; RUN: else exit 0 ; RUN: else exit 0
; RUN: fi ; RUN: fi
@ -15,7 +14,7 @@ implementation
int %test(bool %c) { int %test(bool %c) {
%Atmp = load int* %A %Atmp = load int* %A
br bool %c, label %Dummy, label %Loop br label %Loop
Loop: Loop:
%ToRemove = load int* %A %ToRemove = load int* %A
store int %Atmp, int* %B ; Store cannot alias %A store int %Atmp, int* %B ; Store cannot alias %A
@ -24,9 +23,5 @@ Loop:
Out: Out:
%X = sub int %ToRemove, %Atmp %X = sub int %ToRemove, %Atmp
ret int %X ret int %X
Dummy:
store int 7, int* %A
br label %Loop
} }