| /external/opencv3/modules/photo/src/ |
| arrays.hpp | 134 int n1,n2,n3,n4; member in struct:cv::Array4d
140 steps[0] = n2*n3*n4;
141 steps[1] = n3*n4;
142 steps[2] = n4;
147 a(_a), n1(_n1), n2(_n2), n3(_n3), n4(_n4), needToDeallocArray(false)
153 n1(_n1), n2(_n2), n3(_n3), n4(_n4), needToDeallocArray(true)
155 a = new T[n1*n2*n3*n4];
167 Array3d<T> array3d(a + i*n2*n3*n4, n2, n3, n4);
173 return a + i1*n2*n3*n4 + i2*n3*n4 + i3*n4
[all...] |
| /art/test/963-default-range-smali/src/ |
| Iface.java | 20 String n4,
|
| /external/v8/src/compiler/ |
| graph.h | 57 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) {
58 Node* nodes[] = {n1, n2, n3, n4};
61 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
63 Node* nodes[] = {n1, n2, n3, n4, n5};
66 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
68 Node* nodes[] = {n1, n2, n3, n4, n5, n6};
71 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
73 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7};
76 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
78 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7, n8}
[all...] |
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/ |
| test_object_graph.py | 53 n4 = Node("n4")
65 self.assertFalse(n4 in graph)
67 self.assertFalse("n4" in graph)
72 self.assertTrue(graph.findNode(n4) is None)
75 self.assertTrue(graph.findNode("n4") is None)
79 self.assertEqual(graph.getRawIdent(n4), "n4")
84 self.assertEqual(graph.getIdent(n4), "n4")
[all...] |
| /external/v8/test/mjsunit/compiler/ |
| osr-infinite.js | 37 function n4() { function
75 test(n4);
|
| /external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.align/ |
| p6.cpp | 12 extern int n4;
13 alignas(8) extern int n4;
|
| p5.cpp | 6 alignas(1) alignas(2) alignas(0) int n4; // expected-error {{less than minimum alignment}} variable
|
| /prebuilts/go/darwin-x86/test/ |
| const4.go | 27 n4 = len(f())
62 if n1 != 10 || n2 != 20 || n3 != 30 || n4 != 40 || n5 != 50 || n6 != 60 || n7 != 70 {
63 println("BUG:", n1, n2, n3, n4, n5, n6, n7)
26 n4 = len(f()) var
|
| const5.go | 28 n4 = len(f()) // ERROR "is not a constant|is not constant"
26 n4 = len(f()) \/\/ ERROR "is not a constant|is not constant" const
|
| /prebuilts/go/linux-x86/test/ |
| const4.go | 27 n4 = len(f())
62 if n1 != 10 || n2 != 20 || n3 != 30 || n4 != 40 || n5 != 50 || n6 != 60 || n7 != 70 {
63 println("BUG:", n1, n2, n3, n4, n5, n6, n7)
26 n4 = len(f()) var
|
| const5.go | 28 n4 = len(f()) // ERROR "is not a constant|is not constant"
26 n4 = len(f()) \/\/ ERROR "is not a constant|is not constant" const
|
| /external/libvorbis/lib/ |
| 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/v8/test/unittests/compiler/ |
| node-unittest.cc | 175 Node* n4 = Node::New(zone(), 4, &kOp0, 0, nullptr, false); local
208 node->AppendInput(zone(), n4); local
210 EXPECT_THAT(node->inputs(), ElementsAre(n1, n3, n4));
214 EXPECT_THAT(node->inputs(), ElementsAre(n1, n3, n4, n5));
218 EXPECT_THAT(node->inputs(), ElementsAre(n1, n3, n4, n5, n6));
222 EXPECT_THAT(node->inputs(), ElementsAre(n1, n3, n4, n5, n6, n7));
225 EXPECT_THAT(node->inputs(), ElementsAre(n1, n3, n4, n5));
229 EXPECT_THAT(node->inputs(), ElementsAre(n1, n3, n4, n5, n8));
233 EXPECT_THAT(node->inputs(), ElementsAre(n1, n3, n4, n5, n8, n9));
|
| /external/libvpx/libvpx/vpx_dsp/mips/ |
| idct32x32_msa.c | 15 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; local
19 LD_SH8((input + 8), 32, m4, n4, m5, n5, m6, n6, m7, n7);
22 TRANSPOSE8x8_SH_SH(m4, n4, m5, n5, m6, n6, m7, n7,
23 m4, n4, m5, n5, m6, n6, m7, n7);
25 ST_SH4(m4, n4, m5, n5, (tmp_buf + 8 * 8), 8);
30 LD_SH8((input + 24), 32, m4, n4, m5, n5, m6, n6, m7, n7);
33 TRANSPOSE8x8_SH_SH(m4, n4, m5, n5, m6, n6, m7, n7,
34 m4, n4, m5, n5, m6, n6, m7, n7);
37 ST_SH4(m4, n4, m5, n5, (tmp_buf + 24 * 8), 8);
248 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7 local
548 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; local
[all...] |
| /external/gemmlowp/test/ |
| test_fixedpoint.cc | 158 size_t n4 = n - (n % 4); local
159 std::vector<int32_t> results_int32(n4);
160 std::vector<int32_t> results_int32x4(n4);
162 for (size_t i = 0; i < n4; i++) {
166 for (size_t i = 0; i < n4; i++) {
173 for (size_t i = 0; i < n4; i++) {
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/cris/ |
| cris.exp | 163 $line junk leftpart n1 n2 n3 n4 rightpart
164 # verbose "IM $n1 $n2 $n3 $n4 ($imcode1 $imcode2 $imcode3 $imcode01 $imcode02 $imcode03)"
168 set n4 [expr 0x$n4 - $imcode02 ]
171 + ($n3 << 4) + ($imcode3 << 4) + $n4 + $imcode2 ]
177 $line junk leftpart n1 n2 n3 n4 rightpart
178 # verbose "IR $n1 $n2 $n3 $n4 ($ircode1 $ircode2 $ircode3 $ircode01 $ircode02 $ircode03)"
182 set n4 [expr 0x$n4 - $ircode02 ]
185 + ($n3 << 4) + ($ircode3 << 4) + $n4 + $ircode2
[all...] |
| /prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/gc/ |
| cplx.go | 140 var n4 Node
145 subnode(&n3, &n4, nr)
158 ra.Right = &n4
171 var n4 Node
177 subnode(&n3, &n4, nr)
192 rm2.Right = &n4
207 rm1.Right = &n4
320 var n4 Node
322 subnode(&n3, &n4, t)
325 Cgen(&n2, &n4)
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/ |
| cplx.go | 137 var n4 Node
142 subnode(&n3, &n4, nr)
155 ra.Right = &n4
168 var n4 Node
174 subnode(&n3, &n4, nr)
189 rm2.Right = &n4
204 rm1.Right = &n4
317 var n4 Node
319 subnode(&n3, &n4, t)
322 Cgen(&n2, &n4)
[all...] |
| /prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/compile/internal/gc/ |
| cplx.go | 140 var n4 Node
145 subnode(&n3, &n4, nr)
158 ra.Right = &n4
171 var n4 Node
177 subnode(&n3, &n4, nr)
192 rm2.Right = &n4
207 rm1.Right = &n4
320 var n4 Node
322 subnode(&n3, &n4, t)
325 Cgen(&n2, &n4)
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/ |
| cplx.go | 137 var n4 Node
142 subnode(&n3, &n4, nr)
155 ra.Right = &n4
168 var n4 Node
174 subnode(&n3, &n4, nr)
189 rm2.Right = &n4
204 rm1.Right = &n4
317 var n4 Node
319 subnode(&n3, &n4, t)
322 Cgen(&n2, &n4)
[all...] |
| /external/v8/test/cctest/compiler/ |
| test-node.cc | 199 Node* n4 = graph.NewNode(&dummy_operator0); local
205 CHECK_USES(n4, NONE);
209 n3->ReplaceInput(1, n4);
212 CHECK_USES(n4, n3);
214 CHECK_INPUTS(n3, n0, n4, n2);
301 Node* n4 = graph.NewNode(&dummy_operator3, n0, n1, n2); local
302 n3->AppendInput(graph.zone(), n4);
304 CHECK_INPUTS(n3, n0, n1, n2, n4);
305 CHECK_USES(n4, n3);
307 n3->AppendInput(graph.zone(), n4);
[all...] |
| graph-builder-tester.h | 208 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) {
209 Node* buffer[] = {n1, n2, n3, n4};
213 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
215 Node* buffer[] = {n1, n2, n3, n4, n5};
219 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
221 Node* nodes[] = {n1, n2, n3, n4, n5, n6};
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| Grego.java | 127 long n4 = floorDivide(rem[0], 1461, rem); local
130 int year = (int)(400 * n400 + 100 * n100 + 4 * n4 + n1);
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| Grego.java | 125 long n4 = floorDivide(rem[0], 1461, rem); local
128 int year = (int)(400 * n400 + 100 * n100 + 4 * n4 + n1);
|
| /external/speex/libspeex/ |
| 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;
|
