37     SkPtrWrapper<ClassName> fNext
59         T* next = entry->fNext;  in remove()
62             prev->fNext = next;  in remove()
73         entry->fNext = nullptr;  in remove()
81         SkASSERT(nullptr == entry->fPrev && nullptr == entry->fNext);  in addToHead()
85         entry->fNext = fHead;  in addToHead()
100         SkASSERT(nullptr == entry->fPrev && nullptr == entry->fNext);  in addToTail()
104         entry->fNext = nullptr;  in addToTail()
106             fTail->fNext = entry;  in addToTail()
132         newEntry->fNext = existingEntry;  in addBefore()
140             prev->fNext = newEntry;  in addBefore()
162         T* next = existingEntry->fNext;  in addAfter()
163         existingEntry->fNext = newEntry;  in addAfter()
164         newEntry->fNext = next;  in addAfter()
187             fTail->fNext = list.fHead;  in concat()
192         for (T* node = list.fHead; node; node = node->fNext) {  in concat()
241             fCurr = fCurr->fNext;  in next()
282                 SkASSERT(item->fPrev->fNext == item);  in validate()
284             if (nullptr == item->fNext) {  in validate()
287                 SkASSERT(item->fNext->fPrev == item);  in validate()
305         for (T* entry = fHead; entry; entry = entry->fNext) {  in countEntries()