/external/libopus/silk/ |
H A D | NLSF_unpack.c | 46 ec_sel_ptr = &psNLSF_CB->ec_sel[ CB1_index * psNLSF_CB->order / 2 ]; 47 for( i = 0; i < psNLSF_CB->order; i += 2 ) { 50 pred_Q8[ i ] = psNLSF_CB->pred_Q8[ i + ( entry & 1 ) * ( psNLSF_CB->order - 1 ) ]; 52 pred_Q8[ i + 1 ] = psNLSF_CB->pred_Q8[ i + ( silk_RSHIFT( entry, 4 ) & 1 ) * ( psNLSF_CB->order - 1 ) + 1 ];
|
H A D | LPC_inv_pred_gain.c | 43 const opus_int order /* I Prediction order */ 50 Anew_QA = A_QA[ order & 1 ]; 53 for( k = order - 1; k > 0; k-- ) { 110 const opus_int16 *A_Q12, /* I Prediction coefficients, Q12 [order] */ 111 const opus_int order /* I Prediction order */ 119 Anew_QA = Atmp_QA[ order & 1 ]; 122 for( k = 0; k < order; k++ ) { 130 return LPC_inverse_pred_gain_QA( Atmp_QA, order ); [all...] |
H A D | NLSF_decode.c | 36 opus_int16 x_Q10[], /* O Output [ order ] */ 37 const opus_int8 indices[], /* I Quantization indices [ order ] */ 38 const opus_uint8 pred_coef_Q8[], /* I Backward predictor coefs [ order ] */ 40 const opus_int16 order /* I Number of input values */ 46 for( i = order-1; i >= 0; i-- ) { 78 pCB_element = &psNLSF_CB->CB1_NLSF_Q8[ NLSFIndices[ 0 ] * psNLSF_CB->order ]; 79 for( i = 0; i < psNLSF_CB->order; i++ ) { 87 silk_NLSF_residual_dequant( res_Q10, &NLSFIndices[ 1 ], pred_Q8, psNLSF_CB->quantStepSize_Q16, psNLSF_CB->order ); 90 silk_NLSF_VQ_weights_laroia( W_tmp_QW, pNLSF_Q15, psNLSF_CB->order ); 93 for( i = 0; i < psNLSF_CB->order; [all...] |
/external/lldb/test/macosx/order/ |
H A D | Makefile | 4 LDFLAGS = $(CFLAGS) -Xlinker -order_file -Xlinker ./order-file
|
/external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/neon/ |
H A D | omxSP_FFTFwd_CToC_FC32_Sfs_s.S | 73 #define order r14 define 106 CLZ order,N @// N = 2^order 107 RSB order,order,#31 111 CMP order,#3 112 BGT orderGreaterthan3 @// order > 3 114 CMP order,#1 115 BGE orderGreaterthan0 @// order > 0 123 CMP order,# [all...] |
/external/chromium_org/third_party/opus/src/silk/ |
H A D | LPC_inv_pred_gain.c | 43 const opus_int order /* I Prediction order */ 50 Anew_QA = A_QA[ order & 1 ]; 53 for( k = order - 1; k > 0; k-- ) { 110 const opus_int16 *A_Q12, /* I Prediction coefficients, Q12 [order] */ 111 const opus_int order /* I Prediction order */ 119 Anew_QA = Atmp_QA[ order & 1 ]; 122 for( k = 0; k < order; k++ ) { 130 return LPC_inverse_pred_gain_QA( Atmp_QA, order ); [all...] |
H A D | NLSF_decode.c | 36 opus_int16 x_Q10[], /* O Output [ order ] */ 37 const opus_int8 indices[], /* I Quantization indices [ order ] */ 38 const opus_uint8 pred_coef_Q8[], /* I Backward predictor coefs [ order ] */ 40 const opus_int16 order /* I Number of input values */ 46 for( i = order-1; i >= 0; i-- ) { 78 pCB_element = &psNLSF_CB->CB1_NLSF_Q8[ NLSFIndices[ 0 ] * psNLSF_CB->order ]; 79 for( i = 0; i < psNLSF_CB->order; i++ ) { 87 silk_NLSF_residual_dequant( res_Q10, &NLSFIndices[ 1 ], pred_Q8, psNLSF_CB->quantStepSize_Q16, psNLSF_CB->order ); 90 silk_NLSF_VQ_weights_laroia( W_tmp_QW, pNLSF_Q15, psNLSF_CB->order ); 93 for( i = 0; i < psNLSF_CB->order; [all...] |
/external/flac/libFLAC/include/private/ |
H A D | lpc.h | 90 * IN 0 < max_order <= FLAC__MAX_LPC_ORDER max LP order to compute 91 * OUT lp_coeff[0,max_order-1][0,max_order-1] LP coefficients for each order 94 * OUT error[0,max_order-1] error for each order (more 99 * Example: if max_order is 9, the LP coefficients for order 9 will be 100 * in lp_coeff[8][0,8], the LP coefficients for order 8 will be 111 * IN lp_coeff[0,order-1] LP coefficients 112 * IN order LP order 116 * OUT qlp_coeff[0,order-1] quantized coefficients 125 int FLAC__lpc_quantize_coefficients(const FLAC__real lp_coeff[], unsigned order, unsigne [all...] |
/external/chromium_org/third_party/opus/src/silk/float/ |
H A D | k2a_FLP.c | 36 silk_float *A, /* O prediction coefficients [order] */ 37 const silk_float *rc, /* I reflection coefficients [order] */ 38 opus_int32 order /* I prediction order */ 44 for( k = 0; k < order; k++ ) {
|
/external/libexif/libexif/canon/ |
H A D | mnote-canon-entry.h | 25 #include <libexif/exif-byte-order.h> 38 ExifByteOrder order; member in struct:_MnoteCanonEntry
|
/external/libexif/libexif/olympus/ |
H A D | mnote-olympus-entry.h | 25 #include <libexif/exif-byte-order.h> 38 ExifByteOrder order; member in struct:_MnoteOlympusEntry
|
/external/libexif/libexif/pentax/ |
H A D | mnote-pentax-entry.h | 25 #include <libexif/exif-byte-order.h> 38 ExifByteOrder order; member in struct:_MnotePentaxEntry
|
/external/libopus/silk/float/ |
H A D | k2a_FLP.c | 36 silk_float *A, /* O prediction coefficients [order] */ 37 const silk_float *rc, /* I reflection coefficients [order] */ 38 opus_int32 order /* I prediction order */ 44 for( k = 0; k < order; k++ ) {
|
/external/skia/src/ports/ |
H A D | SkFontConfigParser_android.h | 26 * about each file. Order is the priority order for the font. This is 27 * used internally to determine the order in which to place fallback fonts as 31 FontFamily() : fIsFallbackFont(false), order(-1) {} 36 int order; // only used internally by SkFontConfigParser member in struct:FontFamily
|
/external/chromium_org/third_party/webrtc/common_audio/signal_processing/ |
H A D | auto_correlation.c | 15 int order, 23 if (order > in_vector_length) { 26 } else if (order < 0) { 27 order = in_vector_length; 33 // In order to avoid overflow when computing the sum we should scale the 51 for (i = 0; i < order + 1; i++) { 67 return order + 1; 13 WebRtcSpl_AutoCorrelation(const int16_t* in_vector, int in_vector_length, int order, int32_t* result, int* scale) argument
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | ConvexHull.cpp | 20 The indices returned in order describe the convex hull. 22 int convex_hull(const Cubic& cubic, char order[4]) { argument 32 order[0] = yMin; 48 order[1] = side1; 49 order[2] = side2; 78 order[0] = yMin; 79 order[1] = least; 84 order[2] = midX; 90 order[2] = most; 93 order[ [all...] |
/external/skia/experimental/Intersection/ |
H A D | ConvexHull.cpp | 20 The indices returned in order describe the convex hull. 22 int convex_hull(const Cubic& cubic, char order[4]) { argument 32 order[0] = yMin; 48 order[1] = side1; 49 order[2] = side2; 78 order[0] = yMin; 79 order[1] = least; 84 order[2] = midX; 90 order[2] = most; 93 order[ [all...] |
/external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/armv7/ |
H A D | omxSP_FFTFwd_CToC_FC32_Sfs_s.S | 65 #define order r14 define 97 CLZ order,N @// N = 2^order 98 RSB order,order,#31 103 CMP order,#1 104 BGT orderGreaterthan1 @// order > 1 105 @// order = 0, 1 112 @// Handle order = 1 122 TST order, # [all...] |
/external/chromium_org/third_party/opus/src/silk/fixed/ |
H A D | warped_autocorrelation_FIX.c | 39 opus_int32 *corr, /* O Result [order + 1] */ 44 const opus_int order /* I Correlation order (even) */ 53 silk_assert( ( order & 1 ) == 0 ); 60 for( i = 0; i < order; i += 2 ) { 70 state_QS[ order ] = tmp1_QS; 71 corr_QC[ order ] += silk_RSHIFT64( silk_SMULL( tmp1_QS, state_QS[ 0 ] ), 2 * QS - QC ); 79 for( i = 0; i < order + 1; i++ ) { 83 for( i = 0; i < order + 1; i++ ) {
|
/external/libopus/silk/fixed/ |
H A D | warped_autocorrelation_FIX.c | 39 opus_int32 *corr, /* O Result [order + 1] */ 44 const opus_int order /* I Correlation order (even) */ 53 silk_assert( ( order & 1 ) == 0 ); 60 for( i = 0; i < order; i += 2 ) { 70 state_QS[ order ] = tmp1_QS; 71 corr_QC[ order ] += silk_RSHIFT64( silk_SMULL( tmp1_QS, state_QS[ 0 ] ), 2 * QS - QC ); 79 for( i = 0; i < order + 1; i++ ) { 83 for( i = 0; i < order + 1; i++ ) {
|
/external/chromium_org/third_party/re2/util/ |
H A D | sparse_array_test.cc | 18 int order[n]; local 21 order[i] = i; 26 int t = order[i]; 27 order[i] = order[j]; 28 order[j] = t; 33 ASSERT_TRUE(set.has_index(order[j])); 34 ASSERT_EQ(value[order[j]], set.get(order[j], -1)); 39 ASSERT_FALSE(set.has_index(order[ [all...] |
/external/regex-re2/util/ |
H A D | sparse_array_test.cc | 18 int order[n]; local 21 order[i] = i; 26 int t = order[i]; 27 order[i] = order[j]; 28 order[j] = t; 33 ASSERT_TRUE(set.has_index(order[j])); 34 ASSERT_EQ(value[order[j]], set.get(order[j], -1)); 39 ASSERT_FALSE(set.has_index(order[ [all...] |
/external/smack/src/org/xbill/DNS/ |
H A D | NAPTRRecord.java | 18 private int order, preference; field in class:NAPTRRecord 31 * @param order The order of this NAPTR. Records with lower order are 34 * same order. 43 NAPTRRecord(Name name, int dclass, long ttl, int order, int preference, argument 47 this.order = checkU16("order", order); 62 order [all...] |
/external/openssl/crypto/ec/ |
H A D | ec_check.c | 62 BIGNUM *order; local 76 if ((order = BN_CTX_get(ctx)) == NULL) goto err; 97 /* check the order of the generator */ 99 if (!EC_GROUP_get_order(group, order, ctx)) goto err; 100 if (BN_is_zero(order)) 106 if (!EC_POINT_mul(group, point, order, NULL, NULL, ctx)) goto err;
|
/external/speex/libspeex/ |
H A D | scal.c | 75 int *order; member in struct:SpeexDecorrState_ 98 st->order = speex_alloc(channels*sizeof(int)); 114 st->order[ch] = 10; 159 int order; local 165 order = st->order[ch]; 185 st->y[i] = alpha*(x[i-ALLPASS_ORDER+order]-beta*x[i-ALLPASS_ORDER+order-1])*st->vorbis_win[st->frame_size+i+order] 188 - beta*ring[ringID+1>=order [all...] |