1; RUN: opt -verify-loop-info -irce-print-changed-loops -passes=irce -irce-min-eliminated-checks=3 < %s 2>&1 | FileCheck %s --check-prefixes=CHECK-NO 2; RUN: opt -verify-loop-info -irce-print-changed-loops -passes=irce -irce-min-eliminated-checks=0 < %s 2>&1 | FileCheck %s --check-prefixes=CHECK-YES 3 4; CHECK-YES: constrained Loop 5; CHECK-NO-NOT: constrained Loop 6 7define i32 @multiple_access_no_preloop( 8 ptr %arr_a, ptr %a_len_ptr, ptr %arr_b, ptr %b_len_ptr, i32 %n) { 9 10 entry: 11 %len.a = load i32, ptr %a_len_ptr, !range !0 12 %first.itr.check = icmp sgt i32 %n, 0 13 br i1 %first.itr.check, label %loop, label %exit, !prof !1 14 15 loop: 16 %idx = phi i32 [ 0, %entry ] , [ %idx.next, %backedge ] 17 %idx.next = add i32 %idx, 1 18 %abc.a = icmp slt i32 %idx, %len.a 19 br i1 %abc.a, label %in.bounds.a, label %exit, !prof !2 20 21 in.bounds.a: 22 %addr.a = getelementptr i32, ptr %arr_a, i32 %idx 23 %val = load i32, ptr %addr.a 24 %cond = icmp ne i32 %val, 0 25; Most probable exit from a loop. 26 br i1 %cond, label %found, label %backedge, !prof !3 27 28 backedge: 29 %next = icmp slt i32 %idx.next, %n 30 br i1 %next, label %loop, label %exit, !prof !4 31 32 found: 33 ret i32 %val 34 35 exit: 36 ret i32 0 37} 38 39!0 = !{i32 0, i32 2147483647} 40!1 = !{!"branch_weights", i32 1024, i32 1} 41!2 = !{!"branch_weights", i32 512, i32 1} 42!3 = !{!"branch_weights", i32 1, i32 2} 43!4 = !{!"branch_weights", i32 512, i32 1} 44