Lines Matching refs:coverage
59 int coverage);
176 /* A cell records the effect on pixel coverage of polygon edges
178 * coverage.
180 * Consider the effects of a polygon edge on the coverage of a pixel
181 * it intersects and that of the following one. The coverage of the
183 * of the pixel, and the coverage of the pixel itself is the area of
204 * Since the coverage of the following pixel will always be a multiple
206 * area instead. The coverage of the pixel itself is the total
207 * coverage minus the area of the uncovered area to the left of the
209 * that and subtract it from the total coverage later when forming
358 /* Add a subpixel span covering [x1, x2) to the coverage cells. */
1000 int coverage)
1002 __DBG(("%s: %d -> %d @ %d\n", __FUNCTION__, box->x1, box->x2, coverage));
1004 op->box(sna, op, box, AREA_TO_ALPHA(coverage));
1013 int coverage)
1015 __DBG(("%s: %d -> %d @ %d\n", __FUNCTION__, box->x1, box->x2, coverage));
1017 op->box(sna, op, box, AREA_TO_ALPHA(coverage));
1025 int coverage)
1030 opacity = AREA_TO_ALPHA(coverage);
1050 int coverage)
1052 if (coverage < FAST_SAMPLES_XY/2)
1063 int coverage)
1065 if (coverage < FAST_SAMPLES_XY/2)
1076 int coverage)
1079 coverage < FAST_SAMPLES_XY/2 ? 0 : FAST_SAMPLES_XY);
1087 int coverage)
1090 coverage < FAST_SAMPLES_XY/2 ? 0 : FAST_SAMPLES_XY);
1102 int coverage),
1177 int coverage),
1729 int coverage)
1733 __DBG(("%s: %d -> %d @ %d\n", __FUNCTION__, box->x1, box->x2, coverage));
1739 bb->alpha == AREA_TO_ALPHA(coverage)) {
1746 span_thread_add_box(sna, op, box, AREA_TO_ALPHA(coverage));
1754 int coverage)
1760 AREA_TO_ALPHA(coverage)));
1776 span_thread_add_box(sna, op, &clipped, AREA_TO_ALPHA(coverage));
2039 int coverage)
2045 coverage = 256 * coverage / FAST_SAMPLES_XY;
2046 coverage -= coverage >> 8;
2053 *ptr = coverage;
2056 *ptr = coverage;
2060 memset(ptr, coverage, w);
2070 int coverage)
2073 coverage < FAST_SAMPLES_XY/2 ? 0 : FAST_SAMPLES_XY);
2201 static force_inline uint8_t coverage_opacity(int coverage, uint8_t opacity)
2203 coverage = coverage * 256 / FAST_SAMPLES_XY;
2204 coverage -= coverage >> 8;
2205 return opacity == 255 ? coverage : mul_8_8(coverage, opacity);
2240 int coverage)
2259 cs->span(sna, op, NULL, &clipped, coverage);
2281 int coverage)
2285 _tor_blt_src(in, box, coverage_opacity(coverage, in->opacity));
2293 int coverage)
2299 if (coverage == 0) {
2304 coverage = coverage_opacity(coverage, in->opacity);
2305 if (coverage == 0xff)
2314 ptr[i] = mul_8_8(ptr[i], coverage);
2324 int coverage)
2330 if (coverage == 0)
2333 coverage = coverage_opacity(coverage, in->opacity);
2334 if (coverage == 0xff) {
2344 v = coverage + *ptr;
2349 v = coverage + ptr[i];
2362 int coverage)
2369 if (coverage == 0)
2377 if (coverage == FAST_SAMPLES_XY) {
2393 coverage = coverage * 256 / FAST_SAMPLES_XY;
2394 coverage -= coverage >> 8;
2397 *ptr = lerp8x4(in->color, coverage, *ptr);
2400 *ptr = lerp8x4(in->color, coverage, *ptr);
2406 ptr[i] = lerp8x4(in->color, coverage, ptr[i]);
2427 int coverage)
2430 if (coverage != FAST_SAMPLES_XY) {
2431 coverage = coverage * 256 / FAST_SAMPLES_XY;
2432 coverage -= coverage >> 8;
2433 *pi->bits = mul_4x8_8(pi->color, coverage);
2448 int coverage)
2452 if (coverage != FAST_SAMPLES_XY) {
2453 coverage = coverage * 256 / FAST_SAMPLES_XY;
2454 coverage -= coverage >> 8;
2455 *pi->bits = coverage;
3543 int coverage);