Lines Matching defs:Factors

1110   SmallVector<ValueEntry, 8> Factors;
1111   Factors.reserve(Tree.size());
1114     Factors.append(E.second, ValueEntry(getRank(E.first), E.first));
1119   for (unsigned i = 0, e = Factors.size(); i != e; ++i) {
1120     if (Factors[i].Op == Factor) {
1122       Factors.erase(Factors.begin()+i);
1128       if (ConstantInt *FC2 = dyn_cast<ConstantInt>(Factors[i].Op))
1131           Factors.erase(Factors.begin()+i);
1135       if (ConstantFP *FC2 = dyn_cast<ConstantFP>(Factors[i].Op)) {
1141           Factors.erase(Factors.begin() + i);
1150     RewriteExprTree(BO, Factors, Flags);
1158   if (Factors.size() == 1) {
1160     V = Factors[0].Op;
1162     RewriteExprTree(BO, Factors, Flags);
1177                                          SmallVectorImpl<Value*> &Factors) {
1180     Factors.push_back(V);
1185   FindSingleUseMultiplyFactors(BO->getOperand(1), Factors);
1186   FindSingleUseMultiplyFactors(BO->getOperand(0), Factors);
1598     SmallVector<Value*, 8> Factors;
1599     FindSingleUseMultiplyFactors(BOp, Factors);
1600     assert(Factors.size() > 1 && "Bad linearize!");
1604     for (Value *Factor : Factors) {
1729                                    SmallVectorImpl<Factor> &Factors) {
1763     // Move an even number of occurrences to Factors.
1767     Factors.push_back(Factor(Op, Count));
1775   llvm::stable_sort(Factors, [](const Factor &LHS, const Factor &RHS) {
1806                                          SmallVectorImpl<Factor> &Factors) {
1807   assert(Factors[0].Power);
1809   for (unsigned LastIdx = 0, Idx = 1, Size = Factors.size();
1810        Idx < Size && Factors[Idx].Power > 0; ++Idx) {
1811     if (Factors[Idx].Power != Factors[LastIdx].Power) {
1820     InnerProduct.push_back(Factors[LastIdx].Base);
1822       InnerProduct.push_back(Factors[Idx].Base);
1824     } while (Idx < Size && Factors[Idx].Power == Factors[LastIdx].Power);
1828     Value *M = Factors[LastIdx].Base = buildMultiplyTree(Builder, InnerProduct);
1836   Factors.erase(llvm::unique(Factors,
1840                 Factors.end());
1845   for (Factor &F : Factors) {
1850   if (Factors[0].Power) {
1851     Value *SquareRoot = buildMinimalMultiplyDAG(Builder, Factors);
1872   SmallVector<Factor, 4> Factors;
1873   if (!collectMultiplyFactors(Ops, Factors))
1883   Value *V = buildMinimalMultiplyDAG(Builder, Factors);