Changeset 9bb5457 in git

Timestamp:

May 27, 2011, 2:56:51 PM (12 years ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'spielwiese', '91fdef05f09f54b8d58d92a472e9c4a43aa4656f')

Children:

2c7f28850c274452c6d4f324225864e2331412ed

Parents:

7af488ec51790060979537b35a03fb345e053f90

git-author:

Hans Schoenemann <hannes@mathematik.uni-kl.de>2011-05-27 14:56:51+02:00

git-committer:

Mohamed Barakat <mohamed.barakat@rwth-aachen.de>2011-11-09 12:39:06+01:00

Message:

fixed warning about unused paramaters in coeffs

Location:

libpolys

Files:

• coeffs/gnumpc.cc (modified) (8 diffs)
• coeffs/longrat.cc (modified) (15 diffs)
• coeffs/numbers.cc (modified) (5 diffs)
• coeffs/rintegers.cc (modified) (25 diffs)
• coeffs/rmodulo2m.cc (modified) (13 diffs)
• coeffs/rmodulon.cc (modified) (14 diffs)
• polys/monomials/ring.cc (modified) (4 diffs)

libpolys/coeffs/gnumpc.cc

@@ -30 +30 @@
 #ifdef LDEBUG
 // not yet implemented
-BOOLEAN ngcDBTest(number a, const char *f, const int l, const coeffs r)
+BOOLEAN ngcDBTest(number, const char *, const int, const coeffs r)
 {
   assume( getCoeffType(r) == ID );
@@ -54 +54 @@
 {
   assume( getCoeffType(r) == ID );
-  
+
   gmp_complex* n= new gmp_complex( (long)i, (long)0 );
-  
+
   return (number)n;
 }
@@ -66 +66 @@
 {
   assume( getCoeffType(r) == ID );
-  
+
   return (int)((gmp_complex*)i)->real();
 }
@@ -105 +105 @@
 {
   assume( getCoeffType(r) == ID );
-  
+
   gmp_complex* b= new gmp_complex( *(gmp_complex*)a );
   return (number)b;
@@ -170 +170 @@
 {
   assume( getCoeffType(R) == ID );
-  
+
   gmp_complex* r= new gmp_complex( (*(gmp_complex*)a) * (*(gmp_complex*)b) );
   return (number)r;
@@ -414 +414 @@
 
 
-  
-/*  
+
+/*
   //r->cfInitChar=nlInitChar;
   r->cfKillChar=NULL;
@@ -484 +484 @@
   else
     n->complex_parameter = omStrDup( (char*) p );
-    
+
   return FALSE;
 }
@@ -553 +553 @@
 
   if ( from !=  NULL )
-  { 
+  {
     b = new gmp_complex( *(gmp_complex*)from );
   }
-  return (number)b;  
+  return (number)b;
 }
 

libpolys/coeffs/longrat.cc

@@ -151 +151 @@
   assume( getCoeffType(dst) == ID );
   assume( getCoeffType(src) == n_Zp );
-  
+
   number to;
   to = nlInit(npInt(from,src), dst);
@@ -164 +164 @@
 * convert from a GMP integer
 */
-number nlMapGMP(number from, const coeffs src, const coeffs dst)
+number nlMapGMP(number from, const coeffs /*src*/, const coeffs /*dst*/)
 {
   number z=ALLOC_RNUMBER();
@@ -180 +180 @@
 * convert from an machine long
 */
-number nlMapMachineInt(number from, const coeffs src, const coeffs dst)
+number nlMapMachineInt(number from, const coeffs /*src*/, const coeffs /*dst*/)
 {
   number z=ALLOC_RNUMBER();
@@ -195 +195 @@
 
 #ifdef LDEBUG
-BOOLEAN nlDBTest(number a, const char *f,const int l, const coeffs r)
+BOOLEAN nlDBTest(number a, const char *f,const int l, const coeffs /*r*/)
 {
   if (a==NULL)
@@ -284 +284 @@
 
 #ifdef HAVE_FACTORY
-CanonicalForm nlConvSingNFactoryN( number n, BOOLEAN setChar, const coeffs r )
+CanonicalForm nlConvSingNFactoryN( number n, BOOLEAN setChar, const coeffs /*r*/ )
 {
   if (setChar) setCharacteristic( 0 );
@@ -345 +345 @@
   assume( getCoeffType(dst) == ID );
   assume( getCoeffType(src) == n_R );
-  
+
   double f=nrFloat(from);
   if (f==0.0) return INT_TO_SR(0);
@@ -372 +372 @@
 }
 
-static number nlMapLongR(number from, const coeffs src, const coeffs dst) 
+static number nlMapLongR(number from, const coeffs src, const coeffs dst)
 {
   assume( getCoeffType(dst) == ID );
   assume( getCoeffType(src) == n_long_R );
-  
+
   gmp_float *ff=(gmp_float*)from;
   mpf_t *f=ff->_mpfp();
@@ -522 +522 @@
      return 1; /* immidiate int */
   int s=a->z[0]._mp_alloc;
-//  while ((s>0) &&(a->z._mp_d[s]==0L)) s--; 
+//  while ((s>0) &&(a->z._mp_d[s]==0L)) s--;
 //#if SIZEOF_LONG == 8
 //  if (a->z._mp_d[s] < (unsigned long)0x100000000L) s=s*2-1;
@@ -531 +531 @@
   {
     int d=a->n[0]._mp_alloc;
-//    while ((d>0) && (a->n._mp_d[d]==0L)) d--; 
+//    while ((d>0) && (a->n._mp_d[d]==0L)) d--;
 //#if SIZEOF_LONG == 8
 //    if (a->n._mp_d[d] < (unsigned long)0x100000000L) d=d*2-1;
@@ -1971 +1971 @@
   assume( getCoeffType(dst) == ID );
   assume( getCoeffType(src) == ID );
-  
+
   if ((SR_HDL(a) & SR_INT)||(a==NULL))
   {
@@ -1983 +1983 @@
   assume( getCoeffType(dst) == ID );
 //  assume( getCoeffType(src) == ID );
-  
+
   if (nCoeff_is_Q(src))
   {
@@ -2364 +2364 @@
     nlTest(u, R);
     return u;
-    
+
   }
   number u = _nlMult_aNoImm_OR_bNoImm(a, b);
   nlTest(u, R);
   return u;
-  
+
 }
 
@@ -2391 +2391 @@
   nlTest(u, r);
   return u;
-  
+
 }
 
@@ -2539 +2539 @@
 }
 
-void    nlCoeffWrite  (const coeffs r)
+void    nlCoeffWrite  (const coeffs)
 {
   PrintS("//   characteristic : 0\n");
 }
 
-BOOLEAN nlInitChar(coeffs r, void* p)
+BOOLEAN nlInitChar(coeffs r, void*)
 {
   assume( getCoeffType(r) == ID );
   //const int ch = (int)(long)(p);
-  
+
   r->cfKillChar=NULL;
   r->cfSetChar=NULL;
@@ -2609 +2609 @@
   r->has_simple_Alloc=FALSE;
   r->has_simple_Inverse=FALSE;
-  
+
   // variables for this type of coeffs:
   // (none)

libpolys/coeffs/numbers.cc

@@ -52 +52 @@
 
 void   nNew(number* d) { *d=NULL; }
-void   ndDelete(number* d, const coeffs r) { *d=NULL; }
+void   ndDelete(number* d, const coeffs) { *d=NULL; }
 void   ndInpMult(number &a, number b, const coeffs r)
 {
@@ -67 +67 @@
 
 #ifdef LDEBUG
-void   nDBDummy1(number* d,char *f, int l) { *d=NULL; }
-BOOLEAN ndDBTest(number a, const char *f, const int l, const coeffs r)
+void   nDBDummy1(number* d,char *, int) { *d=NULL; }
+BOOLEAN ndDBTest(number, const char *, const int, const coeffs)
 {
   return TRUE;
@@ -90 +90 @@
 }
 
-void   ndNormalize(number& d, const coeffs r) { }
-
-char * ndName(number n, const coeffs r) { return NULL; }
-
-number ndPar(int i, const coeffs r) { return n_Init(0,r); }
-
-number ndReturn0(number n, const coeffs r) { return n_Init(0,r); }
-
-int    ndParDeg(number n, const coeffs r) { return 0; }
+void   ndNormalize(number&, const coeffs) { }
+
+char * ndName(number, const coeffs) { return NULL; }
+
+number ndPar(int, const coeffs r) { return n_Init(0,r); }
+
+number ndReturn0(number, const coeffs r) { return n_Init(0,r); }
+
+int    ndParDeg(number, const coeffs) { return 0; }
 
 number ndGcd(number, number, const coeffs r) { return n_Init(1,r); }
@@ -122 +122 @@
 
 #ifdef HAVE_RINGS
-BOOLEAN ndDivBy(number a, number b, const coeffs r) { return TRUE; } // assume a,b !=0
-int ndDivComp(number a, number b, const coeffs r) { return 2; }
+BOOLEAN ndDivBy(number, number, const coeffs) { return TRUE; } // assume a,b !=0
+int ndDivComp(number, number, const coeffs) { return 2; }
 BOOLEAN ndIsUnit(number a, const coeffs r) { return !n_IsZero(a,r); }
-number  ndExtGcd (number a, number b, number *s, number *t, const coeffs r) { return n_Init(1,r); }
+number  ndExtGcd (number, number, number *, number *, const coeffs r) { return n_Init(1,r); }
 #endif
 
 #ifdef HAVE_FACTORY
-CanonicalForm ndConvSingNFactoryN( number n, BOOLEAN setChar, const coeffs r )
+CanonicalForm ndConvSingNFactoryN( number, BOOLEAN /*setChar*/, const coeffs)
 {
   CanonicalForm term(0);
@@ -136 +136 @@
 }
 
-number ndConvFactoryNSingN( const CanonicalForm n, const coeffs r)
+number ndConvFactoryNSingN( const CanonicalForm, const coeffs)
 {
   Werror("no conversion from factory");

libpolys/coeffs/rintegers.cc

@@ -30 +30 @@
  * Multiply two numbers
  */
-number nrzMult (number a, number b, const coeffs r)
+number nrzMult (number a, number b, const coeffs)
 {
   int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
@@ -41 +41 @@
  * Give the smallest non unit k, such that a * x = k = b * y has a solution
  */
-number nrzLcm (number a,number b,const coeffs r)
+number nrzLcm (number a,number b,const coeffs)
 {
   int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
@@ -53 +53 @@
  * a solution.
  */
-number nrzGcd (number a,number b,const coeffs r)
+number nrzGcd (number a,number b,const coeffs)
 {
   int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
@@ -65 +65 @@
  * a solution and r, s, s.t. k = s*a + t*b
  */
-number  nrzExtGcd (number a, number b, number *s, number *t, const coeffs r)
+number  nrzExtGcd (number a, number b, number *s, number *t, const coeffs)
 {
   int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
@@ -79 +79 @@
 }
 
-void nrzPower (number a, int i, number * result, const coeffs r)
+void nrzPower (number a, int i, number * result, const coeffs)
 {
   int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
@@ -90 +90 @@
  * create a number from int
  */
-number nrzInit (int i, const coeffs r)
+number nrzInit (int i, const coeffs)
 {
   int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
@@ -97 +97 @@
 }
 
-void nrzDelete(number *a, const coeffs r)
+void nrzDelete(number *a, const coeffs)
 {
   if (*a == NULL) return;
@@ -105 +105 @@
 }
 
-number nrzCopy(number a, const coeffs r)
+number nrzCopy(number a, const coeffs)
 {
   int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
@@ -112 +112 @@
 }
 
-number nrzCopyMap(number a, const coeffs src, const coeffs dst)
+number nrzCopyMap(number a, const coeffs /*src*/, const coeffs dst)
 {
   return nrzCopy(a,dst);
 }
 
-int nrzSize(number a, const coeffs r)
+int nrzSize(number a, const coeffs)
 {
   if (a == NULL) return 0;
@@ -126 +126 @@
  * convert a number to int
  */
-int nrzInt(number &n, const coeffs r)
+int nrzInt(number &n, const coeffs)
 {
   return (int) mpz_get_si( (int_number)n);
 }
 
-number nrzAdd (number a, number b, const coeffs r)
+number nrzAdd (number a, number b, const coeffs)
 {
   int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
@@ -139 +139 @@
 }
 
-number nrzSub (number a, number b, const coeffs r)
+number nrzSub (number a, number b, const coeffs)
 {
   int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
@@ -147 +147 @@
 }
 
-number  nrzGetUnit (number a, const coeffs r)
+number  nrzGetUnit (number, const coeffs r)
 {
   return nrzInit(1, r);
 }
 
-BOOLEAN nrzIsUnit (number a, const coeffs r)
+BOOLEAN nrzIsUnit (number a, const coeffs)
 {
   return 0 == mpz_cmpabs_ui((int_number) a, 1);
 }
 
-BOOLEAN nrzIsZero (number  a, const coeffs r)
+BOOLEAN nrzIsZero (number  a, const coeffs)
 {
   return 0 == mpz_cmpabs_ui((int_number) a, 0);
 }
 
-BOOLEAN nrzIsOne (number a, const coeffs r)
+BOOLEAN nrzIsOne (number a, const coeffs)
 {
   return (a!=NULL) && (0 == mpz_cmp_si((int_number) a, 1));
 }
 
-BOOLEAN nrzIsMOne (number a, const coeffs r)
+BOOLEAN nrzIsMOne (number a, const coeffs)
 {
   return (a!=NULL) && (0 == mpz_cmp_si((int_number) a, -1));
 }
 
-BOOLEAN nrzEqual (number a,number b, const coeffs r)
+BOOLEAN nrzEqual (number a,number b, const coeffs)
 {
   return 0 == mpz_cmp((int_number) a, (int_number) b);
 }
 
-BOOLEAN nrzGreater (number a,number b, const coeffs r)
+BOOLEAN nrzGreater (number a,number b, const coeffs)
 {
   return 0 < mpz_cmp((int_number) a, (int_number) b);
 }
 
-BOOLEAN nrzGreaterZero (number k, const coeffs r)
+BOOLEAN nrzGreaterZero (number k, const coeffs)
 {
   return 0 < mpz_cmp_si((int_number) k, 0);
@@ -198 +198 @@
 }
 
-BOOLEAN nrzDivBy (number a,number b, const coeffs r)
+BOOLEAN nrzDivBy (number a,number b, const coeffs)
 {
   return mpz_divisible_p((int_number) a, (int_number) b) != 0;
@@ -220 +220 @@
 }
 
-number nrzIntDiv (number a,number b, const coeffs r)
+number nrzIntDiv (number a,number b, const coeffs)
 {
   int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
@@ -228 +228 @@
 }
 
-number nrzIntMod (number a,number b, const coeffs R)
+number nrzIntMod (number a,number b, const coeffs)
 {
   int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
@@ -249 +249 @@
 }
 
-number nrzNeg (number c, const coeffs r)
+number nrzNeg (number c, const coeffs)
 {
 // nNeg inplace !!!
@@ -256 +256 @@
 }
 
-number nrzMapMachineInt(number from, const coeffs src, const coeffs dst)
+number nrzMapMachineInt(number from, const coeffs /*src*/, const coeffs /*dst*/)
 {
   int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
@@ -263 +263 @@
 }
 
-number nrzMapZp(number from, const coeffs src, const coeffs dst)
+number nrzMapZp(number from, const coeffs /*src*/, const coeffs /*dst*/)
 {
   int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
@@ -270 +270 @@
 }
 
-number nrzMapQ(number from, const coeffs src, const coeffs dst)
+number nrzMapQ(number from, const coeffs src, const coeffs /*dst*/)
 {
   int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
@@ -305 +305 @@
  */
 
-void nrzSetExp(int m, coeffs r)
-{
-}
-
-void nrzInitExp(int m, coeffs r)
+void nrzSetExp(int, coeffs)
+{
+}
+
+void nrzInitExp(int, coeffs)
 {
 }
 
 #ifdef LDEBUG
-BOOLEAN nrzDBTest (number a, const char *f, const int l, const coeffs r)
+BOOLEAN nrzDBTest (number, const char *, const int, const coeffs)
 {
   return TRUE;//TODO
@@ -320 +320 @@
 #endif
 
-void nrzWrite (number &a, const coeffs r)
+void nrzWrite (number &a, const coeffs)
 {
   char *s,*z;
@@ -364 +364 @@
 }
 
-const char * nrzRead (const char *s, number *a, const coeffs r)
+const char * nrzRead (const char *s, number *a, const coeffs)
 {
   int_number z = (int_number) omAllocBin(gmp_nrz_bin);
@@ -375 +375 @@
 }
 
-void    nrzCoeffWrite  (const coeffs r)
+void    nrzCoeffWrite  (const coeffs)
 {
   PrintS("//   characteristic : 0 (Integers)\n");
@@ -381 +381 @@
 
 
-BOOLEAN nrzInitChar(coeffs r,  void * parameter)
+BOOLEAN nrzInitChar(coeffs r,  void *)
 {
   assume( getCoeffType(r) == ID );
@@ -426 +426 @@
   r->cfDBTest=nrzDBTest;
 #endif
- 
+
   r->nNULL = 0;
   r->ch = 0;
   r->ringtype = 4;
   r->has_simple_Alloc=FALSE;
-  r->has_simple_Inverse=FALSE; 
+  r->has_simple_Inverse=FALSE;
   return FALSE;
 }

libpolys/coeffs/rmodulo2m.cc

@@ -53 +53 @@
 
   r->ringtype = 1;
-  
+
   /* next cast may yield an overflow as mod2mMask is an unsigned long */
   r->ch = (int)r->mod2mMask + 1;
@@ -110 +110 @@
  * Give the smallest k, such that a * x = k = b * y has a solution
  */
-number nr2mLcm(number a, number b, const coeffs r)
+number nr2mLcm(number a, number b, const coeffs)
 {
   NATNUMBER res = 0;
@@ -133 +133 @@
  * a solution.
  */
-number nr2mGcd(number a, number b, const coeffs r)
+number nr2mGcd(number a, number b, const coeffs)
 {
   NATNUMBER res = 0;
@@ -240 +240 @@
 }
 
-BOOLEAN nr2mIsUnit(number a, const coeffs r)
+BOOLEAN nr2mIsUnit(number a, const coeffs)
 {
   return ((NATNUMBER)a % 2 == 1);
 }
 
-number nr2mGetUnit(number k, const coeffs r)
+number nr2mGetUnit(number k, const coeffs)
 {
   if (k == NULL) return (number)1;
@@ -253 +253 @@
 }
 
-BOOLEAN nr2mIsZero(number a, const coeffs r)
+BOOLEAN nr2mIsZero(number a, const coeffs)
 {
   return 0 == (NATNUMBER)a;
 }
 
-BOOLEAN nr2mIsOne(number a, const coeffs r)
+BOOLEAN nr2mIsOne(number a, const coeffs)
 {
   return 1 == (NATNUMBER)a;
@@ -268 +268 @@
 }
 
-BOOLEAN nr2mEqual(number a, number b, const coeffs r)
+BOOLEAN nr2mEqual(number a, number b, const coeffs)
 {
   return (a == b);
@@ -310 +310 @@
 }
 
-int nr2mDivComp(number as, number bs, const coeffs r)
+int nr2mDivComp(number as, number bs, const coeffs)
 {
   NATNUMBER a = (NATNUMBER)as;
@@ -474 +474 @@
   NATNUMBER g = 1;
   NATNUMBER b_div = (NATNUMBER)b;
-  if (b_div < 0) b_div = -b_div; // b_div now represents |b|
+  if (b_div < 0) b_div = -b_div; // b_div now represents |b|, BUT b_div is unsigned!
   NATNUMBER rr = 0;
   while ((g < r->mod2mMask ) && (b_div > 0) && (b_div % 2 == 0))
@@ -532 +532 @@
 }
 
-number nr2mMapMachineInt(number from, const coeffs src, const coeffs dst)
+number nr2mMapMachineInt(number from, const coeffs /*src*/, const coeffs dst)
 {
   NATNUMBER i = ((NATNUMBER)from) % dst->mod2mMask ;
@@ -538 +538 @@
 }
 
-number nr2mMapZp(number from, const coeffs src, const coeffs dst)
+number nr2mMapZp(number from, const coeffs /*src*/, const coeffs dst)
 {
   NATNUMBER j = (NATNUMBER)1;
@@ -549 +549 @@
 }
 
-number nr2mMapQ(number from, const coeffs src, const coeffs dst)
+number nr2mMapQ(number from, const coeffs /*src*/, const coeffs dst)
 {
   int_number erg = (int_number)omAllocBin(gmp_nrz_bin);
@@ -566 +566 @@
 }
 
-number nr2mMapGMP(number from, const coeffs src, const coeffs dst)
+number nr2mMapGMP(number from, const coeffs /*src*/, const coeffs dst)
 {
   int_number erg = (int_number)omAllocBin(gmp_nrz_bin);
@@ -659 +659 @@
 
 #ifdef LDEBUG
-BOOLEAN nr2mDBTest (number a, const char *f, const int l, const coeffs r)
-{
-  if ((NATNUMBER)a < 0) return FALSE;
+BOOLEAN nr2mDBTest (number a, const char *, const int, const coeffs r)
+{
+  //if ((NATNUMBER)a < 0) return FALSE; // is unsigned!
   if (((NATNUMBER)a & r->mod2mMask) != (NATNUMBER)a) return FALSE;
   return TRUE;

libpolys/coeffs/rmodulon.cc

@@ -51 +51 @@
   nrnInitExp((int)(long)(p), r);
   r->ringtype = 2;
-  
+
   /* next computation may yield wrong characteristic as r->modNumber
      is a GMP number */
@@ -108 +108 @@
 }
 
-void nrnDelete(number *a, const coeffs r)
+void nrnDelete(number *a, const coeffs)
 {
   if (*a == NULL) return;
@@ -116 +116 @@
 }
 
-number nrnCopy(number a, const coeffs r)
+number nrnCopy(number a, const coeffs)
 {
   int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
@@ -123 +123 @@
 }
 
-int nrnSize(number a, const coeffs r)
+int nrnSize(number a, const coeffs)
 {
   if (a == NULL) return 0;
@@ -132 +132 @@
  * convert a number to int
  */
-int nrnInt(number &n, const coeffs r)
+int nrnInt(number &n, const coeffs)
 {
   return (int)mpz_get_si((int_number) n);
@@ -179 +179 @@
   if( !nrnIsZero(c, r) )
     // Attention: This method operates in-place.
-    mpz_sub((int_number)c, r->modNumber, (int_number)c);  
+    mpz_sub((int_number)c, r->modNumber, (int_number)c);
   return c;
 }
@@ -253 +253 @@
 }
 
-BOOLEAN nrnIsZero(number a, const coeffs r)
+BOOLEAN nrnIsZero(number a, const coeffs)
 {
 #ifdef LDEBUG
@@ -261 +261 @@
 }
 
-BOOLEAN nrnIsOne(number a, const coeffs r)
+BOOLEAN nrnIsOne(number a, const coeffs)
 {
 #ifdef LDEBUG
@@ -281 +281 @@
 }
 
-BOOLEAN nrnEqual(number a, number b, const coeffs r)
+BOOLEAN nrnEqual(number a, number b, const coeffs)
 {
   return 0 == mpz_cmp((int_number)a, (int_number)b);
 }
 
-BOOLEAN nrnGreater(number a, number b, const coeffs r)
+BOOLEAN nrnGreater(number a, number b, const coeffs)
 {
   return 0 < mpz_cmp((int_number)a, (int_number)b);
 }
 
-BOOLEAN nrnGreaterZero(number k, const coeffs r)
+BOOLEAN nrnGreaterZero(number k, const coeffs)
 {
   return 0 < mpz_cmp_si((int_number)k, 0);
@@ -443 +443 @@
 int_number nrnMapCoef = NULL;
 
-number nrnMapModN(number from, const coeffs src, const coeffs dst)
+number nrnMapModN(number from, const coeffs /*src*/, const coeffs dst)
 {
   return nrnMult(from, (number) nrnMapCoef, dst);
 }
 
-number nrnMap2toM(number from, const coeffs src, const coeffs dst)
+number nrnMap2toM(number from, const coeffs /*src*/, const coeffs dst)
 {
   int_number erg = (int_number)omAllocBin(gmp_nrz_bin);
@@ -457 +457 @@
 }
 
-number nrnMapZp(number from, const coeffs src, const coeffs dst)
+number nrnMapZp(number from, const coeffs /*src*/, const coeffs dst)
 {
   int_number erg = (int_number)omAllocBin(gmp_nrz_bin);
@@ -467 +467 @@
 }
 
-number nrnMapGMP(number from, const coeffs src, const coeffs dst)
+number nrnMapGMP(number from, const coeffs /*src*/, const coeffs dst)
 {
   int_number erg = (int_number)omAllocBin(gmp_nrz_bin);
@@ -475 +475 @@
 }
 
-number nrnMapQ(number from, const coeffs src, const coeffs dst)
+number nrnMapQ(number from, const coeffs src, const coeffs /*dst*/)
 {
   int_number erg = (int_number)omAllocBin(gmp_nrz_bin);
@@ -590 +590 @@
 
 #ifdef LDEBUG
-BOOLEAN nrnDBTest (number a, const char *f, const int l, const coeffs r)
+BOOLEAN nrnDBTest (number a, const char *, const int, const coeffs r)
 {
   if (a==NULL) return TRUE;

libpolys/polys/monomials/ring.cc

@@ -2211 +2211 @@
 
 static void rO_ISPrefix(int &place, int &bitplace, int &prev_ord,
-    long *o, int N, int *v, sro_ord &ord_struct)
+    long *o, int /*N*/, int *v, sro_ord &ord_struct)
 {
   if ((prev_ord== 1) || (bitplace!=BITS_PER_LONG))
@@ -3929 +3929 @@
       pFDeg_CASE(p_WTotaldegree); else
       pFDeg_CASE(p_Deg); else
-      Print("(%p)", r->pFDeg); // default case
+      Print("(%p)", (void*)(r->pFDeg)); // default case
 
     PrintS("\n");
@@ -4898 +4898 @@
   return size;
 }
-//static int rReallocM1(ring r, ring src, int size, int pos)
-//{
-//  r->order=(int*)omReallocSize(r->order, size*sizeof(int), (size-1)*sizeof(int));
-//  r->block0=(int*)omReallocSize(r->block0, size*sizeof(int), (size-1)*sizeof(int));
-//  r->block1=(int*)omReallocSize(r->block1, size*sizeof(int), (size-1)*sizeof(int));
-//  r->wvhdl=(int **)omReallocSize(r->wvhdl,size*sizeof(int *), (size-1)*sizeof(int *));
-//  for(int k=pos+1; k<size; k++) r->wvhdl[k]=r->wvhdl[k+1];
-//  size--;
-//  return size;
-//}
+#if 0 // currently unused
+static int rReallocM1(ring r, int size, int pos)
+{
+  r->order=(int*)omReallocSize(r->order, size*sizeof(int), (size-1)*sizeof(int));
+  r->block0=(int*)omReallocSize(r->block0, size*sizeof(int), (size-1)*sizeof(int));
+  r->block1=(int*)omReallocSize(r->block1, size*sizeof(int), (size-1)*sizeof(int));
+  r->wvhdl=(int **)omReallocSize(r->wvhdl,size*sizeof(int *), (size-1)*sizeof(int *));
+  for(int k=pos+1; k<size; k++) r->wvhdl[k]=r->wvhdl[k+1];
+  size--;
+  return size;
+}
+#endif
 static void rOppWeight(int *w, int l)
 {
@@ -5123 +5125 @@
           r->order[j]=ringorder_wp;
           i++;
-          //l=rReallocM1(r,src,l,j);
+          //l=rReallocM1(r,l,j);
         }
         else