ipid.cc
Go to the documentation of this file.
1 /****************************************
2 * Computer Algebra System SINGULAR *
3 ****************************************/
4 
5 /*
6 * ABSTRACT: identfier handling
7 */
8 
9 
10 
11 
12 
13 #include <kernel/mod2.h>
14 
15 #include <omalloc/omalloc.h>
16 
17 #include <misc/options.h>
18 #include <misc/intvec.h>
19 
20 #include <coeffs/numbers.h>
21 #include <coeffs/bigintmat.h>
22 
23 #include <polys/matpol.h>
24 #include <polys/monomials/ring.h>
25 
26 #include <kernel/polys.h>
27 #include <kernel/ideals.h>
28 #include <kernel/GBEngine/syz.h>
29 
30 #include <Singular/tok.h>
31 #include <Singular/ipshell.h>
32 #include <Singular/fevoices.h>
33 #include <Singular/lists.h>
34 #include <Singular/attrib.h>
35 #include <Singular/links/silink.h>
36 #include <Singular/ipid.h>
37 #include <Singular/blackbox.h>
38 #include <Singular/number2.h>
39 
40 #ifdef SINGULAR_4_1
41 #include <Singular/number2.h>
42 #endif
43 #ifdef HAVE_DYNAMIC_LOADING
44 #include <polys/mod_raw.h>
45 #endif /* HAVE_DYNAMIC_LOADING */
46 
47 #include <string.h>
48 
51 //omBin ip_package_bin = omGetSpecBin(sizeof(ip_package));
53 
55 
56 FILE *feFilePending; /*temp. storage for grammar.y */
57 
59 //idhdl idroot = NULL;
60 
63 package currPack =NULL;
64 package basePack =NULL;
66 const char* iiNoName="_";
67 
68 void paCleanUp(package pack);
69 
70 /*0 implementation*/
71 
72 int iiS2I(const char *s)
73 {
74  int i;
75  i=s[0];
76  if (s[1]!='\0')
77  {
78  i=(i<<8)+s[1];
79  if (s[2]!='\0')
80  {
81  i=(i<<8)+s[2];
82  if (s[3]!='\0')
83  {
84  i=(i<<8)+s[3];
85  }
86  }
87  }
88  return i;
89 }
90 
91 idhdl idrec::get(const char * s, int level)
92 {
93  assume(s!=NULL);
94  assume((level>=0) && (level<=1000)); //not really, but if it isnt in that bounds..
95  idhdl h = this;
97  int l;
98  const char *id_;
99  int i=iiS2I(s);
100  int less4=(i < (1<<24));
101  while (h!=NULL)
102  {
103  omCheckAddr((ADDRESS)IDID(h));
104  l=IDLEV(h);
105  if ((l==0)||(l==level))
106  {
107  if (i==h->id_i)
108  {
109  id_=IDID(h);
110  if (less4 || (0 == strcmp(s+4,id_+4)))
111  {
112  if (l==level) return h;
113  found=h;
114  }
115  }
116  }
117  h = IDNEXT(h);
118  }
119  return found;
120 }
121 
122 //idrec::~idrec()
123 //{
124 // if (id!=NULL)
125 // {
126 // omFree((ADDRESS)id);
127 // id=NULL;
128 // }
129 // /* much more !! */
130 //}
131 
132 void *idrecDataInit(int t)
133 {
134  switch (t)
135  {
136  //the type with init routines:
137 #ifdef SINGULAR_4_2
138  case CNUMBER_CMD:
139  return (void*)n2Init(0,NULL);
140  case CPOLY_CMD:
141  return (void*)p2Init(0,NULL);
142  case CMATRIX_CMD:
143 #endif
144  case BIGINTMAT_CMD:
145  return (void *)new bigintmat();
146  case INTVEC_CMD:
147  case INTMAT_CMD:
148  return (void *)new intvec();
149  case NUMBER_CMD:
150  return (void *) nInit(0);
151  case BIGINT_CMD:
152  return (void *) n_Init(0, coeffs_BIGINT);
153  case IDEAL_CMD:
154  case MODUL_CMD:
155  case MATRIX_CMD:
156  return (void*) idInit(1,1);
157  case MAP_CMD:
158  {
159  map m = (map)idInit(1,1);
160  m->preimage = omStrDup(IDID(currRingHdl));
161  return (void *)m;
162  }
163  case STRING_CMD:
164  return (void *)omAlloc0(1);
165  case LIST_CMD:
166  {
168  l->Init();
169  return (void*)l;
170  }
171  //the types with the standard init: set the struct to zero
172  case LINK_CMD:
173  return (void*) omAlloc0Bin(sip_link_bin);
174  case RING_CMD:
175  return NULL;
176  case PACKAGE_CMD:
177  {
178  package pa=(package)omAlloc0Bin(sip_package_bin);
179  pa->language=LANG_NONE;
180  pa->loaded = FALSE;
181  return (void*)pa;
182  }
183  case PROC_CMD:
184  {
186  pi->ref=1;
187  pi->language=LANG_NONE;
188  return (void*)pi;
189  }
190  case RESOLUTION_CMD:
191  return (void *)omAlloc0(sizeof(ssyStrategy));
192  //other types: without init (int,script,poly,def,package)
193  #ifdef SINGULAR_4_1
194  case CRING_CMD:
195  #endif
196  case INT_CMD:
197  case DEF_CMD:
198  case POLY_CMD:
199  case VECTOR_CMD:
200  case QRING_CMD:
201  return (void*)0L;
202  default:
203  {
204  if (t>MAX_TOK)
205  {
206 #ifdef BLACKBOX_DEVEL
207  Print("bb-type %d\n",t);
208 #endif
209  blackbox *bb=getBlackboxStuff(t);
210  if (bb!=NULL)
211  return (void *)bb->blackbox_Init(bb);
212  }
213  else
214  Werror("unknown type in idrecDataInit:%d",t);
215  break;
216  }
217  }
218  return (void *)0L;
219 }
220 idhdl idrec::set(const char * s, int level, int t, BOOLEAN init)
221 {
222  //printf("define %s, %x, level: %d, typ: %d\n", s,s,level,t);
223  idhdl h = (idrec *)omAlloc0Bin(idrec_bin);
224  IDID(h) = s;
225  IDTYP(h) = t;
226  IDLEV(h) = level;
227  IDNEXT(h) = this;
228  BOOLEAN at_start=(this==IDROOT);
229  h->id_i=iiS2I(s);
230  if (init)
231  {
232  if ((t==IDEAL_CMD)||(t==MODUL_CMD))
233  IDFLAG(h) = Sy_bit(FLAG_STD);
234  IDSTRING(h)=(char *)idrecDataInit(t);
235  // additional settings:--------------------------------------
236 #if 0
237  // this leads to a memory leak
238  if (t == QRING_CMD)
239  {
240  // IDRING(h)=rCopy(currRing);
241  /* QRING_CMD is ring dep => currRing !=NULL */
242  }
243 #endif
244  }
245  // --------------------------------------------------------
246  if (at_start)
247  IDNEXT(h) = IDROOT;
248  return h;
249 }
250 
251 char * idrec::String(BOOLEAN typed)
252 {
253  sleftv tmp;
254  memset(&tmp,0,sizeof(sleftv));
255  tmp.rtyp=IDTYP(this);
256  tmp.data=IDDATA(this);
257  tmp.name=IDID(this);
258  return tmp.String(NULL, typed);
259 }
260 
261 idhdl enterid(const char * s, int lev, int t, idhdl* root, BOOLEAN init, BOOLEAN search)
262 {
263  if (s==NULL) return NULL;
264  if (root==NULL) return NULL;
265  idhdl h;
266  s=omStrDup(s);
267  // idhdl *save_root=root;
268  if (t==PACKAGE_CMD)
269  {
270  if (root!=&(basePack->idroot))
271  {
272  root=&(basePack->idroot);
273  }
274  }
275  // is it already defined in root ?
276  if ((h=(*root)->get(s,lev))!=NULL)
277  {
278  if (IDLEV(h)==lev)
279  {
280  if ((IDTYP(h) == t)||(t==DEF_CMD))
281  {
282  if (IDTYP(h)==PACKAGE_CMD)
283  {
284  if (strcmp(s,"Top")==0)
285  {
286  goto errlabel;
287  }
288  else return *root;
289  }
290  else
291  {
292  if (BVERBOSE(V_REDEFINE))
293  Warn("redefining %s (%s)",s,my_yylinebuf);
294  if (s==IDID(h)) IDID(h)=NULL;
295  killhdl2(h,root,currRing);
296  }
297  }
298  else
299  goto errlabel;
300  }
301  }
302  // is it already defined in currRing->idroot ?
303  else if (search && (currRing!=NULL)&&((*root) != currRing->idroot))
304  {
305  if ((h=currRing->idroot->get(s,lev))!=NULL)
306  {
307  if (IDLEV(h)==lev)
308  {
309  if ((IDTYP(h) == t)||(t==DEF_CMD))
310  {
311  if (BVERBOSE(V_REDEFINE))
312  Warn("redefining %s (%s)",s,my_yylinebuf);
313  if (s==IDID(h)) IDID(h)=NULL;
314  killhdl2(h,&currRing->idroot,currRing);
315  }
316  else
317  goto errlabel;
318  }
319  }
320  }
321  // is it already defined in idroot ?
322  else if (search && (*root != IDROOT))
323  {
324  if ((h=IDROOT->get(s,lev))!=NULL)
325  {
326  if (IDLEV(h)==lev)
327  {
328  if ((IDTYP(h) == t)||(t==DEF_CMD))
329  {
330  if (BVERBOSE(V_REDEFINE))
331  Warn("redefining %s (%s)",s,my_yylinebuf);
332  if (s==IDID(h)) IDID(h)=NULL;
333  killhdl2(h,&IDROOT,NULL);
334  }
335  else
336  goto errlabel;
337  }
338  }
339  }
340  *root = (*root)->set(s, lev, t, init);
341 #ifndef SING_NDEBUG
342  checkall();
343 #endif
344  return *root;
345 
346  errlabel:
347  //Werror("identifier `%s` in use(lev h=%d,typ=%d,t=%d, curr=%d)",s,IDLEV(h),IDTYP(h),t,lev);
348  Werror("identifier `%s` in use",s);
349  //listall();
350  omFree((ADDRESS)s);
351  return NULL;
352 }
353 void killid(const char * id, idhdl * ih)
354 {
355  if (id!=NULL)
356  {
357  idhdl h = (*ih)->get(id,myynest);
358 
359  // id not found in global list, is it defined in current ring ?
360  if (h==NULL)
361  {
362  if ((currRing!=NULL) && (*ih != (currRing->idroot)))
363  {
364  h = currRing->idroot->get(id,myynest);
365  if (h!=NULL)
366  {
367  killhdl2(h,&(currRing->idroot),currRing);
368  return;
369  }
370  }
371  Werror("`%s` is not defined",id);
372  return;
373  }
374  killhdl2(h,ih,currRing);
375  }
376  else
377  WerrorS("kill what ?");
378 }
379 
380 void killhdl(idhdl h, package proot)
381 {
382  int t=IDTYP(h);
383  if (((BEGIN_RING<t) && (t<END_RING))
384  || ((t==LIST_CMD) && (lRingDependend((lists)IDDATA(h)))))
385  killhdl2(h,&currRing->idroot,currRing);
386  else
387  {
388  if(t==PACKAGE_CMD)
389  {
390  killhdl2(h,&(basePack->idroot),NULL);
391  }
392  else
393  {
394  idhdl s=proot->idroot;
395  while ((s!=h) && (s!=NULL)) s=s->next;
396  if (s!=NULL)
397  killhdl2(h,&(proot->idroot),NULL);
398  else if (basePack!=proot)
399  {
400  idhdl s=basePack->idroot;
401  while ((s!=h) && (s!=NULL)) s=s->next;
402  if (s!=NULL)
403  killhdl2(h,&(basePack->idroot),currRing);
404  else
405  killhdl2(h,&(currRing->idroot),currRing);
406  }
407  }
408  }
409 }
410 
411 void killhdl2(idhdl h, idhdl * ih, ring r)
412 {
413  //printf("kill %s, id %x, typ %d lev: %d\n",IDID(h),(int)IDID(h),IDTYP(h),IDLEV(h));
414  idhdl hh;
415 
416  if (TEST_V_ALLWARN
417  && (IDLEV(h)!=myynest)
418  &&(IDLEV(h)==0))
419  {
420  if (((*ih)==basePack->idroot)
421  || ((currRing!=NULL)&&((*ih)==currRing->idroot)))
422  Warn("kill global `%s` at line >>%s<<\n",IDID(h),my_yylinebuf);
423  }
424  if (h->attribute!=NULL)
425  {
426  //h->attribute->killAll(r); MEMORY LEAK!
427  h->attribute=NULL;
428  }
429  if (IDTYP(h) == PACKAGE_CMD)
430  {
431  if (strcmp(IDID(h),"Top")==0)
432  {
433  WarnS("can not kill `Top`");
434  return;
435  }
436  // any objects defined for this package ?
437  if ((IDPACKAGE(h)->ref<=0) && (IDPACKAGE(h)->idroot!=NULL))
438  {
439  if (currPack==IDPACKAGE(h))
440  {
442  currPackHdl=NULL;
443  }
444  idhdl * hd = &IDRING(h)->idroot;
445  idhdl hdh = IDNEXT(*hd);
446  idhdl temp;
447  while (hdh!=NULL)
448  {
449  temp = IDNEXT(hdh);
450  killhdl2(hdh,&(IDPACKAGE(h)->idroot),NULL);
451  hdh = temp;
452  }
453  killhdl2(*hd,hd,NULL);
454  if (IDPACKAGE(h)->libname!=NULL) omFree((ADDRESS)(IDPACKAGE(h)->libname));
455  }
456  paKill(IDPACKAGE(h));
457  if (currPackHdl==h) currPackHdl=packFindHdl(currPack);
459  }
460  else if (IDTYP(h)==RING_CMD)
461  rKill(h);
462  else if (IDDATA(h)!=NULL)
463  s_internalDelete(IDTYP(h),IDDATA(h),r);
464  // general -------------------------------------------------------------
465  // now dechain it and delete idrec
466  if (IDID(h)!=NULL) // OB: ?????
467  omFree((ADDRESS)IDID(h));
468  IDID(h)=NULL;
469  IDDATA(h)=NULL;
470  if (h == (*ih))
471  {
472  // h is at the beginning of the list
473  *ih = IDNEXT(h) /* ==*ih */;
474  }
475  else if (ih!=NULL)
476  {
477  // h is somethere in the list:
478  hh = *ih;
479  loop
480  {
481  if (hh==NULL)
482  {
483  PrintS(">>?<< not found for kill\n");
484  return;
485  }
486  idhdl hhh = IDNEXT(hh);
487  if (hhh == h)
488  {
489  IDNEXT(hh) = IDNEXT(hhh);
490  break;
491  }
492  hh = hhh;
493  }
494  }
495  omFreeBin((ADDRESS)h, idrec_bin);
496 }
497 
498 idhdl ggetid(const char *n, BOOLEAN /*local*/, idhdl *packhdl)
499 {
500  idhdl h = IDROOT->get(n,myynest);
501  idhdl h2=NULL;
502  *packhdl = NULL;
503  if ((currRing!=NULL) && ((h==NULL)||(IDLEV(h)!=myynest)))
504  {
505  h2 = currRing->idroot->get(n,myynest);
506  }
507  if (h2==NULL) return h;
508  return h2;
509 }
510 
511 idhdl ggetid(const char *n)
512 {
513  idhdl h = IDROOT->get(n,myynest);
514  if ((h!=NULL)&&(IDLEV(h)==myynest)) return h;
515  idhdl h2=NULL;
516  if (currRing!=NULL)
517  {
518  h2 = currRing->idroot->get(n,myynest);
519  }
520  if (h2!=NULL) return h2;
521  if (h!=NULL) return h;
522  if (basePack!=currPack)
523  return basePack->idroot->get(n,myynest);
524  return NULL;
525 }
526 
528 {
529  if (hasFlag(h,FLAG_STD)) PrintS(" (SB)");
530 #ifdef HAVE_PLURAL
531  if (hasFlag(h,FLAG_TWOSTD)) PrintS(" (2SB)");
532 #endif
533 }
534 
536 {
537  idhdl h=root;
538  /* compute the length */
539  int l=0;
540  while (h!=NULL) { l++; h=IDNEXT(h); }
541  /* allocate list */
543  L->Init(l);
544  /* copy names */
545  h=root;
546  l=0;
547  while (h!=NULL)
548  {
549  /* list is initialized with 0 => no need to clear anything */
550  L->m[l].rtyp=STRING_CMD;
551  L->m[l].data=omStrDup(IDID(h));
552  l++;
553  h=IDNEXT(h);
554  }
555  return L;
556 }
557 
558 lists ipNameListLev(idhdl root, int lev)
559 {
560  idhdl h=root;
561  /* compute the length */
562  int l=0;
563  while (h!=NULL) { if (IDLEV(h)==lev) l++; h=IDNEXT(h); }
564  /* allocate list */
566  L->Init(l);
567  /* copy names */
568  h=root;
569  l=0;
570  while (h!=NULL)
571  {
572  if (IDLEV(h)==lev)
573  {
574  /* list is initialized with 0 => no need to clear anything */
575  L->m[l].rtyp=STRING_CMD;
576  L->m[l].data=omStrDup(IDID(h));
577  l++;
578  }
579  h=IDNEXT(h);
580  }
581  return L;
582 }
583 
584 /*
585 * move 'tomove' from root1 list to root2 list
586 */
587 static int ipSwapId(idhdl tomove, idhdl &root1, idhdl &root2)
588 {
589  idhdl h;
590  /* search 'tomove' in root2 : if found -> do nothing */
591  h=root2;
592  while ((h!=NULL) && (h!=tomove)) h=IDNEXT(h);
593  if (h!=NULL) return FALSE; /*okay */
594  /* search predecessor of h in root1, remove 'tomove' */
595  h=root1;
596  if (tomove==h)
597  {
598  root1=IDNEXT(h);
599  }
600  else
601  {
602  while ((h!=NULL) && (IDNEXT(h)!=tomove)) h=IDNEXT(h);
603  if (h==NULL) return TRUE; /* not in the list root1 -> do nothing */
604  IDNEXT(h)=IDNEXT(tomove);
605  }
606  /* add to root2 list */
607  IDNEXT(tomove)=root2;
608  root2=tomove;
609  return FALSE;
610 }
611 
612 void ipMoveId(idhdl tomove)
613 {
614  if ((currRing!=NULL)&&(tomove!=NULL))
615  {
616  if (RingDependend(IDTYP(tomove))
617  || ((IDTYP(tomove)==LIST_CMD) && (lRingDependend(IDLIST(tomove)))))
618  {
619  /*move 'tomove' to ring id's*/
620  if (ipSwapId(tomove,IDROOT,currRing->idroot))
621  ipSwapId(tomove,basePack->idroot,currRing->idroot);
622  }
623  else
624  {
625  /*move 'tomove' to global id's*/
626  ipSwapId(tomove,currRing->idroot,IDROOT);
627  }
628  }
629 }
630 
631 const char * piProcinfo(procinfov pi, const char *request)
632 {
633  if((pi == NULL)||(pi->language==LANG_NONE)) return "empty proc";
634  else if (strcmp(request, "libname") == 0) return pi->libname;
635  else if (strcmp(request, "procname") == 0) return pi->procname;
636  else if (strcmp(request, "type") == 0)
637  {
638  switch (pi->language)
639  {
640  case LANG_SINGULAR: return "singular"; break;
641  case LANG_C: return "object"; break;
642  case LANG_NONE: return "none"; break;
643  default: return "unknown language";
644  }
645  }
646  else if (strcmp(request, "ref") == 0)
647  {
648  char p[8];
649  sprintf(p, "%d", pi->ref);
650  return omStrDup(p); // MEMORY-LEAK
651  }
652  return "??";
653 }
654 
656 {
657  (pi->ref)--;
658  if (pi->ref <= 0)
659  {
661  while (p!=NULL)
662  {
663  if (p->pi==pi && pi->ref <= 1)
664  {
665  Warn("`%s` in use, can not be killed",pi->procname);
666  return TRUE;
667  }
668  p=p->next;
669  }
670  if (pi->libname != NULL) // OB: ????
671  omFree((ADDRESS)pi->libname);
672  if (pi->procname != NULL) // OB: ????
673  omFree((ADDRESS)pi->procname);
674 
675  if( pi->language == LANG_SINGULAR)
676  {
677  if (pi->data.s.body != NULL) // OB: ????
678  omFree((ADDRESS)pi->data.s.body);
679  }
680  if( pi->language == LANG_C)
681  {
682  }
683  memset((void *) pi, 0, sizeof(procinfo));
684  pi->language=LANG_NONE;
686  }
687  return FALSE;
688 }
689 
690 void paCleanUp(package pack)
691 {
692  (pack->ref)--;
693  if (pack->ref < 0)
694  {
695 #ifndef HAVE_STATIC
696  if( pack->language == LANG_C)
697  {
698  Print("//dlclose(%s)\n",pack->libname);
699 #ifdef HAVE_DYNAMIC_LOADING
700  dynl_close (pack->handle);
701 #endif /* HAVE_DYNAMIC_LOADING */
702  }
703 #endif /* HAVE_STATIC */
704  omFree((ADDRESS)pack->libname);
705  memset((void *) pack, 0, sizeof(sip_package));
706  pack->language=LANG_NONE;
707  }
708 }
709 
710 void proclevel::push(char *n)
711 {
712  //Print("push %s\n",n);
713  proclevel *p=(proclevel*)omAlloc0(sizeof(proclevel));
714  p->name=n;
716  p->cPack=currPack;
717  p->next=this;
718  procstack=p;
719 }
721 {
722  //Print("pop %s\n",name);
723  //if (currRing!=::currRing) PrintS("currRing wrong\n");;
724  //::currRing=this->currRing;
725  //if (r==NULL) Print("set ring to NULL at lev %d(%s)\n",myynest,name);
726  //::currRingHdl=this->currRingHdl;
727  //if((::currRingHdl==NULL)||(IDRING(::currRingHdl)!=(::currRing)))
728  // ::currRingHdl=rFindHdl(::currRing,NULL,NULL);
729  //Print("restore pack=%s,1.obj=%s\n",IDID(currPackHdl),IDID(currPack->idroot));
730  currPackHdl=this->cPackHdl;
731  currPack=this->cPack;
733  proclevel *p=this;
734  procstack=next;
735  omFreeSize(p,sizeof(proclevel));
736 }
737 
739 {
740  idhdl h=basePack->idroot;
741  while (h!=NULL)
742  {
743  if ((IDTYP(h)==PACKAGE_CMD)
744  && (IDPACKAGE(h)==r))
745  return h;
746  h=IDNEXT(h);
747  }
748  return NULL;
749 }
750 
752 {
753  if (iiCurrArgs==NULL)
754  {
755  Werror("not enough arguments for proc %s",VoiceName());
756  p->CleanUp();
757  return TRUE;
758  }
760  iiCurrArgs=h->next;
761  h->next=NULL;
762  if (h->rtyp!=IDHDL)
763  {
764  BOOLEAN res=iiAssign(p,h);
765  h->CleanUp();
767  return res;
768  }
769  if ((h->Typ()!=p->Typ()) &&(p->Typ()!=DEF_CMD))
770  {
771  WerrorS("type mismatch");
772  return TRUE;
773  }
774  idhdl pp=(idhdl)p->data;
775  switch(pp->typ)
776  {
777 #ifdef SINGULAR_4_1
778  case CRING_CMD:
779  nKillChar((coeffs)pp);
780  break;
781 #endif
782  case DEF_CMD:
783  case INT_CMD:
784  break;
785  case INTVEC_CMD:
786  case INTMAT_CMD:
787  delete IDINTVEC(pp);
788  break;
789  case NUMBER_CMD:
790  nDelete(&IDNUMBER(pp));
791  break;
792  case BIGINT_CMD:
793  n_Delete(&IDNUMBER(pp),coeffs_BIGINT);
794  break;
795  case MAP_CMD:
796  {
797  map im = IDMAP(pp);
798  omFree((ADDRESS)im->preimage);
799  }
800  // continue as ideal:
801  case IDEAL_CMD:
802  case MODUL_CMD:
803  case MATRIX_CMD:
804  idDelete(&IDIDEAL(pp));
805  break;
806  case PROC_CMD:
807  case RESOLUTION_CMD:
808  case STRING_CMD:
809  omFree((ADDRESS)IDSTRING(pp));
810  break;
811  case LIST_CMD:
812  IDLIST(pp)->Clean();
813  break;
814  case LINK_CMD:
816  break;
817  // case ring: cannot happen
818  default:
819  Werror("unknown type %d",p->Typ());
820  return TRUE;
821  }
822  pp->typ=ALIAS_CMD;
823  IDDATA(pp)=(char*)h->data;
824  int eff_typ=h->Typ();
825  if ((RingDependend(eff_typ))
826  || ((eff_typ==LIST_CMD) && (lRingDependend((lists)h->Data()))))
827  {
828  ipSwapId(pp,IDROOT,currRing->idroot);
829  }
830  h->CleanUp();
832  return FALSE;
833 }
834 
void * idrecDataInit(int t)
Definition: ipid.cc:132
#define omAllocBin(bin)
Definition: omAllocDecl.h:205
CanonicalForm map(const CanonicalForm &primElem, const Variable &alpha, const CanonicalForm &F, const Variable &beta)
map from to such that is mapped onto
Definition: cf_map_ext.cc:400
#define IDLIST(a)
Definition: ipid.h:134
ip_package * package
Definition: structs.h:46
void ipMoveId(idhdl tomove)
Definition: ipid.cc:612
const CanonicalForm int s
Definition: facAbsFact.cc:55
sleftv * m
Definition: lists.h:45
Class used for (list of) interpreter objects.
Definition: subexpr.h:83
omBin sip_package_bin
Definition: ipid.cc:50
Definition: tok.h:48
int level(const CanonicalForm &f)
omBin_t * omBin
Definition: omStructs.h:12
#define Print
Definition: emacs.cc:83
Definition: tok.h:95
#define IDLINK(a)
Definition: ipid.h:135
idhdl currPackHdl
Definition: ipid.cc:61
#define idDelete(H)
delete an ideal
Definition: ideals.h:29
Definition: lists.h:22
#define IDINTVEC(a)
Definition: ipid.h:125
loop
Definition: myNF.cc:98
#define IDID(a)
Definition: ipid.h:119
#define FALSE
Definition: auxiliary.h:95
Compatiblity layer for legacy polynomial operations (over currRing)
void paCleanUp(package pack)
Definition: ipid.cc:690
Definition: tok.h:38
return P p
Definition: myNF.cc:203
Matrices of numbers.
Definition: bigintmat.h:51
void killid(const char *id, idhdl *ih)
Definition: ipid.cc:353
Definition: tok.h:215
static FORCE_INLINE number n_Init(long i, const coeffs r)
a number representing i in the given coeff field/ring r
Definition: coeffs.h:542
#define omFreeSize(addr, size)
Definition: omAllocDecl.h:260
#define IDNEXT(a)
Definition: ipid.h:115
language_defs language
Definition: subexpr.h:58
proclevel * procstack
Definition: ipid.cc:58
#define IDROOT
Definition: ipid.h:20
int id_i
Definition: idrec.h:47
#define TRUE
Definition: auxiliary.h:99
#define IDIDEAL(a)
Definition: ipid.h:130
void * ADDRESS
Definition: auxiliary.h:116
short ref
Definition: subexpr.h:59
Definition: fevoices.h:57
void WerrorS(const char *s)
Definition: feFopen.cc:24
idhdl basePackHdl
Definition: ipid.cc:62
#define WarnS
Definition: emacs.cc:81
char * name
Definition: ipid.h:62
Voice * next
Definition: fevoices.h:60
coeffs coeffs_BIGINT
Definition: ipid.cc:54
int Typ()
Definition: subexpr.cc:1004
BOOLEAN piKill(procinfov pi)
Definition: ipid.cc:655
#define Sy_bit(x)
Definition: options.h:30
char * String(BOOLEAN typed=FALSE)
Definition: ipid.cc:251
void paKill(package pack)
Definition: ipid.h:51
Definition: idrec.h:34
#define IDHDL
Definition: tok.h:31
poly pp
Definition: myNF.cc:296
idhdl get(const char *s, int lev)
Definition: ipid.cc:91
bool found
Definition: facFactorize.cc:56
omBin procinfo_bin
Definition: subexpr.cc:51
char * String(void *d=NULL, BOOLEAN typed=FALSE, int dim=1)
Called for conversion to string (used by string(..), write(..),..)
Definition: subexpr.cc:758
void ipListFlag(idhdl h)
Definition: ipid.cc:527
void * data
Definition: subexpr.h:89
char * procname
Definition: subexpr.h:56
poly res
Definition: myNF.cc:322
Definition: subexpr.h:21
#define IDPACKAGE(a)
Definition: ipid.h:136
int myynest
Definition: febase.cc:46
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
Definition: polys.cc:10
#define IDTYP(a)
Definition: ipid.h:116
void killhdl2(idhdl h, idhdl *ih, ring r)
Definition: ipid.cc:411
idhdl enterid(const char *s, int lev, int t, idhdl *root, BOOLEAN init, BOOLEAN search)
Definition: ipid.cc:261
int RingDependend(int t)
Definition: gentable.cc:23
Definition: tok.h:56
char my_yylinebuf[80]
Definition: febase.cc:48
const ring r
Definition: syzextra.cc:208
#define FLAG_TWOSTD
Definition: ipid.h:107
Definition: intvec.h:14
char * libname
Definition: subexpr.h:55
idhdl cPackHdl
Definition: ipid.h:60
void rKill(ring r)
Definition: ipshell.cc:6048
const char * piProcinfo(procinfov pi, const char *request)
Definition: ipid.cc:631
omBin idrec_bin
Definition: ipid.cc:52
lists ipNameListLev(idhdl root, int lev)
Definition: ipid.cc:558
Definition: tok.h:58
Definition: ipid.h:56
procinfo * pi
Definition: fevoices.h:63
const char * name
Definition: subexpr.h:88
#define omFree(addr)
Definition: omAllocDecl.h:261
#define assume(x)
Definition: mod2.h:403
int search(const CFArray &A, const CanonicalForm &F, int i, int j)
search for F in A between index i and j
The main handler for Singular numbers which are suitable for Singular polynomials.
procinfodata data
Definition: subexpr.h:62
int iiS2I(const char *s)
Definition: ipid.cc:72
#define IDSTRING(a)
Definition: ipid.h:133
void s_internalDelete(const int t, void *d, const ring r)
Definition: subexpr.cc:500
idhdl currRingHdl
Definition: ipid.cc:65
int m
Definition: cfEzgcd.cc:119
proclevel * next
Definition: ipid.h:59
idrec * idhdl
Definition: ring.h:18
omBin sleftv_bin
Definition: subexpr.cc:50
int i
Definition: cfEzgcd.cc:123
void PrintS(const char *s)
Definition: reporter.cc:284
lists ipNameList(idhdl root)
Definition: ipid.cc:535
idhdl next
Definition: idrec.h:38
#define IDLEV(a)
Definition: ipid.h:118
const char * VoiceName()
Definition: fevoices.cc:66
#define nDelete(n)
Definition: numbers.h:16
#define IDMAP(a)
Definition: ipid.h:132
#define FLAG_STD
Definition: ipid.h:106
leftv next
Definition: subexpr.h:87
#define IDNUMBER(a)
Definition: ipid.h:129
FILE * feFilePending
Definition: ipid.cc:56
#define BVERBOSE(a)
Definition: options.h:33
INLINE_THIS void Init(int l=0)
Definition: tok.h:34
#define omAlloc0Bin(bin)
Definition: omAllocDecl.h:206
#define omGetSpecBin(size)
Definition: omBin.h:11
#define pi
Definition: libparse.cc:1143
ideal idInit(int idsize, int rank)
initialise an ideal / module
Definition: simpleideals.cc:38
int dynl_close(void *handle)
Definition: mod_raw.cc:178
const char * iiNoName
Definition: ipid.cc:66
Definition: tok.h:116
#define NULL
Definition: omList.c:10
attr attribute
Definition: idrec.h:41
slists * lists
Definition: mpr_numeric.h:146
omBin sip_command_bin
Definition: ipid.cc:49
Voice * currentVoice
Definition: fevoices.cc:57
void killhdl(idhdl h, package proot)
Definition: ipid.cc:380
package basePack
Definition: ipid.cc:64
#define hasFlag(A, F)
Definition: ipid.h:109
BOOLEAN iiAlias(leftv p)
Definition: ipid.cc:751
#define IDRING(a)
Definition: ipid.h:124
package currPack
Definition: ipid.cc:63
leftv iiCurrArgs
Definition: ipshell.cc:80
int rtyp
Definition: subexpr.h:92
#define IDFLAG(a)
Definition: ipid.h:117
void CleanUp(ring r=currRing)
Definition: subexpr.cc:335
void * Data()
Definition: subexpr.cc:1146
int typ
Definition: idrec.h:43
Definition: tok.h:117
omBin slists_bin
Definition: lists.cc:23
Definition: tok.h:157
idhdl packFindHdl(package r)
Definition: ipid.cc:738
#define omCheckAddr(addr)
Definition: omAllocDecl.h:328
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete &#39;p&#39;
Definition: coeffs.h:459
void iiCheckPack(package &p)
Definition: ipshell.cc:1513
#define IDDATA(a)
Definition: ipid.h:123
#define omFreeBin(addr, bin)
Definition: omAllocDecl.h:259
void push(char *)
Definition: ipid.cc:710
void pop()
Definition: ipid.cc:720
#define nInit(i)
Definition: numbers.h:24
static Poly * h
Definition: janet.cc:978
int BOOLEAN
Definition: auxiliary.h:86
package cPack
Definition: ipid.h:61
BOOLEAN lRingDependend(lists L)
Definition: lists.cc:199
static int ipSwapId(idhdl tomove, idhdl &root1, idhdl &root2)
Definition: ipid.cc:587
void nKillChar(coeffs r)
undo all initialisations
Definition: numbers.cc:496
#define V_REDEFINE
Definition: options.h:43
void Werror(const char *fmt,...)
Definition: reporter.cc:189
#define TEST_V_ALLWARN
Definition: options.h:135
idhdl set(const char *s, int lev, int t, BOOLEAN init=TRUE)
Definition: ipid.cc:220
idhdl ggetid(const char *n, BOOLEAN, idhdl *packhdl)
Definition: ipid.cc:498
#define omAlloc0(size)
Definition: omAllocDecl.h:211
int l
Definition: cfEzgcd.cc:94
procinfo * procinfov
Definition: structs.h:63
blackbox * getBlackboxStuff(const int t)
return the structure to the type given by t
Definition: blackbox.cc:16
ListNode * next
Definition: janet.h:31
BOOLEAN iiAssign(leftv l, leftv r, BOOLEAN toplevel)
Definition: ipassign.cc:1792
#define Warn
Definition: emacs.cc:80
#define omStrDup(s)
Definition: omAllocDecl.h:263