Lines Matching defs:sign
127 int used, alloc, sign;
391 * and sign to positive */
394 a->sign = MP_ZPOS;
418 a->sign = MP_ZPOS;
428 /* get sign of both inputs */
429 sa = a->sign;
430 sb = b->sign;
435 /* add their magnitudes, copy the sign */
436 c->sign = sa;
442 /* the sign of the one with the greater magnitude. */
444 c->sign = sb;
447 c->sign = sa;
460 sa = a->sign;
461 sb = b->sign;
467 /* and use the sign of the first number. */
468 c->sign = sa;
476 /* Copy the sign from the first */
477 c->sign = sa;
481 /* The result has the *opposite* sign from */
483 c->sign = (sa == MP_ZPOS) ? MP_NEG : MP_ZPOS;
492 /* high level multiplication (handles sign) */
496 neg = (a->sign == b->sign) ? MP_ZPOS : MP_NEG;
534 c->sign = (c->used > 0) ? neg : MP_ZPOS;
574 if (t.sign != b->sign) {
596 if (P->sign == MP_NEG) {
601 if (X->sign == MP_NEG) {
688 /* compare based on sign */
689 if (a->sign != b->sign) {
690 if (a->sign == MP_NEG) {
698 if (a->sign == MP_NEG) {
710 /* compare based on sign */
711 if (a->sign == MP_NEG) {
736 if (b->sign == MP_NEG || mp_iszero(b) == 1) {
777 if (b->sign == MP_NEG || mp_iszero(b) == 1) {
1118 a->sign = MP_ZPOS;
1168 /* copy used count and sign */
1170 b->sign = a->sign;
1244 * Typically very fast. Also fixes the sign if there
1256 /* reset the sign flag if used == 0 */
1258 a->sign = MP_ZPOS;
1303 * Simple function copies the input and fixes the sign to positive
1316 /* force the sign of b to positive */
1317 b->sign = MP_ZPOS;
1376 b->sign = a->sign;
1661 n = a->sign;
1662 n2 = (a->sign == b->sign ? MP_ZPOS : MP_NEG);
1665 c->sign = (mp_iszero(c) == MP_YES) ? MP_ZPOS : n2;
1669 d->sign = (mp_iszero(d) == MP_YES) ? MP_ZPOS : n;
1735 /* fix the sign */
1736 neg = (a->sign == b->sign) ? MP_ZPOS : MP_NEG;
1737 x.sign = y.sign = MP_ZPOS;
1831 if (x.sign == MP_NEG) {
1850 /* get sign before writing to c */
1851 x.sign = x.used == 0 ? MP_ZPOS : a->sign;
1856 c->sign = neg;
2143 b->sign = MP_ZPOS;
2515 a->sign = MP_ZPOS;
2903 b->sign = a->sign;
3361 /* set the sign */
3362 c->sign = a->sign;
