Lines Matching refs:entry
48 void remove(T* entry) {
50 SkASSERT(this->isInList(entry));
52 T* prev = entry->fPrev;
53 T* next = entry->fNext;
66 entry->fPrev = NULL;
67 entry->fNext = NULL;
70 entry->fList = NULL;
74 void addToHead(T* entry) {
75 SkASSERT(NULL == entry->fPrev && NULL == entry->fNext);
76 SkASSERT(NULL == entry->fList);
78 entry->fPrev = NULL;
79 entry->fNext = fHead;
81 fHead->fPrev = entry;
83 fHead = entry;
85 fTail = entry;
89 entry->fList = this;
93 void addToTail(T* entry) {
94 SkASSERT(NULL == entry->fPrev && NULL == entry->fNext);
95 SkASSERT(NULL == entry->fList);
97 entry->fPrev = fTail;
98 entry->fNext = NULL;
100 fTail->fNext = entry;
102 fTail = entry;
104 fHead = entry;
108 entry->fList = this;
113 * Inserts a new list entry before an existing list entry. The new entry must not already be
114 * a member of this or any other list. If existingEntry is NULL then the new entry is added
142 * Inserts a new list entry after an existing list entry. The new entry must not already be
143 * a member of this or any other list. If existingEntry is NULL then the new entry is added
246 * Debugging-only method that uses the list back pointer to check if 'entry' is indeed in 'this'
249 bool isInList(const T* entry) const {
250 return entry->fList == this;
258 for (T* entry = fHead; NULL != entry; entry = entry->fNext) {
