Lines Matching defs:arcs
86 * Self intersecting arcs (i.e. those spanning 360 degrees)
87 * never join with other arcs, and are drawn without caps
92 * double dash arcs are drawn in two parts, first the
203 * This is an entire sequence of arcs, computed and categorized according
209 miArcDataPtr arcs;
234 static void miFreeArcs(miPolyArcPtr arcs, GCPtr pGC);
994 /* find bounding box around arcs */
1101 arcData = &polyArcs[iphase].arcs[i];
1105 if (polyArcs[iphase].arcs[i].render) {
1108 * don't cap self-joining arcs
1110 if (polyArcs[iphase].arcs[i].selfJoin &&
1111 cap[iphase] < polyArcs[iphase].arcs[i].cap)
1113 while (cap[iphase] < polyArcs[iphase].arcs[i].cap) {
1119 arcData0 = &polyArcs[iphase].arcs[arcIndex];
1127 while (join[iphase] < polyArcs[iphase].arcs[i].join) {
1140 arcData0 = &polyArcs[phase0].arcs[arcIndex0];
1141 arcData1 = &polyArcs[phase1].arcs[arcIndex1];
1287 * don't miter arcs with less than 11 degrees between them
1701 miPolyArcPtr arcs,
1710 if (arcs[iphase].narcs > 0)
1711 free(arcs[iphase].arcs);
1712 if (arcs[iphase].njoins > 0)
1713 free(arcs[iphase].joins);
1714 if (arcs[iphase].ncaps > 0)
1715 free(arcs[iphase].caps);
1717 free(arcs);
1777 miPolyArcPtr arcs;
1804 arcs = malloc(sizeof (*arcs) * (isDoubleDash ? 2 : 1));
1805 if (!arcs)
1826 arcs[iphase].njoins = 0;
1827 arcs[iphase].joins = 0;
1830 arcs[iphase].ncaps = 0;
1831 arcs[iphase].caps = 0;
1834 arcs[iphase].narcs = 0;
1835 arcs[iphase].arcs = 0;
1870 addCap (&arcs[iphase].caps, &arcs[iphase].ncaps,
1888 ** deal with dashed arcs. Use special rules for certain 0 area arcs.
1889 ** Presumably, the other 0 area arcs still aren't done right.
1939 * add dashed arcs to each bucket
1947 /* avoid troubles with huge arcs and small dashes */
1990 arc = addArc (&arcs[iphase].arcs, &arcs[iphase].narcs,
1999 addCap (&arcs[iphase].caps,
2000 &arcs[iphase].ncaps,
2002 arc - arcs[iphase].arcs);
2006 addCap (&arcs[iphase].caps,
2007 &arcs[iphase].ncaps,
2009 arc - arcs[iphase].arcs);
2012 arc->cap = arcs[iphase].ncaps;
2013 arc->join = arcs[iphase].njoins;
2036 arc = addArc (&arcs[prevphase].arcs, &arcs[prevphase].narcs,
2040 arc->join = arcs[prevphase].njoins;
2041 arc->cap = arcs[prevphase].ncaps;
2045 arc = addArc (&arcs[iphase].arcs, &arcs[iphase].narcs,
2049 arc->join = arcs[iphase].njoins;
2050 arc->cap = arcs[iphase].ncaps;
2055 k = arcs[prevphase].narcs - 1;
2057 nextk = arcs[iphase].narcs;
2089 * arcs are computed second, the results
2096 addJoin (&arcs[joinphase].joins,
2097 &arcs[joinphase].njoins,
2101 arc->join = arcs[prevphase].njoins;
2111 addCap (&arcs[prevphase].caps, &arcs[prevphase].ncaps,
2113 arc->cap = arcs[prevphase].ncaps;
2120 nextk = arcs[iphase].narcs;
2138 addCap (&arcs[iphase].caps, &arcs[iphase].ncaps,
2149 if (arcs[iphase].narcs > 0) {
2150 arcs[iphase].arcs[arcs[iphase].narcs-1].render = 1;
2151 arcs[iphase].arcs[arcs[iphase].narcs-1].join =
2152 arcs[iphase].njoins;
2153 arcs[iphase].arcs[arcs[iphase].narcs-1].cap =
2154 arcs[iphase].ncaps;
2157 return arcs;
2159 miFreeArcs(arcs, pGC);
2325 * scan convert wide arcs.
2329 * draw zero width/height arcs
2977 * create whole arcs out of pieces. This code is
3235 * only deal with arcs completely contained in the