mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-19 19:12:56 +02:00
e3e67d4a0a
This changes the SelectionDAG scheduling preference to source order. Soon, the SelectionDAG scheduler can be bypassed saving a nice chunk of compile time. Performance differences that result from this change are often a consequence of register coalescing. The register coalescer is far from perfect. Bugs can be filed for deficiencies. On x86 SandyBridge/Haswell, the source order schedule is often preserved, particularly for small blocks. Register pressure is generally improved over the SD scheduler's ILP mode. However, we are still able to handle large blocks that require latency hiding, unlike the SD scheduler's BURR mode. MI scheduler also attempts to discover the critical path in single-block loops and adjust heuristics accordingly. The MI scheduler relies on the new machine model. This is currently unimplemented for AVX, so we may not be generating the best code yet. Unit tests are updated so they don't depend on SD scheduling heuristics. llvm-svn: 192750
22 lines
699 B
LLVM
22 lines
699 B
LLVM
; RUN: llc < %s -march=x86 -mcpu=yonah | FileCheck %s
|
|
|
|
%struct.S = type { <2 x i64>, <2 x i64>, <2 x i64>, <2 x i64>,
|
|
<2 x i64>, <2 x i64>, <2 x i64>, <2 x i64>,
|
|
<2 x i64> }
|
|
|
|
define i32 @main() nounwind {
|
|
entry:
|
|
; CHECK-LABEL: main:
|
|
; CHECK: leal 16(%esp), %edi
|
|
; CHECK: leal 160(%esp), %esi
|
|
; CHECK: rep;movsl
|
|
; CHECK: movl $1, (%esp)
|
|
%s = alloca %struct.S ; <%struct.S*> [#uses=2]
|
|
%tmp15 = getelementptr %struct.S* %s, i32 0, i32 0 ; <<2 x i64>*> [#uses=1]
|
|
store <2 x i64> < i64 8589934595, i64 1 >, <2 x i64>* %tmp15, align 16
|
|
call void @t( i32 1, %struct.S* byval %s ) nounwind
|
|
ret i32 0
|
|
}
|
|
|
|
declare void @t(i32, %struct.S* byval )
|