Searched defs:kNumEntries (Results 1 - 5 of 5) sorted by relevance

/external/chromium/net/disk_cache/
H A Ddisk_cache_perftest.cc230 const int kNumEntries = 60000; local
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)
H A Dblock_files_unittest.cc89 const int kNumEntries = 2000; local
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]);
H A Dstress_cache.cc124 const int kNumEntries = 30; local
126 disk_cache::Entry* entries[kNumEntries] = {0};
137 int slot = rand() % kNumEntries;
H A Dbackend_unittest.cc668 const int kNumEntries = 100; local
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 /
843 const int kNumEntries = 100; local
1028 const int kNumEntries = 10; local
[all...]
/external/chromium/base/allocator/
H A Dallocator_unittests.cc433 const int kNumEntries = 1 << 14; local
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

Completed in 400 milliseconds