Home
last modified time | relevance | path

Searched refs:kArraySize (Results 1 – 5 of 5) sorted by relevance

/external/valgrind/tsan/
Dthread_sanitizer.cc299 int kHtableSize, int kArraySize = 8>
333 if (kArraySize != 0 && !ArrayLookup(a, b, &dummy)) { in Insert()
334 array_[array_pos_ % kArraySize].Fill(a, b, v); in Insert()
335 array_pos_ = (array_pos_ + 1) % kArraySize; in Insert()
336 if (array_pos_ > kArraySize) in Insert()
343 if (kArraySize != 0 && ArrayLookup(a, b, v)) { in Lookup()
375 for (int i = 0; i < (array_filled_ ? kArraySize : array_pos_); i++) { in ArrayLookup()
402 Entry array_[kArraySize];
410 template<int kHtableSize, int kArraySize = 8>
412 : public PairCache<int, int, int, kHtableSize, kArraySize> {};
/external/protobuf/gtest/test/
Dgtest_unittest.cc535 const int kArraySize = 10; in TEST() local
537 UInt32 values[kArraySize]; in TEST()
540 for (int i = 0; i < kArraySize; i++) { in TEST()
545 for (int i = 0; i < kArraySize; i++) { in TEST()
/external/chromium/testing/gtest/test/
Dgtest_unittest.cc571 const int kArraySize = 10; in TEST() local
573 UInt32 values[kArraySize]; in TEST()
576 for (int i = 0; i < kArraySize; i++) { in TEST()
581 for (int i = 0; i < kArraySize; i++) { in TEST()
/external/valgrind/unittest/
Dracecheck_unittest.cc6286 const int kArraySize = 100000; variable
6294 for (int j = 0; j < kArraySize; j++) { in RaceyLoop()
6310 arr = new int[kArraySize]; in Run()
/external/v8/test/cctest/
Dtest-debug.cc2546 static const int kArraySize = 5; member
2548 EvaluateResult results[kArraySize];
2554 return &results[counter % kArraySize]; in current()