File: apint-basictest3.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 (23 lines) | stat: -rw-r--r-- 546 bytes parent folder | download | duplicates (16) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
 
; This is a basic correctness check for constant propagation.  It tests the
; basic arithmetic operations.


; RUN: opt < %s -passes=sccp -S | not grep mul
; RUN: opt < %s -passes=sccp -S | not grep umod

define i128 @test(i1 %B) {
	br i1 %B, label %BB1, label %BB2
BB1:
	%t1 = add i128 0, 1
        %t2 = sub i128 0, %t1
        %t3 = mul i128 %t2, -1
	br label %BB3
BB2:
        %f1 = udiv i128 -1, 1
        %f2 = add i128 %f1, 1
        %f3 = urem i128 %f2, 2121
	br label %BB3
BB3:
	%Ret = phi i128 [%t3, %BB1], [%f3, %BB2]
	ret i128 %Ret
}