Searched refs:n1 (Results 101 - 125 of 162) sorted by relevance

1234567

/external/qemu/
H A Dexec.c733 unsigned int n1; local
737 n1 = (long)tb1 & 3;
740 *ptb = tb1->page_next[n1];
743 ptb = &tb1->page_next[n1];
750 unsigned int n1; local
758 n1 = (long)tb1 & 3;
760 if (n1 == n && tb1 == tb)
762 if (n1 == 2) {
765 ptb = &tb1->jmp_next[n1];
786 unsigned int h, n1; local
1301 unsigned int n1; local
[all...]
/external/chromium/chrome/browser/bookmarks/
H A Dbookmark_model.cc102 bool operator() (const BookmarkNode* n1, const BookmarkNode* n2) { argument
103 if (n1->type() == n2->type()) {
106 return n1->GetTitle() < n2->GetTitle();
108 collator_, n1->GetTitle(), n2->GetTitle()) == UCOL_LESS;
111 return n1->is_folder();
H A Dbookmark_utils.cc175 bool MoreRecentlyModified(const BookmarkNode* n1, const BookmarkNode* n2) { argument
176 return n1->date_folder_modified() > n2->date_folder_modified();
511 bool MoreRecentlyAdded(const BookmarkNode* n1, const BookmarkNode* n2) { argument
512 return n1->date_added() > n2->date_added();
/external/chromium/testing/gtest/test/
H A Dgtest_unittest.cc2191 bool SumIsEven2(int n1, int n2) { argument
2192 return IsEven(n1 + n2);
2198 bool operator()(int n1, int n2, int n3) { argument
2199 return IsEven(n1 + n2 + n3);
2207 int n1, int n2, int n3, int n4) {
2208 const int sum = n1 + n2 + n3 + n4;
2215 << " (" << n1 << " + " << n2 << " + " << n3 << " + " << n4
2225 const char* e5, int n1, int n2, int n3, int n4, int n5) {
2226 const int sum = n1 + n2 + n3 + n4 + n5;
2234 << n1 << "
2205 AssertSumIsEven4( const char* e1, const char* e2, const char* e3, const char* e4, int n1, int n2, int n3, int n4) argument
2223 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
2299 const int n1 = 1; local
2317 const int n1 = 1; local
2334 int n1 = 0; local
2346 n1++, n2++, n3++, n4++, n5++) local
[all...]
/external/gtest/test/
H A Dgtest_unittest.cc2191 bool SumIsEven2(int n1, int n2) { argument
2192 return IsEven(n1 + n2);
2198 bool operator()(int n1, int n2, int n3) { argument
2199 return IsEven(n1 + n2 + n3);
2207 int n1, int n2, int n3, int n4) {
2208 const int sum = n1 + n2 + n3 + n4;
2215 << " (" << n1 << " + " << n2 << " + " << n3 << " + " << n4
2225 const char* e5, int n1, int n2, int n3, int n4, int n5) {
2226 const int sum = n1 + n2 + n3 + n4 + n5;
2234 << n1 << "
2205 AssertSumIsEven4( const char* e1, const char* e2, const char* e3, const char* e4, int n1, int n2, int n3, int n4) argument
2223 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
2299 const int n1 = 1; local
2317 const int n1 = 1; local
2334 int n1 = 0; local
2346 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/opencv/cv/src/
H A DmycvHaarDetectObjects.cpp460 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 Dcvcontourtree.cpp51 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/openssl/crypto/ec/
H A Dectest.c198 BIGNUM *n1, *n2, *order; local
203 n1 = BN_new(); n2 = BN_new(); order = BN_new();
216 if (!BN_one(n1)) ABORT;
217 /* n1 = 1 - order */
218 if (!BN_sub(n1, n1, order)) ABORT;
219 if(!EC_POINT_mul(group, Q, NULL, P, n1, ctx)) ABORT;
226 if (!BN_mul(n2, n1, n2, ctx)) ABORT;
232 BN_free(n1);
/external/valgrind/main/massif/
H A Dms_main.c116 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)
663 static Int SXPt_revcmp_szB(void* n1, void* n2) argument
665 SXPt* sxpt1 = *(SXPt**)n1;
/external/qemu/block/
H A Dqcow2-cluster.c349 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/clang/test/SemaCXX/
H A Dconstant-expression-cxx11.cpp73 constexpr int n1 = 0; member in namespace:ConstCast
74 constexpr int n2 = const_cast<int&>(n1);
75 constexpr int *n3 = const_cast<int*>(&n1);
76 constexpr int n4 = *const_cast<int*>(&n1);
1016 volatile constexpr int n1 = 0; // expected-note {{here}}
1020 constexpr int m1 = n1; // expected-error {{constant expression}} expected-note {{read of volatile-qualified type 'const volatile int'}}
1022 constexpr int m1b = const_cast<const int&>(n1); // expected-error {{constant expression}} expected-note {{read of volatile object 'n1'}}
/external/stlport/src/c_locale_win32/
H A Dc_locale_win32.c1088 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/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;
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/llvm/lib/Support/
H A DAPInt.cpp489 unsigned n1 = getActiveBits(); local
493 if (n1 != n2)
497 if (n1 <= APINT_BITS_PER_WORD)
501 for (int i = whichWord(n1 - 1); i >= 0; --i)
521 unsigned n1 = getActiveBits(); local
525 if (n1 < n2)
529 if (n2 < n1)
533 if (n1 <= APINT_BITS_PER_WORD && n2 <= APINT_BITS_PER_WORD)
537 unsigned topWord = whichWord(std::max(n1,n2)-1);
/external/valgrind/unittest/
H A Dracecheck_unittest.cc2175 StealthNotification n1, n2; member in namespace:test51
2200 n1.wait(); // Make sure the waiter blocks.
2221 n1.signal(); // Ready to get the first signal.
2246 StealthNotification n1, n2; member in namespace:test52
2278 n1.signal(); // Ok, now we may block.
2290 n1.wait(); // The first signal is lost.
4260 StealthNotification n1; member in namespace:test90
4270 n1.signal();
4275 n1.wait();
4447 StealthNotification n1, n member in namespace:test94
4592 StealthNotification n1, n2; member in namespace:FalseNegativeOfFastModeTest
4763 StealthNotification n1, n2, n3; member in namespace:test102
[all...]
/external/valgrind/main/exp-sgcheck/
H A Dsg_main.c86 /* 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/v8/test/mjsunit/
H A Dlarge-object-allocation.js71 this.n1 = i;
/external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/geomipmap/
H A DTerrainPatch.java544 Vector3f n1 = new Vector3f(0,0,0);
546 n1.set(calculateNormal(topPoint.mult(scale), rootPoint.mult(scale), leftPoint.mult(scale)));
564 normal.set(n1.add(n2).add(n3).add(n4).normalize());
/external/v8/src/
H A Dast.cc237 Handle<HeapNumber> n1 = Handle<HeapNumber>::cast(h1);
239 ASSERT(isfinite(n1->value()));
241 return n1->value() == n2->value();
/external/v8/benchmarks/
H A Dcrypto.js1263 var n1 = this.subtract(BigInteger.ONE);
1264 var k = n1.getLowestSetBit();
1266 var r = n1.shiftRight(k);
1273 if(y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {
1275 while(j++ < k && y.compareTo(n1) != 0) {
1279 if(y.compareTo(n1) != 0) return false;
/external/webkit/PerformanceTests/SunSpider/tests/v8-v4/
H A Dv8-crypto.js1255 var n1 = this.subtract(BigInteger.ONE);
1256 var k = n1.getLowestSetBit();
1258 var r = n1.shiftRight(k);
1265 if(y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {
1267 while(j++ < k && y.compareTo(n1) != 0) {
1271 if(y.compareTo(n1) != 0) return false;
/external/webkit/PerformanceTests/SunSpider/tests/v8-v5/
H A Dv8-crypto.js1255 var n1 = this.subtract(BigInteger.ONE);
1256 var k = n1.getLowestSetBit();
1258 var r = n1.shiftRight(k);
1265 if(y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {
1267 while(j++ < k && y.compareTo(n1) != 0) {
1271 if(y.compareTo(n1) != 0) return false;
/external/webkit/PerformanceTests/SunSpider/tests/v8-v6/
H A Dv8-crypto.js1255 var n1 = this.subtract(BigInteger.ONE);
1256 var k = n1.getLowestSetBit();
1258 var r = n1.shiftRight(k);
1265 if(y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {
1267 while(j++ < k && y.compareTo(n1) != 0) {
1271 if(y.compareTo(n1) != 0) return false;
/external/icu4c/i18n/
H A Dalphaindex.cpp1100 UnicodeString n1 = nfkdNormalizer->normalize(*s1, status); local
1102 int32_t result = n1.length() - n2.length();
1107 result = n1.compareCodePointOrder(n2);

Completed in 1473 milliseconds

1234567