version 1.3, 2000/02/07 05:21:32 |
version 1.8, 2000/12/21 02:45:16 |
|
|
/* $OpenXM: OpenXM_contrib2/asir2000/builtin/int.c,v 1.2 2000/01/11 06:43:35 noro Exp $ */ |
/* |
|
* Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED |
|
* All rights reserved. |
|
* |
|
* FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited, |
|
* non-exclusive and royalty-free license to use, copy, modify and |
|
* redistribute, solely for non-commercial and non-profit purposes, the |
|
* computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and |
|
* conditions of this Agreement. For the avoidance of doubt, you acquire |
|
* only a limited right to use the SOFTWARE hereunder, and FLL or any |
|
* third party developer retains all rights, including but not limited to |
|
* copyrights, in and to the SOFTWARE. |
|
* |
|
* (1) FLL does not grant you a license in any way for commercial |
|
* purposes. You may use the SOFTWARE only for non-commercial and |
|
* non-profit purposes only, such as academic, research and internal |
|
* business use. |
|
* (2) The SOFTWARE is protected by the Copyright Law of Japan and |
|
* international copyright treaties. If you make copies of the SOFTWARE, |
|
* with or without modification, as permitted hereunder, you shall affix |
|
* to all such copies of the SOFTWARE the above copyright notice. |
|
* (3) An explicit reference to this SOFTWARE and its copyright owner |
|
* shall be made on your publication or presentation in any form of the |
|
* results obtained by use of the SOFTWARE. |
|
* (4) In the event that you modify the SOFTWARE, you shall notify FLL by |
|
* e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification |
|
* for such modification or the source code of the modified part of the |
|
* SOFTWARE. |
|
* |
|
* THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL |
|
* MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND |
|
* EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS |
|
* FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES' |
|
* RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY |
|
* MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY. |
|
* UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT, |
|
* OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY |
|
* DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL |
|
* DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES |
|
* ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES |
|
* FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY |
|
* DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF |
|
* SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART |
|
* OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY |
|
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
|
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
|
* |
|
* $OpenXM: OpenXM_contrib2/asir2000/builtin/int.c,v 1.7 2000/12/08 02:39:05 noro Exp $ |
|
*/ |
#include "ca.h" |
#include "ca.h" |
#include "parse.h" |
#include "parse.h" |
#include "base.h" |
#include "base.h" |
Line 18 void Psmall_jacobi(); |
|
Line 66 void Psmall_jacobi(); |
|
void Pdp_set_mpi(); |
void Pdp_set_mpi(); |
void Pntoint32(),Pint32ton(); |
void Pntoint32(),Pint32ton(); |
|
|
#ifdef HMEXT |
|
void Pigcdbin(), Pigcdbmod(), PigcdEuc(), Pigcdacc(), Pigcdcntl(); |
void Pigcdbin(), Pigcdbmod(), PigcdEuc(), Pigcdacc(), Pigcdcntl(); |
|
|
void Pihex(); |
void Pihex(); |
void Pimaxrsh(), Pilen(); |
void Pimaxrsh(), Pilen(); |
void Ptype_t_NB(); |
void Ptype_t_NB(); |
|
|
#endif /* HMEXT */ |
|
|
|
struct ftab int_tab[] = { |
struct ftab int_tab[] = { |
{"dp_set_mpi",Pdp_set_mpi,-1}, |
{"dp_set_mpi",Pdp_set_mpi,-1}, |
{"isqrt",Pisqrt,1}, |
{"isqrt",Pisqrt,1}, |
Line 57 struct ftab int_tab[] = { |
|
Line 102 struct ftab int_tab[] = { |
|
{"ixor",Pixor,2}, |
{"ixor",Pixor,2}, |
{"ishift",Pishift,2}, |
{"ishift",Pishift,2}, |
{"small_jacobi",Psmall_jacobi,2}, |
{"small_jacobi",Psmall_jacobi,2}, |
#ifdef HMEXT |
|
{"igcdbin",Pigcdbin,2}, /* HM@CCUT extension */ |
{"igcdbin",Pigcdbin,2}, /* HM@CCUT extension */ |
{"igcdbmod",Pigcdbmod,2}, /* HM@CCUT extension */ |
{"igcdbmod",Pigcdbmod,2}, /* HM@CCUT extension */ |
{"igcdeuc",PigcdEuc,2}, /* HM@CCUT extension */ |
{"igcdeuc",PigcdEuc,2}, /* HM@CCUT extension */ |
{"igcdacc",Pigcdacc,2}, /* HM@CCUT extension */ |
{"igcdacc",Pigcdacc,2}, /* HM@CCUT extension */ |
{"igcdcntl",Pigcdcntl,-1}, /* HM@CCUT extension */ |
{"igcdcntl",Pigcdcntl,-1}, /* HM@CCUT extension */ |
{"ihex",Pihex,1}, /* HM@CCUT extension */ |
|
{"imaxrsh",Pimaxrsh,1}, /* HM@CCUT extension */ |
|
{"ilen",Pilen,1}, /* HM@CCUT extension */ |
|
#endif /* HMEXT */ |
|
{"mt_save",Pmt_save,1}, |
{"mt_save",Pmt_save,1}, |
{"mt_load",Pmt_load,1}, |
{"mt_load",Pmt_load,1}, |
{"ntoint32",Pntoint32,1}, |
{"ntoint32",Pntoint32,1}, |
|
|
MKNODE(n1,r,0); MKNODE(n0,q,n1); MKLIST(*rp,n0); |
MKNODE(n1,r,0); MKNODE(n0,q,n1); MKLIST(*rp,n0); |
} |
} |
|
|
|
/* |
|
* gcd = GCD(a,b), ca = a/g, cb = b/g |
|
*/ |
|
|
|
void igcd_cofactor(a,b,gcd,ca,cb) |
|
Q a,b; |
|
Q *gcd,*ca,*cb; |
|
{ |
|
N gn,tn; |
|
|
|
if ( !a ) { |
|
if ( !b ) |
|
error("igcd_cofactor : invalid input"); |
|
else { |
|
*ca = 0; |
|
*cb = ONE; |
|
*gcd = b; |
|
} |
|
} else if ( !b ) { |
|
*ca = ONE; |
|
*cb = 0; |
|
*gcd = a; |
|
} else { |
|
gcdn(NM(a),NM(b),&gn); NTOQ(gn,1,*gcd); |
|
divsn(NM(a),gn,&tn); NTOQ(tn,SGN(a),*ca); |
|
divsn(NM(b),gn,&tn); NTOQ(tn,SGN(b),*cb); |
|
} |
|
} |
|
|
void igcdv(a,rp) |
void igcdv(a,rp) |
VECT a; |
VECT a; |
Q *rp; |
Q *rp; |
|
|
UTOQ(r,*rp); |
UTOQ(r,*rp); |
} |
} |
|
|
#if defined(VISUAL) || defined(THINK_C) |
#if defined(VISUAL) |
void srandom(unsigned int); |
void srandom(unsigned int); |
|
|
static unsigned int R_Next; |
static unsigned int R_Next; |
|
|
STOQ(up2_kara_mag,*rp); |
STOQ(up2_kara_mag,*rp); |
} |
} |
|
|
#ifdef HMEXT |
|
void Pigcdbin(arg,rp) |
void Pigcdbin(arg,rp) |
NODE arg; |
NODE arg; |
Obj *rp; |
Obj *rp; |
|
|
*rp = (Obj)a; |
*rp = (Obj)a; |
return; |
return; |
} |
} |
|
|
|
|
void Pimaxrsh(arg,rp) |
|
NODE arg; |
|
LIST *rp; |
|
{ |
|
N n1, n2; |
|
Q q; |
|
NODE node1, node2; |
|
int bits; |
|
N maxrshn(); |
|
|
|
q = (Q)ARG0(arg); |
|
asir_assert(q,O_N,"imaxrsh"); |
|
if ( !q ) n1 = n2 = 0; |
|
else { |
|
n1 = maxrshn( NM(q), &bits ); |
|
STON( bits, n2 ); |
|
} |
|
NTOQ( n2, 1, q ); |
|
MKNODE( node2, q, 0 ); |
|
NTOQ( n1, 1, q ); |
|
MKNODE( node1, q, node2 ); |
|
MKLIST( *rp, node1 ); |
|
} |
|
void Pilen(arg,rp) |
|
NODE arg; |
|
Obj *rp; |
|
{ |
|
Q q; |
|
int l; |
|
|
|
q = (Q)ARG0(arg); |
|
asir_assert(q,O_N,"ilenh"); |
|
if ( !q ) l = 0; |
|
else l = PL(NM(q)); |
|
STOQ(l,q); |
|
*rp = (Obj)q; |
|
} |
|
|
|
void Pihex(arg,rp) |
|
NODE arg; |
|
Obj *rp; |
|
{ |
|
Q n1; |
|
|
|
n1 = (Q)ARG0(arg); |
|
asir_assert(n1,O_N,"ihex"); |
|
if ( n1 ) { |
|
int i, l = PL(NM(n1)), *p = BD(NM(n1)); |
|
|
|
for ( i = 0; i < l; i++ ) printf( " 0x%08x", p[i] ); |
|
printf( "\n" ); |
|
} else printf( " 0x%08x\n", 0 ); |
|
*rp = (Obj)n1; |
|
} |
|
#endif /* HMEXT */ |
|