Searched refs:mTail (Results 1 – 5 of 5) sorted by relevance
24 private int mTail; field in CircularArray39 mTail = n; in doubleCapacity()84 if (mHead == mTail) { in addFirst()94 mElements[mTail] = e; in addLast()95 mTail = (mTail + 1) & mCapacityBitmask; in addLast()96 if (mTail == mHead) { in addLast()107 if (mHead == mTail) { in popFirst()122 if (mHead == mTail) { in popLast()125 int t = (mTail - 1) & mCapacityBitmask; in popLast()128 mTail = t; in popLast()[all …]
25 private int mTail; field in CircularIntArray40 mTail = n; in doubleCapacity()85 if (mHead == mTail) { in addFirst()95 mElements[mTail] = e; in addLast()96 mTail = (mTail + 1) & mCapacityBitmask; in addLast()97 if (mTail == mHead) { in addLast()108 if (mHead == mTail) throw new ArrayIndexOutOfBoundsException(); in popFirst()120 if (mHead == mTail) throw new ArrayIndexOutOfBoundsException(); in popLast()121 int t = (mTail - 1) & mCapacityBitmask; in popLast()123 mTail = t; in popLast()[all …]
39 private int mTail; field in ProcFileReader59 final int length = mBuffer.length - mTail; in fillBuf()64 final int read = mStream.read(mBuffer, mTail, length); in fillBuf()66 mTail += read; in fillBuf()78 System.arraycopy(mBuffer, count, mBuffer, 0, mTail - count); in consumeBuf()79 mTail -= count; in consumeBuf()80 if (mTail == 0) { in consumeBuf()100 for (; i < mTail; i++) { in nextTokenIndex()119 return mTail > 0; in hasMoreData()135 for (; i < mTail; i++) { in finishLine()
48 TaskQueue::TaskQueue() : mHead(nullptr), mTail(nullptr) {} in TaskQueue()55 mTail = nullptr; in next()69 LOG_ALWAYS_FATAL_IF(task->mNext || mTail == task, "Task is already in the queue!"); in queue()70 if (mTail) { in queue()72 if (mTail->mRunAt <= task->mRunAt) { in queue()73 mTail->mNext = task; in queue()74 mTail = task; in queue()91 mTail = task; in queue()96 mTail = mHead = task; in queue()102 if (mTail) { in queueAtFront()[all …]
64 RenderTask* mTail; variable