Lines Matching refs:edges
349 /* We begin by generating a sorted table of edges for the current */
358 /* Note that the edges table is sorted along the segment/edge */
380 AF_Edge edge = axis->edges + ee;
479 AF_Edge edges = axis->edges;
480 AF_Edge edge_limit = edges + axis->num_edges;
484 for ( edge = edges; edge < edge_limit; edge++ )
497 for ( edge = edges; edge < edge_limit; edge++ )
1021 AF_Edge edges = axis->edges;
1022 AF_Edge edge_limit = edges + axis->num_edges;
1030 /* now we align all stem edges. */
1031 for ( edge = edges; edge < edge_limit; edge++ )
1039 /* skip all non-stem edges */
1137 edge - edges, edge2 - edges,
1149 /* In general, lowercase m's have six vertical edges if they are sans */
1158 /* We don't handle horizontal edges since we can't easily assure that */
1162 n_edges = edge_limit - edges;
1171 edge1 = edges;
1172 edge2 = edges + 2;
1173 edge3 = edges + 4;
1177 edge1 = edges + 1;
1178 edge2 = edges + 5;
1179 edge3 = edges + 9;
1201 ( edges + 8 )->pos -= delta;
1202 ( edges + 11 )->pos -= delta;
1215 * now hint the remaining edges (serifs and single) in order
1218 for ( edge = edges; edge < edge_limit; edge++ )
1234 for ( edge = edges; edge < edge_limit; edge++ )
1244 while ( --before >= edges )
1252 if ( before >= edges || after < edge_limit )
1254 if ( before < edges )
1278 AF_Edge edges = axis->edges;
1279 AF_Edge edge_limit = edges + axis->num_edges;
1289 for ( edge = edges; edge < edge_limit; edge++ )
