HomeSort by: relevance | last modified time | path
    Searched refs:Counts (Results 1 - 24 of 24) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
TrigramIndex.h 57 std::vector<unsigned> Counts;
59 // are used in Counts to store per-rule limits.
TrailingObjects.h 306 /// allocated with the given counts (The counts are in the same order
310 /// that it's clear what the counts are counting in callers.
315 TrailingTys, size_t>::type... Counts) {
316 return ParentType::additionalSizeToAllocImpl(0, Counts...);
320 /// given trailing object counts. This is the same as
327 TrailingTys, size_t>::type... Counts) {
328 return sizeof(BaseTy) + ParentType::additionalSizeToAllocImpl(0, Counts...);
339 /// trailing object counts. The template arguments are similar to those
353 template <size_t... Counts> struct with_counts
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Support/
TrigramIndex.cpp 72 Index[Tri].push_back(Counts.size());
82 Counts.push_back(Cnt);
88 std::vector<unsigned> CurCounts(Counts.size());
101 if (CurCounts[J] >= Counts[J])
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
SyntheticCountsPropagation.cpp 1 //=- SyntheticCountsPropagation.cpp - Propagate function counts --*- C++ -*-=//
9 // This file implements a transformation that synthesizes entry counts for
11 // counts. The presence of !prof metadata with counter name set to
15 // function entry counts in the PGO mode.
18 // counts of all functions and then doing a top-down traversal of the
19 // callgraph-scc to propagate the counts. For each function the set of callsites
22 // count. For non-trivial SCCs, the new counts are computed from the previous
23 // counts and updated in one shot.
45 #define DEBUG_TYPE "synthetic-counts-propagation"
64 // Assign initial synthetic entry counts to functions
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/
CGProfile.cpp 29 MapVector<std::pair<Function *, Function *>, uint64_t> &Counts) {
30 if (Counts.empty())
37 for (auto E : Counts) {
52 MapVector<std::pair<Function *, Function *>, uint64_t> Counts;
59 uint64_t &Count = Counts[std::make_pair(F, CalledF)];
101 return addModuleFlags(M, Counts);
PGOInstrumentation.cpp 12 // for program frequency counts. BIT Numerical Mathematics 1973, Volume 13,
15 // the entry and exit), the sum of incoming edge counts equals the sum of
16 // outgoing edge counts. The count of edge on spanning tree can be derived from
135 STATISTIC(NumOfPGOFunc, "Number of functions having valid profile counts.");
148 "Number of functions having valid profile counts in CSPGO.");
224 // Command line option to turn on CFG dot or text dump of raw profile counts
226 "pgo-view-raw-counts", cl::Hidden,
228 "with raw profile counts from "
230 "-pgo-view-counts. To limit graph "
268 cl::desc("Print out mismatched BFI counts after setting profile metadata
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/ProfileData/
InstrProf.cpp 505 Sum.NumEntries += Counts.size();
506 for (size_t F = 0, E = Counts.size(); F < E; ++F)
507 FuncSum += Counts[F];
578 bool Mismatch = (Counts.size() != Other.Counts.size());
596 // Compute overlap for value counts.
602 // Compute overlap for edge counts.
603 for (size_t I = 0, E = Other.Counts.size(); I < E; ++I) {
604 Score += OverlapStats::score(Counts[I], Other.Counts[I]
    [all...]
ProfileSummaryBuilder.cpp 31 // by 10000). If the counts are sorted in descending order, the minimum count to
39 " reach this percentile of total counts."));
44 " to reach this percentile of total counts."));
60 // The next two options override the counts derived from summary computation and
73 // (which is 1000000) is a desired percentile of total counts.
100 addEntryCount(R.Counts[0]);
101 for (size_t I = 1, E = R.Counts.size(); I < E; ++I)
102 addInternalCount(R.Counts[I]);
194 // more function profiles each with lower counts, which in turn leads to lower
InstrProfWriter.cpp 125 M += sizeof(uint64_t); // The size of the Counts vector
126 M += ProfRecord.Counts.size() * sizeof(uint64_t);
152 LE.write<uint64_t>(ProfRecord.Counts.size());
153 for (uint64_t I : ProfRecord.Counts)
265 if (llvm::any_of(IPR.Counts, [](uint64_t Count) { return Count > 0; }))
437 OS << "# Num Counters:\n" << Func.Counts.size() << "\n";
439 for (uint64_t Count : Func.Counts)
InstrProfReader.cpp 284 Record.Counts.reserve(NumCounters);
291 Record.Counts.push_back(Count);
442 Record.Counts.clear();
443 Record.Counts.reserve(RawCounts.size());
445 Record.Counts.push_back(swap(Count));
447 Record.Counts = RawCounts;
496 // Read raw counts and set Record.
897 std::vector<uint64_t> &Counts) {
902 Counts = Record.get().Counts;
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/
AArch64ExpandImm.cpp 47 CountMap Counts;
51 ++Counts[getChunk(UImm, Idx)];
54 for (CountMap::const_iterator Chunk = Counts.begin(), End = Counts.end();
  /src/external/apache2/llvm/dist/llvm/include/llvm/ProfileData/
InstrProf.h 679 /// Optionally scale merged counts by \p Weight.
682 /// Scale up value profile data counts by N (Numerator) / D (Denominator).
692 std::vector<uint64_t> Counts;
695 InstrProfRecord(std::vector<uint64_t> Counts) : Counts(std::move(Counts)) {}
698 : Counts(RHS.Counts),
704 Counts = RHS.Counts;
    [all...]
InstrProfReader.h 107 /// Compute the sum of counts and return in Sum.
506 /// Fill Counts with the profile data for the given function name.
508 std::vector<uint64_t> &Counts);
510 /// Return the maximum of all known function counts.
  /src/external/apache2/llvm/dist/llvm/tools/llvm-profdata/
llvm-profdata.cpp 412 uint64_t CntNum = Record->Counts.size();
415 MaxCount = std::max(MaxCount, Record->Counts[I]);
416 ZeroCntNum += !Record->Counts[I];
437 for (size_t I = 0; I < ProfRecord->Counts.size(); ++I)
438 ProfRecord->Counts[I] = -1;
985 OS << "Sum of edge counts for profile " << BaseFilename << " is 0.\n";
989 OS << "Sum of edge counts for profile " << TestFilename << " is 0.\n";
1197 /// max sample counts of each function in BaseStats and TestStats for later
1244 /// the sample count at i in test profile BT(i), the sum of sample counts
1245 /// in this function in base profile SB, and the sum of sample counts i
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/ProfileData/Coverage/
CoverageMapping.cpp 245 std::vector<uint64_t> Counts;
247 Record.FunctionHash, Counts)) {
255 Counts.assign(getMaxCounterID(Ctx, Record) + 1, 0);
257 Ctx.setCounts(Counts);
263 // the other TU will either be loaded (providing full region counts) or they
265 // when they have non-zero counts in the profile).
267 Record.MappingRegions[0].Count.isZero() && Counts[0] > 0)
582 /// Combine counts of regions which cover the same area.
601 // to accumulate counts only from CodeRegions, or else the area will be
608 // We add counts of the regions of the same kind as the active regio
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/ProfileData/Coverage/
CoverageMapping.h 329 void setCounts(ArrayRef<uint64_t> Counts) { CounterValues = Counts; }
352 /// Regions in the function along with their counts.
354 /// Branch Regions in the function along with their counts.
435 /// A sequence of CoverageSegments gives execution counts for a file in format
569 /// fill out execution counts.
  /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/
