Searched refs:avgLength (Results 1 – 2 of 2) sorted by relevance
| /external/skqp/src/core/ |
| D | SkScan_AntiPath.cpp | 607 static void compute_complexity(const SkPath& path, SkScalar& avgLength, SkScalar& complexity) { in compute_complexity() argument
611 avgLength = complexity = -1; in compute_complexity()
622 avgLength = sumLength / (kSampleSize - 1); in compute_complexity()
630 SkScalar intersections = sk_ieee_float_divide(sqr(n) * sqr(avgLength), diagonalSqr); in compute_complexity()
640 static bool ShouldUseDAA(const SkPath& path, SkScalar avgLength, SkScalar complexity) { in ShouldUseDAA() argument
656 if (avgLength < 0 || complexity < 0 || path.getBounds().isEmpty() || path.isConvex()) { in ShouldUseDAA()
668 if (avgLength < kSmallCubicThreshold) { in ShouldUseDAA()
685 static bool ShouldUseAAA(const SkPath& path, SkScalar avgLength, SkScalar complexity) { in ShouldUseAAA() argument
836 SkScalar avgLength, complexity; in AntiFillPath() local
837 compute_complexity(path, avgLength, complexity); in AntiFillPath()
[all …]
|
| /external/skia/src/core/ |
| D | SkScan_AntiPath.cpp | 607 static void compute_complexity(const SkPath& path, SkScalar& avgLength, SkScalar& complexity) { in compute_complexity() argument
611 avgLength = complexity = -1; in compute_complexity()
622 avgLength = sumLength / (kSampleSize - 1); in compute_complexity()
630 SkScalar intersections = sk_ieee_float_divide(sqr(n) * sqr(avgLength), diagonalSqr); in compute_complexity()
640 static bool ShouldUseDAA(const SkPath& path, SkScalar avgLength, SkScalar complexity) { in ShouldUseDAA() argument
656 if (avgLength < 0 || complexity < 0 || path.getBounds().isEmpty() || path.isConvex()) { in ShouldUseDAA()
668 if (avgLength < kSmallCubicThreshold) { in ShouldUseDAA()
685 static bool ShouldUseAAA(const SkPath& path, SkScalar avgLength, SkScalar complexity) { in ShouldUseAAA() argument
836 SkScalar avgLength, complexity; in AntiFillPath() local
837 compute_complexity(path, avgLength, complexity); in AntiFillPath()
[all …]
|