1; RUN: llc < %s -mcpu=atom -mtriple=i686-linux | FileCheck %s 2 3; CHECK:%bb.5 4; CHECK-NEXT:leal 5; CHECK-NEXT:leal 6; CHECK-NEXT:leal 7; CHECK-NEXT:movl 8 9 10; Test for fixup lea pre-emit pass. LEA instructions should be substituted for 11; ADD instructions which compute the address and index of the load because they 12; precede the load within 5 instructions. An LEA should also be substituted for 13; an ADD which computes part of the index because it precedes the index LEA 14; within 5 instructions, this substitution is referred to as backwards chaining. 15 16; Original C Code 17;struct node_t 18;{ 19; int k, m, n, p; 20; int * array; 21;}; 22 23;extern struct node_t getnode(); 24 25;int test() 26;{ 27; int sum = 0; 28; struct node_t n = getnode(); 29; if(n.array != 0 && n.p > 0 && n.k > 0 && n.n > 0 && n.m > 0) { 30; sum = ((int*)((int)n.array + n.p) )[ n.k + n.m + n.n ]; 31; } 32; return sum; 33;} 34 35%struct.node_t = type { i32, i32, i32, i32, i32* } 36 37define i32 @test() { 38entry: 39 %n = alloca %struct.node_t, align 4 40 call void bitcast (void (%struct.node_t*, ...)* @getnode to void (%struct.node_t*)*)(%struct.node_t* sret %n) 41 %array = getelementptr inbounds %struct.node_t, %struct.node_t* %n, i32 0, i32 4 42 %0 = load i32*, i32** %array, align 4 43 %cmp = icmp eq i32* %0, null 44 br i1 %cmp, label %if.end, label %land.lhs.true 45 46land.lhs.true: 47 %p = getelementptr inbounds %struct.node_t, %struct.node_t* %n, i32 0, i32 3 48 %1 = load i32, i32* %p, align 4 49 %cmp1 = icmp sgt i32 %1, 0 50 br i1 %cmp1, label %land.lhs.true2, label %if.end 51 52land.lhs.true2: 53 %k = getelementptr inbounds %struct.node_t, %struct.node_t* %n, i32 0, i32 0 54 %2 = load i32, i32* %k, align 4 55 %cmp3 = icmp sgt i32 %2, 0 56 br i1 %cmp3, label %land.lhs.true4, label %if.end 57 58land.lhs.true4: 59 %n5 = getelementptr inbounds %struct.node_t, %struct.node_t* %n, i32 0, i32 2 60 %3 = load i32, i32* %n5, align 4 61 %cmp6 = icmp sgt i32 %3, 0 62 br i1 %cmp6, label %land.lhs.true7, label %if.end 63 64land.lhs.true7: 65 %m = getelementptr inbounds %struct.node_t, %struct.node_t* %n, i32 0, i32 1 66 %4 = load i32, i32* %m, align 4 67 %cmp8 = icmp sgt i32 %4, 0 68 br i1 %cmp8, label %if.then, label %if.end 69 70if.then: 71 %add = add i32 %3, %2 72 %add12 = add i32 %add, %4 73 %5 = ptrtoint i32* %0 to i32 74 %add15 = add nsw i32 %1, %5 75 %6 = inttoptr i32 %add15 to i32* 76 %arrayidx = getelementptr inbounds i32, i32* %6, i32 %add12 77 %7 = load i32, i32* %arrayidx, align 4 78 br label %if.end 79 80if.end: 81 %sum.0 = phi i32 [ %7, %if.then ], [ 0, %land.lhs.true7 ], [ 0, %land.lhs.true4 ], [ 0, %land.lhs.true2 ], [ 0, %land.lhs.true ], [ 0, %entry ] 82 ret i32 %sum.0 83} 84 85declare void @getnode(%struct.node_t* sret, ...) 86