29 lines · plain
1; RUN: opt -mtriple=x86_64-unknown-linux -passes=load-store-vectorizer -S -o - %s | FileCheck %s2; RUN: opt -mtriple=x86_64-unknown-linux -aa-pipeline=basic-aa -passes='function(load-store-vectorizer)' -S -o - %s | FileCheck %s3 4target datalayout = "e-p:32:32-p1:64:64-p2:64:64-p3:32:32-p4:64:64-p5:32:32-p24:64:64-i64:64-v16:16-v24:32-v32:32-v48:64-v96:128-v192:256-v256:256-v512:512-v1024:1024-v2048:2048-n32:64"5 6%struct.buffer_t = type { i32, ptr }7 8; Check an i32 and ptr get vectorized, and that the two accesses9; (load into buff.val and store to buff.p) preserve their order.10; Vectorized loads should be inserted at the position of the first load,11; and instructions which were between the first and last load should be12; reordered preserving their relative order inasmuch as possible.13 14; CHECK-LABEL: @preserve_order_32(15; CHECK: load <2 x i32>16; CHECK: %buff.val = load i817; CHECK: store i8 018define void @preserve_order_32(ptr noalias %buff) #0 {19entry:20 %tmp1 = getelementptr inbounds %struct.buffer_t, ptr %buff, i32 0, i32 121 %buff.p = load ptr, ptr %tmp122 %buff.val = load i8, ptr %buff.p23 store i8 0, ptr %buff.p, align 824 %buff.int = load i32, ptr %buff, align 825 ret void26}27 28attributes #0 = { nounwind }29