Searched defs:factors (Results 1 - 9 of 9) sorted by relevance

/external/libopus/celt/
H A Dkiss_fft.h75 /* e.g. an fft of length 128 has 4 factors
86 opus_int16 factors[2*MAXFACTORS]; member in struct:kiss_fft_state
H A Dkiss_fft.c456 opus_int16 * factors,
460 const int p=*factors++; /* the radix */
461 const int m=*factors++; /* stage's fft length/p */
476 compute_bitrev_table( Fout , f, fstride*p, in_stride, factors,st);
501 p = n; /* no more factors, skip to end */
544 size_t memneeded = sizeof(struct kiss_fft_state); /* twiddle factors*/
574 if (!kf_factor(nfft,st->factors))
583 compute_bitrev_table(0, bitrev, 1,1, st->factors,st);
635 p = st->factors[2*L];
636 m = st->factors[
451 compute_bitrev_table( int Fout, opus_int16 *f, const size_t fstride, int in_stride, opus_int16 * factors, const kiss_fft_state *st ) argument
[all...]
/external/ImageMagick/coders/
H A Dexr.c388 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[
381 factors[3]; local
[all...]
H A Djpeg.c2458 " Input sampling-factors=%s",sampling_factor);
2476 **factors;
2488 factors=SamplingFactorToList(sampling_factor);
2489 if (factors != (char **) NULL)
2493 if (factors[i] == (char *) NULL)
2495 flags=ParseGeometry(factors[i],&geometry_info);
2500 factors[i]=(char *) RelinquishMagickMemory(factors[i]);
2502 factors=(char **) RelinquishMagickMemory(factors);
2468 **factors; local
[all...]
/external/opencv3/modules/core/src/
H A Ddxt.cpp132 DFTFactorize( int n, int* factors )
138 factors[0] = n;
145 factors[nf++] = f;
154 factors[nf++] = f;
166 factors[nf++] = n;
168 f = (factors[0] & 1) == 0;
170 CV_SWAP( factors[i], factors[nf-i-1+f], j );
176 DFTInit( int n0, int nf, int* factors, int* itab, int elem_size, void* _wave, int inv_itab ) argument
179 int n = factors[
[all...]
/external/speex/libspeex/
H A D_kiss_fft_guts.h26 /* e.g. an fft of length 128 has 4 factors
34 int factors[2*MAXFACTORS]; member in struct:kiss_fft_state
H A Dkiss_fft.c327 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, ski
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 ) 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 ) argument
[all...]
/external/opencv/cxcore/src/
H A Dcxdxt.cpp177 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 ) argument
224 int n = factors[
[all...]
/external/icu/icu4c/source/common/
H A Dunames.cpp771 writeFactorSuffix(const uint16_t *factors, uint16_t count, argument
780 /* write elements according to the factors */
784 * with the factors of this algorithm
790 factor=factors[i];
796 * guarantees here that code<=factors[0]
826 /* skip the rest of the strings for this factors[i] */
827 factor=(uint16_t)(factors[i]-indexes[i]-1);
903 const uint16_t *factors=(const uint16_t *)(range+1); local
905 const char *s=(const char *)(factors+count);
913 bufferPos+=writeFactorSuffix(factors, coun
993 const uint16_t *factors=(const uint16_t *)(range+1); local
1122 const uint16_t *factors=(const uint16_t *)(range+1); local
1236 const uint16_t *factors=(const uint16_t *)(range+1); local
[all...]

Completed in 172 milliseconds