File: 2003-12-10-IndVarDeadCode.ll

package info (click to toggle)
llvm 2.2-12
  • links: PTS, VCS
  • area: main
  • in suites: lenny
  • size: 38,648 kB
  • ctags: 28,258
  • sloc: cpp: 215,479; sh: 12,132; ansic: 10,002; yacc: 5,525; perl: 2,352; ml: 1,580; makefile: 956; pascal: 718; lex: 602; exp: 320; ada: 193; lisp: 160; csh: 116; objc: 59; python: 59; tcl: 20
file content (24 lines) | stat: -rw-r--r-- 756 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
; The induction variable canonicalization pass shouldn't leave dead
; instructions laying around!
;
; RUN: llvm-upgrade < %s | llvm-as | opt -indvars | llvm-dis | \
; RUN:   not grep {#uses=0}

int %mul(int %x, int %y) {
entry:
	br label %tailrecurse

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

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

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