22         fNext   = fPrev = nullptr;  in init()
23         fBegin  = fEnd = nullptr;  in init()
30         , fInitialStorage(nullptr)  in SkDeque()
34     fFrontBlock = fBackBlock = nullptr;  in SkDeque()
35     fFront = fBack = nullptr;  in SkDeque()
43     SkASSERT(storageSize == 0 || storage != nullptr);  in SkDeque()
50         fFrontBlock = nullptr;  in SkDeque()
53     fFront = fBack = nullptr;  in SkDeque()
72     if (nullptr == fFrontBlock) {  in push_front()
80     if (nullptr == first->fBegin) {  in push_front()
98     if (nullptr == fFront) {  in push_front()
99         SkASSERT(nullptr == fBack);  in push_front()
112     if (nullptr == fBackBlock) {  in push_back()
120     if (nullptr == last->fBegin) {  in push_back()
139     if (nullptr == fBack) {  in push_back()
140         SkASSERT(nullptr == fFront);  in push_back()
156     SkASSERT(first != nullptr);  in pop_front()
158     if (first->fBegin == nullptr) {  // we were marked empty from before  in pop_front()
160         first->fPrev = nullptr;  in pop_front()
163         SkASSERT(first != nullptr);    // else we popped too far  in pop_front()
174         first->fBegin = first->fEnd = nullptr;  // mark as empty  in pop_front()
175         if (nullptr == first->fNext) {  in pop_front()
176             fFront = fBack = nullptr;  in pop_front()
190     SkASSERT(last != nullptr);  in pop_back()
192     if (last->fEnd == nullptr) {  // we were marked empty from before  in pop_back()
194         last->fNext = nullptr;  in pop_back()
197         SkASSERT(last != nullptr);  // else we popped too far  in pop_back()
208         last->fBegin = last->fEnd = nullptr;    // mark as empty  in pop_back()
209         if (nullptr == last->fPrev) {  in pop_back()
210             fFront = fBack = nullptr;  in pop_back()
240 SkDeque::Iter::Iter() : fCurBlock(nullptr), fPos(nullptr), fElemSize(0) {}  in Iter()
257             } while (fCurBlock != nullptr && fCurBlock->fBegin == nullptr);  in next()
258             next = fCurBlock ? fCurBlock->fBegin : nullptr;  in next()
276             } while (fCurBlock != nullptr && fCurBlock->fEnd == nullptr);  in prev()
277             prev = fCurBlock ? fCurBlock->fEnd - fElemSize : nullptr;  in prev()
295         while (fCurBlock && nullptr == fCurBlock->fBegin) {  in reset()
298         fPos = fCurBlock ? fCurBlock->fBegin : nullptr;  in reset()
302         while (fCurBlock && nullptr == fCurBlock->fEnd) {  in reset()
305         fPos = fCurBlock ? fCurBlock->fEnd - fElemSize : nullptr;  in reset()