| /external/mksh/src/ |
| D | jobs.c | 208 Job *j; in j_exit() local
211 for (j = job_list; j != NULL; j = j->next) { in j_exit()
212 if (j->ppid == procpid && in j_exit()
213 (j->state == PSTOPPED || in j_exit()
214 (j->state == PRUNNING && in j_exit()
215 ((j->flags & JF_FG) || in j_exit()
218 if (j->pgrp == 0) in j_exit()
219 kill_job(j, SIGHUP); in j_exit()
221 mksh_killpg(j->pgrp, SIGHUP); in j_exit()
223 if (j->state == PSTOPPED) { in j_exit()
[all …]
|
| /external/opencv/cv/src/ |
| D | cvutils.cpp | 116 int i, j; in icvCopyReplicateBorder_8u() local
166 for( j = 0; j < srcroi.width; j++ ) in icvCopyReplicateBorder_8u()
167 idst[j + left] = isrc[j]; in icvCopyReplicateBorder_8u()
168 for( j = left - 1; j >= 0; j-- ) in icvCopyReplicateBorder_8u()
169 idst[j] = idst[j + cn]; in icvCopyReplicateBorder_8u()
170 for( j = left+srcroi.width; j < dstroi.width; j++ ) in icvCopyReplicateBorder_8u()
171 idst[j] = idst[j - cn]; in icvCopyReplicateBorder_8u()
185 for( j = 0; j < srcroi.width; j++ ) in icvCopyReplicateBorder_8u()
186 dst[j + left] = src[j]; in icvCopyReplicateBorder_8u()
187 for( j = left - 1; j >= 0; j-- ) in icvCopyReplicateBorder_8u()
[all …]
|
| D | cvdistransform.cpp | 49 int i, j; in icvInitTopBottom() local
55 for( j = 0; j < size.width + border*2; j++ ) in icvInitTopBottom()
57 ttop[j] = ICV_INIT_DIST0; in icvInitTopBottom()
58 tbottom[j] = ICV_INIT_DIST0; in icvInitTopBottom()
71 int i, j; in icvDistanceTransform_3x3_C1R() local
88 for( j = 0; j < BORDER; j++ ) in icvDistanceTransform_3x3_C1R()
89 tmp[-j-1] = tmp[size.width + j] = ICV_INIT_DIST0; in icvDistanceTransform_3x3_C1R()
91 for( j = 0; j < size.width; j++ ) in icvDistanceTransform_3x3_C1R()
93 if( !s[j] ) in icvDistanceTransform_3x3_C1R()
94 tmp[j] = 0; in icvDistanceTransform_3x3_C1R()
[all …]
|
| /external/v8/test/mjsunit/ |
| D | constant-folding.js | 83 var j = 3;
85 assertTrue( j < i );
86 i = 5; j = 3;
87 assertTrue( j <= i );
88 i = 5; j = 3;
89 assertTrue( i > j );
90 i = 5; j = 3;
91 assertTrue( i >= j );
92 i = 5; j = 3;
93 assertTrue( i != j );
[all …]
|
| D | array-pop.js | 71 for (var j = 9; j >= 0; j--) {
72 assertEquals(j + 1, a.length, "inherit-pre-length-" + j);
73 assertTrue(j in a, "has property " + j);
74 var own = a.hasOwnProperty(j);
75 var inherited = Array.prototype.hasOwnProperty(j);
76 assertEquals(j, a.pop(), "inherit-pop");
77 assertEquals(j, a.length, "inherit-post-length");
78 assertFalse(a.hasOwnProperty(j), "inherit-deleted-own-" + j);
79 assertEquals(inherited, Array.prototype.hasOwnProperty(j),
80 "inherit-not-deleted-inherited" + j);
[all …]
|
| /external/bluetooth/glib/tests/ |
| D | slice-threadinit.c | 55 guint i, j, n_trials = N_PAGES * PAGE_SIZE / SAMPLE_SIZE; /* upper bound */ in allocate_from_known_page() local
62 for (j = 0; j < N_PAGES; j++) in allocate_from_known_page()
63 if (pages[j].page == p) in allocate_from_known_page()
73 int j, n_pages = 0; in main() local
77 for (j = 0; j < N_MAGAZINE_PROBES; j++) in main()
78 mps[j] = g_slice_alloc (magazine_probes[j]); in main()
86 for (j = 0; j < N_PAGES; j++) in main()
87 if (pages[j].page == p) in main()
89 if (j < N_PAGES) /* known page */ in main()
93 j = n_pages++; in main()
[all …]
|
| /external/opencv/cxcore/src/ |
| D | cxsvd.cpp | 68 int i, j; in icvMatrAXPY_64f() local
74 for( j = 0; j <= n - 4; j += 4 ) in icvMatrAXPY_64f()
76 double t0 = y[j] + s*x[j]; in icvMatrAXPY_64f()
77 double t1 = y[j+1] + s*x[j+1]; in icvMatrAXPY_64f()
78 y[j] = t0; in icvMatrAXPY_64f()
79 y[j+1] = t1; in icvMatrAXPY_64f()
80 t0 = y[j+2] + s*x[j+2]; in icvMatrAXPY_64f()
81 t1 = y[j+3] + s*x[j+3]; in icvMatrAXPY_64f()
82 y[j+2] = t0; in icvMatrAXPY_64f()
83 y[j+3] = t1; in icvMatrAXPY_64f()
[all …]
|
| /external/webrtc/src/modules/audio_processing/utility/ |
| D | fft4g.c | 371 int j, nw, nc; in ddct() local
386 for (j = n - 2; j >= 2; j -= 2) { in ddct()
387 a[j + 1] = a[j] - a[j - 1]; in ddct()
388 a[j] += a[j - 1]; in ddct()
411 for (j = 2; j < n; j += 2) { in ddct()
412 a[j - 1] = a[j] - a[j + 1]; in ddct()
413 a[j] += a[j + 1]; in ddct()
430 int j, nw, nc; in ddst() local
445 for (j = n - 2; j >= 2; j -= 2) { in ddst()
446 a[j + 1] = -a[j] - a[j - 1]; in ddst()
[all …]
|
| /external/speex/libspeex/ |
| D | cb_search.c | 55 int i, j, k; in compute_weighted_codebook() local
68 for(j=0;j<subvect_size;j++) in compute_weighted_codebook()
72 for (k=0;k<=j;k++) in compute_weighted_codebook()
73 resj = MAC16_16(resj,shape[k],r[j-k]); in compute_weighted_codebook()
81 res[j] = res16; in compute_weighted_codebook()
115 int i,j,m,q; in split_cb_search_shape_sign_N1() local
187 for (j=0;j<subvect_size;j++) in split_cb_search_shape_sign_N1()
188 e[subvect_size*i+j]=SHL32(EXTEND32(shape_cb[rind*subvect_size+j]),SIG_SHIFT-5); in split_cb_search_shape_sign_N1()
190 for (j=0;j<subvect_size;j++) in split_cb_search_shape_sign_N1()
191 … e[subvect_size*i+j]=NEG32(SHL32(EXTEND32(shape_cb[rind*subvect_size+j]),SIG_SHIFT-5)); in split_cb_search_shape_sign_N1()
[all …]
|
| /external/clang/test/CodeGen/ |
| D | switch.c | 4 int j = 0; in foo() local
7 j = 1; break; in foo()
9 j = 2; break; in foo()
11 j = 3; break; in foo()
13 j = 42; break; in foo()
15 j = j + 1; in foo()
16 return j; in foo()
20 int j = 0; in foo2() local
23 j = 2; break; in foo2()
25 j = 3; break; in foo2()
[all …]
|
| /external/valgrind/main/VEX/priv/ |
| D | host_generic_reg_alloc2.c | 245 Int i, j, h, bigN, hp; in sortRRLRarray() local
261 j = i; in sortRRLRarray()
262 while (arr[j-h].live_after > v.live_after) { in sortRRLRarray()
263 arr[j] = arr[j-h]; in sortRRLRarray()
264 j = j - h; in sortRRLRarray()
265 if (j <= (lo + h - 1)) break; in sortRRLRarray()
267 arr[j] = v; in sortRRLRarray()
277 j = i; in sortRRLRarray()
278 while (arr[j-h].dead_before > v.dead_before) { in sortRRLRarray()
279 arr[j] = arr[j-h]; in sortRRLRarray()
[all …]
|
| /external/webrtc/src/modules/audio_processing/aec/main/source/ |
| D | aec_rdft.c | 32 int j, j1, k, k1, m, m2; in bitrv2_32or128() local
41 for (j = 0; j < m; j++) { in bitrv2_32or128()
42 ip[m + j] = ip[j] + l; in bitrv2_32or128()
49 for (j = 0; j < k; j++) { in bitrv2_32or128()
50 j1 = 2 * j + ip[k]; in bitrv2_32or128()
51 k1 = 2 * k + ip[j]; in bitrv2_32or128()
106 int j, nwh; in makewt_32() local
117 for (j = 2; j < nwh; j += 2) { in makewt_32()
118 x = cosf(delta * j); in makewt_32()
119 y = sinf(delta * j); in makewt_32()
[all …]
|
| /external/openssl/apps/ |
| D | speed.c | 340 int i,j,k; in MAIN() local
669 j=0; in MAIN()
677 j--; /* Otherwise, -elapsed gets confused with in MAIN()
704 j--; /* Otherwise, -elapsed gets confused with in MAIN()
722 j--; in MAIN()
741 j--; /* Otherwise, -mr gets confused with in MAIN()
748 j--; /* Otherwise, -mr gets confused with in MAIN()
829 j--; in MAIN()
837 j--; in MAIN()
1120 j++; in MAIN()
[all …]
|
| /external/valgrind/main/drd/tests/ |
| D | omp_matinv.c | 60 int i, j; in init_matrix() local
63 for (j = 0; j < rows; j++) in init_matrix()
65 a[i * cols + j] = 1.0 / (1 + abs(i-j)); in init_matrix()
74 int i, j; in print_matrix() local
78 for (j = 0; j < cols; j++) in print_matrix()
80 printf("%g ", a[i * cols + j]); in print_matrix()
102 int i, j; in copy_matrix() local
111 for (j = from_col_first; j < from_col_last; j++) in copy_matrix()
113 assert(j < from_cols); in copy_matrix()
114 assert(j - from_col_first + to_col_first < to_cols); in copy_matrix()
[all …]
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| D | StylesheetComposed.java | 94 for (int j = 0; j < s; j++) in recompose()
96 recomposableElements.addElement(included.getOutput(j)); in recompose()
102 for (int j = 0; j < s; j++) in recompose()
104 recomposableElements.addElement(included.getAttributeSet(j)); in recompose()
110 for (int j = 0; j < s; j++) in recompose()
112 recomposableElements.addElement(included.getDecimalFormat(j)); in recompose()
118 for (int j = 0; j < s; j++) in recompose()
120 recomposableElements.addElement(included.getKey(j)); in recompose()
126 for (int j = 0; j < s; j++) in recompose()
128 recomposableElements.addElement(included.getNamespaceAlias(j)); in recompose()
[all …]
|
| /external/webkit/Source/WebCore/xml/ |
| D | XSLTUnicodeSort.cpp | 85 int i, j, incr; in xsltUnicodeSortFunction() local
105 for (j = 0; j < nbsorts; j++) { in xsltUnicodeSortFunction()
106 comp = static_cast<xsltStylePreComp*>(sorts[j]->psvi); in xsltUnicodeSortFunction()
107 tempstype[j] = 0; in xsltUnicodeSortFunction()
110 xsltEvalAttrValueTemplate(ctxt, sorts[j], in xsltUnicodeSortFunction()
114 tempstype[j] = 1; in xsltUnicodeSortFunction()
120 xsltTransformError(ctxt, NULL, sorts[j], in xsltUnicodeSortFunction()
127 temporder[j] = 0; in xsltUnicodeSortFunction()
129 comp->order = xsltEvalAttrValueTemplate(ctxt, sorts[j], in xsltUnicodeSortFunction()
133 temporder[j] = 1; in xsltUnicodeSortFunction()
[all …]
|
| /external/gtest/include/gtest/internal/ |
| D | gtest-param-util-generated.h.pump | 72 $range j 1..i
74 template <$for j, [[typename T$j]]>
77 ValueArray$i($for j, [[T$j v$j]]) : $for j, [[v$(j)_(v$j)]] {}
81 const T array[] = {$for j, [[v$(j)_]]};
86 $for j [[
88 const T$j v$(j)_;
103 $range j 1..i
106 template <$for j, [[typename T$j]]>
108 : public ParamGeneratorInterface< ::std::tr1::tuple<$for j, [[T$j]]> > {
110 typedef ::std::tr1::tuple<$for j, [[T$j]]> ParamType;
[all …]
|
| /external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/provider/crypto/ |
| D | SHA1_MessageDigestTest.java | 182 for ( int j = 0; j < b.length; j++ ) { in testDigest01()
183 b[j] = (byte) j; in testDigest01()
208 for ( int j = 0; j < LENGTHS[n]; j++ ) { in testDigest02()
209 md.update((byte)(j +1)); in testDigest02()
213 for ( int j = 0; j < DIGESTLENGTH; j++ ) { in testDigest02()
214 assertEquals("results[j] != HASHTOCOMPARE[i][j] :: n=" + n + " j=" + j + in testDigest02()
215 " i=" + i, results[j], HASHTOCOMPARE[i][j]); in testDigest02()
233 for ( int j = 0; j < b.length; j++ ) { in testDigest03()
234 b[j] = (byte) j; in testDigest03()
244 for (int j = 0; j < DIGESTLENGTH ; j++ ) { in testDigest03()
[all …]
|
| /external/openssl/crypto/bn/asm/ |
| D | s390x-mont.pl | 47 $j="%r7";
78 lcgr $j,$num # -$num
81 la $sp,0($j,$rp) # alloca
85 la $bp,0($j,$bp) # restore $bp
103 la $j,8(%r0) # j=1
108 lg $alo,0($j,$ap)
114 lg $nlo,0($j,$np)
122 stg $nlo,160-8($j,$sp) # tp[j-1]=
123 la $j,8($j) # j++
129 stg $NHI,160-8($j,$sp)
[all …]
|
| D | x86-mont.pl | 43 $j="ecx";
128 &xor ($j,$j); # j=0
150 &inc ($j); # j++
159 &movd ($acc1,&DWP(4,$np,$j,4)); # np[j+1]
161 &movd ($acc0,&DWP(4,$ap,$j,4)); # ap[j+1]
163 &movd (&DWP($frame-4,"esp",$j,4),$car1); # tp[j-1]=
166 &lea ($j,&DWP(1,$j));
167 &cmp ($j,$num);
178 &movd (&DWP($frame-4,"esp",$j,4),$car1); # tp[num-2]=
188 &xor ($j,$j); # j=0
[all …]
|
| /external/bluetooth/bluez/sbc/ |
| D | sbctester.c | 84 int i, j, r1, r2, verdict; in calculate_rms_level() local
91 for (j = 0; j < infostst->channels; j++) in calculate_rms_level()
92 fprintf(csv, "ref channel %d;tst channel %d;", j, j); in calculate_rms_level()
128 for (j = 0; j < infostst->channels; j++) { in calculate_rms_level()
130 fprintf(csv, "%d;%d;", refsample[j], in calculate_rms_level()
131 tstsample[j]); in calculate_rms_level()
133 refbits = sampletobits(refsample[j], 0); in calculate_rms_level()
134 tstbits = sampletobits(tstsample[j], 0); in calculate_rms_level()
136 rms_accu[j] += pow(tstbits - refbits, 2.0); in calculate_rms_level()
145 for (j = 0; j < infostst->channels; j++) { in calculate_rms_level()
[all …]
|
| /external/opencv/cvaux/src/ |
| D | cvmorphcontours.cpp | 77 void _cvWorkEast (int i, int j, _CvWork** W, CvPoint2D32f* edges1, CvPoint2D32f* edges2);
78 void _cvWorkSouthEast(int i, int j, _CvWork** W, CvPoint2D32f* edges1, CvPoint2D32f* edges2);
79 void _cvWorkSouth (int i, int j, _CvWork** W, CvPoint2D32f* edges1, CvPoint2D32f* edges2);
382 void _cvWorkEast(int i, int j, _CvWork** W, CvPoint2D32f* edges1, CvPoint2D32f* edges2) in _cvWorkEast() argument
388 w1 = W[i-1][j].w_east /*+ _cvBendingWork( &edges1[i-2], in _cvWorkEast()
397 w2 = W[i-1][j].w_southeast + _cvBendingWork(&edges1[i-2], in _cvWorkEast()
399 &edges2[j-1], in _cvWorkEast()
405 W[i][j].w_east = w1 + _cvStretchingWork( &edges1[i-1], &null_edge ); in _cvWorkEast()
406 W[i][j].path_e = PATH_TO_E; in _cvWorkEast()
410 W[i][j].w_east = w2 + _cvStretchingWork( &edges1[i-1], &null_edge ); in _cvWorkEast()
[all …]
|
| /external/protobuf/gtest/include/gtest/internal/ |
| D | gtest-param-util-generated.h.pump | 75 $range j 1..i
77 template <$for j, [[typename T$j]]>
80 ValueArray$i($for j, [[T$j v$j]]) : $for j, [[v$(j)_(v$j)]] {}
84 const T array[] = {$for j, [[v$(j)_]]};
92 $for j [[
94 const T$j v$(j)_;
109 $range j 1..i
112 template <$for j, [[typename T$j]]>
114 : public ParamGeneratorInterface< ::std::tr1::tuple<$for j, [[T$j]]> > {
116 typedef ::std::tr1::tuple<$for j, [[T$j]]> ParamType;
[all …]
|
| /external/webkit/Source/JavaScriptCore/tests/mozilla/js1_2/statements/ |
| D | break.js | 41 var i,j; variable
52 j = 2000;
60 for (j = 0; j < 1000; j++)
62 if (j == 500) break out1;
64 j = 2001;
66 j = 2002;
71 500, j);
86 j = 2000;
94 j = 0;
96 while (j < 1000)
[all …]
|
| /external/tremolo/Tremolo/ |
| D | floor1.c | 77 ogg_uint16_t i,j; in mergesort() local
81 for(j=0;j+i<n;){ in mergesort()
82 int k1=j; in mergesort()
83 int mid=j+i; in mergesort()
85 int end=(j+i*2<n?j+i*2:n); in mergesort()
88 B[j++]=A[k1++]; in mergesort()
90 B[j++]=A[k2++]; in mergesort()
92 while(k1<mid) B[j++]=A[k1++]; in mergesort()
93 while(k2<end) B[j++]=A[k2++]; in mergesort()
95 for(;j<n;j++)B[j]=A[j]; in mergesort()
[all …]
|