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. */
990 int coverage)
992 __DBG(("%s: %d -> %d @ %d\n", __FUNCTION__, box->x1, box->x2, coverage));
994 op->box(sna, op, box, AREA_TO_ALPHA(coverage));
1003 int coverage)
1005 __DBG(("%s: %d -> %d @ %d\n", __FUNCTION__, box->x1, box->x2, coverage));
1007 op->box(sna, op, box, AREA_TO_ALPHA(coverage));
1015 int coverage)
1020 opacity = AREA_TO_ALPHA(coverage);
1040 int coverage)
1042 if (coverage < FAST_SAMPLES_XY/2)
1053 int coverage)
1055 if (coverage < FAST_SAMPLES_XY/2)
1066 int coverage)
1069 coverage < FAST_SAMPLES_XY/2 ? 0 : FAST_SAMPLES_XY);
1077 int coverage)
1080 coverage < FAST_SAMPLES_XY/2 ? 0 : FAST_SAMPLES_XY);
1092 int coverage),
1167 int coverage),
1723 int coverage)
1725 __DBG(("%s: %d -> %d @ %d\n", __FUNCTION__, box->x1, box->x2, coverage));
1726 span_thread_add_boxes(sna, op, box, 1, AREA_TO_ALPHA(coverage));
1734 int coverage)
1739 AREA_TO_ALPHA(coverage)));
1747 AREA_TO_ALPHA(coverage));
2002 int coverage)
2008 coverage = 256 * coverage / FAST_SAMPLES_XY;
2009 coverage -= coverage >> 8;
2016 *ptr = coverage;
2019 *ptr = coverage;
2023 memset(ptr, coverage, w);
2033 int coverage)
2036 coverage < FAST_SAMPLES_XY/2 ? 0 : FAST_SAMPLES_XY);
2164 static force_inline uint8_t coverage_opacity(int coverage, uint8_t opacity)
2166 coverage = coverage * 256 / FAST_SAMPLES_XY;
2167 coverage -= coverage >> 8;
2168 return opacity == 255 ? coverage : mul_8_8(coverage, opacity);
2198 int coverage)
2202 _tor_blt_src(in, box, coverage_opacity(coverage, in->opacity));
2210 int coverage)
2220 tor_blt_src(sna, op, NULL, box++, coverage);
2229 int coverage)
2235 if (coverage == 0) {
2240 coverage = coverage_opacity(coverage, in->opacity);
2241 if (coverage == 0xff)
2250 ptr[i] = mul_8_8(ptr[i], coverage);
2260 int coverage)
2270 tor_blt_in(sna, op, NULL, box++, coverage);
2279 int coverage)
2285 if (coverage == 0)
2288 coverage = coverage_opacity(coverage, in->opacity);
2289 if (coverage == 0xff) {
2299 v = coverage + *ptr;
2304 v = coverage + ptr[i];
2317 int coverage)
2327 tor_blt_add(sna, op, NULL, box++, coverage);
2336 int coverage)
2343 if (coverage == 0)
2350 if (coverage == FAST_SAMPLES_XY) {
2366 coverage = coverage * 256 / FAST_SAMPLES_XY;
2367 coverage -= coverage >> 8;
2370 *ptr = lerp8x4(in->color, coverage, *ptr);
2373 *ptr = lerp8x4(in->color, coverage, *ptr);
2379 ptr[i] = lerp8x4(in->color, coverage, ptr[i]);
2391 int coverage)
2401 tor_blt_lerp32(sna, op, NULL, box++, coverage);
2419 int coverage)
2422 if (coverage != FAST_SAMPLES_XY) {
2423 coverage = coverage * 256 / FAST_SAMPLES_XY;
2424 coverage -= coverage >> 8;
2425 *pi->bits = mul_4x8_8(pi->color, coverage);
2439 int coverage)
2449 pixmask_span_solid(sna, op, NULL, box++, coverage);
2458 int coverage)
2462 if (coverage != FAST_SAMPLES_XY) {
2463 coverage = coverage * 256 / FAST_SAMPLES_XY;
2464 coverage -= coverage >> 8;
2465 *pi->bits = coverage;
2479 int coverage)
2489 pixmask_span(sna, op, NULL, box++, coverage);
3584 int coverage);