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 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739
|
#include "EXTERN.h"
#include "perl.h"
#include "XSUB.h"
#include "gmp.h"
/*
Math::BigInt::GMP XS code, largely based on Math::GMP, a Perl module for
high-speed arbitrary size integer calculations (C) 2000 James H. Turner
*/
MODULE = Math::BigInt::GMP PACKAGE = Math::BigInt::GMP
PROTOTYPES: ENABLE
#define NEW_GMP_MPZ_T RETVAL = malloc (sizeof(mpz_t));
#define NEW_GMP_MPZ_T_INIT RETVAL = malloc (sizeof(mpz_t)); mpz_init(*RETVAL);
#define GMP_GET_ARG_0 if (sv_derived_from(x, "Math::BigInt::GMP")) {\
IV tmp = SvIV((SV*)SvRV(x));\
TEMP = (mpz_t*) tmp;\
} else { croak("x is not of type Math::BigInt::GMP"); }
#define GMP_GET_ARG_1 if (sv_derived_from(y, "Math::BigInt::GMP")) {\
IV tmp = SvIV((SV*)SvRV(y));\
TEMP_1 = (mpz_t*) tmp;\
} else { croak("y is not of type Math::BigInt::GMP"); }
#define GMP_GET_ARGS_0_1 GMP_GET_ARG_0; GMP_GET_ARG_1;
##############################################################################
# _new()
mpz_t *
_new(Class,x)
SV* x
CODE:
NEW_GMP_MPZ_T;
mpz_init_set_str(*RETVAL, SvPV_nolen(x), 0);
OUTPUT:
RETVAL
##############################################################################
# _from_bin()
mpz_t *
_from_bin(Class,x)
SV* x
CODE:
NEW_GMP_MPZ_T;
mpz_init_set_str(*RETVAL, SvPV_nolen(x), 0);
OUTPUT:
RETVAL
##############################################################################
# _from_hex()
mpz_t *
_from_hex(Class,x)
SV* x
CODE:
NEW_GMP_MPZ_T;
mpz_init_set_str(*RETVAL, SvPV_nolen(x), 0);
OUTPUT:
RETVAL
##############################################################################
# _zero()
mpz_t *
_zero(Class)
CODE:
NEW_GMP_MPZ_T;
mpz_init_set_ui(*RETVAL, 0);
OUTPUT:
RETVAL
##############################################################################
# _one()
mpz_t *
_one(Class)
CODE:
NEW_GMP_MPZ_T;
mpz_init_set_ui(*RETVAL, 1);
OUTPUT:
RETVAL
##############################################################################
# _two()
mpz_t *
_two(Class)
CODE:
NEW_GMP_MPZ_T;
mpz_init_set_ui(*RETVAL, 2);
OUTPUT:
RETVAL
##############################################################################
# _ten()
mpz_t *
_ten(Class)
CODE:
NEW_GMP_MPZ_T;
mpz_init_set_ui(*RETVAL, 10);
OUTPUT:
RETVAL
##############################################################################
# DESTROY() - free memory of a GMP number
void
DESTROY(n)
mpz_t* n
PPCODE:
mpz_clear(*n);
free(n);
##############################################################################
# _num() - numify, return string so that atof() and atoi() can use it
SV *
_num(Class, n)
mpz_t* n
PREINIT:
int len;
char *buf;
char *buf_end;
CODE:
/* len is always >= 1, and might be off (greater) by one than real len */
len = mpz_sizeinbase(*n, 10);
RETVAL = newSV(len); /* alloc len +1 bytes */
SvPOK_on(RETVAL);
buf = SvPVX(RETVAL); /* get ptr to storage */
buf_end = buf + len - 1; /* end of storage (-1)*/
mpz_get_str(buf, 10, *n); /* convert to decimal string */
if (*buf_end == 0)
{
len --; /* got one shorter than expected */
}
SvCUR_set(RETVAL, len); /* so set real length */
OUTPUT:
RETVAL
##############################################################################
# _zeros() - return number of trailing zeros (in decimal form)
# This is costly, since it needs O(N*N) to convert the number to decimal,
# even though for most cases the number does not have many trailing zeros.
# For numbers longer than X digits (10?) we could divide repeatable by 1e5
# or something and see if we get zeros.
int
_zeros(Class,n)
mpz_t* n
PREINIT:
SV* TEMP;
int len;
char *buf;
char *buf_end;
CODE:
/* odd numbers can not have trailing zeros */
RETVAL = 1 - mpz_tstbit(*n,0);
if (RETVAL != 0) /* was even */
{
/* len is always >= 1, and might be off (greater) by one than real len */
len = mpz_sizeinbase(*n, 10);
TEMP = newSV(len); /* alloc len +1 bytes */
SvPOK_on(TEMP); /* make an PV */
buf = SvPVX(TEMP); /* get ptr to storage */
buf_end = buf + len - 1; /* end of storage (-1)*/
mpz_get_str(buf, 10, *n); /* convert to decimal string */
RETVAL = 0;
if (*buf_end == 0) /* points to terminating zero? */
{
buf_end--; /* ptr to last real digit */
len --; /* got one shorter than expected */
}
if (len > 1) /* '0' has not trailing zeross! */
{
while (len-- > 0) /* actually, we should hit a nonzero */
{ /* before the end */
if (*buf_end-- != '0')
{
break;
}
RETVAL++;
}
}
SvREFCNT_dec(TEMP); /* Bumpersticker: Free Temp! */
} /* end if n was even */
OUTPUT:
RETVAL
##############################################################################
# _as_hex() - return ref to hexadecimal string (prefixed with 0x)
SV *
_as_hex(Class,n)
mpz_t * n
PREINIT:
int len;
char *buf;
CODE:
/* len is always >= 1, and accurate (unlike in decimal) */
len = mpz_sizeinbase(*n, 16) + 2;
RETVAL = newSV(len); /* alloc len +1 (+2 for '0x') bytes */
SvPOK_on(RETVAL);
buf = SvPVX(RETVAL); /* get ptr to storage */
*buf++ = '0'; *buf++ = 'x'; /* prepend '0x' */
mpz_get_str(buf, 16, *n); /* convert to hexadecimal string */
SvCUR_set(RETVAL, len); /* so set real length */
OUTPUT:
RETVAL
##############################################################################
# _as_bin() - return ref to binary string (prefixed with 0b)
SV *
_as_bin(Class,n)
mpz_t * n
PREINIT:
int len;
char *buf;
CODE:
/* len is always >= 1, and accurate (unlike in decimal) */
len = mpz_sizeinbase(*n, 2) + 2;
RETVAL = newSV(len); /* alloc len +1 (+2 for '0b') bytes */
SvPOK_on(RETVAL);
buf = SvPVX(RETVAL); /* get ptr to storage */
*buf++ = '0'; *buf++ = 'b'; /* prepend '0b' */
mpz_get_str(buf, 2, *n); /* convert to binary string */
SvCUR_set(RETVAL, len); /* so set real length */
OUTPUT:
RETVAL
##############################################################################
# _modpow() - ($n ** $exp) % $mod
mpz_t *
_modpow(Class, n, exp, mod)
mpz_t* n
mpz_t* exp
mpz_t* mod
CODE:
NEW_GMP_MPZ_T_INIT;
mpz_powm(*RETVAL, *n, *exp, *mod);
OUTPUT:
RETVAL
##############################################################################
# _modinv() - compute the inverse of x % y
#
# int mpz_invert (mpz_t rop, mpz_t op1, mpz_t op2) Function
# Compute the inverse of op1 modulo op2 and put the result in rop. If the
# inverse exists, the return value is non-zero and rop will satisfy
# 0 <= rop < op2. If an inverse doesn't exist the return value is zero and rop
# is undefined.
void
_modinv(Class,x,y)
mpz_t* x
mpz_t* y
PREINIT:
int rc, sign;
SV* s;
mpz_t* RETVAL;
PPCODE:
NEW_GMP_MPZ_T_INIT;
rc = mpz_invert(*RETVAL, *x, *y);
EXTEND(SP, 2); /* we return two values */
if (rc == 0)
{
/* inverse doesn't exist, return value undefined */
PUSHs ( &PL_sv_undef );
PUSHs ( &PL_sv_undef );
}
else
{
/* inverse exists, get sign */
sign = mpz_sgn (*RETVAL);
/* absolute result */
mpz_abs (*RETVAL, *RETVAL);
PUSHs(sv_setref_pv(sv_newmortal(), "Math::BigInt::GMP", (void*)RETVAL));
if (sign >= 0)
{
PUSHs ( &PL_sv_undef ); /* result is ok, keep it */
}
else
{
s = sv_newmortal();
sv_setpvn (s, "+", 1);
PUSHs ( s ); /* result must be negated */
}
}
##############################################################################
# _add() - add $y to $x in place
void
_add(Class,x,y)
SV* x
SV* y
PREINIT:
mpz_t* TEMP;
mpz_t* TEMP_1;
PPCODE:
GMP_GET_ARGS_0_1; /* (TEMP, TEMP_1) = (x,y) */
mpz_add(*TEMP, *TEMP, *TEMP_1);
PUSHs( x );
##############################################################################
# _inc() - modify x inline by doing x++
void
_inc(Class,x)
SV* x
PREINIT:
mpz_t* TEMP;
PPCODE:
GMP_GET_ARG_0; /* TEMP = mpz_t(x) */
mpz_add_ui(*TEMP, *TEMP, 1);
PUSHs( x );
##############################################################################
# _dec() - modify x inline by doing x--
void
_dec(Class,x)
SV* x
PREINIT:
mpz_t* TEMP;
PPCODE:
GMP_GET_ARG_0; /* TEMP = mpz_t(x) */
mpz_sub_ui(*TEMP, *TEMP, 1);
PUSHs( x );
##############################################################################
# _sub() - $x - $y
# $x is always larger than $y! So overflow/underflow can not happen here.
# Formerly this code was:
# # if ($_[3])
# {
# $_[2] = Math::BigInt::GMP::sub_two($_[1],$_[2]); return $_[2];
# }
# Math::BigInt::GMP::_sub_in_place($_[1],$_[2]);
# }
void
_sub(Class,x,y, ...)
SV* x
SV* y
PREINIT:
mpz_t* TEMP;
mpz_t* TEMP_1;
PPCODE:
GMP_GET_ARGS_0_1; /* (TEMP, TEMP_1) = (x,y) */
if ( items == 4 && SvTRUE(ST(3)) )
{
/* y -= x */
mpz_sub(*TEMP_1, *TEMP, *TEMP_1);
PUSHs( y );
}
else
{
/* x -= y */
mpz_sub(*TEMP, *TEMP, *TEMP_1);
PUSHs( x );
}
##############################################################################
# _rsft()
void
_rsft(Class,x,y,base_sv)
SV* x
SV* y
SV* base_sv
PREINIT:
unsigned long y_ui;
mpz_t* TEMP;
mpz_t* TEMP_1;
mpz_t* BASE;
PPCODE:
GMP_GET_ARGS_0_1; /* (TEMP, TEMP_1) = (x,y) */
y_ui = mpz_get_ui(*TEMP_1);
BASE = malloc (sizeof(mpz_t));
mpz_init_set_ui(*BASE,SvUV(base_sv));
mpz_pow_ui(*BASE, *BASE, y_ui); /* ">> 3 in base 4" => "x / (4 ** 3)" */
mpz_div(*TEMP, *TEMP, *BASE);
mpz_clear(*BASE);
free(BASE);
PUSHs( x );
##############################################################################
# _lsft()
void
_lsft(Class,x,y,base_sv)
SV* x
SV* y
SV* base_sv
PREINIT:
unsigned long y_ui;
mpz_t* TEMP;
mpz_t* TEMP_1;
mpz_t* BASE;
PPCODE:
GMP_GET_ARGS_0_1; /* (TEMP, TEMP_1) = (x,y) */
y_ui = mpz_get_ui(*TEMP_1);
BASE = malloc (sizeof(mpz_t));
mpz_init_set_ui(*BASE,SvUV(base_sv));
mpz_pow_ui(*BASE, *BASE, y_ui); /* "<< 3 in base 4" => "x * (4 ** 3)" */
mpz_mul(*TEMP, *TEMP, *BASE);
mpz_clear(*BASE);
free(BASE);
PUSHs ( x );
##############################################################################
# _mul()
void
_mul(Class,x,y)
SV* x
SV* y
PREINIT:
mpz_t* TEMP;
mpz_t* TEMP_1;
PPCODE:
GMP_GET_ARGS_0_1; /* (TEMP, TEMP_1) = (x,y) */
mpz_mul(*TEMP, *TEMP, *TEMP_1);
PUSHs( x );
##############################################################################
# _div(): x /= y or (x,rem) = x / y
# was in perl:
#sub _div
# {
# i f (wantarray)
# {
# # return (a/b,a%b)
# my $r;
# ($_[1],$r) = Math::BigInt::GMP::bdiv_two($_[1],$_[2]);
# return ($_[1], $r);
# }
# # return a / b
# Math::BigInt::GMP::div_two($_[1],$_[2]);
# }
void
_div(Class,x,y)
SV* x
SV* y
PREINIT:
mpz_t* TEMP;
mpz_t* TEMP_1;
mpz_t * rem;
PPCODE:
GMP_GET_ARGS_0_1; /* (TEMP, TEMP_1) = (x,y) */
if (GIMME_V == G_ARRAY)
{
/* former bdiv_two() routine */
rem = malloc (sizeof(mpz_t));
mpz_init(*rem);
mpz_tdiv_qr(*TEMP, *rem, *TEMP, *TEMP_1);
EXTEND(SP, 2);
PUSHs( x );
PUSHs(sv_setref_pv(sv_newmortal(), "Math::BigInt::GMP", (void*)rem));
}
else
{
/* former div_two() routine */
mpz_div(*TEMP, *TEMP, *TEMP_1); /* x /= y */
PUSHs( x );
}
##############################################################################
# _mod() - x %= y
void
_mod(Class,x,y)
SV* x
SV* y
PREINIT:
mpz_t* TEMP;
mpz_t* TEMP_1;
PPCODE:
GMP_GET_ARGS_0_1; /* (TEMP, TEMP_1) = (x,y) */
mpz_mod(*TEMP, *TEMP, *TEMP_1);
PUSHs( x );
##############################################################################
# _acmp() - cmp two numbers
int
_acmp(Class,m,n)
mpz_t * m
mpz_t * n
CODE:
RETVAL = mpz_cmp(*m, *n);
if ( RETVAL < 0) { RETVAL = -1; }
if ( RETVAL > 0) { RETVAL = 1; }
OUTPUT:
RETVAL
##############################################################################
# _is_zero()
int
_is_zero(Class,x)
mpz_t * x
CODE:
RETVAL = mpz_cmp_ui(*x, 0);
if ( RETVAL != 0) { RETVAL = 0; } else { RETVAL = 1; }
OUTPUT:
RETVAL
##############################################################################
# _is_one()
int
_is_one(Class,x)
mpz_t * x
CODE:
RETVAL = mpz_cmp_ui(*x, 1);
if ( RETVAL != 0) { RETVAL = 0; } else { RETVAL = 1; }
OUTPUT:
RETVAL
##############################################################################
# _is_two()
int
_is_two(Class,x)
mpz_t * x
CODE:
RETVAL = mpz_cmp_ui(*x, 2);
if ( RETVAL != 0) { RETVAL = 0; } else { RETVAL = 1; }
OUTPUT:
RETVAL
##############################################################################
# _is_ten()
int
_is_ten(Class,x)
mpz_t * x
CODE:
RETVAL = mpz_cmp_ui(*x, 10);
if ( RETVAL != 0) { RETVAL = 0; } else { RETVAL = 1; }
OUTPUT:
RETVAL
##############################################################################
# _pow() - x **= y
void
_pow(Class,x,y)
SV* x
SV* y
PREINIT:
mpz_t* TEMP;
mpz_t* TEMP_1;
PPCODE:
GMP_GET_ARGS_0_1; /* (TEMP, TEMP_1) = (x,y) */
mpz_pow_ui(*TEMP, *TEMP, mpz_get_ui( *TEMP_1 ) );
PUSHs( x );
##############################################################################
# _gcd() - gcd(m,n)
mpz_t *
_gcd(Class,x,y)
mpz_t* x
mpz_t* y
CODE:
NEW_GMP_MPZ_T_INIT;
mpz_gcd(*RETVAL, *x, *y);
OUTPUT:
RETVAL
##############################################################################
# _and() - m &= n
void
_and(Class,x,y)
SV* x
SV* y
PREINIT:
mpz_t* TEMP;
mpz_t* TEMP_1;
PPCODE:
GMP_GET_ARGS_0_1; /* (TEMP, TEMP_1) = (x,y) */
mpz_and(*TEMP, *TEMP, *TEMP_1);
PUSHs( x );
##############################################################################
# _xor() - m =^ n
void
_xor(Class,x,y)
SV* x
SV* y
PREINIT:
mpz_t* TEMP;
mpz_t* TEMP_1;
PPCODE:
GMP_GET_ARGS_0_1; /* (TEMP, TEMP_1) = (x,y) */
mpz_xor(*TEMP, *TEMP, *TEMP_1);
PUSHs( x );
##############################################################################
# _or() - m =| n
void
_or(Class,x,y)
SV* x
SV* y
PREINIT:
mpz_t* TEMP;
mpz_t* TEMP_1;
PPCODE:
GMP_GET_ARGS_0_1; /* (TEMP, TEMP_1) = (x,y) */
mpz_ior(*TEMP, *TEMP, *TEMP_1);
PUSHs( x );
##############################################################################
# _fac() - n! (factorial)
void
_fac(Class,x)
SV* x
PREINIT:
mpz_t* TEMP;
PPCODE:
GMP_GET_ARG_0; /* TEMP = x */
mpz_fac_ui(*TEMP, mpz_get_ui(*TEMP));
PUSHs( x );
##############################################################################
# _copy()
mpz_t *
_copy(Class,m)
mpz_t* m
CODE:
NEW_GMP_MPZ_T;
mpz_init_set(*RETVAL, *m);
OUTPUT:
RETVAL
##############################################################################
# _is_odd() - test for number being odd
int
_is_odd(Class,n)
mpz_t* n
CODE:
RETVAL = mpz_tstbit(*n,0);
OUTPUT:
RETVAL
##############################################################################
# _is_even() - test for number being even
int
_is_even(Class,n)
mpz_t* n
CODE:
RETVAL = ! mpz_tstbit(*n,0);
OUTPUT:
RETVAL
##############################################################################
# _sqrt() - square root
void
_sqrt(Class,x)
SV* x
PREINIT:
mpz_t* TEMP;
PPCODE:
GMP_GET_ARG_0; /* TEMP = x */
mpz_sqrt(*TEMP, *TEMP);
PUSHs( x );
##############################################################################
# _root() - integer roots
void
_root(Class,x,y)
SV* x
SV* y
PREINIT:
mpz_t* TEMP;
mpz_t* TEMP_1;
PPCODE:
GMP_GET_ARGS_0_1; /* (TEMP, TEMP_1) = (x,y) */
mpz_root(*TEMP, *TEMP, mpz_get_ui(*TEMP_1));
PUSHs( x );
|