Lines Matching refs:edges
914 /* We begin by generating a sorted table of edges for the current */
923 /* Note that the edges table is sorted along the segment/edge */
945 AF_Edge edge = axis->edges + ee;
1044 AF_Edge edges = axis->edges;
1045 AF_Edge edge_limit = edges + axis->num_edges;
1049 for ( edge = edges; edge < edge_limit; edge++ )
1062 for ( edge = edges; edge < edge_limit; edge++ )
1175 AF_Edge edge = axis->edges;
1212 /* if it is a top zone, check for right edges -- if it is a bottom */
1213 /* zone, check for left edges */
1673 AF_Edge edges = axis->edges;
1674 AF_Edge edge_limit = edges + axis->num_edges;
1685 FT_TRACE5(( "==== cjk hinting %s edges =====\n",
1690 for ( edge = edges; edge < edge_limit; edge++ )
1719 edge1-edges, edge1->fpos, edge1->opos / 64.0, blue->fit / 64.0,
1736 /* now we align all stem edges. */
1737 for ( edge = edges; edge < edge_limit; edge++ )
1745 /* skip all non-stem edges */
1757 * aligning the two edges, but rather interpolate
1773 FT_TRACE5(( "ASSERTION FAILED for edge %d\n", edge2-edges ));
1785 * usually the two edges belonging
1874 edge - edges, edge2 - edges,
1888 /* In general, lowercase m's have six vertical edges if they are sans */
1897 /* We don't handle horizontal edges since we can't easily assure that */
1901 n_edges = edge_limit - edges;
1910 edge1 = edges;
1911 edge2 = edges + 2;
1912 edge3 = edges + 4;
1916 edge1 = edges + 1;
1917 edge2 = edges + 5;
1918 edge3 = edges + 9;
1940 ( edges + 8 )->pos -= delta;
1941 ( edges + 11 )->pos -= delta;
1954 * now hint the remaining edges (serifs and single) in order
1957 for ( edge = edges; edge < edge_limit; edge++ )
1973 for ( edge = edges; edge < edge_limit; edge++ )
1983 while ( --before >= edges )
1991 if ( before >= edges || after < edge_limit )
1993 if ( before < edges )
2017 AF_Edge edges = axis->edges;
2018 AF_Edge edge_limit = edges + axis->num_edges;
2028 for ( edge = edges; edge < edge_limit; edge++ )
