Searched refs:order (Results 101 - 125 of 900) sorted by relevance

1234567891011>>

/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/main/drd/tests/
H A Dtc15_laog_lockdel.stderr.exp2 Establish order 1 -> 2
3 Try order 2 -> 1. This gives an error.
/external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/arm64/
H A DomxSP_FFTFwd_CToC_FC32.c68 * 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 use
[all...]
H A DomxSP_FFTInv_CToC_FC32.c75 * 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 >
[all...]
H A DomxSP_FFTInv_CCSToR_F32.c125 * using CCS format, of length (2^order) + 2; must be aligned on a
132 * 2^order ; must be aligned on a 32-byte boundary.
149 int order; local
176 order = fastlog2(spec->N) - 1;
187 pComplexSrc = pOut + (1 << order);
190 if (order > 3) {
197 if ((order & 2) == 0) {
205 * Odd order uses a radix 8 first stage; even order, a radix 4
208 if (order
[all...]
/external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/armv7/
H A DomxSP_FFTInv_CToC_FC32_Sfs_s.S66 #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
112 @// Handle order = 1
121 TST order, #2 @// Set input args to fft stages
128 @//check for even or odd order
[all...]
/external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/
H A DomxSP_FFTInit_C_SC32.c50 * [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 >
[all...]
H A DomxSP_FFTInit_R_S16S32.c50 * [in] order base-2 logarithm of the desired block length;
61 OMX_INT order
76 /* if order zero no init is needed */
77 if (order == 0)
88 Nby2 = 1 << (order - 1);
123 * N = 1 << order
124 * W = -PI >> (order - 1)
128 diff = 12 - (order-1);
129 step = 1<<diff; /* step into the twiddle table for the current order */
135 if((order
[all...]
H A DomxSP_FFTInit_R_S32.c50 * [in] order base-2 logarithm of the desired block length;
60 OMX_INT order
75 /* if order zero no init is needed */
76 if (order == 0)
87 Nby2 = 1 << (order - 1);
121 * N = 1 << order
122 * W = -PI >> (order - 1)
126 diff = 12 - (order-1);
127 step = 1<<diff; /* step into the twiddle table for the current order */
133 if((order
[all...]
/external/openfst/src/include/fst/
H A Dstatesort.h39 const vector<typename Arc::StateId> &order) {
43 if (order.size() != fst->NumStates()) {
44 FSTERROR() << "StateSort: bad order vector size: " << order.size();
54 vector<bool> done(order.size(), false);
58 fst->SetStart(order[fst->Start()]);
73 s2 = order[s1];
86 arc.nextstate = order[arc.nextstate];
38 StateSort(MutableFst<Arc> *fst, const vector<typename Arc::StateId> &order) argument
H A Dtopsort.h46 TopOrderVisitor(vector<StateId> *order, bool *acyclic) argument
47 : order_(order), acyclic_(acyclic) {}
78 vector<StateId> *finish_; // states in finishing-time order
94 vector<StateId> order; local
97 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);
101 StateSort(fst, order);
/external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/neon/
H A DomxSP_FFTInv_CToC_FC32_Sfs_s.S73 #define order r14 define
115 CLZ order,N @// N = 2^order
116 RSB order,order,#31
120 CMP order,#3
121 BGT orderGreaterthan3 @// order > 3
123 CMP order,#1
124 BGE orderGreaterthan0 @// order > 0
132 CMP order,#
[all...]
H A DomxSP_FFTFwd_RToCCS_S16S32_Sfs_s.S68 #define order r7 define
117 CLZ order,N @// N = 2^order
118 RSB order,order,#31
120 TST order,#1
/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/icu/icu4c/source/layout/
H A DLookupProcessor.cpp67 for (le_uint16 order = 0; order < lookupOrderCount && LE_SUCCESS(success); order += 1) {
68 le_uint16 lookup = lookupOrderArray[order];
113 le_int32 LookupProcessor::selectLookups(const LEReferenceTo<FeatureTable> &featureTable, FeatureMask featureMask, le_int32 order, LEErrorCode &success) argument
116 le_int32 store = order;
130 return store - order;
190 le_int32 count, order = 0; local
238 count += selectLookups(requiredFeatureTable, fm.mask, order, success);
244 OpenTypeUtilities::sort(lookupOrderArray, order);
[all...]
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dtopsort.h41 TopOrderVisitor(vector<StateId> *order, bool *acyclic) argument
42 : order_(order), acyclic_(acyclic) {}
73 vector<StateId> *finish_; // states in finishing-time order
89 vector<StateId> order; local
92 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);
96 StateSort(fst, order);
/external/chromium_org/mojo/android/javatests/src/org/chromium/mojo/bindings/
H A DValidationTestUtilTest.java44 expected.order(ByteOrder.nativeOrder());
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/chromium_org/third_party/opus/src/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/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/chromium_org/base/message_loop/
H A Dmessage_loop_unittest.cc160 // Saves the order in which the tasks executed.
231 void MessageBoxFunc(TaskList* order, int cookie, bool is_reentrant) { argument
232 order->RecordStart(MESSAGEBOX, cookie);
236 order->RecordEnd(MESSAGEBOX, cookie);
240 void EndDialogFunc(TaskList* order, int cookie) { argument
241 order->RecordStart(ENDDIALOG, cookie);
247 order->RecordEnd(ENDDIALOG, cookie);
251 void RecursiveFunc(TaskList* order, int cookie, int depth, argument
253 order->RecordStart(RECURSIVE, cookie);
259 Bind(&RecursiveFunc, order, cooki
264 QuitFunc(TaskList* order, int cookie) argument
270 RecursiveFuncWin(MessageLoop* target, HANDLE event, bool expect_window, TaskList* order, bool is_reentrant) argument
326 TaskList order; local
370 TaskList order; local
[all...]
/external/chromium_org/third_party/openmax_dl/dl/sp/api/
H A DomxSP.h261 * tapsLen - the number of taps, or, equivalently, the filter order + 1
331 * tapsLen - the number of taps, or, equivalently, the filter order + 1
399 * tapsLen - the number of taps, or, equivalently, the filter order + 1
471 * tapsLen - the number of taps, or, equivalently, the filter order + 1
541 * tapsLen - the number of taps, or, equivalently, the filter order + 1
605 * tapsLen - the number of taps, or, equivalently, the filter order + 1
667 * tapsLen - the number of taps, or, equivalently, the filter order + 1
733 * tapsLen - the number of taps, or, equivalently, the filter order + 1
798 * order - the maximum of the degrees of the numerator and denominator
801 * order
[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/chromium_org/third_party/mesa/src/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++) {

Completed in 2958 milliseconds

1234567891011>>