1164   SmallVector<ValueEntry, 8> Factors;  in RemoveFactorFromExpression()  local
1165   Factors.reserve(Tree.size());  in RemoveFactorFromExpression()
1168     Factors.append(E.second.getZExtValue(),  in RemoveFactorFromExpression()
1174   for (unsigned i = 0, e = Factors.size(); i != e; ++i) {  in RemoveFactorFromExpression()
1175     if (Factors[i].Op == Factor) {  in RemoveFactorFromExpression()
1177       Factors.erase(Factors.begin()+i);  in RemoveFactorFromExpression()
1183       if (ConstantInt *FC2 = dyn_cast<ConstantInt>(Factors[i].Op))  in RemoveFactorFromExpression()
1186           Factors.erase(Factors.begin()+i);  in RemoveFactorFromExpression()
1190       if (ConstantFP *FC2 = dyn_cast<ConstantFP>(Factors[i].Op)) {  in RemoveFactorFromExpression()
1196           Factors.erase(Factors.begin() + i);  in RemoveFactorFromExpression()
1205     RewriteExprTree(BO, Factors);  in RemoveFactorFromExpression()
1213   if (Factors.size() == 1) {  in RemoveFactorFromExpression()
1215     V = Factors[0].Op;  in RemoveFactorFromExpression()
1217     RewriteExprTree(BO, Factors);  in RemoveFactorFromExpression()
1232                                          SmallVectorImpl<Value*> &Factors) {  in FindSingleUseMultiplyFactors()  argument
1235     Factors.push_back(V);  in FindSingleUseMultiplyFactors()
1240   FindSingleUseMultiplyFactors(BO->getOperand(1), Factors);  in FindSingleUseMultiplyFactors()
1241   FindSingleUseMultiplyFactors(BO->getOperand(0), Factors);  in FindSingleUseMultiplyFactors()
1653     SmallVector<Value*, 8> Factors;  in OptimizeAdd()  local
1654     FindSingleUseMultiplyFactors(BOp, Factors);  in OptimizeAdd()
1655     assert(Factors.size() > 1 && "Bad linearize!");  in OptimizeAdd()
1659     for (unsigned i = 0, e = Factors.size(); i != e; ++i) {  in OptimizeAdd()
1660       Value *Factor = Factors[i];  in OptimizeAdd()
1785                                    SmallVectorImpl<Factor> &Factors) {  in collectMultiplyFactors()  argument
1823     Factors.push_back(Factor(Op, Count));  in collectMultiplyFactors()
1831   llvm::stable_sort(Factors, [](const Factor &LHS, const Factor &RHS) {  in collectMultiplyFactors()
1862                                          SmallVectorImpl<Factor> &Factors) {  in buildMinimalMultiplyDAG()  argument
1863   assert(Factors[0].Power);  in buildMinimalMultiplyDAG()
1865   for (unsigned LastIdx = 0, Idx = 1, Size = Factors.size();  in buildMinimalMultiplyDAG()
1866        Idx < Size && Factors[Idx].Power > 0; ++Idx) {  in buildMinimalMultiplyDAG()
1867     if (Factors[Idx].Power != Factors[LastIdx].Power) {  in buildMinimalMultiplyDAG()
1876     InnerProduct.push_back(Factors[LastIdx].Base);  in buildMinimalMultiplyDAG()
1878       InnerProduct.push_back(Factors[Idx].Base);  in buildMinimalMultiplyDAG()
1880     } while (Idx < Size && Factors[Idx].Power == Factors[LastIdx].Power);  in buildMinimalMultiplyDAG()
1884     Value *M = Factors[LastIdx].Base = buildMultiplyTree(Builder, InnerProduct);  in buildMinimalMultiplyDAG()
1892   Factors.erase(std::unique(Factors.begin(), Factors.end(),  in buildMinimalMultiplyDAG()
1896                 Factors.end());  in buildMinimalMultiplyDAG()
1901   for (unsigned Idx = 0, Size = Factors.size(); Idx != Size; ++Idx) {  in buildMinimalMultiplyDAG()
1902     if (Factors[Idx].Power & 1)  in buildMinimalMultiplyDAG()
1903       OuterProduct.push_back(Factors[Idx].Base);  in buildMinimalMultiplyDAG()
1904     Factors[Idx].Power >>= 1;  in buildMinimalMultiplyDAG()
1906   if (Factors[0].Power) {  in buildMinimalMultiplyDAG()
1907     Value *SquareRoot = buildMinimalMultiplyDAG(Builder, Factors);  in buildMinimalMultiplyDAG()
1928   SmallVector<Factor, 4> Factors;  in OptimizeMul()  local
1929   if (!collectMultiplyFactors(Ops, Factors))  in OptimizeMul()
1939   Value *V = buildMinimalMultiplyDAG(Builder, Factors);  in OptimizeMul()