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

1 2 3 4

  /external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.align/
p5.cpp 5 alignas(1) alignas(2) alignas(4) int n3; // ok variable
  /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/v8/test/cctest/compiler/
test-node.cc 123 Node* n3 = graph.NewNode(&dummy_operator, n2); local
128 USE(n3);
137 Node* n3 = graph.NewNode(&dummy_operator); local
142 n0->ReplaceUses(n3);
143 Node::Uses::iterator i2(n3->uses().begin());
148 CHECK_EQ(n3, *i3);
152 CHECK_EQ(n3, *i4);
162 Node* n3 = graph.NewNode(&dummy_operator); local
169 n1->ReplaceUses(n3);
173 Node::Uses::iterator i2(n3->uses().begin())
185 Node* n3 = graph.NewNode(&dummy_operator, n0, n1, n2); local
245 Node* n3 = graph.NewNode(&dummy_operator, n0); local
265 Node* n3 = graph.NewNode(&dummy_operator); local
292 Node* n3 = graph.NewNode(&dummy_operator, n0); local
304 Node* n3 = graph.NewNode(&dummy_operator, n0, n1, n2); local
379 Node* n3 = graph.NewNode(&dummy_operator); local
423 Node* n3 = graph.NewNode(&dummy_operator, n0); local
446 Node* n3 = graph.NewNode(&dummy_operator); local
482 Node* n3 = graph.NewNode(&dummy_operator); local
512 n1->ReplaceUsesIf(FixedPredicate<false>(), n3); local
550 Node* n3 = graph.NewNode(&dummy_operator, n0); local
    [all...]
test-node-algorithm.cc 59 Node* n3 = graph.NewNode(&dummy_operator, n2); local
60 Node* n4 = graph.NewNode(&dummy_operator, n2, n3);
70 CHECK(n3->id() == node_visitor.nodes_[2]->id());
79 Node* n3 = graph.NewNode(&dummy_operator, n2); local
80 Node* n4 = graph.NewNode(&dummy_operator, n2, n3);
91 CHECK(n3->id() == node_visitor.nodes_[4]->id());
98 Node* n3 = graph.NewNode(&dummy_operator, graph.start()); local
102 Node* n7 = graph.NewNode(&dummy_operator, n3);
117 CHECK(n3->id() == node_visitor.nodes_[6]->id());
125 Node* n3 = graph.NewNode(&dummy_operator, graph.start()) local
221 Node* n3 = graph.NewNode(&dummy_operator, n2); local
315 Node* n3 = graph.NewNode(&dummy_operator, graph.start()); local
    [all...]
test-graph-reducer.cc 219 Node* n3 = graph.NewNode(&OPA1, n1); local
220 Node* end = graph.NewNode(&OPA2, n2, n3);
229 recorder.CheckContains(n3);
262 Node* n3 = graph.NewNode(&OPA1, n1); local
263 Node* end = graph.NewNode(&OPA2, n2, n3);
278 CHECK_EQ(&OPB1, n3->op());
279 CHECK_EQ(n1, n3->InputAt(0));
282 CHECK_EQ(n3, end->InputAt(1));
292 Node* n3 = graph.NewNode(&OPA1, n1); local
293 Node* end = graph.NewNode(&OPA2, n2, n3);
402 Node* n3 = graph.NewNode(&OPA1, n1); local
457 Node* n3 = graph.NewNode(&OPA1, n1); local
492 Node* n3 = graph.NewNode(&OPA1, n1); local
    [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/clang/test/Modules/
macros2.c 77 int n3 = TOP_OTHER_DEF_RIGHT_UNDEF; // ok variable
macros.c 170 int n3 = TOP_OTHER_DEF_RIGHT_UNDEF; // ok variable
  /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);
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/aux_/preprocessed/gcc/
bind.hpp 200 typedef typename r2::next n3; typedef in struct:boost::mpl::bind2::apply
263 typedef typename r2::next n3; typedef in struct:boost::mpl::bind3::apply
266 typedef aux::replace_unnamed_arg< T3,n3 > r3;
331 typedef typename r2::next n3; typedef in struct:boost::mpl::bind4::apply
334 typedef aux::replace_unnamed_arg< T3,n3 > r3;
406 typedef typename r2::next n3; typedef in struct:boost::mpl::bind5::apply
409 typedef aux::replace_unnamed_arg< T3,n3 > r3;
494 typedef typename r2::next n3; typedef in struct:boost::mpl::bind3::apply
497 typedef aux::replace_unnamed_arg< T3,n3 > r3;
542 typedef typename r2::next n3; typedef in struct:boost::mpl::bind3::apply
    [all...]
  /cts/apps/CtsVerifier/src/com/android/cts/verifier/notifications/
