/external/opencv/cvaux/src/ |
cvhmmobs.cpp | 136 int n1 = dctSize.height, m1 = n1 / 2; local 182 if( n1 & 1 ) 192 float t1 = img[x + (n1 - 1 - j) * imgStep]; 220 if( n1 & 1 ) 331 int n1 = dctSize.height, m1 = n1 / 2; local 379 if( n1 & 1 ) 389 float t1 = img[x + (n1 - 1 - j) * imgStep]; 417 if( n1 & 1 [all...] |
/ndk/sources/cxx-stl/stlport/src/c_locale_dummy/ |
c_locale_dummy.c | 272 const char* s1, size_t n1, const char* s2, size_t n2) { 275 while (n1 > 0 || n2 > 0) { 276 size_t bufsize1 = n1 < 63 ? n1 : 63; 283 s1 += bufsize1; n1 -= bufsize1; 292 const wchar_t* s1, size_t n1, const wchar_t* s2, size_t n2) { 295 while (n1 > 0 || n2 > 0) { 296 size_t bufsize1 = n1 < 63 ? n1 : 63; 303 s1 += bufsize1; n1 -= bufsize1 [all...] |
/ndk/sources/cxx-stl/stlport/src/c_locale_glibc/ |
c_locale_glibc2.c | 363 const char *s1, size_t n1, 367 while (n1 > 0 || n2 > 0) { 368 size_t bufsize1 = n1 < 63 ? n1 : 63; 375 s1 += bufsize1; n1 -= bufsize1; 383 const wchar_t *s1, size_t n1, 387 while (n1 > 0 || n2 > 0) { 388 size_t bufsize1 = n1 < 63 ? n1 : 63; 395 s1 += bufsize1; n1 -= bufsize1 [all...] |
/external/eigen/test/ |
geo_hyperplane.cpp | 33 VectorType n1 = VectorType::Random(dim).normalized(); local 36 HyperplaneType pl1(n1, p1); 42 VERIFY_IS_APPROX( n1.dot(n1), Scalar(1) ); 45 VERIFY_IS_APPROX( pl1.signedDistance(p1 + n1 * s0), s0 );
|
/libcore/ojluni/src/main/java/sun/util/calendar/ |
BaseCalendar.java | 495 int n400, n100, n4, n1; local 506 n1 = d3 / 365; 516 n1 = CalendarUtils.floorDivide(d3, 365); 519 year = 400 * n400 + 100 * n100 + 4 * n4 + n1; 520 if (!(n100 == 4 || n1 == 4)) {
|
/toolchain/binutils/binutils-2.25/include/ |
longlong.h | 150 #define udiv_qrnnd(q, r, n1, n0, d) \ 152 (q) = __udiv_qrnnd (&__r, (n1), (n0), (d)); \ 414 #define sdiv_qrnnd(q, r, n1, n0, d) \ 419 __x.__i.__h = n1; __x.__i.__l = n0; \ 437 #define sdiv_qrnnd(q, r, n1, n0, d) \ 439 register SItype __r0 __asm__ ("0") = (n1); \ 473 #define udiv_qrnnd(q, r, n1, n0, dv) \ 478 "1" ((USItype) (n1)), \ 509 #define udiv_qrnnd(q, r, n1, n0, dv) \ 514 "1" ((UDItype) (n1)), \ [all...] |
/external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/cldr/ |
CheckSystemFonts.java | 119 public int compare(String n1, String n2) { 120 int result = n1.length() - n2.length(); 122 return n1.compareTo(n2); 127 public int compare(UnicodeSet n1, UnicodeSet n2) { 128 int result = n1.size() - n2.size(); 130 return n1.compareTo(n2); 135 public int compare(Collection n1, Collection n2) { 136 int result = n1.size() - n2.size(); 138 return UnicodeSet.compare(n1, n2); 394 boolean n1 = Normalizer.isNormalized(o1, Normalizer.NFC, 0) [all...] |
/external/libchrome/base/third_party/nspr/ |
prtime.cc | 905 int n1, n2, n3; local [all...] |
/frameworks/native/opengl/tests/hwc/ |
hwcTestLib.cpp | 360 for (unsigned int n1 = 0; n1 < NUMA(hwcTestGraphicFormat); n1++) { 361 if (string(desc) == string(hwcTestGraphicFormat[n1].desc)) { 362 return &hwcTestGraphicFormat[n1]; 374 for (unsigned int n1 = 0; n1 < NUMA(hwcTestGraphicFormat); n1++) { 375 if (id == hwcTestGraphicFormat[n1].format) { 376 return &hwcTestGraphicFormat[n1]; [all...] |
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/aux_/preprocessed/gcc/ |
bind.hpp | 80 typedef typename r0::next n1; typedef in struct:boost::mpl::bind0::apply 132 typedef typename r0::next n1; typedef in struct:boost::mpl::bind1::apply 135 typedef aux::replace_unnamed_arg< T1,n1 > r1; 190 typedef typename r0::next n1; typedef in struct:boost::mpl::bind2::apply 193 typedef aux::replace_unnamed_arg< T1,n1 > r1; 253 typedef typename r0::next n1; typedef in struct:boost::mpl::bind3::apply 256 typedef aux::replace_unnamed_arg< T1,n1 > r1; 321 typedef typename r0::next n1; typedef in struct:boost::mpl::bind4::apply 324 typedef aux::replace_unnamed_arg< T1,n1 > r1; 396 typedef typename r0::next n1; typedef in struct:boost::mpl::bind5::apply 486 typedef mpl::arg<1> n1; typedef in struct:boost::mpl::bind3::apply 534 typedef mpl::arg<1> n1; typedef in struct:boost::mpl::bind3::apply [all...] |
/prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/amd64/ |
gsubr.go | 79 var n1 gc.Node 85 gc.Nodconst(&n1, gc.Types[gc.TINT32], c) 88 gc.Nodconst(&n1, gc.Types[gc.TINT64], c) 97 gins(x86.AMOVQ, &n1, &ntmp) 103 gins(as, &n1, n2) 106 func ginscmp(op int, t *gc.Type, n1, n2 *gc.Node, likely int) *obj.Prog { 107 if gc.Isint[t.Etype] && n1.Op == gc.OLITERAL && gc.Smallintconst(n1) && n2.Op != gc.OLITERAL { 110 n1, n2 = n2, n1 [all...] |
/prebuilts/go/darwin-x86/src/cmd/compile/internal/amd64/ |
gsubr.go | 76 var n1 gc.Node 82 gc.Nodconst(&n1, gc.Types[gc.TINT32], c) 85 gc.Nodconst(&n1, gc.Types[gc.TINT64], c) 94 gins(x86.AMOVQ, &n1, &ntmp) 100 gins(as, &n1, n2) 103 func ginscmp(op int, t *gc.Type, n1, n2 *gc.Node, likely int) *obj.Prog { 104 if gc.Isint[t.Etype] && n1.Op == gc.OLITERAL && gc.Smallintconst(n1) && n2.Op != gc.OLITERAL { 107 n1, n2 = n2, n1 [all...] |
/prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/compile/internal/amd64/ |
gsubr.go | 79 var n1 gc.Node 85 gc.Nodconst(&n1, gc.Types[gc.TINT32], c) 88 gc.Nodconst(&n1, gc.Types[gc.TINT64], c) 97 gins(x86.AMOVQ, &n1, &ntmp) 103 gins(as, &n1, n2) 106 func ginscmp(op int, t *gc.Type, n1, n2 *gc.Node, likely int) *obj.Prog { 107 if gc.Isint[t.Etype] && n1.Op == gc.OLITERAL && gc.Smallintconst(n1) && n2.Op != gc.OLITERAL { 110 n1, n2 = n2, n1 [all...] |
/prebuilts/go/linux-x86/src/cmd/compile/internal/amd64/ |
gsubr.go | 76 var n1 gc.Node 82 gc.Nodconst(&n1, gc.Types[gc.TINT32], c) 85 gc.Nodconst(&n1, gc.Types[gc.TINT64], c) 94 gins(x86.AMOVQ, &n1, &ntmp) 100 gins(as, &n1, n2) 103 func ginscmp(op int, t *gc.Type, n1, n2 *gc.Node, likely int) *obj.Prog { 104 if gc.Isint[t.Etype] && n1.Op == gc.OLITERAL && gc.Smallintconst(n1) && n2.Op != gc.OLITERAL { 107 n1, n2 = n2, n1 [all...] |
/external/opencv3/modules/ml/src/ |
ann_mlp.cpp | 178 int n1 = layer_sizes[i-1]; local 180 double val = 0, G = n2 > 2 ? 0.7*pow((double)n1,1./(n2-1)) : 1.; 187 for( k = 0; k <= n1; k++ ) 197 for( k = 0; k <= n1; k++ ) 199 w[n1*n2 + j] *= G*(-1+j*2./n2); 831 int n1 = layer_sizes[i-1], n2 = layer_sizes[i]; 834 Mat _x(n1+1, 1, CV_64F, &x[i-1][0]); 835 x[i-1][n1] = 1.; 840 Mat grad2(1, n1, CV_64F, buf[i&1]); 841 Mat _w = weights[i].rowRange(0, n1); 950 int n1 = ann->layer_sizes[i-1], n2 = ann->layer_sizes[i]; local 1052 int n1 = layer_sizes[i-1], n2 = layer_sizes[i]; local [all...] |
/external/v8/src/ast/ |
scopes.cc | 984 int n1 = n0 + 2; \/\/ indentation local [all...] |
/prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/arm/ |
gsubr.go | 84 var n1 gc.Node 85 if !dotaddable(n, &n1) { 86 gc.Igen(n, &n1, nil) 87 sclean[nsclean-1] = n1 90 n = &n1 94 var n1 gc.Node 95 gc.Cgen(n.Name.Heapaddr, &n1) 96 sclean[nsclean-1] = n1 97 n = &n1 116 var n1 gc.Nod [all...] |
/prebuilts/go/darwin-x86/src/cmd/compile/internal/arm/ |
gsubr.go | 81 var n1 gc.Node 82 if !dotaddable(n, &n1) { 83 gc.Igen(n, &n1, nil) 84 sclean[nsclean-1] = n1 87 n = &n1 91 var n1 gc.Node 92 gc.Cgen(n.Name.Heapaddr, &n1) 93 sclean[nsclean-1] = n1 94 n = &n1 113 var n1 gc.Nod [all...] |
/prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/compile/internal/arm/ |
gsubr.go | 84 var n1 gc.Node 85 if !dotaddable(n, &n1) { 86 gc.Igen(n, &n1, nil) 87 sclean[nsclean-1] = n1 90 n = &n1 94 var n1 gc.Node 95 gc.Cgen(n.Name.Heapaddr, &n1) 96 sclean[nsclean-1] = n1 97 n = &n1 116 var n1 gc.Nod [all...] |
/prebuilts/go/linux-x86/src/cmd/compile/internal/arm/ |
gsubr.go | 81 var n1 gc.Node 82 if !dotaddable(n, &n1) { 83 gc.Igen(n, &n1, nil) 84 sclean[nsclean-1] = n1 87 n = &n1 91 var n1 gc.Node 92 gc.Cgen(n.Name.Heapaddr, &n1) 93 sclean[nsclean-1] = n1 94 n = &n1 113 var n1 gc.Nod [all...] |
/development/perftests/panorama/feature_stab/db_vlvm/ |
db_utilities_poly.h | 302 double C[16],n0,n1,n2,n3,m; local 352 n1=db_sqr(C[4]) +db_sqr(C[5]) +db_sqr(C[6]) +db_sqr(C[7]); 358 if(n0>=n1 && n0>=n2 && n0>=n3) 363 else if(n1>=n2 && n1>=n3) 365 m=db_SafeReciprocal(sqrt(n1));
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
TreeWizard.cs | 435 int n1 = adaptor.GetChildCount(t1); 437 if (n1 != n2) { 440 for (int i = 0; i < n1; i++) { 514 int n1 = adaptor.GetChildCount(t1); 516 if (n1 != n2) { 519 for (int i = 0; i < n1; i++) {
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
TreeWizard.cs | 499 int n1 = adaptor.GetChildCount( t1 ); 501 if ( n1 != n2 ) 505 for ( int i = 0; i < n1; i++ ) 588 int n1 = adaptor.GetChildCount( t1 ); 590 if ( n1 != n2 ) 594 for ( int i = 0; i < n1; i++ )
|
/external/v8/test/mjsunit/tools/ |
profile_view.js | 84 view.sort(function(n1, n2) { 85 return cmpStrs(n1.internalFuncName, n2.internalFuncName) || 86 (n1.selfTime - n2.selfTime);
|
/ndk/sources/cxx-stl/stlport/src/c_locale_win32/ |
c_wlocale_win32.c | 198 const wchar_t* s1, size_t n1,
201 while (n1 > 0 || n2 > 0) {
202 DWORD size1 = trim_size_t_to_DWORD(n1);
207 n1 -= size1;
214 const wchar_t* s1, size_t n1,
217 result = _WLocale_strcmp_aux(lcol, s1, n1, s2, n2);
|