/external/ImageMagick/coders/ |
D | exr.c | 427 factors[3]; in WriteEXRImage() local 509 factors[0]=0; in WriteEXRImage() 517 if (sscanf(sampling_factor,"%d:%d:%d",factors,factors+1,factors+2) == 3) in WriteEXRImage() 519 if ((factors[0] == factors[1]) && (factors[1] == factors[2])) in WriteEXRImage() 520 factors[0]=1; in WriteEXRImage() 522 if ((factors[0] == (2*factors[1])) && (factors[2] == 0)) in WriteEXRImage() 523 factors[0]=2; in WriteEXRImage() 526 if (sscanf(sampling_factor,"%dx%d",factors,factors+1) == 2) in WriteEXRImage() 528 if (factors[0] != factors[1]) in WriteEXRImage() 529 factors[0]=0; in WriteEXRImage() [all …]
|
/external/mesa3d/src/gallium/state_trackers/clover/util/ |
D | factor.hpp | 42 std::vector<T> factors; in find_integer_prime_factors() local 47 factors.push_back(d); in find_integer_prime_factors() 51 return factors; in find_integer_prime_factors() 64 const std::vector<std::vector<T>> &factors, in next_grid_factor() argument 67 if (d >= factors.size()) { in next_grid_factor() 71 } else if (i >= factors[d].size()) { in next_grid_factor() 73 return next_grid_factor(limits, grid, factors, in next_grid_factor() 77 T f = factors[d][i]; in next_grid_factor() 97 return next_grid_factor(limits, grid, factors, in next_grid_factor() 114 const std::vector<std::vector<T>> factors = in find_grid_optimal_factor() local [all …]
|
/external/libxcam/modules/soft/ |
D | soft_geo_mapper.cpp | 93 Float2 factors; in configure_resource() local 94 get_factors (factors.x, factors.y); in configure_resource() 95 if (XCAM_DOUBLE_EQUAL_AROUND (factors.x, 0.0f) || in configure_resource() 96 XCAM_DOUBLE_EQUAL_AROUND (factors.y, 0.0f)) { in configure_resource() 122 Float2 factors; in start_remap_task() local 123 get_factors (factors.x, factors.y); in start_remap_task() 132 args->factors = factors; in start_remap_task()
|
D | soft_geo_tasks_priv.cpp | 41 Float2 factors = args->factors; in work_range() local 43 !XCAM_DOUBLE_EQUAL_AROUND (factors.x, 0.0f) && in work_range() 44 !XCAM_DOUBLE_EQUAL_AROUND (factors.y, 0.0f)); in work_range() 48 float x_step = 1.0f / factors.x; in work_range() 49 float y_step = 1.0f / factors.y; in work_range() 69 Float2 first = out_pos / factors; in work_range()
|
D | soft_geo_tasks_priv.h | 38 Float2 factors; member
|
/external/tensorflow/tensorflow/python/kernel_tests/linalg/ |
D | linear_operator_kronecker_test.py | 37 def _kronecker_dense(factors): argument 39 product = factors[0] 40 for factor in factors[1:]: 94 build_info((1, 1), factors=[(1, 1), (1, 1)]), 95 build_info((8, 8), factors=[(2, 2), (2, 2), (2, 2)]), 96 build_info((12, 12), factors=[(2, 2), (3, 3), (2, 2)]), 97 build_info((1, 3, 3), factors=[(1, 1), (1, 3, 3)]), 98 build_info((3, 6, 6), factors=[(3, 1, 1), (1, 2, 2), (1, 3, 3)]),
|
/external/tensorflow/tensorflow/contrib/libsvm/kernels/ |
D | decode_libsvm_op.cc | 102 std::vector<int64> factors(input_tensor->shape().dims()); in Compute() local 103 factors[input_tensor->shape().dims() - 1] = 1; in Compute() 105 factors[j] = factors[j + 1] * input_tensor->shape().dim_size(j + 1); in Compute() 111 indices(i, j) = value / factors[j]; in Compute() 112 value = value % factors[j]; in Compute()
|
/external/speex/libspeexdsp/ |
D | kiss_fft.c | 327 int * factors, in kf_shuffle() argument 331 const int p=*factors++; /* the radix */ in kf_shuffle() 332 const int m=*factors++; /* stage's fft length/p */ in kf_shuffle() 347 kf_shuffle( Fout , f, fstride*p, in_stride, factors,st); in kf_shuffle() 360 int * factors, in kf_work() argument 369 const int p=*factors++; /* the radix */ in kf_work() 370 const int m=*factors++; /* stage's fft length/p */ in kf_work() 385 kf_work( Fout , f, fstride*p, in_stride, factors,st, N*p, fstride*in_stride, m); in kf_work() 416 kf_work( Fout , f, fstride*p, in_stride, factors,st, N*p, fstride*in_stride, m); in kf_work() 497 kf_factor(nfft,st->factors); in kiss_fft_alloc() [all …]
|
/external/libopus/celt/ |
D | kiss_fft.c | 323 opus_int16 * factors, in compute_bitrev_table() argument 327 const int p=*factors++; /* the radix */ in compute_bitrev_table() 328 const int m=*factors++; /* stage's fft length/p */ in compute_bitrev_table() 343 compute_bitrev_table( Fout , f, fstride*p, in_stride, factors,st); in compute_bitrev_table() 477 if (!kf_factor(nfft,st->factors)) in opus_fft_alloc_twiddles() 486 compute_bitrev_table(0, bitrev, 1,1, st->factors,st); in opus_fft_alloc_twiddles() 536 p = st->factors[2*L]; in opus_fft_impl() 537 m = st->factors[2*L+1]; in opus_fft_impl() 541 m = st->factors[2*L-1]; in opus_fft_impl() 545 m2 = st->factors[2*i-1]; in opus_fft_impl() [all …]
|
D | kiss_fft.h | 93 opus_int16 factors[2*MAXFACTORS]; member
|
/external/tensorflow/tensorflow/contrib/factorization/kernels/ |
D | wals_solver_ops.cc | 73 const Tensor& factors = context->input(0); in Compute() local 83 OP_REQUIRES(context, TensorShapeUtils::IsMatrix(factors.shape()), in Compute() 112 factor_weights.dim_size(0) == factors.dim_size(0) && in Compute() 122 const int64 factor_dim = factors.dim_size(1); in Compute() 123 const int64 factors_size = factors.dim_size(0); in Compute() 132 ConstEigenMatrixFloatMap factors_mat(factors.matrix<float>().data(), in Compute()
|
/external/python/cpython3/Modules/_decimal/libmpdec/literature/ |
D | fnt.py | 65 def is_primitive_root(r, p, factors, exponents): argument 67 if p != prod(factors, exponents) + 1: 69 for f in factors:
|
/external/sonic/debian/ |
D | control | 18 high quality at speed up factors well over 2X. 30 high quality at speed up factors well over 2X. 41 high quality at speed up factors well over 2X.
|
/external/icu/icu4c/source/common/ |
D | unames.cpp | 773 writeFactorSuffix(const uint16_t *factors, uint16_t count, in writeFactorSuffix() argument 792 factor=factors[i]; in writeFactorSuffix() 829 factor=(uint16_t)(factors[i]-indexes[i]-1); in writeFactorSuffix() 905 const uint16_t *factors=(const uint16_t *)(range+1); in getAlgName() local 907 const char *s=(const char *)(factors+count); in getAlgName() 915 bufferPos+=writeFactorSuffix(factors, count, in getAlgName() 995 const uint16_t *factors=(const uint16_t *)(range+1); in enumAlgNames() local 997 const char *s=(const char *)(factors+count); in enumAlgNames() 1014 length=(uint16_t)(prefixLength+writeFactorSuffix(factors, count, in enumAlgNames() 1030 if(idx<factors[i]) { in enumAlgNames() [all …]
|
/external/aac/libSBRdec/src/ |
D | hbe.cpp | 145 static const FIXP_DBL factors[4] = { variable 1914 (fMult(factors[ts2 % 4], tmpReal_F) - in QmfTransposerApply() 1915 fMult(factors[(ts2 + 3) % 4], tmpImag_F)) >> in QmfTransposerApply() 1918 (fMult(factors[(ts2 + 3) % 4], tmpReal_F) + in QmfTransposerApply() 1919 fMult(factors[ts2 % 4], tmpImag_F)) >> in QmfTransposerApply() 1930 (fMult(factors[ts2 % 4], tmpReal_F) - in QmfTransposerApply() 1931 fMult(factors[(ts2 + 1) % 4], tmpImag_F)) >> in QmfTransposerApply() 1934 (fMult(factors[(ts2 + 1) % 4], tmpReal_F) + in QmfTransposerApply() 1935 fMult(factors[ts2 % 4], tmpImag_F)) >> in QmfTransposerApply() 1963 (fMult(factors[ts1 % 4], tmpReal_F) - in QmfTransposerApply() [all …]
|
/external/tensorflow/tensorflow/python/kernel_tests/ |
D | sparse_reshape_op_test.py | 292 factors = np.array([2] * 4 + [3] * 4 + [5] * 4) # 810k total elements 294 orig_map = np.random.randint(orig_rank, size=factors.shape) 295 orig_shape = [np.prod(factors[orig_map == d]) for d in range(orig_rank)] 297 new_map = np.random.randint(new_rank, size=factors.shape) 298 new_shape = [np.prod(factors[new_map == d]) for d in range(new_rank)]
|
/external/libxaac/decoder/ |
D | ixheaacd_spectrum_dec.c | 225 WORD16 global_gain, pWORD16 factors, pUWORD8 groups, in ixheaacd_section_data() argument 252 temp_ptr_scale_fac = factors; in ixheaacd_section_data() 254 memset(factors, 0, MAXBANDS); in ixheaacd_section_data() 408 usac_data->factors[chn], usac_data->group_dis[chn], in ixheaacd_fd_channel_stream()
|
/external/eigen/doc/ |
D | InplaceDecomposition.dox | 33 Here, the \c lu object computes and stores the \c L and \c U factors within the memory held by the … 34 …hus been destroyed during the factorization, and replaced by the L and U factors as one can verify: 81 …This is still the content of \c A that will be used to store the L and U factors of the matrix \c …
|
/external/tensorflow/tensorflow/core/api_def/base_api/ |
D | api_def_Lu.pbtxt | 24 Similar to `scipy.linalg.lu`, except the triangular factors `L` and `U` are 40 upper triangular factors.
|
/external/mesa3d/src/gallium/docs/source/cso/ |
D | blend.rst | 12 The blend factors largely follow the same pattern as their counterparts 15 Dual source blend factors are supported for up to 1 MRT, although 109 functions and source/destination factors. Otherwise, the incoming fragment
|
/external/tensorflow/tensorflow/lite/g3doc/guide/ |
D | ops_version.md | 26 setting the dilation factors to 1. 126 reads an old model file where dilation factors are missing, it will use 1 as 161 * Populate version=1 when dilation factors are all 1.
|
/external/libyuv/files/docs/ |
D | filtering.md | 28 For odd scale factors (e.g. 3x down) this is exactly the middle. For even scale factors, this roun… 34 For odd scale factors (e.g. 3x down) this is exactly the middle, and point sampling is used. 35 For even scale factors, this evenly filters the middle 2x2 pixels. e.g. 4x down will filter pixels… 143 …or. But as is, it is reversible and exactly matches ffmpeg at all scale factors, both up and down…
|
/external/deqp-deps/glslang/Test/ |
D | hlsl.color.hull.tesc | 41 // Set the tessellation factors for the three edges of the triangle.
|
/external/llvm/test/Transforms/LoopUnroll/ |
D | partial-unroll-const-bounds.ll | 3 ; The Loop TripCount is 9. However unroll factors 3 or 9 exceed given threshold.
|
/external/libavc/common/arm/ |
D | ih264_iquant_itrans_recon_a9.s | 502 vld1.32 {q10}, [r6]! @ Q10 = scaling factors row 0 505 vld1.32 {q11}, [r6]! @ Q11 = scaling factors row 1 512 vld1.32 {q13}, [r6]! @ Scaling factors row 2 514 vld1.32 {q14}, [r6]! @ Scaling factors row 3 525 vld1.32 {q4}, [r6]! @ Scaling factors row 4 528 vld1.32 {q5}, [r6]! @ Scaling factors row 5 544 vld1.32 {q13}, [r6]! @ Scaling factors row 6 554 vld1.32 {q14}, [r6]! @ Scaling factors row 7
|