1 ; RUN: opt -analyze -scalar-evolution < %s | FileCheck %s 2 3 target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f32:32:32-f64:32:64-v64:64:64-v128:128:128-a0:0:64-f80:32:32-n8:16:32" 4 target triple = "i386-pc-linux-gnu" 5 6 @arr1 = internal unnamed_addr constant [50 x i32] [i32 1, i32 2, i32 3, i32 4, i32 5, i32 6, i32 7, i32 8, i32 9, i32 10, i32 11, i32 12, i32 13, i32 14, i32 15, i32 16, i32 17, i32 18, i32 19, i32 20, i32 21, i32 22, i32 23, i32 24, i32 25, i32 26, i32 27, i32 28, i32 29, i32 30, i32 31, i32 32, i32 33, i32 34, i32 35, i32 36, i32 37, i32 38, i32 39, i32 40, i32 41, i32 42, i32 43, i32 44, i32 45, i32 46, i32 47, i32 48, i32 49, i32 50], align 4 7 @arr2 = internal unnamed_addr constant [50 x i32] [i32 49, i32 48, i32 47, i32 46, i32 45, i32 44, i32 43, i32 42, i32 41, i32 40, i32 39, i32 38, i32 37, i32 36, i32 35, i32 34, i32 33, i32 32, i32 31, i32 30, i32 29, i32 28, i32 27, i32 26, i32 25, i32 24, i32 23, i32 22, i32 21, i32 20, i32 19, i32 18, i32 17, i32 16, i32 15, i32 14, i32 13, i32 12, i32 11, i32 10, i32 9, i32 8, i32 7, i32 6, i32 5, i32 4, i32 3, i32 2, i32 1, i32 0], align 4 8 9 ; PR11034 10 define i32 @test1() nounwind readnone { 11 ; CHECK: test1 12 entry: 13 br label %for.body 14 15 for.body: ; preds = %entry, %for.body 16 %sum.04 = phi i32 [ 0, %entry ], [ %add2, %for.body ] 17 ; CHECK: --> %sum.04{{ *}}Exits: 2450 18 %i.03 = phi i32 [ 0, %entry ], [ %inc, %for.body ] 19 %arrayidx = getelementptr inbounds [50 x i32]* @arr1, i32 0, i32 %i.03 20 %0 = load i32* %arrayidx, align 4 21 ; CHECK: --> %0{{ *}}Exits: 50 22 %arrayidx1 = getelementptr inbounds [50 x i32]* @arr2, i32 0, i32 %i.03 23 %1 = load i32* %arrayidx1, align 4 24 ; CHECK: --> %1{{ *}}Exits: 0 25 %add = add i32 %0, %sum.04 26 %add2 = add i32 %add, %1 27 %inc = add nsw i32 %i.03, 1 28 %cmp = icmp eq i32 %inc, 50 29 br i1 %cmp, label %for.end, label %for.body 30 31 for.end: ; preds = %for.body 32 ret i32 %add2 33 } 34 35 36 %struct.ListNode = type { %struct.ListNode*, i32 } 37 38 @node5 = internal constant { %struct.ListNode*, i32, [4 x i8] } { %struct.ListNode* bitcast ({ %struct.ListNode*, i32, [4 x i8] }* @node4 to %struct.ListNode*), i32 4, [4 x i8] undef }, align 8 39 @node4 = internal constant { %struct.ListNode*, i32, [4 x i8] } { %struct.ListNode* bitcast ({ %struct.ListNode*, i32, [4 x i8] }* @node3 to %struct.ListNode*), i32 3, [4 x i8] undef }, align 8 40 @node3 = internal constant { %struct.ListNode*, i32, [4 x i8] } { %struct.ListNode* bitcast ({ %struct.ListNode*, i32, [4 x i8] }* @node2 to %struct.ListNode*), i32 2, [4 x i8] undef }, align 8 41 @node2 = internal constant { %struct.ListNode*, i32, [4 x i8] } { %struct.ListNode* bitcast ({ %struct.ListNode*, i32, [4 x i8] }* @node1 to %struct.ListNode*), i32 1, [4 x i8] undef }, align 8 42 @node1 = internal constant { %struct.ListNode*, i32, [4 x i8] } { %struct.ListNode* null, i32 0, [4 x i8] undef }, align 8 43 44 define i32 @test2() nounwind uwtable readonly { 45 ; CHECK: test2 46 entry: 47 br label %for.body 48 49 for.body: ; preds = %entry, %for.body 50 %sum.02 = phi i32 [ 0, %entry ], [ %add, %for.body ] 51 ; CHECK: --> %sum.02{{ *}}Exits: 10 52 %n.01 = phi %struct.ListNode* [ bitcast ({ %struct.ListNode*, i32, [4 x i8] }* @node5 to %struct.ListNode*), %entry ], [ %1, %for.body ] 53 ; CHECK: --> %n.01{{ *}}Exits: @node1 54 %i = getelementptr inbounds %struct.ListNode* %n.01, i64 0, i32 1 55 %0 = load i32* %i, align 4 56 %add = add nsw i32 %0, %sum.02 57 %next = getelementptr inbounds %struct.ListNode* %n.01, i64 0, i32 0 58 %1 = load %struct.ListNode** %next, align 8 59 ; CHECK: --> %1{{ *}}Exits: 0 60 %cmp = icmp eq %struct.ListNode* %1, null 61 br i1 %cmp, label %for.end, label %for.body 62 63 for.end: ; preds = %for.body 64 ret i32 %add 65 } 66
