1 ; RUN: opt -mtriple=x86-linux -load-store-vectorizer -S -o - %s | FileCheck %s 2 3 target 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" 4 5 %struct.buffer_t = type { i32, i8* } 6 7 ; Check an i32 and i8* get vectorized, and that the two accesses 8 ; (load into buff.val and store to buff.p) preserve their order. 9 ; Vectorized loads should be inserted at the position of the first load, 10 ; and instructions which were between the first and last load should be 11 ; reordered preserving their relative order inasmuch as possible. 12 13 ; CHECK-LABEL: @preserve_order_32( 14 ; CHECK: load <2 x i32> 15 ; CHECK: %buff.val = load i8 16 ; CHECK: store i8 0 17 define void @preserve_order_32(%struct.buffer_t* noalias %buff) #0 { 18 entry: 19 %tmp1 = getelementptr inbounds %struct.buffer_t, %struct.buffer_t* %buff, i32 0, i32 1 20 %buff.p = load i8*, i8** %tmp1, align 8 21 %buff.val = load i8, i8* %buff.p, align 8 22 store i8 0, i8* %buff.p, align 8 23 %tmp0 = getelementptr inbounds %struct.buffer_t, %struct.buffer_t* %buff, i32 0, i32 0 24 %buff.int = load i32, i32* %tmp0, align 8 25 ret void 26 } 27 28 attributes #0 = { nounwind } 29
