File: 2008-07-02-array-indexing.ll

package info (click to toggle)
llvm-2.7 2.7-6
  • links: PTS
  • area: main
  • in suites: squeeze
  • size: 59,992 kB
  • ctags: 49,499
  • sloc: cpp: 373,792; ansic: 16,885; sh: 12,614; asm: 6,809; ada: 3,083; ml: 2,942; python: 2,671; perl: 2,404; makefile: 1,691; pascal: 1,235; exp: 399; objc: 291; lisp: 184; csh: 117; xml: 38; f90: 36
file content (25 lines) | stat: -rw-r--r-- 717 bytes parent folder | download | duplicates (5) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
 
; RUN: opt < %s -argpromotion -S > %t
; RUN: cat %t | grep {define.*@callee(.*i32\\*}
; PR2498

; This test tries to convince argpromotion about promoting the load from %A + 2,
; because there is a load of %A in the entry block
define internal i32 @callee(i1 %C, i32* %A) {
entry:
        ; Unconditonally load the element at %A
        %A.0 = load i32* %A
        br i1 %C, label %T, label %F
T:
        ret i32 %A.0
F:
        ; Load the element at offset two from %A. This should not be promoted!
        %A.2 = getelementptr i32* %A, i32 2
        %R = load i32* %A.2
        ret i32 %R
}

define i32 @foo() {
        %X = call i32 @callee(i1 false, i32* null)             ; <i32> [#uses=1]
        ret i32 %X
}