/external/brotli/c/enc/ |
D | cluster_inc.h | 16 uint32_t idx2, size_t max_num_pairs, HistogramPair* pairs, 20 p.idx1 = p.idx2 = 0; 22 if (idx1 == idx2) { 25 if (idx2 < idx1) { 26 uint32_t t = idx2; 27 idx2 = idx1; 31 p.idx2 = idx2; 32 p.cost_diff = 0.5 * ClusterCostDiff(cluster_size[idx1], cluster_size[idx2]); 34 p.cost_diff -= out[idx2].bit_cost_; 37 p.cost_combo = out[idx2].bit_cost_; [all …]
|
/external/llvm/test/Transforms/SLPVectorizer/X86/ |
D | propagate_ir_flags.ll | 14 %idx2 = getelementptr inbounds i32, i32* %x, i64 1 19 %load2 = load i32, i32* %idx2, align 4 29 store i32 %op2, i32* %idx2, align 4 40 %idx2 = getelementptr inbounds i32, i32* %x, i64 1 45 %load2 = load i32, i32* %idx2, align 4 55 store i32 %op2, i32* %idx2, align 4 66 %idx2 = getelementptr inbounds i32, i32* %x, i64 1 71 %load2 = load i32, i32* %idx2, align 4 81 store i32 %op2, i32* %idx2, align 4 92 %idx2 = getelementptr inbounds i32, i32* %x, i64 1 [all …]
|
/external/strace/tests-mx32/ |
D | kcmp.c | 98 const char *type_str, kernel_ulong_t idx1, kernel_ulong_t idx2, ...) in do_kcmp() argument 103 rc = syscall(__NR_kcmp, pid1, pid2, type, idx1, idx2); in do_kcmp() 115 printpidfd(", ", pid2, idx2); in do_kcmp() 120 va_start(ap, idx2); in do_kcmp() 129 (struct kcmp_epoll_slot *) (uintptr_t) idx2; in do_kcmp() 135 if (idx2) in do_kcmp() 136 printf("%#llx", (unsigned long long) idx2); in do_kcmp() 142 (unsigned long long) idx1, (unsigned long long) idx2); in do_kcmp()
|
/external/strace/tests/ |
D | kcmp.c | 98 const char *type_str, kernel_ulong_t idx1, kernel_ulong_t idx2, ...) in do_kcmp() argument 103 rc = syscall(__NR_kcmp, pid1, pid2, type, idx1, idx2); in do_kcmp() 115 printpidfd(", ", pid2, idx2); in do_kcmp() 120 va_start(ap, idx2); in do_kcmp() 129 (struct kcmp_epoll_slot *) (uintptr_t) idx2; in do_kcmp() 135 if (idx2) in do_kcmp() 136 printf("%#llx", (unsigned long long) idx2); in do_kcmp() 142 (unsigned long long) idx1, (unsigned long long) idx2); in do_kcmp()
|
/external/strace/tests-m32/ |
D | kcmp.c | 98 const char *type_str, kernel_ulong_t idx1, kernel_ulong_t idx2, ...) in do_kcmp() argument 103 rc = syscall(__NR_kcmp, pid1, pid2, type, idx1, idx2); in do_kcmp() 115 printpidfd(", ", pid2, idx2); in do_kcmp() 120 va_start(ap, idx2); in do_kcmp() 129 (struct kcmp_epoll_slot *) (uintptr_t) idx2; in do_kcmp() 135 if (idx2) in do_kcmp() 136 printf("%#llx", (unsigned long long) idx2); in do_kcmp() 142 (unsigned long long) idx1, (unsigned long long) idx2); in do_kcmp()
|
/external/llvm-project/llvm/test/Transforms/SLPVectorizer/X86/ |
D | propagate_ir_flags.ll | 25 %idx2 = getelementptr inbounds i32, i32* %x, i64 1 30 %load2 = load i32, i32* %idx2, align 4 40 store i32 %op2, i32* %idx2, align 4 61 %idx2 = getelementptr inbounds i32, i32* %x, i64 1 66 %load2 = load i32, i32* %idx2, align 4 76 store i32 %op2, i32* %idx2, align 4 97 %idx2 = getelementptr inbounds i32, i32* %x, i64 1 102 %load2 = load i32, i32* %idx2, align 4 112 store i32 %op2, i32* %idx2, align 4 133 %idx2 = getelementptr inbounds i32, i32* %x, i64 1 [all …]
|
D | call.ll | 30 %idx2 = getelementptr inbounds double, double* %b, i64 1 31 store double %sin2, double* %idx2, align 8 50 %idx2 = getelementptr inbounds double, double* %b, i64 1 51 store double %cos2, double* %idx2, align 8 70 %idx2 = getelementptr inbounds double, double* %b, i64 1 71 store double %pow2, double* %idx2, align 8 90 %idx2 = getelementptr inbounds double, double* %b, i64 1 91 store double %exp2, double* %idx2, align 8 113 %idx2 = getelementptr inbounds double, double* %b, i64 1 114 store double %sqrt2, double* %idx2, align 8 [all …]
|
/external/protobuf/objectivec/Tests/ |
D | GPBArrayTests.m | 148 //% __block NSUInteger idx2 = 0; 150 //% XCTAssertEqual(idx, idx2); 153 //% ++idx2; 155 //% idx2 = 0; 158 //% XCTAssertEqual(idx, (3 - idx2)); 161 //% ++idx2; 164 //% idx2 = 0; 166 //% XCTAssertEqual(idx, idx2); 169 //% if (idx2 == 1) *stop = YES; 172 //% ++idx2; [all …]
|
/external/webp/src/enc/ |
D | histogram_enc.c | 733 int idx2; member 804 int idx2, double threshold) { in HistoQueuePush() argument 812 if (idx1 > idx2) { in HistoQueuePush() 813 const int tmp = idx2; in HistoQueuePush() 814 idx2 = idx1; in HistoQueuePush() 818 pair.idx2 = idx2; in HistoQueuePush() 820 h2 = histograms[idx2]; in HistoQueuePush() 868 const int idx2 = histo_queue.queue[0].idx2; in HistogramCombineGreedy() local 869 HistogramAdd(histograms[idx2], histograms[idx1], histograms[idx1]); in HistogramCombineGreedy() 873 HistogramSetRemoveHistogram(image_histo, idx2, num_used); in HistogramCombineGreedy() [all …]
|
/external/tensorflow/tensorflow/lite/micro/testing/ |
D | micro_test.h | 145 #define TF_LITE_MICRO_ARRAY_ELEMENT_EXPECT_NEAR(arr1, idx1, arr2, idx2, \ argument 148 auto delta = ((arr1)[(idx1)] > (arr2)[(idx2)]) \ 149 ? ((arr1)[(idx1)] - (arr2)[(idx2)]) \ 150 : ((arr2)[(idx2)] - (arr1)[(idx1)]); \ 154 static_cast<int>(idx2), static_cast<float>((arr2)[(idx2)]), \
|
/external/strace/ |
D | kcmp.c | 61 kernel_ulong_t idx2 = tcp->u_arg[4]; in SYS_FUNC() local 71 printpidfd(tcp, pid1, idx2); in SYS_FUNC() 82 if (umove_or_printaddr(tcp, idx2, &slot)) in SYS_FUNC() 101 tprintf(", %#" PRI_klx ", %#" PRI_klx, idx1, idx2); in SYS_FUNC()
|
/external/kotlinx.coroutines/kotlinx-coroutines-core/jvm/test/internal/ |
D | LockFreeLinkedListAtomicLFStressTest.kt | 68 val idx2 = idx1 + 1 + rnd.nextInt(nLists - idx1 - 1) in <lambda>() constant 69 check(idx1 < idx2) // that is our global order in <lambda>() 71 val list2 = lists[idx2] in <lambda>() 88 val idx2 = idx1 + 1 + rnd.nextInt(nLists - idx1 - 1) in <lambda>() constant 89 check(idx1 < idx2) // that is our global order in <lambda>() 91 val list2 = lists[idx2] in <lambda>()
|
/external/tensorflow/tensorflow/lite/ |
D | arena_planner.cc | 264 auto tensor_compare = [this](int idx1, int idx2) { in CreateTensorAllocationVector() argument 270 if (this->alloc_node_[idx2] == 0 && in CreateTensorAllocationVector() 271 this->dealloc_node_[idx2] == kNodeNotAssigned) { in CreateTensorAllocationVector() 272 return idx1 < idx2; in CreateTensorAllocationVector() 276 if (this->alloc_node_[idx2] == 0 && in CreateTensorAllocationVector() 277 this->dealloc_node_[idx2] == kNodeNotAssigned) { in CreateTensorAllocationVector() 283 auto size2 = this->graph_info_->tensor(idx2)->bytes; in CreateTensorAllocationVector() 288 return this->alloc_node_[idx1] < this->alloc_node_[idx2]; in CreateTensorAllocationVector()
|
/external/icu/icu4c/source/tools/gencnval/ |
D | gencnval.c | 667 uint32_t idx, idx2; in addAlias() local 712 for (idx2 = 0; idx2 < tags[standard].aliasList[idx].aliasCount; idx2++) { in addAlias() 713 uint16_t aliasNum = tags[standard].aliasList[idx].aliases[idx2]; in addAlias() 814 uint16_t idx, idx2, idx3; in resolveAliasToConverter() local 817 for (idx2 = 0; idx2 < converterCount; idx2++) { in resolveAliasToConverter() 818 for (idx3 = 0; idx3 < tags[idx].aliasList[idx2].aliasCount; idx3++) { in resolveAliasToConverter() 819 uint16_t aliasNum = tags[idx].aliasList[idx2].aliases[idx3]; in resolveAliasToConverter() 822 *converterNum = idx2; in resolveAliasToConverter() 831 for (idx2 = 0; idx2 < converterCount; idx2++) { in resolveAliasToConverter() 832 for (idx3 = 0; idx3 < tags[idx].aliasList[idx2].aliasCount; idx3++) { in resolveAliasToConverter() [all …]
|
/external/llvm-project/llvm/test/CodeGen/NVPTX/ |
D | lower-args.ll | 21 %arg.idx2 = getelementptr %class.outer, %class.outer* %arg, i64 0, i32 1 22 %arg.idx2.val = load i32, i32* %arg.idx2, align 8 24 %add.i = add nsw i32 %arg.idx.val.val, %arg.idx2.val
|
/external/swiftshader/third_party/subzero/crosstest/ |
D | test_vector_ops_ll.ll | 5 i32 2, label %idx2 14 idx2: 30 i32 2, label %idx2 41 idx2: 59 i32 2, label %idx2 74 idx2: 108 i32 2, label %idx2 131 idx2: 197 i32 2, label %idx2 206 idx2: [all …]
|
/external/skqp/src/pathops/ |
D | SkOpAngle.cpp | 490 for (int idx2 = idx1 + 1; idx2 <= ptCount; ++idx2) { in distEndRatio() local 491 if (idx1 == idx2) { in distEndRatio() 495 v.set(pts[idx2] - pts[idx1]); in distEndRatio() 528 for (int idx2 = 0; idx2 < i.used(); ++idx2) { in endsIntersect() local 529 double testT = i[0][idx2]; in endsIntersect() 582 for (int idx2 = 0; idx2 <= ptCount; ++idx2) { in endsIntersect() local 583 minX = SkTMin(minX, curve[idx2].fX); in endsIntersect() 584 minY = SkTMin(minY, curve[idx2].fY); in endsIntersect() 585 maxX = SkTMax(maxX, curve[idx2].fX); in endsIntersect() 586 maxY = SkTMax(maxY, curve[idx2].fY); in endsIntersect() [all …]
|
/external/skia/src/pathops/ |
D | SkOpAngle.cpp | 490 for (int idx2 = idx1 + 1; idx2 <= ptCount; ++idx2) { in distEndRatio() local 491 if (idx1 == idx2) { in distEndRatio() 495 v.set(pts[idx2] - pts[idx1]); in distEndRatio() 528 for (int idx2 = 0; idx2 < i.used(); ++idx2) { in endsIntersect() local 529 double testT = i[0][idx2]; in endsIntersect() 582 for (int idx2 = 0; idx2 <= ptCount; ++idx2) { in endsIntersect() local 583 minX = std::min(minX, curve[idx2].fX); in endsIntersect() 584 minY = std::min(minY, curve[idx2].fY); in endsIntersect() 585 maxX = std::max(maxX, curve[idx2].fX); in endsIntersect() 586 maxY = std::max(maxY, curve[idx2].fY); in endsIntersect() [all …]
|
/external/skia/tests/ |
D | PathOpsAngleTest.cpp | 247 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) { in DEF_TEST() local 248 data.fShortPts[idx2] = data.fPts.fPts[idx2].asSkPoint(); in DEF_TEST() 444 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) { in DEF_TEST() local 445 temp[idx2] = data.fPts.fPts[idx2].asSkPoint(); in DEF_TEST()
|
D | PathOpsTightBoundsTest.cpp | 40 for (int idx2 = 0; idx2 < 10; ++idx2) { in DEF_TEST() local 115 for (int idx2 = 0; idx2 < 10; ++idx2) { in DEF_TEST() local
|
/external/skqp/tests/ |
D | PathOpsAngleTest.cpp | 248 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) { in DEF_TEST() local 249 data.fShortPts[idx2] = data.fPts.fPts[idx2].asSkPoint(); in DEF_TEST() 447 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) { in DEF_TEST() local 448 temp[idx2] = data.fPts.fPts[idx2].asSkPoint(); in DEF_TEST()
|
D | PathOpsTightBoundsTest.cpp | 41 for (int idx2 = 0; idx2 < 10; ++idx2) { in DEF_TEST() local 116 for (int idx2 = 0; idx2 < 10; ++idx2) { in DEF_TEST() local
|
/external/tensorflow/tensorflow/compiler/tests/ |
D | dynamic_stitch_test.py | 54 idx2 = np.array([[1], [3]], dtype=np.int32) 58 [idx1, idx2], [val1, val2], 63 idx2 = np.array([[], []], dtype=np.int32) 66 self._AssertDynamicStitchResultIs([idx1, idx2], [val1, val2],
|
/external/jdiff/src/jdiff/ |
D | Comments.java | 111 int idx2 = xsdFileName.lastIndexOf('/'); in writeXSD() local 112 if (idx == -1 && idx2 == -1) { in writeXSD() 114 } else if (idx == -1 && idx2 != -1) { in writeXSD() 115 xsdFileName = xsdFileName.substring(0, idx2+1); in writeXSD() 116 } else if (idx != -1 && idx2 == -1) { in writeXSD() 118 } else if (idx != -1 && idx2 != -1) { in writeXSD() 119 int max = idx2 > idx ? idx2 : idx; in writeXSD()
|
/external/protobuf/objectivec/ |
D | GPBArray.h | 208 withValueAtIndex:(NSUInteger)idx2; 380 withValueAtIndex:(NSUInteger)idx2; 552 withValueAtIndex:(NSUInteger)idx2; 724 withValueAtIndex:(NSUInteger)idx2; 896 withValueAtIndex:(NSUInteger)idx2; 1068 withValueAtIndex:(NSUInteger)idx2; 1240 withValueAtIndex:(NSUInteger)idx2; 1534 withValueAtIndex:(NSUInteger)idx2;
|