Home
last modified time | relevance | path

Searched refs:TotalCount (Results 1 – 25 of 35) sorted by relevance

12

/external/llvm/lib/Analysis/
DIndirectCallPromotionAnalysis.cpp62 uint64_t TotalCount) { in isPromotionProfitable() argument
66 unsigned Percentage = (Count * 100) / TotalCount; in isPromotionProfitable()
74 const Instruction *Inst, uint32_t NumVals, uint64_t TotalCount) { in getProfitablePromotionCandidates() argument
83 assert(Count <= TotalCount); in getProfitablePromotionCandidates()
87 if (!isPromotionProfitable(Count, TotalCount)) { in getProfitablePromotionCandidates()
91 TotalCount -= Count; in getProfitablePromotionCandidates()
98 const Instruction *I, uint32_t &NumVals, uint64_t &TotalCount, in getPromotionCandidatesForInstruction() argument
102 ValueDataArray.get(), NumVals, TotalCount); in getPromotionCandidatesForInstruction()
107 NumCandidates = getProfitablePromotionCandidates(I, NumVals, TotalCount); in getPromotionCandidatesForInstruction()
/external/libchrome/base/metrics/
Dpersistent_sample_map_unittest.cc44 EXPECT_EQ(100, samples.TotalCount()); in TEST()
45 EXPECT_EQ(samples.redundant_count(), samples.TotalCount()); in TEST()
61 EXPECT_EQ(100, samples.TotalCount()); in TEST()
62 EXPECT_EQ(samples.redundant_count(), samples.TotalCount()); in TEST()
88 EXPECT_EQ(900, samples1.TotalCount()); in TEST()
89 EXPECT_EQ(samples1.redundant_count(), samples1.TotalCount()); in TEST()
97 EXPECT_EQ(300, samples1.TotalCount()); in TEST()
98 EXPECT_EQ(samples1.redundant_count(), samples1.TotalCount()); in TEST()
114 EXPECT_EQ(101, samples1.TotalCount()); in TEST()
115 EXPECT_EQ(samples1.redundant_count(), samples1.TotalCount()); in TEST()
[all …]
Dsample_vector_unittest.cc38 EXPECT_EQ(samples.TotalCount(), samples.redundant_count()); in TEST()
45 EXPECT_EQ(samples.TotalCount(), samples.redundant_count()); in TEST()
65 EXPECT_EQ(samples.TotalCount(), samples.redundant_count()); in TEST()
72 EXPECT_EQ(samples.TotalCount(), samples.redundant_count()); in TEST()
89 EXPECT_EQ(300, samples1.TotalCount()); in TEST()
90 EXPECT_EQ(samples1.redundant_count(), samples1.TotalCount()); in TEST()
97 EXPECT_EQ(600, samples2.TotalCount()); in TEST()
98 EXPECT_EQ(samples2.redundant_count(), samples2.TotalCount()); in TEST()
106 EXPECT_EQ(900, samples1.TotalCount()); in TEST()
107 EXPECT_EQ(samples1.redundant_count(), samples1.TotalCount()); in TEST()
[all …]
Dsample_map_unittest.cc25 EXPECT_EQ(100, samples.TotalCount()); in TEST()
26 EXPECT_EQ(samples.redundant_count(), samples.TotalCount()); in TEST()
39 EXPECT_EQ(100, samples.TotalCount()); in TEST()
40 EXPECT_EQ(samples.redundant_count(), samples.TotalCount()); in TEST()
61 EXPECT_EQ(900, samples1.TotalCount()); in TEST()
62 EXPECT_EQ(samples1.redundant_count(), samples1.TotalCount()); in TEST()
70 EXPECT_EQ(300, samples1.TotalCount()); in TEST()
71 EXPECT_EQ(samples1.redundant_count(), samples1.TotalCount()); in TEST()
Dsparse_histogram_unittest.cc97 EXPECT_EQ(0, snapshot->TotalCount()); in TEST_P()
102 EXPECT_EQ(1, snapshot1->TotalCount()); in TEST_P()
108 EXPECT_EQ(3, snapshot2->TotalCount()); in TEST_P()
116 EXPECT_EQ(0, snapshot->TotalCount()); in TEST_P()
121 EXPECT_EQ(15, snapshot1->TotalCount()); in TEST_P()
127 EXPECT_EQ(55, snapshot2->TotalCount()); in TEST_P()
135 EXPECT_EQ(0, snapshot->TotalCount()); in TEST_P()
140 EXPECT_EQ(15, snapshot1->TotalCount()); in TEST_P()
146 EXPECT_EQ(55, snapshot2->TotalCount()); in TEST_P()
173 EXPECT_EQ(3, samples->TotalCount()); in TEST_P()
Dpersistent_histogram_allocator_unittest.cc231 EXPECT_EQ(found->SnapshotSamples()->TotalCount(), snapshot->TotalCount()); in TEST_F()
240 EXPECT_EQ(found->SnapshotSamples()->TotalCount(), snapshot->TotalCount()); in TEST_F()
268 EXPECT_EQ(found->SnapshotSamples()->TotalCount(), snapshot->TotalCount()); in TEST_F()
276 EXPECT_EQ(found->SnapshotSamples()->TotalCount(), snapshot->TotalCount()); in TEST_F()
Dhistogram_unittest.cc147 EXPECT_EQ(2, samples->TotalCount()); in TEST_P()
161 EXPECT_EQ(3, samples->TotalCount()); in TEST_P()
165 EXPECT_EQ(samples->TotalCount(), samples->redundant_count()); in TEST_P()
168 EXPECT_EQ(0, samples->TotalCount()); in TEST_P()
173 EXPECT_EQ(2, samples->TotalCount()); in TEST_P()
177 EXPECT_EQ(0, samples->TotalCount()); in TEST_P()
190 EXPECT_EQ(3, samples->TotalCount()); in TEST_P()
194 EXPECT_EQ(samples->TotalCount(), samples->redundant_count()); in TEST_P()
200 EXPECT_EQ(2, samples->TotalCount()); in TEST_P()
203 EXPECT_EQ(samples->TotalCount(), samples->redundant_count()); in TEST_P()
[all …]
Dhistogram_snapshot_manager.cc92 if (samples->TotalCount() > 0) in PrepareSamples()
100 logged_samples->TotalCount() - logged_samples->redundant_count(); in InspectLoggedSamplesInconsistency()
Dsample_map.h35 HistogramBase::Count TotalCount() const override;
Dpersistent_sample_map.h44 HistogramBase::Count TotalCount() const override;
Dsample_vector.h42 HistogramBase::Count TotalCount() const override;
Dhistogram_samples.h85 virtual HistogramBase::Count TotalCount() const = 0;
Dhistogram_delta_serialization.cc93 DCHECK_NE(0, snapshot.TotalCount()); in RecordDelta()
/external/llvm/lib/Transforms/Instrumentation/
DIndirectCallPromotion.cpp166 uint64_t TotalCount, uint32_t NumCandidates);
179 uint64_t TotalCount);
185 uint64_t &TotalCount);
259 uint64_t TotalCount, uint32_t NumCandidates) { in getPromotionCandidatesForCallSite() argument
273 assert(Count <= TotalCount); in getPromotionCandidatesForCallSite()
304 TotalCount -= Count; in getPromotionCandidatesForCallSite()
312 uint64_t Count, uint64_t TotalCount, in createIfThenElse() argument
327 uint64_t ElseCount = TotalCount - Count; in createIfThenElse()
528 uint64_t Count, uint64_t TotalCount) { in promote() argument
537 createIfThenElse(Inst, DirectCallee, Count, TotalCount, &DirectCallBB, in promote()
[all …]
/external/llvm/include/llvm/IR/
DProfileSummary.h55 uint64_t TotalCount, MaxCount, MaxInternalCount, MaxFunctionCount; variable
63 uint64_t TotalCount, uint64_t MaxCount, in ProfileSummary() argument
67 TotalCount(TotalCount), MaxCount(MaxCount), in ProfileSummary()
79 uint64_t getTotalCount() { return TotalCount; } in getTotalCount()
/external/llvm/include/llvm/Analysis/
DIndirectCallPromotionAnalysis.h33 bool isPromotionProfitable(uint64_t Count, uint64_t TotalCount);
39 uint64_t TotalCount);
61 uint64_t &TotalCount,
/external/llvm/lib/ProfileData/
DProfileSummaryBuilder.cpp71 APInt Temp(128, TotalCount); in computeDetailedSummary()
77 assert(DesiredCount <= TotalCount); in computeDetailedSummary()
94 ProfileSummary::PSK_Sample, DetailedSummary, TotalCount, MaxCount, 0, in getSummary()
101 ProfileSummary::PSK_Instr, DetailedSummary, TotalCount, MaxCount, in getSummary()
/external/llvm/include/llvm/ProfileData/
DProfileCommon.h57 : DetailedSummaryCutoffs(std::move(Cutoffs)), TotalCount(0), MaxCount(0), in ProfileSummaryBuilder()
62 uint64_t TotalCount, MaxCount, MaxFunctionCount; variable
93 TotalCount += Count; in addCount()
DInstrProf.h700 uint64_t &TotalCount = (TotalC == 0 ? Dummy : *TotalC); in getValueForSite() local
703 TotalCount = 0; in getValueForSite()
708 TotalCount = getValueForSite(VD.get(), ValueKind, Site); in getValueForSite()
717 uint64_t TotalCount = 0; in getValueForSite() local
721 TotalCount = SaturatingAdd(TotalCount, V.Count); in getValueForSite()
724 return TotalCount; in getValueForSite()
/external/compiler-rt/lib/esan/
Dcache_frag.cpp58 u64 TotalCount; // The total access count of all structs. member
65 Ctx->TotalCount); in reportStructSummary()
125 Ctx->TotalCount += Handle->Count; in computeStructRatio()
/external/llvm/lib/IR/
DProfileSummary.cpp166 uint64_t NumCounts, TotalCount, NumFunctions, MaxFunctionCount, MaxCount, in getFromMD() local
169 TotalCount)) in getFromMD()
188 return new ProfileSummary(SummaryKind, Summary, TotalCount, MaxCount, in getFromMD()
/external/llvm/test/Analysis/ProfileSummary/
Dbasic.ll29 !4 = !{!"TotalCount", i64 10000}
/external/tensorflow/tensorflow/core/graph/
Dcostmodel.cc174 int32 CostModel::TotalCount(const Node* node) const { in TotalCount() function in tensorflow::CostModel
204 int32 count = TotalCount(node); in SizeEstimate()
206 return TotalBytes(node, slot) / std::max(1, TotalCount(node)); in SizeEstimate()
228 int32 count = TotalCount(node); in TimeEstimate()
/external/llvm/test/Transforms/Inline/
Dinline-cold-callee.ll42 !4 = !{!"TotalCount", i64 10000}
Dinline-hot-callee.ll42 !4 = !{!"TotalCount", i64 10000}

12