/external/chromium_org/v8/src/compiler/ |
H A D | graph.h | 43 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { argument 44 Node* nodes[] = {n1, n2, n3, n4}; 47 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument 49 Node* nodes[] = {n1, n2, n3, n4, n5}; 52 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument 54 Node* nodes[] = {n1, n2, n3, n4, n5, n6};
|
H A D | graph-builder.h | 43 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { argument 44 Node* buffer[] = {n1, n2, n3, n4}; 48 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument 50 Node* buffer[] = {n1, n2, n3, n4, n5}; 54 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument 56 Node* nodes[] = {n1, n2, n3, n4, n5, n6};
|
/external/chromium_org/v8/test/cctest/compiler/ |
H A D | test-node-algorithm.cc | 60 Node* n4 = graph.NewNode(&dummy_operator, n2, n3); local 61 Node* n5 = graph.NewNode(&dummy_operator, n4, n2); 71 CHECK(n4->id() == node_visitor.nodes_[3]->id()); 80 Node* n4 = graph.NewNode(&dummy_operator, n2, n3); local 81 Node* n5 = graph.NewNode(&dummy_operator, n4, n2); 88 CHECK(n4->id() == node_visitor.nodes_[1]->id()); 99 Node* n4 = graph.NewNode(&dummy_operator, n2); local 103 Node* end_dependencies[4] = {n4, n5, n6, n7}; 112 CHECK(n4->id() == node_visitor.nodes_[1]->id()); 126 Node* n4 local 222 Node* n4 = graph.NewNode(&dummy_operator, n0); local 316 Node* n4 = graph.NewNode(&dummy_operator, n2); local [all...] |
H A D | test-node.cc | 203 Node* n4 = graph.NewNode(&dummy_operator); local 204 Node::Uses::iterator i3(n4->uses().begin()); 205 CHECK(i3 == n4->uses().end()); 207 n3->ReplaceInput(1, n4); 212 Node::Uses::iterator i5(n4->uses().begin()); 215 CHECK(i5 == n4->uses().end()); 221 CHECK_EQ(n4, *i6); 222 CHECK_EQ(n4, n3->InputAt(1)); 309 Node* n4 = graph.NewNode(&dummy_operator, n0, n1, n2); local 310 n3->AppendInput(graph.zone(), n4); [all...] |
/external/chromium_org/base/containers/ |
H A D | linked_list_unittest.cc | 112 Node n4(4); 118 list.Append(&n4); 142 EXPECT_EQ(&n4, list.tail()); 152 EXPECT_EQ(&n4, list.tail()); 160 n4.RemoveFromList(); 170 list.Append(&n4); 187 Node n4(4); 208 n4.InsertBefore(&n1); 210 EXPECT_EQ(&n4, list.head()); 224 Node n4( [all...] |
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkChecksum.h | 125 size_t n4 = size / (sizeof(uintptr_t) << 2); local 126 for (size_t i = 0; i < n4; ++i) {
|
/external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.align/ |
H A D | p6.cpp | 12 extern int n4; 13 alignas(8) extern int n4;
|
H A D | p5.cpp | 6 alignas(1) alignas(2) alignas(0) int n4; // expected-error {{less than minimum alignment}} variable
|
/external/skia/include/core/ |
H A D | SkChecksum.h | 105 size_t n4 = size / (sizeof(uintptr_t) << 2); local 106 for (size_t i = 0; i < n4; ++i) {
|
/external/libvorbis/lib/ |
H A D | mdct.c | 400 int n4=n>>2; local 405 DATA_TYPE *oX = out+n2+n4; 406 DATA_TYPE *T = init->trig+n4; 419 oX = out+n2+n4; 420 T = init->trig+n4; 438 DATA_TYPE *oX1=out+n2+n4; 439 DATA_TYPE *oX2=out+n2+n4; 463 iX=out+n2+n4; 464 oX1=out+n4; 479 iX=out+n2+n4; 496 int n4=n>>2; local [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/ |
H A D | TestDotTreeGenerator.cs | 72 + @" n4 [label=""""];" + newline 77 + @" n0 -> n4 // """" -> """"" + newline
|
/external/chromium_org/third_party/speex/libspeex/ |
H A D | lsp.c | 532 float *pw,*n1,*n2,*n3,*n4=NULL; local 565 n4 = n3 + 1; 567 xout2 = xin2 - 2.f*x_freq[i2+1] * *n3 + *n4; 569 *n4 = *n3; 575 xout1 = xin1 + *(n4+1); 576 xout2 = xin2 - *(n4+2); 579 *(n4+1) = xin1; 580 *(n4+2) = xin2;
|
/external/llvm/unittests/IR/ |
H A D | MetadataTest.cpp | 95 MDNode *n4 = MDNode::getIfExists(Context, V); local 104 EXPECT_EQ(n4, n1);
|
/external/speex/libspeex/ |
H A D | lsp.c | 532 float *pw,*n1,*n2,*n3,*n4=NULL; local 565 n4 = n3 + 1; 567 xout2 = xin2 - 2.f*x_freq[i2+1] * *n3 + *n4; 569 *n4 = *n3; 575 xout1 = xin1 + *(n4+1); 576 xout2 = xin2 - *(n4+2); 579 *(n4+1) = xin1; 580 *(n4+2) = xin2;
|
/external/srec/srec/cfront/ |
H A D | sp_fft.c | 272 unsigned m, n, n2, n4, i, j, ii, nt; local 290 n4 = n2 >> 2; 293 for (j = 0; j < n4; j++) 486 unsigned n, m, n4, i, j, k, ii, k0; local 508 n4 = n >> 1; 512 n4 >>= 1; 522 for (j = 0; j < n4; j++) 532 comp_L_butterfly1(j, n4, cc1, ss1, cc3, ss3, data + k0);
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/mips/dspr2/ |
H A D | filter_dspr2.c | 329 unsigned int n1, n2, n3, n4; local 461 "preceu.ph.qbl %[n4], %[tn1] \n\t" 464 "dpa.w.ph $ac2, %[n4], %[vector3b] \n\t" 469 [p4] "=&r" (p4), [n4] "=&r" (n4), 536 "preceu.ph.qbl %[n4], %[tn2] \n\t" 547 [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4), 576 "dpa.w.ph $ac3, %[n4], %[vector2b] \n\t" 583 "dpa.w.ph $ac2, %[n4], 629 unsigned int n1, n2, n3, n4; local [all...] |
/external/libvpx/libvpx/vp8/common/mips/dspr2/ |
H A D | filter_dspr2.c | 329 unsigned int n1, n2, n3, n4; local 461 "preceu.ph.qbl %[n4], %[tn1] \n\t" 464 "dpa.w.ph $ac2, %[n4], %[vector3b] \n\t" 469 [p4] "=&r" (p4), [n4] "=&r" (n4), 536 "preceu.ph.qbl %[n4], %[tn2] \n\t" 547 [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4), 576 "dpa.w.ph $ac3, %[n4], %[vector2b] \n\t" 583 "dpa.w.ph $ac2, %[n4], 629 unsigned int n1, n2, n3, n4; local [all...] |
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/mips/dspr2/ |
H A D | vp9_convolve8_avg_horiz_dspr2.c | 36 uint32_t n1, n2, n3, n4; local 91 "preceu.ph.qbl %[n4], %[tn2] \n\t" 95 "dpa.w.ph $ac3, %[n4], %[vector4b] \n\t" 109 "dpa.w.ph $ac2, %[n4], %[vector3b] \n\t" 130 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4),
|
H A D | vp9_convolve8_horiz_dspr2.c | 36 uint32_t n1, n2, n3, n4; local 88 "preceu.ph.qbl %[n4], %[tn2] \n\t" 92 "dpa.w.ph $ac3, %[n4], %[vector4b] \n\t" 102 "dpa.w.ph $ac2, %[n4], %[vector3b] \n\t" 119 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4),
|
/external/libvpx/libvpx/vp9/common/mips/dspr2/ |
H A D | vp9_convolve8_avg_horiz_dspr2.c | 36 uint32_t n1, n2, n3, n4; local 91 "preceu.ph.qbl %[n4], %[tn2] \n\t" 95 "dpa.w.ph $ac3, %[n4], %[vector4b] \n\t" 109 "dpa.w.ph $ac2, %[n4], %[vector3b] \n\t" 130 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4),
|
H A D | vp9_convolve8_horiz_dspr2.c | 36 uint32_t n1, n2, n3, n4; local 88 "preceu.ph.qbl %[n4], %[tn2] \n\t" 92 "dpa.w.ph $ac3, %[n4], %[vector4b] \n\t" 102 "dpa.w.ph $ac2, %[n4], %[vector3b] \n\t" 119 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4),
|
/external/chromium_org/v8/test/mjsunit/ |
H A D | json.js | 38 var n4 = new Date(10003); 39 n4.toISOString = function () { 41 assertEquals(this, n4); 44 assertEquals(null, n4.toJSON());
|
/external/qemu/slirp/ |
H A D | tcp_subr.c | 612 u_int n1, n2, n3, n4, n5, n6; local 970 &n1, &n2, &n3, &n4, &n5, &n6, buff); 974 laddr = htonl((n1 << 24) | (n2 << 16) | (n3 << 8) | (n4)); 990 n4 = (laddr & 0xff); 995 n1, n2, n3, n4, n5, n6, x==7?buff:""); 1002 &n1, &n2, &n3, &n4, &n5, &n6, buff); 1006 laddr = htonl((n1 << 24) | (n2 << 16) | (n3 << 8) | (n4)); 1022 n4 = (laddr & 0xff); 1027 n1, n2, n3, n4, n5, n6, x==7?buff:"");
|
/external/qemu/slirp-android/ |
H A D | tcp_subr.c | 767 u_int n1, n2, n3, n4, n5, n6; local 825 &n1, &n2, &n3, &n4, &n5, &n6, buff); 829 laddr = (n1 << 24) | (n2 << 16) | (n3 << 8) | (n4); 845 n4 = (laddr & 0xff); 850 n1, n2, n3, n4, n5, n6, x==7?buff:""); 857 &n1, &n2, &n3, &n4, &n5, &n6, buff); 861 laddr = (n1 << 24) | (n2 << 16) | (n3 << 8) | (n4); 877 n4 = (laddr & 0xff); 882 n1, n2, n3, n4, n5, n6, x==7?buff:"");
|
/external/openssl/crypto/bn/asm/ |
H A D | ia64-mont.pl | 365 n1=r24; n2=r25; n3=r26; n4=r27; n5=r28; n6=r29; n7=r30; n8=r31; 522 (p41) add a4=a4,n4 } // (p17) a4+=n4 523 { .mfi; (p43) add a4=a4,n4,1 531 (p41) cmp.ltu p42,p40=a4,n4 } 532 { .mfi; (p43) cmp.leu p42,p40=a4,n4 653 { .mfi; (p16) getf.sig n4=nlo[4] // 31: 684 (p41) add a4=a4,n4 // (p17) a4+=n4 685 (p43) add a4=a4,n4, [all...] |