diff options
| -rw-r--r-- | src/sna/Makefile.am | 4 | ||||
| -rw-r--r-- | src/sna/sna_trapezoids.c | 6700 | ||||
| -rw-r--r-- | src/sna/sna_trapezoids.h | 225 | ||||
| -rw-r--r-- | src/sna/sna_trapezoids_boxes.c | 1459 | ||||
| -rw-r--r-- | src/sna/sna_trapezoids_imprecise.c | 4008 | ||||
| -rw-r--r-- | src/sna/sna_trapezoids_mono.c | 1427 |
6 files changed, 7125 insertions, 6698 deletions
diff --git a/src/sna/Makefile.am b/src/sna/Makefile.am index 030869de..e9064b68 100644 --- a/src/sna/Makefile.am +++ b/src/sna/Makefile.am @@ -66,7 +66,11 @@ libsna_la_SOURCES = \ sna_render_inline.h \ sna_reg.h \ sna_stream.c \ + sna_trapezoids.h \ sna_trapezoids.c \ + sna_trapezoids_boxes.c \ + sna_trapezoids_imprecise.c \ + sna_trapezoids_mono.c \ sna_tiling.c \ sna_transform.c \ sna_threads.c \ diff --git a/src/sna/sna_trapezoids.c b/src/sna/sna_trapezoids.c index 627ce6bc..a50d205a 100644 --- a/src/sna/sna_trapezoids.c +++ b/src/sna/sna_trapezoids.c @@ -34,6 +34,7 @@ #include "sna.h" #include "sna_render.h" #include "sna_render_inline.h" +#include "sna_trapezoids.h" #include "fb/fbpict.h" #include <mipict.h> @@ -44,13 +45,6 @@ #define __DBG(x) #endif -#define NO_ACCEL 0 -#define FORCE_FALLBACK 0 -#define NO_ALIGNED_BOXES 0 -#define NO_UNALIGNED_BOXES 0 -#define NO_SCAN_CONVERTER 0 -#define NO_GPU_THREADS 0 - /* TODO: Emit unantialiased and MSAA triangles. */ #ifndef MAX @@ -61,2205 +55,9 @@ #define MIN(x,y) ((x) <= (y) ? (x) : (y)) #endif -#define SAMPLES_X 17 -#define SAMPLES_Y 15 - -#define FAST_SAMPLES_shift 2 -#define FAST_SAMPLES_X (1<<FAST_SAMPLES_shift) -#define FAST_SAMPLES_Y (1<<FAST_SAMPLES_shift) -#define FAST_SAMPLES_mask ((1<<FAST_SAMPLES_shift)-1) - #define region_count(r) ((r)->data ? (r)->data->numRects : 1) #define region_boxes(r) ((r)->data ? (BoxPtr)((r)->data + 1) : &(r)->extents) -typedef void (*span_func_t)(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage); - -#if HAS_DEBUG_FULL -static void _assert_pixmap_contains_box(PixmapPtr pixmap, BoxPtr box, const char *function) -{ - if (box->x1 < 0 || box->y1 < 0 || - box->x2 > pixmap->drawable.width || - box->y2 > pixmap->drawable.height) - { - ErrorF("%s: damage box is beyond the pixmap: box=(%d, %d), (%d, %d), pixmap=(%d, %d)\n", - __FUNCTION__, - box->x1, box->y1, box->x2, box->y2, - pixmap->drawable.width, - pixmap->drawable.height); - assert(0); - } -} -#define assert_pixmap_contains_box(p, b) _assert_pixmap_contains_box(p, b, __FUNCTION__) -#else -#define assert_pixmap_contains_box(p, b) -#endif - -static void apply_damage(struct sna_composite_op *op, RegionPtr region) -{ - DBG(("%s: damage=%p, region=%ldx[(%d, %d), (%d, %d)]\n", - __FUNCTION__, op->damage, - (long)REGION_NUM_RECTS(region), - region->extents.x1, region->extents.y1, - region->extents.x2, region->extents.y2)); - - if (op->damage == NULL) - return; - - RegionTranslate(region, op->dst.x, op->dst.y); - - assert_pixmap_contains_box(op->dst.pixmap, RegionExtents(region)); - sna_damage_add(op->damage, region); -} - -static void _apply_damage_box(struct sna_composite_op *op, const BoxRec *box) -{ - BoxRec r; - - r.x1 = box->x1 + op->dst.x; - r.x2 = box->x2 + op->dst.x; - r.y1 = box->y1 + op->dst.y; - r.y2 = box->y2 + op->dst.y; - - assert_pixmap_contains_box(op->dst.pixmap, &r); - sna_damage_add_box(op->damage, &r); -} - -inline static void apply_damage_box(struct sna_composite_op *op, const BoxRec *box) -{ - if (op->damage) - _apply_damage_box(op, box); -} - -typedef int grid_scaled_x_t; -typedef int grid_scaled_y_t; - -#define FAST_SAMPLES_X_TO_INT_FRAC(x, i, f) \ - _GRID_TO_INT_FRAC_shift(x, i, f, FAST_SAMPLES_shift) - -#define FAST_SAMPLES_INT(x) ((x) >> (FAST_SAMPLES_shift)) -#define FAST_SAMPLES_FRAC(x) ((x) & (FAST_SAMPLES_mask)) - -#define _GRID_TO_INT_FRAC_shift(t, i, f, b) do { \ - (f) = FAST_SAMPLES_FRAC(t); \ - (i) = FAST_SAMPLES_INT(t); \ -} while (0) - -/* A grid area is a real in [0,1] scaled by 2*SAMPLES_X*SAMPLES_Y. We want - * to be able to represent exactly areas of subpixel trapezoids whose - * vertices are given in grid scaled coordinates. The scale factor - * comes from needing to accurately represent the area 0.5*dx*dy of a - * triangle with base dx and height dy in grid scaled numbers. */ -typedef int grid_area_t; -#define FAST_SAMPLES_XY (2*FAST_SAMPLES_X*FAST_SAMPLES_Y) /* Unit area on the grid. */ - -#define AREA_TO_ALPHA(c) ((c) / (float)FAST_SAMPLES_XY) - -struct quorem { - int32_t quo; - int32_t rem; -}; - -struct edge { - struct edge *next, *prev; - - int dir; - - grid_scaled_y_t height_left; - - /* Current x coordinate while the edge is on the active - * list. Initialised to the x coordinate of the top of the - * edge. The quotient is in grid_scaled_x_t units and the - * remainder is mod dy in grid_scaled_y_t units.*/ - struct quorem x; - - /* Advance of the current x when moving down a subsample line. */ - struct quorem dxdy; - grid_scaled_y_t dy; - - /* The clipped y of the top of the edge. */ - grid_scaled_y_t ytop; - - /* y2-y1 after orienting the edge downwards. */ -}; - -/* Number of subsample rows per y-bucket. Must be SAMPLES_Y. */ -#define EDGE_Y_BUCKET_HEIGHT FAST_SAMPLES_Y -#define EDGE_Y_BUCKET_INDEX(y, ymin) (((y) - (ymin))/EDGE_Y_BUCKET_HEIGHT) - -/* A collection of sorted and vertically clipped edges of the polygon. - * Edges are moved from the polygon to an active list while scan - * converting. */ -struct polygon { - /* The vertical clip extents. */ - grid_scaled_y_t ymin, ymax; - - /* Array of edges all starting in the same bucket. An edge is put - * into bucket EDGE_BUCKET_INDEX(edge->ytop, polygon->ymin) when - * it is added to the polygon. */ - struct edge **y_buckets; - struct edge *y_buckets_embedded[64]; - - struct edge edges_embedded[32]; - struct edge *edges; - int num_edges; -}; - -/* A cell records the effect on pixel coverage of polygon edges - * passing through a pixel. It contains two accumulators of pixel - * coverage. - * - * Consider the effects of a polygon edge on the coverage of a pixel - * it intersects and that of the following one. The coverage of the - * following pixel is the height of the edge multiplied by the width - * of the pixel, and the coverage of the pixel itself is the area of - * the trapezoid formed by the edge and the right side of the pixel. - * - * +-----------------------+-----------------------+ - * | | | - * | | | - * |_______________________|_______________________| - * | \...................|.......................|\ - * | \..................|.......................| | - * | \.................|.......................| | - * | \....covered.....|.......................| | - * | \....area.......|.......................| } covered height - * | \..............|.......................| | - * |uncovered\.............|.......................| | - * | area \............|.......................| | - * |___________\...........|.......................|/ - * | | | - * | | | - * | | | - * +-----------------------+-----------------------+ - * - * Since the coverage of the following pixel will always be a multiple - * of the width of the pixel, we can store the height of the covered - * area instead. The coverage of the pixel itself is the total - * coverage minus the area of the uncovered area to the left of the - * edge. As it's faster to compute the uncovered area we only store - * that and subtract it from the total coverage later when forming - * spans to blit. - * - * The heights and areas are signed, with left edges of the polygon - * having positive sign and right edges having negative sign. When - * two edges intersect they swap their left/rightness so their - * contribution above and below the intersection point must be - * computed separately. */ -struct cell { - struct cell *next; - int x; - grid_area_t uncovered_area; - grid_scaled_y_t covered_height; -}; - -/* A cell list represents the scan line sparsely as cells ordered by - * ascending x. It is geared towards scanning the cells in order - * using an internal cursor. */ -struct cell_list { - struct cell *cursor; - - /* Points to the left-most cell in the scan line. */ - struct cell head, tail; - - int16_t x1, x2; - int16_t count, size; - struct cell *cells; - struct cell embedded[256]; -}; - -/* The active list contains edges in the current scan line ordered by - * the x-coordinate of the intercept of the edge and the scan line. */ -struct active_list { - /* Leftmost edge on the current scan line. */ - struct edge head, tail; - - /* A lower bound on the height of the active edges is used to - * estimate how soon some active edge ends. We can't advance the - * scan conversion by a full pixel row if an edge ends somewhere - * within it. */ - grid_scaled_y_t min_height; - int is_vertical; -}; - -struct tor { - struct polygon polygon[1]; - struct active_list active[1]; - struct cell_list coverages[1]; - - /* Clip box. */ - grid_scaled_x_t xmin, xmax; - grid_scaled_y_t ymin, ymax; -}; - -/* Compute the floored division a/b. Assumes / and % perform symmetric - * division. */ -inline static struct quorem -floored_divrem(int a, int b) -{ - struct quorem qr; - qr.quo = a/b; - qr.rem = a%b; - if (qr.rem < 0) { - qr.quo -= 1; - qr.rem += b; - } - return qr; -} - -/* Compute the floored division (x*a)/b. Assumes / and % perform symmetric - * division. */ -static struct quorem -floored_muldivrem(int32_t x, int32_t a, int32_t b) -{ - struct quorem qr; - int64_t xa = (int64_t)x*a; - qr.quo = xa/b; - qr.rem = xa%b; - if (qr.rem < 0) { - qr.quo -= 1; - qr.rem += b; - } - return qr; -} - -/* Rewinds the cell list's cursor to the beginning. After rewinding - * we're good to cell_list_find() the cell any x coordinate. */ -inline static void -cell_list_rewind(struct cell_list *cells) -{ - cells->cursor = &cells->head; -} - -static bool -cell_list_init(struct cell_list *cells, int x1, int x2) -{ - cells->tail.next = NULL; - cells->tail.x = INT_MAX; - cells->head.x = INT_MIN; - cells->head.next = &cells->tail; - cells->head.covered_height = 0; - cell_list_rewind(cells); - cells->count = 0; - cells->x1 = x1; - cells->x2 = x2; - cells->size = x2 - x1 + 1; - cells->cells = cells->embedded; - if (cells->size > ARRAY_SIZE(cells->embedded)) - cells->cells = malloc(cells->size * sizeof(struct cell)); - return cells->cells != NULL; -} - -static void -cell_list_fini(struct cell_list *cells) -{ - if (cells->cells != cells->embedded) - free(cells->cells); -} - -inline static void -cell_list_reset(struct cell_list *cells) -{ - cell_list_rewind(cells); - cells->head.next = &cells->tail; - cells->head.covered_height = 0; - cells->count = 0; -} - -inline static struct cell * -cell_list_alloc(struct cell_list *cells, - struct cell *tail, - int x) -{ - struct cell *cell; - - assert(cells->count < cells->size); - cell = cells->cells + cells->count++; - cell->next = tail->next; - tail->next = cell; - - cell->x = x; - cell->covered_height = 0; - cell->uncovered_area = 0; - return cell; -} - -/* Find a cell at the given x-coordinate. Returns %NULL if a new cell - * needed to be allocated but couldn't be. Cells must be found with - * non-decreasing x-coordinate until the cell list is rewound using - * cell_list_rewind(). Ownership of the returned cell is retained by - * the cell list. */ -inline static struct cell * -cell_list_find(struct cell_list *cells, int x) -{ - struct cell *tail = cells->cursor; - - if (tail->x == x) - return tail; - - if (x >= cells->x2) - return &cells->tail; - - if (x < cells->x1) - return &cells->head; - - do { - if (tail->next->x > x) - break; - - tail = tail->next; - if (tail->next->x > x) - break; - - tail = tail->next; - if (tail->next->x > x) - break; - - tail = tail->next; - } while (1); - - if (tail->x != x) - tail = cell_list_alloc (cells, tail, x); - - return cells->cursor = tail; -} - -/* Add a subpixel span covering [x1, x2) to the coverage cells. */ -inline static void -cell_list_add_subspan(struct cell_list *cells, - grid_scaled_x_t x1, - grid_scaled_x_t x2) -{ - struct cell *cell; - int ix1, fx1; - int ix2, fx2; - - if (x1 == x2) - return; - - FAST_SAMPLES_X_TO_INT_FRAC(x1, ix1, fx1); - FAST_SAMPLES_X_TO_INT_FRAC(x2, ix2, fx2); - - __DBG(("%s: x1=%d (%d+%d), x2=%d (%d+%d)\n", __FUNCTION__, - x1, ix1, fx1, x2, ix2, fx2)); - - cell = cell_list_find(cells, ix1); - if (ix1 != ix2) { - cell->uncovered_area += 2*fx1; - ++cell->covered_height; - - cell = cell_list_find(cells, ix2); - cell->uncovered_area -= 2*fx2; - --cell->covered_height; - } else - cell->uncovered_area += 2*(fx1-fx2); -} - -inline static void -cell_list_add_span(struct cell_list *cells, - grid_scaled_x_t x1, - grid_scaled_x_t x2) -{ - struct cell *cell; - int ix1, fx1; - int ix2, fx2; - - FAST_SAMPLES_X_TO_INT_FRAC(x1, ix1, fx1); - FAST_SAMPLES_X_TO_INT_FRAC(x2, ix2, fx2); - - __DBG(("%s: x1=%d (%d+%d), x2=%d (%d+%d)\n", __FUNCTION__, - x1, ix1, fx1, x2, ix2, fx2)); - - cell = cell_list_find(cells, ix1); - if (ix1 != ix2) { - cell->uncovered_area += 2*fx1*FAST_SAMPLES_Y; - cell->covered_height += FAST_SAMPLES_Y; - - cell = cell_list_find(cells, ix2); - cell->uncovered_area -= 2*fx2*FAST_SAMPLES_Y; - cell->covered_height -= FAST_SAMPLES_Y; - } else - cell->uncovered_area += 2*(fx1-fx2)*FAST_SAMPLES_Y; -} - -static void -polygon_fini(struct polygon *polygon) -{ - if (polygon->y_buckets != polygon->y_buckets_embedded) - free(polygon->y_buckets); - - if (polygon->edges != polygon->edges_embedded) - free(polygon->edges); -} - -static bool -polygon_init(struct polygon *polygon, - int num_edges, - grid_scaled_y_t ymin, - grid_scaled_y_t ymax) -{ - unsigned h = ymax - ymin; - unsigned num_buckets = - EDGE_Y_BUCKET_INDEX(ymax+EDGE_Y_BUCKET_HEIGHT-1, ymin); - - if (unlikely(h > 0x7FFFFFFFU - EDGE_Y_BUCKET_HEIGHT)) - goto bail_no_mem; /* even if you could, you wouldn't want to. */ - - polygon->edges = polygon->edges_embedded; - polygon->y_buckets = polygon->y_buckets_embedded; - - polygon->num_edges = 0; - if (num_edges > (int)ARRAY_SIZE(polygon->edges_embedded)) { - polygon->edges = malloc(sizeof(struct edge)*num_edges); - if (unlikely(NULL == polygon->edges)) - goto bail_no_mem; - } - - if (num_buckets >= ARRAY_SIZE(polygon->y_buckets_embedded)) { - polygon->y_buckets = malloc((1+num_buckets)*sizeof(struct edge *)); - if (unlikely(NULL == polygon->y_buckets)) - goto bail_no_mem; - } - memset(polygon->y_buckets, 0, num_buckets * sizeof(struct edge *)); - polygon->y_buckets[num_buckets] = (void *)-1; - - polygon->ymin = ymin; - polygon->ymax = ymax; - return true; - -bail_no_mem: - polygon_fini(polygon); - return false; -} - -static void -_polygon_insert_edge_into_its_y_bucket(struct polygon *polygon, struct edge *e) -{ - unsigned ix = EDGE_Y_BUCKET_INDEX(e->ytop, polygon->ymin); - struct edge **ptail = &polygon->y_buckets[ix]; - e->next = *ptail; - *ptail = e; -} - -inline static void -polygon_add_edge(struct polygon *polygon, - grid_scaled_x_t x1, - grid_scaled_x_t x2, - grid_scaled_y_t y1, - grid_scaled_y_t y2, - grid_scaled_y_t top, - grid_scaled_y_t bottom, - int dir) -{ - struct edge *e = &polygon->edges[polygon->num_edges]; - grid_scaled_x_t dx = x2 - x1; - grid_scaled_y_t dy = y2 - y1; - grid_scaled_y_t ytop, ybot; - grid_scaled_y_t ymin = polygon->ymin; - grid_scaled_y_t ymax = polygon->ymax; - - __DBG(("%s: edge=(%d [%d.%d], %d [%d.%d]), (%d [%d.%d], %d [%d.%d]), top=%d [%d.%d], bottom=%d [%d.%d], dir=%d\n", - __FUNCTION__, - x1, FAST_SAMPLES_INT(x1), FAST_SAMPLES_FRAC(x1), - y1, FAST_SAMPLES_INT(y1), FAST_SAMPLES_FRAC(y1), - x2, FAST_SAMPLES_INT(x2), FAST_SAMPLES_FRAC(x2), - y2, FAST_SAMPLES_INT(y2), FAST_SAMPLES_FRAC(y2), - top, FAST_SAMPLES_INT(top), FAST_SAMPLES_FRAC(top), - bottom, FAST_SAMPLES_INT(bottom), FAST_SAMPLES_FRAC(bottom), - dir)); - assert (dy > 0); - - e->dy = dy; - e->dir = dir; - - ytop = top >= ymin ? top : ymin; - ybot = bottom <= ymax ? bottom : ymax; - e->ytop = ytop; - e->height_left = ybot - ytop; - if (e->height_left <= 0) - return; - - if (dx == 0) { - e->x.quo = x1; - e->x.rem = 0; - e->dy = 0; - e->dxdy.quo = 0; - e->dxdy.rem = 0; - } else { - e->dxdy = floored_divrem(dx, dy); - if (ytop == y1) { - e->x.quo = x1; - e->x.rem = 0; - } else { - e->x = floored_muldivrem(ytop - y1, dx, dy); - e->x.quo += x1; - } - } - e->x.rem -= dy; /* Bias the remainder for faster edge advancement. */ - - _polygon_insert_edge_into_its_y_bucket(polygon, e); - polygon->num_edges++; -} - -inline static void -polygon_add_line(struct polygon *polygon, - const xPointFixed *p1, - const xPointFixed *p2) -{ - struct edge *e = &polygon->edges[polygon->num_edges]; - grid_scaled_x_t dx = p2->x - p1->x; - grid_scaled_y_t dy = p2->y - p1->y; - grid_scaled_y_t top, bot; - - if (dy == 0) - return; - - __DBG(("%s: line=(%d, %d), (%d, %d)\n", - __FUNCTION__, (int)p1->x, (int)p1->y, (int)p2->x, (int)p2->y)); - - e->dir = 1; - if (dy < 0) { - const xPointFixed *t; - - dx = -dx; - dy = -dy; - - e->dir = -1; - - t = p1; - p1 = p2; - p2 = t; - } - assert (dy > 0); - e->dy = dy; - - top = MAX(p1->y, polygon->ymin); - bot = MIN(p2->y, polygon->ymax); - if (bot <= top) - return; - - e->ytop = top; - e->height_left = bot - top; - if (e->height_left <= 0) - return; - - if (dx == 0) { - e->x.quo = p1->x; - e->x.rem = -dy; - e->dxdy.quo = 0; - e->dxdy.rem = 0; - e->dy = 0; - } else { - e->dxdy = floored_divrem(dx, dy); - if (top == p1->y) { - e->x.quo = p1->x; - e->x.rem = -dy; - } else { - e->x = floored_muldivrem(top - p1->y, dx, dy); - e->x.quo += p1->x; - e->x.rem -= dy; - } - } - - if (polygon->num_edges > 0) { - struct edge *prev = &polygon->edges[polygon->num_edges-1]; - /* detect degenerate triangles inserted into tristrips */ - if (e->dir == -prev->dir && - e->ytop == prev->ytop && - e->height_left == prev->height_left && - e->x.quo == prev->x.quo && - e->x.rem == prev->x.rem && - e->dxdy.quo == prev->dxdy.quo && - e->dxdy.rem == prev->dxdy.rem) { - unsigned ix = EDGE_Y_BUCKET_INDEX(e->ytop, - polygon->ymin); - polygon->y_buckets[ix] = prev->next; - polygon->num_edges--; - return; - } - } - - _polygon_insert_edge_into_its_y_bucket(polygon, e); - polygon->num_edges++; -} - -static void -active_list_reset(struct active_list *active) -{ - active->head.height_left = INT_MAX; - active->head.x.quo = INT_MIN; - active->head.dy = 0; - active->head.prev = NULL; - active->head.next = &active->tail; - active->tail.prev = &active->head; - active->tail.next = NULL; - active->tail.x.quo = INT_MAX; - active->tail.height_left = INT_MAX; - active->tail.dy = 0; - active->min_height = INT_MAX; - active->is_vertical = 1; -} - -static struct edge * -merge_sorted_edges(struct edge *head_a, struct edge *head_b) -{ - struct edge *head, **next, *prev; - int32_t x; - - if (head_b == NULL) - return head_a; - - prev = head_a->prev; - next = &head; - if (head_a->x.quo <= head_b->x.quo) { - head = head_a; - } else { - head = head_b; - head_b->prev = prev; - goto start_with_b; - } - - do { - x = head_b->x.quo; - while (head_a != NULL && head_a->x.quo <= x) { - prev = head_a; - next = &head_a->next; - head_a = head_a->next; - } - - head_b->prev = prev; - *next = head_b; - if (head_a == NULL) - return head; - -start_with_b: - x = head_a->x.quo; - while (head_b != NULL && head_b->x.quo <= x) { - prev = head_b; - next = &head_b->next; - head_b = head_b->next; - } - - head_a->prev = prev; - *next = head_a; - if (head_b == NULL) - return head; - } while (1); -} - -static struct edge * -sort_edges(struct edge *list, - unsigned int level, - struct edge **head_out) -{ - struct edge *head_other, *remaining; - unsigned int i; - - head_other = list->next; - if (head_other == NULL) { - *head_out = list; - return NULL; - } - - remaining = head_other->next; - if (list->x.quo <= head_other->x.quo) { - *head_out = list; - head_other->next = NULL; - } else { - *head_out = head_other; - head_other->prev = list->prev; - head_other->next = list; - list->prev = head_other; - list->next = NULL; - } - - for (i = 0; i < level && remaining; i++) { - remaining = sort_edges(remaining, i, &head_other); - *head_out = merge_sorted_edges(*head_out, head_other); - } - - return remaining; -} - -static struct edge *filter(struct edge *edges) -{ - struct edge *e; - - e = edges; - do { - struct edge *n = e->next; - if (e->dir == -n->dir && - e->height_left == n->height_left && - *(uint64_t *)&e->x == *(uint64_t *)&n->x && - *(uint64_t *)&e->dxdy == *(uint64_t *)&n->dxdy) { - if (e->prev) - e->prev->next = n->next; - else - edges = n->next; - if (n->next) - n->next->prev = e->prev; - else - break; - - e = n->next; - } else - e = e->next; - } while (e->next); - - return edges; -} - -static struct edge * -merge_unsorted_edges (struct edge *head, struct edge *unsorted) -{ - sort_edges (unsorted, UINT_MAX, &unsorted); - return merge_sorted_edges (head, filter(unsorted)); -} - -/* Test if the edges on the active list can be safely advanced by a - * full row without intersections or any edges ending. */ -inline static bool -can_full_step(struct active_list *active) -{ - /* Recomputes the minimum height of all edges on the active - * list if we have been dropping edges. */ - if (active->min_height <= 0) { - const struct edge *e; - int min_height = INT_MAX; - int is_vertical = 1; - - for (e = active->head.next; &active->tail != e; e = e->next) { - if (e->height_left < min_height) - min_height = e->height_left; - if (is_vertical) - is_vertical = e->dy == 0; - } - - active->is_vertical = is_vertical; - active->min_height = min_height; - } - - if (active->min_height < FAST_SAMPLES_Y) - return false; - - return active->is_vertical; -} - -inline static void -merge_edges(struct active_list *active, struct edge *edges) -{ - active->head.next = merge_unsorted_edges (active->head.next, edges); -} - -inline static void -fill_buckets(struct active_list *active, - struct edge *edge, - struct edge **buckets) -{ - int min_height = active->min_height; - int is_vertical = active->is_vertical; - - while (edge) { - struct edge *next = edge->next; - struct edge **b = &buckets[edge->ytop & (FAST_SAMPLES_Y-1)]; - if (*b) - (*b)->prev = edge; - edge->next = *b; - edge->prev = NULL; - *b = edge; - if (edge->height_left < min_height) - min_height = edge->height_left; - if (is_vertical) - is_vertical = edge->dy == 0; - edge = next; - } - - active->is_vertical = is_vertical; - active->min_height = min_height; -} - -inline static void -nonzero_subrow(struct active_list *active, struct cell_list *coverages) -{ - struct edge *edge = active->head.next; - grid_scaled_x_t prev_x = INT_MIN; - int winding = 0, xstart = edge->x.quo; - - cell_list_rewind (coverages); - - while (&active->tail != edge) { - struct edge *next = edge->next; - - winding += edge->dir; - if (0 == winding && edge->next->x.quo != edge->x.quo) { - cell_list_add_subspan(coverages, - xstart, edge->x.quo); - xstart = edge->next->x.quo; - } - - if (--edge->height_left) { - if (edge->dy) { - edge->x.quo += edge->dxdy.quo; - edge->x.rem += edge->dxdy.rem; - if (edge->x.rem >= 0) { - ++edge->x.quo; - edge->x.rem -= edge->dy; - } - } - - if (edge->x.quo < prev_x) { - struct edge *pos = edge->prev; - pos->next = next; - next->prev = pos; - do { - pos = pos->prev; - } while (edge->x.quo < pos->x.quo); - pos->next->prev = edge; - edge->next = pos->next; - edge->prev = pos; - pos->next = edge; - } else - prev_x = edge->x.quo; - } else { - edge->prev->next = next; - next->prev = edge->prev; - active->min_height = -1; - } - - edge = next; - } -} - -static void -nonzero_row(struct active_list *active, struct cell_list *coverages) -{ - struct edge *left = active->head.next; - - assert(active->is_vertical); - - while (&active->tail != left) { - struct edge *right; - int winding = left->dir; - - left->height_left -= FAST_SAMPLES_Y; - if (! left->height_left) { - left->prev->next = left->next; - left->next->prev = left->prev; - } - - right = left->next; - do { - right->height_left -= FAST_SAMPLES_Y; - if (!right->height_left) { - right->prev->next = right->next; - right->next->prev = right->prev; - } - - winding += right->dir; - if (0 == winding) - break; - - right = right->next; - } while (1); - - cell_list_add_span(coverages, left->x.quo, right->x.quo); - left = right->next; - } -} - -static void -tor_fini(struct tor *converter) -{ - polygon_fini(converter->polygon); - cell_list_fini(converter->coverages); -} - -static bool -tor_init(struct tor *converter, const BoxRec *box, int num_edges) -{ - __DBG(("%s: (%d, %d),(%d, %d) x (%d, %d), num_edges=%d\n", - __FUNCTION__, - box->x1, box->y1, box->x2, box->y2, - FAST_SAMPLES_X, FAST_SAMPLES_Y, - num_edges)); - - converter->xmin = box->x1; - converter->ymin = box->y1; - converter->xmax = box->x2; - converter->ymax = box->y2; - - if (!cell_list_init(converter->coverages, box->x1, box->x2)) - return false; - - active_list_reset(converter->active); - if (!polygon_init(converter->polygon, - num_edges, - box->y1 * FAST_SAMPLES_Y, - box->y2 * FAST_SAMPLES_Y)) { - cell_list_fini(converter->coverages); - return false; - } - - return true; -} - -static void -tor_add_edge(struct tor *converter, - const xTrapezoid *t, - const xLineFixed *edge, - int dir) -{ - polygon_add_edge(converter->polygon, - edge->p1.x, edge->p2.x, - edge->p1.y, edge->p2.y, - t->top, t->bottom, - dir); -} - -static void -step_edges(struct active_list *active, int count) -{ - struct edge *edge; - - count *= FAST_SAMPLES_Y; - for (edge = active->head.next; edge != &active->tail; edge = edge->next) { - edge->height_left -= count; - if (! edge->height_left) { - edge->prev->next = edge->next; - edge->next->prev = edge->prev; - } - } -} - -static void -tor_blt_span(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage) -{ - __DBG(("%s: %d -> %d @ %d\n", __FUNCTION__, box->x1, box->x2, coverage)); - - op->box(sna, op, box, AREA_TO_ALPHA(coverage)); - apply_damage_box(&op->base, box); -} - -static void -tor_blt_span__no_damage(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage) -{ - __DBG(("%s: %d -> %d @ %d\n", __FUNCTION__, box->x1, box->x2, coverage)); - - op->box(sna, op, box, AREA_TO_ALPHA(coverage)); -} - -static void -tor_blt_span_clipped(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage) -{ - pixman_region16_t region; - float opacity; - - opacity = AREA_TO_ALPHA(coverage); - __DBG(("%s: %d -> %d @ %f\n", __FUNCTION__, box->x1, box->x2, opacity)); - - pixman_region_init_rects(®ion, box, 1); - RegionIntersect(®ion, ®ion, clip); - if (REGION_NUM_RECTS(®ion)) { - op->boxes(sna, op, - REGION_RECTS(®ion), - REGION_NUM_RECTS(®ion), - opacity); - apply_damage(&op->base, ®ion); - } - pixman_region_fini(®ion); -} - -static void -tor_blt_span_mono(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage) -{ - if (coverage < FAST_SAMPLES_XY/2) - return; - - tor_blt_span(sna, op, clip, box, FAST_SAMPLES_XY); -} - -static void -tor_blt_span_mono_clipped(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage) -{ - if (coverage < FAST_SAMPLES_XY/2) - return; - - tor_blt_span_clipped(sna, op, clip, box, FAST_SAMPLES_XY); -} - -static void -tor_blt_span_mono_unbounded(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage) -{ - tor_blt_span(sna, op, clip, box, - coverage < FAST_SAMPLES_XY/2 ? 0 : FAST_SAMPLES_XY); -} - -static void -tor_blt_span_mono_unbounded_clipped(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage) -{ - tor_blt_span_clipped(sna, op, clip, box, - coverage < FAST_SAMPLES_XY/2 ? 0 : FAST_SAMPLES_XY); -} - -static void -tor_blt(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - void (*span)(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage), - struct cell_list *cells, - int y, int height, - int xmin, int xmax, - int unbounded) -{ - struct cell *cell; - BoxRec box; - int cover; - - box.y1 = y; - box.y2 = y + height; - box.x1 = xmin; - - /* Form the spans from the coverages and areas. */ - cover = cells->head.covered_height*FAST_SAMPLES_X*2; - assert(cover >= 0); - for (cell = cells->head.next; cell != &cells->tail; cell = cell->next) { - int x = cell->x; - - assert(x >= xmin); - assert(x < xmax); - __DBG(("%s: cell=(%d, %d, %d), cover=%d, max=%d\n", __FUNCTION__, - cell->x, cell->covered_height, cell->uncovered_area, - cover, xmax)); - - if (cell->covered_height || cell->uncovered_area) { - box.x2 = x; - if (box.x2 > box.x1 && (unbounded || cover)) { - __DBG(("%s: span (%d, %d)x(%d, %d) @ %d\n", __FUNCTION__, - box.x1, box.y1, - box.x2 - box.x1, - box.y2 - box.y1, - cover)); - span(sna, op, clip, &box, cover); - } - box.x1 = box.x2; - cover += cell->covered_height*FAST_SAMPLES_X*2; - } - - if (cell->uncovered_area) { - int area = cover - cell->uncovered_area; - box.x2 = x + 1; - if (unbounded || area) { - __DBG(("%s: span (%d, %d)x(%d, %d) @ %d\n", __FUNCTION__, - box.x1, box.y1, - box.x2 - box.x1, - box.y2 - box.y1, - area)); - span(sna, op, clip, &box, area); - } - box.x1 = box.x2; - } - } - - box.x2 = xmax; - if (box.x2 > box.x1 && (unbounded || cover)) { - __DBG(("%s: span (%d, %d)x(%d, %d) @ %d\n", __FUNCTION__, - box.x1, box.y1, - box.x2 - box.x1, - box.y2 - box.y1, - cover)); - span(sna, op, clip, &box, cover); - } -} - -static void -tor_blt_empty(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - void (*span)(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage), - int y, int height, - int xmin, int xmax) -{ - BoxRec box; - - box.x1 = xmin; - box.x2 = xmax; - box.y1 = y; - box.y2 = y + height; - - span(sna, op, clip, &box, 0); -} - -flatten static void -tor_render(struct sna *sna, - struct tor *converter, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - void (*span)(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage), - int unbounded) -{ - int ymin = converter->ymin; - int xmin = converter->xmin; - int xmax = converter->xmax; - int i, j, h = converter->ymax - ymin; - struct polygon *polygon = converter->polygon; - struct cell_list *coverages = converter->coverages; - struct active_list *active = converter->active; - struct edge *buckets[FAST_SAMPLES_Y] = { 0 }; - - __DBG(("%s: unbounded=%d\n", __FUNCTION__, unbounded)); - - /* Render each pixel row. */ - for (i = 0; i < h; i = j) { - int do_full_step = 0; - - j = i + 1; - - /* Determine if we can ignore this row or use the full pixel - * stepper. */ - if (!polygon->y_buckets[i]) { - if (active->head.next == &active->tail) { - active->min_height = INT_MAX; - active->is_vertical = 1; - for (; !polygon->y_buckets[j]; j++) - ; - __DBG(("%s: no new edges and no exisiting edges, skipping, %d -> %d\n", - __FUNCTION__, i, j)); - - if (unbounded) - tor_blt_empty(sna, op, clip, span, i+ymin, j-i, xmin, xmax); - continue; - } - - do_full_step = can_full_step(active); - } - - __DBG(("%s: y=%d [%d], do_full_step=%d, new edges=%d, min_height=%d, vertical=%d\n", - __FUNCTION__, - i, i+ymin, do_full_step, - polygon->y_buckets[i] != NULL, - active->min_height, - active->is_vertical)); - if (do_full_step) { - assert(active->is_vertical); - nonzero_row(active, coverages); - - while (polygon->y_buckets[j] == NULL && - active->min_height >= 2*FAST_SAMPLES_Y) - { - active->min_height -= FAST_SAMPLES_Y; - j++; - } - if (j != i + 1) - step_edges(active, j - (i + 1)); - - __DBG(("%s: vertical edges, full step (%d, %d)\n", - __FUNCTION__, i, j)); - } else { - grid_scaled_y_t suby; - - fill_buckets(active, polygon->y_buckets[i], buckets); - - /* Subsample this row. */ - for (suby = 0; suby < FAST_SAMPLES_Y; suby++) { - if (buckets[suby]) { - merge_edges(active, buckets[suby]); - buckets[suby] = NULL; - } - - nonzero_subrow(active, coverages); - } - } - - tor_blt(sna, op, clip, span, coverages, - i+ymin, j-i, xmin, xmax, - unbounded); - cell_list_reset(coverages); - - active->min_height -= FAST_SAMPLES_Y; - } -} - -static void -inplace_row(struct active_list *active, uint8_t *row, int width) -{ - struct edge *left = active->head.next; - - assert(active->is_vertical); - - while (&active->tail != left) { - struct edge *right; - int winding = left->dir; - grid_scaled_x_t lfx, rfx; - int lix, rix; - - left->height_left -= FAST_SAMPLES_Y; - if (!left->height_left) { - left->prev->next = left->next; - left->next->prev = left->prev; - } - - right = left->next; - do { - right->height_left -= FAST_SAMPLES_Y; - if (!right->height_left) { - right->prev->next = right->next; - right->next->prev = right->prev; - } - - winding += right->dir; - if (0 == winding && right->x.quo != right->next->x.quo) - break; - - right = right->next; - } while (1); - - if (left->x.quo < 0) { - lix = lfx = 0; - } else if (left->x.quo >= width * FAST_SAMPLES_X) { - lix = width; - lfx = 0; - } else - FAST_SAMPLES_X_TO_INT_FRAC(left->x.quo, lix, lfx); - - if (right->x.quo < 0) { - rix = rfx = 0; - } else if (right->x.quo >= width * FAST_SAMPLES_X) { - rix = width; - rfx = 0; - } else - FAST_SAMPLES_X_TO_INT_FRAC(right->x.quo, rix, rfx); - if (lix == rix) { - if (rfx != lfx) { - assert(lix < width); - row[lix] += (rfx-lfx) * 256 / FAST_SAMPLES_X; - } - } else { - assert(lix < width); - if (lfx == 0) - row[lix] = 0xff; - else - row[lix] += 256 - lfx * 256 / FAST_SAMPLES_X; - - assert(rix <= width); - if (rfx) { - assert(rix < width); - row[rix] += rfx * 256 / FAST_SAMPLES_X; - } - - if (rix > ++lix) { - uint8_t *r = row + lix; - rix -= lix; -#if 0 - if (rix == 1) - *row = 0xff; - else - memset(row, 0xff, rix); -#else - if ((uintptr_t)r & 1 && rix) { - *r++ = 0xff; - rix--; - } - if ((uintptr_t)r & 2 && rix >= 2) { - *(uint16_t *)r = 0xffff; - r += 2; - rix -= 2; - } - if ((uintptr_t)r & 4 && rix >= 4) { - *(uint32_t *)r = 0xffffffff; - r += 4; - rix -= 4; - } - while (rix >= 8) { - *(uint64_t *)r = 0xffffffffffffffff; - r += 8; - rix -= 8; - } - if (rix & 4) { - *(uint32_t *)r = 0xffffffff; - r += 4; - } - if (rix & 2) { - *(uint16_t *)r = 0xffff; - r += 2; - } - if (rix & 1) - *r = 0xff; -#endif - } - } - - left = right->next; - } -} - -inline static void -inplace_subrow(struct active_list *active, int8_t *row, - int width, int *min, int *max) -{ - struct edge *edge = active->head.next; - grid_scaled_x_t prev_x = INT_MIN; - int winding = 0, xstart = INT_MIN; - - while (&active->tail != edge) { - struct edge *next = edge->next; - - winding += edge->dir; - if (0 == winding) { - if (edge->next->x.quo != edge->x.quo) { - if (edge->x.quo <= xstart) { - xstart = INT_MIN; - } else { - grid_scaled_x_t fx; - int ix; - - if (xstart < FAST_SAMPLES_X * width) { - FAST_SAMPLES_X_TO_INT_FRAC(xstart, ix, fx); - if (ix < *min) - *min = ix; - - row[ix++] += FAST_SAMPLES_X - fx; - if (fx && ix < width) - row[ix] += fx; - } - - xstart = edge->x.quo; - if (xstart < FAST_SAMPLES_X * width) { - FAST_SAMPLES_X_TO_INT_FRAC(xstart, ix, fx); - row[ix] -= FAST_SAMPLES_X - fx; - if (fx && ix + 1 < width) - row[++ix] -= fx; - - if (ix >= *max) - *max = ix + 1; - - xstart = INT_MIN; - } else - *max = width; - } - } - } else if (xstart < 0) { - xstart = MAX(edge->x.quo, 0); - } - - if (--edge->height_left) { - if (edge->dy) { - edge->x.quo += edge->dxdy.quo; - edge->x.rem += edge->dxdy.rem; - if (edge->x.rem >= 0) { - ++edge->x.quo; - edge->x.rem -= edge->dy; - } - } - - if (edge->x.quo < prev_x) { - struct edge *pos = edge->prev; - pos->next = next; - next->prev = pos; - do { - pos = pos->prev; - } while (edge->x.quo < pos->x.quo); - pos->next->prev = edge; - edge->next = pos->next; - edge->prev = pos; - pos->next = edge; - } else - prev_x = edge->x.quo; - } else { - edge->prev->next = next; - next->prev = edge->prev; - active->min_height = -1; - } - - edge = next; - } -} - -inline static void -inplace_end_subrows(struct active_list *active, uint8_t *row, - int8_t *buf, int width) -{ - int cover = 0; - - while (width >= 4) { - uint32_t dw; - int v; - - dw = *(uint32_t *)buf; - buf += 4; - - if (dw == 0) { - v = cover * 256 / (FAST_SAMPLES_X * FAST_SAMPLES_Y); - v -= v >> 8; - v |= v << 8; - dw = v | v << 16; - } else { - cover += (int8_t)(dw & 0xff); - if (cover) { - assert(cover > 0); - v = cover * 256 / (FAST_SAMPLES_X * FAST_SAMPLES_Y); - v -= v >> 8; - dw >>= 8; - dw |= v << 24; - } else - dw >>= 8; - - cover += (int8_t)(dw & 0xff); - if (cover) { - assert(cover > 0); - v = cover * 256 / (FAST_SAMPLES_X * FAST_SAMPLES_Y); - v -= v >> 8; - dw >>= 8; - dw |= v << 24; - } else - dw >>= 8; - - cover += (int8_t)(dw & 0xff); - if (cover) { - assert(cover > 0); - v = cover * 256 / (FAST_SAMPLES_X * FAST_SAMPLES_Y); - v -= v >> 8; - dw >>= 8; - dw |= v << 24; - } else - dw >>= 8; - - cover += (int8_t)(dw & 0xff); - if (cover) { - assert(cover > 0); - v = cover * 256 / (FAST_SAMPLES_X * FAST_SAMPLES_Y); - v -= v >> 8; - dw >>= 8; - dw |= v << 24; - } else - dw >>= 8; - } - - *(uint32_t *)row = dw; - row += 4; - width -= 4; - } - - while (width--) { - int v; - - cover += *buf++; - assert(cover >= 0); - - v = cover * 256 / (FAST_SAMPLES_X * FAST_SAMPLES_Y); - v -= v >> 8; - *row++ = v; - } -} - -#define TOR_INPLACE_SIZE 128 -static void -tor_inplace(struct tor *converter, PixmapPtr scratch, int mono, uint8_t *buf) -{ - int i, j, h = converter->ymax; - struct polygon *polygon = converter->polygon; - struct active_list *active = converter->active; - struct edge *buckets[FAST_SAMPLES_Y] = { 0 }; - uint8_t *row = scratch->devPrivate.ptr; - int stride = scratch->devKind; - int width = scratch->drawable.width; - - __DBG(("%s: mono=%d, buf?=%d\n", __FUNCTION__, mono, buf != NULL)); - assert(!mono); - assert(converter->ymin == 0); - assert(converter->xmin == 0); - assert(scratch->drawable.depth == 8); - - /* Render each pixel row. */ - for (i = 0; i < h; i = j) { - int do_full_step = 0; - void *ptr = buf ?: row; - - j = i + 1; - - /* Determine if we can ignore this row or use the full pixel - * stepper. */ - if (!polygon->y_buckets[i]) { - if (active->head.next == &active->tail) { - active->min_height = INT_MAX; - active->is_vertical = 1; - for (; !polygon->y_buckets[j]; j++) - ; - __DBG(("%s: no new edges and no exisiting edges, skipping, %d -> %d\n", - __FUNCTION__, i, j)); - - memset(row, 0, stride*(j-i)); - row += stride*(j-i); - continue; - } - - do_full_step = can_full_step(active); - } - - __DBG(("%s: y=%d, do_full_step=%d, new edges=%d, min_height=%d, vertical=%d\n", - __FUNCTION__, - i, do_full_step, - polygon->y_buckets[i] != NULL, - active->min_height, - active->is_vertical)); - if (do_full_step) { - assert(active->is_vertical); - - memset(ptr, 0, width); - inplace_row(active, ptr, width); - if (row != ptr) - memcpy(row, ptr, width); - - while (polygon->y_buckets[j] == NULL && - active->min_height >= 2*FAST_SAMPLES_Y) - { - active->min_height -= FAST_SAMPLES_Y; - row += stride; - memcpy(row, ptr, width); - j++; - } - if (j != i + 1) - step_edges(active, j - (i + 1)); - - __DBG(("%s: vertical edges, full step (%d, %d)\n", - __FUNCTION__, i, j)); - } else { - grid_scaled_y_t suby; - int min = width, max = 0; - - fill_buckets(active, polygon->y_buckets[i], buckets); - - /* Subsample this row. */ - memset(ptr, 0, width); - for (suby = 0; suby < FAST_SAMPLES_Y; suby++) { - if (buckets[suby]) { - merge_edges(active, buckets[suby]); - buckets[suby] = NULL; - } - - inplace_subrow(active, ptr, width, &min, &max); - } - assert(min >= 0 && max <= width); - memset(row, 0, min); - if (max > min) - inplace_end_subrows(active, row+min, (int8_t*)ptr+min, max-min); - if (max < width) - memset(row+max, 0, width-max); - } - - active->min_height -= FAST_SAMPLES_Y; - row += stride; - } -} - -struct mono_edge { - struct mono_edge *next, *prev; - - int32_t height_left; - int32_t dir; - - int32_t dy; - struct quorem x; - struct quorem dxdy; -}; - -struct mono_polygon { - int num_edges; - struct mono_edge *edges; - struct mono_edge **y_buckets; - - struct mono_edge *y_buckets_embedded[64]; - struct mono_edge edges_embedded[32]; -}; - -struct mono { - /* Leftmost edge on the current scan line. */ - struct mono_edge head, tail; - int is_vertical; - - struct sna *sna; - struct sna_composite_op op; - pixman_region16_t clip; - - fastcall void (*span)(struct mono *, int, int, BoxPtr); - - struct mono_polygon polygon; -}; - -#define I(x) pixman_fixed_to_int ((x) + pixman_fixed_1_minus_e/2) - -static bool -mono_polygon_init(struct mono_polygon *polygon, BoxPtr box, int num_edges) -{ - unsigned h = box->y2 - box->y1; - - polygon->y_buckets = polygon->y_buckets_embedded; - if (h > ARRAY_SIZE (polygon->y_buckets_embedded)) { - polygon->y_buckets = malloc (h * sizeof (struct mono_edge *)); - if (unlikely (NULL == polygon->y_buckets)) - return false; - } - - polygon->num_edges = 0; - polygon->edges = polygon->edges_embedded; - if (num_edges > (int)ARRAY_SIZE (polygon->edges_embedded)) { - polygon->edges = malloc (num_edges * sizeof (struct mono_edge)); - if (unlikely (polygon->edges == NULL)) { - if (polygon->y_buckets != polygon->y_buckets_embedded) - free(polygon->y_buckets); - return false; - } - } - - memset(polygon->y_buckets, 0, h * sizeof (struct edge *)); - return true; -} - -static void -mono_polygon_fini(struct mono_polygon *polygon) -{ - if (polygon->y_buckets != polygon->y_buckets_embedded) - free(polygon->y_buckets); - - if (polygon->edges != polygon->edges_embedded) - free(polygon->edges); -} - -static void -mono_add_line(struct mono *mono, - int dst_x, int dst_y, - xFixed top, xFixed bottom, - const xPointFixed *p1, const xPointFixed *p2, - int dir) -{ - struct mono_polygon *polygon = &mono->polygon; - struct mono_edge *e; - pixman_fixed_t dx; - pixman_fixed_t dy; - int y, ytop, ybot; - - __DBG(("%s: top=%d, bottom=%d, line=(%d, %d), (%d, %d) delta=%dx%d, dir=%d\n", - __FUNCTION__, - (int)top, (int)bottom, - (int)p1->x, (int)p1->y, (int)p2->x, (int)p2->y, - dst_x, dst_y, - dir)); - - if (top > bottom) { - const xPointFixed *t; - - y = top; - top = bottom; - bottom = y; - - t = p1; - p1 = p2; - p2 = t; - - dir = -dir; - } - - y = I(top) + dst_y; - ytop = MAX(y, mono->clip.extents.y1); - - y = I(bottom) + dst_y; - ybot = MIN(y, mono->clip.extents.y2); - - if (ybot <= ytop) { - __DBG(("discard clipped line\n")); - return; - } - - e = polygon->edges + polygon->num_edges++; - e->height_left = ybot - ytop; - e->dir = dir; - - dx = p2->x - p1->x; - dy = p2->y - p1->y; - - if (dx == 0) { - e->x.quo = p1->x; - e->x.rem = 0; - e->dxdy.quo = 0; - e->dxdy.rem = 0; - e->dy = 0; - } else { - e->dxdy = floored_muldivrem (dx, pixman_fixed_1, dy); - e->dy = dy; - - e->x = floored_muldivrem ((ytop-dst_y) * pixman_fixed_1 + pixman_fixed_1_minus_e/2 - p1->y, - dx, dy); - e->x.quo += p1->x; - e->x.rem -= dy; - } - e->x.quo += dst_x*pixman_fixed_1; - - { - struct mono_edge **ptail = &polygon->y_buckets[ytop - mono->clip.extents.y1]; - if (*ptail) - (*ptail)->prev = e; - e->next = *ptail; - e->prev = NULL; - *ptail = e; - } -} - -static struct mono_edge * -mono_merge_sorted_edges(struct mono_edge *head_a, struct mono_edge *head_b) -{ - struct mono_edge *head, **next, *prev; - int32_t x; - - if (head_b == NULL) - return head_a; - - prev = head_a->prev; - next = &head; - if (head_a->x.quo <= head_b->x.quo) { - head = head_a; - } else { - head = head_b; - head_b->prev = prev; - goto start_with_b; - } - - do { - x = head_b->x.quo; - while (head_a != NULL && head_a->x.quo <= x) { - prev = head_a; - next = &head_a->next; - head_a = head_a->next; - } - - head_b->prev = prev; - *next = head_b; - if (head_a == NULL) - return head; - -start_with_b: - x = head_a->x.quo; - while (head_b != NULL && head_b->x.quo <= x) { - prev = head_b; - next = &head_b->next; - head_b = head_b->next; - } - - head_a->prev = prev; - *next = head_a; - if (head_b == NULL) - return head; - } while (1); -} - -static struct mono_edge * -mono_sort_edges(struct mono_edge *list, - unsigned int level, - struct mono_edge **head_out) -{ - struct mono_edge *head_other, *remaining; - unsigned int i; - - head_other = list->next; - - if (head_other == NULL) { - *head_out = list; - return NULL; - } - - remaining = head_other->next; - if (list->x.quo <= head_other->x.quo) { - *head_out = list; - head_other->next = NULL; - } else { - *head_out = head_other; - head_other->prev = list->prev; - head_other->next = list; - list->prev = head_other; - list->next = NULL; - } - - for (i = 0; i < level && remaining; i++) { - remaining = mono_sort_edges(remaining, i, &head_other); - *head_out = mono_merge_sorted_edges(*head_out, head_other); - } - - return remaining; -} - -static struct mono_edge *mono_filter(struct mono_edge *edges) -{ - struct mono_edge *e; - - e = edges; - do { - struct mono_edge *n = e->next; - if (e->dir == -n->dir && - e->height_left == n->height_left && - *(uint64_t *)&e->x == *(uint64_t *)&n->x && - *(uint64_t *)&e->dxdy == *(uint64_t *)&n->dxdy) { - if (e->prev) - e->prev->next = n->next; - else - edges = n->next; - if (n->next) - n->next->prev = e->prev; - else - break; - - e = n->next; - } else - e = e->next; - } while (e->next); - - return edges; -} - -static struct mono_edge * -mono_merge_unsorted_edges(struct mono_edge *head, struct mono_edge *unsorted) -{ - mono_sort_edges(unsorted, UINT_MAX, &unsorted); - return mono_merge_sorted_edges(head, mono_filter(unsorted)); -} - -#if 0 -static inline void -__dbg_mono_edges(const char *function, struct mono_edge *edges) -{ - ErrorF("%s: ", function); - while (edges) { - if (edges->x.quo < INT16_MAX << 16) { - ErrorF("(%d.%06d)+(%d.%06d)x%d, ", - edges->x.quo, edges->x.rem, - edges->dxdy.quo, edges->dxdy.rem, - edges->dy*edges->dir); - } - edges = edges->next; - } - ErrorF("\n"); -} -#define DBG_MONO_EDGES(x) __dbg_mono_edges(__FUNCTION__, x) -static inline void -VALIDATE_MONO_EDGES(struct mono_edge *edges) -{ - int prev_x = edges->x.quo; - while ((edges = edges->next)) { - assert(edges->x.quo >= prev_x); - prev_x = edges->x.quo; - } -} - -#else -#define DBG_MONO_EDGES(x) -#define VALIDATE_MONO_EDGES(x) -#endif - -inline static void -mono_merge_edges(struct mono *c, struct mono_edge *edges) -{ - struct mono_edge *e; - - DBG_MONO_EDGES(edges); - - for (e = edges; c->is_vertical && e; e = e->next) - c->is_vertical = e->dy == 0; - - c->head.next = mono_merge_unsorted_edges(c->head.next, edges); -} - -fastcall static void -mono_span(struct mono *c, int x1, int x2, BoxPtr box) -{ - __DBG(("%s [%d, %d]\n", __FUNCTION__, x1, x2)); - - box->x1 = x1; - box->x2 = x2; - - if (c->clip.data) { - pixman_region16_t region; - - pixman_region_init_rects(®ion, box, 1); - RegionIntersect(®ion, ®ion, &c->clip); - if (REGION_NUM_RECTS(®ion)) { - c->op.boxes(c->sna, &c->op, - REGION_RECTS(®ion), - REGION_NUM_RECTS(®ion)); - apply_damage(&c->op, ®ion); - } - pixman_region_fini(®ion); - } else { - c->op.box(c->sna, &c->op, box); - apply_damage_box(&c->op, box); - } -} - -fastcall static void -mono_span__fast(struct mono *c, int x1, int x2, BoxPtr box) -{ - __DBG(("%s [%d, %d]\n", __FUNCTION__, x1, x2)); - - box->x1 = x1; - box->x2 = x2; - - c->op.box(c->sna, &c->op, box); -} - -struct mono_span_thread_boxes { - const struct sna_composite_op *op; -#define MONO_SPAN_MAX_BOXES (8192/sizeof(BoxRec)) - BoxRec boxes[MONO_SPAN_MAX_BOXES]; - int num_boxes; -}; - -inline static void -thread_mono_span_add_boxes(struct mono *c, const BoxRec *box, int count) -{ - struct mono_span_thread_boxes *b = c->op.priv; - - assert(count > 0 && count <= MONO_SPAN_MAX_BOXES); - if (unlikely(b->num_boxes + count > MONO_SPAN_MAX_BOXES)) { - b->op->thread_boxes(c->sna, b->op, b->boxes, b->num_boxes); - b->num_boxes = 0; - } - - memcpy(b->boxes + b->num_boxes, box, count*sizeof(BoxRec)); - b->num_boxes += count; - assert(b->num_boxes <= MONO_SPAN_MAX_BOXES); -} - -fastcall static void -thread_mono_span_clipped(struct mono *c, int x1, int x2, BoxPtr box) -{ - pixman_region16_t region; - - __DBG(("%s [%d, %d]\n", __FUNCTION__, x1, x2)); - - box->x1 = x1; - box->x2 = x2; - - assert(c->clip.data); - - pixman_region_init_rects(®ion, box, 1); - RegionIntersect(®ion, ®ion, &c->clip); - if (REGION_NUM_RECTS(®ion)) - thread_mono_span_add_boxes(c, - REGION_RECTS(®ion), - REGION_NUM_RECTS(®ion)); - pixman_region_fini(®ion); -} - -fastcall static void -thread_mono_span(struct mono *c, int x1, int x2, BoxPtr box) -{ - __DBG(("%s [%d, %d]\n", __FUNCTION__, x1, x2)); - - box->x1 = x1; - box->x2 = x2; - thread_mono_span_add_boxes(c, box, 1); -} - -inline static void -mono_row(struct mono *c, int16_t y, int16_t h) -{ - struct mono_edge *edge = c->head.next; - int prev_x = INT_MIN; - int16_t xstart = INT16_MIN; - int winding = 0; - BoxRec box; - - DBG_MONO_EDGES(edge); - VALIDATE_MONO_EDGES(&c->head); - - box.y1 = c->clip.extents.y1 + y; - box.y2 = box.y1 + h; - - while (&c->tail != edge) { - struct mono_edge *next = edge->next; - int16_t xend = I(edge->x.quo); - - if (--edge->height_left) { - if (edge->dy) { - edge->x.quo += edge->dxdy.quo; - edge->x.rem += edge->dxdy.rem; - if (edge->x.rem >= 0) { - ++edge->x.quo; - edge->x.rem -= edge->dy; - } - } - - if (edge->x.quo < prev_x) { - struct mono_edge *pos = edge->prev; - pos->next = next; - next->prev = pos; - do { - pos = pos->prev; - } while (edge->x.quo < pos->x.quo); - pos->next->prev = edge; - edge->next = pos->next; - edge->prev = pos; - pos->next = edge; - } else - prev_x = edge->x.quo; - } else { - edge->prev->next = next; - next->prev = edge->prev; - } - - winding += edge->dir; - if (winding == 0) { - assert(I(next->x.quo) >= xend); - if (I(next->x.quo) > xend + 1) { - if (xstart < c->clip.extents.x1) - xstart = c->clip.extents.x1; - if (xend > c->clip.extents.x2) - xend = c->clip.extents.x2; - if (xend > xstart) - c->span(c, xstart, xend, &box); - xstart = INT16_MIN; - } - } else if (xstart == INT16_MIN) - xstart = xend; - - edge = next; - } - - DBG_MONO_EDGES(c->head.next); - VALIDATE_MONO_EDGES(&c->head); -} - -static bool -mono_init(struct mono *c, int num_edges) -{ - if (!mono_polygon_init(&c->polygon, &c->clip.extents, num_edges)) - return false; - - c->head.dy = 0; - c->head.height_left = INT_MAX; - c->head.x.quo = INT16_MIN << 16; - c->head.prev = NULL; - c->head.next = &c->tail; - c->tail.prev = &c->head; - c->tail.next = NULL; - c->tail.x.quo = INT16_MAX << 16; - c->tail.height_left = INT_MAX; - c->tail.dy = 0; - - c->is_vertical = 1; - - return true; -} - -static void -mono_fini(struct mono *mono) -{ - mono_polygon_fini(&mono->polygon); -} - -static void -mono_step_edges(struct mono *c, int count) -{ - struct mono_edge *edge; - - for (edge = c->head.next; edge != &c->tail; edge = edge->next) { - edge->height_left -= count; - if (! edge->height_left) { - edge->prev->next = edge->next; - edge->next->prev = edge->prev; - } - } -} - -flatten static void -mono_render(struct mono *mono) -{ - struct mono_polygon *polygon = &mono->polygon; - int i, j, h = mono->clip.extents.y2 - mono->clip.extents.y1; - - assert(mono->span); - - for (i = 0; i < h; i = j) { - j = i + 1; - - if (polygon->y_buckets[i]) - mono_merge_edges(mono, polygon->y_buckets[i]); - - if (mono->is_vertical) { - struct mono_edge *e = mono->head.next; - int min_height = h - i; - - while (e != &mono->tail) { - if (e->height_left < min_height) - min_height = e->height_left; - e = e->next; - } - - while (--min_height >= 1 && polygon->y_buckets[j] == NULL) - j++; - if (j != i + 1) - mono_step_edges(mono, j - (i + 1)); - } - - mono_row(mono, i, j-i); - - /* XXX recompute after dropping edges? */ - if (mono->head.next == &mono->tail) - mono->is_vertical = 1; - } -} - -static int operator_is_bounded(uint8_t op) -{ - switch (op) { - case PictOpOver: - case PictOpOutReverse: - case PictOpAdd: - return true; - default: - return false; - } -} - inline static xFixed line_x_for_y(const xLineFixed *l, xFixed y, bool ceil) { @@ -2272,11 +70,7 @@ line_x_for_y(const xLineFixed *l, xFixed y, bool ceil) return l->p1.x + (xFixed) (ex / d); } -#define pixman_fixed_integer_floor(V) pixman_fixed_to_int(V) -#define pixman_fixed_integer_ceil(V) pixman_fixed_to_int(pixman_fixed_ceil(V)) - -static void -trapezoids_bounds(int n, const xTrapezoid *t, BoxPtr box) +void trapezoids_bounds(int n, const xTrapezoid *t, BoxPtr box) { xFixed x1, y1, x2, y2; @@ -2343,12 +137,6 @@ trapezoids_bounds(int n, const xTrapezoid *t, BoxPtr box) } static bool -is_mono(PicturePtr dst, PictFormatPtr mask) -{ - return mask ? mask->depth < 8 : dst->polyEdge==PolyEdgeSharp; -} - -static bool trapezoids_inplace_fallback(struct sna *sna, CARD8 op, PicturePtr src, PicturePtr dst, PictFormatPtr mask, @@ -2476,17 +264,6 @@ static void rasterize_traps_thread(void *arg) pixman_image_unref(image); } -inline static void trapezoid_origin(const xLineFixed *l, int16_t *x, int16_t *y) -{ - if (l->p1.y < l->p2.y) { - *x = pixman_fixed_to_int(l->p1.x); - *y = pixman_fixed_to_int(l->p1.y); - } else { - *x = pixman_fixed_to_int(l->p2.x); - *y = pixman_fixed_to_int(l->p2.y); - } -} - static void trapezoids_fallback(struct sna *sna, CARD8 op, PicturePtr src, PicturePtr dst, @@ -2675,2576 +452,6 @@ trapezoids_fallback(struct sna *sna, } static bool -composite_aligned_boxes(struct sna *sna, - CARD8 op, - PicturePtr src, - PicturePtr dst, - PictFormatPtr maskFormat, - INT16 src_x, INT16 src_y, - int ntrap, const xTrapezoid *traps, - bool force_fallback) -{ - BoxRec stack_boxes[64], *boxes; - pixman_region16_t region, clip; - struct sna_composite_op tmp; - bool ret = true; - int dx, dy, n, num_boxes; - - if (NO_ALIGNED_BOXES) - return false; - - DBG(("%s\n", __FUNCTION__)); - - boxes = stack_boxes; - if (ntrap > (int)ARRAY_SIZE(stack_boxes)) { - boxes = malloc(sizeof(BoxRec)*ntrap); - if (boxes == NULL) - return false; - } - - dx = dst->pDrawable->x; - dy = dst->pDrawable->y; - - region.extents.x1 = region.extents.y1 = 32767; - region.extents.x2 = region.extents.y2 = -32767; - num_boxes = 0; - for (n = 0; n < ntrap; n++) { - boxes[num_boxes].x1 = dx + pixman_fixed_to_int(traps[n].left.p1.x + pixman_fixed_1_minus_e/2); - boxes[num_boxes].y1 = dy + pixman_fixed_to_int(traps[n].top + pixman_fixed_1_minus_e/2); - boxes[num_boxes].x2 = dx + pixman_fixed_to_int(traps[n].right.p2.x + pixman_fixed_1_minus_e/2); - boxes[num_boxes].y2 = dy + pixman_fixed_to_int(traps[n].bottom + pixman_fixed_1_minus_e/2); - - if (boxes[num_boxes].x1 >= boxes[num_boxes].x2) - continue; - if (boxes[num_boxes].y1 >= boxes[num_boxes].y2) - continue; - - if (boxes[num_boxes].x1 < region.extents.x1) - region.extents.x1 = boxes[num_boxes].x1; - if (boxes[num_boxes].x2 > region.extents.x2) - region.extents.x2 = boxes[num_boxes].x2; - - if (boxes[num_boxes].y1 < region.extents.y1) - region.extents.y1 = boxes[num_boxes].y1; - if (boxes[num_boxes].y2 > region.extents.y2) - region.extents.y2 = boxes[num_boxes].y2; - - num_boxes++; - } - - if (num_boxes == 0) - goto free_boxes; - - DBG(("%s: extents (%d, %d), (%d, %d) offset of (%d, %d)\n", - __FUNCTION__, - region.extents.x1, region.extents.y1, - region.extents.x2, region.extents.y2, - region.extents.x1 - boxes[0].x1, - region.extents.y1 - boxes[0].y1)); - - src_x += region.extents.x1 - boxes[0].x1; - src_y += region.extents.y1 - boxes[0].y1; - - if (!sna_compute_composite_region(&clip, - src, NULL, dst, - src_x, src_y, - 0, 0, - region.extents.x1 - dx, region.extents.y1 - dy, - region.extents.x2 - region.extents.x1, - region.extents.y2 - region.extents.y1)) { - DBG(("%s: trapezoids do not intersect drawable clips\n", - __FUNCTION__)) ; - goto done; - } - - if (force_fallback || - !sna->render.composite(sna, op, src, NULL, dst, - src_x, src_y, - 0, 0, - clip.extents.x1, clip.extents.y1, - clip.extents.x2 - clip.extents.x1, - clip.extents.y2 - clip.extents.y1, - memset(&tmp, 0, sizeof(tmp)))) { - unsigned int flags; - pixman_box16_t *b; - int i, count; - - DBG(("%s: composite render op not supported\n", - __FUNCTION__)); - - flags = MOVE_READ | MOVE_WRITE; - if (n == 1 && op <= PictOpSrc) - flags = MOVE_WRITE | MOVE_INPLACE_HINT; - - if (!sna_drawable_move_region_to_cpu(dst->pDrawable, &clip, flags)) - goto done; - if (dst->alphaMap && - !sna_drawable_move_to_cpu(dst->alphaMap->pDrawable, - MOVE_READ | MOVE_WRITE)) - goto done; - if (src->pDrawable) { - if (!sna_drawable_move_to_cpu(src->pDrawable, - MOVE_READ)) - goto done; - if (src->alphaMap && - !sna_drawable_move_to_cpu(src->alphaMap->pDrawable, - MOVE_READ)) - goto done; - } - - DBG(("%s: fbComposite()\n", __FUNCTION__)); - if (maskFormat) { - pixman_region_init_rects(®ion, boxes, num_boxes); - RegionIntersect(®ion, ®ion, &clip); - - if (sigtrap_get() == 0) { - b = REGION_RECTS(®ion); - count = REGION_NUM_RECTS(®ion); - for (i = 0; i < count; i++) { - fbComposite(op, src, NULL, dst, - src_x + b[i].x1 - boxes[0].x1, - src_y + b[i].y1 - boxes[0].y1, - 0, 0, - b[i].x1, b[i].y1, - b[i].x2 - b[i].x1, b[i].y2 - b[i].y1); - } - sigtrap_put(); - } - pixman_region_fini(®ion); - } else { - for (n = 0; n < num_boxes; n++) { - pixman_region_init_rects(®ion, &boxes[n], 1); - RegionIntersect(®ion, ®ion, &clip); - b = REGION_RECTS(®ion); - count = REGION_NUM_RECTS(®ion); - for (i = 0; i < count; i++) { - fbComposite(op, src, NULL, dst, - src_x + b[i].x1 - boxes[0].x1, - src_y + b[i].y1 - boxes[0].y1, - 0, 0, - b[i].x1, b[i].y1, - b[i].x2 - b[i].x1, b[i].y2 - b[i].y1); - } - pixman_region_fini(®ion); - pixman_region_fini(®ion); - } - } - ret = true; - goto done; - } - - if (maskFormat || - (op == PictOpSrc || op == PictOpClear) || - num_boxes == 1) { - pixman_region_init_rects(®ion, boxes, num_boxes); - RegionIntersect(®ion, ®ion, &clip); - if (REGION_NUM_RECTS(®ion)) { - tmp.boxes(sna, &tmp, - REGION_RECTS(®ion), - REGION_NUM_RECTS(®ion)); - apply_damage(&tmp, ®ion); - } - pixman_region_fini(®ion); - } else { - for (n = 0; n < num_boxes; n++) { - pixman_region_init_rects(®ion, &boxes[n], 1); - RegionIntersect(®ion, ®ion, &clip); - if (REGION_NUM_RECTS(®ion)) { - tmp.boxes(sna, &tmp, - REGION_RECTS(®ion), - REGION_NUM_RECTS(®ion)); - apply_damage(&tmp, ®ion); - } - pixman_region_fini(®ion); - } - } - tmp.done(sna, &tmp); - -done: - REGION_UNINIT(NULL, &clip); -free_boxes: - if (boxes != stack_boxes) - free(boxes); - - return ret; -} - -static inline int grid_coverage(int samples, pixman_fixed_t f) -{ - return (samples * pixman_fixed_frac(f) + pixman_fixed_1/2) / pixman_fixed_1; -} - -inline static void -composite_unaligned_box(struct sna *sna, - struct sna_composite_spans_op *tmp, - const BoxRec *box, - float opacity, - pixman_region16_t *clip) -{ - assert(opacity != 0.); - - if (clip) { - pixman_region16_t region; - - pixman_region_init_rects(®ion, box, 1); - RegionIntersect(®ion, ®ion, clip); - if (REGION_NUM_RECTS(®ion)) - tmp->boxes(sna, tmp, - REGION_RECTS(®ion), - REGION_NUM_RECTS(®ion), - opacity); - pixman_region_fini(®ion); - } else - tmp->box(sna, tmp, box, opacity); -} - -inline static void -composite_unaligned_trap_row(struct sna *sna, - struct sna_composite_spans_op *tmp, - const xTrapezoid *trap, int dx, - int y1, int y2, int covered, - pixman_region16_t *clip) -{ - BoxRec box; - int opacity; - int x1, x2; -#define u8_to_float(x) ((x) * (1.f/255)) - - if (covered == 0) - return; - - x1 = dx + pixman_fixed_to_int(trap->left.p1.x); - x2 = dx + pixman_fixed_to_int(trap->right.p1.x); - if (clip) { - if (y2 > clip->extents.y2) - y2 = clip->extents.y2; - if (y1 < clip->extents.y1) - y1 = clip->extents.y1; - if (y1 >= y2) - return; - - if (x2 < clip->extents.x1 || x1 > clip->extents.x2) - return; - } - - box.y1 = y1; - box.y2 = y2; - - if (x1 == x2) { - box.x1 = x1; - box.x2 = x2 + 1; - - opacity = covered; - opacity *= grid_coverage(SAMPLES_X, trap->right.p1.x) - grid_coverage(SAMPLES_X, trap->left.p1.x); - - if (opacity) - composite_unaligned_box(sna, tmp, &box, - u8_to_float(opacity), clip); - } else { - if (pixman_fixed_frac(trap->left.p1.x)) { - box.x1 = x1; - box.x2 = ++x1; - - opacity = covered; - opacity *= SAMPLES_X - grid_coverage(SAMPLES_X, trap->left.p1.x); - - if (opacity) - composite_unaligned_box(sna, tmp, &box, - u8_to_float(opacity), clip); - } - - if (x2 > x1) { - box.x1 = x1; - box.x2 = x2; - - composite_unaligned_box(sna, tmp, &box, - covered == SAMPLES_Y ? 1. : u8_to_float(covered*SAMPLES_X), - clip); - } - - if (pixman_fixed_frac(trap->right.p1.x)) { - box.x1 = x2; - box.x2 = x2 + 1; - - opacity = covered; - opacity *= grid_coverage(SAMPLES_X, trap->right.p1.x); - - if (opacity) - composite_unaligned_box(sna, tmp, &box, - u8_to_float(opacity), clip); - } - } -} - -flatten static void -composite_unaligned_trap(struct sna *sna, - struct sna_composite_spans_op *tmp, - const xTrapezoid *trap, - int dx, int dy, - pixman_region16_t *clip) -{ - int y1, y2; - - y1 = dy + pixman_fixed_to_int(trap->top); - y2 = dy + pixman_fixed_to_int(trap->bottom); - - DBG(("%s: y1=%d, y2=%d\n", __FUNCTION__, y1, y2)); - - if (y1 == y2) { - composite_unaligned_trap_row(sna, tmp, trap, dx, - y1, y1 + 1, - grid_coverage(SAMPLES_Y, trap->bottom) - grid_coverage(SAMPLES_Y, trap->top), - clip); - } else { - if (pixman_fixed_frac(trap->top)) { - composite_unaligned_trap_row(sna, tmp, trap, dx, - y1, y1 + 1, - SAMPLES_Y - grid_coverage(SAMPLES_Y, trap->top), - clip); - y1++; - } - - if (y2 > y1) - composite_unaligned_trap_row(sna, tmp, trap, dx, - y1, y2, - SAMPLES_Y, - clip); - - if (pixman_fixed_frac(trap->bottom)) - composite_unaligned_trap_row(sna, tmp, trap, dx, - y2, y2 + 1, - grid_coverage(SAMPLES_Y, trap->bottom), - clip); - } - - if (tmp->base.damage) { - BoxRec box; - - box.x1 = dx + pixman_fixed_to_int(trap->left.p1.x); - box.x2 = dx + pixman_fixed_to_int(trap->right.p1.x + pixman_fixed_1_minus_e); - box.y1 = dy + pixman_fixed_to_int(trap->top); - box.y2 = dy + pixman_fixed_to_int(trap->bottom + pixman_fixed_1_minus_e); - - if (clip) { - pixman_region16_t region; - - pixman_region_init_rects(®ion, &box, 1); - RegionIntersect(®ion, ®ion, clip); - if (REGION_NUM_RECTS(®ion)) - apply_damage(&tmp->base, ®ion); - RegionUninit(®ion); - } else - apply_damage_box(&tmp->base, &box); - } -} - -inline static void -blt_opacity(PixmapPtr scratch, - int x1, int x2, - int y, int h, - uint8_t opacity) -{ - uint8_t *ptr; - - if (opacity == 0xff) - return; - - if (x1 < 0) - x1 = 0; - if (x2 > scratch->drawable.width) - x2 = scratch->drawable.width; - if (x1 >= x2) - return; - - x2 -= x1; - - ptr = scratch->devPrivate.ptr; - ptr += scratch->devKind * y; - ptr += x1; - do { - if (x2 == 1) - *ptr = opacity; - else - memset(ptr, opacity, x2); - ptr += scratch->devKind; - } while (--h); -} - -static void -blt_unaligned_box_row(PixmapPtr scratch, - BoxPtr extents, - const xTrapezoid *trap, - int y1, int y2, - int covered) -{ - int x1, x2; - - if (y2 > scratch->drawable.height) - y2 = scratch->drawable.height; - if (y1 < 0) - y1 = 0; - if (y1 >= y2) - return; - - y2 -= y1; - - x1 = pixman_fixed_to_int(trap->left.p1.x); - x2 = pixman_fixed_to_int(trap->right.p1.x); - - x1 -= extents->x1; - x2 -= extents->x1; - - if (x1 == x2) { - blt_opacity(scratch, - x1, x1+1, - y1, y2, - covered * (grid_coverage(SAMPLES_X, trap->right.p1.x) - grid_coverage(SAMPLES_X, trap->left.p1.x))); - } else { - if (pixman_fixed_frac(trap->left.p1.x)) { - blt_opacity(scratch, - x1, x1 + 1, - y1, y2, - covered * (SAMPLES_X - grid_coverage(SAMPLES_X, trap->left.p1.x))); - x1++; - } - - if (x2 > x1) { - blt_opacity(scratch, - x1, x2, - y1, y2, - covered*SAMPLES_X); - } - - if (pixman_fixed_frac(trap->right.p1.x)) - blt_opacity(scratch, - x2, x2 + 1, - y1, y2, - covered * grid_coverage(SAMPLES_X, trap->right.p1.x)); - } -} - -#define ONE_HALF 0x7f -#define RB_MASK 0x00ff00ff -#define RB_ONE_HALF 0x007f007f -#define RB_MASK_PLUS_ONE 0x01000100 -#define G_SHIFT 8 - -static force_inline uint32_t -mul8x2_8 (uint32_t a, uint8_t b) -{ - uint32_t t = (a & RB_MASK) * b + RB_ONE_HALF; - return ((t + ((t >> G_SHIFT) & RB_MASK)) >> G_SHIFT) & RB_MASK; -} - -static force_inline uint32_t -add8x2_8x2(uint32_t a, uint32_t b) -{ - uint32_t t = a + b; - t |= RB_MASK_PLUS_ONE - ((t >> G_SHIFT) & RB_MASK); - return t & RB_MASK; -} - -static force_inline uint32_t -lerp8x4(uint32_t src, uint8_t a, uint32_t dst) -{ - return (add8x2_8x2(mul8x2_8(src, a), - mul8x2_8(dst, ~a)) | - add8x2_8x2(mul8x2_8(src >> G_SHIFT, a), - mul8x2_8(dst >> G_SHIFT, ~a)) << G_SHIFT); -} - -inline static void -lerp32_opacity(PixmapPtr scratch, - uint32_t color, - int16_t x, int16_t w, - int16_t y, int16_t h, - uint8_t opacity) -{ - uint32_t *ptr; - int stride, i; - - ptr = (uint32_t*)((uint8_t *)scratch->devPrivate.ptr + scratch->devKind * y); - ptr += x; - stride = scratch->devKind / 4; - - if (opacity == 0xff) { - if ((w | h) == 1) { - *ptr = color; - } else { - if (w < 16) { - do { - for (i = 0; i < w; i++) - ptr[i] = color; - ptr += stride; - } while (--h); - } else { - pixman_fill(ptr, stride, 32, - 0, 0, w, h, color); - } - } - } else { - if ((w | h) == 1) { - *ptr = lerp8x4(color, opacity, *ptr); - } else if (w == 1) { - do { - *ptr = lerp8x4(color, opacity, *ptr); - ptr += stride; - } while (--h); - } else{ - do { - for (i = 0; i < w; i++) - ptr[i] = lerp8x4(color, opacity, ptr[i]); - ptr += stride; - } while (--h); - } - } -} - -static void -lerp32_unaligned_box_row(PixmapPtr scratch, uint32_t color, - const BoxRec *extents, - const xTrapezoid *trap, int16_t dx, - int16_t y, int16_t h, - uint8_t covered) -{ - int16_t x1 = pixman_fixed_to_int(trap->left.p1.x) + dx; - uint16_t fx1 = grid_coverage(SAMPLES_X, trap->left.p1.x); - int16_t x2 = pixman_fixed_to_int(trap->right.p2.x) + dx; - uint16_t fx2 = grid_coverage(SAMPLES_X, trap->right.p2.x); - - if (x1 < extents->x1) - x1 = extents->x1, fx1 = 0; - if (x2 >= extents->x2) - x2 = extents->x2, fx2 = 0; - - DBG(("%s: x=(%d.%d, %d.%d), y=%dx%d, covered=%d\n", __FUNCTION__, - x1, fx1, x2, fx2, y, h, covered)); - - if (x1 < x2) { - if (fx1) { - lerp32_opacity(scratch, color, - x1, 1, - y, h, - covered * (SAMPLES_X - fx1)); - x1++; - } - - if (x2 > x1) { - lerp32_opacity(scratch, color, - x1, x2-x1, - y, h, - covered*SAMPLES_X); - } - - if (fx2) { - lerp32_opacity(scratch, color, - x2, 1, - y, h, - covered * fx2); - } - } else if (x1 == x2 && fx2 > fx1) { - lerp32_opacity(scratch, color, - x1, 1, - y, h, - covered * (fx2 - fx1)); - } -} - -struct pixman_inplace { - pixman_image_t *image, *source, *mask; - uint32_t color; - uint32_t *bits; - int dx, dy; - int sx, sy; - uint8_t op; -}; - -static force_inline uint8_t -mul_8_8(uint8_t a, uint8_t b) -{ - uint16_t t = a * (uint16_t)b + 0x7f; - return ((t >> 8) + t) >> 8; -} - -static inline uint32_t multa(uint32_t s, uint8_t a, int shift) -{ - return mul_8_8((s >> shift) & 0xff, a) << shift; -} - -static inline uint32_t mul_4x8_8(uint32_t color, uint8_t alpha) -{ - uint32_t v; - - v = 0; - v |= multa(color, alpha, 24); - v |= multa(color, alpha, 16); - v |= multa(color, alpha, 8); - v |= multa(color, alpha, 0); - - return v; -} - -inline static void -pixsolid_opacity(struct pixman_inplace *pi, - int16_t x, int16_t w, - int16_t y, int16_t h, - uint8_t opacity) -{ - if (opacity == 0xff) - *pi->bits = pi->color; - else - *pi->bits = mul_4x8_8(pi->color, opacity); - pixman_image_composite(pi->op, pi->source, NULL, pi->image, - 0, 0, 0, 0, pi->dx + x, pi->dy + y, w, h); -} - -static void -pixsolid_unaligned_box_row(struct pixman_inplace *pi, - const BoxRec *extents, - const xTrapezoid *trap, - int16_t y, int16_t h, - uint8_t covered) -{ - int16_t x1 = pixman_fixed_to_int(trap->left.p1.x); - uint16_t fx1 = grid_coverage(SAMPLES_X, trap->left.p1.x); - int16_t x2 = pixman_fixed_to_int(trap->right.p1.x); - uint16_t fx2 = grid_coverage(SAMPLES_X, trap->right.p1.x); - - if (x1 < extents->x1) - x1 = extents->x1, fx1 = 0; - if (x2 >= extents->x2) - x2 = extents->x2, fx2 = 0; - - if (x1 < x2) { - if (fx1) { - pixsolid_opacity(pi, x1, 1, y, h, - covered * (SAMPLES_X - fx1)); - x1++; - } - - if (x2 > x1) - pixsolid_opacity(pi, x1, x2-x1, y, h, covered*SAMPLES_X); - - if (fx2) - pixsolid_opacity(pi, x2, 1, y, h, covered * fx2); - } else if (x1 == x2 && fx2 > fx1) { - pixsolid_opacity(pi, x1, 1, y, h, covered * (fx2 - fx1)); - } -} - -static bool -composite_unaligned_boxes_inplace__solid(struct sna *sna, - CARD8 op, uint32_t color, - PicturePtr dst, - int n, const xTrapezoid *t, - bool force_fallback) -{ - PixmapPtr pixmap; - int16_t dx, dy; - - DBG(("%s: force=%d, is_gpu=%d, op=%d, color=%x\n", __FUNCTION__, - force_fallback, is_gpu(sna, dst->pDrawable, PREFER_GPU_SPANS), op, color)); - - if (!force_fallback && is_gpu(sna, dst->pDrawable, PREFER_GPU_SPANS)) { - DBG(("%s: fallback -- can not perform operation in place, destination busy\n", - __FUNCTION__)); - - return false; - } - - /* XXX a8 boxes */ - if (!(dst->format == PICT_a8r8g8b8 || dst->format == PICT_x8r8g8b8)) { - DBG(("%s: fallback -- can not perform operation in place, unhanbled format %08lx\n", - __FUNCTION__, (long)dst->format)); - - goto pixman; - } - - pixmap = get_drawable_pixmap(dst->pDrawable); - get_drawable_deltas(dst->pDrawable, pixmap, &dx, &dy); - - if (op == PictOpOver && (color >> 24) == 0xff) - op = PictOpSrc; - if (op == PictOpOver || op == PictOpAdd) { - struct sna_pixmap *priv = sna_pixmap(pixmap); - if (priv && priv->clear && priv->clear_color == 0) - op = PictOpSrc; - } - - switch (op) { - case PictOpSrc: - break; - default: - DBG(("%s: fallback -- can not perform op [%d] in place\n", - __FUNCTION__, op)); - goto pixman; - } - - DBG(("%s: inplace operation on argb32 destination x %d\n", - __FUNCTION__, n)); - do { - RegionRec clip; - BoxPtr extents; - int count; - - clip.extents.x1 = pixman_fixed_to_int(t->left.p1.x); - clip.extents.x2 = pixman_fixed_to_int(t->right.p1.x + pixman_fixed_1_minus_e); - clip.extents.y1 = pixman_fixed_to_int(t->top); - clip.extents.y2 = pixman_fixed_to_int(t->bottom + pixman_fixed_1_minus_e); - clip.data = NULL; - - if (!sna_compute_composite_region(&clip, - NULL, NULL, dst, - 0, 0, - 0, 0, - clip.extents.x1, clip.extents.y1, - clip.extents.x2 - clip.extents.x1, - clip.extents.y2 - clip.extents.y1)) - continue; - - if (!sna_drawable_move_region_to_cpu(dst->pDrawable, &clip, - MOVE_WRITE | MOVE_READ)) { - RegionUninit(&clip); - continue; - } - - RegionTranslate(&clip, dx, dy); - count = REGION_NUM_RECTS(&clip); - extents = REGION_RECTS(&clip); - while (count--) { - int16_t y1 = dy + pixman_fixed_to_int(t->top); - uint16_t fy1 = pixman_fixed_frac(t->top); - int16_t y2 = dy + pixman_fixed_to_int(t->bottom); - uint16_t fy2 = pixman_fixed_frac(t->bottom); - - DBG(("%s: t=(%d, %d), (%d, %d), extents (%d, %d), (%d, %d)\n", - __FUNCTION__, - pixman_fixed_to_int(t->left.p1.x), - pixman_fixed_to_int(t->top), - pixman_fixed_to_int(t->right.p2.x), - pixman_fixed_to_int(t->bottom), - extents->x1, extents->y1, - extents->x2, extents->y2)); - - if (y1 < extents->y1) - y1 = extents->y1, fy1 = 0; - if (y2 >= extents->y2) - y2 = extents->y2, fy2 = 0; - - if (y1 < y2) { - if (fy1) { - lerp32_unaligned_box_row(pixmap, color, extents, - t, dx, y1, 1, - SAMPLES_Y - grid_coverage(SAMPLES_Y, fy1)); - y1++; - } - - if (y2 > y1) - lerp32_unaligned_box_row(pixmap, color, extents, - t, dx, y1, y2 - y1, - SAMPLES_Y); - - if (fy2) - lerp32_unaligned_box_row(pixmap, color, extents, - t, dx, y2, 1, - grid_coverage(SAMPLES_Y, fy2)); - } else if (y1 == y2 && fy2 > fy1) { - lerp32_unaligned_box_row(pixmap, color, extents, - t, dx, y1, 1, - grid_coverage(SAMPLES_Y, fy2) - grid_coverage(SAMPLES_Y, fy1)); - } - extents++; - } - - RegionUninit(&clip); - } while (--n && t++); - - return true; - -pixman: - do { - struct pixman_inplace pi; - RegionRec clip; - BoxPtr extents; - int count; - - clip.extents.x1 = pixman_fixed_to_int(t->left.p1.x); - clip.extents.x2 = pixman_fixed_to_int(t->right.p1.x + pixman_fixed_1_minus_e); - clip.extents.y1 = pixman_fixed_to_int(t->top); - clip.extents.y2 = pixman_fixed_to_int(t->bottom + pixman_fixed_1_minus_e); - clip.data = NULL; - - if (!sna_compute_composite_region(&clip, - NULL, NULL, dst, - 0, 0, - 0, 0, - clip.extents.x1, clip.extents.y1, - clip.extents.x2 - clip.extents.x1, - clip.extents.y2 - clip.extents.y1)) - continue; - - if (!sna_drawable_move_region_to_cpu(dst->pDrawable, &clip, - MOVE_WRITE | MOVE_READ)) { - RegionUninit(&clip); - continue; - } - - pi.image = image_from_pict(dst, false, &pi.dx, &pi.dy); - pi.source = pixman_image_create_bits(PIXMAN_a8r8g8b8, 1, 1, NULL, 0); - pixman_image_set_repeat(pi.source, PIXMAN_REPEAT_NORMAL); - pi.bits = pixman_image_get_data(pi.source); - pi.color = color; - pi.op = op; - - count = REGION_NUM_RECTS(&clip); - extents = REGION_RECTS(&clip); - while (count--) { - int16_t y1 = pixman_fixed_to_int(t->top); - uint16_t fy1 = pixman_fixed_frac(t->top); - int16_t y2 = pixman_fixed_to_int(t->bottom); - uint16_t fy2 = pixman_fixed_frac(t->bottom); - - if (y1 < extents->y1) - y1 = extents->y1, fy1 = 0; - if (y2 >= extents->y2) - y2 = extents->y2, fy2 = 0; - if (y1 < y2) { - if (fy1) { - pixsolid_unaligned_box_row(&pi, extents, t, y1, 1, - SAMPLES_Y - grid_coverage(SAMPLES_Y, fy1)); - y1++; - } - - if (y2 > y1) - pixsolid_unaligned_box_row(&pi, extents, t, y1, y2 - y1, - SAMPLES_Y); - - if (fy2) - pixsolid_unaligned_box_row(&pi, extents, t, y2, 1, - grid_coverage(SAMPLES_Y, fy2)); - } else if (y1 == y2 && fy2 > fy1) { - pixsolid_unaligned_box_row(&pi, extents, t, y1, 1, - grid_coverage(SAMPLES_Y, fy2) - grid_coverage(SAMPLES_Y, fy1)); - } - extents++; - } - - RegionUninit(&clip); - pixman_image_unref(pi.image); - pixman_image_unref(pi.source); - } while (--n && t++); - return true; -} - -inline static void -pixmask_opacity(struct pixman_inplace *pi, - int16_t x, int16_t w, - int16_t y, int16_t h, - uint8_t opacity) -{ - if (opacity == 0xff) { - pixman_image_composite(pi->op, pi->source, NULL, pi->image, - pi->sx + x, pi->sy + y, - 0, 0, - pi->dx + x, pi->dy + y, - w, h); - } else { - *pi->bits = opacity; - pixman_image_composite(pi->op, pi->source, pi->mask, pi->image, - pi->sx + x, pi->sy + y, - 0, 0, - pi->dx + x, pi->dy + y, - w, h); - } -} - -static void -pixmask_unaligned_box_row(struct pixman_inplace *pi, - const BoxRec *extents, - const xTrapezoid *trap, - int16_t y, int16_t h, - uint8_t covered) -{ - int16_t x1 = pixman_fixed_to_int(trap->left.p1.x); - uint16_t fx1 = grid_coverage(SAMPLES_X, trap->left.p1.x); - int16_t x2 = pixman_fixed_to_int(trap->right.p1.x); - uint16_t fx2 = grid_coverage(SAMPLES_X, trap->right.p1.x); - - if (x1 < extents->x1) - x1 = extents->x1, fx1 = 0; - if (x2 >= extents->x2) - x2 = extents->x2, fx2 = 0; - - if (x1 < x2) { - if (fx1) { - pixmask_opacity(pi, x1, 1, y, h, - covered * (SAMPLES_X - fx1)); - x1++; - } - - if (x2 > x1) - pixmask_opacity(pi, x1, x2-x1, y, h, covered*SAMPLES_X); - - if (fx2) - pixmask_opacity(pi, x2, 1, y, h, covered * fx2); - } else if (x1 == x2 && fx2 > fx1) { - pixmask_opacity(pi, x1, 1, y, h, covered * (fx2 - fx1)); - } -} - -struct rectilinear_inplace_thread { - pixman_image_t *dst, *src; - const RegionRec *clip; - const xTrapezoid *trap; - int dx, dy, sx, sy; - int y1, y2; - CARD8 op; -}; - -static void rectilinear_inplace_thread(void *arg) -{ - struct rectilinear_inplace_thread *thread = arg; - const xTrapezoid *t = thread->trap; - struct pixman_inplace pi; - const BoxRec *extents; - int count; - - pi.image = thread->dst; - pi.dx = thread->dx; - pi.dy = thread->dy; - - pi.source = thread->src; - pi.sx = thread->sx; - pi.sy = thread->sy; - - pi.mask = pixman_image_create_bits(PIXMAN_a8, 1, 1, &pi.color, 4); - pixman_image_set_repeat(pi.mask, PIXMAN_REPEAT_NORMAL); - pi.bits = pixman_image_get_data(pi.mask); - pi.op = thread->op; - - count = region_count(thread->clip); - extents = region_boxes(thread->clip); - while (count--) { - int16_t y1 = pixman_fixed_to_int(t->top); - uint16_t fy1 = pixman_fixed_frac(t->top); - int16_t y2 = pixman_fixed_to_int(t->bottom); - uint16_t fy2 = pixman_fixed_frac(t->bottom); - - if (y1 < MAX(thread->y1, extents->y1)) - y1 = MAX(thread->y1, extents->y1), fy1 = 0; - if (y2 > MIN(thread->y2, extents->y2)) - y2 = MIN(thread->y2, extents->y2), fy2 = 0; - if (y1 < y2) { - if (fy1) { - pixmask_unaligned_box_row(&pi, extents, t, y1, 1, - SAMPLES_Y - grid_coverage(SAMPLES_Y, fy1)); - y1++; - } - - if (y2 > y1) - pixmask_unaligned_box_row(&pi, extents, t, y1, y2 - y1, - SAMPLES_Y); - - if (fy2) - pixmask_unaligned_box_row(&pi, extents, t, y2, 1, - grid_coverage(SAMPLES_Y, fy2)); - } else if (y1 == y2 && fy2 > fy1) { - pixmask_unaligned_box_row(&pi, extents, t, y1, 1, - grid_coverage(SAMPLES_Y, fy2) - grid_coverage(SAMPLES_Y, fy1)); - } - extents++; - } - - pixman_image_unref(pi.mask); -} - -static bool -composite_unaligned_boxes_inplace(struct sna *sna, - CARD8 op, - PicturePtr src, int16_t src_x, int16_t src_y, - PicturePtr dst, int n, const xTrapezoid *t, - bool force_fallback) -{ - if (!force_fallback && - (is_gpu(sna, dst->pDrawable, PREFER_GPU_SPANS) || - picture_is_gpu(sna, src))) { - DBG(("%s: fallback -- not forcing\n", __FUNCTION__)); - return false; - } - - DBG(("%s\n", __FUNCTION__)); - - src_x -= pixman_fixed_to_int(t[0].left.p1.x); - src_y -= pixman_fixed_to_int(t[0].left.p1.y); - do { - RegionRec clip; - BoxPtr extents; - int count; - int num_threads; - - clip.extents.x1 = pixman_fixed_to_int(t->left.p1.x); - clip.extents.x2 = pixman_fixed_to_int(t->right.p1.x + pixman_fixed_1_minus_e); - clip.extents.y1 = pixman_fixed_to_int(t->top); - clip.extents.y2 = pixman_fixed_to_int(t->bottom + pixman_fixed_1_minus_e); - clip.data = NULL; - - if (!sna_compute_composite_region(&clip, - src, NULL, dst, - clip.extents.x1 + src_x, - clip.extents.y1 + src_y, - 0, 0, - clip.extents.x1, clip.extents.y1, - clip.extents.x2 - clip.extents.x1, - clip.extents.y2 - clip.extents.y1)) - continue; - - if (!sna_drawable_move_region_to_cpu(dst->pDrawable, &clip, - MOVE_WRITE | MOVE_READ)) { - RegionUninit(&clip); - continue; - } - - if (src->pDrawable) { - if (!sna_drawable_move_to_cpu(src->pDrawable, - MOVE_READ)) { - RegionUninit(&clip); - continue; - } - if (src->alphaMap) { - if (!sna_drawable_move_to_cpu(src->alphaMap->pDrawable, - MOVE_READ)) { - RegionUninit(&clip); - continue; - } - } - } - - num_threads = sna_use_threads(clip.extents.x2 - clip.extents.x1, - clip.extents.y2 - clip.extents.y1, - 32); - if (num_threads == 1) { - struct pixman_inplace pi; - - pi.image = image_from_pict(dst, false, &pi.dx, &pi.dy); - pi.source = image_from_pict(src, false, &pi.sx, &pi.sy); - pi.sx += src_x; - pi.sy += src_y; - pi.mask = pixman_image_create_bits(PIXMAN_a8, 1, 1, &pi.color, 4); - pixman_image_set_repeat(pi.mask, PIXMAN_REPEAT_NORMAL); - pi.bits = pixman_image_get_data(pi.mask); - pi.op = op; - - count = REGION_NUM_RECTS(&clip); - extents = REGION_RECTS(&clip); - while (count--) { - int16_t y1 = pixman_fixed_to_int(t->top); - uint16_t fy1 = pixman_fixed_frac(t->top); - int16_t y2 = pixman_fixed_to_int(t->bottom); - uint16_t fy2 = pixman_fixed_frac(t->bottom); - - if (y1 < extents->y1) - y1 = extents->y1, fy1 = 0; - if (y2 > extents->y2) - y2 = extents->y2, fy2 = 0; - if (y1 < y2) { - if (fy1) { - pixmask_unaligned_box_row(&pi, extents, t, y1, 1, - SAMPLES_Y - grid_coverage(SAMPLES_Y, fy1)); - y1++; - } - - if (y2 > y1) - pixmask_unaligned_box_row(&pi, extents, t, y1, y2 - y1, - SAMPLES_Y); - - if (fy2) - pixmask_unaligned_box_row(&pi, extents, t, y2, 1, - grid_coverage(SAMPLES_Y, fy2)); - } else if (y1 == y2 && fy2 > fy1) { - pixmask_unaligned_box_row(&pi, extents, t, y1, 1, - grid_coverage(SAMPLES_Y, fy2) - grid_coverage(SAMPLES_Y, fy1)); - } - extents++; - } - - pixman_image_unref(pi.image); - pixman_image_unref(pi.source); - pixman_image_unref(pi.mask); - } else { - struct rectilinear_inplace_thread thread[num_threads]; - int i, y, dy; - - - thread[0].trap = t; - thread[0].dst = image_from_pict(dst, false, &thread[0].dx, &thread[0].dy); - thread[0].src = image_from_pict(src, false, &thread[0].sx, &thread[0].sy); - thread[0].sx += src_x; - thread[0].sy += src_y; - - thread[0].clip = &clip; - thread[0].op = op; - - y = clip.extents.y1; - dy = (clip.extents.y2 - clip.extents.y1 + num_threads - 1) / num_threads; - - for (i = 1; i < num_threads; i++) { - thread[i] = thread[0]; - thread[i].y1 = y; - thread[i].y2 = y += dy; - sna_threads_run(rectilinear_inplace_thread, &thread[i]); - } - - thread[0].y1 = y; - thread[0].y2 = clip.extents.y2; - rectilinear_inplace_thread(&thread[0]); - - sna_threads_wait(); - - pixman_image_unref(thread[0].dst); - pixman_image_unref(thread[0].src); - } - - RegionUninit(&clip); - } while (--n && t++); - - return true; -} - -static bool -composite_unaligned_boxes_fallback(struct sna *sna, - CARD8 op, - PicturePtr src, - PicturePtr dst, - INT16 src_x, INT16 src_y, - int ntrap, const xTrapezoid *traps, - bool force_fallback) -{ - ScreenPtr screen = dst->pDrawable->pScreen; - uint32_t color; - int16_t dst_x, dst_y; - int16_t dx, dy; - int n; - - if (sna_picture_is_solid(src, &color) && - composite_unaligned_boxes_inplace__solid(sna, op, color, dst, - ntrap, traps, - force_fallback)) - return true; - - if (composite_unaligned_boxes_inplace(sna, op, src, src_x, src_y, - dst, ntrap, traps, - force_fallback)) - return true; - - trapezoid_origin(&traps[0].left, &dst_x, &dst_y); - dx = dst->pDrawable->x; - dy = dst->pDrawable->y; - for (n = 0; n < ntrap; n++) { - const xTrapezoid *t = &traps[n]; - PixmapPtr scratch; - PicturePtr mask; - BoxRec extents; - int error; - int y1, y2; - - extents.x1 = pixman_fixed_to_int(t->left.p1.x); - extents.x2 = pixman_fixed_to_int(t->right.p1.x + pixman_fixed_1_minus_e); - extents.y1 = pixman_fixed_to_int(t->top); - extents.y2 = pixman_fixed_to_int(t->bottom + pixman_fixed_1_minus_e); - - if (!sna_compute_composite_extents(&extents, - src, NULL, dst, - src_x, src_y, - 0, 0, - extents.x1, extents.y1, - extents.x2 - extents.x1, - extents.y2 - extents.y1)) - continue; - - if (force_fallback) - scratch = sna_pixmap_create_unattached(screen, - extents.x2 - extents.x1, - extents.y2 - extents.y1, - 8); - else - scratch = sna_pixmap_create_upload(screen, - extents.x2 - extents.x1, - extents.y2 - extents.y1, - 8, KGEM_BUFFER_WRITE_INPLACE); - if (!scratch) - continue; - - memset(scratch->devPrivate.ptr, 0xff, - scratch->devKind * (extents.y2 - extents.y1)); - - extents.x1 -= dx; - extents.x2 -= dx; - extents.y1 -= dy; - extents.y2 -= dy; - - y1 = pixman_fixed_to_int(t->top) - extents.y1; - y2 = pixman_fixed_to_int(t->bottom) - extents.y1; - - if (y1 == y2) { - blt_unaligned_box_row(scratch, &extents, t, y1, y1 + 1, - grid_coverage(SAMPLES_Y, t->bottom) - grid_coverage(SAMPLES_Y, t->top)); - } else { - if (pixman_fixed_frac(t->top)) { - blt_unaligned_box_row(scratch, &extents, t, y1, y1 + 1, - SAMPLES_Y - grid_coverage(SAMPLES_Y, t->top)); - y1++; - } - - if (y2 > y1) - blt_unaligned_box_row(scratch, &extents, t, y1, y2, - SAMPLES_Y); - - if (pixman_fixed_frac(t->bottom)) - blt_unaligned_box_row(scratch, &extents, t, y2, y2+1, - grid_coverage(SAMPLES_Y, t->bottom)); - } - - mask = CreatePicture(0, &scratch->drawable, - PictureMatchFormat(screen, 8, PICT_a8), - 0, 0, serverClient, &error); - if (mask) { - CompositePicture(op, src, mask, dst, - src_x + extents.x1 - dst_x, - src_y + extents.y1 - dst_y, - 0, 0, - extents.x1, extents.y1, - extents.x2 - extents.x1, - extents.y2 - extents.y1); - FreePicture(mask, 0); - } - sna_pixmap_destroy(scratch); - } - - return true; -} - -static bool -composite_unaligned_boxes(struct sna *sna, - CARD8 op, - PicturePtr src, - PicturePtr dst, - PictFormatPtr maskFormat, - INT16 src_x, INT16 src_y, - int ntrap, const xTrapezoid *traps, - bool force_fallback) -{ - BoxRec extents; - struct sna_composite_spans_op tmp; - struct sna_pixmap *priv; - pixman_region16_t clip, *c; - int16_t dst_x, dst_y; - int dx, dy, n; - - if (NO_UNALIGNED_BOXES) - return false; - - DBG(("%s: force_fallback=%d, mask=%x, n=%d, op=%d\n", - __FUNCTION__, force_fallback, maskFormat ? (int)maskFormat->format : 0, ntrap, op)); - - /* need a span converter to handle overlapping traps */ - if (ntrap > 1 && maskFormat) - return false; - - if (force_fallback || - !sna->render.check_composite_spans(sna, op, src, dst, 0, 0, - COMPOSITE_SPANS_RECTILINEAR)) { -fallback: - return composite_unaligned_boxes_fallback(sna, op, src, dst, - src_x, src_y, - ntrap, traps, - force_fallback); - } - - trapezoid_origin(&traps[0].left, &dst_x, &dst_y); - - extents.x1 = pixman_fixed_to_int(traps[0].left.p1.x); - extents.x2 = pixman_fixed_to_int(traps[0].right.p1.x + pixman_fixed_1_minus_e); - extents.y1 = pixman_fixed_to_int(traps[0].top); - extents.y2 = pixman_fixed_to_int(traps[0].bottom + pixman_fixed_1_minus_e); - - DBG(("%s: src=(%d, %d), dst=(%d, %d)\n", - __FUNCTION__, src_x, src_y, dst_x, dst_y)); - - for (n = 1; n < ntrap; n++) { - int x1 = pixman_fixed_to_int(traps[n].left.p1.x); - int x2 = pixman_fixed_to_int(traps[n].right.p1.x + pixman_fixed_1_minus_e); - int y1 = pixman_fixed_to_int(traps[n].top); - int y2 = pixman_fixed_to_int(traps[n].bottom + pixman_fixed_1_minus_e); - - if (x1 < extents.x1) - extents.x1 = x1; - if (x2 > extents.x2) - extents.x2 = x2; - if (y1 < extents.y1) - extents.y1 = y1; - if (y2 > extents.y2) - extents.y2 = y2; - } - - DBG(("%s: extents (%d, %d), (%d, %d)\n", __FUNCTION__, - extents.x1, extents.y1, extents.x2, extents.y2)); - - if (!sna_compute_composite_region(&clip, - src, NULL, dst, - src_x + extents.x1 - dst_x, - src_y + extents.y1 - dst_y, - 0, 0, - extents.x1, extents.y1, - extents.x2 - extents.x1, - extents.y2 - extents.y1)) { - DBG(("%s: trapezoids do not intersect drawable clips\n", - __FUNCTION__)) ; - return true; - } - - if (!sna->render.check_composite_spans(sna, op, src, dst, - clip.extents.x2 - clip.extents.x1, - clip.extents.y2 - clip.extents.y1, - COMPOSITE_SPANS_RECTILINEAR)) { - DBG(("%s: fallback -- composite spans not supported\n", - __FUNCTION__)); - goto fallback; - } - - c = NULL; - if (extents.x2 - extents.x1 > clip.extents.x2 - clip.extents.x1 || - extents.y2 - extents.y1 > clip.extents.y2 - clip.extents.y1) { - DBG(("%s: forcing clip\n", __FUNCTION__)); - c = &clip; - } - - extents = *RegionExtents(&clip); - dx = dst->pDrawable->x; - dy = dst->pDrawable->y; - - DBG(("%s: after clip -- extents (%d, %d), (%d, %d), delta=(%d, %d) src -> (%d, %d)\n", - __FUNCTION__, - extents.x1, extents.y1, - extents.x2, extents.y2, - dx, dy, - src_x + extents.x1 - dst_x - dx, - src_y + extents.y1 - dst_y - dy)); - - switch (op) { - case PictOpAdd: - case PictOpOver: - priv = sna_pixmap(get_drawable_pixmap(dst->pDrawable)); - assert(priv != NULL); - if (priv->clear && priv->clear_color == 0) { - DBG(("%s: converting %d to PictOpSrc\n", - __FUNCTION__, op)); - op = PictOpSrc; - } - break; - case PictOpIn: - priv = sna_pixmap(get_drawable_pixmap(dst->pDrawable)); - assert(priv != NULL); - if (priv->clear && priv->clear_color == 0) { - DBG(("%s: clear destination using In, skipping\n", - __FUNCTION__)); - return true; - } - break; - } - - if (!sna->render.composite_spans(sna, op, src, dst, - src_x + extents.x1 - dst_x - dx, - src_y + extents.y1 - dst_y - dy, - extents.x1, extents.y1, - extents.x2 - extents.x1, - extents.y2 - extents.y1, - COMPOSITE_SPANS_RECTILINEAR, - memset(&tmp, 0, sizeof(tmp)))) { - DBG(("%s: composite spans render op not supported\n", - __FUNCTION__)); - REGION_UNINIT(NULL, &clip); - goto fallback; - } - - for (n = 0; n < ntrap; n++) - composite_unaligned_trap(sna, &tmp, &traps[n], dx, dy, c); - tmp.done(sna, &tmp); - REGION_UNINIT(NULL, &clip); - return true; -} - -static inline int pixman_fixed_to_grid(pixman_fixed_t v) -{ - return (v + ((1<<(16-FAST_SAMPLES_shift-1))-1)) >> (16 - FAST_SAMPLES_shift); -} - -static inline bool -project_trapezoid_onto_grid(const xTrapezoid *in, - int dx, int dy, - xTrapezoid *out) -{ - __DBG(("%s: in: L:(%d, %d), (%d, %d); R:(%d, %d), (%d, %d), [%d, %d]\n", - __FUNCTION__, - in->left.p1.x, in->left.p1.y, in->left.p2.x, in->left.p2.y, - in->right.p1.x, in->right.p1.y, in->right.p2.x, in->right.p2.y, - in->top, in->bottom)); - - out->left.p1.x = dx + pixman_fixed_to_grid(in->left.p1.x); - out->left.p1.y = dy + pixman_fixed_to_grid(in->left.p1.y); - out->left.p2.x = dx + pixman_fixed_to_grid(in->left.p2.x); - out->left.p2.y = dy + pixman_fixed_to_grid(in->left.p2.y); - - out->right.p1.x = dx + pixman_fixed_to_grid(in->right.p1.x); - out->right.p1.y = dy + pixman_fixed_to_grid(in->right.p1.y); - out->right.p2.x = dx + pixman_fixed_to_grid(in->right.p2.x); - out->right.p2.y = dy + pixman_fixed_to_grid(in->right.p2.y); - - out->top = dy + pixman_fixed_to_grid(in->top); - out->bottom = dy + pixman_fixed_to_grid(in->bottom); - - __DBG(("%s: out: L:(%d, %d), (%d, %d); R:(%d, %d), (%d, %d), [%d, %d]\n", - __FUNCTION__, - out->left.p1.x, out->left.p1.y, out->left.p2.x, out->left.p2.y, - out->right.p1.x, out->right.p1.y, out->right.p2.x, out->right.p2.y, - out->top, out->bottom)); - - return xTrapezoidValid(out); -} - -static span_func_t -choose_span(struct sna_composite_spans_op *tmp, - PicturePtr dst, - PictFormatPtr maskFormat, - RegionPtr clip) -{ - span_func_t span; - - if (is_mono(dst, maskFormat)) { - /* XXX An imprecise approximation */ - if (maskFormat && !operator_is_bounded(tmp->base.op)) { - span = tor_blt_span_mono_unbounded; - if (clip->data) - span = tor_blt_span_mono_unbounded_clipped; - } else { - span = tor_blt_span_mono; - if (clip->data) - span = tor_blt_span_mono_clipped; - } - } else { - if (clip->data) - span = tor_blt_span_clipped; - else if (tmp->base.damage == NULL) - span = tor_blt_span__no_damage; - else - span = tor_blt_span; - } - - return span; -} - -struct mono_span_thread { - struct sna *sna; - const xTrapezoid *traps; - const struct sna_composite_op *op; - RegionPtr clip; - int ntrap; - BoxRec extents; - int dx, dy; -}; - -static void -mono_span_thread(void *arg) -{ - struct mono_span_thread *thread = arg; - struct mono mono; - struct mono_span_thread_boxes boxes; - const xTrapezoid *t; - int n; - - mono.sna = thread->sna; - - mono.clip.extents = thread->extents; - mono.clip.data = NULL; - if (thread->clip->data) { - RegionIntersect(&mono.clip, &mono.clip, thread->clip); - if (RegionNil(&mono.clip)) - return; - } - - boxes.op = thread->op; - boxes.num_boxes = 0; - mono.op.priv = &boxes; - - if (!mono_init(&mono, 2*thread->ntrap)) { - RegionUninit(&mono.clip); - return; - } - - for (n = thread->ntrap, t = thread->traps; n--; t++) { - if (!xTrapezoidValid(t)) - continue; - - if (pixman_fixed_to_int(t->top) + thread->dy >= thread->extents.y2 || - pixman_fixed_to_int(t->bottom) + thread->dy <= thread->extents.y1) - continue; - - mono_add_line(&mono, thread->dx, thread->dy, - t->top, t->bottom, - &t->left.p1, &t->left.p2, 1); - mono_add_line(&mono, thread->dx, thread->dy, - t->top, t->bottom, - &t->right.p1, &t->right.p2, -1); - } - - if (mono.clip.data == NULL) - mono.span = thread_mono_span; - else - mono.span = thread_mono_span_clipped; - - mono_render(&mono); - mono_fini(&mono); - - if (boxes.num_boxes) - thread->op->thread_boxes(thread->sna, thread->op, - boxes.boxes, boxes.num_boxes); - RegionUninit(&mono.clip); -} - -static bool -mono_trapezoids_span_converter(struct sna *sna, - CARD8 op, PicturePtr src, PicturePtr dst, - INT16 src_x, INT16 src_y, - int ntrap, xTrapezoid *traps) -{ - struct mono mono; - BoxRec extents; - int16_t dst_x, dst_y; - int16_t dx, dy; - bool unbounded; - int num_threads, n; - - if (NO_SCAN_CONVERTER) - return false; - - trapezoid_origin(&traps[0].left, &dst_x, &dst_y); - - trapezoids_bounds(ntrap, traps, &extents); - if (extents.y1 >= extents.y2 || extents.x1 >= extents.x2) - return true; - - DBG(("%s: extents (%d, %d), (%d, %d)\n", - __FUNCTION__, extents.x1, extents.y1, extents.x2, extents.y2)); - - if (!sna_compute_composite_region(&mono.clip, - src, NULL, dst, - src_x + extents.x1 - dst_x, - src_y + extents.y1 - dst_y, - 0, 0, - extents.x1, extents.y1, - extents.x2 - extents.x1, - extents.y2 - extents.y1)) { - DBG(("%s: trapezoids do not intersect drawable clips\n", - __FUNCTION__)) ; - return true; - } - - dx = dst->pDrawable->x; - dy = dst->pDrawable->y; - - DBG(("%s: after clip -- extents (%d, %d), (%d, %d), delta=(%d, %d) src -> (%d, %d)\n", - __FUNCTION__, - mono.clip.extents.x1, mono.clip.extents.y1, - mono.clip.extents.x2, mono.clip.extents.y2, - dx, dy, - src_x + mono.clip.extents.x1 - dst_x - dx, - src_y + mono.clip.extents.y1 - dst_y - dy)); - - unbounded = (!sna_drawable_is_clear(dst->pDrawable) && - !operator_is_bounded(op)); - - mono.sna = sna; - if (!mono.sna->render.composite(mono.sna, op, src, NULL, dst, - src_x + mono.clip.extents.x1 - dst_x - dx, - src_y + mono.clip.extents.y1 - dst_y - dy, - 0, 0, - mono.clip.extents.x1, mono.clip.extents.y1, - mono.clip.extents.x2 - mono.clip.extents.x1, - mono.clip.extents.y2 - mono.clip.extents.y1, - memset(&mono.op, 0, sizeof(mono.op)))) - return false; - - num_threads = 1; - if (!NO_GPU_THREADS && - mono.op.thread_boxes && - mono.op.damage == NULL && - !unbounded) - num_threads = sna_use_threads(mono.clip.extents.x2 - mono.clip.extents.x1, - mono.clip.extents.y2 - mono.clip.extents.y1, - 32); - if (num_threads > 1) { - struct mono_span_thread threads[num_threads]; - int y, h; - - DBG(("%s: using %d threads for mono span compositing %dx%d\n", - __FUNCTION__, num_threads, - mono.clip.extents.x2 - mono.clip.extents.x1, - mono.clip.extents.y2 - mono.clip.extents.y1)); - - threads[0].sna = mono.sna; - threads[0].op = &mono.op; - threads[0].traps = traps; - threads[0].ntrap = ntrap; - threads[0].extents = mono.clip.extents; - threads[0].clip = &mono.clip; - threads[0].dx = dx; - threads[0].dy = dy; - - y = extents.y1; - h = extents.y2 - extents.y1; - h = (h + num_threads - 1) / num_threads; - - for (n = 1; n < num_threads; n++) { - threads[n] = threads[0]; - threads[n].extents.y1 = y; - threads[n].extents.y2 = y += h; - - sna_threads_run(mono_span_thread, &threads[n]); - } - - threads[0].extents.y1 = y; - threads[0].extents.y2 = extents.y2; - mono_span_thread(&threads[0]); - - sna_threads_wait(); - mono.op.done(mono.sna, &mono.op); - return true; - } - - if (!mono_init(&mono, 2*ntrap)) - return false; - - for (n = 0; n < ntrap; n++) { - if (!xTrapezoidValid(&traps[n])) - continue; - - if (pixman_fixed_integer_floor(traps[n].top) + dy >= mono.clip.extents.y2 || - pixman_fixed_integer_ceil(traps[n].bottom) + dy <= mono.clip.extents.y1) - continue; - - mono_add_line(&mono, dx, dy, - traps[n].top, traps[n].bottom, - &traps[n].left.p1, &traps[n].left.p2, 1); - mono_add_line(&mono, dx, dy, - traps[n].top, traps[n].bottom, - &traps[n].right.p1, &traps[n].right.p2, -1); - } - - if (mono.clip.data == NULL && mono.op.damage == NULL) - mono.span = mono_span__fast; - else - mono.span = mono_span; - - mono_render(&mono); - mono.op.done(mono.sna, &mono.op); - mono_fini(&mono); - - if (unbounded) { - xPointFixed p1, p2; - - if (!mono_init(&mono, 2+2*ntrap)) - return false; - - p1.y = mono.clip.extents.y1 * pixman_fixed_1; - p2.y = mono.clip.extents.y2 * pixman_fixed_1; - - p1.x = mono.clip.extents.x1 * pixman_fixed_1; - p2.x = mono.clip.extents.x1 * pixman_fixed_1; - mono_add_line(&mono, 0, 0, p1.y, p2.y, &p1, &p2, -1); - - p1.x = mono.clip.extents.x2 * pixman_fixed_1; - p2.x = mono.clip.extents.x2 * pixman_fixed_1; - mono_add_line(&mono, 0, 0, p1.y, p2.y, &p1, &p2, 1); - - for (n = 0; n < ntrap; n++) { - if (!xTrapezoidValid(&traps[n])) - continue; - - if (pixman_fixed_to_int(traps[n].top) + dy >= mono.clip.extents.y2 || - pixman_fixed_to_int(traps[n].bottom) + dy < mono.clip.extents.y1) - continue; - - mono_add_line(&mono, dx, dy, - traps[n].top, traps[n].bottom, - &traps[n].left.p1, &traps[n].left.p2, 1); - mono_add_line(&mono, dx, dy, - traps[n].top, traps[n].bottom, - &traps[n].right.p1, &traps[n].right.p2, -1); - } - memset(&mono.op, 0, sizeof(mono.op)); - if (mono.sna->render.composite(mono.sna, - PictOpClear, - mono.sna->clear, NULL, dst, - 0, 0, - 0, 0, - mono.clip.extents.x1, mono.clip.extents.y1, - mono.clip.extents.x2 - mono.clip.extents.x1, - mono.clip.extents.y2 - mono.clip.extents.y1, - &mono.op)) { - mono_render(&mono); - mono.op.done(mono.sna, &mono.op); - } - mono_fini(&mono); - } - - REGION_UNINIT(NULL, &mono.clip); - return true; -} - -struct span_thread { - struct sna *sna; - const struct sna_composite_spans_op *op; - const xTrapezoid *traps; - RegionPtr clip; - span_func_t span; - BoxRec extents; - int dx, dy, draw_y; - int ntrap; - bool unbounded; -}; - -#define SPAN_THREAD_MAX_BOXES (8192/sizeof(struct sna_opacity_box)) -struct span_thread_boxes { - const struct sna_composite_spans_op *op; - struct sna_opacity_box boxes[SPAN_THREAD_MAX_BOXES]; - int num_boxes; -}; - -static void span_thread_add_boxes(struct sna *sna, void *data, - const BoxRec *box, int count, float alpha) -{ - struct span_thread_boxes *b = data; - - __DBG(("%s: adding %d boxes with alpha=%f\n", - __FUNCTION__, count, alpha)); - - assert(count > 0 && count <= SPAN_THREAD_MAX_BOXES); - if (unlikely(b->num_boxes + count > SPAN_THREAD_MAX_BOXES)) { - DBG(("%s: flushing %d boxes, adding %d\n", __FUNCTION__, b->num_boxes, count)); - assert(b->num_boxes <= SPAN_THREAD_MAX_BOXES); - b->op->thread_boxes(sna, b->op, b->boxes, b->num_boxes); - b->num_boxes = 0; - } - - do { - b->boxes[b->num_boxes].box = *box++; - b->boxes[b->num_boxes].alpha = alpha; - b->num_boxes++; - } while (--count); - assert(b->num_boxes <= SPAN_THREAD_MAX_BOXES); -} - -static void -span_thread_box(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage) -{ - __DBG(("%s: %d -> %d @ %d\n", __FUNCTION__, box->x1, box->x2, coverage)); - span_thread_add_boxes(sna, op, box, 1, AREA_TO_ALPHA(coverage)); -} - -static void -span_thread_clipped_box(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage) -{ - pixman_region16_t region; - - __DBG(("%s: %d -> %d @ %f\n", __FUNCTION__, box->x1, box->x2, - AREA_TO_ALPHA(coverage))); - - pixman_region_init_rects(®ion, box, 1); - RegionIntersect(®ion, ®ion, clip); - if (REGION_NUM_RECTS(®ion)) { - span_thread_add_boxes(sna, op, - REGION_RECTS(®ion), - REGION_NUM_RECTS(®ion), - AREA_TO_ALPHA(coverage)); - } - pixman_region_fini(®ion); -} - -static span_func_t -thread_choose_span(struct sna_composite_spans_op *tmp, - PicturePtr dst, - PictFormatPtr maskFormat, - RegionPtr clip) -{ - span_func_t span; - - if (tmp->base.damage) { - DBG(("%s: damaged -> no thread support\n", __FUNCTION__)); - return NULL; - } - - if (is_mono(dst, maskFormat)) { - DBG(("%s: mono rendering -> no thread support\n", __FUNCTION__)); - return NULL; - } else { - assert(tmp->thread_boxes); - DBG(("%s: clipped? %d\n", __FUNCTION__, clip->data != NULL)); - if (clip->data) - span = span_thread_clipped_box; - else - span = span_thread_box; - } - - return span; -} - -static void -span_thread(void *arg) -{ - struct span_thread *thread = arg; - struct span_thread_boxes boxes; - struct tor tor; - const xTrapezoid *t; - int n, y1, y2; - - if (!tor_init(&tor, &thread->extents, 2*thread->ntrap)) - return; - - boxes.op = thread->op; - boxes.num_boxes = 0; - - y1 = thread->extents.y1 - thread->draw_y; - y2 = thread->extents.y2 - thread->draw_y; - for (n = thread->ntrap, t = thread->traps; n--; t++) { - xTrapezoid tt; - - if (pixman_fixed_integer_floor(t->top) >= y2 || - pixman_fixed_integer_ceil(t->bottom) <= y1) - continue; - - if (!project_trapezoid_onto_grid(t, thread->dx, thread->dy, &tt)) - continue; - - tor_add_edge(&tor, &tt, &tt.left, 1); - tor_add_edge(&tor, &tt, &tt.right, -1); - } - - tor_render(thread->sna, &tor, - (struct sna_composite_spans_op *)&boxes, thread->clip, - thread->span, thread->unbounded); - - tor_fini(&tor); - - if (boxes.num_boxes) { - DBG(("%s: flushing %d boxes\n", __FUNCTION__, boxes.num_boxes)); - assert(boxes.num_boxes <= SPAN_THREAD_MAX_BOXES); - thread->op->thread_boxes(thread->sna, thread->op, - boxes.boxes, boxes.num_boxes); - } -} - -static bool -trapezoid_span_converter(struct sna *sna, - CARD8 op, PicturePtr src, PicturePtr dst, - PictFormatPtr maskFormat, unsigned int flags, - INT16 src_x, INT16 src_y, - int ntrap, xTrapezoid *traps) -{ - struct sna_composite_spans_op tmp; - pixman_region16_t clip; - int16_t dst_x, dst_y; - bool was_clear; - int dx, dy, n; - int num_threads; - - if (NO_SCAN_CONVERTER) - return false; - - if (is_mono(dst, maskFormat)) - return mono_trapezoids_span_converter(sna, op, src, dst, - src_x, src_y, - ntrap, traps); - - /* XXX strict adherence to the Render specification */ - if (dst->polyMode == PolyModePrecise) { - DBG(("%s: fallback -- precise rasterisation requested\n", - __FUNCTION__)); - return false; - } - - if (!sna->render.check_composite_spans(sna, op, src, dst, 0, 0, flags)) { - DBG(("%s: fallback -- composite spans not supported\n", - __FUNCTION__)); - return false; - } - - trapezoid_origin(&traps[0].left, &dst_x, &dst_y); - - trapezoids_bounds(ntrap, traps, &clip.extents); - if (clip.extents.y1 >= clip.extents.y2 || - clip.extents.x1 >= clip.extents.x2) - return true; - -#if 0 - if (clip.extents.y2 - clip.extents.y1 < 64 && - clip.extents.x2 - clip.extents.x1 < 64) { - DBG(("%s: fallback -- traps extents too small %dx%d\n", - __FUNCTION__, extents.y2 - extents.y1, extents.x2 - extents.x1)); - return false; - } -#endif - - DBG(("%s: extents (%d, %d), (%d, %d)\n", - __FUNCTION__, - clip.extents.x1, clip.extents.y1, - clip.extents.x2, clip.extents.y2)); - - if (!sna_compute_composite_region(&clip, - src, NULL, dst, - src_x + clip.extents.x1 - dst_x, - src_y + clip.extents.y1 - dst_y, - 0, 0, - clip.extents.x1, clip.extents.y1, - clip.extents.x2 - clip.extents.x1, - clip.extents.y2 - clip.extents.y1)) { - DBG(("%s: trapezoids do not intersect drawable clips\n", - __FUNCTION__)) ; - return true; - } - - if (!sna->render.check_composite_spans(sna, op, src, dst, - clip.extents.x2 - clip.extents.x1, - clip.extents.y2 - clip.extents.y1, - flags)) { - DBG(("%s: fallback -- composite spans not supported\n", - __FUNCTION__)); - return false; - } - - dx = dst->pDrawable->x; - dy = dst->pDrawable->y; - - DBG(("%s: after clip -- extents (%d, %d), (%d, %d), delta=(%d, %d) src -> (%d, %d)\n", - __FUNCTION__, - clip.extents.x1, clip.extents.y1, - clip.extents.x2, clip.extents.y2, - dx, dy, - src_x + clip.extents.x1 - dst_x - dx, - src_y + clip.extents.y1 - dst_y - dy)); - - was_clear = sna_drawable_is_clear(dst->pDrawable); - switch (op) { - case PictOpAdd: - case PictOpOver: - if (was_clear) - op = PictOpSrc; - break; - case PictOpIn: - if (was_clear) - return true; - break; - } - - if (!sna->render.composite_spans(sna, op, src, dst, - src_x + clip.extents.x1 - dst_x - dx, - src_y + clip.extents.y1 - dst_y - dy, - clip.extents.x1, clip.extents.y1, - clip.extents.x2 - clip.extents.x1, - clip.extents.y2 - clip.extents.y1, - flags, memset(&tmp, 0, sizeof(tmp)))) { - DBG(("%s: fallback -- composite spans render op not supported\n", - __FUNCTION__)); - return false; - } - - dx *= FAST_SAMPLES_X; - dy *= FAST_SAMPLES_Y; - - num_threads = 1; - if (!NO_GPU_THREADS && tmp.thread_boxes && - thread_choose_span(&tmp, dst, maskFormat, &clip)) - num_threads = sna_use_threads(clip.extents.x2-clip.extents.x1, - clip.extents.y2-clip.extents.y1, - 16); - DBG(("%s: using %d threads\n", __FUNCTION__, num_threads)); - if (num_threads == 1) { - struct tor tor; - - if (!tor_init(&tor, &clip.extents, 2*ntrap)) - goto skip; - - for (n = 0; n < ntrap; n++) { - xTrapezoid t; - - if (pixman_fixed_integer_floor(traps[n].top) + dst->pDrawable->y >= clip.extents.y2 || - pixman_fixed_integer_ceil(traps[n].bottom) + dst->pDrawable->y <= clip.extents.y1) - continue; - - if (!project_trapezoid_onto_grid(&traps[n], dx, dy, &t)) - continue; - - tor_add_edge(&tor, &t, &t.left, 1); - tor_add_edge(&tor, &t, &t.right, -1); - } - - tor_render(sna, &tor, &tmp, &clip, - choose_span(&tmp, dst, maskFormat, &clip), - !was_clear && maskFormat && !operator_is_bounded(op)); - - tor_fini(&tor); - } else { - struct span_thread threads[num_threads]; - int y, h; - - DBG(("%s: using %d threads for span compositing %dx%d\n", - __FUNCTION__, num_threads, - clip.extents.x2 - clip.extents.x1, - clip.extents.y2 - clip.extents.y1)); - - threads[0].sna = sna; - threads[0].op = &tmp; - threads[0].traps = traps; - threads[0].ntrap = ntrap; - threads[0].extents = clip.extents; - threads[0].clip = &clip; - threads[0].dx = dx; - threads[0].dy = dy; - threads[0].draw_y = dst->pDrawable->y; - threads[0].unbounded = !was_clear && maskFormat && !operator_is_bounded(op); - threads[0].span = thread_choose_span(&tmp, dst, maskFormat, &clip); - - y = clip.extents.y1; - h = clip.extents.y2 - clip.extents.y1; - h = (h + num_threads - 1) / num_threads; - - for (n = 1; n < num_threads; n++) { - threads[n] = threads[0]; - threads[n].extents.y1 = y; - threads[n].extents.y2 = y += h; - - sna_threads_run(span_thread, &threads[n]); - } - - threads[0].extents.y1 = y; - span_thread(&threads[0]); - - sna_threads_wait(); - } -skip: - tmp.done(sna, &tmp); - - REGION_UNINIT(NULL, &clip); - return true; -} - -static void -tor_blt_mask(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage) -{ - uint8_t *ptr = (uint8_t *)op; - int stride = (intptr_t)clip; - int h, w; - - coverage = 256 * coverage / FAST_SAMPLES_XY; - coverage -= coverage >> 8; - - ptr += box->y1 * stride + box->x1; - - h = box->y2 - box->y1; - w = box->x2 - box->x1; - if ((w | h) == 1) { - *ptr = coverage; - } else if (w == 1) { - do { - *ptr = coverage; - ptr += stride; - } while (--h); - } else do { - memset(ptr, coverage, w); - ptr += stride; - } while (--h); -} - -static void -tor_blt_mask_mono(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage) -{ - tor_blt_mask(sna, op, clip, box, - coverage < FAST_SAMPLES_XY/2 ? 0 : FAST_SAMPLES_XY); -} - -static bool -trapezoid_mask_converter(CARD8 op, PicturePtr src, PicturePtr dst, - PictFormatPtr maskFormat, INT16 src_x, INT16 src_y, - int ntrap, xTrapezoid *traps) -{ - struct tor tor; - ScreenPtr screen = dst->pDrawable->pScreen; - PixmapPtr scratch; - PicturePtr mask; - BoxRec extents; - int16_t dst_x, dst_y; - int dx, dy; - int error, n; - - if (NO_SCAN_CONVERTER) - return false; - - if (dst->polyMode == PolyModePrecise && !is_mono(dst, maskFormat)) { - DBG(("%s: fallback -- precise rasterisation requested\n", - __FUNCTION__)); - return false; - } - - if (maskFormat == NULL && ntrap > 1) { - DBG(("%s: individual rasterisation requested\n", - __FUNCTION__)); - do { - /* XXX unwind errors? */ - if (!trapezoid_mask_converter(op, src, dst, NULL, - src_x, src_y, 1, traps++)) - return false; - } while (--ntrap); - return true; - } - - trapezoids_bounds(ntrap, traps, &extents); - if (extents.y1 >= extents.y2 || extents.x1 >= extents.x2) - return true; - - DBG(("%s: ntraps=%d, extents (%d, %d), (%d, %d)\n", - __FUNCTION__, ntrap, extents.x1, extents.y1, extents.x2, extents.y2)); - - if (!sna_compute_composite_extents(&extents, - src, NULL, dst, - src_x, src_y, - 0, 0, - extents.x1, extents.y1, - extents.x2 - extents.x1, - extents.y2 - extents.y1)) - return true; - - DBG(("%s: extents (%d, %d), (%d, %d)\n", - __FUNCTION__, extents.x1, extents.y1, extents.x2, extents.y2)); - - extents.y2 -= extents.y1; - extents.x2 -= extents.x1; - extents.x1 -= dst->pDrawable->x; - extents.y1 -= dst->pDrawable->y; - dst_x = extents.x1; - dst_y = extents.y1; - dx = -extents.x1 * FAST_SAMPLES_X; - dy = -extents.y1 * FAST_SAMPLES_Y; - extents.x1 = extents.y1 = 0; - - DBG(("%s: mask (%dx%d), dx=(%d, %d)\n", - __FUNCTION__, extents.x2, extents.y2, dx, dy)); - scratch = sna_pixmap_create_upload(screen, - extents.x2, extents.y2, 8, - KGEM_BUFFER_WRITE_INPLACE); - if (!scratch) - return true; - - DBG(("%s: created buffer %p, stride %d\n", - __FUNCTION__, scratch->devPrivate.ptr, scratch->devKind)); - - if (!tor_init(&tor, &extents, 2*ntrap)) { - sna_pixmap_destroy(scratch); - return true; - } - - for (n = 0; n < ntrap; n++) { - xTrapezoid t; - - if (!project_trapezoid_onto_grid(&traps[n], dx, dy, &t)) - continue; - - if (pixman_fixed_to_int(traps[n].top) - dst_y >= extents.y2 || - pixman_fixed_to_int(traps[n].bottom) - dst_y < 0) - continue; - - tor_add_edge(&tor, &t, &t.left, 1); - tor_add_edge(&tor, &t, &t.right, -1); - } - - if (extents.x2 <= TOR_INPLACE_SIZE) { - uint8_t buf[TOR_INPLACE_SIZE]; - tor_inplace(&tor, scratch, is_mono(dst, maskFormat), - scratch->usage_hint ? NULL : buf); - } else { - tor_render(NULL, &tor, - scratch->devPrivate.ptr, - (void *)(intptr_t)scratch->devKind, - is_mono(dst, maskFormat) ? tor_blt_mask_mono : tor_blt_mask, - true); - } - tor_fini(&tor); - - mask = CreatePicture(0, &scratch->drawable, - PictureMatchFormat(screen, 8, PICT_a8), - 0, 0, serverClient, &error); - if (mask) { - CompositePicture(op, src, mask, dst, - src_x + dst_x - pixman_fixed_to_int(traps[0].left.p1.x), - src_y + dst_y - pixman_fixed_to_int(traps[0].left.p1.y), - 0, 0, - dst_x, dst_y, - extents.x2, extents.y2); - FreePicture(mask, 0); - } - sna_pixmap_destroy(scratch); - - return true; -} - -struct inplace { - uint32_t stride; - uint8_t *ptr; - union { - uint8_t opacity; - uint32_t color; - }; -}; - -static force_inline uint8_t coverage_opacity(int coverage, uint8_t opacity) -{ - coverage = coverage * 256 / FAST_SAMPLES_XY; - coverage -= coverage >> 8; - return opacity == 255 ? coverage : mul_8_8(coverage, opacity); -} - -static void -tor_blt_src(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage) -{ - struct inplace *in = (struct inplace *)op; - uint8_t *ptr = in->ptr; - int h, w; - - coverage = coverage_opacity(coverage, in->opacity); - - ptr += box->y1 * in->stride + box->x1; - - h = box->y2 - box->y1; - w = box->x2 - box->x1; - if ((w | h) == 1) { - *ptr = coverage; - } else if (w == 1) { - do { - *ptr = coverage; - ptr += in->stride; - } while (--h); - } else do { - memset(ptr, coverage, w); - ptr += in->stride; - } while (--h); -} - -static void -tor_blt_src_clipped(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage) -{ - pixman_region16_t region; - int n; - - pixman_region_init_rects(®ion, box, 1); - RegionIntersect(®ion, ®ion, clip); - n = REGION_NUM_RECTS(®ion); - box = REGION_RECTS(®ion); - while (n--) - tor_blt_src(sna, op, NULL, box++, coverage); - pixman_region_fini(®ion); -} - -static void -tor_blt_in(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage) -{ - struct inplace *in = (struct inplace *)op; - uint8_t *ptr = in->ptr; - int h, w, i; - - if (coverage == 0) { - tor_blt_src(sna, op, clip, box, 0); - return; - } - - coverage = coverage_opacity(coverage, in->opacity); - if (coverage == 0xff) - return; - - ptr += box->y1 * in->stride + box->x1; - - h = box->y2 - box->y1; - w = box->x2 - box->x1; - do { - for (i = 0; i < w; i++) - ptr[i] = mul_8_8(ptr[i], coverage); - ptr += in->stride; - } while (--h); -} - -static void -tor_blt_in_clipped(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage) -{ - pixman_region16_t region; - int n; - - pixman_region_init_rects(®ion, box, 1); - RegionIntersect(®ion, ®ion, clip); - n = REGION_NUM_RECTS(®ion); - box = REGION_RECTS(®ion); - while (n--) - tor_blt_in(sna, op, NULL, box++, coverage); - pixman_region_fini(®ion); -} - -static void -tor_blt_add(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage) -{ - struct inplace *in = (struct inplace *)op; - uint8_t *ptr = in->ptr; - int h, w, v, i; - - if (coverage == 0) - return; - - coverage = coverage_opacity(coverage, in->opacity); - if (coverage == 0xff) { - tor_blt_src(sna, op, clip, box, 0xff); - return; - } - - ptr += box->y1 * in->stride + box->x1; - - h = box->y2 - box->y1; - w = box->x2 - box->x1; - if ((w | h) == 1) { - v = coverage + *ptr; - *ptr = v >= 255 ? 255 : v; - } else { - do { - for (i = 0; i < w; i++) { - v = coverage + ptr[i]; - ptr[i] = v >= 255 ? 255 : v; - } - ptr += in->stride; - } while (--h); - } -} - -static void -tor_blt_add_clipped(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage) -{ - pixman_region16_t region; - int n; - - pixman_region_init_rects(®ion, box, 1); - RegionIntersect(®ion, ®ion, clip); - n = REGION_NUM_RECTS(®ion); - box = REGION_RECTS(®ion); - while (n--) - tor_blt_add(sna, op, NULL, box++, coverage); - pixman_region_fini(®ion); -} - -static void -tor_blt_lerp32(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage) -{ - struct inplace *in = (struct inplace *)op; - uint32_t *ptr = (uint32_t *)in->ptr; - int stride = in->stride / sizeof(uint32_t); - int h, w, i; - - if (coverage == 0) - return; - - ptr += box->y1 * stride + box->x1; - - h = box->y2 - box->y1; - w = box->x2 - box->x1; - if (coverage == FAST_SAMPLES_XY) { - if ((w | h) == 1) { - *ptr = in->color; - } else { - if (w < 16) { - do { - for (i = 0; i < w; i++) - ptr[i] = in->color; - ptr += stride; - } while (--h); - } else { - pixman_fill(ptr, stride, 32, - 0, 0, w, h, in->color); - } - } - } else { - coverage = coverage * 256 / FAST_SAMPLES_XY; - coverage -= coverage >> 8; - - if ((w | h) == 1) { - *ptr = lerp8x4(in->color, coverage, *ptr); - } else if (w == 1) { - do { - *ptr = lerp8x4(in->color, coverage, *ptr); - ptr += stride; - } while (--h); - } else{ - do { - for (i = 0; i < w; i++) - ptr[i] = lerp8x4(in->color, coverage, ptr[i]); - ptr += stride; - } while (--h); - } - } -} - -static void -tor_blt_lerp32_clipped(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage) -{ - pixman_region16_t region; - int n; - - pixman_region_init_rects(®ion, box, 1); - RegionIntersect(®ion, ®ion, clip); - n = REGION_NUM_RECTS(®ion); - box = REGION_RECTS(®ion); - while (n--) - tor_blt_lerp32(sna, op, NULL, box++, coverage); - pixman_region_fini(®ion); -} - -struct mono_inplace_composite { - pixman_image_t *src, *dst; - int dx, dy; - int sx, sy; - int op; -}; -struct mono_inplace_fill { - uint32_t *data, stride; - uint32_t color; - int bpp; -}; - -fastcall static void -mono_inplace_fill_box(struct sna *sna, - const struct sna_composite_op *op, - const BoxRec *box) -{ - struct mono_inplace_fill *fill = op->priv; - - DBG(("(%s: (%d, %d)x(%d, %d):%08x\n", - __FUNCTION__, - box->x1, box->y1, - box->x2 - box->x1, - box->y2 - box->y1, - fill->color)); - pixman_fill(fill->data, fill->stride, fill->bpp, - box->x1, box->y1, - box->x2 - box->x1, - box->y2 - box->y1, - fill->color); -} - -static void -mono_inplace_fill_boxes(struct sna *sna, - const struct sna_composite_op *op, - const BoxRec *box, int nbox) -{ - struct mono_inplace_fill *fill = op->priv; - - do { - DBG(("(%s: (%d, %d)x(%d, %d):%08x\n", - __FUNCTION__, - box->x1, box->y1, - box->x2 - box->x1, - box->y2 - box->y1, - fill->color)); - pixman_fill(fill->data, fill->stride, fill->bpp, - box->x1, box->y1, - box->x2 - box->x1, - box->y2 - box->y1, - fill->color); - box++; - } while (--nbox); -} - -fastcall static void -mono_inplace_composite_box(struct sna *sna, - const struct sna_composite_op *op, - const BoxRec *box) -{ - struct mono_inplace_composite *c = op->priv; - - pixman_image_composite(c->op, c->src, NULL, c->dst, - box->x1 + c->sx, box->y1 + c->sy, - 0, 0, - box->x1 + c->dx, box->y1 + c->dy, - box->x2 - box->x1, - box->y2 - box->y1); -} - -static void -mono_inplace_composite_boxes(struct sna *sna, - const struct sna_composite_op *op, - const BoxRec *box, int nbox) -{ - struct mono_inplace_composite *c = op->priv; - - do { - pixman_image_composite(c->op, c->src, NULL, c->dst, - box->x1 + c->sx, box->y1 + c->sy, - 0, 0, - box->x1 + c->dx, box->y1 + c->dy, - box->x2 - box->x1, - box->y2 - box->y1); - box++; - } while (--nbox); -} - -static bool trapezoid_spans_maybe_inplace(struct sna *sna, CARD8 op, PicturePtr src, PicturePtr dst, PictFormatPtr maskFormat) @@ -5325,1046 +532,6 @@ out: return dst->pDrawable->width <= TOR_INPLACE_SIZE; } -static bool -trapezoid_span_mono_inplace(struct sna *sna, - CARD8 op, - PicturePtr src, - PicturePtr dst, - INT16 src_x, INT16 src_y, - int ntrap, xTrapezoid *traps) -{ - struct mono mono; - union { - struct mono_inplace_fill fill; - struct mono_inplace_composite composite; - } inplace; - int was_clear; - int x, y, n; - - trapezoids_bounds(ntrap, traps, &mono.clip.extents); - if (mono.clip.extents.y1 >= mono.clip.extents.y2 || - mono.clip.extents.x1 >= mono.clip.extents.x2) - return true; - - DBG(("%s: extents (%d, %d), (%d, %d)\n", - __FUNCTION__, - mono.clip.extents.x1, mono.clip.extents.y1, - mono.clip.extents.x2, mono.clip.extents.y2)); - - if (!sna_compute_composite_region(&mono.clip, - src, NULL, dst, - src_x, src_y, - 0, 0, - mono.clip.extents.x1, mono.clip.extents.y1, - mono.clip.extents.x2 - mono.clip.extents.x1, - mono.clip.extents.y2 - mono.clip.extents.y1)) { - DBG(("%s: trapezoids do not intersect drawable clips\n", - __FUNCTION__)) ; - return true; - } - - DBG(("%s: clipped extents (%d, %d), (%d, %d)\n", - __FUNCTION__, - mono.clip.extents.x1, mono.clip.extents.y1, - mono.clip.extents.x2, mono.clip.extents.y2)); - - was_clear = sna_drawable_is_clear(dst->pDrawable); - if (!sna_drawable_move_region_to_cpu(dst->pDrawable, &mono.clip, - MOVE_WRITE | MOVE_READ)) - return true; - - mono.sna = sna; - if (!mono_init(&mono, 2*ntrap)) - return false; - - mono.op.damage = NULL; - - x = dst->pDrawable->x; - y = dst->pDrawable->y; - - for (n = 0; n < ntrap; n++) { - if (!xTrapezoidValid(&traps[n])) - continue; - - if (pixman_fixed_to_int(traps[n].top) + y >= mono.clip.extents.y2 || - pixman_fixed_to_int(traps[n].bottom) + y < mono.clip.extents.y1) - continue; - - mono_add_line(&mono, x, y, - traps[n].top, traps[n].bottom, - &traps[n].left.p1, &traps[n].left.p2, 1); - mono_add_line(&mono, x, y, - traps[n].top, traps[n].bottom, - &traps[n].right.p1, &traps[n].right.p2, -1); - } - - if (sna_picture_is_solid(src, &inplace.fill.color) && - (op == PictOpSrc || op == PictOpClear || - (was_clear && (op == PictOpOver || op == PictOpAdd)) || - (op == PictOpOver && inplace.fill.color >> 24 == 0xff))) { - PixmapPtr pixmap; - int16_t dx, dy; - uint8_t *ptr; - -unbounded_pass: - pixmap = get_drawable_pixmap(dst->pDrawable); - - ptr = pixmap->devPrivate.ptr; - if (get_drawable_deltas(dst->pDrawable, pixmap, &dx, &dy)) - ptr += dy * pixmap->devKind + dx * pixmap->drawable.bitsPerPixel / 8; - inplace.fill.data = (uint32_t *)ptr; - inplace.fill.stride = pixmap->devKind / sizeof(uint32_t); - inplace.fill.bpp = pixmap->drawable.bitsPerPixel; - - if (op == PictOpClear) - inplace.fill.color = 0; - else if (dst->format != PICT_a8r8g8b8) - inplace.fill.color = sna_rgba_to_color(inplace.fill.color, dst->format); - - DBG(("%s: fill %x\n", __FUNCTION__, inplace.fill.color)); - - mono.op.priv = &inplace.fill; - mono.op.box = mono_inplace_fill_box; - mono.op.boxes = mono_inplace_fill_boxes; - - op = 0; - } else { - if (src->pDrawable) { - if (!sna_drawable_move_to_cpu(src->pDrawable, - MOVE_READ)) { - mono_fini(&mono); - return false; - } - if (src->alphaMap && - !sna_drawable_move_to_cpu(src->alphaMap->pDrawable, - MOVE_READ)) { - mono_fini(&mono); - return false; - } - } - - inplace.composite.dst = image_from_pict(dst, false, - &inplace.composite.dx, - &inplace.composite.dy); - inplace.composite.src = image_from_pict(src, false, - &inplace.composite.sx, - &inplace.composite.sy); - inplace.composite.sx += - src_x - pixman_fixed_to_int(traps[0].left.p1.x), - inplace.composite.sy += - src_y - pixman_fixed_to_int(traps[0].left.p1.y), - inplace.composite.op = op; - - mono.op.priv = &inplace.composite; - mono.op.box = mono_inplace_composite_box; - mono.op.boxes = mono_inplace_composite_boxes; - } - - if (mono.clip.data == NULL && mono.op.damage == NULL) - mono.span = mono_span__fast; - else - mono.span = mono_span; - mono_render(&mono); - mono_fini(&mono); - - if (op) { - free_pixman_pict(src, inplace.composite.src); - free_pixman_pict(dst, inplace.composite.dst); - - if (!was_clear && !operator_is_bounded(op)) { - xPointFixed p1, p2; - - DBG(("%s: unbounded fixup\n", __FUNCTION__)); - - if (!mono_init(&mono, 2+2*ntrap)) - return false; - - p1.y = mono.clip.extents.y1 * pixman_fixed_1; - p2.y = mono.clip.extents.y2 * pixman_fixed_1; - - p1.x = mono.clip.extents.x1 * pixman_fixed_1; - p2.x = mono.clip.extents.x1 * pixman_fixed_1; - mono_add_line(&mono, 0, 0, p1.y, p2.y, &p1, &p2, -1); - - p1.x = mono.clip.extents.x2 * pixman_fixed_1; - p2.x = mono.clip.extents.x2 * pixman_fixed_1; - mono_add_line(&mono, 0, 0, p1.y, p2.y, &p1, &p2, 1); - - for (n = 0; n < ntrap; n++) { - if (!xTrapezoidValid(&traps[n])) - continue; - - if (pixman_fixed_to_int(traps[n].top) + x >= mono.clip.extents.y2 || - pixman_fixed_to_int(traps[n].bottom) + y < mono.clip.extents.y1) - continue; - - mono_add_line(&mono, x, y, - traps[n].top, traps[n].bottom, - &traps[n].left.p1, &traps[n].left.p2, 1); - mono_add_line(&mono, x, y, - traps[n].top, traps[n].bottom, - &traps[n].right.p1, &traps[n].right.p2, -1); - } - - op = PictOpClear; - goto unbounded_pass; - } - } - - return true; -} - -static void -pixmask_span_solid(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage) -{ - struct pixman_inplace *pi = (struct pixman_inplace *)op; - if (coverage != FAST_SAMPLES_XY) { - coverage = coverage * 256 / FAST_SAMPLES_XY; - coverage -= coverage >> 8; - *pi->bits = mul_4x8_8(pi->color, coverage); - } else - *pi->bits = pi->color; - pixman_image_composite(pi->op, pi->source, NULL, pi->image, - box->x1, box->y1, - 0, 0, - pi->dx + box->x1, pi->dy + box->y1, - box->x2 - box->x1, box->y2 - box->y1); -} -static void -pixmask_span_solid__clipped(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage) -{ - pixman_region16_t region; - int n; - - pixman_region_init_rects(®ion, box, 1); - RegionIntersect(®ion, ®ion, clip); - n = REGION_NUM_RECTS(®ion); - box = REGION_RECTS(®ion); - while (n--) - pixmask_span_solid(sna, op, NULL, box++, coverage); - pixman_region_fini(®ion); -} - -static void -pixmask_span(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage) -{ - struct pixman_inplace *pi = (struct pixman_inplace *)op; - pixman_image_t *mask = NULL; - if (coverage != FAST_SAMPLES_XY) { - coverage = coverage * 256 / FAST_SAMPLES_XY; - coverage -= coverage >> 8; - *pi->bits = coverage; - mask = pi->mask; - } - pixman_image_composite(pi->op, pi->source, mask, pi->image, - pi->sx + box->x1, pi->sy + box->y1, - 0, 0, - pi->dx + box->x1, pi->dy + box->y1, - box->x2 - box->x1, box->y2 - box->y1); -} -static void -pixmask_span__clipped(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage) -{ - pixman_region16_t region; - int n; - - pixman_region_init_rects(®ion, box, 1); - RegionIntersect(®ion, ®ion, clip); - n = REGION_NUM_RECTS(®ion); - box = REGION_RECTS(®ion); - while (n--) - pixmask_span(sna, op, NULL, box++, coverage); - pixman_region_fini(®ion); -} - -struct inplace_x8r8g8b8_thread { - xTrapezoid *traps; - PicturePtr dst, src; - BoxRec extents; - int dx, dy; - int ntrap; - bool lerp, is_solid; - uint32_t color; - int16_t src_x, src_y; - uint8_t op; -}; - -static void inplace_x8r8g8b8_thread(void *arg) -{ - struct inplace_x8r8g8b8_thread *thread = arg; - struct tor tor; - span_func_t span; - RegionPtr clip; - int y1, y2, n; - - if (!tor_init(&tor, &thread->extents, 2*thread->ntrap)) - return; - - y1 = thread->extents.y1 - thread->dst->pDrawable->y; - y2 = thread->extents.y2 - thread->dst->pDrawable->y; - for (n = 0; n < thread->ntrap; n++) { - xTrapezoid t; - - if (!project_trapezoid_onto_grid(&thread->traps[n], thread->dx, thread->dy, &t)) - continue; - - if (pixman_fixed_to_int(thread->traps[n].top) >= y2 || - pixman_fixed_to_int(thread->traps[n].bottom) < y1) - continue; - - tor_add_edge(&tor, &t, &t.left, 1); - tor_add_edge(&tor, &t, &t.right, -1); - } - - clip = thread->dst->pCompositeClip; - if (thread->lerp) { - struct inplace inplace; - int16_t dst_x, dst_y; - PixmapPtr pixmap; - - pixmap = get_drawable_pixmap(thread->dst->pDrawable); - - inplace.ptr = pixmap->devPrivate.ptr; - if (get_drawable_deltas(thread->dst->pDrawable, pixmap, &dst_x, &dst_y)) - inplace.ptr += dst_y * pixmap->devKind + dst_x * 4; - inplace.stride = pixmap->devKind; - inplace.color = thread->color; - - if (clip->data) - span = tor_blt_lerp32_clipped; - else - span = tor_blt_lerp32; - - tor_render(NULL, &tor, (void*)&inplace, clip, span, false); - } else if (thread->is_solid) { - struct pixman_inplace pi; - - pi.image = image_from_pict(thread->dst, false, &pi.dx, &pi.dy); - pi.op = thread->op; - pi.color = thread->color; - - pi.bits = (uint32_t *)&pi.sx; - pi.source = pixman_image_create_bits(PIXMAN_a8r8g8b8, - 1, 1, pi.bits, 0); - pixman_image_set_repeat(pi.source, PIXMAN_REPEAT_NORMAL); - - if (clip->data) - span = pixmask_span_solid__clipped; - else - span = pixmask_span_solid; - - tor_render(NULL, &tor, (void*)&pi, clip, span, false); - - pixman_image_unref(pi.source); - pixman_image_unref(pi.image); - } else { - struct pixman_inplace pi; - - pi.image = image_from_pict(thread->dst, false, &pi.dx, &pi.dy); - pi.source = image_from_pict(thread->src, false, &pi.sx, &pi.sy); - pi.sx += thread->src_x - pixman_fixed_to_int(thread->traps[0].left.p1.x); - pi.sy += thread->src_y - pixman_fixed_to_int(thread->traps[0].left.p1.y); - pi.mask = pixman_image_create_bits(PIXMAN_a8, 1, 1, NULL, 0); - pixman_image_set_repeat(pi.mask, PIXMAN_REPEAT_NORMAL); - pi.bits = pixman_image_get_data(pi.mask); - pi.op = thread->op; - - if (clip->data) - span = pixmask_span__clipped; - else - span = pixmask_span; - - tor_render(NULL, &tor, (void*)&pi, clip, span, false); - - pixman_image_unref(pi.mask); - pixman_image_unref(pi.source); - pixman_image_unref(pi.image); - } - - tor_fini(&tor); -} - -static bool -trapezoid_span_inplace__x8r8g8b8(CARD8 op, - PicturePtr dst, - PicturePtr src, int16_t src_x, int16_t src_y, - PictFormatPtr maskFormat, - int ntrap, xTrapezoid *traps) -{ - uint32_t color; - bool lerp, is_solid; - RegionRec region; - int dx, dy; - int num_threads, n; - - lerp = false; - is_solid = sna_picture_is_solid(src, &color); - if (is_solid) { - if (op == PictOpOver && (color >> 24) == 0xff) - op = PictOpSrc; - if (op == PictOpOver && sna_drawable_is_clear(dst->pDrawable)) - op = PictOpSrc; - lerp = op == PictOpSrc; - } - if (!lerp) { - switch (op) { - case PictOpOver: - case PictOpAdd: - case PictOpOutReverse: - break; - case PictOpSrc: - if (!sna_drawable_is_clear(dst->pDrawable)) - return false; - break; - default: - return false; - } - } - - if (maskFormat == NULL && ntrap > 1) { - DBG(("%s: individual rasterisation requested\n", - __FUNCTION__)); - do { - /* XXX unwind errors? */ - if (!trapezoid_span_inplace__x8r8g8b8(op, dst, - src, src_x, src_y, - NULL, 1, traps++)) - return false; - } while (--ntrap); - return true; - } - - trapezoids_bounds(ntrap, traps, ®ion.extents); - if (region.extents.y1 >= region.extents.y2 || - region.extents.x1 >= region.extents.x2) - return true; - - DBG(("%s: extents (%d, %d), (%d, %d)\n", - __FUNCTION__, - region.extents.x1, region.extents.y1, - region.extents.x2, region.extents.y2)); - - if (!sna_compute_composite_extents(®ion.extents, - src, NULL, dst, - src_x, src_y, - 0, 0, - region.extents.x1, region.extents.y1, - region.extents.x2 - region.extents.x1, - region.extents.y2 - region.extents.y1)) - return true; - - DBG(("%s: clipped extents (%d, %d), (%d, %d)\n", - __FUNCTION__, - region.extents.x1, region.extents.y1, - region.extents.x2, region.extents.y2)); - - region.data = NULL; - if (!sna_drawable_move_region_to_cpu(dst->pDrawable, ®ion, - MOVE_WRITE | MOVE_READ)) - return true; - - if (!is_solid && src->pDrawable) { - if (!sna_drawable_move_to_cpu(src->pDrawable, - MOVE_READ)) - return true; - - if (src->alphaMap && - !sna_drawable_move_to_cpu(src->alphaMap->pDrawable, - MOVE_READ)) - return true; - } - - dx = dst->pDrawable->x * FAST_SAMPLES_X; - dy = dst->pDrawable->y * FAST_SAMPLES_Y; - - num_threads = sna_use_threads(4*(region.extents.x2 - region.extents.x1), - region.extents.y2 - region.extents.y1, - 16); - - DBG(("%s: %dx%d, format=%x, op=%d, lerp?=%d, num_threads=%d\n", - __FUNCTION__, - region.extents.x2 - region.extents.x1, - region.extents.y2 - region.extents.y1, - dst->format, op, lerp, num_threads)); - - if (num_threads == 1) { - struct tor tor; - span_func_t span; - - if (!tor_init(&tor, ®ion.extents, 2*ntrap)) - return true; - - for (n = 0; n < ntrap; n++) { - xTrapezoid t; - - if (!project_trapezoid_onto_grid(&traps[n], dx, dy, &t)) - continue; - - if (pixman_fixed_to_int(traps[n].top) >= region.extents.y2 - dst->pDrawable->y || - pixman_fixed_to_int(traps[n].bottom) < region.extents.y1 - dst->pDrawable->y) - continue; - - tor_add_edge(&tor, &t, &t.left, 1); - tor_add_edge(&tor, &t, &t.right, -1); - } - - if (lerp) { - struct inplace inplace; - PixmapPtr pixmap; - int16_t dst_x, dst_y; - - pixmap = get_drawable_pixmap(dst->pDrawable); - - inplace.ptr = pixmap->devPrivate.ptr; - if (get_drawable_deltas(dst->pDrawable, pixmap, &dst_x, &dst_y)) - inplace.ptr += dst_y * pixmap->devKind + dst_x * 4; - inplace.stride = pixmap->devKind; - inplace.color = color; - - if (dst->pCompositeClip->data) - span = tor_blt_lerp32_clipped; - else - span = tor_blt_lerp32; - - DBG(("%s: render inplace op=%d, color=%08x\n", - __FUNCTION__, op, color)); - - tor_render(NULL, &tor, (void*)&inplace, - dst->pCompositeClip, span, false); - } else if (is_solid) { - struct pixman_inplace pi; - - pi.image = image_from_pict(dst, false, &pi.dx, &pi.dy); - pi.op = op; - pi.color = color; - - pi.bits = (uint32_t *)&pi.sx; - pi.source = pixman_image_create_bits(PIXMAN_a8r8g8b8, - 1, 1, pi.bits, 0); - pixman_image_set_repeat(pi.source, PIXMAN_REPEAT_NORMAL); - - if (dst->pCompositeClip->data) - span = pixmask_span_solid__clipped; - else - span = pixmask_span_solid; - - tor_render(NULL, &tor, (void*)&pi, - dst->pCompositeClip, span, - false); - - pixman_image_unref(pi.source); - pixman_image_unref(pi.image); - } else { - struct pixman_inplace pi; - - pi.image = image_from_pict(dst, false, &pi.dx, &pi.dy); - pi.source = image_from_pict(src, false, &pi.sx, &pi.sy); - pi.sx += src_x - pixman_fixed_to_int(traps[0].left.p1.x); - pi.sy += src_y - pixman_fixed_to_int(traps[0].left.p1.y); - pi.mask = pixman_image_create_bits(PIXMAN_a8, 1, 1, NULL, 0); - pixman_image_set_repeat(pi.mask, PIXMAN_REPEAT_NORMAL); - pi.bits = pixman_image_get_data(pi.mask); - pi.op = op; - - if (dst->pCompositeClip->data) - span = pixmask_span__clipped; - else - span = pixmask_span; - - tor_render(NULL, &tor, (void*)&pi, - dst->pCompositeClip, span, - false); - - pixman_image_unref(pi.mask); - pixman_image_unref(pi.source); - pixman_image_unref(pi.image); - } - - tor_fini(&tor); - } else { - struct inplace_x8r8g8b8_thread threads[num_threads]; - int y, h; - - DBG(("%s: using %d threads for inplace compositing %dx%d\n", - __FUNCTION__, num_threads, - region.extents.x2 - region.extents.x1, - region.extents.y2 - region.extents.y1)); - - threads[0].traps = traps; - threads[0].ntrap = ntrap; - threads[0].extents = region.extents; - threads[0].lerp = lerp; - threads[0].is_solid = is_solid; - threads[0].color = color; - threads[0].dx = dx; - threads[0].dy = dy; - threads[0].dst = dst; - threads[0].src = src; - threads[0].op = op; - threads[0].src_x = src_x; - threads[0].src_y = src_y; - - y = region.extents.y1; - h = region.extents.y2 - region.extents.y1; - h = (h + num_threads - 1) / num_threads; - - for (n = 1; n < num_threads; n++) { - threads[n] = threads[0]; - threads[n].extents.y1 = y; - threads[n].extents.y2 = y += h; - - sna_threads_run(inplace_x8r8g8b8_thread, &threads[n]); - } - - threads[0].extents.y1 = y; - threads[0].extents.y2 = region.extents.y2; - inplace_x8r8g8b8_thread(&threads[0]); - - sna_threads_wait(); - } - - return true; -} - -struct inplace_thread { - xTrapezoid *traps; - RegionPtr clip; - span_func_t span; - struct inplace inplace; - BoxRec extents; - int dx, dy; - int draw_x, draw_y; - bool unbounded; - int ntrap; -}; - -static void inplace_thread(void *arg) -{ - struct inplace_thread *thread = arg; - struct tor tor; - int n; - - if (!tor_init(&tor, &thread->extents, 2*thread->ntrap)) - return; - - for (n = 0; n < thread->ntrap; n++) { - xTrapezoid t; - - if (!project_trapezoid_onto_grid(&thread->traps[n], thread->dx, thread->dy, &t)) - continue; - - if (pixman_fixed_to_int(thread->traps[n].top) >= thread->extents.y2 - thread->draw_y || - pixman_fixed_to_int(thread->traps[n].bottom) < thread->extents.y1 - thread->draw_y) - continue; - - tor_add_edge(&tor, &t, &t.left, 1); - tor_add_edge(&tor, &t, &t.right, -1); - } - - tor_render(NULL, &tor, (void*)&thread->inplace, - thread->clip, thread->span, thread->unbounded); - - tor_fini(&tor); -} - -static bool -trapezoid_span_inplace(struct sna *sna, - CARD8 op, PicturePtr src, PicturePtr dst, - PictFormatPtr maskFormat, INT16 src_x, INT16 src_y, - int ntrap, xTrapezoid *traps, - bool fallback) -{ - struct inplace inplace; - span_func_t span; - PixmapPtr pixmap; - struct sna_pixmap *priv; - RegionRec region; - uint32_t color; - bool unbounded; - int16_t dst_x, dst_y; - int dx, dy; - int num_threads, n; - - if (NO_SCAN_CONVERTER) - return false; - - if (dst->polyMode == PolyModePrecise && !is_mono(dst, maskFormat)) { - DBG(("%s: fallback -- precise rasterisation requested\n", - __FUNCTION__)); - return false; - } - if (dst->alphaMap) { - DBG(("%s: fallback -- dst alphamap\n", - __FUNCTION__)); - return false; - } - - if (!fallback && is_gpu(sna, dst->pDrawable, PREFER_GPU_SPANS)) { - DBG(("%s: fallback -- can not perform operation in place, destination busy\n", - __FUNCTION__)); - - return false; - } - - if (is_mono(dst, maskFormat)) - return trapezoid_span_mono_inplace(sna, op, src, dst, - src_x, src_y, ntrap, traps); - - if (dst->format == PICT_a8r8g8b8 || dst->format == PICT_x8r8g8b8) - return trapezoid_span_inplace__x8r8g8b8(op, dst, - src, src_x, src_y, - maskFormat, - ntrap, traps); - - if (!sna_picture_is_solid(src, &color)) { - DBG(("%s: fallback -- can not perform operation in place, requires solid source\n", - __FUNCTION__)); - return false; - } - - if (dst->format != PICT_a8) { - DBG(("%s: fallback -- can not perform operation in place, format=%x\n", - __FUNCTION__, dst->format)); - return false; - } - - pixmap = get_drawable_pixmap(dst->pDrawable); - - unbounded = false; - priv = sna_pixmap(pixmap); - if (priv) { - switch (op) { - case PictOpAdd: - if (priv->clear && priv->clear_color == 0) { - unbounded = true; - op = PictOpSrc; - } - if ((color >> 24) == 0) - return true; - break; - case PictOpIn: - if (priv->clear && priv->clear_color == 0) - return true; - if (priv->clear && priv->clear_color == 0xff) - op = PictOpSrc; - unbounded = true; - break; - case PictOpSrc: - unbounded = true; - break; - default: - DBG(("%s: fallback -- can not perform op [%d] in place\n", - __FUNCTION__, op)); - return false; - } - } else { - switch (op) { - case PictOpAdd: - if ((color >> 24) == 0) - return true; - break; - case PictOpIn: - case PictOpSrc: - unbounded = true; - break; - default: - DBG(("%s: fallback -- can not perform op [%d] in place\n", - __FUNCTION__, op)); - return false; - } - } - - DBG(("%s: format=%x, op=%d, color=%x\n", - __FUNCTION__, dst->format, op, color)); - - if (maskFormat == NULL && ntrap > 1) { - DBG(("%s: individual rasterisation requested\n", - __FUNCTION__)); - do { - /* XXX unwind errors? */ - if (!trapezoid_span_inplace(sna, op, src, dst, NULL, - src_x, src_y, 1, traps++, - fallback)) - return false; - } while (--ntrap); - return true; - } - - trapezoids_bounds(ntrap, traps, ®ion.extents); - if (region.extents.y1 >= region.extents.y2 || - region.extents.x1 >= region.extents.x2) - return true; - - DBG(("%s: extents (%d, %d), (%d, %d)\n", - __FUNCTION__, - region.extents.x1, region.extents.y1, - region.extents.x2, region.extents.y2)); - - if (!sna_compute_composite_extents(®ion.extents, - NULL, NULL, dst, - 0, 0, - 0, 0, - region.extents.x1, region.extents.y1, - region.extents.x2 - region.extents.x1, - region.extents.y2 - region.extents.y1)) - return true; - - DBG(("%s: clipped extents (%d, %d), (%d, %d)\n", - __FUNCTION__, - region.extents.x1, region.extents.y1, - region.extents.x2, region.extents.y2)); - - if (op == PictOpSrc) { - if (dst->pCompositeClip->data) - span = tor_blt_src_clipped; - else - span = tor_blt_src; - } else if (op == PictOpIn) { - if (dst->pCompositeClip->data) - span = tor_blt_in_clipped; - else - span = tor_blt_in; - } else { - assert(op == PictOpAdd); - if (dst->pCompositeClip->data) - span = tor_blt_add_clipped; - else - span = tor_blt_add; - } - - DBG(("%s: move-to-cpu\n", __FUNCTION__)); - region.data = NULL; - if (!sna_drawable_move_region_to_cpu(dst->pDrawable, ®ion, - op == PictOpSrc ? MOVE_WRITE | MOVE_INPLACE_HINT : MOVE_WRITE | MOVE_READ)) - return true; - - dx = dst->pDrawable->x * FAST_SAMPLES_X; - dy = dst->pDrawable->y * FAST_SAMPLES_Y; - - - inplace.ptr = pixmap->devPrivate.ptr; - if (get_drawable_deltas(dst->pDrawable, pixmap, &dst_x, &dst_y)) - inplace.ptr += dst_y * pixmap->devKind + dst_x; - inplace.stride = pixmap->devKind; - inplace.opacity = color >> 24; - - num_threads = sna_use_threads(region.extents.x2 - region.extents.x1, - region.extents.y2 - region.extents.y1, - 16); - if (num_threads == 1) { - struct tor tor; - - if (!tor_init(&tor, ®ion.extents, 2*ntrap)) - return true; - - for (n = 0; n < ntrap; n++) { - xTrapezoid t; - - if (!project_trapezoid_onto_grid(&traps[n], dx, dy, &t)) - continue; - - if (pixman_fixed_to_int(traps[n].top) >= region.extents.y2 - dst->pDrawable->y || - pixman_fixed_to_int(traps[n].bottom) < region.extents.y1 - dst->pDrawable->y) - continue; - - tor_add_edge(&tor, &t, &t.left, 1); - tor_add_edge(&tor, &t, &t.right, -1); - } - - tor_render(NULL, &tor, (void*)&inplace, - dst->pCompositeClip, span, unbounded); - - tor_fini(&tor); - } else { - struct inplace_thread threads[num_threads]; - int y, h; - - DBG(("%s: using %d threads for inplace compositing %dx%d\n", - __FUNCTION__, num_threads, - region.extents.x2 - region.extents.x1, - region.extents.y2 - region.extents.y1)); - - threads[0].traps = traps; - threads[0].ntrap = ntrap; - threads[0].inplace = inplace; - threads[0].extents = region.extents; - threads[0].clip = dst->pCompositeClip; - threads[0].span = span; - threads[0].unbounded = unbounded; - threads[0].dx = dx; - threads[0].dy = dy; - threads[0].draw_x = dst->pDrawable->x; - threads[0].draw_y = dst->pDrawable->y; - - y = region.extents.y1; - h = region.extents.y2 - region.extents.y1; - h = (h + num_threads - 1) / num_threads; - - for (n = 1; n < num_threads; n++) { - threads[n] = threads[0]; - threads[n].extents.y1 = y; - threads[n].extents.y2 = y += h; - - sna_threads_run(inplace_thread, &threads[n]); - } - - threads[0].extents.y1 = y; - threads[0].extents.y2 = region.extents.y2; - inplace_thread(&threads[0]); - - sna_threads_wait(); - } - - return true; -} - -static bool -trapezoid_span_fallback(CARD8 op, PicturePtr src, PicturePtr dst, - PictFormatPtr maskFormat, INT16 src_x, INT16 src_y, - int ntrap, xTrapezoid *traps) -{ - struct tor tor; - ScreenPtr screen = dst->pDrawable->pScreen; - PixmapPtr scratch; - PicturePtr mask; - BoxRec extents; - int16_t dst_x, dst_y; - int dx, dy; - int error, n; - - if (NO_SCAN_CONVERTER) - return false; - - if (dst->polyMode == PolyModePrecise && !is_mono(dst, maskFormat)) { - DBG(("%s: fallback -- precise rasterisation requested\n", - __FUNCTION__)); - return false; - } - - if (maskFormat == NULL && ntrap > 1) { - DBG(("%s: individual rasterisation requested\n", - __FUNCTION__)); - do { - /* XXX unwind errors? */ - if (!trapezoid_span_fallback(op, src, dst, NULL, - src_x, src_y, 1, traps++)) - return false; - } while (--ntrap); - return true; - } - - trapezoids_bounds(ntrap, traps, &extents); - if (extents.y1 >= extents.y2 || extents.x1 >= extents.x2) - return true; - - DBG(("%s: ntraps=%d, extents (%d, %d), (%d, %d)\n", - __FUNCTION__, ntrap, extents.x1, extents.y1, extents.x2, extents.y2)); - - if (!sna_compute_composite_extents(&extents, - src, NULL, dst, - src_x, src_y, - 0, 0, - extents.x1, extents.y1, - extents.x2 - extents.x1, - extents.y2 - extents.y1)) - return true; - - DBG(("%s: extents (%d, %d), (%d, %d)\n", - __FUNCTION__, extents.x1, extents.y1, extents.x2, extents.y2)); - - extents.y2 -= extents.y1; - extents.x2 -= extents.x1; - extents.x1 -= dst->pDrawable->x; - extents.y1 -= dst->pDrawable->y; - dst_x = extents.x1; - dst_y = extents.y1; - dx = -extents.x1 * FAST_SAMPLES_X; - dy = -extents.y1 * FAST_SAMPLES_Y; - extents.x1 = extents.y1 = 0; - - DBG(("%s: mask (%dx%d), dx=(%d, %d)\n", - __FUNCTION__, extents.x2, extents.y2, dx, dy)); - scratch = sna_pixmap_create_unattached(screen, - extents.x2, extents.y2, 8); - if (!scratch) - return true; - - DBG(("%s: created buffer %p, stride %d\n", - __FUNCTION__, scratch->devPrivate.ptr, scratch->devKind)); - - if (!tor_init(&tor, &extents, 2*ntrap)) { - sna_pixmap_destroy(scratch); - return true; - } - - for (n = 0; n < ntrap; n++) { - xTrapezoid t; - - if (!project_trapezoid_onto_grid(&traps[n], dx, dy, &t)) - continue; - - if (pixman_fixed_to_int(traps[n].top) - dst_y >= extents.y2 || - pixman_fixed_to_int(traps[n].bottom) - dst_y < 0) - continue; - - tor_add_edge(&tor, &t, &t.left, 1); - tor_add_edge(&tor, &t, &t.right, -1); - } - - if (extents.x2 <= TOR_INPLACE_SIZE) { - tor_inplace(&tor, scratch, is_mono(dst, maskFormat), NULL); - } else { - tor_render(NULL, &tor, - scratch->devPrivate.ptr, - (void *)(intptr_t)scratch->devKind, - is_mono(dst, maskFormat) ? tor_blt_mask_mono : tor_blt_mask, - true); - } - tor_fini(&tor); - - mask = CreatePicture(0, &scratch->drawable, - PictureMatchFormat(screen, 8, PICT_a8), - 0, 0, serverClient, &error); - if (mask) { - RegionRec region; - - region.extents.x1 = dst_x + dst->pDrawable->x; - region.extents.y1 = dst_y + dst->pDrawable->y; - region.extents.x2 = region.extents.x1 + extents.x2; - region.extents.y2 = region.extents.y1 + extents.y2; - region.data = NULL; - - DBG(("%s: fbComposite()\n", __FUNCTION__)); - sna_composite_fb(op, src, mask, dst, ®ion, - src_x + dst_x - pixman_fixed_to_int(traps[0].left.p1.x), - src_y + dst_y - pixman_fixed_to_int(traps[0].left.p1.y), - 0, 0, - dst_x, dst_y, - extents.x2, extents.y2); - - FreePicture(mask, 0); - } - sna_pixmap_destroy(scratch); - - return true; -} - void sna_composite_trapezoids(CARD8 op, PicturePtr src, @@ -6530,185 +697,6 @@ fallback: ntrap, traps); } -static inline bool -project_trap_onto_grid(const xTrap *in, - int dx, int dy, - xTrap *out) -{ - out->top.l = dx + pixman_fixed_to_grid(in->top.l); - out->top.r = dx + pixman_fixed_to_grid(in->top.r); - out->top.y = dy + pixman_fixed_to_grid(in->top.y); - - out->bot.l = dx + pixman_fixed_to_grid(in->bot.l); - out->bot.r = dx + pixman_fixed_to_grid(in->bot.r); - out->bot.y = dy + pixman_fixed_to_grid(in->bot.y); - - return out->bot.y > out->top.y; -} - -static bool -mono_trap_span_converter(struct sna *sna, - PicturePtr dst, - INT16 x, INT16 y, - int ntrap, xTrap *traps) -{ - struct mono mono; - xRenderColor white; - PicturePtr src; - int error; - int n; - - white.red = white.green = white.blue = white.alpha = 0xffff; - src = CreateSolidPicture(0, &white, &error); - if (src == NULL) - return true; - - mono.clip = *dst->pCompositeClip; - x += dst->pDrawable->x; - y += dst->pDrawable->y; - - DBG(("%s: after clip -- extents (%d, %d), (%d, %d), delta=(%d, %d)\n", - __FUNCTION__, - mono.clip.extents.x1, mono.clip.extents.y1, - mono.clip.extents.x2, mono.clip.extents.y2, - x, y)); - - mono.sna = sna; - if (!mono_init(&mono, 2*ntrap)) - return false; - - for (n = 0; n < ntrap; n++) { - xPointFixed p1, p2; - - if (pixman_fixed_to_int(traps[n].top.y) + y >= mono.clip.extents.y2 || - pixman_fixed_to_int(traps[n].bot.y) + y < mono.clip.extents.y1) - continue; - - p1.y = traps[n].top.y; - p2.y = traps[n].bot.y; - - p1.x = traps[n].top.l; - p2.x = traps[n].bot.l; - mono_add_line(&mono, x, y, - traps[n].top.y, traps[n].bot.y, - &p1, &p2, 1); - - p1.x = traps[n].top.r; - p2.x = traps[n].bot.r; - mono_add_line(&mono, x, y, - traps[n].top.y, traps[n].bot.y, - &p1, &p2, -1); - } - - memset(&mono.op, 0, sizeof(mono.op)); - if (mono.sna->render.composite(mono.sna, PictOpAdd, src, NULL, dst, - 0, 0, - 0, 0, - mono.clip.extents.x1, mono.clip.extents.y1, - mono.clip.extents.x2 - mono.clip.extents.x1, - mono.clip.extents.y2 - mono.clip.extents.y1, - &mono.op)) { - mono_render(&mono); - mono.op.done(mono.sna, &mono.op); - } - - mono_fini(&mono); - FreePicture(src, 0); - return true; -} - -static bool -trap_span_converter(struct sna *sna, - PicturePtr dst, - INT16 src_x, INT16 src_y, - int ntrap, xTrap *trap) -{ - struct sna_composite_spans_op tmp; - struct tor tor; - BoxRec extents; - pixman_region16_t *clip; - int dx, dy, n; - - if (NO_SCAN_CONVERTER) - return false; - - if (dst->pDrawable->depth < 8) - return false; - - if (dst->polyEdge == PolyEdgeSharp) - return mono_trap_span_converter(sna, dst, src_x, src_y, ntrap, trap); - - if (!sna->render.check_composite_spans(sna, PictOpAdd, sna->render.white_picture, dst, - dst->pCompositeClip->extents.x2 - dst->pCompositeClip->extents.x1, - dst->pCompositeClip->extents.y2 - dst->pCompositeClip->extents.y1, - 0)) { - DBG(("%s: fallback -- composite spans not supported\n", - __FUNCTION__)); - return false; - } - - clip = dst->pCompositeClip; - extents = *RegionExtents(clip); - dx = dst->pDrawable->x; - dy = dst->pDrawable->y; - - DBG(("%s: after clip -- extents (%d, %d), (%d, %d), delta=(%d, %d)\n", - __FUNCTION__, - extents.x1, extents.y1, - extents.x2, extents.y2, - dx, dy)); - - memset(&tmp, 0, sizeof(tmp)); - if (!sna->render.composite_spans(sna, PictOpAdd, sna->render.white_picture, dst, - 0, 0, - extents.x1, extents.y1, - extents.x2 - extents.x1, - extents.y2 - extents.y1, - 0, - &tmp)) { - DBG(("%s: fallback -- composite spans render op not supported\n", - __FUNCTION__)); - return false; - } - - dx *= FAST_SAMPLES_X; - dy *= FAST_SAMPLES_Y; - if (!tor_init(&tor, &extents, 2*ntrap)) - goto skip; - - for (n = 0; n < ntrap; n++) { - xTrap t; - xPointFixed p1, p2; - - if (!project_trap_onto_grid(&trap[n], dx, dy, &t)) - continue; - - if (pixman_fixed_to_int(trap[n].top.y) + dst->pDrawable->y >= extents.y2 || - pixman_fixed_to_int(trap[n].bot.y) + dst->pDrawable->y < extents.y1) - continue; - - p1.y = t.top.y; - p2.y = t.bot.y; - p1.x = t.top.l; - p2.x = t.bot.l; - polygon_add_line(tor.polygon, &p1, &p2); - - p1.y = t.bot.y; - p2.y = t.top.y; - p1.x = t.top.r; - p2.x = t.bot.r; - polygon_add_line(tor.polygon, &p1, &p2); - } - - tor_render(sna, &tor, &tmp, clip, - choose_span(&tmp, dst, NULL, clip), false); - - tor_fini(&tor); -skip: - tmp.done(sna, &tmp); - return true; -} - static void mark_damaged(PixmapPtr pixmap, struct sna_pixmap *priv, BoxPtr box, int16_t x, int16_t y) { @@ -6729,124 +717,6 @@ static void mark_damaged(PixmapPtr pixmap, struct sna_pixmap *priv, } static bool -trap_mask_converter(struct sna *sna, - PicturePtr picture, - INT16 x, INT16 y, - int ntrap, xTrap *trap) -{ - struct tor tor; - ScreenPtr screen = picture->pDrawable->pScreen; - PixmapPtr scratch, pixmap; - struct sna_pixmap *priv; - BoxRec extents; - span_func_t span; - int dx, dy, n; - - if (NO_SCAN_CONVERTER) - return false; - - pixmap = get_drawable_pixmap(picture->pDrawable); - priv = sna_pixmap_move_to_gpu(pixmap, MOVE_READ | MOVE_WRITE); - if (priv == NULL) - return false; - - /* XXX strict adherence to the Render specification */ - if (picture->polyMode == PolyModePrecise && - picture->polyEdge != PolyEdgeSharp) { - DBG(("%s: fallback -- precise rasterisation requested\n", - __FUNCTION__)); - return false; - } - - extents = *RegionExtents(picture->pCompositeClip); - for (n = 0; n < ntrap; n++) { - int v; - - v = x + pixman_fixed_integer_floor (MIN(trap[n].top.l, trap[n].bot.l)); - if (v < extents.x1) - extents.x1 = v; - - v = x + pixman_fixed_integer_ceil (MAX(trap[n].top.r, trap[n].bot.r)); - if (v > extents.x2) - extents.x2 = v; - - v = y + pixman_fixed_integer_floor (trap[n].top.y); - if (v < extents.y1) - extents.y1 = v; - - v = y + pixman_fixed_integer_ceil (trap[n].bot.y); - if (v > extents.y2) - extents.y2 = v; - } - - DBG(("%s: extents (%d, %d), (%d, %d)\n", - __FUNCTION__, extents.x1, extents.y1, extents.x2, extents.y2)); - - scratch = sna_pixmap_create_upload(screen, - extents.x2-extents.x1, - extents.y2-extents.y1, - 8, KGEM_BUFFER_WRITE_INPLACE); - if (!scratch) - return true; - - dx = picture->pDrawable->x; - dy = picture->pDrawable->y; - dx *= FAST_SAMPLES_X; - dy *= FAST_SAMPLES_Y; - if (!tor_init(&tor, &extents, 2*ntrap)) { - sna_pixmap_destroy(scratch); - return true; - } - - for (n = 0; n < ntrap; n++) { - xTrap t; - xPointFixed p1, p2; - - if (!project_trap_onto_grid(&trap[n], dx, dy, &t)) - continue; - - if (pixman_fixed_to_int(trap[n].top.y) + picture->pDrawable->y >= extents.y2 || - pixman_fixed_to_int(trap[n].bot.y) + picture->pDrawable->y < extents.y1) - continue; - - p1.y = t.top.y; - p2.y = t.bot.y; - p1.x = t.top.l; - p2.x = t.bot.l; - polygon_add_line(tor.polygon, &p1, &p2); - - p1.y = t.bot.y; - p2.y = t.top.y; - p1.x = t.top.r; - p2.x = t.bot.r; - polygon_add_line(tor.polygon, &p1, &p2); - } - - if (picture->polyEdge == PolyEdgeSharp) - span = tor_blt_mask_mono; - else - span = tor_blt_mask; - - tor_render(NULL, &tor, - scratch->devPrivate.ptr, - (void *)(intptr_t)scratch->devKind, - span, true); - - tor_fini(&tor); - - /* XXX clip boxes */ - get_drawable_deltas(picture->pDrawable, pixmap, &x, &y); - sna = to_sna_from_screen(screen); - sna->render.copy_boxes(sna, GXcopy, - scratch, __sna_pixmap_get_bo(scratch), -extents.x1, -extents.x1, - pixmap, priv->gpu_bo, x, y, - &extents, 1, 0); - mark_damaged(pixmap, priv, &extents ,x, y); - sna_pixmap_destroy(scratch); - return true; -} - -static bool trap_upload(PicturePtr picture, INT16 x, INT16 y, int ntrap, xTrap *trap) @@ -6963,435 +833,7 @@ sna_add_traps(PicturePtr picture, INT16 x, INT16 y, int n, xTrap *t) } } -static inline void -project_point_onto_grid(const xPointFixed *in, - int dx, int dy, - xPointFixed *out) -{ - out->x = dx + pixman_fixed_to_grid(in->x); - out->y = dy + pixman_fixed_to_grid(in->y); -} - #if HAS_PIXMAN_TRIANGLES -static inline bool -xTriangleValid(const xTriangle *t) -{ - xPointFixed v1, v2; - - v1.x = t->p2.x - t->p1.x; - v1.y = t->p2.y - t->p1.y; - - v2.x = t->p3.x - t->p1.x; - v2.y = t->p3.y - t->p1.y; - - /* if the length of any edge is zero, the area must be zero */ - if (v1.x == 0 && v1.y == 0) - return false; - if (v2.x == 0 && v2.y == 0) - return false; - - /* if the cross-product is zero, so it the size */ - return v2.y * v1.x != v1.y * v2.x; -} - -static inline bool -project_triangle_onto_grid(const xTriangle *in, - int dx, int dy, - xTriangle *out) -{ - project_point_onto_grid(&in->p1, dx, dy, &out->p1); - project_point_onto_grid(&in->p2, dx, dy, &out->p2); - project_point_onto_grid(&in->p3, dx, dy, &out->p3); - - return xTriangleValid(out); -} - -static bool -mono_triangles_span_converter(struct sna *sna, - CARD8 op, PicturePtr src, PicturePtr dst, - INT16 src_x, INT16 src_y, - int count, xTriangle *tri) -{ - struct mono mono; - BoxRec extents; - int16_t dst_x, dst_y; - int16_t dx, dy; - bool was_clear; - int n; - - mono.sna = sna; - - dst_x = pixman_fixed_to_int(tri[0].p1.x); - dst_y = pixman_fixed_to_int(tri[0].p1.y); - - miTriangleBounds(count, tri, &extents); - DBG(("%s: extents (%d, %d), (%d, %d)\n", - __FUNCTION__, extents.x1, extents.y1, extents.x2, extents.y2)); - - if (extents.y1 >= extents.y2 || extents.x1 >= extents.x2) - return true; - - if (!sna_compute_composite_region(&mono.clip, - src, NULL, dst, - src_x + extents.x1 - dst_x, - src_y + extents.y1 - dst_y, - 0, 0, - extents.x1, extents.y1, - extents.x2 - extents.x1, - extents.y2 - extents.y1)) { - DBG(("%s: triangles do not intersect drawable clips\n", - __FUNCTION__)) ; - return true; - } - - dx = dst->pDrawable->x; - dy = dst->pDrawable->y; - - DBG(("%s: after clip -- extents (%d, %d), (%d, %d), delta=(%d, %d) src -> (%d, %d)\n", - __FUNCTION__, - mono.clip.extents.x1, mono.clip.extents.y1, - mono.clip.extents.x2, mono.clip.extents.y2, - dx, dy, - src_x + mono.clip.extents.x1 - dst_x - dx, - src_y + mono.clip.extents.y1 - dst_y - dy)); - - was_clear = sna_drawable_is_clear(dst->pDrawable); - - if (mono_init(&mono, 3*count)) - return false; - - for (n = 0; n < count; n++) { - mono_add_line(&mono, dx, dy, - tri[n].p1.y, tri[n].p2.y, - &tri[n].p1, &tri[n].p2, 1); - mono_add_line(&mono, dx, dy, - tri[n].p2.y, tri[n].p3.y, - &tri[n].p2, &tri[n].p3, 1); - mono_add_line(&mono, dx, dy, - tri[n].p3.y, tri[n].p1.y, - &tri[n].p3, &tri[n].p1, 1); - } - - memset(&mono.op, 0, sizeof(mono.op)); - if (mono.sna->render.composite(mono.sna, op, src, NULL, dst, - src_x + mono.clip.extents.x1 - dst_x - dx, - src_y + mono.clip.extents.y1 - dst_y - dy, - 0, 0, - mono.clip.extents.x1, mono.clip.extents.y1, - mono.clip.extents.x2 - mono.clip.extents.x1, - mono.clip.extents.y2 - mono.clip.extents.y1, - &mono.op)) { - if (mono.clip.data == NULL && mono.op.damage == NULL) - mono.span = mono_span__fast; - else - mono.span = mono_span; - mono_render(&mono); - mono.op.done(mono.sna, &mono.op); - } - - if (!was_clear && !operator_is_bounded(op)) { - xPointFixed p1, p2; - - if (!mono_init(&mono, 2+3*count)) - return false; - - p1.y = mono.clip.extents.y1 * pixman_fixed_1; - p2.y = mono.clip.extents.y2 * pixman_fixed_1; - - p1.x = mono.clip.extents.x1 * pixman_fixed_1; - p2.x = mono.clip.extents.x1 * pixman_fixed_1; - mono_add_line(&mono, 0, 0, p1.y, p2.y, &p1, &p2, -1); - - p1.x = mono.clip.extents.x2 * pixman_fixed_1; - p2.x = mono.clip.extents.x2 * pixman_fixed_1; - mono_add_line(&mono, 0, 0, p1.y, p2.y, &p1, &p2, 1); - - for (n = 0; n < count; n++) { - mono_add_line(&mono, dx, dy, - tri[n].p1.y, tri[n].p2.y, - &tri[n].p1, &tri[n].p2, 1); - mono_add_line(&mono, dx, dy, - tri[n].p2.y, tri[n].p3.y, - &tri[n].p2, &tri[n].p3, 1); - mono_add_line(&mono, dx, dy, - tri[n].p3.y, tri[n].p1.y, - &tri[n].p3, &tri[n].p1, 1); - } - - memset(&mono.op, 0, sizeof(mono.op)); - if (mono.sna->render.composite(mono.sna, - PictOpClear, - mono.sna->clear, NULL, dst, - 0, 0, - 0, 0, - mono.clip.extents.x1, mono.clip.extents.y1, - mono.clip.extents.x2 - mono.clip.extents.x1, - mono.clip.extents.y2 - mono.clip.extents.y1, - &mono.op)) { - if (mono.clip.data == NULL && mono.op.damage == NULL) - mono.span = mono_span__fast; - else - mono.span = mono_span; - mono_render(&mono); - mono.op.done(mono.sna, &mono.op); - } - mono_fini(&mono); - } - - mono_fini(&mono); - REGION_UNINIT(NULL, &mono.clip); - return true; -} - -static bool -triangles_span_converter(struct sna *sna, - CARD8 op, PicturePtr src, PicturePtr dst, - PictFormatPtr maskFormat, INT16 src_x, INT16 src_y, - int count, xTriangle *tri) -{ - struct sna_composite_spans_op tmp; - struct tor tor; - BoxRec extents; - pixman_region16_t clip; - int16_t dst_x, dst_y; - int dx, dy, n; - bool was_clear; - - if (NO_SCAN_CONVERTER) - return false; - - if (is_mono(dst, maskFormat)) - return mono_triangles_span_converter(sna, op, src, dst, - src_x, src_y, - count, tri); - - /* XXX strict adherence to the Render specification */ - if (dst->polyMode == PolyModePrecise) { - DBG(("%s: fallback -- precise rasterisation requested\n", - __FUNCTION__)); - return false; - } - - if (!sna->render.check_composite_spans(sna, op, src, dst, 0, 0, 0)) { - DBG(("%s: fallback -- composite spans not supported\n", - __FUNCTION__)); - return false; - } - - dst_x = pixman_fixed_to_int(tri[0].p1.x); - dst_y = pixman_fixed_to_int(tri[0].p1.y); - - miTriangleBounds(count, tri, &extents); - DBG(("%s: extents (%d, %d), (%d, %d)\n", - __FUNCTION__, extents.x1, extents.y1, extents.x2, extents.y2)); - - if (extents.y1 >= extents.y2 || extents.x1 >= extents.x2) - return true; - -#if 0 - if (extents.y2 - extents.y1 < 64 && extents.x2 - extents.x1 < 64) { - DBG(("%s: fallback -- traps extents too small %dx%d\n", - __FUNCTION__, extents.y2 - extents.y1, extents.x2 - extents.x1)); - return false; - } -#endif - - if (!sna_compute_composite_region(&clip, - src, NULL, dst, - src_x + extents.x1 - dst_x, - src_y + extents.y1 - dst_y, - 0, 0, - extents.x1, extents.y1, - extents.x2 - extents.x1, - extents.y2 - extents.y1)) { - DBG(("%s: triangles do not intersect drawable clips\n", - __FUNCTION__)) ; - return true; - } - - if (!sna->render.check_composite_spans(sna, op, src, dst, - clip.extents.x2 - clip.extents.x1, - clip.extents.y2 - clip.extents.y1, - 0)) { - DBG(("%s: fallback -- composite spans not supported\n", - __FUNCTION__)); - return false; - } - - extents = *RegionExtents(&clip); - dx = dst->pDrawable->x; - dy = dst->pDrawable->y; - - DBG(("%s: after clip -- extents (%d, %d), (%d, %d), delta=(%d, %d) src -> (%d, %d)\n", - __FUNCTION__, - extents.x1, extents.y1, - extents.x2, extents.y2, - dx, dy, - src_x + extents.x1 - dst_x - dx, - src_y + extents.y1 - dst_y - dy)); - - was_clear = sna_drawable_is_clear(dst->pDrawable); - - memset(&tmp, 0, sizeof(tmp)); - if (!sna->render.composite_spans(sna, op, src, dst, - src_x + extents.x1 - dst_x - dx, - src_y + extents.y1 - dst_y - dy, - extents.x1, extents.y1, - extents.x2 - extents.x1, - extents.y2 - extents.y1, - 0, - &tmp)) { - DBG(("%s: fallback -- composite spans render op not supported\n", - __FUNCTION__)); - return false; - } - - dx *= FAST_SAMPLES_X; - dy *= FAST_SAMPLES_Y; - if (!tor_init(&tor, &extents, 3*count)) - goto skip; - - for (n = 0; n < count; n++) { - xTriangle t; - - if (!project_triangle_onto_grid(&tri[n], dx, dy, &t)) - continue; - - polygon_add_line(tor.polygon, &t.p1, &t.p2); - polygon_add_line(tor.polygon, &t.p2, &t.p3); - polygon_add_line(tor.polygon, &t.p3, &t.p1); - } - - tor_render(sna, &tor, &tmp, &clip, - choose_span(&tmp, dst, maskFormat, &clip), - !was_clear && maskFormat && !operator_is_bounded(op)); - - tor_fini(&tor); -skip: - tmp.done(sna, &tmp); - - REGION_UNINIT(NULL, &clip); - return true; -} - -static bool -triangles_mask_converter(CARD8 op, PicturePtr src, PicturePtr dst, - PictFormatPtr maskFormat, INT16 src_x, INT16 src_y, - int count, xTriangle *tri) -{ - struct tor tor; - void (*span)(struct sna *sna, - struct sna_composite_spans_op *op, - pixman_region16_t *clip, - const BoxRec *box, - int coverage); - ScreenPtr screen = dst->pDrawable->pScreen; - PixmapPtr scratch; - PicturePtr mask; - BoxRec extents; - int16_t dst_x, dst_y; - int dx, dy; - int error, n; - - if (NO_SCAN_CONVERTER) - return false; - - if (dst->polyMode == PolyModePrecise && !is_mono(dst, maskFormat)) { - DBG(("%s: fallback -- precise rasterisation requested\n", - __FUNCTION__)); - return false; - } - - if (maskFormat == NULL && count > 1) { - DBG(("%s: fallback -- individual rasterisation requested\n", - __FUNCTION__)); - return false; - } - - miTriangleBounds(count, tri, &extents); - DBG(("%s: extents (%d, %d), (%d, %d)\n", - __FUNCTION__, extents.x1, extents.y1, extents.x2, extents.y2)); - - if (extents.y1 >= extents.y2 || extents.x1 >= extents.x2) - return true; - - if (!sna_compute_composite_extents(&extents, - src, NULL, dst, - src_x, src_y, - 0, 0, - extents.x1, extents.y1, - extents.x2 - extents.x1, - extents.y2 - extents.y1)) - return true; - - DBG(("%s: extents (%d, %d), (%d, %d)\n", - __FUNCTION__, extents.x1, extents.y1, extents.x2, extents.y2)); - - extents.y2 -= extents.y1; - extents.x2 -= extents.x1; - extents.x1 -= dst->pDrawable->x; - extents.y1 -= dst->pDrawable->y; - dst_x = extents.x1; - dst_y = extents.y1; - dx = -extents.x1 * FAST_SAMPLES_X; - dy = -extents.y1 * FAST_SAMPLES_Y; - extents.x1 = extents.y1 = 0; - - DBG(("%s: mask (%dx%d)\n", - __FUNCTION__, extents.x2, extents.y2)); - scratch = sna_pixmap_create_upload(screen, - extents.x2, extents.y2, 8, - KGEM_BUFFER_WRITE_INPLACE); - if (!scratch) - return true; - - DBG(("%s: created buffer %p, stride %d\n", - __FUNCTION__, scratch->devPrivate.ptr, scratch->devKind)); - - if (!tor_init(&tor, &extents, 3*count)) { - sna_pixmap_destroy(scratch); - return true; - } - - for (n = 0; n < count; n++) { - xTriangle t; - - if (!project_triangle_onto_grid(&tri[n], dx, dy, &t)) - continue; - - polygon_add_line(tor.polygon, &t.p1, &t.p2); - polygon_add_line(tor.polygon, &t.p2, &t.p3); - polygon_add_line(tor.polygon, &t.p3, &t.p1); - } - - if (maskFormat ? maskFormat->depth < 8 : dst->polyEdge == PolyEdgeSharp) - span = tor_blt_mask_mono; - else - span = tor_blt_mask; - - tor_render(NULL, &tor, - scratch->devPrivate.ptr, - (void *)(intptr_t)scratch->devKind, - span, true); - - mask = CreatePicture(0, &scratch->drawable, - PictureMatchFormat(screen, 8, PICT_a8), - 0, 0, serverClient, &error); - if (mask) { - CompositePicture(op, src, mask, dst, - src_x + dst_x - pixman_fixed_to_int(tri[0].p1.x), - src_y + dst_y - pixman_fixed_to_int(tri[0].p1.y), - 0, 0, - dst_x, dst_y, - extents.x2, extents.y2); - FreePicture(mask, 0); - } - tor_fini(&tor); - sna_pixmap_destroy(scratch); - - return true; -} - static void triangles_fallback(CARD8 op, PicturePtr src, @@ -7511,144 +953,6 @@ sna_composite_triangles(CARD8 op, triangles_fallback(op, src, dst, maskFormat, xSrc, ySrc, n, tri); } -static bool -tristrip_span_converter(struct sna *sna, - CARD8 op, PicturePtr src, PicturePtr dst, - PictFormatPtr maskFormat, INT16 src_x, INT16 src_y, - int count, xPointFixed *points) -{ - struct sna_composite_spans_op tmp; - struct tor tor; - BoxRec extents; - pixman_region16_t clip; - xPointFixed p[4]; - int16_t dst_x, dst_y; - int dx, dy; - int cw, ccw, n; - bool was_clear; - - if (NO_SCAN_CONVERTER) - return false; - - /* XXX strict adherence to the Render specification */ - if (dst->polyMode == PolyModePrecise && !is_mono(dst, maskFormat)) { - DBG(("%s: fallback -- precise rasterisation requested\n", - __FUNCTION__)); - return false; - } - - if (!sna->render.check_composite_spans(sna, op, src, dst, 0, 0, 0)) { - DBG(("%s: fallback -- composite spans not supported\n", - __FUNCTION__)); - return false; - } - - dst_x = pixman_fixed_to_int(points[0].x); - dst_y = pixman_fixed_to_int(points[0].y); - - miPointFixedBounds(count, points, &extents); - DBG(("%s: extents (%d, %d), (%d, %d)\n", - __FUNCTION__, extents.x1, extents.y1, extents.x2, extents.y2)); - - if (extents.y1 >= extents.y2 || extents.x1 >= extents.x2) - return true; - -#if 0 - if (extents.y2 - extents.y1 < 64 && extents.x2 - extents.x1 < 64) { - DBG(("%s: fallback -- traps extents too small %dx%d\n", - __FUNCTION__, extents.y2 - extents.y1, extents.x2 - extents.x1)); - return false; - } -#endif - - if (!sna_compute_composite_region(&clip, - src, NULL, dst, - src_x + extents.x1 - dst_x, - src_y + extents.y1 - dst_y, - 0, 0, - extents.x1, extents.y1, - extents.x2 - extents.x1, - extents.y2 - extents.y1)) { - DBG(("%s: triangles do not intersect drawable clips\n", - __FUNCTION__)) ; - return true; - } - - if (!sna->render.check_composite_spans(sna, op, src, dst, - clip.extents.x2 - clip.extents.x1, - clip.extents.y2 - clip.extents.y1, - 0)) { - DBG(("%s: fallback -- composite spans not supported\n", - __FUNCTION__)); - return false; - } - - extents = *RegionExtents(&clip); - dx = dst->pDrawable->x; - dy = dst->pDrawable->y; - - DBG(("%s: after clip -- extents (%d, %d), (%d, %d), delta=(%d, %d) src -> (%d, %d)\n", - __FUNCTION__, - extents.x1, extents.y1, - extents.x2, extents.y2, - dx, dy, - src_x + extents.x1 - dst_x - dx, - src_y + extents.y1 - dst_y - dy)); - - was_clear = sna_drawable_is_clear(dst->pDrawable); - - memset(&tmp, 0, sizeof(tmp)); - if (!sna->render.composite_spans(sna, op, src, dst, - src_x + extents.x1 - dst_x - dx, - src_y + extents.y1 - dst_y - dy, - extents.x1, extents.y1, - extents.x2 - extents.x1, - extents.y2 - extents.y1, - 0, - &tmp)) { - DBG(("%s: fallback -- composite spans render op not supported\n", - __FUNCTION__)); - return false; - } - - dx *= FAST_SAMPLES_X; - dy *= FAST_SAMPLES_Y; - if (!tor_init(&tor, &extents, 2*count)) - goto skip; - - cw = ccw = 0; - project_point_onto_grid(&points[0], dx, dy, &p[cw]); - project_point_onto_grid(&points[1], dx, dy, &p[2+ccw]); - polygon_add_line(tor.polygon, &p[cw], &p[2+ccw]); - n = 2; - do { - cw = !cw; - project_point_onto_grid(&points[n], dx, dy, &p[cw]); - polygon_add_line(tor.polygon, &p[!cw], &p[cw]); - if (++n == count) - break; - - ccw = !ccw; - project_point_onto_grid(&points[n], dx, dy, &p[2+ccw]); - polygon_add_line(tor.polygon, &p[2+ccw], &p[2+!ccw]); - if (++n == count) - break; - } while (1); - polygon_add_line(tor.polygon, &p[2+ccw], &p[cw]); - assert(tor.polygon->num_edges <= 2*count); - - tor_render(sna, &tor, &tmp, &clip, - choose_span(&tmp, dst, maskFormat, &clip), - !was_clear && maskFormat && !operator_is_bounded(op)); - - tor_fini(&tor); -skip: - tmp.done(sna, &tmp); - - REGION_UNINIT(NULL, &clip); - return true; -} - static void tristrip_fallback(CARD8 op, PicturePtr src, diff --git a/src/sna/sna_trapezoids.h b/src/sna/sna_trapezoids.h new file mode 100644 index 00000000..78a06116 --- /dev/null +++ b/src/sna/sna_trapezoids.h @@ -0,0 +1,225 @@ +#include <stdbool.h> + +#ifndef SNA_TRAPEZOIDS_H +#define SNA_TRAPEZOIDS_H + +#define NO_ACCEL 0 +#define FORCE_FALLBACK 0 +#define NO_ALIGNED_BOXES 0 +#define NO_UNALIGNED_BOXES 0 +#define NO_SCAN_CONVERTER 0 +#define NO_GPU_THREADS 0 + +bool +composite_aligned_boxes(struct sna *sna, + CARD8 op, + PicturePtr src, + PicturePtr dst, + PictFormatPtr maskFormat, + INT16 src_x, INT16 src_y, + int ntrap, const xTrapezoid *traps, + bool force_fallback); + +bool +composite_unaligned_boxes(struct sna *sna, + CARD8 op, + PicturePtr src, + PicturePtr dst, + PictFormatPtr maskFormat, + INT16 src_x, INT16 src_y, + int ntrap, const xTrapezoid *traps, + bool force_fallback); + +bool +mono_trapezoids_span_converter(struct sna *sna, + CARD8 op, PicturePtr src, PicturePtr dst, + INT16 src_x, INT16 src_y, + int ntrap, xTrapezoid *traps); + +bool +mono_trapezoid_span_inplace(struct sna *sna, + CARD8 op, + PicturePtr src, + PicturePtr dst, + INT16 src_x, INT16 src_y, + int ntrap, xTrapezoid *traps); + +bool +mono_trap_span_converter(struct sna *sna, + PicturePtr dst, + INT16 x, INT16 y, + int ntrap, xTrap *traps); + +bool +mono_triangles_span_converter(struct sna *sna, + CARD8 op, PicturePtr src, PicturePtr dst, + INT16 src_x, INT16 src_y, + int count, xTriangle *tri); + +bool +trapezoid_span_inplace(struct sna *sna, + CARD8 op, PicturePtr src, PicturePtr dst, + PictFormatPtr maskFormat, INT16 src_x, INT16 src_y, + int ntrap, xTrapezoid *traps, + bool fallback); + +bool +trapezoid_span_converter(struct sna *sna, + CARD8 op, PicturePtr src, PicturePtr dst, + PictFormatPtr maskFormat, unsigned int flags, + INT16 src_x, INT16 src_y, + int ntrap, xTrapezoid *traps); + +bool +trapezoid_mask_converter(CARD8 op, PicturePtr src, PicturePtr dst, + PictFormatPtr maskFormat, INT16 src_x, INT16 src_y, + int ntrap, xTrapezoid *traps); + +bool +trapezoid_span_fallback(CARD8 op, PicturePtr src, PicturePtr dst, + PictFormatPtr maskFormat, INT16 src_x, INT16 src_y, + int ntrap, xTrapezoid *traps); + +bool +trap_span_converter(struct sna *sna, + PicturePtr dst, + INT16 src_x, INT16 src_y, + int ntrap, xTrap *trap); + +bool +trap_mask_converter(struct sna *sna, + PicturePtr picture, + INT16 x, INT16 y, + int ntrap, xTrap *trap); + +bool +triangles_span_converter(struct sna *sna, + CARD8 op, PicturePtr src, PicturePtr dst, + PictFormatPtr maskFormat, INT16 src_x, INT16 src_y, + int count, xTriangle *tri); + +bool +triangles_mask_converter(CARD8 op, PicturePtr src, PicturePtr dst, + PictFormatPtr maskFormat, INT16 src_x, INT16 src_y, + int count, xTriangle *tri); + +bool +tristrip_span_converter(struct sna *sna, + CARD8 op, PicturePtr src, PicturePtr dst, + PictFormatPtr maskFormat, INT16 src_x, INT16 src_y, + int count, xPointFixed *points); + +inline static void trapezoid_origin(const xLineFixed *l, int16_t *x, int16_t *y) +{ + if (l->p1.y < l->p2.y) { + *x = pixman_fixed_to_int(l->p1.x); + *y = pixman_fixed_to_int(l->p1.y); + } else { + *x = pixman_fixed_to_int(l->p2.x); + *y = pixman_fixed_to_int(l->p2.y); + } +} + +#define ONE_HALF 0x7f +#define RB_MASK 0x00ff00ff +#define RB_ONE_HALF 0x007f007f +#define RB_MASK_PLUS_ONE 0x01000100 +#define G_SHIFT 8 + +static force_inline uint32_t +mul8x2_8 (uint32_t a, uint8_t b) +{ + uint32_t t = (a & RB_MASK) * b + RB_ONE_HALF; + return ((t + ((t >> G_SHIFT) & RB_MASK)) >> G_SHIFT) & RB_MASK; +} + +static force_inline uint32_t +add8x2_8x2(uint32_t a, uint32_t b) +{ + uint32_t t = a + b; + t |= RB_MASK_PLUS_ONE - ((t >> G_SHIFT) & RB_MASK); + return t & RB_MASK; +} + +static force_inline uint32_t +lerp8x4(uint32_t src, uint8_t a, uint32_t dst) +{ + return (add8x2_8x2(mul8x2_8(src, a), + mul8x2_8(dst, ~a)) | + add8x2_8x2(mul8x2_8(src >> G_SHIFT, a), + mul8x2_8(dst >> G_SHIFT, ~a)) << G_SHIFT); +} + +static force_inline uint8_t +mul_8_8(uint8_t a, uint8_t b) +{ + uint16_t t = a * (uint16_t)b + 0x7f; + return ((t >> 8) + t) >> 8; +} + +static inline uint32_t multa(uint32_t s, uint8_t a, int shift) +{ + return mul_8_8((s >> shift) & 0xff, a) << shift; +} + +static inline uint32_t mul_4x8_8(uint32_t color, uint8_t alpha) +{ + uint32_t v; + + v = 0; + v |= multa(color, alpha, 24); + v |= multa(color, alpha, 16); + v |= multa(color, alpha, 8); + v |= multa(color, alpha, 0); + + return v; +} + +static inline bool +xTriangleValid(const xTriangle *t) +{ + xPointFixed v1, v2; + + v1.x = t->p2.x - t->p1.x; + v1.y = t->p2.y - t->p1.y; + + v2.x = t->p3.x - t->p1.x; + v2.y = t->p3.y - t->p1.y; + + /* if the length of any edge is zero, the area must be zero */ + if (v1.x == 0 && v1.y == 0) + return false; + if (v2.x == 0 && v2.y == 0) + return false; + + /* if the cross-product is zero, so it the size */ + return v2.y * v1.x != v1.y * v2.x; +} + +#define SAMPLES_X 17 +#define SAMPLES_Y 15 + +#define FAST_SAMPLES_shift 2 +#define FAST_SAMPLES_X (1<<FAST_SAMPLES_shift) +#define FAST_SAMPLES_Y (1<<FAST_SAMPLES_shift) +#define FAST_SAMPLES_mask ((1<<FAST_SAMPLES_shift)-1) + +#define pixman_fixed_integer_floor(V) pixman_fixed_to_int(V) +#define pixman_fixed_integer_ceil(V) pixman_fixed_to_int(pixman_fixed_ceil(V)) + +static inline int pixman_fixed_to_grid(pixman_fixed_t v) +{ + return (v + ((1<<(16-FAST_SAMPLES_shift-1))-1)) >> (16 - FAST_SAMPLES_shift); +} + +void trapezoids_bounds(int n, const xTrapezoid *t, BoxPtr box); + +static inline bool +is_mono(PicturePtr dst, PictFormatPtr mask) +{ + return mask ? mask->depth < 8 : dst->polyEdge==PolyEdgeSharp; +} + +#define TOR_INPLACE_SIZE 128 + +#endif /* SNA_TRAPEZOIDS_H */ diff --git a/src/sna/sna_trapezoids_boxes.c b/src/sna/sna_trapezoids_boxes.c new file mode 100644 index 00000000..d7861d2f --- /dev/null +++ b/src/sna/sna_trapezoids_boxes.c @@ -0,0 +1,1459 @@ +/* + * Copyright (c) 2007 David Turner + * Copyright (c) 2008 M Joonas Pihlaja + * Copyright (c) 2011 Intel Corporation + * + * Permission is hereby granted, free of charge, to any person obtaining a + * copy of this software and associated documentation files (the "Software"), + * to deal in the Software without restriction, including without limitation + * the rights to use, copy, modify, merge, publish, distribute, sublicense, + * and/or sell copies of the Software, and to permit persons to whom the + * Software is furnished to do so, subject to the following conditions: + * + * The above copyright notice and this permission notice (including the next + * paragraph) shall be included in all copies or substantial portions of the + * Software. + * + * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR + * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, + * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL + * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER + * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, + * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE + * SOFTWARE. + * + * Authors: + * Chris Wilson <chris@chris-wilson.co.uk> + * + */ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include "sna.h" +#include "sna_render.h" +#include "sna_render_inline.h" +#include "sna_trapezoids.h" +#include "fb/fbpict.h" + +#include <mipict.h> + +#if 0 +#define __DBG(x) ErrorF x +#else +#define __DBG(x) +#endif + +/* TODO: Emit unantialiased and MSAA triangles. */ + +#ifndef MAX +#define MAX(x,y) ((x) >= (y) ? (x) : (y)) +#endif + +#ifndef MIN +#define MIN(x,y) ((x) <= (y) ? (x) : (y)) +#endif + +#define region_count(r) ((r)->data ? (r)->data->numRects : 1) +#define region_boxes(r) ((r)->data ? (BoxPtr)((r)->data + 1) : &(r)->extents) + +#if HAS_DEBUG_FULL +static void _assert_pixmap_contains_box(PixmapPtr pixmap, BoxPtr box, const char *function) +{ + if (box->x1 < 0 || box->y1 < 0 || + box->x2 > pixmap->drawable.width || + box->y2 > pixmap->drawable.height) + { + ErrorF("%s: damage box is beyond the pixmap: box=(%d, %d), (%d, %d), pixmap=(%d, %d)\n", + __FUNCTION__, + box->x1, box->y1, box->x2, box->y2, + pixmap->drawable.width, + pixmap->drawable.height); + assert(0); + } +} +#define assert_pixmap_contains_box(p, b) _assert_pixmap_contains_box(p, b, __FUNCTION__) +#else +#define assert_pixmap_contains_box(p, b) +#endif + +static void apply_damage(struct sna_composite_op *op, RegionPtr region) +{ + DBG(("%s: damage=%p, region=%ldx[(%d, %d), (%d, %d)]\n", + __FUNCTION__, op->damage, + (long)REGION_NUM_RECTS(region), + region->extents.x1, region->extents.y1, + region->extents.x2, region->extents.y2)); + + if (op->damage == NULL) + return; + + RegionTranslate(region, op->dst.x, op->dst.y); + + assert_pixmap_contains_box(op->dst.pixmap, RegionExtents(region)); + sna_damage_add(op->damage, region); +} + +static void _apply_damage_box(struct sna_composite_op *op, const BoxRec *box) +{ + BoxRec r; + + r.x1 = box->x1 + op->dst.x; + r.x2 = box->x2 + op->dst.x; + r.y1 = box->y1 + op->dst.y; + r.y2 = box->y2 + op->dst.y; + + assert_pixmap_contains_box(op->dst.pixmap, &r); + sna_damage_add_box(op->damage, &r); +} + +inline static void apply_damage_box(struct sna_composite_op *op, const BoxRec *box) +{ + if (op->damage) + _apply_damage_box(op, box); +} + +bool +composite_aligned_boxes(struct sna *sna, + CARD8 op, + PicturePtr src, + PicturePtr dst, + PictFormatPtr maskFormat, + INT16 src_x, INT16 src_y, + int ntrap, const xTrapezoid *traps, + bool force_fallback) +{ + BoxRec stack_boxes[64], *boxes; + pixman_region16_t region, clip; + struct sna_composite_op tmp; + bool ret = true; + int dx, dy, n, num_boxes; + + if (NO_ALIGNED_BOXES) + return false; + + DBG(("%s\n", __FUNCTION__)); + + boxes = stack_boxes; + if (ntrap > (int)ARRAY_SIZE(stack_boxes)) { + boxes = malloc(sizeof(BoxRec)*ntrap); + if (boxes == NULL) + return false; + } + + dx = dst->pDrawable->x; + dy = dst->pDrawable->y; + + region.extents.x1 = region.extents.y1 = 32767; + region.extents.x2 = region.extents.y2 = -32767; + num_boxes = 0; + for (n = 0; n < ntrap; n++) { + boxes[num_boxes].x1 = dx + pixman_fixed_to_int(traps[n].left.p1.x + pixman_fixed_1_minus_e/2); + boxes[num_boxes].y1 = dy + pixman_fixed_to_int(traps[n].top + pixman_fixed_1_minus_e/2); + boxes[num_boxes].x2 = dx + pixman_fixed_to_int(traps[n].right.p2.x + pixman_fixed_1_minus_e/2); + boxes[num_boxes].y2 = dy + pixman_fixed_to_int(traps[n].bottom + pixman_fixed_1_minus_e/2); + + if (boxes[num_boxes].x1 >= boxes[num_boxes].x2) + continue; + if (boxes[num_boxes].y1 >= boxes[num_boxes].y2) + continue; + + if (boxes[num_boxes].x1 < region.extents.x1) + region.extents.x1 = boxes[num_boxes].x1; + if (boxes[num_boxes].x2 > region.extents.x2) + region.extents.x2 = boxes[num_boxes].x2; + + if (boxes[num_boxes].y1 < region.extents.y1) + region.extents.y1 = boxes[num_boxes].y1; + if (boxes[num_boxes].y2 > region.extents.y2) + region.extents.y2 = boxes[num_boxes].y2; + + num_boxes++; + } + + if (num_boxes == 0) + goto free_boxes; + + DBG(("%s: extents (%d, %d), (%d, %d) offset of (%d, %d)\n", + __FUNCTION__, + region.extents.x1, region.extents.y1, + region.extents.x2, region.extents.y2, + region.extents.x1 - boxes[0].x1, + region.extents.y1 - boxes[0].y1)); + + src_x += region.extents.x1 - boxes[0].x1; + src_y += region.extents.y1 - boxes[0].y1; + + if (!sna_compute_composite_region(&clip, + src, NULL, dst, + src_x, src_y, + 0, 0, + region.extents.x1 - dx, region.extents.y1 - dy, + region.extents.x2 - region.extents.x1, + region.extents.y2 - region.extents.y1)) { + DBG(("%s: trapezoids do not intersect drawable clips\n", + __FUNCTION__)) ; + goto done; + } + + if (force_fallback || + !sna->render.composite(sna, op, src, NULL, dst, + src_x, src_y, + 0, 0, + clip.extents.x1, clip.extents.y1, + clip.extents.x2 - clip.extents.x1, + clip.extents.y2 - clip.extents.y1, + memset(&tmp, 0, sizeof(tmp)))) { + unsigned int flags; + pixman_box16_t *b; + int i, count; + + DBG(("%s: composite render op not supported\n", + __FUNCTION__)); + + flags = MOVE_READ | MOVE_WRITE; + if (n == 1 && op <= PictOpSrc) + flags = MOVE_WRITE | MOVE_INPLACE_HINT; + + if (!sna_drawable_move_region_to_cpu(dst->pDrawable, &clip, flags)) + goto done; + if (dst->alphaMap && + !sna_drawable_move_to_cpu(dst->alphaMap->pDrawable, + MOVE_READ | MOVE_WRITE)) + goto done; + if (src->pDrawable) { + if (!sna_drawable_move_to_cpu(src->pDrawable, + MOVE_READ)) + goto done; + if (src->alphaMap && + !sna_drawable_move_to_cpu(src->alphaMap->pDrawable, + MOVE_READ)) + goto done; + } + + DBG(("%s: fbComposite()\n", __FUNCTION__)); + if (maskFormat) { + pixman_region_init_rects(®ion, boxes, num_boxes); + RegionIntersect(®ion, ®ion, &clip); + + if (sigtrap_get() == 0) { + b = REGION_RECTS(®ion); + count = REGION_NUM_RECTS(®ion); + for (i = 0; i < count; i++) { + fbComposite(op, src, NULL, dst, + src_x + b[i].x1 - boxes[0].x1, + src_y + b[i].y1 - boxes[0].y1, + 0, 0, + b[i].x1, b[i].y1, + b[i].x2 - b[i].x1, b[i].y2 - b[i].y1); + } + sigtrap_put(); + } + pixman_region_fini(®ion); + } else { + for (n = 0; n < num_boxes; n++) { + pixman_region_init_rects(®ion, &boxes[n], 1); + RegionIntersect(®ion, ®ion, &clip); + b = REGION_RECTS(®ion); + count = REGION_NUM_RECTS(®ion); + for (i = 0; i < count; i++) { + fbComposite(op, src, NULL, dst, + src_x + b[i].x1 - boxes[0].x1, + src_y + b[i].y1 - boxes[0].y1, + 0, 0, + b[i].x1, b[i].y1, + b[i].x2 - b[i].x1, b[i].y2 - b[i].y1); + } + pixman_region_fini(®ion); + pixman_region_fini(®ion); + } + } + ret = true; + goto done; + } + + if (maskFormat || + (op == PictOpSrc || op == PictOpClear) || + num_boxes == 1) { + pixman_region_init_rects(®ion, boxes, num_boxes); + RegionIntersect(®ion, ®ion, &clip); + if (REGION_NUM_RECTS(®ion)) { + tmp.boxes(sna, &tmp, + REGION_RECTS(®ion), + REGION_NUM_RECTS(®ion)); + apply_damage(&tmp, ®ion); + } + pixman_region_fini(®ion); + } else { + for (n = 0; n < num_boxes; n++) { + pixman_region_init_rects(®ion, &boxes[n], 1); + RegionIntersect(®ion, ®ion, &clip); + if (REGION_NUM_RECTS(®ion)) { + tmp.boxes(sna, &tmp, + REGION_RECTS(®ion), + REGION_NUM_RECTS(®ion)); + apply_damage(&tmp, ®ion); + } + pixman_region_fini(®ion); + } + } + tmp.done(sna, &tmp); + +done: + REGION_UNINIT(NULL, &clip); +free_boxes: + if (boxes != stack_boxes) + free(boxes); + + return ret; +} + +static inline int grid_coverage(int samples, pixman_fixed_t f) +{ + return (samples * pixman_fixed_frac(f) + pixman_fixed_1/2) / pixman_fixed_1; +} + +inline static void +composite_unaligned_box(struct sna *sna, + struct sna_composite_spans_op *tmp, + const BoxRec *box, + float opacity, + pixman_region16_t *clip) +{ + assert(opacity != 0.); + + if (clip) { + pixman_region16_t region; + + pixman_region_init_rects(®ion, box, 1); + RegionIntersect(®ion, ®ion, clip); + if (REGION_NUM_RECTS(®ion)) + tmp->boxes(sna, tmp, + REGION_RECTS(®ion), + REGION_NUM_RECTS(®ion), + opacity); + pixman_region_fini(®ion); + } else + tmp->box(sna, tmp, box, opacity); +} + +inline static void +composite_unaligned_trap_row(struct sna *sna, + struct sna_composite_spans_op *tmp, + const xTrapezoid *trap, int dx, + int y1, int y2, int covered, + pixman_region16_t *clip) +{ + BoxRec box; + int opacity; + int x1, x2; +#define u8_to_float(x) ((x) * (1.f/255)) + + if (covered == 0) + return; + + x1 = dx + pixman_fixed_to_int(trap->left.p1.x); + x2 = dx + pixman_fixed_to_int(trap->right.p1.x); + if (clip) { + if (y2 > clip->extents.y2) + y2 = clip->extents.y2; + if (y1 < clip->extents.y1) + y1 = clip->extents.y1; + if (y1 >= y2) + return; + + if (x2 < clip->extents.x1 || x1 > clip->extents.x2) + return; + } + + box.y1 = y1; + box.y2 = y2; + + if (x1 == x2) { + box.x1 = x1; + box.x2 = x2 + 1; + + opacity = covered; + opacity *= grid_coverage(SAMPLES_X, trap->right.p1.x) - grid_coverage(SAMPLES_X, trap->left.p1.x); + + if (opacity) + composite_unaligned_box(sna, tmp, &box, + u8_to_float(opacity), clip); + } else { + if (pixman_fixed_frac(trap->left.p1.x)) { + box.x1 = x1; + box.x2 = ++x1; + + opacity = covered; + opacity *= SAMPLES_X - grid_coverage(SAMPLES_X, trap->left.p1.x); + + if (opacity) + composite_unaligned_box(sna, tmp, &box, + u8_to_float(opacity), clip); + } + + if (x2 > x1) { + box.x1 = x1; + box.x2 = x2; + + composite_unaligned_box(sna, tmp, &box, + covered == SAMPLES_Y ? 1. : u8_to_float(covered*SAMPLES_X), + clip); + } + + if (pixman_fixed_frac(trap->right.p1.x)) { + box.x1 = x2; + box.x2 = x2 + 1; + + opacity = covered; + opacity *= grid_coverage(SAMPLES_X, trap->right.p1.x); + + if (opacity) + composite_unaligned_box(sna, tmp, &box, + u8_to_float(opacity), clip); + } + } +} + +flatten static void +composite_unaligned_trap(struct sna *sna, + struct sna_composite_spans_op *tmp, + const xTrapezoid *trap, + int dx, int dy, + pixman_region16_t *clip) +{ + int y1, y2; + + y1 = dy + pixman_fixed_to_int(trap->top); + y2 = dy + pixman_fixed_to_int(trap->bottom); + + DBG(("%s: y1=%d, y2=%d\n", __FUNCTION__, y1, y2)); + + if (y1 == y2) { + composite_unaligned_trap_row(sna, tmp, trap, dx, + y1, y1 + 1, + grid_coverage(SAMPLES_Y, trap->bottom) - grid_coverage(SAMPLES_Y, trap->top), + clip); + } else { + if (pixman_fixed_frac(trap->top)) { + composite_unaligned_trap_row(sna, tmp, trap, dx, + y1, y1 + 1, + SAMPLES_Y - grid_coverage(SAMPLES_Y, trap->top), + clip); + y1++; + } + + if (y2 > y1) + composite_unaligned_trap_row(sna, tmp, trap, dx, + y1, y2, + SAMPLES_Y, + clip); + + if (pixman_fixed_frac(trap->bottom)) + composite_unaligned_trap_row(sna, tmp, trap, dx, + y2, y2 + 1, + grid_coverage(SAMPLES_Y, trap->bottom), + clip); + } + + if (tmp->base.damage) { + BoxRec box; + + box.x1 = dx + pixman_fixed_to_int(trap->left.p1.x); + box.x2 = dx + pixman_fixed_to_int(trap->right.p1.x + pixman_fixed_1_minus_e); + box.y1 = dy + pixman_fixed_to_int(trap->top); + box.y2 = dy + pixman_fixed_to_int(trap->bottom + pixman_fixed_1_minus_e); + + if (clip) { + pixman_region16_t region; + + pixman_region_init_rects(®ion, &box, 1); + RegionIntersect(®ion, ®ion, clip); + if (REGION_NUM_RECTS(®ion)) + apply_damage(&tmp->base, ®ion); + RegionUninit(®ion); + } else + apply_damage_box(&tmp->base, &box); + } +} + +inline static void +blt_opacity(PixmapPtr scratch, + int x1, int x2, + int y, int h, + uint8_t opacity) +{ + uint8_t *ptr; + + if (opacity == 0xff) + return; + + if (x1 < 0) + x1 = 0; + if (x2 > scratch->drawable.width) + x2 = scratch->drawable.width; + if (x1 >= x2) + return; + + x2 -= x1; + + ptr = scratch->devPrivate.ptr; + ptr += scratch->devKind * y; + ptr += x1; + do { + if (x2 == 1) + *ptr = opacity; + else + memset(ptr, opacity, x2); + ptr += scratch->devKind; + } while (--h); +} + +static void +blt_unaligned_box_row(PixmapPtr scratch, + BoxPtr extents, + const xTrapezoid *trap, + int y1, int y2, + int covered) +{ + int x1, x2; + + if (y2 > scratch->drawable.height) + y2 = scratch->drawable.height; + if (y1 < 0) + y1 = 0; + if (y1 >= y2) + return; + + y2 -= y1; + + x1 = pixman_fixed_to_int(trap->left.p1.x); + x2 = pixman_fixed_to_int(trap->right.p1.x); + + x1 -= extents->x1; + x2 -= extents->x1; + + if (x1 == x2) { + blt_opacity(scratch, + x1, x1+1, + y1, y2, + covered * (grid_coverage(SAMPLES_X, trap->right.p1.x) - grid_coverage(SAMPLES_X, trap->left.p1.x))); + } else { + if (pixman_fixed_frac(trap->left.p1.x)) { + blt_opacity(scratch, + x1, x1 + 1, + y1, y2, + covered * (SAMPLES_X - grid_coverage(SAMPLES_X, trap->left.p1.x))); + x1++; + } + + if (x2 > x1) { + blt_opacity(scratch, + x1, x2, + y1, y2, + covered*SAMPLES_X); + } + + if (pixman_fixed_frac(trap->right.p1.x)) + blt_opacity(scratch, + x2, x2 + 1, + y1, y2, + covered * grid_coverage(SAMPLES_X, trap->right.p1.x)); + } +} + +inline static void +lerp32_opacity(PixmapPtr scratch, + uint32_t color, + int16_t x, int16_t w, + int16_t y, int16_t h, + uint8_t opacity) +{ + uint32_t *ptr; + int stride, i; + + ptr = (uint32_t*)((uint8_t *)scratch->devPrivate.ptr + scratch->devKind * y); + ptr += x; + stride = scratch->devKind / 4; + + if (opacity == 0xff) { + if ((w | h) == 1) { + *ptr = color; + } else { + if (w < 16) { + do { + for (i = 0; i < w; i++) + ptr[i] = color; + ptr += stride; + } while (--h); + } else { + pixman_fill(ptr, stride, 32, + 0, 0, w, h, color); + } + } + } else { + if ((w | h) == 1) { + *ptr = lerp8x4(color, opacity, *ptr); + } else if (w == 1) { + do { + *ptr = lerp8x4(color, opacity, *ptr); + ptr += stride; + } while (--h); + } else{ + do { + for (i = 0; i < w; i++) + ptr[i] = lerp8x4(color, opacity, ptr[i]); + ptr += stride; + } while (--h); + } + } +} + +static void +lerp32_unaligned_box_row(PixmapPtr scratch, uint32_t color, + const BoxRec *extents, + const xTrapezoid *trap, int16_t dx, + int16_t y, int16_t h, + uint8_t covered) +{ + int16_t x1 = pixman_fixed_to_int(trap->left.p1.x) + dx; + uint16_t fx1 = grid_coverage(SAMPLES_X, trap->left.p1.x); + int16_t x2 = pixman_fixed_to_int(trap->right.p2.x) + dx; + uint16_t fx2 = grid_coverage(SAMPLES_X, trap->right.p2.x); + + if (x1 < extents->x1) + x1 = extents->x1, fx1 = 0; + if (x2 >= extents->x2) + x2 = extents->x2, fx2 = 0; + + DBG(("%s: x=(%d.%d, %d.%d), y=%dx%d, covered=%d\n", __FUNCTION__, + x1, fx1, x2, fx2, y, h, covered)); + + if (x1 < x2) { + if (fx1) { + lerp32_opacity(scratch, color, + x1, 1, + y, h, + covered * (SAMPLES_X - fx1)); + x1++; + } + + if (x2 > x1) { + lerp32_opacity(scratch, color, + x1, x2-x1, + y, h, + covered*SAMPLES_X); + } + + if (fx2) { + lerp32_opacity(scratch, color, + x2, 1, + y, h, + covered * fx2); + } + } else if (x1 == x2 && fx2 > fx1) { + lerp32_opacity(scratch, color, + x1, 1, + y, h, + covered * (fx2 - fx1)); + } +} + +struct pixman_inplace { + pixman_image_t *image, *source, *mask; + uint32_t color; + uint32_t *bits; + int dx, dy; + int sx, sy; + uint8_t op; +}; + +inline static void +pixsolid_opacity(struct pixman_inplace *pi, + int16_t x, int16_t w, + int16_t y, int16_t h, + uint8_t opacity) +{ + if (opacity == 0xff) + *pi->bits = pi->color; + else + *pi->bits = mul_4x8_8(pi->color, opacity); + pixman_image_composite(pi->op, pi->source, NULL, pi->image, + 0, 0, 0, 0, pi->dx + x, pi->dy + y, w, h); +} + +static void +pixsolid_unaligned_box_row(struct pixman_inplace *pi, + const BoxRec *extents, + const xTrapezoid *trap, + int16_t y, int16_t h, + uint8_t covered) +{ + int16_t x1 = pixman_fixed_to_int(trap->left.p1.x); + uint16_t fx1 = grid_coverage(SAMPLES_X, trap->left.p1.x); + int16_t x2 = pixman_fixed_to_int(trap->right.p1.x); + uint16_t fx2 = grid_coverage(SAMPLES_X, trap->right.p1.x); + + if (x1 < extents->x1) + x1 = extents->x1, fx1 = 0; + if (x2 >= extents->x2) + x2 = extents->x2, fx2 = 0; + + if (x1 < x2) { + if (fx1) { + pixsolid_opacity(pi, x1, 1, y, h, + covered * (SAMPLES_X - fx1)); + x1++; + } + + if (x2 > x1) + pixsolid_opacity(pi, x1, x2-x1, y, h, covered*SAMPLES_X); + + if (fx2) + pixsolid_opacity(pi, x2, 1, y, h, covered * fx2); + } else if (x1 == x2 && fx2 > fx1) { + pixsolid_opacity(pi, x1, 1, y, h, covered * (fx2 - fx1)); + } +} + +static bool +composite_unaligned_boxes_inplace__solid(struct sna *sna, + CARD8 op, uint32_t color, + PicturePtr dst, + int n, const xTrapezoid *t, + bool force_fallback) +{ + PixmapPtr pixmap; + int16_t dx, dy; + + DBG(("%s: force=%d, is_gpu=%d, op=%d, color=%x\n", __FUNCTION__, + force_fallback, is_gpu(sna, dst->pDrawable, PREFER_GPU_SPANS), op, color)); + + if (!force_fallback && is_gpu(sna, dst->pDrawable, PREFER_GPU_SPANS)) { + DBG(("%s: fallback -- can not perform operation in place, destination busy\n", + __FUNCTION__)); + + return false; + } + + /* XXX a8 boxes */ + if (!(dst->format == PICT_a8r8g8b8 || dst->format == PICT_x8r8g8b8)) { + DBG(("%s: fallback -- can not perform operation in place, unhanbled format %08lx\n", + __FUNCTION__, (long)dst->format)); + + goto pixman; + } + + pixmap = get_drawable_pixmap(dst->pDrawable); + get_drawable_deltas(dst->pDrawable, pixmap, &dx, &dy); + + if (op == PictOpOver && (color >> 24) == 0xff) + op = PictOpSrc; + if (op == PictOpOver || op == PictOpAdd) { + struct sna_pixmap *priv = sna_pixmap(pixmap); + if (priv && priv->clear && priv->clear_color == 0) + op = PictOpSrc; + } + + switch (op) { + case PictOpSrc: + break; + default: + DBG(("%s: fallback -- can not perform op [%d] in place\n", + __FUNCTION__, op)); + goto pixman; + } + + DBG(("%s: inplace operation on argb32 destination x %d\n", + __FUNCTION__, n)); + do { + RegionRec clip; + BoxPtr extents; + int count; + + clip.extents.x1 = pixman_fixed_to_int(t->left.p1.x); + clip.extents.x2 = pixman_fixed_to_int(t->right.p1.x + pixman_fixed_1_minus_e); + clip.extents.y1 = pixman_fixed_to_int(t->top); + clip.extents.y2 = pixman_fixed_to_int(t->bottom + pixman_fixed_1_minus_e); + clip.data = NULL; + + if (!sna_compute_composite_region(&clip, + NULL, NULL, dst, + 0, 0, + 0, 0, + clip.extents.x1, clip.extents.y1, + clip.extents.x2 - clip.extents.x1, + clip.extents.y2 - clip.extents.y1)) + continue; + + if (!sna_drawable_move_region_to_cpu(dst->pDrawable, &clip, + MOVE_WRITE | MOVE_READ)) { + RegionUninit(&clip); + continue; + } + + RegionTranslate(&clip, dx, dy); + count = REGION_NUM_RECTS(&clip); + extents = REGION_RECTS(&clip); + while (count--) { + int16_t y1 = dy + pixman_fixed_to_int(t->top); + uint16_t fy1 = pixman_fixed_frac(t->top); + int16_t y2 = dy + pixman_fixed_to_int(t->bottom); + uint16_t fy2 = pixman_fixed_frac(t->bottom); + + DBG(("%s: t=(%d, %d), (%d, %d), extents (%d, %d), (%d, %d)\n", + __FUNCTION__, + pixman_fixed_to_int(t->left.p1.x), + pixman_fixed_to_int(t->top), + pixman_fixed_to_int(t->right.p2.x), + pixman_fixed_to_int(t->bottom), + extents->x1, extents->y1, + extents->x2, extents->y2)); + + if (y1 < extents->y1) + y1 = extents->y1, fy1 = 0; + if (y2 >= extents->y2) + y2 = extents->y2, fy2 = 0; + + if (y1 < y2) { + if (fy1) { + lerp32_unaligned_box_row(pixmap, color, extents, + t, dx, y1, 1, + SAMPLES_Y - grid_coverage(SAMPLES_Y, fy1)); + y1++; + } + + if (y2 > y1) + lerp32_unaligned_box_row(pixmap, color, extents, + t, dx, y1, y2 - y1, + SAMPLES_Y); + + if (fy2) + lerp32_unaligned_box_row(pixmap, color, extents, + t, dx, y2, 1, + grid_coverage(SAMPLES_Y, fy2)); + } else if (y1 == y2 && fy2 > fy1) { + lerp32_unaligned_box_row(pixmap, color, extents, + t, dx, y1, 1, + grid_coverage(SAMPLES_Y, fy2) - grid_coverage(SAMPLES_Y, fy1)); + } + extents++; + } + + RegionUninit(&clip); + } while (--n && t++); + + return true; + +pixman: + do { + struct pixman_inplace pi; + RegionRec clip; + BoxPtr extents; + int count; + + clip.extents.x1 = pixman_fixed_to_int(t->left.p1.x); + clip.extents.x2 = pixman_fixed_to_int(t->right.p1.x + pixman_fixed_1_minus_e); + clip.extents.y1 = pixman_fixed_to_int(t->top); + clip.extents.y2 = pixman_fixed_to_int(t->bottom + pixman_fixed_1_minus_e); + clip.data = NULL; + + if (!sna_compute_composite_region(&clip, + NULL, NULL, dst, + 0, 0, + 0, 0, + clip.extents.x1, clip.extents.y1, + clip.extents.x2 - clip.extents.x1, + clip.extents.y2 - clip.extents.y1)) + continue; + + if (!sna_drawable_move_region_to_cpu(dst->pDrawable, &clip, + MOVE_WRITE | MOVE_READ)) { + RegionUninit(&clip); + continue; + } + + pi.image = image_from_pict(dst, false, &pi.dx, &pi.dy); + pi.source = pixman_image_create_bits(PIXMAN_a8r8g8b8, 1, 1, NULL, 0); + pixman_image_set_repeat(pi.source, PIXMAN_REPEAT_NORMAL); + pi.bits = pixman_image_get_data(pi.source); + pi.color = color; + pi.op = op; + + count = REGION_NUM_RECTS(&clip); + extents = REGION_RECTS(&clip); + while (count--) { + int16_t y1 = pixman_fixed_to_int(t->top); + uint16_t fy1 = pixman_fixed_frac(t->top); + int16_t y2 = pixman_fixed_to_int(t->bottom); + uint16_t fy2 = pixman_fixed_frac(t->bottom); + + if (y1 < extents->y1) + y1 = extents->y1, fy1 = 0; + if (y2 >= extents->y2) + y2 = extents->y2, fy2 = 0; + if (y1 < y2) { + if (fy1) { + pixsolid_unaligned_box_row(&pi, extents, t, y1, 1, + SAMPLES_Y - grid_coverage(SAMPLES_Y, fy1)); + y1++; + } + + if (y2 > y1) + pixsolid_unaligned_box_row(&pi, extents, t, y1, y2 - y1, + SAMPLES_Y); + + if (fy2) + pixsolid_unaligned_box_row(&pi, extents, t, y2, 1, + grid_coverage(SAMPLES_Y, fy2)); + } else if (y1 == y2 && fy2 > fy1) { + pixsolid_unaligned_box_row(&pi, extents, t, y1, 1, + grid_coverage(SAMPLES_Y, fy2) - grid_coverage(SAMPLES_Y, fy1)); + } + extents++; + } + + RegionUninit(&clip); + pixman_image_unref(pi.image); + pixman_image_unref(pi.source); + } while (--n && t++); + return true; +} + +inline static void +pixmask_opacity(struct pixman_inplace *pi, + int16_t x, int16_t w, + int16_t y, int16_t h, + uint8_t opacity) +{ + if (opacity == 0xff) { + pixman_image_composite(pi->op, pi->source, NULL, pi->image, + pi->sx + x, pi->sy + y, + 0, 0, + pi->dx + x, pi->dy + y, + w, h); + } else { + *pi->bits = opacity; + pixman_image_composite(pi->op, pi->source, pi->mask, pi->image, + pi->sx + x, pi->sy + y, + 0, 0, + pi->dx + x, pi->dy + y, + w, h); + } +} + +static void +pixmask_unaligned_box_row(struct pixman_inplace *pi, + const BoxRec *extents, + const xTrapezoid *trap, + int16_t y, int16_t h, + uint8_t covered) +{ + int16_t x1 = pixman_fixed_to_int(trap->left.p1.x); + uint16_t fx1 = grid_coverage(SAMPLES_X, trap->left.p1.x); + int16_t x2 = pixman_fixed_to_int(trap->right.p1.x); + uint16_t fx2 = grid_coverage(SAMPLES_X, trap->right.p1.x); + + if (x1 < extents->x1) + x1 = extents->x1, fx1 = 0; + if (x2 >= extents->x2) + x2 = extents->x2, fx2 = 0; + + if (x1 < x2) { + if (fx1) { + pixmask_opacity(pi, x1, 1, y, h, + covered * (SAMPLES_X - fx1)); + x1++; + } + + if (x2 > x1) + pixmask_opacity(pi, x1, x2-x1, y, h, covered*SAMPLES_X); + + if (fx2) + pixmask_opacity(pi, x2, 1, y, h, covered * fx2); + } else if (x1 == x2 && fx2 > fx1) { + pixmask_opacity(pi, x1, 1, y, h, covered * (fx2 - fx1)); + } +} + +struct rectilinear_inplace_thread { + pixman_image_t *dst, *src; + const RegionRec *clip; + const xTrapezoid *trap; + int dx, dy, sx, sy; + int y1, y2; + CARD8 op; +}; + +static void rectilinear_inplace_thread(void *arg) +{ + struct rectilinear_inplace_thread *thread = arg; + const xTrapezoid *t = thread->trap; + struct pixman_inplace pi; + const BoxRec *extents; + int count; + + pi.image = thread->dst; + pi.dx = thread->dx; + pi.dy = thread->dy; + + pi.source = thread->src; + pi.sx = thread->sx; + pi.sy = thread->sy; + + pi.mask = pixman_image_create_bits(PIXMAN_a8, 1, 1, &pi.color, 4); + pixman_image_set_repeat(pi.mask, PIXMAN_REPEAT_NORMAL); + pi.bits = pixman_image_get_data(pi.mask); + pi.op = thread->op; + + count = region_count(thread->clip); + extents = region_boxes(thread->clip); + while (count--) { + int16_t y1 = pixman_fixed_to_int(t->top); + uint16_t fy1 = pixman_fixed_frac(t->top); + int16_t y2 = pixman_fixed_to_int(t->bottom); + uint16_t fy2 = pixman_fixed_frac(t->bottom); + + if (y1 < MAX(thread->y1, extents->y1)) + y1 = MAX(thread->y1, extents->y1), fy1 = 0; + if (y2 > MIN(thread->y2, extents->y2)) + y2 = MIN(thread->y2, extents->y2), fy2 = 0; + if (y1 < y2) { + if (fy1) { + pixmask_unaligned_box_row(&pi, extents, t, y1, 1, + SAMPLES_Y - grid_coverage(SAMPLES_Y, fy1)); + y1++; + } + + if (y2 > y1) + pixmask_unaligned_box_row(&pi, extents, t, y1, y2 - y1, + SAMPLES_Y); + + if (fy2) + pixmask_unaligned_box_row(&pi, extents, t, y2, 1, + grid_coverage(SAMPLES_Y, fy2)); + } else if (y1 == y2 && fy2 > fy1) { + pixmask_unaligned_box_row(&pi, extents, t, y1, 1, + grid_coverage(SAMPLES_Y, fy2) - grid_coverage(SAMPLES_Y, fy1)); + } + extents++; + } + + pixman_image_unref(pi.mask); +} + +static bool +composite_unaligned_boxes_inplace(struct sna *sna, + CARD8 op, + PicturePtr src, int16_t src_x, int16_t src_y, + PicturePtr dst, int n, const xTrapezoid *t, + bool force_fallback) +{ + if (!force_fallback && + (is_gpu(sna, dst->pDrawable, PREFER_GPU_SPANS) || + picture_is_gpu(sna, src))) { + DBG(("%s: fallback -- not forcing\n", __FUNCTION__)); + return false; + } + + DBG(("%s\n", __FUNCTION__)); + + src_x -= pixman_fixed_to_int(t[0].left.p1.x); + src_y -= pixman_fixed_to_int(t[0].left.p1.y); + do { + RegionRec clip; + BoxPtr extents; + int count; + int num_threads; + + clip.extents.x1 = pixman_fixed_to_int(t->left.p1.x); + clip.extents.x2 = pixman_fixed_to_int(t->right.p1.x + pixman_fixed_1_minus_e); + clip.extents.y1 = pixman_fixed_to_int(t->top); + clip.extents.y2 = pixman_fixed_to_int(t->bottom + pixman_fixed_1_minus_e); + clip.data = NULL; + + if (!sna_compute_composite_region(&clip, + src, NULL, dst, + clip.extents.x1 + src_x, + clip.extents.y1 + src_y, + 0, 0, + clip.extents.x1, clip.extents.y1, + clip.extents.x2 - clip.extents.x1, + clip.extents.y2 - clip.extents.y1)) + continue; + + if (!sna_drawable_move_region_to_cpu(dst->pDrawable, &clip, + MOVE_WRITE | MOVE_READ)) { + RegionUninit(&clip); + continue; + } + + if (src->pDrawable) { + if (!sna_drawable_move_to_cpu(src->pDrawable, + MOVE_READ)) { + RegionUninit(&clip); + continue; + } + if (src->alphaMap) { + if (!sna_drawable_move_to_cpu(src->alphaMap->pDrawable, + MOVE_READ)) { + RegionUninit(&clip); + continue; + } + } + } + + num_threads = sna_use_threads(clip.extents.x2 - clip.extents.x1, + clip.extents.y2 - clip.extents.y1, + 32); + if (num_threads == 1) { + struct pixman_inplace pi; + + pi.image = image_from_pict(dst, false, &pi.dx, &pi.dy); + pi.source = image_from_pict(src, false, &pi.sx, &pi.sy); + pi.sx += src_x; + pi.sy += src_y; + pi.mask = pixman_image_create_bits(PIXMAN_a8, 1, 1, &pi.color, 4); + pixman_image_set_repeat(pi.mask, PIXMAN_REPEAT_NORMAL); + pi.bits = pixman_image_get_data(pi.mask); + pi.op = op; + + count = REGION_NUM_RECTS(&clip); + extents = REGION_RECTS(&clip); + while (count--) { + int16_t y1 = pixman_fixed_to_int(t->top); + uint16_t fy1 = pixman_fixed_frac(t->top); + int16_t y2 = pixman_fixed_to_int(t->bottom); + uint16_t fy2 = pixman_fixed_frac(t->bottom); + + if (y1 < extents->y1) + y1 = extents->y1, fy1 = 0; + if (y2 > extents->y2) + y2 = extents->y2, fy2 = 0; + if (y1 < y2) { + if (fy1) { + pixmask_unaligned_box_row(&pi, extents, t, y1, 1, + SAMPLES_Y - grid_coverage(SAMPLES_Y, fy1)); + y1++; + } + + if (y2 > y1) + pixmask_unaligned_box_row(&pi, extents, t, y1, y2 - y1, + SAMPLES_Y); + + if (fy2) + pixmask_unaligned_box_row(&pi, extents, t, y2, 1, + grid_coverage(SAMPLES_Y, fy2)); + } else if (y1 == y2 && fy2 > fy1) { + pixmask_unaligned_box_row(&pi, extents, t, y1, 1, + grid_coverage(SAMPLES_Y, fy2) - grid_coverage(SAMPLES_Y, fy1)); + } + extents++; + } + + pixman_image_unref(pi.image); + pixman_image_unref(pi.source); + pixman_image_unref(pi.mask); + } else { + struct rectilinear_inplace_thread thread[num_threads]; + int i, y, dy; + + + thread[0].trap = t; + thread[0].dst = image_from_pict(dst, false, &thread[0].dx, &thread[0].dy); + thread[0].src = image_from_pict(src, false, &thread[0].sx, &thread[0].sy); + thread[0].sx += src_x; + thread[0].sy += src_y; + + thread[0].clip = &clip; + thread[0].op = op; + + y = clip.extents.y1; + dy = (clip.extents.y2 - clip.extents.y1 + num_threads - 1) / num_threads; + + for (i = 1; i < num_threads; i++) { + thread[i] = thread[0]; + thread[i].y1 = y; + thread[i].y2 = y += dy; + sna_threads_run(rectilinear_inplace_thread, &thread[i]); + } + + thread[0].y1 = y; + thread[0].y2 = clip.extents.y2; + rectilinear_inplace_thread(&thread[0]); + + sna_threads_wait(); + + pixman_image_unref(thread[0].dst); + pixman_image_unref(thread[0].src); + } + + RegionUninit(&clip); + } while (--n && t++); + + return true; +} + +static bool +composite_unaligned_boxes_fallback(struct sna *sna, + CARD8 op, + PicturePtr src, + PicturePtr dst, + INT16 src_x, INT16 src_y, + int ntrap, const xTrapezoid *traps, + bool force_fallback) +{ + ScreenPtr screen = dst->pDrawable->pScreen; + uint32_t color; + int16_t dst_x, dst_y; + int16_t dx, dy; + int n; + + if (sna_picture_is_solid(src, &color) && + composite_unaligned_boxes_inplace__solid(sna, op, color, dst, + ntrap, traps, + force_fallback)) + return true; + + if (composite_unaligned_boxes_inplace(sna, op, src, src_x, src_y, + dst, ntrap, traps, + force_fallback)) + return true; + + trapezoid_origin(&traps[0].left, &dst_x, &dst_y); + dx = dst->pDrawable->x; + dy = dst->pDrawable->y; + for (n = 0; n < ntrap; n++) { + const xTrapezoid *t = &traps[n]; + PixmapPtr scratch; + PicturePtr mask; + BoxRec extents; + int error; + int y1, y2; + + extents.x1 = pixman_fixed_to_int(t->left.p1.x); + extents.x2 = pixman_fixed_to_int(t->right.p1.x + pixman_fixed_1_minus_e); + extents.y1 = pixman_fixed_to_int(t->top); + extents.y2 = pixman_fixed_to_int(t->bottom + pixman_fixed_1_minus_e); + + if (!sna_compute_composite_extents(&extents, + src, NULL, dst, + src_x, src_y, + 0, 0, + extents.x1, extents.y1, + extents.x2 - extents.x1, + extents.y2 - extents.y1)) + continue; + + if (force_fallback) + scratch = sna_pixmap_create_unattached(screen, + extents.x2 - extents.x1, + extents.y2 - extents.y1, + 8); + else + scratch = sna_pixmap_create_upload(screen, + extents.x2 - extents.x1, + extents.y2 - extents.y1, + 8, KGEM_BUFFER_WRITE_INPLACE); + if (!scratch) + continue; + + memset(scratch->devPrivate.ptr, 0xff, + scratch->devKind * (extents.y2 - extents.y1)); + + extents.x1 -= dx; + extents.x2 -= dx; + extents.y1 -= dy; + extents.y2 -= dy; + + y1 = pixman_fixed_to_int(t->top) - extents.y1; + y2 = pixman_fixed_to_int(t->bottom) - extents.y1; + + if (y1 == y2) { + blt_unaligned_box_row(scratch, &extents, t, y1, y1 + 1, + grid_coverage(SAMPLES_Y, t->bottom) - grid_coverage(SAMPLES_Y, t->top)); + } else { + if (pixman_fixed_frac(t->top)) { + blt_unaligned_box_row(scratch, &extents, t, y1, y1 + 1, + SAMPLES_Y - grid_coverage(SAMPLES_Y, t->top)); + y1++; + } + + if (y2 > y1) + blt_unaligned_box_row(scratch, &extents, t, y1, y2, + SAMPLES_Y); + + if (pixman_fixed_frac(t->bottom)) + blt_unaligned_box_row(scratch, &extents, t, y2, y2+1, + grid_coverage(SAMPLES_Y, t->bottom)); + } + + mask = CreatePicture(0, &scratch->drawable, + PictureMatchFormat(screen, 8, PICT_a8), + 0, 0, serverClient, &error); + if (mask) { + CompositePicture(op, src, mask, dst, + src_x + extents.x1 - dst_x, + src_y + extents.y1 - dst_y, + 0, 0, + extents.x1, extents.y1, + extents.x2 - extents.x1, + extents.y2 - extents.y1); + FreePicture(mask, 0); + } + sna_pixmap_destroy(scratch); + } + + return true; +} + +bool +composite_unaligned_boxes(struct sna *sna, + CARD8 op, + PicturePtr src, + PicturePtr dst, + PictFormatPtr maskFormat, + INT16 src_x, INT16 src_y, + int ntrap, const xTrapezoid *traps, + bool force_fallback) +{ + BoxRec extents; + struct sna_composite_spans_op tmp; + struct sna_pixmap *priv; + pixman_region16_t clip, *c; + int16_t dst_x, dst_y; + int dx, dy, n; + + if (NO_UNALIGNED_BOXES) + return false; + + DBG(("%s: force_fallback=%d, mask=%x, n=%d, op=%d\n", + __FUNCTION__, force_fallback, maskFormat ? (int)maskFormat->format : 0, ntrap, op)); + + /* need a span converter to handle overlapping traps */ + if (ntrap > 1 && maskFormat) + return false; + + if (force_fallback || + !sna->render.check_composite_spans(sna, op, src, dst, 0, 0, + COMPOSITE_SPANS_RECTILINEAR)) { +fallback: + return composite_unaligned_boxes_fallback(sna, op, src, dst, + src_x, src_y, + ntrap, traps, + force_fallback); + } + + trapezoid_origin(&traps[0].left, &dst_x, &dst_y); + + extents.x1 = pixman_fixed_to_int(traps[0].left.p1.x); + extents.x2 = pixman_fixed_to_int(traps[0].right.p1.x + pixman_fixed_1_minus_e); + extents.y1 = pixman_fixed_to_int(traps[0].top); + extents.y2 = pixman_fixed_to_int(traps[0].bottom + pixman_fixed_1_minus_e); + + DBG(("%s: src=(%d, %d), dst=(%d, %d)\n", + __FUNCTION__, src_x, src_y, dst_x, dst_y)); + + for (n = 1; n < ntrap; n++) { + int x1 = pixman_fixed_to_int(traps[n].left.p1.x); + int x2 = pixman_fixed_to_int(traps[n].right.p1.x + pixman_fixed_1_minus_e); + int y1 = pixman_fixed_to_int(traps[n].top); + int y2 = pixman_fixed_to_int(traps[n].bottom + pixman_fixed_1_minus_e); + + if (x1 < extents.x1) + extents.x1 = x1; + if (x2 > extents.x2) + extents.x2 = x2; + if (y1 < extents.y1) + extents.y1 = y1; + if (y2 > extents.y2) + extents.y2 = y2; + } + + DBG(("%s: extents (%d, %d), (%d, %d)\n", __FUNCTION__, + extents.x1, extents.y1, extents.x2, extents.y2)); + + if (!sna_compute_composite_region(&clip, + src, NULL, dst, + src_x + extents.x1 - dst_x, + src_y + extents.y1 - dst_y, + 0, 0, + extents.x1, extents.y1, + extents.x2 - extents.x1, + extents.y2 - extents.y1)) { + DBG(("%s: trapezoids do not intersect drawable clips\n", + __FUNCTION__)) ; + return true; + } + + if (!sna->render.check_composite_spans(sna, op, src, dst, + clip.extents.x2 - clip.extents.x1, + clip.extents.y2 - clip.extents.y1, + COMPOSITE_SPANS_RECTILINEAR)) { + DBG(("%s: fallback -- composite spans not supported\n", + __FUNCTION__)); + goto fallback; + } + + c = NULL; + if (extents.x2 - extents.x1 > clip.extents.x2 - clip.extents.x1 || + extents.y2 - extents.y1 > clip.extents.y2 - clip.extents.y1) { + DBG(("%s: forcing clip\n", __FUNCTION__)); + c = &clip; + } + + extents = *RegionExtents(&clip); + dx = dst->pDrawable->x; + dy = dst->pDrawable->y; + + DBG(("%s: after clip -- extents (%d, %d), (%d, %d), delta=(%d, %d) src -> (%d, %d)\n", + __FUNCTION__, + extents.x1, extents.y1, + extents.x2, extents.y2, + dx, dy, + src_x + extents.x1 - dst_x - dx, + src_y + extents.y1 - dst_y - dy)); + + switch (op) { + case PictOpAdd: + case PictOpOver: + priv = sna_pixmap(get_drawable_pixmap(dst->pDrawable)); + assert(priv != NULL); + if (priv->clear && priv->clear_color == 0) { + DBG(("%s: converting %d to PictOpSrc\n", + __FUNCTION__, op)); + op = PictOpSrc; + } + break; + case PictOpIn: + priv = sna_pixmap(get_drawable_pixmap(dst->pDrawable)); + assert(priv != NULL); + if (priv->clear && priv->clear_color == 0) { + DBG(("%s: clear destination using In, skipping\n", + __FUNCTION__)); + return true; + } + break; + } + + if (!sna->render.composite_spans(sna, op, src, dst, + src_x + extents.x1 - dst_x - dx, + src_y + extents.y1 - dst_y - dy, + extents.x1, extents.y1, + extents.x2 - extents.x1, + extents.y2 - extents.y1, + COMPOSITE_SPANS_RECTILINEAR, + memset(&tmp, 0, sizeof(tmp)))) { + DBG(("%s: composite spans render op not supported\n", + __FUNCTION__)); + REGION_UNINIT(NULL, &clip); + goto fallback; + } + + for (n = 0; n < ntrap; n++) + composite_unaligned_trap(sna, &tmp, &traps[n], dx, dy, c); + tmp.done(sna, &tmp); + REGION_UNINIT(NULL, &clip); + return true; +} diff --git a/src/sna/sna_trapezoids_imprecise.c b/src/sna/sna_trapezoids_imprecise.c new file mode 100644 index 00000000..a0126b3d --- /dev/null +++ b/src/sna/sna_trapezoids_imprecise.c @@ -0,0 +1,4008 @@ +/* + * Copyright (c) 2007 David Turner + * Copyright (c) 2008 M Joonas Pihlaja + * Copyright (c) 2011 Intel Corporation + * + * Permission is hereby granted, free of charge, to any person obtaining a + * copy of this software and associated documentation files (the "Software"), + * to deal in the Software without restriction, including without limitation + * the rights to use, copy, modify, merge, publish, distribute, sublicense, + * and/or sell copies of the Software, and to permit persons to whom the + * Software is furnished to do so, subject to the following conditions: + * + * The above copyright notice and this permission notice (including the next + * paragraph) shall be included in all copies or substantial portions of the + * Software. + * + * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR + * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, + * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL + * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER + * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, + * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE + * SOFTWARE. + * + * Authors: + * Chris Wilson <chris@chris-wilson.co.uk> + * + */ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include "sna.h" +#include "sna_render.h" +#include "sna_render_inline.h" +#include "sna_trapezoids.h" +#include "fb/fbpict.h" + +#include <mipict.h> + +#undef SAMPLES_X +#undef SAMPLES_Y + +#if 0 +#define __DBG(x) ErrorF x +#else +#define __DBG(x) +#endif + +/* TODO: Emit unantialiased and MSAA triangles. */ + +#ifndef MAX +#define MAX(x,y) ((x) >= (y) ? (x) : (y)) +#endif + +#ifndef MIN +#define MIN(x,y) ((x) <= (y) ? (x) : (y)) +#endif + +typedef void (*span_func_t)(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage); + +#if HAS_DEBUG_FULL +static void _assert_pixmap_contains_box(PixmapPtr pixmap, BoxPtr box, const char *function) +{ + if (box->x1 < 0 || box->y1 < 0 || + box->x2 > pixmap->drawable.width || + box->y2 > pixmap->drawable.height) + { + ErrorF("%s: damage box is beyond the pixmap: box=(%d, %d), (%d, %d), pixmap=(%d, %d)\n", + __FUNCTION__, + box->x1, box->y1, box->x2, box->y2, + pixmap->drawable.width, + pixmap->drawable.height); + assert(0); + } +} +#define assert_pixmap_contains_box(p, b) _assert_pixmap_contains_box(p, b, __FUNCTION__) +#else +#define assert_pixmap_contains_box(p, b) +#endif + +static void apply_damage(struct sna_composite_op *op, RegionPtr region) +{ + DBG(("%s: damage=%p, region=%ldx[(%d, %d), (%d, %d)]\n", + __FUNCTION__, op->damage, + (long)REGION_NUM_RECTS(region), + region->extents.x1, region->extents.y1, + region->extents.x2, region->extents.y2)); + + if (op->damage == NULL) + return; + + RegionTranslate(region, op->dst.x, op->dst.y); + + assert_pixmap_contains_box(op->dst.pixmap, RegionExtents(region)); + sna_damage_add(op->damage, region); +} + +static void _apply_damage_box(struct sna_composite_op *op, const BoxRec *box) +{ + BoxRec r; + + r.x1 = box->x1 + op->dst.x; + r.x2 = box->x2 + op->dst.x; + r.y1 = box->y1 + op->dst.y; + r.y2 = box->y2 + op->dst.y; + + assert_pixmap_contains_box(op->dst.pixmap, &r); + sna_damage_add_box(op->damage, &r); +} + +inline static void apply_damage_box(struct sna_composite_op *op, const BoxRec *box) +{ + if (op->damage) + _apply_damage_box(op, box); +} + +#define FAST_SAMPLES_X_TO_INT_FRAC(x, i, f) \ + _GRID_TO_INT_FRAC_shift(x, i, f, FAST_SAMPLES_shift) + +#define FAST_SAMPLES_INT(x) ((x) >> (FAST_SAMPLES_shift)) +#define FAST_SAMPLES_FRAC(x) ((x) & (FAST_SAMPLES_mask)) + +#define _GRID_TO_INT_FRAC_shift(t, i, f, b) do { \ + (f) = FAST_SAMPLES_FRAC(t); \ + (i) = FAST_SAMPLES_INT(t); \ +} while (0) + +#define FAST_SAMPLES_XY (2*FAST_SAMPLES_X*FAST_SAMPLES_Y) /* Unit area on the grid. */ +#define AREA_TO_ALPHA(c) ((c) / (float)FAST_SAMPLES_XY) + +struct quorem { + int32_t quo; + int32_t rem; +}; + +struct edge { + struct edge *next, *prev; + + int dir; + + int height_left; + + struct quorem x; + + /* Advance of the current x when moving down a subsample line. */ + struct quorem dxdy; + int dy; + + /* The clipped y of the top of the edge. */ + int ytop; + + /* y2-y1 after orienting the edge downwards. */ +}; + +/* Number of subsample rows per y-bucket. Must be SAMPLES_Y. */ +#define EDGE_Y_BUCKET_HEIGHT FAST_SAMPLES_Y +#define EDGE_Y_BUCKET_INDEX(y, ymin) (((y) - (ymin))/EDGE_Y_BUCKET_HEIGHT) + +/* A collection of sorted and vertically clipped edges of the polygon. + * Edges are moved from the polygon to an active list while scan + * converting. */ +struct polygon { + /* The vertical clip extents. */ + int ymin, ymax; + + /* Array of edges all starting in the same bucket. An edge is put + * into bucket EDGE_BUCKET_INDEX(edge->ytop, polygon->ymin) when + * it is added to the polygon. */ + struct edge **y_buckets; + struct edge *y_buckets_embedded[64]; + + struct edge edges_embedded[32]; + struct edge *edges; + int num_edges; +}; + +/* A cell records the effect on pixel coverage of polygon edges + * passing through a pixel. It contains two accumulators of pixel + * coverage. + * + * Consider the effects of a polygon edge on the coverage of a pixel + * it intersects and that of the following one. The coverage of the + * following pixel is the height of the edge multiplied by the width + * of the pixel, and the coverage of the pixel itself is the area of + * the trapezoid formed by the edge and the right side of the pixel. + * + * +-----------------------+-----------------------+ + * | | | + * | | | + * |_______________________|_______________________| + * | \...................|.......................|\ + * | \..................|.......................| | + * | \.................|.......................| | + * | \....covered.....|.......................| | + * | \....area.......|.......................| } covered height + * | \..............|.......................| | + * |uncovered\.............|.......................| | + * | area \............|.......................| | + * |___________\...........|.......................|/ + * | | | + * | | | + * | | | + * +-----------------------+-----------------------+ + * + * Since the coverage of the following pixel will always be a multiple + * of the width of the pixel, we can store the height of the covered + * area instead. The coverage of the pixel itself is the total + * coverage minus the area of the uncovered area to the left of the + * edge. As it's faster to compute the uncovered area we only store + * that and subtract it from the total coverage later when forming + * spans to blit. + * + * The heights and areas are signed, with left edges of the polygon + * having positive sign and right edges having negative sign. When + * two edges intersect they swap their left/rightness so their + * contribution above and below the intersection point must be + * computed separately. */ +struct cell { + struct cell *next; + int x; + int16_t uncovered_area; + int16_t covered_height; +}; + +/* A cell list represents the scan line sparsely as cells ordered by + * ascending x. It is geared towards scanning the cells in order + * using an internal cursor. */ +struct cell_list { + struct cell *cursor; + + /* Points to the left-most cell in the scan line. */ + struct cell head, tail; + + int16_t x1, x2; + int16_t count, size; + struct cell *cells; + struct cell embedded[256]; +}; + +/* The active list contains edges in the current scan line ordered by + * the x-coordinate of the intercept of the edge and the scan line. */ +struct active_list { + /* Leftmost edge on the current scan line. */ + struct edge head, tail; + + /* A lower bound on the height of the active edges is used to + * estimate how soon some active edge ends. We can't advance the + * scan conversion by a full pixel row if an edge ends somewhere + * within it. */ + int min_height; + int is_vertical; +}; + +struct tor { + struct polygon polygon[1]; + struct active_list active[1]; + struct cell_list coverages[1]; + + /* Clip box. */ + int xmin, xmax; + int ymin, ymax; +}; + +/* Compute the floored division a/b. Assumes / and % perform symmetric + * division. */ +inline static struct quorem +floored_divrem(int a, int b) +{ + struct quorem qr; + assert(b>0); + qr.quo = a/b; + qr.rem = a%b; + if (qr.rem < 0) { + qr.quo -= 1; + qr.rem += b; + } + return qr; +} + +/* Compute the floored division (x*a)/b. Assumes / and % perform symmetric + * division. */ +static struct quorem +floored_muldivrem(int32_t x, int32_t a, int32_t b) +{ + struct quorem qr; + int64_t xa = (int64_t)x*a; + assert(b>0); + qr.quo = xa/b; + qr.rem = xa%b; + if (qr.rem < 0) { + qr.quo -= 1; + qr.rem += b; + } + return qr; +} + +/* Rewinds the cell list's cursor to the beginning. After rewinding + * we're good to cell_list_find() the cell any x coordinate. */ +inline static void +cell_list_rewind(struct cell_list *cells) +{ + cells->cursor = &cells->head; +} + +static bool +cell_list_init(struct cell_list *cells, int x1, int x2) +{ + cells->tail.next = NULL; + cells->tail.x = INT_MAX; + cells->head.x = INT_MIN; + cells->head.next = &cells->tail; + cells->head.covered_height = 0; + cell_list_rewind(cells); + cells->count = 0; + cells->x1 = x1; + cells->x2 = x2; + cells->size = x2 - x1 + 1; + cells->cells = cells->embedded; + if (cells->size > ARRAY_SIZE(cells->embedded)) + cells->cells = malloc(cells->size * sizeof(struct cell)); + return cells->cells != NULL; +} + +static void +cell_list_fini(struct cell_list *cells) +{ + if (cells->cells != cells->embedded) + free(cells->cells); +} + +inline static void +cell_list_reset(struct cell_list *cells) +{ + cell_list_rewind(cells); + cells->head.next = &cells->tail; + cells->head.covered_height = 0; + cells->count = 0; +} + +inline static struct cell * +cell_list_alloc(struct cell_list *cells, + struct cell *tail, + int x) +{ + struct cell *cell; + + assert(cells->count < cells->size); + cell = cells->cells + cells->count++; + cell->next = tail->next; + tail->next = cell; + + cell->x = x; + cell->covered_height = 0; + cell->uncovered_area = 0; + return cell; +} + +/* Find a cell at the given x-coordinate. Returns %NULL if a new cell + * needed to be allocated but couldn't be. Cells must be found with + * non-decreasing x-coordinate until the cell list is rewound using + * cell_list_rewind(). Ownership of the returned cell is retained by + * the cell list. */ +inline static struct cell * +cell_list_find(struct cell_list *cells, int x) +{ + struct cell *tail = cells->cursor; + + if (tail->x == x) + return tail; + + if (x >= cells->x2) + return &cells->tail; + + if (x < cells->x1) + return &cells->head; + + do { + if (tail->next->x > x) + break; + + tail = tail->next; + if (tail->next->x > x) + break; + + tail = tail->next; + if (tail->next->x > x) + break; + + tail = tail->next; + } while (1); + + if (tail->x != x) + tail = cell_list_alloc (cells, tail, x); + + return cells->cursor = tail; +} + +/* Add a subpixel span covering [x1, x2) to the coverage cells. */ +inline static void +cell_list_add_subspan(struct cell_list *cells, int x1, int x2) +{ + struct cell *cell; + int ix1, fx1; + int ix2, fx2; + + if (x1 == x2) + return; + + FAST_SAMPLES_X_TO_INT_FRAC(x1, ix1, fx1); + FAST_SAMPLES_X_TO_INT_FRAC(x2, ix2, fx2); + + __DBG(("%s: x1=%d (%d+%d), x2=%d (%d+%d)\n", __FUNCTION__, + x1, ix1, fx1, x2, ix2, fx2)); + + cell = cell_list_find(cells, ix1); + if (ix1 != ix2) { + cell->uncovered_area += 2*fx1; + ++cell->covered_height; + + cell = cell_list_find(cells, ix2); + cell->uncovered_area -= 2*fx2; + --cell->covered_height; + } else + cell->uncovered_area += 2*(fx1-fx2); +} + +inline static void +cell_list_add_span(struct cell_list *cells, int x1, int x2) +{ + struct cell *cell; + int ix1, fx1; + int ix2, fx2; + + FAST_SAMPLES_X_TO_INT_FRAC(x1, ix1, fx1); + FAST_SAMPLES_X_TO_INT_FRAC(x2, ix2, fx2); + + __DBG(("%s: x1=%d (%d+%d), x2=%d (%d+%d)\n", __FUNCTION__, + x1, ix1, fx1, x2, ix2, fx2)); + + cell = cell_list_find(cells, ix1); + if (ix1 != ix2) { + cell->uncovered_area += 2*fx1*FAST_SAMPLES_Y; + cell->covered_height += FAST_SAMPLES_Y; + + cell = cell_list_find(cells, ix2); + cell->uncovered_area -= 2*fx2*FAST_SAMPLES_Y; + cell->covered_height -= FAST_SAMPLES_Y; + } else + cell->uncovered_area += 2*(fx1-fx2)*FAST_SAMPLES_Y; +} + +static void +polygon_fini(struct polygon *polygon) +{ + if (polygon->y_buckets != polygon->y_buckets_embedded) + free(polygon->y_buckets); + + if (polygon->edges != polygon->edges_embedded) + free(polygon->edges); +} + +static bool +polygon_init(struct polygon *polygon, + int num_edges, + int ymin, + int ymax) +{ + unsigned num_buckets = + EDGE_Y_BUCKET_INDEX(ymax+EDGE_Y_BUCKET_HEIGHT-1, ymin); + + assert(ymax-ymin < 0x7FFFFFFFU - EDGE_Y_BUCKET_HEIGHT); + + polygon->edges = polygon->edges_embedded; + polygon->y_buckets = polygon->y_buckets_embedded; + + polygon->num_edges = 0; + if (num_edges > (int)ARRAY_SIZE(polygon->edges_embedded)) { + polygon->edges = malloc(sizeof(struct edge)*num_edges); + if (unlikely(NULL == polygon->edges)) + goto bail_no_mem; + } + + if (num_buckets >= ARRAY_SIZE(polygon->y_buckets_embedded)) { + polygon->y_buckets = malloc((1+num_buckets)*sizeof(struct edge *)); + if (unlikely(NULL == polygon->y_buckets)) + goto bail_no_mem; + } + memset(polygon->y_buckets, 0, num_buckets * sizeof(struct edge *)); + polygon->y_buckets[num_buckets] = (void *)-1; + + polygon->ymin = ymin; + polygon->ymax = ymax; + return true; + +bail_no_mem: + polygon_fini(polygon); + return false; +} + +static void +_polygon_insert_edge_into_its_y_bucket(struct polygon *polygon, struct edge *e) +{ + unsigned ix = EDGE_Y_BUCKET_INDEX(e->ytop, polygon->ymin); + struct edge **ptail = &polygon->y_buckets[ix]; + e->next = *ptail; + *ptail = e; +} + +inline static void +polygon_add_edge(struct polygon *polygon, + int x1, int x2, + int y1, int y2, + int top, int bottom, + int dir) +{ + struct edge *e = &polygon->edges[polygon->num_edges]; + int dx = x2 - x1; + int dy = y2 - y1; + int ytop, ybot; + int ymin = polygon->ymin; + int ymax = polygon->ymax; + + __DBG(("%s: edge=(%d [%d.%d], %d [%d.%d]), (%d [%d.%d], %d [%d.%d]), top=%d [%d.%d], bottom=%d [%d.%d], dir=%d\n", + __FUNCTION__, + x1, FAST_SAMPLES_INT(x1), FAST_SAMPLES_FRAC(x1), + y1, FAST_SAMPLES_INT(y1), FAST_SAMPLES_FRAC(y1), + x2, FAST_SAMPLES_INT(x2), FAST_SAMPLES_FRAC(x2), + y2, FAST_SAMPLES_INT(y2), FAST_SAMPLES_FRAC(y2), + top, FAST_SAMPLES_INT(top), FAST_SAMPLES_FRAC(top), + bottom, FAST_SAMPLES_INT(bottom), FAST_SAMPLES_FRAC(bottom), + dir)); + assert (dy > 0); + + e->dy = dy; + e->dir = dir; + + ytop = top >= ymin ? top : ymin; + ybot = bottom <= ymax ? bottom : ymax; + e->ytop = ytop; + e->height_left = ybot - ytop; + if (e->height_left <= 0) + return; + + if (dx == 0) { + e->x.quo = x1; + e->x.rem = 0; + e->dy = 0; + e->dxdy.quo = 0; + e->dxdy.rem = 0; + } else { + e->dxdy = floored_divrem(dx, dy); + if (ytop == y1) { + e->x.quo = x1; + e->x.rem = 0; + } else { + e->x = floored_muldivrem(ytop - y1, dx, dy); + e->x.quo += x1; + } + } + e->x.rem -= dy; /* Bias the remainder for faster edge advancement. */ + + _polygon_insert_edge_into_its_y_bucket(polygon, e); + polygon->num_edges++; +} + +inline static void +polygon_add_line(struct polygon *polygon, + const xPointFixed *p1, + const xPointFixed *p2) +{ + struct edge *e = &polygon->edges[polygon->num_edges]; + int dx = p2->x - p1->x; + int dy = p2->y - p1->y; + int top, bot; + + if (dy == 0) + return; + + __DBG(("%s: line=(%d, %d), (%d, %d)\n", + __FUNCTION__, (int)p1->x, (int)p1->y, (int)p2->x, (int)p2->y)); + + e->dir = 1; + if (dy < 0) { + const xPointFixed *t; + + dx = -dx; + dy = -dy; + + e->dir = -1; + + t = p1; + p1 = p2; + p2 = t; + } + assert (dy > 0); + e->dy = dy; + + top = MAX(p1->y, polygon->ymin); + bot = MIN(p2->y, polygon->ymax); + if (bot <= top) + return; + + e->ytop = top; + e->height_left = bot - top; + if (e->height_left <= 0) + return; + + if (dx == 0) { + e->x.quo = p1->x; + e->x.rem = -dy; + e->dxdy.quo = 0; + e->dxdy.rem = 0; + e->dy = 0; + } else { + e->dxdy = floored_divrem(dx, dy); + if (top == p1->y) { + e->x.quo = p1->x; + e->x.rem = -dy; + } else { + e->x = floored_muldivrem(top - p1->y, dx, dy); + e->x.quo += p1->x; + e->x.rem -= dy; + } + } + + if (polygon->num_edges > 0) { + struct edge *prev = &polygon->edges[polygon->num_edges-1]; + /* detect degenerate triangles inserted into tristrips */ + if (e->dir == -prev->dir && + e->ytop == prev->ytop && + e->height_left == prev->height_left && + e->x.quo == prev->x.quo && + e->x.rem == prev->x.rem && + e->dxdy.quo == prev->dxdy.quo && + e->dxdy.rem == prev->dxdy.rem) { + unsigned ix = EDGE_Y_BUCKET_INDEX(e->ytop, + polygon->ymin); + polygon->y_buckets[ix] = prev->next; + polygon->num_edges--; + return; + } + } + + _polygon_insert_edge_into_its_y_bucket(polygon, e); + polygon->num_edges++; +} + +static void +active_list_reset(struct active_list *active) +{ + active->head.height_left = INT_MAX; + active->head.x.quo = INT_MIN; + active->head.dy = 0; + active->head.prev = NULL; + active->head.next = &active->tail; + active->tail.prev = &active->head; + active->tail.next = NULL; + active->tail.x.quo = INT_MAX; + active->tail.height_left = INT_MAX; + active->tail.dy = 0; + active->min_height = INT_MAX; + active->is_vertical = 1; +} + +static struct edge * +merge_sorted_edges(struct edge *head_a, struct edge *head_b) +{ + struct edge *head, **next, *prev; + int32_t x; + + if (head_b == NULL) + return head_a; + + prev = head_a->prev; + next = &head; + if (head_a->x.quo <= head_b->x.quo) { + head = head_a; + } else { + head = head_b; + head_b->prev = prev; + goto start_with_b; + } + + do { + x = head_b->x.quo; + while (head_a != NULL && head_a->x.quo <= x) { + prev = head_a; + next = &head_a->next; + head_a = head_a->next; + } + + head_b->prev = prev; + *next = head_b; + if (head_a == NULL) + return head; + +start_with_b: + x = head_a->x.quo; + while (head_b != NULL && head_b->x.quo <= x) { + prev = head_b; + next = &head_b->next; + head_b = head_b->next; + } + + head_a->prev = prev; + *next = head_a; + if (head_b == NULL) + return head; + } while (1); +} + +static struct edge * +sort_edges(struct edge *list, + unsigned int level, + struct edge **head_out) +{ + struct edge *head_other, *remaining; + unsigned int i; + + head_other = list->next; + if (head_other == NULL) { + *head_out = list; + return NULL; + } + + remaining = head_other->next; + if (list->x.quo <= head_other->x.quo) { + *head_out = list; + head_other->next = NULL; + } else { + *head_out = head_other; + head_other->prev = list->prev; + head_other->next = list; + list->prev = head_other; + list->next = NULL; + } + + for (i = 0; i < level && remaining; i++) { + remaining = sort_edges(remaining, i, &head_other); + *head_out = merge_sorted_edges(*head_out, head_other); + } + + return remaining; +} + +static struct edge *filter(struct edge *edges) +{ + struct edge *e; + + e = edges; + do { + struct edge *n = e->next; + if (e->dir == -n->dir && + e->height_left == n->height_left && + *(uint64_t *)&e->x == *(uint64_t *)&n->x && + *(uint64_t *)&e->dxdy == *(uint64_t *)&n->dxdy) { + if (e->prev) + e->prev->next = n->next; + else + edges = n->next; + if (n->next) + n->next->prev = e->prev; + else + break; + + e = n->next; + } else + e = e->next; + } while (e->next); + + return edges; +} + +static struct edge * +merge_unsorted_edges (struct edge *head, struct edge *unsorted) +{ + sort_edges (unsorted, UINT_MAX, &unsorted); + return merge_sorted_edges (head, filter(unsorted)); +} + +/* Test if the edges on the active list can be safely advanced by a + * full row without intersections or any edges ending. */ +inline static bool +can_full_step(struct active_list *active) +{ + /* Recomputes the minimum height of all edges on the active + * list if we have been dropping edges. */ + if (active->min_height <= 0) { + const struct edge *e; + int min_height = INT_MAX; + int is_vertical = 1; + + for (e = active->head.next; &active->tail != e; e = e->next) { + if (e->height_left < min_height) + min_height = e->height_left; + if (is_vertical) + is_vertical = e->dy == 0; + } + + active->is_vertical = is_vertical; + active->min_height = min_height; + } + + if (active->min_height < FAST_SAMPLES_Y) + return false; + + return active->is_vertical; +} + +inline static void +merge_edges(struct active_list *active, struct edge *edges) +{ + active->head.next = merge_unsorted_edges (active->head.next, edges); +} + +inline static void +fill_buckets(struct active_list *active, + struct edge *edge, + struct edge **buckets) +{ + int min_height = active->min_height; + int is_vertical = active->is_vertical; + + while (edge) { + struct edge *next = edge->next; + struct edge **b = &buckets[edge->ytop & (FAST_SAMPLES_Y-1)]; + if (*b) + (*b)->prev = edge; + edge->next = *b; + edge->prev = NULL; + *b = edge; + if (edge->height_left < min_height) + min_height = edge->height_left; + if (is_vertical) + is_vertical = edge->dy == 0; + edge = next; + } + + active->is_vertical = is_vertical; + active->min_height = min_height; +} + +inline static void +nonzero_subrow(struct active_list *active, struct cell_list *coverages) +{ + struct edge *edge = active->head.next; + int prev_x = INT_MIN; + int winding = 0, xstart = edge->x.quo; + + cell_list_rewind(coverages); + + while (&active->tail != edge) { + struct edge *next = edge->next; + + winding += edge->dir; + if (0 == winding && edge->next->x.quo != edge->x.quo) { + cell_list_add_subspan(coverages, + xstart, edge->x.quo); + xstart = edge->next->x.quo; + } + + if (--edge->height_left) { + if (edge->dy) { + edge->x.quo += edge->dxdy.quo; + edge->x.rem += edge->dxdy.rem; + if (edge->x.rem >= 0) { + ++edge->x.quo; + edge->x.rem -= edge->dy; + } + } + + if (edge->x.quo < prev_x) { + struct edge *pos = edge->prev; + pos->next = next; + next->prev = pos; + do { + pos = pos->prev; + } while (edge->x.quo < pos->x.quo); + pos->next->prev = edge; + edge->next = pos->next; + edge->prev = pos; + pos->next = edge; + } else + prev_x = edge->x.quo; + } else { + edge->prev->next = next; + next->prev = edge->prev; + active->min_height = -1; + } + + edge = next; + } +} + +static void +nonzero_row(struct active_list *active, struct cell_list *coverages) +{ + struct edge *left = active->head.next; + + assert(active->is_vertical); + + while (&active->tail != left) { + struct edge *right; + int winding = left->dir; + + left->height_left -= FAST_SAMPLES_Y; + if (! left->height_left) { + left->prev->next = left->next; + left->next->prev = left->prev; + } + + right = left->next; + do { + right->height_left -= FAST_SAMPLES_Y; + if (!right->height_left) { + right->prev->next = right->next; + right->next->prev = right->prev; + } + + winding += right->dir; + if (0 == winding) + break; + + right = right->next; + } while (1); + + cell_list_add_span(coverages, left->x.quo, right->x.quo); + left = right->next; + } +} + +static void +tor_fini(struct tor *converter) +{ + polygon_fini(converter->polygon); + cell_list_fini(converter->coverages); +} + +static bool +tor_init(struct tor *converter, const BoxRec *box, int num_edges) +{ + __DBG(("%s: (%d, %d),(%d, %d) x (%d, %d), num_edges=%d\n", + __FUNCTION__, + box->x1, box->y1, box->x2, box->y2, + FAST_SAMPLES_X, FAST_SAMPLES_Y, + num_edges)); + + converter->xmin = box->x1; + converter->ymin = box->y1; + converter->xmax = box->x2; + converter->ymax = box->y2; + + if (!cell_list_init(converter->coverages, box->x1, box->x2)) + return false; + + active_list_reset(converter->active); + if (!polygon_init(converter->polygon, num_edges, + box->y1 * FAST_SAMPLES_Y, + box->y2 * FAST_SAMPLES_Y)) { + cell_list_fini(converter->coverages); + return false; + } + + return true; +} + +static void +tor_add_edge(struct tor *converter, + const xTrapezoid *t, + const xLineFixed *edge, + int dir) +{ + polygon_add_edge(converter->polygon, + edge->p1.x, edge->p2.x, + edge->p1.y, edge->p2.y, + t->top, t->bottom, + dir); +} + +static void +step_edges(struct active_list *active, int count) +{ + struct edge *edge; + + count *= FAST_SAMPLES_Y; + for (edge = active->head.next; edge != &active->tail; edge = edge->next) { + edge->height_left -= count; + if (!edge->height_left) { + edge->prev->next = edge->next; + edge->next->prev = edge->prev; + } + } +} + +static void +tor_blt_span(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage) +{ + __DBG(("%s: %d -> %d @ %d\n", __FUNCTION__, box->x1, box->x2, coverage)); + + op->box(sna, op, box, AREA_TO_ALPHA(coverage)); + apply_damage_box(&op->base, box); +} + +static void +tor_blt_span__no_damage(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage) +{ + __DBG(("%s: %d -> %d @ %d\n", __FUNCTION__, box->x1, box->x2, coverage)); + + op->box(sna, op, box, AREA_TO_ALPHA(coverage)); +} + +static void +tor_blt_span_clipped(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage) +{ + pixman_region16_t region; + float opacity; + + opacity = AREA_TO_ALPHA(coverage); + __DBG(("%s: %d -> %d @ %f\n", __FUNCTION__, box->x1, box->x2, opacity)); + + pixman_region_init_rects(®ion, box, 1); + RegionIntersect(®ion, ®ion, clip); + if (REGION_NUM_RECTS(®ion)) { + op->boxes(sna, op, + REGION_RECTS(®ion), + REGION_NUM_RECTS(®ion), + opacity); + apply_damage(&op->base, ®ion); + } + pixman_region_fini(®ion); +} + +static void +tor_blt_span_mono(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage) +{ + if (coverage < FAST_SAMPLES_XY/2) + return; + + tor_blt_span(sna, op, clip, box, FAST_SAMPLES_XY); +} + +static void +tor_blt_span_mono_clipped(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage) +{ + if (coverage < FAST_SAMPLES_XY/2) + return; + + tor_blt_span_clipped(sna, op, clip, box, FAST_SAMPLES_XY); +} + +static void +tor_blt_span_mono_unbounded(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage) +{ + tor_blt_span(sna, op, clip, box, + coverage < FAST_SAMPLES_XY/2 ? 0 : FAST_SAMPLES_XY); +} + +static void +tor_blt_span_mono_unbounded_clipped(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage) +{ + tor_blt_span_clipped(sna, op, clip, box, + coverage < FAST_SAMPLES_XY/2 ? 0 : FAST_SAMPLES_XY); +} + +static void +tor_blt(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + void (*span)(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage), + struct cell_list *cells, + int y, int height, + int xmin, int xmax, + int unbounded) +{ + struct cell *cell; + BoxRec box; + int cover; + + box.y1 = y; + box.y2 = y + height; + box.x1 = xmin; + + /* Form the spans from the coverages and areas. */ + cover = cells->head.covered_height*FAST_SAMPLES_X*2; + assert(cover >= 0); + for (cell = cells->head.next; cell != &cells->tail; cell = cell->next) { + int x = cell->x; + + assert(x >= xmin); + assert(x < xmax); + __DBG(("%s: cell=(%d, %d, %d), cover=%d, max=%d\n", __FUNCTION__, + cell->x, cell->covered_height, cell->uncovered_area, + cover, xmax)); + + if (cell->covered_height || cell->uncovered_area) { + box.x2 = x; + if (box.x2 > box.x1 && (unbounded || cover)) { + __DBG(("%s: span (%d, %d)x(%d, %d) @ %d\n", __FUNCTION__, + box.x1, box.y1, + box.x2 - box.x1, + box.y2 - box.y1, + cover)); + span(sna, op, clip, &box, cover); + } + box.x1 = box.x2; + cover += cell->covered_height*FAST_SAMPLES_X*2; + } + + if (cell->uncovered_area) { + int area = cover - cell->uncovered_area; + box.x2 = x + 1; + if (unbounded || area) { + __DBG(("%s: span (%d, %d)x(%d, %d) @ %d\n", __FUNCTION__, + box.x1, box.y1, + box.x2 - box.x1, + box.y2 - box.y1, + area)); + span(sna, op, clip, &box, area); + } + box.x1 = box.x2; + } + } + + box.x2 = xmax; + if (box.x2 > box.x1 && (unbounded || cover)) { + __DBG(("%s: span (%d, %d)x(%d, %d) @ %d\n", __FUNCTION__, + box.x1, box.y1, + box.x2 - box.x1, + box.y2 - box.y1, + cover)); + span(sna, op, clip, &box, cover); + } +} + +static void +tor_blt_empty(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + void (*span)(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage), + int y, int height, + int xmin, int xmax) +{ + BoxRec box; + + box.x1 = xmin; + box.x2 = xmax; + box.y1 = y; + box.y2 = y + height; + + span(sna, op, clip, &box, 0); +} + +flatten static void +tor_render(struct sna *sna, + struct tor *converter, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + void (*span)(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage), + int unbounded) +{ + int ymin = converter->ymin; + int xmin = converter->xmin; + int xmax = converter->xmax; + int i, j, h = converter->ymax - ymin; + struct polygon *polygon = converter->polygon; + struct cell_list *coverages = converter->coverages; + struct active_list *active = converter->active; + struct edge *buckets[FAST_SAMPLES_Y] = { 0 }; + + __DBG(("%s: unbounded=%d\n", __FUNCTION__, unbounded)); + + /* Render each pixel row. */ + for (i = 0; i < h; i = j) { + int do_full_step = 0; + + j = i + 1; + + /* Determine if we can ignore this row or use the full pixel + * stepper. */ + if (!polygon->y_buckets[i]) { + if (active->head.next == &active->tail) { + active->min_height = INT_MAX; + active->is_vertical = 1; + for (; !polygon->y_buckets[j]; j++) + ; + __DBG(("%s: no new edges and no exisiting edges, skipping, %d -> %d\n", + __FUNCTION__, i, j)); + + if (unbounded) + tor_blt_empty(sna, op, clip, span, i+ymin, j-i, xmin, xmax); + continue; + } + + do_full_step = can_full_step(active); + } + + __DBG(("%s: y=%d [%d], do_full_step=%d, new edges=%d, min_height=%d, vertical=%d\n", + __FUNCTION__, + i, i+ymin, do_full_step, + polygon->y_buckets[i] != NULL, + active->min_height, + active->is_vertical)); + if (do_full_step) { + assert(active->is_vertical); + nonzero_row(active, coverages); + + while (polygon->y_buckets[j] == NULL && + active->min_height >= 2*FAST_SAMPLES_Y) { + active->min_height -= FAST_SAMPLES_Y; + j++; + } + if (j != i + 1) + step_edges(active, j - (i + 1)); + + __DBG(("%s: vertical edges, full step (%d, %d)\n", + __FUNCTION__, i, j)); + } else { + int suby; + + fill_buckets(active, polygon->y_buckets[i], buckets); + + /* Subsample this row. */ + for (suby = 0; suby < FAST_SAMPLES_Y; suby++) { + if (buckets[suby]) { + merge_edges(active, buckets[suby]); + buckets[suby] = NULL; + } + + nonzero_subrow(active, coverages); + } + } + + tor_blt(sna, op, clip, span, coverages, + i+ymin, j-i, xmin, xmax, + unbounded); + cell_list_reset(coverages); + + active->min_height -= FAST_SAMPLES_Y; + } +} + +static void +inplace_row(struct active_list *active, uint8_t *row, int width) +{ + struct edge *left = active->head.next; + + assert(active->is_vertical); + + while (&active->tail != left) { + struct edge *right; + int winding = left->dir; + int lfx, rfx; + int lix, rix; + + left->height_left -= FAST_SAMPLES_Y; + if (!left->height_left) { + left->prev->next = left->next; + left->next->prev = left->prev; + } + + right = left->next; + do { + right->height_left -= FAST_SAMPLES_Y; + if (!right->height_left) { + right->prev->next = right->next; + right->next->prev = right->prev; + } + + winding += right->dir; + if (0 == winding && right->x.quo != right->next->x.quo) + break; + + right = right->next; + } while (1); + + if (left->x.quo < 0) { + lix = lfx = 0; + } else if (left->x.quo >= width * FAST_SAMPLES_X) { + lix = width; + lfx = 0; + } else + FAST_SAMPLES_X_TO_INT_FRAC(left->x.quo, lix, lfx); + + if (right->x.quo < 0) { + rix = rfx = 0; + } else if (right->x.quo >= width * FAST_SAMPLES_X) { + rix = width; + rfx = 0; + } else + FAST_SAMPLES_X_TO_INT_FRAC(right->x.quo, rix, rfx); + if (lix == rix) { + if (rfx != lfx) { + assert(lix < width); + row[lix] += (rfx-lfx) * 256 / FAST_SAMPLES_X; + } + } else { + assert(lix < width); + if (lfx == 0) + row[lix] = 0xff; + else + row[lix] += 256 - lfx * 256 / FAST_SAMPLES_X; + + assert(rix <= width); + if (rfx) { + assert(rix < width); + row[rix] += rfx * 256 / FAST_SAMPLES_X; + } + + if (rix > ++lix) { + uint8_t *r = row + lix; + rix -= lix; +#if 0 + if (rix == 1) + *row = 0xff; + else + memset(row, 0xff, rix); +#else + if ((uintptr_t)r & 1 && rix) { + *r++ = 0xff; + rix--; + } + if ((uintptr_t)r & 2 && rix >= 2) { + *(uint16_t *)r = 0xffff; + r += 2; + rix -= 2; + } + if ((uintptr_t)r & 4 && rix >= 4) { + *(uint32_t *)r = 0xffffffff; + r += 4; + rix -= 4; + } + while (rix >= 8) { + *(uint64_t *)r = 0xffffffffffffffff; + r += 8; + rix -= 8; + } + if (rix & 4) { + *(uint32_t *)r = 0xffffffff; + r += 4; + } + if (rix & 2) { + *(uint16_t *)r = 0xffff; + r += 2; + } + if (rix & 1) + *r = 0xff; +#endif + } + } + + left = right->next; + } +} + +inline static void +inplace_subrow(struct active_list *active, int8_t *row, + int width, int *min, int *max) +{ + struct edge *edge = active->head.next; + int prev_x = INT_MIN; + int winding = 0, xstart = INT_MIN; + + while (&active->tail != edge) { + struct edge *next = edge->next; + + winding += edge->dir; + if (0 == winding) { + if (edge->next->x.quo != edge->x.quo) { + if (edge->x.quo <= xstart) { + xstart = INT_MIN; + } else { + int fx; + int ix; + + if (xstart < FAST_SAMPLES_X * width) { + FAST_SAMPLES_X_TO_INT_FRAC(xstart, ix, fx); + if (ix < *min) + *min = ix; + + row[ix++] += FAST_SAMPLES_X - fx; + if (fx && ix < width) + row[ix] += fx; + } + + xstart = edge->x.quo; + if (xstart < FAST_SAMPLES_X * width) { + FAST_SAMPLES_X_TO_INT_FRAC(xstart, ix, fx); + row[ix] -= FAST_SAMPLES_X - fx; + if (fx && ix + 1 < width) + row[++ix] -= fx; + + if (ix >= *max) + *max = ix + 1; + + xstart = INT_MIN; + } else + *max = width; + } + } + } else if (xstart < 0) { + xstart = MAX(edge->x.quo, 0); + } + + if (--edge->height_left) { + if (edge->dy) { + edge->x.quo += edge->dxdy.quo; + edge->x.rem += edge->dxdy.rem; + if (edge->x.rem >= 0) { + ++edge->x.quo; + edge->x.rem -= edge->dy; + } + } + + if (edge->x.quo < prev_x) { + struct edge *pos = edge->prev; + pos->next = next; + next->prev = pos; + do { + pos = pos->prev; + } while (edge->x.quo < pos->x.quo); + pos->next->prev = edge; + edge->next = pos->next; + edge->prev = pos; + pos->next = edge; + } else + prev_x = edge->x.quo; + } else { + edge->prev->next = next; + next->prev = edge->prev; + active->min_height = -1; + } + + edge = next; + } +} + +inline static void +inplace_end_subrows(struct active_list *active, uint8_t *row, + int8_t *buf, int width) +{ + int cover = 0; + + while (width >= 4) { + uint32_t dw; + int v; + + dw = *(uint32_t *)buf; + buf += 4; + + if (dw == 0) { + v = cover * 256 / (FAST_SAMPLES_X * FAST_SAMPLES_Y); + v -= v >> 8; + v |= v << 8; + dw = v | v << 16; + } else { + cover += (int8_t)(dw & 0xff); + if (cover) { + assert(cover > 0); + v = cover * 256 / (FAST_SAMPLES_X * FAST_SAMPLES_Y); + v -= v >> 8; + dw >>= 8; + dw |= v << 24; + } else + dw >>= 8; + + cover += (int8_t)(dw & 0xff); + if (cover) { + assert(cover > 0); + v = cover * 256 / (FAST_SAMPLES_X * FAST_SAMPLES_Y); + v -= v >> 8; + dw >>= 8; + dw |= v << 24; + } else + dw >>= 8; + + cover += (int8_t)(dw & 0xff); + if (cover) { + assert(cover > 0); + v = cover * 256 / (FAST_SAMPLES_X * FAST_SAMPLES_Y); + v -= v >> 8; + dw >>= 8; + dw |= v << 24; + } else + dw >>= 8; + + cover += (int8_t)(dw & 0xff); + if (cover) { + assert(cover > 0); + v = cover * 256 / (FAST_SAMPLES_X * FAST_SAMPLES_Y); + v -= v >> 8; + dw >>= 8; + dw |= v << 24; + } else + dw >>= 8; + } + + *(uint32_t *)row = dw; + row += 4; + width -= 4; + } + + while (width--) { + int v; + + cover += *buf++; + assert(cover >= 0); + + v = cover * 256 / (FAST_SAMPLES_X * FAST_SAMPLES_Y); + v -= v >> 8; + *row++ = v; + } +} + +static void +tor_inplace(struct tor *converter, PixmapPtr scratch, int mono, uint8_t *buf) +{ + int i, j, h = converter->ymax; + struct polygon *polygon = converter->polygon; + struct active_list *active = converter->active; + struct edge *buckets[FAST_SAMPLES_Y] = { 0 }; + uint8_t *row = scratch->devPrivate.ptr; + int stride = scratch->devKind; + int width = scratch->drawable.width; + + __DBG(("%s: mono=%d, buf?=%d\n", __FUNCTION__, mono, buf != NULL)); + assert(!mono); + assert(converter->ymin == 0); + assert(converter->xmin == 0); + assert(scratch->drawable.depth == 8); + + /* Render each pixel row. */ + for (i = 0; i < h; i = j) { + int do_full_step = 0; + void *ptr = buf ?: row; + + j = i + 1; + + /* Determine if we can ignore this row or use the full pixel + * stepper. */ + if (!polygon->y_buckets[i]) { + if (active->head.next == &active->tail) { + active->min_height = INT_MAX; + active->is_vertical = 1; + for (; !polygon->y_buckets[j]; j++) + ; + __DBG(("%s: no new edges and no exisiting edges, skipping, %d -> %d\n", + __FUNCTION__, i, j)); + + memset(row, 0, stride*(j-i)); + row += stride*(j-i); + continue; + } + + do_full_step = can_full_step(active); + } + + __DBG(("%s: y=%d, do_full_step=%d, new edges=%d, min_height=%d, vertical=%d\n", + __FUNCTION__, + i, do_full_step, + polygon->y_buckets[i] != NULL, + active->min_height, + active->is_vertical)); + if (do_full_step) { + assert(active->is_vertical); + + memset(ptr, 0, width); + inplace_row(active, ptr, width); + if (row != ptr) + memcpy(row, ptr, width); + + while (polygon->y_buckets[j] == NULL && + active->min_height >= 2*FAST_SAMPLES_Y) + { + active->min_height -= FAST_SAMPLES_Y; + row += stride; + memcpy(row, ptr, width); + j++; + } + if (j != i + 1) + step_edges(active, j - (i + 1)); + + __DBG(("%s: vertical edges, full step (%d, %d)\n", + __FUNCTION__, i, j)); + } else { + int min = width, max = 0, suby; + + fill_buckets(active, polygon->y_buckets[i], buckets); + + /* Subsample this row. */ + memset(ptr, 0, width); + for (suby = 0; suby < FAST_SAMPLES_Y; suby++) { + if (buckets[suby]) { + merge_edges(active, buckets[suby]); + buckets[suby] = NULL; + } + + inplace_subrow(active, ptr, width, &min, &max); + } + assert(min >= 0 && max <= width); + memset(row, 0, min); + if (max > min) + inplace_end_subrows(active, row+min, (int8_t*)ptr+min, max-min); + if (max < width) + memset(row+max, 0, width-max); + } + + active->min_height -= FAST_SAMPLES_Y; + row += stride; + } +} + +static int operator_is_bounded(uint8_t op) +{ + switch (op) { + case PictOpOver: + case PictOpOutReverse: + case PictOpAdd: + return true; + default: + return false; + } +} + +static inline bool +project_trapezoid_onto_grid(const xTrapezoid *in, + int dx, int dy, + xTrapezoid *out) +{ + __DBG(("%s: in: L:(%d, %d), (%d, %d); R:(%d, %d), (%d, %d), [%d, %d]\n", + __FUNCTION__, + in->left.p1.x, in->left.p1.y, in->left.p2.x, in->left.p2.y, + in->right.p1.x, in->right.p1.y, in->right.p2.x, in->right.p2.y, + in->top, in->bottom)); + + out->left.p1.x = dx + pixman_fixed_to_grid(in->left.p1.x); + out->left.p1.y = dy + pixman_fixed_to_grid(in->left.p1.y); + out->left.p2.x = dx + pixman_fixed_to_grid(in->left.p2.x); + out->left.p2.y = dy + pixman_fixed_to_grid(in->left.p2.y); + + out->right.p1.x = dx + pixman_fixed_to_grid(in->right.p1.x); + out->right.p1.y = dy + pixman_fixed_to_grid(in->right.p1.y); + out->right.p2.x = dx + pixman_fixed_to_grid(in->right.p2.x); + out->right.p2.y = dy + pixman_fixed_to_grid(in->right.p2.y); + + out->top = dy + pixman_fixed_to_grid(in->top); + out->bottom = dy + pixman_fixed_to_grid(in->bottom); + + __DBG(("%s: out: L:(%d, %d), (%d, %d); R:(%d, %d), (%d, %d), [%d, %d]\n", + __FUNCTION__, + out->left.p1.x, out->left.p1.y, out->left.p2.x, out->left.p2.y, + out->right.p1.x, out->right.p1.y, out->right.p2.x, out->right.p2.y, + out->top, out->bottom)); + + return xTrapezoidValid(out); +} + +static span_func_t +choose_span(struct sna_composite_spans_op *tmp, + PicturePtr dst, + PictFormatPtr maskFormat, + RegionPtr clip) +{ + span_func_t span; + + if (is_mono(dst, maskFormat)) { + /* XXX An imprecise approximation */ + if (maskFormat && !operator_is_bounded(tmp->base.op)) { + span = tor_blt_span_mono_unbounded; + if (clip->data) + span = tor_blt_span_mono_unbounded_clipped; + } else { + span = tor_blt_span_mono; + if (clip->data) + span = tor_blt_span_mono_clipped; + } + } else { + if (clip->data) + span = tor_blt_span_clipped; + else if (tmp->base.damage == NULL) + span = tor_blt_span__no_damage; + else + span = tor_blt_span; + } + + return span; +} + +struct span_thread { + struct sna *sna; + const struct sna_composite_spans_op *op; + const xTrapezoid *traps; + RegionPtr clip; + span_func_t span; + BoxRec extents; + int dx, dy, draw_y; + int ntrap; + bool unbounded; +}; + +#define SPAN_THREAD_MAX_BOXES (8192/sizeof(struct sna_opacity_box)) +struct span_thread_boxes { + const struct sna_composite_spans_op *op; + struct sna_opacity_box boxes[SPAN_THREAD_MAX_BOXES]; + int num_boxes; +}; + +static void span_thread_add_boxes(struct sna *sna, void *data, + const BoxRec *box, int count, float alpha) +{ + struct span_thread_boxes *b = data; + + __DBG(("%s: adding %d boxes with alpha=%f\n", + __FUNCTION__, count, alpha)); + + assert(count > 0 && count <= SPAN_THREAD_MAX_BOXES); + if (unlikely(b->num_boxes + count > SPAN_THREAD_MAX_BOXES)) { + DBG(("%s: flushing %d boxes, adding %d\n", __FUNCTION__, b->num_boxes, count)); + assert(b->num_boxes <= SPAN_THREAD_MAX_BOXES); + b->op->thread_boxes(sna, b->op, b->boxes, b->num_boxes); + b->num_boxes = 0; + } + + do { + b->boxes[b->num_boxes].box = *box++; + b->boxes[b->num_boxes].alpha = alpha; + b->num_boxes++; + } while (--count); + assert(b->num_boxes <= SPAN_THREAD_MAX_BOXES); +} + +static void +span_thread_box(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage) +{ + __DBG(("%s: %d -> %d @ %d\n", __FUNCTION__, box->x1, box->x2, coverage)); + span_thread_add_boxes(sna, op, box, 1, AREA_TO_ALPHA(coverage)); +} + +static void +span_thread_clipped_box(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage) +{ + pixman_region16_t region; + + __DBG(("%s: %d -> %d @ %f\n", __FUNCTION__, box->x1, box->x2, + AREA_TO_ALPHA(coverage))); + + pixman_region_init_rects(®ion, box, 1); + RegionIntersect(®ion, ®ion, clip); + if (REGION_NUM_RECTS(®ion)) { + span_thread_add_boxes(sna, op, + REGION_RECTS(®ion), + REGION_NUM_RECTS(®ion), + AREA_TO_ALPHA(coverage)); + } + pixman_region_fini(®ion); +} + +static span_func_t +thread_choose_span(struct sna_composite_spans_op *tmp, + PicturePtr dst, + PictFormatPtr maskFormat, + RegionPtr clip) +{ + span_func_t span; + + if (tmp->base.damage) { + DBG(("%s: damaged -> no thread support\n", __FUNCTION__)); + return NULL; + } + + if (is_mono(dst, maskFormat)) { + DBG(("%s: mono rendering -> no thread support\n", __FUNCTION__)); + return NULL; + } else { + assert(tmp->thread_boxes); + DBG(("%s: clipped? %d\n", __FUNCTION__, clip->data != NULL)); + if (clip->data) + span = span_thread_clipped_box; + else + span = span_thread_box; + } + + return span; +} + +static void +span_thread(void *arg) +{ + struct span_thread *thread = arg; + struct span_thread_boxes boxes; + struct tor tor; + const xTrapezoid *t; + int n, y1, y2; + + if (!tor_init(&tor, &thread->extents, 2*thread->ntrap)) + return; + + boxes.op = thread->op; + boxes.num_boxes = 0; + + y1 = thread->extents.y1 - thread->draw_y; + y2 = thread->extents.y2 - thread->draw_y; + for (n = thread->ntrap, t = thread->traps; n--; t++) { + xTrapezoid tt; + + if (pixman_fixed_integer_floor(t->top) >= y2 || + pixman_fixed_integer_ceil(t->bottom) <= y1) + continue; + + if (!project_trapezoid_onto_grid(t, thread->dx, thread->dy, &tt)) + continue; + + tor_add_edge(&tor, &tt, &tt.left, 1); + tor_add_edge(&tor, &tt, &tt.right, -1); + } + + tor_render(thread->sna, &tor, + (struct sna_composite_spans_op *)&boxes, thread->clip, + thread->span, thread->unbounded); + + tor_fini(&tor); + + if (boxes.num_boxes) { + DBG(("%s: flushing %d boxes\n", __FUNCTION__, boxes.num_boxes)); + assert(boxes.num_boxes <= SPAN_THREAD_MAX_BOXES); + thread->op->thread_boxes(thread->sna, thread->op, + boxes.boxes, boxes.num_boxes); + } +} + +bool +trapezoid_span_converter(struct sna *sna, + CARD8 op, PicturePtr src, PicturePtr dst, + PictFormatPtr maskFormat, unsigned int flags, + INT16 src_x, INT16 src_y, + int ntrap, xTrapezoid *traps) +{ + struct sna_composite_spans_op tmp; + pixman_region16_t clip; + int16_t dst_x, dst_y; + bool was_clear; + int dx, dy, n; + int num_threads; + + if (NO_SCAN_CONVERTER) + return false; + + if (is_mono(dst, maskFormat)) + return mono_trapezoids_span_converter(sna, op, src, dst, + src_x, src_y, + ntrap, traps); + + /* XXX strict adherence to the Render specification */ + if (dst->polyMode == PolyModePrecise) { + DBG(("%s: fallback -- precise rasterisation requested\n", + __FUNCTION__)); + return false; + } + + if (!sna->render.check_composite_spans(sna, op, src, dst, 0, 0, flags)) { + DBG(("%s: fallback -- composite spans not supported\n", + __FUNCTION__)); + return false; + } + + if (!trapezoids_bounds(ntrap, traps, &clip.extents)) + return true; + +#if 0 + if (clip.extents.y2 - clip.extents.y1 < 64 && + clip.extents.x2 - clip.extents.x1 < 64) { + DBG(("%s: fallback -- traps extents too small %dx%d\n", + __FUNCTION__, extents.y2 - extents.y1, extents.x2 - extents.x1)); + return false; + } +#endif + + DBG(("%s: extents (%d, %d), (%d, %d)\n", + __FUNCTION__, + clip.extents.x1, clip.extents.y1, + clip.extents.x2, clip.extents.y2)); + + trapezoid_origin(&traps[0].left, &dst_x, &dst_y); + + if (!sna_compute_composite_region(&clip, + src, NULL, dst, + src_x + clip.extents.x1 - dst_x, + src_y + clip.extents.y1 - dst_y, + 0, 0, + clip.extents.x1, clip.extents.y1, + clip.extents.x2 - clip.extents.x1, + clip.extents.y2 - clip.extents.y1)) { + DBG(("%s: trapezoids do not intersect drawable clips\n", + __FUNCTION__)) ; + return true; + } + + if (!sna->render.check_composite_spans(sna, op, src, dst, + clip.extents.x2 - clip.extents.x1, + clip.extents.y2 - clip.extents.y1, + flags)) { + DBG(("%s: fallback -- composite spans not supported\n", + __FUNCTION__)); + return false; + } + + dx = dst->pDrawable->x; + dy = dst->pDrawable->y; + + DBG(("%s: after clip -- extents (%d, %d), (%d, %d), delta=(%d, %d) src -> (%d, %d)\n", + __FUNCTION__, + clip.extents.x1, clip.extents.y1, + clip.extents.x2, clip.extents.y2, + dx, dy, + src_x + clip.extents.x1 - dst_x - dx, + src_y + clip.extents.y1 - dst_y - dy)); + + was_clear = sna_drawable_is_clear(dst->pDrawable); + switch (op) { + case PictOpAdd: + case PictOpOver: + if (was_clear) + op = PictOpSrc; + break; + case PictOpIn: + if (was_clear) + return true; + break; + } + + if (!sna->render.composite_spans(sna, op, src, dst, + src_x + clip.extents.x1 - dst_x - dx, + src_y + clip.extents.y1 - dst_y - dy, + clip.extents.x1, clip.extents.y1, + clip.extents.x2 - clip.extents.x1, + clip.extents.y2 - clip.extents.y1, + flags, memset(&tmp, 0, sizeof(tmp)))) { + DBG(("%s: fallback -- composite spans render op not supported\n", + __FUNCTION__)); + return false; + } + + dx *= FAST_SAMPLES_X; + dy *= FAST_SAMPLES_Y; + + num_threads = 1; + if (!NO_GPU_THREADS && tmp.thread_boxes && + thread_choose_span(&tmp, dst, maskFormat, &clip)) + num_threads = sna_use_threads(clip.extents.x2-clip.extents.x1, + clip.extents.y2-clip.extents.y1, + 16); + DBG(("%s: using %d threads\n", __FUNCTION__, num_threads)); + if (num_threads == 1) { + struct tor tor; + + if (!tor_init(&tor, &clip.extents, 2*ntrap)) + goto skip; + + for (n = 0; n < ntrap; n++) { + xTrapezoid t; + + if (pixman_fixed_integer_floor(traps[n].top) + dst->pDrawable->y >= clip.extents.y2 || + pixman_fixed_integer_ceil(traps[n].bottom) + dst->pDrawable->y <= clip.extents.y1) + continue; + + if (!project_trapezoid_onto_grid(&traps[n], dx, dy, &t)) + continue; + + tor_add_edge(&tor, &t, &t.left, 1); + tor_add_edge(&tor, &t, &t.right, -1); + } + + tor_render(sna, &tor, &tmp, &clip, + choose_span(&tmp, dst, maskFormat, &clip), + !was_clear && maskFormat && !operator_is_bounded(op)); + + tor_fini(&tor); + } else { + struct span_thread threads[num_threads]; + int y, h; + + DBG(("%s: using %d threads for span compositing %dx%d\n", + __FUNCTION__, num_threads, + clip.extents.x2 - clip.extents.x1, + clip.extents.y2 - clip.extents.y1)); + + threads[0].sna = sna; + threads[0].op = &tmp; + threads[0].traps = traps; + threads[0].ntrap = ntrap; + threads[0].extents = clip.extents; + threads[0].clip = &clip; + threads[0].dx = dx; + threads[0].dy = dy; + threads[0].draw_y = dst->pDrawable->y; + threads[0].unbounded = !was_clear && maskFormat && !operator_is_bounded(op); + threads[0].span = thread_choose_span(&tmp, dst, maskFormat, &clip); + + y = clip.extents.y1; + h = clip.extents.y2 - clip.extents.y1; + h = (h + num_threads - 1) / num_threads; + + for (n = 1; n < num_threads; n++) { + threads[n] = threads[0]; + threads[n].extents.y1 = y; + threads[n].extents.y2 = y += h; + + sna_threads_run(span_thread, &threads[n]); + } + + threads[0].extents.y1 = y; + span_thread(&threads[0]); + + sna_threads_wait(); + } +skip: + tmp.done(sna, &tmp); + + REGION_UNINIT(NULL, &clip); + return true; +} + +static void +tor_blt_mask(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage) +{ + uint8_t *ptr = (uint8_t *)op; + int stride = (intptr_t)clip; + int h, w; + + coverage = 256 * coverage / FAST_SAMPLES_XY; + coverage -= coverage >> 8; + + ptr += box->y1 * stride + box->x1; + + h = box->y2 - box->y1; + w = box->x2 - box->x1; + if ((w | h) == 1) { + *ptr = coverage; + } else if (w == 1) { + do { + *ptr = coverage; + ptr += stride; + } while (--h); + } else do { + memset(ptr, coverage, w); + ptr += stride; + } while (--h); +} + +static void +tor_blt_mask_mono(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage) +{ + tor_blt_mask(sna, op, clip, box, + coverage < FAST_SAMPLES_XY/2 ? 0 : FAST_SAMPLES_XY); +} + +bool +trapezoid_mask_converter(CARD8 op, PicturePtr src, PicturePtr dst, + PictFormatPtr maskFormat, INT16 src_x, INT16 src_y, + int ntrap, xTrapezoid *traps) +{ + struct tor tor; + ScreenPtr screen = dst->pDrawable->pScreen; + PixmapPtr scratch; + PicturePtr mask; + BoxRec extents; + int16_t dst_x, dst_y; + int dx, dy; + int error, n; + + if (NO_SCAN_CONVERTER) + return false; + + if (dst->polyMode == PolyModePrecise && !is_mono(dst, maskFormat)) { + DBG(("%s: fallback -- precise rasterisation requested\n", + __FUNCTION__)); + return false; + } + + if (maskFormat == NULL && ntrap > 1) { + DBG(("%s: individual rasterisation requested\n", + __FUNCTION__)); + do { + /* XXX unwind errors? */ + if (!trapezoid_mask_converter(op, src, dst, NULL, + src_x, src_y, 1, traps++)) + return false; + } while (--ntrap); + return true; + } + + if (!trapezoids_bounds(ntrap, traps, &extents)) + return true; + + DBG(("%s: ntraps=%d, extents (%d, %d), (%d, %d)\n", + __FUNCTION__, ntrap, extents.x1, extents.y1, extents.x2, extents.y2)); + + if (!sna_compute_composite_extents(&extents, + src, NULL, dst, + src_x, src_y, + 0, 0, + extents.x1, extents.y1, + extents.x2 - extents.x1, + extents.y2 - extents.y1)) + return true; + + DBG(("%s: extents (%d, %d), (%d, %d)\n", + __FUNCTION__, extents.x1, extents.y1, extents.x2, extents.y2)); + + extents.y2 -= extents.y1; + extents.x2 -= extents.x1; + extents.x1 -= dst->pDrawable->x; + extents.y1 -= dst->pDrawable->y; + dst_x = extents.x1; + dst_y = extents.y1; + dx = -extents.x1 * FAST_SAMPLES_X; + dy = -extents.y1 * FAST_SAMPLES_Y; + extents.x1 = extents.y1 = 0; + + DBG(("%s: mask (%dx%d), dx=(%d, %d)\n", + __FUNCTION__, extents.x2, extents.y2, dx, dy)); + scratch = sna_pixmap_create_upload(screen, + extents.x2, extents.y2, 8, + KGEM_BUFFER_WRITE_INPLACE); + if (!scratch) + return true; + + DBG(("%s: created buffer %p, stride %d\n", + __FUNCTION__, scratch->devPrivate.ptr, scratch->devKind)); + + if (!tor_init(&tor, &extents, 2*ntrap)) { + sna_pixmap_destroy(scratch); + return true; + } + + for (n = 0; n < ntrap; n++) { + xTrapezoid t; + + if (pixman_fixed_to_int(traps[n].top) - dst_y >= extents.y2 || + pixman_fixed_to_int(traps[n].bottom) - dst_y < 0) + continue; + + if (!project_trapezoid_onto_grid(&traps[n], dx, dy, &t)) + continue; + + tor_add_edge(&tor, &t, &t.left, 1); + tor_add_edge(&tor, &t, &t.right, -1); + } + + if (extents.x2 <= TOR_INPLACE_SIZE) { + uint8_t buf[TOR_INPLACE_SIZE]; + tor_inplace(&tor, scratch, is_mono(dst, maskFormat), + scratch->usage_hint ? NULL : buf); + } else { + tor_render(NULL, &tor, + scratch->devPrivate.ptr, + (void *)(intptr_t)scratch->devKind, + is_mono(dst, maskFormat) ? tor_blt_mask_mono : tor_blt_mask, + true); + } + tor_fini(&tor); + + mask = CreatePicture(0, &scratch->drawable, + PictureMatchFormat(screen, 8, PICT_a8), + 0, 0, serverClient, &error); + if (mask) { + int16_t x0, y0; + + trapezoid_origin(&traps[0].left, &x0, &y0); + + CompositePicture(op, src, mask, dst, + src_x + dst_x - x0, + src_y + dst_y - y0, + 0, 0, + dst_x, dst_y, + extents.x2, extents.y2); + FreePicture(mask, 0); + } + sna_pixmap_destroy(scratch); + + return true; +} + +struct inplace { + uint32_t stride; + uint8_t *ptr; + union { + uint8_t opacity; + uint32_t color; + }; +}; + +static force_inline uint8_t coverage_opacity(int coverage, uint8_t opacity) +{ + coverage = coverage * 256 / FAST_SAMPLES_XY; + coverage -= coverage >> 8; + return opacity == 255 ? coverage : mul_8_8(coverage, opacity); +} + +static void +tor_blt_src(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage) +{ + struct inplace *in = (struct inplace *)op; + uint8_t *ptr = in->ptr; + int h, w; + + coverage = coverage_opacity(coverage, in->opacity); + + ptr += box->y1 * in->stride + box->x1; + + h = box->y2 - box->y1; + w = box->x2 - box->x1; + if ((w | h) == 1) { + *ptr = coverage; + } else if (w == 1) { + do { + *ptr = coverage; + ptr += in->stride; + } while (--h); + } else do { + memset(ptr, coverage, w); + ptr += in->stride; + } while (--h); +} + +static void +tor_blt_src_clipped(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage) +{ + pixman_region16_t region; + int n; + + pixman_region_init_rects(®ion, box, 1); + RegionIntersect(®ion, ®ion, clip); + n = REGION_NUM_RECTS(®ion); + box = REGION_RECTS(®ion); + while (n--) + tor_blt_src(sna, op, NULL, box++, coverage); + pixman_region_fini(®ion); +} + +static void +tor_blt_in(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage) +{ + struct inplace *in = (struct inplace *)op; + uint8_t *ptr = in->ptr; + int h, w, i; + + if (coverage == 0) { + tor_blt_src(sna, op, clip, box, 0); + return; + } + + coverage = coverage_opacity(coverage, in->opacity); + if (coverage == 0xff) + return; + + ptr += box->y1 * in->stride + box->x1; + + h = box->y2 - box->y1; + w = box->x2 - box->x1; + do { + for (i = 0; i < w; i++) + ptr[i] = mul_8_8(ptr[i], coverage); + ptr += in->stride; + } while (--h); +} + +static void +tor_blt_in_clipped(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage) +{ + pixman_region16_t region; + int n; + + pixman_region_init_rects(®ion, box, 1); + RegionIntersect(®ion, ®ion, clip); + n = REGION_NUM_RECTS(®ion); + box = REGION_RECTS(®ion); + while (n--) + tor_blt_in(sna, op, NULL, box++, coverage); + pixman_region_fini(®ion); +} + +static void +tor_blt_add(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage) +{ + struct inplace *in = (struct inplace *)op; + uint8_t *ptr = in->ptr; + int h, w, v, i; + + if (coverage == 0) + return; + + coverage = coverage_opacity(coverage, in->opacity); + if (coverage == 0xff) { + tor_blt_src(sna, op, clip, box, 0xff); + return; + } + + ptr += box->y1 * in->stride + box->x1; + + h = box->y2 - box->y1; + w = box->x2 - box->x1; + if ((w | h) == 1) { + v = coverage + *ptr; + *ptr = v >= 255 ? 255 : v; + } else { + do { + for (i = 0; i < w; i++) { + v = coverage + ptr[i]; + ptr[i] = v >= 255 ? 255 : v; + } + ptr += in->stride; + } while (--h); + } +} + +static void +tor_blt_add_clipped(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage) +{ + pixman_region16_t region; + int n; + + pixman_region_init_rects(®ion, box, 1); + RegionIntersect(®ion, ®ion, clip); + n = REGION_NUM_RECTS(®ion); + box = REGION_RECTS(®ion); + while (n--) + tor_blt_add(sna, op, NULL, box++, coverage); + pixman_region_fini(®ion); +} + +static void +tor_blt_lerp32(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage) +{ + struct inplace *in = (struct inplace *)op; + uint32_t *ptr = (uint32_t *)in->ptr; + int stride = in->stride / sizeof(uint32_t); + int h, w, i; + + if (coverage == 0) + return; + + ptr += box->y1 * stride + box->x1; + + h = box->y2 - box->y1; + w = box->x2 - box->x1; + if (coverage == FAST_SAMPLES_XY) { + if ((w | h) == 1) { + *ptr = in->color; + } else { + if (w < 16) { + do { + for (i = 0; i < w; i++) + ptr[i] = in->color; + ptr += stride; + } while (--h); + } else { + pixman_fill(ptr, stride, 32, + 0, 0, w, h, in->color); + } + } + } else { + coverage = coverage * 256 / FAST_SAMPLES_XY; + coverage -= coverage >> 8; + + if ((w | h) == 1) { + *ptr = lerp8x4(in->color, coverage, *ptr); + } else if (w == 1) { + do { + *ptr = lerp8x4(in->color, coverage, *ptr); + ptr += stride; + } while (--h); + } else{ + do { + for (i = 0; i < w; i++) + ptr[i] = lerp8x4(in->color, coverage, ptr[i]); + ptr += stride; + } while (--h); + } + } +} + +static void +tor_blt_lerp32_clipped(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage) +{ + pixman_region16_t region; + int n; + + pixman_region_init_rects(®ion, box, 1); + RegionIntersect(®ion, ®ion, clip); + n = REGION_NUM_RECTS(®ion); + box = REGION_RECTS(®ion); + while (n--) + tor_blt_lerp32(sna, op, NULL, box++, coverage); + pixman_region_fini(®ion); +} + +struct pixman_inplace { + pixman_image_t *image, *source, *mask; + uint32_t color; + uint32_t *bits; + int dx, dy; + int sx, sy; + uint8_t op; +}; + +static void +pixmask_span_solid(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage) +{ + struct pixman_inplace *pi = (struct pixman_inplace *)op; + if (coverage != FAST_SAMPLES_XY) { + coverage = coverage * 256 / FAST_SAMPLES_XY; + coverage -= coverage >> 8; + *pi->bits = mul_4x8_8(pi->color, coverage); + } else + *pi->bits = pi->color; + pixman_image_composite(pi->op, pi->source, NULL, pi->image, + box->x1, box->y1, + 0, 0, + pi->dx + box->x1, pi->dy + box->y1, + box->x2 - box->x1, box->y2 - box->y1); +} +static void +pixmask_span_solid__clipped(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage) +{ + pixman_region16_t region; + int n; + + pixman_region_init_rects(®ion, box, 1); + RegionIntersect(®ion, ®ion, clip); + n = REGION_NUM_RECTS(®ion); + box = REGION_RECTS(®ion); + while (n--) + pixmask_span_solid(sna, op, NULL, box++, coverage); + pixman_region_fini(®ion); +} + +static void +pixmask_span(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage) +{ + struct pixman_inplace *pi = (struct pixman_inplace *)op; + pixman_image_t *mask = NULL; + if (coverage != FAST_SAMPLES_XY) { + coverage = coverage * 256 / FAST_SAMPLES_XY; + coverage -= coverage >> 8; + *pi->bits = coverage; + mask = pi->mask; + } + pixman_image_composite(pi->op, pi->source, mask, pi->image, + pi->sx + box->x1, pi->sy + box->y1, + 0, 0, + pi->dx + box->x1, pi->dy + box->y1, + box->x2 - box->x1, box->y2 - box->y1); +} +static void +pixmask_span__clipped(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage) +{ + pixman_region16_t region; + int n; + + pixman_region_init_rects(®ion, box, 1); + RegionIntersect(®ion, ®ion, clip); + n = REGION_NUM_RECTS(®ion); + box = REGION_RECTS(®ion); + while (n--) + pixmask_span(sna, op, NULL, box++, coverage); + pixman_region_fini(®ion); +} + +struct inplace_x8r8g8b8_thread { + xTrapezoid *traps; + PicturePtr dst, src; + BoxRec extents; + int dx, dy; + int ntrap; + bool lerp, is_solid; + uint32_t color; + int16_t src_x, src_y; + uint8_t op; +}; + +static void inplace_x8r8g8b8_thread(void *arg) +{ + struct inplace_x8r8g8b8_thread *thread = arg; + struct tor tor; + span_func_t span; + RegionPtr clip; + int y1, y2, n; + + if (!tor_init(&tor, &thread->extents, 2*thread->ntrap)) + return; + + y1 = thread->extents.y1 - thread->dst->pDrawable->y; + y2 = thread->extents.y2 - thread->dst->pDrawable->y; + for (n = 0; n < thread->ntrap; n++) { + xTrapezoid t; + + if (pixman_fixed_to_int(thread->traps[n].top) >= y2 || + pixman_fixed_to_int(thread->traps[n].bottom) < y1) + continue; + + if (!project_trapezoid_onto_grid(&thread->traps[n], thread->dx, thread->dy, &t)) + continue; + + tor_add_edge(&tor, &t, &t.left, 1); + tor_add_edge(&tor, &t, &t.right, -1); + } + + clip = thread->dst->pCompositeClip; + if (thread->lerp) { + struct inplace inplace; + int16_t dst_x, dst_y; + PixmapPtr pixmap; + + pixmap = get_drawable_pixmap(thread->dst->pDrawable); + + inplace.ptr = pixmap->devPrivate.ptr; + if (get_drawable_deltas(thread->dst->pDrawable, pixmap, &dst_x, &dst_y)) + inplace.ptr += dst_y * pixmap->devKind + dst_x * 4; + inplace.stride = pixmap->devKind; + inplace.color = thread->color; + + if (clip->data) + span = tor_blt_lerp32_clipped; + else + span = tor_blt_lerp32; + + tor_render(NULL, &tor, (void*)&inplace, clip, span, false); + } else if (thread->is_solid) { + struct pixman_inplace pi; + + pi.image = image_from_pict(thread->dst, false, &pi.dx, &pi.dy); + pi.op = thread->op; + pi.color = thread->color; + + pi.bits = (uint32_t *)&pi.sx; + pi.source = pixman_image_create_bits(PIXMAN_a8r8g8b8, + 1, 1, pi.bits, 0); + pixman_image_set_repeat(pi.source, PIXMAN_REPEAT_NORMAL); + + if (clip->data) + span = pixmask_span_solid__clipped; + else + span = pixmask_span_solid; + + tor_render(NULL, &tor, (void*)&pi, clip, span, false); + + pixman_image_unref(pi.source); + pixman_image_unref(pi.image); + } else { + struct pixman_inplace pi; + int16_t x0, y0; + + trapezoid_origin(&thread->traps[0].left, &x0, &y0); + + pi.image = image_from_pict(thread->dst, false, &pi.dx, &pi.dy); + pi.source = image_from_pict(thread->src, false, &pi.sx, &pi.sy); + pi.sx += thread->src_x - x0; + pi.sy += thread->src_y - y0; + pi.mask = pixman_image_create_bits(PIXMAN_a8, 1, 1, NULL, 0); + pixman_image_set_repeat(pi.mask, PIXMAN_REPEAT_NORMAL); + pi.bits = pixman_image_get_data(pi.mask); + pi.op = thread->op; + + if (clip->data) + span = pixmask_span__clipped; + else + span = pixmask_span; + + tor_render(NULL, &tor, (void*)&pi, clip, span, false); + + pixman_image_unref(pi.mask); + pixman_image_unref(pi.source); + pixman_image_unref(pi.image); + } + + tor_fini(&tor); +} + +static bool +trapezoid_span_inplace__x8r8g8b8(CARD8 op, + PicturePtr dst, + PicturePtr src, int16_t src_x, int16_t src_y, + PictFormatPtr maskFormat, + int ntrap, xTrapezoid *traps) +{ + uint32_t color; + bool lerp, is_solid; + RegionRec region; + int dx, dy; + int num_threads, n; + + lerp = false; + is_solid = sna_picture_is_solid(src, &color); + if (is_solid) { + if (op == PictOpOver && (color >> 24) == 0xff) + op = PictOpSrc; + if (op == PictOpOver && sna_drawable_is_clear(dst->pDrawable)) + op = PictOpSrc; + lerp = op == PictOpSrc; + } + if (!lerp) { + switch (op) { + case PictOpOver: + case PictOpAdd: + case PictOpOutReverse: + break; + case PictOpSrc: + if (!sna_drawable_is_clear(dst->pDrawable)) + return false; + break; + default: + return false; + } + } + + if (maskFormat == NULL && ntrap > 1) { + DBG(("%s: individual rasterisation requested\n", + __FUNCTION__)); + do { + /* XXX unwind errors? */ + if (!trapezoid_span_inplace__x8r8g8b8(op, dst, + src, src_x, src_y, + NULL, 1, traps++)) + return false; + } while (--ntrap); + return true; + } + + if (!trapezoids_bounds(ntrap, traps, ®ion.extents)) + return true; + + DBG(("%s: extents (%d, %d), (%d, %d)\n", + __FUNCTION__, + region.extents.x1, region.extents.y1, + region.extents.x2, region.extents.y2)); + + if (!sna_compute_composite_extents(®ion.extents, + src, NULL, dst, + src_x, src_y, + 0, 0, + region.extents.x1, region.extents.y1, + region.extents.x2 - region.extents.x1, + region.extents.y2 - region.extents.y1)) + return true; + + DBG(("%s: clipped extents (%d, %d), (%d, %d)\n", + __FUNCTION__, + region.extents.x1, region.extents.y1, + region.extents.x2, region.extents.y2)); + + region.data = NULL; + if (!sna_drawable_move_region_to_cpu(dst->pDrawable, ®ion, + MOVE_WRITE | MOVE_READ)) + return true; + + if (!is_solid && src->pDrawable) { + if (!sna_drawable_move_to_cpu(src->pDrawable, + MOVE_READ)) + return true; + + if (src->alphaMap && + !sna_drawable_move_to_cpu(src->alphaMap->pDrawable, + MOVE_READ)) + return true; + } + + dx = dst->pDrawable->x * FAST_SAMPLES_X; + dy = dst->pDrawable->y * FAST_SAMPLES_Y; + + num_threads = sna_use_threads(4*(region.extents.x2 - region.extents.x1), + region.extents.y2 - region.extents.y1, + 16); + + DBG(("%s: %dx%d, format=%x, op=%d, lerp?=%d, num_threads=%d\n", + __FUNCTION__, + region.extents.x2 - region.extents.x1, + region.extents.y2 - region.extents.y1, + dst->format, op, lerp, num_threads)); + + if (num_threads == 1) { + struct tor tor; + span_func_t span; + + if (!tor_init(&tor, ®ion.extents, 2*ntrap)) + return true; + + for (n = 0; n < ntrap; n++) { + xTrapezoid t; + + if (pixman_fixed_to_int(traps[n].top) >= region.extents.y2 - dst->pDrawable->y || + pixman_fixed_to_int(traps[n].bottom) < region.extents.y1 - dst->pDrawable->y) + continue; + + if (!project_trapezoid_onto_grid(&traps[n], dx, dy, &t)) + continue; + + tor_add_edge(&tor, &t, &t.left, 1); + tor_add_edge(&tor, &t, &t.right, -1); + } + + if (lerp) { + struct inplace inplace; + PixmapPtr pixmap; + int16_t dst_x, dst_y; + + pixmap = get_drawable_pixmap(dst->pDrawable); + + inplace.ptr = pixmap->devPrivate.ptr; + if (get_drawable_deltas(dst->pDrawable, pixmap, &dst_x, &dst_y)) + inplace.ptr += dst_y * pixmap->devKind + dst_x * 4; + inplace.stride = pixmap->devKind; + inplace.color = color; + + if (dst->pCompositeClip->data) + span = tor_blt_lerp32_clipped; + else + span = tor_blt_lerp32; + + DBG(("%s: render inplace op=%d, color=%08x\n", + __FUNCTION__, op, color)); + + tor_render(NULL, &tor, (void*)&inplace, + dst->pCompositeClip, span, false); + } else if (is_solid) { + struct pixman_inplace pi; + + pi.image = image_from_pict(dst, false, &pi.dx, &pi.dy); + pi.op = op; + pi.color = color; + + pi.bits = (uint32_t *)&pi.sx; + pi.source = pixman_image_create_bits(PIXMAN_a8r8g8b8, + 1, 1, pi.bits, 0); + pixman_image_set_repeat(pi.source, PIXMAN_REPEAT_NORMAL); + + if (dst->pCompositeClip->data) + span = pixmask_span_solid__clipped; + else + span = pixmask_span_solid; + + tor_render(NULL, &tor, (void*)&pi, + dst->pCompositeClip, span, + false); + + pixman_image_unref(pi.source); + pixman_image_unref(pi.image); + } else { + struct pixman_inplace pi; + int16_t x0, y0; + + trapezoid_origin(&traps[0].left, &x0, &y0); + + pi.image = image_from_pict(dst, false, &pi.dx, &pi.dy); + pi.source = image_from_pict(src, false, &pi.sx, &pi.sy); + pi.sx += src_x - x0; + pi.sy += src_y - y0; + pi.mask = pixman_image_create_bits(PIXMAN_a8, 1, 1, NULL, 0); + pixman_image_set_repeat(pi.mask, PIXMAN_REPEAT_NORMAL); + pi.bits = pixman_image_get_data(pi.mask); + pi.op = op; + + if (dst->pCompositeClip->data) + span = pixmask_span__clipped; + else + span = pixmask_span; + + tor_render(NULL, &tor, (void*)&pi, + dst->pCompositeClip, span, + false); + + pixman_image_unref(pi.mask); + pixman_image_unref(pi.source); + pixman_image_unref(pi.image); + } + + tor_fini(&tor); + } else { + struct inplace_x8r8g8b8_thread threads[num_threads]; + int y, h; + + DBG(("%s: using %d threads for inplace compositing %dx%d\n", + __FUNCTION__, num_threads, + region.extents.x2 - region.extents.x1, + region.extents.y2 - region.extents.y1)); + + threads[0].traps = traps; + threads[0].ntrap = ntrap; + threads[0].extents = region.extents; + threads[0].lerp = lerp; + threads[0].is_solid = is_solid; + threads[0].color = color; + threads[0].dx = dx; + threads[0].dy = dy; + threads[0].dst = dst; + threads[0].src = src; + threads[0].op = op; + threads[0].src_x = src_x; + threads[0].src_y = src_y; + + y = region.extents.y1; + h = region.extents.y2 - region.extents.y1; + h = (h + num_threads - 1) / num_threads; + + for (n = 1; n < num_threads; n++) { + threads[n] = threads[0]; + threads[n].extents.y1 = y; + threads[n].extents.y2 = y += h; + + sna_threads_run(inplace_x8r8g8b8_thread, &threads[n]); + } + + threads[0].extents.y1 = y; + threads[0].extents.y2 = region.extents.y2; + inplace_x8r8g8b8_thread(&threads[0]); + + sna_threads_wait(); + } + + return true; +} + +struct inplace_thread { + xTrapezoid *traps; + RegionPtr clip; + span_func_t span; + struct inplace inplace; + BoxRec extents; + int dx, dy; + int draw_x, draw_y; + bool unbounded; + int ntrap; +}; + +static void inplace_thread(void *arg) +{ + struct inplace_thread *thread = arg; + struct tor tor; + int n; + + if (!tor_init(&tor, &thread->extents, 2*thread->ntrap)) + return; + + for (n = 0; n < thread->ntrap; n++) { + xTrapezoid t; + + if (pixman_fixed_to_int(thread->traps[n].top) >= thread->extents.y2 - thread->draw_y || + pixman_fixed_to_int(thread->traps[n].bottom) < thread->extents.y1 - thread->draw_y) + continue; + + if (!project_trapezoid_onto_grid(&thread->traps[n], thread->dx, thread->dy, &t)) + continue; + + tor_add_edge(&tor, &t, &t.left, 1); + tor_add_edge(&tor, &t, &t.right, -1); + } + + tor_render(NULL, &tor, (void*)&thread->inplace, + thread->clip, thread->span, thread->unbounded); + + tor_fini(&tor); +} + +bool +trapezoid_span_inplace(struct sna *sna, + CARD8 op, PicturePtr src, PicturePtr dst, + PictFormatPtr maskFormat, INT16 src_x, INT16 src_y, + int ntrap, xTrapezoid *traps, + bool fallback) +{ + struct inplace inplace; + span_func_t span; + PixmapPtr pixmap; + struct sna_pixmap *priv; + RegionRec region; + uint32_t color; + bool unbounded; + int16_t dst_x, dst_y; + int dx, dy; + int num_threads, n; + + if (NO_SCAN_CONVERTER) + return false; + + if (dst->polyMode == PolyModePrecise && !is_mono(dst, maskFormat)) { + DBG(("%s: fallback -- precise rasterisation requested\n", + __FUNCTION__)); + return false; + } + if (dst->alphaMap) { + DBG(("%s: fallback -- dst alphamap\n", + __FUNCTION__)); + return false; + } + + if (!fallback && is_gpu(sna, dst->pDrawable, PREFER_GPU_SPANS)) { + DBG(("%s: fallback -- can not perform operation in place, destination busy\n", + __FUNCTION__)); + + return false; + } + + if (is_mono(dst, maskFormat)) + return mono_trapezoid_span_inplace(sna, op, src, dst, + src_x, src_y, ntrap, traps); + + if (dst->format == PICT_a8r8g8b8 || dst->format == PICT_x8r8g8b8) + return trapezoid_span_inplace__x8r8g8b8(op, dst, + src, src_x, src_y, + maskFormat, + ntrap, traps); + + if (!sna_picture_is_solid(src, &color)) { + DBG(("%s: fallback -- can not perform operation in place, requires solid source\n", + __FUNCTION__)); + return false; + } + + if (dst->format != PICT_a8) { + DBG(("%s: fallback -- can not perform operation in place, format=%x\n", + __FUNCTION__, dst->format)); + return false; + } + + pixmap = get_drawable_pixmap(dst->pDrawable); + + unbounded = false; + priv = sna_pixmap(pixmap); + if (priv) { + switch (op) { + case PictOpAdd: + if (priv->clear && priv->clear_color == 0) { + unbounded = true; + op = PictOpSrc; + } + if ((color >> 24) == 0) + return true; + break; + case PictOpIn: + if (priv->clear && priv->clear_color == 0) + return true; + if (priv->clear && priv->clear_color == 0xff) + op = PictOpSrc; + unbounded = true; + break; + case PictOpSrc: + unbounded = true; + break; + default: + DBG(("%s: fallback -- can not perform op [%d] in place\n", + __FUNCTION__, op)); + return false; + } + } else { + switch (op) { + case PictOpAdd: + if ((color >> 24) == 0) + return true; + break; + case PictOpIn: + case PictOpSrc: + unbounded = true; + break; + default: + DBG(("%s: fallback -- can not perform op [%d] in place\n", + __FUNCTION__, op)); + return false; + } + } + + DBG(("%s: format=%x, op=%d, color=%x\n", + __FUNCTION__, dst->format, op, color)); + + if (maskFormat == NULL && ntrap > 1) { + DBG(("%s: individual rasterisation requested\n", + __FUNCTION__)); + do { + /* XXX unwind errors? */ + if (!trapezoid_span_inplace(sna, op, src, dst, NULL, + src_x, src_y, 1, traps++, + fallback)) + return false; + } while (--ntrap); + return true; + } + + if (!trapezoids_bounds(ntrap, traps, ®ion.extents)) + return true; + + DBG(("%s: extents (%d, %d), (%d, %d)\n", + __FUNCTION__, + region.extents.x1, region.extents.y1, + region.extents.x2, region.extents.y2)); + + if (!sna_compute_composite_extents(®ion.extents, + NULL, NULL, dst, + 0, 0, + 0, 0, + region.extents.x1, region.extents.y1, + region.extents.x2 - region.extents.x1, + region.extents.y2 - region.extents.y1)) + return true; + + DBG(("%s: clipped extents (%d, %d), (%d, %d)\n", + __FUNCTION__, + region.extents.x1, region.extents.y1, + region.extents.x2, region.extents.y2)); + + if (op == PictOpSrc) { + if (dst->pCompositeClip->data) + span = tor_blt_src_clipped; + else + span = tor_blt_src; + } else if (op == PictOpIn) { + if (dst->pCompositeClip->data) + span = tor_blt_in_clipped; + else + span = tor_blt_in; + } else { + assert(op == PictOpAdd); + if (dst->pCompositeClip->data) + span = tor_blt_add_clipped; + else + span = tor_blt_add; + } + + DBG(("%s: move-to-cpu\n", __FUNCTION__)); + region.data = NULL; + if (!sna_drawable_move_region_to_cpu(dst->pDrawable, ®ion, + op == PictOpSrc ? MOVE_WRITE | MOVE_INPLACE_HINT : MOVE_WRITE | MOVE_READ)) + return true; + + dx = dst->pDrawable->x * FAST_SAMPLES_X; + dy = dst->pDrawable->y * FAST_SAMPLES_Y; + + + inplace.ptr = pixmap->devPrivate.ptr; + if (get_drawable_deltas(dst->pDrawable, pixmap, &dst_x, &dst_y)) + inplace.ptr += dst_y * pixmap->devKind + dst_x; + inplace.stride = pixmap->devKind; + inplace.opacity = color >> 24; + + num_threads = sna_use_threads(region.extents.x2 - region.extents.x1, + region.extents.y2 - region.extents.y1, + 16); + if (num_threads == 1) { + struct tor tor; + + if (!tor_init(&tor, ®ion.extents, 2*ntrap)) + return true; + + for (n = 0; n < ntrap; n++) { + xTrapezoid t; + + if (pixman_fixed_to_int(traps[n].top) >= region.extents.y2 - dst->pDrawable->y || + pixman_fixed_to_int(traps[n].bottom) < region.extents.y1 - dst->pDrawable->y) + continue; + + if (!project_trapezoid_onto_grid(&traps[n], dx, dy, &t)) + continue; + + tor_add_edge(&tor, &t, &t.left, 1); + tor_add_edge(&tor, &t, &t.right, -1); + } + + tor_render(NULL, &tor, (void*)&inplace, + dst->pCompositeClip, span, unbounded); + + tor_fini(&tor); + } else { + struct inplace_thread threads[num_threads]; + int y, h; + + DBG(("%s: using %d threads for inplace compositing %dx%d\n", + __FUNCTION__, num_threads, + region.extents.x2 - region.extents.x1, + region.extents.y2 - region.extents.y1)); + + threads[0].traps = traps; + threads[0].ntrap = ntrap; + threads[0].inplace = inplace; + threads[0].extents = region.extents; + threads[0].clip = dst->pCompositeClip; + threads[0].span = span; + threads[0].unbounded = unbounded; + threads[0].dx = dx; + threads[0].dy = dy; + threads[0].draw_x = dst->pDrawable->x; + threads[0].draw_y = dst->pDrawable->y; + + y = region.extents.y1; + h = region.extents.y2 - region.extents.y1; + h = (h + num_threads - 1) / num_threads; + + for (n = 1; n < num_threads; n++) { + threads[n] = threads[0]; + threads[n].extents.y1 = y; + threads[n].extents.y2 = y += h; + + sna_threads_run(inplace_thread, &threads[n]); + } + + threads[0].extents.y1 = y; + threads[0].extents.y2 = region.extents.y2; + inplace_thread(&threads[0]); + + sna_threads_wait(); + } + + return true; +} + +bool +trapezoid_span_fallback(CARD8 op, PicturePtr src, PicturePtr dst, + PictFormatPtr maskFormat, INT16 src_x, INT16 src_y, + int ntrap, xTrapezoid *traps) +{ + struct tor tor; + ScreenPtr screen = dst->pDrawable->pScreen; + PixmapPtr scratch; + PicturePtr mask; + BoxRec extents; + int16_t dst_x, dst_y; + int dx, dy; + int error, n; + + if (NO_SCAN_CONVERTER) + return false; + + if (dst->polyMode == PolyModePrecise && !is_mono(dst, maskFormat)) { + DBG(("%s: fallback -- precise rasterisation requested\n", + __FUNCTION__)); + return false; + } + + if (maskFormat == NULL && ntrap > 1) { + DBG(("%s: individual rasterisation requested\n", + __FUNCTION__)); + do { + /* XXX unwind errors? */ + if (!trapezoid_span_fallback(op, src, dst, NULL, + src_x, src_y, 1, traps++)) + return false; + } while (--ntrap); + return true; + } + + if (!trapezoids_bounds(ntrap, traps, &extents)) + return true; + + DBG(("%s: ntraps=%d, extents (%d, %d), (%d, %d)\n", + __FUNCTION__, ntrap, extents.x1, extents.y1, extents.x2, extents.y2)); + + if (!sna_compute_composite_extents(&extents, + src, NULL, dst, + src_x, src_y, + 0, 0, + extents.x1, extents.y1, + extents.x2 - extents.x1, + extents.y2 - extents.y1)) + return true; + + DBG(("%s: extents (%d, %d), (%d, %d)\n", + __FUNCTION__, extents.x1, extents.y1, extents.x2, extents.y2)); + + extents.y2 -= extents.y1; + extents.x2 -= extents.x1; + extents.x1 -= dst->pDrawable->x; + extents.y1 -= dst->pDrawable->y; + dst_x = extents.x1; + dst_y = extents.y1; + dx = -extents.x1 * FAST_SAMPLES_X; + dy = -extents.y1 * FAST_SAMPLES_Y; + extents.x1 = extents.y1 = 0; + + DBG(("%s: mask (%dx%d), dx=(%d, %d)\n", + __FUNCTION__, extents.x2, extents.y2, dx, dy)); + scratch = sna_pixmap_create_unattached(screen, + extents.x2, extents.y2, 8); + if (!scratch) + return true; + + DBG(("%s: created buffer %p, stride %d\n", + __FUNCTION__, scratch->devPrivate.ptr, scratch->devKind)); + + if (!tor_init(&tor, &extents, 2*ntrap)) { + sna_pixmap_destroy(scratch); + return true; + } + + for (n = 0; n < ntrap; n++) { + xTrapezoid t; + + if (pixman_fixed_to_int(traps[n].top) - dst_y >= extents.y2 || + pixman_fixed_to_int(traps[n].bottom) - dst_y < 0) + continue; + + if (!project_trapezoid_onto_grid(&traps[n], dx, dy, &t)) + continue; + + tor_add_edge(&tor, &t, &t.left, 1); + tor_add_edge(&tor, &t, &t.right, -1); + } + + if (extents.x2 <= TOR_INPLACE_SIZE) { + tor_inplace(&tor, scratch, is_mono(dst, maskFormat), NULL); + } else { + tor_render(NULL, &tor, + scratch->devPrivate.ptr, + (void *)(intptr_t)scratch->devKind, + is_mono(dst, maskFormat) ? tor_blt_mask_mono : tor_blt_mask, + true); + } + tor_fini(&tor); + + mask = CreatePicture(0, &scratch->drawable, + PictureMatchFormat(screen, 8, PICT_a8), + 0, 0, serverClient, &error); + if (mask) { + RegionRec region; + int16_t x0, y0; + + region.extents.x1 = dst_x + dst->pDrawable->x; + region.extents.y1 = dst_y + dst->pDrawable->y; + region.extents.x2 = region.extents.x1 + extents.x2; + region.extents.y2 = region.extents.y1 + extents.y2; + region.data = NULL; + + trapezoid_origin(&traps[0].left, &x0, &y0); + + DBG(("%s: fbComposite()\n", __FUNCTION__)); + sna_composite_fb(op, src, mask, dst, ®ion, + src_x + dst_x - x0, src_y + dst_y - y0, + 0, 0, + dst_x, dst_y, + extents.x2, extents.y2); + + FreePicture(mask, 0); + } + sna_pixmap_destroy(scratch); + + return true; +} + +static inline bool +project_trap_onto_grid(const xTrap *in, + int dx, int dy, + xTrap *out) +{ + out->top.l = dx + pixman_fixed_to_grid(in->top.l); + out->top.r = dx + pixman_fixed_to_grid(in->top.r); + out->top.y = dy + pixman_fixed_to_grid(in->top.y); + + out->bot.l = dx + pixman_fixed_to_grid(in->bot.l); + out->bot.r = dx + pixman_fixed_to_grid(in->bot.r); + out->bot.y = dy + pixman_fixed_to_grid(in->bot.y); + + return out->bot.y > out->top.y; +} + +bool +trap_span_converter(struct sna *sna, + PicturePtr dst, + INT16 src_x, INT16 src_y, + int ntrap, xTrap *trap) +{ + struct sna_composite_spans_op tmp; + struct tor tor; + BoxRec extents; + pixman_region16_t *clip; + int dx, dy, n; + + if (NO_SCAN_CONVERTER) + return false; + + if (dst->pDrawable->depth < 8) + return false; + + if (dst->polyEdge == PolyEdgeSharp) + return mono_trap_span_converter(sna, dst, src_x, src_y, ntrap, trap); + + if (!sna->render.check_composite_spans(sna, PictOpAdd, sna->render.white_picture, dst, + dst->pCompositeClip->extents.x2 - dst->pCompositeClip->extents.x1, + dst->pCompositeClip->extents.y2 - dst->pCompositeClip->extents.y1, + 0)) { + DBG(("%s: fallback -- composite spans not supported\n", + __FUNCTION__)); + return false; + } + + clip = dst->pCompositeClip; + extents = *RegionExtents(clip); + dx = dst->pDrawable->x; + dy = dst->pDrawable->y; + + DBG(("%s: after clip -- extents (%d, %d), (%d, %d), delta=(%d, %d)\n", + __FUNCTION__, + extents.x1, extents.y1, + extents.x2, extents.y2, + dx, dy)); + + memset(&tmp, 0, sizeof(tmp)); + if (!sna->render.composite_spans(sna, PictOpAdd, sna->render.white_picture, dst, + 0, 0, + extents.x1, extents.y1, + extents.x2 - extents.x1, + extents.y2 - extents.y1, + 0, + &tmp)) { + DBG(("%s: fallback -- composite spans render op not supported\n", + __FUNCTION__)); + return false; + } + + dx *= FAST_SAMPLES_X; + dy *= FAST_SAMPLES_Y; + if (!tor_init(&tor, &extents, 2*ntrap)) + goto skip; + + for (n = 0; n < ntrap; n++) { + xTrap t; + xPointFixed p1, p2; + + if (pixman_fixed_to_int(trap[n].top.y) + dst->pDrawable->y >= extents.y2 || + pixman_fixed_to_int(trap[n].bot.y) + dst->pDrawable->y < extents.y1) + continue; + + if (!project_trap_onto_grid(&trap[n], dx, dy, &t)) + continue; + + p1.y = t.top.y; + p2.y = t.bot.y; + p1.x = t.top.l; + p2.x = t.bot.l; + polygon_add_line(tor.polygon, &p1, &p2); + + p1.y = t.bot.y; + p2.y = t.top.y; + p1.x = t.top.r; + p2.x = t.bot.r; + polygon_add_line(tor.polygon, &p1, &p2); + } + + tor_render(sna, &tor, &tmp, clip, + choose_span(&tmp, dst, NULL, clip), false); + + tor_fini(&tor); +skip: + tmp.done(sna, &tmp); + return true; +} + +static void mark_damaged(PixmapPtr pixmap, struct sna_pixmap *priv, + BoxPtr box, int16_t x, int16_t y) +{ + box->x1 += x; box->x2 += x; + box->y1 += y; box->y2 += y; + if (box->x1 <= 0 && box->y1 <= 0 && + box->x2 >= pixmap->drawable.width && + box->y2 >= pixmap->drawable.height) { + sna_damage_destroy(&priv->cpu_damage); + sna_damage_all(&priv->gpu_damage, + pixmap->drawable.width, + pixmap->drawable.height); + list_del(&priv->flush_list); + } else { + sna_damage_add_box(&priv->gpu_damage, box); + sna_damage_subtract_box(&priv->cpu_damage, box); + } +} + +bool +trap_mask_converter(struct sna *sna, + PicturePtr picture, + INT16 x, INT16 y, + int ntrap, xTrap *trap) +{ + struct tor tor; + ScreenPtr screen = picture->pDrawable->pScreen; + PixmapPtr scratch, pixmap; + struct sna_pixmap *priv; + BoxRec extents; + span_func_t span; + int dx, dy, n; + + if (NO_SCAN_CONVERTER) + return false; + + pixmap = get_drawable_pixmap(picture->pDrawable); + priv = sna_pixmap_move_to_gpu(pixmap, MOVE_READ | MOVE_WRITE); + if (priv == NULL) + return false; + + /* XXX strict adherence to the Render specification */ + if (picture->polyMode == PolyModePrecise && + picture->polyEdge != PolyEdgeSharp) { + DBG(("%s: fallback -- precise rasterisation requested\n", + __FUNCTION__)); + return false; + } + + extents = *RegionExtents(picture->pCompositeClip); + for (n = 0; n < ntrap; n++) { + int v; + + v = x + pixman_fixed_integer_floor (MIN(trap[n].top.l, trap[n].bot.l)); + if (v < extents.x1) + extents.x1 = v; + + v = x + pixman_fixed_integer_ceil (MAX(trap[n].top.r, trap[n].bot.r)); + if (v > extents.x2) + extents.x2 = v; + + v = y + pixman_fixed_integer_floor (trap[n].top.y); + if (v < extents.y1) + extents.y1 = v; + + v = y + pixman_fixed_integer_ceil (trap[n].bot.y); + if (v > extents.y2) + extents.y2 = v; + } + + DBG(("%s: extents (%d, %d), (%d, %d)\n", + __FUNCTION__, extents.x1, extents.y1, extents.x2, extents.y2)); + + scratch = sna_pixmap_create_upload(screen, + extents.x2-extents.x1, + extents.y2-extents.y1, + 8, KGEM_BUFFER_WRITE_INPLACE); + if (!scratch) + return true; + + dx = picture->pDrawable->x; + dy = picture->pDrawable->y; + dx *= FAST_SAMPLES_X; + dy *= FAST_SAMPLES_Y; + if (!tor_init(&tor, &extents, 2*ntrap)) { + sna_pixmap_destroy(scratch); + return true; + } + + for (n = 0; n < ntrap; n++) { + xTrap t; + xPointFixed p1, p2; + + if (pixman_fixed_to_int(trap[n].top.y) + picture->pDrawable->y >= extents.y2 || + pixman_fixed_to_int(trap[n].bot.y) + picture->pDrawable->y < extents.y1) + continue; + + if (!project_trap_onto_grid(&trap[n], dx, dy, &t)) + continue; + + p1.y = t.top.y; + p2.y = t.bot.y; + p1.x = t.top.l; + p2.x = t.bot.l; + polygon_add_line(tor.polygon, &p1, &p2); + + p1.y = t.bot.y; + p2.y = t.top.y; + p1.x = t.top.r; + p2.x = t.bot.r; + polygon_add_line(tor.polygon, &p1, &p2); + } + + if (picture->polyEdge == PolyEdgeSharp) + span = tor_blt_mask_mono; + else + span = tor_blt_mask; + + tor_render(NULL, &tor, + scratch->devPrivate.ptr, + (void *)(intptr_t)scratch->devKind, + span, true); + + tor_fini(&tor); + + /* XXX clip boxes */ + get_drawable_deltas(picture->pDrawable, pixmap, &x, &y); + sna = to_sna_from_screen(screen); + sna->render.copy_boxes(sna, GXcopy, + scratch, __sna_pixmap_get_bo(scratch), -extents.x1, -extents.x1, + pixmap, priv->gpu_bo, x, y, + &extents, 1, 0); + mark_damaged(pixmap, priv, &extents ,x, y); + sna_pixmap_destroy(scratch); + return true; +} + +static inline void +project_point_onto_grid(const xPointFixed *in, + int dx, int dy, + xPointFixed *out) +{ + out->x = dx + pixman_fixed_to_grid(in->x); + out->y = dy + pixman_fixed_to_grid(in->y); +} + +#if HAS_PIXMAN_TRIANGLES +static inline bool +project_triangle_onto_grid(const xTriangle *in, + int dx, int dy, + xTriangle *out) +{ + project_point_onto_grid(&in->p1, dx, dy, &out->p1); + project_point_onto_grid(&in->p2, dx, dy, &out->p2); + project_point_onto_grid(&in->p3, dx, dy, &out->p3); + + return xTriangleValid(out); +} + +bool +triangles_span_converter(struct sna *sna, + CARD8 op, PicturePtr src, PicturePtr dst, + PictFormatPtr maskFormat, INT16 src_x, INT16 src_y, + int count, xTriangle *tri) +{ + struct sna_composite_spans_op tmp; + struct tor tor; + BoxRec extents; + pixman_region16_t clip; + int16_t dst_x, dst_y; + int dx, dy, n; + bool was_clear; + + if (NO_SCAN_CONVERTER) + return false; + + if (is_mono(dst, maskFormat)) + return mono_triangles_span_converter(sna, op, src, dst, + src_x, src_y, + count, tri); + + /* XXX strict adherence to the Render specification */ + if (dst->polyMode == PolyModePrecise) { + DBG(("%s: fallback -- precise rasterisation requested\n", + __FUNCTION__)); + return false; + } + + if (!sna->render.check_composite_spans(sna, op, src, dst, 0, 0, 0)) { + DBG(("%s: fallback -- composite spans not supported\n", + __FUNCTION__)); + return false; + } + + dst_x = pixman_fixed_to_int(tri[0].p1.x); + dst_y = pixman_fixed_to_int(tri[0].p1.y); + + miTriangleBounds(count, tri, &extents); + DBG(("%s: extents (%d, %d), (%d, %d)\n", + __FUNCTION__, extents.x1, extents.y1, extents.x2, extents.y2)); + + if (extents.y1 >= extents.y2 || extents.x1 >= extents.x2) + return true; + +#if 0 + if (extents.y2 - extents.y1 < 64 && extents.x2 - extents.x1 < 64) { + DBG(("%s: fallback -- traps extents too small %dx%d\n", + __FUNCTION__, extents.y2 - extents.y1, extents.x2 - extents.x1)); + return false; + } +#endif + + if (!sna_compute_composite_region(&clip, + src, NULL, dst, + src_x + extents.x1 - dst_x, + src_y + extents.y1 - dst_y, + 0, 0, + extents.x1, extents.y1, + extents.x2 - extents.x1, + extents.y2 - extents.y1)) { + DBG(("%s: triangles do not intersect drawable clips\n", + __FUNCTION__)) ; + return true; + } + + if (!sna->render.check_composite_spans(sna, op, src, dst, + clip.extents.x2 - clip.extents.x1, + clip.extents.y2 - clip.extents.y1, + 0)) { + DBG(("%s: fallback -- composite spans not supported\n", + __FUNCTION__)); + return false; + } + + extents = *RegionExtents(&clip); + dx = dst->pDrawable->x; + dy = dst->pDrawable->y; + + DBG(("%s: after clip -- extents (%d, %d), (%d, %d), delta=(%d, %d) src -> (%d, %d)\n", + __FUNCTION__, + extents.x1, extents.y1, + extents.x2, extents.y2, + dx, dy, + src_x + extents.x1 - dst_x - dx, + src_y + extents.y1 - dst_y - dy)); + + was_clear = sna_drawable_is_clear(dst->pDrawable); + + memset(&tmp, 0, sizeof(tmp)); + if (!sna->render.composite_spans(sna, op, src, dst, + src_x + extents.x1 - dst_x - dx, + src_y + extents.y1 - dst_y - dy, + extents.x1, extents.y1, + extents.x2 - extents.x1, + extents.y2 - extents.y1, + 0, + &tmp)) { + DBG(("%s: fallback -- composite spans render op not supported\n", + __FUNCTION__)); + return false; + } + + dx *= FAST_SAMPLES_X; + dy *= FAST_SAMPLES_Y; + if (!tor_init(&tor, &extents, 3*count)) + goto skip; + + for (n = 0; n < count; n++) { + xTriangle t; + + if (!project_triangle_onto_grid(&tri[n], dx, dy, &t)) + continue; + + polygon_add_line(tor.polygon, &t.p1, &t.p2); + polygon_add_line(tor.polygon, &t.p2, &t.p3); + polygon_add_line(tor.polygon, &t.p3, &t.p1); + } + + tor_render(sna, &tor, &tmp, &clip, + choose_span(&tmp, dst, maskFormat, &clip), + !was_clear && maskFormat && !operator_is_bounded(op)); + + tor_fini(&tor); +skip: + tmp.done(sna, &tmp); + + REGION_UNINIT(NULL, &clip); + return true; +} + +bool +triangles_mask_converter(CARD8 op, PicturePtr src, PicturePtr dst, + PictFormatPtr maskFormat, INT16 src_x, INT16 src_y, + int count, xTriangle *tri) +{ + struct tor tor; + void (*span)(struct sna *sna, + struct sna_composite_spans_op *op, + pixman_region16_t *clip, + const BoxRec *box, + int coverage); + ScreenPtr screen = dst->pDrawable->pScreen; + PixmapPtr scratch; + PicturePtr mask; + BoxRec extents; + int16_t dst_x, dst_y; + int dx, dy; + int error, n; + + if (NO_SCAN_CONVERTER) + return false; + + if (dst->polyMode == PolyModePrecise && !is_mono(dst, maskFormat)) { + DBG(("%s: fallback -- precise rasterisation requested\n", + __FUNCTION__)); + return false; + } + + if (maskFormat == NULL && count > 1) { + DBG(("%s: fallback -- individual rasterisation requested\n", + __FUNCTION__)); + return false; + } + + miTriangleBounds(count, tri, &extents); + DBG(("%s: extents (%d, %d), (%d, %d)\n", + __FUNCTION__, extents.x1, extents.y1, extents.x2, extents.y2)); + + if (extents.y1 >= extents.y2 || extents.x1 >= extents.x2) + return true; + + if (!sna_compute_composite_extents(&extents, + src, NULL, dst, + src_x, src_y, + 0, 0, + extents.x1, extents.y1, + extents.x2 - extents.x1, + extents.y2 - extents.y1)) + return true; + + DBG(("%s: extents (%d, %d), (%d, %d)\n", + __FUNCTION__, extents.x1, extents.y1, extents.x2, extents.y2)); + + extents.y2 -= extents.y1; + extents.x2 -= extents.x1; + extents.x1 -= dst->pDrawable->x; + extents.y1 -= dst->pDrawable->y; + dst_x = extents.x1; + dst_y = extents.y1; + dx = -extents.x1 * FAST_SAMPLES_X; + dy = -extents.y1 * FAST_SAMPLES_Y; + extents.x1 = extents.y1 = 0; + + DBG(("%s: mask (%dx%d)\n", + __FUNCTION__, extents.x2, extents.y2)); + scratch = sna_pixmap_create_upload(screen, + extents.x2, extents.y2, 8, + KGEM_BUFFER_WRITE_INPLACE); + if (!scratch) + return true; + + DBG(("%s: created buffer %p, stride %d\n", + __FUNCTION__, scratch->devPrivate.ptr, scratch->devKind)); + + if (!tor_init(&tor, &extents, 3*count)) { + sna_pixmap_destroy(scratch); + return true; + } + + for (n = 0; n < count; n++) { + xTriangle t; + + if (!project_triangle_onto_grid(&tri[n], dx, dy, &t)) + continue; + + polygon_add_line(tor.polygon, &t.p1, &t.p2); + polygon_add_line(tor.polygon, &t.p2, &t.p3); + polygon_add_line(tor.polygon, &t.p3, &t.p1); + } + + if (maskFormat ? maskFormat->depth < 8 : dst->polyEdge == PolyEdgeSharp) + span = tor_blt_mask_mono; + else + span = tor_blt_mask; + + tor_render(NULL, &tor, + scratch->devPrivate.ptr, + (void *)(intptr_t)scratch->devKind, + span, true); + + mask = CreatePicture(0, &scratch->drawable, + PictureMatchFormat(screen, 8, PICT_a8), + 0, 0, serverClient, &error); + if (mask) { + CompositePicture(op, src, mask, dst, + src_x + dst_x - pixman_fixed_to_int(tri[0].p1.x), + src_y + dst_y - pixman_fixed_to_int(tri[0].p1.y), + 0, 0, + dst_x, dst_y, + extents.x2, extents.y2); + FreePicture(mask, 0); + } + tor_fini(&tor); + sna_pixmap_destroy(scratch); + + return true; +} + +bool +tristrip_span_converter(struct sna *sna, + CARD8 op, PicturePtr src, PicturePtr dst, + PictFormatPtr maskFormat, INT16 src_x, INT16 src_y, + int count, xPointFixed *points) +{ + struct sna_composite_spans_op tmp; + struct tor tor; + BoxRec extents; + pixman_region16_t clip; + xPointFixed p[4]; + int16_t dst_x, dst_y; + int dx, dy; + int cw, ccw, n; + bool was_clear; + + if (NO_SCAN_CONVERTER) + return false; + + /* XXX strict adherence to the Render specification */ + if (dst->polyMode == PolyModePrecise && !is_mono(dst, maskFormat)) { + DBG(("%s: fallback -- precise rasterisation requested\n", + __FUNCTION__)); + return false; + } + + if (!sna->render.check_composite_spans(sna, op, src, dst, 0, 0, 0)) { + DBG(("%s: fallback -- composite spans not supported\n", + __FUNCTION__)); + return false; + } + + dst_x = pixman_fixed_to_int(points[0].x); + dst_y = pixman_fixed_to_int(points[0].y); + + miPointFixedBounds(count, points, &extents); + DBG(("%s: extents (%d, %d), (%d, %d)\n", + __FUNCTION__, extents.x1, extents.y1, extents.x2, extents.y2)); + + if (extents.y1 >= extents.y2 || extents.x1 >= extents.x2) + return true; + +#if 0 + if (extents.y2 - extents.y1 < 64 && extents.x2 - extents.x1 < 64) { + DBG(("%s: fallback -- traps extents too small %dx%d\n", + __FUNCTION__, extents.y2 - extents.y1, extents.x2 - extents.x1)); + return false; + } +#endif + + if (!sna_compute_composite_region(&clip, + src, NULL, dst, + src_x + extents.x1 - dst_x, + src_y + extents.y1 - dst_y, + 0, 0, + extents.x1, extents.y1, + extents.x2 - extents.x1, + extents.y2 - extents.y1)) { + DBG(("%s: triangles do not intersect drawable clips\n", + __FUNCTION__)) ; + return true; + } + + if (!sna->render.check_composite_spans(sna, op, src, dst, + clip.extents.x2 - clip.extents.x1, + clip.extents.y2 - clip.extents.y1, + 0)) { + DBG(("%s: fallback -- composite spans not supported\n", + __FUNCTION__)); + return false; + } + + extents = *RegionExtents(&clip); + dx = dst->pDrawable->x; + dy = dst->pDrawable->y; + + DBG(("%s: after clip -- extents (%d, %d), (%d, %d), delta=(%d, %d) src -> (%d, %d)\n", + __FUNCTION__, + extents.x1, extents.y1, + extents.x2, extents.y2, + dx, dy, + src_x + extents.x1 - dst_x - dx, + src_y + extents.y1 - dst_y - dy)); + + was_clear = sna_drawable_is_clear(dst->pDrawable); + + memset(&tmp, 0, sizeof(tmp)); + if (!sna->render.composite_spans(sna, op, src, dst, + src_x + extents.x1 - dst_x - dx, + src_y + extents.y1 - dst_y - dy, + extents.x1, extents.y1, + extents.x2 - extents.x1, + extents.y2 - extents.y1, + 0, + &tmp)) { + DBG(("%s: fallback -- composite spans render op not supported\n", + __FUNCTION__)); + return false; + } + + dx *= FAST_SAMPLES_X; + dy *= FAST_SAMPLES_Y; + if (!tor_init(&tor, &extents, 2*count)) + goto skip; + + cw = ccw = 0; + project_point_onto_grid(&points[0], dx, dy, &p[cw]); + project_point_onto_grid(&points[1], dx, dy, &p[2+ccw]); + polygon_add_line(tor.polygon, &p[cw], &p[2+ccw]); + n = 2; + do { + cw = !cw; + project_point_onto_grid(&points[n], dx, dy, &p[cw]); + polygon_add_line(tor.polygon, &p[!cw], &p[cw]); + if (++n == count) + break; + + ccw = !ccw; + project_point_onto_grid(&points[n], dx, dy, &p[2+ccw]); + polygon_add_line(tor.polygon, &p[2+ccw], &p[2+!ccw]); + if (++n == count) + break; + } while (1); + polygon_add_line(tor.polygon, &p[2+ccw], &p[cw]); + assert(tor.polygon->num_edges <= 2*count); + + tor_render(sna, &tor, &tmp, &clip, + choose_span(&tmp, dst, maskFormat, &clip), + !was_clear && maskFormat && !operator_is_bounded(op)); + + tor_fini(&tor); +skip: + tmp.done(sna, &tmp); + + REGION_UNINIT(NULL, &clip); + return true; +} + +#endif diff --git a/src/sna/sna_trapezoids_mono.c b/src/sna/sna_trapezoids_mono.c new file mode 100644 index 00000000..e5cb7a6c --- /dev/null +++ b/src/sna/sna_trapezoids_mono.c @@ -0,0 +1,1427 @@ +/* + * Copyright (c) 2007 David Turner + * Copyright (c) 2008 M Joonas Pihlaja + * Copyright (c) 2011 Intel Corporation + * + * Permission is hereby granted, free of charge, to any person obtaining a + * copy of this software and associated documentation files (the "Software"), + * to deal in the Software without restriction, including without limitation + * the rights to use, copy, modify, merge, publish, distribute, sublicense, + * and/or sell copies of the Software, and to permit persons to whom the + * Software is furnished to do so, subject to the following conditions: + * + * The above copyright notice and this permission notice (including the next + * paragraph) shall be included in all copies or substantial portions of the + * Software. + * + * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR + * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, + * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL + * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER + * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, + * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE + * SOFTWARE. + * + * Authors: + * Chris Wilson <chris@chris-wilson.co.uk> + * + */ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include "sna.h" +#include "sna_render.h" +#include "sna_render_inline.h" +#include "sna_trapezoids.h" +#include "fb/fbpict.h" + +#include <mipict.h> + +#if 0 +#define __DBG(x) ErrorF x +#else +#define __DBG(x) +#endif + +struct quorem { + int32_t quo; + int32_t rem; +}; + +struct mono_edge { + struct mono_edge *next, *prev; + + int32_t height_left; + int32_t dir; + + int32_t dy; + struct quorem x; + struct quorem dxdy; +}; + +struct mono_polygon { + int num_edges; + struct mono_edge *edges; + struct mono_edge **y_buckets; + + struct mono_edge *y_buckets_embedded[64]; + struct mono_edge edges_embedded[32]; +}; + +struct mono { + /* Leftmost edge on the current scan line. */ + struct mono_edge head, tail; + int is_vertical; + + struct sna *sna; + struct sna_composite_op op; + pixman_region16_t clip; + + fastcall void (*span)(struct mono *, int, int, BoxPtr); + + struct mono_polygon polygon; +}; + +#define I(x) pixman_fixed_to_int ((x) + pixman_fixed_1_minus_e/2) + +static struct quorem +floored_muldivrem(int32_t x, int32_t a, int32_t b) +{ + struct quorem qr; + int64_t xa = (int64_t)x*a; + qr.quo = xa/b; + qr.rem = xa%b; + if (qr.rem < 0) { + qr.quo -= 1; + qr.rem += b; + } + return qr; +} + +#if HAS_DEBUG_FULL +static void _assert_pixmap_contains_box(PixmapPtr pixmap, BoxPtr box, const char *function) +{ + if (box->x1 < 0 || box->y1 < 0 || + box->x2 > pixmap->drawable.width || + box->y2 > pixmap->drawable.height) + FatalError("%s: damage box is beyond the pixmap: box=(%d, %d), (%d, %d), pixmap=(%d, %d)\n", + __FUNCTION__, + box->x1, box->y1, box->x2, box->y2, + pixmap->drawable.width, + pixmap->drawable.height); +} +#define assert_pixmap_contains_box(p, b) _assert_pixmap_contains_box(p, b, __FUNCTION__) +#else +#define assert_pixmap_contains_box(p, b) +#endif + +static void apply_damage(struct sna_composite_op *op, RegionPtr region) +{ + DBG(("%s: damage=%p, region=%ldx[(%d, %d), (%d, %d)]\n", + __FUNCTION__, op->damage, + (long)REGION_NUM_RECTS(region), + region->extents.x1, region->extents.y1, + region->extents.x2, region->extents.y2)); + + if (op->damage == NULL) + return; + + RegionTranslate(region, op->dst.x, op->dst.y); + + assert_pixmap_contains_box(op->dst.pixmap, RegionExtents(region)); + sna_damage_add(op->damage, region); +} + +static void _apply_damage_box(struct sna_composite_op *op, const BoxRec *box) +{ + BoxRec r; + + r.x1 = box->x1 + op->dst.x; + r.x2 = box->x2 + op->dst.x; + r.y1 = box->y1 + op->dst.y; + r.y2 = box->y2 + op->dst.y; + + assert_pixmap_contains_box(op->dst.pixmap, &r); + sna_damage_add_box(op->damage, &r); +} + +inline static void apply_damage_box(struct sna_composite_op *op, const BoxRec *box) +{ + if (op->damage) + _apply_damage_box(op, box); +} + +static bool +mono_polygon_init(struct mono_polygon *polygon, BoxPtr box, int num_edges) +{ + unsigned h = box->y2 - box->y1; + + polygon->y_buckets = polygon->y_buckets_embedded; + if (h > ARRAY_SIZE (polygon->y_buckets_embedded)) { + polygon->y_buckets = malloc (h * sizeof (struct mono_edge *)); + if (unlikely (NULL == polygon->y_buckets)) + return false; + } + + polygon->num_edges = 0; + polygon->edges = polygon->edges_embedded; + if (num_edges > (int)ARRAY_SIZE (polygon->edges_embedded)) { + polygon->edges = malloc (num_edges * sizeof (struct mono_edge)); + if (unlikely (polygon->edges == NULL)) { + if (polygon->y_buckets != polygon->y_buckets_embedded) + free(polygon->y_buckets); + return false; + } + } + + memset(polygon->y_buckets, 0, h * sizeof (struct edge *)); + return true; +} + +static void +mono_polygon_fini(struct mono_polygon *polygon) +{ + if (polygon->y_buckets != polygon->y_buckets_embedded) + free(polygon->y_buckets); + + if (polygon->edges != polygon->edges_embedded) + free(polygon->edges); +} + +static void +mono_add_line(struct mono *mono, + int dst_x, int dst_y, + xFixed top, xFixed bottom, + const xPointFixed *p1, const xPointFixed *p2, + int dir) +{ + struct mono_polygon *polygon = &mono->polygon; + struct mono_edge *e; + pixman_fixed_t dx; + pixman_fixed_t dy; + int y, ytop, ybot; + + __DBG(("%s: top=%d, bottom=%d, line=(%d, %d), (%d, %d) delta=%dx%d, dir=%d\n", + __FUNCTION__, + (int)top, (int)bottom, + (int)p1->x, (int)p1->y, (int)p2->x, (int)p2->y, + dst_x, dst_y, + dir)); + + if (top > bottom) { + const xPointFixed *t; + + y = top; + top = bottom; + bottom = y; + + t = p1; + p1 = p2; + p2 = t; + + dir = -dir; + } + + y = I(top) + dst_y; + ytop = MAX(y, mono->clip.extents.y1); + + y = I(bottom) + dst_y; + ybot = MIN(y, mono->clip.extents.y2); + + if (ybot <= ytop) { + __DBG(("discard clipped line\n")); + return; + } + + e = polygon->edges + polygon->num_edges++; + e->height_left = ybot - ytop; + e->dir = dir; + + dx = p2->x - p1->x; + dy = p2->y - p1->y; + + if (dx == 0) { + e->x.quo = p1->x; + e->x.rem = 0; + e->dxdy.quo = 0; + e->dxdy.rem = 0; + e->dy = 0; + } else { + e->dxdy = floored_muldivrem (dx, pixman_fixed_1, dy); + e->dy = dy; + + e->x = floored_muldivrem ((ytop-dst_y) * pixman_fixed_1 + pixman_fixed_1_minus_e/2 - p1->y, + dx, dy); + e->x.quo += p1->x; + e->x.rem -= dy; + } + e->x.quo += dst_x*pixman_fixed_1; + + { + struct mono_edge **ptail = &polygon->y_buckets[ytop - mono->clip.extents.y1]; + if (*ptail) + (*ptail)->prev = e; + e->next = *ptail; + e->prev = NULL; + *ptail = e; + } +} + +static struct mono_edge * +mono_merge_sorted_edges(struct mono_edge *head_a, struct mono_edge *head_b) +{ + struct mono_edge *head, **next, *prev; + int32_t x; + + if (head_b == NULL) + return head_a; + + prev = head_a->prev; + next = &head; + if (head_a->x.quo <= head_b->x.quo) { + head = head_a; + } else { + head = head_b; + head_b->prev = prev; + goto start_with_b; + } + + do { + x = head_b->x.quo; + while (head_a != NULL && head_a->x.quo <= x) { + prev = head_a; + next = &head_a->next; + head_a = head_a->next; + } + + head_b->prev = prev; + *next = head_b; + if (head_a == NULL) + return head; + +start_with_b: + x = head_a->x.quo; + while (head_b != NULL && head_b->x.quo <= x) { + prev = head_b; + next = &head_b->next; + head_b = head_b->next; + } + + head_a->prev = prev; + *next = head_a; + if (head_b == NULL) + return head; + } while (1); +} + +static struct mono_edge * +mono_sort_edges(struct mono_edge *list, + unsigned int level, + struct mono_edge **head_out) +{ + struct mono_edge *head_other, *remaining; + unsigned int i; + + head_other = list->next; + + if (head_other == NULL) { + *head_out = list; + return NULL; + } + + remaining = head_other->next; + if (list->x.quo <= head_other->x.quo) { + *head_out = list; + head_other->next = NULL; + } else { + *head_out = head_other; + head_other->prev = list->prev; + head_other->next = list; + list->prev = head_other; + list->next = NULL; + } + + for (i = 0; i < level && remaining; i++) { + remaining = mono_sort_edges(remaining, i, &head_other); + *head_out = mono_merge_sorted_edges(*head_out, head_other); + } + + return remaining; +} + +static struct mono_edge *mono_filter(struct mono_edge *edges) +{ + struct mono_edge *e; + + e = edges; + do { + struct mono_edge *n = e->next; + if (e->dir == -n->dir && + e->height_left == n->height_left && + *(uint64_t *)&e->x == *(uint64_t *)&n->x && + *(uint64_t *)&e->dxdy == *(uint64_t *)&n->dxdy) { + if (e->prev) + e->prev->next = n->next; + else + edges = n->next; + if (n->next) + n->next->prev = e->prev; + else + break; + + e = n->next; + } else + e = e->next; + } while (e->next); + + return edges; +} + +static struct mono_edge * +mono_merge_unsorted_edges(struct mono_edge *head, struct mono_edge *unsorted) +{ + mono_sort_edges(unsorted, UINT_MAX, &unsorted); + return mono_merge_sorted_edges(head, mono_filter(unsorted)); +} + +#if 0 +static inline void +__dbg_mono_edges(const char *function, struct mono_edge *edges) +{ + ErrorF("%s: ", function); + while (edges) { + if (edges->x.quo < INT16_MAX << 16) { + ErrorF("(%d.%06d)+(%d.%06d)x%d, ", + edges->x.quo, edges->x.rem, + edges->dxdy.quo, edges->dxdy.rem, + edges->dy*edges->dir); + } + edges = edges->next; + } + ErrorF("\n"); +} +#define DBG_MONO_EDGES(x) __dbg_mono_edges(__FUNCTION__, x) +static inline void +VALIDATE_MONO_EDGES(struct mono_edge *edges) +{ + int prev_x = edges->x.quo; + while ((edges = edges->next)) { + assert(edges->x.quo >= prev_x); + prev_x = edges->x.quo; + } +} + +#else +#define DBG_MONO_EDGES(x) +#define VALIDATE_MONO_EDGES(x) +#endif + +inline static void +mono_merge_edges(struct mono *c, struct mono_edge *edges) +{ + struct mono_edge *e; + + DBG_MONO_EDGES(edges); + + for (e = edges; c->is_vertical && e; e = e->next) + c->is_vertical = e->dy == 0; + + c->head.next = mono_merge_unsorted_edges(c->head.next, edges); +} + +fastcall static void +mono_span(struct mono *c, int x1, int x2, BoxPtr box) +{ + __DBG(("%s [%d, %d]\n", __FUNCTION__, x1, x2)); + + box->x1 = x1; + box->x2 = x2; + + if (c->clip.data) { + pixman_region16_t region; + + pixman_region_init_rects(®ion, box, 1); + RegionIntersect(®ion, ®ion, &c->clip); + if (REGION_NUM_RECTS(®ion)) { + c->op.boxes(c->sna, &c->op, + REGION_RECTS(®ion), + REGION_NUM_RECTS(®ion)); + apply_damage(&c->op, ®ion); + } + pixman_region_fini(®ion); + } else { + c->op.box(c->sna, &c->op, box); + apply_damage_box(&c->op, box); + } +} + +fastcall static void +mono_span__fast(struct mono *c, int x1, int x2, BoxPtr box) +{ + __DBG(("%s [%d, %d]\n", __FUNCTION__, x1, x2)); + + box->x1 = x1; + box->x2 = x2; + + c->op.box(c->sna, &c->op, box); +} + +struct mono_span_thread_boxes { + const struct sna_composite_op *op; +#define MONO_SPAN_MAX_BOXES (8192/sizeof(BoxRec)) + BoxRec boxes[MONO_SPAN_MAX_BOXES]; + int num_boxes; +}; + +inline static void +thread_mono_span_add_boxes(struct mono *c, const BoxRec *box, int count) +{ + struct mono_span_thread_boxes *b = c->op.priv; + + assert(count > 0 && count <= MONO_SPAN_MAX_BOXES); + if (unlikely(b->num_boxes + count > MONO_SPAN_MAX_BOXES)) { + b->op->thread_boxes(c->sna, b->op, b->boxes, b->num_boxes); + b->num_boxes = 0; + } + + memcpy(b->boxes + b->num_boxes, box, count*sizeof(BoxRec)); + b->num_boxes += count; + assert(b->num_boxes <= MONO_SPAN_MAX_BOXES); +} + +fastcall static void +thread_mono_span_clipped(struct mono *c, int x1, int x2, BoxPtr box) +{ + pixman_region16_t region; + + __DBG(("%s [%d, %d]\n", __FUNCTION__, x1, x2)); + + box->x1 = x1; + box->x2 = x2; + + assert(c->clip.data); + + pixman_region_init_rects(®ion, box, 1); + RegionIntersect(®ion, ®ion, &c->clip); + if (REGION_NUM_RECTS(®ion)) + thread_mono_span_add_boxes(c, + REGION_RECTS(®ion), + REGION_NUM_RECTS(®ion)); + pixman_region_fini(®ion); +} + +fastcall static void +thread_mono_span(struct mono *c, int x1, int x2, BoxPtr box) +{ + __DBG(("%s [%d, %d]\n", __FUNCTION__, x1, x2)); + + box->x1 = x1; + box->x2 = x2; + thread_mono_span_add_boxes(c, box, 1); +} + +inline static void +mono_row(struct mono *c, int16_t y, int16_t h) +{ + struct mono_edge *edge = c->head.next; + int prev_x = INT_MIN; + int16_t xstart = INT16_MIN; + int winding = 0; + BoxRec box; + + DBG_MONO_EDGES(edge); + VALIDATE_MONO_EDGES(&c->head); + + box.y1 = c->clip.extents.y1 + y; + box.y2 = box.y1 + h; + + while (&c->tail != edge) { + struct mono_edge *next = edge->next; + int16_t xend = I(edge->x.quo); + + if (--edge->height_left) { + if (edge->dy) { + edge->x.quo += edge->dxdy.quo; + edge->x.rem += edge->dxdy.rem; + if (edge->x.rem >= 0) { + ++edge->x.quo; + edge->x.rem -= edge->dy; + } + } + + if (edge->x.quo < prev_x) { + struct mono_edge *pos = edge->prev; + pos->next = next; + next->prev = pos; + do { + pos = pos->prev; + } while (edge->x.quo < pos->x.quo); + pos->next->prev = edge; + edge->next = pos->next; + edge->prev = pos; + pos->next = edge; + } else + prev_x = edge->x.quo; + } else { + edge->prev->next = next; + next->prev = edge->prev; + } + + winding += edge->dir; + if (winding == 0) { + assert(I(next->x.quo) >= xend); + if (I(next->x.quo) > xend + 1) { + if (xstart < c->clip.extents.x1) + xstart = c->clip.extents.x1; + if (xend > c->clip.extents.x2) + xend = c->clip.extents.x2; + if (xend > xstart) + c->span(c, xstart, xend, &box); + xstart = INT16_MIN; + } + } else if (xstart == INT16_MIN) + xstart = xend; + + edge = next; + } + + DBG_MONO_EDGES(c->head.next); + VALIDATE_MONO_EDGES(&c->head); +} + +static bool +mono_init(struct mono *c, int num_edges) +{ + if (!mono_polygon_init(&c->polygon, &c->clip.extents, num_edges)) + return false; + + c->head.dy = 0; + c->head.height_left = INT_MAX; + c->head.x.quo = INT16_MIN << 16; + c->head.prev = NULL; + c->head.next = &c->tail; + c->tail.prev = &c->head; + c->tail.next = NULL; + c->tail.x.quo = INT16_MAX << 16; + c->tail.height_left = INT_MAX; + c->tail.dy = 0; + + c->is_vertical = 1; + + return true; +} + +static void +mono_fini(struct mono *mono) +{ + mono_polygon_fini(&mono->polygon); +} + +static void +mono_step_edges(struct mono *c, int count) +{ + struct mono_edge *edge; + + for (edge = c->head.next; edge != &c->tail; edge = edge->next) { + edge->height_left -= count; + if (! edge->height_left) { + edge->prev->next = edge->next; + edge->next->prev = edge->prev; + } + } +} + +flatten static void +mono_render(struct mono *mono) +{ + struct mono_polygon *polygon = &mono->polygon; + int i, j, h = mono->clip.extents.y2 - mono->clip.extents.y1; + + assert(mono->span); + + for (i = 0; i < h; i = j) { + j = i + 1; + + if (polygon->y_buckets[i]) + mono_merge_edges(mono, polygon->y_buckets[i]); + + if (mono->is_vertical) { + struct mono_edge *e = mono->head.next; + int min_height = h - i; + + while (e != &mono->tail) { + if (e->height_left < min_height) + min_height = e->height_left; + e = e->next; + } + + while (--min_height >= 1 && polygon->y_buckets[j] == NULL) + j++; + if (j != i + 1) + mono_step_edges(mono, j - (i + 1)); + } + + mono_row(mono, i, j-i); + + /* XXX recompute after dropping edges? */ + if (mono->head.next == &mono->tail) + mono->is_vertical = 1; + } +} + +static int operator_is_bounded(uint8_t op) +{ + switch (op) { + case PictOpOver: + case PictOpOutReverse: + case PictOpAdd: + return true; + default: + return false; + } +} + +struct mono_span_thread { + struct sna *sna; + const xTrapezoid *traps; + const struct sna_composite_op *op; + RegionPtr clip; + int ntrap; + BoxRec extents; + int dx, dy; +}; + +static void +mono_span_thread(void *arg) +{ + struct mono_span_thread *thread = arg; + struct mono mono; + struct mono_span_thread_boxes boxes; + const xTrapezoid *t; + int n; + + mono.sna = thread->sna; + + mono.clip.extents = thread->extents; + mono.clip.data = NULL; + if (thread->clip->data) { + RegionIntersect(&mono.clip, &mono.clip, thread->clip); + if (RegionNil(&mono.clip)) + return; + } + + boxes.op = thread->op; + boxes.num_boxes = 0; + mono.op.priv = &boxes; + + if (!mono_init(&mono, 2*thread->ntrap)) { + RegionUninit(&mono.clip); + return; + } + + for (n = thread->ntrap, t = thread->traps; n--; t++) { + if (!xTrapezoidValid(t)) + continue; + + if (pixman_fixed_to_int(t->top) + thread->dy >= thread->extents.y2 || + pixman_fixed_to_int(t->bottom) + thread->dy <= thread->extents.y1) + continue; + + mono_add_line(&mono, thread->dx, thread->dy, + t->top, t->bottom, + &t->left.p1, &t->left.p2, 1); + mono_add_line(&mono, thread->dx, thread->dy, + t->top, t->bottom, + &t->right.p1, &t->right.p2, -1); + } + + if (mono.clip.data == NULL) + mono.span = thread_mono_span; + else + mono.span = thread_mono_span_clipped; + + mono_render(&mono); + mono_fini(&mono); + + if (boxes.num_boxes) + thread->op->thread_boxes(thread->sna, thread->op, + boxes.boxes, boxes.num_boxes); + RegionUninit(&mono.clip); +} + +bool +mono_trapezoids_span_converter(struct sna *sna, + CARD8 op, PicturePtr src, PicturePtr dst, + INT16 src_x, INT16 src_y, + int ntrap, xTrapezoid *traps) +{ + struct mono mono; + BoxRec extents; + int16_t dst_x, dst_y; + int16_t dx, dy; + bool unbounded; + int num_threads, n; + + if (NO_SCAN_CONVERTER) + return false; + + trapezoid_origin(&traps[0].left, &dst_x, &dst_y); + + trapezoids_bounds(ntrap, traps, &extents); + if (extents.y1 >= extents.y2 || extents.x1 >= extents.x2) + return true; + + DBG(("%s: extents (%d, %d), (%d, %d)\n", + __FUNCTION__, extents.x1, extents.y1, extents.x2, extents.y2)); + + if (!sna_compute_composite_region(&mono.clip, + src, NULL, dst, + src_x + extents.x1 - dst_x, + src_y + extents.y1 - dst_y, + 0, 0, + extents.x1, extents.y1, + extents.x2 - extents.x1, + extents.y2 - extents.y1)) { + DBG(("%s: trapezoids do not intersect drawable clips\n", + __FUNCTION__)) ; + return true; + } + + dx = dst->pDrawable->x; + dy = dst->pDrawable->y; + + DBG(("%s: after clip -- extents (%d, %d), (%d, %d), delta=(%d, %d) src -> (%d, %d)\n", + __FUNCTION__, + mono.clip.extents.x1, mono.clip.extents.y1, + mono.clip.extents.x2, mono.clip.extents.y2, + dx, dy, + src_x + mono.clip.extents.x1 - dst_x - dx, + src_y + mono.clip.extents.y1 - dst_y - dy)); + + unbounded = (!sna_drawable_is_clear(dst->pDrawable) && + !operator_is_bounded(op)); + + mono.sna = sna; + if (!mono.sna->render.composite(mono.sna, op, src, NULL, dst, + src_x + mono.clip.extents.x1 - dst_x - dx, + src_y + mono.clip.extents.y1 - dst_y - dy, + 0, 0, + mono.clip.extents.x1, mono.clip.extents.y1, + mono.clip.extents.x2 - mono.clip.extents.x1, + mono.clip.extents.y2 - mono.clip.extents.y1, + memset(&mono.op, 0, sizeof(mono.op)))) + return false; + + num_threads = 1; + if (!NO_GPU_THREADS && + mono.op.thread_boxes && + mono.op.damage == NULL && + !unbounded) + num_threads = sna_use_threads(mono.clip.extents.x2 - mono.clip.extents.x1, + mono.clip.extents.y2 - mono.clip.extents.y1, + 32); + if (num_threads > 1) { + struct mono_span_thread threads[num_threads]; + int y, h; + + DBG(("%s: using %d threads for mono span compositing %dx%d\n", + __FUNCTION__, num_threads, + mono.clip.extents.x2 - mono.clip.extents.x1, + mono.clip.extents.y2 - mono.clip.extents.y1)); + + threads[0].sna = mono.sna; + threads[0].op = &mono.op; + threads[0].traps = traps; + threads[0].ntrap = ntrap; + threads[0].extents = mono.clip.extents; + threads[0].clip = &mono.clip; + threads[0].dx = dx; + threads[0].dy = dy; + + y = extents.y1; + h = extents.y2 - extents.y1; + h = (h + num_threads - 1) / num_threads; + + for (n = 1; n < num_threads; n++) { + threads[n] = threads[0]; + threads[n].extents.y1 = y; + threads[n].extents.y2 = y += h; + + sna_threads_run(mono_span_thread, &threads[n]); + } + + threads[0].extents.y1 = y; + threads[0].extents.y2 = extents.y2; + mono_span_thread(&threads[0]); + + sna_threads_wait(); + mono.op.done(mono.sna, &mono.op); + return true; + } + + if (!mono_init(&mono, 2*ntrap)) + return false; + + for (n = 0; n < ntrap; n++) { + if (!xTrapezoidValid(&traps[n])) + continue; + + if (pixman_fixed_integer_floor(traps[n].top) + dy >= mono.clip.extents.y2 || + pixman_fixed_integer_ceil(traps[n].bottom) + dy <= mono.clip.extents.y1) + continue; + + mono_add_line(&mono, dx, dy, + traps[n].top, traps[n].bottom, + &traps[n].left.p1, &traps[n].left.p2, 1); + mono_add_line(&mono, dx, dy, + traps[n].top, traps[n].bottom, + &traps[n].right.p1, &traps[n].right.p2, -1); + } + + if (mono.clip.data == NULL && mono.op.damage == NULL) + mono.span = mono_span__fast; + else + mono.span = mono_span; + + mono_render(&mono); + mono.op.done(mono.sna, &mono.op); + mono_fini(&mono); + + if (unbounded) { + xPointFixed p1, p2; + + if (!mono_init(&mono, 2+2*ntrap)) + return false; + + p1.y = mono.clip.extents.y1 * pixman_fixed_1; + p2.y = mono.clip.extents.y2 * pixman_fixed_1; + + p1.x = mono.clip.extents.x1 * pixman_fixed_1; + p2.x = mono.clip.extents.x1 * pixman_fixed_1; + mono_add_line(&mono, 0, 0, p1.y, p2.y, &p1, &p2, -1); + + p1.x = mono.clip.extents.x2 * pixman_fixed_1; + p2.x = mono.clip.extents.x2 * pixman_fixed_1; + mono_add_line(&mono, 0, 0, p1.y, p2.y, &p1, &p2, 1); + + for (n = 0; n < ntrap; n++) { + if (!xTrapezoidValid(&traps[n])) + continue; + + if (pixman_fixed_to_int(traps[n].top) + dy >= mono.clip.extents.y2 || + pixman_fixed_to_int(traps[n].bottom) + dy < mono.clip.extents.y1) + continue; + + mono_add_line(&mono, dx, dy, + traps[n].top, traps[n].bottom, + &traps[n].left.p1, &traps[n].left.p2, 1); + mono_add_line(&mono, dx, dy, + traps[n].top, traps[n].bottom, + &traps[n].right.p1, &traps[n].right.p2, -1); + } + memset(&mono.op, 0, sizeof(mono.op)); + if (mono.sna->render.composite(mono.sna, + PictOpClear, + mono.sna->clear, NULL, dst, + 0, 0, + 0, 0, + mono.clip.extents.x1, mono.clip.extents.y1, + mono.clip.extents.x2 - mono.clip.extents.x1, + mono.clip.extents.y2 - mono.clip.extents.y1, + &mono.op)) { + mono_render(&mono); + mono.op.done(mono.sna, &mono.op); + } + mono_fini(&mono); + } + + REGION_UNINIT(NULL, &mono.clip); + return true; +} + +struct mono_inplace_composite { + pixman_image_t *src, *dst; + int dx, dy; + int sx, sy; + int op; +}; +struct mono_inplace_fill { + uint32_t *data, stride; + uint32_t color; + int bpp; +}; + +fastcall static void +mono_inplace_fill_box(struct sna *sna, + const struct sna_composite_op *op, + const BoxRec *box) +{ + struct mono_inplace_fill *fill = op->priv; + + DBG(("(%s: (%d, %d)x(%d, %d):%08x\n", + __FUNCTION__, + box->x1, box->y1, + box->x2 - box->x1, + box->y2 - box->y1, + fill->color)); + pixman_fill(fill->data, fill->stride, fill->bpp, + box->x1, box->y1, + box->x2 - box->x1, + box->y2 - box->y1, + fill->color); +} + +static void +mono_inplace_fill_boxes(struct sna *sna, + const struct sna_composite_op *op, + const BoxRec *box, int nbox) +{ + struct mono_inplace_fill *fill = op->priv; + + do { + DBG(("(%s: (%d, %d)x(%d, %d):%08x\n", + __FUNCTION__, + box->x1, box->y1, + box->x2 - box->x1, + box->y2 - box->y1, + fill->color)); + pixman_fill(fill->data, fill->stride, fill->bpp, + box->x1, box->y1, + box->x2 - box->x1, + box->y2 - box->y1, + fill->color); + box++; + } while (--nbox); +} + +fastcall static void +mono_inplace_composite_box(struct sna *sna, + const struct sna_composite_op *op, + const BoxRec *box) +{ + struct mono_inplace_composite *c = op->priv; + + pixman_image_composite(c->op, c->src, NULL, c->dst, + box->x1 + c->sx, box->y1 + c->sy, + 0, 0, + box->x1 + c->dx, box->y1 + c->dy, + box->x2 - box->x1, + box->y2 - box->y1); +} + +static void +mono_inplace_composite_boxes(struct sna *sna, + const struct sna_composite_op *op, + const BoxRec *box, int nbox) +{ + struct mono_inplace_composite *c = op->priv; + + do { + pixman_image_composite(c->op, c->src, NULL, c->dst, + box->x1 + c->sx, box->y1 + c->sy, + 0, 0, + box->x1 + c->dx, box->y1 + c->dy, + box->x2 - box->x1, + box->y2 - box->y1); + box++; + } while (--nbox); +} + +bool +mono_trapezoid_span_inplace(struct sna *sna, + CARD8 op, + PicturePtr src, + PicturePtr dst, + INT16 src_x, INT16 src_y, + int ntrap, xTrapezoid *traps) +{ + struct mono mono; + union { + struct mono_inplace_fill fill; + struct mono_inplace_composite composite; + } inplace; + int was_clear; + int x, y, n; + + trapezoids_bounds(ntrap, traps, &mono.clip.extents); + if (mono.clip.extents.y1 >= mono.clip.extents.y2 || + mono.clip.extents.x1 >= mono.clip.extents.x2) + return true; + + DBG(("%s: extents (%d, %d), (%d, %d)\n", + __FUNCTION__, + mono.clip.extents.x1, mono.clip.extents.y1, + mono.clip.extents.x2, mono.clip.extents.y2)); + + if (!sna_compute_composite_region(&mono.clip, + src, NULL, dst, + src_x, src_y, + 0, 0, + mono.clip.extents.x1, mono.clip.extents.y1, + mono.clip.extents.x2 - mono.clip.extents.x1, + mono.clip.extents.y2 - mono.clip.extents.y1)) { + DBG(("%s: trapezoids do not intersect drawable clips\n", + __FUNCTION__)) ; + return true; + } + + DBG(("%s: clipped extents (%d, %d), (%d, %d)\n", + __FUNCTION__, + mono.clip.extents.x1, mono.clip.extents.y1, + mono.clip.extents.x2, mono.clip.extents.y2)); + + was_clear = sna_drawable_is_clear(dst->pDrawable); + if (!sna_drawable_move_region_to_cpu(dst->pDrawable, &mono.clip, + MOVE_WRITE | MOVE_READ)) + return true; + + mono.sna = sna; + if (!mono_init(&mono, 2*ntrap)) + return false; + + mono.op.damage = NULL; + + x = dst->pDrawable->x; + y = dst->pDrawable->y; + + for (n = 0; n < ntrap; n++) { + if (!xTrapezoidValid(&traps[n])) + continue; + + if (pixman_fixed_to_int(traps[n].top) + y >= mono.clip.extents.y2 || + pixman_fixed_to_int(traps[n].bottom) + y < mono.clip.extents.y1) + continue; + + mono_add_line(&mono, x, y, + traps[n].top, traps[n].bottom, + &traps[n].left.p1, &traps[n].left.p2, 1); + mono_add_line(&mono, x, y, + traps[n].top, traps[n].bottom, + &traps[n].right.p1, &traps[n].right.p2, -1); + } + + if (sna_picture_is_solid(src, &inplace.fill.color) && + (op == PictOpSrc || op == PictOpClear || + (was_clear && (op == PictOpOver || op == PictOpAdd)) || + (op == PictOpOver && inplace.fill.color >> 24 == 0xff))) { + PixmapPtr pixmap; + int16_t dx, dy; + uint8_t *ptr; + +unbounded_pass: + pixmap = get_drawable_pixmap(dst->pDrawable); + + ptr = pixmap->devPrivate.ptr; + if (get_drawable_deltas(dst->pDrawable, pixmap, &dx, &dy)) + ptr += dy * pixmap->devKind + dx * pixmap->drawable.bitsPerPixel / 8; + inplace.fill.data = (uint32_t *)ptr; + inplace.fill.stride = pixmap->devKind / sizeof(uint32_t); + inplace.fill.bpp = pixmap->drawable.bitsPerPixel; + + if (op == PictOpClear) + inplace.fill.color = 0; + else if (dst->format != PICT_a8r8g8b8) + inplace.fill.color = sna_rgba_to_color(inplace.fill.color, dst->format); + + DBG(("%s: fill %x\n", __FUNCTION__, inplace.fill.color)); + + mono.op.priv = &inplace.fill; + mono.op.box = mono_inplace_fill_box; + mono.op.boxes = mono_inplace_fill_boxes; + + op = 0; + } else { + if (src->pDrawable) { + if (!sna_drawable_move_to_cpu(src->pDrawable, + MOVE_READ)) { + mono_fini(&mono); + return false; + } + if (src->alphaMap && + !sna_drawable_move_to_cpu(src->alphaMap->pDrawable, + MOVE_READ)) { + mono_fini(&mono); + return false; + } + } + + inplace.composite.dst = image_from_pict(dst, false, + &inplace.composite.dx, + &inplace.composite.dy); + inplace.composite.src = image_from_pict(src, false, + &inplace.composite.sx, + &inplace.composite.sy); + inplace.composite.sx += + src_x - pixman_fixed_to_int(traps[0].left.p1.x), + inplace.composite.sy += + src_y - pixman_fixed_to_int(traps[0].left.p1.y), + inplace.composite.op = op; + + mono.op.priv = &inplace.composite; + mono.op.box = mono_inplace_composite_box; + mono.op.boxes = mono_inplace_composite_boxes; + } + + if (mono.clip.data == NULL && mono.op.damage == NULL) + mono.span = mono_span__fast; + else + mono.span = mono_span; + mono_render(&mono); + mono_fini(&mono); + + if (op) { + free_pixman_pict(src, inplace.composite.src); + free_pixman_pict(dst, inplace.composite.dst); + + if (!was_clear && !operator_is_bounded(op)) { + xPointFixed p1, p2; + + DBG(("%s: unbounded fixup\n", __FUNCTION__)); + + if (!mono_init(&mono, 2+2*ntrap)) + return false; + + p1.y = mono.clip.extents.y1 * pixman_fixed_1; + p2.y = mono.clip.extents.y2 * pixman_fixed_1; + + p1.x = mono.clip.extents.x1 * pixman_fixed_1; + p2.x = mono.clip.extents.x1 * pixman_fixed_1; + mono_add_line(&mono, 0, 0, p1.y, p2.y, &p1, &p2, -1); + + p1.x = mono.clip.extents.x2 * pixman_fixed_1; + p2.x = mono.clip.extents.x2 * pixman_fixed_1; + mono_add_line(&mono, 0, 0, p1.y, p2.y, &p1, &p2, 1); + + for (n = 0; n < ntrap; n++) { + if (!xTrapezoidValid(&traps[n])) + continue; + + if (pixman_fixed_to_int(traps[n].top) + x >= mono.clip.extents.y2 || + pixman_fixed_to_int(traps[n].bottom) + y < mono.clip.extents.y1) + continue; + + mono_add_line(&mono, x, y, + traps[n].top, traps[n].bottom, + &traps[n].left.p1, &traps[n].left.p2, 1); + mono_add_line(&mono, x, y, + traps[n].top, traps[n].bottom, + &traps[n].right.p1, &traps[n].right.p2, -1); + } + + op = PictOpClear; + goto unbounded_pass; + } + } + + return true; +} + +bool +mono_trap_span_converter(struct sna *sna, + PicturePtr dst, + INT16 x, INT16 y, + int ntrap, xTrap *traps) +{ + struct mono mono; + xRenderColor white; + PicturePtr src; + int error; + int n; + + white.red = white.green = white.blue = white.alpha = 0xffff; + src = CreateSolidPicture(0, &white, &error); + if (src == NULL) + return true; + + mono.clip = *dst->pCompositeClip; + x += dst->pDrawable->x; + y += dst->pDrawable->y; + + DBG(("%s: after clip -- extents (%d, %d), (%d, %d), delta=(%d, %d)\n", + __FUNCTION__, + mono.clip.extents.x1, mono.clip.extents.y1, + mono.clip.extents.x2, mono.clip.extents.y2, + x, y)); + + mono.sna = sna; + if (!mono_init(&mono, 2*ntrap)) + return false; + + for (n = 0; n < ntrap; n++) { + xPointFixed p1, p2; + + if (pixman_fixed_to_int(traps[n].top.y) + y >= mono.clip.extents.y2 || + pixman_fixed_to_int(traps[n].bot.y) + y < mono.clip.extents.y1) + continue; + + p1.y = traps[n].top.y; + p2.y = traps[n].bot.y; + + p1.x = traps[n].top.l; + p2.x = traps[n].bot.l; + mono_add_line(&mono, x, y, + traps[n].top.y, traps[n].bot.y, + &p1, &p2, 1); + + p1.x = traps[n].top.r; + p2.x = traps[n].bot.r; + mono_add_line(&mono, x, y, + traps[n].top.y, traps[n].bot.y, + &p1, &p2, -1); + } + + memset(&mono.op, 0, sizeof(mono.op)); + if (mono.sna->render.composite(mono.sna, PictOpAdd, src, NULL, dst, + 0, 0, + 0, 0, + mono.clip.extents.x1, mono.clip.extents.y1, + mono.clip.extents.x2 - mono.clip.extents.x1, + mono.clip.extents.y2 - mono.clip.extents.y1, + &mono.op)) { + mono_render(&mono); + mono.op.done(mono.sna, &mono.op); + } + + mono_fini(&mono); + FreePicture(src, 0); + return true; +} + +bool +mono_triangles_span_converter(struct sna *sna, + CARD8 op, PicturePtr src, PicturePtr dst, + INT16 src_x, INT16 src_y, + int count, xTriangle *tri) +{ + struct mono mono; + BoxRec extents; + int16_t dst_x, dst_y; + int16_t dx, dy; + bool was_clear; + int n; + + mono.sna = sna; + + dst_x = pixman_fixed_to_int(tri[0].p1.x); + dst_y = pixman_fixed_to_int(tri[0].p1.y); + + miTriangleBounds(count, tri, &extents); + DBG(("%s: extents (%d, %d), (%d, %d)\n", + __FUNCTION__, extents.x1, extents.y1, extents.x2, extents.y2)); + + if (extents.y1 >= extents.y2 || extents.x1 >= extents.x2) + return true; + + if (!sna_compute_composite_region(&mono.clip, + src, NULL, dst, + src_x + extents.x1 - dst_x, + src_y + extents.y1 - dst_y, + 0, 0, + extents.x1, extents.y1, + extents.x2 - extents.x1, + extents.y2 - extents.y1)) { + DBG(("%s: triangles do not intersect drawable clips\n", + __FUNCTION__)) ; + return true; + } + + dx = dst->pDrawable->x; + dy = dst->pDrawable->y; + + DBG(("%s: after clip -- extents (%d, %d), (%d, %d), delta=(%d, %d) src -> (%d, %d)\n", + __FUNCTION__, + mono.clip.extents.x1, mono.clip.extents.y1, + mono.clip.extents.x2, mono.clip.extents.y2, + dx, dy, + src_x + mono.clip.extents.x1 - dst_x - dx, + src_y + mono.clip.extents.y1 - dst_y - dy)); + + was_clear = sna_drawable_is_clear(dst->pDrawable); + + if (mono_init(&mono, 3*count)) + return false; + + for (n = 0; n < count; n++) { + mono_add_line(&mono, dx, dy, + tri[n].p1.y, tri[n].p2.y, + &tri[n].p1, &tri[n].p2, 1); + mono_add_line(&mono, dx, dy, + tri[n].p2.y, tri[n].p3.y, + &tri[n].p2, &tri[n].p3, 1); + mono_add_line(&mono, dx, dy, + tri[n].p3.y, tri[n].p1.y, + &tri[n].p3, &tri[n].p1, 1); + } + + memset(&mono.op, 0, sizeof(mono.op)); + if (mono.sna->render.composite(mono.sna, op, src, NULL, dst, + src_x + mono.clip.extents.x1 - dst_x - dx, + src_y + mono.clip.extents.y1 - dst_y - dy, + 0, 0, + mono.clip.extents.x1, mono.clip.extents.y1, + mono.clip.extents.x2 - mono.clip.extents.x1, + mono.clip.extents.y2 - mono.clip.extents.y1, + &mono.op)) { + if (mono.clip.data == NULL && mono.op.damage == NULL) + mono.span = mono_span__fast; + else + mono.span = mono_span; + mono_render(&mono); + mono.op.done(mono.sna, &mono.op); + } + + if (!was_clear && !operator_is_bounded(op)) { + xPointFixed p1, p2; + + if (!mono_init(&mono, 2+3*count)) + return false; + + p1.y = mono.clip.extents.y1 * pixman_fixed_1; + p2.y = mono.clip.extents.y2 * pixman_fixed_1; + + p1.x = mono.clip.extents.x1 * pixman_fixed_1; + p2.x = mono.clip.extents.x1 * pixman_fixed_1; + mono_add_line(&mono, 0, 0, p1.y, p2.y, &p1, &p2, -1); + + p1.x = mono.clip.extents.x2 * pixman_fixed_1; + p2.x = mono.clip.extents.x2 * pixman_fixed_1; + mono_add_line(&mono, 0, 0, p1.y, p2.y, &p1, &p2, 1); + + for (n = 0; n < count; n++) { + mono_add_line(&mono, dx, dy, + tri[n].p1.y, tri[n].p2.y, + &tri[n].p1, &tri[n].p2, 1); + mono_add_line(&mono, dx, dy, + tri[n].p2.y, tri[n].p3.y, + &tri[n].p2, &tri[n].p3, 1); + mono_add_line(&mono, dx, dy, + tri[n].p3.y, tri[n].p1.y, + &tri[n].p3, &tri[n].p1, 1); + } + + memset(&mono.op, 0, sizeof(mono.op)); + if (mono.sna->render.composite(mono.sna, + PictOpClear, + mono.sna->clear, NULL, dst, + 0, 0, + 0, 0, + mono.clip.extents.x1, mono.clip.extents.y1, + mono.clip.extents.x2 - mono.clip.extents.x1, + mono.clip.extents.y2 - mono.clip.extents.y1, + &mono.op)) { + if (mono.clip.data == NULL && mono.op.damage == NULL) + mono.span = mono_span__fast; + else + mono.span = mono_span; + mono_render(&mono); + mono.op.done(mono.sna, &mono.op); + } + mono_fini(&mono); + } + + mono_fini(&mono); + REGION_UNINIT(NULL, &mono.clip); + return true; +} |