; This test shows an alloca of a struct and an array that can be reduced to
; multiple variables easily. However, the alloca is used by a store
; instruction, which was not possible before aggregrates were first class
; values. This checks of scalarrepl splits up the struct and array properly.

; RUN: opt %s -scalarrepl | llvm-dis | not grep alloca

define i32 @foo() {
	%target = alloca { i32, i32 }		; <{ i32, i32 }*> [#uses=1]
        ; Build a first class struct to store
	%res1 = insertvalue { i32, i32 } undef, i32 1, 0		; <{ i32, i32 }> [#uses=1]
	%res2 = insertvalue { i32, i32 } %res1, i32 2, 1		; <{ i32, i32 }> [#uses=1]
        ; And store it
	store { i32, i32 } %res2, { i32, i32 }* %target
        ; Actually use %target, so it doesn't get removed alltogether
        %ptr = getelementptr { i32, i32 }* %target, i32 0, i32 0
        %val = load i32* %ptr
	ret i32 %val
}

define i32 @bar() {
	%target = alloca [ 2 x i32 ]		; <{ i32, i32 }*> [#uses=1]
        ; Build a first class array to store
	%res1 = insertvalue [ 2 x i32 ] undef, i32 1, 0		; <{ i32, i32 }> [#uses=1]
	%res2 = insertvalue [ 2 x i32 ] %res1, i32 2, 1		; <{ i32, i32 }> [#uses=1]
        ; And store it
	store [ 2 x i32 ] %res2, [ 2 x i32 ]* %target
        ; Actually use %target, so it doesn't get removed alltogether
        %ptr = getelementptr [ 2 x i32 ]* %target, i32 0, i32 0
        %val = load i32* %ptr
	ret i32 %val
}