HomeSort by relevance Sort by last modified time
    Searched refs:order (Results 26 - 50 of 1317) sorted by null

12 3 4 5 6 7 8 91011>>

  /external/chromium_org/third_party/npapi/npspy/extern/nspr/
prolock.h 52 ** directly to PRLock functions, providing no lock order
100 ** order: user defined order of this lock.
111 #define PR_CREATE_ORDERED_LOCK(order,name)\
112 PR_CreateOrderedLock((order),(name))
114 #define PR_CREATE_ORDERED_LOCK(order) PR_NewLock()
119 PRInt32 order,
153 ** referenced by lock. If the order of lock is less than or equal
154 ** to the order of the highest lock held by the locking thread,
  /external/chromium_org/third_party/opus/src/silk/
NLSF_unpack.c 46 ec_sel_ptr = &psNLSF_CB->ec_sel[ CB1_index * psNLSF_CB->order / 2 ];
47 for( i = 0; i < psNLSF_CB->order; i += 2 ) {
50 pred_Q8[ i ] = psNLSF_CB->pred_Q8[ i + ( entry & 1 ) * ( psNLSF_CB->order - 1 ) ];
52 pred_Q8[ i + 1 ] = psNLSF_CB->pred_Q8[ i + ( silk_RSHIFT( entry, 4 ) & 1 ) * ( psNLSF_CB->order - 1 ) + 1 ];
LPC_inv_pred_gain.c 43 const opus_int order /* I Prediction order */
50 Anew_QA = A_QA[ order & 1 ];
53 for( k = order - 1; k > 0; k-- ) {
110 const opus_int16 *A_Q12, /* I Prediction coefficients, Q12 [order] */
111 const opus_int order /* I Prediction order */
119 Anew_QA = Atmp_QA[ order & 1 ];
122 for( k = 0; k < order; k++ ) {
130 return LPC_inverse_pred_gain_QA( Atmp_QA, order );
    [all...]
NLSF_decode.c 36 opus_int16 x_Q10[], /* O Output [ order ] */
37 const opus_int8 indices[], /* I Quantization indices [ order ] */
38 const opus_uint8 pred_coef_Q8[], /* I Backward predictor coefs [ order ] */
40 const opus_int16 order /* I Number of input values */
46 for( i = order-1; i >= 0; i-- ) {
78 pCB_element = &psNLSF_CB->CB1_NLSF_Q8[ NLSFIndices[ 0 ] * psNLSF_CB->order ];
79 for( i = 0; i < psNLSF_CB->order; i++ ) {
87 silk_NLSF_residual_dequant( res_Q10, &NLSFIndices[ 1 ], pred_Q8, psNLSF_CB->quantStepSize_Q16, psNLSF_CB->order );
90 silk_NLSF_VQ_weights_laroia( W_tmp_QW, pNLSF_Q15, psNLSF_CB->order );
93 for( i = 0; i < psNLSF_CB->order; i++ )
    [all...]
  /external/chromium_org/third_party/skia/include/core/
SkFontLCDConfig.h 34 /** 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/chromium_org/third_party/yasm/source/patched-yasm/modules/arch/x86/tests/
gen-fma-test.py 3 def emit(opcode,suffix,width,order,optype):
7 d['order']=order
29 print "v%(opcode)s%(order)s%(suffix)s %(op1)s, %(op2)s, %(op3)s" % (d)
32 print "v%(opcode)s%(order)s%(suffix)s %(op1)s, %(op2)s, %(op3)s" % (d)
37 for order in orders:
39 emit(opcode,suffix,width,order,optype)
  /external/clang/test/PCH/
field-designator.c 26 # error Header inclusion order messed up
  /external/skia/include/core/
SkFontLCDConfig.h 34 /** 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/flac/libFLAC/include/private/
lpc.h 90 * IN 0 < max_order <= FLAC__MAX_LPC_ORDER max LP order to compute
91 * OUT lp_coeff[0,max_order-1][0,max_order-1] LP coefficients for each order
94 * OUT error[0,max_order-1] error for each order (more
99 * Example: if max_order is 9, the LP coefficients for order 9 will be
100 * in lp_coeff[8][0,8], the LP coefficients for order 8 will be
111 * IN lp_coeff[0,order-1] LP coefficients
112 * IN order LP order
116 * OUT qlp_coeff[0,order-1] quantized coefficients
125 int FLAC__lpc_quantize_coefficients(const FLAC__real lp_coeff[], unsigned order, unsigned precision, FLAC__int32 qlp_coeff[], int *shift)
    [all...]
  /external/chromium_org/third_party/opus/src/silk/float/
k2a_FLP.c 36 silk_float *A, /* O prediction coefficients [order] */
37 const silk_float *rc, /* I reflection coefficients [order] */
38 opus_int32 order /* I prediction order */
44 for( k = 0; k < order; k++ ) {
  /external/chromium_org/third_party/skia/src/ports/
SkFontConfigParser_android.h 28 * about each file. Order is the priority order for the font. This is
29 * used internally to determine the order in which to place fallback fonts as
33 FontFamily() : fIsFallbackFont(false), order(-1) {}
38 int order; // only used internally by SkFontConfigParser member in struct:FontFamily
  /external/skia/src/ports/
SkFontConfigParser_android.h 28 * about each file. Order is the priority order for the font. This is
29 * used internally to determine the order in which to place fallback fonts as
33 FontFamily() : fIsFallbackFont(false), order(-1) {}
38 int order; // only used internally by SkFontConfigParser member in struct:FontFamily
  /external/chromium_org/third_party/openssl/openssl/crypto/ecdsa/
ecs_ossl.c 93 BIGNUM *k = NULL, *r = NULL, *order = NULL, *X = NULL; local
117 order = BN_new();
119 if (!k || !r || !order || !X)
129 if (!EC_GROUP_get_order(group, order, ctx))
139 if (!BN_rand_range(k, order))
151 if (!BN_add(k, k, order)) goto err;
152 if (BN_num_bits(k) <= BN_num_bits(order))
153 if (!BN_add(k, k, order)) goto err;
181 if (!BN_nnmod(r, X, order, ctx))
190 if (!BN_mod_inverse(k, k, order, ctx)
226 BIGNUM *kinv=NULL, *s, *m=NULL,*tmp=NULL,*order=NULL; local
358 BIGNUM *order, *u1, *u2, *m, *X; local
    [all...]
  /external/openssl/crypto/ecdsa/
ecs_ossl.c 93 BIGNUM *k = NULL, *r = NULL, *order = NULL, *X = NULL; local
117 order = BN_new();
119 if (!k || !r || !order || !X)
129 if (!EC_GROUP_get_order(group, order, ctx))
139 if (!BN_rand_range(k, order))
151 if (!BN_add(k, k, order)) goto err;
152 if (BN_num_bits(k) <= BN_num_bits(order))
153 if (!BN_add(k, k, order)) goto err;
181 if (!BN_nnmod(r, X, order, ctx))
190 if (!BN_mod_inverse(k, k, order, ctx)
226 BIGNUM *kinv=NULL, *s, *m=NULL,*tmp=NULL,*order=NULL; local
358 BIGNUM *order, *u1, *u2, *m, *X; local
    [all...]
  /external/kernel-headers/original/linux/
gfp.h 102 static inline void arch_free_page(struct page *page, int order) { }
109 unsigned int order)
111 if (unlikely(order >= MAX_ORDER))
118 return __alloc_pages(gfp_mask, order,
123 extern struct page *alloc_pages_current(gfp_t gfp_mask, unsigned order);
126 alloc_pages(gfp_t gfp_mask, unsigned int order)
128 if (unlikely(order >= MAX_ORDER))
131 return alloc_pages_current(gfp_mask, order);
136 #define alloc_pages(gfp_mask, order) \
137 alloc_pages_node(numa_node_id(), gfp_mask, order)
    [all...]
  /external/chromium_org/third_party/opus/src/silk/fixed/
warped_autocorrelation_FIX.c 39 opus_int32 *corr, /* O Result [order + 1] */
44 const opus_int order /* I Correlation order (even) */
52 /* Order must be even */
53 silk_assert( ( order & 1 ) == 0 );
60 for( i = 0; i < order; i += 2 ) {
70 state_QS[ order ] = tmp1_QS;
71 corr_QC[ order ] += silk_RSHIFT64( silk_SMULL( tmp1_QS, state_QS[ 0 ] ), 2 * QS - QC );
79 for( i = 0; i < order + 1; i++ ) {
83 for( i = 0; i < order + 1; i++ )
    [all...]
  /external/chromium/base/
message_loop_unittest.cc 217 // Test that two tasks with different delays run in the right order.
238 // Test that two tasks with the same delay run in the order in which they
613 // Saves the order in which the tasks executed.
657 // Saves the order the tasks ran.
660 OrderedTasks(TaskList* order, int cookie)
661 : order_(order),
665 OrderedTasks(TaskList* order, TaskType type, int cookie)
666 : order_(order),
688 TaskList* order() const { function in class:OrderedTasks
709 MessageBoxTask(TaskList* order, int cookie, bool is_reentrant
881 TaskList order; local
912 TaskList order; local
947 TaskList order; local
987 TaskList order; local
1030 TaskList order; local
1091 TaskList order; local
1114 TaskList order; local
    [all...]
  /external/chromium_org/third_party/re2/util/
sparse_array_test.cc 18 int order[n]; local
21 order[i] = i;
26 int t = order[i];
27 order[i] = order[j];
28 order[j] = t;
33 ASSERT_TRUE(set.has_index(order[j]));
34 ASSERT_EQ(value[order[j]], set.get(order[j], -1));
39 ASSERT_FALSE(set.has_index(order[j]))
    [all...]
  /external/regex-re2/util/
sparse_array_test.cc 18 int order[n]; local
21 order[i] = i;
26 int t = order[i];
27 order[i] = order[j];
28 order[j] = t;
33 ASSERT_TRUE(set.has_index(order[j]));
34 ASSERT_EQ(value[order[j]], set.get(order[j], -1));
39 ASSERT_FALSE(set.has_index(order[j]))
    [all...]
  /external/skia/tests/
PathOpsCubicReduceOrderTest.cpp 62 int order; local
107 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics, SkReduceOrder::kFill_Style);
108 if (order != 1) {
109 SkDebugf("[%d] pointDegenerates order=%d\n", static_cast<int>(index), order);
116 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics, SkReduceOrder::kFill_Style);
117 if (order == 1) {
118 SkDebugf("[%d] notPointDegenerates order=%d\n", static_cast<int>(index), order);
125 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics, SkReduceOrder::kFill_Style)
    [all...]
  /external/smack/src/org/xbill/DNS/
NAPTRRecord.java 18 private int order, preference; field in class:NAPTRRecord
31 * @param order The order of this NAPTR. Records with lower order are
34 * same order.
43 NAPTRRecord(Name name, int dclass, long ttl, int order, int preference,
47 this.order = checkU16("order", order);
62 order = in.readU16()
    [all...]
  /external/chromium_org/third_party/openssl/openssl/crypto/ec/
ec_check.c 62 BIGNUM *order; local
76 if ((order = BN_CTX_get(ctx)) == NULL) goto err;
97 /* check the order of the generator */
99 if (!EC_GROUP_get_order(group, order, ctx)) goto err;
100 if (BN_is_zero(order))
106 if (!EC_POINT_mul(group, point, order, NULL, NULL, ctx)) goto err;
  /external/icu4c/layout/
LookupProcessor.cpp 67 for (le_uint16 order = 0; order < lookupOrderCount; order += 1) {
68 le_uint16 lookup = lookupOrderArray[order];
113 le_int32 LookupProcessor::selectLookups(const FeatureTable *featureTable, FeatureMask featureMask, le_int32 order)
116 le_int32 store = order;
128 return store - order;
184 le_int32 count, order = 0; local
228 count += selectLookups(requiredFeatureTable, fm.mask, order);
234 OpenTypeUtilities::sort(lookupOrderArray, order);
    [all...]
  /external/openssl/crypto/ec/
ec_check.c 62 BIGNUM *order; local
76 if ((order = BN_CTX_get(ctx)) == NULL) goto err;
97 /* check the order of the generator */
99 if (!EC_GROUP_get_order(group, order, ctx)) goto err;
100 if (BN_is_zero(order))
106 if (!EC_POINT_mul(group, point, order, NULL, NULL, ctx)) goto err;
  /frameworks/base/core/java/android/view/
Menu.java 54 * This is the part of an order integer that the user can provide.
59 * Bit shift of the user portion of the order integer.
65 * This is the part of an order integer that supplies the category of the
71 * Bit shift of the category portion of the order integer.
91 * Category code for the order integer for items/groups that are part of a
97 * Category code for the order integer for items/groups that are provided by
103 * Category code for the order integer for items/groups that are
110 * Category code for the order integer for items/groups that are
163 * @param order The order for the item. Use {@link #NONE} if you do not car
    [all...]

Completed in 561 milliseconds

12 3 4 5 6 7 8 91011>>