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 <stdio.h>
2N/A#include <mp.h>
2N/A#include <sys/types.h>
2N/A#include "libmp.h"
2N/A#include <stdlib.h>
2N/A#include <unistd.h>
2N/A
2N/Avoid
2N/A_mp_move(MINT *a, MINT *b)
2N/A{
2N/A int i, j;
2N/A
2N/A _mp_xfree(b);
2N/A b->len = a->len;
2N/A if ((i = a->len) < 0) {
2N/A i = -i;
2N/A }
2N/A if (i == 0) {
2N/A return;
2N/A }
2N/A b->val = _mp_xalloc(i, "_mp_move");
2N/A for (j = 0; j < i; j++) {
2N/A b->val[j] = a->val[j];
2N/A }
2N/A}
2N/A
2N/A/* ARGSUSED */
2N/A/* VARARGS */
2N/Ashort *
2N/A_mp_xalloc(int nint, char *s)
2N/A{
2N/A short *i;
2N/A
2N/A i = malloc(sizeof (short) * ((unsigned)nint + 2)); /* ??? 2 ??? */
2N/A#ifdef DEBUG
2N/A (void) fprintf(stderr, "%s: %p\n", s, i);
2N/A#endif
2N/A if (i == NULL) {
2N/A _mp_fatal("mp: no free space");
2N/A }
2N/A return (i);
2N/A}
2N/A
2N/Avoid
2N/A_mp_fatal(char *s)
2N/A{
2N/A (void) fprintf(stderr, "%s\n", s);
2N/A (void) fflush(stdout);
2N/A (void) sleep(2);
2N/A abort();
2N/A}
2N/A
2N/Avoid
2N/A_mp_xfree(MINT *c)
2N/A{
2N/A#ifdef DBG
2N/A (void) fprintf(stderr, "xfree ");
2N/A#endif
2N/A if (c->len != 0) {
2N/A free(c->val);
2N/A c->len = 0;
2N/A }
2N/A}
2N/A
2N/Avoid
2N/A_mp_mcan(MINT *a)
2N/A{
2N/A int i, j;
2N/A
2N/A if ((i = a->len) == 0) {
2N/A return;
2N/A }
2N/A if (i < 0) {
2N/A i = -i;
2N/A }
2N/A for (j = i; j > 0 && a->val[j-1] == 0; j--)
2N/A ;
2N/A if (j == i) {
2N/A return;
2N/A }
2N/A if (j == 0) {
2N/A _mp_xfree(a);
2N/A return;
2N/A }
2N/A if (a->len > 0) {
2N/A a->len = j;
2N/A } else {
2N/A a->len = -j;
2N/A }
2N/A}
2N/A
2N/A
2N/AMINT *
2N/Amp_itom(short n)
2N/A{
2N/A MINT *a;
2N/A
2N/A a = malloc(sizeof (MINT));
2N/A if (n > 0) {
2N/A a->len = 1;
2N/A a->val = _mp_xalloc(1, "mp_itom1");
2N/A *a->val = n;
2N/A } else if (n < 0) {
2N/A a->len = -1;
2N/A a->val = _mp_xalloc(1, "mp_itom2");
2N/A *a->val = -n;
2N/A } else {
2N/A a->len = 0;
2N/A }
2N/A return (a);
2N/A}
2N/A
2N/Aint
2N/Amp_mcmp(MINT *a, MINT *b)
2N/A{
2N/A MINT c;
2N/A int res;
2N/A
2N/A _mp_mcan(a);
2N/A _mp_mcan(b);
2N/A if (a->len != b->len) {
2N/A return (a->len - b->len);
2N/A }
2N/A c.len = 0;
2N/A mp_msub(a, b, &c);
2N/A res = c.len;
2N/A _mp_xfree(&c);
2N/A return (res);
2N/A}
2N/A
2N/A/*
2N/A * Convert hex digit to binary value
2N/A */
2N/Astatic short
2N/Axtoi(char c)
2N/A{
2N/A if (c >= '0' && c <= '9') {
2N/A return (c - '0');
2N/A } else if (c >= 'a' && c <= 'f') {
2N/A return (c - 'a' + 10);
2N/A } else if (c >= 'A' && c <= 'F') {
2N/A return (c - 'A' + 10);
2N/A } else {
2N/A return (-1);
2N/A }
2N/A}
2N/A
2N/A
2N/A/*
2N/A * Convert hex key to MINT key
2N/A */
2N/AMINT *
2N/Amp_xtom(char *key)
2N/A{
2N/A short digit;
2N/A MINT *m = mp_itom(0);
2N/A MINT *d;
2N/A MINT *sixteen;
2N/A
2N/A sixteen = mp_itom(16);
2N/A for (; *key; key++) {
2N/A digit = xtoi(*key);
2N/A if (digit < 0) {
2N/A return (NULL);
2N/A }
2N/A d = mp_itom(digit);
2N/A mp_mult(m, sixteen, m);
2N/A mp_madd(m, d, m);
2N/A mp_mfree(d);
2N/A }
2N/A mp_mfree(sixteen);
2N/A return (m);
2N/A}
2N/A
2N/Astatic char
2N/Aitox(short d)
2N/A{
2N/A d &= 15;
2N/A if (d < 10) {
2N/A return ('0' + d);
2N/A } else {
2N/A return ('a' - 10 + d);
2N/A }
2N/A}
2N/A
2N/A/*
2N/A * Convert MINT key to hex key
2N/A */
2N/Achar *
2N/Amp_mtox(MINT *key)
2N/A{
2N/A MINT *m = mp_itom(0);
2N/A MINT *zero = mp_itom(0);
2N/A short r;
2N/A char *p;
2N/A char c;
2N/A char *s;
2N/A char *hex;
2N/A int size;
2N/A
2N/A#define BASEBITS (8 * (unsigned int)sizeof (short) - 1)
2N/A
2N/A if (key->len >= 0) {
2N/A size = key->len;
2N/A } else {
2N/A size = -key->len;
2N/A }
2N/A hex = malloc((size_t) ((size * BASEBITS + 3)) / 4 + (size ? 1 : 2));
2N/A if (hex == NULL) {
2N/A return (NULL);
2N/A }
2N/A _mp_move(key, m);
2N/A p = hex;
2N/A do {
2N/A mp_sdiv(m, 16, m, &r);
2N/A *p++ = itox(r);
2N/A } while (mp_mcmp(m, zero) != 0);
2N/A mp_mfree(m);
2N/A mp_mfree(zero);
2N/A
2N/A *p = 0;
2N/A for (p--, s = hex; s < p; s++, p--) {
2N/A c = *p;
2N/A *p = *s;
2N/A *s = c;
2N/A }
2N/A return (hex);
2N/A}
2N/A
2N/A/*
2N/A * Deallocate a multiple precision integer
2N/A */
2N/Avoid
2N/Amp_mfree(MINT *a)
2N/A{
2N/A _mp_xfree(a);
2N/A free(a);
2N/A}