Go to the source code of this file.
|
| namespace | mlir |
| | Include the generated interface declarations.
|
| namespace | mlir::arith |
|
| static LogicalResult | isCmpIConvertable (DataFlowSolver &solver, CmpIOp op) |
| | Succeeds when the comparison predicate is a signed operation and all the operands are non-negative, indicating that the cmpi operation op can have its predicate changed to an unsigned equivalent.
|
| static CmpIPredicate | toUnsignedPred (CmpIPredicate pred) |
| | Return the unsigned equivalent of a signed comparison predicate, or the predicate itself if there is none.
|
◆ GEN_PASS_DEF_ARITHUNSIGNEDWHENEQUIVALENTPASS
| #define GEN_PASS_DEF_ARITHUNSIGNEDWHENEQUIVALENTPASS |
◆ isCmpIConvertable()
| LogicalResult isCmpIConvertable |
( |
DataFlowSolver & | solver, |
|
|
CmpIOp | op ) |
|
static |
Succeeds when the comparison predicate is a signed operation and all the operands are non-negative, indicating that the cmpi operation op can have its predicate changed to an unsigned equivalent.
Definition at line 33 of file UnsignedWhenEquivalent.cpp.
References success().
◆ toUnsignedPred()
| CmpIPredicate toUnsignedPred |
( |
CmpIPredicate | pred | ) |
|
|
static |
Return the unsigned equivalent of a signed comparison predicate, or the predicate itself if there is none.
Definition at line 50 of file UnsignedWhenEquivalent.cpp.