1; RUN: opt < %s -sroa -S | FileCheck %s
2target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-n8:16:32:64"
3
4define { i32, i32 } @test0(i32 %x, i32 %y) {
5; CHECK-LABEL: @test0(
6; CHECK-NOT: alloca
7; CHECK: insertvalue { i32, i32 }
8; CHECK: insertvalue { i32, i32 }
9; CHECK: ret { i32, i32 }
10
11entry:
12  %a = alloca { i32, i32 }
13
14  store { i32, i32 } undef, { i32, i32 }* %a
15
16  %gep1 = getelementptr inbounds { i32, i32 }, { i32, i32 }* %a, i32 0, i32 0
17  store i32 %x, i32* %gep1
18  %gep2 = getelementptr inbounds { i32, i32 }, { i32, i32 }* %a, i32 0, i32 1
19  store i32 %y, i32* %gep2
20
21  %result = load { i32, i32 }, { i32, i32 }* %a
22  ret { i32, i32 } %result
23}
24
25define { i32, i32 } @test1(i32 %x, i32 %y) {
26; FIXME: This may be too conservative. Duncan argues that we are allowed to
27; split the volatile load and store here but must produce volatile scalar loads
28; and stores from them.
29; CHECK-LABEL: @test1(
30; CHECK: alloca
31; CHECK: alloca
32; CHECK: load volatile { i32, i32 }, { i32, i32 }*
33; CHECK: store volatile { i32, i32 }
34; CHECK: ret { i32, i32 }
35
36entry:
37  %a = alloca { i32, i32 }
38  %b = alloca { i32, i32 }
39
40  %gep1 = getelementptr inbounds { i32, i32 }, { i32, i32 }* %a, i32 0, i32 0
41  store i32 %x, i32* %gep1
42  %gep2 = getelementptr inbounds { i32, i32 }, { i32, i32 }* %a, i32 0, i32 1
43  store i32 %y, i32* %gep2
44
45  %result = load volatile { i32, i32 }, { i32, i32 }* %a
46  store volatile { i32, i32 } %result, { i32, i32 }* %b
47  ret { i32, i32 } %result
48}
49