HomeSort by: relevance | last modified time | path
    Searched refs:Cond0 (Results 1 - 4 of 4) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
GuardWidening.cpp 181 /// to generate an expression computing the logical AND of \p Cond0 and (\p
187 bool widenCondCommon(Value *Cond0, Value *Cond1, Instruction *InsertPt,
247 /// Can we compute the logical AND of \p Cond0 and \p Cond1 for the price of
249 bool isWideningCondProfitable(Value *Cond0, Value *Cond1, bool InvertCond) {
251 return widenCondCommon(Cond0, Cond1, /*InsertPt=*/nullptr, ResultUnused,
497 bool GuardWideningImpl::widenCondCommon(Value *Cond0, Value *Cond1,
507 if (match(Cond0, m_ICmp(Pred0, m_Value(LHS), m_ConstantInt(RHS0))) &&
534 ConstantInt *NewRHS = ConstantInt::get(Cond0->getContext(), NewRHSAP);
546 parseRangeChecks(Cond0, Checks) && parseRangeChecks(Cond1, Checks) &&
568 makeAvailableAt(Cond0, InsertPt)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
LibCallsShrinkWrap.cpp 477 Value *Cond0 = BBBuilder.CreateFCmp(CmpInst::FCMP_OLE, Base, V0);
478 return BBBuilder.CreateOr(Cond0, Cond);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Coroutines/
CoroSplit.cpp 1187 if (ConstantInt *Cond0 = dyn_cast<ConstantInt>(V)) {
1188 BasicBlock *BB = Cond0->equalsInt(CondConst->getZExtValue())
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
DAGCombiner.cpp 9433 // select (and Cond0, Cond1), X, Y
9434 // -> select Cond0, (select Cond1, X, Y), Y
9436 SDValue Cond0 = N0->getOperand(0);
9441 return DAG.getNode(ISD::SELECT, DL, N1.getValueType(), Cond0,
9447 // select (or Cond0, Cond1), X, Y -> select Cond0, X, (select Cond1, X, Y)
9449 SDValue Cond0 = N0->getOperand(0);
9454 return DAG.getNode(ISD::SELECT, DL, N1.getValueType(), Cond0, N1,
9461 // select Cond0, (select Cond1, X, Y), Y -> select (and Cond0, Cond1), X,
    [all...]

Completed in 41 milliseconds