| /external/icu/icu4c/source/test/intltest/ |
| D | tscoll.cpp | 392 LocalArray<Order> orders(getOrders(iter, orderLength)); in backAndForth() local
409 } else { // this is an error, orders exhausted but there are non-ignorable CEs from in backAndForth()
411 errln("Backward iteration returned a non ignorable after orders are exhausted"); in backAndForth()
417 if (o != orders[index].order) { in backAndForth()
421 while (index > 0 && orders[--index].order == 0) { in backAndForth()
425 if (o != orders[index].order) { in backAndForth()
427 orders[index].order, o); in backAndForth()
435 if (offset != orders[index].offset) { in backAndForth()
437 orders[index].offset, offset); in backAndForth()
445 while (index != 0 && orders[index - 1].order == 0) in backAndForth()
[all …]
|
| /external/eigen/doc/ |
| D | StorageOrders.dox | 3 /** \eigenManualPage TopicStorageOrders Storage orders
5 There are two different storage orders for matrices and two-dimensional arrays: column-major and ro…
6 This page explains these storage orders and how to specify which one should be used.
50 \section TopicStorageOrdersInEigen Storage orders in Eigen
83 …row-major storage orders transparently, the Eigen library may well work best with column-major mat…
|
| /external/libcxx/test/libcxx/atomics/ |
| D | diagnose_invalid_memory_order.fail.cpp | 30 // valid memory orders in main()
41 // valid memory orders in main()
55 // valid memory orders in main()
67 // valid memory orders in main()
78 // valid memory orders in main()
92 // valid memory orders in main()
104 // valid memory orders in main()
118 // valid memory orders in main()
|
| /external/icu/icu4c/source/test/cintltst/ |
| D | callcoll.c | 470 * Return an integer array containing all of the collation orders
481 OrderAndOffset *orders =(OrderAndOffset *)malloc(sizeof(OrderAndOffset) * maxSize); in getOrders() local
492 memcpy(temp, orders, size * sizeof(OrderAndOffset)); in getOrders()
493 free(orders); in getOrders()
494 orders = temp; in getOrders()
498 orders[size].order = order; in getOrders()
499 orders[size].offset = offset; in getOrders()
509 memcpy(temp, orders, size * sizeof(OrderAndOffset)); in getOrders()
510 free(orders); in getOrders()
511 orders = temp; in getOrders()
[all …]
|
| D | citertst.c | 565 OrderAndOffset *orders; in TestOffset() local
597 orders = getOrders(iter, &orderLength); in TestOffset()
629 free(orders); in TestOffset()
943 *orders; in TestSmallBuffer() local
965 orders = getOrders(iter, &count); in TestSmallBuffer()
982 if ((count > 250 && testorders[-- count].order != orders[1].order) || in TestSmallBuffer()
983 (count <= 250 && testorders[-- count].order != orders[0].order)) { in TestSmallBuffer()
990 free(orders); in TestSmallBuffer()
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| D | ScheduleDAGSDNodes.cpp | 636 SmallVector<std::pair<unsigned, MachineInstr*>, 32> &Orders, in ProcessSDDbgValues() argument
654 Orders.push_back(std::make_pair(DVOrder, DbgMI)); in ProcessSDDbgValues()
668 SmallVector<std::pair<unsigned, MachineInstr*>, 32> &Orders, in ProcessSourceNode() argument
674 ProcessSDDbgValues(N, DAG, Emitter, Orders, VRBaseMap, 0); in ProcessSourceNode()
681 Orders.push_back(std::make_pair(Order, (MachineInstr*)0)); in ProcessSourceNode()
685 Orders.push_back(std::make_pair(Order, prior(Emitter.getInsertPos()))); in ProcessSourceNode()
686 ProcessSDDbgValues(N, DAG, Emitter, Orders, VRBaseMap, Order); in ProcessSourceNode()
695 SmallVector<std::pair<unsigned, MachineInstr*>, 32> Orders; in EmitSchedule() local
736 ProcessSourceNode(N, DAG, Emitter, VRBaseMap, Orders, Seen); in EmitSchedule()
743 ProcessSourceNode(SU->getNode(), DAG, Emitter, VRBaseMap, Orders, in EmitSchedule()
[all …]
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| D | ScheduleDAGSDNodes.cpp | 702 SmallVectorImpl<std::pair<unsigned, MachineInstr*> > &Orders, in ProcessSDDbgValues()
719 Orders.push_back(std::make_pair(DVOrder, DbgMI)); in ProcessSDDbgValues()
733 SmallVectorImpl<std::pair<unsigned, MachineInstr*> > &Orders, in ProcessSourceNode()
739 ProcessSDDbgValues(N, DAG, Emitter, Orders, VRBaseMap, 0); in ProcessSourceNode()
749 Orders.push_back(std::make_pair(Order, (MachineInstr*)nullptr)); in ProcessSourceNode()
753 Orders.push_back(std::make_pair(Order, &*std::prev(Emitter.getInsertPos()))); in ProcessSourceNode()
754 ProcessSDDbgValues(N, DAG, Emitter, Orders, VRBaseMap, Order); in ProcessSourceNode()
802 SmallVector<std::pair<unsigned, MachineInstr*>, 32> Orders; in EmitSchedule() local
842 ProcessSourceNode(N, DAG, Emitter, VRBaseMap, Orders, Seen); in EmitSchedule()
849 ProcessSourceNode(SU->getNode(), DAG, Emitter, VRBaseMap, Orders, in EmitSchedule()
[all …]
|
| /external/swiftshader/third_party/LLVM/utils/TableGen/ |
| D | CodeGenRegisters.h | 90 // Allocation orders. Order[0] always contains all registers in Members.
91 std::vector<SmallVector<Record*, 16> > Orders; variable
176 return Orders[No];
179 // Return the total number of allocation orders available.
180 unsigned getNumOrders() const { return Orders.size(); } in getNumOrders()
|
| D | CodeGenRegisters.cpp | 279 Orders.resize(1 + AltOrders->size()); in CodeGenRegisterClass()
283 Orders[0].push_back((*Elements)[i]); in CodeGenRegisterClass()
287 // Alternative allocation orders may be subsets. in CodeGenRegisterClass()
291 Orders[1 + i].append(Order.begin(), Order.end()); in CodeGenRegisterClass()
366 // Copy all allocation orders, filter out foreign registers from the larger in inheritProperties()
368 Orders.resize(Super.Orders.size()); in inheritProperties()
369 for (unsigned i = 0, ie = Super.Orders.size(); i != ie; ++i) in inheritProperties()
370 for (unsigned j = 0, je = Super.Orders[i].size(); j != je; ++j) in inheritProperties()
371 if (contains(RegBank.getReg(Super.Orders[i][j]))) in inheritProperties()
372 Orders[i].push_back(Super.Orders[i][j]); in inheritProperties()
|
| /external/webrtc/webrtc/base/ |
| D | bytebuffer_unittest.cc | 116 ByteBuffer::ByteOrder orders[2] = { ByteBuffer::ORDER_HOST, in TEST() local
118 for (size_t i = 0; i < arraysize(orders); i++) { in TEST()
119 ByteBuffer buffer(orders[i]); in TEST()
120 EXPECT_EQ(orders[i], buffer.Order()); in TEST()
|
| /external/llvm/lib/CodeGen/ |
| D | InlineSpiller.cpp | 99 SmallVectorImpl<MachineDomTreeNode *> &Orders,
1142 SmallVectorImpl<MachineDomTreeNode *> &Orders, in getVisitOrders() argument
1199 // in Orders. Orders will be used for hoisting in runHoistSpills. in getVisitOrders()
1201 Orders.push_back(MDT.DT->getNode(Root)); in getVisitOrders()
1203 MachineDomTreeNode *Node = Orders[idx++]; in getVisitOrders()
1209 Orders.push_back(Child); in getVisitOrders()
1211 } while (idx != Orders.size()); in getVisitOrders()
1212 assert(Orders.size() == WorkSet.size() && in getVisitOrders()
1213 "Orders have different size with WorkSet"); in getVisitOrders()
1216 DEBUG(dbgs() << "Orders size is " << Orders.size() << "\n"); in getVisitOrders()
[all …]
|
| /external/deqp/external/vulkancts/modules/vulkan/memory/ |
| D | vktMemoryAllocationTests.cpp | 538 } orders[] = in createAllocationTests() local
554 for (size_t orderNdx = 0; orderNdx < DE_LENGTH_OF_ARRAY(orders); orderNdx++) in createAllocationTests()
556 const TestConfig::Order order = orders[orderNdx].order; in createAllocationTests()
557 const char* const orderName = orders[orderNdx].str; in createAllocationTests()
604 for (size_t orderNdx = 0; orderNdx < DE_LENGTH_OF_ARRAY(orders); orderNdx++) in createAllocationTests()
606 const TestConfig::Order order = orders[orderNdx].order; in createAllocationTests()
607 const char* const orderName = orders[orderNdx].str; in createAllocationTests()
|
| /external/libcups/cups/ |
| D | ppd-emit.c | 86 float *orders; /* Collected order values */ in ppdCollect2() local
112 if ((orders = calloc(sizeof(float), (size_t)cupsArrayCount(ppd->marked))) == NULL) in ppdCollect2()
175 orders[count] = corder; in ppdCollect2()
190 if (orders[i] > orders[j]) in ppdCollect2()
193 corder = orders[i]; in ppdCollect2()
195 orders[i] = orders[j]; in ppdCollect2()
197 orders[j] = corder; in ppdCollect2()
201 free(orders); in ppdCollect2()
|
| /external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/ |
| D | CollationTest.java | 87 * Return an integer array containing all of the collation orders
94 int[] orders = new int[maxSize]; in getOrders() local
101 System.arraycopy(orders, 0, temp, 0, size); in getOrders()
102 orders = temp; in getOrders()
104 orders[size++] = order; in getOrders()
109 System.arraycopy(orders, 0, temp, 0, size); in getOrders()
110 orders = temp; in getOrders()
112 return orders; in getOrders()
119 int[] orders = getOrders(iter); in backAndForth() local
122 int index = orders.length; in backAndForth()
[all …]
|
| D | CollationAPITest.java | 326 … CollationElementIterator.primaryOrder(order3)), "The primary orders should be the same"); in TestElemIter()
328 … CollationElementIterator.secondaryOrder(order3)), "The secondary orders should be the same"); in TestElemIter()
330 … CollationElementIterator.tertiaryOrder(order3)), "The tertiary orders should be the same"); in TestElemIter()
336 … CollationElementIterator.primaryOrder(order3)), "The primary orders should be identical"); in TestElemIter()
338 … CollationElementIterator.tertiaryOrder(order3)), "The tertiary orders should be different"); in TestElemIter()
344 …// CollationElementIterator.secondaryOrder(order3)), "The secondary orders should not be the sa… in TestElemIter()
366 … CollationElementIterator.primaryOrder(order3)), "The primary orders should be the same"); in TestElemIter()
368 … CollationElementIterator.secondaryOrder(order3)), "The secondary orders should be the same"); in TestElemIter()
370 … CollationElementIterator.tertiaryOrder(order3)), "The tertiary orders should be the same"); in TestElemIter()
377 … CollationElementIterator.primaryOrder(order3)), "The primary orders should be identical"); in TestElemIter()
[all …]
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/collator/ |
| D | CollationTest.java | 88 * Return an integer array containing all of the collation orders
95 int[] orders = new int[maxSize]; in getOrders() local
102 System.arraycopy(orders, 0, temp, 0, size); in getOrders()
103 orders = temp; in getOrders()
105 orders[size++] = order; in getOrders()
110 System.arraycopy(orders, 0, temp, 0, size); in getOrders()
111 orders = temp; in getOrders()
113 return orders; in getOrders()
120 int[] orders = getOrders(iter); in backAndForth() local
123 int index = orders.length; in backAndForth()
[all …]
|
| D | CollationAPITest.java | 327 … CollationElementIterator.primaryOrder(order3)), "The primary orders should be the same"); in TestElemIter()
329 … CollationElementIterator.secondaryOrder(order3)), "The secondary orders should be the same"); in TestElemIter()
331 … CollationElementIterator.tertiaryOrder(order3)), "The tertiary orders should be the same"); in TestElemIter()
337 … CollationElementIterator.primaryOrder(order3)), "The primary orders should be identical"); in TestElemIter()
339 … CollationElementIterator.tertiaryOrder(order3)), "The tertiary orders should be different"); in TestElemIter()
345 …// CollationElementIterator.secondaryOrder(order3)), "The secondary orders should not be the sa… in TestElemIter()
367 … CollationElementIterator.primaryOrder(order3)), "The primary orders should be the same"); in TestElemIter()
369 … CollationElementIterator.secondaryOrder(order3)), "The secondary orders should be the same"); in TestElemIter()
371 … CollationElementIterator.tertiaryOrder(order3)), "The tertiary orders should be the same"); in TestElemIter()
378 … CollationElementIterator.primaryOrder(order3)), "The primary orders should be identical"); in TestElemIter()
[all …]
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | TreeBasedTable.java | 114 * @param rowComparator the comparator that orders the row keys
115 * @param columnComparator the comparator that orders the column keys
148 * Returns the comparator that orders the rows. With natural ordering,
156 * Returns the comparator that orders the columns. With natural ordering,
|
| /external/snakeyaml/src/test/resources/compactnotation/ |
| D | error3.yaml | 1 Table(id12, orders):
|
| /external/llvm/utils/TableGen/ |
| D | CodeGenRegisters.h | 268 // Allocation orders. Order[0] always contains all registers in Members.
269 std::vector<SmallVector<Record*, 16> > Orders; variable
384 return Orders[No];
387 // Return the total number of allocation orders available.
388 unsigned getNumOrders() const { return Orders.size(); } in getNumOrders()
|
| /external/junit/src/main/java/org/junit/runner/manipulation/ |
| D | Sorter.java | 8 * A <code>Sorter</code> orders tests. In general you will not need
|
| /external/swiftshader/third_party/LLVM/test/CodeGen/ARM/ |
| D | 2011-08-29-SchedCycle.ll | 13 ; entry), legalizer can serialize them in arbitrary orders. If it's
|
| /external/llvm/test/CodeGen/ARM/ |
| D | 2011-08-29-SchedCycle.ll | 13 ; entry), legalizer can serialize them in arbitrary orders. If it's
|
| /external/zopfli/ |
| D | README.zopflipng | 24 2-3 orders of magnitude more CPU time for compression. Initial testing using a
|
| /external/llvm/test/CodeGen/Mips/cconv/ |
| D | stack-alignment.ll | 13 ; Test the stack alignment for all ABI's and byte orders as specified by
|