Changeset 9d19c1 in git


Ignore:
Timestamp:
Nov 4, 2016, 6:05:00 PM (8 years ago)
Author:
Hans Schoenemann <hannes@…>
Branches:
(u'fieker-DuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', 'b4f17ed1d25f93d46dbe29e4b499baecc2fd51bb')
Children:
07b05879aa75a83b11b096f36bbf000962f5dd243a8cca92df2ac8cbac147be19125b411d929f7cf
Parents:
23ca7b7a1c132bcc62bab0c48743fe235bbe1764
Message:
compiler warings: unused variables, parameters, functions
Files:
28 edited

Legend:

Unmodified
Added
Removed

  • Singular/blackbox.cc

    r23ca7b7 r9d19c1  
    7979}
    8080
    81 BOOLEAN blackboxDefaultOp2(int op,leftv /*l*/, leftv r1, leftv /*r2*/)
    82 {
    83   return TRUE;
    84 }
    85 
    86 BOOLEAN blackboxDefaultOp3(int op,leftv /*l*/, leftv r1,leftv /*r2*/, leftv /*r3*/)
     81BOOLEAN blackboxDefaultOp2(int /*op*/,leftv /*l*/, leftv /*r1*/, leftv /*r2*/)
     82{
     83  return TRUE;
     84}
     85
     86BOOLEAN blackboxDefaultOp3(int /*op*/,leftv /*l*/, leftv /*r1*/,leftv /*r2*/, leftv /*r3*/)
    8787{
    8888  return TRUE;

  • Singular/cntrlc.cc

    r23ca7b7 r9d19c1  
    6464 #endif
    6565 #ifndef __OPTIMIZE__
    66    static void stack_trace_sigchld (int);
    6766   static void stack_trace (char *const*args);
    6867 #endif

  • Singular/dyn_modules/pyobject/pyobject.cc

    r23ca7b7 r9d19c1  
    499499
    500500/// blackbox support - convert to string representation
    501 char* pyobject_String(blackbox *b, void* ptr)
     501char* pyobject_String(blackbox *, void* ptr)
    502502{
    503503  return PythonCastStatic<>(ptr).repr();
    … …  
    505505
    506506/// blackbox support - copy element
    507 void* pyobject_Copy(blackbox*b, void* ptr)
     507void* pyobject_Copy(blackbox*, void* ptr)
    508508{
    509509    Py_XINCREF(ptr);
    … …  
    647647
    648648/// blackbox support - destruction
    649 void pyobject_destroy(blackbox *b, void* ptr)
     649void pyobject_destroy(blackbox *, void* ptr)
    650650{
    651651  Py_XDECREF(ptr);

  • Singular/extra.cc

    r23ca7b7 r9d19c1  
    22782278#ifdef HAVE_EXTENDED_SYSTEM
    22792279  // You can put your own system calls here
    2280 #  include <kernel/fglm/fglmcomb.cc>
    22812280#  include <kernel/fglm/fglm.h>
    22822281#  ifdef HAVE_NEWTON

  • Singular/gentable.cc

    r23ca7b7 r9d19c1  
    934934/*-------------------------------------------------------------------*/
    935935
    936 int main(int argc, char** argv)
     936int main(int argc, char**)
    937937{
    938938  if (argc>1)

  • Singular/links/ssiLink.cc

    r23ca7b7 r9d19c1  
    258258  ssiWriteRing_R(d,r);
    259259}
    260 void ssiWritePoly_R(const ssiInfo *d, int typ, poly p, const ring r)
     260void ssiWritePoly_R(const ssiInfo *d, int /*typ*/, poly p, const ring r)
    261261{
    262262  fprintf(d->f_write,"%d ",pLength(p));//number of terms

  • Singular/misc_ip.cc

    r23ca7b7 r9d19c1  
    13111311// default coeffs
    13121312  {
     1313#ifdef SINGULAR_4_1
    13131314    idhdl h;
    1314 #ifdef SINGULAR_4_1   
    13151315    h=enterid(omStrDup("QQ"),0/*level*/, CRING_CMD,&(basePack->idroot),FALSE /*init*/,FALSE /*search*/);
    13161316    IDDATA(h)=(char*)nInitChar(n_Q,NULL);

  • factory/facAlgExt.cc

    r23ca7b7 r9d19c1  
    3737TIMING_DEFINE_PRINT(fac_alg_time_shift)
    3838
     39#if 0
     40// unused
    3941// squarefree part of F
    4042static CanonicalForm uniSqrfPart (const CanonicalForm& F)
    … …  
    4648  return F/G;
    4749}
     50#endif
    4851
    4952static CanonicalForm Norm (const CanonicalForm& F, const Variable& alpha)
    … …  
    7073}
    7174
     75#if 0
     76// unused
    7277// i is an integer such that Norm (F (x-i*alpha)) is squarefree
    7378static CanonicalForm sqrfNorm (const CanonicalForm& F, const Variable& alpha, int& i)
    … …  
    139144  } while (1);
    140145}
     146#endif
    141147
    142148CFList AlgExtSqrfFactorize (const CanonicalForm& F, const Variable& alpha)

  • kernel/GBEngine/kstd2.cc

    r23ca7b7 r9d19c1  
    38293829        pos = posInS(strat,strat->sl,strat->P.p,strat->P.ecart);
    38303830      else
    3831         pos = posInSMonFirst(strat,strat->sl,strat->P.p,strat->P.ecart);
     3831        pos = posInSMonFirst(strat,strat->sl,strat->P.p);
    38323832      #else
    38333833      pos = posInS(strat,strat->sl,strat->P.p,strat->P.ecart);

  • kernel/GBEngine/kutil.cc

    r23ca7b7 r9d19c1  
    12741274* put the pair (s[i],p)  into the set B, ecart=ecart(p) (ring case)
    12751275*/
    1276 void enterOnePairRing (int i,poly p,int ecart, int isFromQ,kStrategy strat, int atR = -1)
     1276void enterOnePairRing (int i,poly p,int /*ecart*/, int isFromQ,kStrategy strat, int atR = -1)
    12771277{
    12781278  assume(atR >= 0);
    … …  
    12981298  }
    12991299  #endif
    1300   int      l,j,compare,compareCoeff;
     1300  int      j,compare,compareCoeff;
    13011301  LObject  h;
    13021302
    … …  
    31513151  }
    31523152
    3153   int      l,j,compare;
     3153  int      l;
    31543154  LObject  Lp;
    31553155  Lp.i_r = -1;
    … …  
    39653965  {
    39663966    int j;
    3967     BOOLEAN new_pair=FALSE;
    39683967
    39693968    if (pGetComp(h)==0)
    … …  
    39763975          if (!strat->fromQ[j])
    39773976          {
    3978             new_pair=TRUE;
    39793977            enterOnePairSigRing(j,h,hSig,hFrom,ecart,isFromQ,strat, atR);
    39803978          //Print("j:%d, Ll:%d\n",j,strat->Ll);
    … …  
    39843982      else
    39853983      {
    3986         new_pair=TRUE;
    39873984        for (j=0; j<=k && !strat->sigdrop; j++)
    39883985        {
    … …  
    39993996        || (pGetComp(strat->S[j])==0))
    40003997        {
    4001           new_pair=TRUE;
    40023998          enterOnePairSigRing(j,h,hSig,hFrom,ecart,isFromQ,strat, atR);
    40033999        //Print("j:%d, Ll:%d\n",j,strat->Ll);
    … …  
    46344630}
    46354631
    4636 void initenterstrongPairsSig (poly h,poly hSig, int hFrom, int k,int ecart,int isFromQ,kStrategy strat, int atR = -1)
     4632static void initenterstrongPairsSig (poly h,poly hSig, int k,int ecart,int isFromQ,kStrategy strat, int atR = -1)
    46374633{
    46384634  const int iCompH = pGetComp(h);
    … …  
    49274923  printf("\n      Trying to add gcd-polys\n");
    49284924  #endif
    4929   initenterstrongPairsSig(h, hSig, hFrom,k, ecart, 0, strat, atR);
     4925  initenterstrongPairsSig(h, hSig, k, ecart, 0, strat, atR);
    49304926  if(strat->sigdrop) return;
    49314927  clearSbatch(h, k, pos, strat);
    … …  
    52145210// sorts by degree and pLtCmp
    52155211// but puts pure monomials at the beginning
    5216 int posInSMonFirst (const kStrategy strat, const int length,const poly p,
    5217             const int ecart_p)
     5212int posInSMonFirst (const kStrategy strat, const int length,const poly p)
    52185213{
    52195214  if (length<0) return 0;
    … …  
    52555250    }
    52565251  }
    5257   if(pNext(p) != NULL)
     5252  else /*if(pNext(p) != NULL)*/
    52585253  {
    52595254    int o = p_Deg(p,currRing);
    … …  
    64456440*/
    64466441int posInL11Ring (const LSet set, const int length,
    6447               LObject* p,const kStrategy strat)
     6442              LObject* p,const kStrategy)
    64486443{
    64496444  if (length<0) return 0;
    … …  
    64796474
    64806475int posInLF5CRing (const LSet set, int start,const int length,
    6481               LObject* p,const kStrategy strat)
     6476              LObject* p,const kStrategy)
    64826477{
    64836478  if (length<0) return 0;
    … …  
    65156510#ifdef HAVE_RINGS
    65166511int posInL11Ringls (const LSet set, const int length,
    6517               LObject* p,const kStrategy strat)
     6512              LObject* p,const kStrategy)
    65186513{
    65196514  if (length < 0) return 0;

  • kernel/GBEngine/kutil.h

    r23ca7b7 r9d19c1  
    426426int posInS (const kStrategy strat, const int length, const poly p,
    427427            const int ecart_p);
    428 int posInSMonFirst (const kStrategy strat, const int length, const poly p,
    429             const int ecart_p);
     428int posInSMonFirst (const kStrategy strat, const int length, const poly p);
    430429int posInIdealMonFirst (const ideal F, const poly p,int start = 0,int end = -1);
    431430int posInT0 (const TSet set,const int length,LObject &p);

  • kernel/GBEngine/syz1.cc

    r23ca7b7 r9d19c1  
    168168*/
    169169
     170#if 0
     171// unused
    170172#ifdef PDEBUG
    171173static int syzcomp2dpc_test(poly p1, poly p2)
    … …  
    228230}
    229231#endif // PDEBUG
     232#endif
    230233
    231234poly syRedtail (poly p, syStrategy syzstr, int index)
    … …  
    12961299}
    12971300
     1301#if 0
     1302// unused
    12981303/*3
    12991304* FOR THE INHOMOGENEOUS CASE ONLY!
    … …  
    13171322  return result;
    13181323}
     1324#endif
    13191325
    13201326/*3
    … …  
    20342040}
    20352041
     2042#if 0
     2043// unused
    20362044/*2
    20372045* deleting all monomials the component of which correspond
    … …  
    20582066  return p;
    20592067}
     2068#endif
    20602069
    20612070/*2

  • kernel/GBEngine/syz3.cc

    r23ca7b7 r9d19c1  
    569569}
    570570
     571#if 0
     572// unused
    571573/*3
    572574* the complete reduction of a single pair which is just stored
    … …  
    599601  return isChanged;
    600602}
     603#endif
    601604
    602605/*3

  • kernel/combinatorics/hdegree.cc

    r23ca7b7 r9d19c1  
    13371337  ideal res = idInit(pLength(q), rank);
    13381338  polyset mm = res->m;
    1339   int i = 0;
    13401339  do
    13411340  {

  • kernel/combinatorics/hilb.cc

    r23ca7b7 r9d19c1  
    941941    int dummy;
    942942    poly m;
    943     ideal p, koszsimp;
     943    ideal p;
    944944    //----------- PRUNING OF S ---------------
    945945    //S SHOULD IN THIS POINT BE ORDERED BY DEGREE
    … …  
    14491449   * represented by the minimal generating set
    14501450   */
    1451   int i, j, s, cnt;
     1451  int i, s;
    14521452  s = 1;
    14531453  int JCount = IDELEMS(J);
    … …  
    15091509   */
    15101510
    1511   int i, j, s, cnt;
     1511  int i, s;
    15121512  s = 1;
    15131513  //when J is null
    … …  
    15461546
    15471547  int ps = 0;
    1548   int i, j, s = 0;
     1548  int i, s = 0;
    15491549  int orbCount = idorb.size();
    15501550
    … …  
    16231623   */
    16241624  int ps = 0;
    1625   int i, j, s = 0;
     1625  int i, s = 0;
    16261626  int OrbCount = idorb.size();
    16271627
    … …  
    16761676  sortMonoIdeal_pCompare(I);
    16771677
    1678   ideal J = idInit(1, 1);
    16791678  int i, k;
    1680   int count = 0;
    16811679  int ICount = IDELEMS(I);
    16821680
    … …  
    18421840  }
    18431841
    1844   int i, j, d;
     1842  int i, d;
    18451843  d = p_Totaldegree(w, currRing);
    18461844  bool flag = FALSE;
    18471845  int SCount = IDELEMS(S);
    1848   int cnt = 0;
    18491846  for(i = 0; i < SCount; i++)
    18501847  {

  • kernel/fglm/fglm.h

    r23ca7b7 r9d19c1  
    8383BOOLEAN fglmquot( ideal sourceIdeal, poly quot, ideal & destIdeal );
    8484
     85poly fglmLinearCombination( ideal source, poly monset );
     86poly fglmNewLinearCombination( ideal source, poly monset );
    8587#endif

  • kernel/fglm/fglmcomb.cc

    r23ca7b7 r9d19c1  
    152152}
    153153
    154 static poly
    155 fglmNewLinearCombination( ideal source, poly monset )
     154poly fglmNewLinearCombination( ideal source, poly monset )
    156155{
    157156    polyset m = NULL;
    … …  
    416415
    417416
    418 static poly
    419 fglmLinearCombination( ideal source, poly monset )
     417poly fglmLinearCombination( ideal source, poly monset )
    420418{
    421419    int k;

  • kernel/fglm/fglmvec.cc

    r23ca7b7 r9d19c1  
    103103    int k;
    104104    for(k = N; k > 0; k--)
     105    {
    105106      if(!nIsZero (getconstelem (k)))
    106107          return 0;
    107       return 1;
     108    }
     109    return 1;
    108110  }
    109111  int numNonZeroElems () const
    … …  
    112114    int k;
    113115    for(k = N; k > 0; k--)
     116    {
    114117      if(!nIsZero (getconstelem (k)))
    115118          num++;
    116       return num;
     119    }
     120    return num;
    117121  }
    118122  void setelem (int i, number n)

  • kernel/groebner_walk/walkMain.cc

    r23ca7b7 r9d19c1  
    146146///////////////////////////////////////////////////////////////////
    147147
    148 WalkState walkStep64(ideal & G,int64vec* currw64, int step)
     148WalkState walkStep64(ideal & G,int64vec* currw64)
    149149{
    150150  WalkState state=WalkOk;
    … …  
    272272    }
    273273
    274     state=walkStep64(nextG,currw64,step);
     274    state=walkStep64(nextG,currw64);
    275275    //uppdates nextG if all is OK
    276276

  • kernel/groebner_walk/walkProc.cc

    r23ca7b7 r9d19c1  
    132132    //remove this to if you want to allow permutations of parameters
    133133    for ( k= npar; (k > 0) && (state == WalkOk); k-- )
     134    {
    134135      if ( pperm[k-1] != (-k) )
    135136      {
    … …  
    137138        state= WalkIncompatibleRings;
    138139      }
    139 
    140       if (pperm != NULL)
    141         omFreeSize( (ADDRESS)pperm, (npar+1)*sizeof( int ) );
     140    }
     141    if (pperm != NULL)
     142      omFreeSize( (ADDRESS)pperm, (npar+1)*sizeof( int ) );
    142143
    143144    if ( state != WalkOk ) return state;

  • kernel/groebner_walk/walkSupport.cc

    r23ca7b7 r9d19c1  
    10271027  int pos1=0;
    10281028  int pos2=0;
    1029   int temp;
    10301029  int i=0;
    10311030  while(r->order[i]!=0 && pos2<n)
    … …  
    10351034    if(r->order[i]==ringorder_lp)
    10361035    {
    1037       temp=pos1;
    10381036      for(int j=pos1; j<=pos2; j++)
    10391037        (*res)[j*n+j]=(int64)1;

  • libpolys/coeffs/gnumpc.cc

    r23ca7b7 r9d19c1  
    614614  if ( from != NULL )
    615615  {
    616     gmp_complex *res=new gmp_complex(numberFieldToFloat(from,QTOF,aRing));
     616    gmp_complex *res=new gmp_complex(numberFieldToFloat(from,QTOF));
    617617    return (number)res;
    618618  }

  • libpolys/coeffs/gnumpfl.cc

    r23ca7b7 r9d19c1  
    518518  assume( src->rep == n_rep_gap_rat );
    519519
    520   gmp_float *res=new gmp_float(numberFieldToFloat(from,QTOF,dst));
     520  gmp_float *res=new gmp_float(numberFieldToFloat(from,QTOF));
    521521  return (number)res;
    522522}

  • libpolys/coeffs/longrat0.cc

    r23ca7b7 r9d19c1  
    114114* write a rational number
    115115*/
    116 void nlWrite (number a, const coeffs r)
     116void nlWrite (number a, const coeffs)
    117117{
    118118  char *s,*z;

  • libpolys/coeffs/mpr_complex.cc

    r23ca7b7 r9d19c1  
    438438}
    439439
    440 gmp_float numberFieldToFloat( number num, int k, const coeffs src)
     440gmp_float numberFieldToFloat( number num, int cf)
    441441{
    442442  gmp_float r;
    443443
    444   switch (k)
     444  switch (cf)
    445445  {
    446446  case QTOF:

  • libpolys/coeffs/mpr_complex.h

    r23ca7b7 r9d19c1  
    168168
    169169gmp_float numberToFloat( number num, const coeffs src );
    170 gmp_float numberFieldToFloat( number num, int k, const coeffs src );
     170gmp_float numberFieldToFloat( number num, int src );
    171171//char *floatToStr( const gmp_float & r, const unsigned int oprec );
    172172//<-

  • libpolys/polys/ext_fields/algext.cc

    r23ca7b7 r9d19c1  
    15071507
    15081508#ifndef SINGULAR_4_1
    1509 BOOLEAN n2pInitChar(coeffs cf, void * infoStruct)
     1509BOOLEAN n2pInitChar(coeffs, void *)
    15101510{ return 1; }
    15111511#endif

  • libpolys/polys/monomials/degree.txt

    r23ca7b7 r9d19c1  
    3434OrdSgn: 1 for well orderings (i.e. 1 is the smallest monomial)
    3535        -1 otherwise
    36 MixedOrder: 0 for well orderings 
     36MixedOrder: 0 for well orderings
    3737         and local orderings (i.e. 1 is the largest monomial)
    3838        1 otherwise
Note: See TracChangeset for help on using the changeset viewer.