Lines Matching refs:coverage
658 // Iterate triangle coverage front to back, find the stack of pontentially contributing fragments
661 const CoverageType coverage = calculateTriangleCoverage(scene.triangles[triNdx].positions[0],
669 if (coverage == COVERAGE_FULL || coverage == COVERAGE_PARTIAL)
694 if (coverage == COVERAGE_FULL)
703 // Partial coverage == background may be visible
713 // No coverage
1030 if ((deUint32)packets[packetNdx].coverage & (1 << fragNdx))
1369 DE_ASSERT(scene.lines.size() < 8); // coverage indices are stored as bitmask in a unsigned 8-bit ints
1384 // Reference renderer produces correct fragments using the diamond-exit-rule. Make 2D int array, store line coverage as a 8-bit bitfield
1385 // The map is used to find lines with potential coverage to a given pixel
1408 // Calculate correct line coverage
1421 if ((deUint32)packets[packetNdx].coverage & (1 << fragNdx))
1437 // Find all possible lines with coverage, check pixel color matches one of them
1451 // Find lines with possible coverage
1456 const int coverage = referenceLineMap.getAccess().getPixelInt(x+dx, y+dy).x();
1458 lineCoverageSet |= coverage;
1459 lineSurroundingCoverage &= coverage;
1766 // generate coverage map
1780 const CoverageType coverage = calculateTriangleCoverage(scene.triangles[triNdx].positions[0],
1788 if (coverage == COVERAGE_FULL)
1792 else if (coverage == COVERAGE_PARTIAL)
1798 // on multiple edges, some of which are not shared. In these cases the coverage cannot be determined.
1799 // Assume full coverage if the pixel is only on a shared edge in shared triangle too.
1838 // coverage where there should not be
1852 // no coverage where there should be
