File: unsimplified-loop.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 (29 lines) | stat: -rw-r--r-- 687 bytes parent folder | download | duplicates (22) 
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
28
29
 
; RUN: opt -analyze -scalar-evolution < %s | FileCheck %s

; This loop has no preheader, multiple backedges, etc., but ScalarEvolution
; should still be able to analyze it.

; CHECK: %i = phi i64 [ 5, %entry ], [ 5, %alt ], [ %i.next, %loop.a ], [ %i.next, %loop.b ]
; CHECK-NEXT: -->  {5,+,1}<%loop>

define void @foo(i1 %p, i1 %q, i1 %s, i1 %u) {
entry:
  br i1 %p, label %loop, label %alt

alt:
  br i1 %s, label %loop, label %exit

loop:
  %i = phi i64 [ 5, %entry ], [ 5, %alt ], [ %i.next, %loop.a ], [ %i.next, %loop.b ]
  %i.next = add i64 %i, 1
  br i1 %q, label %loop.a, label %loop.b

loop.a:
  br label %loop

loop.b:
  br i1 %u, label %loop, label %exit

exit:
  ret void
}