===================================================================
RCS file: /home/cvs/OpenXM_contrib2/asir2000/engine/M.c,v
retrieving revision 1.1
retrieving revision 1.7
diff -u -p -r1.1 -r1.7
--- OpenXM_contrib2/asir2000/engine/M.c	1999/12/03 07:39:08	1.1
+++ OpenXM_contrib2/asir2000/engine/M.c	2001/06/25 04:11:42	1.7
@@ -1,4 +1,52 @@
-/* $OpenXM: OpenXM/src/asir99/engine/M.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/M.c,v 1.6 2001/06/25 01:35:21 noro Exp $ 
+*/
 #include "ca.h"
 #include "base.h"
 
@@ -176,9 +224,7 @@ ML *pl;
 	mgcd = W_UMALLOC(n);
 
 	for ( j = 0, d = n; j < count && d; ) {
-		m = lprime[index++];
-		if ( !m )
-			error("sqfrum : lprime[] exhausted.");
+		m = get_lprime(index++);
 		if ( rem(NM((Q)COEF(DC(f))),m) == 0 ) continue;
 
 		ptoum(m,f,wf);
@@ -303,6 +349,14 @@ UM p1,p2;
 		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)
 UM f;
 int n;
@@ -346,6 +400,25 @@ int n,bound;
 	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)
 int mod,n;
 LUM f1,f2,fr;
@@ -388,6 +461,31 @@ LUM p,r;
 			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)
 int mod,bound,n;
 LUM p,r;
@@ -498,7 +596,7 @@ register int **c;
 	return (-1);
 }
 
-#if defined(__GNUC__) || defined(THINK_C)
+#if defined(__GNUC__)
 const
 #endif
 int sprime[] = {
@@ -653,5 +751,3 @@ int sprime[] = {
 	16273,16301,16319,16333,16339,16349,16361,16363,16369,16381,
 	0
 };
-
-#include "prime.h"