Lines Matching defs:edges
60 struct mono_edge *edges;
164 polygon->edges = polygon->edges_embedded;
166 polygon->edges = malloc (num_edges * sizeof (struct mono_edge));
167 if (unlikely (polygon->edges == NULL)) {
184 if (polygon->edges != polygon->edges_embedded)
185 free(polygon->edges);
233 e = polygon->edges + polygon->num_edges++;
359 static struct mono_edge *mono_filter(struct mono_edge *edges)
363 e = edges;
379 edges = n->next;
393 return edges;
405 __dbg_mono_edges(const char *function, struct mono_edge *edges)
408 while (edges) {
409 if (edges->x.quo < INT16_MAX << 16) {
411 edges->x.quo, edges->x.rem,
412 edges->dxdy.quo, edges->dxdy.rem,
413 edges->dy*edges->dir));
415 edges = edges->next;
421 VALIDATE_MONO_EDGES(struct mono_edge *edges)
423 int prev_x = edges->x.quo;
424 while ((edges = edges->next)) {
425 assert(edges->x.quo >= prev_x);
426 prev_x = edges->x.quo;
436 mono_merge_edges(struct mono *c, struct mono_edge *edges)
440 DBG_MONO_EDGES(edges);
442 for (e = edges; c->is_vertical && e; e = e->next)
445 c->head.next = mono_merge_unsorted_edges(c->head.next, edges);
705 __DBG(("%s: row=%d, new edges? %d\n", __FUNCTION__,
732 /* XXX recompute after dropping edges? */