Searched refs:n1 (Results 176 - 200 of 311) sorted by relevance

1234567891011>>

/external/javassist/src/test/test/javassist/convert/
H A DArrayAccessReplaceTest.java409 Number n1, n2, n3, n4;
420 n1 = ns[1];
430 return n1;
/external/opencv/ml/src/
H A Dmltree.cpp1479 int n1 = node->get_num_valid(vi); local
1481 assert( 0 <= split_point && split_point < n1-1 );
1487 for( ; i < n1; i++ )
1493 R = n1 - split_point + 1;
1509 for( ; i < n1; i++ )
1572 int n1 = node->get_num_valid(vi); local
1589 for( i = n1; i < n; i++ )
1594 int L = 0, R = n1;
1599 for( i = 0; i < n1 - 1; i++ )
1630 for( i = 0; i < n1
2053 int n1 = node->get_num_valid(vi); local
2472 int n1 = node->get_num_valid(vi); local
2554 int n1 = node->get_num_valid(vi); local
2601 int n1 = node->get_num_valid(vi), nr1 = 0; local
[all...]
/external/chromium_org/components/bookmarks/browser/
H A Dbookmark_utils.cc68 bool MoreRecentlyModified(const BookmarkNode* n1, const BookmarkNode* n2) { argument
69 return n1->date_folder_modified() > n2->date_folder_modified();
298 bool MoreRecentlyAdded(const BookmarkNode* n1, const BookmarkNode* n2) { argument
299 return n1->date_added() > n2->date_added();
/external/chromium_org/third_party/icu/source/test/intltest/
H A Dsvccoll.cpp345 int32_t n1, n2, n3; local
395 n1 = checkAvailable("before registerFactory");
400 assertTrue("count after > count before", n2 > n1);
464 assertTrue("count after unregister == count before register", n3 == n1);
/external/clang/test/CXX/expr/expr.const/
H A Dp2-0x.cpp14 int n1[this->this1]; // expected-warning {{variable length array}} local
16 (void)n1, (void)n2;
230 constexpr int n1 = 2 * 3 * 3 * 7 * 11 * 31 * 151 * 331; // ok member in namespace:UndefinedBehavior::Overflow
232 constexpr int n3 = n1 + 1; // ok
/external/eigen/unsupported/Eigen/src/FFT/
H A Dei_kissfft_impl.h283 void fwd2( Complex * dst,const Complex *src,int n0,int n1) argument
288 EIGEN_UNUSED_VARIABLE(n1);
292 void inv2( Complex * dst,const Complex *src,int n0,int n1) argument
297 EIGEN_UNUSED_VARIABLE(n1);
/external/icu/icu4c/source/test/intltest/
H A Dsvccoll.cpp345 int32_t n1, n2, n3; local
395 n1 = checkAvailable("before registerFactory");
400 assertTrue("count after > count before", n2 > n1);
466 assertTrue("count after unregister == count before register", n3 == n1);
/external/iptables/iptables/
H A Diptables-apply151 read -n1 -t "${TIMEOUT:-15}" ret 2>&1 || :
/external/srec/srec/cfront/
H A Dsp_fft.c643 unsigned i, ii, n1; local
759 n1 = n >> 1;
760 for (i = 1; i < n1; i++)
772 data[n1] = last; /* now the Nyquist freq can be put in place */
/external/libcxx/test/strings/basic.string/string.ops/string_compare/
H A Dsize_size_pointer.pass.cpp12 // int compare(size_type pos, size_type n1, const charT *s) const;
31 test(const S& s, typename S::size_type pos1, typename S::size_type n1, argument
36 assert(sign(s.compare(pos1, n1, str)) == sign(x));
/external/openssl/crypto/objects/
H A Do_names.c308 const OBJ_NAME * const *n1=n1_; local
311 return strcmp((*n1)->name,(*n2)->name);
/external/pixman/test/
H A Dutils.c657 int i, n1 = 1, n2 = 0; local
663 n1 = atoi (argv[1]);
665 if (n2 < n1)
680 n1 = 1;
686 shared(n1, n2, test_function, verbose)
688 for (i = n1; i <= n2; i++)
696 if (n1 == 1 && n2 == default_number_of_iterations)
712 printf ("%d-%d: checksum=%08X\n", n1, n2, checksum);
/external/valgrind/main/coregrind/m_debuginfo/
H A Dimage.c288 ULong n1, ULong n2, ULong n3 )
295 write_ULong_le(&f->data[4 + 0*8], n1);
314 static Bool parse_Frame_le64 ( Frame* fr, const HChar* tag, /*OUT*/ULong* n1 )
321 *n1 = read_ULong_le(&fr->data[4 + 0*8]);
326 /*OUT*/ULong* n1, /*OUT*/ULong* n2 )
333 *n1 = read_ULong_le(&fr->data[4 + 0*8]);
366 /*OUT*/ULong* n1, /*OUT*/ULong* n2, /*OUT*/ULong* n3,
375 *n1 = read_ULong_le(&fr->data[4 + 0*8]);
287 mk_Frame_le64_le64_le64( const HChar* tag, ULong n1, ULong n2, ULong n3 ) argument
325 parse_Frame_le64_le64( Frame* fr, const HChar* tag, ULong* n1, ULong* n2 ) argument
364 parse_Frame_le64_le64_le64_bytes( Frame* fr, const HChar* tag, ULong* n1, ULong* n2, ULong* n3, UChar** data, ULong* n_data ) argument
/external/chromium_org/third_party/cython/src/Cython/Compiler/
H A DParsing.py84 n1 = p_sub_expr(s)
88 n1 = ExprNodes.binop_node(pos, op, n1, n2)
91 n1.truedivision = True
93 n1.truedivision = None # unknown
94 return n1
153 n1 = p_subexpr(s)
159 n1 = ExprNodes.binop_node(pos, op, n1, n2)
160 return n1
[all...]
/external/clang/test/SemaCXX/
H A Dwarn-thread-safety-analysis.cpp3104 Node n1; local
3106 n1.a = 0; // expected-warning {{writing variable 'a' requires holding mutex '&ExistentialPatternMatching::Graph::mu_' exclusively}}
3107 n1.foo(); // expected-warning {{calling function 'foo' requires holding mutex '&ExistentialPatternMatching::Graph::mu_' exclusively}}
3108 n1.foo2();
3111 n1.a = 0;
3112 n1.foo();
3113 n1.foo2(); // expected-warning {{cannot call function 'foo2' while mutex '&ExistentialPatternMatching::Graph::mu_' is held}}
3117 n1.a = 0;
3118 n1.foo();
3119 n1
[all...]
/external/bluetooth/bluedroid/stack/smp/
H A Daes.c232 { uint_8t p1 = x, p2 = BPOLY, n1 = hibit(x), n2 = 0x80, v1 = 1, v2 = 0; local
239 if(n1)
240 while(n2 >= n1) /* divide polynomial p2 by p1 */
242 n2 /= n1; /* shift smaller polynomial left */
251 while(n1 >= n2)
253 n1 /= n2;
254 p1 ^= p2 * n1;
255 v1 ^= v2 * n1;
256 n1 = hibit(p1);
/external/chromium_org/v8/test/cctest/compiler/
H A Dcodegen-tester.cc300 Node* n1;
313 n1 = p1;
315 n1 = m.LoadFromPointer(&input_b, kMachInt32);
317 n1 = m.Int32Constant(inputs[j]);
320 gen->gen(&m, n0, n1);
/external/chromium_org/testing/gtest/test/
H A Dgtest_unittest.cc2146 bool SumIsEven2(int n1, int n2) { argument
2147 return IsEven(n1 + n2);
2153 bool operator()(int n1, int n2, int n3) { argument
2154 return IsEven(n1 + n2 + n3);
2162 int n1, int n2, int n3, int n4) {
2163 const int sum = n1 + n2 + n3 + n4;
2170 << " (" << n1 << " + " << n2 << " + " << n3 << " + " << n4
2180 const char* e5, int n1, int n2, int n3, int n4, int n5) {
2181 const int sum = n1 + n2 + n3 + n4 + n5;
2189 << n1 << "
2160 AssertSumIsEven4( const char* e1, const char* e2, const char* e3, const char* e4, int n1, int n2, int n3, int n4) argument
2178 operator ()( const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, int n1, int n2, int n3, int n4, int n5) argument
2254 const int n1 = 1; local
2272 const int n1 = 1; local
2289 int n1 = 0; local
2301 n1++, n2++, n3++, n4++, n5++) local
[all...]
/external/gtest/test/
H A Dgtest_unittest.cc2153 bool SumIsEven2(int n1, int n2) { argument
2154 return IsEven(n1 + n2);
2160 bool operator()(int n1, int n2, int n3) { argument
2161 return IsEven(n1 + n2 + n3);
2169 int n1, int n2, int n3, int n4) {
2170 const int sum = n1 + n2 + n3 + n4;
2177 << " (" << n1 << " + " << n2 << " + " << n3 << " + " << n4
2187 const char* e5, int n1, int n2, int n3, int n4, int n5) {
2188 const int sum = n1 + n2 + n3 + n4 + n5;
2196 << n1 << "
2167 AssertSumIsEven4( const char* e1, const char* e2, const char* e3, const char* e4, int n1, int n2, int n3, int n4) argument
2185 operator ()( const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, int n1, int n2, int n3, int n4, int n5) argument
2261 const int n1 = 1; local
2279 const int n1 = 1; local
2296 int n1 = 0; local
2308 n1++, n2++, n3++, n4++, n5++) local
[all...]
/external/protobuf/gtest/test/
H A Dgtest_unittest.cc2430 bool SumIsEven2(int n1, int n2) { argument
2431 return IsEven(n1 + n2);
2437 bool operator()(int n1, int n2, int n3) { argument
2438 return IsEven(n1 + n2 + n3);
2446 int n1, int n2, int n3, int n4) {
2447 const int sum = n1 + n2 + n3 + n4;
2454 << " (" << n1 << " + " << n2 << " + " << n3 << " + " << n4
2464 const char* e5, int n1, int n2, int n3, int n4, int n5) {
2465 const int sum = n1 + n2 + n3 + n4 + n5;
2473 << n1 << "
2444 AssertSumIsEven4( const char* e1, const char* e2, const char* e3, const char* e4, int n1, int n2, int n3, int n4) argument
2462 operator ()( const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, int n1, int n2, int n3, int n4, int n5) argument
2538 const int n1 = 1; local
2556 const int n1 = 1; local
2573 int n1 = 0; local
2585 n1++, n2++, n3++, n4++, n5++) local
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/mips/dspr2/
H A Dvp9_convolve8_dspr2.c168 uint32_t p1, p2, p3, p4, n1; local
207 "preceu.ph.qbl %[n1], %[tp3] \n\t"
224 "dpa.w.ph $ac1, %[n1], %[vector4b] \n\t"
242 "dpa.w.ph $ac2, %[n1], %[vector3b] \n\t"
272 "preceu.ph.qbl %[n1], %[tp2] \n\t"
288 "dpa.w.ph $ac3, %[n1], %[vector4b] \n\t"
296 "dpa.w.ph $ac2, %[n1], %[vector3b] \n\t"
303 "lbux %[n1], %[Temp1](%[cm]) \n\t"
312 "sb %[n1], 0(%[odd_dst]) \n\t"
316 [n1] "
[all...]
/external/libcxx/test/strings/basic.string/string.modifiers/string_replace/
H A Dsize_size_pointer.pass.cpp13 // replace(size_type pos, size_type n1, const charT* s);
26 test(S s, typename S::size_type pos, typename S::size_type n1, argument
33 s.replace(pos, n1, str);
37 typename S::size_type xlen = std::min(n1, old_size - pos);
H A Dsize_size_size_char.pass.cpp13 // replace(size_type pos, size_type n1, size_type n2, charT c);
24 test(S s, typename S::size_type pos, typename S::size_type n1, argument
32 s.replace(pos, n1, n2, c);
36 typename S::size_type xlen = std::min(n1, old_size - pos);
H A Dsize_size_string.pass.cpp13 // replace(size_type pos1, size_type n1, const basic_string<charT,traits,Allocator>& str);
24 test(S s, typename S::size_type pos1, typename S::size_type n1, S str, S expected) argument
30 s.replace(pos1, n1, str);
34 typename S::size_type xlen = std::min(n1, old_size - pos1);
/external/libvpx/libvpx/vp9/common/mips/dspr2/
H A Dvp9_convolve8_dspr2.c168 uint32_t p1, p2, p3, p4, n1; local
207 "preceu.ph.qbl %[n1], %[tp3] \n\t"
224 "dpa.w.ph $ac1, %[n1], %[vector4b] \n\t"
242 "dpa.w.ph $ac2, %[n1], %[vector3b] \n\t"
272 "preceu.ph.qbl %[n1], %[tp2] \n\t"
288 "dpa.w.ph $ac3, %[n1], %[vector4b] \n\t"
296 "dpa.w.ph $ac2, %[n1], %[vector3b] \n\t"
303 "lbux %[n1], %[Temp1](%[cm]) \n\t"
312 "sb %[n1], 0(%[odd_dst]) \n\t"
316 [n1] "
[all...]

Completed in 638 milliseconds

1234567891011>>