Searched refs:TheOp (Results 1 – 6 of 6) sorted by relevance
38 // Complex dag operator (F.TheOp).45 operator TheOp = a;51 dag Dag3 = (F.TheOp 2);
1399 Value *TheOp = Ops[i].Op; in OptimizeAdd() local1403 if (i+1 != Ops.size() && Ops[i+1].Op == TheOp) { in OptimizeAdd()1409 } while (i != Ops.size() && Ops[i].Op == TheOp); in OptimizeAdd()1411 DEBUG(dbgs() << "\nFACTORING [" << NumFound << "]: " << *TheOp << '\n'); in OptimizeAdd()1415 Type *Ty = TheOp->getType(); in OptimizeAdd()1418 Instruction *Mul = CreateMul(TheOp, C, "factor", I, I); in OptimizeAdd()1440 if (!BinaryOperator::isNeg(TheOp) && !BinaryOperator::isFNeg(TheOp) && in OptimizeAdd()1441 !BinaryOperator::isNot(TheOp)) in OptimizeAdd()1445 if (BinaryOperator::isNeg(TheOp) || BinaryOperator::isFNeg(TheOp)) in OptimizeAdd()1446 X = BinaryOperator::getNegArgument(TheOp); in OptimizeAdd()[all …]
719 Value *TheOp = Ops[i].Op; in OptimizeAdd() local723 if (i+1 != Ops.size() && Ops[i+1].Op == TheOp) { in OptimizeAdd()729 } while (i != Ops.size() && Ops[i].Op == TheOp); in OptimizeAdd()731 DEBUG(errs() << "\nFACTORING [" << NumFound << "]: " << *TheOp << '\n'); in OptimizeAdd()736 Mul = BinaryOperator::CreateMul(TheOp, Mul, "factor", I); in OptimizeAdd()758 if (!BinaryOperator::isNeg(TheOp)) in OptimizeAdd()761 Value *X = BinaryOperator::getNegArgument(TheOp); in OptimizeAdd()
63 AsmWriterOperand TheOp = OpsToPrint.back().second; in PrintCases() local69 if (OpsToPrint[i-1].second == TheOp) { in PrintCases()75 O << "\n " << TheOp.getCode(PassSubtarget); in PrintCases()
30 AsmWriterOperand TheOp = OpsToPrint.back().second; in PrintCases() local36 if (OpsToPrint[i-1].second == TheOp) { in PrintCases()42 O << TheOp.getCode(); in PrintCases()