HomeSort by relevance Sort by last modified time
    Searched refs:n3 (Results 1 - 25 of 218) sorted by null

1 2 3 4 5 6 7 8 9

  /external/opencv3/modules/photo/src/
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*n4
    [all...]
  /art/test/963-default-range-smali/src/
Iface.java 19 String n3,
  /external/v8/src/compiler/
graph.h 53 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) {
54 Node* nodes[] = {n1, n2, n3};
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}
    [all...]
  /external/v8/test/cctest/compiler/
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, NONE)
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...]
graph-builder-tester.h 203 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) {
204 Node* buffer[] = {n1, n2, n3};
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/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/
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", 1
    [all...]
  /ndk/tests/device/test-gnustl-full/unit/
mismatch_test.cpp 42 int n3[5] = { 1, 2, 3, 2, 1 }; local
47 result = mismatch((int*)n1, (int*)n1 + 5, (int*)n3);
48 CPPUNIT_ASSERT(!(result.first ==(n1 + 5) && result.second ==(n3 + 5)));
  /ndk/tests/device/test-stlport/unit/
mismatch_test.cpp 42 int n3[5] = { 1, 2, 3, 2, 1 }; local
47 result = mismatch((int*)n1, (int*)n1 + 5, (int*)n3);
48 CPPUNIT_ASSERT(!(result.first ==(n1 + 5) && result.second ==(n3 + 5)));
  /external/libunwind/tests/
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/v8/test/mjsunit/compiler/
osr-infinite.js 33 function n3() { function
74 test(n3);
  /external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.align/
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)}}
  /external/v8/test/unittests/compiler/
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, n4, n5, n8, n9))
    [all...]
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/
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...]
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/common/mips/dspr2/
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/
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/
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, 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/libchrome/base/third_party/nspr/
prtime.cc 905 int n1, n2, n3; local
    [all...]
  /bionic/tests/
search_test.cpp 83 node n3("m");
88 ASSERT_EQ(nullptr, tfind(&n3, &root, node_cmp));
97 ASSERT_EQ(nullptr, tfind(&n3, &root, node_cmp));
101 ASSERT_NE(nullptr, tsearch(&n3, &root, node_cmp));
  /external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/
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/
macros2.c 80 int n3 = TOP_OTHER_DEF_RIGHT_UNDEF; // ok variable
  /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)"
167 set n3 [expr 0x$n3 - $imcode03 ]
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)"
181 set n3 [expr 0x$n3 - $ircode03 ]
185 + ($n3 << 4) + ($ircode3 << 4) + $n4 + $ircode2
    [all...]
  /development/perftests/panorama/feature_stab/db_vlvm/
db_utilities_poly.h 302 double C[16],n0,n1,n2,n3,m; local
354 n3=db_sqr(C[12])+db_sqr(C[13])+db_sqr(C[14])+db_sqr(C[15]);
358 if(n0>=n1 && n0>=n2 && n0>=n3)
363 else if(n1>=n2 && n1>=n3)
368 else if(n2>=n3)
375 m=db_SafeReciprocal(sqrt(n3));
  /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/
db_utilities_poly.h 302 double C[16],n0,n1,n2,n3,m; local
354 n3=db_sqr(C[12])+db_sqr(C[13])+db_sqr(C[14])+db_sqr(C[15]);
358 if(n0>=n1 && n0>=n2 && n0>=n3)
363 else if(n1>=n2 && n1>=n3)
368 else if(n2>=n3)
375 m=db_SafeReciprocal(sqrt(n3));
  /external/boringssl/src/crypto/ec/
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, p) |
759 BIGNUM *n0, *n1, *n2, *n3; local
    [all...]

Completed in 3620 milliseconds

1 2 3 4 5 6 7 8 9