Searched refs:order (Results 1 - 25 of 900) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/
H A DomxSP_FFTGetBufSize_C_FC32.c22 * required for the length 2^order complex FFT and IFFT functions. The function
28 * order - base-2 logarithm of the desired block length; valid in the range
43 OMXResult omxSP_FFTGetBufSize_C_FC32(OMX_INT order, OMX_INT *pSize) { argument
44 if (!pSize || (order < 1) || (order > TWIDDLE_TABLE_ORDER))
51 return omxSP_FFTGetBufSize_C_SC32(order, pSize);
H A DomxSP_FFTGetBufSize_R_F32.c22 * 2^order real FFT and IFFT functions.
29 * [in] order base-2 logarithm of the length; valid in the range
39 OMXResult omxSP_FFTGetBufSize_R_F32(OMX_INT order, OMX_INT *pSize) { argument
40 if (!pSize || (order < 1) || (order > TWIDDLE_TABLE_ORDER))
48 return omxSP_FFTGetBufSize_R_S32(order, pSize);
H A DomxSP_FFTGetBufSize_C_SC16.c39 * required for the length 2^order complex FFT and IFFT functions. The function
45 * order - base-2 logarithm of the desired block length; valid in the range
63 OMX_INT order,
69 /* Check for order zero */
70 if (order == 0)
77 N = 1 << order;
62 omxSP_FFTGetBufSize_C_SC16( OMX_INT order, OMX_INT *pSize) argument
H A DomxSP_FFTGetBufSize_C_SC32.c39 * required for the length 2^order complex FFT and IFFT functions. The function
45 * order - base-2 logarithm of the desired block length; valid in the range
62 OMX_INT order,
68 /* Check for order zero */
69 if (order == 0)
76 N = 1 << order;
61 omxSP_FFTGetBufSize_C_SC32( OMX_INT order, OMX_INT *pSize) argument
H A DomxSP_FFTGetBufSize_R_S16.c31 * 2^order real FFT and IFFT functions.
38 * [in] order base-2 logarithm of the length; valid in the range
48 OMXResult omxSP_FFTGetBufSize_R_S16(OMX_INT order, OMX_INT *pSize) { argument
52 if (order == 0) {
56 NBy2 = 1 << (order - 1);
H A DomxSP_FFTGetBufSize_R_S16S32.c38 * 2^order real FFT and IFFT functions.
45 * [in] order base-2 logarithm of the length; valid in the range
56 OMX_INT order,
63 /* Check for order zero */
64 if (order == 0)
72 NBy2 = 1 << (order - 1);
55 omxSP_FFTGetBufSize_R_S16S32( OMX_INT order, OMX_INT *pSize ) argument
H A DomxSP_FFTGetBufSize_R_S32.c38 * 2^order real FFT and IFFT functions.
45 * [in] order base-2 logarithm of the length; valid in the range
56 OMX_INT order,
63 /* Check for order zero */
64 if (order == 0)
72 NBy2 = 1 << (order - 1);
55 omxSP_FFTGetBufSize_R_S32( OMX_INT order, OMX_INT *pSize ) argument
/external/chromium_org/third_party/openmax_dl/dl/sp/src/mips/
H A DomxSP_FFTGetBufSize_R_F32.c16 OMXResult omxSP_FFTGetBufSize_R_F32(OMX_INT order, OMX_INT* pSize) { argument
19 if (!pSize || (order < 1) || (order > TWIDDLE_TABLE_ORDER))
22 /* For order larger than 4, compute Real FFT as Complex FFT of (order - 1). */
23 if (order > 4) {
24 fft_size = 1 << (order - 1);
25 offset_lut_size = (SUBTRANSFORM_CONST >> (16 - order)) | 1;
27 fft_size = 1 << order;
28 offset_lut_size = (SUBTRANSFORM_CONST >> (17 - order)) |
[all...]
/external/chromium_org/third_party/icu/source/i18n/unicode/
H A Dcoleitr.h66 * The key of a character, is an integer composed of primary order(short),
67 * secondary order(char), and tertiary order(char). Java strictly defines the
82 * int32_t order = c->next(success);
84 * order = c->previous(success);
91 * The method next() returns the collation order of the next character based on
93 * collation order of the previous character based on the comparison level of
100 * Hence at the next call of next() or previous(), the first or last collation order,
101 * or collation order at the spefcifieid position will be returned. If a change of
107 * Character based on the comparison level of the collator. A collation order
343 primaryOrder(int32_t order) argument
354 secondaryOrder(int32_t order) argument
365 tertiaryOrder(int32_t order) argument
375 isIgnorable(int32_t order) argument
[all...]
/external/chromium_org/third_party/openmax_dl/dl/sp/src/x86/
H A DomxSP_FFTGetBufSize_R_F32.c21 * 2^order real FFT and IFFT functions.
28 * [in] order base-2 logarithm of the length; valid in the range
38 OMXResult omxSP_FFTGetBufSize_R_F32(OMX_INT order, OMX_INT *pSize) { argument
42 if (!pSize || (order < 1) || (order > TWIDDLE_TABLE_ORDER))
45 n_by_2 = 1 << (order - 1);
/external/chromium_org/third_party/opus/src/silk/float/
H A Dschur_FLP.c35 silk_float refl_coef[], /* O reflection coefficients (length order) */
36 const silk_float auto_corr[], /* I autocorrelation sequence (length order+1) */
37 opus_int order /* I order */
44 silk_assert( order==6||order==8||order==10||order==12||order==14||order
[all...]
H A Dwarped_autocorrelation_FLP.c36 silk_float *corr, /* O Result [order + 1] */
40 const opus_int order /* I Correlation order (even) */
49 silk_assert( ( order & 1 ) == 0 );
55 for( i = 0; i < order; i += 2 ) {
65 state[ order ] = tmp1;
66 C[ order ] += state[ 0 ] * tmp1;
70 for( i = 0; i < order + 1; i++ ) {
/external/libopus/silk/float/
H A Dschur_FLP.c35 silk_float refl_coef[], /* O reflection coefficients (length order) */
36 const silk_float auto_corr[], /* I autocorrelation sequence (length order+1) */
37 opus_int order /* I order */
44 silk_assert( order==6||order==8||order==10||order==12||order==14||order
[all...]
/external/libexif/libexif/
H A Dexif-byte-order.h1 /*! \file exif-byte-order.h
30 /*! Which byte order to use */
32 /*! Big-endian byte order */
34 /*! Little-endian byte order */
38 /*! Return a short, localized, textual name for the given byte order.
39 * \param[in] order byte order
40 * \return localized textual name of the byte order
42 const char *exif_byte_order_get_name (ExifByteOrder order);
H A Dexif-byte-order.c1 /* exif-byte-order.c
23 #include <libexif/exif-byte-order.h>
29 exif_byte_order_get_name (ExifByteOrder order) argument
31 switch (order) {
H A Dexif-utils.h30 #include <libexif/exif-byte-order.h>
71 * \param[in] order byte order of raw value
74 ExifShort exif_get_short (const unsigned char *b, ExifByteOrder order);
79 * \param[in] order byte order of raw value
82 ExifSShort exif_get_sshort (const unsigned char *b, ExifByteOrder order);
87 * \param[in] order byte order of raw value
90 ExifLong exif_get_long (const unsigned char *b, ExifByteOrder order);
[all...]
/external/chromium_org/third_party/opus/src/silk/fixed/
H A Dschur64_FIX.c37 opus_int32 rc_Q16[], /* O Reflection coefficients [order] Q16 */
38 const opus_int32 c[], /* I Correlations [order+1] */
39 opus_int32 order /* I Prediction order */
46 silk_assert( order==6||order==8||order==10||order==12||order==14||order
[all...]
H A Dschur_FIX.c37 opus_int16 *rc_Q15, /* O reflection coefficients [order] Q15 */
38 const opus_int32 *c, /* I correlations [order+1] */
39 const opus_int32 order /* I prediction order */
46 silk_assert( order==6||order==8||order==10||order==12||order==14||order
[all...]
H A DcorrMatrix_FIX.c40 const opus_int16 *x, /* I x vector [L + order - 1] used to form data matrix X */
43 const opus_int order, /* I Max lag for correlation */
44 opus_int32 *Xt, /* O Pointer to X'*t correlation vector [order] */
52 ptr1 = &x[ order - 1 ]; /* Points to first sample of column 0 of X: X[:,0] */
57 for( lag = 0; lag < order; lag++ ) {
67 for( lag = 0; lag < order; lag++ ) {
76 const opus_int16 *x, /* I x vector [L + order - 1] used to form data matrix X */
78 const opus_int order, /* I Max lag for correlation */
80 opus_int32 *XX, /* O Pointer to X'*X correlation matrix [ order x order ] */
39 silk_corrVector_FIX( const opus_int16 *x, const opus_int16 *t, const opus_int L, const opus_int order, opus_int32 *Xt, const opus_int rshifts ) argument
75 silk_corrMatrix_FIX( const opus_int16 *x, const opus_int L, const opus_int order, const opus_int head_room, opus_int32 *XX, opus_int *rshifts ) argument
[all...]
/external/libopus/silk/fixed/
H A Dschur64_FIX.c37 opus_int32 rc_Q16[], /* O Reflection coefficients [order] Q16 */
38 const opus_int32 c[], /* I Correlations [order+1] */
39 opus_int32 order /* I Prediction order */
46 silk_assert( order==6||order==8||order==10||order==12||order==14||order
[all...]
H A Dschur_FIX.c37 opus_int16 *rc_Q15, /* O reflection coefficients [order] Q15 */
38 const opus_int32 *c, /* I correlations [order+1] */
39 const opus_int32 order /* I prediction order */
46 silk_assert( order==6||order==8||order==10||order==12||order==14||order
[all...]
/external/chromium_org/third_party/webrtc/common_audio/signal_processing/
H A Dreal_fft.c18 int order; member in struct:RealFFT
21 struct RealFFT* WebRtcSpl_CreateRealFFTC(int order) { argument
24 if (order > kMaxFFTOrder || order < 0) {
32 self->order = order;
53 int n = 1 << self->order;
54 // The complex-value FFT implementation needs a buffer to hold 2^order
64 WebRtcSpl_ComplexBitReverse(complex_buffer, self->order);
65 result = WebRtcSpl_ComplexFFT(complex_buffer, self->order,
107 WebRtcSpl_CreateRealFFTNeon(int order) argument
[all...]
/external/chromium_org/base/message_loop/
H A Dmessage_loop_test.cc144 // Test that two tasks with different delays run in the right order.
169 // Test that two tasks with the same delay run in the order in which they
454 void RecursiveFunc(TaskList* order, int cookie, int depth, argument
456 order->RecordStart(RECURSIVE, cookie);
462 Bind(&RecursiveFunc, order, cookie, depth - 1, is_reentrant));
464 order->RecordEnd(RECURSIVE, cookie);
467 void QuitFunc(TaskList* order, int cookie) { argument
468 order->RecordStart(QUITMESSAGELOOP, cookie);
470 order->RecordEnd(QUITMESSAGELOOP, cookie);
477 TaskList order; local
508 RecursiveSlowFunc(TaskList* order, int cookie, int depth, bool is_reentrant) argument
514 OrderedFunc(TaskList* order, int cookie) argument
524 TaskList order; local
564 TaskList order; local
597 TaskList order; local
618 FuncThatPumps(TaskList* order, int cookie) argument
627 SleepFunc(TaskList* order, int cookie, TimeDelta delay) argument
639 TaskList order; local
690 FuncThatRuns(TaskList* order, int cookie, RunLoop* run_loop) argument
707 TaskList order; local
742 TaskList order; local
772 TaskList order; local
802 TaskList order; local
835 TaskList order; local
904 TaskList order; local
925 TaskList order; local
952 TaskList order; local
[all...]
/external/icu/icu4c/source/i18n/unicode/
H A Dcoleitr.h66 * The key of a character, is an integer composed of primary order(short),
67 * secondary order(char), and tertiary order(char). Java strictly defines the
82 * int32_t order = c->next(success);
84 * order = c->previous(success);
91 * The method next() returns the collation order of the next character based on
93 * collation order of the previous character based on the comparison level of
100 * Hence at the next call of next() or previous(), the first or last collation order,
101 * or collation order at the spefcifieid position will be returned. If a change of
107 * Character based on the comparison level of the collator. A collation order
380 primaryOrder(int32_t order) argument
385 secondaryOrder(int32_t order) argument
390 tertiaryOrder(int32_t order) argument
395 isIgnorable(int32_t order) argument
[all...]
/external/chromium_org/third_party/speex/libspeex/
H A Dquant_lsp.h57 void lsp_quant_nb(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits);
60 void lsp_unquant_nb(spx_lsp_t *lsp, int order, SpeexBits *bits);
63 void lsp_quant_lbr(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits);
66 void lsp_unquant_lbr(spx_lsp_t *lsp, int order, SpeexBits *bits);
69 void lsp_quant_high(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits);
72 void lsp_unquant_high(spx_lsp_t *lsp, int order, SpeexBits *bits);

Completed in 429 milliseconds

1234567891011>>