| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| ReserializingTestCollectionGenerator.java | 80 public Iterable<E> order(List<E> insertionOrder) { method in class:ReserializingTestCollectionGenerator
81 return delegate.order(insertionOrder);
|
| /external/kernel-headers/original/linux/ |
| mempool.h | 69 * allocates pages of the order specified by pool_data
73 static inline mempool_t *mempool_create_page_pool(int min_nr, int order)
76 (void *)(long)order);
|
| /external/mesa3d/src/gallium/drivers/nouveau/ |
| nouveau_mm.c | 39 int order; member in struct:mm_slab
86 mm_bucket_by_order(struct nouveau_mman *cache, int order)
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/objects/ |
| objects.pl | 16 { die "$ARGV[1]:$o:There's already an object with NID ",$mynum," on line ",$order{$mynum},"\n"; }
18 { die "$ARGV[1]:$o:There's already an object with name ",$Cname," on line ",$order{$nid{$Cname}},"\n"; }
21 $order{$mynum} = $o;
50 $order{$Cname} = $o;
76 { die "objects.txt:$o:There's already an object with long name ",$ln{$module.$Cname}," on line ",$order{$module.$Cname},"\n"; }
83 { die "objects.txt:$o:There's already an object with short name ",$sn{$module.$Cname}," on line ",$order{$module.$Cname},"\n"; }
92 { die "objects.txt:$o:There's already an object with long name ",$ln{$module.$Cname}," on line ",$order{$module.$Cname},"\n"; }
98 $order{$Cname} = $o;
|
| /packages/apps/Settings/src/com/android/settings/deviceinfo/ |
| UsageBarPreference.java | 53 public void addEntry(int order, float percentage, int color) {
54 mEntries.add(PercentageBarChart.createEntry(order, percentage, color));
|
| /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/ |
| WnnDictionary.java | 74 /** Sort order (frequency in descending). */
76 /** Sort order (character code of key string in ascending). */
200 * result of prefix search is output by following order: "bbcd",
206 * <th><td>Search Mode</td><td>Sort Order</td><td>Ambiguous Search</td></th>
217 * @param order The sort order
226 public int searchWord(int operation, int order, String keyString );
233 * the same as {@link #searchWord(int operation, int order, String keyString)}.
244 public int searchWord(int operation, int order, String keyString, WnnWord wnnWord );
|
| /external/chromium_org/v8/test/mjsunit/ |
| enumeration-order.js | 44 // Validate the enumeration order for object up to 100 named properties.
57 // Validate the enumeration order for object literals up to 100 named
61 // We enumerate indexed properties in numerical order followed by
62 // named properties in insertion order, followed by indexed properties
63 // of the prototype object in numerical order, followed by named
64 // properties of the prototype object in insertion order, and so on.
66 // This enumeration order is not required by the specification, so
|
| to_number_order.js | 137 assertEquals("hestfisk", x, "String.fromCharCode valueOf order");
144 assertEquals("hestfisk", x, "Compare objects a < b valueOf order");
148 // assertEquals("hesthest", x, "Compare objects a < a valueOf order");
156 assertEquals("fiskfisk", x, "Compare objects b > b valueOf order");
160 assertEquals("fiskfisk", x, "Compare objects b >= b valueOf order");
164 assertEquals("hestfisk", x, "Compare objects a > b valueOf order");
168 assertEquals("hest", x, "Compare objects a > undefined valueOf order");
172 assertEquals("fisk", x, "Compare objects undefined > b valueOf order");
178 assertEquals("hestfisk", x, "Compare objects a < b valueOf order");
182 // assertEquals("hesthest", x, "Compare objects a < a valueOf order");
[all...] |
| /external/v8/test/mjsunit/ |
| enumeration-order.js | 44 // Validate the enumeration order for object up to 100 named properties.
57 // Validate the enumeration order for object literals up to 100 named
61 // We enumerate indexed properties in numerical order followed by
62 // named properties in insertion order, followed by indexed properties
63 // of the prototype object in numerical order, followed by named
64 // properties of the prototype object in insertion order, and so on.
66 // This enumeration order is not required by the specification, so
|
| to_number_order.js | 137 assertEquals("hestfisk", x, "String.fromCharCode valueOf order");
144 assertEquals("hestfisk", x, "Compare objects a < b valueOf order");
148 // assertEquals("hesthest", x, "Compare objects a < a valueOf order");
156 assertEquals("fiskfisk", x, "Compare objects b > b valueOf order");
160 assertEquals("fiskfisk", x, "Compare objects b >= b valueOf order");
164 assertEquals("hestfisk", x, "Compare objects a > b valueOf order");
168 assertEquals("hest", x, "Compare objects a > undefined valueOf order");
172 assertEquals("fisk", x, "Compare objects undefined > b valueOf order");
178 assertEquals("hestfisk", x, "Compare objects a < b valueOf order");
182 // assertEquals("hesthest", x, "Compare objects a < a valueOf order");
[all...] |
| /external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
| ShadowPreference.java | 25 protected int order; field in class:ShadowPreference
163 return order;
167 public void setOrder(int order) {
168 this.order = order;
|
| /external/robolectric/src/test/java/com/xtremelabs/robolectric/res/ |
| MenuLoaderTest.java | 72 public MenuItem add(int groupId, int itemId, int order,
78 public MenuItem add(int groupId, int itemId, int order, int titleRes) {
93 public SubMenu addSubMenu(int groupId, int itemId, int order,
99 public SubMenu addSubMenu(int groupId, int itemId, int order,
105 public int addIntentOptions(int groupId, int itemId, int order,
|
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| itercoll.cpp | 191 Order *orders = getOrders(*iter, orderLength);
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")
586 int32_t order; local
[all...] |
| /external/chromium_org/third_party/opus/src/silk/float/ |
| noise_shape_analysis_FLP.c | 42 opus_int order
48 gain = coefs[ order - 1 ];
49 for( i = order - 2; i >= 0; i-- ) {
62 opus_int order
68 for( i = order - 1; i > 0; i-- ) {
74 for( i = 0; i < order; i++ ) {
83 for( i = 0; i < order; i++ ) {
96 for( i = 1; i < order; i++ ) {
102 for( i = 0; i < order; i++ ) {
109 silk_bwexpander_FLP( coefs_syn, order, chirp )
[all...] |
| /external/icu4c/test/intltest/ |
| itercoll.cpp | 191 Order *orders = getOrders(*iter, orderLength);
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")
586 int32_t order; local
[all...] |
| ssearch.cpp | 323 struct Order
325 int32_t order; member in struct:Order
338 void add(int32_t order, int32_t low, int32_t high);
339 const Order *get(int32_t index) const;
348 Order *list;
356 list = new Order[listMax];
365 int32_t order, low, high; local
381 list = new Order[listMax];
387 order = ucol_next(elems, &status);
390 if (order != UCOL_NULLORDER)
437 const Order *order = get(index); local
448 const Order *order = get(index); local
459 const Order *order = get(index); local
524 const Order *order = list.get(i); local
542 const Order *order = list.get(i); local
639 int32_t order, low, high; local
[all...] |
| /external/dropbear/libtomcrypt/src/math/fp/ |
| ltc_ecc_fp_mulmod.c | 784 void *tk, *order; local
909 void *tka, *tkb, *order; local
[all...] |
| /external/chromium_org/third_party/skia/src/ports/ |
| SkFontConfigParser_android.cpp | 115 familyData->currentFamily->order = -1;
116 // The Family tag has an optional "order" attribute with an integer value >= 0
123 familyData->currentFamily->order = value;
234 // This loop inserts the vendor fallback fonts in the correct order in the
239 int order = family->order; local
240 if (order < 0) {
245 // no order specified on this font, but we're incrementing the order
246 // based on an earlier order insertion reques
[all...] |
| /external/skia/src/ports/ |
| SkFontConfigParser_android.cpp | 115 familyData->currentFamily->order = -1;
116 // The Family tag has an optional "order" attribute with an integer value >= 0
123 familyData->currentFamily->order = value;
234 // This loop inserts the vendor fallback fonts in the correct order in the
239 int order = family->order; local
240 if (order < 0) {
245 // no order specified on this font, but we're incrementing the order
246 // based on an earlier order insertion reques
[all...] |
| /external/wpa_supplicant_8/src/eap_common/ |
| eap_pwd_common.c | 121 grp->order = NULL;
132 ((grp->order = BN_new()) == NULL) ||
145 if (!EC_GROUP_get_order(grp->group, grp->order, NULL)) {
146 wpa_printf(MSG_INFO, "EAP-pwd: unable to get order for curve");
248 "multiply generator by order");
268 BN_free(grp->order);
269 grp->order = NULL;
274 /* cleanliness and order.... */
309 offset = BN_num_bytes(grp->order) - BN_num_bytes(peer_scalar);
312 eap_pwd_h_update(hash, cruft, BN_num_bytes(grp->order));
[all...] |
| /development/samples/ApiDemos/src/com/example/android/apis/graphics/kube/ |
| GLWorld.java | 37 bb.order(ByteOrder.nativeOrder());
41 bb.order(ByteOrder.nativeOrder());
45 bb.order(ByteOrder.nativeOrder());
|
| /external/chromium_org/third_party/openssl/openssl/crypto/ec/ |
| ec_key.c | 241 BIGNUM *priv_key = NULL, *order = NULL; local
255 if ((order = BN_new()) == NULL) goto err;
267 if (!EC_GROUP_get_order(eckey->group, order, ctx))
271 if (!BN_rand_range(priv_key, order))
293 if (order)
294 BN_free(order);
308 const BIGNUM *order = NULL; local
334 /* testing whether pub_key * order is the point at infinity */
335 order = &eckey->group->order;
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/ |
| mem_dbg.c | 136 static unsigned long order = 0; /* number of memory requests */ variable
179 unsigned long order; member in struct:mem_st
248 * appropriate order (long-time lock first).
525 if (order == break_order_num)
528 m->order=order;
530 m->order=order++;
533 m->order,
589 mp->order, mp->addr, mp->num)
[all...] |
| /external/openssl/crypto/ec/ |
| ec_key.c | 241 BIGNUM *priv_key = NULL, *order = NULL; local
255 if ((order = BN_new()) == NULL) goto err;
267 if (!EC_GROUP_get_order(eckey->group, order, ctx))
271 if (!BN_rand_range(priv_key, order))
293 if (order)
294 BN_free(order);
308 const BIGNUM *order = NULL; local
334 /* testing whether pub_key * order is the point at infinity */
335 order = &eckey->group->order;
[all...] |
| /external/openssl/crypto/ |
| mem_dbg.c | 136 static unsigned long order = 0; /* number of memory requests */ variable
179 unsigned long order; member in struct:mem_st
248 * appropriate order (long-time lock first).
525 if (order == break_order_num)
528 m->order=order;
530 m->order=order++;
533 m->order,
589 mp->order, mp->addr, mp->num)
[all...] |
