[BACK]Return to poly.c CVS log [TXT][DIR] Up to [local] / OpenXM_contrib2 / asir2000 / builtin

Diff for /OpenXM_contrib2/asir2000/builtin/poly.c between version 1.1.1.1 and 1.4

version 1.1.1.1, 1999/12/03 07:39:07 version 1.4, 2000/08/21 08:31:21
Line 1 
Line 1 
 /* $OpenXM: OpenXM/src/asir99/builtin/poly.c,v 1.1.1.1 1999/11/10 08:12:26 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@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/poly.c,v 1.3 2000/01/11 06:43:35 noro Exp $
   */
 #include "ca.h"  #include "ca.h"
 #include "parse.h"  #include "parse.h"
 #include "base.h"  #include "base.h"
Line 11  void Pord(), Pcoef0(), Pcoef(), Pdeg(), Pmindeg(), Pse
Line 59  void Pord(), Pcoef0(), Pcoef(), Pdeg(), Pmindeg(), Pse
 void Pcoef_gf2n();  void Pcoef_gf2n();
 void getcoef(), getdeglist(), mergedeglist(), change_mvar(), restore_mvar();  void getcoef(), getdeglist(), mergedeglist(), change_mvar(), restore_mvar();
   
 void Pp_mag();  void Pp_mag(),Pmaxblen();
 void Pmergelist(), Pch_mv(), Pre_mv(), Pdeglist();  void Pmergelist(), Pch_mv(), Pre_mv(), Pdeglist();
 void Pptomp(),Pmptop();  void Pptomp(),Pmptop();
 void Pptolmp(),Plmptop();  void Pptolmp(),Plmptop();
 void Pptogf2n(),Pgf2ntop(),Pgf2ntovect();  void Pptogf2n(),Pgf2ntop(),Pgf2ntovect();
 void Pptogfpn(),Pgfpntop();  void Pptogfpn(),Pgfpntop();
 void Pfind_root_gf2n();  void Pfind_root_gf2n();
   void Pumul_specialmod(),Pusquare_specialmod(),Putmul_specialmod();
   
 void Pureverse(),Putrunc(),Pudecomp(),Purembymul(),Purembymul_precomp();  void Pureverse(),Putrunc(),Pudecomp(),Purembymul(),Purembymul_precomp();
 void Puinvmod(),Purevinvmod();  void Puinvmod(),Purevinvmod();
Line 48  void Pbininv_gf2n();
Line 97  void Pbininv_gf2n();
 void Prinvtest_gf2n();  void Prinvtest_gf2n();
 void Pis_irred_gf2();  void Pis_irred_gf2();
 void Pis_irred_ddd_gf2();  void Pis_irred_ddd_gf2();
   void Pget_next_fft_prime();
   void Puadj_coef();
 void simp_ff(Obj,Obj *);  void simp_ff(Obj,Obj *);
 void ranp(int,UP *);  void ranp(int,UP *);
 void field_order_ff(N *);  void field_order_ff(N *);
