; RUN: opt -passes=loop-vectorize -mcpu=corei7-avx -debug -S < %s 2>&1 | FileCheck %s
; REQUIRES: asserts
target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64-S128"
target triple = "x86_64-apple-macosx10.8.0"
%0 = type { ptr, %1 }
%1 = type { ptr, i32 }
@p = global [2048 x [8 x ptr]] zeroinitializer, align 16
@q = global [2048 x i16] zeroinitializer, align 16
@r = global [2048 x i16] zeroinitializer, align 16
; Tests for widest type
; Ensure that we count the pointer store in the first test case. We have a
; consecutive vector of pointers store, therefore we should count it towards the
; widest vector count.
;
; CHECK: test_consecutive_store
; CHECK: LV: The Smallest and Widest types: 64 / 64 bits.
; CHECK: LV: Selecting VF: 4
define void @test_consecutive_store(ptr, ptr, ptr nocapture) nounwind ssp uwtable align 2 {
%4 = load ptr, ptr %2, align 8
%5 = icmp eq ptr %0, %1
br i1 %5, label %12, label %6
; <label>:6 ; preds = %3
br label %7
; <label>:7 ; preds = %7, %6
%8 = phi ptr [ %0, %6 ], [ %9, %7 ]
store ptr %4, ptr %8, align 8
%9 = getelementptr inbounds ptr, ptr %8, i64 1
%10 = icmp eq ptr %9, %1
br i1 %10, label %11, label %7
; <label>:11 ; preds = %7
br label %12
; <label>:12 ; preds = %11, %3
ret void
}
; However, if the store of a set of pointers is not to consecutive memory we do
; NOT count the store towards the widest vector type.
; In the test case below we add i16 types to store it in an array of pointer,
; therefore the widest type should be i16.
; int* p[2048][8];
; short q[2048];
; for (int y = 0; y < 8; ++y)
; for (int i = 0; i < 1024; ++i) {
; p[i][y] = (int*) (1 + q[i]);
; }
; CHECK: test_nonconsecutive_store
; CHECK: LV: The Smallest and Widest types: 16 / 64 bits.
; CHECK: LV: Selecting VF: 1
define void @test_nonconsecutive_store() nounwind ssp uwtable {
br label %1
; <label>:1 ; preds = %14, %0
%2 = phi i64 [ 0, %0 ], [ %15, %14 ]
br label %3
; <label>:3 ; preds = %3, %1
%4 = phi i64 [ 0, %1 ], [ %11, %3 ]
%5 = getelementptr inbounds [2048 x i16], ptr @q, i64 0, i64 %4
%6 = load i16, ptr %5, align 2
%7 = sext i16 %6 to i64
%8 = add i64 %7, 1
%9 = inttoptr i64 %8 to ptr
%10 = getelementptr inbounds [2048 x [8 x ptr]], ptr @p, i64 0, i64 %4, i64 %2
store ptr %9, ptr %10, align 8
%11 = add i64 %4, 1
%12 = trunc i64 %11 to i32
%13 = icmp ne i32 %12, 1024
br i1 %13, label %3, label %14
; <label>:14 ; preds = %3
%15 = add i64 %2, 1
%16 = trunc i64 %15 to i32
%17 = icmp ne i32 %16, 8
br i1 %17, label %1, label %18
; <label>:18 ; preds = %14
ret void
}
@ia = global [1024 x ptr] zeroinitializer, align 16
@ib = global [1024 x i32] zeroinitializer, align 16
@ic = global [1024 x i8] zeroinitializer, align 16
@p2 = global [2048 x [8 x ptr]] zeroinitializer, align 16
@q2 = global [2048 x i16] zeroinitializer, align 16
;; Now we check the same rules for loads. We should take consecutive loads of
;; pointer types into account.
; CHECK: test_consecutive_ptr_load
; CHECK: LV: The Smallest and Widest types: 8 / 64 bits.
; CHECK: LV: Selecting VF: 4
define i8 @test_consecutive_ptr_load() nounwind readonly ssp uwtable {
br label %1
; <label>:1 ; preds = %1, %0
%2 = phi i64 [ 0, %0 ], [ %10, %1 ]
%3 = phi i8 [ 0, %0 ], [ %9, %1 ]
%4 = getelementptr inbounds [1024 x ptr], ptr @ia, i32 0, i64 %2
%5 = load ptr, ptr %4, align 4
%6 = ptrtoint ptr %5 to i64
%7 = trunc i64 %6 to i8
%8 = add i8 %3, 1
%9 = add i8 %7, %8
%10 = add i64 %2, 1
%11 = icmp ne i64 %10, 1024
br i1 %11, label %1, label %12
; <label>:12 ; preds = %1
%13 = phi i8 [ %9, %1 ]
ret i8 %13
}
;; However, we should not take unconsecutive loads of pointers into account.
; CHECK: test_nonconsecutive_ptr_load
; CHECK: LV: The Smallest and Widest types: 16 / 64 bits.
; CHECK: LV: Selecting VF: 4
define void @test_nonconsecutive_ptr_load() nounwind ssp uwtable {
br label %1
; <label>:1 ; preds = %13, %0
%2 = phi i64 [ 0, %0 ], [ %14, %13 ]
br label %3
; <label>:3 ; preds = %3, %1
%4 = phi i64 [ 0, %1 ], [ %10, %3 ]
%5 = getelementptr inbounds [2048 x [8 x ptr]], ptr @p2, i64 0, i64 %4, i64 %2
%6 = getelementptr inbounds [2048 x i16], ptr @q2, i64 0, i64 %4
%7 = load ptr, ptr %5, align 2
%8 = ptrtoint ptr %7 to i64
%9 = trunc i64 %8 to i16
store i16 %9, ptr %6, align 8
%10 = add i64 %4, 1
%11 = trunc i64 %10 to i32
%12 = icmp ne i32 %11, 1024
br i1 %12, label %3, label %13
; <label>:13 ; preds = %3
%14 = add i64 %2, 1
%15 = trunc i64 %14 to i32
%16 = icmp ne i32 %15, 8
br i1 %16, label %1, label %17
; <label>:17 ; preds = %13
ret void
}
Codebase Browser
llvm