59 lines · plain
1; test for more complicated forms of lea operands which can be generated2; in loop optimized cases.3; See also http://llvm.org/bugs/show_bug.cgi?id=200164 5; RUN: llc < %s -mtriple=x86_64-linux -O2 | FileCheck %s6; RUN: llc < %s -mtriple=x86_64-linux-gnux32 -O2 | FileCheck %s -check-prefix=X327 8; Function Attrs: nounwind readnone uwtable9define void @foo(i32 %x, i32 %d) #0 {10entry:11 %a = alloca [8 x i32], align 1612 br label %while.cond13 14while.cond: ; preds = %while.cond, %entry15 %d.addr.0 = phi i32 [ %d, %entry ], [ %inc, %while.cond ]16 %arrayidx = getelementptr inbounds [8 x i32], ptr %a, i32 0, i32 %d.addr.017 18; CHECK: leaq -40(%rsp,%r{{[^,]*}},4), %rax19; X32: leal -40(%rsp,%r{{[^,]*}},4), %eax20 %0 = load i32, ptr %arrayidx, align 421 %cmp1 = icmp eq i32 %0, 022 %inc = add nsw i32 %d.addr.0, 123 24; CHECK: leaq 4(%r{{[^,]*}}), %r{{[^,]*}}25; X32: leal 4(%r{{[^,]*}}), %e{{[^,]*}}26 br i1 %cmp1, label %while.end, label %while.cond27 28while.end: ; preds = %while.cond29 ret void30}31 32; The same test as above but with enforsed stack realignment (%a aligned by 64)33; to check one more case of correct lea generation.34 35; Function Attrs: nounwind readnone uwtable36define void @bar(i32 %x, i32 %d) #0 {37entry:38 %a = alloca [8 x i32], align 6439 br label %while.cond40 41while.cond: ; preds = %while.cond, %entry42 %d.addr.0 = phi i32 [ %d, %entry ], [ %inc, %while.cond ]43 %arrayidx = getelementptr inbounds [8 x i32], ptr %a, i32 0, i32 %d.addr.044 45; CHECK: leaq (%rsp,%r{{[^,]*}},4), %rax46; X32: leal (%rsp,%r{{[^,]*}},4), %eax47 %0 = load i32, ptr %arrayidx, align 448 %cmp1 = icmp eq i32 %0, 049 %inc = add nsw i32 %d.addr.0, 150 51; CHECK: leaq 4(%r{{[^,]*}}), %r{{[^,]*}}52; X32: leal 4(%r{{[^,]*}}), %e{{[^,]*}}53 br i1 %cmp1, label %while.end, label %while.cond54 55while.end: ; preds = %while.cond56 ret void57}58 59