Go to the source code of this file.
|
| | llvm |
| | Compute iterated dominance frontiers using a linear time algorithm.
|
| |
|
| unsigned | llvm::getICmpCode (const ICmpInst *ICI, bool InvertPred=false) |
| | Encode a icmp predicate into a three bit mask. More...
|
| |
| Value * | llvm::getICmpValue (bool Sign, unsigned Code, Value *LHS, Value *RHS, CmpInst::Predicate &NewICmpPred) |
| | This is the complement of getICmpCode, which turns an opcode and two operands into either a constant true or false, or the predicate for a new ICmp instruction. More...
|
| |
| bool | llvm::PredicatesFoldable (CmpInst::Predicate p1, CmpInst::Predicate p2) |
| | Return true if both predicates match sign or if at least one of them is an equality comparison (which is signless). More...
|
| |
| bool | llvm::decomposeBitTestICmp (const ICmpInst *I, CmpInst::Predicate &Pred, Value *&X, Value *&Y, Value *&Z) |
| | Decompose an icmp into the form ((X & Y) pred Z) if possible. More...
|
| |