| /external/llvm/tools/llvm-prof/ |
| llvm-prof.cpp | 115 OS << "\t;;; Out-edge counts:";
159 std::vector<std::pair<BasicBlock*, double> > Counts;
167 Counts.push_back(std::make_pair(BB, w));
211 for (unsigned i = 0, e = Counts.size(); i != e; ++i)
212 TotalExecutions += Counts[i].second;
215 sort(Counts.begin(), Counts.end(),
223 unsigned BlocksToPrint = Counts.size();
226 if (Counts[i].second == 0) break;
227 Function *F = Counts[i].first->getParent()
[all...] |
| /external/chromium_org/base/metrics/ |
| histogram.h | 376 typedef std::vector<Count> Counts;
416 // Check to see if bucket ranges, counts and tallies in the snapshot are
|
| /external/llvm/lib/Target/R600/ |
| SIInsertWaits.cpp | 89 const Counters &Counts);
260 Counters Counts = WaitCounts;
276 Counts.Array[i] = std::min(Value, WaitCounts.Array[i]);
279 Counts.Array[i] = 0;
282 WaitedOn.Array[i] = LastIssued.Array[i] - Counts.Array[i];
289 if (Counts.Named.EXP == 0)
294 .addImm((Counts.Named.VM & 0xF) |
295 ((Counts.Named.EXP & 0x7) << 4) |
296 ((Counts.Named.LGKM & 0x7) << 8));
|
| /external/chromium/base/metrics/ |
| histogram.h | 274 typedef std::vector<Count> Counts;
338 Count counts(size_t i) const { return counts_[i]; } function in class:base::Histogram::SampleSet
353 Counts counts_;
365 // count to the sum of the counts in all buckets, and detect problems. Note
429 // Check to see if bucket ranges, counts and tallies in the snapshot are
|
| /external/valgrind/main/cachegrind/ |
| cg_merge.c | 212 ULong* counts; member in struct:__anon27667
214 Counts;
233 where innerMap is WordFM line-number=UWord Counts */
236 // Summary counts (computed whilst parsing)
238 Counts* summary;
271 static Counts* new_Counts ( Int n_counts, /*COPIED*/ULong* counts )
274 Counts* cts = malloc(sizeof(Counts));
279 cts->counts = malloc(n_counts * sizeof(ULong))
480 Counts* counts; local
[all...] |
