/external/webkit/Source/WebCore/platform/graphics/gpu/ |
H A D | LoopBlinnMathUtils.cpp | 100 // A roundoff factor in the cubic classification and texture coordinate 245 // Evaluates the point on the source cubic specified by t, 0 <= t <= 1.0. 246 FloatPoint evaluateCubicAt(const FloatPoint cubic[4], float t) argument 248 return FloatPoint(evaluateCubic(cubic[0].x(), cubic[1].x(), cubic[2].x(), cubic[3].x(), t), 249 evaluateCubic(cubic[0].y(), cubic[1].y(), cubic[ 252 xRayCrossesMonotonicCubic(const XRay& xRay, const FloatPoint cubic[4], bool& ambiguous) argument [all...] |
H A D | LoopBlinnMathUtils.h | 69 // Given a src cubic bezier, chops it at the specified t value, 78 // Given an arbitrary cubic bezier, return the number of times an XRay 79 // crosses the cubic. Valid return values are [0..3]. 81 // By definition the cubic is open at the starting point; in other 82 // words, if pt.fY is equivalent to cubic[0].fY, and pt.fX is to the 84 // but if it is equal to cubic[3].fY then it is considered to 92 const FloatPoint cubic[4],
|
H A D | LoopBlinnPathProcessor.cpp | 127 // Describes a segment of the path: either a cubic or a line segment. 151 // Initializer for cubic curve segments. 254 // segment. This operation only makes sense for cubic type segments. 277 // can be called either for line or cubic type segments. 317 builder.append(kind() == Line ? "line" : "cubic"); 666 // Need to degree elevate the quadratic into a cubic 667 SkPoint cubic[4]; local 668 SkConvertQuadToCubic(points, cubic); 671 cubic[0], cubic[ [all...] |
/external/webkit/Source/WebCore/svg/ |
H A D | SVGPathSegListSource.cpp | 102 SVGPathSegCurvetoCubic* cubic = static_cast<SVGPathSegCurvetoCubic*>(m_segment.get()); local 103 point1 = FloatPoint(cubic->x1(), cubic->y1()); 104 point2 = FloatPoint(cubic->x2(), cubic->y2()); 105 targetPoint = FloatPoint(cubic->x(), cubic->y());
|
/external/skia/src/pdf/ |
H A D | SkPDFUtils.cpp | 116 SkPoint cubic[4]; local 117 SkConvertQuadToCubic(args, cubic); 118 AppendCubic(cubic[1].fX, cubic[1].fY, cubic[2].fX, cubic[2].fY, 119 cubic[3].fX, cubic[3].fY, content);
|
/external/skia/tests/ |
H A D | GeometryTest.cpp | 48 const SkPoint cubic[] = { local 55 REPORTER_ASSERT(reporter, nearly_equal(cubic[i], dst[i]));
|
H A D | PathTest.cpp | 219 SkPath cubic; local 222 check_close(reporter, cubic); 223 cubic.close(); 224 check_close(reporter, cubic); 543 // fail, cubic
|
/external/skia/samplecode/ |
H A D | SampleWarp.cpp | 134 SkCubicBoundary cubic; local 135 set_cubic(cubic.fPts + 0, 0, 0, 100, 0, scale); 136 set_cubic(cubic.fPts + 3, 100, 0, 100, 100, scale); 137 set_cubic(cubic.fPts + 6, 100, 100, 0, 100, -scale); 138 set_cubic(cubic.fPts + 9, 0, 100, 0, 0, 0); 141 patch.setBoundary(&cubic); 162 SkCubicBoundary cubic; local 163 set_cubic(cubic.fPts + 0, 0, 0, 100, 0, 0); 164 set_cubic(cubic.fPts + 3, 100, 0, 100, 100, 0); 165 set_cubic(cubic [all...] |
H A D | SamplePatch.cpp | 80 static void eval_patch_edge(const SkPoint cubic[], SkPoint samples[], int segs) { argument 84 samples[0] = cubic[0]; 87 SkEvalCubicAt(cubic, t, &samples[i], NULL, NULL);
|
/external/skia/include/core/ |
H A D | SkGeometry.h | 85 convert it into the cubic fitting the same curve. The new cubic 97 /** Set pt to the point on the src cubic specified by t. t must be 103 /** Given a src cubic bezier, chop it at the specified t value, 108 /** Given a src cubic bezier, chop it at the specified t values, 115 /** Given a src cubic bezier, chop it at the specified t == 1/2, 120 /** Given the 4 coefficients for a cubic bezier (either X or Y values), look 122 these extrema. If the cubic has no extrema betwee (0..1) exclusive, the 132 /** Given 4 points on a cubic bezier, chop it into 1, 2, 3 beziers such that 135 0 dst[0..3] is the original cubic [all...] |
/external/skia/src/core/ |
H A D | SkGeometry.cpp | 601 up with 1.0, hence the need to check and just return the last cubic as 646 // have src point to the remaining cubic (after the chop) 653 // if we can't, just create a degenerate cubic 690 /** Given 4 points on a cubic bezier, chop it into 1, 2, 3 beziers such that 693 0 dst[0..3] is the original cubic 735 After some canceling of the cubic term, we get 1075 bool SkXRayCrossesMonotonicCubic(const SkXRay& pt, const SkPoint cubic[4], bool* ambiguous) { 1081 // first and last points since this cubic is monotonic 1082 SkScalar min_y = SkMinScalar(cubic[0].fY, cubic[ [all...] |
/external/jmonkeyengine/engine/src/ogre/com/jme3/scene/plugins/ogre/ |
H A D | MaterialLoader.java | 124 boolean cubic = false; 128 if (type != null && type.equals("cubic")){ 129 cubic = true; 134 texKey.setAsCube(cubic);
|
/external/skia/src/gpu/ |
H A D | GrPathUtils.cpp | 332 SkPoint* cubic = chopped + 3*i; local 333 convert_noninflect_cubic_to_quads(cubic, tolScale, quads);
|