Searched refs:order (Results 76 - 100 of 900) sorted by relevance

1234567891011>>

/external/valgrind/main/none/tests/amd64/
H A DredundantRexW.stdout.exp1 after "rex.WB addpd 0x0(%r8),%xmm1" (dqws in order [15 .. 0]) {
8 after "rex.WB addpd 0x0(%r8),%xmm1" (xmms in order [15..0]) {
27 after "rex.W addsd (%rdi),%xmm4" (dqws in order [15 .. 0]) {
34 after "rex.W addsd (%rdi),%xmm4" (xmms in order [15..0]) {
53 after "rex.W movapd (%rdx),%xmm1" (dqws in order [15 .. 0]) {
60 after "rex.W movapd (%rdx),%xmm1" (xmms in order [15..0]) {
79 after "rex.W movapd %xmm1,(%rdx)" (dqws in order [15 .. 0]) {
86 after "rex.W movapd %xmm1,(%rdx)" (xmms in order [15..0]) {
105 after "movaps 0x30(%rdx),%xmm0" (dqws in order [15 .. 0]) {
112 after "movaps 0x30(%rdx),%xmm0" (xmms in order [1
[all...]
/external/chromium_org/third_party/boringssl/src/crypto/ecdsa/
H A Decdsa.c97 * at most, as long as |order|. It returns one on success and zero otherwise. */
99 const BIGNUM *order) {
102 num_bits = BN_num_bits(order);
132 BIGNUM *order, *u1, *u2, *m, *X; local
156 order = BN_CTX_get(ctx);
166 if (!EC_GROUP_get_order(group, order, ctx)) {
172 BN_ucmp(sig->r, order) >= 0 || BN_is_zero(sig->s) ||
173 BN_is_negative(sig->s) || BN_ucmp(sig->s, order) >= 0) {
178 /* calculate tmp1 = inv(S) mod order */
179 if (!BN_mod_inverse(u2, sig->s, order, ct
98 digest_to_bn(BIGNUM *out, const uint8_t *digest, size_t digest_len, const BIGNUM *order) argument
230 BIGNUM *k = NULL, *r = NULL, *order = NULL, *X = NULL; local
362 BIGNUM *kinv = NULL, *s, *m = NULL, *tmp = NULL, *order = NULL; local
[all...]
/external/chromium_org/third_party/webrtc/common_audio/signal_processing/include/
H A Dreal_fft.h16 // For ComplexFFT(), the maximum fft order is 10;
27 typedef struct RealFFT* (*CreateRealFFT)(int order);
41 struct RealFFT* WebRtcSpl_CreateRealFFTC(int order);
45 struct RealFFT* WebRtcSpl_CreateRealFFTNeon(int order);
49 // Compute an FFT for a real-valued signal of length of 2^order,
50 // where 1 < order <= MAX_FFT_ORDER. Transform length is determined by the
57 // N=2^order.
73 // complex_data_out - the output complex signal with (2^order + 2) 16-bit
91 // 2^order, where 1 < order <
[all...]
/external/glide/library/src/main/java/com/bumptech/glide/load/engine/executor/
H A DFifoPriorityThreadPoolExecutor.java15 * same time. Runnables with the same priority will be executed in FIFO order.
56 private final int order; field in class:FifoPriorityThreadPoolExecutor.FifoPriorityLoadTask
58 public FifoPriorityLoadTask(Runnable runnable, T result, int order) { argument
65 this.order = order;
72 result = order - loadTask.order;
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dstatesort.h34 const vector<typename Arc::StateId> &order) {
38 CHECK_EQ(order.size(), fst->NumStates());
45 vector<bool> done(order.size(), false);
49 fst->SetStart(order[fst->Start()]);
64 s2 = order[s1];
77 arc.nextstate = order[arc.nextstate];
33 StateSort(MutableFst<Arc> *fst, const vector<typename Arc::StateId> &order) argument
/external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/arm64/
H A DomxSP_FFTFwd_RToCCS_F32.c74 * Compute an FFT for a complex signal of length of 2^order,
75 * where 0 <= order <= 15.
84 * N = 2^order
88 * 2^order; must be aligned on a 32 byte boundary.
93 * pDst - pointer to the complex-valued output vector, of length 2^order;
111 int order; local
127 * Compute the RFFT using a complex FFT of one less order, so set
128 * order to be the order of the complex FFT.
130 order
[all...]
/external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/neon/
H A DomxSP_FFTFwd_CToC_SC16_Sfs_s.S90 #define order r14 define
128 CLZ order,N @// N = 2^order
129 RSB order,order,#31
133 CMP order,#3
134 BGT orderGreaterthan3 @// order > 3
136 CMP order,#1
137 BGE orderGreaterthan0 @// order > 0
138 M_STR scale, diffOnStack,LT @// order
[all...]
H A DomxSP_FFTFwd_CToC_SC32_Sfs_s.S88 #define order r14 define
125 CLZ order,N @// N = 2^order
126 RSB order,order,#31
130 CMP order,#3
131 BGT orderGreaterthan3 @// order > 3
133 CMP order,#1
134 BGE orderGreaterthan0 @// order > 0
135 M_STR scale, diffOnStack,LT @// order
[all...]
H A DomxSP_FFTInv_CToC_SC16_Sfs_s.S90 #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...]
H A DomxSP_FFTInv_CToC_SC32_Sfs_s.S89 #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/src/arm/
H A DomxSP_FFTInit_C_FC32.c36 * [in] order base-2 logarithm of the desired block length;
46 OMXResult omxSP_FFTInit_C_FC32(OMXFFTSpec_C_FC32* pFFTSpec, OMX_INT order) { argument
66 if (!pFFTSpec || (order < 1) || (order > TWIDDLE_TABLE_ORDER))
70 Nby2 = 1 << (order - 1);
100 * N = 1 << order
101 * W = -PI >> (order - 1)
104 diff = TWIDDLE_TABLE_ORDER - order;
105 /* step into the twiddle table for the current order */
112 if (order >
[all...]
H A DomxSP_FFTInit_R_F32.c36 * [in] order base-2 logarithm of the desired block length;
45 OMXResult omxSP_FFTInit_R_F32(OMXFFTSpec_R_F32* pFFTSpec, OMX_INT order) { argument
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
[all...]
/external/chromium_org/third_party/opus/src/silk/fixed/
H A Dk2a_FIX.c36 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++ ) {
H A Dk2a_Q16_FIX.c36 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/libexif/libexif/canon/
H A Dexif-mnote-data-canon.h24 #include <libexif/exif-byte-order.h>
40 ExifByteOrder order; member in struct:_ExifMnoteDataCanon
/external/libopus/silk/fixed/
H A Dk2a_FIX.c36 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++ ) {
H A Dk2a_Q16_FIX.c36 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/
H A Decs_ossl.c96 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, ct
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/
H A DGdiPlusMatrix.h138 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
[all...]
/external/chromium_org/skia/ext/
H A Drecursive_gaussian_convolution.cc32 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>(
104 w[n] = ForwardFilter<order>(in[byte_index - source_pixel_stride],
112 w[n] = ForwardFilter<order>(in[byte_index - source_pixel_stride],
125 float w_n = BackwardFilter<order>(
135 SingleChannelRecursiveFilter( const unsigned char* const source_data, int source_pixel_stride, int source_row_stride, int row_width, int row_count, unsigned char* const output, int output_pixel_stride, int output_row_stride, const float* b, RecursiveFilter::Order order, bool absolute_values) argument
217 RecursiveFilter(float sigma, Order order) argument
[all...]
/external/chromium_org/third_party/openmax_dl/dl/sp/api/
H A DmipsSP.h33 OMX_U32 order; member in struct:MIPSFFTSpec_R_FC32_Tag
/external/chromium_org/third_party/opus/src/silk/float/
H A DLPC_inv_pred_gain_FLP.c41 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/chromium_org/third_party/skia/include/core/
H A DSkFontHost.h71 /** LCD color elements can vary in order. For subpixel text we need to know
72 the order which the LCDs uses so that the color fringes are in the
90 static void SetSubpixelOrder(LCDOrder order);
H A DSkFontLCDConfig.h34 /** LCD color elements can vary in order. For subpixel text we need to know
35 the order which the LCDs uses so that the color fringes are in the
53 static void SetSubpixelOrder(LCDOrder order);
/external/icu/icu4c/source/i18n/unicode/
H A Ducoleitr.h63 * . 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
[all...]

Completed in 596 milliseconds

1234567891011>>