File: 2012-05-18-LoopPredRecurse.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 (31 lines) | stat: -rw-r--r-- 1,058 bytes parent folder | download | duplicates (8) 
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
30
31
 
; RUN: opt < %s -iv-users -S -disable-output
; RUN: opt < %s -passes='require<ivusers>' -S -disable-output
;
; PR12868: Infinite recursion:
; getUDivExpr()->getZeroExtendExpr()->isLoopBackedgeGuardedBy()
;
; We actually want SCEV simplification to fail gracefully in this
; case, so there's no output to check, just the absence of stack overflow.

@c = common global i8 0, align 1

define i32 @func() {
entry:
  br label %for.cond

for.cond:                                         ; preds = %for.body, %entry
  %storemerge = phi i8 [ -1, %entry ], [ %inc, %for.body ]
  %ui.0 = phi i32 [ undef, %entry ], [ %div, %for.body ]
  %tobool = icmp eq i8 %storemerge, 0
  br i1 %tobool, label %for.end, label %for.body

for.body:                                         ; preds = %for.cond
  %conv = sext i8 %storemerge to i32
  %div = lshr i32 %conv, 1
  %tobool2 = icmp eq i32 %div, 0
  %inc = add i8 %storemerge, 1
  br i1 %tobool2, label %for.cond, label %for.end

for.end:                                          ; preds = %for.body, %for.cond
  ret i32 0
}