mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-03-10 02:38:50 +00:00
2ba60e5930
on every node as it legalizes them. This makes it easier to use hasOneUse() heuristics, since unneeded nodes can be removed from the DAG earlier. Make LegalizeOps visit the DAG in an operands-last order. It previously used operands-first, because LegalizeTypes has to go operands-first, and LegalizeTypes used to be part of LegalizeOps, but they're now split. The operands-last order is more natural for several legalization tasks. For example, it allows lowering code for nodes with floating-point or vector constants to see those constants directly instead of seeing the lowered form (often constant-pool loads). This makes some things somewhat more complicated today, though it ought to allow things to be simpler in the future. It also fixes some bugs exposed by Legalizing using RAUW aggressively. Remove the part of LegalizeOps that attempted to patch up invalid chain operands on libcalls generated by LegalizeTypes, since it doesn't work with the new LegalizeOps traversal order. Instead, define what LegalizeTypes is doing to be correct, and transfer the responsibility of keeping calls from having overlapping calling sequences into the scheduler. Teach the scheduler to model callseq_begin/end pairs as having a physical register definition/use to prevent calls from having overlapping calling sequences. This is also somewhat complicated, though there are ways it might be simplified in the future. This addresses rdar://9816668, rdar://10043614, rdar://8434668, and others. Please direct high-level questions about this patch to management. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@143177 91177308-0d34-0410-b5e6-96231b3b80d8
126 lines
4.7 KiB
LLVM
126 lines
4.7 KiB
LLVM
; RUN: llc < %s -march=cellspu > %t1.s
|
|
; RUN: grep nand %t1.s | count 90
|
|
; RUN: grep and %t1.s | count 94
|
|
; RUN: grep xsbh %t1.s | count 2
|
|
; RUN: grep xshw %t1.s | count 4
|
|
|
|
; CellSPU legalization is over-sensitive to Legalize's traversal order.
|
|
; XFAIL: *
|
|
|
|
target datalayout = "E-p:32:32:128-f64:64:128-f32:32:128-i64:32:128-i32:32:128-i16:16:128-i8:8:128-i1:8:128-a0:0:128-v128:128:128-s0:128:128"
|
|
target triple = "spu"
|
|
|
|
define <4 x i32> @nand_v4i32_1(<4 x i32> %arg1, <4 x i32> %arg2) {
|
|
%A = and <4 x i32> %arg2, %arg1 ; <<4 x i32>> [#uses=1]
|
|
%B = xor <4 x i32> %A, < i32 -1, i32 -1, i32 -1, i32 -1 >
|
|
ret <4 x i32> %B
|
|
}
|
|
|
|
define <4 x i32> @nand_v4i32_2(<4 x i32> %arg1, <4 x i32> %arg2) {
|
|
%A = and <4 x i32> %arg1, %arg2 ; <<4 x i32>> [#uses=1]
|
|
%B = xor <4 x i32> %A, < i32 -1, i32 -1, i32 -1, i32 -1 >
|
|
ret <4 x i32> %B
|
|
}
|
|
|
|
define <8 x i16> @nand_v8i16_1(<8 x i16> %arg1, <8 x i16> %arg2) {
|
|
%A = and <8 x i16> %arg2, %arg1 ; <<8 x i16>> [#uses=1]
|
|
%B = xor <8 x i16> %A, < i16 -1, i16 -1, i16 -1, i16 -1,
|
|
i16 -1, i16 -1, i16 -1, i16 -1 >
|
|
ret <8 x i16> %B
|
|
}
|
|
|
|
define <8 x i16> @nand_v8i16_2(<8 x i16> %arg1, <8 x i16> %arg2) {
|
|
%A = and <8 x i16> %arg1, %arg2 ; <<8 x i16>> [#uses=1]
|
|
%B = xor <8 x i16> %A, < i16 -1, i16 -1, i16 -1, i16 -1,
|
|
i16 -1, i16 -1, i16 -1, i16 -1 >
|
|
ret <8 x i16> %B
|
|
}
|
|
|
|
define <16 x i8> @nand_v16i8_1(<16 x i8> %arg1, <16 x i8> %arg2) {
|
|
%A = and <16 x i8> %arg2, %arg1 ; <<16 x i8>> [#uses=1]
|
|
%B = xor <16 x i8> %A, < i8 -1, i8 -1, i8 -1, i8 -1, i8 -1, i8 -1,
|
|
i8 -1, i8 -1, i8 -1, i8 -1, i8 -1, i8 -1,
|
|
i8 -1, i8 -1, i8 -1, i8 -1 >
|
|
ret <16 x i8> %B
|
|
}
|
|
|
|
define <16 x i8> @nand_v16i8_2(<16 x i8> %arg1, <16 x i8> %arg2) {
|
|
%A = and <16 x i8> %arg1, %arg2 ; <<16 x i8>> [#uses=1]
|
|
%B = xor <16 x i8> %A, < i8 -1, i8 -1, i8 -1, i8 -1, i8 -1, i8 -1,
|
|
i8 -1, i8 -1, i8 -1, i8 -1, i8 -1, i8 -1,
|
|
i8 -1, i8 -1, i8 -1, i8 -1 >
|
|
ret <16 x i8> %B
|
|
}
|
|
|
|
define i32 @nand_i32_1(i32 %arg1, i32 %arg2) {
|
|
%A = and i32 %arg2, %arg1 ; <i32> [#uses=1]
|
|
%B = xor i32 %A, -1 ; <i32> [#uses=1]
|
|
ret i32 %B
|
|
}
|
|
|
|
define i32 @nand_i32_2(i32 %arg1, i32 %arg2) {
|
|
%A = and i32 %arg1, %arg2 ; <i32> [#uses=1]
|
|
%B = xor i32 %A, -1 ; <i32> [#uses=1]
|
|
ret i32 %B
|
|
}
|
|
|
|
define signext i16 @nand_i16_1(i16 signext %arg1, i16 signext %arg2) {
|
|
%A = and i16 %arg2, %arg1 ; <i16> [#uses=1]
|
|
%B = xor i16 %A, -1 ; <i16> [#uses=1]
|
|
ret i16 %B
|
|
}
|
|
|
|
define signext i16 @nand_i16_2(i16 signext %arg1, i16 signext %arg2) {
|
|
%A = and i16 %arg1, %arg2 ; <i16> [#uses=1]
|
|
%B = xor i16 %A, -1 ; <i16> [#uses=1]
|
|
ret i16 %B
|
|
}
|
|
|
|
define zeroext i16 @nand_i16u_1(i16 zeroext %arg1, i16 zeroext %arg2) {
|
|
%A = and i16 %arg2, %arg1 ; <i16> [#uses=1]
|
|
%B = xor i16 %A, -1 ; <i16> [#uses=1]
|
|
ret i16 %B
|
|
}
|
|
|
|
define zeroext i16 @nand_i16u_2(i16 zeroext %arg1, i16 zeroext %arg2) {
|
|
%A = and i16 %arg1, %arg2 ; <i16> [#uses=1]
|
|
%B = xor i16 %A, -1 ; <i16> [#uses=1]
|
|
ret i16 %B
|
|
}
|
|
|
|
define zeroext i8 @nand_i8u_1(i8 zeroext %arg1, i8 zeroext %arg2) {
|
|
%A = and i8 %arg2, %arg1 ; <i8> [#uses=1]
|
|
%B = xor i8 %A, -1 ; <i8> [#uses=1]
|
|
ret i8 %B
|
|
}
|
|
|
|
define zeroext i8 @nand_i8u_2(i8 zeroext %arg1, i8 zeroext %arg2) {
|
|
%A = and i8 %arg1, %arg2 ; <i8> [#uses=1]
|
|
%B = xor i8 %A, -1 ; <i8> [#uses=1]
|
|
ret i8 %B
|
|
}
|
|
|
|
define signext i8 @nand_i8_1(i8 signext %arg1, i8 signext %arg2) {
|
|
%A = and i8 %arg2, %arg1 ; <i8> [#uses=1]
|
|
%B = xor i8 %A, -1 ; <i8> [#uses=1]
|
|
ret i8 %B
|
|
}
|
|
|
|
define signext i8 @nand_i8_2(i8 signext %arg1, i8 signext %arg2) {
|
|
%A = and i8 %arg1, %arg2 ; <i8> [#uses=1]
|
|
%B = xor i8 %A, -1 ; <i8> [#uses=1]
|
|
ret i8 %B
|
|
}
|
|
|
|
define i8 @nand_i8_3(i8 %arg1, i8 %arg2) {
|
|
%A = and i8 %arg2, %arg1 ; <i8> [#uses=1]
|
|
%B = xor i8 %A, -1 ; <i8> [#uses=1]
|
|
ret i8 %B
|
|
}
|
|
|
|
define i8 @nand_i8_4(i8 %arg1, i8 %arg2) {
|
|
%A = and i8 %arg1, %arg2 ; <i8> [#uses=1]
|
|
%B = xor i8 %A, -1 ; <i8> [#uses=1]
|
|
ret i8 %B
|
|
}
|