| /third_party/mesa3d/src/gallium/frontends/clover/util/ |
| H A D | factor.hpp | 31 /// Calculate all prime integer factors of \p x.
34 /// factors have been collected to reach the product \p limit.
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()
56 /// Walk the power set of prime factors of the n-dimensional
64 const std::vector<std::vector<T>> &factors, in next_grid_factor()
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()
62 next_grid_factor(const std::pair<T, std::vector<T>> &limits, const std::vector<T> &grid, const std::vector<std::vector<T>> &factors, std::pair<T, std::vector<T>> block, unsigned d = 0, unsigned i = 0) next_grid_factor() argument
114 const std::vector<std::vector<T>> factors = find_grid_optimal_factor() local
[all...] |
| /third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/ |
| H A D | RangeTreeFactorizer.java | 34 /** Strategies to control how merging is achieved when building factors.*/
71 List<RangeTree> factors = new ArrayList<>(); in factor()
72 // Start with the "naive" factors (splitting by length) from longest to shortest. in factor()
74 factors.add(ranges.intersect(RangeTree.from(RangeSpecification.any(n)))); in factor()
76 // Now attempt to merge as much of each of the shorter factors as possible into the longer ones. in factor()
77 // In each loop we subsume a candidate factor into previous factors, either in whole or in part. in factor()
79 while (index < factors.size()) { in factor()
80 // Merge (as much as possible) each "naive" factor into earlier factors. in factor()
81 RangeTree r = factors.get(index); in factor()
83 RangeTree merged = new RangeTreeFactorizer(factors in factor()
[all...] |
| /third_party/openssl/crypto/rsa/ |
| H A D | rsa_backend.c | 68 STACK_OF(BIGNUM) *factors = NULL, *exps = NULL, *coeffs = NULL; in ossl_rsa_fromdata()
91 if (!collect_numbers(factors = sk_BIGNUM_new_null(), params, in ossl_rsa_fromdata()
100 if (sk_BIGNUM_num(factors) != 0 in ossl_rsa_fromdata()
101 && !ossl_rsa_set0_all_params(rsa, factors, exps, coeffs)) in ossl_rsa_fromdata()
106 sk_BIGNUM_free(factors); in ossl_rsa_fromdata()
115 sk_BIGNUM_pop_free(factors, BN_free); in ossl_rsa_fromdata()
128 STACK_OF(BIGNUM_const) *factors = sk_BIGNUM_const_new_null(); in DEFINE_SPECIAL_STACK_OF_CONST()
132 if (rsa == NULL || factors == NULL || exps == NULL || coeffs == NULL) in DEFINE_SPECIAL_STACK_OF_CONST()
136 ossl_rsa_get0_all_params(rsa, factors, exps, coeffs); in DEFINE_SPECIAL_STACK_OF_CONST()
144 int numprimes = sk_BIGNUM_const_num(factors); in DEFINE_SPECIAL_STACK_OF_CONST()
[all...] |
| /third_party/node/deps/openssl/openssl/crypto/rsa/ |
| H A D | rsa_backend.c | 68 STACK_OF(BIGNUM) *factors = NULL, *exps = NULL, *coeffs = NULL; in ossl_rsa_fromdata()
91 if (!collect_numbers(factors = sk_BIGNUM_new_null(), params, in ossl_rsa_fromdata()
100 if (sk_BIGNUM_num(factors) != 0 in ossl_rsa_fromdata()
101 && !ossl_rsa_set0_all_params(rsa, factors, exps, coeffs)) in ossl_rsa_fromdata()
106 sk_BIGNUM_free(factors); in ossl_rsa_fromdata()
115 sk_BIGNUM_pop_free(factors, BN_free); in ossl_rsa_fromdata()
128 STACK_OF(BIGNUM_const) *factors = sk_BIGNUM_const_new_null(); in DEFINE_SPECIAL_STACK_OF_CONST()
132 if (rsa == NULL || factors == NULL || exps == NULL || coeffs == NULL) in DEFINE_SPECIAL_STACK_OF_CONST()
136 ossl_rsa_get0_all_params(rsa, factors, exps, coeffs); in DEFINE_SPECIAL_STACK_OF_CONST()
149 factors) in DEFINE_SPECIAL_STACK_OF_CONST()
[all...] |
| /third_party/pulseaudio/speex/libspeexdsp/ |
| H A D | kiss_fft.c | 327 int * factors, in kf_shuffle()
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()
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()
450 p = n; /* no more factors, ski in kf_factor()
322 kf_shuffle( kiss_fft_cpx * Fout, const kiss_fft_cpx * f, const size_t fstride, int in_stride, int * factors, const kiss_fft_cfg st ) kf_shuffle() argument
355 kf_work( kiss_fft_cpx * Fout, const kiss_fft_cpx * f, const size_t fstride, int in_stride, int * factors, const kiss_fft_cfg st, int N, int s2, int m2 ) kf_work() argument
[all...] |
| H A D | _kiss_fft_guts.h | 26 /* e.g. an fft of length 128 has 4 factors
34 int factors[2*MAXFACTORS]; member
|
| /third_party/node/deps/openssl/openssl/providers/implementations/encode_decode/ |
| H A D | encode_key2text.c | 635 STACK_OF(BIGNUM_const) *factors = NULL; in rsa_to_text()
647 factors = sk_BIGNUM_const_new_null(); in rsa_to_text()
651 if (factors == NULL || exps == NULL || coeffs == NULL) { in rsa_to_text()
667 ossl_rsa_get0_all_params((RSA *)rsa, factors, exps, coeffs); in rsa_to_text()
668 primes = sk_BIGNUM_const_num(factors); in rsa_to_text()
690 sk_BIGNUM_const_value(factors, 0))) in rsa_to_text()
693 sk_BIGNUM_const_value(factors, 1))) in rsa_to_text()
704 for (i = 2; i < sk_BIGNUM_const_num(factors); i++) { in rsa_to_text()
708 sk_BIGNUM_const_value(factors, i))) in rsa_to_text()
774 sk_BIGNUM_const_free(factors); in rsa_to_text()
[all...] |
| /third_party/openssl/providers/implementations/encode_decode/ |
| H A D | encode_key2text.c | 648 STACK_OF(BIGNUM_const) *factors = NULL; in rsa_to_text()
660 factors = sk_BIGNUM_const_new_null(); in rsa_to_text()
664 if (factors == NULL || exps == NULL || coeffs == NULL) { in rsa_to_text()
680 ossl_rsa_get0_all_params((RSA *)rsa, factors, exps, coeffs); in rsa_to_text()
681 primes = sk_BIGNUM_const_num(factors); in rsa_to_text()
703 sk_BIGNUM_const_value(factors, 0))) in rsa_to_text()
706 sk_BIGNUM_const_value(factors, 1))) in rsa_to_text()
717 for (i = 2; i < sk_BIGNUM_const_num(factors); i++) { in rsa_to_text()
721 sk_BIGNUM_const_value(factors, i))) in rsa_to_text()
787 sk_BIGNUM_const_free(factors); in rsa_to_text()
[all...] |
| /third_party/mesa3d/src/gallium/auxiliary/draw/ |
| H A D | draw_tess.c | 275 struct pipe_tessellation_factors *factors) in llvm_fetch_tess_factors()
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()
355 struct pipe_tessellation_factors factors; in draw_tess_eval_shader_run() local
366 llvm_fetch_tess_factors(shader, i, num_input_vertices_per_patch, &factors); in draw_tess_eval_shader_run()
368 /* tessellate with the factors for this primitive */ in draw_tess_eval_shader_run()
369 p_tessellate(ptess, &factors, &data); in draw_tess_eval_shader_run()
393 llvm_tes_run(shader, i, num_input_vertices_per_patch, &data, &factors, (struc in draw_tess_eval_shader_run()
272 llvm_fetch_tess_factors(struct draw_tess_eval_shader *shader, unsigned patch_id, unsigned num_vertices, struct pipe_tessellation_factors *factors) llvm_fetch_tess_factors() argument
[all...] |
| /third_party/python/Modules/_decimal/libmpdec/literature/ |
| H A D | fnt.py | 55 # factors f of p-1, r**((p-1)/f) =/= 1 (mod p).
59 factors of P-1, E lists the number of occurrences of each factor."""
65 def is_primitive_root(r, p, factors, exponents):
67 if p != prod(factors, exponents) + 1:
69 for f in factors:
94 # Prime factors of P-1 and their exponents:
134 # Prime factors of P-1 and their exponents:
|
| /third_party/ffmpeg/libavutil/ |
| H A D | tx.c | 282 .factors[0] = TX_FACTOR_ANY,
354 av_bprintf(&bp, "%s, factors: [", cd->min_len != cd->max_len ? "]" : ""); in print_cd_info()
356 if (i && cd->factors[i]) in print_cd_info()
358 if (cd->factors[i] == TX_FACTOR_ANY) in print_cd_info()
360 else if (cd->factors[i]) in print_cd_info()
361 av_bprintf(&bp, "%i", cd->factors[i]); in print_cd_info()
399 /* We want all factors to completely cover the length */
405 int factor = cd->factors[i]; in check_cd_factors()
411 /* No more factors */ in check_cd_factors()
529 /* Check for factors */ in ff_tx_init_subtx()
[all...] |
| H A D | tx_template.c | 50 /* Other factors' tables */
58 int factors[TX_MAX_SUB]; /* Must be sorted high -> low */ member
164 while ((f = nptwo_tabs_init_once[i].factors[f_idx++])) { in ff_tx_init_tabs()
542 .factors[0] = 2, \
722 .factors[0] = 2,
735 .factors[0] = 2,
773 .factors[0] = TX_FACTOR_ANY,
789 int sub_len = len / cd->factors[0]; in ff_tx_fft_pfa_init()
800 if ((ret = ff_tx_gen_compound_mapping(s, cd->factors[0], sub_len))) in ff_tx_fft_pfa_init()
840 .factors
[all...] |
| H A D | tx_priv.h | 77 .factors = { f1, f2 }, \
174 /* Maximum amount of subtransform functions, subtransforms and factors. Arbitrary. */
186 int factors[TX_MAX_SUB]; /* Length factors */ member
188 * supports all factors. Otherwise, if other
189 * factors are present, it signals that whatever
191 * other factors are a component of the length */
220 TXComplex *exp; /* Any non-pre-baked multiplication factors needed */
304 * for all factors of a length. */
|
| /third_party/mesa3d/src/panfrost/lib/ |
| H A D | pan_blend.c | 526 const char *factors[] = { in get_equation_str() local
541 assert(rt_state->equation.rgb_src_factor < ARRAY_SIZE(factors)); in get_equation_str()
542 assert(rt_state->equation.rgb_dst_factor < ARRAY_SIZE(factors)); in get_equation_str()
549 factors[rt_state->equation.rgb_src_factor], in get_equation_str()
551 factors[rt_state->equation.rgb_dst_factor], in get_equation_str()
560 assert(rt_state->equation.alpha_src_factor < ARRAY_SIZE(factors)); in get_equation_str()
561 assert(rt_state->equation.alpha_dst_factor < ARRAY_SIZE(factors)); in get_equation_str()
565 factors[rt_state->equation.alpha_src_factor], in get_equation_str()
567 factors[rt_state->equation.alpha_dst_factor]); in get_equation_str()
|
| /third_party/icu/icu4c/source/common/ |
| H A D | unames.cpp | 773 writeFactorSuffix(const uint16_t *factors, uint16_t count, in writeFactorSuffix() argument
782 /* write elements according to the factors */ in writeFactorSuffix()
786 * with the factors of this algorithm in writeFactorSuffix()
792 factor=factors[i]; in writeFactorSuffix()
798 * guarantees here that code<=factors[0] in writeFactorSuffix()
828 /* skip the rest of the strings for this 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, coun in getAlgName()
995 const uint16_t *factors=(const uint16_t *)(range+1); enumAlgNames() local
1124 const uint16_t *factors=(const uint16_t *)(range+1); findAlgName() local
1238 const uint16_t *factors=(const uint16_t *)(range+1); calcAlgNameSetsLengths() local
[all...] |
| /third_party/node/deps/icu-small/source/common/ |
| H A D | unames.cpp | 773 writeFactorSuffix(const uint16_t *factors, uint16_t count, in writeFactorSuffix() argument
782 /* write elements according to the factors */ in writeFactorSuffix()
786 * with the factors of this algorithm in writeFactorSuffix()
792 factor=factors[i]; in writeFactorSuffix()
798 * guarantees here that code<=factors[0] in writeFactorSuffix()
828 /* skip the rest of the strings for this 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, coun in getAlgName()
995 const uint16_t *factors=(const uint16_t *)(range+1); enumAlgNames() local
1124 const uint16_t *factors=(const uint16_t *)(range+1); findAlgName() local
1238 const uint16_t *factors=(const uint16_t *)(range+1); calcAlgNameSetsLengths() local
[all...] |
| /third_party/skia/third_party/externals/icu/source/common/ |
| H A D | unames.cpp | 773 writeFactorSuffix(const uint16_t *factors, uint16_t count, in writeFactorSuffix() argument
782 /* write elements according to the factors */ in writeFactorSuffix()
786 * with the factors of this algorithm in writeFactorSuffix()
792 factor=factors[i]; in writeFactorSuffix()
798 * guarantees here that code<=factors[0] in writeFactorSuffix()
828 /* skip the rest of the strings for this 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, coun in getAlgName()
995 const uint16_t *factors=(const uint16_t *)(range+1); enumAlgNames() local
1124 const uint16_t *factors=(const uint16_t *)(range+1); findAlgName() local
1238 const uint16_t *factors=(const uint16_t *)(range+1); calcAlgNameSetsLengths() local
[all...] |
| /third_party/node/deps/openssl/openssl/util/perl/OpenSSL/ |
| H A D | config.pm | 344 my @factors = (100, 1);
345 while (@numbers && @factors) {
346 $CCVER += shift(@numbers) * shift(@factors)
393 my @factors = (100, 1);
395 while (@numbers && @factors) {
396 $v += shift(@numbers) * shift(@factors)
|
| /third_party/openssl/util/perl/OpenSSL/ |
| H A D | config.pm | 343 my @factors = (100, 1);
344 while (@numbers && @factors) {
345 $CCVER += shift(@numbers) * shift(@factors)
385 my @factors = (100, 1);
387 while (@numbers && @factors) {
388 $v += shift(@numbers) * shift(@factors)
|
| /third_party/vk-gl-cts/external/vulkancts/modules/vulkan/ray_tracing/ |
| H A D | vktRayTracingBuildTests.cpp | 616 const deUint32 factors[] = { 1, 4 }; in buildTest() local
624 for (size_t factorNdx = 0; factorNdx < DE_LENGTH_OF_ARRAY(factors); ++factorNdx) in buildTest()
629 const deUint32 factor = factors[factorNdx]; in buildTest()
655 for (size_t factorNdx = 0; factorNdx < DE_LENGTH_OF_ARRAY(factors); ++factorNdx) in buildTest()
660 const deUint32 factor = factors[factorNdx]; in buildTest()
686 for (size_t factorNdx = 0; factorNdx < DE_LENGTH_OF_ARRAY(factors); ++factorNdx) in buildTest()
691 const deUint32 factor = factors[factorNdx]; in buildTest()
|
| /third_party/vk-gl-cts/external/vulkancts/modules_no_buildgn/vulkan/ray_tracing/ |
| H A D | vktRayTracingBuildTests.cpp | 615 const deUint32 factors[] = { 1, 4 }; in buildTest() local
623 for (size_t factorNdx = 0; factorNdx < DE_LENGTH_OF_ARRAY(factors); ++factorNdx) in buildTest()
626 const deUint32 factor = factors[factorNdx]; in buildTest()
652 for (size_t factorNdx = 0; factorNdx < DE_LENGTH_OF_ARRAY(factors); ++factorNdx) in buildTest()
655 const deUint32 factor = factors[factorNdx]; in buildTest()
681 for (size_t factorNdx = 0; factorNdx < DE_LENGTH_OF_ARRAY(factors); ++factorNdx) in buildTest()
684 const deUint32 factor = factors[factorNdx]; in buildTest()
|
| /third_party/ffmpeg/libavfilter/x86/ |
| H A D | vf_framerate.asm | 98 por m2, m3 ; interleaved factors
113 por m2, m3 ; interleaved factors
|
| /third_party/ffmpeg/libavcodec/ |
| H A D | h264_ps.c | 251 static int decode_scaling_list(GetBitContext *gb, uint8_t *factors, int size, in decode_scaling_list() argument
258 memcpy(factors, fallback_list, size * sizeof(uint8_t)); in decode_scaling_list()
270 memcpy(factors, jvt_list, size * sizeof(uint8_t)); in decode_scaling_list()
273 last = factors[scan[i]] = next ? next : last; in decode_scaling_list()
|
| /third_party/ffmpeg/libavcodec/aarch64/ |
| H A D | sbrdsp_neon.S | 21 const factors, align=4
180 movrel x6, factors
229 movrel x3, factors
|
| /third_party/skia/third_party/externals/libjpeg-turbo/simd/nasm/ |
| H A D | jsimdcfg.inc.h | 119 %define IFAST_SCALE_BITS 2 ; fractional bits in scale factors
|