mirror of
https://github.com/RPCS3/llvm.git
synced 2026-01-31 01:25:19 +01:00
cfa435f79b
The configure script no longer tells us that we're configuring for SparcV9 specifically. 2004-06-17-UnorderedCompares may work on SparcV8, but it's experiental anyway. 2005-02-20-AggregateSAVEEXPR should fail on any Solaris machine, as Solaris doesn't provide complex number support. git-svn-id: https://llvm.org/svn/llvm-project/llvm/branches/release_16@24155 91177308-0d34-0410-b5e6-96231b3b80d8
21 lines
593 B
LLVM
21 lines
593 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: analyze %s -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
|
|
}
|
|
|