| ; NOTE: Assertions have been autogenerated by utils/update_test_checks.py UTC_ARGS: --check-globals none --filter-out-after "scalar.ph:" --version 6 | |
| ; RUN: opt -p loop-vectorize -force-vector-width=4 -S %s | FileCheck %s | |
| ; The loops below walk a dereferenceable region backwards, so every load is | |
| ; safe. | |
| ; TODO: The counting-down IV is in the range [0, %length), which is exactly the region | |
| ; the assume marks dereferenceable, so the early-exit loop should be vectorized. | |
| define ptr @reverse_reaches_base_dynamic_length(i64 %length, ptr %ptr) { | |
| ; CHECK-LABEL: define ptr @reverse_reaches_base_dynamic_length( | |
| ; CHECK-SAME: i64 [[LENGTH:%.*]], ptr [[PTR:%.*]]) { | |
| ; CHECK-NEXT: [[ENTRY:.*]]: | |
| ; CHECK-NEXT: [[NULL_CHECK:%.*]] = icmp eq i64 [[LENGTH]], 0 | |
| ; CHECK-NEXT: br i1 [[NULL_CHECK]], label %[[EXIT:.*]], label %[[PREHEADER:.*]] | |
| ; CHECK: [[PREHEADER]]: | |
| ; CHECK-NEXT: call void @llvm.assume(i1 true) [ "dereferenceable"(ptr [[PTR]], i64 [[LENGTH]]) ] | |
| ; CHECK-NEXT: [[START:%.*]] = sub i64 [[LENGTH]], 1 | |
| ; CHECK-NEXT: br label %[[LOOP_HEADER:.*]] | |
| ; CHECK: [[LOOP_HEADER]]: | |
| ; CHECK-NEXT: [[IV:%.*]] = phi i64 [ [[START]], %[[PREHEADER]] ], [ [[IV_NEXT:%.*]], %[[LOOP_LATCH:.*]] ] | |
| ; CHECK-NEXT: [[ELEMENT_GEP:%.*]] = getelementptr i8, ptr [[PTR]], i64 [[IV]] | |
| ; CHECK-NEXT: [[ELEMENT:%.*]] = load i8, ptr [[ELEMENT_GEP]], align 1 | |
| ; CHECK-NEXT: [[FOUND_CHECK:%.*]] = icmp eq i8 [[ELEMENT]], 0 | |
| ; CHECK-NEXT: br i1 [[FOUND_CHECK]], label %[[EXIT_LOOPEXIT:.*]], label %[[LOOP_LATCH]] | |
| ; CHECK: [[LOOP_LATCH]]: | |
| ; CHECK-NEXT: [[IV_NEXT]] = add i64 [[IV]], -1 | |
| ; CHECK-NEXT: [[RANGE_CHECK:%.*]] = icmp ne i64 [[IV]], 0 | |
| ; CHECK-NEXT: br i1 [[RANGE_CHECK]], label %[[LOOP_HEADER]], label %[[EXIT_LOOPEXIT]] | |
| ; CHECK: [[EXIT_LOOPEXIT]]: | |
| ; CHECK-NEXT: [[RES_PH:%.*]] = phi ptr [ null, %[[LOOP_LATCH]] ], [ [[ELEMENT_GEP]], %[[LOOP_HEADER]] ] | |
| ; CHECK-NEXT: br label %[[EXIT]] | |
| ; CHECK: [[EXIT]]: | |
| ; CHECK-NEXT: [[RES:%.*]] = phi ptr [ null, %[[ENTRY]] ], [ [[RES_PH]], %[[EXIT_LOOPEXIT]] ] | |
| ; CHECK-NEXT: ret ptr [[RES]] | |
| ; | |
| entry: | |
| %null_check = icmp eq i64 %length, 0 | |
| br i1 %null_check, label %exit, label %preheader | |
| preheader: | |
| call void @llvm.assume(i1 true) [ "dereferenceable"(ptr %ptr, i64 %length) ] | |
| %start = sub i64 %length, 1 | |
| br label %loop.header | |
| loop.header: | |
| %iv = phi i64 [ %start, %preheader ], [ %iv.next, %loop.latch ] | |
| %element_gep = getelementptr i8, ptr %ptr, i64 %iv | |
| %element = load i8, ptr %element_gep, align 1 | |
| %found_check = icmp eq i8 %element, 0 | |
| br i1 %found_check, label %exit, label %loop.latch | |
| loop.latch: | |
| %iv.next = add i64 %iv, -1 | |
| %range_check = icmp ne i64 %iv, 0 | |
| br i1 %range_check, label %loop.header, label %exit | |
| exit: | |
| %res = phi ptr [ null, %entry ], [ %element_gep, %loop.header ], [ null, %loop.latch ] | |
| ret ptr %res | |
| } | |
| ; TODO: The last iteration lands exactly on %ptr, so the accessed range [0, 16) | |
| ; exactly fills the dereferenceable region, and the early-exit loop should be | |
| ; vectorized. | |
| define ptr @reverse_reaches_base_static_length(ptr dereferenceable(16) %ptr) { | |
| ; CHECK-LABEL: define ptr @reverse_reaches_base_static_length( | |
| ; CHECK-SAME: ptr dereferenceable(16) [[PTR:%.*]]) { | |
| ; CHECK-NEXT: [[ENTRY:.*]]: | |
| ; CHECK-NEXT: br label %[[LOOP_HEADER:.*]] | |
| ; CHECK: [[LOOP_HEADER]]: | |
| ; CHECK-NEXT: [[IV:%.*]] = phi i64 [ 15, %[[ENTRY]] ], [ [[IV_NEXT:%.*]], %[[LOOP_LATCH:.*]] ] | |
| ; CHECK-NEXT: [[ELEMENT_GEP:%.*]] = getelementptr i8, ptr [[PTR]], i64 [[IV]] | |
| ; CHECK-NEXT: [[ELEMENT:%.*]] = load i8, ptr [[ELEMENT_GEP]], align 1 | |
| ; CHECK-NEXT: [[FOUND_CHECK:%.*]] = icmp eq i8 [[ELEMENT]], 0 | |
| ; CHECK-NEXT: br i1 [[FOUND_CHECK]], label %[[EXIT:.*]], label %[[LOOP_LATCH]] | |
| ; CHECK: [[LOOP_LATCH]]: | |
| ; CHECK-NEXT: [[IV_NEXT]] = add i64 [[IV]], -1 | |
| ; CHECK-NEXT: [[RANGE_CHECK:%.*]] = icmp ne i64 [[IV]], 0 | |
| ; CHECK-NEXT: br i1 [[RANGE_CHECK]], label %[[LOOP_HEADER]], label %[[EXIT]] | |
| ; CHECK: [[EXIT]]: | |
| ; CHECK-NEXT: [[RES:%.*]] = phi ptr [ [[ELEMENT_GEP]], %[[LOOP_HEADER]] ], [ null, %[[LOOP_LATCH]] ] | |
| ; CHECK-NEXT: ret ptr [[RES]] | |
| ; | |
| entry: | |
| br label %loop.header | |
| loop.header: | |
| %iv = phi i64 [ 15, %entry ], [ %iv.next, %loop.latch ] | |
| %element_gep = getelementptr i8, ptr %ptr, i64 %iv | |
| %element = load i8, ptr %element_gep, align 1 | |
| %found_check = icmp eq i8 %element, 0 | |
| br i1 %found_check, label %exit, label %loop.latch | |
| loop.latch: | |
| %iv.next = add i64 %iv, -1 | |
| %range_check = icmp ne i64 %iv, 0 | |
| br i1 %range_check, label %loop.header, label %exit | |
| exit: | |
| %res = phi ptr [ %element_gep, %loop.header ], [ null, %loop.latch ] | |
| ret ptr %res | |
| } |