Home
last modified time | relevance | path

Searched refs:factors (Results 1 – 25 of 170) sorted by relevance

1234567

/external/mesa3d/src/gallium/frontends/clover/util/
Dfactor.hpp42 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/boringssl/src/third_party/wycheproof_testvectors/
Dprimality_test.txt638 # Carmichael number with 3 prime factors
644 # Carmichael number with 3 prime factors
650 # Carmichael number with 3 prime factors
656 # Carmichael number with 3 prime factors
662 # Carmichael number with 3 prime factors
668 # Carmichael number with 3 prime factors
674 # Carmichael number with 3 prime factors
680 # Carmichael number with 3 prime factors
686 # Carmichael number with 3 prime factors
692 # Carmichael number with 3 prime factors
[all …]
/external/ImageMagick/coders/
Dexr.c454 factors[3]; in WriteEXRImage() local
546 factors[0]=0; in WriteEXRImage()
554 if (sscanf(sampling_factor,"%d:%d:%d",factors,factors+1,factors+2) == 3) in WriteEXRImage()
556 if ((factors[0] == factors[1]) && (factors[1] == factors[2])) in WriteEXRImage()
557 factors[0]=1; in WriteEXRImage()
559 if ((factors[0] == (2*factors[1])) && (factors[2] == 0)) in WriteEXRImage()
560 factors[0]=2; in WriteEXRImage()
563 if (sscanf(sampling_factor,"%dx%d",factors,factors+1) == 2) in WriteEXRImage()
565 if (factors[0] != factors[1]) in WriteEXRImage()
566 factors[0]=0; in WriteEXRImage()
[all …]
/external/llvm-project/polly/lib/External/isl/
Disl_farkas.c376 struct isl_coefficients_factor_data *factors; member
388 data->factors = isl_calloc_array(ctx, in isl_coefficients_product_data_init()
390 if (!data->factors) in isl_coefficients_product_data_init()
402 if (data->factors) { in isl_coefficients_product_data_clear()
404 isl_basic_set_free(data->factors[i].coeff); in isl_coefficients_product_data_clear()
407 free(data->factors); in isl_coefficients_product_data_clear()
434 data->factors[data->pos].coeff = coeff; in isl_basic_set_coefficients_factor()
450 data->factors[data->pos].start = data->start_next; in isl_basic_set_coefficients_factor()
451 data->factors[data->pos].dim = dim; in isl_basic_set_coefficients_factor()
452 data->factors[data->pos].n_line = n_eq; in isl_basic_set_coefficients_factor()
[all …]
/external/tensorflow/tensorflow/python/kernel_tests/linalg/
Dlinear_operator_kronecker_test.py38 def _kronecker_dense(factors): argument
40 product = factors[0]
41 for factor in factors[1:]:
97 shape_info((1, 1), factors=[(1, 1), (1, 1)]),
98 shape_info((8, 8), factors=[(2, 2), (2, 2), (2, 2)]),
99 shape_info((12, 12), factors=[(2, 2), (3, 3), (2, 2)]),
100 shape_info((1, 3, 3), factors=[(1, 1), (1, 3, 3)]),
101 shape_info((3, 6, 6), factors=[(3, 1, 1), (1, 2, 2), (1, 3, 3)]),
/external/speex/libspeexdsp/
Dkiss_fft.c327 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/
Dkiss_fft.c323 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 …]
/external/rnnoise/src/
Dkiss_fft.c320 opus_int16 * factors, in compute_bitrev_table() argument
324 const int p=*factors++; /* the radix */ in compute_bitrev_table()
325 const int m=*factors++; /* stage's fft length/p */ in compute_bitrev_table()
340 compute_bitrev_table( Fout , f, fstride*p, in_stride, factors,st); in compute_bitrev_table()
474 if (!kf_factor(nfft,st->factors)) in opus_fft_alloc_twiddles()
483 compute_bitrev_table(0, bitrev, 1,1, st->factors,st); in opus_fft_alloc_twiddles()
533 p = st->factors[2*L]; in opus_fft_impl()
534 m = st->factors[2*L+1]; in opus_fft_impl()
538 m = st->factors[2*L-1]; in opus_fft_impl()
542 m2 = st->factors[2*i-1]; in opus_fft_impl()
[all …]
/external/python/cpython3/Modules/_decimal/libmpdec/literature/
Dfnt.py65 def is_primitive_root(r, p, factors, exponents): argument
67 if p != prod(factors, exponents) + 1:
69 for f in factors:
/external/sonic/debian/
Dcontrol18 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/mesa3d/src/gallium/auxiliary/draw/
Ddraw_tess.c275 struct pipe_tessellation_factors *factors) in llvm_fetch_tess_factors() argument
288 factors->outer_tf[i] = input[outer_slot][i]; in llvm_fetch_tess_factors()
291 factors->outer_tf[i] = shader->draw->default_outer_tess_level[i]; in llvm_fetch_tess_factors()
295 factors->inner_tf[i] = input[inner_slot][i]; in llvm_fetch_tess_factors()
298 factors->inner_tf[i] = shader->draw->default_inner_tess_level[i]; in llvm_fetch_tess_factors()
354 struct pipe_tessellation_factors factors; in draw_tess_eval_shader_run() local
365 llvm_fetch_tess_factors(shader, i, num_input_vertices_per_patch, &factors); in draw_tess_eval_shader_run()
368 p_tessellate(ptess, &factors, &data); in draw_tess_eval_shader_run()
392 …llvm_tes_run(shader, i, num_input_vertices_per_patch, &data, &factors, (struct vertex_header *)out… in draw_tess_eval_shader_run()
/external/tensorflow/tensorflow/lite/tools/optimize/
Doperator_property.h46 factors.assign(items[2]); in DerivedScale()
54 std::vector<float> factors = {}; member
/external/icu/icu4c/source/common/
Dunames.cpp773 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/
Dhbe.cpp145 static const FIXP_DBL factors[4] = { variable
1899 (fMult(factors[ts2 % 4], tmpReal_F) - in QmfTransposerApply()
1900 fMult(factors[(ts2 + 3) % 4], tmpImag_F)) >> in QmfTransposerApply()
1903 (fMult(factors[(ts2 + 3) % 4], tmpReal_F) + in QmfTransposerApply()
1904 fMult(factors[ts2 % 4], tmpImag_F)) >> in QmfTransposerApply()
1915 (fMult(factors[ts2 % 4], tmpReal_F) - in QmfTransposerApply()
1916 fMult(factors[(ts2 + 1) % 4], tmpImag_F)) >> in QmfTransposerApply()
1919 (fMult(factors[(ts2 + 1) % 4], tmpReal_F) + in QmfTransposerApply()
1920 fMult(factors[ts2 % 4], tmpImag_F)) >> in QmfTransposerApply()
1948 (fMult(factors[ts1 % 4], tmpReal_F) - in QmfTransposerApply()
[all …]
/external/libxaac/decoder/
Dixheaacd_spectrum_dec.c221 WORD16 global_gain, pWORD16 factors, pUWORD8 groups, in ixheaacd_section_data() argument
248 temp_ptr_scale_fac = factors; in ixheaacd_section_data()
250 memset(factors, 0, MAXBANDS); in ixheaacd_section_data()
404 usac_data->factors[chn], usac_data->group_dis[chn], in ixheaacd_fd_channel_stream()
/external/tensorflow/tensorflow/core/api_def/base_api/
Dapi_def_Lu.pbtxt24 Similar to `scipy.linalg.lu`, except the triangular factors `L` and `U` are
40 upper triangular factors.
/external/eigen/doc/
DInplaceDecomposition.dox33 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/python/kernel_tests/
Dsparse_reshape_op_test.py306 factors = np.array([2] * 4 + [3] * 4 + [5] * 4) # 810k total elements
308 orig_map = np.random.randint(orig_rank, size=factors.shape)
309 orig_shape = [np.prod(factors[orig_map == d]) for d in range(orig_rank)]
311 new_map = np.random.randint(new_rank, size=factors.shape)
312 new_shape = [np.prod(factors[new_map == d]) for d in range(new_rank)]
/external/deqp/external/vulkancts/modules/vulkan/ray_tracing/
DvktRayTracingBuildTests.cpp623 const deUint32 factors[] = { 1, 4 }; in createBuildTests() local
646 for (size_t factorNdx = 0; factorNdx < DE_LENGTH_OF_ARRAY(factors); ++factorNdx) in createBuildTests()
652 const deUint32 factor = factors[factorNdx]; in createBuildTests()
677 for (size_t factorNdx = 0; factorNdx < DE_LENGTH_OF_ARRAY(factors); ++factorNdx) in createBuildTests()
683 const deUint32 factor = factors[factorNdx]; in createBuildTests()
708 for (size_t factorNdx = 0; factorNdx < DE_LENGTH_OF_ARRAY(factors); ++factorNdx) in createBuildTests()
714 const deUint32 factor = factors[factorNdx]; in createBuildTests()
/external/python/cpython3/Modules/
Dmathmodule.c3130 long long i, factors; in math_perm_impl() local
3178 factors = PyLong_AsLongLongAndOverflow(k, &overflow); in math_perm_impl()
3185 else if (factors == -1) { in math_perm_impl()
3190 if (factors == 0) { in math_perm_impl()
3197 if (factors == 1) { in math_perm_impl()
3203 for (i = 1; i < factors; ++i) { in math_perm_impl()
3256 long long i, factors; in math_comb_impl() local
3313 factors = PyLong_AsLongLongAndOverflow(k, &overflow); in math_comb_impl()
3320 if (factors == -1) { in math_comb_impl()
3325 if (factors == 0) { in math_comb_impl()
[all …]
/external/llvm-project/lld/test/ELF/
Deh-frame-value-format9.s15 # Code and data alignment factors.
/external/mesa3d/docs/gallium/cso/
Dblend.rst12 The blend factors largely follow the same pattern as their counterparts
15 Dual source blend factors are supported for up to 1 MRT, although
113 functions and source/destination factors. Otherwise, the incoming fragment
/external/libyuv/files/docs/
Dfiltering.md28 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/XNNPACK/src/f32-raddextexp/
Davx2-p5.c.in108 // Convert delta-exponents into scale factors:
112 // Note: delta-exponents can not exceed 0.0, thus scale factors can not exceed 1.0.
183 // Convert exponents into scale factors.
227 // Convert exponents into scale factors.
/external/XNNPACK/src/f32-vscaleextexp/
Davx2-p5.c.in102 // Convert exponents into scale factors:
146 // Convert exponents into scale factors.
186 // Convert exponents into scale factors.

1234567