File: share_code_in_preheader.ll

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-3~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm-proposed-updates
  • size: 1,998,492 kB
  • sloc: cpp: 6,951,680; ansic: 1,486,157; asm: 913,598; python: 232,024; f90: 80,126; objc: 75,281; lisp: 37,276; pascal: 16,990; sh: 10,009; ml: 5,058; perl: 4,724; awk: 3,523; makefile: 3,167; javascript: 2,504; xml: 892; fortran: 664; cs: 573
file content (27 lines) | stat: -rw-r--r-- 1,228 bytes parent folder | download | duplicates (12)
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
26
27
; RUN: opt < %s -loop-reduce -S | grep mul | count 1
; LSR should not make two copies of the Q*L expression in the preheader!

define i8 @test(ptr %A, ptr %B, i32 %L, i32 %Q, i32 %N.s) {
entry:
	%tmp.6 = mul i32 %Q, %L		; <i32> [#uses=1]
	%N = bitcast i32 %N.s to i32		; <i32> [#uses=1]
	br label %no_exit
no_exit:		; preds = %no_exit, %entry
	%indvar.ui = phi i32 [ 0, %entry ], [ %indvar.next, %no_exit ]		; <i32> [#uses=2]
	%Sum.0.0 = phi i8 [ 0, %entry ], [ %tmp.21, %no_exit ]		; <i8> [#uses=1]
	%indvar = bitcast i32 %indvar.ui to i32		; <i32> [#uses=1]
	%N_addr.0.0 = sub i32 %N.s, %indvar		; <i32> [#uses=1]
	%tmp.8 = add i32 %N_addr.0.0, %tmp.6		; <i32> [#uses=2]
	%tmp.9 = getelementptr i8, ptr %A, i32 %tmp.8		; <ptr> [#uses=1]
	%tmp.10 = load i8, ptr %tmp.9		; <i8> [#uses=1]
	%tmp.17 = getelementptr i8, ptr %B, i32 %tmp.8		; <ptr> [#uses=1]
	%tmp.18 = load i8, ptr %tmp.17		; <i8> [#uses=1]
	%tmp.19 = sub i8 %tmp.10, %tmp.18		; <i8> [#uses=1]
	%tmp.21 = add i8 %tmp.19, %Sum.0.0		; <i8> [#uses=2]
	%indvar.next = add i32 %indvar.ui, 1		; <i32> [#uses=2]
	%exitcond = icmp eq i32 %indvar.next, %N		; <i1> [#uses=1]
	br i1 %exitcond, label %loopexit, label %no_exit
loopexit:		; preds = %no_exit
	ret i8 %tmp.21
}