Lines Matching defs:spans
77 #define YMIN(spans) (spans->points[0].y)
78 #define YMAX(spans) (spans->points[spans->count-1].y)
84 Spans *spans;
91 spans = spanGroup->group;
92 for (i = spanGroup->count; i; i--, spans++) {
93 if (YMIN(spans) <= ymax && ymin <= YMAX(spans)) {
97 spansCount = spans->count;
98 spansPt = spans->points;
99 spansWid = spans->widths;
131 spans->count--;
153 newPt = (DDXPointPtr) realloc(spans->points, (spans->count + EXTRA) * sizeof (DDXPointRec));
156 spansPt = newPt + (spansPt - spans->points);
157 spans->points = newPt;
158 newwid = (int *) realloc(spans->widths, (spans->count + EXTRA) * sizeof (int));
161 spansWid = newwid + (spansWid - spans->widths);
162 spans->widths = newwid;
167 spans->count++;
183 void miAppendSpans(SpanGroup *spanGroup, SpanGroup *otherGroup, Spans *spans)
188 spansCount = spans->count;
196 spanGroup->group[spanGroup->count] = *spans;
198 ymin = spans->points[0].y;
200 ymax = spans->points[spansCount - 1].y;
206 miSubtractSpans (otherGroup, spans);
211 free(spans->points);
212 free(spans->widths);
309 Spans *spans,
319 /* Uniquify the spans, and stash them into newPoints and newWidths. Return the
320 number of unique spans. */
325 oldPoints = spans->points;
326 oldWidths = spans->widths;
332 for (i = spans->count-1; i != 0; i--) {
364 Spans *spans;
368 spans = spanGroup->group + i;
369 free(spans->points);
370 free(spans->widths);
377 Spans *spans;
382 /* Outgoing spans for one big call to FillSpans */
391 spans = spanGroup->group;
393 (pDraw, pGC, spans->count, spans->points, spans->widths, TRUE);
394 free(spans->points);
395 free(spans->widths);
428 for (i = 0, spans = spanGroup->group;
430 i++, spans++) {
434 for (j = 0, points = spans->points, widths = spans->widths;
435 j != spans->count;
473 } /* for j through spans */
474 count += spans->count;
475 free(spans->points);
476 spans->points = NULL;
477 free(spans->widths);
478 spans->widths = NULL;