/external/skia/tests/ |
H A D | PathOpsCubicReduceOrderTest.cpp | 64 int order; local 110 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics); 111 if (order != 1) { 112 SkDebugf("[%d] pointDegenerates order=%d\n", static_cast<int>(index), order); 119 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics); 120 if (order == 1) { 121 SkDebugf("[%d] notPointDegenerates order=%d\n", static_cast<int>(index), order); 122 order [all...] |
H A D | PathOpsQuadLineIntersectionThreadedTest.cpp | 86 int order = reducer.reduce(quad); local 87 if (order < 3) {
|
/external/smack/src/org/jivesoftware/smack/packet/ |
H A D | Privacy.java | 29 * server & manager communication in order to:
133 * Returns the privacy item in the specified order.
136 * @param order the order of the element.
139 public PrivacyItem getItem(String listName, int order) {
argument 144 if (element.getOrder() == order) {
|
/external/smack/src/org/xbill/DNS/ |
H A D | 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, argument 47 this.order = checkU16("order", order); 62 order [all...] |
/external/speex/libspeex/ |
H A D | quant_lsp.c | 71 static void compute_quant_weights(spx_lsp_t *qlsp, spx_word16_t *quant_weight, int order) argument 75 for (i=0;i<order;i++) 81 if (i==order-1) 159 void lsp_quant_nb(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits) argument 165 for (i=0;i<order;i++) 168 compute_quant_weights(qlsp, quant_weight, order); 170 for (i=0;i<order;i++) 174 for (i=0;i<order;i++) 177 id = lsp_quant(qlsp, cdbk_nb, NB_CDBK_SIZE, order); 180 for (i=0;i<order; 213 lsp_unquant_nb(spx_lsp_t *lsp, int order, SpeexBits *bits) argument 242 lsp_quant_lbr(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits) argument 283 lsp_unquant_lbr(spx_lsp_t *lsp, int order, SpeexBits *bits) argument 306 lsp_quant_high(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits) argument 310 lsp_unquant_high(spx_lsp_t *lsp, int order, SpeexBits *bits) argument 319 lsp_quant_high(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits) argument 366 lsp_unquant_high(spx_lsp_t *lsp, int order, SpeexBits *bits) argument [all...] |
/external/wpa_supplicant_8/hostapd/src/common/ |
H A D | sae.h | 35 const struct crypto_bignum *order; member in struct:sae_temporary_data
|
/external/wpa_supplicant_8/hostapd/src/eap_common/ |
H A D | eap_pwd_common.h | 24 BIGNUM *order; member in struct:group_definition_
|
/external/wpa_supplicant_8/src/common/ |
H A D | sae.h | 35 const struct crypto_bignum *order; member in struct:sae_temporary_data
|
/external/wpa_supplicant_8/src/eap_common/ |
H A D | eap_pwd_common.h | 24 BIGNUM *order; member in struct:group_definition_
|
/external/wpa_supplicant_8/wpa_supplicant/src/common/ |
H A D | sae.h | 35 const struct crypto_bignum *order; member in struct:sae_temporary_data
|
/external/wpa_supplicant_8/wpa_supplicant/src/eap_common/ |
H A D | eap_pwd_common.h | 24 BIGNUM *order; member in struct:group_definition_
|
/external/zlib/src/ |
H A D | infback.c | 269 static const unsigned short order[19] = /* permutation of code lengths */ local 380 state->lens[order[state->have++]] = (unsigned short)BITS(3); 384 state->lens[order[state->have++]] = 0;
|
/external/aac/libAACdec/src/ |
H A D | aacdec_tns.cpp | 133 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/aac/libAACenc/src/ |
H A D | aacenc_tns.h | 114 /* TNS max filter order for Low Complexity MPEG4 profile */ 124 INT tnsLimitOrder[MAX_NUM_OF_FILTERS]; /* Limit for TNS order TABUL*/ 136 INT maxOrder; /* max. order of tns filter */ 182 INT order[TRANS_FAC][MAX_NUM_OF_FILTERS]; member in struct:__anon85
|
/external/chromium_org/media/formats/webm/ |
H A D | webm_content_encodings.h | 55 int64 order() const { return order_; } function in class:media::ContentEncoding 56 void set_order(int64 order) { order_ = order; } argument
|
/external/chromium_org/skia/ext/ |
H A D | image_operations.cc | 322 // Users of RESIZE_BETTER are willing to trade some quality in order 366 const SkFontHost::LCDOrder order = SkFontHost::GetSubpixelOrder(); local 413 switch (order) {
|
H A D | recursive_gaussian_convolution.cc | 32 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/WebKit/Source/wtf/dtoa/ |
H A D | double.h | 186 // Returns the significand size for a given order of magnitude. 187 // If v = f*2^e with 2^p-1 <= f <= 2^p then p+e is v's order of magnitude. 192 static int SignificandSizeForOrderOfMagnitude(int order) { argument 193 if (order >= (kDenormalExponent + kSignificandSize)) { 196 if (order <= kDenormalExponent) return 0; 197 return order - kDenormalExponent;
|
/external/chromium_org/third_party/boringssl/src/crypto/ec/ |
H A D | ec_key.c | 313 const BIGNUM *order = NULL; local 339 /* testing whether pub_key * order is the point at infinity */ 342 order = &eckey->group->order; 343 if (BN_is_zero(order)) { 347 if (!EC_POINT_mul(eckey->group, point, NULL, eckey->pub_key, order, ctx)) { 359 if (BN_cmp(eckey->priv_key, order) >= 0) { 439 BIGNUM *priv_key = NULL, *order = NULL; local 447 order = BN_new(); 450 if (order [all...] |
H A D | wnaf.c | 681 BIGNUM *order; local 709 order = BN_CTX_get(ctx); 710 if (order == NULL) 713 if (!EC_GROUP_get_order(group, order, ctx)) 715 if (BN_is_zero(order)) { 720 bits = BN_num_bits(order);
|
/external/chromium_org/third_party/boringssl/src/crypto/ecdsa/ |
H A D | ecdsa.c | 97 * 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/icu/source/test/intltest/ |
H A D | itercoll.cpp | 306 uint32_t order; local 310 order = iter->previous(status); 313 if (CollationElementIterator::isIgnorable(order)) 314 order = iter->previous(status); 322 if (U_FAILURE(status) && iter->getMaxExpansion(order) < count) { 536 * Testing the strength order 540 int order = 0x0123ABCD; local 560 if (iter->strengthOrder(order) != 0x01230000) { 561 errln("Strength order for a primary strength collator should be the first 2 bytes"); 566 if (iter->strengthOrder(order) ! 586 int32_t order; local [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nouveau/ |
H A D | nouveau_mm.c | 39 int order; member in struct:mm_slab 86 mm_bucket_by_order(struct nouveau_mman *cache, int order) argument 88 if (order > MM_MAX_ORDER) 90 return &cache->bucket[MAX2(order, MM_MIN_ORDER) - MM_MIN_ORDER]; 141 slab->order = chunk_order; 189 *offset = mm_slab_alloc(slab) << slab->order; 213 struct mm_bucket *bucket = mm_bucket_by_order(slab->cache, slab->order); 215 mm_slab_free(slab, alloc->offset >> slab->order);
|
/external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/arm64/ |
H A D | ComplexToRealFixup.S | 60 #define order x14 define 107 clz order, subFFTNum // N = 2^order 109 RSB order,order,#63
|
/external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/armv7/ |
H A D | armSP_FFTInv_CCSToR_F32_preTwiddleRadix2_unsafe_s.S | 65 #define order r14 define
|