HomeSort by relevance Sort by last modified time
    Searched defs:Counts (Results 1 - 9 of 9) sorted by null

  /external/libchrome/base/metrics/
histogram.h 104 typedef std::vector<Count> Counts;
154 // Check to see if bucket ranges, counts and tallies in the snapshot are
  /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/util/
TestBNF.java 133 static class Counts {
134 int[] counts; field in class:TestBNF.Counts
135 Counts(int max) {
136 counts = new int[max+1];
139 counts[index]++;
142 System.out.println("Printing Counts");
143 for (int i = 0; i < counts.length; ++i) {
144 if (counts[i] == 0) continue;
145 System.out.println(i + ": " + counts[i]);
200 Counts counts = new Counts(count + 10)
    [all...]
  /external/icu/icu4j/main/tests/translit/src/com/ibm/icu/dev/test/util/
TestBNF.java 132 static class Counts {
133 int[] counts; field in class:TestBNF.Counts
134 Counts(int max) {
135 counts = new int[max+1];
138 counts[index]++;
141 System.out.println("Printing Counts");
142 for (int i = 0; i < counts.length; ++i) {
143 if (counts[i] == 0) continue;
144 System.out.println(i + ": " + counts[i]);
199 Counts counts = new Counts(count + 10)
    [all...]
  /external/clang/unittests/Basic/
VirtualFileSystemTest.cpp 360 int Counts[4] = { 0, 0, 0, 0 };
365 Counts[Index]++;
367 EXPECT_EQ(1, Counts[0]); // a
368 EXPECT_EQ(1, Counts[1]); // b
369 EXPECT_EQ(1, Counts[2]); // c
370 EXPECT_EQ(1, Counts[3]); // d
    [all...]
  /external/llvm/lib/ProfileData/
CoverageMapping.cpp 189 std::vector<uint64_t> Counts;
193 Counts.clear();
195 Record.FunctionName, Record.FunctionHash, Counts)) {
201 Counts.assign(Record.MappingRegions.size(), 0);
203 Ctx.setCounts(Counts);
  /external/llvm/lib/Target/AMDGPU/
SIInsertWaits.cpp 104 const Counters &Counts);
341 Counters Counts = WaitCounts;
357 Counts.Array[i] = std::min(Value, WaitCounts.Array[i]);
360 Counts.Array[i] = 0;
363 WaitedOn.Array[i] = LastIssued.Array[i] - Counts.Array[i];
370 if (Counts.Named.EXP == 0)
375 .addImm((Counts.Named.VM & 0xF) |
376 ((Counts.Named.EXP & 0x7) << 4) |
377 ((Counts.Named.LGKM & 0x7) << 8));
  /external/llvm/unittests/ProfileData/
InstrProfTest.cpp 62 ASSERT_EQ(4U, I->Counts.size());
63 ASSERT_EQ(1U, I->Counts[0]);
64 ASSERT_EQ(2U, I->Counts[1]);
65 ASSERT_EQ(3U, I->Counts[2]);
66 ASSERT_EQ(4U, I->Counts[3]);
80 ASSERT_EQ(2U, R.get().Counts.size());
81 ASSERT_EQ(1U, R.get().Counts[0]);
82 ASSERT_EQ(2U, R.get().Counts[1]);
86 ASSERT_EQ(2U, R.get().Counts.size());
87 ASSERT_EQ(3U, R.get().Counts[0])
    [all...]
  /external/llvm/include/llvm/ProfileData/
InstrProf.h 318 /// Optionally scale merged counts by \p Weight.
326 InstrProfRecord(StringRef Name, uint64_t Hash, std::vector<uint64_t> Counts)
327 : Name(Name), Hash(Hash), Counts(std::move(Counts)) {}
330 std::vector<uint64_t> Counts;
359 /// Merge the counts in \p Other into this one.
360 /// Optionally scale merged counts by \p Weight.
394 // Scale merged value counts by \p Weight.
  /external/valgrind/cachegrind/
cg_merge.c 217 ULong* counts; member in struct:__anon24936
219 Counts;
238 where innerMap is WordFM line-number=UWord Counts */
241 // Summary counts (computed whilst parsing)
243 Counts* summary;
280 static Counts* new_Counts ( Int n_counts, /*COPIED*/ULong* counts )
283 Counts* cts = malloc(sizeof(Counts));
288 cts->counts = malloc(n_counts * sizeof(ULong))
492 Counts* counts; local
    [all...]

Completed in 468 milliseconds