102 lines · plain
1; RUN: opt -passes=loop-load-elim -S < %s | FileCheck %s2; RUN: opt -aa-pipeline=basic-aa -passes=loop-load-elim -S < %s | FileCheck %s3 4target datalayout = "e-m:o-i32:64-f80:128-n8:16:32:64-S128"5 6; TODO7; Make sure loop-load-elimination triggers for a loop with uncomputable8; backedge-taken counts when no runtime checks are required.9define void @load_elim_no_runtime_checks(ptr noalias %A, ptr noalias %B, ptr noalias %C, i32 %N) {10; CHECK-LABEL: load_elim_no_runtime_checks11; CHECK-NEXT: entry:12; CHECK-NEXT: br label %for.body13;14entry:15 br label %for.body16 17for.body: ; preds = %for.body, %entry18 %indvars.iv = phi i32 [ 0, %entry ], [ %indvars.iv.next, %for.body ]19 %indvars.iv.next = add nuw nsw i32 %indvars.iv, 120 21 %Aidx_next = getelementptr inbounds i32, ptr %A, i32 %indvars.iv.next22 %Bidx = getelementptr inbounds i32, ptr %B, i32 %indvars.iv23 %Cidx = getelementptr inbounds i32, ptr %C, i32 %indvars.iv24 %Aidx = getelementptr inbounds i32, ptr %A, i32 %indvars.iv25 26 %b = load i32, ptr %Bidx, align 427 %a_p1 = add i32 %b, 228 store i32 %a_p1, ptr %Aidx_next, align 429 30 %a = load i32, ptr %Aidx, align 131 %c = mul i32 %a, 232 store i32 %c, ptr %Cidx, align 433 34 %exitcond = icmp eq i32 %indvars.iv.next, %a35 br i1 %exitcond, label %for.end, label %for.body36 37for.end: ; preds = %for.body38 ret void39}40 41; Make sure loop-load-elimination triggers for a loop with uncomputable42; backedge-taken counts when no runtime checks are required.43define void @load_elim_wrapping_runtime_checks(ptr noalias %A, ptr noalias %B, ptr noalias %C, i32 %N) {44; CHECK-LABEL: @load_elim_wrapping_runtime_checks45; CHECK-NEXT: entry:46; CHECK-NEXT: br label %for.body47;48entry:49 br label %for.body50 51for.body: ; preds = %for.body, %entry52 %indvars.iv = phi i32 [ 0, %entry ], [ %indvars.iv.next, %for.body ]53 %indvars.iv.next = add i32 %indvars.iv, 154 55 %Aidx_next = getelementptr inbounds i32, ptr %A, i32 %indvars.iv.next56 %Bidx = getelementptr inbounds i32, ptr %B, i32 %indvars.iv57 %Cidx = getelementptr inbounds i32, ptr %C, i32 %indvars.iv58 %Aidx = getelementptr inbounds i32, ptr %A, i32 %indvars.iv59 60 %b = load i32, ptr %Bidx, align 461 %a_p1 = add i32 %b, 262 store i32 %a_p1, ptr %Aidx_next, align 463 64 %a = load i32, ptr %Aidx, align 165 %c = mul i32 %a, 266 store i32 %c, ptr %Cidx, align 467 68 %exitcond = icmp eq i32 %indvars.iv.next, %a69 br i1 %exitcond, label %for.end, label %for.body70 71for.end: ; preds = %for.body72 ret void73}74 75; Make sure we do not crash when dealing with uncomputable backedge-taken counts76; and a variable distance between accesses.77define void @uncomputable_btc_crash(ptr %row, i32 %filter, ptr noalias %exits) local_unnamed_addr #0 {78; CHECK-LABEL: @uncomputable_btc_crash79; CHECK-NEXT: entry:80; CHECK-NEXT: getelementptr81; CHECK-NEXT: br label %loop82;83entry:84 %add.ptr = getelementptr inbounds i8, ptr %row, i32 %filter85 br label %loop86 87loop:88 %iv = phi i32 [ 0, %entry ], [ %iv.next, %loop ]89 %add.ptr.gep = getelementptr i8, ptr %add.ptr, i32 %iv90 %row.gep = getelementptr i8, ptr %row, i32 %iv91 %l = load i8, ptr %row.gep, align 192 store i8 %l, ptr %add.ptr.gep, align 193 %iv.next = add i32 %iv, 894 %exit.gep = getelementptr i32, ptr %exits, i32 %iv95 %lv = load i32, ptr %exit.gep96 %c = icmp eq i32 %lv, 12097 br i1 %c, label %exit, label %loop98 99exit:100 ret void101}102