HomeSort by relevance Sort by last modified time
    Searched refs:mHead (Results 1 - 10 of 10) sorted by null

  /packages/apps/Gallery3D/src/com/cooliris/media/
Deque.java 23 private int mHead = 0;
38 return mHead == mTail;
42 return (mTail - mHead) & (mArray.length - 1); // CR: wtf?!? this
49 int head = mHead;
57 mHead = 0;
67 return array[(mHead + index) & (array.length - 1)];
72 int head = (mHead - 1) & (array.length - 1);
73 mHead = head;
86 if (mHead == tail) {
93 int head = mHead;
    [all...]
DirectLinkedList.java 20 private Entry<E> mHead;
53 mHead = entry;
74 mHead = next;
84 return mHead;
92 mHead = null;
  /device/htc/passion-common/libsensors/
InputEventReader.cpp 38 mHead(mBuffer),
53 const ssize_t nread = read(fd, mHead, mFreeSpace * sizeof(input_event));
61 mHead += numEventsRead;
63 if (mHead > mBufferEnd) {
64 size_t s = mHead - mBufferEnd;
66 mHead = mBuffer + s;
InputEventReader.h 33 struct input_event* mHead;
  /device/samsung/crespo/libsensors/
InputEventReader.cpp 38 mHead(mBuffer),
53 const ssize_t nread = read(fd, mHead, mFreeSpace * sizeof(input_event));
61 mHead += numEventsRead;
63 if (mHead > mBufferEnd) {
64 size_t s = mHead - mBufferEnd;
66 mHead = mBuffer + s;
InputEventReader.h 33 struct input_event* mHead;
  /external/astl/include/
list 174 reference front() { return *iterator(mHead.mNext); }
175 const_reference front() const { return *iterator(mHead.mNext); }
176 reference back() { return *iterator(mHead.mPrev); }
177 const_reference back() const { return *iterator(mHead.mPrev); }
180 iterator begin() { return iterator(mHead.mNext); }
181 const_iterator begin() const { return const_iterator(mHead.mNext); }
182 iterator end() { return iterator(&mHead); }
183 const_iterator end() const { return const_iterator(&mHead); }
191 void pop_front() { eraseAtPos(iterator(mHead.mNext)); }
195 void pop_back() { eraseAtPos(iterator(mHead.mPrev));
    [all...]
  /libcore/luni/src/main/native/
java_io_File.cpp 285 DirEntries() : mSize(0), mHead(NULL) {
289 while (mHead) {
295 DirEntry* oldHead = mHead;
296 mHead = new DirEntry(name);
297 if (mHead == NULL) {
300 mHead->next = oldHead;
306 return &mHead->name[0];
310 DirEntry* popped = mHead;
312 mHead = popped->next;
324 DirEntry* mHead;
    [all...]
  /development/apps/Term/src/com/android/term/
Term.java 652 private int mHead;
704 mHead = 0;
735 + ((mHead + mActiveTranscriptRows + row) % mActiveTranscriptRows);
789 mHead = (mHead + rollRows) % mActiveTranscriptRows;
820 checkEqual(mHead, 0);
822 checkRange(0, mHead, mActiveTranscriptRows-1);
    [all...]
  /system/core/libacc/
acc.cpp 775 int mHead;
780 mHead = 0;
785 mBuf[(mHead + mCount) & MASK] = data;
790 unsigned int result = mBuf[mHead];
791 mHead = (mHead + 1) & MASK;
814 return mBuf[(mHead + mCount + i) & MASK];
    [all...]

Completed in 677 milliseconds