mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-23 03:02:36 +01:00
be591983cd
The 2nd loop calculates spill costs but reports free registers as cost 0 anyway, so there is little benefit from having a separate early loop. Surprisingly this is not NFC, as many register are marked regDisabled so the first loop often picks up later registers unnecessarily instead of the first one available in the allocation order... Patch by Matthias Braun llvm-svn: 356499
94 lines
2.8 KiB
LLVM
94 lines
2.8 KiB
LLVM
; RUN: llc -verify-machineinstrs -O0 -mcpu=ppc64 -mtriple=powerpc64-unknown-linux-gnu -fast-isel=false < %s | FileCheck %s
|
|
|
|
; Test case for PR 14779: anonymous aggregates are not handled correctly.
|
|
; Darwin bug report PR 15821 is similar.
|
|
; The bug is triggered by passing a byval structure after an anonymous
|
|
; aggregate.
|
|
|
|
%tarray = type { i64, i8* }
|
|
|
|
define i8* @func1({ i64, i8* } %array, i8* %ptr) {
|
|
entry:
|
|
%array_ptr = extractvalue {i64, i8* } %array, 1
|
|
%cond = icmp eq i8* %array_ptr, %ptr
|
|
br i1 %cond, label %equal, label %unequal
|
|
equal:
|
|
ret i8* %array_ptr
|
|
unequal:
|
|
ret i8* %ptr
|
|
}
|
|
|
|
; CHECK-LABEL: func1:
|
|
; CHECK: cmpld {{([0-9]+,)?}}4, 5
|
|
; CHECK-DAG: std 3, -[[OFFSET1:[0-9]+]]
|
|
; CHECK-DAG: std 5, -[[OFFSET2:[0-9]+]]
|
|
; CHECK: ld 3, -[[OFFSET1]](1)
|
|
; CHECK: ld 3, -[[OFFSET2]](1)
|
|
|
|
define i8* @func2({ i64, i8* } %array1, %tarray* byval %array2) {
|
|
entry:
|
|
%array1_ptr = extractvalue {i64, i8* } %array1, 1
|
|
%tmp = getelementptr inbounds %tarray, %tarray* %array2, i32 0, i32 1
|
|
%array2_ptr = load i8*, i8** %tmp
|
|
%cond = icmp eq i8* %array1_ptr, %array2_ptr
|
|
br i1 %cond, label %equal, label %unequal
|
|
equal:
|
|
ret i8* %array1_ptr
|
|
unequal:
|
|
ret i8* %array2_ptr
|
|
}
|
|
; CHECK-LABEL: func2:
|
|
; CHECK-DAG: cmpld {{([0-9]+,)?}}4, 5
|
|
; CHECK-DAG: std 6, 72(1)
|
|
; CHECK-DAG: std 5, 64(1)
|
|
; CHECK-DAG: std 5, -[[OFFSET1:[0-9]+]]
|
|
; CHECK-DAG: std 3, -[[OFFSET2:[0-9]+]]
|
|
; CHECK: ld 3, -[[OFFSET2]](1)
|
|
; CHECK: ld 3, -[[OFFSET1]](1)
|
|
|
|
define i8* @func3({ i64, i8* }* byval %array1, %tarray* byval %array2) {
|
|
entry:
|
|
%tmp1 = getelementptr inbounds { i64, i8* }, { i64, i8* }* %array1, i32 0, i32 1
|
|
%array1_ptr = load i8*, i8** %tmp1
|
|
%tmp2 = getelementptr inbounds %tarray, %tarray* %array2, i32 0, i32 1
|
|
%array2_ptr = load i8*, i8** %tmp2
|
|
%cond = icmp eq i8* %array1_ptr, %array2_ptr
|
|
br i1 %cond, label %equal, label %unequal
|
|
equal:
|
|
ret i8* %array1_ptr
|
|
unequal:
|
|
ret i8* %array2_ptr
|
|
}
|
|
|
|
; CHECK-LABEL: func3:
|
|
; CHECK-DAG: cmpld {{([0-9]+,)?}}3, 4
|
|
; CHECK-DAG: std 3, -[[OFFSET2:[0-9]+]](1)
|
|
; CHECK-DAG: std 4, -[[OFFSET1:[0-9]+]](1)
|
|
; CHECK: ld 3, -[[OFFSET2]](1)
|
|
; CHECK: ld 3, -[[OFFSET1]](1)
|
|
|
|
define i8* @func4(i64 %p1, i64 %p2, i64 %p3, i64 %p4,
|
|
i64 %p5, i64 %p6, i64 %p7, i64 %p8,
|
|
{ i64, i8* } %array1, %tarray* byval %array2) {
|
|
entry:
|
|
%array1_ptr = extractvalue {i64, i8* } %array1, 1
|
|
%tmp = getelementptr inbounds %tarray, %tarray* %array2, i32 0, i32 1
|
|
%array2_ptr = load i8*, i8** %tmp
|
|
%cond = icmp eq i8* %array1_ptr, %array2_ptr
|
|
br i1 %cond, label %equal, label %unequal
|
|
equal:
|
|
ret i8* %array1_ptr
|
|
unequal:
|
|
ret i8* %array2_ptr
|
|
}
|
|
|
|
; CHECK-LABEL: func4:
|
|
; CHECK-DAG: ld [[REG2:[0-9]+]], 120(1)
|
|
; CHECK-DAG: ld [[REG3:[0-9]+]], 136(1)
|
|
; CHECK-DAG: cmpld {{([0-9]+,)?}}[[REG2]], [[REG3]]
|
|
; CHECK: std [[REG2]], -[[OFFSET1:[0-9]+]](1)
|
|
; CHECK: std [[REG3]], -[[OFFSET2:[0-9]+]](1)
|
|
; CHECK: ld 3, -[[OFFSET1]](1)
|
|
; CHECK: ld 3, -[[OFFSET2]](1)
|
|
|