NotificationListenerVerifierActivity.java 133 Notification n3 = new Notification.Builder(mContext) local
143 mNm.notify(mTag3, mId3, n3);
  /external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/provider/crypto/
SHA1PRNG_SecureRandomTest.java 162 int n3 = 100; local
173 for (int k = 0; k < n3; k++) {
  /external/compiler-rt/lib/sanitizer_common/tests/
sanitizer_deadlock_detector_test.cc 97 // Cycle: n1->n2->n3->n1
103 uptr n3 = d.newNode(3); local
111 EXPECT_FALSE(d.onLock(&dtls, n3));
112 d.onUnlock(&dtls, n3);
115 EXPECT_FALSE(d.onLock(&dtls, n3));
121 EXPECT_EQ(path[2], n3);
124 EXPECT_EQ(d.getData(n3), 3U);
126 d.onUnlock(&dtls, n3);
  /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...]
  /external/libvpx/libvpx/vp9/common/mips/dspr2/
vp9_convolve8_avg_horiz_dspr2.c 36 uint32_t n1, n2, n3, n4; local
90 "preceu.ph.qbr %[n3], %[tn2] \n\t"
94 "dpa.w.ph $ac3, %[n3], %[vector3b] \n\t"
108 "dpa.w.ph $ac2, %[n3], %[vector2b] \n\t"
130 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4),
    [all...]
vp9_convolve8_horiz_dspr2.c 36 uint32_t n1, n2, n3, n4; local
87 "preceu.ph.qbr %[n3], %[tn2] \n\t"
91 "dpa.w.ph $ac3, %[n3], %[vector3b] \n\t"
101 "dpa.w.ph $ac2, %[n3], %[vector2b] \n\t"
119 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4),
    [all...]
  /external/speex/libspeex/
lsp.c 532 float *pw,*n1,*n2,*n3,*n4=NULL; local
564 n3 = n2 + 1;
565 n4 = n3 + 1;
567 xout2 = xin2 - 2.f*x_freq[i2+1] * *n3 + *n4;
569 *n4 = *n3;
571 *n3 = xin2;
  /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...]
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/mips/dspr2/
vp9_convolve8_avg_horiz_dspr2.c 36 uint32_t n1, n2, n3, n4; local
90 "preceu.ph.qbr %[n3], %[tn2] \n\t"
94 "dpa.w.ph $ac3, %[n3], %[vector3b] \n\t"
108 "dpa.w.ph $ac2, %[n3], %[vector2b] \n\t"
130 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4),
    [all...]
vp9_convolve8_horiz_dspr2.c 36 uint32_t n1, n2, n3, n4; local
87 "preceu.ph.qbr %[n3], %[tn2] \n\t"
91 "dpa.w.ph $ac3, %[n3], %[vector3b] \n\t"
101 "dpa.w.ph $ac2, %[n3], %[vector2b] \n\t"
119 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4),
    [all...]
  /libcore/luni/src/test/java/org/apache/harmony/security/tests/provider/crypto/
SHA1PRNG_SecureRandomTest.java 154 int n3 = 100; local
165 for (int k = 0; k < n3; k++) {
  /external/javassist/src/test/test/javassist/convert/
ArrayAccessReplaceTest.java 409 Number n1, n2, n3, n4; local
422 n3 = ns[3];
426 n3.intValue();
  /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));
  /external/boringssl/src/crypto/ec/
simple.c 616 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; local
644 n3 = BN_CTX_get(ctx);
678 /* n3, n4 */
680 if (!BN_copy(n3, &b->X) || !BN_copy(n4, &b->Y)) {
683 /* n3 = X_b */
687 !field_mul(group, n3, &b->X, n0, ctx)) {
690 /* n3 = X_b * Z_a^2 */
700 if (!BN_mod_sub_quick(n5, n1, n3, p) ||
704 /* n5 = n1 - n3 */
724 if (!BN_mod_add_quick(n1, n1, n3, p) |
807 BIGNUM *n0, *n1, *n2, *n3; local
    [all...]

Completed in 693 milliseconds

1 2 3 4