Searched defs:n1 (Results 1 - 25 of 125) sorted by relevance

12345

/external/clang/test/CodeGen/
H A D2008-01-11-ChainConsistency.c3 void n1(void) { void a(void) { a(); } a(); } function
H A D2002-09-18-UnionProblem.c13 short __udivmodhi4 (char n1, char bm) { argument
18 rr.s.high = n1;
/external/clang/test/Sema/
H A Dattr-section.c13 __attribute__((section("NEAR,x"))) int n1; // expected-error {{'section' attribute is not valid on local variables}} local
/external/stlport/test/unit/
H A Dlexcmp_test.cpp34 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>());
H A Dmismatch_test.cpp40 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, n
[all...]
/external/chromium/chrome/browser/bookmarks/
H A Dbookmark_utils_unittest.cc23 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()));
H A Dbookmark_index_unittest.cc211 const BookmarkNode* n1 = model_->AddURL(model_->other_node(), 0, local
218 EXPECT_TRUE(matches[0].node == n1);
/external/dropbear/libtommath/
H A Dbn_mp_prime_miller_rabin.c27 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/openssl/crypto/bn/asm/
H A Dia64-mont.pl365 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/dcl.dcl/dcl.attr/dcl.align/
H A Dp5.cpp3 alignas(1) int n1; // expected-error {{requested alignment is less than minimum alignment of 4 for type 'int'}} variable
H A Dp6.cpp3 alignas(4) extern int n1; // expected-note {{previous declaration}}
4 alignas(8) int n1; // expected-error {{redeclaration has different alignment requirement (8 vs 4)}} variable
/external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/
H A Dp3-0x.cpp43 int n1 = f(i); member in namespace:std_example
/external/eigen/test/
H A Dproduct_large.cpp48 std::ptrdiff_t n1 = internal::random<int>(10,100)*16; local
50 internal::computeProductBlockingSizes<float,float>(k1,m1,n1);
/external/flac/include/share/
H A Dalloc.h29 // malloc(n1 * n2) then memset to zero
30 static inline void *safe_calloc_(size_t n1, size_t n2) argument
33 return calloc(n1, n2);
36 // malloc(n1 + n2)
37 static inline void *safe_malloc_add_2op_(size_t n1, size_t n2) argument
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) argument
48 unsigned long long n = n1 * n2;
54 // malloc(n1 * (n
55 safe_malloc_muladd2_(size_t n1, size_t n2, size_t n3) argument
64 safe_realloc_mul_2op_(void *ptr, size_t n1, size_t n2) argument
[all...]
/external/openssl/crypto/rand/
H A Drandtest.c72 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/
H A Dobject-toprimitive.js34 var n1 = Number(o1); variable
36 assertTrue(typeof n1 == "number");
/external/clang/test/CodeGenCXX/
H A Dnested-base-member-access.cpp50 N n1; local
51 n1.PR();
H A Ddestructor-calls.cpp38 N n1; local
/external/apache-xml/src/main/java/org/apache/xalan/transformer/
H A DNodeSorter.java117 * @param n1 First node to use in compare
127 NodeCompareElem n1, NodeCompareElem n2, int kIndex, XPathContext support)
140 n1Num = ((Double) n1.m_key1Value).doubleValue();
145 n1Num = ((Double) n1.m_key2Value).doubleValue();
152 double n1Num = (double)n1.m_keyValue[kIndex];
159 XObject r1 = k.m_selectPat.execute(m_execContext, n1.m_node,
174 result = compare(n1, n2, kIndex + 1, support);
203 n1String = (CollationKey) n1.m_key1Value;
208 n1String = (CollationKey) n1.m_key2Value;
215 String n1String = (String)n1
126 compare( NodeCompareElem n1, NodeCompareElem n2, int kIndex, XPathContext support) argument
[all...]
/external/clang/test/CXX/dcl.dcl/basic.namespace/namespace.def/
H A Dp8.cpp77 namespace redecl { inline namespace n1 { namespace in namespace:redecl
103 inline namespace n1 { namespace in namespace:redecl2
/external/icu4c/samples/uciter8/
H A Duciter8.c45 compareIterators(UCharIterator *iter1, const char *n1, argument
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/iproute2/ip/
H A Drtmon.c34 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
[all...]
/external/bzip2/
H A Dhuffman.c72 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/eigen/bench/
H A Deig33.cpp156 Scalar n1 = evecs.col(1).norm(); local
157 if(n1<=Eigen::NumTraits<Scalar>::epsilon())
160 evecs.col(1) /= n1;
/external/eigen/test/eigen2/
H A Deigen2_hyperplane.cpp33 VectorType n1 = VectorType::Random(dim).normalized(); local
36 HyperplaneType pl1(n1, p1);
42 VERIFY_IS_APPROX( n1.eigen2_dot(n1), Scalar(1) );
45 VERIFY_IS_APPROX( pl1.signedDistance(p1 + n1 * s0), s0 );

Completed in 413 milliseconds

12345