| /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++)
|
| ignored-interceptors-mmap.cc | 20 const size_t kSize = sysconf(_SC_PAGESIZE);
21 void *p = mmap(0, kSize, PROT_READ|PROT_WRITE,
25 munmap(p, kSize);
27 void *new_p = mmap(p, kSize, PROT_READ|PROT_WRITE,
|
| /external/compiler-rt/test/asan/TestCases/ |
| malloc_fill.cc | 10 static const int kSize = 1 << 25;
11 unsigned char *x = new unsigned char[kSize];
|
| /system/chre/util/include/chre/util/ |
| synchronized_memory_pool_impl.h | 25 template<typename ElementType, size_t kSize>
27 ElementType *SynchronizedMemoryPool<ElementType, kSize>::allocate(
33 template<typename ElementType, size_t kSize>
34 void SynchronizedMemoryPool<ElementType, kSize>::deallocate(
|
| fixed_size_blocking_queue_impl.h | 25 template<typename ElementType, size_t kSize>
26 bool FixedSizeBlockingQueue<ElementType, kSize>::push(
39 template<typename ElementType, size_t kSize>
40 ElementType FixedSizeBlockingQueue<ElementType, kSize>::pop() {
51 template<typename ElementType, size_t kSize>
52 bool FixedSizeBlockingQueue<ElementType, kSize>::empty() {
|
| memory_pool.h | 49 template<typename ElementType, size_t kSize>
101 FixedSizeVector<MemoryPoolBlock, kSize> mBlocks;
107 size_t mFreeBlockCount = kSize;
|
| memory_pool_impl.h | 26 template<typename ElementType, size_t kSize>
27 MemoryPool<ElementType, kSize>::MemoryPool() {
32 for (size_t i = 0; i < kSize; i++) {
37 template<typename ElementType, size_t kSize>
39 ElementType *MemoryPool<ElementType, kSize>::allocate(Args&&... args) {
52 template<typename ElementType, size_t kSize>
53 void MemoryPool<ElementType, kSize>::deallocate(ElementType *element) {
64 template<typename ElementType, size_t kSize>
65 MemoryPool<ElementType, kSize>::MemoryPoolBlock::MemoryPoolBlock(
|
| fixed_size_blocking_queue.h | 33 template <typename ElementType, size_t kSize>
68 ArrayQueue<ElementType, kSize> mQueue;
|
| synchronized_memory_pool.h | 28 template<typename ElementType, size_t kSize>
60 MemoryPool<ElementType, kSize> mMemoryPool;
|
| /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/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 | 16 static const int kSize = 64;
22 kSize, kSize,
26 kSize, kSize,
86 SkImageInfo dstInfo = SkImageInfo::MakeN32Premul(kSize, kSize);
87 SkAutoTMalloc<uint32_t> dstBuffer(kSize * kSize);
88 static const size_t kRowBytes = sizeof(uint32_t) * kSize;
[all...] |
| /external/skia/gm/ |
| bitmapimage.cpp | 25 return SkISize::Make(2*kSize, 2*kSize);
45 SkImageInfo linearInfo = SkImageInfo::MakeN32(2*kSize, kSize, kOpaque_SkAlphaType);
50 legacyCanvas.translate(SkScalar(kSize), 0.0f);
53 canvas->translate(0.0f, SkScalar(kSize));
56 SkImageInfo srgbInfo = SkImageInfo::MakeS32(2*kSize, kSize, kOpaque_SkAlphaType);
61 srgbCanvas.translate(SkScalar(kSize), 0.0f);
67 static constexpr int kSize = 512
[all...] |
| bigrrectaaeffect.cpp | 120 constexpr int kSize = 700;
122 DEF_GM( return new BigRRectAAEffectGM (SkRRect::MakeRect(SkRect::MakeIWH(kSize, kSize)), "rect"); )
123 DEF_GM( return new BigRRectAAEffectGM (SkRRect::MakeOval(SkRect::MakeIWH(kSize, kSize)), "circle"); )
124 DEF_GM( return new BigRRectAAEffectGM (SkRRect::MakeOval(SkRect::MakeIWH(kSize - 1, kSize - 10)), "ellipse"); )
126 DEF_GM( return new BigRRectAAEffectGM (SkRRect::MakeRectXY(SkRect::MakeIWH(kSize - 1, kSize - 10), kSize/2.f - 10.f, kSize/2.f - 10.f), "circular_corner");
[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...] |
| /external/webrtc/webrtc/modules/audio_coding/neteq/tools/ |
| audio_checksum.h | 44 checksum_.Finish(checksum_result_, rtc::Md5Digest::kSize);
46 return rtc::hex_encode(checksum_result_, rtc::Md5Digest::kSize);
51 char checksum_result_[rtc::Md5Digest::kSize];
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_addrhashmap.h | 25 // T must be a POD type, kSize is preferably a prime but can be any number.
43 template<typename T, uptr kSize>
70 Handle(AddrHashMap<T, kSize> *map, uptr addr);
71 Handle(AddrHashMap<T, kSize> *map, uptr addr, bool remove);
72 Handle(AddrHashMap<T, kSize> *map, uptr addr, bool remove, bool create);
80 friend AddrHashMap<T, kSize>;
81 AddrHashMap<T, kSize> *map_;
100 template<typename T, uptr kSize>
101 AddrHashMap<T, kSize>::Handle::Handle(AddrHashMap<T, kSize> *map, uptr addr)
[all...] |
