Home
last modified time | relevance | path

Searched refs:used (Results 1 – 25 of 1670) sorted by relevance

12345678910>>...67

/external/wpa_supplicant_6/wpa_supplicant/src/tls/
Dlibtommath.c116 int used, alloc, sign; member
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)
215 if (a->used > b->used) { in s_mp_add()
216 min = b->used; in s_mp_add()
217 max = a->used; in s_mp_add()
220 min = a->used; in s_mp_add()
221 max = b->used; in s_mp_add()
[all …]
/external/libpng/contrib/pngsuite/
DREADME42 Filter 0 was used 32 times
44 Filter 0 was used 32 times
46 Filter 0 was used 32 times
48 Filter 1 was used 9 times
49 Filter 4 was used 23 times
51 Filter 1 was used 1 times
52 Filter 2 was used 31 times
54 Filter 1 was used 5 times
55 Filter 4 was used 27 times
57 Filter 1 was used 1 times
[all …]
/external/wpa_supplicant/
Dlibtommath.c93 int used, alloc, sign; member
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)
175 if (a->used > b->used) { in s_mp_add()
176 min = b->used; in s_mp_add()
177 max = a->used; in s_mp_add()
180 min = a->used; in s_mp_add()
181 max = b->used; in s_mp_add()
[all …]
/external/dropbear/libtommath/pre_gen/
Dmpi.c236 olduse = x->used; in fast_mp_montgomery_reduce()
239 if (x->alloc < n->used + 1) { in fast_mp_montgomery_reduce()
240 if ((res = mp_grow (x, n->used + 1)) != MP_OKAY) { in fast_mp_montgomery_reduce()
259 for (ix = 0; ix < x->used; ix++) { in fast_mp_montgomery_reduce()
264 for (; ix < n->used * 2 + 1; ix++) { in fast_mp_montgomery_reduce()
272 for (ix = 0; ix < n->used; ix++) { in fast_mp_montgomery_reduce()
308 for (iy = 0; iy < n->used; iy++) { in fast_mp_montgomery_reduce()
333 for (; ix <= n->used * 2 + 1; ix++) { in fast_mp_montgomery_reduce()
348 _W = W + n->used; in fast_mp_montgomery_reduce()
350 for (ix = 0; ix < n->used + 1; ix++) { in fast_mp_montgomery_reduce()
[all …]
/external/dropbear/
Dcircbuffer.c41 cbuf->used = 0; in cbuf_new()
57 return cbuf->used; in cbuf_getused()
63 return cbuf->size - cbuf->used; in cbuf_getavail()
69 dropbear_assert(((2*cbuf->size)+cbuf->writepos-cbuf->readpos)%cbuf->size == cbuf->used%cbuf->size); in cbuf_readlen()
70 …dropbear_assert(((2*cbuf->size)+cbuf->readpos-cbuf->writepos)%cbuf->size == (cbuf->size-cbuf->used… in cbuf_readlen()
72 if (cbuf->used == 0) { in cbuf_readlen()
86 dropbear_assert(cbuf->used <= cbuf->size); in cbuf_writelen()
87 dropbear_assert(((2*cbuf->size)+cbuf->writepos-cbuf->readpos)%cbuf->size == cbuf->used%cbuf->size); in cbuf_writelen()
88 …dropbear_assert(((2*cbuf->size)+cbuf->readpos-cbuf->writepos)%cbuf->size == (cbuf->size-cbuf->used… in cbuf_writelen()
90 if (cbuf->used == cbuf->size) { in cbuf_writelen()
[all …]
/external/dropbear/libtommath/
Dbn_fast_mp_montgomery_reduce.c32 olduse = x->used; in fast_mp_montgomery_reduce()
35 if (x->alloc < n->used + 1) { in fast_mp_montgomery_reduce()
36 if ((res = mp_grow (x, n->used + 1)) != MP_OKAY) { in fast_mp_montgomery_reduce()
55 for (ix = 0; ix < x->used; ix++) { in fast_mp_montgomery_reduce()
60 for (; ix < n->used * 2 + 1; ix++) { in fast_mp_montgomery_reduce()
68 for (ix = 0; ix < n->used; ix++) { in fast_mp_montgomery_reduce()
104 for (iy = 0; iy < n->used; iy++) { in fast_mp_montgomery_reduce()
129 for (; ix <= n->used * 2 + 1; ix++) { in fast_mp_montgomery_reduce()
144 _W = W + n->used; in fast_mp_montgomery_reduce()
146 for (ix = 0; ix < n->used + 1; ix++) { in fast_mp_montgomery_reduce()
[all …]
Dbn_mp_div_2.c24 if (b->alloc < a->used) { in mp_div_2()
25 if ((res = mp_grow (b, a->used)) != MP_OKAY) { in mp_div_2()
30 oldused = b->used; in mp_div_2()
31 b->used = a->used; in mp_div_2()
36 tmpa = a->dp + b->used - 1; in mp_div_2()
39 tmpb = b->dp + b->used - 1; in mp_div_2()
43 for (x = b->used - 1; x >= 0; x--) { in mp_div_2()
55 tmpb = b->dp + b->used; in mp_div_2()
56 for (x = b->used; x < oldused; x++) { in mp_div_2()
Dbn_s_mp_mul_high_digs.c32 if (((a->used + b->used + 1) < MP_WARRAY) in s_mp_mul_high_digs()
33 && MIN (a->used, b->used) < (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) { in s_mp_mul_high_digs()
38 if ((res = mp_init_size (&t, a->used + b->used + 1)) != MP_OKAY) { in s_mp_mul_high_digs()
41 t.used = a->used + b->used + 1; in s_mp_mul_high_digs()
43 pa = a->used; in s_mp_mul_high_digs()
44 pb = b->used; in s_mp_mul_high_digs()
Dbn_mp_sub_d.c26 if (c->alloc < a->used + 1) { in mp_sub_d()
27 if ((res = mp_grow(c, a->used + 1)) != MP_OKAY) { in mp_sub_d()
47 oldused = c->used; in mp_sub_d()
52 if ((a->used == 1 && a->dp[0] <= b) || a->used == 0) { in mp_sub_d()
53 if (a->used == 1) { in mp_sub_d()
62 c->used = 1; in mp_sub_d()
66 c->used = a->used; in mp_sub_d()
74 for (ix = 1; ix < a->used; ix++) { in mp_sub_d()
Dbn_mp_mul.c26 if (MIN (a->used, b->used) >= TOOM_MUL_CUTOFF) { in mp_mul()
32 if (MIN (a->used, b->used) >= KARATSUBA_MUL_CUTOFF) { in mp_mul()
43 int digs = a->used + b->used + 1; in mp_mul()
47 MIN(a->used, b->used) <= in mp_mul()
59 c->sign = (c->used > 0) ? neg : MP_ZPOS; in mp_mul()
Dbn_mp_mul_2.c24 if (b->alloc < a->used + 1) { in mp_mul_2()
25 if ((res = mp_grow (b, a->used + 1)) != MP_OKAY) { in mp_mul_2()
30 oldused = b->used; in mp_mul_2()
31 b->used = a->used; in mp_mul_2()
44 for (x = 0; x < a->used; x++) { in mp_mul_2()
64 ++(b->used); in mp_mul_2()
70 tmpb = b->dp + b->used; in mp_mul_2()
71 for (x = b->used; x < oldused; x++) { in mp_mul_2()
Dbn_mp_karatsuba_mul.c56 B = MIN (a->used, b->used); in mp_karatsuba_mul()
64 if (mp_init_size (&x1, a->used - B) != MP_OKAY) in mp_karatsuba_mul()
68 if (mp_init_size (&y1, b->used - B) != MP_OKAY) in mp_karatsuba_mul()
80 x0.used = y0.used = B; in mp_karatsuba_mul()
81 x1.used = a->used - B; in mp_karatsuba_mul()
82 y1.used = b->used - B; in mp_karatsuba_mul()
102 for (x = B; x < a->used; x++) { in mp_karatsuba_mul()
107 for (x = B; x < b->used; x++) { in mp_karatsuba_mul()
Dbn_s_mp_add.c28 if (a->used > b->used) { in s_mp_add()
29 min = b->used; in s_mp_add()
30 max = a->used; in s_mp_add()
33 min = a->used; in s_mp_add()
34 max = b->used; in s_mp_add()
46 olduse = c->used; in s_mp_add()
47 c->used = max + 1; in s_mp_add()
97 for (i = c->used; i < olduse; i++) { in s_mp_add()
Dbn_mp_add_d.c26 if (c->alloc < a->used + 1) { in mp_add_d()
27 if ((res = mp_grow(c, a->used + 1)) != MP_OKAY) { in mp_add_d()
33 if (a->sign == MP_NEG && (a->used > 1 || a->dp[0] >= b)) { in mp_add_d()
50 oldused = c->used; in mp_add_d()
71 for (ix = 1; ix < a->used; ix++) { in mp_add_d()
81 c->used = a->used + 1; in mp_add_d()
84 c->used = 1; in mp_add_d()
87 if (a->used == 1) { in mp_add_d()
Dbn_mp_cmp_mag.c25 if (a->used > b->used) { in mp_cmp_mag()
29 if (a->used < b->used) { in mp_cmp_mag()
34 tmpa = a->dp + (a->used - 1); in mp_cmp_mag()
37 tmpb = b->dp + (a->used - 1); in mp_cmp_mag()
40 for (n = 0; n < a->used; ++n, --tmpa, --tmpb) { in mp_cmp_mag()
Dbn_fast_s_mp_mul_high_digs.c34 pa = a->used + b->used; in fast_s_mp_mul_high_digs()
42 pa = a->used + b->used; in fast_s_mp_mul_high_digs()
49 ty = MIN(b->used-1, ix); in fast_s_mp_mul_high_digs()
59 iy = MIN(a->used-tx, ty+1); in fast_s_mp_mul_high_digs()
74 olduse = c->used; in fast_s_mp_mul_high_digs()
75 c->used = pa; in fast_s_mp_mul_high_digs()
Dbn_mp_karatsuba_sqr.c33 B = a->used; in mp_karatsuba_sqr()
41 if (mp_init_size (&x1, a->used - B) != MP_OKAY) in mp_karatsuba_sqr()
45 if (mp_init_size (&t1, a->used * 2) != MP_OKAY) in mp_karatsuba_sqr()
47 if (mp_init_size (&t2, a->used * 2) != MP_OKAY) in mp_karatsuba_sqr()
51 if (mp_init_size (&x1x1, (a->used - B) * 2) != MP_OKAY) in mp_karatsuba_sqr()
67 for (x = B; x < a->used; x++) { in mp_karatsuba_sqr()
72 x0.used = B; in mp_karatsuba_sqr()
73 x1.used = a->used - B; in mp_karatsuba_sqr()
Dbn_fast_s_mp_sqr.c35 pa = a->used + a->used; in fast_s_mp_sqr()
53 ty = MIN(a->used-1, ix); in fast_s_mp_sqr()
63 iy = MIN(a->used-tx, ty+1); in fast_s_mp_sqr()
92 olduse = b->used; in fast_s_mp_sqr()
93 b->used = a->used+a->used; in fast_s_mp_sqr()
Dbn_mp_copy.c30 if (b->alloc < a->used) { in mp_copy()
31 if ((res = mp_grow (b, a->used)) != MP_OKAY) { in mp_copy()
49 for (n = 0; n < a->used; n++) { in mp_copy()
54 for (; n < b->used; n++) { in mp_copy()
60 b->used = a->used; in mp_copy()
Dbn_mp_lshd.c29 if (a->alloc < a->used + b) { in mp_lshd()
30 if ((res = mp_grow (a, a->used + b)) != MP_OKAY) { in mp_lshd()
39 a->used += b; in mp_lshd()
42 top = a->dp + a->used - 1; in mp_lshd()
45 bottom = a->dp + a->used - 1 - b; in mp_lshd()
51 for (x = a->used - 1; x >= b; x--) { in mp_lshd()
/external/openssl/crypto/bn/
Dbn_ctx.c104 unsigned used, size; member
146 unsigned int used; member
162 while(bnidx < ctx->used) in ctxdbg()
208 ctx->used = 0; in BN_CTX_init()
225 ret->used = 0; in BN_CTX_new()
262 else if(!BN_STACK_push(&ctx->stack, ctx->used)) in BN_CTX_start()
279 if(fp < ctx->used) in BN_CTX_end()
280 BN_POOL_release(&ctx->pool, ctx->used - fp); in BN_CTX_end()
281 ctx->used = fp; in BN_CTX_end()
303 ctx->used++; in BN_CTX_get()
[all …]
/external/wpa_supplicant_6/wpa_supplicant/src/utils/
Dwpabuf.c23 buf, (unsigned long) buf->size, (unsigned long) buf->used, in wpabuf_overflow()
36 if (buf->used + add_len > buf->size) { in wpabuf_resize()
39 nbuf = os_realloc(buf->ext_data, buf->used + add_len); in wpabuf_resize()
42 os_memset(nbuf + buf->used, 0, add_len); in wpabuf_resize()
46 buf->used + add_len); in wpabuf_resize()
50 os_memset(nbuf + sizeof(struct wpabuf) + buf->used, 0, in wpabuf_resize()
54 buf->size = buf->used + add_len; in wpabuf_resize()
83 buf->used = len; in wpabuf_alloc_ext_data()
124 buf->used += len; in wpabuf_put()
125 if (buf->used > buf->size) { in wpabuf_put()
[all …]
/external/dropbear/libtomcrypt/src/pk/asn1/der/choice/
Dder_decode_choice.c45 list[x].used = 0; in der_decode_choice()
57 list[x].used = 1; in der_decode_choice()
67 list[x].used = 1; in der_decode_choice()
77 list[x].used = 1; in der_decode_choice()
88 list[x].used = 1; in der_decode_choice()
99 list[x].used = 1; in der_decode_choice()
107 list[x].used = 1; in der_decode_choice()
118 list[x].used = 1; in der_decode_choice()
130 list[x].used = 1; in der_decode_choice()
141 list[x].used = 1; in der_decode_choice()
[all …]
/external/quake/quake/src/QW/client/
Dgl_mesh.c35 qboolean used[8192]; variable
65 used[starttri] = 2; in StripLength()
95 if (used[j]) in StripLength()
108 used[j] = 2; in StripLength()
116 if (used[j] == 2) in StripLength()
117 used[j] = 0; in StripLength()
134 used[starttri] = 2; in FanLength()
165 if (used[j]) in FanLength()
175 used[j] = 2; in FanLength()
183 if (used[j] == 2) in FanLength()
[all …]
/external/quake/quake/src/WinQuake/
Dgl_mesh.cpp35 qboolean used[8192]; variable
65 used[starttri] = 2; in StripLength()
95 if (used[j]) in StripLength()
108 used[j] = 2; in StripLength()
116 if (used[j] == 2) in StripLength()
117 used[j] = 0; in StripLength()
134 used[starttri] = 2; in FanLength()
165 if (used[j]) in FanLength()
175 used[j] = 2; in FanLength()
183 if (used[j] == 2) in FanLength()
[all …]

12345678910>>...67