mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-11-02 07:11:49 +00:00
36e1825e68
This change enables tracking i1 values in the PowerPC backend using the condition register bits. These bits can be treated on PowerPC as separate registers; individual bit operations (and, or, xor, etc.) are supported. Tracking booleans in CR bits has several advantages: - Reduction in register pressure (because we no longer need GPRs to store boolean values). - Logical operations on booleans can be handled more efficiently; we used to have to move all results from comparisons into GPRs, perform promoted logical operations in GPRs, and then move the result back into condition register bits to be used by conditional branches. This can be very inefficient, because the throughput of these CR <-> GPR moves have high latency and low throughput (especially when other associated instructions are accounted for). - On the POWER7 and similar cores, we can increase total throughput by using the CR bits. CR bit operations have a dedicated functional unit. Most of this is more-or-less mechanical: Adjustments were needed in the calling-convention code, support was added for spilling/restoring individual condition-register bits, and conditional branch instruction definitions taking specific CR bits were added (plus patterns and code for generating bit-level operations). This is enabled by default when running at -O2 and higher. For -O0 and -O1, where the ability to debug is more important, this feature is disabled by default. Individual CR bits do not have assigned DWARF register numbers, and storing values in CR bits makes them invisible to the debugger. It is critical, however, that we don't move i1 values that have been promoted to larger values (such as those passed as function arguments) into bit registers only to quickly turn around and move the values back into GPRs (such as happens when values are returned by functions). A pair of target-specific DAG combines are added to remove the trunc/extends in: trunc(binary-ops(binary-ops(zext(x), zext(y)), ...) and: zext(binary-ops(binary-ops(trunc(x), trunc(y)), ...) In short, we only want to use CR bits where some of the i1 values come from comparisons or are used by conditional branches or selects. To put it another way, if we can do the entire i1 computation in GPRs, then we probably should (on the POWER7, the GPR-operation throughput is higher, and for all cores, the CR <-> GPR moves are expensive). POWER7 test-suite performance results (from 10 runs in each configuration): SingleSource/Benchmarks/Misc/mandel-2: 35% speedup MultiSource/Benchmarks/Prolangs-C++/city/city: 21% speedup MultiSource/Benchmarks/MiBench/automotive-susan: 23% speedup SingleSource/Benchmarks/CoyoteBench/huffbench: 13% speedup SingleSource/Benchmarks/Misc-C++/Large/sphereflake: 13% speedup SingleSource/Benchmarks/Misc-C++/mandel-text: 10% speedup SingleSource/Benchmarks/Misc-C++-EH/spirit: 10% slowdown MultiSource/Applications/lemon/lemon: 8% slowdown git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@202451 91177308-0d34-0410-b5e6-96231b3b80d8
66 lines
2.5 KiB
LLVM
66 lines
2.5 KiB
LLVM
; RUN: llc < %s -mcpu=ppc64 -mattr=-crbits | 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-f128:128:128-v128:128:128-n32:64"
|
|
target triple = "powerpc64-unknown-linux-gnu"
|
|
|
|
; Function Attrs: nounwind
|
|
define zeroext i1 @test1() unnamed_addr #0 align 2 {
|
|
|
|
; CHECK-LABEL: @test1
|
|
|
|
entry:
|
|
br i1 undef, label %lor.end, label %lor.rhs
|
|
|
|
lor.rhs: ; preds = %entry
|
|
unreachable
|
|
|
|
lor.end: ; preds = %entry
|
|
br i1 undef, label %land.rhs, label %if.then
|
|
|
|
if.then: ; preds = %lor.end
|
|
br i1 undef, label %return, label %if.end.i24
|
|
|
|
if.end.i24: ; preds = %if.then
|
|
%0 = load i32* undef, align 4
|
|
%lnot.i.i16.i23 = icmp eq i32 %0, 0
|
|
br i1 %lnot.i.i16.i23, label %if.end7.i37, label %test.exit27.i34
|
|
|
|
test.exit27.i34: ; preds = %if.end.i24
|
|
br i1 undef, label %return, label %if.end7.i37
|
|
|
|
if.end7.i37: ; preds = %test.exit27.i34, %if.end.i24
|
|
%tobool.i.i36 = icmp eq i8 undef, 0
|
|
br i1 %tobool.i.i36, label %return, label %if.then9.i39
|
|
|
|
if.then9.i39: ; preds = %if.end7.i37
|
|
br i1 %lnot.i.i16.i23, label %return, label %lor.rhs.i.i49
|
|
|
|
; CHECK: .LBB0_7:
|
|
; CHECK: beq 1, .LBB0_10
|
|
; CHECK: beq 0, .LBB0_10
|
|
; CHECK: .LBB0_9:
|
|
|
|
lor.rhs.i.i49: ; preds = %if.then9.i39
|
|
%cmp.i.i.i.i48 = icmp ne i64 undef, 0
|
|
br label %return
|
|
|
|
land.rhs: ; preds = %lor.end
|
|
br i1 undef, label %return, label %if.end.i
|
|
|
|
if.end.i: ; preds = %land.rhs
|
|
br i1 undef, label %return, label %if.then9.i
|
|
|
|
if.then9.i: ; preds = %if.end.i
|
|
br i1 undef, label %return, label %lor.rhs.i.i
|
|
|
|
lor.rhs.i.i: ; preds = %if.then9.i
|
|
%cmp.i.i.i.i = icmp ne i64 undef, 0
|
|
br label %return
|
|
|
|
return: ; preds = %lor.rhs.i.i, %if.then9.i, %if.end.i, %land.rhs, %lor.rhs.i.i49, %if.then9.i39, %if.end7.i37, %test.exit27.i34, %if.then
|
|
%retval.0 = phi i1 [ false, %if.then ], [ false, %test.exit27.i34 ], [ true, %if.end7.i37 ], [ true, %if.then9.i39 ], [ %cmp.i.i.i.i48, %lor.rhs.i.i49 ], [ false, %land.rhs ], [ true, %if.end.i ], [ true, %if.then9.i ], [ %cmp.i.i.i.i, %lor.rhs.i.i ]
|
|
ret i1 %retval.0
|
|
}
|
|
|
|
attributes #0 = { nounwind }
|
|
|