Lines Matching defs:edges
172 /* A collection of sorted and vertically clipped edges of the polygon.
179 /* Array of edges all starting in the same bucket. An edge is put
186 struct edge *edges;
190 /* A cell records the effect on pixel coverage of polygon edges
226 * The heights and areas are signed, with left edges of the polygon
227 * having positive sign and right edges having negative sign. When
228 * two edges intersect they swap their left/rightness so their
253 /* The active list contains edges in the current scan line ordered by
430 if (polygon->edges != polygon->edges_embedded)
431 free(polygon->edges);
442 polygon->edges = polygon->edges_embedded;
447 polygon->edges = malloc(sizeof(struct edge)*num_edges);
448 if (unlikely(NULL == polygon->edges))
513 struct edge *e = &polygon->edges[polygon->num_edges];
612 struct edge *e = &polygon->edges[polygon->num_edges];
703 struct edge *prev = &polygon->edges[polygon->num_edges-1];
823 static struct edge *filter(struct edge *edges)
827 e = edges;
840 edges = n->next;
851 return edges;
861 /* Test if the edges on the active list can be safely advanced by a
862 * full row without intersections or any edges ending. */
887 merge_edges(struct active_list *active, struct edge *edges)
889 active->head.next = merge_unsorted_edges(active->head.next, edges);
1213 __DBG(("%s: no new edges and no exisiting edges, skipping, %d -> %d\n",
1232 __DBG(("%s: y=%d, do_full_step=%d, new edges=%d\n",
1247 __DBG(("%s: vertical edges, full step (%d, %d)\n",
1547 __DBG(("%s: no new edges and no exisiting edges, skipping, %d -> %d\n",
1558 __DBG(("%s: y=%d, do_full_step=%d, new edges=%d\n",
1577 __DBG(("%s: vertical edges, full step (%d, %d)\n",