File: mulfactor.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 (14 lines) | stat: -rw-r--r-- 463 bytes parent folder | download | duplicates (4) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
 
; RUN: opt < %s -reassociate -instcombine -S | grep mul | count 2

; This should have exactly 2 multiplies when we're done.

define i32 @f(i32 %a, i32 %b) {
	%tmp.2 = mul i32 %a, %a		; <i32> [#uses=1]
	%tmp.5 = shl i32 %a, 1		; <i32> [#uses=1]
	%tmp.6 = mul i32 %tmp.5, %b		; <i32> [#uses=1]
	%tmp.10 = mul i32 %b, %b		; <i32> [#uses=1]
	%tmp.7 = add i32 %tmp.6, %tmp.2		; <i32> [#uses=1]
	%tmp.11 = add i32 %tmp.7, %tmp.10		; <i32> [#uses=1]
	ret i32 %tmp.11
}