File: unsimplified-loop.ll

package info (click to toggle)
llvm-toolchain-14 1%3A14.0.6-12
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,496,180 kB
  • sloc: cpp: 5,593,972; ansic: 986,872; asm: 585,869; python: 184,223; objc: 72,530; lisp: 31,119; f90: 27,793; javascript: 9,780; pascal: 9,762; sh: 9,482; perl: 7,468; ml: 5,432; awk: 3,523; makefile: 2,538; xml: 953; cs: 573; fortran: 567
file content (29 lines) | stat: -rw-r--r-- 715 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
24
25
26
27
28
29
 
; RUN: opt -disable-output "-passes=print<scalar-evolution>" < %s 2>&1 | 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
}