Home
last modified time | relevance | path

Searched refs:n4 (Results 1 – 25 of 86) sorted by relevance

1234

/external/v8/src/compiler/
Dgraph.h76 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { in NewNode() argument
77 Node* nodes[] = {n1, n2, n3, n4}; in NewNode()
80 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() argument
82 Node* nodes[] = {n1, n2, n3, n4, n5}; in NewNode()
85 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() argument
87 Node* nodes[] = {n1, n2, n3, n4, n5, n6}; in NewNode()
90 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() argument
92 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7}; in NewNode()
95 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() argument
97 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7, n8}; in NewNode()
[all …]
Dast-graph-builder.h195 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { in NewNode() argument
196 Node* buffer[] = {n1, n2, n3, n4}; in NewNode()
200 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() argument
202 Node* buffer[] = {n1, n2, n3, n4, n5}; in NewNode()
206 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() argument
208 Node* nodes[] = {n1, n2, n3, n4, n5, n6}; in NewNode()
/external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/
Dtest_object_graph.py53 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/
Dmdct.c400 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/
Didct32x32_msa.c15 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 …]
Dconvolve8_horiz_dspr2.c34 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()
Dconvolve8_avg_horiz_dspr2.c34 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()
/external/v8/test/unittests/compiler/
Dnode-unittest.cc175 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/
Dtest_fixedpoint.cc158 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/mjsunit/compiler/
Dosr-infinite.js37 function n4() { function
75 test(n4);
/external/speex/libspeex/
Dlsp.c532 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/cctest/compiler/
Dtest-node.cc202 Node* n4 = graph.NewNode(&dummy_operator0); in TEST() local
208 CHECK_USES(n4, NONE); in TEST()
212 n3->ReplaceInput(1, n4); in TEST()
215 CHECK_USES(n4, n3); in TEST()
217 CHECK_INPUTS(n3, n0, n4, n2); in TEST()
307 Node* n4 = graph.NewNode(&dummy_operator3, n0, n1, n2); in TEST() local
308 n3->AppendInput(graph.zone(), n4); in TEST()
310 CHECK_INPUTS(n3, n0, n1, n2, n4); in TEST()
311 CHECK_USES(n4, n3); in TEST()
313 n3->AppendInput(graph.zone(), n4); in TEST()
[all …]
Dgraph-builder-tester.h208 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()
Dtest-graph-visualizer.cc111 Node* n4 = graph.NewNode(&dummy_operator1, n2); in TEST() local
119 Node* end_dependencies[6] = {n4, n8, n10, n11, n6, n7}; in TEST()
/external/libvpx/libvpx/vp8/common/mips/dspr2/
Dfilter_dspr2.c329 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/
Dp6.cpp12 extern int n4;
13 alignas(8) extern int n4;
/external/jmonkeyengine/engine/src/core-effects/Common/MatDefs/Post/
DCartoonEdge.frag35 vec4 n4 = fetchNormalDepth(texCoord + vec2( 1.0, -1.0) * edgeOffset);
38 vec4 diagonalDelta = abs(n1 - n2) + abs(n3 - n4);
DCartoonEdge15.frag37 vec4 n4 = fetchNormalDepth(texCoord + vec2( 1.0, -1.0) * edgeOffset);
40 vec4 diagonalDelta = abs(n1 - n2) + abs(n3 - n4);
/external/llvm/test/Transforms/LoopVectorize/
Dnon-const-n.ll18 %n4 = shl i32 %n, 2
32 %exitcond = icmp eq i32 %lftr.wideiv, %n4
/external/llvm/test/CodeGen/AArch64/
Dglobal-merge-group-by-use.ll43 ; 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/android_icu4j/src/main/java/android/icu/impl/
DGrego.java127 long n4 = floorDivide(rem[0], 1461, rem); in dayToFields() local
130 int year = (int)(400 * n400 + 100 * n100 + 4 * n4 + n1); in dayToFields()
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
DGrego.java125 long n4 = floorDivide(rem[0], 1461, rem); in dayToFields() local
128 int year = (int)(400 * n400 + 100 * n100 + 4 * n4 + n1); in dayToFields()
/external/llvm/test/Transforms/LoopStrengthReduce/
D2011-10-13-SCEVChain.ll50 %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/
Djson.js38 var n4 = new Date(10003); variable
39 n4.toISOString = function () {
41 assertEquals(this, n4);
44 assertEquals(null, n4.toJSON());
/external/boringssl/src/crypto/ec/
Dsimple.c568 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()

1234