mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-29 23:12:55 +01:00
b401fd4c9e
Also avoid locals evicting locals just because they want a cheaper register. Problem: MI Sched knows exactly how many registers we have and assumes they can be colored. In cases where we have large blocks, usually from unrolled loops, greedy coloring fails. This is a source of "regressions" from the MI Scheduler on x86. I noticed this issue on x86 where we have long chains of two-address defs in the same live range. It's easy to see this in matrix multiplication benchmarks like IRSmk and even the unit test misched-matmul.ll. A fundamental difference between the LLVM register allocator and conventional graph coloring is that in our model a live range can't discover its neighbors, it can only verify its neighbors. That's why we initially went for greedy coloring and added eviction to deal with the hard cases. However, for singly defined and two-address live ranges, we can optimally color without visiting neighbors simply by processing the live ranges in instruction order. Other beneficial side effects: It is much easier to understand and debug regalloc for large blocks when the live ranges are allocated in order. Yes, global allocation is still very confusing, but it's nice to be able to comprehend what happened locally. Heuristics could be added to bias register assignment based on instruction locality (think late register pairing, banks...). Intuituvely this will make some test cases that are on the threshold of register pressure more stable. llvm-svn: 187139
50 lines
1.2 KiB
LLVM
50 lines
1.2 KiB
LLVM
; RUN: llc -mcpu=corei7 < %s | FileCheck %s
|
|
|
|
target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128"
|
|
target triple = "x86_64-apple-darwin8"
|
|
|
|
; This should be a single mov, not a load of immediate + andq.
|
|
; CHECK-LABEL: test:
|
|
; CHECK: movl %edi, %eax
|
|
|
|
define i64 @test(i64 %x) nounwind {
|
|
entry:
|
|
%tmp123 = and i64 %x, 4294967295 ; <i64> [#uses=1]
|
|
ret i64 %tmp123
|
|
}
|
|
|
|
; This copy can't be coalesced away because it needs the implicit zero-extend.
|
|
; CHECK-LABEL: bbb:
|
|
; CHECK: movl %edi, %edi
|
|
|
|
define void @bbb(i64 %x) nounwind {
|
|
%t = and i64 %x, 4294967295
|
|
call void @foo(i64 %t)
|
|
ret void
|
|
}
|
|
|
|
; This should use a 32-bit and with implicit zero-extension, not a 64-bit and
|
|
; with a separate mov to materialize the mask.
|
|
; rdar://7527390
|
|
; CHECK-LABEL: ccc:
|
|
; CHECK: andl $-1048593, %edi
|
|
|
|
declare void @foo(i64 %x) nounwind
|
|
|
|
define void @ccc(i64 %x) nounwind {
|
|
%t = and i64 %x, 4293918703
|
|
call void @foo(i64 %t)
|
|
ret void
|
|
}
|
|
|
|
; This requires a mov and a 64-bit and.
|
|
; CHECK-LABEL: ddd:
|
|
; CHECK: movabsq $4294967296, %r
|
|
; CHECK: andq %r{{..}}, %r{{..}}
|
|
|
|
define void @ddd(i64 %x) nounwind {
|
|
%t = and i64 %x, 4294967296
|
|
call void @foo(i64 %t)
|
|
ret void
|
|
}
|