Lines Matching defs:alpha
250 bool GrTriangulator::Edge::intersect(const Edge& other, SkPoint* p, uint8_t* alpha) const {
260 double s, t; // needed to interpolate vertex alpha
269 if (alpha) {
273 *alpha = 255;
277 *alpha = 0;
280 // Take the max interpolated alpha
282 *alpha = std::max((1.0 - s) * fTop->fAlpha + s * fBottom->fAlpha,
986 Vertex* GrTriangulator::makeSortedVertex(const SkPoint& p, uint8_t alpha, VertexList* mesh,
1003 v = fAlloc->make<Vertex>(p, alpha);
1050 uint8_t alpha = edge1->fType == EdgeType::kOuter ? 255 : 0;
1051 v->fPartner = fAlloc->make<Vertex>(p, alpha);
1052 TESS_LOG("computed bisector (%g,%g) alpha %d for vertex %g\n", p.fX, p.fY, alpha, v->fID);
1063 uint8_t alpha;
1064 if (left->intersect(*right, &p, &alpha) && p.isFinite()) {
1089 v = this->makeSortedVertex(p, alpha, mesh, top, c);
1099 v->fAlpha = std::max(v->fAlpha, alpha);
1242 TESS_LOG("vertex %g (%g, %g) alpha %d", v->fID, v->fPoint.fX, v->fPoint.fY, v->fAlpha);
1244 TESS_LOG(", partner %g (%g, %g) alpha %d\n",
1309 TESS_LOG("\nvertex %g: (%g,%g), alpha %d\n",
1362 TESS_LOG("\nvertex %g: (%g,%g), alpha %d\n", v->fID, v->fPoint.fX, v->fPoint.fY, v->fAlpha);