llvm-6502/test/Bitcode/aggregateInstructions.3.2.ll
Duncan P. N. Exon Smith 13f5c5896d verify-uselistorder: Force -preserve-bc-use-list-order
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@216022 91177308-0d34-0410-b5e6-96231b3b80d8
2014-08-19 21:08:27 +00:00

35 lines
1.1 KiB
LLVM

; RUN: llvm-dis < %s.bc| FileCheck %s
; RUN: verify-uselistorder < %s.bc
; aggregateOperations.3.2.ll.bc was generated by passing this file to llvm-as-3.2.
; The test checks that LLVM does not misread instructions with aggregate operands
; in older bitcode files.
define void @extractvalue([4 x i8] %x1, [4 x [4 x i8]] %x2, {{i32, float}} %x3){
entry:
; CHECK: %res1 = extractvalue [4 x i8] %x1, 0
%res1 = extractvalue [4 x i8] %x1, 0
; CHECK-NEXT: %res2 = extractvalue [4 x [4 x i8]] %x2, 1
%res2 = extractvalue [4 x [4 x i8 ]] %x2, 1
; CHECK-NEXT: %res3 = extractvalue [4 x [4 x i8]] %x2, 0, 1
%res3 = extractvalue [4 x [4 x i8 ]] %x2, 0, 1
; CHECK-NEXT: %res4 = extractvalue { { i32, float } } %x3, 0, 1
%res4 = extractvalue {{i32, float}} %x3, 0, 1
ret void
}
define void @insertvalue([4 x [4 x i8 ]] %x1){
entry:
; CHECK: %res1 = insertvalue [4 x [4 x i8]] %x1, i8 0, 0, 0
%res1 = insertvalue [4 x [4 x i8 ]] %x1, i8 0, 0, 0
; CHECK-NEXT: %res2 = insertvalue [4 x [4 x i8]] undef, i8 0, 0, 0
%res2 = insertvalue [4 x [4 x i8 ]] undef, i8 0, 0, 0
ret void
}