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

1234567891011>>

/external/cblas/src/
H A Dcblas_ssyr2.c12 void cblas_ssyr2(const enum CBLAS_ORDER order, const enum CBLAS_UPLO Uplo, argument
37 if (order == CblasColMajor)
55 } else if (order == CblasRowMajor)
72 } else cblas_xerbla(1, "cblas_ssyr2", "Illegal Order setting, %d\n", order);
H A Dcblas_zgerc.c12 void cblas_zgerc(const enum CBLAS_ORDER order, const int M, const int N, argument
34 if (order == CblasColMajor)
38 } else if (order == CblasRowMajor)
80 } else cblas_xerbla(1, "cblas_zgerc", "Illegal Order setting, %d\n", order);
/external/clang/test/PCH/
H A Dchain-default-argument-instantiation.cpp31 #error Header inclusion order messed up
/external/icu/icu4c/source/i18n/unicode/
H A Ducoleitr.h65 * . t_int32 order, primaryOrder;
73 * . order = ucol_next(c, &success);
75 * . order = ucol_prev(c, &success);
82 * ucol_next() returns the collation order of the next.
83 * ucol_prev() returns the collation order of the previous character.
89 * ucol_prev or ucol_next, the first or last collation order will be returned.
95 * Character based on the comparison level of the collator. A collation order
96 * consists of primary order, secondary order and tertiary order
[all...]
/external/libopus/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/skia/include/core/
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/valgrind/drd/tests/
H A Dtc15_laog_lockdel.stderr.exp2 Establish order 1 -> 2
3 Try order 2 -> 1. This gives an error.
/external/webrtc/webrtc/common_audio/signal_processing/
H A Dauto_correlation.c17 size_t order,
25 assert(order <= in_vector_length);
30 // In order to avoid overflow when computing the sum we should scale the
48 for (i = 0; i < order + 1; i++) {
64 return order + 1;
15 WebRtcSpl_AutoCorrelation(const int16_t* in_vector, size_t in_vector_length, size_t order, int32_t* result, int* scale) argument
/external/webrtc/webrtc/common_audio/signal_processing/include/
H A Dreal_fft.h16 // For ComplexFFT(), the maximum fft order is 10;
27 struct RealFFT* WebRtcSpl_CreateRealFFT(int order);
30 // Compute an FFT for a real-valued signal of length of 2^order,
31 // where 1 < order <= MAX_FFT_ORDER. Transform length is determined by the
38 // N=2^order.
54 // complex_data_out - the output complex signal with (2^order + 2) 16-bit
66 // 2^order, where 1 < order <= MAX_FFT_ORDER. Transform length is determined by
75 // complex_data_in - the input complex signal with (2^order + 2) 16-bit
86 // should be shifted left with in order t
[all...]
/external/libexif/libexif/olympus/
H A Dexif-mnote-data-olympus.c127 exif_set_short (*buf + 6, n->order, (ExifShort) 1);
141 exif_set_short (*buf + 8, n->order, (ExifShort) (
142 (n->order == EXIF_BYTE_ORDER_INTEL) ?
145 exif_set_short (*buf + 10, n->order, (ExifShort) 3);
173 exif_set_short (*buf + 10, n->order, (ExifShort) (
174 (n->order == EXIF_BYTE_ORDER_INTEL) ?
177 exif_set_short (*buf + 12, n->order, (ExifShort) 0x2A);
178 exif_set_long (*buf + 14, n->order, (ExifShort) 8);
183 exif_set_long (*buf + o2 + 2 + n->count * 12, n->order, 0);
190 exif_set_short (*buf + o2, n->order, (ExifShor
[all...]
/external/pdfium/core/fxcrt/
H A Dfx_basic_utf.cpp66 int order = 1 << ((nbytes - 1) * 6); local
68 m_Buffer.AppendChar(prefix[nbytes - 2] | (code / order));
70 code = code % order;
71 order >>= 6;
72 m_Buffer.AppendChar(0x80 | (code / order));
/external/libmojo/mojo/android/javatests/src/org/chromium/mojo/bindings/
H A DValidationTestUtilTest.java44 expected.order(ByteOrder.LITTLE_ENDIAN);
52 expected.order(ByteOrder.nativeOrder());
60 expected.order(ByteOrder.nativeOrder());
74 expected.order(ByteOrder.nativeOrder());
86 expected.order(ByteOrder.nativeOrder());
97 expected.order(ByteOrder.nativeOrder());
107 expected.order(ByteOrder.nativeOrder());
119 expected.order(ByteOrder.nativeOrder());
145 expected.order(ByteOrder.nativeOrder());
/external/libopus/silk/
H A DNLSF_encode.c69 silk_NLSF_stabilize( pNLSF_Q15, psNLSF_CB->deltaMin_Q15, psNLSF_CB->order );
73 silk_NLSF_VQ( err_Q26, pNLSF_Q15, psNLSF_CB->CB1_NLSF_Q8, psNLSF_CB->nVectors, psNLSF_CB->order );
87 pCB_element = &psNLSF_CB->CB1_NLSF_Q8[ ind1 * psNLSF_CB->order ];
88 for( i = 0; i < psNLSF_CB->order; i++ ) {
94 silk_NLSF_VQ_weights_laroia( W_tmp_QW, NLSF_tmp_Q15, psNLSF_CB->order );
97 for( i = 0; i < psNLSF_CB->order; i++ ) {
103 for( i = 0; i < psNLSF_CB->order; i++ ) {
112 psNLSF_CB->ec_Rates_Q5, psNLSF_CB->quantStepSize_Q16, psNLSF_CB->invQuantStepSize_Q6, NLSF_mu_Q20, psNLSF_CB->order );
129 silk_memcpy( &NLSFIndices[ 1 ], &tempIndices2[ bestIndex * MAX_LPC_ORDER ], psNLSF_CB->order * sizeof( opus_int8 ) );
/external/libchrome/base/message_loop/
H A Dmessage_loop_unittest.cc166 // Saves the order in which the tasks executed.
237 void MessageBoxFunc(TaskList* order, int cookie, bool is_reentrant) { argument
238 order->RecordStart(MESSAGEBOX, cookie);
242 order->RecordEnd(MESSAGEBOX, cookie);
246 void EndDialogFunc(TaskList* order, int cookie) { argument
247 order->RecordStart(ENDDIALOG, cookie);
253 order->RecordEnd(ENDDIALOG, cookie);
257 void RecursiveFunc(TaskList* order, int cookie, int depth, argument
259 order->RecordStart(RECURSIVE, cookie);
265 Bind(&RecursiveFunc, order, cooki
270 QuitFunc(TaskList* order, int cookie) argument
276 RecursiveFuncWin(MessageLoop* target, HANDLE event, bool expect_window, TaskList* order, bool is_reentrant) argument
332 TaskList order; local
376 TaskList order; local
[all...]
/external/libexif/libexif/fuji/
H A Dexif-mnote-data-fuji.c26 #include <libexif/exif-byte-order.h>
32 ExifByteOrder order; member in struct:_MNoteFujiDataPrivate
105 exif_set_long (*buf + 8, n->order, 12);
108 exif_set_short (*buf + 8 + 4, n->order, (ExifShort) n->count);
113 exif_set_short (*buf + o + 0, n->order, (ExifShort) n->entries[i].tag);
114 exif_set_short (*buf + o + 2, n->order, (ExifShort) n->entries[i].format);
115 exif_set_long (*buf + o + 4, n->order, n->entries[i].components);
138 exif_set_long (*buf + o, n->order, doff);
171 n->order = EXIF_BYTE_ORDER_INTEL;
204 n->entries[tcount].tag = exif_get_short (buf + o, n->order);
[all...]
/external/libexif/libexif/
H A Dexif-data.c53 ExifByteOrder order; member in struct:_ExifDataPrivate
166 entry->tag = exif_get_short (d + offset + 0, data->priv->order);
167 entry->format = exif_get_short (d + offset + 2, data->priv->order);
168 entry->components = exif_get_long (d + offset + 4, data->priv->order);
189 doff = exif_get_long (d + offset + 8, data->priv->order);
244 data->priv->order, (ExifShort) e->tag);
246 data->priv->order, (ExifShort) e->format);
262 data->priv->order, e->components);
288 exif_set_long (*d + 6 + offset + 8, data->priv->order, doff);
387 n = exif_get_short (d + offset, data->priv->order);
1133 exif_data_set_byte_order(ExifData *data, ExifByteOrder order) argument
[all...]
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/
H A DLinkedHashMultisetTest.java45 public List<String> order(List<String> insertionOrder) {
46 List<String> order = Lists.newArrayList();
48 int index = order.indexOf(s);
50 order.add(s);
52 order.add(index, s);
55 return order;
/external/mesa3d/src/glx/
H A Deval.c40 __glFillMap1f(GLint k, GLint order, GLint stride, argument
45 __GLX_PUT_FLOAT_ARRAY(0, points, order * k);
50 for (i = 0; i < order; i++) {
59 __glFillMap1d(GLint k, GLint order, GLint stride, argument
64 __GLX_PUT_DOUBLE_ARRAY(0, points, order * k);
68 for (i = 0; i < order; i++) {
/external/aac/libAACdec/src/
H A Daacdec_tns.cpp133 UCHAR n_filt,order; local
176 filter->Order = order = (UCHAR) FDKreadBits(bs, isLongFlag ? 5 : 3);
180 filter->Order = order = TNS_MAXIMUM_ORDER;
183 if (order)
200 for (i=0; i < order; i++)
216 static void CTns_Filter (FIXP_DBL *spec, int size, int inc, FIXP_TCC coeff [], int order) argument
218 // - Simple all-pole filter of order "order" defined by
219 // y(n) = x(n) - a(2)*y(n-1) - ... - a(order+1)*y(n-order)
[all...]
/external/boringssl/src/crypto/ecdsa/
H A Decdsa.c110 * at most, as long as |order|. It returns one on success and zero otherwise. */
112 const BIGNUM *order) {
115 num_bits = BN_num_bits(order);
173 const BIGNUM *order = EC_GROUP_get0_order(group); local
175 BN_ucmp(sig->r, order) >= 0 || BN_is_zero(sig->s) ||
176 BN_is_negative(sig->s) || BN_ucmp(sig->s, order) >= 0) {
181 /* calculate tmp1 = inv(S) mod order */
183 if (!BN_mod_inverse_odd(u2, &no_inverse, sig->s, order, ctx)) {
187 if (!digest_to_bn(m, digest, digest_len, order)) {
190 /* u1 = m * tmp mod order */
111 digest_to_bn(BIGNUM *out, const uint8_t *digest, size_t digest_len, const BIGNUM *order) argument
264 const BIGNUM *order = EC_GROUP_get0_order(group); local
385 const BIGNUM *order = EC_GROUP_get0_order(group); local
[all...]
/external/libexif/libexif/pentax/
H A Dexif-mnote-data-pentax.c28 #include <libexif/exif-byte-order.h>
104 exif_set_short (*buf + 4, n->order, (ExifShort) 0);
118 exif_set_short (*buf + 4, n->order, (ExifShort) (
119 (n->order == EXIF_BYTE_ORDER_INTEL) ?
134 exif_set_short (*buf + 4, n->order, (ExifShort) 0);
155 exif_set_short (*buf + o2, n->order, (ExifShort) n->count);
164 exif_set_short (*buf + o + 0, n->order,
166 exif_set_short (*buf + o + 2, n->order,
168 exif_set_long (*buf + o + 4, n->order,
190 exif_set_long (*buf + o, n->order, data
[all...]
/external/flac/libFLAC/
H A Dlpc.c154 /* save this order */
167 int FLAC__lpc_quantize_coefficients(const FLAC__real lp_coeff[], unsigned order, unsigned precision, FLAC__int32 qlp_coeff[], int *shift) argument
184 for(i = 0; i < order; i++) {
212 for(i = 0; i < order; i++) {
239 fprintf(stderr,"FLAC__lpc_quantize_coefficients: negative shift=%d order=%u cmax=%f\n", *shift, order, cmax);
241 for(i = 0; i < order; i++) {
268 void FLAC__lpc_compute_residual_from_qlp_coefficients(const FLAC__int32 * flac_restrict data, unsigned data_len, const FLAC__int32 * flac_restrict qlp_coeff, unsigned order, int lp_quantization, FLAC__int32 * flac_restrict residual) argument
277 fprintf(stderr,"FLAC__lpc_compute_residual_from_qlp_coefficients: data_len=%d, order=%u, lpq=%d",data_len,order,lp_quantizatio
529 FLAC__lpc_compute_residual_from_qlp_coefficients_wide(const FLAC__int32 * flac_restrict data, unsigned data_len, const FLAC__int32 * flac_restrict qlp_coeff, unsigned order, int lp_quantization, FLAC__int32 * flac_restrict residual) argument
785 FLAC__lpc_restore_signal(const FLAC__int32 * flac_restrict residual, unsigned data_len, const FLAC__int32 * flac_restrict qlp_coeff, unsigned order, int lp_quantization, FLAC__int32 * flac_restrict data) argument
1046 FLAC__lpc_restore_signal_wide(const FLAC__int32 * flac_restrict residual, unsigned data_len, const FLAC__int32 * flac_restrict qlp_coeff, unsigned order, int lp_quantization, FLAC__int32 * flac_restrict data) argument
1336 unsigned order, indx, best_index; /* 'index' the index into lpc_error; index==order-1 since lpc_error[0] is for order==1, lpc_error[1] is for order==2, etc */ local
[all...]
/external/clang/lib/Headers/
H A Dstdatomic.h78 #define atomic_thread_fence(order) __c11_atomic_thread_fence(order)
79 #define atomic_signal_fence(order) __c11_atomic_signal_fence(order)
179 #define atomic_flag_test_and_set_explicit(object, order) __c11_atomic_exchange(&(object)->_Value, 1, order)
182 #define atomic_flag_clear_explicit(object, order) __c11_atomic_store(&(object)->_Value, 0, order)
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/
H A Dbuild.properties25 jars.compile.order = performanceui.jar
/external/libbrillo/brillo/message_loops/
H A Dfake_message_loop_unittest.cc47 vector<int> order; local
48 auto callback = [](std::vector<int>* order, int value) {
49 order->push_back(value);
51 loop_->PostDelayedTask(Bind(callback, base::Unretained(&order), 1),
53 loop_->PostDelayedTask(Bind(callback, base::Unretained(&order), 4),
55 loop_->PostDelayedTask(Bind(callback, base::Unretained(&order), 3),
57 loop_->PostDelayedTask(Bind(callback, base::Unretained(&order), 2),
61 EXPECT_EQ((vector<int>{1, 2, 3, 4}), order);

Completed in 806 milliseconds

1234567891011>>