Lines Matching defs:edge
68 /* Leftmost edge on the current scan line. */
174 memset(polygon->y_buckets, 0, h * sizeof (struct edge *));
226 __DBG(("%s: edge height [%d, %d] = %d\n",
238 __DBG(("%s: vertical edge x:%d\n", __FUNCTION__, I(p1->x)));
248 __DBG(("%s: diagonal edge (%d, %d), x:[%d, %d]\n", __FUNCTION__, dx, dy, I(p1->x), I(p2->x)));
387 __DBG(("%s: adding edge (%d.%d) + (%d.%d)/%d, height=%d\n",
575 struct mono_edge *edge = c->head.next;
583 DBG_MONO_EDGES(edge);
589 while (&c->tail != edge) {
590 struct mono_edge *next = edge->next;
591 int16_t xend = I(edge->x.quo);
593 __DBG(("%s: adding edge dir=%d [winding=%d], x=%d [%d]\n",
594 __FUNCTION__, edge->dir, winding + edge->dir, xend, edge->x.quo));
595 if (--edge->height_left) {
596 if (edge->dy) {
597 edge->x.quo += edge->dxdy.quo;
598 edge->x.rem += edge->dxdy.rem;
599 if (edge->x.rem >= 0) {
600 ++edge->x.quo;
601 edge->x.rem -= edge->dy;
603 __DBG(("%s: stepped edge (%d.%d) + (%d.%d)/%d, height=%d, prev_x=%d\n",
604 __FUNCTION__, edge->x.quo, edge->x.rem, edge->dxdy.quo, edge->dxdy.rem, edge->dy, edge->height_left, edge->x.quo));
607 if (edge->x.quo < prev_x) {
608 struct mono_edge *pos = edge->prev;
613 } while (edge->x.quo < pos->x.quo);
614 pos->next->prev = edge;
615 edge->next = pos->next;
616 edge->prev = pos;
617 pos->next = edge;
619 prev_x = edge->x.quo;
621 edge->prev->next = next;
622 next->prev = edge->prev;
625 winding += edge->dir;
645 edge = next;
683 struct mono_edge *edge;
685 for (edge = c->head.next; edge != &c->tail; edge = edge->next) {
686 edge->height_left -= count;
687 if (! edge->height_left) {
688 edge->prev->next = edge->next;
689 edge->next->prev = edge->prev;