Changeset c232af in git for Singular/fglmvec.cc

Timestamp:

Aug 14, 2000, 2:58:28 PM (24 years ago)

Author:

Olaf Bachmann <obachman@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

d26c2e9dd38f1531c0e77c38e6177109182b5bca

Parents:

4697a8a1ccbf49d0048033ea29c651e3966ba729

Message:

* omalloc stuff


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

File:

• Singular/fglmvec.cc (modified) (10 diffs)

Singular/fglmvec.cc

@@ -1 +1 @@
 // emacs edit mode for this file is -*- C++ -*-
-// $Id: fglmvec.cc,v 1.12 1999-11-15 17:20:02 obachman Exp $
+// $Id: fglmvec.cc,v 1.13 2000-08-14 12:56:15 obachman Exp $
 
 /****************************************
@@ -16 +16 @@
 
 #ifdef HAVE_FGLM
-#include "mmemory.h"
+#include <omalloc.h>
 #include "tok.h"
 #include "structs.h"
@@ -44 +44 @@
             elems= 0;
         else {
-            elems= (number *)Alloc( N*sizeof( number ) );
+            elems= (number *)omAlloc( N*sizeof( number ) );
             for ( int i= N-1; i >= 0; i-- )
                 elems[i]= nInit( 0 );
@@ -54 +54 @@
             for ( int i= N-1; i >= 0; i-- )
                 nDelete( elems + i );
-            Free( (ADDRESS)elems, N*sizeof( number ) );
+            omFreeSize( (ADDRESS)elems, N*sizeof( number ) );
         }
     }
@@ -62 +62 @@
         if ( N > 0 ) {
             number * elems_clone;
-            elems_clone= (number *)Alloc( N*sizeof( number ) );
+            elems_clone= (number *)omAlloc( N*sizeof( number ) );
             for ( int i= N-1; i >= 0; i-- )
                 elems_clone[i] = nCopy( elems[i] );
@@ -208 +208 @@
     {
         number* newelems;
-        newelems= (number *)Alloc( rep->size()*sizeof( number ) );
+        newelems= (number *)omAlloc( rep->size()*sizeof( number ) );
         for ( i= vsize; i > 0; i-- ) {
             term1= nMult( fac1, rep->getconstelem( i ) );
@@ -283 +283 @@
         int n = rep->size();
         number* newelems;
-        newelems= (number *)Alloc( n*sizeof( number ) );
+        newelems= (number *)omAlloc( n*sizeof( number ) );
         for ( i= n; i > 0; i-- )
             newelems[i-1]= nAdd( rep->getconstelem( i ), v.rep->getconstelem( i ) );
@@ -305 +305 @@
         int n = rep->size();
         number* newelems;
-        newelems= (number *)Alloc( n*sizeof( number ) );
+        newelems= (number *)omAlloc( n*sizeof( number ) );
         for ( i= n; i > 0; i-- )
             newelems[i-1]= nSub( rep->getconstelem( i ), v.rep->getconstelem( i ) );
@@ -321 +321 @@
     if ( ! rep->isUnique() ) {
         number * temp;
-        temp= (number *)Alloc( s*sizeof( number ) );
+        temp= (number *)omAlloc( s*sizeof( number ) );
         for ( i= s; i > 0; i-- )
             temp[i-1]= nMult( rep->getconstelem( i ), n );
@@ -342 +342 @@
     if ( ! rep->isUnique() ) {
         number * temp;
-        temp= (number *)Alloc( s*sizeof( number ) );
+        temp= (number *)omAlloc( s*sizeof( number ) );
         for ( i= s; i > 0; i-- ) {
             temp[i-1]= nDiv( rep->getconstelem( i ), n );