| /external/webrtc/webrtc/base/ |
| bufferqueue_unittest.cc | 17 const size_t kSize = 16;
18 const char in[kSize * 2 + 1] = "0123456789ABCDEFGHIJKLMNOPQRSTUV";
19 char out[kSize * 2];
21 BufferQueue queue1(1, kSize);
22 BufferQueue queue2(2, kSize);
26 EXPECT_FALSE(queue1.ReadFront(out, kSize, &bytes));
29 EXPECT_TRUE(queue1.WriteBack(in, kSize, &bytes));
30 EXPECT_EQ(kSize, bytes);
34 EXPECT_FALSE(queue1.WriteBack(in, kSize, &bytes));
38 EXPECT_TRUE(queue1.ReadFront(out, kSize, &bytes))
[all...] |
| stream_unittest.cc | 98 const size_t kSize = 16;
99 const char in[kSize * 2 + 1] = "0123456789ABCDEFGHIJKLMNOPQRSTUV";
100 char out[kSize * 2];
104 FifoBuffer buf(kSize);
109 EXPECT_EQ(SR_BLOCK, stream->Read(out, kSize, &bytes, NULL));
114 EXPECT_EQ(kSize, bytes);
118 EXPECT_EQ(SR_SUCCESS, stream->Write(in, kSize, &bytes, NULL));
119 EXPECT_EQ(kSize, bytes);
122 EXPECT_EQ(SR_BLOCK, stream->Write(in, kSize, &bytes, NULL));
125 EXPECT_EQ(SR_SUCCESS, stream->Read(out, kSize, &bytes, NULL))
[all...] |
| md5digest.cc | 16 return kSize;
24 if (len < kSize) {
29 return kSize;
|
| sha1digest.cc | 16 return kSize;
24 if (len < kSize) {
29 return kSize;
|
| /external/compiler-rt/test/tsan/ |
| large_malloc_meta.cc | 15 const int kSize = 1 << 20;
17 volatile int *p = new int[kSize];
18 for (int j = 0; j < kSize; j += kPageSize / sizeof(*p))
21 mmap(0, kSize * sizeof(*p) + kPageSize, PROT_NONE, MAP_PRIVATE | MAP_ANON,
|
| barrier.cc | 13 const int kSize = 4;
15 int data[2][kSize];
24 int right = idx + 1 < kSize ? prev[idx + 1] : 0;
32 pthread_barrier_init(&barrier, 0, kSize);
33 pthread_t th[kSize];
34 for (int i = 0; i < kSize; i++)
36 for (int i = 0; i < kSize; i++)
|
| restore_stack.cc | 6 const int kSize = 64 << 10;
7 volatile long data[kSize];
10 for (int i = 0; i < kSize; i++)
33 for (int i = 0; i < kSize; i++)
|
| /external/compiler-rt/test/asan/TestCases/ |
| malloc_fill.cc | 10 static const int kSize = 1 << 25;
11 unsigned char *x = new unsigned char[kSize];
|
| /external/llvm/lib/Fuzzer/test/ |
| OneHugeAllocTest.cpp | 19 size_t kSize = (size_t)1 << 31;
20 char *p = new char[kSize];
21 memset(p, 0, kSize);
|
| OutOfMemoryTest.cpp | 20 size_t kSize = 1 << 28;
21 char *p = new char[kSize];
22 memset(p, 0, kSize);
|
| /external/v8/src/base/ |
| ring-buffer.h | 17 static const int kSize = 10;
19 if (count_ == kSize) {
21 if (start_ == kSize) start_ = 0;
33 if (j >= kSize) j -= kSize;
37 if (--j == -1) j += kSize;
45 T elements_[kSize];
|
| /external/perfetto/src/base/ |
| paged_memory_unittest.cc | 37 const size_t kSize = 4096 * kNumPages;
40 PagedMemory mem = PagedMemory::Allocate(kSize);
44 for (size_t i = 0; i < kSize / sizeof(uint64_t); i++)
48 ASSERT_TRUE(vm_test_utils::IsMapped(ptr_raw, kSize));
53 ASSERT_TRUE(mem.AdviseDontNeed(ptr_raw, kSize));
56 ASSERT_FALSE(vm_test_utils::IsMapped(ptr_raw, kSize));
62 ASSERT_FALSE(vm_test_utils::IsMapped(ptr_raw, kSize));
68 constexpr size_t kSize = 4096 * kNumPages;
71 PagedMemory mem = PagedMemory::Allocate(kSize, PagedMemory::kDontCommit);
89 mem.EnsureCommitted(kSize);
[all...] |
| /external/libchrome/base/containers/ |
| ring_buffer.h | 16 // std::deque, and so, one can access only the last |kSize| elements. Also, you
24 template <typename T, size_t kSize>
29 size_t BufferSize() const { return kSize; }
38 // Returns the element at index |n| (% |kSize|).
71 if (index_ == kSize)
88 Iterator(const RingBuffer<T, kSize>& buffer, size_t index)
91 const RingBuffer<T, kSize>& buffer_;
95 friend class RingBuffer<T, kSize>;
100 // for (RingBuffer<T, kSize>::Iterator it = ring_buffer.Begin(); it; ++it) {}
102 if (current_index_ < kSize)
[all...] |
| /external/skia/tests/ |
| LRUCacheTest.cpp | 29 static const int kSize = 100;
30 SkLRUCache<int, std::unique_ptr<Value>> test(kSize);
31 for (int i = 1; i < kSize * 2; i++) {
36 if (i > kSize) {
37 REPORTER_ASSERT(r, kSize == instances);
38 REPORTER_ASSERT(r, !test.find(i - kSize));
53 static const int kSize = 5;
54 SkLRUCache<int, std::unique_ptr<Value>> test(kSize);
61 REPORTER_ASSERT(r, kSize == instances);
62 REPORTER_ASSERT(r, kSize == test.count())
[all...] |
| RenderTargetContextTest.cpp | 19 static const int kSize = 64;
23 kSize, kSize,
62 SkImageInfo dstInfo = SkImageInfo::MakeN32Premul(kSize, kSize);
63 SkAutoTMalloc<uint32_t> dstBuffer(kSize * kSize);
64 static const size_t kRowBytes = sizeof(uint32_t) * kSize;
|
| /external/skqp/tests/ |
| LRUCacheTest.cpp | 29 static const int kSize = 100;
30 SkLRUCache<int, std::unique_ptr<Value>> test(kSize);
31 for (int i = 1; i < kSize * 2; i++) {
36 if (i > kSize) {
37 REPORTER_ASSERT(r, kSize == instances);
38 REPORTER_ASSERT(r, !test.find(i - kSize));
53 static const int kSize = 5;
54 SkLRUCache<int, std::unique_ptr<Value>> test(kSize);
61 REPORTER_ASSERT(r, kSize == instances);
62 REPORTER_ASSERT(r, kSize == test.count())
[all...] |
| RenderTargetContextTest.cpp | 19 static const int kSize = 64;
23 kSize, kSize,
62 SkImageInfo dstInfo = SkImageInfo::MakeN32Premul(kSize, kSize);
63 SkAutoTMalloc<uint32_t> dstBuffer(kSize * kSize);
64 static const size_t kRowBytes = sizeof(uint32_t) * kSize;
|
| /external/skia/gm/ |
| localmatrixshader.cpp | 15 static constexpr SkScalar kSize = 50;
16 SkImageInfo info = SkImageInfo::MakeN32Premul(kSize, kSize);
23 surface->getCanvas()->drawCircle(kSize / 2, kSize / 2, kSize / 2, p);
27 surface->getCanvas()->drawLine(kSize * .25f, kSize * .50f, kSize * .75f, kSize * .50f, p)
[all...] |
| bitmapimage.cpp | 26 return SkISize::Make(2*kSize, 2*kSize);
47 SkImageInfo linearInfo = SkImageInfo::MakeN32(2*kSize, kSize, kOpaque_SkAlphaType);
52 legacyCanvas.translate(SkScalar(kSize), 0.0f);
55 canvas->translate(0.0f, SkScalar(kSize));
58 SkImageInfo srgbInfo = SkImageInfo::MakeS32(2*kSize, kSize, kOpaque_SkAlphaType);
63 srgbCanvas.translate(SkScalar(kSize), 0.0f);
70 static constexpr int kSize = 512
[all...] |
| /external/skqp/gm/ |
| localmatrixshader.cpp | 15 static constexpr SkScalar kSize = 50;
16 SkImageInfo info = SkImageInfo::MakeN32Premul(kSize, kSize);
23 surface->getCanvas()->drawCircle(kSize / 2, kSize / 2, kSize / 2, p);
27 surface->getCanvas()->drawLine(kSize * .25f, kSize * .50f, kSize * .75f, kSize * .50f, p)
[all...] |
| bitmapimage.cpp | 26 return SkISize::Make(2*kSize, 2*kSize);
46 SkImageInfo linearInfo = SkImageInfo::MakeN32(2*kSize, kSize, kOpaque_SkAlphaType);
51 legacyCanvas.translate(SkScalar(kSize), 0.0f);
54 canvas->translate(0.0f, SkScalar(kSize));
57 SkImageInfo srgbInfo = SkImageInfo::MakeS32(2*kSize, kSize, kOpaque_SkAlphaType);
62 srgbCanvas.translate(SkScalar(kSize), 0.0f);
68 static constexpr int kSize = 512
[all...] |
| /art/runtime/interpreter/ |
| interpreter_cache.h | 54 static constexpr size_t kSize = 256;
84 static_assert(IsPowerOfTwo(kSize), "Size must be power of two");
85 size_t index = (reinterpret_cast<uintptr_t>(key) >> 2) & (kSize - 1);
86 DCHECK_LT(index, kSize);
90 std::array<Entry, kSize> data_;
|
| /external/skia/src/core/ |
| SkAutoMalloc.h | 97 fSize = kSize;
106 fSize = kSize;
135 size = (size < kSize) ? kSize : size;
145 if (size == kSize) {
154 SkASSERT(fSize >= size && fSize >= kSize);
155 SkASSERT((fPtr == fStorage) || fSize > kSize);
166 static const size_t kSize = kSizeRequested > kMaxBytes ? kMaxBytes : kSizeAlign4;
168 static const size_t kSize = kSizeAlign4;
173 uint32_t fStorage[kSize >> 2]
[all...] |
| /external/skqp/src/core/ |
| SkAutoMalloc.h | 97 fSize = kSize;
106 fSize = kSize;
135 size = (size < kSize) ? kSize : size;
145 if (size == kSize) {
154 SkASSERT(fSize >= size && fSize >= kSize);
155 SkASSERT((fPtr == fStorage) || fSize > kSize);
166 static const size_t kSize = kSizeRequested > kMaxBytes ? kMaxBytes : kSizeAlign4;
168 static const size_t kSize = kSizeAlign4;
173 uint32_t fStorage[kSize >> 2]
[all...] |
| /external/webrtc/webrtc/common_audio/ |
| audio_util_unittest.cc | 34 const size_t kSize = 9;
35 const float kInput[kSize] = {0.f,
44 const int16_t kReference[kSize] = {0, 0, 1, 0, -1,
46 int16_t output[kSize];
47 FloatToS16(kInput, kSize, output);
48 ExpectArraysEq(kReference, output, kSize);
52 const size_t kSize = 7;
53 const int16_t kInput[kSize] = {0, 1, -1, 16384, -16384, 32767, -32768};
54 const float kReference[kSize] = {
56 float output[kSize];
[all...] |
