/external/opencv3/modules/photo/src/ |
H A D | arrays.hpp | 98 int n1,n2,n3; member in struct:cv::Array3d 102 a(_a), n1(_n1), n2(_n2), n3(_n3), needToDeallocArray(false) 107 n1(_n1), n2(_n2), n3(_n3), needToDeallocArray(true) 109 a = new T[n1*n2*n3]; 120 Array2d<T> array2d(a + i*n2*n3, n2, n3); 126 return a + i1*n2*n3 + i2*n3; 134 int n1,n2,n3,n4; member in struct:cv::Array4d 140 steps[0] = n2*n3*n [all...] |
/external/v8/test/mjsunit/compiler/ |
H A D | osr-infinite.js | 33 function n3() { function 74 test(n3);
|
/external/v8/src/compiler/ |
H A D | graph.h | 53 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { argument 54 Node* nodes[] = {n1, n2, n3}; 57 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { argument 58 Node* nodes[] = {n1, n2, n3, n4}; 61 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument 63 Node* nodes[] = {n1, n2, n3, n4, n5}; 66 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument 68 Node* nodes[] = {n1, n2, n3, n4, n5, n6}; 71 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument 73 Node* nodes[] = {n1, n2, n3, n 76 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8) argument 81 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8, Node* n9) argument [all...] |
H A D | ast-graph-builder.h | 184 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { argument 185 Node* buffer[] = {n1, n2, n3}; 189 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { argument 190 Node* buffer[] = {n1, n2, n3, n4}; 194 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument 196 Node* buffer[] = {n1, n2, n3, n4, n5}; 200 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument 202 Node* nodes[] = {n1, n2, n3, n4, n5, n6};
|
H A D | bytecode-graph-builder.h | 81 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { argument 82 Node* buffer[] = {n1, n2, n3}; 86 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { argument 87 Node* buffer[] = {n1, n2, n3, n4};
|
/external/v8/test/cctest/compiler/ |
H A D | test-node.cc | 149 Node* n3 = graph.NewNode(&dummy_operator0); local 156 n0->ReplaceUses(n3); 161 CHECK_USES(n3, n1, n2); 163 CHECK_INPUTS(n1, n3); 164 CHECK_INPUTS(n2, n3); 198 Node* n3 = graph.NewNode(&dummy_operator3, n0, n1, n2); local 201 CHECK_USES(n0, n3); 202 CHECK_USES(n1, n3); 203 CHECK_USES(n2, n3); 204 CHECK_USES(n3, NON 233 Node* n3 = graph.NewNode(&dummy_operator1, n0); local 253 Node* n3 = graph.NewNode(&dummy_operator0); local 283 Node* n3 = graph.NewNode(&dummy_operator1, n0); local 297 Node* n3 = graph.NewNode(&dummy_operator3, n0, n1, n2); local 361 Node* n3 = graph.NewNode(&dummy_operator0); local 404 Node* n3 = graph.NewNode(&dummy_operator1, n0); local 427 Node* n3 = graph.NewNode(&dummy_operator0); local 459 Node* n3 = graph.NewNode(&dummy_operator1, n0); local [all...] |
H A D | graph-builder-tester.h | 203 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { argument 204 Node* buffer[] = {n1, n2, n3}; 208 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { argument 209 Node* buffer[] = {n1, n2, n3, n4}; 213 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument 215 Node* buffer[] = {n1, n2, n3, n4, n5}; 219 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument 221 Node* nodes[] = {n1, n2, n3, n4, n5, n6};
|
/external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/ |
H A D | test_object_graph.py | 52 n3 = Node("n3") 62 graph.addNode(n3) 87 self.assertTrue(n3 in graph) 88 graph.removeNode(n3) 89 self.assertTrue(n3 not in graph) 90 graph.addNode(n3) 91 self.assertTrue(n3 in graph) 112 n3 = graph.createNode(ArgNode, "n3", [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/ |
H A D | TestDotTreeGenerator.cs | 71 + @" n3 [label=""x""];" + newline 76 + @" n1 -> n3 // ""*"" -> ""x""" + newline
|
/external/libunwind/tests/ |
H A D | Gia64-test-stack.c | 58 unw_word_t ip, sp, bsp, v0, v1, v2, v3, n0, n1, n2, n3, cfm, sof, sol, r32; local 83 n0 = n1 = n2 = n3 = 0; 92 || (ret = unw_get_reg (&c, UNW_IA64_NAT + reg + 3, &n3)) < 0); 99 n2 ? '*' : ' ', v2, n3 ? '*' : ' ', v3);
|
/external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.align/ |
H A D | p6.cpp | 9 alignas(8) extern int n3; // expected-note {{previous declaration}} 10 alignas(4) extern int n3; // expected-error {{different alignment requirement (4 vs 8)}}
|
H A D | p5.cpp | 5 alignas(1) alignas(2) alignas(4) int n3; // ok variable
|
/external/v8/test/unittests/compiler/ |
H A D | node-unittest.cc | 174 Node* n3 = Node::New(zone(), 3, &kOp0, 0, nullptr, false); local 204 node->AppendInput(zone(), n3); local 206 EXPECT_THAT(node->inputs(), ElementsAre(n1, n3)); 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, n [all...] |
H A D | graph-reducer-unittest.cc | 509 Node* n3 = graph()->NewNode(&kOpA1, n1); local 510 Node* end = graph()->NewNode(&kOpA2, n2, n3); 515 EXPECT_CALL(r1, Reduce(n3)).InSequence(s2); 542 Node* n3 = graph()->NewNode(&kOpA1, n1); local 543 Node* end = graph()->NewNode(&kOpA2, n2, n3); 555 EXPECT_EQ(&kOpB1, n3->op()); 556 EXPECT_EQ(n1, n3->InputAt(0)); 559 EXPECT_EQ(n3, end->InputAt(1)); 567 Node* n3 = graph()->NewNode(&kOpA1, n1); local 568 Node* end = graph()->NewNode(&kOpA2, n2, n3); 660 Node* n3 = graph()->NewNode(&kOpA1, n1); local 707 Node* n3 = graph()->NewNode(&kOpA1, n1); local 736 Node* n3 = graph()->NewNode(&kOpA1, n1); local [all...] |
/external/libvpx/libvpx/vp8/common/mips/dspr2/ |
H A D | filter_dspr2.c | 133 unsigned int n1, n2, n3; local 197 "preceu.ph.qbr %[n3], %[tn2] \n\t" 201 "dpa.w.ph $ac3, %[n3], %[vector3b] \n\t" 208 "dpa.w.ph $ac2, %[n3], %[vector2b] \n\t" 227 [n3] "=&r" (n3), [Temp1] "=&r" (Temp1), [Temp2] "=&r" (Temp2), 273 "preceu.ph.qbr %[n3], %[tn1] \n\t" 282 "dpa.w.ph $ac2, %[n3], %[vector2b] \n\t" 297 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), 329 unsigned int n1, n2, n3, n4; local 629 unsigned int n1, n2, n3, n4; local 961 unsigned int n1, n2, n3; local [all...] |
/external/llvm/lib/ProfileData/ |
H A D | SampleProfReader.cpp | 114 size_t n3 = Rest.find(' '); local 115 if (n3 == StringRef::npos) { 119 if (Rest.substr(0, n3).getAsInteger(10, NumSamples)) 122 while (n3 != StringRef::npos) { 123 n3 += Rest.substr(n3).find_first_not_of(' '); 124 Rest = Rest.substr(n3); 125 n3 = Rest.find(' '); 127 if (n3 != StringRef::npos) { 128 pair = Rest.substr(0, n3); 138 size_t n3 = Rest.find_last_of(':'); local [all...] |
/external/libvpx/libvpx/vpx_dsp/mips/ |
H A D | idct32x32_msa.c | 15 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; local 18 LD_SH8(input, 32, m0, n0, m1, n1, m2, n2, m3, n3); 20 TRANSPOSE8x8_SH_SH(m0, n0, m1, n1, m2, n2, m3, n3, 21 m0, n0, m1, n1, m2, n2, m3, n3); 24 ST_SH8(m0, n0, m1, n1, m2, n2, m3, n3, (tmp_buf), 8); 29 LD_SH8((input + 16), 32, m0, n0, m1, n1, m2, n2, m3, n3); 31 TRANSPOSE8x8_SH_SH(m0, n0, m1, n1, m2, n2, m3, n3, 32 m0, n0, m1, n1, m2, n2, m3, n3); 36 ST_SH4(m2, n2, m3, n3, (tmp_buf + 20 * 8), 8); 248 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n local 548 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; local [all...] |
/external/libchrome/base/third_party/nspr/ |
H A D | prtime.cc | 905 int n1, n2, n3; local 944 n3 = (*s++ - '0'); 946 n3 = n3*10 + (*s++ - '0'); 950 n3 = n3*10 + (*s++ - '0'); 953 n3 = n3*10 + (*s++ - '0'); 955 n3 = n3*1 [all...] |
/external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/ |
H A D | p3-0x.cpp | 45 int n3 = g(i); // expected-error{{no matching function for call to 'g'}} member in namespace:std_example
|
/external/clang/test/Modules/ |
H A D | macros2.c | 80 int n3 = TOP_OTHER_DEF_RIGHT_UNDEF; // ok variable
|
/external/boringssl/src/crypto/ec/ |
H A D | simple.c | 568 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; local 596 n3 = BN_CTX_get(ctx); 630 /* n3, n4 */ 632 if (!BN_copy(n3, &b->X) || !BN_copy(n4, &b->Y)) { 635 /* n3 = X_b */ 639 !field_mul(group, n3, &b->X, n0, ctx)) { 642 /* n3 = X_b * Z_a^2 */ 652 if (!BN_mod_sub_quick(n5, n1, n3, p) || 656 /* n5 = n1 - n3 */ 676 if (!BN_mod_add_quick(n1, n1, n3, 759 BIGNUM *n0, *n1, *n2, *n3; local [all...] |
/external/clang/test/CXX/expr/expr.const/ |
H A D | p2-0x.cpp | 232 constexpr int n3 = n1 + 1; // ok member in namespace:UndefinedBehavior::Overflow 233 constexpr int n4 = n3 + 1; // expected-error {{constant expression}} expected-note {{value 2147483648 is outside the range of }} 236 constexpr int n7 = -n3 + -1; // ok 238 constexpr int n9 = n3 - 0; // ok 239 constexpr int n10 = n3 - -1; // expected-error {{constant expression}} expected-note {{value 2147483648 is outside the range of }} 240 constexpr int n11 = -1 - n3; // ok 241 constexpr int n12 = -2 - n3; // expected-error {{constant expression}} expected-note {{value -2147483649 is outside the range of }} 243 constexpr int n14 = n3 - n5; // expected-error {{constant expression}} expected-note {{value 4294967295 is outside the range of }}
|
/external/mesa3d/src/mesa/program/ |
H A D | prog_noise.c | 327 float n0, n1, n2, n3; /* Noise contributions from the four corners */ local 461 n3 = 0.0f; 464 n3 = 472 return 32.0f * (n0 + n1 + n2 + n3); /* TODO: The scale factor is preliminary! */ 484 float n0, n1, n2, n3, n4; /* Noise contributions from the five corners */ local 616 n3 = 0.0f; 619 n3 = 637 return 27.0f * (n0 + n1 + n2 + n3 + n4); /* TODO: The scale factor is preliminary! */
|
/external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
H A D | InsnFormat.java | 543 * @param n3 {@code 0..15;} high nibble 546 protected static short codeUnit(int n0, int n1, int n2, int n3) { argument 559 if ((n3 & 0xf) != n3) { 560 throw new IllegalArgumentException("n3 out of range 0..15"); 563 return (short) (n0 | (n1 << 4) | (n2 << 8) | (n3 << 12));
|
/external/opencv3/modules/shape/src/ |
H A D | emdL1_def.hpp | 104 bool initBaseTrees(int n1=0, int n2=0, int n3=0);
|