1 ; RUN: opt -verify-loop-info -irce-print-changed-loops -irce < %s 2>&1 | FileCheck %s
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>,loop(irce)' < %s 2>&1 | FileCheck %s
6 ; CHECK-NOT: constrained Loop
8 define void @multiple_access_no_preloop(
9 i32* %arr_a, i32* %a_len_ptr, i32* %arr_b, i32* %b_len_ptr, i32 %n) {
12 %len.a = load i32, i32* %a_len_ptr, !range !0
13 %len.b = load i32, i32* %b_len_ptr, !range !0
14 %first.itr.check = icmp sgt i32 %n, 0
15 br i1 %first.itr.check, label %loop, label %exit
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
24 %addr.a = getelementptr i32, i32* %arr_a, i32 %idx
25 store i32 0, i32* %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
30 %addr.b = getelementptr i32, i32* %arr_b, i32 %idx
31 store i32 -1, i32* %addr.b
32 %next = icmp slt i32 %idx.next, %n
33 br i1 %next, label %loop, label %exit
42 !0 = !{i32 0, i32 2147483647}
43 !1 = !{!"branch_weights", i32 1, i32 1}