[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.2 and 1.5

version 1.2, 1999/12/27 04:16:30 version 1.5, 2000/08/22 05:03:59
Line 1 
Line 1 
 /* $OpenXM: OpenXM_contrib2/asir2000/builtin/poly.c,v 1.1.1.1 1999/12/03 07:39:07 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/poly.c,v 1.4 2000/08/21 08:31:21 noro Exp $
   */
 #include "ca.h"  #include "ca.h"
 #include "parse.h"  #include "parse.h"
 #include "base.h"  #include "base.h"
Line 50  void Prinvtest_gf2n();
Line 98  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 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 62  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},          {"maxblen",Pmaxblen,1},
Line 125  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 162  struct ftab poly_tab[] = {
Line 211  struct ftab poly_tab[] = {
 };  };
   
 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)          get_next_fft_prime(StartIndex,Bits)
         tries to find smallest Index >= StartIndex s.t.          tries to find smallest Index >= StartIndex s.t.
                 2^(Bits-1)|FFTprime[Index]-1                  2^(Bits-1)|FFTprime[Index]-1
Line 1040  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);
 }  }
   
Legend:
Removed from v.1.2  
changed lines
  Added in v.1.5
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>