Mercurial > hg > CbC > CbC_llvm

comparison test/Analysis/BasicAA/2003-05-21-GEP-Problem.ll @ 0:95c75e76d11b LLVM3.4

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
LLVM 3.4
author Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
date Thu, 12 Dec 2013 13:56:28 +0900
parents
children afa8332a0e37
comparison
equal deleted inserted replaced
-1:000000000000 0:95c75e76d11b
1 ; RUN: opt < %s -basicaa -licm -disable-output
2 %struct..apr_array_header_t = type { i32*, i32, i32, i32, i8* }
3 %struct..apr_table_t = type { %struct..apr_array_header_t, i32, [32 x i32], [32 x i32] }
4
5 define void @table_reindex(%struct..apr_table_t* %t.1) { ; No predecessors!
6 br label %loopentry
7
8 loopentry: ; preds = %0, %no_exit
9 %tmp.101 = getelementptr %struct..apr_table_t* %t.1, i64 0, i32 0, i32 2
10 %tmp.11 = load i32* %tmp.101 ; <i32> [#uses=0]
11 br i1 false, label %no_exit, label %UnifiedExitNode
12
13 no_exit: ; preds = %loopentry
14 %tmp.25 = sext i32 0 to i64 ; <i64> [#uses=1]
15 %tmp.261 = getelementptr %struct..apr_table_t* %t.1, i64 0, i32 3, i64 %tmp.25 ; <i32*> [#uses=1]
16 store i32 0, i32* %tmp.261
17 br label %loopentry
18
19 UnifiedExitNode: ; preds = %loopentry
20 ret void
21 }