HomeSort by relevance Sort by last modified time
    Searched refs:kNumEntries (Results 1 - 6 of 6) sorted by null

  /external/chromium/net/disk_cache/
block_files_unittest.cc 89 const int kNumEntries = 2000;
90 CacheAddr entries[kNumEntries];
94 for (int i = 0; i < kNumEntries; i++) {
101 for (int i = 0; i < kNumEntries; i++) {
102 int source1 = rand() % kNumEntries;
103 int source2 = rand() % kNumEntries;
109 for (int i = 0; i < kNumEntries / 2; i++) {
114 // At this point, there are kNumEntries / 2 entries on the file, randomly
117 Addr address(entries[kNumEntries / 2]);
disk_cache_perftest.cc 230 const int kNumEntries = 60000;
231 disk_cache::Addr* address = new disk_cache::Addr[kNumEntries];
236 for (int i = 0; i < kNumEntries; i++) {
245 int entry = rand() * (kNumEntries / RAND_MAX + 1);
246 if (entry >= kNumEntries)
stress_cache.cc 124 const int kNumEntries = 30;
126 disk_cache::Entry* entries[kNumEntries] = {0};
137 int slot = rand() % kNumEntries;
backend_unittest.cc 668 const int kNumEntries = 100;
669 disk_cache::Entry* entries[kNumEntries];
670 for (int i = 0; i < kNumEntries; i++) {
674 EXPECT_EQ(kNumEntries, cache_->GetEntryCount());
676 for (int i = 0; i < kNumEntries; i++) {
677 int source1 = rand() % kNumEntries;
678 int source2 = rand() % kNumEntries;
684 std::string keys[kNumEntries];
685 for (int i = 0; i < kNumEntries; i++) {
687 if (i < kNumEntries / 2
    [all...]
  /external/chromium/base/allocator/
allocator_unittests.cc 433 const int kNumEntries = 1 << 14;
434 int** p = reinterpret_cast<int**>(malloc(sizeof(*p) * kNumEntries));
436 for (int i = 0; i < kNumEntries; i++) {
441 for (int i = 0; i < kNumEntries; i++) {
444 for (int i = 0; i < kNumEntries; i++) {
448 EXPECT_EQ(kNumEntries/2 * (kNumEntries - 1), sum); // assume kNE is even
  /frameworks/av/media/libstagefright/
StagefrightMediaScanner.cpp 190 static const size_t kNumEntries = sizeof(kKeyMap) / sizeof(kKeyMap[0]);
192 for (size_t i = 0; i < kNumEntries; ++i) {

Completed in 135 milliseconds