Lines Matching +full:max +full:- +full:counts

1 //=-- ProfilesummaryBuilder.cpp - Profile summary computation ---------------=//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
11 //===----------------------------------------------------------------------===//
23     "profile-summary-contextless", cl::Hidden,
28 // by 10000). If the counts are sorted in descending order, the minimum count to
34     "profile-summary-cutoff-hot", cl::Hidden, cl::init(990000),
36              " reach this percentile of total counts."));
39     "profile-summary-cutoff-cold", cl::Hidden, cl::init(999999),
41              " to reach this percentile of total counts."));
44     "profile-summary-huge-working-set-size-threshold", cl::Hidden,
47              " blocks required to reach the -profile-summary-cutoff-hot"
51     "profile-summary-large-working-set-size-threshold", cl::Hidden,
54              " blocks required to reach the -profile-summary-cutoff-hot"
57 // The next two options override the counts derived from summary computation and
60     "profile-summary-hot-count", cl::ReallyHidden,
62              " profile-summary-cutoff-hot"));
65     "profile-summary-cold-count", cl::ReallyHidden,
67              " profile-summary-cutoff-cold"));
71 // (which is 1000000) is a desired percentile of total counts.
102   addEntryCount(R.Counts[0]);
103   for (size_t I = 1, E = R.Counts.size(); I < E; ++I)
104     addInternalCount(R.Counts[I]);
153       Count = Iter->first;
154       uint32_t Freq = Iter->second;
199   // For CSSPGO, context-sensitive profile effectively split a function profile
202   // more function profiles each with lower counts, which in turn leads to lower
228          "Count value should be less than the max count value.");
237          "Count value should be less than the max count value.");