Home
last modified time | relevance | path

Searched refs:Factor (Results 1 – 25 of 84) sorted by relevance

1234

/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DInterleavedAccessPass.cpp155 for (Index = 0; Index < Factor; Index++) { in isDeInterleaveMaskOfFactor()
183 for (Factor = 2; Factor <= MaxFactor; Factor++) { in isDeInterleaveMask()
212 for (Factor = 2; Factor <= MaxFactor; Factor++) { in isReInterleaveMask()
213 if (NumElts % Factor) in isReInterleaveMask()
216 unsigned LaneLen = NumElts / Factor; in isReInterleaveMask()
224 for (; I < Factor; I++) { in isReInterleaveMask()
231 unsigned Lane = J * Factor + I; in isReInterleaveMask()
232 unsigned NextLane = Lane + Factor; in isReInterleaveMask()
284 if (I == Factor) in isReInterleaveMask()
331 unsigned Factor, Index; in lowerInterleavedLoad() local
[all …]
H A DInterleavedLoadCombinePass.cpp748 if (NewSize * Factor != OldSize) in computeFromBCI()
756 for (unsigned j = 0; j < Factor; j++) { in computeFromBCI()
1053 unsigned Factor, const DataLayout &DL) { in findPattern() argument
1071 for (i = 1; i < Factor; i++) { in findPattern()
1077 for (i = 1; i < Factor; i++) { in findPattern()
1081 if (i == Factor) { in findPattern()
1089 for (unsigned i = 0; i < Factor; i++) { in findPattern()
1134 unsigned Factor = InterleavedLoad.size(); in combine() local
1234 Mask.push_back(i + j * Factor); in combine()
1246 << ore::NV("Factor", Factor); in combine()
[all …]
H A DMIRSampleProfile.cpp200 uint32_t Factor = 1; in setBranchProbs() local
202 Factor = BBWeight / MaxWeight + 1; in setBranchProbs()
203 BBWeight /= Factor; in setBranchProbs()
204 LLVM_DEBUG(dbgs() << "Scaling weights by " << Factor << "\n"); in setBranchProbs()
213 EdgeWeight /= Factor; in setBranchProbs()
/llvm-project-15.0.7/llvm/lib/IR/
H A DPseudoProbe.cpp39 Probe.Factor = in extractProbeFromDiscriminator()
54 Probe.Factor = II->getFactor()->getZExtValue() / in extractProbe()
65 void setProbeDistributionFactor(Instruction &Inst, float Factor) { in setProbeDistributionFactor() argument
66 assert(Factor >= 0 && Factor <= 1 && in setProbeDistributionFactor()
71 if (Factor < 1) in setProbeDistributionFactor()
72 IntFactor *= Factor; in setProbeDistributionFactor()
90 if (Factor < 1) in setProbeDistributionFactor()
91 IntFactor *= Factor; in setProbeDistributionFactor()
/llvm-project-15.0.7/llvm/include/llvm/IR/
H A DPseudoProbe.h44 uint32_t Factor) { in packProbeData()
48 assert(Factor <= 100 && in packProbeData()
50 return (Index << 3) | (Factor << 19) | (Type << 26) | 0x7; in packProbeData()
80 float Factor; member
85 void setProbeDistributionFactor(Instruction &Inst, float Factor);
/llvm-project-15.0.7/llvm/lib/Target/X86/
H A DX86InterleavedAccess.cpp61 const unsigned Factor; member in __anondaf74ed60111::X86InterleavedAccessGroup
140 if (!Subtarget.hasAVX() || (Factor != 4 && Factor != 3)) in isSupported()
160 if (ShuffleElemSize == 8 && Factor == 3 && in isSupported()
743 decompose(Inst, Factor, ShuffleTy, DecomposedVectors); in lowerIntoOptimizedSequence()
769 decompose(Shuffles[0], Factor, in lowerIntoOptimizedSequence()
785 if (Factor == 4) in lowerIntoOptimizedSequence()
788 if (Factor == 3) in lowerIntoOptimizedSequence()
812 ArrayRef<unsigned> Indices, unsigned Factor) const { in lowerInterleavedLoad()
813 assert(Factor >= 2 && Factor <= getMaxSupportedInterleaveFactor() && in lowerInterleavedLoad()
830 assert(Factor >= 2 && Factor <= getMaxSupportedInterleaveFactor() && in lowerInterleavedStore()
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/SampleProfile/
H A Dpseudo-probe-profile.ll72 ;YAML-NEXT: - String: ', Factor='
73 ;YAML-NEXT: - Factor: '1.000000e+00'
87 ;YAML-NEXT: - String: ', Factor='
88 ;YAML-NEXT: - Factor: '1.000000e+00'
102 ;YAML-NEXT: - String: ', Factor='
103 ;YAML-NEXT: - Factor: '1.000000e+00'
117 ;YAML-NEXT: - String: ', Factor='
118 ;YAML-NEXT: - Factor: '1.000000e+00'
132 ;YAML-NEXT: - String: ', Factor='
133 ;YAML-NEXT: - Factor: '1.000000e+00'
[all …]
H A Dpseudo-probe-inline.ll121 ;YAML-NEXT: - String: ', Factor='
122 ;YAML-NEXT: - Factor: '1.000000e+00'
137 ;YAML-NEXT: - String: ', Factor='
138 ;YAML-NEXT: - Factor: '1.000000e+00'
153 ;YAML-NEXT: - String: ', Factor='
154 ;YAML-NEXT: - Factor: '1.000000e+00'
/llvm-project-15.0.7/clang/test/OpenMP/
H A Dunroll_ast_print.cpp109 template<typename T, T Start, T End, T Step, int Factor>
115 #pragma omp unroll partial(Factor) in unroll_templated()
130 template <int Factor>
136 #pragma omp unroll partial(Factor) in unroll_templated_factor()
H A Dunroll_messages.cpp116 template<typename T, int Factor>
119 #pragma omp unroll partial(Factor) in templated_func()
124 for (int i = 0; i < n; i-=Factor) {} in templated_func()
/llvm-project-15.0.7/llvm/include/llvm/Support/
H A DLowLevelTypeImpl.h196 LLT divide(int Factor) const { in divide() argument
197 assert(Factor != 1); in divide()
201 assert(getElementCount().isKnownMultipleOf(Factor)); in divide()
202 return scalarOrVector(getElementCount().divideCoefficientBy(Factor), in divide()
206 assert(getScalarSizeInBits() % Factor == 0); in divide()
207 return scalar(getScalarSizeInBits() / Factor); in divide()
213 LLT multiplyElements(int Factor) const { in multiplyElements() argument
215 return scalarOrVector(getElementCount().multiplyCoefficientBy(Factor), in multiplyElements()
219 return fixed_vector(Factor, *this); in multiplyElements()
/llvm-project-15.0.7/clang-tools-extra/clangd/index/dex/
H A DIterator.cpp290 BoostIterator(std::unique_ptr<Iterator> Child, float Factor) in BoostIterator() argument
291 : Child(std::move(Child)), Factor(Factor) {} in BoostIterator()
301 float consume() override { return Child->consume() * Factor; } in consume()
307 return OS << "(* " << Factor << ' ' << *Child << ')'; in dump()
311 float Factor; member in clang::clangd::dex::__anon20ee8acc0111::BoostIterator
433 float Factor) const { in boost()
434 if (Factor == 1) in boost()
438 return std::make_unique<BoostIterator>(std::move(Child), Factor); in boost()
/llvm-project-15.0.7/llvm/include/llvm/Transforms/Scalar/
H A DReassociate.h59 struct Factor { struct
63 Factor(Value *Base, unsigned Power) : Base(Base), Power(Power) {} in Factor() argument
118 SmallVectorImpl<reassociate::Factor> &Factors);
121 Value *RemoveFactorFromExpression(Value *V, Value *Factor);
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DVectorUtils.h611 InterleaveGroup(uint32_t Factor, bool Reverse, Align Alignment) in InterleaveGroup() argument
612 : Factor(Factor), Reverse(Reverse), Alignment(Alignment), in InterleaveGroup()
617 Factor = std::abs(Stride); in InterleaveGroup()
618 assert(Factor > 1 && "Invalid interleave factor"); in InterleaveGroup()
625 uint32_t getFactor() const { return Factor; } in getFactor()
652 if (Index >= static_cast<int32_t>(Factor)) in insertMember()
664 if (*MaybeLargestIndex >= static_cast<int64_t>(Factor)) in insertMember()
722 uint32_t Factor; // Interleave Factor.
/llvm-project-15.0.7/polly/lib/Transform/
H A DManualOptimizer.cpp99 int64_t Factor = in applyLoopUnroll() local
102 assert((!Full || !(Factor > 0)) && in applyLoopUnroll()
108 if (Factor > 0) in applyLoopUnroll()
109 return applyPartialUnroll(BandToUnroll, Factor); in applyLoopUnroll()
H A DScheduleTreeTransform.cpp525 static isl::basic_set isDivisibleBySet(isl::ctx &Ctx, long Factor, in isDivisibleBySet() argument
527 isl::val ValFactor{Ctx, Factor}; in isDivisibleBySet()
1050 int Factor) { in applyPartialUnroll() argument
1051 assert(Factor > 0 && "Positive unroll factor required"); in applyPartialUnroll()
1069 isl::val ValFactor{Ctx, Factor}; in applyPartialUnroll()
1080 isl::union_set_list List = isl::union_set_list(Ctx, Factor); in applyPartialUnroll()
1081 for (auto i : seq<int>(0, Factor)) { in applyPartialUnroll()
1087 isl::basic_set Divisible = isDivisibleBySet(Ctx, Factor, i); in applyPartialUnroll()
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DReassociate.cpp1175 if (Factors[i].Op == Factor) { in RemoveFactorFromExpression()
1660 Value *Factor = Factors[i]; in OptimizeAdd() local
1661 if (!Duplicates.insert(Factor).second) in OptimizeAdd()
1667 MaxOccVal = Factor; in OptimizeAdd()
1676 if (!Duplicates.insert(Factor).second) in OptimizeAdd()
1681 MaxOccVal = Factor; in OptimizeAdd()
1694 MaxOccVal = Factor; in OptimizeAdd()
1823 Factors.push_back(Factor(Op, Count)); in collectMultiplyFactors()
1831 llvm::stable_sort(Factors, [](const Factor &LHS, const Factor &RHS) { in collectMultiplyFactors()
1893 [](const Factor &LHS, const Factor &RHS) { in buildMinimalMultiplyDAG()
[all …]
/llvm-project-15.0.7/llvm/lib/ProfileData/Coverage/
H A DCoverageMapping.cpp56 void CounterExpressionBuilder::extractTerms(Counter C, int Factor, in extractTerms() argument
62 Terms.emplace_back(C.getCounterID(), Factor); in extractTerms()
66 extractTerms(E.LHS, Factor, Terms); in extractTerms()
68 E.RHS, E.Kind == CounterExpression::Subtract ? -Factor : Factor, Terms); in extractTerms()
92 Prev->Factor += I->Factor; in simplify()
104 if (T.Factor <= 0) in simplify()
106 for (int I = 0; I < T.Factor; ++I) in simplify()
116 if (T.Factor >= 0) in simplify()
118 for (int I = 0; I < -T.Factor; ++I) in simplify()
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A DMachineTraceMetrics.h416 unsigned Factor = SchedModel.getLatencyFactor(); in getCycles() local
417 return (Scaled + Factor - 1) / Factor; in getCycles()
/llvm-project-15.0.7/polly/lib/Support/
H A DSCEVValidator.cpp693 auto *Factor = Op0Pair.first; in extractConstantFactor() local
694 if (SE.isKnownNegative(Factor)) { in extractConstantFactor()
695 Factor = cast<SCEVConstant>(SE.getNegativeSCEV(Factor)); in extractConstantFactor()
704 if (Factor == OpUPair.first) in extractConstantFactor()
706 else if (Factor == SE.getNegativeSCEV(OpUPair.first)) in extractConstantFactor()
713 return std::make_pair(Factor, NewAdd); in extractConstantFactor()
/llvm-project-15.0.7/libc/benchmarks/
H A DLibcMemoryBenchmark.h129 uint32_t Factor; variable
136 return Distribution(G) * Factor; in operator()
/llvm-project-15.0.7/llvm/lib/Target/SystemZ/
H A DSystemZTargetTransformInfo.cpp1180 unsigned Opcode, Type *VecTy, unsigned Factor, ArrayRef<unsigned> Indices, in getInterleavedMemoryOpCost() argument
1184 return BaseT::getInterleavedMemoryOpCost(Opcode, VecTy, Factor, Indices, in getInterleavedMemoryOpCost()
1191 assert(Factor > 1 && NumElts % Factor == 0 && "Invalid interleave factor"); in getInterleavedMemoryOpCost()
1192 unsigned VF = NumElts / Factor; in getInterleavedMemoryOpCost()
1202 std::vector<BitVector> ValueVecs(Factor, BitVector(NumVectorMemOps, false)); in getInterleavedMemoryOpCost()
1205 unsigned Vec = (Index + Elt * Factor) / NumEltsPerVecReg; in getInterleavedMemoryOpCost()
1224 unsigned NumSrcVecs = std::min(NumEltsPerVecReg, Factor); in getInterleavedMemoryOpCost()
/llvm-project-15.0.7/llvm/lib/Target/Hexagon/
H A DHexagonTargetTransformInfo.cpp239 unsigned Opcode, Type *VecTy, unsigned Factor, ArrayRef<unsigned> Indices, in getInterleavedMemoryOpCost() argument
242 if (Indices.size() != Factor || UseMaskForCond || UseMaskForGaps) in getInterleavedMemoryOpCost()
243 return BaseT::getInterleavedMemoryOpCost(Opcode, VecTy, Factor, Indices, in getInterleavedMemoryOpCost()
/llvm-project-15.0.7/llvm/lib/Transforms/IPO/
H A DSampleProfile.cpp617 uint64_t Samples = R.get() * Probe->Factor; in getProbeWeight()
626 Remark << ore::NV("Factor", Probe->Factor); in getProbeWeight()
635 << format("%0.2f", Probe->Factor) << ")\n"); in getProbeWeight()
1254 setProbeDistributionFactor(*I, Probe->Factor * in tryInlineCandidate()
1277 float Factor = 1.0; in getInlineCandidate() local
1279 Factor = Probe->Factor; in getInlineCandidate()
1282 CalleeSamples ? CalleeSamples->getHeadSamplesEstimate() * Factor : 0; in getInlineCandidate()
1283 *NewCandidate = {CB, CalleeSamples, CallsiteCount, Factor}; in getInlineCandidate()
1604 if (Probe->Factor < 1) in generateMDProfMetadata()
1605 T = SampleRecord::adjustCallTargets(T.get(), Probe->Factor); in generateMDProfMetadata()
/llvm-project-15.0.7/llvm/lib/Target/ARM/
H A DMVETailPredication.cpp369 ConstantInt *Factor = ConstantInt::get(cast<IntegerType>(Ty), VectorWidth); in InsertVCTPIntrinsic() local
386 Value *Remaining = Builder.CreateSub(Processed, Factor); in InsertVCTPIntrinsic()

1234