Searched refs:order2 (Results 1 - 25 of 38) sorted by relevance

12

/external/chromium_org/third_party/skia/experimental/Intersection/
H A DCubicBezierClip_Test.cpp18 int order2 = reduceOrder(cubic2, reduce2, kReduceOrder_NoQuadraticsAllowed, local
23 if (order2 < 4) {
24 SkDebugf("%s [%d] cubic2 order=%d\n", __FUNCTION__, (int) index, order2);
26 if (order1 == 4 && order2 == 4) {
H A DQuadraticBezierClip_Test.cpp51 int order2 = reduceOrder(quad2, reduce2, kReduceOrder_TreatAsFill); local
55 if (order2 < 3) {
56 SkDebugf("%s [%d] quad2 order=%d\n", __FUNCTION__, (int)index, order2);
58 if (order1 == 3 && order2 == 3) {
H A DLineCubicIntersection_Test.cpp32 int order2 = reduceOrder(line, reduce2); local
36 if (order2 < 2) {
37 printf("[%d] line order=%d\n", (int) index, order2);
39 if (order1 == 4 && order2 == 2) {
H A DLineQuadraticIntersection_Test.cpp99 int order2 = reduceOrder(line, reduce2); local
104 if (order2 < 2) {
105 SkDebugf("%s [%d] line order=%d\n", __FUNCTION__, (int) index, order2);
H A DQuadraticIntersection_Test.cpp24 int order2 = reduceOrder(quad2, reduce2, kReduceOrder_TreatAsFill); local
28 if (order2 < 3) {
29 printf("[%d] quad2 order=%d\n", (int) index, order2);
31 if (order1 == 3 && order2 == 3) {
H A DCubicIntersection.cpp60 int order2, Intersections& i) {
61 if (order1 == 3 && order2 == 3) {
63 } else if (order1 <= 2 && order2 <= 2) {
65 } else if (order1 == 3 && order2 <= 2) {
68 SkASSERT(order1 <= 2 && order2 == 3);
59 intersectWithOrder(const Quadratic& simple1, int order1, const Quadratic& simple2, int order2, Intersections& i) argument
/external/skia/experimental/Intersection/
H A DCubicBezierClip_Test.cpp18 int order2 = reduceOrder(cubic2, reduce2, kReduceOrder_NoQuadraticsAllowed, local
23 if (order2 < 4) {
24 SkDebugf("%s [%d] cubic2 order=%d\n", __FUNCTION__, (int) index, order2);
26 if (order1 == 4 && order2 == 4) {
H A DQuadraticBezierClip_Test.cpp51 int order2 = reduceOrder(quad2, reduce2, kReduceOrder_TreatAsFill); local
55 if (order2 < 3) {
56 SkDebugf("%s [%d] quad2 order=%d\n", __FUNCTION__, (int)index, order2);
58 if (order1 == 3 && order2 == 3) {
H A DLineCubicIntersection_Test.cpp32 int order2 = reduceOrder(line, reduce2); local
36 if (order2 < 2) {
37 printf("[%d] line order=%d\n", (int) index, order2);
39 if (order1 == 4 && order2 == 2) {
H A DLineQuadraticIntersection_Test.cpp99 int order2 = reduceOrder(line, reduce2); local
104 if (order2 < 2) {
105 SkDebugf("%s [%d] line order=%d\n", __FUNCTION__, (int) index, order2);
H A DQuadraticIntersection_Test.cpp24 int order2 = reduceOrder(quad2, reduce2, kReduceOrder_TreatAsFill); local
28 if (order2 < 3) {
29 printf("[%d] quad2 order=%d\n", (int) index, order2);
31 if (order1 == 3 && order2 == 3) {
H A DCubicIntersection.cpp60 int order2, Intersections& i) {
61 if (order1 == 3 && order2 == 3) {
63 } else if (order1 <= 2 && order2 <= 2) {
65 } else if (order1 == 3 && order2 <= 2) {
68 SkASSERT(order1 <= 2 && order2 == 3);
59 intersectWithOrder(const Quadratic& simple1, int order1, const Quadratic& simple2, int order2, Intersections& i) argument
/external/chromium_org/third_party/skia/tests/
H A DPathOpsCubicLineIntersectionTest.cpp35 int order2 = reduce2.reduce(line); local
40 if (order2 < 2) {
41 SkDebugf("[%d] line order=%d\n", iIndex, order2);
44 if (order1 == 4 && order2 == 2) {
127 int order2 = reduce2.reduce(line); local
132 if (order2 < 2) {
133 SkDebugf("[%d] line order=%d\n", iIndex, order2);
136 if (order1 == 4 && order2 == 2) {
H A DPathOpsQuadLineIntersectionTest.cpp115 int order2 = reducer2.reduce(line); local
120 if (order2 < 2) {
121 SkDebugf("%s [%d] line order=%d\n", __FUNCTION__, iIndex, order2);
H A DPathOpsQuadIntersectionTest.cpp23 int order2 = reduce2.reduce(quad2); local
29 if (order2 < 3) {
31 SkDebugf("[%d] quad2 order=%d\n", static_cast<int>(index), order2);
34 if (order1 == 3 && order2 == 3) {
H A DPathOpsCubicQuadIntersectionTest.cpp69 int order2 = reduce2.reduce(quad); local
74 if (order2 != 3) {
75 SkDebugf("[%d] quad order=%d\n", iIndex, order2);
/external/skia/tests/
H A DPathOpsCubicLineIntersectionTest.cpp35 int order2 = reduce2.reduce(line); local
40 if (order2 < 2) {
41 SkDebugf("[%d] line order=%d\n", iIndex, order2);
44 if (order1 == 4 && order2 == 2) {
127 int order2 = reduce2.reduce(line); local
132 if (order2 < 2) {
133 SkDebugf("[%d] line order=%d\n", iIndex, order2);
136 if (order1 == 4 && order2 == 2) {
H A DPathOpsQuadLineIntersectionTest.cpp115 int order2 = reducer2.reduce(line); local
120 if (order2 < 2) {
121 SkDebugf("%s [%d] line order=%d\n", __FUNCTION__, iIndex, order2);
H A DPathOpsQuadIntersectionTest.cpp23 int order2 = reduce2.reduce(quad2); local
29 if (order2 < 3) {
31 SkDebugf("[%d] quad2 order=%d\n", static_cast<int>(index), order2);
34 if (order1 == 3 && order2 == 3) {
H A DPathOpsCubicQuadIntersectionTest.cpp69 int order2 = reduce2.reduce(quad); local
74 if (order2 != 3) {
75 SkDebugf("[%d] quad order=%d\n", iIndex, order2);
/external/icu/icu4c/source/test/intltest/
H A Ditercoll.cpp233 Order *order2 = getOrders(*iter, order2Length); local
234 if (orderLength != order2Length || uprv_memcmp(order, order2, orderLength * sizeof(Order)) != 0) {
238 delete[] order2;
245 order2 = getOrders(*iter, order2Length);
246 if (orderLength != order2Length || uprv_memcmp(order, order2, orderLength * sizeof(Order)) != 0) {
250 delete[] order2;
257 order2 = getOrders(*iter, order2Length);
258 if (orderLength != order2Length || uprv_memcmp(order, order2, orderLength * sizeof(Order)) != 0) {
262 delete[] order2;
269 order2
[all...]
/external/libvorbis/lib/
H A Dlsp.c406 int order2=(m+1)>>1; local
408 float *g1=alloca(sizeof(*g1)*(order2+1));
409 float *g2=alloca(sizeof(*g2)*(order2+1));
410 float *g1r=alloca(sizeof(*g1r)*(order2+1));
411 float *g2r=alloca(sizeof(*g2r)*(order2+1));
/external/emma/core/java12/com/vladium/emma/report/lcov/
H A DReportGenerator.java224 final ItemComparator order2 = m_typeSortComparators[
226 for (Iterator methods = cls.getChildren(order2); methods.hasNext(); )
/external/chromium_org/third_party/skia/src/pathops/
H A DSkDCubicIntersection.cpp60 int order2, SkIntersections& i) {
61 if (order1 == 3 && order2 == 3) {
63 } else if (order1 <= 2 && order2 <= 2) {
65 } else if (order1 == 3 && order2 <= 2) {
68 SkASSERT(order1 <= 2 && order2 == 3);
59 intersectWithOrder(const SkDQuad& simple1, int order1, const SkDQuad& simple2, int order2, SkIntersections& i) argument
/external/skia/src/pathops/
H A DSkDCubicIntersection.cpp60 int order2, SkIntersections& i) {
61 if (order1 == 3 && order2 == 3) {
63 } else if (order1 <= 2 && order2 <= 2) {
65 } else if (order1 == 3 && order2 <= 2) {
68 SkASSERT(order1 <= 2 && order2 == 3);
59 intersectWithOrder(const SkDQuad& simple1, int order1, const SkDQuad& simple2, int order2, SkIntersections& i) argument

Completed in 2506 milliseconds

12