| /system/chre/apps/nearby/third_party/contexthub/chre/util/include/chre/util/ |
| D | dynamic_vector_impl.h | 50 mSize = other.mSize;
54 other.mSize = 0;
63 destroy(data(), mSize); in clear()
64 mSize = 0; in clear()
80 return mSize; in size()
91 return (mSize == 0); in empty()
97 erase(mSize - 1); in pop_back()
117 new (&data()[mSize++]) ElementType(element); in doPushBack()
127 new (&data()[mSize++]) ElementType(std::move(element)); in push_back()
138 new (&data()[mSize++]) ElementType(std::forward<Args>(args)...); in emplace_back()
[all …]
|
| D | dynamic_vector_base.h | 86 size_t mSize = 0; variable
|
| /system/chre/util/include/chre/util/ |
| D | dynamic_vector_impl.h | 50 mSize = other.mSize;
54 other.mSize = 0;
63 destroy(data(), mSize); in clear()
64 mSize = 0; in clear()
80 return mSize; in size()
91 return (mSize == 0); in empty()
97 erase(mSize - 1); in pop_back()
117 new (&data()[mSize++]) ElementType(element); in doPushBack()
127 new (&data()[mSize++]) ElementType(std::move(element)); in push_back()
138 new (&data()[mSize++]) ElementType(std::forward<Args>(args)...); in emplace_back()
[all …]
|
| D | fixed_size_vector_impl.h | 36 CHRE_ASSERT(mSize > 0); in back()
37 return data()[mSize - 1]; in back()
42 CHRE_ASSERT(mSize > 0); in back()
43 return data()[mSize - 1]; in back()
48 CHRE_ASSERT(mSize > 0); in front()
54 CHRE_ASSERT(mSize > 0); in front()
70 return mSize; in size()
80 return (mSize == 0); in empty()
85 return (mSize == kCapacity); in full()
93 new (&data()[mSize++]) ElementType(element); in push_back()
[all …]
|
| D | array_queue_impl.h | 36 return (mSize == 0); in empty()
41 return (mSize == StorageType::capacity()); in full()
46 return mSize; in size()
51 CHRE_ASSERT(mSize > 0); in front()
57 CHRE_ASSERT(mSize > 0); in front()
63 CHRE_ASSERT(mSize > 0); in back()
69 CHRE_ASSERT(mSize > 0); in back()
76 CHRE_ASSERT(index < mSize);
83 CHRE_ASSERT(index < mSize);
126 if (mSize > 0) { in pop()
[all …]
|
| D | intrusive_list_impl.h | 38 CHRE_ASSERT(mSize > 0); in front()
44 CHRE_ASSERT(mSize > 0); in front()
50 CHRE_ASSERT(mSize > 0); in unlink_front()
56 CHRE_ASSERT(mSize > 0); in back()
62 CHRE_ASSERT(mSize > 0); in back()
68 CHRE_ASSERT(mSize > 0); in unlink_back()
74 CHRE_ASSERT(mSize > 0); in unlink_node()
|
| D | copyable_fixed_size_vector.h | 49 this->mSize = other.mSize; in copyFrom()
52 sizeof(ElementType) * this->mSize); in copyFrom()
54 for (size_t i = 0; i < this->mSize; i++) { in copyFrom()
|
| D | segmented_queue_impl.h | 54 mSize++; in push_back()
65 mSize++; in push_back()
87 mSize++; in emplace_back()
94 CHRE_ASSERT(index < mSize);
102 CHRE_ASSERT(index < mSize);
141 if (mSize == 0) { in pop_front()
157 if (index >= mSize) { in remove()
162 if (mSize == 0) { in remove()
242 --mSize; in removeMatchedFromBack()
248 if (mSize == 0) { in removeMatchedFromBack()
[all …]
|
| D | segmented_queue.h | 64 return mSize; in size()
86 return mSize == kMaxBlockCount * kBlockSize; in full()
94 return mSize == 0; in empty()
382 size_t mSize = 0; variable
|
| D | synchronized_expandable_memory_pool_impl.h | 61 ++mSize; in allocate()
84 --mSize; in deallocate()
99 return kMaxMemoryPoolCount * kMemoryPoolSize - mSize; in getFreeSpaceCount()
107 return kMaxMemoryPoolCount * kMemoryPoolSize == mSize; in full()
|
| D | intrusive_list.h | 151 return mSize == 0; in empty()
160 return mSize; in size()
|
| D | buffer_base.h | 38 size_t mSize = 0; variable
|
| /system/chre/util/ |
| D | dynamic_vector_base.cc | 27 : mData(other.mData), mSize(other.mSize), mCapacity(other.mCapacity) { in DynamicVectorBase()
29 other.mSize = 0; in DynamicVectorBase()
38 memcpy(newData, mData, mSize * elementSize); in doReserve()
57 } else if (mSize == mCapacity) { in getNextGrowthCapacity()
67 mSize--; in doErase()
68 size_t moveAmount = (mSize - index) * elementSize; in doErase()
77 memcpy(static_cast<uint8_t *>(mData) + (mSize * elementSize), element, in doPushBack()
79 mSize++; in doPushBack()
|
| D | buffer_base.cc | 34 mSize = size; in wrap()
50 mSize = size; in copy_array()
65 mSize = 0; in reset()
|
| D | intrusive_list_base.cc | 30 mSize++; in doLinkBack()
38 mSize--; in doUnlinkNode()
47 mSize++; in doLinkAfter()
|
| /system/chre/apps/nearby/third_party/contexthub/chre/util/ |
| D | dynamic_vector_base.cc | 27 : mData(other.mData), mSize(other.mSize), mCapacity(other.mCapacity) { in DynamicVectorBase()
29 other.mSize = 0; in DynamicVectorBase()
38 memcpy(newData, mData, mSize * elementSize); in doReserve()
57 } else if (mSize == mCapacity) { in getNextGrowthCapacity()
67 mSize--; in doErase()
68 size_t moveAmount = (mSize - index) * elementSize; in doErase()
77 memcpy(static_cast<uint8_t *>(mData) + (mSize * elementSize), element, in doPushBack()
79 mSize++; in doPushBack()
|
| /system/libhidl/base/ |
| D | HidlSupport.cpp | 139 hidl_string::hidl_string() : mBuffer(kEmptyString), mSize(0), mOwnsBuffer(false) { in hidl_string()
206 return std::string(mBuffer, mSize); in operator std::string()
223 mSize = 0; in copyFrom()
233 mSize = static_cast<uint32_t>(size); in copyFrom()
241 mSize = other.mSize; in moveFrom()
254 mSize = 0; in clear()
273 mSize = static_cast<uint32_t>(size); in setToExternal()
282 return mSize; in size()
286 return mSize == 0; in empty()
|
| /system/core/libutils/ |
| D | SharedBuffer.cpp | 43 sb->mSize = size; in alloc()
60 SharedBuffer* sb = alloc(mSize); in edit()
72 if (buf->mSize == newSize) return buf; in editResize()
80 buf->mSize = newSize; in editResize()
86 const size_t mySize = mSize; in editResize()
|
| D | SharedBuffer.h | 104 size_t mSize; variable
128 return mSize; in size()
140 return data ? bufferFromData(data)->mSize : 0; in sizeFromData()
|
| /system/libhidl/base/include/hidl/ |
| D | HidlSupport.h | 182 uint32_t mSize; // NOT including the terminating '\0'. member
225 hidl_memory() : mHandle(nullptr), mSize(0), mName("") { in hidl_memory()
233 : mHandle(std::move(handle)), mSize(size), mName(name) {} in hidl_memory()
243 mSize(size), in hidl_memory()
256 mSize = other.mSize;
272 mSize = other.mSize;
274 other.mSize = 0;
293 return mSize; in size()
306 uint64_t mSize; member
339 hidl_vec() : mBuffer(nullptr), mSize(0), mOwnsBuffer(false) { in hidl_vec()
[all …]
|
| /system/media/audio_utils/include/audio_utils/ |
| D | LinearMap.h | 138 : mSize(size), in LinearMap()
195 if (++mPos >= mSize) { in push()
198 if (mSamples < mSize) { in push()
279 if (position < 0) position += mSize;
354 const size_t mSize; // Size of mX and mY arrays (history).
|
| /system/tools/hidl/ |
| D | HidlTypeAssertion.cpp | 34 : mSize(size) { in HidlTypeAssertion()
39 return mSize; in size()
|
| D | HidlTypeAssertion.h | 39 size_t mSize;
|
| /system/vold/model/ |
| D | Disk.cpp | 96 mSize(-1), in Disk()
224 if (listener) listener->onDiskMetadataChanged(getId(), mSize, mLabel, mSysPath); in createStubVolume()
238 mSize = -1; in readMetadata()
241 if (GetBlockDevSize(mDevPath, &mSize) != OK) { in readMetadata()
242 mSize = -1; in readMetadata()
318 if (listener) listener->onDiskMetadataChanged(getId(), mSize, mLabel, mSysPath); in readMetadata()
538 uint64_t splitMb = ((mSize / 100) * ratio) / 1024 / 1024; in partitionMixed()
|
| D | Disk.h | 69 uint64_t getSize() const { return mSize; } in getSize()
106 uint64_t mSize; variable
|