#include "llvm/Support/InstructionCost.h"
Definition at line 29 of file InstructionCost.h.
◆ CostType
◆ CostState
CostState describes the state of a cost.
| Enumerator |
|---|
| Valid | |
| Invalid | < The cost value represents a valid cost, even when the cost-value is large.
< Invalid indicates there is no way to represent the cost as a numeric value. This state exists to represent a possible issue, e.g. if the cost-model knows the operation cannot be expanded into a valid code-sequence by the code-generator. While some passes may assert that the calculated cost must be valid, it is up to individual passes how to interpret an Invalid cost. For example, a transformation pass could choose not to perform a transformation if the resulting cost would end up Invalid. Because some passes may assert a cost is Valid, it is not recommended to use Invalid costs to model 'Unknown'. Note that Invalid is semantically different from a (very) high, but valid cost, which intentionally indicates no issue, but rather a strong preference not to select a certain operation.
|
Definition at line 34 of file InstructionCost.h.
◆ InstructionCost() [1/3]
| llvm::InstructionCost::InstructionCost |
( |
| ) |
|
|
default |
◆ InstructionCost() [2/3]
| llvm::InstructionCost::InstructionCost |
( |
CostState |
| ) |
|
|
delete |
◆ InstructionCost() [3/3]
| llvm::InstructionCost::InstructionCost |
( |
CostType |
Val | ) |
|
|
inline |
◆ getInvalid()
Definition at line 73 of file InstructionCost.h.
References setInvalid().
Referenced by llvm::ComputeSpeculationCost(), llvm::BasicTTIImplBase< AMDGPUTTIImpl >::getArithmeticInstrCost(), llvm::AArch64TTIImpl::getArithmeticReductionCost(), llvm::AArch64TTIImpl::getArithmeticReductionCostSVE(), llvm::BasicTTIImplBase< AMDGPUTTIImpl >::getCastInstrCost(), llvm::AArch64TTIImpl::getGatherScatterOpCost(), llvm::GCNTTIImpl::getIntrinsicInstrCost(), llvm::BasicTTIImplBase< AMDGPUTTIImpl >::getIntrinsicInstrCost(), llvm::AArch64TTIImpl::getMaskedMemoryOpCost(), llvm::AArch64TTIImpl::getMemoryOpCost(), llvm::BasicTTIImplBase< AMDGPUTTIImpl >::getOrderedReductionCost(), llvm::BasicTTIImplBase< AMDGPUTTIImpl >::getTypeBasedIntrinsicInstrCost(), llvm::TargetLoweringBase::getTypeLegalizationCost(), map(), and llvm::LoopVectorizationCostModel::setCostBasedWideningDecision().
◆ getMax()
◆ getMin()
◆ getState()
| CostState llvm::InstructionCost::getState |
( |
| ) |
const |
|
inline |
◆ getValue()
◆ isValid()
| bool llvm::InstructionCost::isValid |
( |
| ) |
const |
|
inline |
◆ map()
template<class Function >
◆ operator!=() [1/2]
| bool llvm::InstructionCost::operator!= |
( |
const CostType |
RHS | ) |
const |
|
inline |
◆ operator!=() [2/2]
◆ operator*=() [1/2]
◆ operator*=() [2/2]
◆ operator++() [1/2]
◆ operator++() [2/2]
◆ operator+=() [1/2]
◆ operator+=() [2/2]
For all of the arithmetic operators provided here any invalid state is perpetuated and cannot be removed.
Once a cost becomes invalid it stays invalid, and it also inherits any invalid state from the RHS. Arithmetic work on the actual values is implemented with saturation, to avoid overflow when using more extreme cost values.
Definition at line 99 of file InstructionCost.h.
References llvm::AddOverflow().
◆ operator--() [1/2]
◆ operator--() [2/2]
◆ operator-=() [1/2]
◆ operator-=() [2/2]
◆ operator/=() [1/2]
◆ operator/=() [2/2]
◆ operator<() [1/2]
| bool llvm::InstructionCost::operator< |
( |
const CostType |
RHS | ) |
const |
|
inline |
◆ operator<() [2/2]
For the comparison operators we have chosen to use lexicographical ordering where valid costs are always considered to be less than invalid costs.
This avoids having to add asserts to the comparison operators that the states are valid and users can test for validity of the cost explicitly.
Definition at line 195 of file InstructionCost.h.
◆ operator<=() [1/2]
| bool llvm::InstructionCost::operator<= |
( |
const CostType |
RHS | ) |
const |
|
inline |
◆ operator<=() [2/2]
◆ operator==() [1/2]
| bool llvm::InstructionCost::operator== |
( |
const CostType |
RHS | ) |
const |
|
inline |
◆ operator==() [2/2]
◆ operator>() [1/2]
| bool llvm::InstructionCost::operator> |
( |
const CostType |
RHS | ) |
const |
|
inline |
◆ operator>() [2/2]
◆ operator>=() [1/2]
| bool llvm::InstructionCost::operator>= |
( |
const CostType |
RHS | ) |
const |
|
inline |
◆ operator>=() [2/2]
◆ print()
◆ setInvalid()
| void llvm::InstructionCost::setInvalid |
( |
| ) |
|
|
inline |
◆ setValid()
| void llvm::InstructionCost::setValid |
( |
| ) |
|
|
inline |
The documentation for this class was generated from the following files:
