Lines Matching defs:edges
158 /* A collection of sorted and vertically clipped edges of the polygon.
165 /* Array of edges all starting in the same bucket. An edge is put
172 struct edge *edges;
176 /* A cell records the effect on pixel coverage of polygon edges
212 * The heights and areas are signed, with left edges of the polygon
213 * having positive sign and right edges having negative sign. When
214 * two edges intersect they swap their left/rightness so their
239 /* The active list contains edges in the current scan line ordered by
418 if (polygon->edges != polygon->edges_embedded)
419 free(polygon->edges);
430 polygon->edges = polygon->edges_embedded;
435 polygon->edges = malloc(sizeof(struct edge)*num_edges);
436 if (unlikely(NULL == polygon->edges))
473 struct edge *e = &polygon->edges[polygon->num_edges];
550 struct edge *e = &polygon->edges[polygon->num_edges];
626 struct edge *prev = &polygon->edges[polygon->num_edges-1];
743 static struct edge *filter(struct edge *edges)
747 e = edges;
759 edges = n->next;
769 return edges;
779 /* Test if the edges on the active list can be safely advanced by a
780 * full row without intersections or any edges ending. */
805 merge_edges(struct active_list *active, struct edge *edges)
807 active->head.next = merge_unsorted_edges(active->head.next, edges);
1204 __DBG(("%s: no new edges and no exisiting edges, skipping, %d -> %d\n",
1223 __DBG(("%s: y=%d-%d, do_full_step=%d, new edges=%d\n",
1239 __DBG(("%s: vertical edges, full step (%d, %d)\n",
1579 __DBG(("%s: no new edges and no exisiting edges, skipping, %d -> %d\n",
1590 __DBG(("%s: y=%d, do_full_step=%d, new edges=%d, min_height=%d, vertical=%d\n",
1612 __DBG(("%s: vertical edges, full step (%d, %d)\n",