HomeSort by relevance Sort by last modified time
    Searched refs:n2 (Results 176 - 200 of 1010) sorted by null

1 2 3 4 5 6 78 91011>>

  /bionic/libc/upstream-openbsd/lib/libc/stdio/
vfprintf.c 273 int n, n2; /* handy integers (short term usage) */ local
372 n2 = (ep) - (p); \
373 if (n2 > (len)) \
374 n2 = (len); \
375 if (n2 > 0) \
376 PRINT((p), n2); \
377 PAD((len) - (n2 > 0 ? n2 : 0), (with)); \
426 n2 = 0; \
429 APPEND_DIGIT(n2, *cp);
1144 int n, n2; \/* handy integer (short term usage) *\/ local
    [all...]
vfwprintf.c 283 int n, n2, n3; /* handy integers (short term usage) */ local
352 * PAD uses `n' and 'n3', and PRINTANDPAD uses 'n', 'n2', and 'n3'.
370 n2 = (ep) - (p); \
371 if (n2 > (len)) \
372 n2 = (len); \
373 if (n2 > 0) \
374 PRINT((p), n2); \
375 PAD((len) - (n2 > 0 ? n2 : 0), (with)); \
418 n2 = 0;
1113 int n, n2; \/* handy integer (short term usage) *\/ local
    [all...]
  /external/compiler-rt/lib/sanitizer_common/tests/
sanitizer_deadlock_detector_test.cc 73 // Cycle: n1->n2->n1
78 uptr n2 = d.newNode(2); local
80 EXPECT_FALSE(d.onLock(&dtls, n2));
81 d.onUnlock(&dtls, n2);
84 EXPECT_FALSE(d.onLock(&dtls, n2));
90 EXPECT_EQ(path[1], n2);
92 EXPECT_EQ(d.getData(n2), 2U);
94 d.onUnlock(&dtls, n2);
97 // Cycle: n1->n2->n3->n1
102 uptr n2 = d.newNode(2) local
    [all...]
  /bionic/libm/upstream-freebsd/lib/msun/ld128/
k_expl.h 242 int n, n2; local
244 /* Reduce x to (k*ln2 + endpoint[n2] + r1 + r2). */
255 n2 = (unsigned)n % INTERVALS;
262 /* Evaluate expl(endpoint[n2] + r1 + r2) = tbl[n2] * expl(r1 + r2). */
266 t = tbl[n2].lo + tbl[n2].hi;
267 *hip = tbl[n2].hi;
268 *lop = tbl[n2].lo + t * (q + r1);
  /external/boringssl/src/crypto/pkcs8/
pkcs8.c 395 int n1, n2; local
397 !EVP_DecryptFinal_ex(&ctx, buf + n1, &n2)) {
402 *out_len = n1 + n2;
503 int n1, n2; local
507 !EVP_CipherFinal_ex(&ctx, ptr + n1, &n2) ||
508 !CBB_did_write(&ciphertext, n1 + n2) ||
  /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/
db_utilities_poly.h 302 double C[16],n0,n1,n2,n3,m; local
353 n2=db_sqr(C[8]) +db_sqr(C[9]) +db_sqr(C[10])+db_sqr(C[11]);
358 if(n0>=n1 && n0>=n2 && n0>=n3)
363 else if(n1>=n2 && n1>=n3)
368 else if(n2>=n3)
370 m=db_SafeReciprocal(sqrt(n2));
  /prebuilts/ndk/r11/sources/cxx-stl/stlport/src/c_locale_win32/
c_wlocale_win32.c 199 const wchar_t* s2, size_t n2) {
201 while (n1 > 0 || n2 > 0) {
203 DWORD size2 = trim_size_t_to_DWORD(n2);
208 n2 -= size2;
215 const wchar_t* s2, size_t n2) {
217 result = _WLocale_strcmp_aux(lcol, s1, n1, s2, n2);
  /prebuilts/ndk/r13/sources/cxx-stl/stlport/src/c_locale_win32/
c_wlocale_win32.c 199 const wchar_t* s2, size_t n2) {
201 while (n1 > 0 || n2 > 0) {
203 DWORD size2 = trim_size_t_to_DWORD(n2);
208 n2 -= size2;
215 const wchar_t* s2, size_t n2) {
217 result = _WLocale_strcmp_aux(lcol, s1, n1, s2, n2);
  /external/opencv/ml/src/
mlann_mlp.cpp 183 int n2 = layer_sizes->data.i[i]; local
184 double val = 0, G = n2 > 2 ? 0.7*pow((double)n1,1./(n2-1)) : 1.;
188 for( j = 0; j < n2; j++ )
194 w[k*n2 + j] = val;
202 w[k*n2 + j] *= s;
203 w[n1*n2 + j] *= G*(-1+j*2./n2);
1017 int n1 = layer_sizes->data.i[i-1], n2 = layer_sizes->data.i[i]; local
1018 cvInitMatHeader( &_df, 1, n2, CV_64F, df[i] )
1129 int n1, n2, si, j, k; local
    [all...]
  /external/eigen/test/
geo_parametrizedline.cpp 55 VectorType n2 = VectorType::Random(dim).normalized(); local
56 HyperplaneType hp(p2,n2);
  /external/gemmlowp/profiling/
profiler.h 170 static bool CompareNodes(Node* n1, Node* n2) {
171 return n1->weight > n2->weight;
  /external/icu/android_icu4j/src/main/java/android/icu/text/
NormalizationTransliterator.java 76 private NormalizationTransliterator(String id, Normalizer2 n2) {
78 norm2 = n2;
  /external/icu/icu4c/source/common/unicode/
normalizer2.h 453 * @param n2 wrapped Normalizer2 instance
457 FilteredNormalizer2(const Normalizer2 &n2, const UnicodeSet &filterSet) :
458 norm2(n2), set(filterSet) {}
  /external/icu/icu4j/main/classes/translit/src/com/ibm/icu/text/
NormalizationTransliterator.java 75 private NormalizationTransliterator(String id, Normalizer2 n2) {
77 norm2 = n2;
  /prebuilts/go/darwin-x86/src/compress/flate/
writer_test.go 83 n2, err := w.Write([]byte{1, 2, 2, 3, 4, 5})
84 if n2 != 0 {
100 n2, err = w.Write([]byte{1, 2, 3, 4, 5, 6})
104 if n2 == 0 {
  /prebuilts/go/darwin-x86/src/compress/gzip/
gzip_test.go 190 n2 := buf.Len()
191 if n1 != n2 {
192 t.Fatalf("after writing a single byte, size changed from %d to %d; want no change", n1, n2)
200 if n2 == n3 {
  /prebuilts/go/darwin-x86/test/
const5.go 25 n2 = len(m[""])
24 n2 = len(m[""]) const
  /prebuilts/go/linux-x86/src/compress/flate/
writer_test.go 83 n2, err := w.Write([]byte{1, 2, 2, 3, 4, 5})
84 if n2 != 0 {
100 n2, err = w.Write([]byte{1, 2, 3, 4, 5, 6})
104 if n2 == 0 {
  /prebuilts/go/linux-x86/src/compress/gzip/
gzip_test.go 190 n2 := buf.Len()
191 if n1 != n2 {
192 t.Fatalf("after writing a single byte, size changed from %d to %d; want no change", n1, n2)
200 if n2 == n3 {
  /prebuilts/go/linux-x86/test/
const5.go 25 n2 = len(m[""])
24 n2 = len(m[""]) const
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/manifest/pages/
ApplicationAttributesPart.java 119 int n2 = (int) Math.ceil(n / 2.0); local
121 AttributeDescriptor attr_desc = attr_desc_list[i / 2 + (i & 1) * n2];
  /system/core/libutils/
Unicode.cpp 325 int strzcmp16(const char16_t *s1, size_t n1, const char16_t *s2, size_t n2)
328 const char16_t* e2 = s2+n2;
337 return n1 < n2
339 : (n1 > n2
344 int strzcmp16_h_n(const char16_t *s1H, size_t n1, const char16_t *s2N, size_t n2)
347 const char16_t* e2 = s2N+n2;
358 return n1 < n2
360 : (n1 > n2
  /dalvik/dexgen/src/com/android/dexgen/dex/code/
InsnFormat.java 442 * @param n2 {@code 0..15;} medium-high nibble
446 protected static short codeUnit(int n0, int n1, int n2, int n3) {
455 if ((n2 & 0xf) != n2) {
456 throw new IllegalArgumentException("n2 out of range 0..15");
463 return (short) (n0 | (n1 << 4) | (n2 << 8) | (n3 << 12));
  /dalvik/dx/src/com/android/dx/dex/code/
InsnFormat.java 497 * @param n2 {@code 0..15;} medium-high nibble
501 protected static short codeUnit(int n0, int n1, int n2, int n3) {
510 if ((n2 & 0xf) != n2) {
511 throw new IllegalArgumentException("n2 out of range 0..15");
518 return (short) (n0 | (n1 << 4) | (n2 << 8) | (n3 << 12));
  /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
TreeWizard.java 351 int n2 = tpattern.getChildCount(); local
352 if ( n1 != n2 ) {
419 int n2 = adaptor.getChildCount(t2); local
420 if ( n1 != n2 ) {

Completed in 2110 milliseconds

1 2 3 4 5 6 78 91011>>