Lines Matching refs:Ops
77 static void PrintOps(Instruction *I, const SmallVectorImpl<ValueEntry> &Ops) { in PrintOps() argument
80 << *Ops[0].Op->getType() << '\t'; in PrintOps()
81 for (unsigned i = 0, e = Ops.size(); i != e; ++i) { in PrintOps()
83 Ops[i].Op->printAsOperand(dbgs(), false, M); in PrintOps()
84 dbgs() << ", #" << Ops[i].Rank << "] "; in PrintOps()
454 SmallVectorImpl<RepeatedValue> &Ops) { in LinearizeExprTree() argument
619 Ops.push_back(std::make_pair(V, Weight)); in LinearizeExprTree()
625 if (Ops.empty()) { in LinearizeExprTree()
628 Ops.emplace_back(Identity, APInt(Bitwidth, 1)); in LinearizeExprTree()
637 SmallVectorImpl<ValueEntry> &Ops) { in RewriteExprTree() argument
638 assert(Ops.size() > 1 && "Single values should be used directly!"); in RewriteExprTree()
666 for (unsigned i = 0, e = Ops.size(); i != e; ++i) in RewriteExprTree()
667 NotRewritable.insert(Ops[i].Op); in RewriteExprTree()
677 if (i+2 == Ops.size()) { in RewriteExprTree()
678 Value *NewLHS = Ops[i].Op; in RewriteExprTree()
679 Value *NewRHS = Ops[i+1].Op; in RewriteExprTree()
723 Value *NewRHS = Ops[i].Op; in RewriteExprTree()
1102 static unsigned FindInOperandList(const SmallVectorImpl<ValueEntry> &Ops, in FindInOperandList() argument
1104 unsigned XRank = Ops[i].Rank; in FindInOperandList()
1105 unsigned e = Ops.size(); in FindInOperandList()
1106 for (unsigned j = i+1; j != e && Ops[j].Rank == XRank; ++j) { in FindInOperandList()
1107 if (Ops[j].Op == X) in FindInOperandList()
1109 if (Instruction *I1 = dyn_cast<Instruction>(Ops[j].Op)) in FindInOperandList()
1115 for (unsigned j = i-1; j != ~0U && Ops[j].Rank == XRank; --j) { in FindInOperandList()
1116 if (Ops[j].Op == X) in FindInOperandList()
1118 if (Instruction *I1 = dyn_cast<Instruction>(Ops[j].Op)) in FindInOperandList()
1129 SmallVectorImpl<WeakTrackingVH> &Ops) { in EmitAddTreeOfValues() argument
1130 if (Ops.size() == 1) return Ops.back(); in EmitAddTreeOfValues()
1132 Value *V1 = Ops.pop_back_val(); in EmitAddTreeOfValues()
1133 Value *V2 = EmitAddTreeOfValues(I, Ops); in EmitAddTreeOfValues()
1231 SmallVectorImpl<ValueEntry> &Ops) { in OptimizeAndOrXor() argument
1234 for (unsigned i = 0, e = Ops.size(); i != e; ++i) { in OptimizeAndOrXor()
1236 assert(i < Ops.size()); in OptimizeAndOrXor()
1238 if (match(Ops[i].Op, m_Not(m_Value(X)))) { // Cannot occur for ^. in OptimizeAndOrXor()
1239 unsigned FoundX = FindInOperandList(Ops, i, X); in OptimizeAndOrXor()
1251 assert(i < Ops.size()); in OptimizeAndOrXor()
1252 if (i+1 != Ops.size() && Ops[i+1].Op == Ops[i].Op) { in OptimizeAndOrXor()
1255 Ops.erase(Ops.begin()+i); in OptimizeAndOrXor()
1264 return Constant::getNullValue(Ops[0].Op->getType()); in OptimizeAndOrXor()
1267 Ops.erase(Ops.begin()+i, Ops.begin()+i+2); in OptimizeAndOrXor()
1411 SmallVectorImpl<ValueEntry> &Ops) { in OptimizeXor() argument
1412 if (Value *V = OptimizeAndOrXor(Instruction::Xor, Ops)) in OptimizeXor()
1415 if (Ops.size() == 1) in OptimizeXor()
1420 Type *Ty = Ops[0].Op->getType(); in OptimizeXor()
1424 for (unsigned i = 0, e = Ops.size(); i != e; ++i) { in OptimizeXor()
1425 Value *V = Ops[i].Op; in OptimizeXor()
1505 Ops.clear(); in OptimizeXor()
1511 Ops.push_back(VE); in OptimizeXor()
1516 Ops.push_back(VE); in OptimizeXor()
1518 unsigned Sz = Ops.size(); in OptimizeXor()
1520 return Ops.back().Op; in OptimizeXor()
1534 SmallVectorImpl<ValueEntry> &Ops) { in OptimizeAdd() argument
1540 for (unsigned i = 0, e = Ops.size(); i != e; ++i) { in OptimizeAdd()
1541 Value *TheOp = Ops[i].Op; in OptimizeAdd()
1545 if (i+1 != Ops.size() && Ops[i+1].Op == TheOp) { in OptimizeAdd()
1549 Ops.erase(Ops.begin()+i); in OptimizeAdd()
1551 } while (i != Ops.size() && Ops[i].Op == TheOp); in OptimizeAdd()
1569 if (Ops.empty()) in OptimizeAdd()
1575 Ops.insert(Ops.begin(), ValueEntry(getRank(Mul), Mul)); in OptimizeAdd()
1578 e = Ops.size(); in OptimizeAdd()
1588 unsigned FoundX = FindInOperandList(Ops, i, X); in OptimizeAdd()
1593 if (Ops.size() == 2 && in OptimizeAdd()
1598 if (Ops.size() == 2 && match(TheOp, m_Not(m_Value()))) in OptimizeAdd()
1601 Ops.erase(Ops.begin()+i); in OptimizeAdd()
1606 Ops.erase(Ops.begin()+FoundX); in OptimizeAdd()
1614 Ops.insert(Ops.end(), ValueEntry(getRank(V), V)); in OptimizeAdd()
1630 for (unsigned i = 0, e = Ops.size(); i != e; ++i) { in OptimizeAdd()
1632 isReassociableOp(Ops[i].Op, Instruction::Mul, Instruction::FMul); in OptimizeAdd()
1701 for (unsigned i = 0; i != Ops.size(); ++i) { in OptimizeAdd()
1704 isReassociableOp(Ops[i].Op, Instruction::Mul, Instruction::FMul); in OptimizeAdd()
1708 if (Value *V = RemoveFactorFromExpression(Ops[i].Op, MaxOccVal)) { in OptimizeAdd()
1711 for (unsigned j = Ops.size(); j != i;) { in OptimizeAdd()
1713 if (Ops[j].Op == Ops[i].Op) { in OptimizeAdd()
1715 Ops.erase(Ops.begin()+j); in OptimizeAdd()
1745 if (Ops.empty()) in OptimizeAdd()
1751 Ops.insert(Ops.begin(), ValueEntry(getRank(V2), V2)); in OptimizeAdd()
1768 static bool collectMultiplyFactors(SmallVectorImpl<ValueEntry> &Ops, in collectMultiplyFactors() argument
1773 for (unsigned Idx = 1, Size = Ops.size(); Idx < Size; ++Idx) { in collectMultiplyFactors()
1774 Value *Op = Ops[Idx-1].Op; in collectMultiplyFactors()
1778 for (; Idx < Size && Ops[Idx].Op == Op; ++Idx) in collectMultiplyFactors()
1794 for (unsigned Idx = 1; Idx < Ops.size(); ++Idx) { in collectMultiplyFactors()
1795 Value *Op = Ops[Idx-1].Op; in collectMultiplyFactors()
1799 for (; Idx < Ops.size() && Ops[Idx].Op == Op; ++Idx) in collectMultiplyFactors()
1808 Ops.erase(Ops.begin()+Idx, Ops.begin()+Idx+Count); in collectMultiplyFactors()
1823 SmallVectorImpl<Value*> &Ops) { in buildMultiplyTree() argument
1824 if (Ops.size() == 1) in buildMultiplyTree()
1825 return Ops.back(); in buildMultiplyTree()
1827 Value *LHS = Ops.pop_back_val(); in buildMultiplyTree()
1830 LHS = Builder.CreateMul(LHS, Ops.pop_back_val()); in buildMultiplyTree()
1832 LHS = Builder.CreateFMul(LHS, Ops.pop_back_val()); in buildMultiplyTree()
1833 } while (!Ops.empty()); in buildMultiplyTree()
1903 SmallVectorImpl<ValueEntry> &Ops) { in OptimizeMul() argument
1906 if (Ops.size() < 4) in OptimizeMul()
1913 if (!collectMultiplyFactors(Ops, Factors)) in OptimizeMul()
1924 if (Ops.empty()) in OptimizeMul()
1928 Ops.insert(llvm::lower_bound(Ops, NewEntry), NewEntry); in OptimizeMul()
1933 SmallVectorImpl<ValueEntry> &Ops) { in OptimizeExpression() argument
1938 while (!Ops.empty() && isa<Constant>(Ops.back().Op)) { in OptimizeExpression()
1939 Constant *C = cast<Constant>(Ops.pop_back_val().Op); in OptimizeExpression()
1943 if (Ops.empty()) in OptimizeExpression()
1952 Ops.push_back(ValueEntry(0, Cst)); in OptimizeExpression()
1955 if (Ops.size() == 1) return Ops[0].Op; in OptimizeExpression()
1959 unsigned NumOps = Ops.size(); in OptimizeExpression()
1964 if (Value *Result = OptimizeAndOrXor(Opcode, Ops)) in OptimizeExpression()
1969 if (Value *Result = OptimizeXor(I, Ops)) in OptimizeExpression()
1975 if (Value *Result = OptimizeAdd(I, Ops)) in OptimizeExpression()
1981 if (Value *Result = OptimizeMul(I, Ops)) in OptimizeExpression()
1986 if (Ops.size() != NumOps) in OptimizeExpression()
1987 return OptimizeExpression(I, Ops); in OptimizeExpression()
1996 SmallVector<Value *, 4> Ops(I->operands()); in RecursivelyEraseDeadInsts() local
2002 for (auto Op : Ops) in RecursivelyEraseDeadInsts()
2013 SmallVector<Value *, 8> Ops(I->operands()); in EraseInst() local
2021 for (unsigned i = 0, e = Ops.size(); i != e; ++i) in EraseInst()
2022 if (Instruction *Op = dyn_cast<Instruction>(Ops[i])) { in EraseInst()
2315 SmallVector<ValueEntry, 8> Ops; in ReassociateExpression() local
2316 Ops.reserve(Tree.size()); in ReassociateExpression()
2319 Ops.append(E.second.getZExtValue(), in ReassociateExpression()
2323 LLVM_DEBUG(dbgs() << "RAIn:\t"; PrintOps(I, Ops); dbgs() << '\n'); in ReassociateExpression()
2331 llvm::stable_sort(Ops); in ReassociateExpression()
2335 if (Value *V = OptimizeExpression(I, Ops)) { in ReassociateExpression()
2358 isa<ConstantInt>(Ops.back().Op) && in ReassociateExpression()
2359 cast<ConstantInt>(Ops.back().Op)->isMinusOne()) { in ReassociateExpression()
2360 ValueEntry Tmp = Ops.pop_back_val(); in ReassociateExpression()
2361 Ops.insert(Ops.begin(), Tmp); in ReassociateExpression()
2365 isa<ConstantFP>(Ops.back().Op) && in ReassociateExpression()
2366 cast<ConstantFP>(Ops.back().Op)->isExactlyValue(-1.0)) { in ReassociateExpression()
2367 ValueEntry Tmp = Ops.pop_back_val(); in ReassociateExpression()
2368 Ops.insert(Ops.begin(), Tmp); in ReassociateExpression()
2372 LLVM_DEBUG(dbgs() << "RAOut:\t"; PrintOps(I, Ops); dbgs() << '\n'); in ReassociateExpression()
2374 if (Ops.size() == 1) { in ReassociateExpression()
2375 if (Ops[0].Op == I) in ReassociateExpression()
2381 I->replaceAllUsesWith(Ops[0].Op); in ReassociateExpression()
2382 if (Instruction *OI = dyn_cast<Instruction>(Ops[0].Op)) in ReassociateExpression()
2388 if (Ops.size() > 2 && Ops.size() <= GlobalReassociateLimit) { in ReassociateExpression()
2399 for (unsigned i = 0; i < Ops.size() - 1; ++i) in ReassociateExpression()
2400 for (unsigned j = i + 1; j < Ops.size(); ++j) { in ReassociateExpression()
2402 Value *Op0 = Ops[i].Op; in ReassociateExpression()
2403 Value *Op1 = Ops[j].Op; in ReassociateExpression()
2417 unsigned MaxRank = std::max(Ops[i].Rank, Ops[j].Rank); in ReassociateExpression()
2425 auto Op0 = Ops[BestPair.first]; in ReassociateExpression()
2426 auto Op1 = Ops[BestPair.second]; in ReassociateExpression()
2427 Ops.erase(&Ops[BestPair.second]); in ReassociateExpression()
2428 Ops.erase(&Ops[BestPair.first]); in ReassociateExpression()
2429 Ops.push_back(Op0); in ReassociateExpression()
2430 Ops.push_back(Op1); in ReassociateExpression()
2435 RewriteExprTree(I, Ops); in ReassociateExpression()
2454 SmallVector<Value *, 8> Ops; in BuildPairMap() local
2455 while (!Worklist.empty() && Ops.size() <= GlobalReassociateLimit) { in BuildPairMap()
2459 Ops.push_back(Op); in BuildPairMap()
2469 if (Ops.size() > GlobalReassociateLimit) in BuildPairMap()
2475 for (unsigned i = 0; i < Ops.size() - 1; ++i) { in BuildPairMap()
2476 for (unsigned j = i + 1; j < Ops.size(); ++j) { in BuildPairMap()
2478 Value *Op0 = Ops[i]; in BuildPairMap()
2479 Value *Op1 = Ops[j]; in BuildPairMap()