| /external/mesa3d/src/gallium/state_trackers/clover/util/ |
| 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; local
47 factors.push_back(d);
51 return factors;
56 /// Walk the power set of prime factors of the n-dimensional
64 const std::vector<std::vector<T>> &factors,
67 if (d >= factors.size()) {
71 } else if (i >= factors[d].size()) {
73 return next_grid_factor(limits, grid, factors,
114 const std::vector<std::vector<T>> factors = local
[all...] |
| /external/ImageMagick/coders/ |
| exr.c | 388 factors[3];
470 factors[0]=0;
476 Sampling factors, valid values are 1x1 or 2x2.
478 if (sscanf(sampling_factor,"%d:%d:%d",factors,factors+1,factors+2) == 3)
480 if ((factors[0] == factors[1]) && (factors[1] == factors[2])
381 factors[3]; local
[all...] |
| jpeg.c | 995 (void) LogMagickEvent(CoderEvent,GetMagickModule(),"Sampling Factors: %s",
2468 **factors; local
[all...] |
| /prebuilts/go/darwin-x86/test/fixedbugs/ |
| issue16733.go | 7 // Issue 16733: don't fold constant factors into a multiply
|
| /prebuilts/go/linux-x86/test/fixedbugs/ |
| issue16733.go | 7 // Issue 16733: don't fold constant factors into a multiply
|
| /external/opencv/cxcore/src/ |
| cxdxt.cpp | 177 icvDFTFactorize( int n, int* factors )
183 factors[0] = n;
190 factors[nf++] = f;
199 factors[nf++] = f;
211 factors[nf++] = n;
213 f = (factors[0] & 1) == 0;
215 CV_SWAP( factors[i], factors[nf-i-1+f], j );
221 icvDFTInit( int n0, int nf, int* factors, int* itab, int elem_size, void* _wave, int inv_itab )
224 int n = factors[0], m = 0
[all...] |
| /external/speex/libspeex/ |
| kiss_fft.c | 327 int * factors,
331 const int p=*factors++; /* the radix */
332 const int m=*factors++; /* stage's fft length/p */
347 kf_shuffle( Fout , f, fstride*p, in_stride, factors,st);
360 int * factors,
369 const int p=*factors++; /* the radix */
370 const int m=*factors++; /* stage's fft length/p */
385 kf_work( Fout , f, fstride*p, in_stride, factors,st, N*p, fstride*in_stride, m);
416 kf_work( Fout , f, fstride*p, in_stride, factors,st, N*p, fstride*in_stride, m);
450 p = n; /* no more factors, skip to end *
[all...] |
| _kiss_fft_guts.h | 26 /* e.g. an fft of length 128 has 4 factors
34 int factors[2*MAXFACTORS]; member in struct:kiss_fft_state
|
| /external/libopus/celt/ |
| kiss_fft.c | 323 opus_int16 * factors,
327 const int p=*factors++; /* the radix */
328 const int m=*factors++; /* stage's fft length/p */
343 compute_bitrev_table( Fout , f, fstride*p, in_stride, factors,st);
371 p = n; /* no more factors, skip to end */
441 size_t memneeded = sizeof(struct kiss_fft_state); /* twiddle factors*/
477 if (!kf_factor(nfft,st->factors))
486 compute_bitrev_table(0, bitrev, 1,1, st->factors,st);
536 p = st->factors[2*L];
537 m = st->factors[2*L+1]
[all...] |
| kiss_fft.h | 76 /* e.g. an fft of length 128 has 4 factors
93 opus_int16 factors[2*MAXFACTORS]; member in struct:kiss_fft_state
|
| /external/icu/icu4c/source/common/ |
| unames.cpp | 773 writeFactorSuffix(const uint16_t *factors, uint16_t count,
782 /* write elements according to the factors */
786 * with the factors of this algorithm
792 factor=factors[i];
798 * guarantees here that code<=factors[0]
828 /* skip the rest of the strings for this factors[i] */
829 factor=(uint16_t)(factors[i]-indexes[i]-1);
905 const uint16_t *factors=(const uint16_t *)(range+1); local
907 const char *s=(const char *)(factors+count);
915 bufferPos+=writeFactorSuffix(factors, count
995 const uint16_t *factors=(const uint16_t *)(range+1); local
1124 const uint16_t *factors=(const uint16_t *)(range+1); local
1238 const uint16_t *factors=(const uint16_t *)(range+1); local
[all...] |
| /development/cmds/monkey/src/com/android/commands/monkey/ |
| MonkeySourceRandom.java | 191 // if verbose, show factors
226 * See if any key exists for non-zero factors.
235 * set the factors
237 * @param factors percentages for each type of event
239 public void setFactors(float factors[]) {
241 if (factors.length < c) {
242 c = factors.length;
245 mFactors[i] = factors[i];
|
| /external/libopus/celt/dump_modes/ |
| dump_modes_arm_ne10.c | 80 /* cfg->factors */
89 fprintf(file, "%d,%c", cfg->factors[j],(j+16)%15==0?'\n':' ');
|
| dump_modes.c | 190 fprintf (file, "%d, ", mode->mdct.kfft[k]->factors[j]);
191 fprintf (file, "}, /* factors */\n");
|
| /external/libavc/common/arm/ |
| 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
[all...] |
| /prebuilts/go/darwin-x86/src/math/big/ |
| rat.go | 67 // Preconditions: b is non-zero; a and b have no common factors.
165 // Preconditions: b is non-zero; a and b have no common factors.
|
| /prebuilts/go/linux-x86/src/math/big/ |
| rat.go | 67 // Preconditions: b is non-zero; a and b have no common factors.
165 // Preconditions: b is non-zero; a and b have no common factors.
|
| /external/libvpx/libvpx/vpx_dsp/x86/ |
| vpx_subpixel_bilinear_sse2.asm | 39 pmullw xmm0, xmm4 ;multiply the filter factors
|
| vpx_high_subpixel_8t_sse2.asm | 67 pmaddwd xmm0, k0k6 ;multiply the filter factors
113 movdqa k0k1, xmm0 ;store filter factors on stack
|
| vpx_subpixel_8t_sse2.asm | 61 pmullw xmm0, k0k1 ;multiply the filter factors
113 movdqa k0, xmm0 ;store filter factors on stack
|
| vpx_high_subpixel_bilinear_sse2.asm | 46 pmaddwd xmm0, xmm4 ;multiply the filter factors
|
| /external/mesa3d/docs/specs/ |
| MESA_texture_signed_rgba.spec | 111 127 (that is, uses different scale factors for negative and positive
|
| /prebuilts/gradle-plugin/com/android/tools/chartlib/chartlib/24.4.0-beta3/ |
| chartlib-24.4.0-beta3.jar | |
| /prebuilts/gradle-plugin/com/android/tools/chartlib/chartlib/24.4.0-beta6/ |
| chartlib-24.4.0-beta6.jar | |
| /prebuilts/go/darwin-x86/src/image/jpeg/ |
| scan.go | 107 return FormatError("total sampling factors too large")
|
