Home
last modified time | relevance | path

Searched refs:kNumEntries (Results 1 – 14 of 14) sorted by relevance

/external/chromium_org/third_party/tcmalloc/chromium/src/tests/
Drealloc_unittest.cc105 const int kNumEntries = 1 << 14; in main() local
106 int** p = (int**)malloc(sizeof(*p) * kNumEntries); in main()
108 for (int i = 0; i < kNumEntries; i++) { in main()
112 for (int i = 0; i < kNumEntries; i++) { in main()
115 for (int i = 0; i < kNumEntries; i++) { in main()
119 CHECK_EQ(kNumEntries/2 * (kNumEntries - 1), sum); // assume kNE is even in main()
/external/chromium_org/third_party/tcmalloc/vendor/src/tests/
Drealloc_unittest.cc105 const int kNumEntries = 1 << 14; in main() local
106 int** p = (int**)malloc(sizeof(*p) * kNumEntries); in main()
108 for (int i = 0; i < kNumEntries; i++) { in main()
112 for (int i = 0; i < kNumEntries; i++) { in main()
115 for (int i = 0; i < kNumEntries; i++) { in main()
119 CHECK_EQ(kNumEntries/2 * (kNumEntries - 1), sum); // assume kNE is even in main()
/external/chromium_org/third_party/skia/tests/
DRandomTest.cpp107 const int kNumEntries = kN >> 5; // dividing by 32 in test_single_gorilla() local
108 unsigned int entries[kNumEntries]; in test_single_gorilla()
111 memset(entries, 0, sizeof(unsigned int)*kNumEntries); in test_single_gorilla()
126 int index = value & (kNumEntries-1); in test_single_gorilla()
127 SkASSERT(index < kNumEntries); in test_single_gorilla()
134 for (int i = 0; i < kNumEntries; ++i) { in test_single_gorilla()
/external/skia/tests/
DRandomTest.cpp107 const int kNumEntries = kN >> 5; // dividing by 32 in test_single_gorilla() local
108 unsigned int entries[kNumEntries]; in test_single_gorilla()
111 memset(entries, 0, sizeof(unsigned int)*kNumEntries); in test_single_gorilla()
126 int index = value & (kNumEntries-1); in test_single_gorilla()
127 SkASSERT(index < kNumEntries); in test_single_gorilla()
134 for (int i = 0; i < kNumEntries; ++i) { in test_single_gorilla()
/external/chromium_org/net/disk_cache/blockfile/
Dblock_files_unittest.cc88 const int kNumEntries = 2000; in TEST_F() local
89 CacheAddr entries[kNumEntries]; in TEST_F()
93 for (int i = 0; i < kNumEntries; i++) { in TEST_F()
100 for (int i = 0; i < kNumEntries; i++) { in TEST_F()
101 int source1 = rand() % kNumEntries; in TEST_F()
102 int source2 = rand() % kNumEntries; in TEST_F()
108 for (int i = 0; i < kNumEntries / 2; i++) { in TEST_F()
116 Addr address(entries[kNumEntries / 2]); in TEST_F()
Ddisk_cache_perftest.cc235 const int kNumEntries = 60000; in TEST_F() local
236 disk_cache::Addr* address = new disk_cache::Addr[kNumEntries]; in TEST_F()
241 for (int i = 0; i < kNumEntries; i++) { in TEST_F()
250 int entry = rand() * (kNumEntries / RAND_MAX + 1); in TEST_F()
251 if (entry >= kNumEntries) in TEST_F()
Dstress_cache.cc143 const int kNumEntries = 30; in StressTheCache() local
145 disk_cache::Entry* entries[kNumEntries] = {0}; in StressTheCache()
156 int slot = rand() % kNumEntries; in StressTheCache()
/external/chromium_org/base/allocator/
Dallocator_unittest.cc442 const int kNumEntries = 1 << 14; in TEST() local
443 int** p = reinterpret_cast<int**>(malloc(sizeof(*p) * kNumEntries)); in TEST()
445 for (int i = 0; i < kNumEntries; i++) { in TEST()
450 for (int i = 0; i < kNumEntries; i++) { in TEST()
453 for (int i = 0; i < kNumEntries; i++) { in TEST()
457 EXPECT_EQ(kNumEntries/2 * (kNumEntries - 1), sum); // assume kNE is even in TEST()
/external/chromium_org/net/socket/
Dssl_session_cache_openssl_unittest.cc338 const size_t kNumEntries = 20; in TEST_F() local
346 for (size_t n = 0; n < kNumEntries - 1U; ++n) { in TEST_F()
355 EXPECT_EQ(kNumEntries - 1U, cache_.size()); in TEST_F()
362 EXPECT_EQ(kNumEntries, cache_.size()); in TEST_F()
369 EXPECT_EQ(kNumEntries, cache_.size()); in TEST_F()
/external/chromium_org/net/disk_cache/
Dbackend_unittest.cc240 const int kNumEntries = 10; in CreateSetOfRandomEntries() local
242 for (int i = 0; i < kNumEntries; ++i) { in CreateSetOfRandomEntries()
1050 const int kNumEntries = 100; in BackendInvalidEntryWithLoad() local
1051 disk_cache::Entry* entries[kNumEntries]; in BackendInvalidEntryWithLoad()
1052 for (int i = 0; i < kNumEntries; i++) { in BackendInvalidEntryWithLoad()
1056 EXPECT_EQ(kNumEntries, cache_->GetEntryCount()); in BackendInvalidEntryWithLoad()
1058 for (int i = 0; i < kNumEntries; i++) { in BackendInvalidEntryWithLoad()
1059 int source1 = rand() % kNumEntries; in BackendInvalidEntryWithLoad()
1060 int source2 = rand() % kNumEntries; in BackendInvalidEntryWithLoad()
1066 std::string keys[kNumEntries]; in BackendInvalidEntryWithLoad()
[all …]
/external/chromium_org/gpu/command_buffer/service/
Dcmd_parser_test.cc213 const unsigned int kNumEntries = 5; in TEST_F() local
214 scoped_ptr<CommandParser> parser(MakeParser(kNumEntries)); in TEST_F()
219 EXPECT_FALSE(parser->set_get(kNumEntries)); in TEST_F()
/external/chromium_org/third_party/leveldatabase/
Denv_chromium.cc165 case kNumEntries: in MethodIDToString()
710 return base::LinearHistogram::FactoryGet(uma_name, 1, kNumEntries, in GetMethodIOErrorHistogram()
711 kNumEntries + 1, base::Histogram::kUmaTargetedHistogramFlag); in GetMethodIOErrorHistogram()
758 return base::LinearHistogram::FactoryGet(uma_name, 1, kNumEntries, in GetRecoveredFromErrorHistogram()
759 kNumEntries + 1, base::Histogram::kUmaTargetedHistogramFlag); in GetRecoveredFromErrorHistogram()
Denv_chromium.h45 kNumEntries enumerator
/external/chromium_org/content/browser/indexed_db/leveldb/
Dleveldb_database.cc194 leveldb_env::kNumEntries, in ParseAndHistogramIOErrorDetails()
195 leveldb_env::kNumEntries + 1, in ParseAndHistogramIOErrorDetails()