OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:kNumEntries
(Results
1 - 19
of
19
) sorted by null
/external/chromium_org/third_party/tcmalloc/chromium/src/tests/
realloc_unittest.cc
105
const int
kNumEntries
= 1 << 14;
106
int** p = (int**)malloc(sizeof(*p) *
kNumEntries
);
108
for (int i = 0; i <
kNumEntries
; i++) {
112
for (int i = 0; i <
kNumEntries
; i++) {
115
for (int i = 0; i <
kNumEntries
; i++) {
119
CHECK_EQ(
kNumEntries
/2 * (
kNumEntries
- 1), sum); // assume kNE is even
/external/chromium_org/third_party/tcmalloc/vendor/src/tests/
realloc_unittest.cc
105
const int
kNumEntries
= 1 << 14;
106
int** p = (int**)malloc(sizeof(*p) *
kNumEntries
);
108
for (int i = 0; i <
kNumEntries
; i++) {
112
for (int i = 0; i <
kNumEntries
; i++) {
115
for (int i = 0; i <
kNumEntries
; i++) {
119
CHECK_EQ(
kNumEntries
/2 * (
kNumEntries
- 1), sum); // assume kNE is even
/external/skia/tests/
RandomTest.cpp
108
const int
kNumEntries
= kN >> 5; // dividing by 32
109
unsigned int entries[
kNumEntries
];
112
memset(entries, 0, sizeof(unsigned int)*
kNumEntries
);
127
int index = value & (
kNumEntries
-1);
128
SkASSERT(index <
kNumEntries
);
135
for (int i = 0; i <
kNumEntries
; ++i) {
/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_org/net/disk_cache/
block_files_unittest.cc
88
const int
kNumEntries
= 2000;
89
CacheAddr entries[
kNumEntries
];
93
for (int i = 0; i <
kNumEntries
; i++) {
100
for (int i = 0; i <
kNumEntries
; i++) {
101
int source1 = rand() %
kNumEntries
;
102
int source2 = rand() %
kNumEntries
;
108
for (int i = 0; i <
kNumEntries
/ 2; i++) {
113
// At this point, there are
kNumEntries
/ 2 entries on the file, randomly
116
Addr address(entries[
kNumEntries
/ 2]);
disk_cache_perftest.cc
223
const int
kNumEntries
= 60000;
224
disk_cache::Addr* address = new disk_cache::Addr[
kNumEntries
];
229
for (int i = 0; i <
kNumEntries
; i++) {
238
int entry = rand() * (
kNumEntries
/ RAND_MAX + 1);
239
if (entry >=
kNumEntries
)
stress_cache.cc
143
const int
kNumEntries
= 30;
145
disk_cache::Entry* entries[
kNumEntries
] = {0};
156
int slot = rand() %
kNumEntries
;
backend_unittest.cc
883
const int
kNumEntries
= 100;
884
disk_cache::Entry* entries[
kNumEntries
];
885
for (int i = 0; i <
kNumEntries
; i++) {
889
EXPECT_EQ(
kNumEntries
, cache_->GetEntryCount());
891
for (int i = 0; i <
kNumEntries
; i++) {
892
int source1 = rand() %
kNumEntries
;
893
int source2 = rand() %
kNumEntries
;
899
std::string keys[
kNumEntries
];
900
for (int i = 0; i <
kNumEntries
; i++) {
902
if (i <
kNumEntries
/ 2
[
all
...]
/external/chromium_org/net/disk_cache/v3/
block_bitmaps_unittest.cc
88
const int
kNumEntries
= 2000;
89
CacheAddr entries[
kNumEntries
];
93
for (int i = 0; i <
kNumEntries
; i++) {
100
for (int i = 0; i <
kNumEntries
; i++) {
101
int source1 = rand() %
kNumEntries
;
102
int source2 = rand() %
kNumEntries
;
108
for (int i = 0; i <
kNumEntries
/ 2; i++) {
113
// At this point, there are
kNumEntries
/ 2 entries on the file, randomly
116
Addr address(entries[
kNumEntries
/ 2]);
/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) {
/external/chromium_org/base/allocator/
allocator_unittests.cc
432
const int
kNumEntries
= 1 << 14;
433
int** p = reinterpret_cast<int**>(malloc(sizeof(*p) *
kNumEntries
));
435
for (int i = 0; i <
kNumEntries
; i++) {
440
for (int i = 0; i <
kNumEntries
; i++) {
443
for (int i = 0; i <
kNumEntries
; i++) {
447
EXPECT_EQ(
kNumEntries
/2 * (
kNumEntries
- 1), sum); // assume kNE is even
/external/chromium_org/gpu/command_buffer/service/
cmd_parser_test.cc
225
const unsigned int
kNumEntries
= 5;
226
scoped_ptr<CommandParser> parser(MakeParser(
kNumEntries
));
231
EXPECT_FALSE(parser->set_get(
kNumEntries
));
/external/chromium_org/third_party/leveldatabase/
env_chromium.cc
347
case
kNumEntries
:
349
return "
kNumEntries
";
815
return base::LinearHistogram::FactoryGet(uma_name, 1,
kNumEntries
,
816
kNumEntries
+ 1, base::Histogram::kUmaTargetedHistogramFlag);
863
return base::LinearHistogram::FactoryGet(uma_name, 1,
kNumEntries
,
864
kNumEntries
+ 1, base::Histogram::kUmaTargetedHistogramFlag);
env_chromium.h
41
kNumEntries
/external/chromium_org/content/browser/indexed_db/leveldb/
leveldb_database.cc
151
leveldb_env::
kNumEntries
,
152
leveldb_env::
kNumEntries
+ 1,
Completed in 1328 milliseconds