| /external/libxaac/decoder/ |
| D | ixheaacd_mps_temp_reshape.c | 57 WORD32 ii, jj, param_band; in ixheaacd_mps_est_normalized_envelope() local
70 for (jj = 0; jj < self->hyb_band_count; jj++) { in ixheaacd_mps_est_normalized_envelope()
72 [ixheaacd_hybrid_band_71_to_processing_band_20_map[jj]] += in ixheaacd_mps_est_normalized_envelope()
73 ((self->hyb_dir_out[ch][ii][jj].re + in ixheaacd_mps_est_normalized_envelope()
74 self->hyb_diff_out[ch][ii][jj].re) * in ixheaacd_mps_est_normalized_envelope()
75 (self->hyb_dir_out[ch][ii][jj].re + in ixheaacd_mps_est_normalized_envelope()
76 self->hyb_diff_out[ch][ii][jj].re)) + in ixheaacd_mps_est_normalized_envelope()
77 ((self->hyb_dir_out[ch][ii][jj].im + in ixheaacd_mps_est_normalized_envelope()
78 self->hyb_diff_out[ch][ii][jj].im) * in ixheaacd_mps_est_normalized_envelope()
79 (self->hyb_dir_out[ch][ii][jj].im + in ixheaacd_mps_est_normalized_envelope()
[all …]
|
| /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/swiftshader/third_party/llvm-7.0/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_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_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_-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);
|
| /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_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_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_-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);
|
| /external/libaom/libaom/test/ |
| D | sum_squares_test.cc | 65 for (int jj = 0; jj < width; jj++) { in GenRandomData() local
66 src_[ii * stride + jj] = rnd_(2) ? rnd_(limit) : -rnd_(limit); in GenRandomData()
76 for (int jj = 0; jj < width; jj++) { in GenExtremeData() local
77 src_[ii * stride + jj] = val; in GenExtremeData()
266 for (int jj = 0; jj < width; jj++) { in GenRandomData() local
268 src_[ii * stride + jj] = rnd_.Rand8(); in GenRandomData()
269 ref_[ii * stride + jj] = rnd_.Rand8(); in GenRandomData()
271 pSrc[ii * stride + jj] = rnd_(limit); in GenRandomData()
272 pRef[ii * stride + jj] = rnd_(limit); in GenRandomData()
282 for (int jj = 0; jj < width; jj++) { in GenExtremeData() local
[all …]
|
| /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/skia/src/compute/common/cl/ |
| D | find_cl.c | 107 for (cl_uint jj=0; jj<device_count; jj++) in clFindIdsByName() local
112 cl(GetDeviceInfo(device_ids[jj], in clFindIdsByName()
118 cl(GetDeviceInfo(device_ids[jj], in clFindIdsByName()
127 cl(GetDeviceInfo(device_ids[jj], in clFindIdsByName()
133 cl(GetDeviceInfo(device_ids[jj], in clFindIdsByName()
142 *device_id = device_ids[jj]; in clFindIdsByName()
175 jj, in clFindIdsByName()
|
| /external/skqp/src/compute/common/cl/ |
| D | find_cl.c | 107 for (cl_uint jj=0; jj<device_count; jj++) in clFindIdsByName() local
112 cl(GetDeviceInfo(device_ids[jj], in clFindIdsByName()
118 cl(GetDeviceInfo(device_ids[jj], in clFindIdsByName()
127 cl(GetDeviceInfo(device_ids[jj], in clFindIdsByName()
133 cl(GetDeviceInfo(device_ids[jj], in clFindIdsByName()
142 *device_id = device_ids[jj]; in clFindIdsByName()
175 jj, in clFindIdsByName()
|
| /external/tensorflow/tensorflow/contrib/nearest_neighbor/kernels/ |
| D | hyperplane_lsh_probes.h | 79 for (int_fast32_t jj = 0; jj < num_hyperplanes_per_table_; ++jj) { in SetupProbing() local
83 (hash_vector_[ii * num_hyperplanes_per_table_ + jj] >= 0.0); in SetupProbing()
95 for (int_fast32_t jj = 0; jj < num_hyperplanes_per_table_; ++jj) { in SetupProbing() local
96 sorted_hyperplane_indices_[ii][jj] = jj; in SetupProbing()
213 bool operator()(int_fast32_t ii, int_fast32_t jj) const { in operator()
214 return std::abs(values_[offset_ + ii]) < std::abs(values_[offset_ + jj]); in operator()
|
| /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/libopus/tests/ |
| D | test_opus_api.c | 709 opus_int32 i,j,jj,sz; in test_parse() local
740 for(jj=0;jj<=1275*2+3;jj++) in test_parse()
743 ret=opus_packet_parse(packet,jj,&toc,frames,size,&payload_offset); in test_parse()
745 if((jj&1)==1 && jj<=2551) in test_parse()
750 if(size[0]!=size[1] || size[0]!=((jj-1)>>1))test_failed(); in test_parse()
824 for(jj=49;jj<=64;jj++) in test_parse()
826 packet[1]=0+(jj&63); /*CBR, no padding*/ in test_parse()
831 packet[1]=128+(jj&63); /*VBR, no padding*/ in test_parse()
836 packet[1]=64+(jj&63); /*CBR, padding*/ in test_parse()
841 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);
|