Changeset 70d976 in git

Timestamp:

Mar 10, 2014, 2:15:11 PM (10 years ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'spielwiese', '8e0ad00ce244dfd0756200662572aef8402f13d5')

Children:

daa13f7cda0d499a1e8ef40d88b9b73bf2494fc2

Parents:

283b70e49eea4578aec6c525038a9ce8df08977bc31461d231f9fdd0c0b673f01d45452a804692e0

Message:

Merge pull request #535 from surface-smoothers/update.memoryholes.HOWTO

update FindMemoryHoles howto

Files:

• Singular/HOWTO.FindMemoryHoles (modified) (1 diff)
• Singular/iparith.cc (modified) (2 diffs)
• libpolys/polys/monomials/ring.h (modified) (1 diff)

Singular/HOWTO.FindMemoryHoles

@@ -1 @@
-Here is a first short HowTo on how to locate memory holes in Singular:
-1.) Make sure you build with -DOM_TRACK=5 (e.g. use Singulart, Singularg).
+Here is a HowTo for locating memory holes in Singular:
+
+0.) disable optimization and define flag OM_TRACK=5 :
+     set  
+       CXXFLAGS=" -O0 -DOM_TRACK=5 " 
+         CFLAGS=" -O0 -DOM_TRACK=5 " 
+     explicitly, since configure option '--disable-optimizationflags' does not enable -O0
+
+1.) configure Singular with options 
+     " --enable-debug --with-track-fl --with-track-backtrace " 
+     or similar (see available options from 'cd omalloc/ && ./configure --help )
 2.) Use system("mtrack", [<level>, [<filename>]]) to get a report about
     unused memory, where

Singular/iparith.cc

@@ -2526 +2526 @@
   const int n = L->nr; assume (n >= 0);
   std::vector<ideal> V(n + 1);
- 
+
   for(int i = n; i >= 0; i--) V[i] = (ideal)(L->m[i].Data());
-   
+
   res->data=interpolation(V, (intvec*)v->Data());
   setFlag(res,FLAG_STD);
@@ -5114 +5114 @@
   switch (t)
   {
-    case INT_CMD:        res->data=omStrDup("int"); break;
-    case POLY_CMD:       res->data=omStrDup("poly"); break;
-    case VECTOR_CMD:     res->data=omStrDup("vector"); break;
-    case STRING_CMD:     res->data=omStrDup("string"); break;
-    case INTVEC_CMD:     res->data=omStrDup("intvec"); break;
-    case IDEAL_CMD:      res->data=omStrDup("ideal"); break;
-    case MATRIX_CMD:     res->data=omStrDup("matrix"); break;
-    case MODUL_CMD:      res->data=omStrDup("module"); break;
-    case MAP_CMD:        res->data=omStrDup("map"); break;
-    case PROC_CMD:       res->data=omStrDup("proc"); break;
-    case RING_CMD:       res->data=omStrDup("ring"); break;
-    case QRING_CMD:      res->data=omStrDup("qring"); break;
-    case INTMAT_CMD:     res->data=omStrDup("intmat"); break;
-    case BIGINTMAT_CMD:  res->data=omStrDup("bigintmat"); break;
-    case NUMBER_CMD:     res->data=omStrDup("number"); break;
-    case BIGINT_CMD:     res->data=omStrDup("bigint"); break;
-    case LIST_CMD:       res->data=omStrDup("list"); break;
-    case PACKAGE_CMD:    res->data=omStrDup("package"); break;
-    case LINK_CMD:       res->data=omStrDup("link"); break;
-    case RESOLUTION_CMD: res->data=omStrDup("resolution");break;
+    case INT_CMD:
+    case POLY_CMD:
+    case VECTOR_CMD:
+    case STRING_CMD:
+    case INTVEC_CMD:
+    case IDEAL_CMD:
+    case MATRIX_CMD:
+    case MODUL_CMD:
+    case MAP_CMD:
+    case PROC_CMD:
+    case RING_CMD:
+    case QRING_CMD:
+    case INTMAT_CMD:
+    case BIGINTMAT_CMD:
+    case NUMBER_CMD:
+    case BIGINT_CMD:
+    case LIST_CMD:
+    case PACKAGE_CMD:
+    case LINK_CMD:
+    case RESOLUTION_CMD:
+         res->data=omStrDup(Tok2Cmdname(t)); break;
     case DEF_CMD:
     case NONE:           res->data=omStrDup("none"); break;

libpolys/polys/monomials/ring.h

@@ -416 +416 @@
 #ifdef HAVE_RINGS
 static inline BOOLEAN rField_is_Ring_2toM(const ring r)
-{ assume(r != NULL); assume(r->cf != NULL); return ( getCoeffType(r->cf) == n_Z2m && nCoeff_is_Ring_2toM(r->cf) ); }
+{ assume(r != NULL); assume(r->cf != NULL); return ( nCoeff_is_Ring_2toM(r->cf) ); }
 
 static inline BOOLEAN rField_is_Ring_ModN(const ring r)
-{ assume(r != NULL); assume(r->cf != NULL); return ( getCoeffType(r->cf) == n_Zn && nCoeff_is_Ring_ModN(r->cf) ); }
+{ assume(r != NULL); assume(r->cf != NULL); return ( nCoeff_is_Ring_ModN(r->cf) ); }
 
 static inline BOOLEAN rField_is_Ring_PtoM(const ring r)
-{ assume(r != NULL); assume(r->cf != NULL); return (getCoeffType(r->cf) == n_Znm && nCoeff_is_Ring_PtoM(r->cf) ); }
+{ assume(r != NULL); assume(r->cf != NULL); return ( nCoeff_is_Ring_PtoM(r->cf) ); }
 
 static inline BOOLEAN rField_is_Ring_Z(const ring r)
-{ assume(r != NULL); assume(r->cf != NULL); return (getCoeffType(r->cf) == n_Z && nCoeff_is_Ring_Z(r->cf) ); }
+{ assume(r != NULL); assume(r->cf != NULL); return ( nCoeff_is_Ring_Z(r->cf) ); }
 
 static inline BOOLEAN rField_is_Ring(const ring r)