Changeset 05bcd5 in git

Timestamp:

Jun 14, 1999, 6:35:34 PM (25 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

3c8e50bcc6eb720109f4b83d71567c36d48d8ae1

Parents:

07f20e1f2be7d445106e822d1dd8fdc8cac35e88

Message:

*hannes: avoid deep stack in large expr-lists


git-svn-id: file:///usr/local/Singular/svn/trunk@3129 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• Singular/iparith.cc (modified) (5 diffs)

Singular/iparith.cc

@@ -2 +2 @@
 *  Computer Algebra System SINGULAR     *
 ****************************************/
-/* $Id: iparith.cc,v 1.150 1999-06-07 15:46:05 obachman Exp $ */
+/* $Id: iparith.cc,v 1.151 1999-06-14 16:35:34 Singular Exp $ */
 
 /*
@@ -618 +618 @@
     if (iiOp=='-')                  /* u==NULL, v<>NULL, iiOp=='-'*/
     {
-      if (res->next==NULL)
-        res->next = (leftv)Alloc(sizeof(sleftv));
-      return iiExprArith1(res->next,v,'-');
+      do
+      {
+        if (res->next==NULL)
+          res->next = (leftv)Alloc0(sizeof(sleftv));
+        leftv tmp_v=v->next;
+        v->next=NULL;
+        BOOLEAN b=iiExprArith1(res->next,v,'-');
+        v->next=tmp_v;
+        if (b)
+          return TRUE;
+        v=tmp_v;
+        res=res->next;
+      } while (v!=NULL);
+      return FALSE;
     }
     loop                            /* u==NULL, v<>NULL, iiOp=='+' */
@@ -634 +645 @@
   if (v!=NULL)                     /* u<>NULL, v<>NULL */
   {
-    res->next = (leftv)Alloc(sizeof(sleftv));
-    return iiExprArith2(res->next,u,iiOp,v);
+    do
+    {
+      res->next = (leftv)Alloc0(sizeof(sleftv));
+      leftv tmp_u=u->next; u->next=NULL;
+      leftv tmp_v=v->next; v->next=NULL;
+      BOOLEAN b=iiExprArith2(res->next,u,iiOp,v);
+      u->next=tmp_u;
+      v->next=tmp_v;
+      if (b)
+        return TRUE;
+      u=tmp_u;
+      v=tmp_v;
+      res=res->next;
+    } while ((u!=NULL) && (v!=NULL));
+    return FALSE;
   }
   loop                             /* u<>NULL, v==NULL */
@@ -3897 +3921 @@
   intvec* arg = (intvec*) u->Data();
   int i, n = min(im->cols()*im->rows(), arg->cols()*arg->rows());
-  
+
   for (i=0; i<n; i++)
   {
     (*im)[i] = (*arg)[i];
   }
-  
+
   res->data = (char *)im;
   return FALSE;
@@ -4579 +4603 @@
     return FALSE;
   }
-  
+
   char** slist = (char**) Alloc(n*sizeof(char*));
   int i, j;
-  
+
   for (i=0, j=0; i<n; i++, v = v ->next)
   {