/external/libopus/silk/fixed/ |
k2a_FIX.c | 36 opus_int32 *A_Q24, /* O Prediction coefficients [order] Q24 */ 37 const opus_int16 *rc_Q15, /* I Reflection coefficients [order] Q15 */ 38 const opus_int32 order /* I Prediction order */ 44 for( k = 0; k < order; k++ ) {
|
k2a_Q16_FIX.c | 36 opus_int32 *A_Q24, /* O Prediction coefficients [order] Q24 */ 37 const opus_int32 *rc_Q16, /* I Reflection coefficients [order] Q16 */ 38 const opus_int32 order /* I Prediction order */ 44 for( k = 0; k < order; k++ ) {
|
/external/openssl/crypto/ecdsa/ |
ecs_ossl.c | 96 BIGNUM *k = NULL, *r = NULL, *order = NULL, *X = NULL; local 120 order = BN_new(); 122 if (!k || !r || !order || !X) 132 if (!EC_GROUP_get_order(group, order, ctx)) 146 k, order, 158 if (!BN_rand_range(k, order)) 171 if (!BN_add(k, k, order)) goto err; 172 if (BN_num_bits(k) <= BN_num_bits(order)) 173 if (!BN_add(k, k, order)) goto err; 201 if (!BN_nnmod(r, X, order, ctx) 246 BIGNUM *kinv=NULL, *s, *m=NULL,*tmp=NULL,*order=NULL; local 378 BIGNUM *order, *u1, *u2, *m, *X; local [all...] |
/external/pdfium/core/src/fxge/Microsoft SDK/include/ |
GdiPlusMatrix.h | 138 IN MatrixOrder order = MatrixOrderPrepend)
142 order));
147 IN MatrixOrder order = MatrixOrderPrepend)
149 return SetStatus(DllExports::GdipTranslateMatrix(nativeMatrix, offsetX, offsetY, order));
154 IN MatrixOrder order = MatrixOrderPrepend)
156 return SetStatus(DllExports::GdipScaleMatrix(nativeMatrix, scaleX, scaleY, order));
160 IN MatrixOrder order = MatrixOrderPrepend)
162 return SetStatus(DllExports::GdipRotateMatrix(nativeMatrix, angle, order));
167 IN MatrixOrder order = MatrixOrderPrepend)
169 if(order == MatrixOrderPrepend) [all...] |
/development/samples/ActionBarCompat/src/com/example/android/actionbarcompat/ |
SimpleMenu.java | 65 public MenuItem add(int groupId, int itemId, int order, CharSequence title) { 66 return addInternal(itemId, order, title); 69 public MenuItem add(int groupId, int itemId, int order, int titleRes) { 70 return addInternal(itemId, order, mResources.getString(titleRes)); 76 private MenuItem addInternal(int itemId, int order, CharSequence title) { 77 final SimpleMenuItem item = new SimpleMenuItem(this, itemId, order, title); 78 mItems.add(findInsertIndex(mItems, order), item); 82 private static int findInsertIndex(ArrayList<? extends MenuItem> items, int order) { 85 if (item.getOrder() <= order) { 151 public SubMenu addSubMenu(int groupId, int itemId, int order, CharSequence title) [all...] |
/external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/ |
omxSP_FFTInit_R_F32.c | 36 * [in] order base-2 logarithm of the desired block length; 45 OMXResult omxSP_FFTInit_R_F32(OMXFFTSpec_R_F32* pFFTSpec, OMX_INT order) { 69 if (!pFFTSpec || (order < 1) || (order > TWIDDLE_TABLE_ORDER)) 73 Nby2 = 1 << (order - 1); 105 * N = 1 << order 106 * W = -PI >> (order - 1) 110 diff = TWIDDLE_TABLE_ORDER - (order - 1); 111 /* step into the twiddle table for the current order */ 118 if ((order - 1) >= 3) [all...] |
omxSP_FFTInit_C_SC32.c | 50 * [in] order base-2 logarithm of the desired block length; 61 OMX_INT order 74 /* if order zero no init is needed */ 75 if (order == 0) 82 Nby2 = 1 << (order - 1); 115 * N = 1 << order 116 * W = -PI >> (order - 1) 120 diff = 12 - order; 121 step = 1<<diff; /* step into the twiddle table for the current order */ 127 if(order >=3) [all...] |
/external/chromium_org/skia/ext/ |
recursive_gaussian_convolution.cc | 32 template<RecursiveFilter::Order order> 39 switch (order) { 54 template<RecursiveFilter::Order order> 60 switch (order) { 73 template<RecursiveFilter::Order order, bool absolute_values> 93 if (order == RecursiveFilter::FUNCTION) 98 w[3] = ForwardFilter<order>( [all...] |
/external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/neon/ |
omxSP_FFTInv_CToC_SC16_Sfs_s.S | 90 #define order r14 define 127 CLZ order,N @// N = 2^order 128 RSB order,order,#31 132 ADD scale,scale,order @// FFTInverse has a final scaling factor by N 134 CMP order,#3 135 BGT orderGreaterthan3 @// order > 3 137 CMP order,#1 138 BGE orderGreaterthan0 @// order > [all...] |
omxSP_FFTInv_CToC_SC32_Sfs_s.S | 89 #define order r14 define 126 CLZ order,N @// N = 2^order 127 RSB order,order,#31 131 ADD scale,scale,order @// FFTInverse has a final scaling factor by N 133 CMP order,#3 134 BGT orderGreaterthan3 @// order > 3 136 CMP order,#1 137 BGE orderGreaterthan0 @// order > [all...] |
/external/chromium_org/third_party/openmax_dl/dl/sp/api/ |
mipsSP.h | 33 OMX_U32 order; member in struct:MIPSFFTSpec_R_FC32_Tag
|
/external/chromium_org/third_party/opus/src/silk/float/ |
LPC_inv_pred_gain_FLP.c | 41 const silk_float *A, /* I prediction coefficients [order] */ 42 opus_int32 order /* I prediction order */ 50 Anew = Atmp[ order & 1 ]; 51 silk_memcpy( Anew, A, order * sizeof(silk_float) ); 54 for( k = order - 1; k > 0; k-- ) {
|
/external/icu/icu4c/source/i18n/unicode/ |
ucoleitr.h | 63 * . t_int32 order, primaryOrder; 71 * . order = ucol_next(c, &success); 73 * . order = ucol_prev(c, &success); 80 * ucol_next() returns the collation order of the next. 81 * ucol_prev() returns the collation order of the previous character. 87 * ucol_prev or ucol_next, the first or last collation order will be returned. 93 * Character based on the comparison level of the collator. A collation order 94 * consists of primary order, secondary order and tertiary order. The data [all...] |
/external/libopus/silk/float/ |
LPC_inv_pred_gain_FLP.c | 41 const silk_float *A, /* I prediction coefficients [order] */ 42 opus_int32 order /* I prediction order */ 50 Anew = Atmp[ order & 1 ]; 51 silk_memcpy( Anew, A, order * sizeof(silk_float) ); 54 for( k = order - 1; k > 0; k-- ) {
|
/external/valgrind/main/drd/tests/ |
tc15_laog_lockdel.stderr.exp | 2 Establish order 1 -> 2 3 Try order 2 -> 1. This gives an error.
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
fix_reduce.py | 18 order = "pre" variable in class:FixReduce
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
fix_reduce.py | 18 order = "pre" variable in class:FixReduce
|
/external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/arm64/ |
omxSP_FFTFwd_CToC_FC32.c | 68 * Compute an FFT for a complex signal of length of 2^order, 69 * where 0 <= order <= 15. 78 * N = 2^order 82 * 2^order; must be aligned on a 32 byte boundary. 87 * pDst - pointer to the complex-valued output vector, of length 2^order; 105 int order; local 118 order = fastlog2(spec->N); 125 if (order > 3) { 132 if ((order & 2) == 0) { 140 * Odd order uses a radix 8 first stage; even order, a radix [all...] |
omxSP_FFTInv_CToC_FC32.c | 75 * greater than or equal to 2 (order >= 1) 92 * length of 2^order, where 0 <= order <= 15. Transform length is 100 * N=2^order. 103 * pSrc - pointer to the complex-valued input signal, of length 2^order ; 109 * order 110 * pDst - pointer to the complex-valued output signal, of length 2^order; 128 int order; local 141 order = fastlog2(spec->N); 148 if (order > 3) [all...] |
/external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/armv7/ |
omxSP_FFTInv_CToC_FC32_Sfs_s.S | 66 #define order r14 define 98 CLZ order,N @// N = 2^order 99 RSB order,order,#31 103 CMP order,#1 104 BGT orderGreaterthan1 @// order > 1 105 @// Order = 0 or 1 112 @// Handle order = 1 121 TST order, #2 @// Set input args to fft stage [all...] |
/libcore/luni/src/main/java/java/nio/ |
ByteArrayBuffer.java | 116 Memory.unsafeBulkGet(dst, dstOffset, byteCount, backingArray, arrayOffset + position, SizeOf.CHAR, order.needsSwap); 122 Memory.unsafeBulkGet(dst, dstOffset, byteCount, backingArray, arrayOffset + position, SizeOf.DOUBLE, order.needsSwap); 128 Memory.unsafeBulkGet(dst, dstOffset, byteCount, backingArray, arrayOffset + position, SizeOf.FLOAT, order.needsSwap); 134 Memory.unsafeBulkGet(dst, dstOffset, byteCount, backingArray, arrayOffset + position, SizeOf.INT, order.needsSwap); 140 Memory.unsafeBulkGet(dst, dstOffset, byteCount, backingArray, arrayOffset + position, SizeOf.LONG, order.needsSwap); 146 Memory.unsafeBulkGet(dst, dstOffset, byteCount, backingArray, arrayOffset + position, SizeOf.SHORT, order.needsSwap); 167 char result = (char) Memory.peekShort(backingArray, arrayOffset + position, order); 174 return (char) Memory.peekShort(backingArray, arrayOffset + index, order); 198 int result = Memory.peekInt(backingArray, arrayOffset + position, order); 205 return Memory.peekInt(backingArray, arrayOffset + index, order); [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/ext/pb_ds/detail/trie_policy/ |
order_statistics_imp.hpp | 44 find_by_order(size_type order) 49 ++order; 55 if (order > nd_it.get_metadata()) 67 if (order <= child_nd_it.get_metadata()) 74 order -= child_nd_it.get_metadata(); 82 find_by_order(size_type order) const 84 return (const_cast<PB_DS_CLASS_C_DEC* >(this)->find_by_order(order));
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/trie_policy/ |
order_statistics_imp.hpp | 44 find_by_order(size_type order) 49 ++order; 54 if (order > nd_it.get_metadata()) 64 if (order <= child_nd_it.get_metadata()) 70 order -= child_nd_it.get_metadata(); 78 find_by_order(size_type order) const 79 { return const_cast<PB_DS_CLASS_C_DEC*>(this)->find_by_order(order); }
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/trie_policy/ |
order_statistics_imp.hpp | 44 find_by_order(size_type order) 49 ++order; 54 if (order > nd_it.get_metadata()) 64 if (order <= child_nd_it.get_metadata()) 70 order -= child_nd_it.get_metadata(); 78 find_by_order(size_type order) const 79 { return const_cast<PB_DS_CLASS_C_DEC*>(this)->find_by_order(order); }
|
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/trie_policy/ |
order_statistics_imp.hpp | 44 find_by_order(size_type order) 49 ++order; 57 if (order > nd_it.get_metadata()) 69 if (order <= child_nd_it.get_metadata()) 76 order -= child_nd_it.get_metadata(); 84 find_by_order(size_type order) const 86 return (const_cast<PB_DS_CLASS_C_DEC* >(this)->find_by_order(order));
|