1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111
|
/*
bigint.c - Manage big positive integer numbers
Copyright (c) 1996,2001 Martin Schulze <joey@artis.uni-oldenburg.de>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
$Id: bigint.c,v 1.2 2001/11/17 23:12:42 joey Exp $
*/
#include "bigint.h"
#include <stdio.h>
#include <string.h>
#include <malloc.h>
bigint bigint_add(bigint a, bigint b)
{
int i;
unsigned long int tmp;
bigint c;
for (i=0; i<BIGINT_LEN; i++) {
tmp = a.val[i] + b.val[i];
if (tmp >= BIGINT_MAX) {
c.val[i] = tmp - BIGINT_MAX;
if (i<BIGINT_LEN)
a.val[i+1]++;
else
fprintf(stderr, "Overflow in bigint addition.");
} else
c.val[i] = tmp;
}
return c;
}
bigint bigint_sub(bigint a, bigint b)
{
/* FIXME */
fprintf (stderr, "bigint_sub not supported yet.\n");
return a;
}
bigint bigint_int(int num)
{
bigint x;
int i;
for (i=0; i<BIGINT_LEN; i++) x.val[i] = 0L;
x.val[0] = num;
x.val[1] = 0;
return x;
}
bigint bigint_string(char *s)
{
char tmp[BIGINT_PREC+1];
bigint a;
int i;
char *cp, *x;
for (i=0; i<BIGINT_LEN; i++) a.val[i] = 0L;
if ((x = (char *)malloc(strlen(s)+1))) {
strcpy(x, s);
for (i=0; i<BIGINT_LEN; i++) {
if (strlen(x)) {
cp = x;
if (strlen(x) > BIGINT_PREC)
cp += (strlen(x) - BIGINT_PREC);
strcpy(tmp, cp);
*cp = '\0';
sscanf(tmp, "%lu", &a.val[i]);
}
}
free (x);
}
return a;
}
void bigint_sprintf (char *res, char *format, bigint a)
{
char s[(BIGINT_PREC*BIGINT_LEN)+1];
char tmp[BIGINT_PREC+1];
char form[6];
int i, max;
memset (s, 0, sizeof(s));
sprintf(form, "%%0%dlu", BIGINT_PREC);
max = BIGINT_LEN;
for (;max>0 && !a.val[max-1];max--);
for (i=0; i<max; i++) {
if (i<max-1)
sprintf(tmp, form, a.val[i]);
else
sprintf(tmp, "%lu", a.val[i]);
sprintf (res, "%s%s", tmp, s);
sprintf (s, "%s", res);
}
sprintf (res, format, s);
}
|