| /external/dropbear/libtommath/ |
| bn_mp_karatsuba_mul.c | 31 * Note that a1b1 and a0b0 are used twice and only need to be
56 B = MIN (a->used, b->used);
64 if (mp_init_size (&x1, a->used - B) != MP_OKAY)
68 if (mp_init_size (&y1, b->used - B) != MP_OKAY)
80 x0.used = y0.used = B;
81 x1.used = a->used - B;
82 y1.used = b->used - B
[all...] |
| bn_mp_or.c | 24 if (a->used > b->used) {
28 px = b->used;
34 px = a->used;
|
| bn_mp_set.c | 23 a->used = (a->dp[0] != 0) ? 1 : 0;
|
| bn_mp_xor.c | 25 if (a->used > b->used) {
29 px = b->used;
35 px = a->used;
|
| bn_fast_s_mp_sqr.c | 35 pa = a->used + a->used;
53 ty = MIN(a->used-1, ix);
61 while (tx++ < a->used && ty-- >= 0) { ... }
63 iy = MIN(a->used-tx, ty+1);
92 olduse = b->used;
93 b->used = a->used+a->used;
|
| bn_fast_s_mp_mul_digs.c | 48 pa = MIN(digs, a->used + b->used);
58 ty = MIN(b->used-1, ix);
66 while (tx++ < a->used && ty-- >= 0) { ... }
68 iy = MIN(a->used-tx, ty+1);
84 olduse = c->used;
85 c->used = pa;
|
| bn_mp_montgomery_reduce.c | 25 /* can the fast reduction [comba] method be used?
31 digs = n->used * 2 + 1;
33 n->used <
44 x->used = digs;
46 for (ix = 0; ix < n->used; ix++) {
73 for (iy = 0; iy < n->used; iy++) {
96 /* at this point the n.used'th least
99 * right by n.used digits and the
103 /* x = x/b**n.used */
105 mp_rshd (x, n->used);
[all...] |
| bn_mp_karatsuba_sqr.c | 33 B = a->used;
41 if (mp_init_size (&x1, a->used - B) != MP_OKAY)
45 if (mp_init_size (&t1, a->used * 2) != MP_OKAY)
47 if (mp_init_size (&t2, a->used * 2) != MP_OKAY)
51 if (mp_init_size (&x1x1, (a->used - B) * 2) != MP_OKAY)
67 for (x = B; x < a->used; x++) {
72 x0.used = B;
73 x1.used = a->used - B;
|
| bn_s_mp_mul_digs.c | 32 MIN (a->used, b->used) <
40 t.used = digs;
43 pa = a->used;
49 pb = MIN (b->used, digs - ix);
52 /* copy of the digit from a used within the nested loop */
|
| bn_s_mp_sub.c | 25 min = b->used;
26 max = a->used;
34 olduse = c->used;
35 c->used = max;
75 /* clear digits above used (since we may not have grown result above) */
76 for (i = c->used; i < olduse; i++) {
|
| bn_mp_mod_2d.c | 31 if (b >= (int) (a->used * DIGIT_BIT)) {
42 for (x = (b / DIGIT_BIT) + ((b % DIGIT_BIT) == 0 ? 0 : 1); x < c->used; x++) {
|
| bn_mp_montgomery_calc_normalization.c | 31 if (b->used > 1) {
32 if ((res = mp_2expt (a, (b->used - 1) * DIGIT_BIT + bits - 1)) != MP_OKAY) {
|
| bn_mp_read_unsigned_bin.c | 41 a->used += 1;
45 a->used += 2;
|
| bn_mp_2expt.c | 36 /* set the used count of where the bit will go */
37 a->used = b / DIGIT_BIT + 1;
|
| bn_mp_cmp_d.c | 27 if (a->used > 1) {
|
| bn_mp_div_3.c | 30 if ((res = mp_init_size(&q, a->used)) != MP_OKAY) {
34 q.used = a->used;
37 for (ix = a->used - 1; ix >= 0; ix--) {
|
| bn_mp_mul_2d.c | 31 if (c->alloc < (int)(c->used + b/DIGIT_BIT + 1)) {
32 if ((res = mp_grow (c, c->used + b / DIGIT_BIT + 1)) != MP_OKAY) {
61 for (x = 0; x < c->used; x++) {
75 c->dp[(c->used)++] = r;
|
| /external/speex/libspeex/ |
| vq_bfin.h | 20 contributors may be used to endorse or promote products derived from
73 int i,k,used; local
74 used = 0;
96 for (k=N-1; (k >= 1) && (k > used || dist < best_dist[k-1]); k--)
103 used++;
|
| vq.c | 17 contributors may be used to endorse or promote products derived from
78 int i,j,k,used; local
79 used = 0;
92 for (k=N-1; (k >= 1) && (k > used || dist < best_dist[k-1]); k--)
99 used++;
112 int i,j,k, sign, used; local
113 used=0;
134 for (k=N-1; (k >= 1) && (k > used || dist < best_dist[k-1]); k--)
141 used++;
|
| /external/stlport/stlport/stl/ |
| _ioserr.h | 5 * iostreams part of STLport cannot be used when the symbols were defined
9 # error STLport iostreams header cannot be used; you chose not to use iostreams in the STLport configuration file (stlport/stl/config/user_config.h).
11 # error STLport iostreams header cannot be used; your compiler do not support it.
|
| /external/wpa_supplicant_6/wpa_supplicant/src/utils/ |
| wpabuf.c | 22 wpa_printf(MSG_ERROR, "wpabuf %p (size=%lu used=%lu) overflow len=%lu",
23 buf, (unsigned long) buf->size, (unsigned long) buf->used,
36 if (buf->used + add_len > buf->size) {
39 nbuf = os_realloc(buf->ext_data, buf->used + add_len);
42 os_memset(nbuf + buf->used, 0, add_len);
46 buf->used + add_len);
50 os_memset(nbuf + sizeof(struct wpabuf) + buf->used, 0,
54 buf->size = buf->used + add_len;
83 buf->used = len;
124 buf->used += len
[all...] |
| /external/proguard/src/proguard/shrink/ |
| InterfaceUsageMarker.java | 32 * classes that are being used in the visited class.
46 private boolean used; field in class:InterfaceUsageMarker
52 * @param usageMarker the usage marker that is used to mark the classes
70 // Check if any interfaces are being used.
85 // At least one if this interface's interfaces is being used.
104 used = classUsed;
111 used = true;
124 // The ClassConstant isn't marked as being used yet. But maybe it
127 classUsed = used;
131 // The class is being used. Mark the ClassConstant as being use
[all...] |
| /external/dropbear/libtomcrypt/src/pk/asn1/der/choice/ |
| der_decode_choice.c | 43 /* set all of the "used" flags to zero */
45 list[x].used = 0;
57 list[x].used = 1;
67 list[x].used = 1;
77 list[x].used = 1;
88 list[x].used = 1;
99 list[x].used = 1;
107 list[x].used = 1;
118 list[x].used = 1;
130 list[x].used = 1
[all...] |
| /external/wpa_supplicant/ |
| libtommath.c | 93 int used, alloc, sign; member in struct:__anon6737
99 #define mp_iszero(a) (((a)->used == 0) ? MP_YES : MP_NO)
100 #define mp_iseven(a) (((a)->used > 0 && (((a)->dp[0] & 1) == 0)) ? MP_YES : MP_NO)
101 #define mp_isodd(a) (((a)->used > 0 && (((a)->dp[0] & 1) == 1)) ? MP_YES : MP_NO)
105 #define s_mp_mul(a, b, c) s_mp_mul_digs(a, b, c, (a)->used + (b)->used + 1)
148 /* reverse an array, used for radix code */
175 if (a->used > b->used) {
176 min = b->used;
[all...] |
| /external/wpa_supplicant_6/wpa_supplicant/src/tls/ |
| libtommath.c | 116 int used, alloc, sign; member in struct:__anon6968
122 #define mp_iszero(a) (((a)->used == 0) ? MP_YES : MP_NO)
123 #define mp_iseven(a) (((a)->used > 0 && (((a)->dp[0] & 1) == 0)) ? MP_YES : MP_NO)
124 #define mp_isodd(a) (((a)->used > 0 && (((a)->dp[0] & 1) == 1)) ? MP_YES : MP_NO)
128 #define s_mp_mul(a, b, c) s_mp_mul_digs(a, b, c, (a)->used + (b)->used + 1)
188 /* reverse an array, used for radix code */
215 if (a->used > b->used) {
216 min = b->used;
[all...] |
