| /external/toybox/tests/files/bc/ |
| D | bessel.txt | 1 j(0, 0) 2 j(0, .5) 3 j(0, -.5) 4 j(0, 1) 5 j(0, -1) 6 j(0, 1.5) 7 j(0, -1.5) 8 j(0, 1.74) 9 j(0, -1.74) 10 j(0, 2) [all …]
|
| /external/fft2d/src/fft2d/fft2d/ |
| D | shrtdct.c | 4 method :row-column, radix 4 FFT 15 -------- 8x8 DCT (Discrete Cosine Transform) / Inverse of DCT -------- 22 (s[0] = 1/sqrt(2), s[j] = 1, j > 0) 28 (s[0] = 1/sqrt(2), s[j] = 1, j > 0) 33 ddct8x8s(-1, a); 57 int j; in ddct8x8s() local 62 for (j = 0; j <= 7; j++) { in ddct8x8s() 63 x0r = a[0][j] + a[7][j]; in ddct8x8s() 64 x1r = a[0][j] - a[7][j]; in ddct8x8s() 65 x0i = a[2][j] + a[5][j]; in ddct8x8s() [all …]
|
| /external/clang/test/SemaCXX/ |
| D | complex-folding.cpp | 1 // RUN: %clang_cc1 %s -std=c++1z -fsyntax-only -verify 5 static_assert((0.0 + 0.0j) == (0.0 + 0.0j)); 6 static_assert((0.0 + 0.0j) != (0.0 + 0.0j)); // expected-error {{static_assert}} 8 static_assert((0.0 + 0.0j) == 0.0); 9 static_assert(0.0 == (0.0 + 0.0j)); 10 static_assert(0.0 == 0.0j); 11 static_assert((0.0 + 1.0j) != 0.0); 12 static_assert(1.0 != (0.0 + 0.0j)); 13 static_assert(0.0 != 1.0j); 17 static_assert((1.0 + 0.0j) == (0.0 + 0.0j)); // expected-error {{static_assert}} [all …]
|
| /external/python/cpython3/Lib/ |
| D | _markupbase.py | 10 _declname_match = re.compile(r'[a-zA-Z][-_.a-zA-Z0-9]*\s*').match 12 _commentclose = re.compile(r'--\s*>') 15 # An analysis of the MS-Word extensions is available at 40 # Internal -- update line number and offset. This should be 41 # called for each piece of data exactly once, in order -- in other 44 def updatepos(self, i, j): argument 45 if i >= j: 46 return j 48 nlines = rawdata.count("\n", i, j) 51 pos = rawdata.rindex("\n", i, j) # Should not fail [all …]
|
| /external/libnetfilter_conntrack/src/conntrack/ |
| D | bsf.c | 2 * (C) 2005-2011 by Pablo Neira Ayuso <pablo@netfilter.org> 173 .jt = jump_true - 1, in nfct_bsf_cmp_k_stack() 193 .jf = jump_false - 1, in nfct_bsf_cmp_k_stack_jf() 247 /* A = skb->data[X + k:word_size] */ in nfct_bsf_load_attr() 261 /* A = skb->data[X + k:word_size] */ in nfct_bsf_load_attr_offset() 297 /* X = offset to nlh->nlmsg_type */ in bsf_cmp_subsys() 302 /* A = skb->data[X+k:B] (subsys_id) */ in bsf_cmp_subsys() 325 unsigned int i, j; in add_state_filter_cta() local 330 /* XXX: 32 maximum states + 3 jumps in the three-level iteration */ in add_state_filter_cta() 334 return -1; in add_state_filter_cta() [all …]
|
| /external/ComputeLibrary/src/core/NEON/kernels/convolution/winograd/input_transforms/ |
| D | a64_fp16_6x6.cpp | 4 * SPDX-License-Identifier: MIT 52 for (int j = 0, xj = 0; j < inner_tile_cols; j++, xj++) in a64_fp16_6x6() local 54 x_ptrs[i][j] = row_ptr + xj*input_col_stride; in a64_fp16_6x6() 64 for (int j = 0; j < inner_tile_cols; j++) in a64_fp16_6x6() local 66 x[i][j] = XTx[i][j] = 0.0f; in a64_fp16_6x6() 73 for (; channels_remaining >= 8; channels_remaining -= 8) in a64_fp16_6x6() 81 for (int j = 0; j < inner_tile_cols; j++) in a64_fp16_6x6() local 83 x[i][j] = vdupq_n_f16(0.0f); in a64_fp16_6x6() 84 XTx[i][j] = vdupq_n_f16(0.0f); in a64_fp16_6x6() 91 for (int j = 0; j < inner_tile_cols; j++) in a64_fp16_6x6() local [all …]
|
| D | arm_fp32_6x6.cpp | 4 * SPDX-License-Identifier: MIT 53 for (int j = 0, xj = 0; j < inner_tile_cols; j++, xj++) in arm_fp32_6x6() local 55 x_ptrs[i][j] = row_ptr + xj*input_col_stride; in arm_fp32_6x6() 65 for (int j = 0; j < inner_tile_cols; j++) in arm_fp32_6x6() local 67 x[i][j] = XTx[i][j] = 0.0f; in arm_fp32_6x6() 74 for (; channels_remaining >= 2; channels_remaining -= 2) in arm_fp32_6x6() 82 for (int j = 0; j < inner_tile_cols; j++) in arm_fp32_6x6() local 84 x[i][j] = vdup_n_f32(0.0f); in arm_fp32_6x6() 85 XTx[i][j] = vdup_n_f32(0.0f); in arm_fp32_6x6() 92 for (int j = 0; j < inner_tile_cols; j++) in arm_fp32_6x6() local [all …]
|
| /external/python/cpython3/Lib/test/ |
| D | test_complex.py | 18 (1+1j, 0+0j), 19 (1+1j, 0.0), 20 (1+1j, 0), 21 (1.0, 0+0j), 22 (1, 0+0j), 63 def assertCloseAbs(self, x, y, eps=1e-9): 73 self.assertTrue(abs((x-y)/y) < eps) 75 def assertClose(self, x, y, eps=1e-9): 95 simple_real = [float(i) for i in range(-5, 6)] 103 self.check_div(complex(1e200, 1e200), 1+0j) [all …]
|
| /external/mesa3d/src/gallium/drivers/softpipe/ |
| D | sp_quad_depth_test.c | 21 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. 64 unsigned j; in get_depth_stencil_values() local 65 const struct softpipe_cached_tile *tile = data->tile; in get_depth_stencil_values() 67 switch (data->format) { in get_depth_stencil_values() 69 for (j = 0; j < TGSI_QUAD_SIZE; j++) { in get_depth_stencil_values() 70 int x = quad->input.x0 % TILE_SIZE + (j & 1); in get_depth_stencil_values() 71 int y = quad->input.y0 % TILE_SIZE + (j >> 1); in get_depth_stencil_values() 72 data->bzzzz[j] = tile->data.depth16[y][x]; in get_depth_stencil_values() 76 for (j = 0; j < TGSI_QUAD_SIZE; j++) { in get_depth_stencil_values() 77 int x = quad->input.x0 % TILE_SIZE + (j & 1); in get_depth_stencil_values() [all …]
|
| /external/libcxx/test/std/containers/sequences/vector/vector.modifiers/ |
| D | insert_iter_size_value.pass.cpp | 1 //===----------------------------------------------------------------------===// 8 //===----------------------------------------------------------------------===// 31 int j; in main() local 32 for (j = 0; j < 10; ++j) in main() 33 assert(v[j] == 0); in main() 34 for (; j < 15; ++j) in main() 35 assert(v[j] == 1); in main() 36 for (++j; j < 105; ++j) in main() 37 assert(v[j] == 0); in main() 47 std::size_t j; in main() local [all …]
|
| D | push_back.pass.cpp | 1 //===----------------------------------------------------------------------===// 8 //===----------------------------------------------------------------------===// 28 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in main() local 29 assert(c[j] == j); in main() 33 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in main() local 34 assert(c[j] == j); in main() 38 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in main() local 39 assert(c[j] == j); in main() 43 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in main() local 44 assert(c[j] == j); in main() [all …]
|
| D | push_back_rvalue.pass.cpp | 1 //===----------------------------------------------------------------------===// 8 //===----------------------------------------------------------------------===// 31 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in main() local 32 assert(c[j] == MoveOnly(j)); in main() 36 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in main() local 37 assert(c[j] == MoveOnly(j)); in main() 41 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in main() local 42 assert(c[j] == MoveOnly(j)); in main() 46 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in main() local 47 assert(c[j] == MoveOnly(j)); in main() [all …]
|
| /external/ComputeLibrary/src/core/NEON/kernels/convolution/winograd/weight_transforms/ |
| D | arm_fp32_2x2_5x5.cpp | 4 * SPDX-License-Identifier: MIT 40 for (; n_channels >= 4; n_channels -= 4) in arm_fp32_2x2_5x5() 48 for (int j = 0; j < 5; j++) in arm_fp32_2x2_5x5() local 50 w[i][j] = vld1q_f32(inptr + i*ld_weight_row + j*ld_weight_col); in arm_fp32_2x2_5x5() 55 for (int j = 0; j < 5; j++) in arm_fp32_2x2_5x5() local 57 // Ww[0][j] = w[0][j]/4.0f; in arm_fp32_2x2_5x5() 58 Ww[0][j] = vmulq_n_f32(w[0][j], 1.0f/4.0f); in arm_fp32_2x2_5x5() 60 // Ww[1][j] = -( w[0][j] + w[1][j] + w[2][j] + w[3][j] + w[4][j])/6.0f; in arm_fp32_2x2_5x5() 61 Ww[1][j] = vmulq_n_f32( in arm_fp32_2x2_5x5() 64 vaddq_f32(w[1][j], w[0][j]), in arm_fp32_2x2_5x5() [all …]
|
| /external/minijail/ |
| D | libminijail.c | 2 * Use of this source code is governed by a BSD-style license that can be 38 #include "libminijail-private.h" 52 /* New cgroup namespace might not be in linux-headers yet. */ 231 static void run_hooks_or_die(const struct minijail *j, 234 static bool seccomp_is_logging_allowed(const struct minijail *j) in seccomp_is_logging_allowed() argument 236 return seccomp_default_ret_log() || j->flags.seccomp_filter_logging; in seccomp_is_logging_allowed() 239 static void free_mounts_list(struct minijail *j) in free_mounts_list() argument 241 while (j->mounts_head) { in free_mounts_list() 242 struct mountpoint *m = j->mounts_head; in free_mounts_list() 243 j->mounts_head = j->mounts_head->next; in free_mounts_list() [all …]
|
| /external/cronet/stable/third_party/libc++/src/test/std/containers/sequences/vector/vector.modifiers/ |
| D | push_back.pass.cpp | 1 //===----------------------------------------------------------------------===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 28 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in tests() local 29 assert(c[j] == j); in tests() 33 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in tests() local 34 assert(c[j] == j); in tests() 38 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in tests() local 39 assert(c[j] == j); in tests() 43 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in tests() local [all …]
|
| D | insert_iter_size_value.pass.cpp | 1 //===----------------------------------------------------------------------===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 30 int j; in tests() local 31 for (j = 0; j < 10; ++j) in tests() 32 assert(v[j] == 0); in tests() 33 for (; j < 15; ++j) in tests() 34 assert(v[j] == 1); in tests() 35 for (++j; j < 105; ++j) in tests() 36 assert(v[j] == 0); in tests() [all …]
|
| D | push_back_rvalue.pass.cpp | 1 //===----------------------------------------------------------------------===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 31 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in tests() local 32 assert(c[j] == MoveOnly(j)); in tests() 36 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in tests() local 37 assert(c[j] == MoveOnly(j)); in tests() 41 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in tests() local 42 assert(c[j] == MoveOnly(j)); in tests() 46 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in tests() local [all …]
|
| /external/cronet/tot/third_party/libc++/src/test/std/containers/sequences/vector/vector.modifiers/ |
| D | push_back.pass.cpp | 1 //===----------------------------------------------------------------------===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 28 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in tests() local 29 assert(c[j] == j); in tests() 33 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in tests() local 34 assert(c[j] == j); in tests() 38 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in tests() local 39 assert(c[j] == j); in tests() 43 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in tests() local [all …]
|
| D | insert_iter_size_value.pass.cpp | 1 //===----------------------------------------------------------------------===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 30 int j; in tests() local 31 for (j = 0; j < 10; ++j) in tests() 32 assert(v[j] == 0); in tests() 33 for (; j < 15; ++j) in tests() 34 assert(v[j] == 1); in tests() 35 for (++j; j < 105; ++j) in tests() 36 assert(v[j] == 0); in tests() [all …]
|
| D | push_back_rvalue.pass.cpp | 1 //===----------------------------------------------------------------------===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 31 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in tests() local 32 assert(c[j] == MoveOnly(j)); in tests() 36 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in tests() local 37 assert(c[j] == MoveOnly(j)); in tests() 41 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in tests() local 42 assert(c[j] == MoveOnly(j)); in tests() 46 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in tests() local [all …]
|
| /external/spdx-tools/rdfloader/parser2v2/ |
| D | parse_snippet_info_test.go | 1 // SPDX-License-Identifier: Apache-2.0 OR GPL-2.0-or-later 9 "github.com/spdx/tools-golang/spdx/common" 10 "github.com/spdx/tools-golang/spdx/v2_2" 31 <spdx:Snippet rdf:about="#SPDXRef-Snippet"> 43 <spdx:Snippet rdf:about="#SPDXRef-Snippet"> 59 <spdx:Snippet rdf:about="#SPDXRef-Snippet"> 61 <spdx:File rdf:resource="http://anupam-VirtualBox/spdx.rdf#item8" /> 73 <spdx:Snippet rdf:about="#SPDXRef-Snippet"> 85 <spdx:Snippet rdf:about="#SPDXRef-Snippet"> 97 <spdx:Snippet rdf:about="#SPDXRef-Snippet"> [all …]
|
| /external/spdx-tools/rdfloader/parser2v3/ |
| D | parse_snippet_info_test.go | 1 // SPDX-License-Identifier: Apache-2.0 OR GPL-2.0-or-later 9 "github.com/spdx/tools-golang/spdx/common" 10 "github.com/spdx/tools-golang/spdx/v2_3" 31 <spdx:Snippet rdf:about="#SPDXRef-Snippet"> 43 <spdx:Snippet rdf:about="#SPDXRef-Snippet"> 59 <spdx:Snippet rdf:about="#SPDXRef-Snippet"> 61 <spdx:File rdf:resource="http://anupam-VirtualBox/spdx.rdf#item8" /> 73 <spdx:Snippet rdf:about="#SPDXRef-Snippet"> 85 <spdx:Snippet rdf:about="#SPDXRef-Snippet"> 97 <spdx:Snippet rdf:about="#SPDXRef-Snippet"> [all …]
|
| /external/cronet/tot/third_party/llvm-libc/src/test/src/__support/CPP/ |
| D | bitset_test.cpp | 1 //===-- Unittests for bitset ----------------------------------------------===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 32 for (size_t j = 0; j < 7; ++j) in TEST() local 33 EXPECT_TRUE(bitset.test(j)); in TEST() 41 for (size_t j = 0; j < 15; ++j) in TEST() local 42 EXPECT_TRUE(bitset.test(j)); in TEST() 50 for (size_t j = 0; j < 31; ++j) in TEST() local 51 EXPECT_TRUE(bitset.test(j)); in TEST() 100 for (size_t j = 0; j < 128; ++j) in TEST() local [all …]
|
| /external/cronet/stable/third_party/llvm-libc/src/test/src/__support/CPP/ |
| D | bitset_test.cpp | 1 //===-- Unittests for bitset ----------------------------------------------===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 32 for (size_t j = 0; j < 7; ++j) in TEST() local 33 EXPECT_TRUE(bitset.test(j)); in TEST() 41 for (size_t j = 0; j < 15; ++j) in TEST() local 42 EXPECT_TRUE(bitset.test(j)); in TEST() 50 for (size_t j = 0; j < 31; ++j) in TEST() local 51 EXPECT_TRUE(bitset.test(j)); in TEST() 100 for (size_t j = 0; j < 128; ++j) in TEST() local [all …]
|
| /external/llvm-libc/test/src/__support/CPP/ |
| D | bitset_test.cpp | 1 //===-- Unittests for bitset ----------------------------------------------===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 32 for (size_t j = 0; j < 7; ++j) in TEST() local 33 EXPECT_TRUE(bitset.test(j)); in TEST() 41 for (size_t j = 0; j < 15; ++j) in TEST() local 42 EXPECT_TRUE(bitset.test(j)); in TEST() 50 for (size_t j = 0; j < 31; ++j) in TEST() local 51 EXPECT_TRUE(bitset.test(j)); in TEST() 100 for (size_t j = 0; j < 128; ++j) in TEST() local [all …]
|