WebAssemblyISelLowering.cpp 354 "32-bit shift counts ought to be enough for anyone");
695 // which would be useful to reduce instruction counts when testing
1745 auto AddCount = [](auto &Counts, const auto &Val) {
1747 llvm::find_if(Counts, [&Val](auto E) { return E.first == Val; });
1748 if (CountIt == Counts.end()) {
1749 Counts.emplace_back(Val, 1);
1755 auto GetMostCommon = [](auto &Counts) {
1757 std::max_element(Counts.begin(), Counts.end(),
1759 assert(CommonIt != Counts.end() && "Unexpected all-undef build_vector")
    [all...]
  /src/external/lgpl3/gmp/dist/mpn/powerpc64/vmx/
popcount.asm 202 C Counts for vperm
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonConstExtenders.cpp 1374 CMap Counts;
1382 Counts.insert({*It, N});
1385 if (Counts.empty())
1389 auto BestIt = std::max_element(Counts.begin(), Counts.end(),
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LowerMatrixIntrinsics.cpp 1917 /// Calculate the number of exclusive and shared op counts for expression
1995 OpInfoTy Counts, SharedCounts;
1996 std::tie(Counts, SharedCounts) =
2003 Rem << ore::NV("NumStores", Counts.NumStores) << " stores, "
2004 << ore::NV("NumLoads", Counts.NumLoads) << " loads, "
2005 << ore::NV("NumComputeOps", Counts.NumComputeOps)
  /src/external/apache2/llvm/dist/clang/lib/CodeGen/
CodeGenPGO.cpp 360 /// A StmtVisitor that propagates the raw counts through the AST and
376 /// BreakContinueStack - Keep counts of breaks and continues inside loops.
499 // ...then go back and propagate counts through the condition. The count
557 // ...then go back and propagate counts through the condition.
593 // ...then go back and propagate counts through the condition.
627 // If the switch is inside a loop, add the continue counts.
638 // Counter for this particular case. This counts only jumps from the
1040 RegionCounts = ProfRecord->Counts;
CGOpenMPRuntime.cpp 7158 MapNonContiguousArrayTy Counts;
7182 NonContigInfo.Counts.append(CurInfo.NonContigInfo.Counts.begin(),
7183 CurInfo.NonContigInfo.Counts.end());
8204 CombinedInfo.NonContigInfo.Counts.push_back(CurCounts);
9249 CGF.EmitStoreOfScalar(NonContigInfo.Counts[L][RevIdx], CountLVal);
  /src/external/apache2/llvm/dist/llvm/lib/IR/
Verifier.cpp 2327 for (auto &Counts : FrameEscapeInfo) {
2328 Function *F = Counts.first;
2329 unsigned EscapedObjectCount = Counts.second.first;
2330 unsigned MaxRecoveredIndex = Counts.second.second;
3409 "cannot guarantee tail call due to mismatched parameter counts",
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/
searching.d 25 Counts elements that are equal to a specified value or satisfy a
610 The first version counts the number of elements `x` in `r` for
616 of the empty range in any range would be infinite. Overlapped counts
620 The third version counts the elements for which `pred(x)` is $(D
623 The fourth version counts the number of elements in a range. It is
755 Counts elements in the given

Completed in 82 milliseconds