Lines Matching defs:path
226 inline bool get_direction(const SkPath& path, const SkMatrix& m, SkPathFirstDirection* dir) {
227 // At this point, we've already returned true from canDraw(), which checked that the path's
229 // However, if perspective is involved, we're operating on a transformed path, which may no
231 *dir = SkPathPriv::ComputeFirstDirection(path);
277 bool get_segments(const SkPath& path,
283 SkPath::Iter iter(path, true);
284 // This renderer over-emphasizes very thin path regions. We use the distance
285 // to the path from the sample to compute coverage. Every pixel intersected
286 // by the path will be hit and the maximum distance is sqrt(2)/2. We don't
287 // notice that the sample may be close to a very thin area of the path and
293 if (!get_direction(path, m, &dir)) {
700 const SkPath& path,
702 return Helper::FactoryHelper<AAConvexPathOp>(context, std::move(paint), viewMatrix, path,
707 const SkMatrix& viewMatrix, const SkPath& path,
710 fPaths.emplace_back(PathData{viewMatrix, path, color});
711 this->setTransformedBounds(path.getBounds(), viewMatrix, HasAABloat::kYes,
779 // We use the fact that SkPath::transform path does subdivision based on
784 // We avoid initializing the path unless we have to
911 // the geometry segments. Degenerate convex paths will fall through to some other path renderer.
927 SkPath path;
928 args.fShape->asPath(&path);
932 path, args.fUserStencilSettings);
943 const SkPath& path = GrTest::TestPathConvex(random);
945 return skgpu::v1::AAConvexPathOp::Make(context, std::move(paint), viewMatrix, path,