HomeSort by: relevance | last modified time | path
    Searched refs:Factor (Results 1 - 25 of 67) sorted by relevancy

1 2 3

  /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/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...]
MachineTraceMetrics.cpp 872 unsigned Factor = MTM.SchedModel.getResourceFactor(K);
875 << PRDepths[K]/Factor << " ops x" << Factor << ")\n";
1057 unsigned Factor = MTM.SchedModel.getResourceFactor(K);
1060 << PRHeights[K]/Factor << " ops x" << Factor << ")\n";
  /src/external/apache2/llvm/dist/llvm/lib/IR/
PseudoProbe.cpp 39 Probe.Factor =
54 Probe.Factor = II->getFactor()->getZExtValue() /
65 void setProbeDistributionFactor(Instruction &Inst, float Factor) {
66 assert(Factor >= 0 && Factor <= 1 &&
67 "Distribution factor must be in [0, 1.0]");
71 if (Factor < 1)
72 IntFactor *= Factor;
90 if (Factor < 1)
91 IntFactor *= Factor;
    [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/Support/
LowLevelTypeImpl.h 147 /// Return a type that is \p Factor times smaller. Reduces the number of
150 LLT divide(int Factor) const {
151 assert(Factor != 1);
153 assert(getNumElements() % Factor == 0);
154 return scalarOrVector(getNumElements() / Factor, getElementType());
157 assert(getSizeInBits() % Factor == 0);
158 return scalar(getSizeInBits() / Factor);
  /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...]
X86TargetTransformInfo.h 193 unsigned Opcode, Type *VecTy, unsigned Factor, ArrayRef<unsigned> Indices,
198 unsigned Opcode, FixedVectorType *VecTy, unsigned Factor,
203 unsigned Opcode, FixedVectorType *VecTy, unsigned Factor,
  /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/config/x86/
switchcontext.S 154 .byte 0x1 # uleb128 0x1; CIE Code Alignment Factor
155 .byte 0x7c # sleb128 -4; CIE Data Alignment Factor
224 .byte 0x1 # uleb128 0x1; CIE Code Alignment Factor
225 .byte 0x78 # sleb128 -8; CIE Data Alignment Factor
  /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/include/llvm/CodeGen/
MachineTraceMetrics.h 416 unsigned Factor = SchedModel.getLatencyFactor();
417 return (Scaled + Factor - 1) / Factor;
BasicTTIImpl.h 958 // of casting the original vector twice. We also need to factor in the
1135 unsigned Opcode, Type *VecTy, unsigned Factor, ArrayRef<unsigned> Indices,
1141 assert(Factor > 1 && NumElts % Factor == 0 && "Invalid interleave factor");
1143 unsigned NumSubElts = NumElts / Factor;
1165 // E.g., An interleaved load of factor 8:
1188 UsedInsts.set((Index + Elt * Factor) / NumEltsPerLegalInst);
1200 // E.g. An interleaved load of factor 2 (with one member of index 0):
1206 assert(Indices.size() <= Factor &
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/ProfileData/Coverage/
CoverageMapping.cpp 57 void CounterExpressionBuilder::extractTerms(Counter C, int Factor,
63 Terms.emplace_back(C.getCounterID(), Factor);
67 extractTerms(E.LHS, Factor, Terms);
69 E.RHS, E.Kind == CounterExpression::Subtract ? -Factor : Factor, Terms);
93 Prev->Factor += I->Factor;
105 if (T.Factor <= 0)
107 for (int I = 0; I < T.Factor; ++I)
117 if (T.Factor >= 0
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
Reassociate.cpp 1138 /// and if this sequence contains a multiply by Factor,
1139 /// remove Factor from the tree and return the new tree.
1140 Value *ReassociatePass::RemoveFactorFromExpression(Value *V, Value *Factor) {
1158 if (Factors[i].Op == Factor) {
1164 // If this is a negative version of this factor, remove it.
1165 if (ConstantInt *FC1 = dyn_cast<ConstantInt>(Factor)) {
1172 } else if (ConstantFP *FC1 = dyn_cast<ConstantFP>(Factor)) {
1213 /// Ops is the top-level list of add operands we're trying to factor.
1542 // Check to see if we've seen this operand before. If so, we factor all
1561 Instruction *Mul = CreateMul(TheOp, C, "factor", I, I)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/SystemZ/
SystemZTargetTransformInfo.cpp 1138 unsigned Opcode, Type *VecTy, unsigned Factor, ArrayRef<unsigned> Indices,
1142 return BaseT::getInterleavedMemoryOpCost(Opcode, VecTy, Factor, Indices,
1149 assert(Factor > 1 && NumElts % Factor == 0 && "Invalid interleave factor");
1150 unsigned VF = NumElts / Factor;
1160 std::vector<BitVector> ValueVecs(Factor, BitVector(NumVectorMemOps, false));
1163 unsigned Vec = (Index + Elt * Factor) / NumEltsPerVecReg;
1182 unsigned NumSrcVecs = std::min(NumEltsPerVecReg, Factor);
SystemZTargetTransformInfo.h 117 unsigned Opcode, Type *VecTy, unsigned Factor, ArrayRef<unsigned> Indices,
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonTargetTransformInfo.cpp 41 // Constant "cost factor" to make floating point operations more expensive
237 unsigned Opcode, Type *VecTy, unsigned Factor, ArrayRef<unsigned> Indices,
240 if (Indices.size() != Factor || UseMaskForCond || UseMaskForGaps)
241 return BaseT::getInterleavedMemoryOpCost(Opcode, VecTy, Factor, Indices,
HexagonTargetTransformInfo.h 135 unsigned Opcode, Type *VecTy, unsigned Factor, ArrayRef<unsigned> Indices,
  /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/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...]
  /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/config/powerpc/
switchcontext.S 406 .byte 0x1 ; uleb128 0x1; CIE Code Alignment Factor
407 .byte DATA_ALIGN ; sleb128 -4/-8; CIE Data Alignment 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/Target/PowerPC/
PPCTargetTransformInfo.h 132 unsigned Opcode, Type *VecTy, unsigned Factor, ArrayRef<unsigned> Indices,

Completed in 56 milliseconds

1 2 3