| /system/bt/osi/src/ |
| D | array.c | 32 size_t capacity; member
51 array->capacity = INTERNAL_ELEMENTS; in array_new()
89 if (array->length == array->capacity && !grow(array)) { in array_append_ptr()
90 …y past current capacity of %zu elements of size %zu.", __func__, array->capacity, array->element_s… in array_append_ptr()
100 const size_t new_capacity = array->capacity + (array->capacity / 2); in grow()
111 array->capacity = new_capacity; in grow()
|
| D | fixed_queue.c | 35 size_t capacity; member
44 fixed_queue_t *fixed_queue_new(size_t capacity) { in fixed_queue_new() argument
50 ret->capacity = capacity; in fixed_queue_new()
56 ret->enqueue_sem = semaphore_new(capacity); in fixed_queue_new()
101 return queue->capacity; in fixed_queue_capacity()
|
| /system/core/libutils/tests/ |
| D | BasicHashtable_test.cpp | 165 &h, h.size(), h.capacity(), h.bucketCount()); in dump()
187 EXPECT_EQ(3U, h.capacity()); in TEST_F()
196 EXPECT_EQ(77U, h.capacity()); in TEST_F()
205 EXPECT_EQ(46U, h.capacity()); // must be one less than bucketCount because loadFactor == 1.0f in TEST_F()
214 EXPECT_EQ(46U, h.capacity()); // must be one less than bucketCount because loadFactor == 1.0f in TEST_F()
320 EXPECT_EQ(3U, h.capacity()); in TEST_F()
332 EXPECT_EQ(3U, h.capacity()); in TEST_F()
347 EXPECT_EQ(3U, h.capacity()); in TEST_F()
365 EXPECT_EQ(3U, h.capacity()); in TEST_F()
416 size_t initialCapacity = h.capacity(); in TEST_F()
[all …]
|
| /system/core/libutils/ |
| D | VectorImpl.cpp | 90 sb = SharedBuffer::alloc(capacity() * mItemSize); in editArrayImpl()
101 size_t VectorImpl::capacity() const in capacity() function in android::VectorImpl
298 ALOG_ASSERT(index<capacity(), in editItemLocation()
300 this, (int)index, (int)capacity(), (int)mCount); in editItemLocation()
302 if (index < capacity()) { in editItemLocation()
313 ALOG_ASSERT(index<capacity(), in itemLocation()
315 this, (int)index, (int)capacity(), (int)mCount); in itemLocation()
317 if (index < capacity()) { in itemLocation()
328 size_t current_capacity = capacity(); in setCapacity()
377 if (capacity() < new_size) { in _grow()
[all …]
|
| /system/core/libpixelflinger/codeflinger/tinyutils/ |
| D | VectorImpl.cpp | 93 sb = SharedBuffer::alloc(capacity() * mItemSize); in editArrayImpl()
104 size_t VectorImpl::capacity() const in capacity() function in android::tinyutils::VectorImpl
222 ALOG_ASSERT(index<capacity(), in editItemLocation()
224 this, (int)index, (int)capacity(), (int)mCount); in editItemLocation()
234 ALOG_ASSERT(index<capacity(), in itemLocation()
236 this, (int)index, (int)capacity(), (int)mCount); in itemLocation()
246 size_t current_capacity = capacity(); in setCapacity()
284 if (capacity() < new_size) { in _grow()
337 if (new_size*3 < capacity()) { in _shrink()
|
| D | KeyedVector.h | 57 inline size_t capacity() const { return mVector.capacity(); } in capacity() function
|
| D | SortedVector.h | 66 inline size_t capacity() const { return VectorImpl::capacity(); } in capacity() function
|
| D | Vector.h | 74 inline size_t capacity() const { return VectorImpl::capacity(); } in capacity() function
|
| D | VectorImpl.h | 66 size_t capacity() const;
|
| /system/core/toolbox/ |
| D | ls.c | 21 int capacity; member
46 int old_cap = a->capacity; in dynarray_reserve_more()
72 a->capacity = new_cap; in dynarray_reserve_more()
76 list->count = list->capacity = 0; in strlist_init()
86 if (list->count >= list->capacity) in strlist_append_b()
101 list->count = list->capacity = 0; in strlist_done()
|
| /system/core/healthd/ |
| D | healthd_mode_charger.cpp | 105 int capacity; member
168 .capacity = 0,
326 if (batt_anim->capacity < 0 || batt_anim->num_frames == 0) in redraw_screen()
406 batt_anim->capacity = batt_prop->batteryLevel; in update_screen_state()
419 if (batt_anim->num_frames == 0 || batt_anim->capacity < 0) { in update_screen_state()
524 if (charger->batt_anim->capacity >= charger->boot_min_cap) { in process_key()
|
| /system/bt/osi/include/ |
| D | fixed_queue.h | 34 fixed_queue_t *fixed_queue_new(size_t capacity);
|
| /system/extras/tests/sdcard/ |
| D | stopwatch.h | 91 StopWatch(const char *name, size_t capacity = kUseDefaultCapacity);
|
| D | stopwatch.cpp | 54 StopWatch::StopWatch(const char *name, size_t capacity) in StopWatch() argument
55 : mName(strdup(name)), mNum(0), mData(NULL), mDataLen(0), mCapacity(capacity * 2), in StopWatch()
|
| /system/core/include/utils/ |
| D | KeyedVector.h | 58 inline size_t capacity() const { return mVector.capacity(); } in capacity() function
|
| D | SortedVector.h | 69 inline size_t capacity() const { return VectorImpl::capacity(); } in capacity() function
|
| D | VectorImpl.h | 65 size_t capacity() const;
|
| D | Vector.h | 79 inline size_t capacity() const { return VectorImpl::capacity(); } in capacity() function
|
| D | BasicHashtable.h | 211 inline size_t capacity() const { in capacity() function
|
| D | LruCache.h | 151 rehash(mTable->capacity() * 2); in put()
|