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

Diff for /OpenXM_contrib2/asir2000/engine/A.c between version 1.1.1.1 and 1.7

version 1.1.1.1, 1999/12/03 07:39:07 version 1.7, 2013/06/13 18:40:31
Line 1 
Line 1 
 /* $OpenXM: OpenXM/src/asir99/engine/A.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@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/engine/A.c,v 1.6 2005/07/11 00:24:02 noro Exp $
   */
 #include "ca.h"  #include "ca.h"
   #include "parse.h"
   
   int get_lprime();
   
 void pdiva(vl,p0,p1,p2,pr)  void pdiva(vl,p0,p1,p2,pr)
 VL vl;  VL vl;
 P p1,p2,p0;  P p1,p2,p0;
Line 221  P p,p0,*pr;
Line 272  P p,p0,*pr;
         wt = W_UMALLOC(m+n); ws = W_UMALLOC(m+n);          wt = W_UMALLOC(m+n); ws = W_UMALLOC(m+n);
         wm = W_UMALLOC(m+n);          wm = W_UMALLOC(m+n);
         for ( q = ONE, t = 0, c = 0, index = 0; ; ) {          for ( q = ONE, t = 0, c = 0, index = 0; ; ) {
                 mod = lprime[index++];                  mod = get_lprime(index++);
                 if ( !mod )  
                         error("pinva : lprime[] exhausted.");  
                 if ( !rem(NM((Q)LC(p)),mod) || !rem(NM((Q)LC(p0)),mod) )                  if ( !rem(NM((Q)LC(p)),mod) || !rem(NM((Q)LC(p0)),mod) )
                         continue;                          continue;
                 ptomp(mod,p,&tg); ptomp(mod,p0,&th); srchump(mod,tg,th,&tr);                  ptomp(mod,p,&tg); ptomp(mod,p0,&th); srchump(mod,tg,th,&tr);
Line 250  P p,p0,*pr;
Line 299  P p,p0,*pr;
                         break;                          break;
         }          }
         ptozp(c,1,&s,pr);          ptozp(c,1,&s,pr);
   }
   
   /*
    * compute g s.t. h*p0+g*p = res(v,p0,p)
    */
   
   void inva_chrem(P p0, P p, NODE *pr)
   {
           V v;
           Q f,q,q1;
           Q u,t,a,b,s,dn;
           P c,c0,c1;
           P tg,th,tr;
           P z,zz,zzz;
           UM wg,wh,ws,wt,wm;
           int n,m,modres,mod,index,i;
   
           v = VR(p); n=deg(v,p); m=deg(v,p0);
           norm(p,&a); norm(p0,&b);
           STOQ(m,u); pwrq(a,u,&t); STOQ(n,u); pwrq(b,u,&s);
           mulq(t,s,&u);
           factorial(n+m,&t); mulq(u,t,&s); addq(s,s,&f);
           wg = W_UMALLOC(m+n); wh = W_UMALLOC(m+n);
           wt = W_UMALLOC(m+n); ws = W_UMALLOC(m+n);
           wm = W_UMALLOC(m+n);
           for ( q = ONE, t = 0, c = 0, index = 0; ; ) {
                   mod = get_lprime(index++);
                   if ( !rem(NM((Q)LC(p)),mod) || !rem(NM((Q)LC(p0)),mod) )
                           continue;
                   ptomp(mod,p,&tg); ptomp(mod,p0,&th); srchump(mod,tg,th,&tr);
                   if ( !tr )
                           continue;
                   else
                           modres = CONT((MQ)tr);
                   mptoum(tg,wg); mptoum(th,wh);
                   eucum(mod,wg,wh,ws,wt); /* wg * ws + wh * wt = 1 */
                   DEG(wm) = 0; COEF(wm)[0] = modres;
                   mulum(mod,ws,wm,wt);
                   for ( i = DEG(wt); i >= 0; i-- )
                           if ( ( COEF(wt)[i] * 2 ) > mod )
                                   COEF(wt)[i] -= mod;
                   chnrem(mod,v,c,q,wt,&c1,&q1);
                   if ( !ucmpp(c,c1) ) {
                           mulp(CO,c,p,&z); divsrp(CO,z,p0,&zz,&zzz);
                           if ( NUM(zzz) ) {
                                   q = (Q)zzz; break;
                           }
                   }
                   q = q1; c = c1;
                   if ( cmpq(f,q) < 0 ) {
                           mulp(CO,c,p,&z); divsrp(CO,z,p0,&zz,&zzz);
                           q = (Q)zzz;
                           break;
                   }
           }
           /* c*p = q mod p0 */
           /* c = s*c0 */
           ptozp(c,1,&s,&c0);
           /* c/q = c0/(q/s) */
           divq(q,s,&dn);
           *pr = (NODE)mknode(2,c0,dn);
 }  }
Legend:
Removed from v.1.1.1.1  
changed lines
  Added in v.1.7
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>