/external/dropbear/libtommath/ |
bn_mp_div.c | 24 int res, n, n2; local 74 n2 = (a->sign == b->sign ? MP_ZPOS : MP_NEG); 77 c->sign = (mp_iszero(c) == MP_YES) ? MP_ZPOS : n2;
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
TreeWizard.cs | 436 int n2 = tpattern.ChildCount; 437 if (n1 != n2) { 515 int n2 = adaptor.GetChildCount(t2); 516 if (n1 != n2) {
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
TreeWizard.cs | 500 int n2 = tpattern.ChildCount; 501 if ( n1 != n2 ) 589 int n2 = adaptor.GetChildCount( t2 ); 590 if ( n1 != n2 )
|
/external/chromium/base/third_party/nspr/ |
prtime.cc | 870 int n1, n2, n3; local [all...] |
/external/chromium_org/base/third_party/nspr/ |
prtime.cc | 875 int n1, n2, n3; local [all...] |
/external/chromium_org/chrome/browser/notifications/ |
message_center_settings_controller.cc | 79 bool operator() (Notifier* n1, Notifier* n2) { 81 collator_, n1->name, n2->name) == UCOL_LESS; 88 bool SimpleCompareNotifiers(Notifier* n1, Notifier* n2) { 89 return n1->name < n2->name;
|
/external/chromium_org/third_party/openssl/openssl/crypto/bn/ |
bn_lcl.h | 495 void bn_mul_recursive(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,int n2, 499 void bn_sqr_recursive(BN_ULONG *r,const BN_ULONG *a, int n2, BN_ULONG *t); 501 void bn_mul_low_recursive(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,int n2, 503 void bn_mul_high(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,BN_ULONG *l,int n2,
|
/external/clang/test/CodeGen/ |
struct.c | 52 struct NB *n2; member in struct:NB::_B2
|
/external/clang/test/Sema/ |
struct-packed-align.c | 131 extern int n2[__alignof(struct nS) == 1 ? 1 : -1];
|
/external/openssl/crypto/bn/ |
bn_lcl.h | 495 void bn_mul_recursive(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,int n2, 499 void bn_sqr_recursive(BN_ULONG *r,const BN_ULONG *a, int n2, BN_ULONG *t); 501 void bn_mul_low_recursive(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,int n2, 503 void bn_mul_high(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,BN_ULONG *l,int n2,
|
/external/sqlite/android/ |
sqlite3_android.cpp | 37 static int collate16(void *p, int n1, const void *v1, int n2, const void *v2) 41 (const UChar *) v2, n2); 52 static int collate8(void *p, int n1, const void *v1, int n2, const void *v2) 59 uiter_setUTF8(&i2, (const char *) v2, n2);
|
/external/valgrind/main/cachegrind/ |
cg_main.c | 307 void log_2I(InstrInfo* n, InstrInfo* n2) 310 n2->parent->Ir.a++; 315 void log_3I(InstrInfo* n, InstrInfo* n2, InstrInfo* n3) 318 n2->parent->Ir.a++; 333 void log_2I_0D_cache_access(InstrInfo* n, InstrInfo* n2) 338 // n2, n2->instr_addr, n2->instr_len); 342 cachesim_I1_doref(n2->instr_addr, n2->instr_len, [all...] |
/external/pixman/test/ |
utils.c | 657 int i, n1 = 1, n2 = 0; local 664 n2 = atoi (argv[2]); 665 if (n2 < n1) 673 n2 = atoi (argv[1]); 674 checksum = test_function (n2, 1); 675 printf ("%d: checksum=%08X\n", n2, checksum); 681 n2 = default_number_of_iterations; 686 shared(n1, n2, test_function, verbose) 688 for (i = n1; i <= n2; i++) 696 if (n1 == 1 && n2 == default_number_of_iterations [all...] |
/external/chromium/chrome/browser/bookmarks/ |
bookmark_model.h | 340 bool operator()(const BookmarkNode* n1, const BookmarkNode* n2) const { 341 return n1->GetURL() < n2->GetURL();
|
/external/skia/tests/ |
FontHostTest.cpp | 80 int n2 = SkFontStream::GetTableTags(stream, ttcIndex, array.get()); local 81 REPORTER_ASSERT(reporter, n == n2);
|
/external/speex/libspeex/ |
lsp.c | 532 float *pw,*n1,*n2,*n3,*n4=NULL; local 563 n2 = n1 + 1; 564 n3 = n2 + 1; 566 xout1 = xin1 - 2.f*x_freq[i2] * *n1 + *n2; 568 *n2 = *n1;
|
/system/core/fs_mgr/ |
fs_mgr.c | 556 char *n2; local 560 n2 = strdup(in2); 563 remove_trailing_slashes(n2); 565 ret = !strcmp(n1, n2); 568 free(n2);
|
/external/opencv/cxcore/src/ |
cxdxt.cpp | 501 int n2 = n/2; 502 CvComplex64f* dsth = dst + n2; 504 for( i = 0; i < n2; i += 2, itab += tab_step*2 ) 507 assert( (unsigned)j < (unsigned)n2 ); 922 int n2 = n/2; 923 CvComplex32f* dsth = dst + n2; 925 for( i = 0; i < n2; i += 2, itab += tab_step*2 ) 928 assert( (unsigned)j < (unsigned)n2 ); [all...] |
/external/chromium_org/third_party/icu/source/common/ |
normalizer2.cpp | 662 const Normalizer2 *n2=(const Normalizer2 *)norm2; local 663 const Normalizer2WithImpl *n2wi=dynamic_cast<const Normalizer2WithImpl *>(n2); 672 n2->normalize(srcString, destString, *pErrorCode); 698 const Normalizer2 *n2=(const Normalizer2 *)norm2; local 699 const Normalizer2WithImpl *n2wi=dynamic_cast<const Normalizer2WithImpl *>(n2); 710 n2->normalizeSecondAndAppend(firstString, secondString, *pErrorCode); 712 n2->append(firstString, secondString, *pErrorCode);
|
/external/icu4c/common/ |
normalizer2.cpp | 764 const Normalizer2 *n2=(const Normalizer2 *)norm2; local 765 const Normalizer2WithImpl *n2wi=dynamic_cast<const Normalizer2WithImpl *>(n2); 774 n2->normalize(srcString, destString, *pErrorCode); 801 const Normalizer2 *n2=(const Normalizer2 *)norm2; local 802 const Normalizer2WithImpl *n2wi=dynamic_cast<const Normalizer2WithImpl *>(n2); 827 n2->normalizeSecondAndAppend(firstString, secondString, *pErrorCode); 829 n2->append(firstString, secondString, *pErrorCode); [all...] |
/external/chromium/testing/gtest/test/ |
gtest_output_test_.cc | 248 // SCOPED_TRACE("Trace A"); | waits for n2 250 // notifies n2 | 265 Notification n2; member in struct:CheckPoints 275 check_points->n2.WaitForNotification(); 298 check_points.n2.Notify();
|
/external/chromium_org/testing/gtest/test/ |
gtest_output_test_.cc | 260 // SCOPED_TRACE("Trace A"); | waits for n2 262 // notifies n2 | 277 Notification n2; member in struct:CheckPoints 287 check_points->n2.WaitForNotification(); 310 check_points.n2.Notify();
|
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/dbgfmts/dwarf2/ |
dwarf2-info.c | 370 dwarf2_abbrev_attr *n1, *n2; local 375 n2 = STAILQ_NEXT(n1, link); 377 n1 = n2;
|
/external/eigen/Eigen/src/Eigen2Support/Geometry/ |
Quaternion.h | 378 Scalar n2 = this->squaredNorm(); local 379 if (n2 > 0) 380 return Quaternion(conjugate().coeffs() / n2);
|
/external/gtest/test/ |
gtest_output_test_.cc | 248 // SCOPED_TRACE("Trace A"); | waits for n2 250 // notifies n2 | 265 Notification n2; member in struct:CheckPoints 275 check_points->n2.WaitForNotification(); 298 check_points.n2.Notify();
|