Lines Matching refs:points
77 #define YMIN(spans) (spans->points[0].y)
78 #define YMAX(spans) (spans->points[spans->count-1].y)
95 subPt = sub->points;
98 spansPt = spans->points;
153 newPt = (DDXPointPtr) realloc(spans->points, (spans->count + EXTRA) * sizeof (DDXPointRec));
156 spansPt = newPt + (spansPt - spans->points);
157 spans->points = newPt;
198 ymin = spans->points[0].y;
200 ymax = spans->points[spansCount - 1].y;
211 free(spans->points);
222 DDXPointRec points[],
238 tpt = points[a]; points[a] = points[b]; points[b] = tpt; \
247 xprev = points[0].x;
250 x = points[i].x;
252 /* points[i] is out of order. Move into proper location. */
256 for (j = 0; x >= points[j].x; j++) {}
257 tpt = points[i];
260 points[k] = points[k-1];
263 points[j] = tpt;
265 x = points[i].x;
275 if (points[m].x > points[0].x) ExchangeSpans(m, 0);
276 if (points[m].x > points[numSpans-1].x) ExchangeSpans(m, numSpans-1);
277 if (points[m].x > points[0].x) ExchangeSpans(m, 0);
278 x = points[0].x;
284 r = &(points[i]);
289 r = &(points[j]);
302 QuickSortSpansX(&points[j+1], &widths[j+1], numSpans-j-1);
325 oldPoints = spans->points;
369 free(spans->points);
383 DDXPointPtr points;
393 (pDraw, pGC, spans->count, spans->points, spans->widths, TRUE);
394 free(spans->points);
422 yspans[i].points = NULL;
434 for (j = 0, points = spans->points, widths = spans->widths;
436 j++, points++, widths++) {
437 index = points->y - ymin;
445 newspans->points,
456 free(yspans[i].points);
466 newspans->points = newpoints;
469 newspans->points[newspans->count] = *points;
475 free(spans->points);
476 spans->points = NULL;
482 points = malloc(count * sizeof(DDXPointRec));
484 if (!points || !widths)
490 free(yspans[i].points);
495 free(points);
504 QuickSortSpansX(yspans[i].points, yspans[i].widths, ycount);
506 (&(yspans[i]), &(points[count]), &(widths[count]));
508 points[count] = yspans[i].points[0];
512 free(yspans[i].points);
517 (*pGC->ops->FillSpans) (pDraw, pGC, count, points, widths, TRUE);
518 free(points);