mirror of
https://github.com/RPCSX/llvm.git
synced 2024-12-14 15:39:00 +00:00
69ccadd753
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@32115 91177308-0d34-0410-b5e6-96231b3b80d8
21 lines
625 B
LLVM
21 lines
625 B
LLVM
; This testcase is used to make sure that the outer element of arrays are
|
|
; folded completely away if possible. This is a very common case, so it should
|
|
; be efficient.
|
|
;
|
|
; RUN: llvm-upgrade < %s | llvm-as | opt -analyze -tddatastructure
|
|
;
|
|
implementation
|
|
|
|
sbyte* %merge1([100 x sbyte] *%A, long %N) {
|
|
%P = getelementptr [100 x sbyte] *%A, long 0, long %N
|
|
ret sbyte* %P
|
|
}
|
|
|
|
sbyte* %merge2([100 x sbyte] *%A, long %N) {
|
|
; The graph for this example should end up exactly the same as for merge1
|
|
%P1 = getelementptr [100 x sbyte] *%A, long 0, long 0
|
|
%P2 = getelementptr sbyte* %P1, long %N
|
|
ret sbyte* %P2
|
|
}
|
|
|