| ; NOTE: Assertions have been autogenerated by utils/update_test_checks.py UTC_ARGS: --check-globals none --version 6 |
| ; RUN: opt -passes=loop-vectorize -force-vector-width=4 -S %s | FileCheck %s |
| |
| ; Tests where the indices of some accesses are bounded to a small range. |
| |
| ; FIXME: At the moment, the runtime checks require that the indices do not wrap |
| ; and runtime checks are emitted to ensure that. The bounded indices do |
| ; wrap, so the vector loops are dead at the moment. But it is still |
| ; possible to compute the bounds of the accesses and generate proper |
| ; runtime checks. |
| |
| ; The relevant bounds for %gep.A are [%A, %A+4). |
| define void @load_bounded_index(ptr %A, ptr %B, i32 %N) { |
| ; CHECK-LABEL: define void @load_bounded_index( |
| ; CHECK-SAME: ptr [[A:%.*]], ptr [[B:%.*]], i32 [[N:%.*]]) { |
| ; CHECK-NEXT: [[ENTRY:.*]]: |
| ; CHECK-NEXT: [[A2:%.*]] = ptrtoaddr ptr [[A]] to i64 |
| ; CHECK-NEXT: [[B1:%.*]] = ptrtoaddr ptr [[B]] to i64 |
| ; CHECK-NEXT: [[MIN_ITERS_CHECK:%.*]] = icmp ult i32 [[N]], 4 |
| ; CHECK-NEXT: br i1 [[MIN_ITERS_CHECK]], label %[[SCALAR_PH:.*]], label %[[VECTOR_SCEVCHECK:.*]] |
| ; CHECK: [[VECTOR_SCEVCHECK]]: |
| ; CHECK-NEXT: [[TMP0:%.*]] = add i32 [[N]], -1 |
| ; CHECK-NEXT: [[DIFF_CHECK:%.*]] = icmp ugt i32 [[TMP0]], 3 |
| ; CHECK-NEXT: br i1 [[DIFF_CHECK]], label %[[SCALAR_PH]], label %[[VECTOR_MEMCHECK:.*]] |
| ; CHECK: [[VECTOR_MEMCHECK]]: |
| ; CHECK-NEXT: [[TMP2:%.*]] = sub i64 [[B1]], [[A2]] |
| ; CHECK-NEXT: [[TMP3:%.*]] = sub i64 [[TMP2]], 1 |
| ; CHECK-NEXT: [[DIFF_CHECK1:%.*]] = icmp ult i64 [[TMP3]], 15 |
| ; CHECK-NEXT: br i1 [[DIFF_CHECK1]], label %[[SCALAR_PH]], label %[[VECTOR_PH:.*]] |
| ; CHECK: [[VECTOR_PH]]: |
| ; CHECK-NEXT: [[N_MOD_VF:%.*]] = urem i32 [[N]], 4 |
| ; CHECK-NEXT: [[N_VEC:%.*]] = sub i32 [[N]], [[N_MOD_VF]] |
| ; CHECK-NEXT: br label %[[VECTOR_BODY:.*]] |
| ; CHECK: [[VECTOR_BODY]]: |
| ; CHECK-NEXT: [[INDEX:%.*]] = phi i32 [ 0, %[[VECTOR_PH]] ], [ [[INDEX_NEXT:%.*]], %[[VECTOR_BODY]] ] |
| ; CHECK-NEXT: [[TMP21:%.*]] = urem i32 [[INDEX]], 4 |
| ; CHECK-NEXT: [[TMP12:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[TMP21]] |
| ; CHECK-NEXT: [[WIDE_LOAD:%.*]] = load <4 x i32>, ptr [[TMP12]], align 4 |
| ; CHECK-NEXT: [[TMP7:%.*]] = add <4 x i32> [[WIDE_LOAD]], splat (i32 10) |
| ; CHECK-NEXT: [[TMP8:%.*]] = getelementptr inbounds i32, ptr [[B]], i32 [[INDEX]] |
| ; CHECK-NEXT: store <4 x i32> [[TMP7]], ptr [[TMP8]], align 4 |
| ; CHECK-NEXT: [[INDEX_NEXT]] = add nuw i32 [[INDEX]], 4 |
| ; CHECK-NEXT: [[TMP10:%.*]] = icmp eq i32 [[INDEX_NEXT]], [[N_VEC]] |
| ; CHECK-NEXT: br i1 [[TMP10]], label %[[MIDDLE_BLOCK:.*]], label %[[VECTOR_BODY]], !llvm.loop [[LOOP0:![0-9]+]] |
| ; CHECK: [[MIDDLE_BLOCK]]: |
| ; CHECK-NEXT: [[CMP_N:%.*]] = icmp eq i32 [[N]], [[N_VEC]] |
| ; CHECK-NEXT: br i1 [[CMP_N]], label %[[EXIT:.*]], label %[[SCALAR_PH]] |
| ; CHECK: [[SCALAR_PH]]: |
| ; CHECK-NEXT: [[BC_RESUME_VAL:%.*]] = phi i32 [ [[N_VEC]], %[[MIDDLE_BLOCK]] ], [ 0, %[[ENTRY]] ], [ 0, %[[VECTOR_SCEVCHECK]] ], [ 0, %[[VECTOR_MEMCHECK]] ] |
| ; CHECK-NEXT: br label %[[LOOP:.*]] |
| ; CHECK: [[LOOP]]: |
| ; CHECK-NEXT: [[IV:%.*]] = phi i32 [ [[BC_RESUME_VAL]], %[[SCALAR_PH]] ], [ [[IV_NEXT:%.*]], %[[LOOP]] ] |
| ; CHECK-NEXT: [[BOUNDED_INDEX:%.*]] = urem i32 [[IV]], 4 |
| ; CHECK-NEXT: [[GEP_A:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[BOUNDED_INDEX]] |
| ; CHECK-NEXT: [[LV:%.*]] = load i32, ptr [[GEP_A]], align 4 |
| ; CHECK-NEXT: [[ADD:%.*]] = add i32 [[LV]], 10 |
| ; CHECK-NEXT: [[GEP_B:%.*]] = getelementptr inbounds i32, ptr [[B]], i32 [[IV]] |
| ; CHECK-NEXT: store i32 [[ADD]], ptr [[GEP_B]], align 4 |
| ; CHECK-NEXT: [[IV_NEXT]] = add nuw nsw i32 [[IV]], 1 |
| ; CHECK-NEXT: [[COND:%.*]] = icmp eq i32 [[IV_NEXT]], [[N]] |
| ; CHECK-NEXT: br i1 [[COND]], label %[[EXIT]], label %[[LOOP]], !llvm.loop [[LOOP3:![0-9]+]] |
| ; CHECK: [[EXIT]]: |
| ; CHECK-NEXT: ret void |
| ; |
| entry: |
| br label %loop |
| |
| loop: |
| %iv = phi i32 [ 0, %entry ], [ %iv.next, %loop ] |
| %bounded.index = urem i32 %iv, 4 |
| %gep.A = getelementptr inbounds i32, ptr %A, i32 %bounded.index |
| %lv = load i32, ptr %gep.A |
| %add = add i32 %lv, 10 |
| %gep.B = getelementptr inbounds i32, ptr %B, i32 %iv |
| store i32 %add, ptr %gep.B |
| %iv.next = add nuw nsw i32 %iv, 1 |
| %cond = icmp eq i32 %iv.next, %N |
| br i1 %cond, label %exit, label %loop |
| |
| exit: |
| ret void |
| } |
| |
| ; Reduction over a bounded load: sum += A[i % 4]. No stores, so no runtime |
| ; alias checks are needed; the only barrier to vectorisation is the <nusw> |
| ; wrap predicate emitted on the narrow-type AddRec by the existing |
| ; getAsAddRec path, which forces a scalar fallback when N > 4. |
| define i32 @bounded_load_reduction(ptr %A, i32 %N) { |
| ; CHECK-LABEL: define i32 @bounded_load_reduction( |
| ; CHECK-SAME: ptr [[A:%.*]], i32 [[N:%.*]]) { |
| ; CHECK-NEXT: [[ENTRY:.*]]: |
| ; CHECK-NEXT: [[MIN_ITERS_CHECK:%.*]] = icmp ult i32 [[N]], 4 |
| ; CHECK-NEXT: br i1 [[MIN_ITERS_CHECK]], label %[[SCALAR_PH:.*]], label %[[VECTOR_SCEVCHECK:.*]] |
| ; CHECK: [[VECTOR_SCEVCHECK]]: |
| ; CHECK-NEXT: [[TMP0:%.*]] = add i32 [[N]], -1 |
| ; CHECK-NEXT: [[TMP1:%.*]] = icmp ugt i32 [[TMP0]], 3 |
| ; CHECK-NEXT: br i1 [[TMP1]], label %[[SCALAR_PH]], label %[[VECTOR_PH:.*]] |
| ; CHECK: [[VECTOR_PH]]: |
| ; CHECK-NEXT: [[N_MOD_VF:%.*]] = urem i32 [[N]], 4 |
| ; CHECK-NEXT: [[N_VEC:%.*]] = sub i32 [[N]], [[N_MOD_VF]] |
| ; CHECK-NEXT: br label %[[VECTOR_BODY:.*]] |
| ; CHECK: [[VECTOR_BODY]]: |
| ; CHECK-NEXT: [[INDEX:%.*]] = phi i32 [ 0, %[[VECTOR_PH]] ], [ [[INDEX_NEXT:%.*]], %[[VECTOR_BODY]] ] |
| ; CHECK-NEXT: [[VEC_PHI:%.*]] = phi <4 x i32> [ zeroinitializer, %[[VECTOR_PH]] ], [ [[TMP4:%.*]], %[[VECTOR_BODY]] ] |
| ; CHECK-NEXT: [[TMP18:%.*]] = urem i32 [[INDEX]], 4 |
| ; CHECK-NEXT: [[TMP8:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[TMP18]] |
| ; CHECK-NEXT: [[WIDE_LOAD:%.*]] = load <4 x i32>, ptr [[TMP8]], align 4 |
| ; CHECK-NEXT: [[TMP4]] = add <4 x i32> [[VEC_PHI]], [[WIDE_LOAD]] |
| ; CHECK-NEXT: [[INDEX_NEXT]] = add nuw i32 [[INDEX]], 4 |
| ; CHECK-NEXT: [[TMP5:%.*]] = icmp eq i32 [[INDEX_NEXT]], [[N_VEC]] |
| ; CHECK-NEXT: br i1 [[TMP5]], label %[[MIDDLE_BLOCK:.*]], label %[[VECTOR_BODY]], !llvm.loop [[LOOP4:![0-9]+]] |
| ; CHECK: [[MIDDLE_BLOCK]]: |
| ; CHECK-NEXT: [[TMP6:%.*]] = call i32 @llvm.vector.reduce.add.v4i32(<4 x i32> [[TMP4]]) |
| ; CHECK-NEXT: [[CMP_N:%.*]] = icmp eq i32 [[N]], [[N_VEC]] |
| ; CHECK-NEXT: br i1 [[CMP_N]], label %[[EXIT:.*]], label %[[SCALAR_PH]] |
| ; CHECK: [[SCALAR_PH]]: |
| ; CHECK-NEXT: [[BC_RESUME_VAL:%.*]] = phi i32 [ [[N_VEC]], %[[MIDDLE_BLOCK]] ], [ 0, %[[ENTRY]] ], [ 0, %[[VECTOR_SCEVCHECK]] ] |
| ; CHECK-NEXT: [[BC_MERGE_RDX:%.*]] = phi i32 [ [[TMP6]], %[[MIDDLE_BLOCK]] ], [ 0, %[[ENTRY]] ], [ 0, %[[VECTOR_SCEVCHECK]] ] |
| ; CHECK-NEXT: br label %[[LOOP:.*]] |
| ; CHECK: [[LOOP]]: |
| ; CHECK-NEXT: [[IV:%.*]] = phi i32 [ [[BC_RESUME_VAL]], %[[SCALAR_PH]] ], [ [[IV_NEXT:%.*]], %[[LOOP]] ] |
| ; CHECK-NEXT: [[SUM:%.*]] = phi i32 [ [[BC_MERGE_RDX]], %[[SCALAR_PH]] ], [ [[SUM_NEXT:%.*]], %[[LOOP]] ] |
| ; CHECK-NEXT: [[BOUNDED_INDEX:%.*]] = urem i32 [[IV]], 4 |
| ; CHECK-NEXT: [[GEP_A:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[BOUNDED_INDEX]] |
| ; CHECK-NEXT: [[LV:%.*]] = load i32, ptr [[GEP_A]], align 4 |
| ; CHECK-NEXT: [[SUM_NEXT]] = add i32 [[SUM]], [[LV]] |
| ; CHECK-NEXT: [[IV_NEXT]] = add nuw nsw i32 [[IV]], 1 |
| ; CHECK-NEXT: [[COND:%.*]] = icmp eq i32 [[IV_NEXT]], [[N]] |
| ; CHECK-NEXT: br i1 [[COND]], label %[[EXIT]], label %[[LOOP]], !llvm.loop [[LOOP5:![0-9]+]] |
| ; CHECK: [[EXIT]]: |
| ; CHECK-NEXT: [[R:%.*]] = phi i32 [ [[SUM_NEXT]], %[[LOOP]] ], [ [[TMP6]], %[[MIDDLE_BLOCK]] ] |
| ; CHECK-NEXT: ret i32 [[R]] |
| ; |
| entry: |
| br label %loop |
| |
| loop: |
| %iv = phi i32 [ 0, %entry ], [ %iv.next, %loop ] |
| %sum = phi i32 [ 0, %entry ], [ %sum.next, %loop ] |
| %bounded.index = urem i32 %iv, 4 |
| %gep.A = getelementptr inbounds i32, ptr %A, i32 %bounded.index |
| %lv = load i32, ptr %gep.A |
| %sum.next = add i32 %sum, %lv |
| %iv.next = add nuw nsw i32 %iv, 1 |
| %cond = icmp eq i32 %iv.next, %N |
| br i1 %cond, label %exit, label %loop |
| |
| exit: |
| %r = phi i32 [ %sum.next, %loop ] |
| ret i32 %r |
| } |
| |
| ; The relevant bounds for %gep.A are [%A, %A+4). |
| define void @store_bounded_index(ptr %A, ptr %B, i32 %N) { |
| ; CHECK-LABEL: define void @store_bounded_index( |
| ; CHECK-SAME: ptr [[A:%.*]], ptr [[B:%.*]], i32 [[N:%.*]]) { |
| ; CHECK-NEXT: [[ENTRY:.*]]: |
| ; CHECK-NEXT: [[B2:%.*]] = ptrtoaddr ptr [[B]] to i64 |
| ; CHECK-NEXT: [[A1:%.*]] = ptrtoaddr ptr [[A]] to i64 |
| ; CHECK-NEXT: [[MIN_ITERS_CHECK:%.*]] = icmp ult i32 [[N]], 4 |
| ; CHECK-NEXT: br i1 [[MIN_ITERS_CHECK]], label %[[SCALAR_PH:.*]], label %[[VECTOR_SCEVCHECK:.*]] |
| ; CHECK: [[VECTOR_SCEVCHECK]]: |
| ; CHECK-NEXT: [[TMP0:%.*]] = add i32 [[N]], -1 |
| ; CHECK-NEXT: [[DIFF_CHECK:%.*]] = icmp ugt i32 [[TMP0]], 3 |
| ; CHECK-NEXT: br i1 [[DIFF_CHECK]], label %[[SCALAR_PH]], label %[[VECTOR_MEMCHECK:.*]] |
| ; CHECK: [[VECTOR_MEMCHECK]]: |
| ; CHECK-NEXT: [[TMP2:%.*]] = sub i64 [[A1]], [[B2]] |
| ; CHECK-NEXT: [[TMP3:%.*]] = sub i64 [[TMP2]], 1 |
| ; CHECK-NEXT: [[DIFF_CHECK1:%.*]] = icmp ult i64 [[TMP3]], 15 |
| ; CHECK-NEXT: br i1 [[DIFF_CHECK1]], label %[[SCALAR_PH]], label %[[VECTOR_PH:.*]] |
| ; CHECK: [[VECTOR_PH]]: |
| ; CHECK-NEXT: [[N_MOD_VF:%.*]] = urem i32 [[N]], 4 |
| ; CHECK-NEXT: [[N_VEC:%.*]] = sub i32 [[N]], [[N_MOD_VF]] |
| ; CHECK-NEXT: br label %[[VECTOR_BODY:.*]] |
| ; CHECK: [[VECTOR_BODY]]: |
| ; CHECK-NEXT: [[INDEX:%.*]] = phi i32 [ 0, %[[VECTOR_PH]] ], [ [[INDEX_NEXT:%.*]], %[[VECTOR_BODY]] ] |
| ; CHECK-NEXT: [[TMP19:%.*]] = urem i32 [[INDEX]], 4 |
| ; CHECK-NEXT: [[TMP5:%.*]] = getelementptr inbounds i32, ptr [[B]], i32 [[INDEX]] |
| ; CHECK-NEXT: [[WIDE_LOAD:%.*]] = load <4 x i32>, ptr [[TMP5]], align 4 |
| ; CHECK-NEXT: [[TMP7:%.*]] = add <4 x i32> [[WIDE_LOAD]], splat (i32 10) |
| ; CHECK-NEXT: [[TMP18:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[TMP19]] |
| ; CHECK-NEXT: store <4 x i32> [[TMP7]], ptr [[TMP18]], align 4 |
| ; CHECK-NEXT: [[INDEX_NEXT]] = add nuw i32 [[INDEX]], 4 |
| ; CHECK-NEXT: [[TMP10:%.*]] = icmp eq i32 [[INDEX_NEXT]], [[N_VEC]] |
| ; CHECK-NEXT: br i1 [[TMP10]], label %[[MIDDLE_BLOCK:.*]], label %[[VECTOR_BODY]], !llvm.loop [[LOOP6:![0-9]+]] |
| ; CHECK: [[MIDDLE_BLOCK]]: |
| ; CHECK-NEXT: [[CMP_N:%.*]] = icmp eq i32 [[N]], [[N_VEC]] |
| ; CHECK-NEXT: br i1 [[CMP_N]], label %[[EXIT:.*]], label %[[SCALAR_PH]] |
| ; CHECK: [[SCALAR_PH]]: |
| ; CHECK-NEXT: [[BC_RESUME_VAL:%.*]] = phi i32 [ [[N_VEC]], %[[MIDDLE_BLOCK]] ], [ 0, %[[ENTRY]] ], [ 0, %[[VECTOR_SCEVCHECK]] ], [ 0, %[[VECTOR_MEMCHECK]] ] |
| ; CHECK-NEXT: br label %[[LOOP:.*]] |
| ; CHECK: [[LOOP]]: |
| ; CHECK-NEXT: [[IV:%.*]] = phi i32 [ [[BC_RESUME_VAL]], %[[SCALAR_PH]] ], [ [[IV_NEXT:%.*]], %[[LOOP]] ] |
| ; CHECK-NEXT: [[BOUNDED_INDEX:%.*]] = urem i32 [[IV]], 4 |
| ; CHECK-NEXT: [[GEP_B:%.*]] = getelementptr inbounds i32, ptr [[B]], i32 [[IV]] |
| ; CHECK-NEXT: [[LV:%.*]] = load i32, ptr [[GEP_B]], align 4 |
| ; CHECK-NEXT: [[ADD:%.*]] = add i32 [[LV]], 10 |
| ; CHECK-NEXT: [[GEP_A:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[BOUNDED_INDEX]] |
| ; CHECK-NEXT: store i32 [[ADD]], ptr [[GEP_A]], align 4 |
| ; CHECK-NEXT: [[IV_NEXT]] = add nuw nsw i32 [[IV]], 1 |
| ; CHECK-NEXT: [[COND:%.*]] = icmp eq i32 [[IV_NEXT]], [[N]] |
| ; CHECK-NEXT: br i1 [[COND]], label %[[EXIT]], label %[[LOOP]], !llvm.loop [[LOOP7:![0-9]+]] |
| ; CHECK: [[EXIT]]: |
| ; CHECK-NEXT: ret void |
| ; |
| entry: |
| br label %loop |
| |
| loop: |
| %iv = phi i32 [ 0, %entry ], [ %iv.next, %loop ] |
| %bounded.index = urem i32 %iv, 4 |
| %gep.B = getelementptr inbounds i32, ptr %B, i32 %iv |
| %lv = load i32, ptr %gep.B |
| %add = add i32 %lv, 10 |
| %gep.A = getelementptr inbounds i32, ptr %A, i32 %bounded.index |
| store i32 %add, ptr %gep.A |
| %iv.next = add nuw nsw i32 %iv, 1 |
| %cond = icmp eq i32 %iv.next, %N |
| br i1 %cond, label %exit, label %loop |
| |
| exit: |
| ret void |
| } |
| |
| ; The relevant bounds for %gep.A are [%A, %A+4), but the access order is %A+1, |
| ; %A+2, %A+3, %A. |
| define void @load_bounded_index_offset_1(ptr %A, ptr %B, i32 %N) { |
| ; CHECK-LABEL: define void @load_bounded_index_offset_1( |
| ; CHECK-SAME: ptr [[A:%.*]], ptr [[B:%.*]], i32 [[N:%.*]]) { |
| ; CHECK-NEXT: [[ENTRY:.*]]: |
| ; CHECK-NEXT: [[A2:%.*]] = ptrtoaddr ptr [[A]] to i64 |
| ; CHECK-NEXT: [[B1:%.*]] = ptrtoaddr ptr [[B]] to i64 |
| ; CHECK-NEXT: [[TMP0:%.*]] = add i32 [[N]], -1 |
| ; CHECK-NEXT: [[MIN_ITERS_CHECK:%.*]] = icmp ult i32 [[TMP0]], 4 |
| ; CHECK-NEXT: br i1 [[MIN_ITERS_CHECK]], label %[[SCALAR_PH:.*]], label %[[VECTOR_SCEVCHECK:.*]] |
| ; CHECK: [[VECTOR_SCEVCHECK]]: |
| ; CHECK-NEXT: [[TMP1:%.*]] = add i32 [[N]], -2 |
| ; CHECK-NEXT: [[TMP2:%.*]] = trunc i32 [[TMP1]] to i2 |
| ; CHECK-NEXT: [[TMP3:%.*]] = add i2 1, [[TMP2]] |
| ; CHECK-NEXT: [[TMP4:%.*]] = icmp ult i2 [[TMP3]], 1 |
| ; CHECK-NEXT: [[TMP5:%.*]] = icmp ugt i32 [[TMP1]], 3 |
| ; CHECK-NEXT: [[DIFF_CHECK:%.*]] = or i1 [[TMP4]], [[TMP5]] |
| ; CHECK-NEXT: br i1 [[DIFF_CHECK]], label %[[SCALAR_PH]], label %[[VECTOR_MEMCHECK:.*]] |
| ; CHECK: [[VECTOR_MEMCHECK]]: |
| ; CHECK-NEXT: [[TMP7:%.*]] = sub i64 [[B1]], [[A2]] |
| ; CHECK-NEXT: [[TMP8:%.*]] = sub i64 [[TMP7]], 1 |
| ; CHECK-NEXT: [[DIFF_CHECK1:%.*]] = icmp ult i64 [[TMP8]], 15 |
| ; CHECK-NEXT: br i1 [[DIFF_CHECK1]], label %[[SCALAR_PH]], label %[[VECTOR_PH:.*]] |
| ; CHECK: [[VECTOR_PH]]: |
| ; CHECK-NEXT: [[N_MOD_VF:%.*]] = urem i32 [[TMP0]], 4 |
| ; CHECK-NEXT: [[N_VEC:%.*]] = sub i32 [[TMP0]], [[N_MOD_VF]] |
| ; CHECK-NEXT: [[IND_END:%.*]] = add i32 1, [[N_VEC]] |
| ; CHECK-NEXT: br label %[[VECTOR_BODY:.*]] |
| ; CHECK: [[VECTOR_BODY]]: |
| ; CHECK-NEXT: [[INDEX:%.*]] = phi i32 [ 0, %[[VECTOR_PH]] ], [ [[INDEX_NEXT:%.*]], %[[VECTOR_BODY]] ] |
| ; CHECK-NEXT: [[OFFSET_IDX:%.*]] = add i32 1, [[INDEX]] |
| ; CHECK-NEXT: [[TMP23:%.*]] = urem i32 [[OFFSET_IDX]], 4 |
| ; CHECK-NEXT: [[TMP25:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[TMP23]] |
| ; CHECK-NEXT: [[WIDE_LOAD:%.*]] = load <4 x i32>, ptr [[TMP25]], align 4 |
| ; CHECK-NEXT: [[TMP14:%.*]] = add <4 x i32> [[WIDE_LOAD]], splat (i32 10) |
| ; CHECK-NEXT: [[TMP15:%.*]] = getelementptr inbounds i32, ptr [[B]], i32 [[OFFSET_IDX]] |
| ; CHECK-NEXT: store <4 x i32> [[TMP14]], ptr [[TMP15]], align 4 |
| ; CHECK-NEXT: [[INDEX_NEXT]] = add nuw i32 [[INDEX]], 4 |
| ; CHECK-NEXT: [[TMP17:%.*]] = icmp eq i32 [[INDEX_NEXT]], [[N_VEC]] |
| ; CHECK-NEXT: br i1 [[TMP17]], label %[[MIDDLE_BLOCK:.*]], label %[[VECTOR_BODY]], !llvm.loop [[LOOP8:![0-9]+]] |
| ; CHECK: [[MIDDLE_BLOCK]]: |
| ; CHECK-NEXT: [[CMP_N:%.*]] = icmp eq i32 [[TMP0]], [[N_VEC]] |
| ; CHECK-NEXT: br i1 [[CMP_N]], label %[[EXIT:.*]], label %[[SCALAR_PH]] |
| ; CHECK: [[SCALAR_PH]]: |
| ; CHECK-NEXT: [[BC_RESUME_VAL:%.*]] = phi i32 [ [[IND_END]], %[[MIDDLE_BLOCK]] ], [ 1, %[[ENTRY]] ], [ 1, %[[VECTOR_SCEVCHECK]] ], [ 1, %[[VECTOR_MEMCHECK]] ] |
| ; CHECK-NEXT: br label %[[LOOP:.*]] |
| ; CHECK: [[LOOP]]: |
| ; CHECK-NEXT: [[IV:%.*]] = phi i32 [ [[BC_RESUME_VAL]], %[[SCALAR_PH]] ], [ [[IV_NEXT:%.*]], %[[LOOP]] ] |
| ; CHECK-NEXT: [[BOUNDED_INDEX:%.*]] = urem i32 [[IV]], 4 |
| ; CHECK-NEXT: [[GEP_A:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[BOUNDED_INDEX]] |
| ; CHECK-NEXT: [[LV:%.*]] = load i32, ptr [[GEP_A]], align 4 |
| ; CHECK-NEXT: [[ADD:%.*]] = add i32 [[LV]], 10 |
| ; CHECK-NEXT: [[GEP_B:%.*]] = getelementptr inbounds i32, ptr [[B]], i32 [[IV]] |
| ; CHECK-NEXT: store i32 [[ADD]], ptr [[GEP_B]], align 4 |
| ; CHECK-NEXT: [[IV_NEXT]] = add nuw nsw i32 [[IV]], 1 |
| ; CHECK-NEXT: [[COND:%.*]] = icmp eq i32 [[IV_NEXT]], [[N]] |
| ; CHECK-NEXT: br i1 [[COND]], label %[[EXIT]], label %[[LOOP]], !llvm.loop [[LOOP9:![0-9]+]] |
| ; CHECK: [[EXIT]]: |
| ; CHECK-NEXT: ret void |
| ; |
| entry: |
| br label %loop |
| |
| loop: |
| %iv = phi i32 [ 1, %entry ], [ %iv.next, %loop ] |
| %bounded.index = urem i32 %iv, 4 |
| %gep.A = getelementptr inbounds i32, ptr %A, i32 %bounded.index |
| %lv = load i32, ptr %gep.A |
| %add = add i32 %lv, 10 |
| %gep.B = getelementptr inbounds i32, ptr %B, i32 %iv |
| store i32 %add, ptr %gep.B |
| %iv.next = add nuw nsw i32 %iv, 1 |
| %cond = icmp eq i32 %iv.next, %N |
| br i1 %cond, label %exit, label %loop |
| |
| exit: |
| ret void |
| } |
| |
| ; The relevant bounds for %gep.A are [%A, %A+5). |
| define void @load_bounded_index_urem_5(ptr %A, ptr %B, i32 %N) { |
| ; CHECK-LABEL: define void @load_bounded_index_urem_5( |
| ; CHECK-SAME: ptr [[A:%.*]], ptr [[B:%.*]], i32 [[N:%.*]]) { |
| ; CHECK-NEXT: [[ENTRY:.*]]: |
| ; CHECK-NEXT: br label %[[LOOP:.*]] |
| ; CHECK: [[LOOP]]: |
| ; CHECK-NEXT: [[IV:%.*]] = phi i32 [ 1, %[[ENTRY]] ], [ [[IV_NEXT:%.*]], %[[LOOP]] ] |
| ; CHECK-NEXT: [[BOUNDED_INDEX:%.*]] = urem i32 [[IV]], 5 |
| ; CHECK-NEXT: [[GEP_A:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[BOUNDED_INDEX]] |
| ; CHECK-NEXT: [[LV:%.*]] = load i32, ptr [[GEP_A]], align 4 |
| ; CHECK-NEXT: [[ADD:%.*]] = add i32 [[LV]], 10 |
| ; CHECK-NEXT: [[GEP_B:%.*]] = getelementptr inbounds i32, ptr [[B]], i32 [[IV]] |
| ; CHECK-NEXT: store i32 [[ADD]], ptr [[GEP_B]], align 4 |
| ; CHECK-NEXT: [[IV_NEXT]] = add nuw nsw i32 [[IV]], 1 |
| ; CHECK-NEXT: [[COND:%.*]] = icmp eq i32 [[IV_NEXT]], [[N]] |
| ; CHECK-NEXT: br i1 [[COND]], label %[[EXIT:.*]], label %[[LOOP]] |
| ; CHECK: [[EXIT]]: |
| ; CHECK-NEXT: ret void |
| ; |
| entry: |
| br label %loop |
| |
| loop: |
| %iv = phi i32 [ 1, %entry ], [ %iv.next, %loop ] |
| %bounded.index = urem i32 %iv, 5 |
| %gep.A = getelementptr inbounds i32, ptr %A, i32 %bounded.index |
| %lv = load i32, ptr %gep.A |
| %add = add i32 %lv, 10 |
| %gep.B = getelementptr inbounds i32, ptr %B, i32 %iv |
| store i32 %add, ptr %gep.B |
| %iv.next = add nuw nsw i32 %iv, 1 |
| %cond = icmp eq i32 %iv.next, %N |
| br i1 %cond, label %exit, label %loop |
| |
| exit: |
| ret void |
| } |
| define void @bounded_index_dependence_non_bounded(ptr %A, ptr %B, i32 %N) { |
| ; CHECK-LABEL: define void @bounded_index_dependence_non_bounded( |
| ; CHECK-SAME: ptr [[A:%.*]], ptr [[B:%.*]], i32 [[N:%.*]]) { |
| ; CHECK-NEXT: [[ENTRY:.*]]: |
| ; CHECK-NEXT: br label %[[LOOP:.*]] |
| ; CHECK: [[LOOP]]: |
| ; CHECK-NEXT: [[IV:%.*]] = phi i32 [ 0, %[[ENTRY]] ], [ [[IV_NEXT:%.*]], %[[LOOP]] ] |
| ; CHECK-NEXT: [[GEP_B:%.*]] = getelementptr inbounds i32, ptr [[B]], i32 [[IV]] |
| ; CHECK-NEXT: [[LV:%.*]] = load i32, ptr [[GEP_B]], align 4 |
| ; CHECK-NEXT: [[GEP_A_1:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[IV]] |
| ; CHECK-NEXT: [[LV_A:%.*]] = load i32, ptr [[GEP_A_1]], align 4 |
| ; CHECK-NEXT: [[ADD:%.*]] = add i32 [[LV]], [[LV_A]] |
| ; CHECK-NEXT: [[IV_NEXT]] = add nuw nsw i32 [[IV]], 1 |
| ; CHECK-NEXT: [[BOUNDED_INDEX:%.*]] = urem i32 [[IV_NEXT]], 4 |
| ; CHECK-NEXT: [[GEP_A:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[BOUNDED_INDEX]] |
| ; CHECK-NEXT: store i32 [[ADD]], ptr [[GEP_A]], align 4 |
| ; CHECK-NEXT: [[COND:%.*]] = icmp eq i32 [[IV_NEXT]], [[N]] |
| ; CHECK-NEXT: br i1 [[COND]], label %[[EXIT:.*]], label %[[LOOP]] |
| ; CHECK: [[EXIT]]: |
| ; CHECK-NEXT: ret void |
| ; |
| entry: |
| br label %loop |
| |
| loop: |
| %iv = phi i32 [ 0, %entry ], [ %iv.next, %loop ] |
| %gep.B = getelementptr inbounds i32, ptr %B, i32 %iv |
| %lv = load i32, ptr %gep.B |
| %gep.A.1 = getelementptr inbounds i32, ptr %A, i32 %iv |
| %lv.A = load i32, ptr %gep.A.1 |
| %add = add i32 %lv, %lv.A |
| |
| %iv.next = add nuw nsw i32 %iv, 1 |
| %bounded.index = urem i32 %iv.next, 4 |
| %gep.A = getelementptr inbounds i32, ptr %A, i32 %bounded.index |
| store i32 %add, ptr %gep.A |
| %cond = icmp eq i32 %iv.next, %N |
| br i1 %cond, label %exit, label %loop |
| |
| exit: |
| ret void |
| } |
| |
| define void @bounded_index_dependence_bounded_index(ptr %A, ptr %B, i32 %N) { |
| ; CHECK-LABEL: define void @bounded_index_dependence_bounded_index( |
| ; CHECK-SAME: ptr [[A:%.*]], ptr [[B:%.*]], i32 [[N:%.*]]) { |
| ; CHECK-NEXT: [[ENTRY:.*]]: |
| ; CHECK-NEXT: br label %[[LOOP:.*]] |
| ; CHECK: [[LOOP]]: |
| ; CHECK-NEXT: [[IV:%.*]] = phi i32 [ 0, %[[ENTRY]] ], [ [[IV_NEXT:%.*]], %[[LOOP]] ] |
| ; CHECK-NEXT: [[BOUNDED_INDEX_1:%.*]] = urem i32 [[IV]], 4 |
| ; CHECK-NEXT: [[GEP_A_1:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[BOUNDED_INDEX_1]] |
| ; CHECK-NEXT: [[LV_A:%.*]] = load i32, ptr [[GEP_A_1]], align 4 |
| ; CHECK-NEXT: [[ADD:%.*]] = add i32 [[LV_A]], 10 |
| ; CHECK-NEXT: [[IV_NEXT]] = add nuw nsw i32 [[IV]], 1 |
| ; CHECK-NEXT: [[BOUNDED_INDEX:%.*]] = urem i32 [[IV_NEXT]], 4 |
| ; CHECK-NEXT: [[GEP_A:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[BOUNDED_INDEX]] |
| ; CHECK-NEXT: store i32 [[ADD]], ptr [[GEP_A]], align 4 |
| ; CHECK-NEXT: [[COND:%.*]] = icmp eq i32 [[IV_NEXT]], [[N]] |
| ; CHECK-NEXT: br i1 [[COND]], label %[[EXIT:.*]], label %[[LOOP]] |
| ; CHECK: [[EXIT]]: |
| ; CHECK-NEXT: ret void |
| ; |
| entry: |
| br label %loop |
| |
| loop: |
| %iv = phi i32 [ 0, %entry ], [ %iv.next, %loop ] |
| %bounded.index.1 = urem i32 %iv, 4 |
| %gep.A.1 = getelementptr inbounds i32, ptr %A, i32 %bounded.index.1 |
| %lv.A = load i32, ptr %gep.A.1 |
| %add = add i32 %lv.A, 10 |
| |
| %iv.next = add nuw nsw i32 %iv, 1 |
| %bounded.index = urem i32 %iv.next, 4 |
| %gep.A = getelementptr inbounds i32, ptr %A, i32 %bounded.index |
| store i32 %add, ptr %gep.A |
| %cond = icmp eq i32 %iv.next, %N |
| br i1 %cond, label %exit, label %loop |
| |
| exit: |
| ret void |
| } |
| |
| define void @bounded_index_equal_dependence(ptr %A, ptr %B, i32 %N) { |
| ; CHECK-LABEL: define void @bounded_index_equal_dependence( |
| ; CHECK-SAME: ptr [[A:%.*]], ptr [[B:%.*]], i32 [[N:%.*]]) { |
| ; CHECK-NEXT: [[ENTRY:.*]]: |
| ; CHECK-NEXT: [[MIN_ITERS_CHECK:%.*]] = icmp ult i32 [[N]], 4 |
| ; CHECK-NEXT: br i1 [[MIN_ITERS_CHECK]], label %[[SCALAR_PH:.*]], label %[[VECTOR_SCEVCHECK:.*]] |
| ; CHECK: [[VECTOR_SCEVCHECK]]: |
| ; CHECK-NEXT: [[TMP0:%.*]] = add i32 [[N]], -1 |
| ; CHECK-NEXT: [[TMP1:%.*]] = icmp ugt i32 [[TMP0]], 3 |
| ; CHECK-NEXT: br i1 [[TMP1]], label %[[SCALAR_PH]], label %[[VECTOR_PH:.*]] |
| ; CHECK: [[VECTOR_PH]]: |
| ; CHECK-NEXT: [[N_MOD_VF:%.*]] = urem i32 [[N]], 4 |
| ; CHECK-NEXT: [[N_VEC:%.*]] = sub i32 [[N]], [[N_MOD_VF]] |
| ; CHECK-NEXT: br label %[[VECTOR_BODY:.*]] |
| ; CHECK: [[VECTOR_BODY]]: |
| ; CHECK-NEXT: [[IV:%.*]] = phi i32 [ 0, %[[VECTOR_PH]] ], [ [[IV_NEXT:%.*]], %[[VECTOR_BODY]] ] |
| ; CHECK-NEXT: [[BOUNDED_INDEX:%.*]] = urem i32 [[IV]], 4 |
| ; CHECK-NEXT: [[GEP_A:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[BOUNDED_INDEX]] |
| ; CHECK-NEXT: [[WIDE_LOAD:%.*]] = load <4 x i32>, ptr [[GEP_A]], align 4 |
| ; CHECK-NEXT: [[TMP4:%.*]] = add <4 x i32> [[WIDE_LOAD]], splat (i32 10) |
| ; CHECK-NEXT: store <4 x i32> [[TMP4]], ptr [[GEP_A]], align 4 |
| ; CHECK-NEXT: [[IV_NEXT]] = add nuw i32 [[IV]], 4 |
| ; CHECK-NEXT: [[TMP5:%.*]] = icmp eq i32 [[IV_NEXT]], [[N_VEC]] |
| ; CHECK-NEXT: br i1 [[TMP5]], label %[[MIDDLE_BLOCK:.*]], label %[[VECTOR_BODY]], !llvm.loop [[LOOP10:![0-9]+]] |
| ; CHECK: [[MIDDLE_BLOCK]]: |
| ; CHECK-NEXT: [[CMP_N:%.*]] = icmp eq i32 [[N]], [[N_VEC]] |
| ; CHECK-NEXT: br i1 [[CMP_N]], label %[[EXIT:.*]], label %[[SCALAR_PH]] |
| ; CHECK: [[SCALAR_PH]]: |
| ; CHECK-NEXT: [[BC_RESUME_VAL:%.*]] = phi i32 [ [[N_VEC]], %[[MIDDLE_BLOCK]] ], [ 0, %[[ENTRY]] ], [ 0, %[[VECTOR_SCEVCHECK]] ] |
| ; CHECK-NEXT: br label %[[LOOP:.*]] |
| ; CHECK: [[LOOP]]: |
| ; CHECK-NEXT: [[IV1:%.*]] = phi i32 [ [[BC_RESUME_VAL]], %[[SCALAR_PH]] ], [ [[IV_NEXT1:%.*]], %[[LOOP]] ] |
| ; CHECK-NEXT: [[BOUNDED_INDEX1:%.*]] = urem i32 [[IV1]], 4 |
| ; CHECK-NEXT: [[GEP_A1:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[BOUNDED_INDEX1]] |
| ; CHECK-NEXT: [[LV_A:%.*]] = load i32, ptr [[GEP_A1]], align 4 |
| ; CHECK-NEXT: [[ADD:%.*]] = add i32 [[LV_A]], 10 |
| ; CHECK-NEXT: [[IV_NEXT1]] = add nuw nsw i32 [[IV1]], 1 |
| ; CHECK-NEXT: store i32 [[ADD]], ptr [[GEP_A1]], align 4 |
| ; CHECK-NEXT: [[COND:%.*]] = icmp eq i32 [[IV_NEXT1]], [[N]] |
| ; CHECK-NEXT: br i1 [[COND]], label %[[EXIT]], label %[[LOOP]], !llvm.loop [[LOOP11:![0-9]+]] |
| ; CHECK: [[EXIT]]: |
| ; CHECK-NEXT: ret void |
| ; |
| entry: |
| br label %loop |
| |
| loop: |
| %iv = phi i32 [ 0, %entry ], [ %iv.next, %loop ] |
| %bounded.index = urem i32 %iv, 4 |
| %gep.A = getelementptr inbounds i32, ptr %A, i32 %bounded.index |
| %lv.A = load i32, ptr %gep.A |
| %add = add i32 %lv.A, 10 |
| |
| %iv.next = add nuw nsw i32 %iv, 1 |
| store i32 %add, ptr %gep.A |
| %cond = icmp eq i32 %iv.next, %N |
| br i1 %cond, label %exit, label %loop |
| |
| exit: |
| ret void |
| } |
| |
| ; NUSW on the wider i32 AddRec does no imply NUSW on a narrower i8 AddRec. |
| ; Test for https://github.com/llvm/llvm-project/issues/191382. |
| define void @wider_nusw_does_not_imply_narrower(ptr %dst, i64 %n) { |
| ; CHECK-LABEL: define void @wider_nusw_does_not_imply_narrower( |
| ; CHECK-SAME: ptr [[DST:%.*]], i64 [[N:%.*]]) { |
| ; CHECK-NEXT: [[ENTRY:.*]]: |
| ; CHECK-NEXT: [[UMAX4:%.*]] = call i64 @llvm.umax.i64(i64 [[N]], i64 1) |
| ; CHECK-NEXT: [[TMP5:%.*]] = trunc i64 [[UMAX4]] to i32 |
| ; CHECK-NEXT: [[MIN_ITERS_CHECK:%.*]] = icmp ult i32 [[TMP5]], 4 |
| ; CHECK-NEXT: br i1 [[MIN_ITERS_CHECK]], label %[[SCALAR_PH:.*]], label %[[VECTOR_SCEVCHECK:.*]] |
| ; CHECK: [[VECTOR_SCEVCHECK]]: |
| ; CHECK-NEXT: [[UMAX:%.*]] = call i64 @llvm.umax.i64(i64 [[N]], i64 1) |
| ; CHECK-NEXT: [[TMP0:%.*]] = add i64 [[UMAX]], -1 |
| ; CHECK-NEXT: [[TMP1:%.*]] = trunc i64 [[TMP0]] to i32 |
| ; CHECK-NEXT: [[TMP2:%.*]] = add i32 1, [[TMP1]] |
| ; CHECK-NEXT: [[TMP3:%.*]] = icmp ult i32 [[TMP2]], 1 |
| ; CHECK-NEXT: [[TMP4:%.*]] = icmp ugt i64 [[TMP0]], 4294967295 |
| ; CHECK-NEXT: [[TMP8:%.*]] = or i1 [[TMP3]], [[TMP4]] |
| ; CHECK-NEXT: [[TMP7:%.*]] = icmp ugt i64 [[TMP0]], 15 |
| ; CHECK-NEXT: [[TMP9:%.*]] = or i1 [[TMP8]], [[TMP7]] |
| ; CHECK-NEXT: br i1 [[TMP9]], label %[[SCALAR_PH]], label %[[VECTOR_PH:.*]] |
| ; CHECK: [[VECTOR_PH]]: |
| ; CHECK-NEXT: [[N_MOD_VF:%.*]] = urem i32 [[TMP5]], 4 |
| ; CHECK-NEXT: [[N_VEC:%.*]] = sub i32 [[TMP5]], [[N_MOD_VF]] |
| ; CHECK-NEXT: br label %[[VECTOR_BODY:.*]] |
| ; CHECK: [[VECTOR_BODY]]: |
| ; CHECK-NEXT: [[OFFSET_IDX:%.*]] = phi i32 [ 0, %[[VECTOR_PH]] ], [ [[INDEX_NEXT:%.*]], %[[VECTOR_BODY]] ] |
| ; CHECK-NEXT: [[VEC_IND:%.*]] = phi <4 x i32> [ <i32 0, i32 1, i32 2, i32 3>, %[[VECTOR_PH]] ], [ [[VEC_IND_NEXT:%.*]], %[[VECTOR_BODY]] ] |
| ; CHECK-NEXT: [[TMP10:%.*]] = and i32 [[OFFSET_IDX]], 15 |
| ; CHECK-NEXT: [[TMP11:%.*]] = zext nneg i32 [[TMP10]] to i64 |
| ; CHECK-NEXT: [[TMP12:%.*]] = getelementptr inbounds nuw i8, ptr [[DST]], i64 [[TMP11]] |
| ; CHECK-NEXT: [[WIDE_LOAD:%.*]] = load <4 x i8>, ptr [[TMP12]], align 1 |
| ; CHECK-NEXT: [[TMP14:%.*]] = xor <4 x i8> [[WIDE_LOAD]], splat (i8 11) |
| ; CHECK-NEXT: store <4 x i8> [[TMP14]], ptr [[TMP12]], align 1 |
| ; CHECK-NEXT: [[INDEX_NEXT]] = add nuw i32 [[OFFSET_IDX]], 4 |
| ; CHECK-NEXT: [[VEC_IND_NEXT]] = add <4 x i32> [[VEC_IND]], splat (i32 4) |
| ; CHECK-NEXT: [[TMP15:%.*]] = icmp eq i32 [[INDEX_NEXT]], [[N_VEC]] |
| ; CHECK-NEXT: br i1 [[TMP15]], label %[[MIDDLE_BLOCK:.*]], label %[[VECTOR_BODY]], !llvm.loop [[LOOP12:![0-9]+]] |
| ; CHECK: [[MIDDLE_BLOCK]]: |
| ; CHECK-NEXT: [[TMP16:%.*]] = add <4 x i32> [[VEC_IND]], splat (i32 1) |
| ; CHECK-NEXT: [[TMP13:%.*]] = zext <4 x i32> [[TMP16]] to <4 x i64> |
| ; CHECK-NEXT: [[VECTOR_RECUR_EXTRACT:%.*]] = extractelement <4 x i64> [[TMP13]], i64 3 |
| ; CHECK-NEXT: [[CMP_N:%.*]] = icmp eq i32 [[TMP5]], [[N_VEC]] |
| ; CHECK-NEXT: br i1 [[CMP_N]], label %[[EXIT:.*]], label %[[SCALAR_PH]] |
| ; CHECK: [[SCALAR_PH]]: |
| ; CHECK-NEXT: [[TMP17:%.*]] = phi i64 [ [[VECTOR_RECUR_EXTRACT]], %[[MIDDLE_BLOCK]] ], [ 0, %[[ENTRY]] ], [ 0, %[[VECTOR_SCEVCHECK]] ] |
| ; CHECK-NEXT: [[TMP18:%.*]] = phi i32 [ [[N_VEC]], %[[MIDDLE_BLOCK]] ], [ 0, %[[ENTRY]] ], [ 0, %[[VECTOR_SCEVCHECK]] ] |
| ; CHECK-NEXT: br label %[[LOOP:.*]] |
| ; CHECK: [[LOOP]]: |
| ; CHECK-NEXT: [[IV_ZEXT:%.*]] = phi i64 [ [[TMP17]], %[[SCALAR_PH]] ], [ [[IV_NEXT_ZEXT:%.*]], %[[LOOP]] ] |
| ; CHECK-NEXT: [[IV:%.*]] = phi i32 [ [[TMP18]], %[[SCALAR_PH]] ], [ [[IV_NEXT:%.*]], %[[LOOP]] ] |
| ; CHECK-NEXT: [[IV_MOD:%.*]] = and i32 [[IV]], 15 |
| ; CHECK-NEXT: [[IV_MOD_ZEXT:%.*]] = zext nneg i32 [[IV_MOD]] to i64 |
| ; CHECK-NEXT: [[GEP_DST:%.*]] = getelementptr inbounds nuw i8, ptr [[DST]], i64 [[IV_MOD_ZEXT]] |
| ; CHECK-NEXT: [[L_DST:%.*]] = load i8, ptr [[GEP_DST]], align 1 |
| ; CHECK-NEXT: [[XOR:%.*]] = xor i8 [[L_DST]], 11 |
| ; CHECK-NEXT: store i8 [[XOR]], ptr [[GEP_DST]], align 1 |
| ; CHECK-NEXT: [[IV_NEXT]] = add i32 [[IV]], 1 |
| ; CHECK-NEXT: [[IV_NEXT_ZEXT]] = zext i32 [[IV_NEXT]] to i64 |
| ; CHECK-NEXT: [[DONE:%.*]] = icmp ugt i64 [[N]], [[IV_NEXT_ZEXT]] |
| ; CHECK-NEXT: br i1 [[DONE]], label %[[LOOP]], label %[[EXIT]], !llvm.loop [[LOOP13:![0-9]+]] |
| ; CHECK: [[EXIT]]: |
| ; CHECK-NEXT: ret void |
| ; |
| entry: |
| br label %loop |
| |
| loop: |
| %iv.zext = phi i64 [ 0, %entry ], [ %iv.next.zext, %loop ] |
| %iv = phi i32 [ 0, %entry ], [ %iv.next, %loop ] |
| %iv.mod = and i32 %iv, 15 |
| %iv.mod.zext = zext nneg i32 %iv.mod to i64 |
| %gep.dst = getelementptr inbounds nuw i8, ptr %dst, i64 %iv.mod.zext |
| %l.dst = load i8, ptr %gep.dst, align 1 |
| %xor = xor i8 %l.dst, 11 |
| store i8 %xor, ptr %gep.dst, align 1 |
| %iv.next = add i32 %iv, 1 |
| %iv.next.zext = zext i32 %iv.next to i64 |
| %done = icmp ugt i64 %n, %iv.next.zext |
| br i1 %done, label %loop, label %exit |
| |
| exit: |
| ret void |
| } |
| |
| ; Bound 8 with i32 access: bounded range should be (8-1)*4 + 4 = 32 bytes. |
| define void @load_bounded_mod8_i32(ptr %A, ptr %B, i32 %N) { |
| ; CHECK-LABEL: define void @load_bounded_mod8_i32( |
| ; CHECK-SAME: ptr [[A:%.*]], ptr [[B:%.*]], i32 [[N:%.*]]) { |
| ; CHECK-NEXT: [[ENTRY:.*]]: |
| ; CHECK-NEXT: [[A2:%.*]] = ptrtoaddr ptr [[A]] to i64 |
| ; CHECK-NEXT: [[B1:%.*]] = ptrtoaddr ptr [[B]] to i64 |
| ; CHECK-NEXT: [[MIN_ITERS_CHECK:%.*]] = icmp ult i32 [[N]], 4 |
| ; CHECK-NEXT: br i1 [[MIN_ITERS_CHECK]], label %[[SCALAR_PH:.*]], label %[[VECTOR_SCEVCHECK:.*]] |
| ; CHECK: [[VECTOR_SCEVCHECK]]: |
| ; CHECK-NEXT: [[TMP0:%.*]] = add i32 [[N]], -1 |
| ; CHECK-NEXT: [[TMP1:%.*]] = icmp ugt i32 [[TMP0]], 7 |
| ; CHECK-NEXT: br i1 [[TMP1]], label %[[SCALAR_PH]], label %[[VECTOR_MEMCHECK:.*]] |
| ; CHECK: [[VECTOR_MEMCHECK]]: |
| ; CHECK-NEXT: [[TMP2:%.*]] = sub i64 [[B1]], [[A2]] |
| ; CHECK-NEXT: [[TMP8:%.*]] = sub i64 [[TMP2]], 1 |
| ; CHECK-NEXT: [[DIFF_CHECK:%.*]] = icmp ult i64 [[TMP8]], 15 |
| ; CHECK-NEXT: br i1 [[DIFF_CHECK]], label %[[SCALAR_PH]], label %[[VECTOR_PH:.*]] |
| ; CHECK: [[VECTOR_PH]]: |
| ; CHECK-NEXT: [[N_MOD_VF:%.*]] = urem i32 [[N]], 4 |
| ; CHECK-NEXT: [[N_VEC:%.*]] = sub i32 [[N]], [[N_MOD_VF]] |
| ; CHECK-NEXT: br label %[[VECTOR_BODY:.*]] |
| ; CHECK: [[VECTOR_BODY]]: |
| ; CHECK-NEXT: [[INDEX:%.*]] = phi i32 [ 0, %[[VECTOR_PH]] ], [ [[INDEX_NEXT:%.*]], %[[VECTOR_BODY]] ] |
| ; CHECK-NEXT: [[TMP3:%.*]] = urem i32 [[INDEX]], 8 |
| ; CHECK-NEXT: [[TMP4:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[TMP3]] |
| ; CHECK-NEXT: [[WIDE_LOAD:%.*]] = load <4 x i32>, ptr [[TMP4]], align 4 |
| ; CHECK-NEXT: [[TMP5:%.*]] = add <4 x i32> [[WIDE_LOAD]], splat (i32 10) |
| ; CHECK-NEXT: [[TMP6:%.*]] = getelementptr inbounds i32, ptr [[B]], i32 [[INDEX]] |
| ; CHECK-NEXT: store <4 x i32> [[TMP5]], ptr [[TMP6]], align 4 |
| ; CHECK-NEXT: [[INDEX_NEXT]] = add nuw i32 [[INDEX]], 4 |
| ; CHECK-NEXT: [[TMP7:%.*]] = icmp eq i32 [[INDEX_NEXT]], [[N_VEC]] |
| ; CHECK-NEXT: br i1 [[TMP7]], label %[[MIDDLE_BLOCK:.*]], label %[[VECTOR_BODY]], !llvm.loop [[LOOP14:![0-9]+]] |
| ; CHECK: [[MIDDLE_BLOCK]]: |
| ; CHECK-NEXT: [[CMP_N:%.*]] = icmp eq i32 [[N]], [[N_VEC]] |
| ; CHECK-NEXT: br i1 [[CMP_N]], label %[[EXIT:.*]], label %[[SCALAR_PH]] |
| ; CHECK: [[SCALAR_PH]]: |
| ; CHECK-NEXT: [[BC_RESUME_VAL:%.*]] = phi i32 [ [[N_VEC]], %[[MIDDLE_BLOCK]] ], [ 0, %[[ENTRY]] ], [ 0, %[[VECTOR_SCEVCHECK]] ], [ 0, %[[VECTOR_MEMCHECK]] ] |
| ; CHECK-NEXT: br label %[[LOOP:.*]] |
| ; CHECK: [[LOOP]]: |
| ; CHECK-NEXT: [[IV:%.*]] = phi i32 [ [[BC_RESUME_VAL]], %[[SCALAR_PH]] ], [ [[IV_NEXT:%.*]], %[[LOOP]] ] |
| ; CHECK-NEXT: [[BOUNDED:%.*]] = urem i32 [[IV]], 8 |
| ; CHECK-NEXT: [[GEP_A:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[BOUNDED]] |
| ; CHECK-NEXT: [[LV:%.*]] = load i32, ptr [[GEP_A]], align 4 |
| ; CHECK-NEXT: [[ADD:%.*]] = add i32 [[LV]], 10 |
| ; CHECK-NEXT: [[GEP_B:%.*]] = getelementptr inbounds i32, ptr [[B]], i32 [[IV]] |
| ; CHECK-NEXT: store i32 [[ADD]], ptr [[GEP_B]], align 4 |
| ; CHECK-NEXT: [[IV_NEXT]] = add nuw nsw i32 [[IV]], 1 |
| ; CHECK-NEXT: [[COND:%.*]] = icmp eq i32 [[IV_NEXT]], [[N]] |
| ; CHECK-NEXT: br i1 [[COND]], label %[[EXIT]], label %[[LOOP]], !llvm.loop [[LOOP15:![0-9]+]] |
| ; CHECK: [[EXIT]]: |
| ; CHECK-NEXT: ret void |
| ; |
| entry: |
| br label %loop |
| |
| loop: |
| %iv = phi i32 [ 0, %entry ], [ %iv.next, %loop ] |
| %bounded = urem i32 %iv, 8 |
| %gep.a = getelementptr inbounds i32, ptr %A, i32 %bounded |
| %lv = load i32, ptr %gep.a, align 4 |
| %add = add i32 %lv, 10 |
| %gep.b = getelementptr inbounds i32, ptr %B, i32 %iv |
| store i32 %add, ptr %gep.b, align 4 |
| %iv.next = add nuw nsw i32 %iv, 1 |
| %cond = icmp eq i32 %iv.next, %N |
| br i1 %cond, label %exit, label %loop |
| |
| exit: |
| ret void |
| } |
| |
| ; Bound 4 with i64 access: bounded range should be (4-1)*8 + 8 = 32 bytes. |
| define void @load_bounded_mod4_i64(ptr %A, ptr %B, i32 %N) { |
| ; CHECK-LABEL: define void @load_bounded_mod4_i64( |
| ; CHECK-SAME: ptr [[A:%.*]], ptr [[B:%.*]], i32 [[N:%.*]]) { |
| ; CHECK-NEXT: [[ENTRY:.*]]: |
| ; CHECK-NEXT: [[A2:%.*]] = ptrtoaddr ptr [[A]] to i64 |
| ; CHECK-NEXT: [[B1:%.*]] = ptrtoaddr ptr [[B]] to i64 |
| ; CHECK-NEXT: [[MIN_ITERS_CHECK:%.*]] = icmp ult i32 [[N]], 4 |
| ; CHECK-NEXT: br i1 [[MIN_ITERS_CHECK]], label %[[SCALAR_PH:.*]], label %[[VECTOR_SCEVCHECK:.*]] |
| ; CHECK: [[VECTOR_SCEVCHECK]]: |
| ; CHECK-NEXT: [[TMP0:%.*]] = add i32 [[N]], -1 |
| ; CHECK-NEXT: [[TMP1:%.*]] = icmp ugt i32 [[TMP0]], 3 |
| ; CHECK-NEXT: br i1 [[TMP1]], label %[[SCALAR_PH]], label %[[VECTOR_MEMCHECK:.*]] |
| ; CHECK: [[VECTOR_MEMCHECK]]: |
| ; CHECK-NEXT: [[TMP2:%.*]] = sub i64 [[B1]], [[A2]] |
| ; CHECK-NEXT: [[TMP8:%.*]] = sub i64 [[TMP2]], 1 |
| ; CHECK-NEXT: [[DIFF_CHECK:%.*]] = icmp ult i64 [[TMP8]], 31 |
| ; CHECK-NEXT: br i1 [[DIFF_CHECK]], label %[[SCALAR_PH]], label %[[VECTOR_PH:.*]] |
| ; CHECK: [[VECTOR_PH]]: |
| ; CHECK-NEXT: [[N_MOD_VF:%.*]] = urem i32 [[N]], 4 |
| ; CHECK-NEXT: [[N_VEC:%.*]] = sub i32 [[N]], [[N_MOD_VF]] |
| ; CHECK-NEXT: br label %[[VECTOR_BODY:.*]] |
| ; CHECK: [[VECTOR_BODY]]: |
| ; CHECK-NEXT: [[INDEX:%.*]] = phi i32 [ 0, %[[VECTOR_PH]] ], [ [[INDEX_NEXT:%.*]], %[[VECTOR_BODY]] ] |
| ; CHECK-NEXT: [[TMP3:%.*]] = urem i32 [[INDEX]], 4 |
| ; CHECK-NEXT: [[TMP4:%.*]] = getelementptr inbounds i64, ptr [[A]], i32 [[TMP3]] |
| ; CHECK-NEXT: [[WIDE_LOAD:%.*]] = load <4 x i64>, ptr [[TMP4]], align 8 |
| ; CHECK-NEXT: [[TMP5:%.*]] = add <4 x i64> [[WIDE_LOAD]], splat (i64 10) |
| ; CHECK-NEXT: [[TMP6:%.*]] = getelementptr inbounds i64, ptr [[B]], i32 [[INDEX]] |
| ; CHECK-NEXT: store <4 x i64> [[TMP5]], ptr [[TMP6]], align 8 |
| ; CHECK-NEXT: [[INDEX_NEXT]] = add nuw i32 [[INDEX]], 4 |
| ; CHECK-NEXT: [[TMP7:%.*]] = icmp eq i32 [[INDEX_NEXT]], [[N_VEC]] |
| ; CHECK-NEXT: br i1 [[TMP7]], label %[[MIDDLE_BLOCK:.*]], label %[[VECTOR_BODY]], !llvm.loop [[LOOP16:![0-9]+]] |
| ; CHECK: [[MIDDLE_BLOCK]]: |
| ; CHECK-NEXT: [[CMP_N:%.*]] = icmp eq i32 [[N]], [[N_VEC]] |
| ; CHECK-NEXT: br i1 [[CMP_N]], label %[[EXIT:.*]], label %[[SCALAR_PH]] |
| ; CHECK: [[SCALAR_PH]]: |
| ; CHECK-NEXT: [[BC_RESUME_VAL:%.*]] = phi i32 [ [[N_VEC]], %[[MIDDLE_BLOCK]] ], [ 0, %[[ENTRY]] ], [ 0, %[[VECTOR_SCEVCHECK]] ], [ 0, %[[VECTOR_MEMCHECK]] ] |
| ; CHECK-NEXT: br label %[[LOOP:.*]] |
| ; CHECK: [[LOOP]]: |
| ; CHECK-NEXT: [[IV:%.*]] = phi i32 [ [[BC_RESUME_VAL]], %[[SCALAR_PH]] ], [ [[IV_NEXT:%.*]], %[[LOOP]] ] |
| ; CHECK-NEXT: [[BOUNDED:%.*]] = urem i32 [[IV]], 4 |
| ; CHECK-NEXT: [[GEP_A:%.*]] = getelementptr inbounds i64, ptr [[A]], i32 [[BOUNDED]] |
| ; CHECK-NEXT: [[LV:%.*]] = load i64, ptr [[GEP_A]], align 8 |
| ; CHECK-NEXT: [[ADD:%.*]] = add i64 [[LV]], 10 |
| ; CHECK-NEXT: [[GEP_B:%.*]] = getelementptr inbounds i64, ptr [[B]], i32 [[IV]] |
| ; CHECK-NEXT: store i64 [[ADD]], ptr [[GEP_B]], align 8 |
| ; CHECK-NEXT: [[IV_NEXT]] = add nuw nsw i32 [[IV]], 1 |
| ; CHECK-NEXT: [[COND:%.*]] = icmp eq i32 [[IV_NEXT]], [[N]] |
| ; CHECK-NEXT: br i1 [[COND]], label %[[EXIT]], label %[[LOOP]], !llvm.loop [[LOOP17:![0-9]+]] |
| ; CHECK: [[EXIT]]: |
| ; CHECK-NEXT: ret void |
| ; |
| entry: |
| br label %loop |
| |
| loop: |
| %iv = phi i32 [ 0, %entry ], [ %iv.next, %loop ] |
| %bounded = urem i32 %iv, 4 |
| %gep.a = getelementptr inbounds i64, ptr %A, i32 %bounded |
| %lv = load i64, ptr %gep.a, align 8 |
| %add = add i64 %lv, 10 |
| %gep.b = getelementptr inbounds i64, ptr %B, i32 %iv |
| store i64 %add, ptr %gep.b, align 8 |
| %iv.next = add nuw nsw i32 %iv, 1 |
| %cond = icmp eq i32 %iv.next, %N |
| br i1 %cond, label %exit, label %loop |
| |
| exit: |
| ret void |
| } |
| |
| ; Bound 128 (largest the matcher accepts) with i32 access: bounded range |
| ; should be (128-1)*4 + 4 = 512 bytes. Catches |
| define void @load_bounded_mod128_i32(ptr %A, ptr %B, i32 %N) { |
| ; CHECK-LABEL: define void @load_bounded_mod128_i32( |
| ; CHECK-SAME: ptr [[A:%.*]], ptr [[B:%.*]], i32 [[N:%.*]]) { |
| ; CHECK-NEXT: [[ENTRY:.*]]: |
| ; CHECK-NEXT: [[A2:%.*]] = ptrtoaddr ptr [[A]] to i64 |
| ; CHECK-NEXT: [[B1:%.*]] = ptrtoaddr ptr [[B]] to i64 |
| ; CHECK-NEXT: [[MIN_ITERS_CHECK:%.*]] = icmp ult i32 [[N]], 4 |
| ; CHECK-NEXT: br i1 [[MIN_ITERS_CHECK]], label %[[SCALAR_PH:.*]], label %[[VECTOR_SCEVCHECK:.*]] |
| ; CHECK: [[VECTOR_SCEVCHECK]]: |
| ; CHECK-NEXT: [[TMP0:%.*]] = add i32 [[N]], -1 |
| ; CHECK-NEXT: [[TMP1:%.*]] = icmp ugt i32 [[TMP0]], 127 |
| ; CHECK-NEXT: br i1 [[TMP1]], label %[[SCALAR_PH]], label %[[VECTOR_MEMCHECK:.*]] |
| ; CHECK: [[VECTOR_MEMCHECK]]: |
| ; CHECK-NEXT: [[TMP2:%.*]] = sub i64 [[B1]], [[A2]] |
| ; CHECK-NEXT: [[TMP8:%.*]] = sub i64 [[TMP2]], 1 |
| ; CHECK-NEXT: [[DIFF_CHECK:%.*]] = icmp ult i64 [[TMP8]], 15 |
| ; CHECK-NEXT: br i1 [[DIFF_CHECK]], label %[[SCALAR_PH]], label %[[VECTOR_PH:.*]] |
| ; CHECK: [[VECTOR_PH]]: |
| ; CHECK-NEXT: [[N_MOD_VF:%.*]] = urem i32 [[N]], 4 |
| ; CHECK-NEXT: [[N_VEC:%.*]] = sub i32 [[N]], [[N_MOD_VF]] |
| ; CHECK-NEXT: br label %[[VECTOR_BODY:.*]] |
| ; CHECK: [[VECTOR_BODY]]: |
| ; CHECK-NEXT: [[INDEX:%.*]] = phi i32 [ 0, %[[VECTOR_PH]] ], [ [[INDEX_NEXT:%.*]], %[[VECTOR_BODY]] ] |
| ; CHECK-NEXT: [[TMP3:%.*]] = urem i32 [[INDEX]], 128 |
| ; CHECK-NEXT: [[TMP4:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[TMP3]] |
| ; CHECK-NEXT: [[WIDE_LOAD:%.*]] = load <4 x i32>, ptr [[TMP4]], align 4 |
| ; CHECK-NEXT: [[TMP5:%.*]] = add <4 x i32> [[WIDE_LOAD]], splat (i32 10) |
| ; CHECK-NEXT: [[TMP6:%.*]] = getelementptr inbounds i32, ptr [[B]], i32 [[INDEX]] |
| ; CHECK-NEXT: store <4 x i32> [[TMP5]], ptr [[TMP6]], align 4 |
| ; CHECK-NEXT: [[INDEX_NEXT]] = add nuw i32 [[INDEX]], 4 |
| ; CHECK-NEXT: [[TMP7:%.*]] = icmp eq i32 [[INDEX_NEXT]], [[N_VEC]] |
| ; CHECK-NEXT: br i1 [[TMP7]], label %[[MIDDLE_BLOCK:.*]], label %[[VECTOR_BODY]], !llvm.loop [[LOOP18:![0-9]+]] |
| ; CHECK: [[MIDDLE_BLOCK]]: |
| ; CHECK-NEXT: [[CMP_N:%.*]] = icmp eq i32 [[N]], [[N_VEC]] |
| ; CHECK-NEXT: br i1 [[CMP_N]], label %[[EXIT:.*]], label %[[SCALAR_PH]] |
| ; CHECK: [[SCALAR_PH]]: |
| ; CHECK-NEXT: [[BC_RESUME_VAL:%.*]] = phi i32 [ [[N_VEC]], %[[MIDDLE_BLOCK]] ], [ 0, %[[ENTRY]] ], [ 0, %[[VECTOR_SCEVCHECK]] ], [ 0, %[[VECTOR_MEMCHECK]] ] |
| ; CHECK-NEXT: br label %[[LOOP:.*]] |
| ; CHECK: [[LOOP]]: |
| ; CHECK-NEXT: [[IV:%.*]] = phi i32 [ [[BC_RESUME_VAL]], %[[SCALAR_PH]] ], [ [[IV_NEXT:%.*]], %[[LOOP]] ] |
| ; CHECK-NEXT: [[BOUNDED:%.*]] = urem i32 [[IV]], 128 |
| ; CHECK-NEXT: [[GEP_A:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[BOUNDED]] |
| ; CHECK-NEXT: [[LV:%.*]] = load i32, ptr [[GEP_A]], align 4 |
| ; CHECK-NEXT: [[ADD:%.*]] = add i32 [[LV]], 10 |
| ; CHECK-NEXT: [[GEP_B:%.*]] = getelementptr inbounds i32, ptr [[B]], i32 [[IV]] |
| ; CHECK-NEXT: store i32 [[ADD]], ptr [[GEP_B]], align 4 |
| ; CHECK-NEXT: [[IV_NEXT]] = add nuw nsw i32 [[IV]], 1 |
| ; CHECK-NEXT: [[COND:%.*]] = icmp eq i32 [[IV_NEXT]], [[N]] |
| ; CHECK-NEXT: br i1 [[COND]], label %[[EXIT]], label %[[LOOP]], !llvm.loop [[LOOP19:![0-9]+]] |
| ; CHECK: [[EXIT]]: |
| ; CHECK-NEXT: ret void |
| ; |
| entry: |
| br label %loop |
| loop: |
| %iv = phi i32 [ 0, %entry ], [ %iv.next, %loop ] |
| %bounded = urem i32 %iv, 128 |
| %gep.a = getelementptr inbounds i32, ptr %A, i32 %bounded |
| %lv = load i32, ptr %gep.a, align 4 |
| %add = add i32 %lv, 10 |
| %gep.b = getelementptr inbounds i32, ptr %B, i32 %iv |
| store i32 %add, ptr %gep.b, align 4 |
| %iv.next = add nuw nsw i32 %iv, 1 |
| %cond = icmp eq i32 %iv.next, %N |
| br i1 %cond, label %exit, label %loop |
| exit: |
| ret void |
| } |
| |
| ; Two bounded loads with different bounds in the same loop. |
| define void @two_bounded_loads_mixed_bounds(ptr %A, ptr %C, ptr %B, i32 %N) { |
| ; CHECK-LABEL: define void @two_bounded_loads_mixed_bounds( |
| ; CHECK-SAME: ptr [[A:%.*]], ptr [[C:%.*]], ptr [[B:%.*]], i32 [[N:%.*]]) { |
| ; CHECK-NEXT: [[ENTRY:.*]]: |
| ; CHECK-NEXT: [[C3:%.*]] = ptrtoaddr ptr [[C]] to i64 |
| ; CHECK-NEXT: [[A2:%.*]] = ptrtoaddr ptr [[A]] to i64 |
| ; CHECK-NEXT: [[B1:%.*]] = ptrtoaddr ptr [[B]] to i64 |
| ; CHECK-NEXT: [[MIN_ITERS_CHECK:%.*]] = icmp ult i32 [[N]], 4 |
| ; CHECK-NEXT: br i1 [[MIN_ITERS_CHECK]], label %[[SCALAR_PH:.*]], label %[[VECTOR_SCEVCHECK:.*]] |
| ; CHECK: [[VECTOR_SCEVCHECK]]: |
| ; CHECK-NEXT: [[TMP0:%.*]] = add i32 [[N]], -1 |
| ; CHECK-NEXT: [[TMP1:%.*]] = icmp ugt i32 [[TMP0]], 3 |
| ; CHECK-NEXT: br i1 [[TMP1]], label %[[SCALAR_PH]], label %[[VECTOR_MEMCHECK:.*]] |
| ; CHECK: [[VECTOR_MEMCHECK]]: |
| ; CHECK-NEXT: [[TMP2:%.*]] = sub i64 [[B1]], [[A2]] |
| ; CHECK-NEXT: [[TMP11:%.*]] = sub i64 [[TMP2]], 1 |
| ; CHECK-NEXT: [[DIFF_CHECK:%.*]] = icmp ult i64 [[TMP11]], 15 |
| ; CHECK-NEXT: [[TMP3:%.*]] = sub i64 [[B1]], [[C3]] |
| ; CHECK-NEXT: [[TMP12:%.*]] = sub i64 [[TMP3]], 1 |
| ; CHECK-NEXT: [[DIFF_CHECK4:%.*]] = icmp ult i64 [[TMP12]], 15 |
| ; CHECK-NEXT: [[CONFLICT_RDX:%.*]] = or i1 [[DIFF_CHECK]], [[DIFF_CHECK4]] |
| ; CHECK-NEXT: br i1 [[CONFLICT_RDX]], label %[[SCALAR_PH]], label %[[VECTOR_PH:.*]] |
| ; CHECK: [[VECTOR_PH]]: |
| ; CHECK-NEXT: [[N_MOD_VF:%.*]] = urem i32 [[N]], 4 |
| ; CHECK-NEXT: [[N_VEC:%.*]] = sub i32 [[N]], [[N_MOD_VF]] |
| ; CHECK-NEXT: br label %[[VECTOR_BODY:.*]] |
| ; CHECK: [[VECTOR_BODY]]: |
| ; CHECK-NEXT: [[INDEX:%.*]] = phi i32 [ 0, %[[VECTOR_PH]] ], [ [[INDEX_NEXT:%.*]], %[[VECTOR_BODY]] ] |
| ; CHECK-NEXT: [[TMP4:%.*]] = urem i32 [[INDEX]], 4 |
| ; CHECK-NEXT: [[TMP5:%.*]] = urem i32 [[INDEX]], 8 |
| ; CHECK-NEXT: [[TMP6:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[TMP4]] |
| ; CHECK-NEXT: [[TMP7:%.*]] = getelementptr inbounds i32, ptr [[C]], i32 [[TMP5]] |
| ; CHECK-NEXT: [[WIDE_LOAD:%.*]] = load <4 x i32>, ptr [[TMP6]], align 4 |
| ; CHECK-NEXT: [[WIDE_LOAD5:%.*]] = load <4 x i32>, ptr [[TMP7]], align 4 |
| ; CHECK-NEXT: [[TMP8:%.*]] = add <4 x i32> [[WIDE_LOAD]], [[WIDE_LOAD5]] |
| ; CHECK-NEXT: [[TMP9:%.*]] = getelementptr inbounds i32, ptr [[B]], i32 [[INDEX]] |
| ; CHECK-NEXT: store <4 x i32> [[TMP8]], ptr [[TMP9]], align 4 |
| ; CHECK-NEXT: [[INDEX_NEXT]] = add nuw i32 [[INDEX]], 4 |
| ; CHECK-NEXT: [[TMP10:%.*]] = icmp eq i32 [[INDEX_NEXT]], [[N_VEC]] |
| ; CHECK-NEXT: br i1 [[TMP10]], label %[[MIDDLE_BLOCK:.*]], label %[[VECTOR_BODY]], !llvm.loop [[LOOP20:![0-9]+]] |
| ; CHECK: [[MIDDLE_BLOCK]]: |
| ; CHECK-NEXT: [[CMP_N:%.*]] = icmp eq i32 [[N]], [[N_VEC]] |
| ; CHECK-NEXT: br i1 [[CMP_N]], label %[[EXIT:.*]], label %[[SCALAR_PH]] |
| ; CHECK: [[SCALAR_PH]]: |
| ; CHECK-NEXT: [[BC_RESUME_VAL:%.*]] = phi i32 [ [[N_VEC]], %[[MIDDLE_BLOCK]] ], [ 0, %[[ENTRY]] ], [ 0, %[[VECTOR_SCEVCHECK]] ], [ 0, %[[VECTOR_MEMCHECK]] ] |
| ; CHECK-NEXT: br label %[[LOOP:.*]] |
| ; CHECK: [[LOOP]]: |
| ; CHECK-NEXT: [[IV:%.*]] = phi i32 [ [[BC_RESUME_VAL]], %[[SCALAR_PH]] ], [ [[IV_NEXT:%.*]], %[[LOOP]] ] |
| ; CHECK-NEXT: [[M4:%.*]] = urem i32 [[IV]], 4 |
| ; CHECK-NEXT: [[M8:%.*]] = urem i32 [[IV]], 8 |
| ; CHECK-NEXT: [[GEP_A:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[M4]] |
| ; CHECK-NEXT: [[GEP_C:%.*]] = getelementptr inbounds i32, ptr [[C]], i32 [[M8]] |
| ; CHECK-NEXT: [[LA:%.*]] = load i32, ptr [[GEP_A]], align 4 |
| ; CHECK-NEXT: [[LC:%.*]] = load i32, ptr [[GEP_C]], align 4 |
| ; CHECK-NEXT: [[SUM:%.*]] = add i32 [[LA]], [[LC]] |
| ; CHECK-NEXT: [[GEP_B:%.*]] = getelementptr inbounds i32, ptr [[B]], i32 [[IV]] |
| ; CHECK-NEXT: store i32 [[SUM]], ptr [[GEP_B]], align 4 |
| ; CHECK-NEXT: [[IV_NEXT]] = add nuw nsw i32 [[IV]], 1 |
| ; CHECK-NEXT: [[COND:%.*]] = icmp eq i32 [[IV_NEXT]], [[N]] |
| ; CHECK-NEXT: br i1 [[COND]], label %[[EXIT]], label %[[LOOP]], !llvm.loop [[LOOP21:![0-9]+]] |
| ; CHECK: [[EXIT]]: |
| ; CHECK-NEXT: ret void |
| ; |
| entry: |
| br label %loop |
| |
| loop: |
| %iv = phi i32 [ 0, %entry ], [ %iv.next, %loop ] |
| %m4 = urem i32 %iv, 4 |
| %m8 = urem i32 %iv, 8 |
| %gep.a = getelementptr inbounds i32, ptr %A, i32 %m4 |
| %gep.c = getelementptr inbounds i32, ptr %C, i32 %m8 |
| %la = load i32, ptr %gep.a, align 4 |
| %lc = load i32, ptr %gep.c, align 4 |
| %sum = add i32 %la, %lc |
| %gep.b = getelementptr inbounds i32, ptr %B, i32 %iv |
| store i32 %sum, ptr %gep.b, align 4 |
| %iv.next = add nuw nsw i32 %iv, 1 |
| %cond = icmp eq i32 %iv.next, %N |
| br i1 %cond, label %exit, label %loop |
| |
| exit: |
| ret void |
| } |
| |
| define i32 @scale_mismatch_rejected(ptr %A, i32 %N) { |
| ; CHECK-LABEL: define i32 @scale_mismatch_rejected( |
| ; CHECK-SAME: ptr [[A:%.*]], i32 [[N:%.*]]) { |
| ; CHECK-NEXT: [[ENTRY:.*]]: |
| ; CHECK-NEXT: [[MIN_ITERS_CHECK:%.*]] = icmp ult i32 [[N]], 4 |
| ; CHECK-NEXT: br i1 [[MIN_ITERS_CHECK]], label %[[SCALAR_PH:.*]], label %[[VECTOR_SCEVCHECK:.*]] |
| ; CHECK: [[VECTOR_SCEVCHECK]]: |
| ; CHECK-NEXT: [[TMP0:%.*]] = add i32 [[N]], -1 |
| ; CHECK-NEXT: [[TMP1:%.*]] = icmp ugt i32 [[TMP0]], 3 |
| ; CHECK-NEXT: br i1 [[TMP1]], label %[[SCALAR_PH]], label %[[VECTOR_PH:.*]] |
| ; CHECK: [[VECTOR_PH]]: |
| ; CHECK-NEXT: [[N_MOD_VF:%.*]] = urem i32 [[N]], 4 |
| ; CHECK-NEXT: [[N_VEC:%.*]] = sub i32 [[N]], [[N_MOD_VF]] |
| ; CHECK-NEXT: br label %[[VECTOR_BODY:.*]] |
| ; CHECK: [[VECTOR_BODY]]: |
| ; CHECK-NEXT: [[INDEX:%.*]] = phi i32 [ 0, %[[VECTOR_PH]] ], [ [[INDEX_NEXT:%.*]], %[[VECTOR_BODY]] ] |
| ; CHECK-NEXT: [[VEC_IND:%.*]] = phi <4 x i32> [ <i32 0, i32 1, i32 2, i32 3>, %[[VECTOR_PH]] ], [ [[VEC_IND_NEXT:%.*]], %[[VECTOR_BODY]] ] |
| ; CHECK-NEXT: [[VEC_PHI:%.*]] = phi <4 x i32> [ zeroinitializer, %[[VECTOR_PH]] ], [ [[TMP20:%.*]], %[[VECTOR_BODY]] ] |
| ; CHECK-NEXT: [[TMP2:%.*]] = urem <4 x i32> [[VEC_IND]], splat (i32 4) |
| ; CHECK-NEXT: [[TMP3:%.*]] = shl <4 x i32> [[TMP2]], splat (i32 1) |
| ; CHECK-NEXT: [[TMP4:%.*]] = extractelement <4 x i32> [[TMP3]], i64 0 |
| ; CHECK-NEXT: [[TMP5:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[TMP4]] |
| ; CHECK-NEXT: [[TMP6:%.*]] = extractelement <4 x i32> [[TMP3]], i64 1 |
| ; CHECK-NEXT: [[TMP7:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[TMP6]] |
| ; CHECK-NEXT: [[TMP8:%.*]] = extractelement <4 x i32> [[TMP3]], i64 2 |
| ; CHECK-NEXT: [[TMP9:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[TMP8]] |
| ; CHECK-NEXT: [[TMP10:%.*]] = extractelement <4 x i32> [[TMP3]], i64 3 |
| ; CHECK-NEXT: [[TMP11:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[TMP10]] |
| ; CHECK-NEXT: [[TMP12:%.*]] = load i32, ptr [[TMP5]], align 4 |
| ; CHECK-NEXT: [[TMP13:%.*]] = load i32, ptr [[TMP7]], align 4 |
| ; CHECK-NEXT: [[TMP14:%.*]] = load i32, ptr [[TMP9]], align 4 |
| ; CHECK-NEXT: [[TMP15:%.*]] = load i32, ptr [[TMP11]], align 4 |
| ; CHECK-NEXT: [[TMP16:%.*]] = insertelement <4 x i32> poison, i32 [[TMP12]], i32 0 |
| ; CHECK-NEXT: [[TMP17:%.*]] = insertelement <4 x i32> [[TMP16]], i32 [[TMP13]], i32 1 |
| ; CHECK-NEXT: [[TMP18:%.*]] = insertelement <4 x i32> [[TMP17]], i32 [[TMP14]], i32 2 |
| ; CHECK-NEXT: [[TMP19:%.*]] = insertelement <4 x i32> [[TMP18]], i32 [[TMP15]], i32 3 |
| ; CHECK-NEXT: [[TMP20]] = add <4 x i32> [[VEC_PHI]], [[TMP19]] |
| ; CHECK-NEXT: [[INDEX_NEXT]] = add nuw i32 [[INDEX]], 4 |
| ; CHECK-NEXT: [[VEC_IND_NEXT]] = add nuw nsw <4 x i32> [[VEC_IND]], splat (i32 4) |
| ; CHECK-NEXT: [[TMP21:%.*]] = icmp eq i32 [[INDEX_NEXT]], [[N_VEC]] |
| ; CHECK-NEXT: br i1 [[TMP21]], label %[[MIDDLE_BLOCK:.*]], label %[[VECTOR_BODY]], !llvm.loop [[LOOP22:![0-9]+]] |
| ; CHECK: [[MIDDLE_BLOCK]]: |
| ; CHECK-NEXT: [[TMP22:%.*]] = call i32 @llvm.vector.reduce.add.v4i32(<4 x i32> [[TMP20]]) |
| ; CHECK-NEXT: [[CMP_N:%.*]] = icmp eq i32 [[N]], [[N_VEC]] |
| ; CHECK-NEXT: br i1 [[CMP_N]], label %[[EXIT:.*]], label %[[SCALAR_PH]] |
| ; CHECK: [[SCALAR_PH]]: |
| ; CHECK-NEXT: [[BC_RESUME_VAL:%.*]] = phi i32 [ [[N_VEC]], %[[MIDDLE_BLOCK]] ], [ 0, %[[ENTRY]] ], [ 0, %[[VECTOR_SCEVCHECK]] ] |
| ; CHECK-NEXT: [[BC_MERGE_RDX:%.*]] = phi i32 [ [[TMP22]], %[[MIDDLE_BLOCK]] ], [ 0, %[[ENTRY]] ], [ 0, %[[VECTOR_SCEVCHECK]] ] |
| ; CHECK-NEXT: br label %[[LOOP:.*]] |
| ; CHECK: [[LOOP]]: |
| ; CHECK-NEXT: [[IV:%.*]] = phi i32 [ [[BC_RESUME_VAL]], %[[SCALAR_PH]] ], [ [[IV_NEXT:%.*]], %[[LOOP]] ] |
| ; CHECK-NEXT: [[SUM:%.*]] = phi i32 [ [[BC_MERGE_RDX]], %[[SCALAR_PH]] ], [ [[SUM_NEXT:%.*]], %[[LOOP]] ] |
| ; CHECK-NEXT: [[BOUNDED:%.*]] = urem i32 [[IV]], 4 |
| ; CHECK-NEXT: [[IDX2:%.*]] = mul i32 [[BOUNDED]], 2 |
| ; CHECK-NEXT: [[GEP_A:%.*]] = getelementptr inbounds i32, ptr [[A]], i32 [[IDX2]] |
| ; CHECK-NEXT: [[LV:%.*]] = load i32, ptr [[GEP_A]], align 4 |
| ; CHECK-NEXT: [[SUM_NEXT]] = add i32 [[SUM]], [[LV]] |
| ; CHECK-NEXT: [[IV_NEXT]] = add nuw nsw i32 [[IV]], 1 |
| ; CHECK-NEXT: [[COND:%.*]] = icmp eq i32 [[IV_NEXT]], [[N]] |
| ; CHECK-NEXT: br i1 [[COND]], label %[[EXIT]], label %[[LOOP]], !llvm.loop [[LOOP23:![0-9]+]] |
| ; CHECK: [[EXIT]]: |
| ; CHECK-NEXT: [[R:%.*]] = phi i32 [ [[SUM_NEXT]], %[[LOOP]] ], [ [[TMP22]], %[[MIDDLE_BLOCK]] ] |
| ; CHECK-NEXT: ret i32 [[R]] |
| ; |
| entry: |
| br label %loop |
| |
| loop: |
| %iv = phi i32 [ 0, %entry ], [ %iv.next, %loop ] |
| %sum = phi i32 [ 0, %entry ], [ %sum.next, %loop ] |
| %bounded = urem i32 %iv, 4 |
| %idx2 = mul i32 %bounded, 2 |
| %gep.A = getelementptr inbounds i32, ptr %A, i32 %idx2 |
| %lv = load i32, ptr %gep.A, align 4 |
| %sum.next = add i32 %sum, %lv |
| %iv.next = add nuw nsw i32 %iv, 1 |
| %cond = icmp eq i32 %iv.next, %N |
| br i1 %cond, label %exit, label %loop |
| |
| exit: |
| %r = phi i32 [ %sum.next, %loop ] |
| ret i32 %r |
| } |