HomeSort by: relevance | last modified time | path
    Searched defs:Factor (Results 1 - 19 of 19) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/IR/
PseudoProbe.h 35 // The saturated distrution factor representing 100% for block probes.
46 // [25:19] - probe distribution factor
50 uint32_t Factor) {
54 assert(Factor <= 100 &&
55 "Probe distribution factor too big to encode, exceeding 100");
56 return (Index << 3) | (Factor << 19) | (Type << 26) | 0x7;
75 // The saturated distrution factor representing 100% for callsites.
83 // Distribution factor that estimates the portion of the real execution count.
84 // A saturated distribution factor stands for 1.0 or 100%. A pesudo probe has
85 // a factor with the value ranged from 0.0 to 1.0
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Scalar/
Reassociate.h 58 /// factor of some product.
59 struct Factor {
63 Factor(Value *Base, unsigned Power) : Base(Base), Power(Power) {}
118 SmallVectorImpl<reassociate::Factor> &Factors);
121 Value *RemoveFactorFromExpression(Value *V, Value *Factor);
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
MachineTraceMetrics.h 416 unsigned Factor = SchedModel.getLatencyFactor();
417 return (Scaled + Factor - 1) / Factor;
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
InterleavedAccessPass.cpp 14 // DE-interleaving the data on a factor. An interleaved store writes several
15 // vectors to memory with RE-interleaving the data on a factor.
23 // E.g. An interleaved load (Factor = 2):
34 // E.g. An interleaved store (Factor = 3):
105 /// The maximum supported interleave factor.
149 /// Check if the mask is a DE-interleave mask of the given factor
150 /// \p Factor like:
151 /// <Index, Index+Factor, ..., Index+(NumElts-1)*Factor>
152 static bool isDeInterleaveMaskOfFactor(ArrayRef<int> Mask, unsigned Factor,
    [all...]
InterleavedLoadCombinePass.cpp 103 /// factor, find a set that represents a 'factor' interleaved load.
105 std::list<VectorInfo> &InterleavedLoad, unsigned Factor,
688 /// specified factor.
690 /// \param Factor of the interleave
694 bool isInterleaved(unsigned Factor, const DataLayout &DL) const {
697 if (!EI[i].Ofs.isProvenEqualTo(EI[0].Ofs + i * Factor * Size)) {
746 unsigned Factor = Result.VTy->getNumElements() / VTy->getNumElements();
750 if (NewSize * Factor != OldSize)
757 for (unsigned i = 0; i < Result.VTy->getNumElements(); i += Factor) {
    [all...]
MachineScheduler.cpp 2033 unsigned Factor = SchedModel->getResourceFactor(PIdx);
2034 RemainingCounts[PIdx] += (Factor * PI->Cycles);
2346 unsigned Factor = SchedModel->getResourceFactor(PIdx);
2347 unsigned Count = Factor * Cycles;
2349 << Cycles << "x" << Factor << "u\n");
  /src/external/apache2/llvm/dist/llvm/lib/Target/ARM/
MVETailPredication.cpp 364 ConstantInt *Factor = ConstantInt::get(cast<IntegerType>(Ty), VectorWidth);
386 Value *Remaining = Builder.CreateSub(Processed, Factor);
ARMTargetTransformInfo.cpp 1102 unsigned Limit, Factor = 2;
1112 Factor = 1;
1125 return MemOps.size() * Factor;
1451 unsigned Opcode, Type *VecTy, unsigned Factor, ArrayRef<unsigned> Indices,
1454 assert(Factor >= 2 && "Invalid interleave factor");
1460 if (Factor <= TLI->getMaxSupportedInterleaveFactor() && !EltIs64Bits &&
1464 FixedVectorType::get(VecTy->getScalarType(), NumElts / Factor);
1471 if (NumElts % Factor == 0 &&
1472 TLI->isLegalInterleavedAccessType(Factor, SubVecTy, Alignment, DL)
    [all...]
ARMISelLowering.cpp 148 MVEMaxSupportedInterleaveFactor("mve-max-interleave-factor", cl::Hidden,
149 cl::desc("Maximum interleave factor for MVE VLDn to generate."),
19116 unsigned Factor = Intrinsic == Intrinsic::arm_mve_vld2q ? 2 : 4;
19117 Info.memVT = EVT::getVectorVT(VecTy->getContext(), MVT::i64, Factor * 2);
19130 unsigned Factor = Intrinsic == Intrinsic::arm_mve_vst2q ? 2 : 4;
19131 Info.memVT = EVT::getVectorVT(VecTy->getContext(), MVT::i64, Factor * 2);
19578 unsigned Factor, FixedVectorType *VecTy, Align Alignment,
19592 if (Subtarget->hasMVEIntegerOps() && Factor == 3)
19623 /// E.g. Lower an interleaved load (Factor = 2):
19634 ArrayRef<unsigned> Indices, unsigned Factor) const
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
VectorUtils.h 83 unsigned VF; // Vectorization factor.
167 /// Vectorization Factor of scalable vector functions from their
465 /// For example, the mask for \p Group with interleave-factor 3
482 /// interleaved-group of loads/stores whose Interleaved-factor ==
494 /// vectorization factor \p VF into a single wide vector. The mask is of the
508 /// interleaved vector into separate vectors of vectorization factor \p VF. The
560 /// index should be less than interleaved factor, which is equal to the absolute
563 /// E.g. An interleaved load group of factor 4:
571 /// An interleaved store group of factor 4:
584 InterleaveGroup(uint32_t Factor, bool Reverse, Align Alignment
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/X86/
X86InterleavedAccess.cpp 44 /// E.g. A group of interleaving access loads (Factor = 2; accessing every
61 const unsigned Factor;
106 /// \p 'Ind' and the interleaving stride factor \p F. In order to generate
114 : Inst(I), Shuffles(Shuffs), Indices(Ind), Factor(F), Subtarget(STarget),
140 if (!Subtarget.hasAVX() || (Factor != 4 && Factor != 3))
152 if (ShuffleElemSize == 64 && WideInstSize == 1024 && Factor == 4)
155 if (ShuffleElemSize == 8 && isa<StoreInst>(Inst) && Factor == 4 &&
160 if (ShuffleElemSize == 8 && Factor == 3 &&
728 unsigned NumSubVecElems = ShuffleEltTy->getNumElements() / Factor;
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Driver/
ToolChain.cpp 1039 unsigned Build = 0, Factor = 1;
1040 for (; Version > 10000; Version = Version / 10, Factor = Factor * 10)
1041 Build = Build + (Version % 10) * Factor;
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
VectorUtils.cpp 34 /// Maximum factor for an interleaved memory access.
36 "max-interleave-group-factor", cl::Hidden,
37 cl::desc("Maximum factor for an interleaved access group (default = 8)"),
413 assert(Scale > 0 && "Unexpected scaling factor");
434 assert(Scale > 0 && "Unexpected scaling factor");
943 unsigned Factor = std::abs(Stride);
944 return Factor >= 2 && Factor <= MaxInterleaveGroupFactor;
1219 // and group member Factor - 1; If the latter doesn't exist we rely on
1244 // to look for a member at index factor - 1, since every group must hav
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/IR/
ConstantFold.cpp 670 // alignof-like expression, factor out known factors.
2569 // It's out of range and negative, don't try to factor it.
2586 // It's out of range and negative, don't try to factor it.
2595 // It's out of range, but we can factor it into the prior
2618 Constant *Factor =
2621 Factor = ConstantDataVector::getSplat(
2625 Factor);
2627 NewIdxs[i] = ConstantExpr::getSRem(CurrIdx, Factor);
2629 Constant *Div = ConstantExpr::getSDiv(CurrIdx, Factor);
  /src/external/apache2/llvm/dist/llvm/include/llvm/ProfileData/Coverage/
CoverageMapping.h 177 int Factor;
179 Term(unsigned CounterID, int Factor)
180 : CounterID(CounterID), Factor(Factor) {}
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
SampleProfile.cpp 116 "Number of inlined callsites with a partial distribution factor");
314 // Call site distribution factor to prorate the profile samples for a
590 uint64_t Samples = R.get() * Probe->Factor;
598 Remark << ", Factor=";
599 Remark << ore::NV("Factor", Probe->Factor);
607 << " - weight: " << R.get() << " - factor: "
608 << format("%0.2f", Probe->Factor) << ")\n");
1075 0 /* dummy count */, 1.0 /* dummy distribution factor */};
1203 // callsite's distribution factor for counts accuracy. Note that an inline
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LoopStrengthReduce.cpp 1011 // Get the cost of the scaling factor used in F for LU.
1714 // scaling factor is profitable before computing the actual ScaledReg for
1774 // Check the scaling factor cost with both the min and max offsets.
2697 if (const SCEVConstant *Factor =
2700 if (Factor->getAPInt().getMinSignedBits() <= 64)
2701 Factors.insert(Factor->getAPInt().getSExtValue());
2702 } else if (const SCEVConstant *Factor =
2706 if (Factor->getAPInt().getMinSignedBits() <= 64)
2707 Factors.insert(Factor->getAPInt().getSExtValue());
3902 for (int64_t Factor : Factors)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
SelectionDAGBuilder.cpp 374 unsigned Factor = NumParts / NumIntermediates;
376 Ops[i] = getCopyFromParts(DAG, DL, &Parts[i * Factor], Factor,
770 unsigned Factor = NumParts / NumIntermediates;
772 getCopyToParts(DAG, DL, Ops[i], &Parts[i * Factor], Factor, PartVT, V,
DAGCombiner.cpp 1842 // Don't simplify the token factor if the node itself has too many operands.
1846 // If the sole user is a token factor, we should make sure we have a
1853 SmallVector<SDValue, 8> Ops; // Ops for replacing token factor.
1855 bool Changed = false; // If we should replace this token factor.
1857 // Start out with this token factor.
1906 // removed. Skip the first Token Factor, as this is the current node.
1992 // If we've changed things around then replace token factor.
7779 // FIXME Can we handle multiple uses? Could we token factor the chain
13997 // For splat vectors, scale the number of uses by the splat factor. If we can
15742 // Create token factor to keep old chain connected
    [all...]

Completed in 110 milliseconds