Changeset 69658e in git


Ignore:
Timestamp:
Feb 22, 2013, 12:29:35 AM (11 years ago)
Author:
Oleksandr Motsak <motsak@…>
Branches:
(u'spielwiese', 'd1b01e9d51ade4b46b745d3bada5c5f3696be3a8')
Children:
2e2c67897e034b7ffa5b8a0dda72431cff944d4a
Parents:
367df95c40f03bb94a871481eb198951b3a42c85cd4f243f3aafc7080a52fa973f2d90493e4847f2
Message:
Merge pull request #295 from YueRen/warnings

Warnings
Files:
75 edited

Legend:

Unmodified
Added
Removed

  • Singular/CacheImplementation.h

    r367df9 r69658e  
    7676
    7777template<class KeyClass, class ValueClass>
    78 ValueClass Cache<KeyClass, ValueClass>::getValue (const KeyClass& key) const
     78ValueClass Cache<KeyClass, ValueClass>::getValue (const KeyClass& /*key*/) const
    7979{
    8080  if (_itKey == _key.end())

  • Singular/MinorInterface.cc

    r367df9 r69658e  
    100100  /* containers for all upcoming results: */
    101101  IntMinorValue theMinor;
    102   int value = 0;
     102  // int value = 0;
    103103  int collectedMinors = 0;
    104104  int characteristic = 0; if (currRing != 0) characteristic = rChar(currRing);
    … …  
    323323  /* containers for all upcoming results: */
    324324  IntMinorValue theMinor;
    325   int value = 0;
     325  // int value = 0;
    326326  int collectedMinors = 0;
    327327  int characteristic = 0; if (currRing != 0) characteristic = rChar(currRing);
    … …  
    525525  bool b = false; /* Bareiss */
    526526  bool l = false; /* Laplace without caching */
    527   bool c = false; /* Laplace with caching */
     527  // bool c = false; /* Laplace with caching */
    528528  if (currRingIsOverIntegralDomain())
    529529  { /* the field case or ring Z */
    … …  
    541541      int minorCount = binom(rowCount, minorSize);
    542542      minorCount *= binom(columnCount, minorSize);
    543       if      ((minorSize >= 3) && (vars <= 4)
    544                && (minorCount >= 100))                           c = true;
    545       else if ((minorSize >= 3) && (vars >= 5)
    546                && (minorCount >= 40))                            c = true;
    547       else                                                       l = true;
     543      // if      ((minorSize >= 3) && (vars <= 4)
     544      //          && (minorCount >= 100))                           c = true;
     545      // else if ((minorSize >= 3) && (vars >= 5)
     546      //          && (minorCount >= 40))                            c = true;
     547      /*else*/                                                      l = true;
    548548    }
    549549  }

  • Singular/MinorProcessor.cc

    r367df9 r69658e  
    203203}
    204204
    205 bool MinorProcessor::isEntryZero (const int absoluteRowIndex,
    206                                   const int absoluteColumnIndex) const
     205bool MinorProcessor::isEntryZero (const int /*absoluteRowIndex*/,
     206                                  const int /*absoluteColumnIndex*/) const
    207207{
    208208  assume(false);

  • Singular/attrib.cc

    r367df9 r69658e  
    329329  return FALSE;
    330330}
    331 BOOLEAN atATTRIB3(leftv res,leftv v,leftv b,leftv c)
     331BOOLEAN atATTRIB3(leftv /*res*/,leftv v,leftv b,leftv c)
    332332{
    333333  idhdl h=(idhdl)v->data;
    … …  
    416416}
    417417
    418 BOOLEAN atKILLATTR1(leftv res,leftv a)
     418BOOLEAN atKILLATTR1(leftv /*res*/,leftv a)
    419419{
    420420  idhdl h=NULL;
    … …  
    433433  return FALSE;
    434434}
    435 BOOLEAN atKILLATTR2(leftv res,leftv a,leftv b)
     435BOOLEAN atKILLATTR2(leftv /*res*/,leftv a,leftv b)
    436436{
    437437  if ((a->rtyp!=IDHDL)||(a->e!=NULL))

  • Singular/blackbox.cc

    r367df9 r69658e  
    2222
    2323
    24 void blackbox_default_destroy(blackbox  *b, void *d)
     24void blackbox_default_destroy(blackbox */*b*/, void */*d*/)
    2525{
    2626  WerrorS("missing blackbox_destroy");
    2727}
    28 char *blackbox_default_String(blackbox *b,void *d)
     28char *blackbox_default_String(blackbox */*b*/,void */*d*/)
    2929{
    3030  WerrorS("missing blackbox_String");
    3131  return omStrDup("");
    3232}
    33 void *blackbox_default_Copy(blackbox *b,void *d)
     33void *blackbox_default_Copy(blackbox */*b*/,void */*d*/)
    3434{
    3535  WerrorS("missing blackbox_Copy");
    … …  
    4242  omFree(s);
    4343}
    44 void *blackbox_default_Init(blackbox *b)
     44void *blackbox_default_Init(blackbox */*b*/)
    4545{
    4646  return NULL;
    4747}
    4848
    49 BOOLEAN blackbox_default_serialize(blackbox *b, void *d, si_link f)
     49BOOLEAN blackbox_default_serialize(blackbox */*b*/, void */*d*/, si_link /*f*/)
    5050{
    5151  return TRUE;
    5252}
    5353
    54 BOOLEAN blackbox_default_deserialize(blackbox **b, void **d, si_link f)
     54BOOLEAN blackbox_default_deserialize(blackbox **/*b*/, void **/*d*/, si_link /*f*/)
    5555{
    5656  return TRUE;
    … …  
    8888}
    8989
    90 BOOLEAN blackboxDefaultOp2(int op,leftv l, leftv r1, leftv r2)
     90BOOLEAN blackboxDefaultOp2(int op,leftv /*l*/, leftv r1, leftv /*r2*/)
    9191{
    9292  return WrongOp("blackbox_Op2", op, r1);
    9393}
    9494
    95 BOOLEAN blackbox_default_Op3(int op,leftv l, leftv r1,leftv r2, leftv r3)
     95BOOLEAN blackbox_default_Op3(int op,leftv /*l*/, leftv r1,leftv /*r2*/, leftv /*r3*/)
    9696{
    9797  return WrongOp("blackbox_Op3", op, r1);

  • Singular/cntrlc.cc

    r367df9 r69658e  
    7676BOOLEAN singular_in_batchmode=FALSE;
    7777
    78 void sig_pipe_hdl(int sig)
     78void sig_pipe_hdl(int /*sig*/)
    7979{
    8080 if (pipeLastLink!=NULL)
    … …  
    8686}
    8787
    88 void sig_term_hdl(int sig)
     88void sig_term_hdl(int /*sig*/)
    8989{
    9090 while (ssiToBeClosed!=NULL)
    … …  
    320320*/
    321321int sigint_handler_cnt=0;
    322 void sigint_handler(int sig)
     322void sigint_handler(int /*sig*/)
    323323{
    324324  mflush();
    … …  
    572572}
    573573
    574 static void stack_trace_sigchld (int signum)
     574static void stack_trace_sigchld (int /*signum*/)
    575575{
    576576  stack_trace_done = 1;

  • Singular/countedref.cc

    r367df9 r69658e  
    187187/// We use the function pointer as a marker of reference types
    188188/// for CountedRef::is_ref(leftv), see the latter for details
    189 BOOLEAN countedref_CheckAssign(blackbox *b, leftv L, leftv R)
     189BOOLEAN countedref_CheckAssign(blackbox */*b*/, leftv /*L*/, leftv /*R*/)
    190190{
    191191  return FALSE;
    … …  
    350350
    351351/// blackbox support - convert to string representation
    352 void countedref_Print(blackbox *b, void* ptr)
     352void countedref_Print(blackbox */*b*/, void* ptr)
    353353{
    354354  if (ptr) (*CountedRef::cast(ptr))->Print();
    … …  
    357357
    358358/// blackbox support - convert to string representation
    359 char* countedref_String(blackbox *b, void* ptr)
     359char* countedref_String(blackbox */*b*/, void* ptr)
    360360{
    361361  if (ptr == NULL) return omStrDup(sNoName);
    … …  
    364364
    365365/// blackbox support - copy element
    366 void* countedref_Copy(blackbox*b, void* ptr)
     366void* countedref_Copy(blackbox*/*b*/, void* ptr)
    367367{
    368368  if (ptr) return CountedRef::cast(ptr).outcast();
    … …  
    478478
    479479/// blackbox support - destruction
    480 void countedref_destroy(blackbox *b, void* ptr)
     480void countedref_destroy(blackbox */*b*/, void* ptr)
    481481{
    482482  if (ptr) CountedRef::cast(ptr).destruct();
    … …  
    667667
    668668/// blackbox support - destruction
    669 void countedref_destroyShared(blackbox *b, void* ptr)
     669void countedref_destroyShared(blackbox */*b*/, void* ptr)
    670670{
    671671  if (ptr) CountedRefShared::cast(ptr).destruct();
    … …  
    673673
    674674
    675 BOOLEAN countedref_serialize(blackbox *b, void *d, si_link f)
     675BOOLEAN countedref_serialize(blackbox */*b*/, void *d, si_link f)
    676676{
    677677  sleftv l;
    … …  
    685685}
    686686
    687 BOOLEAN countedref_deserialize(blackbox **b, void **d, si_link f)
     687BOOLEAN countedref_deserialize(blackbox **/*b*/, void **d, si_link f)
    688688{
    689689  // rtyp must be set correctly (to the blackbox id) by routine calling

  • Singular/emacs.cc

    r367df9 r69658e  
    107107  char* singular = NULL;
    108108  char* emacs = NULL;
     109#ifndef TSINGULAR
    109110  char* emacs_dir = NULL;
    110111  char* emacs_load = NULL;
     112  char cwd[MAXPATHLEN];
     113#endif
    111114  int no_emacs_call = 0;
    112   char cwd[MAXPATHLEN];
    113115
    114116  // parse-cmdline options

  • Singular/fehelp.cc

    r367df9 r69658e  
    980980{
    981981  char sys[MAX_SYSCMD_LEN];
    982   char url[MAXPATHLEN];
     982  // char url[MAXPATHLEN];
    983983  const char *p=heHelpBrowsers[br].action;
    984984  if (p==NULL) {PrintS("no action ?\n"); return;}
    … …  
    10631063  }
    10641064  Print("running `%s`\n",sys);
    1065   int dummy=system(sys);
     1065  /*int dummy=*/ (void) system(sys);
    10661066}
    10671067
    … …  
    10981098#endif
    10991099
    1100 static BOOLEAN heDummyInit(int warn, int br)
     1100static BOOLEAN heDummyInit(int /*warn*/, int /*br*/)
    11011101{
    11021102  return TRUE;
    11031103}
    1104 static void heDummyHelp(heEntry hentry, int br)
     1104static void heDummyHelp(heEntry /*hentry*/, int /*br*/)
    11051105{
    11061106  Werror("No functioning help browser available.");
    11071107}
    11081108
    1109 static BOOLEAN heEmacsInit(int warn, int br)
     1109static BOOLEAN heEmacsInit(int /*warn*/, int /*br*/)
    11101110{
    11111111  return TRUE;
    11121112}
    1113 static void heEmacsHelp(heEntry hentry, int br)
     1113static void heEmacsHelp(heEntry hentry, int /*br*/)
    11141114{
    11151115  WarnS("Your help command could not be executed. Use");
    … …  
    11201120}
    11211121static int singular_manual(char *str);
    1122 static void heBuiltinHelp(heEntry hentry, int br)
     1122static void heBuiltinHelp(heEntry hentry, int /*br*/)
    11231123{
    11241124  char* node = omStrDup(hentry != NULL && *(hentry->node) != '\0' ?
    … …  
    12191219  while(!feof(index))
    12201220  {
    1221     char* dummy=fgets(buffer, BUF_LEN, index); /* */
     1221    // char* dummy=fgets(buffer, BUF_LEN, index); /* */
    12221222    (void)sscanf(buffer, "Node:%[^\177]\177%ld\n", Index, &offset);
    12231223    for(p=Index; *p; p++) *p = tolow(*p);/* */

  • Singular/fevoices.cc

    r367df9 r69658e  
    4040// this is an upper limit for the size of monomials/numbers read via the interpreter
    4141#define MAX_FILE_BUFFER 4*4096
    42 static long feBufferLength=INITIAL_PRINT_BUFFER;
     42// static long feBufferLength=INITIAL_PRINT_BUFFER;
    4343static char * feBuffer=(char *)omAlloc(INITIAL_PRINT_BUFFER);
    4444
    … …  
    407407* print echo (si_echo or TRACE), set my_yylinebuf
    408408*/
    409 static int fePrintEcho(char *anf, char *b)
     409static int fePrintEcho(char *anf, char */*b*/)
    410410{
    411411  char *ss=strrchr(anf,'\n');

  • Singular/fglm.cc

    r367df9 r69658e  
    288288
    289289    idhdl destRingHdl = currRingHdl;
    290     ring destRing = currRing;
     290    // ring destRing = currRing;
    291291    ideal destIdeal = NULL;
    292292    idhdl sourceRingHdl = (idhdl)first->data;
    293293    rSetHdl( sourceRingHdl );
    294     ring sourceRing = currRing;
     294    // ring sourceRing = currRing;
    295295
    296296    int * vperm = (int *)omAlloc0( (currRing->N+1)*sizeof( int ) );

  • Singular/interpolation.cc

    r367df9 r69658e  
    10411041#endif
    10421042
     1043#ifdef HAVE_FACTORY
     1044static modp_number TakePrime (modp_number /*p*/)  // takes "previous" (smaller) prime
     1045#else
    10431046static modp_number TakePrime (modp_number p)  // takes "previous" (smaller) prime
     1047#endif
    10441048{
    10451049#ifdef HAVE_FACTORY

  • Singular/iparith.cc

    r367df9 r69658e  
    25972597  return FALSE;
    25982598}
    2599 static BOOLEAN jjLOAD2(leftv res, leftv, leftv v)
     2599static BOOLEAN jjLOAD2(leftv /*res*/, leftv, leftv v)
    26002600{
    26012601  return jjLOAD((char*)v->Data(),TRUE);
    26022602}
    2603 static BOOLEAN jjLOAD_E(leftv res, leftv v, leftv u)
     2603static BOOLEAN jjLOAD_E(leftv /*res*/, leftv v, leftv u)
    26042604{
    26052605  char * s=(char *)u->Data();
    … …  
    44474447  return FALSE;
    44484448}
    4449 static BOOLEAN jjLOAD1(leftv res, leftv v)
     4449static BOOLEAN jjLOAD1(leftv /*res*/, leftv v)
    44504450{
    44514451  return jjLOAD((char*)v->Data(),FALSE);
    … …  
    48494849  }
    48504850  intvec *w=(intvec *)atGet(u,"isHomog",INTVEC_CMD);
    4851   tHomog hom=testHomog;
     4851  // tHomog hom=testHomog;
    48524852  ideal u_id=(ideal)u->Data();
    48534853  if (w!=NULL)
    … …  
    48614861    {
    48624862      w=ivCopy(w);
    4863       hom=isHomog;
     4863      // hom=isHomog;
    48644864    }
    48654865  }
    … …  
    59375937  return TRUE;
    59385938}
    5939 static BOOLEAN jjHOMOG_ID_W(leftv res, leftv u, leftv v, leftv w)
     5939static BOOLEAN jjHOMOG_ID_W(leftv res, leftv u, leftv v, leftv /*w*/)
    59405940{
    59415941  PrintS("TODO\n");
    … …  
    59555955  return (d!=1);
    59565956}
    5957 static BOOLEAN jjHOMOG_P_W(leftv res, leftv u, leftv v,leftv w)
     5957static BOOLEAN jjHOMOG_P_W(leftv res, leftv u, leftv v,leftv /*w*/)
    59585958{
    59595959  PrintS("TODO\n");

  • Singular/ipid.cc

    r367df9 r69658e  
    243243  idhdl h;
    244244  s=omStrDup(s);
    245   idhdl *save_root=root;
     245  // idhdl *save_root=root;
    246246  if (t==PACKAGE_CMD)
    247247  {
    … …  
    460460}
    461461
    462 idhdl ggetid(const char *n, BOOLEAN local, idhdl *packhdl)
     462idhdl ggetid(const char *n, BOOLEAN /*local*/, idhdl *packhdl)
    463463{
    464464  idhdl h = IDROOT->get(n,myynest);

  • Singular/iplib.cc

    r367df9 r69658e  
    279279    // load example
    280280    fseek(fp, pi->data.s.example_start, SEEK_SET);
    281     char *dummy=fgets(buf, sizeof(buf), fp); // skip line with "example"
     281    /*char *dummy=*/ (void) fgets(buf, sizeof(buf), fp); // skip line with "example"
    282282    procbuflen = pi->data.s.proc_end - pi->data.s.example_start - strlen(buf);
    283283    //Print("Example=%ld-%ld=%d\n", pi->data.s.proc_end,
    … …  
    755755  const char *suffix[] = { "", ".lib", ".so", ".sl", NULL };
    756756  int i = 0;
    757   FILE *fp;
    758   package pack;
    759   idhdl packhdl;
     757  // FILE *fp;
     758  // package pack;
     759  // idhdl packhdl;
    760760  lib_types LT;
    761761  for(i=0; suffix[i] != NULL; i++)
    … …  
    828828{
    829829  char libnamebuf[128];
    830   procinfov pi;
    831   idhdl h;
     830  // procinfov pi;
     831  // idhdl h;
    832832  idhdl pl;
    833   idhdl hl;
    834   long pos = 0L;
     833  // idhdl hl;
     834  // long pos = 0L;
    835835  char *plib = iiConvName(newlib);
    836836  FILE * fp = feFopen( newlib, "r", libnamebuf, tellerror );
    837   int lines = 1;
     837  // int lines = 1;
    838838  BOOLEAN LoadResult = TRUE;
    839839
    … …  
    906906    int save=yylineno;
    907907    myynest++;
    908     procinfo *pi=(procinfo*)IDDATA(h);
     908    // procinfo *pi=(procinfo*)IDDATA(h);
    909909    //PrintS("mod_init found\n");
    910910    iiMake_proc(h,p,NULL);
    … …  
    11781178                               BOOLEAN pstatic,
    11791179                               BOOLEAN(*func)(leftv res, leftv v)));
    1180   SModulFunc_t fktn;
     1180  // SModulFunc_t fktn;
    11811181  idhdl pl;
    11821182  char *plib = iiConvName(newlib);
    1183   BOOLEAN RET=TRUE;
    1184   int token;
     1183  // BOOLEAN RET=TRUE;
     1184  // int token;
    11851185
    11861186  pl = IDROOT->get(plib,0);
    … …  
    13701370/*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*/
    13711371#ifdef HAVE_LIBPARSER
    1372 void libstack::push(char *p, char *libn)
     1372void libstack::push(char */*p*/, char *libn)
    13731373{
    13741374  libstackv lp;
    … …  
    13911391}
    13921392
    1393 libstackv libstack::pop(char *p)
     1393libstackv libstack::pop(char */*p*/)
    13941394{
    13951395  libstackv ls = this;

  • Singular/ipprint.cc

    r367df9 r69658e  
    303303  if (print)
    304304  {
    305     BOOLEAN r=FALSE;
     305    // BOOLEAN r=FALSE;
    306306    leftv h=u;
    307307    leftv hh;

  • Singular/janet.cc

    r367df9 r69658e  
    3333
    3434//------GLOBALS-------
    35 static int m_s,v_s,vectorized,VarN1,offset;
     35static int /*m_s,v_s,vectorized,VarN1,*/offset;
    3636static jList *T,*Q;
    3737static TreeM *G;
    38 static Poly *phD;
     38// static Poly *phD;
    3939static NodeM *FreeNodes;
    4040static int degree_compatible;
    … …  
    193193{
    194194  Poly *f;
    195   int g1,f1,gg;
     195  // int g1,f1,gg;
    196196
    197197  if ((f=is_div_(F,p->lead))==NULL) return;
    … …  
    246246
    247247  //if (TEST_OPT_PROT) { PrintS("R"); mflush(); }
    248   int old_size, count;
     248  int /*old_size, */count;
    249249  count=0;
    250250  while(f && p->root)
    … …  
    301301}
    302302
    303 int ValidatePoly(Poly *x, TreeM *F)
    304 {
    305   Poly *f,*g;
    306   int g1,f1;
     303int ValidatePoly(Poly *x, TreeM */*F*/)
     304{
     305  Poly /*f,*/*g;
     306  // int g1,f1;
    307307
    308308  if (x->root) return 1;
    … …  
    971971}
    972972
    973 static Poly *h,*f;
     973static Poly *h/*,*f*/;
    974974
    975975void insert_in_G(Poly *x)
    … …  
    998998int ComputeBasis(jList *_lT,jList *_lQ)
    999999{
    1000   int gb_l,i,ret_value=1;
     1000  // int gb_l,i,ret_value=1;
    10011001
    10021002  T=_lT; Q=_lQ;

  • Singular/links/asciiLink.cc

    r367df9 r69658e  
    3535
    3636/* =============== ASCII ============================================= */
    37 BOOLEAN slOpenAscii(si_link l, short flag, leftv h)
     37BOOLEAN slOpenAscii(si_link l, short flag, leftv /*h*/)
    3838{
    3939  const char *mode;

  • Singular/links/ndbm.cc

    r367df9 r69658e  
    150150{
    151151  register int i;
    152   datum item;
     152  // datum item;
    153153
    154154  if (dbm_error(db))

  • Singular/links/pipeLink.cc

    r367df9 r69658e  
    3838
    3939//**************************************************************************/
    40 BOOLEAN pipeOpen(si_link l, short flag, leftv u)
     40BOOLEAN pipeOpen(si_link l, short flag, leftv /*u*/)
    4141{
    4242  pipeInfo *d=(pipeInfo*)omAlloc0(sizeof(pipeInfo));
    … …  
    166166    else
    167167    {
    168       fd_set  mask, fdmask;
     168      fd_set  mask/*, fdmask*/;
    169169      struct timeval wt;
    170170      /* Don't block. Return socket status immediately. */

  • Singular/links/sing_dbm.cc

    r367df9 r69658e  
    285285
    286286//**************************************************************************/
    287 LINKAGE BOOLEAN dbOpen(si_link l, short flag, leftv u)
     287LINKAGE BOOLEAN dbOpen(si_link l, short flag, leftv /*u*/)
    288288{
    289289  const char *mode = "r";

  • Singular/links/ssiLink.cc

    r367df9 r69658e  
    284284}
    285285
    286 void ssiWritePoly(ssiInfo *d, int typ, poly p)
     286void ssiWritePoly(ssiInfo *d, int /*typ*/, poly p)
    287287{
    288288  SSI_BLOCK_CHLD;
    289289  fprintf(d->f_write,"%d ",pLength(p));//number of terms
    290290  SSI_UNBLOCK_CHLD;
    291   int i;
     291  int j;
    292292
    293293  while(p!=NULL)
    … …  
    298298    fprintf(d->f_write,"%ld ",p_GetComp(p,d->r));//component
    299299
    300     for(int j=1;j<=rVar(d->r);j++)
     300    for(j=1;j<=rVar(d->r);j++)
    301301    {
    302302      fprintf(d->f_write,"%ld ",p_GetExp(p,j,d->r ));//x^j
    … …  
    416416  l=s_readint(d->f_read);
    417417  buf=(char*)omAlloc0(l+1);
    418   int c =s_getc(d->f_read); /* skip ' '*/
    419   int ll=s_readbytes(buf,l,d->f_read);
     418  /*int c =*/ (void) s_getc(d->f_read); /* skip ' '*/
     419  /*int ll=*/ (void) s_readbytes(buf,l,d->f_read);
    420420  //if (ll!=l) printf("want %d, got %d bytes\n",l,ll);
    421421  buf[l]='\0';
    … …  
    528528{
    529529/* syntax is <ch> <N> <l1> <v1> ...<lN> <vN> <number of orderings> <ord1> <block0_1> <block1_1> .... */
    530   int ch, N,i,l;
     530  int ch, N,i/*,l*/;
    531531  char **names;
    532532  ch=s_readint(d->f_read);
    … …  
    585585  //Print("poly: terms:%d\n",n);
    586586  poly p;
    587   int j;
    588   j=0;
     587  // int j;
     588  // j=0;
    589589  poly ret=NULL;
    590590  poly prev=NULL;
    … …  
    748748{
    749749  ssiInfo *d=(ssiInfo*)l->data;
    750   int throwaway=s_readint(d->f_read);
     750  /*int throwaway=*/ (void) s_readint(d->f_read);
    751751  char *name=ssiReadString(d);
    752752  int tok;
    … …  
    891891        int sockfd, newsockfd, portno, clilen;
    892892        struct sockaddr_in serv_addr, cli_addr;
    893         int n;
     893        // int n;
    894894        sockfd = socket(AF_INET, SOCK_STREAM, 0);
    895895        if(sockfd < 0)
    … …  
    952952        int sockfd, newsockfd, portno, clilen;
    953953        struct sockaddr_in serv_addr, cli_addr;
    954         int n;
     954        // int n;
    955955        sockfd = socket(AF_INET, SOCK_STREAM, 0);
    956956        if(sockfd < 0)
    … …  
    10341034      {
    10351035        char* host = (char*)omAlloc(256);
    1036         int sockfd, portno, n;
     1036        int sockfd, portno/*, n*/;
    10371037        struct sockaddr_in serv_addr;
    10381038        struct hostent *server;
    … …  
    14851485  && (strcmp(request, "read") == 0))
    14861486  {
    1487     fd_set  mask, fdmask;
     1487    fd_set  mask/*, fdmask*/;
    14881488    struct timeval wt;
    14891489    if (s_isready(d->f_read)) return "ready";
    … …  
    18101810  }
    18111811  int portno;
    1812   int n;
     1812  // int n;
    18131813  ssiReserved_sockfd = socket(AF_INET, SOCK_STREAM, 0);
    18141814  if(ssiReserved_sockfd < 0)
    … …  
    19121912**/
    19131913/*---------------------------------------------------------------------*/
    1914 void sig_chld_hdl(int sig)
     1914void sig_chld_hdl(int /*sig*/)
    19151915{
    19161916  pid_t kidpid;

  • Singular/mmstd.c

    r367df9 r69658e  
    3434void freeSize(void* addr, size_t size)
    3535{
     36  (void) size;
    3637  if (addr) free(addr);
    3738}

  • Singular/newstruct.cc

    r367df9 r69658e  
    494494}
    495495
    496 void newstruct_destroy(blackbox *b, void *d)
     496void newstruct_destroy(blackbox */*b*/, void *d)
    497497{
    498498  if (d!=NULL)
    … …  
    518518}
    519519
    520 BOOLEAN newstruct_CheckAssign(blackbox *b, leftv L, leftv R)
     520BOOLEAN newstruct_CheckAssign(blackbox */*b*/, leftv L, leftv R)
    521521{
    522522  int lt=L->Typ();
    … …  
    570570}
    571571
    572 BOOLEAN newstruct_deserialize(blackbox **b, void **d, si_link f)
     572BOOLEAN newstruct_deserialize(blackbox **/*b*/, void **d, si_link f)
    573573{
    574574  // newstruct is serialiazed as a list,

  • Singular/pyobject_setup.cc

    r367df9 r69658e  
    3636}
    3737
    38 void pyobject_default_destroy(blackbox  *b, void *d)
     38void pyobject_default_destroy(blackbox  */*b*/, void */*d*/)
    3939{
    4040  Werror("Python-based functionality not available!");

  • Singular/utils.cc

    r367df9 r69658e  
    108108
    109109/*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*/
    110 void main_result(char *libname)
     110void main_result(char */*libname*/)
    111111{
    112112  if(!found_info)    printf("*** No info-string found!\n");
    … …  
    158158void printpi(procinfov pi)
    159159{
    160   char *buf, name[256];
    161   int len1, len2;
     160  // char *buf, name[256];
     161  // int len1, len2;
    162162  /* pi->libname is badly broken -- use file, instead */
    163163  FILE *fp = fopen( lib_file, "rb");

  • dyn_modules/bigintm/bigintm.cc

    r367df9 r69658e  
    3030
    3131#ifdef HAVE_BIGINTM
    32 static char * bigintm_String(blackbox *b, void *d)
     32static char * bigintm_String(blackbox */*b*/, void *d)
    3333{ if (d==NULL) return omStrDup("oo");
    3434   else
    … …  
    3939    }
    4040}
    41 static void * bigintm_Copy(blackbox*b, void *d)
     41static void * bigintm_Copy(blackbox*/*b*/, void *d)
    4242{  number n=(number)d; return n_Copy(n, coeffs_BIGINT); }
    4343
    … …  
    4646  assume( l->Typ() == bigintm_type_id );
    4747 
    48   blackbox *ll=getBlackboxStuff(l->Typ());
     48  // blackbox *ll=getBlackboxStuff(l->Typ());
    4949 
    5050  if (r->Typ()>MAX_TOK)
    … …  
    5252    if (bigintm_type_id == r->Typ())
    5353    {
    54       blackbox *rr=getBlackboxStuff(r->Typ());
     54      // blackbox *rr=getBlackboxStuff(r->Typ());
    5555     
    5656      if (l->Data()!=NULL) { number n1=(number)l->Data(); n_Delete(&n1,coeffs_BIGINT); }
    … …  
    126126  assume( a1->Typ() == bigintm_type_id );
    127127 
    128   blackbox *a=getBlackboxStuff(a1->Typ());
     128  // blackbox *a=getBlackboxStuff(a1->Typ());
    129129  number n1=(number)a1->Data();
    130130  switch(op)
    … …  
    287287}
    288288
    289 static void bigintm_destroy(blackbox *b, void *d)
     289static void bigintm_destroy(blackbox */*b*/, void *d)
    290290{
    291291  if (d!=NULL)

  • dyn_modules/syzextra/mod_main.cc

    r367df9 r69658e  
    819819static BOOLEAN reduce_syz(leftv res, leftv h)
    820820{
    821   const ring r = currRing;
     821  // const ring r = currRing;
    822822
    823823  if ( !( (h!=NULL) && (h->Typ()==VECTOR_CMD || h->Typ()==POLY_CMD) ) )

  • dyn_modules/syzextra/myNF.cc

    r367df9 r69658e  
    218218  // only global: avoid normalization, return a multiply of NF
    219219  poly   p;
    220   int   i;
     220  // int   i;
    221221
    222222  //if ((idIs0(F))&&(Q==NULL))

  • factory/libfac/charset/alg_factor.cc

    r367df9 r69658e  
    398398
    399399// the heart of the algorithm: the one from Trager
     400#ifndef DEBUGOUTPUT
     401static CFFList
     402alg_factor( const CanonicalForm & f, const CFList & Astar, const Variable & vminpoly, const Varlist /*& oldord*/, const CFList & as)
     403#else
    400404static CFFList
    401405alg_factor( const CanonicalForm & f, const CFList & Astar, const Variable & vminpoly, const Varlist & oldord, const CFList & as)
     406#endif
    402407{
    403408  CFFList L, Factorlist;

  • kernel/fast_maps.cc

    r367df9 r69658e  
    135135static omBin macoeffBin = omGetSpecBin(sizeof(macoeff_s));
    136136
    137 mapoly maMonomial_Create(poly p, ring r_p, sBucket_pt bucket)
     137mapoly maMonomial_Create(poly p, ring /*r_p*/, sBucket_pt bucket)
    138138{
    139139  mapoly mp = (mapoly) omAlloc0Bin(mapolyBin);
    … …  
    320320*/
    321321
    322 ideal maIdeal_2_Ideal(maideal m_id, ring dest_r)
     322ideal maIdeal_2_Ideal(maideal m_id, ring /*dest_r*/)
    323323{
    324324  ideal res = idInit(m_id->n, 1);
    … …  
    354354{
    355355  ring src_r, dest_r;
    356   ideal dest_id, res_id;
     356  ideal dest_id/*, res_id*/;
    357357  int length = 0;
    358358  BOOLEAN no_sort;

  • kernel/fast_mult.cc

    r367df9 r69658e  
    482482  return p;
    483483}
    484 static void buildTermAndAdd(int n,number* facult,poly* f_terms,int* exp,int f_len,kBucket_pt erg_bucket,ring r, number coef, poly & zw, poly tmp, poly** term_pot){
     484static void buildTermAndAdd(int /*n*/,number* /*facult*/,poly* /*f_terms*/,int* exp,int f_len,kBucket_pt /*erg_bucket*/,ring r, number coef, poly & zw, poly /*tmp*/, poly** term_pot){
    485485
    486486  int i;

  • kernel/feread.cc

    r367df9 r69658e  
    397397/* ===================================================================*/
    398398/* dummy (for batch mode): */
    399 char * fe_fgets_dummy(const char *pr,char *s, int size)
     399char * fe_fgets_dummy(const char */*pr*/,char */*s*/, int /*size*/)
    400400{
    401401  return NULL;

  • kernel/fglmgauss.cc

    r367df9 r69658e  
    7373gaussReducer::~gaussReducer()
    7474{
    75     int k;
    76 
    7775#ifndef HAVE_EXPLICIT_CONSTR
    7876    delete [] elems;
    7977#else
     78    int k;
    8079    for ( k= size; k > 0; k-- )
    8180        elems[k].~gaussElem();
    … …  
    159158{
    160159    // fglmASSERT( size < max );
    161     number fac;
     160    // number fac;
    162161    // find the pivot-element in v:
    163162

  • kernel/fglmzero.cc

    r367df9 r69658e  
    609609
    610610void
    611 internalCalculateFunctionals( const ideal & theIdeal, idealFunctionals & l,
     611internalCalculateFunctionals( const ideal /*& theIdeal*/, idealFunctionals & l,
    612612                              fglmSdata & data )
    613613{

  • kernel/gr_kstd2.cc

    r367df9 r69658e  
    968968#endif
    969969
     970#ifdef HAVE_RATGRING
    970971void nc_gr_initBba(ideal F, kStrategy strat)
     972#else
     973void nc_gr_initBba(ideal, kStrategy strat)
     974#endif
    971975{
    972976  assume(rIsPluralRing(currRing));
    973977
    974   int i;
     978  // int i;
    975979//  idhdl h;
    976980 /* setting global variables ------------------- */
    … …  
    10701074  assume(currRing->OrdSgn != -1); // no mora!!! it terminates only for global ordering!!! (?)
    10711075
    1072   intvec *w=NULL;
    1073   intvec *hilb=NULL;
     1076  // intvec *w=NULL;
     1077  // intvec *hilb=NULL;
    10741078  int   olddeg,reduc;
    10751079  int red_result=1;
    1076   int hilbeledeg=1,hilbcount=0,minimcnt=0;
     1080  int /*hilbeledeg=1,*/hilbcount=0/*,minimcnt=0*/;
    10771081
    10781082  initBuchMoraCrit(strat); /*set Gebauer, honey, sugarCrit*/

  • kernel/hdegree.cc

    r367df9 r69658e  
    923923{
    924924  int  iv = Nvar -1, k = var[Nvar], a, a0, a1, b, i;
    925   int  x, x0;
     925  int  x/*, x0*/;
    926926  scmon pn;
    927927  scfmon sn;
    … …  
    958958  {
    959959    a0 = a;
    960     x0 = x;
     960    // x0 = x;
    961961    hStepS(sn, Nstc, var, Nvar, &a, &x);
    962962    hElimS(sn, &b, a0, a, var, iv);

  • kernel/hilb.cc

    r367df9 r69658e  
    213213
    214214static intvec * hSeries(ideal S, intvec *modulweight,
    215                 int notstc, intvec *wdegree, ideal Q, ring tailRing)
     215                int /*notstc*/, intvec *wdegree, ideal Q, ring tailRing)
    216216{
    217217  intvec *work, *hseries1=NULL;

  • kernel/ideals.cc

    r367df9 r69658e  
    939939             BOOLEAN isSB, BOOLEAN divide, matrix *unit)
    940940{
    941   int lsmod =id_RankFreeModule(submod,currRing), i, j, k;
     941  int lsmod =id_RankFreeModule(submod,currRing), j, k;
    942942  int comps_to_add=0;
    943943  poly p;
    … …  
    16461646poly idMinor(matrix a, int ar, unsigned long which, ideal R)
    16471647{
    1648   int     i,j,k,size;
     1648  int     i,j/*,k,size*/;
    16491649  unsigned long curr;
    16501650  int *rowchoise,*colchoise;
    16511651  BOOLEAN rowch,colch;
    1652   ideal result;
     1652  // ideal result;
    16531653  matrix tmp;
    16541654  poly p,q;
    … …  
    16591659  rowchoise=(int *)omAlloc(ar*sizeof(int));
    16601660  colchoise=(int *)omAlloc(ar*sizeof(int));
    1661   if ((i>512) || (j>512) || (i*j >512)) size=512;
    1662   else size=i*j;
    1663   result=idInit(size,1);
     1661  // if ((i>512) || (j>512) || (i*j >512)) size=512;
     1662  // else size=i*j;
     1663  // result=idInit(size,1);
    16641664  tmp=mpNew(ar,ar);
    1665   k = 0; /* the index in result*/
     1665  // k = 0; /* the index in result*/
    16661666  curr = 0; /* index of current minor */
    16671667  idInitChoise(ar,1,a->rows(),&rowch,rowchoise);
    … …  
    17141714ideal idMinors(matrix a, int ar, ideal R)
    17151715{
    1716   int     i,j,k,size;
     1716  int     i,j,/*k,*/size;
    17171717  int *rowchoise,*colchoise;
    17181718  BOOLEAN rowch,colch;
    … …  
    17301730  result=idInit(size,1);
    17311731  tmp=mpNew(ar,ar);
    1732   k = 0; /* the index in result*/
     1732  // k = 0; /* the index in result*/
    17331733  idInitChoise(ar,1,a->rows(),&rowch,rowchoise);
    17341734  while (!rowch)

  • kernel/kInline.h

    r367df9 r69658e  
    11671167// dummy function for function pointer strat->rewCrit being usable in all
    11681168// possible choices for criteria
    1169 KINLINE BOOLEAN arriRewDummy(poly /*sig*/, unsigned long /*not_sevSig*/, kStrategy /*strat*/, int start=0)
     1169KINLINE BOOLEAN arriRewDummy(poly /*sig*/, unsigned long /*not_sevSig*/, kStrategy /*strat*/, int /*start=0*/)
    11701170{
    11711171  return FALSE;

  • kernel/kspoly.cc

    r367df9 r69658e  
    171171int ksReducePolySig(LObject* PR,
    172172                 TObject* PW,
    173                  long idx,
     173                 long /*idx*/,
    174174                 poly spNoether,
    175175                 number *coef,
    … …  
    394394  poly a1 = pNext(p1), a2 = pNext(p2);
    395395  number lc1 = pGetCoeff(p1), lc2 = pGetCoeff(p2);
    396   int co=0, ct = ksCheckCoeff(&lc1, &lc2, currRing->cf); // gcd and zero divisors
     396  int co=0/*, ct = ksCheckCoeff(&lc1, &lc2, currRing->cf)*/; // gcd and zero divisors
     397  (void) ksCheckCoeff(&lc1, &lc2, currRing->cf);
    397398
    398399  int l1=0, l2=0;

  • kernel/kstd1.cc

    r367df9 r69658e  
    515515    {
    516516      /*- remember the found T-poly -*/
    517       poly pi = strat->T[j].p;
     517      // poly pi = strat->T[j].p;
    518518      int ei = strat->T[j].ecart;
    519519      int li = strat->T[j].length;
    … …  
    538538          * the polynomial to reduce with is now;
    539539          */
    540           pi = strat->T[j].p;
     540          // pi = strat->T[j].p;
    541541          ei = strat->T[j].ecart;
    542542          li = strat->T[j].length;
    … …  
    10411041}
    10421042
    1043 void initBba(ideal F,kStrategy strat)
     1043void initBba(ideal /*F*/,kStrategy strat)
    10441044{
    10451045 /* setting global variables ------------------- */
    … …  
    24682468  int   olddeg,reduc;
    24692469  BOOLEAN withT = FALSE;
    2470   BOOLEAN toReset=FALSE;
     2470  // BOOLEAN toReset=FALSE;
    24712471  kStrategy strat=new skStrategy;
    24722472  tHomog h;
    … …  
    24992499      strat->pOrigLDeg = currRing->pLDeg;
    25002500      pSetDegProcs(currRing,kModDeg);
    2501       toReset = TRUE;
     2501      // toReset = TRUE;
    25022502    }
    25032503    strat->LazyPass*=2;

  • kernel/kstd2.cc

    r367df9 r69658e  
    197197  int a_ind2 = ind2(a);
    198198
    199   NATNUMBER k = 1;
     199  // NATNUMBER k = 1;
    200200  // of interest is only k_ind2, special routine for improvement ... TODO OLIVER
    201201  for (int i = 1; i <= leadRing->N; i++)
    … …  
    303303  if (strat->tl<0) return 1;
    304304
    305   int at,i;
     305  int at/*,i*/;
    306306  long d;
    307307  int j = 0;
    308308  int pass = 0;
    309   poly zeroPoly = NULL;
     309  // poly zeroPoly = NULL;
    310310
    311311// TODO warum SetpFDeg notwendig?
    … …  
    390390  int i,j,at,pass, ii;
    391391  unsigned long not_sev;
    392   long reddeg,d;
     392  // long reddeg,d;
    393393
    394394  pass = j = 0;
    395   d = reddeg = h->GetpFDeg();
     395  // d = reddeg = h->GetpFDeg();
    396396  h->SetShortExpVector();
    397397  int li;
    … …  
    530530  int sigSafe;
    531531  unsigned long not_sev;
    532   long reddeg,d;
     532  // long reddeg,d;
    533533
    534534  pass = j = 0;
    535   d = reddeg = h->GetpFDeg();
     535  // d = reddeg = h->GetpFDeg();
    536536  h->SetShortExpVector();
    537537  int li;
    … …  
    15161516  long zeroreductions = 0;
    15171517  LObject L;
    1518   BOOLEAN withT     = FALSE;
     1518  // BOOLEAN withT     = FALSE;
    15191519  strat->max_lower_index = 0;
    15201520
    … …  
    15371537
    15381538  // redtailBBa against T for inhomogenous input
    1539   if (!TEST_OPT_OLDSTD)
    1540     withT = ! strat->homog;
     1539  // if (!TEST_OPT_OLDSTD)
     1540  //   withT = ! strat->homog;
    15411541
    15421542  // strat->posInT = posInT_pLength;
    … …  
    29982998}
    29992999
    3000 void initBbaShift(ideal F,kStrategy strat)
     3000void initBbaShift(ideal /*F*/,kStrategy strat)
    30013001{
    30023002 /* setting global variables ------------------- */

  • kernel/kstdfac.cc

    r367df9 r69658e  
    161161kStrategy kStratCopy(kStrategy o)
    162162{
    163   int i;
     163  // int i;
    164164  assume(kTest_TS(o));
    165165  kStrategy s=new skStrategy;
    … …  
    545545}
    546546
    547 ideal bbafac (ideal F, ideal Q,intvec *w,kStrategy strat, ideal_list FL)
     547ideal bbafac (ideal /*F*/, ideal Q,intvec */*w*/,kStrategy strat, ideal_list FL)
    548548{
    549549  int   olddeg,reduc=0;

  • kernel/kutil.cc

    r367df9 r69658e  
    395395void HEckeTest (poly pp,kStrategy strat)
    396396{
    397   int   j,k,p;
     397  int   j,/*k,*/p;
    398398
    399399  strat->kHEdgeFound=FALSE;
    … …  
    410410    //  return FALSE;
    411411  }
    412   k = 0;
     412  // k = 0;
    413413  p=pIsPurePower(pp);
    414414  if (p!=0) strat->NotUsedAxis[p] = FALSE;
    … …  
    635635
    636636  poly p = T->p;
    637   ring r = currRing;
     637  // ring r = currRing;
    638638
    639639  if (T->p == NULL && T->t_p == NULL && i >= 0)
    … …  
    651651      if (msg != NULL)
    652652        return dReportError("%c[%d] %s", TN, i, msg);
    653       r = T->tailRing;
     653      // r = T->tailRing;
    654654      p = T->t_p;
    655655    }
    … …  
    657657    {
    658658      p = T->t_p;
    659       r = T->tailRing;
     659      // r = T->tailRing;
    660660    }
    661661    if (T->t_p != NULL && i >= 0 && TN == 'T')
    … …  
    846846{
    847847  int i, j;
    848   BOOLEAN ret = TRUE;
     848  // BOOLEAN ret = TRUE;
    849849  kFalseReturn(kTest(strat));
    850850
    … …  
    17311731*/
    17321732
     1733#ifdef DEBUGF5
    17331734void enterOnePairSig (int i, poly p, poly pSig, int from, int ecart, int isFromQ, kStrategy strat, int atR = -1)
     1735#else
     1736void enterOnePairSig (int i, poly p, poly pSig, int, int ecart, int isFromQ, kStrategy strat, int atR = -1)
     1737#endif
    17341738{
    17351739  assume(i<=strat->sl);
    … …  
    17401744              // the corresponding signatures for criteria checks
    17411745  LObject  Lp;
    1742   poly last;
     1746  // poly last;
    17431747  poly pSigMult = p_Copy(pSig,currRing);
    17441748  poly sSigMult = p_Copy(strat->sig[i],currRing);
    … …  
    23382342*using the chain-criterion in B and L and enters B to L
    23392343*/
    2340 void chainCritSig (poly p,int ecart,kStrategy strat)
     2344void chainCritSig (poly p,int /*ecart*/,kStrategy strat)
    23412345{
    23422346  int i,j,l;
    … …  
    44704474*/
    44714475int posInLSig (const LSet set, const int length,
    4472             LObject* p,const kStrategy strat)
     4476               LObject* p,const kStrategy /*strat*/)
    44734477{
    44744478if (length<0) return 0;
    … …  
    44994503* still in strat->L!
    45004504*/
    4501 int posInLF5C (const LSet set, const int length,
    4502             LObject* p,const kStrategy strat)
     4505int posInLF5C (const LSet /*set*/, const int /*length*/,
     4506               LObject* /*p*/,const kStrategy strat)
    45034507{
    45044508  return strat->Ll+1;
    … …  
    50465050//        critical pair. In this situation we can discard the critical pair
    50475051//        completely.
    5048 BOOLEAN arriRewCriterion(poly sig, unsigned long /*not_sevSig*/, kStrategy strat, int start=0)
     5052BOOLEAN arriRewCriterion(poly /*sig*/, unsigned long /*not_sevSig*/, kStrategy strat, int /*start=0*/)
    50495053{
    50505054  //printf("Arri Rewritten Criterion\n");
    … …  
    80908094}
    80918095
    8092 ring sbaRing (kStrategy strat, const ring r, BOOLEAN complete, int sgn)
     8096ring sbaRing (kStrategy strat, const ring r, BOOLEAN /*complete*/, int /*sgn*/)
    80938097{
    80948098  int n = rBlocks(r); // Including trailing zero!
    … …  
    88288832  int j;
    88298833
    8830   poly q, s;
     8834  poly q/*, s*/;
    88318835
    88328836  // for the 0th shift: insert the orig. pair

  • kernel/linearAlgebra.cc

    r367df9 r69658e  
    10811081/* helper for qrDoubleShift */
    10821082bool qrDS(
    1083        const int n,
     1083       const int /*n*/,
    10841084       matrix* queue,
    10851085       int& queueL,

  • kernel/preimage.cc

    r367df9 r69658e  
    7878 
    7979  int i,j;
    80   poly p,pp,q;
     80  poly p,/*pp,*/q;
    8181  ideal temp1;
    8282  ideal temp2;

  • kernel/sca.cc

    r367df9 r69658e  
    375375
    376376// Under development!!!
    377 ideal sca_bba (const ideal F, const ideal Q, const intvec *w, const intvec * /*hilb*/, kStrategy strat, const ring _currRing)
     377ideal sca_bba (const ideal F, const ideal Q, const intvec */*w*/, const intvec * /*hilb*/, kStrategy strat, const ring _currRing)
    378378{
    379379  const ring save = currRing;
    … …  
    867867
    868868// returns TRUE if mora should use buckets, false otherwise
     869#ifdef MORA_USE_BUCKETS
    869870static BOOLEAN kMoraUseBucket(kStrategy strat)
     871#else
     872static BOOLEAN kMoraUseBucket(kStrategy)
     873#endif
    870874{
    871875#ifdef MORA_USE_BUCKETS
    … …  
    898902
    899903// ideal sca_mora (ideal F, ideal Q, intvec *w, intvec *, kStrategy strat)
    900 ideal sca_mora(const ideal F, const ideal Q, const intvec *w, const intvec *, kStrategy strat, const ring _currRing)
     904ideal sca_mora(const ideal F, const ideal Q, const intvec */*w*/, const intvec *, kStrategy strat, const ring _currRing)
    901905{
    902906  const ring save = currRing;

  • kernel/syz.cc

    r367df9 r69658e  
    222222void syGaussForOne(ideal syz, int elnum, int ModComp,int from,int till)
    223223{
    224   int k,j,i,lu;
     224  int /*k,j,i,*/lu;
    225225  poly unit1,unit2;
    226226  poly actWith=syz->m[elnum];
    … …  
    249249static void syDeleteAbove1(ideal up, int k)
    250250{
    251   poly p,pp;
     251  poly p/*,pp*/;
    252252  if (up!=NULL)
    253253  {

  • kernel/syz0.cc

    r367df9 r69658e  
    173173  if (Fl==0) return result;
    174174
    175   int i,j,l,k,totalToRed,ecartToRed,kk,kkk;
     175  int i,j,l,k,totalToRed,ecartToRed,kk;
    176176  int bestEcart,totalmax,rkF,Sl=0,smax,tmax,tl;
    177177  int *ecartS, *ecartT, *totalS,
    178178    *totalT=NULL, *temp=NULL;
    179   polyset pairs,S,T,ST,oldF;
     179  polyset pairs,S,T,ST/*,oldF*/;
    180180  poly p,q,toRed;
    181181  BOOLEAN notFound = FALSE;
    … …  
    342342#else
    343343          l = (**modcomp)[pGetComp(toRed)];
    344           kkk = (**modcomp)[pGetComp(toRed)+1];
     344          int kkk = (**modcomp)[pGetComp(toRed)+1];
    345345          while ((l<kkk) && (notFound))
    346346#endif
    … …  
    509509  while ((Fl!=0) && (arg->m[Fl-1]==NULL)) Fl--;
    510510  ideal result=idInit(16,Fl);
    511   int i,j,l,k,kkk,rkF,Sl=0,syComponentOrder=currRing->ComponentOrder;
    512   int fstart,wend,lini,ltR,gencQ=0;
     511  int i,j,l,k,kkk,/*rkF,*/Sl=0,syComponentOrder=currRing->ComponentOrder;
     512  int /*fstart,*/wend,lini,ltR,gencQ=0;
    513513  intvec *newmodcomp;
    514514  int *Flength;
    515515  polyset pairs,F=arg->m,*Shdl=&(result->m);
    516   poly p,q,toRed,syz,lastmonom,multWith;
     516  poly /*p,*/q,toRed,syz,lastmonom,multWith;
    517517  BOOLEAN isNotReduced=TRUE;
    518518
    … …  
    536536    pairs=(polyset)omAlloc0((Fl+gencQ)*sizeof(poly));
    537537  }
    538   rkF=id_RankFreeModule(arg,currRing);
     538  // rkF=id_RankFreeModule(arg,currRing);
    539539  Flength = (int*)omAlloc0(Fl*sizeof(int));
    540540  for(j=0;j<Fl;j++)
    … …  
    577577        {
    578578          number an=nCopy(pGetCoeff(F[k])),bn=nCopy(pGetCoeff(F[j]));
    579           int ct = ksCheckCoeff(&an, &bn, currRing->cf);
     579          /*int ct =*/ (void) ksCheckCoeff(&an, &bn, currRing->cf);
    580580          syz = pCopy(pairs[k]);
    581581          //syz->coef = nCopy(F[k]->coef);
    … …  
    862862
    863863resolvente sySchreyerResolvente(ideal arg, int maxlength, int * length,
    864                                 BOOLEAN isMonomial, BOOLEAN notReplace)
     864                                BOOLEAN isMonomial, BOOLEAN /*notReplace*/)
    865865{
    866866  ideal mW=NULL;
    867867  int i,syzIndex = 0,j=0;
    868868  intvec * modcomp=NULL,*w=NULL;
    869   int ** wv=NULL;
     869  // int ** wv=NULL;
    870870  tHomog hom=(tHomog)idHomModule(arg,NULL,&w);
    871871  ring origR = currRing;
    … …  
    10171017  if (fr==NULL) return NULL;
    10181018
    1019   int typ0;
     1019  // int typ0;
    10201020  syStrategy result=(syStrategy)omAlloc0(sizeof(ssyStrategy));
    10211021  result->length=rl;

  • kernel/syz1.cc

    r367df9 r69658e  
    988988* puts a pair into the right place in resPairs
    989989*/
    990 void syEnterPair(SSet sPairs, SObject * so, int * sPlength,int index)
     990void syEnterPair(SSet sPairs, SObject * so, int * sPlength,int /*index*/)
    991991{
    992992  int ll,k,no=(*so).order,sP=*sPlength,i;

  • kernel/syz3.cc

    r367df9 r69658e  
    112112            ideal old_repr,int old_tl, poly next_generator,resolvente totake)
    113113{
    114   int index=syzstr->length-1,i,j,start,start_ttk,new_tl;
     114  int index=syzstr->length-1,i,j,start,start_ttk/*,new_tl*/;
    115115  poly gen=pCopy(next_generator),p;
    116116  poly neg_gen=pCopy(next_generator);
    … …  
    237237* only for tests
    238238*/
     239#ifdef NDEBUG
     240static void syTestPairs(SSet resPairs,int length,ideal /*old_generators*/)
     241#else
    239242static void syTestPairs(SSet resPairs,int length,ideal old_generators)
     243#endif
    240244{
    241245  int i=0;
    … …  
    517521  int i=IDELEMS(red)-1,num_mon,num_tail;
    518522  poly h,hn;
    519   BOOLEAN dummy;
     523  // BOOLEAN dummy;
    520524 
    521525  while ((i>0) && (red->m[i-1]==NULL)) i--;
    … …  
    530534    {
    531535      kBucketInit(syzstr->syz_bucket,hn,num_tail);
    532       dummy = syRedSyz(syzstr->syz_bucket,red,crit_comp,gen_length);
     536      /*dummy =*/ (void) syRedSyz(syzstr->syz_bucket,red,crit_comp,gen_length);
    533537      kBucketClear(syzstr->syz_bucket,&hn,&num_tail);
    534538      pNext(h) = hn;
    … …  
    548552      {
    549553        kBucketInit(syzstr->syz_bucket,hn,num_tail);
    550         dummy = syRedSyz(syzstr->syz_bucket,sec_red,crit_comp,secgen_length);
     554        /*dummy =*/ (void) syRedSyz(syzstr->syz_bucket,sec_red,crit_comp,secgen_length);
    551555        kBucketClear(syzstr->syz_bucket,&hn,&num_tail);
    552556        pNext(h) = hn;
    … …  
    656660  int toReplace=0;
    657661  int i,j,syz_l;
    658   number coefgcd,n;
     662  number /*coefgcd,*/n;
    659663  polyset ogm=old_generators->m;
    660664  poly p;
    … …  
    941945  int * ogm_l=(int*)omAlloc0(IDELEMS(syzstr->res[index])*sizeof(int));
    942946  int * orp_l=(int*)omAlloc0(IDELEMS(syzstr->orderedRes[index])*sizeof(int));
    943   int t1=IDELEMS(syzstr->res[index]),t2=IDELEMS(syzstr->orderedRes[index]);
     947  // int t1=IDELEMS(syzstr->res[index]),t2=IDELEMS(syzstr->orderedRes[index]);
    944948 
    945949  for (j=IDELEMS(syzstr->res[index])-1;j>=0;j--)
    … …  
    10491053* updates the pairs inthe higher modules
    10501054*/
    1051 static void updatePairsHIndex(SSet *resPairs,int *l_pairs,syStrategy syzstr,
    1052        int index,ideal add_generators,ideal add_repr,ideal new_generators,
    1053        ideal new_repr,int crit_comp,int* first_new)
     1055static void updatePairsHIndex(SSet *resPairs,int *l_pairs,syStrategy /*syzstr*/,
     1056       int index,ideal add_generators,ideal /*add_repr*/,ideal /*new_generators*/,
     1057       ideal /*new_repr*/,int /*crit_comp*/,int* first_new)
    10541058{
    10551059  int i=*first_new,l=*l_pairs,j,ll,j1,add_idel=IDELEMS(add_generators);
    … …  
    11731177* reduction of a single pair in the higher moduls
    11741178*/
     1179#ifdef SHOW_PROT
    11751180static void redOnePairHIndex(SSet resPairs,int itso, int crit_comp,
    11761181            syStrategy syzstr,int index,ideal add_generators, ideal add_repr,
    11771182            ideal new_generators, ideal new_repr,int * next_place_add,int ** g_l,
    11781183            poly deg_soc)
     1184#else
     1185static void redOnePairHIndex(SSet resPairs,int itso, int crit_comp,
     1186            syStrategy syzstr,int /*index*/,ideal add_generators, ideal add_repr,
     1187            ideal new_generators, ideal new_repr,int * next_place_add,int ** g_l,
     1188            poly deg_soc)
     1189#endif
    11791190{
    11801191  SObject tso = resPairs[itso];
    … …  
    14011412* reduction which is normalized afterwards
    14021413*/
    1403 static void procedeNextGenerators(ideal temp_generators,ideal temp_repr,
     1414static void procedeNextGenerators(ideal temp_generators,ideal /*temp_repr*/,
    14041415      ideal new_generators, ideal new_repr, ideal add_generators,
    14051416      ideal add_repr, syStrategy syzstr,int index, int crit_comp,
    … …  
    15331544*/
    15341545static ideal normalizeOldPart(ideal new_generators,ideal new_repr,
    1535                       syStrategy syzstr,int index,int crit_comp)
     1546                      syStrategy syzstr,int index,int /*crit_comp*/)
    15361547{
    15371548  ideal old_generators= syzstr->res[index];
    … …  
    17531764syStrategy syKosz(ideal arg,int * length)
    17541765{
    1755   int i,j,jj,k=0,index=0,rk_arg,next_syz=0;
     1766  int i,j,jj,k=0,index=0,rk_arg/*,next_syz=0*/;
    17561767  int crit_comp,t_comp,next_deg,old_tl;
    17571768  ideal temp=NULL,old_ideal,old_repr;

  • kernel/tgb.cc

    r367df9 r69658e  
    485485}
    486486
    487 wlen_type pELength (poly p, slimgb_alg * c, ring r)
     487wlen_type pELength (poly p, slimgb_alg * c, ring /*r*/)
    488488{
    489489  if(p == NULL)
    … …  
    508508}
    509509
    510 wlen_type kEBucketLength (kBucket * b, poly lm, int sugar, slimgb_alg * ca)
     510wlen_type kEBucketLength (kBucket * b, poly lm, int /*sugar*/, slimgb_alg * ca)
    511511{
    512512  wlen_type s = 0;
    … …  
    36223622
    36233623ideal
    3624 do_t_rep_gb (ring r, ideal arg_I, int syz_comp, BOOLEAN F4_mode, int deg_pos)
     3624do_t_rep_gb (ring /*r*/, ideal arg_I, int syz_comp, BOOLEAN F4_mode, int deg_pos)
    36253625{
    36263626  //  Print("QlogSize(0) %d, QlogSize(1) %d,QlogSize(-2) %d, QlogSize(5) %d\n", QlogSize(nlInit(0)),QlogSize(nlInit(1)),QlogSize(nlInit(-2)),QlogSize(nlInit(5)));
    … …  
    39793979
    39803980static BOOLEAN
    3981 pair_better (sorted_pair_node * a, sorted_pair_node * b, slimgb_alg * c)
     3981pair_better (sorted_pair_node * a, sorted_pair_node * b, slimgb_alg * /*c*/)
    39823982{
    39833983  if(a->deg < b->deg)
    … …  
    41824182
    41834183static void
    4184 multi_reduction_lls_trick (red_object * los, int losl, slimgb_alg * c,
     4184multi_reduction_lls_trick (red_object * los, int /*losl*/, slimgb_alg * c,
    41854185                           find_erg & erg)
    41864186{
    … …  
    45044504
    45054505static void
    4506 canonicalize_region (red_object * los, int l, int u, slimgb_alg * c)
     4506canonicalize_region (red_object * los, int l, int u, slimgb_alg * /*c*/)
    45074507{
    45084508  assume (l <= u + 1);
    … …  
    45144514}
    45154515
     4516#ifdef NDEBUG
     4517static void
     4518multi_reduction_find (red_object * los, int /*losl*/, slimgb_alg * c, int startf,
     4519                      find_erg & erg)
     4520#else
    45164521static void
    45174522multi_reduction_find (red_object * los, int losl, slimgb_alg * c, int startf,
    45184523                      find_erg & erg)
     4524#endif
    45194525{
    45204526  kStrategy strat = c->strat;
    … …  
    46314637}
    46324638
    4633 static void sort_region_down (red_object * los, int l, int u, slimgb_alg * c)
     4639static void sort_region_down (red_object * los, int l, int u, slimgb_alg * /*c*/)
    46344640{
    46354641  int r_size = u - l + 1;
    … …  
    48904896}
    48914897
    4892 void reduction_step::reduce (red_object * r, int l, int u)
     4898void reduction_step::reduce (red_object * /*r*/, int /*l*/, int /*u*/)
    48934899{
    48944900}
    … …  
    50655071}
    50665072
    5067 void simple_reducer::pre_reduce (red_object * r, int l, int u)
    5068 {
    5069 }
     5073void simple_reducer::pre_reduce (red_object * /*r*/, int /*l*/, int /*u*/)
     5074{
     5075}

  • kernel/tgb_internal.h

    r367df9 r69658e  
    658658  }
    659659  #endif
    660   DataNoroCacheNode<number_type>* insertAndTransferOwnerShip(poly t, ring r)
     660  DataNoroCacheNode<number_type>* insertAndTransferOwnerShip(poly t, ring /*r*/)
    661661  {
    662662    ressources.push_back(t);
    … …  
    919919return res;
    920920}
     921#ifdef NDEBUG
     922template <class number_type> void add_coef_times_sparse(number_type* const temp_array,
     923int /*temp_size*/,SparseRow<number_type>* row, number coef)
     924#else
    921925template <class number_type> void add_coef_times_sparse(number_type* const temp_array,
    922926int temp_size,SparseRow<number_type>* row, number coef)
     927#endif
    923928{
    924929  int j;
    … …  
    960965  }
    961966}
     967#ifdef NDEBUG
     968template <class number_type> void add_coef_times_dense(number_type* const temp_array,
     969int /*temp_size*/,const number_type* row, int len,number coef)
     970#else
    962971template <class number_type> void add_coef_times_dense(number_type* const temp_array,
    963972int temp_size,const number_type* row, int len,number coef)
     973#endif
    964974{
    965975  int j;
    … …  
    10011011  }
    10021012}
     1013#ifdef NDEBUG
     1014template <class number_type> void add_dense(number_type* const temp_array,
     1015int /*temp_size*/,const number_type* row, int len)
     1016#else
    10031017template <class number_type> void add_dense(number_type* const temp_array,
    10041018int temp_size,const number_type* row, int len)
     1019#endif
    10051020{
    10061021  //int j;
    … …  
    10201035
    10211036}
     1037#ifdef NDEBUG
     1038template <class number_type> void sub_dense(number_type* const temp_array,
     1039int /*temp_size*/,const number_type* row, int len)
     1040#else
    10221041template <class number_type> void sub_dense(number_type* const temp_array,
    10231042int temp_size,const number_type* row, int len)
     1043#endif
    10241044{
    10251045  //int j;
    … …  
    10411061}
    10421062
     1063#ifdef NDEBUG
     1064template <class number_type> void add_sparse(number_type* const temp_array,int /*temp_size*/,SparseRow<number_type>* row)
     1065#else
    10431066template <class number_type> void add_sparse(number_type* const temp_array,int temp_size,SparseRow<number_type>* row)
     1067#endif
    10441068{
    10451069  int j;
    … …  
    10551079        }
    10561080}
     1081#ifdef NDEBUG
     1082template <class number_type> void sub_sparse(number_type* const temp_array,int /*temp_size*/,SparseRow<number_type>* row)
     1083#else
    10571084template <class number_type> void sub_sparse(number_type* const temp_array,int temp_size,SparseRow<number_type>* row)
     1085#endif
    10581086{
    10591087  int j;

  • kernel/tgbgauss.cc

    r367df9 r69658e  
    125125}
    126126
    127 void simple_gauss(tgb_sparse_matrix* mat, slimgb_alg* c)
     127void simple_gauss(tgb_sparse_matrix* mat, slimgb_alg* /*c*/)
    128128{
    129129  int col, row;
    … …  
    225225      {
    226226        assume(mat->min_col_not_zero_in_row(i)>=col);
    227         int first;
    228227        assume(row_cache[i]==mat->min_col_not_zero_in_row(i));
    229         first=row_cache[i];
     228#ifndef NDEBUG
     229        int first=row_cache[i];
    230230        assume(first!=matcol);
     231#endif
    231232        //      if((!(mat->is_zero_entry(i,col)))&&(mat->non_zero_entries(i)<act_l))
    232233        int nz;
    … …  
    260261      assume(col_area_index<=max_area_index);
    261262      assume(mat->min_col_not_zero_in_row(i)>=col);
    262       int first;
    263263      assume(row_cache[i]==mat->min_col_not_zero_in_row(i));
    264       first=row_cache[i];
     264#ifndef NDEBUG
     265      int first=row_cache[i];
    265266      assume(first!=matcol);
     267#endif
    266268      if(row_cache[i]==col)
    267269      {

  • libpolys/coeffs/bigintmat.h

    r367df9 r69658e  
    146146    /// replace an entry with the given number n (only delete old).
    147147    /// NOTE: starts at [0]
     148#ifdef NDEBUG
     149    inline void rawset(int i, number n, const coeffs /*C = NULL*/)
     150#else
    148151    inline void rawset(int i, number n, const coeffs C = NULL)
     152#endif
    149153    {
    150154      assume (C == NULL || C == basecoeffs());

  • libpolys/coeffs/coeffs.h

    r367df9 r69658e  
    592592/// test whether n is a correct number;
    593593/// only used if LDEBUG is defined
     594#ifdef LDEBUG
    594595static inline BOOLEAN n_DBTest(number n, const char *filename, const int linenumber, const coeffs r)
     596#else
     597static inline BOOLEAN n_DBTest(number, const char*, const int, const coeffs)
     598#endif
    595599{
    596600  assume(r != NULL);

  • libpolys/coeffs/gnumpc.cc

    r367df9 r69658e  
    698698}
    699699
    700 void    ngcCoeffWrite  (const coeffs r, BOOLEAN details)
     700void    ngcCoeffWrite  (const coeffs r, BOOLEAN /*details*/)
    701701{
    702702  Print("//   characteristic : 0 (complex:%d digits, additional %d digits)\n",

  • libpolys/coeffs/rintegers.cc

    r367df9 r69658e  
    279279}
    280280
    281 nMapFunc nrzSetMap(const coeffs src, const coeffs dst)
     281nMapFunc nrzSetMap(const coeffs src, const coeffs /*dst*/)
    282282{
    283283  /* dst = currRing */

  • libpolys/polys/clapsing.cc

    r367df9 r69658e  
    14151415}
    14161416
    1417 int singclap_det_i( intvec * m, const ring r)
     1417int singclap_det_i( intvec * m, const ring /*r*/)
    14181418{
    14191419//  assume( r == currRing ); // Anything else is not guaranted to work!

  • libpolys/polys/ext_fields/algext.cc

    r367df9 r69658e  
    972972{
    973973  if (n_IsZero(a, src)) return NULL;
    974   int p = rChar(dst->extRing);
     974  // int p = rChar(dst->extRing);
    975975
    976976  number q = nlModP(a, src, dst->extRing->cf);

  • libpolys/polys/ext_fields/transext.cc

    r367df9 r69658e  
    15391539  assume( n_Test(a, src) );
    15401540  if (n_IsZero(a, src)) return NULL;
    1541   int p = rChar(dst->extRing);
     1541  // int p = rChar(dst->extRing);
    15421542  number q = nlModP(a, src, dst->extRing->cf);
    15431543
    … …  
    16941694  return (number)result;
    16951695}
    1696 CanonicalForm ntConvSingNFactoryN( number n, BOOLEAN setChar, const coeffs cf )
     1696CanonicalForm ntConvSingNFactoryN( number n, BOOLEAN /*setChar*/, const coeffs cf )
    16971697{
    16981698  ntTest(n);

  • libpolys/polys/mod_raw.cc

    r367df9 r69658e  
    6262  struct stat sb;
    6363  int nbytes = 0;
    64   int ret;
     64  // int ret;
    6565  lib_types LT=LT_NONE;
    6666
    6767  FILE * fp = feFopen( newlib, "r", libnamebuf, FALSE );
    68   ret = stat(libnamebuf, &sb);
     68  /*ret =*/ (void) stat(libnamebuf, &sb);
    6969
    7070  if (fp==NULL)

  • libpolys/polys/monomials/p_polys.h

    r367df9 r69658e  
    657657static inline poly p_New(const ring r, omBin bin)
    658658#else
    659 static inline poly p_New(const ring r, omBin bin)
     659static inline poly p_New(const ring /*r*/, omBin bin)
    660660#endif
    661661{

  • libpolys/polys/monomials/ring.cc

    r367df9 r69658e  
    16831683    return FALSE;
    16841684
    1685   int i, j;
     1685  int i/*, j*/;
    16861686
    16871687  if (r1 == r2) return TRUE;

  • libpolys/polys/nc/ncSACache.cc

    r367df9 r69658e  
    2727#endif
    2828
     29#if OUTPUT
    2930namespace
    3031{
    3132  static const char* m_Typenames[2] = {"lookup", "store"};
    3233}
     34#endif
    3335
    3436#include <coeffs/numbers.h>
    … …  
    4143
    4244
    43 
     45#if OUTPUT
    4446void CGlobalCacheHash::History(const EHistoryType t, const CGlobalCacheHash::CExponent a, const CGlobalCacheHash::CExponent b, const poly p)
     47#else
     48void CGlobalCacheHash::History(const EHistoryType, const CGlobalCacheHash::CExponent, const CGlobalCacheHash::CExponent, const poly)
     49#endif
    4550{
    4651#if OUTPUT
    … …  
    5762
    5863
     64#if OUTPUT
    5965void  CSpecialPairCacheHash::History(const EHistoryType t, const CSpecialPairCacheHash::CExponent a, const CSpecialPairCacheHash::CExponent b, const poly p)
     66#else
     67void  CSpecialPairCacheHash::History(const EHistoryType, const CSpecialPairCacheHash::CExponent, const CSpecialPairCacheHash::CExponent, const poly)
     68#endif
    6069{
    6170#if OUTPUT

  • libpolys/polys/nc/ncSACache.h

    r367df9 r69658e  
    8787    };
    8888   
    89     virtual void History(const EHistoryType , const CExponent a, const CExponent b, const poly p = NULL)
     89    virtual void History(const EHistoryType , const CExponent /*a*/, const CExponent /*b*/, const poly /*p = NULL*/)
    9090    {
    9191      PrintS("CCacheHash::History(a, b, [p])!\n");

  • libpolys/polys/nc/old.gring.cc

    r367df9 r69658e  
    33383338  /* shift defines the position of a subring in srcRing */
    33393339  /* par_shift defines the position of a subfield in basefield of CurrRing */
    3340 poly p_CopyEmbed(poly p, ring srcRing, int shift, int par_shift, ring dstRing)
     3340poly p_CopyEmbed(poly p, ring srcRing, int shift, int /*par_shift*/, ring dstRing)
    33413341{
    33423342  if (dstRing == srcRing)

  • libpolys/polys/operations/pShallowCopyDelete.cc

    r367df9 r69658e  
    4646}
    4747
    48 pShallowCopyDeleteProc pGetShallowCopyDeleteProc(ring source_r, ring dest_r)
     48pShallowCopyDeleteProc pGetShallowCopyDeleteProc(ring /*source_r*/, ring /*dest_r*/)
    4949{
    5050  return pShallowCopyDelete_General;

  • libpolys/polys/templates/p_Procs_Set.h

    r367df9 r69658e  
    198198void p_Debug_GetSpecNames(const ring r, const char* &field, const char* &length, const char* &ord)
    199199{
    200   p_Field     e_field = p_FieldIs(r);
    201   p_Length    e_length = p_LengthIs(r);
    202   p_Ord       e_ord = p_OrdIs(r);
     200  /*p_Field     e_field =*/ (void) p_FieldIs(r);
     201  /*p_Length    e_length =*/ (void) p_LengthIs(r);
     202  /*p_Ord       e_ord =*/ (void) p_OrdIs(r);
    203203
    204204  field  = p_FieldEnum_2_String(p_FieldIs(r));

  • libpolys/reporter/dError.cc

    r367df9 r69658e  
    5050#ifdef HAVE_EXECINFO_H
    5151#define SIZE 50
    52   void *buffer[SIZE+1]; int i, j, k, ret, status; char **ptr; char *demangledName; char *s; char *ss;
     52  void *buffer[SIZE+1]; int ret;
    5353#endif
    5454
    … …  
    7373  backtrace_symbols_fd(buffer, ret, STDERR_FILENO); // execinfo.h
    7474#else
    75   ptr = backtrace_symbols( buffer, ret ); // execinfo.h
     75  char **ptr = backtrace_symbols( buffer, ret ); // execinfo.h
    7676
    77   for (i = 0; i < ret; i++)
     77  int status;
     78  char *demangledName;
     79  char *s;
     80  char *ss;
     81  for (int i = 0; i < ret; i++)
    7882  {
    7983    status = -1;

  • numeric/mpr_base.cc

    r367df9 r69658e  
    17391739ideal resMatrixSparse::getMatrix()
    17401740{
    1741   int i,j,cp;
     1741  int i,/*j,*/cp;
    17421742  poly pp,phelp,piter,pgls;
    17431743
    … …  
    18611861{
    18621862  int i,cp;
    1863   poly pp,phelp,piter;
     1863  poly pp,phelp/*,piter*/;
    18641864
    18651865  mprPROTnl("smCallDet");
    … …  
    18701870    pDelete( &pp );
    18711871    phelp= NULL;
    1872     piter= NULL;
     1872    // piter= NULL;
    18731873    for ( cp= 2; cp <= idelem; cp++ )
    18741874    { // u1 .. un
    … …  
    30723072rootContainer ** uResultant::specializeInU( BOOLEAN matchUp, const number subDetVal )
    30733073{
    3074   int i,p,uvar;
     3074  int i,/*p,*/uvar;
    30753075  long tdg;
    30763076  poly pures,piter;
    … …  
    30923092  // now we evaluate D(u0,-1,0,...0), D(u0,0,-1,0,...,0), ..., D(u0,0,..,0,-1)
    30933093  // or D(u0,k1,k2,0,...,0), D(u0,k1,k2,k3,0,...,0), ..., D(u0,k1,k2,k3,...,kn)
    3094   p=3;
     3094  // p=3;
    30953095  for ( uvar= 0; uvar < loops; uvar++ )
    30963096  {
    … …  
    32063206  simplex * LP;
    32073207  int i;
    3208   int n,totverts,idelem;
     3208  int /*n,*/totverts,idelem;
    32093209  ideal idr;
    32103210
    3211   n= (currRing->N);
     3211  // n= (currRing->N);
    32123212  idelem= IDELEMS(id);  // should be n+1
    32133213

  • numeric/mpr_base.h

    r367df9 r69658e  
    3232  virtual ideal getSubMatrix() { return NULL; }
    3333
    34   virtual poly getUDet( const number* evpoint ) { return NULL; }
     34  virtual poly getUDet( const number* /*evpoint*/ ) { return NULL; }
    3535
    36   virtual number getDetAt( const number* evpoint ) { return NULL; }
     36  virtual number getDetAt( const number* /*evpoint*/ ) { return NULL; }
    3737  virtual number getSubDet() { return NULL; }
    3838

  • numeric/mpr_inout.cc

    r367df9 r69658e  
    105105//-> mprState mprIdealCheck()
    106106mprState mprIdealCheck( const ideal theIdeal,
    107                         const char * name,
     107                        const char * /*name*/,
    108108                        uResultant::resMatType mtype,
    109109                        BOOLEAN rmatrix )
    110110{
    111111  mprState state = mprOk;
    112   int power;
     112  // int power;
    113113  int k;
    114114

  • numeric/mpr_numeric.cc

    r367df9 r69658e  
    116116{
    117117  int j;
    118   long i,c,sum;
     118  long i,/*c,*/sum;
    119119
    120120  poly pnew,pit=NULL;
    121121
    122   c=0;
     122  // c=0;
    123123  sum=0;
    124124
Note: See TracChangeset for help on using the changeset viewer.