| /external/chromium/third_party/icu/source/test/cintltst/ |
| callcoll.h | 34 int32_t order; member in struct:OrderAndOffset
|
| /external/chromium/third_party/icu/source/test/intltest/ |
| tscoll.h | 26 struct Order
28 int32_t order; member in struct:IntlTestCollator::Order
51 Order *getOrders(CollationElementIterator &iter, int32_t &orderLength);
|
| /external/icu4c/test/cintltst/ |
| callcoll.h | 34 int32_t order; member in struct:OrderAndOffset
|
| /external/icu4c/test/intltest/ |
| tscoll.h | 26 struct Order
28 int32_t order; member in struct:IntlTestCollator::Order
51 Order *getOrders(CollationElementIterator &iter, int32_t &orderLength);
|
| /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;
|
| /external/dropbear/libtomcrypt/src/pk/ecc/ |
| ecc_test.c | 32 void *modulus, *order; local
36 if ((err = mp_init_multi(&modulus, &order, NULL)) != CRYPT_OK) {
43 mp_clear_multi(modulus, order, NULL);
54 if ((err = mp_read_radix(order, (char *)ltc_ecc_sets[i].order, 16)) != CRYPT_OK) { goto done; }
63 /* is order prime ? */
64 if ((err = mp_prime_is_prime(order, 8, &primality)) != CRYPT_OK) { goto done; }
74 /* then we should have G == (order + 1)G */
75 if ((err = mp_add_d(order, 1, order)) != CRYPT_OK) { goto done;
[all...] |
| /external/kernel-headers/original/linux/ |
| bitops.h | 13 int order; local
15 order = fls(count);
16 return order; /* We could be slightly more clever with -1 here... */
21 int order; local
23 order = fls(count) - 1;
25 order++;
26 return order;
|
| /frameworks/base/media/libstagefright/codecs/aacdec/ |
| s_tnsfilt.h | 35 Description: Had to add "start_coef" and "stop_coef" in order to preserve
117 UInt order; member in struct:__anon9118
|
| /bionic/linker/ |
| ba.h | 34 unsigned order:7; /* size of the region in ba space */ member in struct:ba_bits
44 /* the order of the largest allocation that can be made */
|
| ba.c | 37 #define BA_ORDER(index) ba->bitmap[index].order
68 /* find a slots buddy Buddy# = Slot# ^ (1 << order)
104 unsigned long order = ba_order(ba, len); local
106 if (order > ba->max_order)
110 * if you find a free slot of the correct order use it
111 * otherwise, use the best fit (smallest with size > order) slot
115 if (BA_ORDER(curr) == (unsigned char)order) {
120 if (BA_ORDER(curr) > (unsigned char)order &&
135 * split the slot into 2 buddies of order - 1
136 * repeat until the slot is of the correct order
[all...] |
| /external/iproute2/tc/ |
| f_route.c | 45 __u32 order = 0; local
110 } else if (matches(*argv, "order") == 0) {
112 if (get_u32(&order, *argv, 0)) {
113 fprintf(stderr, "Illegal \"order\"\n");
127 if (order) {
129 fh |= (order<<8)&0x7F00;
149 fprintf(f, "order %d ", (handle>>8)&0x7F);
|
| /libcore/luni/src/main/java/java/nio/ |
| CharArrayBuffer.java | 88 public final ByteOrder order() { method in class:CharArrayBuffer
|
| DoubleArrayBuffer.java | 88 public final ByteOrder order() { method in class:DoubleArrayBuffer
|
| FloatArrayBuffer.java | 88 public final ByteOrder order() { method in class:FloatArrayBuffer
|
| IntArrayBuffer.java | 88 public final ByteOrder order() { method in class:IntArrayBuffer
|
| LongArrayBuffer.java | 88 public final ByteOrder order() { method in class:LongArrayBuffer
|
| ShortArrayBuffer.java | 88 public final ByteOrder order() { method in class:ShortArrayBuffer
|
| ReadOnlyDirectByteBuffer.java | 42 buf.order(other.order());
148 buf.order = order;
|
| ReadOnlyHeapByteBuffer.java | 40 buf.order(other.order());
157 slice.order = order;
|
| ReadWriteDirectByteBuffer.java | 43 buf.order(other.order());
171 boolean swap = order() != ByteOrder.nativeOrder();
211 boolean swap = order() != ByteOrder.nativeOrder();
251 boolean swap = order() != ByteOrder.nativeOrder();
264 getBaseAddress().setDouble(offset + position, value, order);
274 getBaseAddress().setDouble(offset + index, value, order);
284 getBaseAddress().setFloat(offset + position, value, order);
294 getBaseAddress().setFloat(offset + index, value, order);
304 getBaseAddress().setInt(offset + position, value, order);
[all...] |
| /libcore/luni/src/main/java/java/security/spec/ |
| ECParameterSpec.java | 30 // Order of the generator
31 private final BigInteger order; field in class:ECParameterSpec
37 * the base point, the order of the generator (or base point) and the
44 * @param order
45 * the order of the generator.
49 * if {@code order <= zero} or {@code cofactor <= zero}.
52 BigInteger order, int cofactor) {
55 this.order = order;
57 // throw NullPointerException if curve, generator or order is nul
[all...] |
| /libcore/luni/src/test/java/libcore/java/text/ |
| OldCollationElementIteratorTest.java | 34 int order = iterator.next(); local
36 while (order != CollationElementIterator.NULLORDER) {
37 orders[i++] = order;
38 order = iterator.next();
43 order = iterator.previous();
45 while (order != CollationElementIterator.NULLORDER) {
46 assertEquals(orders[--i], order);
47 order = iterator.previous();
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| topsort.h | 38 // If acyclic, ORDER[i] gives the topological position of state Id i;
41 TopOrderVisitor(vector<StateId> *order, bool *acyclic)
42 : order_(order), acyclic_(acyclic) {}
73 vector<StateId> *finish_; // states in finishing-time order
89 vector<StateId> order; local
92 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);
96 StateSort(fst, order);
|
| /external/openssl/crypto/ecdsa/ |
| ecs_lib.c | 207 BIGNUM *order=NULL; local
217 if ((order = BN_new()) == NULL) return 0;
218 if (!EC_GROUP_get_order(group,order,NULL))
220 BN_clear_free(order);
223 i=BN_num_bits(order);
233 BN_clear_free(order);
|
| 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))
171 if (!BN_nnmod(r, X, order, ctx))
180 if (!BN_mod_inverse(k, k, order, ctx))
202 if (order != NULL)
203 BN_free(order);
216 BIGNUM *kinv=NULL, *s, *m=NULL,*tmp=NULL,*order=NULL local
348 BIGNUM *order, *u1, *u2, *m, *X; local
[all...] |
