llvm/test/Analysis/BasicAA/2003-05-21-GEP-Problem.ll
Chris Lattner 6011733e79 Trim testcase a bit
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@6269 91177308-0d34-0410-b5e6-96231b3b80d8
2003-05-21 19:55:10 +00:00

22 lines
820 B
LLVM

; RUN: as < %s | opt -licm -disable-output
%struct..apr_array_header_t = type { int*, int, int, int, sbyte* }
%struct..apr_table_t = type { %struct..apr_array_header_t, uint, [32 x int], [32 x int] }
void %table_reindex(%struct..apr_table_t* %t.1) { ; No predecessors!
br label %loopentry
loopentry: ; preds = %0, %no_exit
%tmp.101 = getelementptr %struct..apr_table_t* %t.1, long 0, ubyte 0, ubyte 2 ; <int*> [#uses=1]
%tmp.11 = load int* %tmp.101 ; <int> [#uses=0]
br bool false, label %no_exit, label %UnifiedExitNode
no_exit: ; preds = %loopentry
%tmp.25 = cast int 0 to long ; <long> [#uses=1]
%tmp.261 = getelementptr %struct..apr_table_t* %t.1, long 0, ubyte 3, long %tmp.25 ; <int*> [#uses=1]
store int 0, int* %tmp.261
br label %loopentry
UnifiedExitNode: ; preds = %loopentry
ret void
}