Lines Matching defs:widths
96 subWid = sub->widths;
99 spansWid = spans->widths;
158 newwid = (int *) realloc(spans->widths, (spans->count + EXTRA) * sizeof (int));
161 spansWid = newwid + (spansWid - spans->widths);
162 spans->widths = newwid;
212 free(spans->widths);
223 int widths[],
239 tw = widths[a]; widths[a] = widths[b]; widths[b] = tw; \
258 tw = widths[i];
261 widths[k] = widths[k-1];
264 widths[j] = tw;
302 QuickSortSpansX(&points[j+1], &widths[j+1], numSpans-j-1);
326 oldWidths = spans->widths;
370 free(spans->widths);
384 int *widths;
393 (pDraw, pGC, spans->count, spans->points, spans->widths, TRUE);
395 free(spans->widths);
423 yspans[i].widths = NULL;
434 for (j = 0, points = spans->points, widths = spans->widths;
436 j++, points++, widths++) {
448 newspans->widths,
457 free(yspans[i].widths);
467 newspans->widths = newwidths;
470 newspans->widths[newspans->count] = *widths;
477 free(spans->widths);
478 spans->widths = NULL;
483 widths = malloc(count * sizeof(int));
484 if (!points || !widths)
491 free(yspans[i].widths);
496 free(widths);
504 QuickSortSpansX(yspans[i].points, yspans[i].widths, ycount);
506 (&(yspans[i]), &(points[count]), &(widths[count]));
509 widths[count] = yspans[i].widths[0];
513 free(yspans[i].widths);
517 (*pGC->ops->FillSpans) (pDraw, pGC, count, points, widths, TRUE);
519 free(widths);