| /external/clang/test/CodeGen/ |
| 2008-01-11-ChainConsistency.c | 3 void n1(void) { void a(void) { a(); } a(); } function
|
| /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/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/chromium/chrome/browser/bookmarks/ |
| bookmark_utils_unittest.cc | 23 const BookmarkNode* n1 = local
36 EXPECT_TRUE(nodes[0] == n1);
38 n1, ASCIIToUTF16("foo"), std::string()));
52 EXPECT_TRUE(nodes[0] == n1);
54 n1, ASCIIToUTF16("foo bar"), std::string()));
|
| /external/openssl/crypto/bn/asm/ |
| ia64-mont.pl | 365 n1=r24; n2=r25; n3=r26; n4=r27; n5=r28; n6=r29; n7=r30; n8=r31;
595 { .mii; (p16) getf.sig n1=nlo[1] // 19:
620 (p16) add a1=a1,n1 } // (p16) a1+=n1
630 { .mfi; (p16) cmp.ltu.unc p42,p40=a1,n1
666 { .mmi; (p0) getf.sig n1=ni0 // 0:
764 sub n1=t0,n1 };;
765 { .mmi; cmp.gtu p34,p32=n1,t0;;
810 { .mmi; (p32)st8 [rptr]=n1,
756 sub n1=t0,n1 };; subroutine
[all...] |
| /external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/ |
| p3-0x.cpp | 43 int n1 = f(i); member in namespace:std_example
|
| /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/v8/test/mjsunit/ |
| object-toprimitive.js | 34 var n1 = Number(o1); variable
36 assertTrue(typeof n1 == "number");
|
| /ndk/sources/host-tools/toolbox/ |
| cmp_win.c | 70 int n1, n2, ret = 0; local
72 n1 = fread(buf1, 1, BUFSIZE, f1);
74 ret = (n1 != n2) || memcmp(buf1, buf2, n1) != 0;
75 } while (!ret && n1 == BUFSIZE);
|
| /sdk/sdkmanager/libs/sdklib/tests/src/com/android/sdklib/util/ |
| BSPatchTest.java | 275 int n1 = a1.length; local
279 for (int i = 0; i < n1; i++) {
281 i+2 < n1 &&
297 for (int i = n1; i < n2; i++) {
|
| /external/clang/test/CodeGenCXX/ |
| nested-base-member-access.cpp | 50 N n1; local
51 n1.PR();
|
| destructor-calls.cpp | 38 N n1; local
|
| /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/objects/ |
| obj_xref.c | 210 int n1, n2, n3; local
223 n1 = sigoid_srt[i][0];
224 rv = OBJ_find_sigid_algs(n1, &n2, &n3);
226 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3));
227 n1=0;
228 rv = OBJ_find_sigid_by_algs(&n1, n2, n3);
230 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3));
|
| /frameworks/base/services/common_time/ |
| common_clock.cpp | 131 uint32_t n1 = local_to_common_freq_numer_; local
137 // n1/d1 has already been reduced, no need to do so here.
138 LinearTransform::reduce(&n1, &d2);
144 cur_trans_.a_to_b_numer = n1 * n2;
|
| /external/bzip2/ |
| huffman.c | 72 Int32 nNodes, nHeap, n1, n2, i, j, k; local
101 n1 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1);
104 parent[n1] = parent[n2] = nNodes;
105 weight[nNodes] = ADDWEIGHTS(weight[n1], weight[n2]);
|
| /external/clang/test/CXX/dcl.dcl/basic.namespace/namespace.def/ |
| p8.cpp | 77 namespace redecl { inline namespace n1 { namespace in namespace:redecl
103 inline namespace n1 { namespace in namespace:redecl2
|
| /external/guava/guava-tests/test/com/google/common/base/ |
| ObjectsTest.java | 67 Long n1 = new Long(42); local
68 Long n2 = Objects.firstNonNull(null, n1);
69 assertSame(n1, n2);
|
| /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) \
323 BN_ULONG n0,n1,rem=0; local
326 n1=wnump[-1];
335 q=(BN_ULONG)(((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0);
337 q=bn_div_words(n0,n1,d0);
341 n0, n1, d0, q)
[all...] |
