mp_int::used - syntax, references, description

References

Code

Location

Referrer

int used, alloc, sign;

libtommath.h:118

if (a->used > b->used) {

min = b->used;

max = a->used;

min = a->used;

max = b->used;

olduse = c->used;

c->used = max + 1;

for (i = c->used; i < olduse; i++) {

min = b->used;

max = a->used;

olduse = c->used;

c->used = max;

for (i = c->used; i < olduse; i++) {

a->used = 0;

for (i = 0; i < a->used; i++) {

libtommath.h:402

mp_clear()

a->alloc = a->used = 0;

libtommath.h:411

mp_clear()

res = s_mp_mul (a, b, c); /* uses s_mp_mul_digs */

libtommath.h:524

mp_mul()

c->sign = (c->used > 0) ? neg : MP_ZPOS;

if (a->used > 1) {

if (a->used > b->used) {

libtommath.h:935

mp_cmp_mag()

if (a->used < b->used) {

libtommath.h:939

mp_cmp_mag()

tmpa = a->dp + (a->used - 1);

libtommath.h:944

mp_cmp_mag()

tmpb = b->dp + (a->used - 1);

libtommath.h:947

mp_cmp_mag()

for (n = 0; n < a->used; ++n, --tmpa, --tmpb) {

libtommath.h:950

mp_cmp_mag()

a->used += 1;

libtommath.h:987

mp_read_unsigned_bin()

while (mp_iszero (&t) == 0) {

libtommath.h:1011

mp_to_unsigned_bin()

tmpc = c->dp + (c->used - 1);

libtommath.h:1081

mp_div_2d()

for (x = c->used - 1; x >= 0; x--) {

a->used = 0;

if (b->alloc < a->used) {

libtommath.h:1147

mp_copy()

if ((res = mp_grow (b, a->used)) != MP_OKAY) {

libtommath.h:1148

mp_copy()

for (n = 0; n < a->used; n++) {

libtommath.h:1166

mp_copy()

for (; n < b->used; n++) {

b->used = a->used;

if (a->used <= b) {

for (x = 0; x < (a->used - b); x++) {

libtommath.h:1221

mp_rshd()

for (; x < a->used; x++) {

a->used -= b;

while (a->used > 0 && a->dp[a->used - 1] == 0) {

--(a->used);

if (a->used == 0) {

a->used = (a->dp[0] != 0) ? 1 : 0;

libtommath.h:1343

mp_set()

if (c->alloc < (int)(c->used + b/DIGIT_BIT + 1)) {

libtommath.h:1412

mp_mul_2d()

if ((res = mp_grow (c, c->used + b / DIGIT_BIT + 1)) != MP_OKAY) {

libtommath.h:1413

mp_mul_2d()

for (x = 0; x < c->used; x++) {

libtommath.h:1442

mp_mul_2d()

c->dp[(c->used)++] = r;

libtommath.h:1456

mp_mul_2d()

if (a->alloc < a->used + b) {

libtommath.h:1532

mp_lshd()

if ((res = mp_grow (a, a->used + b)) != MP_OKAY) {

a->used += b;

top = a->dp + a->used - 1;

libtommath.h:1545

mp_lshd()

bottom = a->dp + a->used - 1 - b;

libtommath.h:1548

mp_lshd()

for (x = a->used - 1; x >= b; x--) {

if (a->used == 0) {

r = (a->used - 1) * DIGIT_BIT;

libtommath.h:1581

mp_count_bits()

q = a->dp[a->used - 1];

libtommath.h:1584

mp_count_bits()

if (b >= (int) (a->used * DIGIT_BIT)) {

libtommath.h:1606

mp_mod_2d()

for (x = (b / DIGIT_BIT) + ((b % DIGIT_BIT) == 0 ? 0 : 1); x < c->used; x++) {

libtommath.h:1617

mp_mod_2d()

if (mp_iszero (b) == 1) {

libtommath.h:1638

mp_div()

c->sign = (mp_iszero(c) == MP_YES) ? MP_ZPOS : n2;

libtommath.h:1688

mp_div()

d->sign = (mp_iszero(d) == MP_YES) ? MP_ZPOS : n;

libtommath.h:1692

mp_div()

digidx = X->used - 1;

libtommath.h:2027

s_mp_exptmod()

a->used = b / DIGIT_BIT + 1;

libtommath.h:2260

mp_2expt()

if ((res = mp_2expt (a, b->used * 2 * DIGIT_BIT)) != MP_OKAY) {

libtommath.h:2277

mp_reduce_setup()

int res, um = m->used;

libtommath.h:2292

mp_reduce()

MIN (a->used, b->used) <

t.used = digs;

pa = a->used;

pb = MIN (b->used, digs - ix);

libtommath.h:2400

s_mp_mul_digs()

pa = MIN(digs, a->used + b->used);

libtommath.h:2470

fast_s_mp_mul_digs()

ty = MIN(b->used-1, ix);

libtommath.h:2480

fast_s_mp_mul_digs()

iy = MIN(a->used-tx, ty+1);

olduse = c->used;

c->used = pa;

a->used = 0;

pa = a->used;

t.used = 2*pa + 1;

if ((res = mp_init_size (&t, a->used + b->used + 1)) != MP_OKAY) {

libtommath.h:2641

s_mp_mul_high_digs()

t.used = a->used + b->used + 1;

pa = a->used;

pb = b->used;

Call Tree

All items filtered out

Data Use

mp_int::used is written by 16 functions and is read by 24 functions:

Class Tree

All items filtered out

Override Tree

All items filtered out

Implementations

All items filtered out

Instances

Lifecycle

All items filtered out

mp_int::used field

Syntax

Examples

References

Call Tree

Data Use

Class Tree

Override Tree

Implementations

Instances

Lifecycle