| /external/apache-http/src/org/apache/commons/codec/binary/ |
| D | BinaryCodec.java | 181 for (int ii = 0, jj = ascii.length - 1; ii < l_raw.length; ii++, jj -= 8) { in fromAscii()
183 if (ascii[jj - bits] == '1') { in fromAscii()
208 for (int ii = 0, jj = ascii.length - 1; ii < l_raw.length; ii++, jj -= 8) { in fromAscii()
210 if (ascii[jj - bits] == '1') { in fromAscii()
237 for (int ii = 0, jj = l_ascii.length - 1; ii < raw.length; ii++, jj -= 8) { in toAsciiBytes()
240 l_ascii[jj - bits] = '0'; in toAsciiBytes()
242 l_ascii[jj - bits] = '1'; in toAsciiBytes()
267 for (int ii = 0, jj = l_ascii.length - 1; ii < raw.length; ii++, jj -= 8) { in toAsciiChars()
270 l_ascii[jj - bits] = '0'; in toAsciiChars()
272 l_ascii[jj - bits] = '1'; in toAsciiChars()
|
| /external/toybox/toys/other/ |
| D | bzcat.c | 164 int hh, ii, jj, kk, symCount, *base, *limit; in read_block_header() local
169 jj = get_bits(bd, 24); in read_block_header()
173 if (ii==0x177245 && jj==0x385090) return RETVAL_LAST_BLOCK; in read_block_header()
176 if (ii!=0x314159 || jj!=0x265359) return RETVAL_NOT_BZIP_DATA; in read_block_header()
192 for (jj=0; jj<16; jj++) in read_block_header()
193 if (kk & (1 << (15 - jj))) in read_block_header()
194 bd->symToByte[bd->symTotal++] = (16 * ii) + jj; in read_block_header()
214 for(jj=0;get_bits(bd,1);jj++) in read_block_header()
215 if (jj>=bd->groupCount) return RETVAL_DATA_ERROR; in read_block_header()
218 uc = bd->mtfSymbol[jj]; in read_block_header()
[all …]
|
| /external/eigen/Eigen/src/SparseLU/ |
| D | SparseLU_panel_dfs.h | 44 bool update_segrep(Index krep, StorageIndex jj) in update_segrep()
48 m_marker[krep] = jj; in update_segrep()
62 void SparseLUImpl<Scalar,StorageIndex>::dfs_kernel(const StorageIndex jj, IndexVector& perm_r, in dfs_kernel() argument
73 marker(krow) = jj; in dfs_kernel()
115 if (chmark != jj ) in dfs_kernel()
117 marker(kchild) = jj; in dfs_kernel()
160 if(traits.update_segrep(krep,jj)) in dfs_kernel()
230 for (StorageIndex jj = StorageIndex(jcol); jj < jcol + w; jj++) in panel_dfs() local
232 nextl_col = (jj - jcol) * m; in panel_dfs()
239 for (typename MatrixType::InnerIterator it(A, jj); it; ++it) in panel_dfs()
[all …]
|
| D | SparseLU_panel_bmod.h | 61 Index ksub,jj,nextl_col; in panel_bmod() local
88 for (jj = jcol; jj < jcol + w; jj++) in panel_bmod()
90 nextl_col = (jj-jcol) * m; in panel_bmod()
109 for (jj = jcol; jj < jcol + w; jj++) in panel_bmod()
111 nextl_col = (jj-jcol) * m; in panel_bmod()
156 for (jj = jcol; jj < jcol + w; jj++) in panel_bmod()
158 nextl_col = (jj-jcol) * m; in panel_bmod()
191 for (jj = jcol; jj < jcol + w; jj++) in panel_bmod()
193 nextl_col = (jj-jcol) * m; in panel_bmod()
|
| /external/google-tv-pairing-protocol/java/src/com/google/polo/json/ |
| D | Test.java | 22 JSONStringer jj; in main() local
121 jj = new JSONStringer(); in main()
122 s = jj in main()
156 jj = new JSONStringer(); in main()
157 jj.array(); in main()
158 jj.value(1); in main()
159 jj.array(); in main()
160 jj.value(null); in main()
161 jj.array(); in main()
162 jj.object(); in main()
[all …]
|
| /external/llvm/test/tools/llvm-cov/Inputs/ |
| D | test.cpp | 28 void assign(int ii, int jj) { in assign() argument
29 grid[ii][jj] = (ii+1) * (jj+1); in assign()
34 for (int jj = 0; jj < 2; jj++) in initialize_grid() local
35 assign(ii, jj); in initialize_grid()
|
| D | test_no_gcda.cpp.gcov | 33 #####: 28:void assign(int ii, int jj) {
34 #####: 29: grid[ii][jj] = (ii+1) * (jj+1);
39 #####: 34: for (int jj = 0; jj < 2; jj++)
40 #####: 35: assign(ii, jj);
|
| D | test_objdir.cpp.gcov | 33 8: 28:void assign(int ii, int jj) {
34 8: 29: grid[ii][jj] = (ii+1) * (jj+1);
39 24: 34: for (int jj = 0; jj < 2; jj++)
40 12: 35: assign(ii, jj);
|
| D | test_paths.cpp.gcov | 33 12: 28:void assign(int ii, int jj) {
34 12: 29: grid[ii][jj] = (ii+1) * (jj+1);
39 36: 34: for (int jj = 0; jj < 2; jj++)
40 18: 35: assign(ii, jj);
|
| D | test_no_options.cpp.gcov | 33 8: 28:void assign(int ii, int jj) {
34 8: 29: grid[ii][jj] = (ii+1) * (jj+1);
39 24: 34: for (int jj = 0; jj < 2; jj++)
40 12: 35: assign(ii, jj);
|
| D | test_-a.cpp.gcov | 38 8: 28:void assign(int ii, int jj) {
39 8: 29: grid[ii][jj] = (ii+1) * (jj+1);
48 12: 34: for (int jj = 0; jj < 2; jj++)
52 8: 35: assign(ii, jj);
|
| D | test_-a_-b.cpp.gcov | 44 8: 28:void assign(int ii, int jj) {
45 8: 29: grid[ii][jj] = (ii+1) * (jj+1);
57 12: 34: for (int jj = 0; jj < 2; jj++)
63 8: 35: assign(ii, jj);
|
| D | test_-a_-b_-u.cpp.gcov | 49 8: 28:void assign(int ii, int jj) {
50 8: 29: grid[ii][jj] = (ii+1) * (jj+1);
65 12: 34: for (int jj = 0; jj < 2; jj++)
73 8: 35: assign(ii, jj);
|
| D | test_-a_-b_-c_-u.cpp.gcov | 49 8: 28:void assign(int ii, int jj) {
50 8: 29: grid[ii][jj] = (ii+1) * (jj+1);
65 12: 34: for (int jj = 0; jj < 2; jj++)
73 8: 35: assign(ii, jj);
|
| /external/ImageMagick/PerlMagick/t/reference/write/composite/ |
| D | CopyRed.miff | 41 …jj�>jj�<jj�Ajj�Ljj�Ujj�ejj��jj��jj�jj�wjj�jj�yjj�njj�ljj�hjj�jjj�jj��jj��jj��jj��jj��jj��jj��jj…
|
| /external/libopus/tests/ |
| D | test_opus_api.c | 711 opus_int32 i,j,jj,sz; in test_parse() local
742 for(jj=0;jj<=1275*2+3;jj++) in test_parse()
745 ret=opus_packet_parse(packet,jj,&toc,frames,size,&payload_offset); in test_parse()
747 if((jj&1)==1 && jj<=2551) in test_parse()
752 if(size[0]!=size[1] || size[0]!=((jj-1)>>1))test_failed(); in test_parse()
826 for(jj=49;jj<=64;jj++) in test_parse()
828 packet[1]=0+(jj&63); /*CBR, no padding*/ in test_parse()
833 packet[1]=128+(jj&63); /*VBR, no padding*/ in test_parse()
838 packet[1]=64+(jj&63); /*CBR, padding*/ in test_parse()
843 packet[1]=128+64+(jj&63); /*VBR, padding*/ in test_parse()
[all …]
|
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| D | LMcovar.h | 27 Index i, j, k, l, ii, jj; variable
61 jj = ipvt[j];
67 if (ii > jj)
68 r(ii,jj) = r(i,j);
69 if (ii < jj)
70 r(jj,ii) = r(i,j);
72 wa[jj] = r(j,j);
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| D | covar.h | 15 Index i, j, k, l, ii, jj; variable
49 jj = ipvt[j];
55 if (ii > jj)
56 r(ii,jj) = r(i,j);
57 if (ii < jj)
58 r(jj,ii) = r(i,j);
60 wa[jj] = r(j,j);
|
| /external/eigen/bench/ |
| D | sparse_setter.cpp | 364 for(I jj = row_start; jj < row_end; jj++){ in csr_sort_indices() local
365 temp.push_back(std::make_pair(Aj[jj],Ax[jj])); in csr_sort_indices()
370 for(I jj = row_start, n = 0; jj < row_end; jj++, n++){ in csr_sort_indices() local
371 Aj[jj] = temp[n].first; in csr_sort_indices()
372 Ax[jj] = temp[n].second; in csr_sort_indices()
387 I jj = row_end; in csr_sum_duplicates() local
389 while( jj < row_end ){ in csr_sum_duplicates()
390 I j = Aj[jj]; in csr_sum_duplicates()
391 T x = Ax[jj]; in csr_sum_duplicates()
392 jj++; in csr_sum_duplicates()
[all …]
|
| /external/mesa3d/src/mesa/program/ |
| D | prog_noise.c | 260 unsigned int ii, jj; in _mesa_noise2() local
286 jj = j & 0xff; in _mesa_noise2()
294 n0 = t0 * t0 * grad2(perm[ii + perm[jj]], x0, y0); in _mesa_noise2()
302 n1 = t1 * t1 * grad2(perm[ii + i1 + perm[jj + j1]], x1, y1); in _mesa_noise2()
310 n2 = t2 * t2 * grad2(perm[ii + 1 + perm[jj + 1]], x2, y2); in _mesa_noise2()
347 unsigned int ii, jj, kk; in _mesa_noise3() local
427 jj = j & 0xff; in _mesa_noise3()
436 n0 = t0 * t0 * grad3(perm[ii + perm[jj + perm[kk]]], x0, y0, z0); in _mesa_noise3()
445 t1 * t1 * grad3(perm[ii + i1 + perm[jj + j1 + perm[kk + k1]]], x1, in _mesa_noise3()
455 t2 * t2 * grad3(perm[ii + i2 + perm[jj + j2 + perm[kk + k2]]], x2, in _mesa_noise3()
[all …]
|
| /external/webrtc/webrtc/common_audio/signal_processing/ |
| D | get_hanning_window.c | 58 size_t jj; in WebRtcSpl_GetHanningWindow() local
71 for (jj = 0; jj < size; jj++) in WebRtcSpl_GetHanningWindow()
|
| /external/webrtc/webrtc/modules/audio_coding/codecs/isac/main/source/ |
| D | fft.c | 276 int j, jc, jf, jj, k, k1, k2, k3, k4, kk, kt, nn, ns, nt; in FFTRADIX() local
377 jj = 9; in FFTRADIX()
379 while (k % jj == 0) { in FFTRADIX()
382 k /= jj; in FFTRADIX()
385 jj = j * j; in FFTRADIX()
386 } while (jj <= k); in FFTRADIX()
684 jj = j; in FFTRADIX()
692 ak += Rtmp [k - 1] * Cos [jj - 1]; in FFTRADIX()
693 bk += Itmp [k - 1] * Cos [jj - 1]; in FFTRADIX()
695 aj += Rtmp [k - 1] * Sin [jj - 1]; in FFTRADIX()
[all …]
|
| /external/drrickorang/LoopbackApp/app/src/main/java/org/drrickorang/loopback/ |
| D | AudioFileOutput.java | 157 for (int jj = 0; jj < bufferSize; jj++) { in writeDataBuffer()
158 int index = ii + jj; in writeDataBuffer()
164 buffer[(jj * 2) + 1] = ba; in writeDataBuffer()
165 buffer[jj * 2] = bb; in writeDataBuffer()
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| D | IncompleteLUT.h | 337 Index jj = 0; in factorize() local
339 while (jj < sizel) in factorize()
344 Index minrow = ju.segment(jj,sizel-jj).minCoeff(&k); // k is relative to the segment in factorize()
345 k += jj; in factorize()
346 if (minrow != ju(jj)) in factorize()
349 Index j = ju(jj); in factorize()
350 swap(ju(jj), ju(k)); in factorize()
351 jr(minrow) = convert_index<StorageIndex>(jj); in factorize()
353 swap(u(jj), u(k)); in factorize()
362 Scalar fact = u(jj) / ki_it.value(); in factorize()
[all …]
|
| /external/ImageMagick/PerlMagick/t/reference/write/jng/ |
| D | input_idat.miff | 11 …jj��==((ff��FF00NN��UUDDDD��KKIIjjXX6677��EE++..��BB0000��99//--��5500**��6633**��33//##��22** ��…
19 …HII��ccAA@@��^^@@88��\\EE77��VVII66��IIJJ::��SS____��ss������������kk������jj������ff������kk�����…
21 …��ssqq��ppqq��^^^^��ppii����~~gg����qq�����ϰ�44���˶�++���Ŭ�PP������jj������pp���Ú�WW���մ�1…
31 …6��NNXX66��RRUU::��XXSS??��WWOO<<��TTII77��SSJJ99��TTNNBB��aa[[[[��jjbbmm��jj[[rr����ll����������|…
37 ��FF==��00 ##��11%% ��4444��6677 ��33//22��IIEEEE����������jj}}��QQmm����IIbb����>>BBbbzzK…
43 …jj��TT��pp��ZZ��hh��SS��JJmm55��>>aa++��bbEEAA��eeIIEE��iiMMII��ccIIHH��aaLLSS��ttccuu����vv����zz…
45 …jj��QQ��gg��TT��kk��OO��ll��KK��hh��II��gg��HH��ii��JJ��nn��OO��..--22��335522��''00 ��--;;""��LL…
47 ��;;==��88<<��99;; ��@@==%%��EE::66��??11VV��55''jj��<<11rr�� ~~��>>33����[[OOYY��@@66jj��^…
|