File: trip-count4.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 (32 lines) | stat: -rw-r--r-- 1,383 bytes parent folder | download | duplicates (2)
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
32
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
; RUN: opt < %s -analyze -scalar-evolution -scalar-evolution-classify-expressions=0 | FileCheck %s

; ScalarEvolution should be able to compute a loop exit value for %indvar.i8.

define void @another_count_down_signed(double* %d, i64 %n) nounwind {
; CHECK-LABEL: 'another_count_down_signed'
; CHECK-NEXT:  Determining loop execution counts for: @another_count_down_signed
; CHECK-NEXT:  Loop %loop: backedge-taken count is (-11 + %n)
; CHECK-NEXT:  Loop %loop: max backedge-taken count is -1
; CHECK-NEXT:  Loop %loop: Predicated backedge-taken count is (-11 + %n)
; CHECK-NEXT:   Predicates:
; CHECK:       Loop %loop: Trip multiple is 1
;
entry:
  br label %loop

loop:		; preds = %loop, %entry
  %indvar = phi i64 [ %n, %entry ], [ %indvar.next, %loop ]		; <i64> [#uses=4]
  %s0 = shl i64 %indvar, 8		; <i64> [#uses=1]
  %indvar.i8 = ashr i64 %s0, 8		; <i64> [#uses=1]
  %t0 = getelementptr double, double* %d, i64 %indvar.i8		; <double*> [#uses=2]
  %t1 = load double, double* %t0		; <double> [#uses=1]
  %t2 = fmul double %t1, 1.000000e-01		; <double> [#uses=1]
  store double %t2, double* %t0
  %indvar.next = sub i64 %indvar, 1		; <i64> [#uses=2]
  %exitcond = icmp eq i64 %indvar.next, 10		; <i1> [#uses=1]
  br i1 %exitcond, label %return, label %loop

return:		; preds = %loop
  ret void
}