New testcase for the possible array merging scenarios

llvm-svn: 4462
This commit is contained in:
Chris Lattner 2002-10-31 04:48:32 +00:00
parent f6cfaedcff
commit dfe8759e01
1 changed files with 38 additions and 0 deletions

View File

@ -0,0 +1,38 @@
%crazy = type [2 x { [2 x sbyte], short } ]
implementation
sbyte *%test1(%crazy* %P1) { ; No merging, constant indexing
%P = getelementptr %crazy* %P1, long 0, long 0, ubyte 0, long 1
ret sbyte *%P
}
sbyte *%test2(%crazy* %P1) { ; No merging, constant indexing
%P = getelementptr %crazy* %P1, long 0, long 1, ubyte 0, long 0
ret sbyte *%P
}
sbyte *%test3(%crazy* %P1) { ; No merging, constant indexing, must handle outter index
%P = getelementptr %crazy* %P1, long -1, long 0, ubyte 0, long 0
ret sbyte *%P
}
sbyte *%mtest1(%crazy* %P1, long %idx) { ; Merging deepest array
%P = getelementptr %crazy* %P1, long 0, long 0, ubyte 0, long %idx
ret sbyte *%P
}
sbyte *%mtest2(%crazy* %P1, long %idx) { ; Merge top array
%P = getelementptr %crazy* %P1, long 0, long %idx, ubyte 0, long 1
ret sbyte *%P
}
sbyte *%mtest3(%crazy* %P1, long %idx) { ; Merge array %crazy is in
%P = getelementptr %crazy* %P1, long %idx, long 0, ubyte 0, long 1
ret sbyte *%P
}
sbyte *%m2test1(%crazy* %P1, long %idx) { ; Merge two arrays
%P = getelementptr %crazy* %P1, long 0, long %idx, ubyte 0, long %idx
ret sbyte *%P
}