1; RUN: opt -mtriple=x86-linux -load-store-vectorizer -S -o - %s | FileCheck %s
2; RUN: opt -mtriple=x86-linux -aa-pipeline=basic-aa -passes='function(load-store-vectorizer)' -S -o - %s | FileCheck %s
3
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, i8* }
7
8; Check an i32 and i8* get vectorized, and that the two accesses
9; (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 be
12; 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 i8
17; CHECK: store i8 0
18define void @preserve_order_32(%struct.buffer_t* noalias %buff) #0 {
19entry:
20  %tmp1 = getelementptr inbounds %struct.buffer_t, %struct.buffer_t* %buff, i32 0, i32 1
21  %buff.p = load i8*, i8** %tmp1
22  %buff.val = load i8, i8* %buff.p
23  store i8 0, i8* %buff.p, align 8
24  %tmp0 = getelementptr inbounds %struct.buffer_t, %struct.buffer_t* %buff, i32 0, i32 0
25  %buff.int = load i32, i32* %tmp0, align 8
26  ret void
27}
28
29attributes #0 = { nounwind }
30