Searched refs:capacity (Results 1 - 25 of 30) sorted by relevance

12

/system/bt/osi/src/
H A Darray.cc33 size_t capacity; member in struct:array_t
49 array->capacity = INTERNAL_ELEMENTS;
83 if (array->length == array->capacity && !grow(array)) {
85 "%s unable to grow array past current capacity of %zu elements "
87 __func__, array->capacity, array->element_size);
97 const size_t new_capacity = array->capacity + (array->capacity / 2);
109 array->capacity = new_capacity;
H A Dfixed_queue.cc36 size_t capacity; member in struct:fixed_queue_t
45 fixed_queue_t* fixed_queue_new(size_t capacity) { argument
50 ret->capacity = capacity;
55 ret->enqueue_sem = semaphore_new(capacity);
113 return queue->capacity;
/system/chre/util/tests/
H A Ddynamic_vector_test.cc60 EXPECT_EQ(vector.capacity(), 0);
68 EXPECT_EQ(vector.capacity(), 1);
82 EXPECT_EQ(vector.capacity(), 4);
90 EXPECT_EQ(vector.capacity(), 8);
158 EXPECT_EQ(vector.capacity(), 8);
202 EXPECT_EQ(vector.capacity(), 8);
327 ASSERT_EQ(vector.capacity(), 1);
333 ASSERT_EQ(vector.capacity(), 2);
339 // Insert at middle with spare capacity
340 ASSERT_EQ(vector.capacity(),
[all...]
H A Dpriority_queue_test.cc46 EXPECT_EQ(0, q.capacity());
88 EXPECT_EQ(1, q.capacity());
90 EXPECT_EQ(2, q.capacity());
92 EXPECT_EQ(4, q.capacity());
H A Dfixed_size_vector_test.cc47 ASSERT_EQ(testVector.capacity(), 8);
57 ASSERT_EQ(testVector.capacity(), 8);
/system/bt/osi/include/
H A Dleaky_bonded_queue.h30 * reaching its capacity. This is useful in creating memory bonded data
43 LeakyBondedQueue(size_t capacity);
68 * Returns the defined capacity of the queue
93 LeakyBondedQueue<T>::LeakyBondedQueue(size_t capacity) { argument
94 capacity_ = capacity;
H A Dfixed_queue.h33 // Creates a new fixed queue with the given |capacity|. If more elements than
34 // |capacity| are added to the queue, the caller is blocked until space is
37 fixed_queue_t* fixed_queue_new(size_t capacity);
74 // the caller. If the queue capacity would be exceeded by adding one more
/system/extras/tests/sdcard/
H A Dstopwatch.h84 // Create a stop watch. Default capacity == 2 * interval_nb
87 // @param capacity Hint about the number of sampless that will be
89 // to size the internal storage, when the capacity
91 StopWatch(const char *name, size_t capacity = kUseDefaultCapacity);
H A Dstopwatch.cpp54 StopWatch::StopWatch(const char *name, size_t capacity) argument
55 : mName(strdup(name)), mNum(0), mData(NULL), mDataLen(0), mCapacity(capacity * 2),
145 // Normally we should have enough capacity but if we have to
148 // a capacity when building the StopWatch.
154 fprintf(stderr, "# Increased capacity to %d for %s. Measurement affected.\n",
/system/media/audio_utils/include/audio_utils/
H A Dfifo.h49 * Return the capacity, or statically configured maximum frame count.
51 * \return The capacity in frames.
53 uint32_t capacity() const function in class:audio_utils_fifo_base
62 * aka "capacity".
105 /** Maximum usable frames to be stored in the FIFO > 0 && <= INT32_MAX, aka "capacity". */
151 * aka "capacity".
167 * aka "capacity".
243 * iovec[0].mOffset and iovec[1].mOffset are always < capacity.
257 * For a reader this is also guaranteed to be <= capacity.
302 * Return the capacity, o
306 uint32_t capacity() const function in class:audio_utils_fifo_provider
[all...]
/system/core/libutils/tests/
H A DVector_test.cpp90 ASSERT_EQ(8U, vector.capacity());
92 ASSERT_EQ(8U, vector.capacity());
99 // Checks that the size calculation (not the capacity calculation) doesn't
107 // This should fail because the calculated capacity will overflow even though
114 // This should fail because the capacity * sizeof(int) overflows, even
115 // though the capacity itself doesn't.
/system/chre/util/include/chre/util/
H A Dfixed_size_vector.h71 * @return The maximum capacity of the vector as defined by the template
74 size_t capacity() const;
H A Dpriority_queue.h59 * @return The capacity of the queue.
61 size_t capacity() const;
H A Dpriority_queue_impl.h42 size_t PriorityQueue<ElementType, CompareFunction>::capacity() const { function in class:chre::PriorityQueue
43 return mData.capacity();
109 // TODO: consider resizing the dynamic array to mData.capacity()/2
110 // when mData.size() <= mData.capacity()/4.
H A Ddynamic_vector.h60 * Removes all elements from the vector, but does not change the capacity.
94 * @return The capacity of the vector.
96 size_type capacity() const;
169 * Resizes the vector to a new capacity returning true if allocation was
170 * successful. If the new capacity is smaller than the current capacity,
177 * @param The new capacity of the vector.
202 * vector's capacity is increased if necessary to fit the given array, though
203 * note that this function will not cause the capacity to shrink. Upon
204 * successful reservation of necessary capacity, an
[all...]
/system/core/libmemunreachable/include/memunreachable/
H A Dmemunreachable.h69 memset(leaks.data(), 0, leaks.capacity() * sizeof(Leak));
/system/core/libutils/
H A DVectorImpl.cpp108 size_t VectorImpl::capacity() const function in class:android::VectorImpl
308 ALOG_ASSERT(index<capacity(),
309 "[%p] editItemLocation: index=%d, capacity=%d, count=%d",
310 this, (int)index, (int)capacity(), (int)mCount);
312 if (index < capacity()) {
323 ALOG_ASSERT(index<capacity(),
324 "[%p] itemLocation: index=%d, capacity=%d, count=%d",
325 this, (int)index, (int)capacity(), (int)mCount);
327 if (index < capacity()) {
338 // The capacity mus
[all...]
/system/core/base/
H A Dfile_test.cpp228 EXPECT_LT(s.capacity(), size + 16);
235 EXPECT_LT(s.capacity(), size + 16);
242 EXPECT_LT(s.capacity(), size + 16);
254 size_t initial_capacity = s.capacity();
258 EXPECT_EQ(initial_capacity, s.capacity());
/system/extras/simpleperf/
H A DUnixSocket.h57 explicit UnixSocketMessageBuffer(size_t capacity) argument
58 : data_(capacity), read_head_(0), valid_bytes_(0) {}
/system/core/include/utils/
H A DKeyedVector.h57 inline size_t capacity() const { return mVector.capacity(); } function in class:android::KeyedVector
58 //! sets the capacity. capacity can never be reduced less than size()
H A DVectorImpl.h65 size_t capacity() const;
H A DSortedVector.h68 inline size_t capacity() const { return VectorImpl::capacity(); } function in class:android::SortedVector
69 //! sets the capacity. capacity can never be reduced less than size()
/system/core/libutils/include/utils/
H A DKeyedVector.h57 inline size_t capacity() const { return mVector.capacity(); } function in class:android::KeyedVector
58 //! sets the capacity. capacity can never be reduced less than size()
H A DVectorImpl.h65 size_t capacity() const;
H A DSortedVector.h68 inline size_t capacity() const { return VectorImpl::capacity(); } function in class:android::SortedVector
69 //! sets the capacity. capacity can never be reduced less than size()

Completed in 513 milliseconds

12