Lines Matching defs:count

46     int vertexCount() const { return fPositions.count(); }
47     int indexCount() const { return fIndices.count(); }
183     SkASSERT(fPathPolygon.count() > 0);
222     if (fPathPolygon.count() > 1) {
223         if (!this->accumulateCentroid(fPathPolygon[fPathPolygon.count() - 1], fPathPolygon[0])) {
229     if (fPathPolygon.count() > 2) {
233         if (!checkConvexity(fPathPolygon[fPathPolygon.count() - 2],
234                             fPathPolygon[fPathPolygon.count() - 1],
237             fPathPolygon[0] = fPathPolygon[fPathPolygon.count() - 1];
257     bounds.setBounds(&fPathPolygon[0], fPathPolygon.count());
258     for (int i = 1; i < fPathPolygon.count(); ++i) {
260         if (i == fPathPolygon.count() - 1) {
286         if (!SkInsetConvexPolygon(&fPathPolygon[0], fPathPolygon.count(), inset,
304     int polyCount = fPathPolygon.count();
312     fFirstVertexIndex = fPositions.count();
349     SkASSERT(fPositions.count() >= 3);
352             this->appendTriangle(fFirstVertexIndex, fPositions.count() - 1,
355             this->appendTriangle(fFirstVertexIndex, fPositions.count() - 1,
361             fPositions[fFirstVertexIndex + 2] = fPositions[fPositions.count() - 1];
363             fPositions[fFirstVertexIndex + 1] = fPositions[fPositions.count() - 1];
371     SkASSERT(fClipPolygon.count() >= 3);
372     fCurrClipIndex = fClipPolygon.count() - 1;
384     for (int p = 1; p < fClipPolygon.count(); ++p) {
386         v0 = fClipPolygon[(p + 1) % fClipPolygon.count()] - fClipPolygon[p];
394     SkASSERT(fClipVectors.count() == fClipPolygon.count());
413         ? fPositions.count() - 1
414         : fPositions.count() - 2;
453     this->appendTriangle(prevPenumbraIndex, fPositions.count() - 1, currUmbraIndex);
485         fCurrClipIndex = (fCurrClipIndex + 1) % fClipPolygon.count();
512             *currUmbraIndex = fPositions.count();
528     int next = (index + dir) % umbraPolygon.count();
536         dir = umbraPolygon.count() - 1;
540     next = (index + dir) % umbraPolygon.count();
545         next = (index + dir) % umbraPolygon.count();
554     if (!SkIsSimplePolygon(&fPathPolygon[0], fPathPolygon.count())) {
561     umbraIndices.setReserve(fPathPolygon.count());
562     if (!SkOffsetSimplePolygon(&fPathPolygon[0], fPathPolygon.count(), fPathBounds, inset,
571     penumbraPolygon.setReserve(umbraPolygon.count());
572     penumbraIndices.setReserve(umbraPolygon.count());
573     if (!SkOffsetSimplePolygon(&fPathPolygon[0], fPathPolygon.count(), fPathBounds, -outset,
579     if (!umbraPolygon.count() || !penumbraPolygon.count()) {
594     SkAutoSTMalloc<64, uint16_t> indexMap(umbraPolygon.count());
599     for (int i = 1; i < (*penumbraIndices).count(); ++i) {
609     for (int i = 1; i < (*umbraIndices).count(); ++i) {
618     int maxPenumbraIndex = fPathPolygon.count() - 1;
619     int maxUmbraIndex = fPathPolygon.count() - 1;
622             (*penumbraIndices)[currPenumbra] += fPathPolygon.count();
624             currPenumbra = (currPenumbra + 1) % penumbraPolygon.count();
626             (*umbraIndices)[currUmbra] += fPathPolygon.count();
628             currUmbra = (currUmbra + 1) % umbraPolygon.count();
640     int nextPenumbra = (currPenumbra + 1) % penumbraPolygon.count();
641     int nextUmbra = (currUmbra + 1) % umbraPolygon.count();
649             int currPenumbraIndex = fPositions.count() - 1;
653             int currUmbraIndex = fPositions.count() - 1;
660             (*penumbraIndices)[currPenumbra] += fPathPolygon.count();
662             nextPenumbra = (currPenumbra + 1) % penumbraPolygon.count();
665             (*umbraIndices)[currUmbra] += fPathPolygon.count();
667             nextUmbra = (currUmbra + 1) % umbraPolygon.count();
675             int currPenumbraIndex = fPositions.count() - 1;
681             (*penumbraIndices)[currPenumbra] += fPathPolygon.count();
683             nextPenumbra = (currPenumbra + 1) % penumbraPolygon.count();
691             int currUmbraIndex = fPositions.count() - 1;
698             (*umbraIndices)[currUmbra] += fPathPolygon.count();
700             nextUmbra = (currUmbra + 1) % umbraPolygon.count();
706     int currPenumbraIndex = fPositions.count() - 1;
710     int currUmbraIndex = fPositions.count() - 1;
717         SkTriangulateSimplePolygon(umbraPolygon.begin(), indexMap, umbraPolygon.count(),
740     if (fPathPolygon.count() > 0) {
741         if (!this->accumulateCentroid(fPathPolygon[fPathPolygon.count() - 1], pSanitized)) {
747     if (fPathPolygon.count() > 1) {
748         if (!checkConvexity(fPathPolygon[fPathPolygon.count() - 2],
749                             fPathPolygon[fPathPolygon.count() - 1],
754             if (duplicate_pt(fPathPolygon[fPathPolygon.count() - 1], pSanitized)) {
781     int count = GrPathUtils::generateQuadraticPoints(pts[0], pts[1], pts[2],
783     fPointBuffer.setCount(count);
784     for (int i = 0; i < count; i++) {
806     int count = GrPathUtils::generateCubicPoints(pts[0], pts[1], pts[2], pts[3],
808     fPointBuffer.setCount(count);
809     for (int i = 0; i < count; i++) {
828     int count = quadder.countQuads();
829     for (int i = 0; i < count; ++i) {
833         quadPts[2] = i == count - 1 ? pts[2] : quads[1];
855         this->appendTriangle(fPrevUmbraIndex, fPositions.count() - 1, fPositions.count() - 2);
862         this->appendTriangle(fPrevUmbraIndex, fPositions.count() - 1, fPositions.count() - 2);
919     if (fPathPolygon.count() < 3 || !SkScalarIsFinite(fArea)) {
1020     if (fClipPolygon.count() < 3 || fPathPolygon.count() < 3 || !SkScalarIsFinite(fArea)) {
1140     if (fClipPolygon.isEmpty() || !duplicate_pt(point, fClipPolygon[fClipPolygon.count() - 1])) {