| /external/stlport/test/unit/ |
| lexcmp_test.cpp | 34 char n1[size] = "shoe"; local
37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size);
43 char n1[size] = "shoe"; local
46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>());
|
| mismatch_test.cpp | 40 int n1[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));
47 result = mismatch((int*)n1, (int*)n1 + 5, (int*)n3);
48 CPPUNIT_ASSERT(!(result.first ==(n1 + 5) && result.second ==(n3 + 5)));
49 CPPUNIT_ASSERT((result.first - n1)==3);
70 char const* n1[size] = { "Brett", "Graham", "Jack", "Mike", "Todd" }; local
73 copy(n1, n1 + 5, (char const**)n2)
[all...] |
| /ndk/sources/android/stlport/test/unit/ |
| lexcmp_test.cpp | 34 char n1[size] = "shoe"; local
37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size);
43 char n1[size] = "shoe"; local
46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>());
|
| mismatch_test.cpp | 40 int n1[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));
47 result = mismatch((int*)n1, (int*)n1 + 5, (int*)n3);
48 CPPUNIT_ASSERT(!(result.first ==(n1 + 5) && result.second ==(n3 + 5)));
49 CPPUNIT_ASSERT((result.first - n1)==3);
70 char const* n1[size] = { "Brett", "Graham", "Jack", "Mike", "Todd" }; local
73 copy(n1, n1 + 5, (char const**)n2)
[all...] |
| /libcore/luni/src/test/java/libcore/java/net/ |
| OldNetPermissionTest.java | 26 NetPermission n1 = new NetPermission("requestPasswordAuthentication", ""); local
27 assertEquals("", n1.getActions());
|
| /external/dropbear/libtommath/ |
| bn_mp_prime_miller_rabin.c | 27 mp_int n1, y, r; local
38 /* get n1 = a - 1 */
39 if ((err = mp_init_copy (&n1, a)) != MP_OKAY) {
42 if ((err = mp_sub_d (&n1, 1, &n1)) != MP_OKAY) {
46 /* set 2**s * r = n1 */
47 if ((err = mp_init_copy (&r, &n1)) != MP_OKAY) {
69 /* if y != 1 and y != n1 do */
70 if (mp_cmp_d (&y, 1) != MP_EQ && mp_cmp (&y, &n1) != MP_EQ) {
72 /* while j <= s-1 and y != n1 */
[all...] |
| /external/webkit/JavaScriptCore/tests/mozilla/ecma_3/NumberFormatting/ |
| tostring-001.js | 30 var n1 = 5e22;
37 reportCompare ("5e+22", n1.toString(), "5e22 toString()");
|
| /external/chromium/base/ |
| linked_list_unittest.cc | 75 Node n1(1);
76 list.Append(&n1);
78 EXPECT_EQ(&n1, list.head());
79 EXPECT_EQ(&n1, list.tail());
88 EXPECT_EQ(&n1, list.head());
98 EXPECT_EQ(&n1, list.head());
109 Node n1(1);
115 list.Append(&n1);
121 EXPECT_EQ(&n1, list.head());
131 EXPECT_EQ(&n1, list.head())
[all...] |
| /external/gtest/samples/ |
| sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
|
| /external/protobuf/gtest/samples/ |
| sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
|
| /libcore/luni/src/main/java/org/apache/harmony/security/provider/crypto/ |
| SHA1withDSA_SignatureImpl.java | 125 int n1; local
137 n1 = p.bitLength();
138 if (p.compareTo(BigInteger.valueOf(1)) != 1 || n1 < 512 || n1 > 1024 || (n1 & 077) != 0) {
201 int n, n1, n2; local
245 n1 = rBytes.length;
247 n1++;
255 signature = new byte[6 + n1 + n2]; // 48 is max. possible length of signature
257 signature[1] = (byte) (4 + n1 + n2); // total length of two INTEGER
323 int n1, n2; local
[all...] |
| /external/bzip2/ |
| bzmore | 16 n1=''; n2='\c'
18 n1='-n'; n2=''
44 echo $n1 "--More--(Next file: $FILE)$n2"
|
| /external/openssl/crypto/lhash/ |
| lhash.c | 312 LHASH_NODE **n,**n1,**n2,*np; local
319 n1= &(lh->b[p]);
324 for (np= *n1; np != NULL; )
334 *n1= (*n1)->next;
339 n1= &((*n1)->next);
340 np= *n1;
368 LHASH_NODE **n,*n1,*np; local
394 n1=lh->b[(int)lh->p]
407 LHASH_NODE **ret,*n1; local
[all...] |
| /external/elfutils/libelf/ |
| elf32_fsize.c | 58 #define local_strong_alias(n1, n2) strong_alias (n1, n2)
|
| /libcore/luni/src/test/java/tests/api/java/util/concurrent/ |
| SystemTest.java | 33 long n1 = System.nanoTime(); local
39 long nanos = n2 - n1;
51 long n1 = System.nanoTime(); local
59 long nanos = n2 - n1;
|
| /external/iproute2/ip/ |
| rtmon.c | 34 struct nlmsghdr *n1 = (void*)buf; local
37 n1->nlmsg_type = 15;
38 n1->nlmsg_flags = 0;
39 n1->nlmsg_seq = 0;
40 n1->nlmsg_pid = 0;
41 n1->nlmsg_len = NLMSG_LENGTH(4*2);
43 ((__u32*)NLMSG_DATA(n1))[0] = tv.tv_sec;
44 ((__u32*)NLMSG_DATA(n1))[1] = tv.tv_usec;
45 fwrite((void*)n1, 1, NLMSG_ALIGN(n1->nlmsg_len), fp)
[all...] |
| /external/openssl/crypto/rand/ |
| randtest.c | 72 unsigned long n1; local
86 n1=0;
118 if (s) n1++;
126 if (!((9654 < n1) && (n1 < 10346)))
128 printf("test 1 failed, X=%lu\n",n1);
|
| /external/icu4c/samples/uciter8/ |
| uciter8.c | 45 compareIterators(UCharIterator *iter1, const char *n1,
54 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2);
63 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n1, middle, pos1);
77 log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle);
86 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
96 log_err("%s->previous()=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
104 log_err("%s->move(start) failed\n", n1);
108 log_err("%s->hasNext() at the start returns FALSE\n", n1);
126 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
132 log_err("%s->hasNext() at the end returns TRUE\n", n1);
[all...] |
| /external/bluetooth/glib/glib/ |
| gtestutils.h | 40 #define g_assert_cmpint(n1, cmp, n2) do { gint64 __n1 = (n1), __n2 = (n2); \
43 #n1 " " #cmp " " #n2, __n1, #cmp, __n2, 'i'); } while (0)
44 #define g_assert_cmpuint(n1, cmp, n2) do { guint64 __n1 = (n1), __n2 = (n2); \
47 #n1 " " #cmp " " #n2, __n1, #cmp, __n2, 'i'); } while (0)
48 #define g_assert_cmphex(n1, cmp, n2) do { guint64 __n1 = (n1), __n2 = (n2); \
51 #n1 " " #cmp " " #n2, __n1, #cmp, __n2, 'x'); } while (0)
52 #define g_assert_cmpfloat(n1,cmp,n2) do { long double __n1 = (n1), __n2 = (n2);
[all...] |
| /external/openssl/crypto/objects/ |
| obj_xref.c | 207 int n1, n2, n3; local
220 n1 = sigoid_srt[i][0];
221 rv = OBJ_find_sigid_algs(n1, &n2, &n3);
223 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3));
224 n1=0;
225 rv = OBJ_find_sigid_by_algs(&n1, n2, n3);
227 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3));
|
| /system/core/sh/ |
| parser.c | 152 union node *n1, *n2, *n3; local
158 n1 = NULL;
175 if (n1 == NULL) {
176 n1 = n2;
181 n3->nbinary.ch1 = n1;
183 n1 = n3;
194 return n1;
200 return n1;
207 return n1;
212 return n1;
222 union node *n1, *n2, *n3; local
249 union node *n1, *n2, *pipenode; local
290 union node *n1, *n2; local
[all...] |
| /frameworks/base/media/libstagefright/codecs/aacdec/ |
| fft_rx4_long.cpp | 198 Int n1; local
236 n1 = n2;
239 for (i = 0; i < FFT_RX4_LONG; i += n1)
242 pData2 = pData1 + n1;
250 pData3 = pData1 + (n1 >> 1);
251 pData4 = pData3 + n1;
293 for (i = j; i < FFT_RX4_LONG; i += n1)
296 pData2 = pData1 + n1;
304 pData3 = pData1 + (n1 >> 1);
305 pData4 = pData3 + n1;
[all...] |
| fft_rx4_short.cpp | 196 Int n1; local
253 n1 = n2;
255 n3 = n1 >> 1;
259 for (i = 0; i < FFT_RX4_SHORT; i += n1)
263 pData2 = pData1 + n1;
264 pData4 = pData3 + n1;
320 for (i = j; i < FFT_RX4_SHORT; i += n1)
324 pData2 = pData1 + n1;
325 pData4 = pData3 + n1;
|
| /external/tremolo/Tremolo/ |
| mdct.h | 59 extern void mdct_unroll_lap(int n0,int n1,
|
| /external/openssl/crypto/bn/ |
| bn_div.c | 137 * in reply to ((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0 (I fail to
144 # define bn_div_words(n0,n1,d0) \
148 : "a"(n1), "d"(n0), "g"(d0) \
158 # define bn_div_words(n0,n1,d0) \
162 : "a"(n1), "d"(n0), "g"(d0) \
299 BN_ULONG n0,n1,rem=0; local
302 n1=wnump[-1];
311 q=(BN_ULONG)(((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0);
313 q=bn_div_words(n0,n1,d0);
317 n0, n1, d0, q)
526 BN_ULONG n0,n1,rem=0; local
[all...] |
