74 lines · plain
1; RUN: opt -mtriple=x86_64-unknown-linux-gnu -passes=load-store-vectorizer -S -o - %s | FileCheck %s2; RUN: opt -mtriple=x86_64-unknown-linux-gnu -aa-pipeline=basic-aa -passes='function(load-store-vectorizer)' -S -o - %s | FileCheck %s3 4target datalayout = "e-m:e-i64:64-i128:128-n32:64-S128"5 6%struct.buffer_t = type { i64, ptr }7%struct.nested.buffer = type { %struct.buffer_t, %struct.buffer_t }8 9; Check an i64 and ptr get vectorized, and that the two accesses10; (load into buff.val and store to buff.p) preserve their order.11; Vectorized loads should be inserted at the position of the first load,12; and instructions which were between the first and last load should be13; reordered preserving their relative order inasmuch as possible.14 15; CHECK-LABEL: @preserve_order_64(16; CHECK: load <2 x i64>17; CHECK: %buff.val = load i818; CHECK: store i8 019define void @preserve_order_64(ptr noalias %buff) #0 {20entry:21 %tmp1 = getelementptr inbounds %struct.buffer_t, ptr %buff, i64 0, i32 122 %buff.p = load ptr, ptr %tmp123 %buff.val = load i8, ptr %buff.p24 store i8 0, ptr %buff.p, align 825 %buff.int = load i64, ptr %buff, align 1626 ret void27}28 29; Check reordering recurses correctly.30 31; CHECK-LABEL: @transitive_reorder(32; CHECK: load <2 x i64>33; CHECK: %buff.val = load i834; CHECK: store i8 035define void @transitive_reorder(ptr noalias %buff, ptr noalias %nest) #0 {36entry:37 %tmp1 = getelementptr inbounds %struct.buffer_t, ptr %nest, i64 0, i32 138 %buff.p = load ptr, ptr %tmp139 %buff.val = load i8, ptr %buff.p40 store i8 0, ptr %buff.p, align 841 %buff.int = load i64, ptr %nest, align 1642 ret void43}44 45; Check for no vectorization over phi node46 47; CHECK-LABEL: @no_vect_phi(48; CHECK: load ptr49; CHECK: load i850; CHECK: store i8 051; CHECK: load i6452define void @no_vect_phi(ptr noalias %ptr, ptr noalias %buff) {53entry:54 %tmp1 = getelementptr inbounds %struct.buffer_t, ptr %buff, i64 0, i32 155 %buff.p = load ptr, ptr %tmp156 %buff.val = load i8, ptr %buff.p57 store i8 0, ptr %buff.p, align 858 br label %"for something"59 60"for something":61 %index = phi i64 [ 0, %entry ], [ %index.next, %"for something" ]62 63 %buff.int = load i64, ptr %buff, align 1664 65 %index.next = add i64 %index, 866 %cmp_res = icmp eq i64 %index.next, 867 br i1 %cmp_res, label %ending, label %"for something"68 69ending:70 ret void71}72 73attributes #0 = { nounwind }74