| /external/icu/icu4c/source/test/intltest/ |
| D | tscoll.cpp | 392 LocalArray<Order> orders(getOrders(iter, orderLength)); in backAndForth() local
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()
489 LocalArray<Order> orders(new Order[maxSize]); in getOrders() local
501 uprv_memcpy(temp, orders.getAlias(), size * sizeof(Order)); in getOrders()
[all …]
|
| /external/icu/icu4c/source/test/cintltst/ |
| D | callcoll.c | 484 OrderAndOffset *orders =(OrderAndOffset *)malloc(sizeof(OrderAndOffset) * maxSize); in getOrders() local
495 memcpy(temp, orders, size * sizeof(OrderAndOffset)); in getOrders()
496 free(orders); in getOrders()
497 orders = temp; in getOrders()
501 orders[size].order = order; in getOrders()
502 orders[size].offset = offset; in getOrders()
512 memcpy(temp, orders, size * sizeof(OrderAndOffset)); in getOrders()
513 free(orders); in getOrders()
514 orders = temp; in getOrders()
520 return orders; in getOrders()
[all …]
|
| D | citertst.c | 566 OrderAndOffset *orders; in TestOffset() local
598 orders = getOrders(iter, &orderLength); in TestOffset()
630 free(orders); in TestOffset()
944 *orders; in TestSmallBuffer() local
966 orders = getOrders(iter, &count); in TestSmallBuffer()
983 if ((count > 250 && testorders[-- count].order != orders[1].order) || in TestSmallBuffer()
984 (count <= 250 && testorders[-- count].order != orders[0].order)) { in TestSmallBuffer()
991 free(orders); in TestSmallBuffer()
|
| /external/ruy/ruy/ |
| D | benchmark.cc | 45 const char* orders = "RCC"; in Benchmark() local
65 orders = orders_env; in Benchmark()
67 test_set.lhs_order = orders[0] == 'R' ? Order::kRowMajor : Order::kColMajor; in Benchmark()
68 test_set.rhs_order = orders[1] == 'R' ? Order::kRowMajor : Order::kColMajor; in Benchmark()
69 test_set.dst_order = orders[2] == 'R' ? Order::kRowMajor : Order::kColMajor; in Benchmark()
|
| /external/libcups/cups/ |
| D | ppd-emit.c | 82 float *orders; /* Collected order values */ in ppdCollect2() local
108 if ((orders = calloc(sizeof(float), (size_t)cupsArrayCount(ppd->marked))) == NULL) in ppdCollect2()
171 orders[count] = corder; in ppdCollect2()
186 if (orders[i] > orders[j]) in ppdCollect2()
189 corder = orders[i]; in ppdCollect2()
191 orders[i] = orders[j]; in ppdCollect2()
193 orders[j] = corder; in ppdCollect2()
197 free(orders); in ppdCollect2()
|
| /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/tensorflow/tensorflow/core/graph/ |
| D | algorithm_test.cc | 114 std::vector<std::pair<string, string>> orders = { in TEST() local
117 EXPECT_TRUE(ExpectBefore(orders, order, &error)) << error; in TEST()
120 orders = {{"W1", "t3"}}; in TEST()
121 EXPECT_FALSE(ExpectBefore(orders, order, &error)); in TEST()
|
| /external/gemmlowp/doc/ |
| D | public.md | 69 * `LhsOrder`, `RhsOrder`, `ResultOrder`: the storage orders (row-major or
106 ### Performance note on storage orders.
108 gemmlowp supports arbitrary combinations of storage orders for the LHS, RHS and
112 optimization focus is on this particular combination of storage orders:
134 combination of storage orders.
136 Using other storage orders will typically mean taking less efficient paths in
|
| /external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/ |
| D | CollationTest.java | 97 int[] orders = new int[maxSize]; in getOrders() local
104 System.arraycopy(orders, 0, temp, 0, size); in getOrders()
105 orders = temp; in getOrders()
107 orders[size++] = order; in getOrders()
112 System.arraycopy(orders, 0, temp, 0, size); in getOrders()
113 orders = temp; in getOrders()
115 return orders; in getOrders()
122 int[] orders = getOrders(iter); in backAndForth() local
125 int index = orders.length; in backAndForth()
132 if (o != orders[--index]) { in backAndForth()
[all …]
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/collator/ |
| D | CollationTest.java | 100 int[] orders = new int[maxSize]; in getOrders() local
107 System.arraycopy(orders, 0, temp, 0, size); in getOrders()
108 orders = temp; in getOrders()
110 orders[size++] = order; in getOrders()
115 System.arraycopy(orders, 0, temp, 0, size); in getOrders()
116 orders = temp; in getOrders()
118 return orders; in getOrders()
125 int[] orders = getOrders(iter); in backAndForth() local
128 int index = orders.length; in backAndForth()
135 if (o != orders[--index]) { in backAndForth()
[all …]
|
| /external/tensorflow/tensorflow/core/util/sparse/ |
| D | README.md | 180 Expected input shapes, orders, and `nnz()`:
189 Output shapes and orders:
217 // Reorder st3 so all input tensors have the exact same orders.
221 // All indices' orders matched, so output is in order.
|
| /external/deqp/external/vulkancts/modules/vulkan/memory/ |
| D | vktMemoryAllocationTests.cpp | 817 } orders[] = in createAllocationTestsCommon() local
833 for (size_t orderNdx = 0; orderNdx < DE_LENGTH_OF_ARRAY(orders); orderNdx++) in createAllocationTestsCommon()
835 const TestConfig::Order order = orders[orderNdx].order; in createAllocationTestsCommon()
836 const char* const orderName = orders[orderNdx].str; in createAllocationTestsCommon()
883 for (size_t orderNdx = 0; orderNdx < DE_LENGTH_OF_ARRAY(orders); orderNdx++) in createAllocationTestsCommon()
885 const TestConfig::Order order = orders[orderNdx].order; in createAllocationTestsCommon()
886 const char* const orderName = orders[orderNdx].str; in createAllocationTestsCommon()
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| D | api_def_Polygamma.pbtxt | 11 The polygamma function is defined only for non-negative integer orders \\a\\.
|
| /external/angle/src/libANGLE/renderer/vulkan/doc/ |
| D | FastOpenGLStateTransitions.md | 7 [VkPipeline][VkPipeline] for each state vector. Compiling VkPipelines is multiple orders of
15 pipeline recompilations are orders of manitude slower than OpenGL state changes.
|
| /external/llvm-project/llvm/test/CodeGen/Mips/cconv/ |
| D | return-hard-fp128.ll | 7 ; Test the fp128 returns for N32/N64 and all byte orders as specified by
|
| D | stack-alignment.ll | 13 ; Test the stack alignment for all ABI's and byte orders as specified by
|
| /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
|
| D | return-hard-fp128.ll | 7 ; Test the fp128 returns for N32/N64 and all byte orders as specified by
|
| /external/llvm-project/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/llvm/test/Transforms/DeadArgElim/ |
| D | deadretval2.ll | 39 ; different orders (ie, first the caller, than the callee and first the callee
|
| /external/llvm-project/llvm/test/Transforms/DeadArgElim/ |
| D | deadretval2.ll | 39 ; different orders (ie, first the caller, than the callee and first the callee
|
| /external/libyuv/files/third_party/gflags/ |
| D | BUILD.gn | 29 # GN orders flags on a target before flags from configs. The default config
|
| /external/zopfli/ |
| D | README.zopflipng | 24 2-3 orders of magnitude more CPU time for compression. Initial testing using a
|
| /external/llvm-project/lld/test/COFF/ |
| D | comdat-selection-associative-largest.s | 20 # Pass the obj files in different orders and check that only the associative
|