2N/A/* Copyright (c) 1984, 1986, 1987, 1988, 1989 AT&T */
2N/A/* All Rights Reserved */
2N/A
2N/A
2N/A/*
2N/A * Copyright (c) 1980 Regents of the University of California.
2N/A * All rights reserved. The Berkeley software License Agreement
2N/A * specifies the terms and conditions for redistribution.
2N/A */
2N/A/* Portions Copyright(c) 1988, Sun Microsystems Inc. */
2N/A/* All Rights Reserved */
2N/A
2N/A/*
2N/A * Copyright (c) 1997, by Sun Microsystems, Inc.
2N/A * All rights reserved.
2N/A */
2N/A
2N/A#ident "%Z%%M% %I% %E% SMI" /* SVr4.0 1.1 */
2N/A
2N/A/* LINTLIBRARY */
2N/A
2N/A#include <mp.h>
2N/A#include "libmp.h"
2N/A#include <sys/types.h>
2N/A#include <stdlib.h>
2N/A
2N/Astatic void
2N/Am_add(MINT *a, MINT *b, MINT *c)
2N/A{
2N/A int carry, i;
2N/A int x;
2N/A short *cval;
2N/A
2N/A cval = _mp_xalloc(a->len + 1, "m_add");
2N/A carry = 0;
2N/A for (i = 0; i < b->len; i++) {
2N/A x = carry + a->val[i] + b->val[i];
2N/A if (x & 0100000) {
2N/A carry = 1;
2N/A cval[i] = (short)(x & 077777);
2N/A } else {
2N/A carry = 0;
2N/A cval[i] = (short)x;
2N/A }
2N/A }
2N/A for (; i < a->len; i++) {
2N/A x = carry + a->val[i];
2N/A if (x & 0100000) {
2N/A cval[i] = (short)(x & 077777);
2N/A } else {
2N/A carry = 0;
2N/A cval[i] = (short)x;
2N/A }
2N/A }
2N/A if (carry == 1) {
2N/A cval[i] = 1;
2N/A c->len = i + 1;
2N/A } else {
2N/A c->len = a->len;
2N/A }
2N/A c->val = cval;
2N/A if (c->len == 0) {
2N/A free(cval);
2N/A }
2N/A}
2N/A
2N/Avoid
2N/Amp_madd(MINT *a, MINT *b, MINT *c)
2N/A{
2N/A MINT x, y;
2N/A int sign;
2N/A
2N/A x.len = y.len = 0;
2N/A _mp_move(a, &x);
2N/A _mp_move(b, &y);
2N/A _mp_xfree(c);
2N/A sign = 1;
2N/A if (x.len >= 0) {
2N/A if (y.len >= 0) {
2N/A if (x.len >= y.len) {
2N/A m_add(&x, &y, c);
2N/A } else {
2N/A m_add(&y, &x, c);
2N/A }
2N/A } else {
2N/A y.len = -y.len;
2N/A mp_msub(&x, &y, c);
2N/A }
2N/A } else {
2N/A if (y.len <= 0) {
2N/A x.len = -x.len;
2N/A y.len = -y.len;
2N/A sign = -1;
2N/A mp_madd(&x, &y, c);
2N/A } else {
2N/A x.len = -x.len;
2N/A mp_msub(&y, &x, c);
2N/A }
2N/A }
2N/A c->len = sign * c->len;
2N/A _mp_xfree(&x);
2N/A _mp_xfree(&y);
2N/A}
2N/A
2N/Astatic void
2N/Am_sub(MINT *a, MINT *b, MINT *c)
2N/A{
2N/A int x, i;
2N/A int borrow;
2N/A short one;
2N/A MINT mone;
2N/A
2N/A one = 1;
2N/A mone.len = 1;
2N/A mone.val = &one;
2N/A c->val = _mp_xalloc(a->len, "m_sub");
2N/A borrow = 0;
2N/A for (i = 0; i < b->len; i++) {
2N/A x = borrow + a->val[i] - b->val[i];
2N/A if (x & 0100000) {
2N/A borrow = -1;
2N/A c->val[i] = (short)(x & 077777);
2N/A } else {
2N/A borrow = 0;
2N/A c->val[i] = (short)x;
2N/A }
2N/A }
2N/A for (; i < a->len; i++) {
2N/A x = borrow + a->val[i];
2N/A if (x & 0100000) {
2N/A c->val[i] = (short)(x & 077777);
2N/A } else {
2N/A borrow = 0;
2N/A c->val[i] = (short)x;
2N/A }
2N/A }
2N/A if (borrow < 0) {
2N/A for (i = 0; i < a->len; i++) {
2N/A c->val[i] ^= 077777;
2N/A }
2N/A c->len = a->len;
2N/A mp_madd(c, &mone, c);
2N/A }
2N/A for (i = a->len-1; i >= 0; --i) {
2N/A if (c->val[i] > 0) {
2N/A if (borrow == 0) {
2N/A c->len = i + 1;
2N/A } else {
2N/A c->len = -i - 1;
2N/A }
2N/A return;
2N/A }
2N/A }
2N/A free(c->val);
2N/A}
2N/A
2N/Avoid
2N/Amp_msub(MINT *a, MINT *b, MINT *c)
2N/A{
2N/A MINT x, y;
2N/A int sign;
2N/A
2N/A x.len = y.len = 0;
2N/A _mp_move(a, &x);
2N/A _mp_move(b, &y);
2N/A _mp_xfree(c);
2N/A sign = 1;
2N/A if (x.len >= 0) {
2N/A if (y.len >= 0) {
2N/A if (x.len >= y.len) {
2N/A m_sub(&x, &y, c);
2N/A } else {
2N/A sign = -1;
2N/A mp_msub(&y, &x, c);
2N/A }
2N/A } else {
2N/A y.len = -y.len;
2N/A mp_madd(&x, &y, c);
2N/A }
2N/A } else {
2N/A if (y.len <= 0) {
2N/A x.len = -x.len;
2N/A y.len = -y.len;
2N/A mp_msub(&y, &x, c);
2N/A } else {
2N/A x.len = -x.len;
2N/A mp_madd(&x, &y, c);
2N/A sign = -1;
2N/A }
2N/A }
2N/A c->len = sign * c->len;
2N/A _mp_xfree(&x);
2N/A _mp_xfree(&y);
2N/A}