| /external/chromium_org/third_party/opus/src/silk/ |
| NLSF_encode.c | 69 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/ |
| NLSF_encode.c | 69 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 ) );
|
| /libcore/luni/src/main/java/java/nio/ |
| DirectByteBuffer.java | 122 this.block.peekCharArray(offset + position, dst, dstOffset, charCount, order.needsSwap);
129 this.block.peekDoubleArray(offset + position, dst, dstOffset, doubleCount, order.needsSwap);
136 this.block.peekFloatArray(offset + position, dst, dstOffset, floatCount, order.needsSwap);
143 this.block.peekIntArray(offset + position, dst, dstOffset, intCount, order.needsSwap);
150 this.block.peekLongArray(offset + position, dst, dstOffset, longCount, order.needsSwap);
157 this.block.peekShortArray(offset + position, dst, dstOffset, shortCount, order.needsSwap);
181 char result = (char) this.block.peekShort(offset + position, order);
189 return (char) this.block.peekShort(offset + index, order);
198 double result = Double.longBitsToDouble(this.block.peekLong(offset + position, order));
206 return Double.longBitsToDouble(this.block.peekLong(offset + index, order));
[all...] |
| /external/chromium_org/base/message_loop/ |
| message_loop_unittest.cc | 160 // Saves the order in which the tasks executed.
231 void MessageBoxFunc(TaskList* order, int cookie, bool is_reentrant) {
232 order->RecordStart(MESSAGEBOX, cookie);
236 order->RecordEnd(MESSAGEBOX, cookie);
240 void EndDialogFunc(TaskList* order, int cookie) {
241 order->RecordStart(ENDDIALOG, cookie);
247 order->RecordEnd(ENDDIALOG, cookie);
251 void RecursiveFunc(TaskList* order, int cookie, int depth,
253 order->RecordStart(RECURSIVE, cookie);
259 Bind(&RecursiveFunc, order, cookie, depth - 1, is_reentrant))
326 TaskList order; local
370 TaskList order; local
[all...] |
| /external/chromium_org/third_party/openmax_dl/dl/sp/api/ |
| omxSP.h | 261 * 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=max(K,M)=L gives the maximum delay, in samples, used to
[all...] |
| /external/libexif/libexif/fuji/ |
| exif-mnote-data-fuji.c | 26 #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/ |
| exif-data.c | 53 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);
[all...] |
| /external/chromium_org/third_party/mesa/src/src/glx/ |
| eval.c | 40 __glFillMap1f(GLint k, GLint order, GLint stride,
45 __GLX_PUT_FLOAT_ARRAY(0, points, order * k);
50 for (i = 0; i < order; i++) {
59 __glFillMap1d(GLint k, GLint order, GLint stride,
64 __GLX_PUT_DOUBLE_ARRAY(0, points, order * k);
68 for (i = 0; i < order; i++) {
|
| /external/chromium_org/third_party/openmax_dl/dl/sp/src/x86/ |
| omxSP_FFTInit_R_F32.c | 35 * [in] order base-2 logarithm of the desired block length;
45 OMXResult omxSP_FFTInit_R_F32(OMXFFTSpec_R_F32 *pFFTSpec, OMX_INT order)
60 if (!pFFTSpec || (order < 1) || (order > TWIDDLE_TABLE_ORDER))
63 N = 1 << order;
81 diff = 1 << (TWIDDLE_TABLE_ORDER - order + 1);
86 if (order > 1) {
|
| /external/mesa3d/src/glx/ |
| eval.c | 40 __glFillMap1f(GLint k, GLint order, GLint stride,
45 __GLX_PUT_FLOAT_ARRAY(0, points, order * k);
50 for (i = 0; i < order; i++) {
59 __glFillMap1d(GLint k, GLint order, GLint stride,
64 __GLX_PUT_DOUBLE_ARRAY(0, points, order * k);
68 for (i = 0; i < order; i++) {
|
| /frameworks/base/libs/hwui/utils/ |
| SortedListImpl.cpp | 50 ssize_t SortedListImpl::_indexOrderOf(const void* item, size_t* order) const {
71 if (order) {
72 *order = l;
78 size_t order; local
79 ssize_t index = _indexOrderOf(item, &order);
80 index = VectorImpl::insertAt(item, order, 1);
|
| /external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/neon/ |
| omxSP_FFTInv_CCSToR_S32_Sfs_s.S | 94 #define order r14 define
200 CLZ order,N @// N = 2^order
201 RSB order,order,#31
205 ADD scale,scale,order @// FFTInverse has a final scaling factor by N
207 CMP order,#3
208 BGT orderGreaterthan3 @// order > 3
210 CMP order,#1
211 BGE orderGreaterthan0 @// order >
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/ingest/data/ |
| MtpDeviceIndex.java | 17 * order, and the items within the buckets sorted by the date they are taken.
27 * The data can also be accessed in descending order, in which case the list
196 * specified order
197 * @param order
199 * order
201 public Object get(int position, SortOrder order) {
206 if (order == SortOrder.ASCENDING) {
228 * include labels and is in the specified order
229 * @return position-th item in specified order, when not including labels
231 public IngestObjectInfo getWithoutLabels(int position, SortOrder order) {
[all...] |
| /external/aac/libAACdec/src/ |
| aacdec_tns.cpp | 133 UCHAR n_filt,order; local
176 filter->Order = order = (UCHAR) FDKreadBits(bs, isLongFlag ? 5 : 3);
179 if (filter->Order > TNS_MAXIMUM_ORDER){
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)
218 // - Simple all-pole filter of order "order" defined b
[all...] |
| /external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/java/security/spec/ |
| ECParameterSpec_ImplTest.java | 65 * <code>curve</code>, <code>generator</code> or <code>order</code> is <code>null</code><br>
76 BigInteger order = BigInteger.valueOf(5L); local
80 new ECParameterSpec(null, generator, order, 10);
88 new ECParameterSpec(curve, null, order, 10);
94 // Test case 3: order is null
113 * <code>order</code> or <code>cofactor</code> is not positive<br>
126 // Test case 1: order is negative
134 // Test case 2: order == 0
158 // Test case 5: both order and cofactor are not positive
181 BigInteger order = BigInteger.valueOf(5L) local
204 BigInteger order = BigInteger.valueOf(5L); local
229 BigInteger order = BigInteger.valueOf(5L); local
254 BigInteger order = BigInteger.valueOf(5L); local
[all...] |
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| ConvexHull_Test.cpp | 120 static int rotate_to_hull(const Cubic& cubic, char order[4], size_t idx, size_t inr) {
214 order[0] = 0;
219 order[totalSides++] = next;
233 char order[4], cmpOrder[4]; local
238 int result = convex_hull(cubic, order);
249 if (pts & 1 << order[pt]) {
250 SkDebugf("%s [%d,%d] duplicate index in order: %d,%d,%d",
252 order[0], order[1], order[2])
[all...] |
| /external/libexif/libexif/pentax/ |
| exif-mnote-data-pentax.c | 28 #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, datao + doff)
[all...] |
| /external/skia/experimental/Intersection/ |
| ConvexHull_Test.cpp | 120 static int rotate_to_hull(const Cubic& cubic, char order[4], size_t idx, size_t inr) {
214 order[0] = 0;
219 order[totalSides++] = next;
233 char order[4], cmpOrder[4]; local
238 int result = convex_hull(cubic, order);
249 if (pts & 1 << order[pt]) {
250 SkDebugf("%s [%d,%d] duplicate index in order: %d,%d,%d",
252 order[0], order[1], order[2])
[all...] |
| /external/flac/libFLAC/ |
| lpc.c | 143 /* save this order */
156 int FLAC__lpc_quantize_coefficients(const FLAC__real lp_coeff[], unsigned order, unsigned precision, FLAC__int32 qlp_coeff[], int *shift)
173 for(i = 0; i < order; i++) {
201 for(i = 0; i < order; i++) {
234 fprintf(stderr,"FLAC__lpc_quantize_coefficients: negative shift=%d order=%u cmax=%f\n", *shift, order, cmax);
236 for(i = 0; i < order; i++) {
265 void FLAC__lpc_compute_residual_from_qlp_coefficients(const FLAC__int32 *data, unsigned data_len, const FLAC__int32 qlp_coeff[], unsigned order, int lp_quantization, FLAC__int32 residual[])
274 fprintf(stderr,"FLAC__lpc_compute_residual_from_qlp_coefficients: data_len=%d, order=%u, lpq=%d",data_len,order,lp_quantization)
1361 unsigned order, index, 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/chromium_org/components/keyed_service/core/ |
| dependency_graph.h | 32 // Topologically sorts nodes to produce a safe construction order
34 bool GetConstructionOrder(std::vector<DependencyNode*>* order)
37 // Topologically sorts nodes to produce a safe destruction order
39 bool GetDestructionOrder(std::vector<DependencyNode*>* order)
50 // Populates |construction_order_| with computed construction order.
60 // Cached construction order (needs rebuild with BuildConstructionOrder
|
| /external/chromium_org/skia/ext/ |
| recursive_gaussian_convolution.h | 21 enum Order {
29 SK_API RecursiveFilter(float sigma, Order order);
31 Order order() const { return order_; } function in class:skia::RecursiveFilter
35 Order order_;
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| OrderIterator.cpp | 70 } while (!m_currentChild || m_currentChild->style()->order() != *m_orderValuesIterator);
89 m_iterator.m_orderValues.insert(child->style()->order());
|
| /external/chromium_org/third_party/WebKit/Source/web/linux/ |
| WebFontRendering.cpp | 86 void WebFontRendering::setLCDOrder(SkFontHost::LCDOrder order)
88 SkFontHost::SetSubpixelOrder(order);
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/ |
| build.properties | 25 jars.compile.order = performanceui.jar
|
| /external/flac/libFLAC/include/private/ |
| fixed.h | 46 * of the residual signal for each order. The _wide() version uses
75 * IN data[-order,data_len-1] original signal (NOTE THE INDICES!)
77 * IN order <= FLAC__MAX_FIXED_ORDER fixed-predictor order
80 void FLAC__fixed_compute_residual(const FLAC__int32 data[], unsigned data_len, unsigned order, FLAC__int32 residual[]);
90 * IN order <= FLAC__MAX_FIXED_ORDER fixed-predictor order
92 * IN data[-order,-1] previously-reconstructed historical samples
95 void FLAC__fixed_restore_signal(const FLAC__int32 residual[], unsigned data_len, unsigned order, FLAC__int32 data[]);
|
