HomeSort by: relevance | last modified time | path
    Searched refs:Factors (Results 1 - 6 of 6) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
Reassociate.cpp 1147 SmallVector<ValueEntry, 8> Factors;
1148 Factors.reserve(Tree.size());
1151 Factors.append(E.second.getZExtValue(),
1157 for (unsigned i = 0, e = Factors.size(); i != e; ++i) {
1158 if (Factors[i].Op == Factor) {
1160 Factors.erase(Factors.begin()+i);
1166 if (ConstantInt *FC2 = dyn_cast<ConstantInt>(Factors[i].Op))
1169 Factors.erase(Factors.begin()+i)
    [all...]
LoopStrengthReduce.cpp 1930 /// Interesting factors between use strides.
1936 SetVector<int64_t, SmallVector<int64_t, 8>, SmallSet<int64_t, 8>> Factors;
2681 // Compute interesting factors from the set of interesting strides.
2701 Factors.insert(Factor->getAPInt().getSExtValue());
2707 Factors.insert(Factor->getAPInt().getSExtValue());
3313 for (size_t i = 0, e = Factors.size(); i != e; ++i)
3314 if (Factors[i] != -1)
3315 Factors.insert(-(uint64_t)Factors[i]);
3316 Factors.insert(-1)
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Scalar/
Reassociate.h 118 SmallVectorImpl<reassociate::Factor> &Factors);
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/
LegalizerHelper.cpp 4676 SmallVector<Register, 4> Factors;
4684 Factors.push_back(Mul.getReg(0));
4691 Factors.push_back(Umulh.getReg(0));
4695 Factors.push_back(CarrySumPrevDstIdx);
4699 // Add all factors and accumulate all carries into CarrySum.
4702 B.buildUAddo(NarrowTy, LLT::scalar(1), Factors[0], Factors[1]);
4705 for (unsigned i = 2; i < Factors.size(); ++i) {
4707 B.buildUAddo(NarrowTy, LLT::scalar(1), FactorSum, Factors[i]);
4714 FactorSum = B.buildAdd(NarrowTy, Factors[0], Factors[1]).getReg(0)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
TargetLowering.cpp 5024 SmallVector<SDValue, 16> Shifts, Factors;
5041 Factors.push_back(DAG.getConstant(Factor, dl, SVT));
5052 Factor = DAG.getBuildVector(VT, dl, Factors);
5054 assert(Shifts.size() == 1 && Factors.size() == 1 &&
5058 Factor = DAG.getSplatVector(VT, dl, Factors[0]);
5062 Factor = Factors[0];
5126 SmallVector<SDValue, 16> MagicFactors, Factors, Shifts, ShiftMasks;
5152 Factors.push_back(DAG.getConstant(NumeratorFactor, dl, SVT));
5168 Factor = DAG.getBuildVector(VT, dl, Factors);
5172 assert(MagicFactors.size() == 1 && Factors.size() == 1 &
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
ScalarEvolution.cpp 925 // is something like the following, where T is the number of factors of 2 in
958 // (It's possible to not widen at all by pulling out factors of 2 before
971 // Calculate K! / 2^T and T; we divide out the factors of two before
3290 /// can attempt to remove factors from the LHS and RHS. We can't do this when
3294 // TODO: we could try to find factors in all sorts of things, but for now we
11685 // Find factors that are multiplied with an expression that (possibly as a
11690 // "%p * %q" are factors multiplied by the expression "(%a + {0, +, 1}_loop)"
11840 SmallVector<const SCEV *, 2> Factors;
11843 Factors.push_back(Op);
11845 return SE.getMulExpr(Factors);
    [all...]

Completed in 49 milliseconds