HomeSort by relevance Sort by last modified time
    Searched refs:order1 (Results 1 - 14 of 14) sorted by null

  /external/clang/test/SemaTemplate/
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/skia/tests/
PathOpsCubicQuadIntersectionTest.cpp 62 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics); local
64 if (order1 != 4) {
65 SkDebugf("[%d] cubic order=%d\n", iIndex, order1);
PathOpsCubicLineIntersectionTest.cpp 52 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics); local
54 if (order1 < 4) {
55 SkDebugf("[%d] cubic order=%d\n", iIndex, order1);
62 if (order1 == 4 && order2 == 2) {
PathOpsQuadLineIntersectionTest.cpp 112 int order1 = reducer1.reduce(quad); local
114 if (order1 < 3) {
115 SkDebugf("%s [%d] quad order=%d\n", __FUNCTION__, iIndex, order1);
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) {
PathOpsCubicIntersectionTest.cpp 22 int order1 = reduce1.reduce(cubic1, SkReduceOrder::kNo_Quadratics); local
25 if (order1 < 4) {
27 SkDebugf("%s [%d] cubic1 order=%d\n", __FUNCTION__, iIndex, order1);
  /external/chromium_org/third_party/icu/source/test/intltest/
apicoll.cpp 677 int32_t order1, order2, order3; local
685 order1 = iterator1->next(success);
694 doAssert((order1 != order2), "The order result should not be the same");
703 doAssert((order1 == order2), "The order result should be the same");
711 doAssert((CollationElementIterator::primaryOrder(order1) ==
713 doAssert((CollationElementIterator::secondaryOrder(order1) ==
715 doAssert((CollationElementIterator::tertiaryOrder(order1) ==
718 order1 = iterator1->next(success); order3 = iterator3->next(success);
725 doAssert((CollationElementIterator::primaryOrder(order1) ==
727 doAssert((CollationElementIterator::tertiaryOrder(order1) !
    [all...]
  /external/icu4c/test/intltest/
apicoll.cpp 686 int32_t order1, order2, order3; local
694 order1 = iterator1->next(success);
703 doAssert((order1 != order2), "The order result should not be the same");
712 doAssert((order1 == order2), "The order result should be the same");
720 doAssert((CollationElementIterator::primaryOrder(order1) ==
722 doAssert((CollationElementIterator::secondaryOrder(order1) ==
724 doAssert((CollationElementIterator::tertiaryOrder(order1) ==
727 order1 = iterator1->next(success); order3 = iterator3->next(success);
734 doAssert((CollationElementIterator::primaryOrder(order1) ==
736 doAssert((CollationElementIterator::tertiaryOrder(order1) !
    [all...]
  /external/chromium_org/third_party/skia/src/pathops/
SkDCubicIntersection.cpp 59 static void intersectWithOrder(const SkDQuad& simple1, int order1, const SkDQuad& simple2,
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/
SkDCubicIntersection.cpp 59 static void intersectWithOrder(const SkDQuad& simple1, int order1, const SkDQuad& simple2,
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/chromium_org/third_party/icu/source/test/cintltst/
capitst.c 1200 int32_t order1, order2, order3; local
    [all...]
  /external/icu4c/test/cintltst/
capitst.c 1274 int32_t order1, order2, order3; local
    [all...]
  /external/chromium_org/chrome/browser/resources/file_manager/background/js/
volume_manager.js 188 var order1 = volumeManagerUtil.volumeListOrder_.indexOf(
192 if (order1 !== order2)
193 return order1 < order2 ? -1 : 1;
  /art/runtime/
class_linker.cc 3736 int order1 = (!isPrimitive1 ? 0 : (is64bit1 ? 1 : 2)); variable
    [all...]

Completed in 148 milliseconds