HomeSort by: relevance | last modified time | path
    Searched defs:Fold (Results 1 - 5 of 5) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
TargetFolder.h 35 /// Fold - Fold the constant using target specific information.
36 Constant *Fold(Constant *C) const {
51 return Fold(ConstantExpr::getAdd(LHS, RHS, HasNUW, HasNSW));
54 return Fold(ConstantExpr::getFAdd(LHS, RHS));
58 return Fold(ConstantExpr::getSub(LHS, RHS, HasNUW, HasNSW));
61 return Fold(ConstantExpr::getFSub(LHS, RHS));
65 return Fold(ConstantExpr::getMul(LHS, RHS, HasNUW, HasNSW));
68 return Fold(ConstantExpr::getFMul(LHS, RHS));
72 return Fold(ConstantExpr::getUDiv(LHS, RHS, isExact))
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
LoopUnroll.cpp 880 BasicBlock *Fold = Dest->getUniquePredecessor();
882 // Dest has been folded into Fold. Update our worklists accordingly.
883 std::replace(Latches.begin(), Latches.end(), Dest, Fold);
BasicBlockUtils.cpp 320 BasicBlock *Fold = Dest->getUniquePredecessor();
321 (void)Fold;
323 assert(Fold == BB &&
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
TargetLowering.cpp 2346 // nodes. Ignore opaque integers because they do not constant fold.
2924 // Constant fold all undef cases.
3369 /// Try to fold an equality comparison with a {add/sub/xor} binary operation as
3490 // Constant fold or commute setcc.
3491 if (SDValue Fold = DAG.FoldSetCC(VT, N0, N1, Cond, dl))
3492 return Fold;
3494 // Ensure that the constant occurs on the RHS and fold constant comparisons.
3496 // FIXME: We can't yet fold constant scalable vector splats, so avoid an
4075 // Fold bit comparisons when we can. This will result in an
4215 // Otherwise, we can't fold it. However, we can simplify it to SETUO/SET
    [all...]
DAGCombiner.cpp 388 /// Call the node-specific routine that knows how to fold each
1034 // that's the one we hope to fold into the load or store).
1414 // fold (aext (aext x)) -> (aext x)
1415 // fold (aext (zext x)) -> (zext x)
1416 // fold (aext (sext x)) -> (sext x)
2126 // Bail out if any constants are opaque because we can't constant fold those.
2207 /// Try to fold a 'not' shifted sign-bit with add/sub with constant operand into
2247 /// Try to fold a node that behaves like an ADD (note that N isn't necessarily
2256 // fold vector ops
2261 // fold (add x, 0) -> x, vector editio
    [all...]

Completed in 39 milliseconds