/external/icu/icu4c/source/i18n/ |
H A D | coleitr.cpp | 307 int32_t CollationElementIterator::strengthOrder(int32_t order) const 312 order &= 0xffff0000; 315 order &= 0xffffff00; 318 return order; 449 CollationElementIterator::getMaxExpansion(int32_t order) const { 450 return getMaxExpansion(rbc_->tailoring->maxExpansions, order); 454 CollationElementIterator::getMaxExpansion(const UHashtable *maxExpansions, int32_t order) { argument 455 if (order == 0) { return 1; } 457 if(maxExpansions != NULL && (max = uhash_igeti(maxExpansions, order)) != 0) { 460 if ((order [all...] |
/external/icu/icu4c/source/layout/ |
H A D | LookupProcessor.cpp | 67 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/icu/icu4c/source/test/intltest/ |
H A D | itercoll.cpp | 230 Order *order = getOrders(*iter, orderLength); local 234 if (orderLength != order2Length || uprv_memcmp(order, order2, orderLength * sizeof(Order)) != 0) { 237 delete[] order; 243 order = getOrders(*iter, orderLength); 246 if (orderLength != order2Length || uprv_memcmp(order, order2, orderLength * sizeof(Order)) != 0) { 249 delete[] order; 255 order = getOrders(*iter, orderLength); 258 if (orderLength != order2Length || uprv_memcmp(order, order2, orderLength * sizeof(Order)) != 0) { 261 delete[] order; 267 order 361 uint32_t order; local 595 int order = 0x0123ABCD; local 641 int32_t order; local [all...] |
/external/libvorbis/lib/ |
H A D | backends.h | 42 int order; member in struct:__anon24736
|
H A D | block.c | 417 int order=16; local 418 float *lpc=alloca(order*sizeof(*lpc)); 423 if(v->pcm_current-v->centerW>order*2){ /* safety */ 430 vorbis_lpc_from_data(work,lpc,v->pcm_current-v->centerW,order); 444 vorbis_lpc_predict(lpc,work+v->pcm_current-v->centerW-order, 445 order, 464 int order=32; local 466 float *lpc=alloca(order*sizeof(*lpc)); 483 if(v->eofflag>order*2){ 490 vorbis_lpc_from_data(v->pcm[i]+v->eofflag-n,lpc,n,order); [all...] |
/external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
H A D | callchain.h | 54 enum chain_order order; member in struct:callchain_param
|
/external/mesa3d/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/openssl/crypto/ec/ |
H A D | ec_key.c | 243 BIGNUM *priv_key = NULL, *order = NULL; local 257 if ((order = BN_new()) == NULL) goto err; 269 if (!EC_GROUP_get_order(eckey->group, order, ctx)) 273 if (!BN_rand_range(priv_key, order)) 295 if (order) 296 BN_free(order); 310 const BIGNUM *order = NULL; local 336 /* testing whether pub_key * order is the point at infinity */ 337 order = &eckey->group->order; [all...] |
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/ |
H A D | fx_zlib_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;
|
H A D | fx_zlib_inflate.c | 560 PULLBYTE() directly in order to pull just enough bytes to decode the next 587 during that inflate() call in order to return the proper return code. 625 static const unsigned short order[19] = /* permutation of code lengths */ local 918 state->lens[order[state->have++]] = (unsigned short)BITS(3); 922 state->lens[order[state->have++]] = 0; 1347 found in order so far, in 0..3. On return *have is updated to the new
|
/external/pdfium/core/src/fxcrt/ |
H A D | fx_basic_gcc.cpp | 42 T order = value / 10;
local 43 while(order > 0) {
45 order = order / 10;
|
/external/qemu/distrib/zlib-1.2.8/ |
H A D | inflate.c | 560 PULLBYTE() directly in order to pull just enough bytes to decode the next 587 during that inflate() call in order to return the proper return code. 625 static const unsigned short order[19] = /* permutation of code lengths */ local 918 state->lens[order[state->have++]] = (unsigned short)BITS(3); 922 state->lens[order[state->have++]] = 0; 1346 found in order so far, in 0..3. On return *have is updated to the new
|
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
H A D | ShadowPreference.java | 25 protected int order; field in class:ShadowPreference 163 return order; 167 public void setOrder(int order) { argument 168 this.order = order;
|
/external/robolectric/src/main/java/com/xtremelabs/robolectric/tester/android/view/ |
H A D | TestMenu.java | 37 public MenuItem add(int groupId, int itemId, int order, CharSequence title) { argument 46 public MenuItem add(int groupId, int itemId, int order, int titleRes) { argument 47 return add(groupId, itemId, order, context.getResources().getString(titleRes)); 71 public SubMenu addSubMenu(int groupId, int itemId, int order, CharSequence title) { argument 82 public SubMenu addSubMenu(int groupId, int itemId, int order, int titleRes) { argument 93 public int addIntentOptions(int groupId, int itemId, int order, ComponentName caller, Intent[] specifics, argument
|
/external/robolectric/src/test/java/com/xtremelabs/robolectric/res/ |
H A D | MenuLoaderTest.java | 72 public MenuItem add(int groupId, int itemId, int order, argument 78 public MenuItem add(int groupId, int itemId, int order, int titleRes) { argument 93 public SubMenu addSubMenu(int groupId, int itemId, int order, argument 99 public SubMenu addSubMenu(int groupId, int itemId, int order, argument 105 public int addIntentOptions(int groupId, int itemId, int order, argument
|
/external/skia/experimental/Intersection/ |
H A D | ConvexHull_Test.cpp | 120 static int rotate_to_hull(const Cubic& cubic, char order[4], size_t idx, size_t inr) { argument 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[ [all...] |
H A D | CubicToQuadratics_Test.cpp | 42 int order = cubic_to_quadratics(cubic, precision, quads); local 43 SkASSERT(order != 4); 44 if (order < 3) { 65 int order = cubic_to_quadratics(cubic, precision, quads); local 66 SkASSERT(order != 4); 67 if (order < 3) {
|
H A D | LineQuadraticIntersection_Test.cpp | 101 SkDebugf("%s [%d] quad order=%d\n", __FUNCTION__, (int) index, order1); 105 SkDebugf("%s [%d] line order=%d\n", __FUNCTION__, (int) index, order2); 192 int order = reduceOrder(quad, reduced, kReduceOrder_TreatAsFill); local 193 if (order < 3) {
|
/external/skia/src/core/ |
H A D | SkFontHost.cpp | 26 void SkFontLCDConfig::SetSubpixelOrder(LCDOrder order) { argument 27 gLCDOrder = order; 47 void SkFontHost::SetSubpixelOrder(LCDOrder order) { argument 48 SkFontLCDConfig::SetSubpixelOrder((SkFontLCDConfig::LCDOrder)order);
|
/external/skia/src/pathops/ |
H A D | SkReduceOrder.cpp | 265 int order = reducer.reduce(quad); local 266 if (order == 2) { // quad became line 267 for (int index = 0; index < order; ++index) { 271 return SkPathOpsPointsToVerb(order - 1); 278 int order = reducer.reduce(cubic, kAllow_Quadratics); local 279 if (order == 2 || order == 3) { // cubic became line or quad 280 for (int index = 0; index < order; ++index) { 284 return SkPathOpsPointsToVerb(order - 1);
|
/external/skia/src/ports/ |
H A D | SkFontConfigParser_android.cpp | 111 familyData->currentFamily->order = -1; 112 // The Family tag has an optional "order" attribute with an integer value >= 0 119 familyData->currentFamily->order = value; 231 // This loop inserts the vendor fallback fonts in the correct order in the 236 int order = family->order; local 237 if (order < 0) { 242 // no order specified on this font, but we're incrementing the order 243 // based on an earlier order insertio [all...] |
/external/smack/src/org/jivesoftware/smack/packet/ |
H A D | PrivacyItem.java | 36 /** order is a non-negative integer that is unique among all items in the list. */
37 private int order;
field in class:PrivacyItem 61 public PrivacyItem(String type, boolean allow, int order) {
argument 64 this.setOrder(order);
168 * Returns the order where the receiver is processed. List items are processed in
169 * ascending order.
171 * The order MUST be filled and its value MUST be a non-negative integer
174 * @return the order number.
177 return order;
182 * Sets the order wher 189 setOrder(int order) argument [all...] |
/external/speex/libspeex/ |
H A D | scal.c | 75 int *order; member in struct:SpeexDecorrState_ 98 st->order = speex_alloc(channels*sizeof(int)); 114 st->order[ch] = 10; 159 int order; local 165 order = st->order[ch]; 185 st->y[i] = alpha*(x[i-ALLPASS_ORDER+order]-beta*x[i-ALLPASS_ORDER+order-1])*st->vorbis_win[st->frame_size+i+order] 188 - beta*ring[ringID+1>=order [all...] |
/external/zlib/src/contrib/infback9/ |
H A D | infback9.c | 248 static const unsigned short order[19] = /* permutation of code lengths */ local 364 state->lens[order[state->have++]] = (unsigned short)BITS(3); 368 state->lens[order[state->have++]] = 0;
|
/external/zlib/src/contrib/puff/ |
H A D | puff.c | 20 * assumed to be 16 bits, for arrays in order to to conserve memory. The code 201 * each length, which for a canonical code are stepped through in order. 202 * symbol[] are the symbol values in canonical order, where the number of 222 * build the code value reversed from what is in the stream in order to 312 * sorted by length, retaining their original order within each length. The 337 * - Within a given code length, the symbols are kept in ascending order for 370 * put symbols in table sorted by length, by symbol order within each 592 * - The code lengths are stored in order for the symbols, so lengths are 641 * code. The code length code lengths are received in a permuted order (see 642 * the order[] arra 674 static const short order[19] = /* permutation of code length codes */ local [all...] |