Home | History | Annotate | Download | only in ScalarEvolution
      1 ; RUN: opt < %s -analyze -scalar-evolution -scalar-evolution-max-iterations=0 | FileCheck %s
      2 ; PR1101
      3 
      4 target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
      5 target triple = "x86_64-unknown-linux-gnu"
      6 
      7 @A = weak global [1000 x i32] zeroinitializer, align 32         
      8 
      9 ; CHECK: Printing analysis 'Scalar Evolution Analysis' for function 'test1':
     10 ; CHECK: backedge-taken count is 10000
     11 
     12 define void @test1(i32 %N) {
     13 entry:
     14         br label %bb3
     15 
     16 bb:             ; preds = %bb3
     17         %tmp = getelementptr [1000 x i32], [1000 x i32]* @A, i32 0, i32 %i.0          ; <i32*> [#uses=1]
     18         store i32 123, i32* %tmp
     19         %tmp2 = add i32 %i.0, 1         ; <i32> [#uses=1]
     20         br label %bb3
     21 
     22 bb3:            ; preds = %bb, %entry
     23         %i.0 = phi i32 [ 0, %entry ], [ %tmp2, %bb ]            ; <i32> [#uses=3]
     24         %tmp3 = icmp sle i32 %i.0, 9999          ; <i1> [#uses=1]
     25         br i1 %tmp3, label %bb, label %bb5
     26 
     27 bb5:            ; preds = %bb3
     28         br label %return
     29 
     30 return:         ; preds = %bb5
     31         ret void
     32 }
     33 
     34 ; PR22795
     35 ; CHECK: Printing analysis 'Scalar Evolution Analysis' for function 'test2':
     36 ; CHECK:   %iv = phi i32 [ -1, %entry ], [ %next.1, %for.inc.1 ]
     37 ; CHECK-NEXT:  -->  {-1,+,2}<%preheader> U: full-set S: full-set             Exits: 13
     38 
     39 define i32 @test2() {
     40 entry:
     41   %bins = alloca [16 x i64], align 16
     42   %0 = bitcast [16 x i64]* %bins to i8*
     43   call void @llvm.memset.p0i8.i64(i8* %0, i8 0, i64 128, i32 16, i1 false)
     44   br label %preheader
     45 
     46 preheader:                                        ; preds = %for.inc.1, %entry
     47   %v11 = phi i64 [ 0, %entry ], [ %next12.1, %for.inc.1 ]
     48   %iv = phi i32 [ -1, %entry ], [ %next.1, %for.inc.1 ]
     49   %cmp = icmp sgt i64 %v11, 0
     50   br i1 %cmp, label %for.body, label %for.inc
     51 
     52 for.body:                                         ; preds = %preheader
     53   %zext = zext i32 %iv to i64
     54   %arrayidx = getelementptr [16 x i64], [16 x i64]* %bins, i64 0, i64 %v11
     55   %loaded = load i64, i64* %arrayidx, align 8
     56   %add = add i64 %loaded, 1
     57   %add2 = add i64 %add, %zext
     58   store i64 %add2, i64* %arrayidx, align 8
     59   br label %for.inc
     60 
     61 for.inc:                                          ; preds = %for.body, %preheader
     62   %next12 = add nuw nsw i64 %v11, 1
     63   %next = add nsw i32 %iv, 1
     64   br i1 true, label %for.body.1, label %for.inc.1
     65 
     66 end:                                              ; preds = %for.inc.1
     67   %arrayidx8 = getelementptr [16 x i64], [16 x i64]* %bins, i64 0, i64 2
     68   %load = load i64, i64* %arrayidx8, align 16
     69   %shr4 = lshr i64 %load, 32
     70   %conv = trunc i64 %shr4 to i32
     71   ret i32 %conv
     72 
     73 for.body.1:                                       ; preds = %for.inc
     74   %zext.1 = zext i32 %next to i64
     75   %arrayidx.1 = getelementptr [16 x i64], [16 x i64]* %bins, i64 0, i64 %next12
     76   %loaded.1 = load i64, i64* %arrayidx.1, align 8
     77   %add.1 = add i64 %loaded.1, 1
     78   %add2.1 = add i64 %add.1, %zext.1
     79   store i64 %add2.1, i64* %arrayidx.1, align 8
     80   br label %for.inc.1
     81 
     82 for.inc.1:                                        ; preds = %for.body.1, %for.inc
     83   %next12.1 = add nuw nsw i64 %next12, 1
     84   %next.1 = add nuw nsw i32 %next, 1
     85   %exitcond.1 = icmp eq i64 %next12.1, 16
     86   br i1 %exitcond.1, label %end, label %preheader
     87 }
     88 
     89 ; Function Attrs: nounwind
     90 declare void @llvm.memset.p0i8.i64(i8* nocapture, i8, i64, i32, i1) #0
     91