| /external/llvm/test/FrontendC/ |
| 2008-01-11-ChainConsistency.c | 3 void n1(void) { void a(void) { a(); } a(); } function
|
| 2002-09-18-UnionProblem.c | 13 short __udivmodhi4 (char n1, char bm) {
18 rr.s.high = n1;
|
| /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/tests/device/test-gnustl-full/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/tests/device/test-stlport/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...] |
| /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/clang/test/Sema/ |
| attr-section.c | 13 __attribute__((section("NEAR,x"))) int n1; // expected-error {{'section' attribute is not valid on local variables}} local
|
| /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/Source/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/chromium/testing/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/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)
|
| /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/llvm/unittests/VMCore/ |
| MetadataTest.cpp | 90 MDNode *n1 = MDNode::get(Context, V); local
91 Value *const c1 = n1;
94 EXPECT_NE(n1, n2);
96 EXPECT_EQ(n1, n3);
101 EXPECT_EQ(3u, n1->getNumOperands());
102 EXPECT_EQ(s1, n1->getOperand(0));
103 EXPECT_EQ(CI, n1->getOperand(1));
104 EXPECT_EQ(s2, n1->getOperand(2));
107 EXPECT_EQ(n1, n2->getOperand(0));
|
| /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/clang/test/CodeGenCXX/ |
| nested-base-member-access.cpp | 50 N n1; local
51 n1.PR();
|
| /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...] |
