/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/ |
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
|
/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 | 80 int n3 = TOP_OTHER_DEF_RIGHT_UNDEF; // ok variable
|
macros.c | 197 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);
|
/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...] |
/external/v8/test/cctest/compiler/ |
test-graph-visualizer.cc | 110 Node* n3 = graph.NewNode(&dummy_operator1, graph.start()); local 113 Node* n6 = graph.NewNode(&dummy_operator1, n3); 114 Node* n7 = graph.NewNode(&dummy_operator1, n3);
|
test-node.cc | 150 Node* n3 = graph.NewNode(&dummy_operator0); local 157 n0->ReplaceUses(n3); 162 CHECK_USES(n3, n1, n2); 164 CHECK_INPUTS(n1, n3); 165 CHECK_INPUTS(n2, n3); 201 Node* n3 = graph.NewNode(&dummy_operator3, n0, n1, n2); local 204 CHECK_USES(n0, n3); 205 CHECK_USES(n1, n3); 206 CHECK_USES(n2, n3); 207 CHECK_USES(n3, NONE) 237 Node* n3 = graph.NewNode(&dummy_operator1, n0); local 257 Node* n3 = graph.NewNode(&dummy_operator0); local 288 Node* n3 = graph.NewNode(&dummy_operator1, n0); local 303 Node* n3 = graph.NewNode(&dummy_operator3, n0, n1, n2); local 369 Node* n3 = graph.NewNode(&dummy_operator0); local 414 Node* n3 = graph.NewNode(&dummy_operator1, n0); local 438 Node* n3 = graph.NewNode(&dummy_operator0); local 471 Node* n3 = graph.NewNode(&dummy_operator1, n0); local [all...] |
/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...] |
/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/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...] |
/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/vpx_dsp/mips/ |
convolve8_avg_horiz_dspr2.c | 34 uint32_t n1, n2, n3, n4; local 88 "preceu.ph.qbr %[n3], %[tn2] \n\t" 92 "dpa.w.ph $ac3, %[n3], %[vector3b] \n\t" 106 "dpa.w.ph $ac2, %[n3], %[vector2b] \n\t" 128 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4), [all...] |
convolve8_horiz_dspr2.c | 34 uint32_t n1, n2, n3, n4; local 85 "preceu.ph.qbr %[n3], %[tn2] \n\t" 89 "dpa.w.ph $ac3, %[n3], %[vector3b] \n\t" 99 "dpa.w.ph $ac2, %[n3], %[vector2b] \n\t" 117 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4), [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/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/harmony-tests/src/test/java/org/apache/harmony/tests/javax/security/ |
OldSHA1PRNGSecureRandomTest.java | 150 int n3 = 100; local 161 for (int k = 0; k < n3; k++) {
|