/external/libopus/silk/fixed/ |
H A D | corrMatrix_FIX.c | 40 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/float/ |
H A D | warped_autocorrelation_FLP.c | 36 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/speex/libspeex/ |
H A D | quant_lsp.h | 57 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);
|
H A D | quant_lsp.c | 71 static void compute_quant_weights(spx_lsp_t *qlsp, spx_word16_t *quant_weight, int order) argument 75 for (i=0;i<order;i++) 81 if (i==order-1) 159 void lsp_quant_nb(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits) argument 165 for (i=0;i<order;i++) 168 compute_quant_weights(qlsp, quant_weight, order); 170 for (i=0;i<order;i++) 174 for (i=0;i<order;i++) 177 id = lsp_quant(qlsp, cdbk_nb, NB_CDBK_SIZE, order); 180 for (i=0;i<order; 213 lsp_unquant_nb(spx_lsp_t *lsp, int order, SpeexBits *bits) argument 242 lsp_quant_lbr(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits) argument 283 lsp_unquant_lbr(spx_lsp_t *lsp, int order, SpeexBits *bits) argument 306 lsp_quant_high(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits) argument 310 lsp_unquant_high(spx_lsp_t *lsp, int order, SpeexBits *bits) argument 319 lsp_quant_high(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits) argument 366 lsp_unquant_high(spx_lsp_t *lsp, int order, SpeexBits *bits) argument [all...] |
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | CubicReduceOrder_Test.cpp | 16 int order; local 49 order = reduceOrder(cubic, reduce, kReduceOrder_QuadraticsAllowed, 51 if (order != 1) { 52 SkDebugf("[%d] pointDegenerates order=%d\n", (int) index, order); 57 order = reduceOrder(cubic, reduce, kReduceOrder_QuadraticsAllowed, 59 if (order == 1) { 60 SkDebugf("[%d] notPointDegenerates order=%d\n", (int) index, order); 65 order [all...] |
H A D | QuadraticReduceOrder_Test.cpp | 33 int order; local 50 order = reduceOrder(quad, reduce, kReduceOrder_TreatAsFill); 51 if (order != 2) { 52 printf("[%d] line quad order=%d\n", (int) index, order); 57 order = reduceOrder(quad, reduce, kReduceOrder_TreatAsFill); 58 if (order != 3) { 59 printf("[%d] line mod quad order=%d\n", (int) index, order);
|
/external/skia/experimental/Intersection/ |
H A D | CubicReduceOrder_Test.cpp | 16 int order; local 49 order = reduceOrder(cubic, reduce, kReduceOrder_QuadraticsAllowed, 51 if (order != 1) { 52 SkDebugf("[%d] pointDegenerates order=%d\n", (int) index, order); 57 order = reduceOrder(cubic, reduce, kReduceOrder_QuadraticsAllowed, 59 if (order == 1) { 60 SkDebugf("[%d] notPointDegenerates order=%d\n", (int) index, order); 65 order [all...] |
H A D | QuadraticReduceOrder_Test.cpp | 33 int order; local 50 order = reduceOrder(quad, reduce, kReduceOrder_TreatAsFill); 51 if (order != 2) { 52 printf("[%d] line quad order=%d\n", (int) index, order); 57 order = reduceOrder(quad, reduce, kReduceOrder_TreatAsFill); 58 if (order != 3) { 59 printf("[%d] line mod quad order=%d\n", (int) index, order);
|
/external/chromium_org/net/dns/ |
H A D | address_sorter_posix_unittest.cc | 160 // Verify that NULL-terminated |addresses| matches (-1)-terminated |order| 162 void Verify(const char* addresses[], const int order[]) { argument 166 for (size_t i = 0; order[i] >= 0; ++i) 167 CHECK_LT(order[i], static_cast<int>(list.size())); 175 for (size_t i = 0; (i < result.size()) || (order[i] >= 0); ++i) { 176 IPEndPoint expected = order[i] >= 0 ? list[order[i]] : IPEndPoint(); 179 "Address out of order at position " << i << "\n" << 193 const int order[] = { 1, -1 }; 194 Verify(addresses, order); [all...] |
/external/chromium_org/third_party/skia/tests/ |
H A D | PathOpsCubicReduceOrderTest.cpp | 64 int order; local 110 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics); 111 if (order != 1) { 112 SkDebugf("[%d] pointDegenerates order=%d\n", static_cast<int>(index), order); 119 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics); 120 if (order == 1) { 121 SkDebugf("[%d] notPointDegenerates order=%d\n", static_cast<int>(index), order); 122 order [all...] |
H A D | PathOpsQuadReduceOrderTest.cpp | 32 int order; local 51 order = reducer.reduce(quad); 52 if (order != 2) { 53 SkDebugf("[%d] line quad order=%d\n", (int) index, order); 58 order = reducer.reduce(quad); 59 if (order != 3) { 60 SkDebugf("[%d] line mod quad order=%d\n", (int) index, order);
|
/external/skia/tests/ |
H A D | PathOpsCubicReduceOrderTest.cpp | 64 int order; local 110 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics); 111 if (order != 1) { 112 SkDebugf("[%d] pointDegenerates order=%d\n", static_cast<int>(index), order); 119 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics); 120 if (order == 1) { 121 SkDebugf("[%d] notPointDegenerates order=%d\n", static_cast<int>(index), order); 122 order [all...] |
H A D | PathOpsQuadReduceOrderTest.cpp | 32 int order; local 51 order = reducer.reduce(quad); 52 if (order != 2) { 53 SkDebugf("[%d] line quad order=%d\n", (int) index, order); 58 order = reducer.reduce(quad); 59 if (order != 3) { 60 SkDebugf("[%d] line mod quad order=%d\n", (int) index, order);
|
/external/chromium_org/third_party/boringssl/src/crypto/ecdsa/ |
H A D | ecdsa_asn1.c | 74 BIGNUM *order = NULL; local 91 order = BN_new(); 92 if (order == NULL) { 95 if (!EC_GROUP_get_order(group, order, NULL)) { 96 BN_clear_free(order); 100 num_bits = BN_num_bits(order); 113 BN_clear_free(order);
|
/external/libexif/libexif/ |
H A D | exif-utils.c | 87 exif_get_sshort (const unsigned char *buf, ExifByteOrder order) argument 90 switch (order) { 102 exif_get_short (const unsigned char *buf, ExifByteOrder order) argument 104 return (exif_get_sshort (buf, order) & 0xffff); 108 exif_set_sshort (unsigned char *b, ExifByteOrder order, ExifSShort value) argument 111 switch (order) { 124 exif_set_short (unsigned char *b, ExifByteOrder order, ExifShort value) argument 126 exif_set_sshort (b, order, value); 130 exif_get_slong (const unsigned char *b, ExifByteOrder order) argument 133 switch (order) { 145 exif_set_slong(unsigned char *b, ExifByteOrder order, ExifSLong value) argument 165 exif_get_long(const unsigned char *buf, ExifByteOrder order) argument 171 exif_set_long(unsigned char *b, ExifByteOrder order, ExifLong value) argument 177 exif_get_srational(const unsigned char *buf, ExifByteOrder order) argument 188 exif_get_rational(const unsigned char *buf, ExifByteOrder order) argument 199 exif_set_rational(unsigned char *buf, ExifByteOrder order, ExifRational value) argument 208 exif_set_srational(unsigned char *buf, ExifByteOrder order, ExifSRational value) argument [all...] |
/external/chromium-trace/trace-viewer/src/tracing/importer/linux_perf/ |
H A D | memreclaim_parser.js | 33 // mm_vmscan_kswapd_wake: nid=%d order=%d 34 var kswapdWakeRE = /nid=(\d+) order=(\d+)/; 37 // mm_vmscan_kswapd_sleep: order=%d 41 // mm_vmscan_direct_reclaim_begin: order=%d may_writepage=%d gfp_flags=%s 42 var reclaimBeginRE = /order=(\d+) may_writepage=\d+ gfp_flags=(.+)/; 92 var order = parseInt(event[2]) 97 if (order > kthread.order) { 98 kthread.order = order; [all...] |
/external/libcxx/test/atomics/atomics.order/ |
H A D | Android.mk | 17 test_makefile := external/libcxx/test/atomics/atomics.order/Android.mk 19 test_name := atomics/atomics.order/memory_order 23 test_name := atomics/atomics.order/kill_dependency
|
/external/chromium_org/third_party/openmax_dl/dl/sp/src/mips/ |
H A D | omxSP_FFTInit_R_F32.c | 46 OMXResult omxSP_FFTInit_R_F32(OMXFFTSpec_R_F32* pFFTSpec, OMX_INT order) { argument 57 if (!pFFTSpec || (order < 1) || (order > TWIDDLE_TABLE_ORDER)) 60 /* For order larger than 4, compute Real FFT as Complex FFT of (order - 1). */ 61 if (order > 4) 62 fft_size = 1 << (order - 1); 64 fft_size = 1 << order; 84 if (order < 5) { 86 ((SUBTRANSFORM_CONST >> (16 - order)) | [all...] |
H A D | omxSP_FFTFwd_RToCCS_F32_Sfs.c | 40 !pFFTStruct->pTwiddle || !pFFTStruct->pBuf || (pFFTStruct->order < 1) || 41 (pFFTStruct->order > TWIDDLE_TABLE_ORDER)) 44 /* For order larger than 4, compute Real FFT as Complex FFT of (order - 1). */ 45 if (pFFTStruct->order > 4) 48 /* Special case for order == 1. */ 49 if (pFFTStruct->order == 1) {
|
H A D | omxSP_FFTInv_CCSToR_F32_Sfs.c | 40 !pFFTStruct->pTwiddle || !pFFTStruct->pBuf || (pFFTStruct->order < 1) || 41 (pFFTStruct->order > TWIDDLE_TABLE_ORDER)) 45 * For order larger than 4, compute Real IFFT as 46 * Complex IFFT of (order - 1). 48 if (pFFTStruct->order > 4) 51 /* Special case for order == 1. */ 52 if (pFFTStruct->order == 1) {
|
/external/chromium_org/third_party/speex/libspeex/ |
H A D | quant_lsp.c | 71 static void compute_quant_weights(spx_lsp_t *qlsp, spx_word16_t *quant_weight, int order) argument 75 for (i=0;i<order;i++) 81 if (i==order-1) 159 void lsp_quant_nb(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits) argument 165 for (i=0;i<order;i++) 168 compute_quant_weights(qlsp, quant_weight, order); 170 for (i=0;i<order;i++) 174 for (i=0;i<order;i++) 177 id = lsp_quant(qlsp, cdbk_nb, NB_CDBK_SIZE, order); 180 for (i=0;i<order; 213 lsp_unquant_nb(spx_lsp_t *lsp, int order, SpeexBits *bits) argument 242 lsp_quant_lbr(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits) argument 283 lsp_unquant_lbr(spx_lsp_t *lsp, int order, SpeexBits *bits) argument 306 lsp_quant_high(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits) argument 310 lsp_unquant_high(spx_lsp_t *lsp, int order, SpeexBits *bits) argument 319 lsp_quant_high(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits) argument 366 lsp_unquant_high(spx_lsp_t *lsp, int order, SpeexBits *bits) argument [all...] |
/external/chromium_org/third_party/npapi/npspy/extern/nspr/ |
H A D | prolock.h | 52 ** directly to PRLock functions, providing no lock order 100 ** order: user defined order of this lock. 111 #define PR_CREATE_ORDERED_LOCK(order,name)\ 112 PR_CreateOrderedLock((order),(name)) 114 #define PR_CREATE_ORDERED_LOCK(order) PR_NewLock() 119 PRInt32 order, 153 ** referenced by lock. If the order of lock is less than or equal 154 ** to the order of the highest lock held by the locking thread,
|
/external/chromium_org/third_party/opus/src/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 ];
|
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/arch/x86/tests/ |
H A D | gen-fma-test.py | 3 def emit(opcode,suffix,width,order,optype): 7 d['order']=order 29 print "v%(opcode)s%(order)s%(suffix)s %(op1)s, %(op2)s, %(op3)s" % (d) 32 print "v%(opcode)s%(order)s%(suffix)s %(op1)s, %(op2)s, %(op3)s" % (d) 37 for order in orders: 39 emit(opcode,suffix,width,order,optype)
|
/external/clang/test/PCH/ |
H A D | field-designator.c | 26 # error Header inclusion order messed up
|