| /external/perfetto/src/trace_processor/ |
| D | tp_metatrace.cc | 37 static_assert((kCapacity & (kCapacity - 1)) == 0, in RingBuffer()
46 uint64_t start = (write_idx_ - start_idx_) < kCapacity in ReadAll()
48 : write_idx_ - kCapacity; in ReadAll()
57 write_idx_ += kCapacity + 1; in ReadAll()
|
| D | tp_metatrace.h | 93 static constexpr uint32_t kCapacity = 256 * 1024;
111 Record* At(uint64_t idx) { return &data_[idx % kCapacity]; } in At()
126 bool HasOverwritten(uint64_t index) { return index + kCapacity < write_idx_; } in HasOverwritten()
133 std::array<Record, kCapacity> data_;
|
| /external/perfetto/src/profiling/perf/ |
| D | unwind_queue_unittest.cc | 26 static constexpr uint32_t kCapacity = 4; in TEST() local
27 UnwindQueue<int, kCapacity> queue; in TEST()
30 for (int i = 0; i < static_cast<int>(kCapacity); i++) { in TEST()
62 static constexpr uint32_t kCapacity = 4; in TEST() local
63 UnwindQueue<int, kCapacity> queue; in TEST()
66 for (int i = 0; i < static_cast<int>(kCapacity); i++) { in TEST()
|
| /external/perfetto/src/base/ |
| D | metatrace_unittest.cc | 143 for (size_t i = 0; i < m::RingBuffer::kCapacity; i++) in TEST_F()
145 ASSERT_EQ(m::RingBuffer::GetSizeForTesting(), m::RingBuffer::kCapacity); in TEST_F()
152 ASSERT_EQ(m::RingBuffer::GetSizeForTesting(), m::RingBuffer::kCapacity); in TEST_F()
169 constexpr int kMaxValue = m::RingBuffer::kCapacity * 3; in TEST_F()
198 const int kCapacity = static_cast<int>(m::RingBuffer::kCapacity); in TEST_F() local
204 i - last_value_read.load(std::memory_order_relaxed) >= kCapacity - 1; in TEST_F()
233 for (size_t i = 0; i < m::RingBuffer::kCapacity + 500; i++) in TEST_F()
246 ASSERT_EQ(m::RingBuffer::GetSizeForTesting(), m::RingBuffer::kCapacity); in TEST_F()
|
| D | metatrace.cc | 32 constexpr size_t RingBuffer::kCapacity; member in perfetto::metatrace::RingBuffer
33 std::array<Record, RingBuffer::kCapacity> RingBuffer::records_;
107 if (PERFETTO_LIKELY(size < kCapacity / 2)) in AppendNewRecord()
125 if (PERFETTO_LIKELY(size < kCapacity)) in AppendNewRecord()
|
| /external/icu/icu4c/source/tools/toolutil/ |
| D | denseranges.cpp | 30 LargestGaps(int32_t max) : maxLength(max<=kCapacity ? max : kCapacity), length(0) {} in LargestGaps()
78 static const int32_t kCapacity=15; member in __anon05eb6bd30111::LargestGaps
82 int32_t gapStarts[kCapacity];
83 int64_t gapLengths[kCapacity];
|
| /external/libchrome/base/synchronization/ |
| D | waitable_event_perftest.cc | 155 const size_t kCapacity = 500000; in TEST() local
156 TraceWaitableEvent event(kCapacity); in TEST()
174 EXPECT_LE(event.signal_times().capacity(), kCapacity); in TEST()
175 EXPECT_LE(event.wait_times().capacity(), kCapacity); in TEST()
|
| /external/perfetto/include/perfetto/ext/base/ |
| D | metatrace.h | 153 static constexpr size_t kCapacity = 4096; // 4096 * 16 bytes = 64K.
215 static_assert(!(kCapacity & (kCapacity - 1)), "kCapacity must be pow2"); in At()
218 return &records_[index % kCapacity]; in At()
252 static std::array<Record, kCapacity> records_;
|
| /external/perfetto/include/perfetto/protozero/ |
| D | message_arena.h | 79 static constexpr size_t kCapacity = 16; member
84 storage[kCapacity];
|
| D | proto_decoder.h | 386 kCapacity, in TypedProtoDecoder()
421 static constexpr size_t kCapacity = variable
424 Field on_stack_storage_[kCapacity];
|
| /external/libtextclassifier/abseil-cpp/absl/random/internal/ |
| D | pool_urbg.cc | 53 static constexpr size_t kCapacity = member in absl::random_internal::__anon5519497a0111::RandenPoolEntry
71 next_ = kCapacity; in MaybeRefill()
109 next_ = kCapacity; in Generate()
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/random/internal/ |
| D | pool_urbg.cc | 53 static constexpr size_t kCapacity = member in absl::random_internal::__anon375f1feb0111::RandenPoolEntry
71 next_ = kCapacity; in MaybeRefill()
109 next_ = kCapacity; in Generate()
|
| /external/openscreen/third_party/abseil/src/absl/random/internal/ |
| D | pool_urbg.cc | 53 static constexpr size_t kCapacity = member in absl::random_internal::__anon20fd0c8b0111::RandenPoolEntry
71 next_ = kCapacity; in MaybeRefill()
109 next_ = kCapacity; in Generate()
|
| /external/abseil-cpp/absl/random/internal/ |
| D | pool_urbg.cc | 53 static constexpr size_t kCapacity = member in absl::random_internal::__anon457e556a0111::RandenPoolEntry
71 next_ = kCapacity; in MaybeRefill()
109 next_ = kCapacity; in Generate()
|
| /external/webrtc/third_party/abseil-cpp/absl/random/internal/ |
| D | pool_urbg.cc | 53 static constexpr size_t kCapacity = member in absl::random_internal::__anon91d420190111::RandenPoolEntry
71 next_ = kCapacity; in MaybeRefill()
109 next_ = kCapacity; in Generate()
|
| /external/oboe/samples/RhythmGame/test/ |
| D | testLockFreeQueue.cpp | 156 const uint32_t kCapacity = (uint32_t) 1 << 7; in TEST_F() local
157 LockFreeQueue<int, kCapacity, uint8_t> myQ; in TEST_F()
|
| /external/perfetto/src/protozero/ |
| D | message_arena.cc | 41 if (PERFETTO_UNLIKELY(block->entries >= Block::kCapacity)) { in NewMessage()
|
| /external/abseil-cpp/absl/container/internal/ |
| D | raw_hash_set_test.cc | 208 constexpr size_t kCapacity = 63; in TEST() local
210 std::vector<ctrl_t> ctrl(kCapacity + 1 + kGroupWidth); in TEST()
211 ctrl[kCapacity] = kSentinel; in TEST()
213 for (size_t i = 0; i != kCapacity; ++i) { in TEST()
216 ctrl[i + kCapacity + 1] = pattern[i % pattern.size()]; in TEST()
218 ConvertDeletedToEmptyAndFullToDeleted(ctrl.data(), kCapacity); in TEST()
219 ASSERT_EQ(ctrl[kCapacity], kSentinel); in TEST()
220 for (size_t i = 0; i < kCapacity + 1 + kGroupWidth; ++i) { in TEST()
221 ctrl_t expected = pattern[i % (kCapacity + 1) % pattern.size()]; in TEST()
222 if (i == kCapacity) expected = kSentinel; in TEST()
|
| /external/openscreen/third_party/abseil/src/absl/container/internal/ |
| D | raw_hash_set_test.cc | 209 constexpr size_t kCapacity = 63; in TEST() local
211 std::vector<ctrl_t> ctrl(kCapacity + 1 + kGroupWidth); in TEST()
212 ctrl[kCapacity] = kSentinel; in TEST()
214 for (size_t i = 0; i != kCapacity; ++i) { in TEST()
217 ctrl[i + kCapacity + 1] = pattern[i % pattern.size()]; in TEST()
219 ConvertDeletedToEmptyAndFullToDeleted(ctrl.data(), kCapacity); in TEST()
220 ASSERT_EQ(ctrl[kCapacity], kSentinel); in TEST()
221 for (size_t i = 0; i < kCapacity + 1 + kGroupWidth; ++i) { in TEST()
222 ctrl_t expected = pattern[i % (kCapacity + 1) % pattern.size()]; in TEST()
223 if (i == kCapacity) expected = kSentinel; in TEST()
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/container/internal/ |
| D | raw_hash_set_test.cc | 209 constexpr size_t kCapacity = 63; in TEST() local
211 std::vector<ctrl_t> ctrl(kCapacity + 1 + kGroupWidth); in TEST()
212 ctrl[kCapacity] = kSentinel; in TEST()
214 for (size_t i = 0; i != kCapacity; ++i) { in TEST()
217 ctrl[i + kCapacity + 1] = pattern[i % pattern.size()]; in TEST()
219 ConvertDeletedToEmptyAndFullToDeleted(ctrl.data(), kCapacity); in TEST()
220 ASSERT_EQ(ctrl[kCapacity], kSentinel); in TEST()
221 for (size_t i = 0; i < kCapacity + 1 + kGroupWidth; ++i) { in TEST()
222 ctrl_t expected = pattern[i % (kCapacity + 1) % pattern.size()]; in TEST()
223 if (i == kCapacity) expected = kSentinel; in TEST()
|
| /external/libtextclassifier/abseil-cpp/absl/container/internal/ |
| D | raw_hash_set_test.cc | 209 constexpr size_t kCapacity = 63; in TEST() local
211 std::vector<ctrl_t> ctrl(kCapacity + 1 + kGroupWidth); in TEST()
212 ctrl[kCapacity] = kSentinel; in TEST()
214 for (size_t i = 0; i != kCapacity; ++i) { in TEST()
217 ctrl[i + kCapacity + 1] = pattern[i % pattern.size()]; in TEST()
219 ConvertDeletedToEmptyAndFullToDeleted(ctrl.data(), kCapacity); in TEST()
220 ASSERT_EQ(ctrl[kCapacity], kSentinel); in TEST()
221 for (size_t i = 0; i < kCapacity + 1 + kGroupWidth; ++i) { in TEST()
222 ctrl_t expected = pattern[i % (kCapacity + 1) % pattern.size()]; in TEST()
223 if (i == kCapacity) expected = kSentinel; in TEST()
|
| /external/webrtc/third_party/abseil-cpp/absl/container/internal/ |
| D | raw_hash_set_test.cc | 208 constexpr size_t kCapacity = 63; in TEST() local
210 std::vector<ctrl_t> ctrl(kCapacity + 1 + kGroupWidth); in TEST()
211 ctrl[kCapacity] = kSentinel; in TEST()
213 for (size_t i = 0; i != kCapacity; ++i) { in TEST()
216 ctrl[i + kCapacity + 1] = pattern[i % pattern.size()]; in TEST()
218 ConvertDeletedToEmptyAndFullToDeleted(ctrl.data(), kCapacity); in TEST()
219 ASSERT_EQ(ctrl[kCapacity], kSentinel); in TEST()
220 for (size_t i = 0; i < kCapacity + 1 + kGroupWidth; ++i) { in TEST()
221 ctrl_t expected = pattern[i % (kCapacity + 1) % pattern.size()]; in TEST()
222 if (i == kCapacity) expected = kSentinel; in TEST()
|
| /external/tensorflow/tensorflow/core/util/ |
| D | mkl_util.h | 1824 static const int kCapacity = 1024; // cache capacity in GetLRUCache() local
1825 static thread_local LRUCache<MklPrimitive> lru_cache_(kCapacity); in GetLRUCache()
|