File: 2003-12-10-IndVarDeadCode.ll

package info (click to toggle)
llvm 2.6-9.1
  • links: PTS
  • area: main
  • in suites: squeeze
  • size: 57,604 kB
  • ctags: 44,336
  • sloc: cpp: 344,766; sh: 12,407; ansic: 10,617; ada: 3,070; ml: 2,505; perl: 2,496; makefile: 1,426; pascal: 1,163; exp: 389; asm: 307; python: 298; objc: 260; lisp: 182; csh: 117; xml: 38; f90: 36; tcl: 20
file content (25 lines) | stat: -rw-r--r-- 888 bytes parent folder | download 
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
 
; The induction variable canonicalization pass shouldn't leave dead
; instructions laying around!
;
; RUN: llvm-as < %s | opt -indvars | llvm-dis | \
; RUN:   not grep {#uses=0}

define i32 @mul(i32 %x, i32 %y) {
entry:
        br label %tailrecurse

tailrecurse:            ; preds = %endif, %entry
        %accumulator.tr = phi i32 [ %x, %entry ], [ %tmp.9, %endif ]            ; <i32> [#uses=2]
        %y.tr = phi i32 [ %y, %entry ], [ %tmp.8, %endif ]              ; <i32> [#uses=2]
        %tmp.1 = icmp eq i32 %y.tr, 0           ; <i1> [#uses=1]
        br i1 %tmp.1, label %return, label %endif

endif:          ; preds = %tailrecurse
        %tmp.8 = add i32 %y.tr, -1              ; <i32> [#uses=1]
        %tmp.9 = add i32 %accumulator.tr, %x            ; <i32> [#uses=1]
        br label %tailrecurse

return:         ; preds = %tailrecurse
        ret i32 %accumulator.tr
}