HomeSort by relevance Sort by last modified time
    Searched defs:n1 (Results 1 - 25 of 206) sorted by null

1 2 3 4 5 6 7 8 9

  /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/chromium_org/third_party/openssl/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/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...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/
splice_after_flist.pass.cpp 31 int n1 = 0; local
32 for (; n1 < p; ++n1, ++i)
33 assert(*i == t1[n1]);
36 for (; n1 < size_t1; ++n1, ++i)
37 assert(*i == t1[n1]);
splice_after_one.pass.cpp 31 int n1 = 0; local
32 for (; n1 < p; ++n1, ++i)
33 assert(*i == t1[n1]);
36 for (; n1 < size_t1; ++n1, ++i)
37 assert(*i == t1[n1]);
splice_after_range.pass.cpp 32 int n1 = 0; local
33 for (; n1 < p; ++n1, ++i)
34 assert(*i == t1[n1]);
37 for (; n1 < size_t1; ++n1, ++i)
38 assert(*i == t1[n1]);
  /external/chromium_org/chrome/browser/bookmarks/
bookmark_expanded_state_tracker_unittest.cc 62 const BookmarkNode* n1 = model->AddFolder(model->bookmark_bar_node(), 0, local
64 nodes.insert(n1);
70 nodes.erase(n1);
71 n1 = NULL;
80 const BookmarkNode* n1 = local
83 nodes.insert(n1);
bookmark_utils_unittest.cc 32 const BookmarkNode* n1 = model.AddURL(model.other_node(), local
47 EXPECT_TRUE(nodes[0] == n1);
48 EXPECT_TRUE(DoesBookmarkContainText(n1, ASCIIToUTF16("foo"), string()));
61 EXPECT_TRUE(nodes[0] == n1);
62 EXPECT_TRUE(DoesBookmarkContainText(n1, ASCIIToUTF16("foo bar"), string()));
  /external/chromium_org/third_party/openssl/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/chromium_org/v8/test/mjsunit/
object-toprimitive.js 34 var n1 = Number(o1); variable
36 assertTrue(typeof n1 == "number");
  /external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.align/
p5.cpp 3 alignas(1) int n1; // expected-error {{requested alignment is less than minimum alignment of 4 for type 'int'}} variable
  /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/eigen/test/
product_large.cpp 48 std::ptrdiff_t n1 = internal::random<int>(10,100)*16; local
50 internal::computeProductBlockingSizes<float,float>(k1,m1,n1);
  /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);
  /external/chromium_org/third_party/openssl/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));

Completed in 771 milliseconds

1 2 3 4 5 6 7 8 9