File: convergent.ll

package info (click to toggle)
llvm-toolchain-11 1%3A11.0.1-2
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 995,808 kB
  • sloc: cpp: 4,767,656; ansic: 760,916; asm: 477,436; python: 170,940; objc: 69,804; lisp: 29,914; sh: 23,855; f90: 18,173; pascal: 7,551; perl: 7,471; ml: 5,603; awk: 3,489; makefile: 2,573; xml: 915; cs: 573; fortran: 503; javascript: 452
file content (25 lines) | stat: -rw-r--r-- 522 bytes parent folder | download | duplicates (9) 
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 -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