Lines Matching defs:sign
116 int used, alloc, sign;
378 * and sign to positive */
381 a->sign = MP_ZPOS;
405 a->sign = MP_ZPOS;
415 /* get sign of both inputs */
416 sa = a->sign;
417 sb = b->sign;
422 /* add their magnitudes, copy the sign */
423 c->sign = sa;
429 /* the sign of the one with the greater magnitude. */
431 c->sign = sb;
434 c->sign = sa;
447 sa = a->sign;
448 sb = b->sign;
454 /* and use the sign of the first number. */
455 c->sign = sa;
463 /* Copy the sign from the first */
464 c->sign = sa;
468 /* The result has the *opposite* sign from */
470 c->sign = (sa == MP_ZPOS) ? MP_NEG : MP_ZPOS;
479 /* high level multiplication (handles sign) */
483 neg = (a->sign == b->sign) ? MP_ZPOS : MP_NEG;
521 c->sign = (c->used > 0) ? neg : MP_ZPOS;
561 if (t.sign != b->sign) {
583 if (P->sign == MP_NEG) {
588 if (X->sign == MP_NEG) {
672 /* compare based on sign */
673 if (a->sign != b->sign) {
674 if (a->sign == MP_NEG) {
682 if (a->sign == MP_NEG) {
694 /* compare based on sign */
695 if (a->sign == MP_NEG) {
720 if (b->sign == MP_NEG || mp_iszero(b) == 1) {
761 if (b->sign == MP_NEG || mp_iszero(b) == 1) {
1102 a->sign = MP_ZPOS;
1152 /* copy used count and sign */
1154 b->sign = a->sign;
1228 * Typically very fast. Also fixes the sign if there
1240 /* reset the sign flag if used == 0 */
1242 a->sign = MP_ZPOS;
1287 * Simple function copies the input and fixes the sign to positive
1300 /* force the sign of b to positive */
1301 b->sign = MP_ZPOS;
1360 b->sign = a->sign;
1646 n = a->sign;
1647 n2 = (a->sign == b->sign ? MP_ZPOS : MP_NEG);
1650 c->sign = (mp_iszero(c) == MP_YES) ? MP_ZPOS : n2;
1654 d->sign = (mp_iszero(d) == MP_YES) ? MP_ZPOS : n;
1720 /* fix the sign */
1721 neg = (a->sign == b->sign) ? MP_ZPOS : MP_NEG;
1722 x.sign = y.sign = MP_ZPOS;
1816 if (x.sign == MP_NEG) {
1835 /* get sign before writing to c */
1836 x.sign = x.used == 0 ? MP_ZPOS : a->sign;
1841 c->sign = neg;
2128 b->sign = MP_ZPOS;
2496 a->sign = MP_ZPOS;
2884 b->sign = a->sign;
3342 /* set the sign */
3343 c->sign = a->sign;
