Lines Matching refs:Ops
75 static void PrintOps(Instruction *I, const SmallVectorImpl<ValueEntry> &Ops) { in PrintOps() argument
78 << *Ops[0].Op->getType() << '\t'; in PrintOps()
79 for (unsigned i = 0, e = Ops.size(); i != e; ++i) { in PrintOps()
81 Ops[i].Op->printAsOperand(dbgs(), false, M); in PrintOps()
82 dbgs() << ", #" << Ops[i].Rank << "] "; in PrintOps()
461 SmallVectorImpl<RepeatedValue> &Ops, in LinearizeExprTree() argument
636 Ops.push_back(std::make_pair(V, Weight)); in LinearizeExprTree()
642 if (Ops.empty()) { in LinearizeExprTree()
645 Ops.emplace_back(Identity, APInt(Bitwidth, 1)); in LinearizeExprTree()
654 SmallVectorImpl<ValueEntry> &Ops) { in RewriteExprTree() argument
655 assert(Ops.size() > 1 && "Single values should be used directly!"); in RewriteExprTree()
683 for (unsigned i = 0, e = Ops.size(); i != e; ++i) in RewriteExprTree()
684 NotRewritable.insert(Ops[i].Op); in RewriteExprTree()
694 if (i+2 == Ops.size()) { in RewriteExprTree()
695 Value *NewLHS = Ops[i].Op; in RewriteExprTree()
696 Value *NewRHS = Ops[i+1].Op; in RewriteExprTree()
740 Value *NewRHS = Ops[i].Op; in RewriteExprTree()
1119 static unsigned FindInOperandList(const SmallVectorImpl<ValueEntry> &Ops, in FindInOperandList() argument
1121 unsigned XRank = Ops[i].Rank; in FindInOperandList()
1122 unsigned e = Ops.size(); in FindInOperandList()
1123 for (unsigned j = i+1; j != e && Ops[j].Rank == XRank; ++j) { in FindInOperandList()
1124 if (Ops[j].Op == X) in FindInOperandList()
1126 if (Instruction *I1 = dyn_cast<Instruction>(Ops[j].Op)) in FindInOperandList()
1132 for (unsigned j = i-1; j != ~0U && Ops[j].Rank == XRank; --j) { in FindInOperandList()
1133 if (Ops[j].Op == X) in FindInOperandList()
1135 if (Instruction *I1 = dyn_cast<Instruction>(Ops[j].Op)) in FindInOperandList()
1146 SmallVectorImpl<WeakTrackingVH> &Ops) { in EmitAddTreeOfValues() argument
1147 if (Ops.size() == 1) return Ops.back(); in EmitAddTreeOfValues()
1149 Value *V1 = Ops.pop_back_val(); in EmitAddTreeOfValues()
1150 Value *V2 = EmitAddTreeOfValues(I, Ops); in EmitAddTreeOfValues()
1248 SmallVectorImpl<ValueEntry> &Ops) { in OptimizeAndOrXor() argument
1251 for (unsigned i = 0, e = Ops.size(); i != e; ++i) { in OptimizeAndOrXor()
1253 assert(i < Ops.size()); in OptimizeAndOrXor()
1255 if (match(Ops[i].Op, m_Not(m_Value(X)))) { // Cannot occur for ^. in OptimizeAndOrXor()
1256 unsigned FoundX = FindInOperandList(Ops, i, X); in OptimizeAndOrXor()
1268 assert(i < Ops.size()); in OptimizeAndOrXor()
1269 if (i+1 != Ops.size() && Ops[i+1].Op == Ops[i].Op) { in OptimizeAndOrXor()
1272 Ops.erase(Ops.begin()+i); in OptimizeAndOrXor()
1281 return Constant::getNullValue(Ops[0].Op->getType()); in OptimizeAndOrXor()
1284 Ops.erase(Ops.begin()+i, Ops.begin()+i+2); in OptimizeAndOrXor()
1428 SmallVectorImpl<ValueEntry> &Ops) { in OptimizeXor() argument
1429 if (Value *V = OptimizeAndOrXor(Instruction::Xor, Ops)) in OptimizeXor()
1432 if (Ops.size() == 1) in OptimizeXor()
1437 Type *Ty = Ops[0].Op->getType(); in OptimizeXor()
1441 for (unsigned i = 0, e = Ops.size(); i != e; ++i) { in OptimizeXor()
1442 Value *V = Ops[i].Op; in OptimizeXor()
1521 Ops.clear(); in OptimizeXor()
1527 Ops.push_back(VE); in OptimizeXor()
1532 Ops.push_back(VE); in OptimizeXor()
1534 unsigned Sz = Ops.size(); in OptimizeXor()
1536 return Ops.back().Op; in OptimizeXor()
1550 SmallVectorImpl<ValueEntry> &Ops) { in OptimizeAdd() argument
1556 for (unsigned i = 0, e = Ops.size(); i != e; ++i) { in OptimizeAdd()
1557 Value *TheOp = Ops[i].Op; in OptimizeAdd()
1561 if (i+1 != Ops.size() && Ops[i+1].Op == TheOp) { in OptimizeAdd()
1565 Ops.erase(Ops.begin()+i); in OptimizeAdd()
1567 } while (i != Ops.size() && Ops[i].Op == TheOp); in OptimizeAdd()
1585 if (Ops.empty()) in OptimizeAdd()
1591 Ops.insert(Ops.begin(), ValueEntry(getRank(Mul), Mul)); in OptimizeAdd()
1594 e = Ops.size(); in OptimizeAdd()
1604 unsigned FoundX = FindInOperandList(Ops, i, X); in OptimizeAdd()
1609 if (Ops.size() == 2 && in OptimizeAdd()
1614 if (Ops.size() == 2 && match(TheOp, m_Not(m_Value()))) in OptimizeAdd()
1617 Ops.erase(Ops.begin()+i); in OptimizeAdd()
1622 Ops.erase(Ops.begin()+FoundX); in OptimizeAdd()
1630 Ops.insert(Ops.end(), ValueEntry(getRank(V), V)); in OptimizeAdd()
1646 for (unsigned i = 0, e = Ops.size(); i != e; ++i) { in OptimizeAdd()
1648 isReassociableOp(Ops[i].Op, Instruction::Mul, Instruction::FMul); in OptimizeAdd()
1717 for (unsigned i = 0; i != Ops.size(); ++i) { in OptimizeAdd()
1720 isReassociableOp(Ops[i].Op, Instruction::Mul, Instruction::FMul); in OptimizeAdd()
1724 if (Value *V = RemoveFactorFromExpression(Ops[i].Op, MaxOccVal)) { in OptimizeAdd()
1727 for (unsigned j = Ops.size(); j != i;) { in OptimizeAdd()
1729 if (Ops[j].Op == Ops[i].Op) { in OptimizeAdd()
1731 Ops.erase(Ops.begin()+j); in OptimizeAdd()
1761 if (Ops.empty()) in OptimizeAdd()
1767 Ops.insert(Ops.begin(), ValueEntry(getRank(V2), V2)); in OptimizeAdd()
1784 static bool collectMultiplyFactors(SmallVectorImpl<ValueEntry> &Ops, in collectMultiplyFactors() argument
1789 for (unsigned Idx = 1, Size = Ops.size(); Idx < Size; ++Idx) { in collectMultiplyFactors()
1790 Value *Op = Ops[Idx-1].Op; in collectMultiplyFactors()
1794 for (; Idx < Size && Ops[Idx].Op == Op; ++Idx) in collectMultiplyFactors()
1810 for (unsigned Idx = 1; Idx < Ops.size(); ++Idx) { in collectMultiplyFactors()
1811 Value *Op = Ops[Idx-1].Op; in collectMultiplyFactors()
1815 for (; Idx < Ops.size() && Ops[Idx].Op == Op; ++Idx) in collectMultiplyFactors()
1824 Ops.erase(Ops.begin()+Idx, Ops.begin()+Idx+Count); in collectMultiplyFactors()
1839 SmallVectorImpl<Value*> &Ops) { in buildMultiplyTree() argument
1840 if (Ops.size() == 1) in buildMultiplyTree()
1841 return Ops.back(); in buildMultiplyTree()
1843 Value *LHS = Ops.pop_back_val(); in buildMultiplyTree()
1846 LHS = Builder.CreateMul(LHS, Ops.pop_back_val()); in buildMultiplyTree()
1848 LHS = Builder.CreateFMul(LHS, Ops.pop_back_val()); in buildMultiplyTree()
1849 } while (!Ops.empty()); in buildMultiplyTree()
1919 SmallVectorImpl<ValueEntry> &Ops) { in OptimizeMul() argument
1922 if (Ops.size() < 4) in OptimizeMul()
1929 if (!collectMultiplyFactors(Ops, Factors)) in OptimizeMul()
1940 if (Ops.empty()) in OptimizeMul()
1944 Ops.insert(llvm::lower_bound(Ops, NewEntry), NewEntry); in OptimizeMul()
1949 SmallVectorImpl<ValueEntry> &Ops) { in OptimizeExpression() argument
1955 while (!Ops.empty()) { in OptimizeExpression()
1956 if (auto *C = dyn_cast<Constant>(Ops.back().Op)) { in OptimizeExpression()
1958 Ops.pop_back(); in OptimizeExpression()
1963 Ops.pop_back(); in OptimizeExpression()
1971 if (Ops.empty()) in OptimizeExpression()
1980 Ops.push_back(ValueEntry(0, Cst)); in OptimizeExpression()
1983 if (Ops.size() == 1) return Ops[0].Op; in OptimizeExpression()
1987 unsigned NumOps = Ops.size(); in OptimizeExpression()
1992 if (Value *Result = OptimizeAndOrXor(Opcode, Ops)) in OptimizeExpression()
1997 if (Value *Result = OptimizeXor(I, Ops)) in OptimizeExpression()
2003 if (Value *Result = OptimizeAdd(I, Ops)) in OptimizeExpression()
2009 if (Value *Result = OptimizeMul(I, Ops)) in OptimizeExpression()
2014 if (Ops.size() != NumOps) in OptimizeExpression()
2015 return OptimizeExpression(I, Ops); in OptimizeExpression()
2024 SmallVector<Value *, 4> Ops(I->operands()); in RecursivelyEraseDeadInsts() local
2030 for (auto Op : Ops) in RecursivelyEraseDeadInsts()
2041 SmallVector<Value *, 8> Ops(I->operands()); in EraseInst() local
2049 for (unsigned i = 0, e = Ops.size(); i != e; ++i) in EraseInst()
2050 if (Instruction *Op = dyn_cast<Instruction>(Ops[i])) { in EraseInst()
2344 SmallVector<ValueEntry, 8> Ops; in ReassociateExpression() local
2345 Ops.reserve(Tree.size()); in ReassociateExpression()
2347 Ops.append(E.second.getZExtValue(), ValueEntry(getRank(E.first), E.first)); in ReassociateExpression()
2349 LLVM_DEBUG(dbgs() << "RAIn:\t"; PrintOps(I, Ops); dbgs() << '\n'); in ReassociateExpression()
2357 llvm::stable_sort(Ops); in ReassociateExpression()
2361 if (Value *V = OptimizeExpression(I, Ops)) { in ReassociateExpression()
2384 isa<ConstantInt>(Ops.back().Op) && in ReassociateExpression()
2385 cast<ConstantInt>(Ops.back().Op)->isMinusOne()) { in ReassociateExpression()
2386 ValueEntry Tmp = Ops.pop_back_val(); in ReassociateExpression()
2387 Ops.insert(Ops.begin(), Tmp); in ReassociateExpression()
2391 isa<ConstantFP>(Ops.back().Op) && in ReassociateExpression()
2392 cast<ConstantFP>(Ops.back().Op)->isExactlyValue(-1.0)) { in ReassociateExpression()
2393 ValueEntry Tmp = Ops.pop_back_val(); in ReassociateExpression()
2394 Ops.insert(Ops.begin(), Tmp); in ReassociateExpression()
2398 LLVM_DEBUG(dbgs() << "RAOut:\t"; PrintOps(I, Ops); dbgs() << '\n'); in ReassociateExpression()
2400 if (Ops.size() == 1) { in ReassociateExpression()
2401 if (Ops[0].Op == I) in ReassociateExpression()
2407 I->replaceAllUsesWith(Ops[0].Op); in ReassociateExpression()
2408 if (Instruction *OI = dyn_cast<Instruction>(Ops[0].Op)) in ReassociateExpression()
2414 if (Ops.size() > 2 && Ops.size() <= GlobalReassociateLimit) { in ReassociateExpression()
2425 for (unsigned i = 0; i < Ops.size() - 1; ++i) in ReassociateExpression()
2426 for (unsigned j = i + 1; j < Ops.size(); ++j) { in ReassociateExpression()
2428 Value *Op0 = Ops[i].Op; in ReassociateExpression()
2429 Value *Op1 = Ops[j].Op; in ReassociateExpression()
2443 unsigned MaxRank = std::max(Ops[i].Rank, Ops[j].Rank); in ReassociateExpression()
2451 auto Op0 = Ops[BestPair.first]; in ReassociateExpression()
2452 auto Op1 = Ops[BestPair.second]; in ReassociateExpression()
2453 Ops.erase(&Ops[BestPair.second]); in ReassociateExpression()
2454 Ops.erase(&Ops[BestPair.first]); in ReassociateExpression()
2455 Ops.push_back(Op0); in ReassociateExpression()
2456 Ops.push_back(Op1); in ReassociateExpression()
2461 RewriteExprTree(I, Ops); in ReassociateExpression()
2480 SmallVector<Value *, 8> Ops; in BuildPairMap() local
2481 while (!Worklist.empty() && Ops.size() <= GlobalReassociateLimit) { in BuildPairMap()
2485 Ops.push_back(Op); in BuildPairMap()
2495 if (Ops.size() > GlobalReassociateLimit) in BuildPairMap()
2501 for (unsigned i = 0; i < Ops.size() - 1; ++i) { in BuildPairMap()
2502 for (unsigned j = i + 1; j < Ops.size(); ++j) { in BuildPairMap()
2504 Value *Op0 = Ops[i]; in BuildPairMap()
2505 Value *Op1 = Ops[j]; in BuildPairMap()