| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| CurveIntersection.h | 68 bool isLinear(const Quadratic& quad, int startIndex, int endIndex);
69 bool isLinear(const Cubic& cubic, int startIndex, int endIndex);
|
| QuadraticReduceOrder.cpp | 77 if (!isLinear(quad, startIndex, endIndex)) {
127 bool isLinear(const Quadratic& quad, int startIndex, int endIndex) {
|
| CubicReduceOrder.cpp | 105 if (!isLinear(cubic, startIndex, endIndex)) {
158 bool isLinear(const Cubic& cubic, int startIndex, int endIndex) {
|
| QuadraticImplicit.cpp | 251 static bool isLinear(const Quadratic& q1, const Quadratic& q2, Intersections& i) {
424 if (isLinear(q1, q2, i)) {
427 if (isLinear(q2, q1, i)) {
|
| Simplify.cpp | 564 return isLinear(aQuad, 0, 2);
569 return isLinear(aCubic, 0, 3);
[all...] |
| /external/skia/experimental/Intersection/ |
| CurveIntersection.h | 68 bool isLinear(const Quadratic& quad, int startIndex, int endIndex);
69 bool isLinear(const Cubic& cubic, int startIndex, int endIndex);
|
| QuadraticReduceOrder.cpp | 77 if (!isLinear(quad, startIndex, endIndex)) {
127 bool isLinear(const Quadratic& quad, int startIndex, int endIndex) {
|
| CubicReduceOrder.cpp | 105 if (!isLinear(cubic, startIndex, endIndex)) {
158 bool isLinear(const Cubic& cubic, int startIndex, int endIndex) {
|
| QuadraticImplicit.cpp | 251 static bool isLinear(const Quadratic& q1, const Quadratic& q2, Intersections& i) {
424 if (isLinear(q1, q2, i)) {
427 if (isLinear(q2, q1, i)) {
|
| Simplify.cpp | 564 return isLinear(aQuad, 0, 2);
569 return isLinear(aCubic, 0, 3);
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkPathOpsCubic.h | 49 bool isLinear(int startIndex, int endIndex) const;
|
| SkPathOpsQuad.h | 41 bool isLinear(int startIndex, int endIndex) const;
|
| SkReduceOrder.cpp | 48 if (!quad.isLinear(startIndex, endIndex)) {
168 if (!cubic.isLinear(startIndex, endIndex)) {
|
| SkPathOpsQuad.cpp | 137 bool SkDQuad::isLinear(int startIndex, int endIndex) const {
|
| SkPathOpsCubic.cpp | 127 bool SkDCubic::isLinear(int startIndex, int endIndex) const {
|
| /external/skia/src/pathops/ |
| SkPathOpsCubic.h | 49 bool isLinear(int startIndex, int endIndex) const;
|
| SkPathOpsQuad.h | 41 bool isLinear(int startIndex, int endIndex) const;
|
| SkReduceOrder.cpp | 48 if (!quad.isLinear(startIndex, endIndex)) {
168 if (!cubic.isLinear(startIndex, endIndex)) {
|
| SkPathOpsQuad.cpp | 137 bool SkDQuad::isLinear(int startIndex, int endIndex) const {
|
| SkPathOpsCubic.cpp | 127 bool SkDCubic::isLinear(int startIndex, int endIndex) const {
|
| /external/chromium_org/third_party/WebKit/Source/core/svg/ |
| SVGLinearGradientElement.cpp | 106 static void setGradientAttributes(SVGGradientElement* element, LinearGradientAttributes& attributes, bool isLinear = true)
126 if (isLinear) {
|
| /external/deqp/modules/gles31/functional/ |
| es31fTextureFilteringTests.cpp | 601 const bool isLinear = isLinearI != 0;
602 const deUint32 filter = isLinear ? GL_LINEAR : GL_NEAREST;
605 isLinear ? "linear" : "nearest", "",
|
| /external/chromium_org/third_party/qcms/src/ |
| chain.c | [all...] |
| /external/deqp/modules/gles3/functional/ |
| es3fTextureFilteringTests.cpp | [all...] |
| /art/compiler/dex/ |
| mir_graph.h | 343 bool IsLinear() const {
[all...] |
