1; RUN: opt -verify-loop-info -irce-print-changed-loops -passes=irce < %s 2>&1 | FileCheck %s 2; 3; TODO: new-pm version should be enabled after we decide on branch-probability handling for loop passes 4; TODO: opt -verify-loop-info -irce-print-changed-loops -passes='require<branch-prob>,irce' < %s 2>&1 | FileCheck %s 5 6; CHECK-NOT: constrained Loop 7 8define void @multiple_access_no_preloop( 9 ptr %arr_a, ptr %a_len_ptr, ptr %arr_b, ptr %b_len_ptr, i32 %n) { 10 11 entry: 12 %len.a = load i32, ptr %a_len_ptr, !range !0 13 %len.b = load i32, ptr %b_len_ptr, !range !0 14 %first.itr.check = icmp sgt i32 %n, 0 15 br i1 %first.itr.check, label %loop, label %exit 16 17 loop: 18 %idx = phi i32 [ 0, %entry ] , [ %idx.next, %in.bounds.b ] 19 %idx.next = add i32 %idx, 1 20 %abc.a = icmp slt i32 %idx, %len.a 21 br i1 %abc.a, label %in.bounds.a, label %out.of.bounds, !prof !1 22 23 in.bounds.a: 24 %addr.a = getelementptr i32, ptr %arr_a, i32 %idx 25 store i32 0, ptr %addr.a 26 %abc.b = icmp slt i32 %idx, %len.b 27 br i1 %abc.b, label %in.bounds.b, label %out.of.bounds, !prof !1 28 29 in.bounds.b: 30 %addr.b = getelementptr i32, ptr %arr_b, i32 %idx 31 store i32 -1, ptr %addr.b 32 %next = icmp slt i32 %idx.next, %n 33 br i1 %next, label %loop, label %exit 34 35 out.of.bounds: 36 ret void 37 38 exit: 39 ret void 40} 41 42!0 = !{i32 0, i32 2147483647} 43!1 = !{!"branch_weights", i32 1, i32 1} 44