45         : fHead(nullptr)  in SkTInternalLList()
50         fHead = nullptr;  in reset()
55         SkASSERT(fHead && fTail);  in remove()
64             fHead = next;  in remove()
85         entry->fNext = fHead;  in addToHead()
86         if (fHead) {  in addToHead()
87             fHead->fPrev = entry;  in addToHead()
89         fHead = entry;  in addToHead()
109         if (nullptr == fHead) {  in addToTail()
110             fHead = entry;  in addToTail()
137             SkASSERT(fHead == existingEntry);  in addBefore()
138             fHead = newEntry;  in addBefore()
181         list.fHead->fPrev = fTail;  in concat()
182         if (!fHead) {  in concat()
183             SkASSERT(!list.fHead->fPrev);  in concat()
184             fHead = list.fHead;  in concat()
187             fTail->fNext = list.fHead;  in concat()
192         for (T* node = list.fHead; node; node = node->fNext) {  in concat()
198         list.fHead = list.fTail = nullptr;  in concat()
202         SkASSERT(SkToBool(fHead) == SkToBool(fTail));  in isEmpty()
203         return !fHead;  in isEmpty()
206     T* head() { return fHead; }  in head()
222                 fCurr = list.fHead;  in init()
275         SkASSERT(!fHead == !fTail);  in validate()
280                 SkASSERT(fHead == item);  in validate()
305         for (T* entry = fHead; entry; entry = entry->fNext) {  in countEntries()
313     T* fHead;