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

Diff for /OpenXM_contrib2/asir2000/engine/M.c between version 1.2 and 1.7

version 1.2, 2000/08/21 08:31:25 version 1.7, 2001/06/25 04:11:42
Line 23 
Line 23 
  * shall be made on your publication or presentation in any form of the   * shall be made on your publication or presentation in any form of the
  * results obtained by use of the SOFTWARE.   * results obtained by use of the SOFTWARE.
  * (4) In the event that you modify the SOFTWARE, you shall notify FLL by   * (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   * 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   * for such modification or the source code of the modified part of the
  * SOFTWARE.   * SOFTWARE.
  *   *
Line 45 
Line 45 
  * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,   * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
  * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.   * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
  *   *
  * $OpenXM: OpenXM_contrib2/asir2000/engine/M.c,v 1.1.1.1 1999/12/03 07:39:08 noro Exp $   * $OpenXM: OpenXM_contrib2/asir2000/engine/M.c,v 1.6 2001/06/25 01:35:21 noro Exp $
 */  */
 #include "ca.h"  #include "ca.h"
 #include "base.h"  #include "base.h"
Line 224  ML *pl;
Line 224  ML *pl;
         mgcd = W_UMALLOC(n);          mgcd = W_UMALLOC(n);
   
         for ( j = 0, d = n; j < count && d; ) {          for ( j = 0, d = n; j < count && d; ) {
                 m = lprime[index++];                  m = get_lprime(index++);
                 if ( !m )  
                         error("sqfrum : lprime[] exhausted.");  
                 if ( rem(NM((Q)COEF(DC(f))),m) == 0 ) continue;                  if ( rem(NM((Q)COEF(DC(f))),m) == 0 ) continue;
   
                 ptoum(m,f,wf);                  ptoum(m,f,wf);
Line 351  UM p1,p2;
Line 349  UM p1,p2;
                 c2[i] = c1[i];                  c2[i] = c1[i];
 }  }
   
   void clearum(p,n)
   UM p;
   int n;
   {
           DEG(p) = -1;
           bzero(COEF(p),(n+1)*sizeof(int));
   }
   
 void degum(f,n)  void degum(f,n)
 UM f;  UM f;
 int n;  int n;
Line 394  int n,bound;
Line 400  int n,bound;
         return p;          return p;
 }  }
   
   /* n = deg in x, bound = deg in y, c[i] <-> the coef of y^i (poly in x) */
   
   BM BMALLOC(n,bound)
   int n,bound;
   {
           BM p;
           UM *c;
           int i;
   
           p = (BM)MALLOC(TRUESIZE(oBM,bound,UM));
           DEG(p) = bound;
           for ( i = 0, c = (UM *)COEF(p); i < bound; i++ ) {
                   c[i] = UMALLOC(n);
                   DEG(c[i]) = -1;
                   bzero((char *)COEF(c[i]),(n+1)*sizeof(int));
           }
           return p;
   }
   
 void mullum(mod,n,f1,f2,fr)  void mullum(mod,n,f1,f2,fr)
 int mod,n;  int mod,n;
 LUM f1,f2,fr;  LUM f1,f2,fr;
Line 436  LUM p,r;
Line 461  LUM p,r;
                         ppr[i][j] = pp[i][j];                          ppr[i][j] = pp[i][j];
 }  }
   
   int isequalum(f1,f2)
   UM f1,f2;
   {
           int i;
   
           if ( DEG(f1) < 0 )
                   if ( DEG(f2) < 0 )
                           return 1;
                   else
                           return 0;
           else if ( DEG(f2) < 0 )
                   return 0;
           else {
                   if ( DEG(f1) != DEG(f2) )
                           return 0;
                   for ( i = 0; i <= DEG(f1); i++ )
                           if ( COEF(f1)[i] != COEF(f2)[i] )
                                   break;
                   if ( i < DEG(f1) )
                           return 0;
                   else
                           return 1;
           }
   }
   
 void pwrlum(mod,bound,p,n,r)  void pwrlum(mod,bound,p,n,r)
 int mod,bound,n;  int mod,bound,n;
 LUM p,r;  LUM p,r;
Line 546  register int **c;
Line 596  register int **c;
         return (-1);          return (-1);
 }  }
   
 #if defined(__GNUC__) || defined(THINK_C)  #if defined(__GNUC__)
 const  const
 #endif  #endif
 int sprime[] = {  int sprime[] = {
Line 701  int sprime[] = {
Line 751  int sprime[] = {
         16273,16301,16319,16333,16339,16349,16361,16363,16369,16381,          16273,16301,16319,16333,16339,16349,16361,16363,16369,16381,
         0          0
 };  };
   
 #include "prime.h"  
Legend:
Removed from v.1.2  
changed lines
  Added in v.1.7
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>