Home
last modified time | relevance | path

Searched refs:mTail (Results 1 – 5 of 5) sorted by relevance

/aosp12/frameworks/base/libs/hwui/thread/
H A DCommonPool.h43 constexpr bool hasWork() const { return mHead != mTail; } in hasWork()
44 constexpr bool hasSpace() const { return ((mHead + 1) % SIZE) != mTail; } in hasSpace()
46 if (mHead > mTail) { in size()
47 return mHead - mTail; in size()
49 return mTail - mHead + SIZE; in size()
55 LOG_ALWAYS_FATAL_IF(newHead == mTail, "no space"); in push()
62 LOG_ALWAYS_FATAL_IF(mTail == mHead, "empty"); in pop()
63 int index = mTail; in pop()
64 mTail = (mTail + 1) % SIZE; in pop()
73 int mTail = 0; variable
/aosp12/frameworks/base/core/java/com/android/internal/util/
H A DProcFileReader.java39 private int mTail; field in ProcFileReader
59 final int length = mBuffer.length - mTail; in fillBuf()
64 final int read = mStream.read(mBuffer, mTail, length); in fillBuf()
66 mTail += read; in fillBuf()
80 while (count < mTail && mBuffer[count] == ' ') { in consumeBuf()
83 System.arraycopy(mBuffer, count, mBuffer, 0, mTail - count); in consumeBuf()
84 mTail -= count; in consumeBuf()
85 if (mTail == 0) { in consumeBuf()
105 for (; i < mTail; i++) { in nextTokenIndex()
124 return mTail > 0; in hasMoreData()
[all …]
/aosp12/frameworks/base/core/java/android/util/
H A DLongArrayQueue.java38 private int mTail; field in LongArrayQueue
52 mHead = mTail = 0; in LongArrayQueue()
73 mTail = mSize; in grow()
88 mHead = mTail = 0; in clear()
100 mValues[mTail] = value; in addLast()
101 mTail = (mTail + 1) % mValues.length; in addLast()
162 final int index = (mTail == 0) ? mValues.length - 1 : mTail - 1; in peekLast()
/aosp12/system/chre/util/include/chre/util/
H A Darray_queue_impl.h63 return data()[mTail]; in back()
69 return data()[mTail]; in back()
89 new (&data()[mTail]) ElementType(element); in push()
98 new (&data()[mTail]) ElementType(std::move(element)); in push()
192 mTail = kCapacity - 1; in clear()
206 return iterator(data() + kCapacity, data(), mTail); in end()
266 if (mTail == 0) { in pullTail()
267 mTail = kCapacity - 1; in pullTail()
269 mTail--; in pullTail()
280 if (++mTail == kCapacity) { in pushTail()
[all …]
H A Darray_queue.h177 : mPointer(pointer), mBase(base), mTail(tail) {} in ArrayQueueIterator()
196 if (mPointer == (mBase + mTail)) {
222 size_t mTail; variable
262 size_t mTail = kCapacity - 1; variable