Line 60  extern int lm_lazy;
Line 110  extern int lm_lazy;
 int current_ff;  int current_ff;
   
 struct ftab poly_tab[] = {  struct ftab poly_tab[] = {
           {"uadj_coef",Puadj_coef,3},
         {"ranp",Pranp,2},          {"ranp",Pranp,2},
         {"p_mag",Pp_mag,1},          {"p_mag",Pp_mag,1},
           {"maxblen",Pmaxblen,1},
         {"ord",Pord,-1},          {"ord",Pord,-1},
         {"coef0",Pcoef0,-3},          {"coef0",Pcoef0,-3},
         {"coef",Pcoef,-3},          {"coef",Pcoef,-3},
Line 107  struct ftab poly_tab[] = {
Line 159  struct ftab poly_tab[] = {
         {"ureverse_inv_as_power_series",Purevinvmod,2},          {"ureverse_inv_as_power_series",Purevinvmod,2},
         {"uinv_as_power_series",Puinvmod,2},          {"uinv_as_power_series",Puinvmod,2},
   
           {"umul_specialmod",Pumul_specialmod,3},
           {"usquare_specialmod",Pusquare_specialmod,2},
           {"utmul_specialmod",Putmul_specialmod,4},
   
         {"utmul",Putmul,3},          {"utmul",Putmul,3},
         {"umul_ff",Pumul_ff,2},          {"umul_ff",Pumul_ff,2},
         {"usquare_ff",Pusquare_ff,1},          {"usquare_ff",Pusquare_ff,1},
Line 118  struct ftab poly_tab[] = {
Line 174  struct ftab poly_tab[] = {
   
         {"utrunc",Putrunc,2},          {"utrunc",Putrunc,2},
         {"udecomp",Pudecomp,2},          {"udecomp",Pudecomp,2},
         {"ureverse",Pureverse,1},          {"ureverse",Pureverse,-2},
         {"urembymul",Purembymul,2},          {"urembymul",Purembymul,2},
         {"urembymul_precomp",Purembymul_precomp,3},          {"urembymul_precomp",Purembymul_precomp,3},
   
Line 150  struct ftab poly_tab[] = {
Line 206  struct ftab poly_tab[] = {
         {"bininv_gf2n",Pbininv_gf2n,2},          {"bininv_gf2n",Pbininv_gf2n,2},
         {"invtest_gf2n",Pinvtest_gf2n,1},          {"invtest_gf2n",Pinvtest_gf2n,1},
         {"rinvtest_gf2n",Prinvtest_gf2n,0},          {"rinvtest_gf2n",Prinvtest_gf2n,0},
           {"get_next_fft_prime",Pget_next_fft_prime,2},
         {0,0,0},          {0,0,0},
 };  };
   
 extern V up_var;  extern V up_var;
   
   /*
           uadj_coef(F,M,M2)
           if ( F is a non-negative integer )
                   return F > M2 ? F-M : M2;
           else
                   F = CN*V^N+...+C0
                   return uadj_coef(CN,M,M2)*V^N+...+uadj_coef(C0,M,M2);
   */
   
   void Puadj_coef(arg,rp)
   NODE arg;
   P *rp;
   {
           UP f,r;
           N m,m2;
   
           ptoup((P)ARG0(arg),&f);
           m = NM((Q)ARG1(arg));
           m2 = NM((Q)ARG2(arg));
           adj_coefup(f,m,m2,&r);
           uptop(r,rp);
   }
   
   /*
           get_next_fft_prime(StartIndex,Bits)
           tries to find smallest Index >= StartIndex s.t.
                   2^(Bits-1)|FFTprime[Index]-1
           return [Index,Mod] or 0 (not exist)
   */
   
   void Pget_next_fft_prime(arg,rp)
   NODE arg;
   LIST *rp;
   {
           unsigned int mod,d;
           int start,bits,i;
           NODE n;
           Q q,ind;
   
           start = QTOS((Q)ARG0(arg));
           bits = QTOS((Q)ARG1(arg));
           for ( i = start; ; i++ ) {
                   get_fft_prime(i,&mod,&d);
                   if ( !mod ) {
                           *rp = 0; return;
                   }
                   if ( bits <= d ) {
                           UTOQ(mod,q);
                           UTOQ(i,ind);
                           n = mknode(2,ind,q);
                           MKLIST(*rp,n);
                           return;
                   }
           }
   }
   
 void Pranp(arg,rp)  void Pranp(arg,rp)
 NODE arg;  NODE arg;
 P *rp;  P *rp;
Line 193  UP *nr;
Line 306  UP *nr;
                 *nr = 0;                  *nr = 0;
 }  }
   
   void Pmaxblen(arg,rp)
   NODE arg;
   Q *rp;
   {
           int l;
           l = maxblenp(ARG0(arg));
           STOQ(l,*rp);
   }
   
 void Pp_mag(arg,rp)  void Pp_mag(arg,rp)
 NODE arg;  NODE arg;
 Q *rp;  Q *rp;
Line 991  P *rp;
Line 1113  P *rp;
         UP p,r;          UP p,r;
   
         ptoup((P)ARG0(arg),&p);          ptoup((P)ARG0(arg),&p);
         reverseup(p,p->d,&r);          if ( argc(arg) == 1 )
                   reverseup(p,p->d,&r);
           else
                   reverseup(p,QTOS((Q)ARG1(arg)),&r);
         uptop(r,rp);          uptop(r,rp);
 }  }
   
Line 1465  P *rp;
Line 1590  P *rp;
         ptoup((P)ARG1(arg),&f);          ptoup((P)ARG1(arg),&f);
         tracemodup_gf2n(g,f,(Q)ARG2(arg),&r);          tracemodup_gf2n(g,f,(Q)ARG2(arg),&r);
         uptop(r,rp);          uptop(r,rp);
   }
   
   void Pumul_specialmod(arg,rp)
   NODE arg;
   P *rp;
   {
           P a1,a2;
           UP p1,p2,r;
           int i,nmod;
           int *modind;
           NODE t,n;
   
           a1 = (P)ARG0(arg); a2 = (P)ARG1(arg);
           if ( !a1 || !a2 || NUM(a1) || NUM(a2) )
                   mulp(CO,a1,a2,rp);
           else {
                   if ( !uzpcheck(a1) || !uzpcheck(a2) || VR(a1) != VR(a2) )
                           error("umul_specialmod : invalid argument");
                   ptoup(a1,&p1);
                   ptoup(a2,&p2);
                   n = BDY((LIST)ARG2(arg));
                   nmod = length(n);
                   modind = (int *)MALLOC_ATOMIC(nmod*sizeof(int));
                   for ( i = 0, t = n; i < nmod; i++, t = NEXT(t) )
                           modind[i] = QTOS((Q)BDY(t));
                   fft_mulup_specialmod_main(p1,p2,0,modind,nmod,&r);
                   uptop(r,rp);
           }
   }
   
   void Pusquare_specialmod(arg,rp)
   NODE arg;
   P *rp;
   {
           P a1;
           UP p1,r;
           int i,nmod;
           int *modind;
           NODE t,n;
   
           a1 = (P)ARG0(arg);
           if ( !a1 || NUM(a1) )
                   mulp(CO,a1,a1,rp);
           else {
                   if ( !uzpcheck(a1) )
                           error("usquare_specialmod : invalid argument");
                   ptoup(a1,&p1);
                   n = BDY((LIST)ARG1(arg));
                   nmod = length(n);
                   modind = (int *)MALLOC_ATOMIC(nmod*sizeof(int));
                   for ( i = 0, t = n; i < nmod; i++, t = NEXT(t) )
                           modind[i] = QTOS((Q)BDY(t));
                   fft_mulup_specialmod_main(p1,p1,0,modind,nmod,&r);
                   uptop(r,rp);
           }
   }
   
   void Putmul_specialmod(arg,rp)
   NODE arg;
   P *rp;
   {
           P a1,a2;
           UP p1,p2,r;
           int i,nmod;
           int *modind;
           NODE t,n;
   
           a1 = (P)ARG0(arg); a2 = (P)ARG1(arg);
           if ( !a1 || !a2 || NUM(a1) || NUM(a2) )
                   mulp(CO,a1,a2,rp);
           else {
                   if ( !uzpcheck(a1) || !uzpcheck(a2) || VR(a1) != VR(a2) )
                           error("utmul_specialmod : invalid argument");
                   ptoup(a1,&p1);
                   ptoup(a2,&p2);
                   n = BDY((LIST)ARG3(arg));
                   nmod = length(n);
                   modind = (int *)MALLOC_ATOMIC(nmod*sizeof(int));
                   for ( i = 0, t = n; i < nmod; i++, t = NEXT(t) )
                           modind[i] = QTOS((Q)BDY(t));
                   fft_mulup_specialmod_main(p1,p2,QTOS((Q)ARG2(arg))+1,modind,nmod,&r);
                   uptop(r,rp);
           }
 }  }
Legend:
Removed from v.1.1.1.1  
changed lines
  Added in v.1.4
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>