third_party/cairo/src/cairo-tor22-scan-converter.c
inline static int
can_do_full_row (struct active_list *active)
{
    const struct edge *e;

    /* Recomputes the minimum height of all edges on the active
     * list if we have been dropping edges. */
    if (active->min_height <= 0) {
	int min_height = INT_MAX;
	int is_vertical = 1;

	e = active->head.next;
	while (NULL != e) {
	    if (e->height_left < min_height)
		min_height = e->height_left;
	    is_vertical &= e->vertical;
	    e = e->next;
	}

	active->is_vertical = is_vertical;
	active->min_height = min_height;
    }

    if (active->min_height < GRID_Y)
	return 0;

    return active->is_vertical;
}
/* Test if the edges on the active list can be safely advanced by a
 * full row without intersections or any edges ending. */
Test if the edges on the active list can be safely advanced by a
full row without intersections or any edges ending.
Test if the edges on the active list can be safely advanced by a full row without intersections or any edges ending .
inline static int
can_do_full_row (struct active_list *active)
{
    const struct edge *e;
    if (active->min_height <= 0) {
	int min_height = INT_MAX;
	int is_vertical = 1;
	e = active->head.next;
	while (NULL != e) {
	    if (e->height_left < min_height)
		min_height = e->height_left;
	    is_vertical &= e->vertical;
	    e = e->next;
	}
	active->is_vertical = is_vertical;
	active->min_height = min_height;
    }
    if (active->min_height < GRID_Y)
	return 0;
    return active->is_vertical;
}
inline static int can_do_full_row ( struct active_list * active ) { const struct edge * e ; if ( active -> min_height <= 0 ) { int min_height = INT_MAX ; int is_vertical = 1 ; e = active -> head . next ; while ( NULL != e ) { if ( e -> height_left < min_height ) min_height = e -> height_left ; is_vertical &= e -> vertical ; e = e -> next ; } active -> is_vertical = is_vertical ; active -> min_height = min_height ; } if ( active -> min_height < GRID_Y ) return 0 ; return active -> is_vertical ; }
Test if the edges on the active list can be safely advanced by a
 full row without intersections or any edges ending.
Test if the edges on the active list can be safely advanced by a full row without intersections or any edges ending .
/* Recomputes the minimum height of all edges on the active
     * list if we have been dropping edges. */