/external/tcpdump/ |
H A D | print-rx.c | 668 #define FIDOUT() { unsigned long n1, n2, n3; \ 670 n1 = EXTRACT_32BITS(bp); \ 676 printf(" fid %d/%d/%d", (int) n1, (int) n2, (int) n3); \ 788 #define DESTSERVEROUT() { unsigned long n1, n2, n3; \ 790 n1 = EXTRACT_32BITS(bp); \ 796 printf(" server %d:%d:%d", (int) n1, (int) n2, (int) n3); \
|
/external/chromium_org/components/bookmarks/browser/ |
H A D | bookmark_index_unittest.cc | 405 const BookmarkNode* n1 = model_->AddURL(model_->other_node(), 0, local 412 EXPECT_EQ(n1, matches[0].node);
|
H A D | bookmark_utils_unittest.cc | 367 const BookmarkNode* n1 = model->AddURL(model->other_node(), 0, title, url); local 372 nodes.push_back(n1);
|
/external/chromium_org/third_party/skia/third_party/lua/src/ |
H A D | ldblib.c | 247 int n1 = checkupval(L, 1, 2); local 251 lua_upvaluejoin(L, 1, n1, 3, n2);
|
/external/libcxx/test/strings/basic.string/string.modifiers/string_replace/ |
H A D | iter_iter_pointer.pass.cpp | 25 test(S s, typename S::size_type pos1, typename S::size_type n1, const typename S::value_type* str, S expected) argument 29 typename S::const_iterator last = s.begin() + pos1 + n1;
|
H A D | iter_iter_size_char.pass.cpp | 25 test(S s, typename S::size_type pos1, typename S::size_type n1, typename S::size_type n2, argument 30 typename S::const_iterator last = s.begin() + pos1 + n1;
|
H A D | iter_iter_string.pass.cpp | 25 test(S s, typename S::size_type pos1, typename S::size_type n1, S str, S expected) argument 29 typename S::const_iterator last = s.begin() + pos1 + n1;
|
/external/opencv/cv/src/ |
H A D | mycvHaarDetectObjects.cpp | 460 unsigned int n1 = NEXT(n, number); local 462 while(abs(n1 - n) > 1) { 463 n = n1; 464 n1 = NEXT(n, number); 466 while((n1*n1) > number) { 467 n1 -= 1; 469 return n1;
|
H A D | cvcontourtree.cpp | 51 icvCalcTriAttr( const CvSeq * contour, CvPoint t2, CvPoint t1, int n1, 595 icvCalcTriAttr( const CvSeq * contour, CvPoint t2, CvPoint t1, int n1, argument 621 *s_c = cvContourArea( contour, cvSlice(n1, n3+1));
|
/external/skia/tests/ |
H A D | PDFPrimitivesTest.cpp | 409 SkAutoTUnref<SkPDFName> n1(new SkPDFName("n1")); 410 dict->insert(n1.get(), int42.get()); 411 SimpleCheckObjectOutput(reporter, dict.get(), "<</n1 42\n>>"); 417 "<</n1 42\n/n2 0.5\n/n3 [1 0.5 0]\n>>");
|
/external/valgrind/main/massif/ |
H A D | ms_main.c | 116 n1: 5 (heap allocation functions) malloc/new/new[], --alloc-fns, etc. 117 n1: 5 0x27F6E0: _nl_normalize_codeset (in /lib/libc-2.3.5.so) 118 n1: 5 0x279DE6: _nl_load_locale_from_archive (in /lib/libc-2.3.5.so) 119 n1: 5 0x278E97: _nl_find_locale (in /lib/libc-2.3.5.so) 120 n1: 5 0x278871: setlocale (in /lib/libc-2.3.5.so) 121 n1: 5 0x8049821: (within /bin/date) 635 static Int SXPt_revcmp_szB(const void* n1, const void* n2) argument 637 const SXPt* sxpt1 = *(const SXPt *const *)n1;
|
/external/lzma/C/ |
H A D | Ppmd7.c | 608 unsigned n0, n1;
local 626 n1 = (p->MinContext->NumStats + 1) >> 1;
627 if (n0 != n1)
628 p->MinContext->Stats = STATS_REF(ShrinkUnits(p, stats, n0, n1));
|
/external/qemu/block/ |
H A D | qcow2-cluster.c | 349 int ret, index_in_cluster, n, n1; local 365 n1 = qcow2_backing_read1(bs->backing_hd, sector_num, buf, n); 366 if (n1 > 0) { 368 ret = bdrv_read(bs->backing_hd, sector_num, buf, n1);
|
/external/stlport/src/c_locale_win32/ |
H A D | c_locale_win32.c | 1088 const char* s1, size_t n1, 1091 while (n1 > 0 || n2 > 0) { 1092 DWORD size1 = trim_size_t_to_DWORD(n1); 1097 n1 -= size1; 1104 const char* s1, size_t n1, 1108 result = _Locale_strcmp_auxA(lcol, s1, n1, s2, n2); 1113 buf1 = __ConvertToCP(atoi(lcol->cp), __GetDefaultCP(lcol->lc.id), s1, n1, &size1); 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
|
/external/chromium_org/third_party/x86inc/ |
H A D | x86inc.asm | 670 %xdefine %%n1 n %+ %1 672 %xdefine tmp m %+ %%n1 673 CAT_XDEFINE m, %%n1, m %+ %%n2 675 CAT_XDEFINE n, m %+ %%n1, %%n1
|
/external/openssl/crypto/bn/asm/ |
H A D | ia64-mont.pl | 365 n1=r24; n2=r25; n3=r26; n4=r27; n5=r28; n6=r29; n7=r30; n8=r31; 595 { .mii; (p16) getf.sig n1=nlo[1] // 19: 620 (p16) add a1=a1,n1 } // (p16) a1+=n1 630 { .mfi; (p16) cmp.ltu.unc p42,p40=a1,n1 666 { .mmi; (p0) getf.sig n1=ni0 // 0: 764 sub n1=t0,n1 };; 765 { .mmi; cmp.gtu p34,p32=n1,t0;; 810 { .mmi; (p32)st8 [rptr]=n1, 756 sub n1=t0,n1 };; subroutine [all...] |
/external/chromium_org/v8/test/cctest/compiler/ |
H A D | test-js-typed-lowering.cc | 894 void CheckEffectOrdering(Node* n0, Node* n1) { argument 896 R.CheckEffectInput(n0, n1); 897 R.CheckEffectInput(n1, effect_use); 1256 Node* n1 = R.Parameter(kInt32Types[j]); local 1260 Node* add_node = R.Binop(R.simplified.NumberAdd(), n0, n1); 1283 Node* n1 = R.Parameter(kInt32Types[j]); local 1287 Node* add_node = R.Binop(R.simplified.NumberAdd(), n0, n1); 1311 Node* n1 = R.Parameter(I32Type(R.signedness[o + 1])); local 1314 Node* add_node = R.Binop(R.simplified.NumberAdd(), n0, n1);
|
/external/llvm/lib/Support/ |
H A D | APInt.cpp | 490 unsigned n1 = getActiveBits(); local 494 if (n1 != n2) 498 if (n1 <= APINT_BITS_PER_WORD) 502 for (int i = whichWord(n1 - 1); i >= 0; --i) 522 unsigned n1 = getActiveBits(); local 526 if (n1 < n2) 530 if (n2 < n1) 534 if (n1 <= APINT_BITS_PER_WORD && n2 <= APINT_BITS_PER_WORD) 538 unsigned topWord = whichWord(std::max(n1,n2)-1);
|
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
H A D | pprof | 1778 my $n1 = GetEntry($samples1, $l); 1791 my $source_class = (($n1 + $n2 > 0) 1798 HtmlPrintNumber($n1), 1805 UnparseAlt($n1), 3941 # same as the in-use stats ($n1,$s1). It is remotely conceivable 3945 my ($n1, $s1, $n2, $s2) = ($1, $2, $3, $4); 3946 if (($n1 == $n2) && ($s1 == $s2)) { 4009 my ($n1, $s1, $n2, $s2) = ($1, $2, $3, $4); 4017 if ($n1 != 0) { 4018 my $ratio = (($s1*1.0)/$n1)/( [all...] |
/external/jemalloc/bin/ |
H A D | pprof | 1778 my $n1 = GetEntry($samples1, $l); 1791 my $source_class = (($n1 + $n2 > 0) 1798 HtmlPrintNumber($n1), 1805 UnparseAlt($n1), 3950 # same as the in-use stats ($n1,$s1). It is remotely conceivable 3954 my ($n1, $s1, $n2, $s2) = ($1, $2, $3, $4); 3955 if (($n1 == $n2) && ($s1 == $s2)) { 4018 my ($n1, $s1, $n2, $s2) = ($1, $2, $3, $4); 4026 if ($n1 != 0) { 4027 my $ratio = (($s1*1.0)/$n1)/( [all...] |
/external/chromium_org/third_party/skia/tests/ |
H A D | PDFPrimitivesTest.cpp | 410 SkAutoTUnref<SkPDFName> n1(new SkPDFName("n1")); 411 dict->insert(n1.get(), int42.get()); 412 SimpleCheckObjectOutput(reporter, dict.get(), "<</n1 42\n>>"); 418 "<</n1 42\n/n2 0.5\n/n3 [1 0.5 0]\n>>");
|
/external/libcxx/test/strings/basic.string/string.ops/string_compare/ |
H A D | size_size_string.pass.cpp | 12 // int compare(size_type pos1, size_type n1, const basic_string& str) 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/valgrind/main/exp-sgcheck/ |
H A D | sg_main.c | 86 /* Compare the intervals [a1,a1+n1) and [a2,a2+n2). Return -1 if the 93 static Word cmp_nonempty_intervals ( Addr a1, SizeT n1, argument 96 UWord n1w = (UWord)n1; 207 Word i, r, n1, n2; local 208 n1 = VG_(sizeXA)( fb1s ); 210 if (n1 < n2) return -1; 211 if (n1 > n2) return 1; 212 for (i = 0; i < n1; i++) { 219 tl_assert(i == n1 && i == n2);
|
/external/chromium_org/v8/test/mjsunit/ |
H A D | large-object-allocation.js | 71 this.n1 = i;
|
/external/chromium_org/third_party/sqlite/src/src/ |
H A D | vdbemem.c | 858 int n1, n2; local 866 n1 = v1==0 ? 0 : c1.n; 869 rc = pColl->xCmp(pColl->pUser, n1, v1, n2, v2);
|