Home
last modified time | relevance | path

Searched refs:t1s (Results 1 – 14 of 14) sorted by relevance

/external/chromium_org/third_party/skia/src/pathops/
DSkDQuadIntersection.cpp148 static bool is_linear_inner(const SkDQuad& q1, double t1s, double t1e, const SkDQuad& q2, in is_linear_inner() argument
150 SkDQuad hull = q1.subDivide(t1s, t1e); in is_linear_inner()
217 return is_linear_inner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide); in is_linear_inner()
225 result = is_linear_inner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide); in is_linear_inner()
231 result |= is_linear_inner(q2, tsFound[split], tMax, q1, t1s, t1e, i, subDivide); in is_linear_inner()
DSkDCubicIntersection.cpp76 static void intersect(const SkDCubic& cubic1, double t1s, double t1e, const SkDCubic& cubic2, in intersect() argument
79 SkDCubic c1 = cubic1.subDivide(t1s, t1e); in intersect()
86 double t1Start = t1s; in intersect()
90 const double t1 = t1s + (t1e - t1s) * tEnd1; in intersect()
/external/skia/src/pathops/
DSkDQuadIntersection.cpp148 static bool is_linear_inner(const SkDQuad& q1, double t1s, double t1e, const SkDQuad& q2, in is_linear_inner() argument
150 SkDQuad hull = q1.subDivide(t1s, t1e); in is_linear_inner()
217 return is_linear_inner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide); in is_linear_inner()
225 result = is_linear_inner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide); in is_linear_inner()
231 result |= is_linear_inner(q2, tsFound[split], tMax, q1, t1s, t1e, i, subDivide); in is_linear_inner()
DSkDCubicIntersection.cpp76 static void intersect(const SkDCubic& cubic1, double t1s, double t1e, const SkDCubic& cubic2, in intersect() argument
79 SkDCubic c1 = cubic1.subDivide(t1s, t1e); in intersect()
86 double t1Start = t1s; in intersect()
90 const double t1 = t1s + (t1e - t1s) * tEnd1; in intersect()
/external/chromium_org/third_party/skia/experimental/Intersection/
DCubicIntersection.cpp78 static bool intersect3(const Cubic& cubic1, double t1s, double t1e, const Cubic& cubic2, in intersect3() argument
83 sub_divide(cubic1, t1s, t1e, c1); in intersect3()
90 double t1Start = t1s; in intersect3()
94 const double t1 = t1s + (t1e - t1s) * tEnd1; in intersect3()
DQuadraticImplicit.cpp156 static bool isLinearInner(const Quadratic& q1, double t1s, double t1e, const Quadratic& q2, in isLinearInner() argument
159 sub_divide(q1, t1s, t1e, hull); in isLinearInner()
224 return isLinearInner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide); in isLinearInner()
232 result = isLinearInner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide); in isLinearInner()
238 result |= isLinearInner(q2, tsFound[split], tMax, q1, t1s, t1e, i, subDivide); in isLinearInner()
/external/skia/experimental/Intersection/
DCubicIntersection.cpp78 static bool intersect3(const Cubic& cubic1, double t1s, double t1e, const Cubic& cubic2, in intersect3() argument
83 sub_divide(cubic1, t1s, t1e, c1); in intersect3()
90 double t1Start = t1s; in intersect3()
94 const double t1 = t1s + (t1e - t1s) * tEnd1; in intersect3()
DQuadraticImplicit.cpp156 static bool isLinearInner(const Quadratic& q1, double t1s, double t1e, const Quadratic& q2, in isLinearInner() argument
159 sub_divide(q1, t1s, t1e, hull); in isLinearInner()
224 return isLinearInner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide); in isLinearInner()
232 result = isLinearInner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide); in isLinearInner()
238 result |= isLinearInner(q2, tsFound[split], tMax, q1, t1s, t1e, i, subDivide); in isLinearInner()
/external/libvpx/libvpx/vp9/common/x86/
Dvp9_loopfilter_mmx.asm604 t1s: label
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/x86/
Dvp9_loopfilter_mmx.asm604 t1s: label
/external/libvpx/libvpx/vp8/common/x86/
Dloopfilter_mmx.asm1633 psubsb mm5, [GLOBAL(t1s)] ; +3 instead of +4
1731 t1s: label
Dloopfilter_sse2.asm1618 t1s: label
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/x86/
Dloopfilter_mmx.asm1633 psubsb mm5, [GLOBAL(t1s)] ; +3 instead of +4
1731 t1s: label
Dloopfilter_sse2.asm1618 t1s: label