Home
last modified time | relevance | path

Searched refs:Counts (Results 1 – 25 of 47) sorted by relevance

12

/llvm-project-15.0.7/llvm/unittests/ProfileData/
H A DInstrProfTest.cpp86 ASSERT_EQ(1U, I->Counts[0]); in TEST_P()
87 ASSERT_EQ(2U, I->Counts[1]); in TEST_P()
88 ASSERT_EQ(3U, I->Counts[2]); in TEST_P()
89 ASSERT_EQ(4U, I->Counts[3]); in TEST_P()
102 ASSERT_EQ(1U, R->Counts[0]); in TEST_P()
103 ASSERT_EQ(2U, R->Counts[1]); in TEST_P()
108 ASSERT_EQ(3U, R->Counts[0]); in TEST_P()
128 ASSERT_EQ(1U, Counts[0]); in TEST_P()
129 ASSERT_EQ(2U, Counts[1]); in TEST_P()
134 ASSERT_EQ(3U, Counts[0]); in TEST_P()
[all …]
/llvm-project-15.0.7/llvm/lib/Transforms/Instrumentation/
H A DCGProfile.cpp26 MapVector<std::pair<Function *, Function *>, uint64_t> &Counts) { in addModuleFlags() argument
27 if (Counts.empty()) in addModuleFlags()
34 for (auto E : Counts) { in addModuleFlags()
50 MapVector<std::pair<Function *, Function *>, uint64_t> Counts; in runCGProfilePass() local
59 uint64_t &Count = Counts[std::make_pair(F, CalledF)]; in runCGProfilePass()
101 return addModuleFlags(M, Counts); in runCGProfilePass()
/llvm-project-15.0.7/bolt/lib/Core/
H A DBinaryFunctionProfile.cpp173 if (JT->Counts.empty()) in postProcessProfile()
174 JT->Counts.resize(JT->Entries.size()); in postProcessProfile()
183 assert(Delta < JT->Counts.size()); in postProcessProfile()
184 JT->Counts[Delta].Count += BranchInfo.Count; in postProcessProfile()
185 JT->Counts[Delta].Mispreds += BranchInfo.MispredictedCount; in postProcessProfile()
259 if (JTMergeI->second->Counts.empty()) in mergeProfileDataInto()
260 JTMergeI->second->Counts.resize(JTEntry.second->Counts.size()); in mergeProfileDataInto()
261 auto CountMergeI = JTMergeI->second->Counts.begin(); in mergeProfileDataInto()
262 for (const JumpTable::JumpInfo &JI : JTEntry.second->Counts) { in mergeProfileDataInto()
267 assert(CountMergeI == JTMergeI->second->Counts.end()); in mergeProfileDataInto()
H A DJumpTable.cpp123 if (!Counts.empty()) { in print()
124 OS << " : " << Counts[Offset / EntrySize].Mispreds << "/" in print()
125 << Counts[Offset / EntrySize].Count; in print()
/llvm-project-15.0.7/llvm/lib/Support/
H A DTrigramIndex.cpp73 Index[Tri].push_back(Counts.size()); in insert()
83 Counts.push_back(Cnt); in insert()
89 std::vector<unsigned> CurCounts(Counts.size()); in isDefinitelyOut()
102 if (CurCounts[J] >= Counts[J]) in isDefinitelyOut()
/llvm-project-15.0.7/llvm/lib/Transforms/IPO/
H A DSyntheticCountsPropagation.cpp95 DenseMap<Function *, Scaled64> Counts; in run() local
98 M, [&](Function *F, uint64_t Count) { Counts[F] = Scaled64(Count, 0); }); in run()
117 BBCount *= Counts[Caller]; in run()
129 Counts[F] += New; in run()
133 for (auto Entry : Counts) { in run()
/llvm-project-15.0.7/llvm/unittests/FuzzMutate/
H A DReservoirSamplerTest.cpp37 std::vector<int> Counts(Items.size(), 0); in TEST() local
44 Counts[Sampler.getSelection()] += 1; in TEST()
51 for (int Ys : Counts) in TEST()
/llvm-project-15.0.7/llvm/include/llvm/Support/
H A DTrailingObjects.h315 TrailingTys, size_t>::type... Counts) { in additionalSizeToAlloc()
316 return ParentType::additionalSizeToAllocImpl(0, Counts...); in additionalSizeToAlloc()
327 TrailingTys, size_t>::type... Counts) { in totalSizeToAlloc()
328 return sizeof(BaseTy) + ParentType::additionalSizeToAllocImpl(0, Counts...); in totalSizeToAlloc()
353 template <size_t... Counts> struct with_counts {
354 enum { Size = totalSizeToAlloc<Tys...>(Counts...) };
H A DTrigramIndex.h56 std::vector<unsigned> Counts; variable
/llvm-project-15.0.7/bolt/lib/Profile/
H A DHeatmap.cpp229 std::vector<uint64_t> Counts; in printCDF() local
232 Counts.push_back(KV.second); in printCDF()
236 llvm::sort(Counts, std::greater<uint64_t>()); in printCDF()
245 for (uint64_t I = 0; I < Counts.size(); I++) { in printCDF()
246 RunningCount += Counts[I]; in printCDF()
252 Counts.clear(); in printCDF()
/llvm-project-15.0.7/llvm/lib/ProfileData/
H A DInstrProf.cpp537 Sum.NumEntries += Counts.size(); in accumulateCounts()
538 for (uint64_t Count : Counts) in accumulateCounts()
610 bool Mismatch = (Counts.size() != Other.Counts.size()); in overlap()
635 for (size_t I = 0, E = Other.Counts.size(); I < E; ++I) { in overlap()
636 Score += OverlapStats::score(Counts[I], Other.Counts[I], in overlap()
638 MaxCount = std::max(Other.Counts[I], MaxCount); in overlap()
646 FuncScore += OverlapStats::score(Counts[I], Other.Counts[I], in overlap()
712 if (Counts.size() != Other.Counts.size()) { in merge()
719 Counts[I] = in merge()
720 SaturatingMultiplyAdd(Other.Counts[I], Weight, Counts[I], &Overflowed); in merge()
[all …]
H A DInstrProfReader.cpp299 Record.Counts.reserve(NumCounters); in readNextRecord()
306 Record.Counts.push_back(Count); in readNextRecord()
500 Record.Counts.clear(); in readRawCounts()
501 Record.Counts.reserve(NumCounters); in readRawCounts()
507 Record.Counts.push_back(*Ptr == 0 ? 1 : 0); in readRawCounts()
510 Record.Counts.push_back(swap(*CounterValue)); in readRawCounts()
1041 auto getFuncSum = [](const std::vector<uint64_t> &Counts) { in getInstrProfRecord() argument
1043 for (unsigned I = 0, S = Counts.size(); I < S; I++) { in getInstrProfRecord()
1044 uint64_t CountValue = Counts[I]; in getInstrProfRecord()
1064 FuncSum = std::max(FuncSum, getFuncSum(I.Counts)); in getInstrProfRecord()
[all …]
H A DProfileSummaryBuilder.cpp96 addEntryCount(R.Counts[0]); in addRecord()
97 for (size_t I = 1, E = R.Counts.size(); I < E; ++I) in addRecord()
98 addInternalCount(R.Counts[I]); in addRecord()
H A DInstrProfWriter.cpp131 M += ProfRecord.Counts.size() * sizeof(uint64_t); in EmitKeyDataLength()
157 LE.write<uint64_t>(ProfRecord.Counts.size()); in EmitData()
158 for (uint64_t I : ProfRecord.Counts) in EmitData()
308 if (llvm::any_of(IPR.Counts, [](uint64_t Count) { return Count > 0; })) in shouldEncodeData()
552 OS << "# Num Counters:\n" << Func.Counts.size() << "\n"; in writeRecordInText()
554 for (uint64_t Count : Func.Counts) in writeRecordInText()
/llvm-project-15.0.7/bolt/lib/Passes/
H A DBinaryFunctionCallGraph.cpp174 CallInfoTy Counts; in buildCallGraph() local
183 Counts.emplace_back(CSI.Symbol, CSI.Count); in buildCallGraph()
186 Counts.emplace_back(DstSym, Count); in buildCallGraph()
189 return Counts; in buildCallGraph()
H A DReorderData.cpp179 StringMap<uint64_t> Counts; in assignMemData() local
201 Counts[BD->getSectionName()] += AccessInfo.Count; in assignMemData()
205 Counts["Heap/stack"] += AccessInfo.Count; in assignMemData()
213 if (!Counts.empty()) { in assignMemData()
215 for (StringMapEntry<uint64_t> &Entry : Counts) { in assignMemData()
H A DAsmDump.cpp64 const uint64_t Mispreds = JT->Counts[i].Mispreds; in dumpJumpTableFdata()
65 const uint64_t Count = JT->Counts[i].Count; in dumpJumpTableFdata()
/llvm-project-15.0.7/llvm/include/llvm/ProfileData/
H A DInstrProf.h726 std::vector<uint64_t> Counts; member
729 InstrProfRecord(std::vector<uint64_t> Counts) : Counts(std::move(Counts)) {} in InstrProfRecord()
732 : Counts(RHS.Counts), in InstrProfRecord()
738 Counts = RHS.Counts;
803 Counts.clear(); in Clear()
891 std::vector<uint64_t> Counts) in NamedInstrProfRecord()
892 : InstrProfRecord(std::move(Counts)), Name(Name), Hash(Hash) {} in NamedInstrProfRecord()
/llvm-project-15.0.7/llvm/lib/Target/AArch64/
H A DAArch64ExpandImm.cpp47 CountMap Counts; in tryToreplicateChunks() local
51 ++Counts[getChunk(UImm, Idx)]; in tryToreplicateChunks()
54 for (const auto &Chunk : Counts) { in tryToreplicateChunks()
/llvm-project-15.0.7/llvm/tools/llvm-profdata/
H A Dllvm-profdata.cpp472 uint64_t CntNum = Record->Counts.size(); in InstrProfileEntry()
475 MaxCount = std::max(MaxCount, Record->Counts[I]); in InstrProfileEntry()
476 ZeroCntNum += !Record->Counts[I]; in InstrProfileEntry()
497 for (size_t I = 0; I < ProfRecord->Counts.size(); ++I) in updateInstrProfileEntry()
498 ProfRecord->Counts[I] = -1; in updateInstrProfileEntry()
2210 for (size_t I = 0, E = Func.Counts.size(); I < E; ++I) { in showInstrProfile()
2211 if (Func.Counts[I] == (uint64_t)-1) in showInstrProfile()
2213 FuncMax = std::max(FuncMax, Func.Counts[I]); in showInstrProfile()
2214 FuncSum += Func.Counts[I]; in showInstrProfile()
2245 << " Counters: " << Func.Counts.size() << "\n"; in showInstrProfile()
[all …]
/llvm-project-15.0.7/bolt/include/bolt/Core/
H A DJumpTable.h84 std::vector<JumpInfo> Counts; variable
/llvm-project-15.0.7/llvm/lib/ProfileData/Coverage/
H A DCoverageMapping.cpp246 std::vector<uint64_t> Counts; in loadFunctionRecord() local
248 Record.FunctionHash, Counts)) { in loadFunctionRecord()
256 Counts.assign(getMaxCounterID(Ctx, Record) + 1, 0); in loadFunctionRecord()
258 Ctx.setCounts(Counts); in loadFunctionRecord()
268 Record.MappingRegions[0].Count.isZero() && Counts[0] > 0) in loadFunctionRecord()
/llvm-project-15.0.7/llvm/unittests/Support/
H A DVirtualFileSystemTest.cpp585 int Counts[4] = {0, 0, 0, 0}; in TEST() local
591 Counts[Index]++; in TEST()
593 EXPECT_EQ(1, Counts[0]); // a in TEST()
594 EXPECT_EQ(1, Counts[1]); // b in TEST()
595 EXPECT_EQ(1, Counts[2]); // c in TEST()
596 EXPECT_EQ(1, Counts[3]); // d in TEST()
669 Counts[Index]++; in TEST()
671 EXPECT_EQ(1, Counts[0]); // a in TEST()
672 EXPECT_EQ(0, Counts[1]); // b in TEST()
673 EXPECT_EQ(1, Counts[2]); // c in TEST()
[all …]
/llvm-project-15.0.7/llvm/docs/AMDGPU/
H A Dgfx1030_waitcnt.rst13 Counts of outstanding instructions to wait for.
H A Dgfx7_waitcnt.rst13 Counts of outstanding instructions to wait for.

12