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