Lines Matching refs:fQueueCount
58 if (fQueueCount) {
59 SkASSERT(fQueueCount >= 2);
61 if (fQueueCount >= 2) {
64 SkASSERT(fQueueCount == 1);
67 fQueueCount = 0;
71 SkASSERT(fQueueCount == 0 || fQueueCount == 1);
92 if (fQueueCount == 1) {
101 if (!fQueueCount) {
116 SkASSERT(fQueueCount >= 2);
130 Verb firstVerbInContour() const { SkASSERT(fQueueCount > 0); return fFirstVerbInContour; }
132 SkASSERT(fQueueCount > 0);
139 SkASSERT(0 <= i && i < fQueueCount);
143 return this->atVerb(fQueueCount - 1);
146 SkASSERT(0 <= i && i < fQueueCount);
150 return this->atPts(fQueueCount - 1);
153 SkASSERT(0 <= i && i < fQueueCount);
159 SkASSERT(fQueueCount < kQueueBufferCount);
160 int i = (fQueueFrontIdx + fQueueCount) & (kQueueBufferCount - 1);
164 ++fQueueCount;
167 SkASSERT(fQueueCount > 0);
169 --fQueueCount;
176 if (fQueueCount) {
205 // fQueueCount=0 means this subpath is zero length. Generates caps on its location.
360 int fQueueCount = 0;