File: convergent.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 (25 lines) | stat: -rw-r--r-- 529 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
 
; RUN: opt < %s -S -passes=loop-simplify | FileCheck %s

; Don't separate out nested loops if a convergent call is present

; CHECK-NOT: BB1.outer
; CHECK: BB1.backedge

define i32 @test(i1 %loop_cond, i1 %exit_cond, i32 %init) {
entry:
  br label %BB1

BB1:
  %indvar = phi i32 [%indvar, %BB1], [%inc, %BB2], [%init, %entry]
  call void @f() convergent
  br i1 %loop_cond, label %BB1, label %BB2

BB2:
  %inc = add i32 %indvar, 1
  br i1 %exit_cond, label %exit, label %BB1

exit:
  ret i32 %inc
}

declare void @f() convergent