| /external/opencv3/modules/photo/src/ |
| D | arrays.hpp | 134 int n1,n2,n3,n4; member
140 steps[0] = n2*n3*n4; in init_steps()
141 steps[1] = n3*n4; in init_steps()
142 steps[2] = n4; in init_steps()
147 a(_a), n1(_n1), n2(_n2), n3(_n3), n4(_n4), needToDeallocArray(false) in Array4d()
153 n1(_n1), n2(_n2), n3(_n3), n4(_n4), needToDeallocArray(true) in Array4d()
155 a = new T[n1*n2*n3*n4]; in Array4d()
167 Array3d<T> array3d(a + i*n2*n3*n4, n2, n3, n4); in operator []()
173 return a + i1*n2*n3*n4 + i2*n3*n4 + i3*n4; in row_ptr()
|
| /external/v8/src/compiler/ |
| D | graph.h | 57 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { in NewNode() argument
58 Node* nodes[] = {n1, n2, n3, n4}; in NewNode()
61 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() argument
63 Node* nodes[] = {n1, n2, n3, n4, n5}; in NewNode()
66 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() argument
68 Node* nodes[] = {n1, n2, n3, n4, n5, n6}; in NewNode()
71 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() argument
73 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7}; in NewNode()
76 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() argument
78 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7, n8}; in NewNode()
[all …]
|
| D | ast-graph-builder.h | 189 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { in NewNode() argument
190 Node* buffer[] = {n1, n2, n3, n4}; in NewNode()
194 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() argument
196 Node* buffer[] = {n1, n2, n3, n4, n5}; in NewNode()
200 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() argument
202 Node* nodes[] = {n1, n2, n3, n4, n5, n6}; in NewNode()
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/ |
| D | test_object_graph.py | 53 n4 = Node("n4")
65 self.assertFalse(n4 in graph)
72 self.assertTrue(graph.findNode(n4) is None)
79 self.assertEqual(graph.getRawIdent(n4), "n4")
84 self.assertEqual(graph.getIdent(n4), "n4")
113 n4 = graph.createNode(ArgNode, "n4", 1)
154 n4 = graph.createNode(ArgNode, "n4", 4)
163 graph.createReference(n1, n4)
167 graph.createReference(n4, n6)
168 graph.createReference(n4, n2)
[all …]
|
| /external/libvorbis/lib/ |
| D | mdct.c | 400 int n4=n>>2; in mdct_backward() local
405 DATA_TYPE *oX = out+n2+n4; in mdct_backward()
406 DATA_TYPE *T = init->trig+n4; in mdct_backward()
419 oX = out+n2+n4; in mdct_backward()
420 T = init->trig+n4; in mdct_backward()
438 DATA_TYPE *oX1=out+n2+n4; in mdct_backward()
439 DATA_TYPE *oX2=out+n2+n4; in mdct_backward()
463 iX=out+n2+n4; in mdct_backward()
464 oX1=out+n4; in mdct_backward()
479 iX=out+n2+n4; in mdct_backward()
[all …]
|
| /external/libvpx/libvpx/vpx_dsp/mips/ |
| D | idct32x32_msa.c | 15 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; in idct32x8_row_transpose_store() local
19 LD_SH8((input + 8), 32, m4, n4, m5, n5, m6, n6, m7, n7); in idct32x8_row_transpose_store()
22 TRANSPOSE8x8_SH_SH(m4, n4, m5, n5, m6, n6, m7, n7, in idct32x8_row_transpose_store()
23 m4, n4, m5, n5, m6, n6, m7, n7); in idct32x8_row_transpose_store()
25 ST_SH4(m4, n4, m5, n5, (tmp_buf + 8 * 8), 8); in idct32x8_row_transpose_store()
30 LD_SH8((input + 24), 32, m4, n4, m5, n5, m6, n6, m7, n7); in idct32x8_row_transpose_store()
33 TRANSPOSE8x8_SH_SH(m4, n4, m5, n5, m6, n6, m7, n7, in idct32x8_row_transpose_store()
34 m4, n4, m5, n5, m6, n6, m7, n7); in idct32x8_row_transpose_store()
37 ST_SH4(m4, n4, m5, n5, (tmp_buf + 24 * 8), 8); in idct32x8_row_transpose_store()
248 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; in idct_butterfly_transpose_store() local
[all …]
|
| D | convolve8_avg_horiz_dspr2.c | 34 uint32_t n1, n2, n3, n4; in convolve_avg_horiz_4_dspr2() local
128 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4), in convolve_avg_horiz_4_dspr2()
|
| D | convolve8_horiz_dspr2.c | 34 uint32_t n1, n2, n3, n4; in convolve_horiz_4_dspr2() local
117 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4), in convolve_horiz_4_dspr2()
|
| /external/v8/test/unittests/compiler/ |
| D | node-unittest.cc | 175 Node* n4 = Node::New(zone(), 4, &kOp0, 0, nullptr, false); in TEST_F() local
208 node->AppendInput(zone(), n4); in TEST_F()
210 EXPECT_THAT(node->inputs(), ElementsAre(n1, n3, n4)); in TEST_F()
214 EXPECT_THAT(node->inputs(), ElementsAre(n1, n3, n4, n5)); in TEST_F()
218 EXPECT_THAT(node->inputs(), ElementsAre(n1, n3, n4, n5, n6)); in TEST_F()
222 EXPECT_THAT(node->inputs(), ElementsAre(n1, n3, n4, n5, n6, n7)); in TEST_F()
225 EXPECT_THAT(node->inputs(), ElementsAre(n1, n3, n4, n5)); in TEST_F()
229 EXPECT_THAT(node->inputs(), ElementsAre(n1, n3, n4, n5, n8)); in TEST_F()
233 EXPECT_THAT(node->inputs(), ElementsAre(n1, n3, n4, n5, n8, n9)); in TEST_F()
|
| /external/gemmlowp/test/ |
| D | test_fixedpoint.cc | 158 size_t n4 = n - (n % 4); in test_int32x4() local
159 std::vector<int32_t> results_int32(n4); in test_int32x4()
160 std::vector<int32_t> results_int32x4(n4); in test_int32x4()
162 for (size_t i = 0; i < n4; i++) { in test_int32x4()
166 for (size_t i = 0; i < n4; i++) { in test_int32x4()
173 for (size_t i = 0; i < n4; i++) { in test_int32x4()
|
| /external/v8/test/cctest/compiler/ |
| D | test-node.cc | 199 Node* n4 = graph.NewNode(&dummy_operator0); in TEST() local
205 CHECK_USES(n4, NONE); in TEST()
209 n3->ReplaceInput(1, n4); in TEST()
212 CHECK_USES(n4, n3); in TEST()
214 CHECK_INPUTS(n3, n0, n4, n2); in TEST()
301 Node* n4 = graph.NewNode(&dummy_operator3, n0, n1, n2); in TEST() local
302 n3->AppendInput(graph.zone(), n4); in TEST()
304 CHECK_INPUTS(n3, n0, n1, n2, n4); in TEST()
305 CHECK_USES(n4, n3); in TEST()
307 n3->AppendInput(graph.zone(), n4); in TEST()
[all …]
|
| D | graph-builder-tester.h | 208 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { in NewNode() argument
209 Node* buffer[] = {n1, n2, n3, n4}; in NewNode()
213 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() argument
215 Node* buffer[] = {n1, n2, n3, n4, n5}; in NewNode()
219 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() argument
221 Node* nodes[] = {n1, n2, n3, n4, n5, n6}; in NewNode()
|
| D | test-graph-visualizer.cc | 111 Node* n4 = graph.NewNode(&dummy_operator1, n2); in TEST() local
119 Node* end_dependencies[6] = {n4, n8, n10, n11, n6, n7}; in TEST()
|
| /external/speex/libspeex/ |
| D | lsp.c | 532 float *pw,*n1,*n2,*n3,*n4=NULL; in lsp_to_lpc() local
565 n4 = n3 + 1; in lsp_to_lpc()
567 xout2 = xin2 - 2.f*x_freq[i2+1] * *n3 + *n4; in lsp_to_lpc()
569 *n4 = *n3; in lsp_to_lpc()
575 xout1 = xin1 + *(n4+1); in lsp_to_lpc()
576 xout2 = xin2 - *(n4+2); in lsp_to_lpc()
579 *(n4+1) = xin1; in lsp_to_lpc()
580 *(n4+2) = xin2; in lsp_to_lpc()
|
| /external/v8/test/mjsunit/compiler/ |
| D | osr-infinite.js | 37 function n4() { function
75 test(n4);
|
| /external/libvpx/libvpx/vp8/common/mips/dspr2/ |
| D | filter_dspr2.c | 329 unsigned int n1, n2, n3, n4; in vp8_filter_block2d_first_pass_8_all() local
469 [p4] "=&r" (p4), [n4] "=&r" (n4), in vp8_filter_block2d_first_pass_8_all()
547 [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4), in vp8_filter_block2d_first_pass_8_all()
594 [n3] "r" (n3), [n4] "r" (n4) in vp8_filter_block2d_first_pass_8_all()
629 unsigned int n1, n2, n3, n4; in vp8_filter_block2d_first_pass16_6tap() local
742 [p4] "=&r" (p4), [n4] "=&r" (n4), in vp8_filter_block2d_first_pass16_6tap()
800 [p4] "r" (p4), [n4] "r" (n4), [p1] "r" (p1), [src_ptr] "r" (src_ptr), in vp8_filter_block2d_first_pass16_6tap()
853 : [tn1] "=&r" (tn1), [p2] "=&r" (p2), [n2] "=&r" (n2), [n4] "=&r" (n4), in vp8_filter_block2d_first_pass16_6tap()
|
| /external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.align/ |
| D | p6.cpp | 12 extern int n4;
13 alignas(8) extern int n4;
|
| /external/llvm/test/Transforms/LoopVectorize/ |
| D | non-const-n.ll | 18 %n4 = shl i32 %n, 2
32 %exitcond = icmp eq i32 %lftr.wideiv, %n4
|
| /external/llvm/test/CodeGen/AArch64/ |
| D | global-merge-group-by-use.ll | 43 ; merging n3, m4, and n4 together, but ignoring m3.
61 @n4 = internal global i32 0, align 4
71 store i32 %a2, i32* @n4, align 4
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| D | Grego.java | 125 long n4 = floorDivide(rem[0], 1461, rem); in dayToFields() local
128 int year = (int)(400 * n400 + 100 * n100 + 4 * n4 + n1); in dayToFields()
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| D | Grego.java | 127 long n4 = floorDivide(rem[0], 1461, rem); in dayToFields() local
130 int year = (int)(400 * n400 + 100 * n100 + 4 * n4 + n1); in dayToFields()
|
| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| D | 2011-10-13-SCEVChain.ll | 50 %n4 = sub i32 0, %a4
51 %t4 = icmp ugt i32 %n4, -4
52 %m4 = select i1 %t4, i32 %n4, i32 -4
|
| /external/v8/test/mjsunit/ |
| D | json.js | 38 var n4 = new Date(10003); variable
39 n4.toISOString = function () {
41 assertEquals(this, n4);
44 assertEquals(null, n4.toJSON());
|
| /external/boringssl/src/crypto/ec/ |
| D | simple.c | 568 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; in ec_GFp_simple_add() local
597 n4 = BN_CTX_get(ctx); in ec_GFp_simple_add()
632 if (!BN_copy(n3, &b->X) || !BN_copy(n4, &b->Y)) { in ec_GFp_simple_add()
645 !field_mul(group, n4, &b->Y, n0, ctx)) { in ec_GFp_simple_add()
653 !BN_mod_sub_quick(n6, n2, n4, p)) { in ec_GFp_simple_add()
677 !BN_mod_add_quick(n2, n2, n4, p)) { in ec_GFp_simple_add()
709 !field_sqr(group, n4, n5, ctx) || in ec_GFp_simple_add()
710 !field_mul(group, n3, n1, n4, ctx) || in ec_GFp_simple_add()
725 !field_mul(group, n5, n4, n5, ctx)) { in ec_GFp_simple_add()
|
| /external/mesa3d/src/mesa/program/ |
| D | prog_noise.c | 484 float n0, n1, n2, n3, n4; /* Noise contributions from the five corners */ in _mesa_noise4() local
627 n4 = 0.0f; in _mesa_noise4()
630 n4 = in _mesa_noise4()
637 return 27.0f * (n0 + n1 + n2 + n3 + n4); /* TODO: The scale factor is preliminary! */ in _mesa_noise4()
|