/external/flatbuffers/tests/MyGame/Example/ |
D | ArrayStruct.cs | 80 … (var idx0 = 0; idx0 < 2; ++idx0) {for (var idx1 = 0; idx1 < 2; ++idx1) {_d_a[idx0,idx1] = _o.D[id… in Pack() 84 … (var idx0 = 0; idx0 < 2; ++idx0) {for (var idx1 = 0; idx1 < 2; ++idx1) {_d_c[idx0,idx1] = _o.D[id… in Pack() 86 … (var idx0 = 0; idx0 < 2; ++idx0) {for (var idx1 = 0; idx1 < 2; ++idx1) {_d_d[idx0,idx1] = _o.D[id… in Pack()
|
/external/brotli/c/enc/ |
D | cluster_inc.h | 15 const HistogramType* out, const uint32_t* cluster_size, uint32_t idx1, 20 p.idx1 = p.idx2 = 0; 22 if (idx1 == idx2) { 25 if (idx2 < idx1) { 27 idx2 = idx1; 28 idx1 = t; 30 p.idx1 = idx1; 32 p.cost_diff = 0.5 * ClusterCostDiff(cluster_size[idx1], cluster_size[idx2]); 33 p.cost_diff -= out[idx1].bit_cost_; 36 if (out[idx1].total_count_ == 0) { [all …]
|
/external/llvm/test/Transforms/SLPVectorizer/X86/ |
D | propagate_ir_flags.ll | 13 %idx1 = getelementptr inbounds i32, i32* %x, i64 0 18 %load1 = load i32, i32* %idx1, align 4 28 store i32 %op1, i32* %idx1, align 4 39 %idx1 = getelementptr inbounds i32, i32* %x, i64 0 44 %load1 = load i32, i32* %idx1, align 4 54 store i32 %op1, i32* %idx1, align 4 65 %idx1 = getelementptr inbounds i32, i32* %x, i64 0 70 %load1 = load i32, i32* %idx1, align 4 80 store i32 %op1, i32* %idx1, align 4 91 %idx1 = getelementptr inbounds i32, i32* %x, i64 0 [all …]
|
/external/kotlinx.coroutines/kotlinx-coroutines-core/jvm/test/internal/ |
D | LockFreeLinkedListAtomicLFStressTest.kt | 67 val idx1 = rnd.nextInt(nLists - 1) in <lambda>() constant 68 val idx2 = idx1 + 1 + rnd.nextInt(nLists - idx1 - 1) in <lambda>() 69 check(idx1 < idx2) // that is our global order in <lambda>() 70 val list1 = lists[idx1] in <lambda>() 87 val idx1 = rnd.nextInt(nLists - 1) in <lambda>() constant 88 val idx2 = idx1 + 1 + rnd.nextInt(nLists - idx1 - 1) in <lambda>() 89 check(idx1 < idx2) // that is our global order in <lambda>() 90 val list1 = lists[idx1] in <lambda>()
|
/external/webp/src/enc/ |
D | histogram_enc.c | 732 int idx1; member 803 VP8LHistogram** const histograms, int idx1, in HistoQueuePush() argument 812 if (idx1 > idx2) { in HistoQueuePush() 814 idx2 = idx1; in HistoQueuePush() 815 idx1 = tmp; in HistoQueuePush() 817 pair.idx1 = idx1; in HistoQueuePush() 819 h1 = histograms[idx1]; in HistoQueuePush() 867 const int idx1 = histo_queue.queue[0].idx1; in HistogramCombineGreedy() local 869 HistogramAdd(histograms[idx2], histograms[idx1], histograms[idx1]); in HistogramCombineGreedy() 870 histograms[idx1]->bit_cost_ = histo_queue.queue[0].cost_combo; in HistogramCombineGreedy() [all …]
|
/external/llvm-project/llvm/test/Transforms/SLPVectorizer/X86/ |
D | propagate_ir_flags.ll | 24 %idx1 = getelementptr inbounds i32, i32* %x, i64 0 29 %load1 = load i32, i32* %idx1, align 4 39 store i32 %op1, i32* %idx1, align 4 60 %idx1 = getelementptr inbounds i32, i32* %x, i64 0 65 %load1 = load i32, i32* %idx1, align 4 75 store i32 %op1, i32* %idx1, align 4 96 %idx1 = getelementptr inbounds i32, i32* %x, i64 0 101 %load1 = load i32, i32* %idx1, align 4 111 store i32 %op1, i32* %idx1, align 4 132 %idx1 = getelementptr inbounds i32, i32* %x, i64 0 [all …]
|
D | call.ll | 25 %idx1 = getelementptr inbounds double, double* %a, i64 1 26 %a1 = load double, double* %idx1, align 8 45 %idx1 = getelementptr inbounds double, double* %a, i64 1 46 %a1 = load double, double* %idx1, align 8 65 %idx1 = getelementptr inbounds double, double* %a, i64 1 66 %a1 = load double, double* %idx1, align 8 85 %idx1 = getelementptr inbounds double, double* %a, i64 1 86 %a1 = load double, double* %idx1, align 8 108 %idx1 = getelementptr inbounds double, double* %a, i64 1 109 %a1 = load double, double* %idx1, align 8 [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)]); \ 153 static_cast<int>(idx1), static_cast<float>((arr1)[(idx1)]), \
|
/external/strace/ |
D | kcmp.c | 60 kernel_ulong_t idx1 = tcp->u_arg[3]; in SYS_FUNC() local 69 printpidfd(tcp, pid1, idx1); in SYS_FUNC() 79 printpidfd(tcp, pid1, idx1); in SYS_FUNC() 101 tprintf(", %#" PRI_klx ", %#" PRI_klx, idx1, idx2); in SYS_FUNC()
|
/external/llvm-project/llvm/test/CodeGen/X86/ |
D | dag-merge-fast-accesses.ll | 22 %idx1 = getelementptr i64, i64* %ptr, i64 1 25 store i64 0, i64* %idx1, align 8 46 %idx1 = getelementptr double, double* %ptr, i64 1 49 store double %vecext1, double* %idx1, align 8 70 %idx1 = getelementptr i64, i64* %ptr, i64 1 73 %ld1 = load i64, i64* %idx1, align 4
|
/external/llvm/test/CodeGen/X86/ |
D | dag-merge-fast-accesses.ll | 22 %idx1 = getelementptr i64, i64* %ptr, i64 1 25 store i64 0, i64* %idx1, align 8 46 %idx1 = getelementptr double, double* %ptr, i64 1 49 store double %vecext1, double* %idx1, align 8 78 %idx1 = getelementptr i64, i64* %ptr, i64 1 81 %ld1 = load i64, i64* %idx1, align 4
|
/external/eigen/unsupported/Eigen/CXX11/src/Tensor/ |
D | TensorStriding.h | 175 const Index idx1 = indices[1] / m_outputStrides[i]; 177 inputIndices[1] += idx1 * m_inputStrides[i]; 179 indices[1] -= idx1 * m_outputStrides[i]; 186 const Index idx1 = indices[1] / m_outputStrides[i]; 188 inputIndices[1] += idx1 * m_inputStrides[i]; 190 indices[1] -= idx1 * m_outputStrides[i]; 300 const Index idx1 = indices[1] / this->m_outputStrides[i]; 302 inputIndices[1] += idx1 * this->m_inputStrides[i]; 304 indices[1] -= idx1 * this->m_outputStrides[i]; 311 const Index idx1 = indices[1] / this->m_outputStrides[i]; [all …]
|
/external/llvm-project/llvm/test/CodeGen/AMDGPU/ |
D | llvm.amdgcn.softwqm.ll | 10 define amdgpu_ps float @test1(i32 inreg %idx0, i32 inreg %idx1) { 13 …%src1 = call float @llvm.amdgcn.struct.buffer.load.f32(<4 x i32> undef, i32 %idx1, i32 0, i32 0, i… 26 define amdgpu_ps float @test2(i32 inreg %idx0, i32 inreg %idx1) { 29 …%src1 = call float @llvm.amdgcn.struct.buffer.load.f32(<4 x i32> undef, i32 %idx1, i32 0, i32 0, i… 46 define amdgpu_ps float @test_softwqm1(i32 inreg %idx0, i32 inreg %idx1) { 49 …%src1 = call float @llvm.amdgcn.struct.buffer.load.f32(<4 x i32> undef, i32 %idx1, i32 0, i32 0, i… 68 define amdgpu_ps float @test_softwqm2(i32 inreg %idx0, i32 inreg %idx1) { 71 …%src1 = call float @llvm.amdgcn.struct.buffer.load.f32(<4 x i32> undef, i32 %idx1, i32 0, i32 0, i… 92 define amdgpu_ps float @test_wwm1(i32 inreg %idx0, i32 inreg %idx1) { 96 …%src1 = call float @llvm.amdgcn.struct.buffer.load.f32(<4 x i32> undef, i32 %idx1, i32 0, i32 0, i… [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() 114 printpidfd(", ", pid1, idx1); in do_kcmp() 124 printpidfd(", ", pid1, idx1); 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() 114 printpidfd(", ", pid1, idx1); in do_kcmp() 124 printpidfd(", ", pid1, idx1); 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() 114 printpidfd(", ", pid1, idx1); in do_kcmp() 124 printpidfd(", ", pid1, idx1); in do_kcmp() 142 (unsigned long long) idx1, (unsigned long long) idx2); in do_kcmp()
|
/external/llvm-project/llvm/test/CodeGen/NVPTX/ |
D | lower-args.ll | 19 %arg.idx1 = getelementptr %class.outer, %class.outer* %arg, i64 0, i32 0, i32 1 20 %arg.idx1.val = load i32*, i32** %arg.idx1, align 8 25 store i32 %add.i, i32* %arg.idx1.val, align 4
|
/external/swiftshader/third_party/subzero/crosstest/ |
D | test_vector_ops_ll.ll | 4 i32 1, label %idx1 11 idx1: 29 i32 1, label %idx1 37 idx1: 58 i32 1, label %idx1 70 idx1: 107 i32 1, label %idx1 127 idx1: 196 i32 1, label %idx1 203 idx1: [all …]
|
/external/llvm-project/llvm/test/Transforms/InferAddressSpaces/AMDGPU/ |
D | infer-getelementptr.ll | 11 define void @simplified_constexpr_gep_addrspacecast(i64 %idx0, i64 %idx1) { 21 define void @constexpr_gep_addrspacecast(i64 %idx0, i64 %idx1) { 30 ; CHECK-NEXT: %gep1 = getelementptr inbounds double, double addrspace(3)* %gep0, i64 %idx1 32 define void @constexpr_gep_gep_addrspacecast(i64 %idx0, i64 %idx1) { 34 %gep1 = getelementptr inbounds double, double* %gep0, i64 %idx1 60 …telementptr inbounds ([648 x double], [648 x double] addrspace(3)* @lds, i64 0, i64 384), i64 %idx1 63 define void @repeated_constexpr_gep_addrspacecast(i64 %idx0, i64 %idx1) { 68 …]* addrspacecast ([648 x double] addrspace(3)* @lds to [648 x double]*), i64 0, i64 384), i64 %idx1
|
/external/eigen/unsupported/Eigen/src/BVH/ |
D | KdBVH.h | 196 int idx1 = (int)boxes.size() - 1; 197 boxes.push_back(boxes[idx1].merged(objBoxes[objCenters[mid].second])); 198 children.push_back(idx1); 206 int idx1 = (int)boxes.size() - 1; 209 boxes.push_back(boxes[idx1].merged(boxes[idx2])); 210 children.push_back(idx1);
|
/external/tensorflow/tensorflow/compiler/tests/ |
D | dynamic_stitch_test.py | 53 idx1 = np.array([0, 2], dtype=np.int32) 58 [idx1, idx2], [val1, val2], 62 idx1 = np.array([], dtype=np.int32) 66 self._AssertDynamicStitchResultIs([idx1, idx2], [val1, val2],
|
/external/tensorflow/tensorflow/lite/ |
D | arena_planner.cc | 264 auto tensor_compare = [this](int idx1, int idx2) { in CreateTensorAllocationVector() argument 268 if (this->alloc_node_[idx1] == 0 && in CreateTensorAllocationVector() 269 this->dealloc_node_[idx1] == kNodeNotAssigned) { in CreateTensorAllocationVector() 272 return idx1 < idx2; in CreateTensorAllocationVector() 282 auto size1 = this->graph_info_->tensor(idx1)->bytes; in CreateTensorAllocationVector() 288 return this->alloc_node_[idx1] < this->alloc_node_[idx2]; in CreateTensorAllocationVector()
|
/external/libaom/libaom/tools/txfm_analyzer/ |
D | txfm_gen_code.cc | 46 int idx1 = get_cos_idx(w1, mod); in cos_text_sse2() local 51 snprintf(text, size, "cospi_%s%02d_%s%02d", sgn0, idx0, sgn1, idx1); in cos_text_sse2() 287 int idx1 = get_cos_idx(w1, COS_MOD); in gen_cospi_list_sse2() local 291 if (!visited[idx0][idx1][sgn0][sgn1]) { in gen_cospi_list_sse2() 292 visited[idx0][idx1][sgn0][sgn1] = 1; in gen_cospi_list_sse2() 305 int idx1 = get_cos_idx(w1, COS_MOD); in gen_cospi_list_sse2() local 309 if (!visited[idx1][idx0][sgn1][sgn0]) { in gen_cospi_list_sse2() 310 visited[idx1][idx0][sgn1][sgn0] = 1; in gen_cospi_list_sse2() 320 int idx1 = get_cos_idx(w1, COS_MOD); in gen_cospi_list_sse2() local 324 if (!visited[idx0][idx1][sgn0][sgn1]) { in gen_cospi_list_sse2() [all …]
|
/external/protobuf/objectivec/ |
D | GPBArray.h | 207 - (void)exchangeValueAtIndex:(NSUInteger)idx1 379 - (void)exchangeValueAtIndex:(NSUInteger)idx1 551 - (void)exchangeValueAtIndex:(NSUInteger)idx1 723 - (void)exchangeValueAtIndex:(NSUInteger)idx1 895 - (void)exchangeValueAtIndex:(NSUInteger)idx1 1067 - (void)exchangeValueAtIndex:(NSUInteger)idx1 1239 - (void)exchangeValueAtIndex:(NSUInteger)idx1 1533 - (void)exchangeValueAtIndex:(NSUInteger)idx1
|
/external/tensorflow/tensorflow/core/grappler/optimizers/data/ |
D | graph_utils.cc | 209 int idx1 = name_index1[i]; in Compare() local 211 if (g1.node(idx1).op() != g2.node(idx2).op()) { in Compare() 214 if (g1.node(idx1).name() != g2.node(idx2).name()) { in Compare() 217 if (g1.node(idx1).input_size() != g2.node(idx2).input_size()) { in Compare() 220 std::vector<int> input_index1 = CreateInputIndex(g1.node(idx1)); in Compare() 222 for (int j = 0; j < g1.node(idx1).input_size(); ++j) { in Compare() 223 if (!IsSameInput(g1.node(idx1).input(input_index1[j]), in Compare()
|