Lines Matching defs:sign
124 int used, alloc, sign;
386 * and sign to positive */
389 a->sign = MP_ZPOS;
413 a->sign = MP_ZPOS;
423 /* get sign of both inputs */
424 sa = a->sign;
425 sb = b->sign;
430 /* add their magnitudes, copy the sign */
431 c->sign = sa;
437 /* the sign of the one with the greater magnitude. */
439 c->sign = sb;
442 c->sign = sa;
455 sa = a->sign;
456 sb = b->sign;
462 /* and use the sign of the first number. */
463 c->sign = sa;
471 /* Copy the sign from the first */
472 c->sign = sa;
476 /* The result has the *opposite* sign from */
478 c->sign = (sa == MP_ZPOS) ? MP_NEG : MP_ZPOS;
487 /* high level multiplication (handles sign) */
491 neg = (a->sign == b->sign) ? MP_ZPOS : MP_NEG;
529 c->sign = (c->used > 0) ? neg : MP_ZPOS;
569 if (t.sign != b->sign) {
591 if (P->sign == MP_NEG) {
596 if (X->sign == MP_NEG) {
680 /* compare based on sign */
681 if (a->sign != b->sign) {
682 if (a->sign == MP_NEG) {
690 if (a->sign == MP_NEG) {
702 /* compare based on sign */
703 if (a->sign == MP_NEG) {
728 if (b->sign == MP_NEG || mp_iszero(b) == 1) {
769 if (b->sign == MP_NEG || mp_iszero(b) == 1) {
1110 a->sign = MP_ZPOS;
1160 /* copy used count and sign */
1162 b->sign = a->sign;
1236 * Typically very fast. Also fixes the sign if there
1248 /* reset the sign flag if used == 0 */
1250 a->sign = MP_ZPOS;
1295 * Simple function copies the input and fixes the sign to positive
1308 /* force the sign of b to positive */
1309 b->sign = MP_ZPOS;
1368 b->sign = a->sign;
1654 n = a->sign;
1655 n2 = (a->sign == b->sign ? MP_ZPOS : MP_NEG);
1658 c->sign = (mp_iszero(c) == MP_YES) ? MP_ZPOS : n2;
1662 d->sign = (mp_iszero(d) == MP_YES) ? MP_ZPOS : n;
1728 /* fix the sign */
1729 neg = (a->sign == b->sign) ? MP_ZPOS : MP_NEG;
1730 x.sign = y.sign = MP_ZPOS;
1824 if (x.sign == MP_NEG) {
1843 /* get sign before writing to c */
1844 x.sign = x.used == 0 ? MP_ZPOS : a->sign;
1849 c->sign = neg;
2136 b->sign = MP_ZPOS;
2504 a->sign = MP_ZPOS;
2892 b->sign = a->sign;
3350 /* set the sign */
3351 c->sign = a->sign;
