2018-07-20 00:42:15 +08:00
|
|
|
//===-- X86SchedPredicates.td - X86 Scheduling Predicates --*- tablegen -*-===//
|
|
|
|
//
|
2019-01-19 16:50:56 +08:00
|
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
2018-07-20 00:42:15 +08:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file defines scheduling predicate definitions that are common to
|
|
|
|
// all X86 subtargets.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
// A predicate used to identify dependency-breaking instructions that clear the
|
|
|
|
// content of the destination register. Note that this predicate only checks if
|
|
|
|
// input registers are the same. This predicate doesn't make any assumptions on
|
|
|
|
// the expected instruction opcodes, because different processors may implement
|
|
|
|
// different zero-idioms.
|
|
|
|
def ZeroIdiomPredicate : CheckSameRegOperand<1, 2>;
|
|
|
|
|
2018-10-01 18:35:13 +08:00
|
|
|
// A predicate used to identify VPERM that have bits 3 and 7 of their mask set.
|
|
|
|
// On some processors, these VPERM instructions are zero-idioms.
|
|
|
|
def ZeroIdiomVPERMPredicate : CheckAll<[
|
|
|
|
ZeroIdiomPredicate,
|
|
|
|
CheckImmOperand<3, 0x88>
|
|
|
|
]>;
|
|
|
|
|
2018-08-09 23:32:48 +08:00
|
|
|
// A predicate used to check if a LEA instruction uses all three source
|
|
|
|
// operands: base, index, and offset.
|
2018-07-20 00:42:15 +08:00
|
|
|
def IsThreeOperandsLEAPredicate: CheckAll<[
|
|
|
|
// isRegOperand(Base)
|
|
|
|
CheckIsRegOperand<1>,
|
|
|
|
CheckNot<CheckInvalidRegOperand<1>>,
|
|
|
|
|
|
|
|
// isRegOperand(Index)
|
|
|
|
CheckIsRegOperand<3>,
|
|
|
|
CheckNot<CheckInvalidRegOperand<3>>,
|
|
|
|
|
|
|
|
// hasLEAOffset(Offset)
|
|
|
|
CheckAny<[
|
|
|
|
CheckAll<[
|
|
|
|
CheckIsImmOperand<4>,
|
|
|
|
CheckNot<CheckZeroOperand<4>>
|
|
|
|
]>,
|
|
|
|
CheckNonPortable<"MI.getOperand(4).isGlobal()">
|
|
|
|
]>
|
|
|
|
]>;
|
|
|
|
|
2018-08-09 23:32:48 +08:00
|
|
|
def LEACases : MCOpcodeSwitchCase<
|
|
|
|
[LEA32r, LEA64r, LEA64_32r, LEA16r],
|
|
|
|
MCReturnStatement<IsThreeOperandsLEAPredicate>
|
|
|
|
>;
|
|
|
|
|
|
|
|
// Used to generate the body of a TII member function.
|
|
|
|
def IsThreeOperandsLEABody :
|
|
|
|
MCOpcodeSwitchStatement<[LEACases], MCReturnStatement<FalsePred>>;
|
|
|
|
|
2018-07-20 00:42:15 +08:00
|
|
|
// This predicate evaluates to true only if the input machine instruction is a
|
|
|
|
// 3-operands LEA. Tablegen automatically generates a new method for it in
|
|
|
|
// X86GenInstrInfo.
|
|
|
|
def IsThreeOperandsLEAFn :
|
2018-08-15 02:36:54 +08:00
|
|
|
TIIPredicate<"isThreeOperandsLEA", IsThreeOperandsLEABody>;
|
[X86] Merge the different CMOV instructions for each condition code into single instructions that store the condition code as an immediate.
Summary:
Reorder the condition code enum to match their encodings. Move it to MC layer so it can be used by the scheduler models.
This avoids needing an isel pattern for each condition code. And it removes
translation switches for converting between CMOV instructions and condition
codes.
Now the printer, encoder and disassembler take care of converting the immediate.
We use InstAliases to handle the assembly matching. But we print using the
asm string in the instruction definition. The instruction itself is marked
IsCodeGenOnly=1 to hide it from the assembly parser.
This does complicate the scheduler models a little since we can't assign the
A and BE instructions to a separate class now.
I plan to make similar changes for SETcc and Jcc.
Reviewers: RKSimon, spatel, lebedev.ri, andreadb, courbet
Reviewed By: RKSimon
Subscribers: gchatelet, hiraditya, kristina, lebedev.ri, jdoerfert, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D60041
llvm-svn: 357800
2019-04-06 03:27:41 +08:00
|
|
|
|
|
|
|
// A predicate to check for COND_A and COND_BE CMOVs which have an extra uop
|
|
|
|
// on recent Intel CPUs.
|
|
|
|
def IsCMOVArr_Or_CMOVBErr : CheckAny<[
|
|
|
|
CheckImmOperand_s<3, "X86::COND_A">,
|
|
|
|
CheckImmOperand_s<3, "X86::COND_BE">
|
|
|
|
]>;
|
|
|
|
|
|
|
|
def IsCMOVArm_Or_CMOVBErm : CheckAny<[
|
|
|
|
CheckImmOperand_s<7, "X86::COND_A">,
|
|
|
|
CheckImmOperand_s<7, "X86::COND_BE">
|
|
|
|
]>;
|
2019-04-06 03:27:49 +08:00
|
|
|
|
|
|
|
// A predicate to check for COND_A and COND_BE SETCCs which have an extra uop
|
|
|
|
// on recent Intel CPUs.
|
|
|
|
def IsSETAr_Or_SETBEr : CheckAny<[
|
|
|
|
CheckImmOperand_s<1, "X86::COND_A">,
|
|
|
|
CheckImmOperand_s<1, "X86::COND_BE">
|
|
|
|
]>;
|
|
|
|
|
|
|
|
def IsSETAm_Or_SETBEm : CheckAny<[
|
|
|
|
CheckImmOperand_s<5, "X86::COND_A">,
|
|
|
|
CheckImmOperand_s<5, "X86::COND_BE">
|
|
|
|
]>;
|
[X86][Btver2] Fix latency and throughput of CMPXCHG instructions.
On Jaguar, CMPXCHG has a latency of 11cy, and a maximum throughput of 0.33 IPC.
Throughput is superiorly limited to 0.33 because of the implicit in/out
dependency on register EAX. In the case of repeated non-atomic CMPXCHG with the
same memory location, store-to-load forwarding occurs and values for sequent
loads are quickly forwarded from the store buffer.
Interestingly, the functionality in LLVM that computes the reciprocal throughput
doesn't seem to know about RMW instructions. That functionality only looks at
the "consumed resource cycles" for the throughput computation. It should be
fixed/improved by a future patch. In particular, for RMW instructions, that
logic should also take into account for the write latency of in/out register
operands.
An atomic CMPXCHG has a latency of ~17cy. Throughput is also limited to
~17cy/inst due to cache locking, which prevents other memory uOPs to start
executing before the "lock releasing" store uOP.
CMPXCHG8rr and CMPXCHG8rm are treated specially because they decode to one less
macro opcode. Their latency tend to be the same as the other RR/RM variants. RR
variants are relatively fast 3cy (but still microcoded - 5 macro opcodes).
CMPXCHG8B is 11cy and unfortunately doesn't seem to benefit from store-to-load
forwarding. That means, throughput is clearly limited by the in/out dependency
on GPR registers. The uOP composition is sadly unknown (due to the lack of PMCs
for the Integer pipes). I have reused the same mix of consumed resource from the
other CMPXCHG instructions for CMPXCHG8B too.
LOCK CMPXCHG8B is instead 18cycles.
CMPXCHG16B is 32cycles. Up to 38cycles when the LOCK prefix is specified. Due to
the in/out dependencies, throughput is limited to 1 instruction every 32 (or 38)
cycles dependeing on whether the LOCK prefix is specified or not.
I wouldn't be surprised if the microcode for CMPXCHG16B is similar to 2x
microcode from CMPXCHG8B. So, I have speculatively set the JALU01 consumption to
2x the resource cycles used for CMPXCHG8B.
The two new hasLockPrefix() functions are used by the btver2 scheduling model
check if a MCInst/MachineInst has a LOCK prefix. Calls to hasLockPrefix() have
been encoded in predicates of variant scheduling classes that describe lat/thr
of CMPXCHG.
Differential Revision: https://reviews.llvm.org/D66424
llvm-svn: 369365
2019-08-20 18:23:55 +08:00
|
|
|
|
|
|
|
// A predicate used to check if an instruction has a LOCK prefix.
|
|
|
|
def CheckLockPrefix : CheckFunctionPredicate<
|
|
|
|
"X86_MC::hasLockPrefix",
|
|
|
|
"X86InstrInfo::hasLockPrefix"
|
|
|
|
>;
|
|
|
|
|
|
|
|
def IsRegRegCompareAndSwap_8 : CheckOpcode<[ CMPXCHG8rr ]>;
|
|
|
|
|
|
|
|
def IsRegMemCompareAndSwap_8 : CheckOpcode<[
|
|
|
|
LCMPXCHG8, CMPXCHG8rm
|
|
|
|
]>;
|
|
|
|
|
|
|
|
def IsRegRegCompareAndSwap_16_32_64 : CheckOpcode<[
|
|
|
|
CMPXCHG16rr, CMPXCHG32rr, CMPXCHG64rr
|
|
|
|
]>;
|
|
|
|
|
|
|
|
def IsRegMemCompareAndSwap_16_32_64 : CheckOpcode<[
|
|
|
|
CMPXCHG16rm, CMPXCHG32rm, CMPXCHG64rm,
|
|
|
|
LCMPXCHG16, LCMPXCHG32, LCMPXCHG64,
|
|
|
|
LCMPXCHG8B, LCMPXCHG16B
|
|
|
|
]>;
|
|
|
|
|
|
|
|
def IsCompareAndSwap8B : CheckOpcode<[ CMPXCHG8B, LCMPXCHG8B ]>;
|
|
|
|
def IsCompareAndSwap16B : CheckOpcode<[ CMPXCHG16B, LCMPXCHG16B ]>;
|
|
|
|
|
|
|
|
def IsRegMemCompareAndSwap : CheckOpcode<
|
|
|
|
!listconcat(
|
|
|
|
IsRegMemCompareAndSwap_8.ValidOpcodes,
|
|
|
|
IsRegMemCompareAndSwap_16_32_64.ValidOpcodes
|
|
|
|
)>;
|
|
|
|
|
|
|
|
def IsRegRegCompareAndSwap : CheckOpcode<
|
|
|
|
!listconcat(
|
|
|
|
IsRegRegCompareAndSwap_8.ValidOpcodes,
|
|
|
|
IsRegRegCompareAndSwap_16_32_64.ValidOpcodes
|
|
|
|
)>;
|
|
|
|
|
|
|
|
def IsAtomicCompareAndSwap_8 : CheckAll<[
|
|
|
|
CheckLockPrefix,
|
|
|
|
IsRegMemCompareAndSwap_8
|
|
|
|
]>;
|
|
|
|
|
|
|
|
def IsAtomicCompareAndSwap : CheckAll<[
|
|
|
|
CheckLockPrefix,
|
|
|
|
IsRegMemCompareAndSwap
|
|
|
|
]>;
|
|
|
|
|
|
|
|
def IsAtomicCompareAndSwap8B : CheckAll<[
|
|
|
|
CheckLockPrefix,
|
|
|
|
IsCompareAndSwap8B
|
|
|
|
]>;
|
|
|
|
|
|
|
|
def IsAtomicCompareAndSwap16B : CheckAll<[
|
|
|
|
CheckLockPrefix,
|
|
|
|
IsCompareAndSwap16B
|
|
|
|
]>;
|