| /external/stlport/test/unit/ |
| D | mismatch_test.cpp | 40 int n1[5] = { 1, 2, 3, 4, 5 }; in mismatch0() local
44 pair <int*, int*> result = mismatch((int*)n1, (int*)n1 + 5, (int*)n2); in mismatch0()
45 CPPUNIT_ASSERT(result.first ==(n1 + 5) && result.second ==(n2 + 5)); in mismatch0()
47 result = mismatch((int*)n1, (int*)n1 + 5, (int*)n3); in mismatch0()
48 CPPUNIT_ASSERT(!(result.first ==(n1 + 5) && result.second ==(n3 + 5))); in mismatch0()
49 CPPUNIT_ASSERT((result.first - n1)==3); in mismatch0()
70 char const* n1[size] = { "Brett", "Graham", "Jack", "Mike", "Todd" }; in mismatch2() local
73 copy(n1, n1 + 5, (char const**)n2); in mismatch2()
74 …pair <char const**, char const**> result = mismatch((char const**)n1, (char const**)n1 + size, (ch… in mismatch2()
76 CPPUNIT_ASSERT(result.first == n1 + size && result.second == n2 + size); in mismatch2()
[all …]
|
| D | lexcmp_test.cpp | 34 char n1[size] = "shoe"; in lexcmp1() local
37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size); in lexcmp1()
43 char n1[size] = "shoe"; in lexcmp2() local
46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>()); in lexcmp2()
|
| /external/chromium/base/ |
| D | linked_list_unittest.cc | 75 Node n1(1); in TEST() local
76 list.Append(&n1); in TEST()
78 EXPECT_EQ(&n1, list.head()); in TEST()
79 EXPECT_EQ(&n1, list.tail()); in TEST()
88 EXPECT_EQ(&n1, list.head()); in TEST()
98 EXPECT_EQ(&n1, list.head()); in TEST()
109 Node n1(1); in TEST() local
115 list.Append(&n1); in TEST()
121 EXPECT_EQ(&n1, list.head()); in TEST()
131 EXPECT_EQ(&n1, list.head()); in TEST()
[all …]
|
| /external/libsepol/src/ |
| D | ebitmap.c | 20 ebitmap_node_t *n1, *n2, *new, *prev; in ebitmap_or() local
24 n1 = e1->node; in ebitmap_or()
27 while (n1 || n2) { in ebitmap_or()
34 if (n1 && n2 && n1->startbit == n2->startbit) { in ebitmap_or()
35 new->startbit = n1->startbit; in ebitmap_or()
36 new->map = n1->map | n2->map; in ebitmap_or()
37 n1 = n1->next; in ebitmap_or()
39 } else if (!n2 || (n1 && n1->startbit < n2->startbit)) { in ebitmap_or()
40 new->startbit = n1->startbit; in ebitmap_or()
41 new->map = n1->map; in ebitmap_or()
[all …]
|
| /external/flac/include/share/ |
| D | alloc.h | 30 static inline void *safe_calloc_(size_t n1, size_t n2) in safe_calloc_() argument
33 return calloc(n1, n2); in safe_calloc_()
37 static inline void *safe_malloc_add_2op_(size_t n1, size_t n2) in safe_malloc_add_2op_() argument
39 unsigned long long n = n1 + n2; in safe_malloc_add_2op_()
46 static inline void *safe_malloc_mul_2op_(size_t n1, size_t n2) in safe_malloc_mul_2op_() argument
48 unsigned long long n = n1 * n2; in safe_malloc_mul_2op_()
55 static inline void *safe_malloc_muladd2_(size_t n1, size_t n2, size_t n3) in safe_malloc_muladd2_() argument
57 unsigned long long n = n1 * (n2 + n3); in safe_malloc_muladd2_()
64 static inline void *safe_realloc_mul_2op_(void *ptr, size_t n1, size_t n2) in safe_realloc_mul_2op_() argument
66 unsigned long long n = n1 * n2; in safe_realloc_mul_2op_()
|
| /external/openssl/crypto/lhash/ |
| D | lhash.c | 312 LHASH_NODE **n,**n1,**n2,*np; in expand() local
319 n1= &(lh->b[p]); in expand()
324 for (np= *n1; np != NULL; ) in expand()
334 *n1= (*n1)->next; in expand()
339 n1= &((*n1)->next); in expand()
340 np= *n1; in expand()
368 LHASH_NODE **n,*n1,*np; in contract() local
394 n1=lh->b[(int)lh->p]; in contract()
395 if (n1 == NULL) in contract()
399 while (n1->next != NULL) in contract()
[all …]
|
| /external/dropbear/libtommath/ |
| D | bn_mp_prime_miller_rabin.c | 27 mp_int n1, y, r; in mp_prime_miller_rabin() local
39 if ((err = mp_init_copy (&n1, a)) != MP_OKAY) { in mp_prime_miller_rabin()
42 if ((err = mp_sub_d (&n1, 1, &n1)) != MP_OKAY) { in mp_prime_miller_rabin()
47 if ((err = mp_init_copy (&r, &n1)) != MP_OKAY) { in mp_prime_miller_rabin()
70 if (mp_cmp_d (&y, 1) != MP_EQ && mp_cmp (&y, &n1) != MP_EQ) { in mp_prime_miller_rabin()
73 while ((j <= (s - 1)) && mp_cmp (&y, &n1) != MP_EQ) { in mp_prime_miller_rabin()
87 if (mp_cmp (&y, &n1) != MP_EQ) { in mp_prime_miller_rabin()
96 LBL_N1:mp_clear (&n1); in mp_prime_miller_rabin()
|
| /external/eigen/unsupported/Eigen/src/FFT/ |
| D | ei_fftw_impl.h | 82 void fwd2( complex_type * dst,complex_type * src,int n0,int n1) {
83 …if (m_plan==NULL) m_plan = fftwf_plan_dft_2d(n0,n1,src,dst,FFTW_FORWARD,FFTW_ESTIMATE|FFTW_PRESERV…
87 void inv2( complex_type * dst,complex_type * src,int n0,int n1) {
88 …if (m_plan==NULL) m_plan = fftwf_plan_dft_2d(n0,n1,src,dst,FFTW_BACKWARD,FFTW_ESTIMATE|FFTW_PRESER…
124 void fwd2( complex_type * dst,complex_type * src,int n0,int n1) {
125 …if (m_plan==NULL) m_plan = fftw_plan_dft_2d(n0,n1,src,dst,FFTW_FORWARD,FFTW_ESTIMATE|FFTW_PRESERVE…
129 void inv2( complex_type * dst,complex_type * src,int n0,int n1) {
130 …if (m_plan==NULL) m_plan = fftw_plan_dft_2d(n0,n1,src,dst,FFTW_BACKWARD,FFTW_ESTIMATE|FFTW_PRESERV…
165 void fwd2( complex_type * dst,complex_type * src,int n0,int n1) {
166 …if (m_plan==NULL) m_plan = fftwl_plan_dft_2d(n0,n1,src,dst,FFTW_FORWARD,FFTW_ESTIMATE|FFTW_PRESERV…
[all …]
|
| /external/iproute2/ip/ |
| D | rtmon.c | 34 struct nlmsghdr *n1 = (void*)buf; in write_stamp() local
37 n1->nlmsg_type = 15; in write_stamp()
38 n1->nlmsg_flags = 0; in write_stamp()
39 n1->nlmsg_seq = 0; in write_stamp()
40 n1->nlmsg_pid = 0; in write_stamp()
41 n1->nlmsg_len = NLMSG_LENGTH(4*2); in write_stamp()
43 ((__u32*)NLMSG_DATA(n1))[0] = tv.tv_sec; in write_stamp()
44 ((__u32*)NLMSG_DATA(n1))[1] = tv.tv_usec; in write_stamp()
45 fwrite((void*)n1, 1, NLMSG_ALIGN(n1->nlmsg_len), fp); in write_stamp()
|
| /external/icu4c/samples/uciter8/ |
| D | uciter8.c | 45 compareIterators(UCharIterator *iter1, const char *n1, in compareIterators() argument
54 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2); in compareIterators()
63 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n1, middle, pos1); in compareIterators()
77 … log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle); in compareIterators()
86 …log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter… in compareIterators()
96 …->previous()=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->… in compareIterators()
104 log_err("%s->move(start) failed\n", n1); in compareIterators()
108 log_err("%s->hasNext() at the start returns FALSE\n", n1); in compareIterators()
126 …log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, U… in compareIterators()
132 log_err("%s->hasNext() at the end returns TRUE\n", n1); in compareIterators()
[all …]
|
| /external/llvm/unittests/VMCore/ |
| D | MetadataTest.cpp | 90 MDNode *n1 = MDNode::get(Context, V); in TEST_F() local
91 Value *const c1 = n1; in TEST_F()
98 EXPECT_NE(n1, n2); in TEST_F()
100 EXPECT_EQ(n1, n3); in TEST_F()
104 EXPECT_EQ(n4, n1); in TEST_F()
108 EXPECT_EQ(3u, n1->getNumOperands()); in TEST_F()
109 EXPECT_EQ(s1, n1->getOperand(0)); in TEST_F()
110 EXPECT_EQ(CI, n1->getOperand(1)); in TEST_F()
111 EXPECT_EQ(s2, n1->getOperand(2)); in TEST_F()
114 EXPECT_EQ(n1, n2->getOperand(0)); in TEST_F()
|
| /external/chromium/testing/gtest/samples/ |
| D | sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head(); in MapTester() local
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) { in MapTester()
107 EXPECT_EQ(2 * n1->element(), n2->element()); in MapTester()
|
| /external/gtest/samples/ |
| D | sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head(); in MapTester() local
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) { in MapTester()
107 EXPECT_EQ(2 * n1->element(), n2->element()); in MapTester()
|
| /external/protobuf/gtest/samples/ |
| D | sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head(); in MapTester() local
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) { in MapTester()
107 EXPECT_EQ(2 * n1->element(), n2->element()); in MapTester()
|
| /external/openssl/crypto/bn/ |
| D | bn_div.c | 144 # define bn_div_words(n0,n1,d0) \ argument
148 : "a"(n1), "d"(n0), "g"(d0) \
158 # define bn_div_words(n0,n1,d0) \ argument
162 : "a"(n1), "d"(n0), "g"(d0) \
323 BN_ULONG n0,n1,rem=0; in BN_div() local
326 n1=wnump[-1]; in BN_div()
335 q=(BN_ULONG)(((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0); in BN_div()
337 q=bn_div_words(n0,n1,d0); in BN_div()
341 n0, n1, d0, q); in BN_div()
350 rem=(n1-q*d0)&BN_MASK2; in BN_div()
[all …]
|
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| D | NodeSorter.java | 127 NodeCompareElem n1, NodeCompareElem n2, int kIndex, XPathContext support) in compare() argument
140 n1Num = ((Double) n1.m_key1Value).doubleValue(); in compare()
145 n1Num = ((Double) n1.m_key2Value).doubleValue(); in compare()
159 XObject r1 = k.m_selectPat.execute(m_execContext, n1.m_node, in compare()
174 result = compare(n1, n2, kIndex + 1, support); in compare()
203 n1String = (CollationKey) n1.m_key1Value; in compare()
208 n1String = (CollationKey) n1.m_key2Value; in compare()
222 XObject r1 = k.m_selectPat.execute(m_execContext, n1.m_node, in compare()
260 result = compare(n1, n2, kIndex + 1, support); in compare()
271 DTM dtm = support.getDTM(n1.m_node); // %OPT% in compare()
[all …]
|
| /external/openssl/crypto/objects/ |
| D | obj_xref.c | 210 int n1, n2, n3; in main() local
223 n1 = sigoid_srt[i][0]; in main()
224 rv = OBJ_find_sigid_algs(n1, &n2, &n3); in main()
226 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3)); in main()
227 n1=0; in main()
228 rv = OBJ_find_sigid_by_algs(&n1, n2, n3); in main()
230 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3)); in main()
|
| /external/openssl/crypto/rand/ |
| D | randtest.c | 72 unsigned long n1; in main() local
86 n1=0; in main()
118 if (s) n1++; in main()
126 if (!((9654 < n1) && (n1 < 10346))) in main()
128 printf("test 1 failed, X=%lu\n",n1); in main()
|
| /external/apache-xml/src/main/java/org/apache/xpath/objects/ |
| D | XNodeSet.java | 754 abstract boolean compareNumbers(double n1, double n2); in compareNumbers() argument
787 boolean compareNumbers(double n1, double n2) in compareNumbers() argument
789 return n1 < n2; in compareNumbers()
823 boolean compareNumbers(double n1, double n2) in compareNumbers() argument
825 return n1 <= n2; in compareNumbers()
859 boolean compareNumbers(double n1, double n2) in compareNumbers() argument
861 return n1 > n2; in compareNumbers()
895 boolean compareNumbers(double n1, double n2) in compareNumbers() argument
897 return n1 >= n2; in compareNumbers()
930 boolean compareNumbers(double n1, double n2) in compareNumbers() argument
[all …]
|
| /external/aac/libSYS/include/ |
| D | genericStds.h | 175 #define C_ALLOC_MEM2(name,type,n1,n2) \ argument
176 …type * Get ## name (int n) { FDK_ASSERT((n) < (n2)); return ((type*)FDKcalloc(n1, sizeof(type))); …
178 UINT GetRequiredMem ## name(void) { return ALGN_SIZE_EXTRES((n1) * sizeof(type)) * (n2); }
187 #define C_AALLOC_MEM2(name,type,n1,n2) \ argument
188 …type * Get ## name (int n) { FDK_ASSERT((n) < (n2)); return ((type*)FDKaalloc((n1)*sizeof(type), A…
190 …UINT GetRequiredMem ## name(void) { return ALGN_SIZE_EXTRES((n1) * sizeof(type) + ALIGNMENT_DEFAUL…
199 #define C_ALLOC_MEM2_L(name,type,n1,n2,s) \ argument
200 …type * Get ## name (int n) { FDK_ASSERT((n) < (n2)); return (type*)FDKcalloc_L(n1, sizeof(type), s…
202 UINT GetRequiredMem ## name(void) { return ALGN_SIZE_EXTRES((n1) * sizeof(type)) * (n2); }
211 #define C_AALLOC_MEM2_L(name,type,n1,n2,s) \ argument
[all …]
|
| /external/opencv/cxcore/src/ |
| D | cxsvd.cpp | 247 int nm, m1, n1; in icvSVD_64f() local
263 n1 = n; in icvSVD_64f()
301 memset( temp, 0, n1 * sizeof( temp[0] )); in icvSVD_64f()
304 icvMatrAXPY_64f( m1, n1 - 1, a + 1, lda, hv, temp + 1, 0 ); in icvSVD_64f()
305 for( k = 1; k < n1; k++ ) temp[k] *= h; in icvSVD_64f()
308 icvMatrAXPY_64f( m1, n1 - 1, temp + 1, 0, hv, a + 1, lda ); in icvSVD_64f()
323 n1--; in icvSVD_64f()
327 if( n1 == 0 ) in icvSVD_64f()
331 update_v = vT && n1 > n - nv; in icvSVD_64f()
335 for( j = 0; j < n1; j++ ) in icvSVD_64f()
[all …]
|
| /external/openssl/crypto/ec/ |
| D | ecp_smpl.c | 649 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; in ec_GFp_simple_add() local
672 n1 = BN_CTX_get(ctx); in ec_GFp_simple_add()
688 if (!BN_copy(n1, &a->X)) goto end; in ec_GFp_simple_add()
696 if (!field_mul(group, n1, &a->X, n0, ctx)) goto end; in ec_GFp_simple_add()
724 if (!BN_mod_sub_quick(n5, n1, n3, p)) goto end; in ec_GFp_simple_add()
750 if (!BN_mod_add_quick(n1, n1, n3, p)) goto end; in ec_GFp_simple_add()
776 if (!field_mul(group, n3, n1, n4, ctx)) goto end; in ec_GFp_simple_add()
788 if (!field_mul(group, n1, n2, n5, ctx)) goto end; in ec_GFp_simple_add()
789 if (!BN_mod_sub_quick(n0, n0, n1, p)) goto end; in ec_GFp_simple_add()
813 BIGNUM *n0, *n1, *n2, *n3; in ec_GFp_simple_dbl() local
[all …]
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 128 NodeEntry &n1 = getNode(ne.getNode1()); in addConstructedEdge() local
131 assert((n1.getCosts().getLength() == ne.getCosts().getRows()) && in addConstructedEdge()
134 ne.setNode1AEItr(n1.addEdge(edgeItr)); in addConstructedEdge()
338 NodeEntry &n1 = getNode(e.getNode1()); in removeEdge() local
340 n1.removeEdge(e.getNode1AEItr()); in removeEdge()
372 unsigned n1 = std::distance(nodesBegin(), getEdgeNode1(edgeItr)); in dump() local
374 assert(n1 != n2 && "PBQP graphs shound not have self-edges."); in dump()
376 os << "\n" << n1 << " " << n2 << "\n" in dump()
427 bool operator()(Graph::NodeItr n1, Graph::NodeItr n2) const { in operator()
428 return &*n1 < &*n2; in operator()
[all …]
|
| /external/libvpx/vp8/common/mips/ |
| D | subpixel_mips.c | 128 unsigned int n1, n2, n3; in vp8_filter_block2d_first_pass_4() local
219 [p3] "=&r" (p3), [n1] "=&r" (n1), [n2] "=&r" (n2), in vp8_filter_block2d_first_pass_4()
289 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), in vp8_filter_block2d_first_pass_4()
323 unsigned int n1, n2, n3, n4; in vp8_filter_block2d_first_pass_8_all() local
411 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), in vp8_filter_block2d_first_pass_8_all()
464 [vector2b] "r" (vector2b), [n1] "r" (n1), [p1] "r" (p1), in vp8_filter_block2d_first_pass_8_all()
536 [p3] "=&r" (p3), [p4] "=&r" (p4), [n1] "=&r" (n1), in vp8_filter_block2d_first_pass_8_all()
619 unsigned int n1, n2, n3, n4; in vp8_filter_block2d_first_pass16_6tap() local
681 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), in vp8_filter_block2d_first_pass16_6tap()
736 [tp1] "r" (tp1), [n1] "r" (n1), [p1] "r" (p1), in vp8_filter_block2d_first_pass16_6tap()
[all …]
|
| /external/libvorbis/lib/ |
| D | block.c | 746 int n1=ci->blocksizes[1]>>(hs+1); in vorbis_synthesis_blockin() local
757 thisCenter=n1; in vorbis_synthesis_blockin()
761 prevCenter=n1; in vorbis_synthesis_blockin()
776 for(i=0;i<n1;i++) in vorbis_synthesis_blockin()
777 pcm[i]=pcm[i]*w[n1-i-1] + p[i]*w[i]; in vorbis_synthesis_blockin()
781 float *pcm=v->pcm[j]+prevCenter+n1/2-n0/2; in vorbis_synthesis_blockin()
791 float *p=vb->pcm[j]+n1/2-n0/2; in vorbis_synthesis_blockin()
794 for(;i<n1/2+n0/2;i++) in vorbis_synthesis_blockin()
818 v->centerW=n1; in vorbis_synthesis_blockin()
940 int n1=ci->blocksizes[1]>>(hs+1); in vorbis_synthesis_lapout() local
[all …]
|