/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | CubicBezierClip_Test.cpp | 16 int order1 = reduceOrder(cubic1, reduce1, kReduceOrder_NoQuadraticsAllowed, local 20 if (order1 < 4) { 21 SkDebugf("%s [%d] cubic1 order=%d\n", __FUNCTION__, (int) index, order1); 26 if (order1 == 4 && order2 == 4) {
|
H A D | QuadraticBezierClip_Test.cpp | 50 int order1 = reduceOrder(quad1, reduce1, kReduceOrder_TreatAsFill); local 52 if (order1 < 3) { 53 SkDebugf("%s [%d] quad1 order=%d\n", __FUNCTION__, (int)index, order1); 58 if (order1 == 3 && order2 == 3) {
|
H A D | LineCubicIntersection_Test.cpp | 30 int order1 = reduceOrder(cubic, reduce1, kReduceOrder_NoQuadraticsAllowed, local 33 if (order1 < 4) { 34 printf("[%d] cubic order=%d\n", (int) index, order1); 39 if (order1 == 4 && order2 == 2) {
|
H A D | LineQuadraticIntersection_Test.cpp | 98 int order1 = reduceOrder(quad, reduce1, kReduceOrder_TreatAsFill); local 100 if (order1 < 3) { 101 SkDebugf("%s [%d] quad order=%d\n", __FUNCTION__, (int) index, order1);
|
H A D | QuadraticIntersection_Test.cpp | 23 int order1 = reduceOrder(quad1, reduce1, kReduceOrder_TreatAsFill); local 25 if (order1 < 3) { 26 printf("[%d] quad1 order=%d\n", (int) index, order1); 31 if (order1 == 3 && order2 == 3) {
|
H A D | CubicIntersection.cpp | 59 static void intersectWithOrder(const Quadratic& simple1, int order1, const Quadratic& simple2, argument 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);
|
/external/skia/experimental/Intersection/ |
H A D | CubicBezierClip_Test.cpp | 16 int order1 = reduceOrder(cubic1, reduce1, kReduceOrder_NoQuadraticsAllowed, local 20 if (order1 < 4) { 21 SkDebugf("%s [%d] cubic1 order=%d\n", __FUNCTION__, (int) index, order1); 26 if (order1 == 4 && order2 == 4) {
|
H A D | QuadraticBezierClip_Test.cpp | 50 int order1 = reduceOrder(quad1, reduce1, kReduceOrder_TreatAsFill); local 52 if (order1 < 3) { 53 SkDebugf("%s [%d] quad1 order=%d\n", __FUNCTION__, (int)index, order1); 58 if (order1 == 3 && order2 == 3) {
|
H A D | LineCubicIntersection_Test.cpp | 30 int order1 = reduceOrder(cubic, reduce1, kReduceOrder_NoQuadraticsAllowed, local 33 if (order1 < 4) { 34 printf("[%d] cubic order=%d\n", (int) index, order1); 39 if (order1 == 4 && order2 == 2) {
|
H A D | LineQuadraticIntersection_Test.cpp | 98 int order1 = reduceOrder(quad, reduce1, kReduceOrder_TreatAsFill); local 100 if (order1 < 3) { 101 SkDebugf("%s [%d] quad order=%d\n", __FUNCTION__, (int) index, order1);
|
H A D | QuadraticIntersection_Test.cpp | 23 int order1 = reduceOrder(quad1, reduce1, kReduceOrder_TreatAsFill); local 25 if (order1 < 3) { 26 printf("[%d] quad1 order=%d\n", (int) index, order1); 31 if (order1 == 3 && order2 == 3) {
|
H A D | CubicIntersection.cpp | 59 static void intersectWithOrder(const Quadratic& simple1, int order1, const Quadratic& simple2, argument 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);
|
/external/clang/test/SemaTemplate/ |
H A D | address-spaces.cpp | 78 template<typename T> int &order1(__attribute__((address_space(1))) T&); 79 template<typename T> float &order1(T&); 84 int &ir = order1(i1); 85 float &fr = order1(i);
|
/external/chromium_org/third_party/skia/tests/ |
H A D | PathOpsCubicLineIntersectionTest.cpp | 34 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics); local 36 if (order1 < 4) { 37 SkDebugf("[%d] cubic order=%d\n", iIndex, order1); 44 if (order1 == 4 && order2 == 2) { 126 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics); local 128 if (order1 < 4) { 129 SkDebugf("[%d] cubic order=%d\n", iIndex, order1); 136 if (order1 == 4 && order2 == 2) {
|
H A D | PathOpsQuadLineIntersectionTest.cpp | 114 int order1 = reducer1.reduce(quad); local 116 if (order1 < 3) { 117 SkDebugf("%s [%d] quad order=%d\n", __FUNCTION__, iIndex, order1);
|
H A D | PathOpsQuadIntersectionTest.cpp | 22 int order1 = reduce1.reduce(quad1); local 24 if (order1 < 3) { 26 SkDebugf("[%d] quad1 order=%d\n", static_cast<int>(index), order1); 34 if (order1 == 3 && order2 == 3) {
|
H A D | PathOpsCubicQuadIntersectionTest.cpp | 68 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics); local 70 if (order1 != 4) { 71 SkDebugf("[%d] cubic order=%d\n", iIndex, order1);
|
/external/skia/tests/ |
H A D | PathOpsCubicLineIntersectionTest.cpp | 34 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics); local 36 if (order1 < 4) { 37 SkDebugf("[%d] cubic order=%d\n", iIndex, order1); 44 if (order1 == 4 && order2 == 2) { 126 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics); local 128 if (order1 < 4) { 129 SkDebugf("[%d] cubic order=%d\n", iIndex, order1); 136 if (order1 == 4 && order2 == 2) {
|
H A D | PathOpsQuadLineIntersectionTest.cpp | 114 int order1 = reducer1.reduce(quad); local 116 if (order1 < 3) { 117 SkDebugf("%s [%d] quad order=%d\n", __FUNCTION__, iIndex, order1);
|
H A D | PathOpsQuadIntersectionTest.cpp | 22 int order1 = reduce1.reduce(quad1); local 24 if (order1 < 3) { 26 SkDebugf("[%d] quad1 order=%d\n", static_cast<int>(index), order1); 34 if (order1 == 3 && order2 == 3) {
|
H A D | PathOpsCubicQuadIntersectionTest.cpp | 68 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics); local 70 if (order1 != 4) { 71 SkDebugf("[%d] cubic order=%d\n", iIndex, order1);
|
/external/chromium_org/third_party/icu/source/test/intltest/ |
H A D | apicoll.cpp | 679 int32_t order1, order2, order3; local 687 order1 = iterator1->next(success); 696 doAssert((order1 != order2), "The order result should not be the same"); 705 doAssert((order1 == order2), "The order result should be the same"); 713 doAssert((CollationElementIterator::primaryOrder(order1) == 715 doAssert((CollationElementIterator::secondaryOrder(order1) == 717 doAssert((CollationElementIterator::tertiaryOrder(order1) == 720 order1 = iterator1->next(success); order3 = iterator3->next(success); 727 doAssert((CollationElementIterator::primaryOrder(order1) == 729 doAssert((CollationElementIterator::tertiaryOrder(order1) ! [all...] |
/external/icu/icu4c/source/test/intltest/ |
H A D | apicoll.cpp | 663 int32_t order1, order2, order3; local 671 order1 = iterator1->next(success); 680 doAssert((order1 != order2), "The order result should not be the same"); 689 doAssert((order1 == order2), "The order result should be the same"); 697 doAssert((CollationElementIterator::primaryOrder(order1) == 699 doAssert((CollationElementIterator::secondaryOrder(order1) == 701 doAssert((CollationElementIterator::tertiaryOrder(order1) == 704 order1 = iterator1->next(success); order3 = iterator3->next(success); 711 doAssert((CollationElementIterator::primaryOrder(order1) == 713 doAssert((CollationElementIterator::tertiaryOrder(order1) ! [all...] |
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkDCubicIntersection.cpp | 59 static void intersectWithOrder(const SkDQuad& simple1, int order1, const SkDQuad& simple2, argument 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);
|
/external/skia/src/pathops/ |
H A D | SkDCubicIntersection.cpp | 59 static void intersectWithOrder(const SkDQuad& simple1, int order1, const SkDQuad& simple2, argument 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);
|