Searched refs:edgeCount (Results 1 – 2 of 2) sorted by relevance
204 int edgeCount = ptr - edgePtr;205 if (0 == edgeCount) {210 qsort(edgePtr, edgeCount, sizeof(*edgePtr), compare_edgeptr);211 for (i = 1; i < edgeCount; i++) {215 *edgeTail = edgePtr[edgeCount - 1];227 int edgeCount = rectCount * 2;228 SkAutoMalloc memory((sizeof(VEdge) + sizeof(VEdge*)) * edgeCount);230 VEdge* tail, *head = (VEdge*)(edgePtr + edgeCount);
348 int edgeCount = 0; in worst_case_edge_count() local356 edgeCount += 1; in worst_case_edge_count()360 edgeCount += 2; // might need 2 edges when we chop on Y extrema in worst_case_edge_count()364 edgeCount += 3; // might need 3 edges when we chop on Y extrema in worst_case_edge_count()374 return edgeCount; in worst_case_edge_count()386 int edgeCount = ptCount << 1; in cheap_worst_case_edge_count() local397 return edgeCount; in cheap_worst_case_edge_count()