| /frameworks/compile/libbcc/tests/debuginfo/host-tests/ |
| pass-struct.c | 12 // CHECK: $1 = {n = 10, n2 = {20, 21}}
17 int n2[2]; member in struct:int_struct
23 s.n2[1]++;
24 return s.n > s.n2[0] ? s.n : s.n2[0];
32 s.n2[0] = 20;
33 s.n2[1] = 21;
|
| /external/stlport/test/unit/ |
| lexcmp_test.cpp | 35 char n2[size] = "shine"; local
37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size);
44 char n2[size] = "shine"; local
46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>());
|
| mismatch_test.cpp | 41 int n2[5] = { 1, 2, 3, 4, 5 }; local
44 pair <int*, int*> result = mismatch((int*)n1, (int*)n1 + 5, (int*)n2);
45 CPPUNIT_ASSERT(result.first ==(n1 + 5) && result.second ==(n2 + 5));
72 char const* n2[size]; local
73 copy(n1, n1 + 5, (char const**)n2);
74 pair <char const**, char const**> result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal);
76 CPPUNIT_ASSERT(result.first == n1 + size && result.second == n2 + size);
78 n2[2] = "QED";
79 result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal);
80 CPPUNIT_ASSERT(!(result.first == n2 + size && result.second == n2 + size))
[all...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| lexcmp_test.cpp | 35 char n2[size] = "shine"; local
37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size);
44 char n2[size] = "shine"; local
46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>());
|
| mismatch_test.cpp | 41 int n2[5] = { 1, 2, 3, 4, 5 }; local
44 pair <int*, int*> result = mismatch((int*)n1, (int*)n1 + 5, (int*)n2);
45 CPPUNIT_ASSERT(result.first ==(n1 + 5) && result.second ==(n2 + 5));
72 char const* n2[size]; local
73 copy(n1, n1 + 5, (char const**)n2);
74 pair <char const**, char const**> result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal);
76 CPPUNIT_ASSERT(result.first == n1 + size && result.second == n2 + size);
78 n2[2] = "QED";
79 result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal);
80 CPPUNIT_ASSERT(!(result.first == n2 + size && result.second == n2 + size))
[all...] |
| /ndk/tests/device/test-stlport/unit/ |
| lexcmp_test.cpp | 35 char n2[size] = "shine"; local
37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size);
44 char n2[size] = "shine"; local
46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>());
|
| mismatch_test.cpp | 41 int n2[5] = { 1, 2, 3, 4, 5 }; local
44 pair <int*, int*> result = mismatch((int*)n1, (int*)n1 + 5, (int*)n2);
45 CPPUNIT_ASSERT(result.first ==(n1 + 5) && result.second ==(n2 + 5));
72 char const* n2[size]; local
73 copy(n1, n1 + 5, (char const**)n2);
74 pair <char const**, char const**> result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal);
76 CPPUNIT_ASSERT(result.first == n1 + size && result.second == n2 + size);
78 n2[2] = "QED";
79 result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal);
80 CPPUNIT_ASSERT(!(result.first == n2 + size && result.second == n2 + size))
[all...] |
| /external/flac/include/share/ |
| alloc.h | 29 // malloc(n1 * n2) then memset to zero
30 static inline void *safe_calloc_(size_t n1, size_t n2)
33 return calloc(n1, n2);
36 // malloc(n1 + n2)
37 static inline void *safe_malloc_add_2op_(size_t n1, size_t n2)
39 unsigned long long n = n1 + n2;
45 // malloc(n1 * n2)
46 static inline void *safe_malloc_mul_2op_(size_t n1, size_t n2)
48 unsigned long long n = n1 * n2;
54 // malloc(n1 * (n2 + n3)
[all...] |
| /external/libutf/ |
| utfutf.c | 29 long f, n1, n2; local
37 n2 = strlen(s2);
39 if(strncmp(p, s2, n2) == 0)
|
| /external/libcxx/test/localization/locales/locale/locale.operators/ |
| eq.pass.cpp | 24 std::locale n2(LOCALE_en_US_UTF_8);
32 assert(cloc != n2);
40 assert(copy != n2);
48 assert(n1 == n2);
53 assert(n2 != cloc);
54 assert(n2 != copy);
55 assert(n2 == n1);
56 assert(n2 == n2);
57 assert(n2 != noname1)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/localization/locales/locale/locale.operators/ |
| eq.pass.cpp | 24 std::locale n2(LOCALE_en_US_UTF_8);
32 assert(cloc != n2);
40 assert(copy != n2);
48 assert(n1 == n2);
53 assert(n2 != cloc);
54 assert(n2 != copy);
55 assert(n2 == n1);
56 assert(n2 == n2);
57 assert(n2 != noname1)
[all...] |
| /external/chromium_org/third_party/smhasher/src/ |
| Stats.cpp | 77 double n2 = n * 1; local
79 if(n2 < 0) n2 = 0;
81 n2 *= 100;
83 if(n2 > 64) n2 = 64;
85 int n3 = (int)n2;
|
| /ndk/sources/android/support/src/musl-multibyte/ |
| mbsnrtowcs.c | 11 size_t l, cnt=0, n2; local
22 while ( s && wn && ( (n2=n/4)>=wn || n2>32 ) ) {
23 if (n2>=wn) n2=wn;
24 n -= n2;
25 l = mbsrtowcs(ws, &s, n2, st);
|
| wcsnrtombs.c | 11 size_t l, cnt=0, n2; local
18 while ( ws && n && ( (n2=wn)>=n || n2>32 ) ) {
19 if (n2>=n) n2=n;
20 wn -= n2;
21 l = wcsrtombs(s, &ws, n2, 0);
|
| /external/clang/test/SemaCXX/ |
| pr18284-crash-on-invalid.cpp | 15 namespace n2 { namespace
24 } // namespace n2
|
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| SystemTest.java | 32 long n2 = System.nanoTime(); local
36 long nanos = n2 - n1;
54 long n2 = System.nanoTime(); local
56 long nanos = n2 - n1;
|
| /external/chromium_org/third_party/openssl/openssl/crypto/bn/ |
| bn_mul.c | 382 /* r is 2*n2 words in size,
383 * a and b are both n2 words in size.
384 * n2 must be a power of 2.
386 * t must be 2*n2 words in size
392 /* dnX may not be positive, but n2/2+dnX has to be */
393 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
396 int n=n2/2,c1,c2;
402 fprintf(stderr," bn_mul_recursive %d%+d * %d%+d\n",n2,dna,n2,dnb);
406 if (n2 == 4
553 int i,j,n2=n*2; local
[all...] |
| bn_sqr.c | 206 void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t)
208 int n=n2/2;
213 fprintf(stderr," bn_sqr_recursive %d * %d\n",n2,n2);
215 if (n2 == 4)
224 else if (n2 == 8)
233 if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL)
235 bn_sqr_normal(r,a,n2,t);
249 p= &(t[n2*2]);
252 bn_sqr_recursive(&(t[n2]),t,n,p)
[all...] |
| /external/openssl/crypto/bn/ |
| bn_mul.c | 382 /* r is 2*n2 words in size,
383 * a and b are both n2 words in size.
384 * n2 must be a power of 2.
386 * t must be 2*n2 words in size
392 /* dnX may not be positive, but n2/2+dnX has to be */
393 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
396 int n=n2/2,c1,c2;
402 fprintf(stderr," bn_mul_recursive %d%+d * %d%+d\n",n2,dna,n2,dnb);
406 if (n2 == 4
553 int i,j,n2=n*2; local
[all...] |
| bn_sqr.c | 206 void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t)
208 int n=n2/2;
213 fprintf(stderr," bn_sqr_recursive %d * %d\n",n2,n2);
215 if (n2 == 4)
224 else if (n2 == 8)
233 if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL)
235 bn_sqr_normal(r,a,n2,t);
249 p= &(t[n2*2]);
252 bn_sqr_recursive(&(t[n2]),t,n,p)
[all...] |
| /external/chromium_org/third_party/icu/source/common/ |
| unorm.cpp | 51 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
52 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
59 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
61 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode));
66 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
74 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
75 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
82 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
84 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode));
89 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode)
101 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
122 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
223 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
[all...] |
| /external/icu/icu4c/source/common/ |
| unorm.cpp | 51 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
52 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
59 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
61 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode));
66 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
74 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
75 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
82 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
84 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode));
89 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode)
101 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
182 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
266 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
[all...] |
| /external/bzip2/ |
| bzmore | 16 n1=''; n2='\c'
18 n1='-n'; n2=''
44 echo $n1 "--More--(Next file: $FILE)$n2"
|
| /external/chromium_org/base/containers/ |
| linked_list_unittest.cc | 85 Node n2(2);
86 list.Append(&n2);
89 EXPECT_EQ(&n2, list.tail());
110 Node n2(2);
116 list.Append(&n2);
151 EXPECT_EQ(&n2, list.head());
159 n2.RemoveFromList();
168 list.Append(&n2);
185 Node n2(2);
190 list.Append(&n2);
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/rand/ |
| randtest.c | 73 unsigned long n2[16]; local
87 for (i=0; i<16; i++) n2[i]=0;
97 n2[j&0x0f]++;
98 n2[(j>>4)&0x0f]++;
137 d+=n2[i]*n2[i];
147 d+=n2[i]*n2[i];
|
