Searched refs:n2 (Results 151 - 175 of 276) sorted by relevance

1234567891011>>

/external/skia/tests/
H A DFontHostTest.cpp119 int n2 = SkFontStream::GetTableTags(stream, ttcIndex, array.get()); local
120 REPORTER_ASSERT(reporter, n == n2);
H A DPDFPrimitivesTest.cpp412 SkAutoTUnref<SkPDFName> n2(new SkPDFName("n2"));
414 dict->insert(n2.get(), realHalf.get());
417 "<</n1 42\n/n2 0.5\n/n3 [1 0.5 0]\n>>");
/external/chromium_org/components/bookmarks/browser/
H A Dbookmark_model.cc58 // Returns true if |n1| preceeds |n2|.
60 const BookmarkPermanentNode* n2) {
62 bool n2_visible = client_->IsPermanentNodeVisible(n2);
78 // Returns true if |n1| preceeds |n2|.
79 bool operator()(const BookmarkNode* n1, const BookmarkNode* n2) { argument
80 if (n1->type() == n2->type()) {
83 return n1->GetTitle() < n2->GetTitle();
85 collator_, n1->GetTitle(), n2->GetTitle()) == UCOL_LESS;
59 operator ()(const BookmarkPermanentNode* n1, const BookmarkPermanentNode* n2) argument
/external/pdfium/core/src/fxcrt/
H A Dfx_basic_coords.cpp202 CFX_FloatRect n2 = other_rect;
203 n2.Normalize();
204 if (n2.left >= n1.left && n2.right <= n1.right && n2.bottom >= n1.bottom && n2.top <= n1.top) {
/external/valgrind/main/auxprogs/
H A Dvalgrind-di-server.c454 static Frame* mk_Frame_le64_le64 ( const HChar* tag, ULong n1, ULong n2 )
462 write_ULong_le(&f->data[4 + 1*8], n2);
467 /*OUT*/ULong* n1, /*OUT*/ULong* n2,
476 *n2 = read_ULong_le(&fr->data[4 + 1*8]);
483 ULong n1, ULong n2, ULong n3, ULong n_data,
492 write_ULong_le(&f->data[4 + 1*8], n2);
466 parse_Frame_le64_le64_le64( Frame* fr, const HChar* tag, ULong* n1, ULong* n2, ULong* n3 ) argument
481 mk_Frame_le64_le64_le64_bytes( const HChar* tag, ULong n1, ULong n2, ULong n3, ULong n_data, UChar** data ) argument
/external/openssl/crypto/bn/asm/
H A Dia64-mont.pl365 n1=r24; n2=r25; n3=r26; n4=r27; n5=r28; n6=r29; n7=r30; n8=r31;
615 { .mii; (p16) getf.sig n2=nlo[2] // 23:
640 (p40) add a2=a2,n2 } // (p16) a2+=n2
641 { .mfi; (p42) add a2=a2,n2,1
649 (p40) cmp.ltu p41,p39=a2,n2 }
650 { .mfi; (p42) cmp.leu p41,p39=a2,n2
683 { .mmi; (p0) getf.sig n2=ni1 // 4:
767 (p32)sub n2=t[7],n2
[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
240 while(n2 >= n1) /* divide polynomial p2 by p1 */
242 n2 /= n1; /* shift smaller polynomial left */
243 p2 ^= (p1 * n2) & 0xff; /* and remove from larger one */
244 v2 ^= (v1 * n2); /* shift accumulated value and */
245 n2 = hibit(p2); /* add into result */
250 if(n2) /* repeat with values swapped */
251 while(n1 >= n2)
253 n1 /= n2;
/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 << " + " << n2 << "
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
2255 const int n2 = 2; local
2273 const int n2 = 2; local
2290 int n2 = 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 << " + " << n2 << "
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
2262 const int n2 = 2; local
2280 const int n2 = 2; local
2297 int n2 = 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 << " + " << n2 << "
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
2539 const int n2 = 2; local
2557 const int n2 = 2; local
2574 int n2 = 0; local
2585 n1++, n2++, n3++, n4++, n5++) local
[all...]
/external/chromium_org/v8/test/cctest/compiler/
H A Dtest-scheduler.cc719 Node* n2 = graph.NewNode(op, n0); local
720 USE(n2);
721 n11->ReplaceInput(0, n2);
733 n8->ReplaceInput(0, n2);
766 n14->ReplaceInput(1, n2);
801 n20->ReplaceInput(1, n2);
851 Node* n2 = graph.NewNode(op, n0); local
852 USE(n2);
853 n8->ReplaceInput(0, n2);
972 Node* n2 local
1221 Node* n2 = graph.NewNode(op, n0); local
1540 Node* n2 = graph.NewNode(op, n0); local
[all...]
/external/chromium_org/third_party/icu/source/test/intltest/
H A Dsvccoll.cpp345 int32_t n1, n2, n3; local
399 n2 = checkAvailable("after registerFactory");
400 assertTrue("count after > count before", n2 > n1);
/external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/
H A Dfile.c580 incpath *n1, *n2; local
584 n2 = STAILQ_NEXT(n1, link);
587 n1 = n2;
/external/clang/test/CXX/expr/expr.const/
H A Dp2-0x.cpp15 int n2[this1]; // expected-warning {{variable length array}} local
16 (void)n1, (void)n2;
231 constexpr int n2 = 65536 * 32768; // expected-error {{constant expression}} expected-note {{value 2147483648 is outside the range of }} member in namespace:UndefinedBehavior::Overflow
/external/eigen/Eigen/src/Eigen2Support/Geometry/
H A DQuaternion.h378 Scalar n2 = this->squaredNorm(); local
379 if (n2 > 0)
380 return Quaternion(conjugate().coeffs() / n2);
/external/icu/icu4c/source/test/intltest/
H A Dsvccoll.cpp345 int32_t n1, n2, n3; local
399 n2 = checkAvailable("after registerFactory");
400 assertTrue("count after > count before", n2 > n1);
/external/libcxx/test/strings/basic.string/string.modifiers/string_replace/
H A Dsize_size_size_char.pass.cpp13 // replace(size_type pos, size_type n1, size_type n2, charT c);
25 typename S::size_type n2, typename S::value_type c,
32 s.replace(pos, n1, n2, c);
37 typename S::size_type rlen = n2;
24 test(S s, typename S::size_type pos, typename S::size_type n1, typename S::size_type n2, typename S::value_type c, S expected) argument
/external/bzip2/
H A Dbzlib.c970 Int32 n, n2, ret; local
996 n2 = fwrite ( (void*)(bzf->buf), sizeof(UChar),
998 if (n != n2 || ferror(bzf->handle))
1030 Int32 n, n2, ret; local
1055 n2 = fwrite ( (void*)(bzf->buf), sizeof(UChar),
1057 if (n != n2 || ferror(bzf->handle))
/external/tcpdump/
H A Dprint-rx.c213 { 534, "list-attrib-n2" },
668 #define FIDOUT() { unsigned long n1, n2, n3; \
672 n2 = EXTRACT_32BITS(bp); \
676 printf(" fid %d/%d/%d", (int) n1, (int) n2, (int) n3); \
788 #define DESTSERVEROUT() { unsigned long n1, n2, n3; \
792 n2 = EXTRACT_32BITS(bp); \
796 printf(" server %d:%d:%d", (int) n1, (int) n2, (int) n3); \
/external/valgrind/main/coregrind/m_debuginfo/
H A Dimage.c288 ULong n1, ULong n2, ULong n3 )
296 write_ULong_le(&f->data[4 + 1*8], n2);
326 /*OUT*/ULong* n1, /*OUT*/ULong* n2 )
334 *n2 = read_ULong_le(&fr->data[4 + 1*8]);
366 /*OUT*/ULong* n1, /*OUT*/ULong* n2, /*OUT*/ULong* n3,
376 *n2 = read_ULong_le(&fr->data[4 + 1*8]);
287 mk_Frame_le64_le64_le64( const HChar* tag, ULong n1, ULong n2, ULong n3 ) 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/skia/third_party/lua/src/
H A Dldblib.c248 int n2 = checkupval(L, 3, 4); local
251 lua_upvaluejoin(L, 1, n1, 3, n2);
/external/glide/third_party/gif_decoder/src/main/java/com/bumptech/glide/gifdecoder/
H A DGifDecoder.java355 int n2 = n1 + previousFrame.iw;
356 for (int k = n1; k < n2; k++) {
/external/sqlite/dist/orig/
H A Dshell.c2815 int n2 = (int)strlen(zMode); local
2817 if( c2=='l' && n2>2 && strncmp(azArg[1],"lines",n2)==0 ){
2819 }else if( c2=='c' && strncmp(azArg[1],"columns",n2)==0 ){
2821 }else if( c2=='l' && n2>2 && strncmp(azArg[1],"list",n2)==0 ){
2823 }else if( c2=='h' && strncmp(azArg[1],"html",n2)==0 ){
2825 }else if( c2=='t' && strncmp(azArg[1],"tcl",n2)==0 ){
2828 }else if( c2=='c' && strncmp(azArg[1],"csv",n2)==0 ){
2832 }else if( c2=='t' && strncmp(azArg[1],"tabs",n2)
[all...]
/external/sqlite/dist/
H A Dshell.c2835 int n2 = (int)strlen(zMode); local
2837 if( c2=='l' && n2>2 && strncmp(azArg[1],"lines",n2)==0 ){
2839 }else if( c2=='c' && strncmp(azArg[1],"columns",n2)==0 ){
2841 }else if( c2=='l' && n2>2 && strncmp(azArg[1],"list",n2)==0 ){
2843 }else if( c2=='h' && strncmp(azArg[1],"html",n2)==0 ){
2845 }else if( c2=='t' && strncmp(azArg[1],"tcl",n2)==0 ){
2848 }else if( c2=='c' && strncmp(azArg[1],"csv",n2)==0 ){
2852 }else if( c2=='t' && strncmp(azArg[1],"tabs",n2)
[all...]
/external/stlport/src/c_locale_win32/
H A Dc_locale_win32.c1089 const char* s2, size_t n2) {
1091 while (n1 > 0 || n2 > 0) {
1093 DWORD size2 = trim_size_t_to_DWORD(n2);
1098 n2 -= size2;
1105 const char* s2, size_t n2) {
1108 result = _Locale_strcmp_auxA(lcol, s1, n1, s2, n2);
1114 buf2 = __ConvertToCP(atoi(lcol->cp), __GetDefaultCP(lcol->lc.id), s2, n2, &size2);
1087 _Locale_strcmp_auxA(_Locale_collate_t* lcol, const char* s1, size_t n1, const char* s2, size_t n2) argument
1103 _Locale_strcmp(_Locale_collate_t* lcol, const char* s1, size_t n1, const char* s2, size_t n2) argument

Completed in 908 milliseconds

1234567891011>>