Data Structures | Typedefs | Enumerations | Functions | Variables
subexpr.h File Reference
#include <string.h>
#include <polys/monomials/ring.h>
#include <kernel/mod2.h>
#include <Singular/grammar.h>
#include <Singular/tok.h>
#include <Singular/attrib.h>

Go to the source code of this file.

Data Structures

class  proc_singular
 
struct  proc_object
 
union  procinfodata
 
class  procinfo
 
struct  Subexpr
 
class  sleftv
 Class used for (list of) interpreter objects. More...
 
class  libstack
 

Typedefs

typedef procinfoprocinfov
 
typedef sleftvleftv
 
typedef libstacklibstackv
 

Enumerations

enum  language_defs {
  LANG_NONE, LANG_TOP, LANG_SINGULAR, LANG_C,
  LANG_MAX
}
 

Functions

const char * iiSleftv2name (leftv v)
 
BOOLEAN RingDependend (int t)
 
void syMake (leftv v, const char *name, package pa=NULL)
 
BOOLEAN assumeStdFlag (leftv h)
 
procinfov piCopy (procinfov pi)
 
BOOLEAN piKill (procinfov l)
 
const char * piProcinfo (procinfov pi, const char *request)
 
void piShowProcinfo (procinfov pi, char *txt)
 
void s_internalDelete (const int t, void *d, const ring r)
 

Variables

const char sNoName []
 
BOOLEAN siq
 
sleftv sLastPrinted
 
omBin sSubexpr_bin
 
omBin procinfo_bin
 
omBin libstack_bin
 

Data Structure Documentation

§ proc_singular

class proc_singular

Definition at line 22 of file subexpr.h.

Data Fields
char * body
long body_end
int body_lineno
long body_start
long def_end
int example_lineno
long example_start
long help_chksum
long help_end
long help_start
long proc_end
long proc_start

§ uprocinfodata

union uprocinfodata

Definition at line 44 of file subexpr.h.

Data Fields
struct proc_object o
proc_singular s

§ procinfo

class procinfo

Definition at line 52 of file subexpr.h.

Data Fields
procinfodata data
char is_static
language_defs language
char * libname
package pack
char * procname
short ref
char trace_flag

§ _ssubexpr

struct _ssubexpr

Definition at line 67 of file subexpr.h.

Data Fields
struct _ssubexpr * next
int start

Typedef Documentation

§ leftv

typedef sleftv* leftv

Definition at line 79 of file subexpr.h.

§ libstackv

typedef libstack* libstackv

Definition at line 158 of file subexpr.h.

§ procinfov

typedef procinfo* procinfov

Definition at line 65 of file subexpr.h.

Enumeration Type Documentation

§ language_defs

Enumerator
LANG_NONE 
LANG_TOP 
LANG_SINGULAR 
LANG_C 
LANG_MAX 

Definition at line 21 of file subexpr.h.

Function Documentation

§ assumeStdFlag()

BOOLEAN assumeStdFlag ( leftv  h)

Definition at line 1483 of file subexpr.cc.

1484 {
1485  if (h->e!=NULL)
1486  {
1487  leftv hh=h->LData();
1488  if (h!=hh) return assumeStdFlag(h->LData());
1489  }
1490  if (!hasFlag(h,FLAG_STD))
1491  {
1492  if (!TEST_VERB_NSB)
1493  {
1494  if (TEST_V_ALLWARN)
1495  Warn("%s is no standard basis in >>%s<<",h->Name(),my_yylinebuf);
1496  else
1497  Warn("%s is no standard basis",h->Name());
1498  }
1499  return FALSE;
1500  }
1501  return TRUE;
1502 }
#define TEST_VERB_NSB
Definition: options.h:129
Class used for (list of) interpreter objects.
Definition: subexpr.h:83
Subexpr e
Definition: subexpr.h:106
#define FALSE
Definition: auxiliary.h:95
#define TRUE
Definition: auxiliary.h:99
const char * Name()
Definition: subexpr.h:121
char my_yylinebuf[80]
Definition: febase.cc:48
BOOLEAN assumeStdFlag(leftv h)
Definition: subexpr.cc:1483
#define FLAG_STD
Definition: ipid.h:106
#define NULL
Definition: omList.c:10
#define hasFlag(A, F)
Definition: ipid.h:109
leftv LData()
Definition: subexpr.cc:1415
#define TEST_V_ALLWARN
Definition: options.h:135
#define Warn
Definition: emacs.cc:80

§ iiSleftv2name()

const char* iiSleftv2name ( leftv  v)

Definition at line 1961 of file subexpr.cc.

1962 {
1963  return(v->name);
1964 }
const char * name
Definition: subexpr.h:88

§ piCopy()

procinfov piCopy ( procinfov  pi)
inline

Definition at line 149 of file subexpr.h.

150 {
151  pi->ref++;
152  return pi;
153 }
short ref
Definition: subexpr.h:59
#define pi
Definition: libparse.cc:1143

§ piKill()

BOOLEAN piKill ( procinfov  l)

Definition at line 655 of file ipid.cc.

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 }
#define FALSE
Definition: auxiliary.h:95
return P p
Definition: myNF.cc:203
#define TRUE
Definition: auxiliary.h:99
void * ADDRESS
Definition: auxiliary.h:116
Definition: fevoices.h:57
Voice * next
Definition: fevoices.h:60
omBin procinfo_bin
Definition: subexpr.cc:51
Definition: subexpr.h:21
procinfo * pi
Definition: fevoices.h:63
#define omFree(addr)
Definition: omAllocDecl.h:261
#define pi
Definition: libparse.cc:1143
#define NULL
Definition: omList.c:10
Voice * currentVoice
Definition: fevoices.cc:57
#define omFreeBin(addr, bin)
Definition: omAllocDecl.h:259
#define Warn
Definition: emacs.cc:80

§ piProcinfo()

const char* piProcinfo ( procinfov  pi,
const char *  request 
)

Definition at line 631 of file ipid.cc.

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 }
return P p
Definition: myNF.cc:203
language_defs language
Definition: subexpr.h:58
short ref
Definition: subexpr.h:59
char * procname
Definition: subexpr.h:56
Definition: subexpr.h:21
char * libname
Definition: subexpr.h:55
#define NULL
Definition: omList.c:10
#define omStrDup(s)
Definition: omAllocDecl.h:263

§ piShowProcinfo()

void piShowProcinfo ( procinfov  pi,
char *  txt 
)

§ RingDependend()

BOOLEAN RingDependend ( int  t)
inline

Definition at line 143 of file subexpr.h.

143 { return (BEGIN_RING<t)&&(t<END_RING); }

§ s_internalDelete()

void s_internalDelete ( const int  t,
void *  d,
const ring  r 
)

Definition at line 500 of file subexpr.cc.

501 {
502  assume(d!=NULL);
503  switch (t)
504  {
505 #ifdef SINGULAR_4_1
506  case CRING_CMD:
507  {
508  coeffs cf=(coeffs)d;
509  if ((cf->ref<=1)&&
510  ((cf->type <=n_long_R)
511  ||((cf->type >=n_long_C)&&(cf->type <=n_CF))))
512  {
513  Werror("cannot kill %s",nCoeffName(cf));
514  }
515  else
516  nKillChar((coeffs)d);
517  break;
518  }
519 #endif
520 #ifdef SINGULAR_4_2
521  case CNUMBER_CMD:
522  {
523  number2 n=(number2)d;
524  n2Delete(n);
525  break;
526  }
527  case CPOLY_CMD:
528  {
529  poly2 n=(poly2)d;
530  p2Delete(n);
531  break;
532  }
533  case CMATRIX_CMD: //like BIGINTMAT
534 #endif
535  case BIGINTMAT_CMD:
536  {
537  bigintmat *v=(bigintmat*)d;
538  delete v;
539  break;
540  }
541  case INTVEC_CMD:
542  case INTMAT_CMD:
543  {
544  intvec *v=(intvec*)d;
545  delete v;
546  break;
547  }
548  case MAP_CMD:
549  {
550  map m=(map)d;
551  omFreeBinAddr((ADDRESS)m->preimage);
552  m->preimage=NULL;
553  /* no break: continue as IDEAL*/
554  }
555  case MATRIX_CMD:
556  case IDEAL_CMD:
557  case MODUL_CMD:
558  {
559  ideal i=(ideal)d;
560  id_Delete(&i,r);
561  break;
562  }
563  case STRING_CMD:
564  omFree(d);
565  break;
566  //case PACKAGE_CMD:
567  // return (void *)paCopy((package) d);
568  case PROC_CMD:
569  piKill((procinfo*)d);
570  break;
571  case POLY_CMD:
572  case VECTOR_CMD:
573  {
574  poly p=(poly)d;
575  p_Delete(&p,r);
576  break;
577  }
578  case NUMBER_CMD:
579  {
580  number n=(number)d;
581  n_Delete(&n,r->cf);
582  break;
583  }
584  case BIGINT_CMD:
585  {
586  number n=(number)d;
588  break;
589  }
590  case LIST_CMD:
591  {
592  lists l=(lists)d;
593  l->Clean(r);
594  break;
595  }
596  case LINK_CMD:
597  {
598  si_link l=(si_link)d;
599  slKill(l);
600  break;
601  }
602  case RING_CMD:
603  {
604  ring R=(ring)d;
605  if ((R!=currRing)||(R->ref>=0))
606  rKill(R);
607  #ifdef TEST
608  else
609  Print("currRing? ref=%d\n",R->ref);
610  #endif
611  break;
612  }
613  case RESOLUTION_CMD:
614  {
616  if (s!=NULL) syKillComputation(s,r);
617  break;
618  }
619  case COMMAND:
620  {
621  command cmd=(command)d;
622  if (cmd->arg1.rtyp!=0) cmd->arg1.CleanUp(r);
623  if (cmd->arg2.rtyp!=0) cmd->arg2.CleanUp(r);
624  if (cmd->arg3.rtyp!=0) cmd->arg3.CleanUp(r);
626  break;
627  }
628  case INT_CMD:
629  case DEF_CMD:
630  case ALIAS_CMD:
631  case PACKAGE_CMD:
632  case IDHDL:
633  case NONE:
634  case ANY_TYPE:
635  case VECHO:
636  case VPRINTLEVEL:
637  case VCOLMAX:
638  case VTIMER:
639  case VRTIMER:
640  case VOICE:
641  case VMAXDEG:
642  case VMAXMULT:
643  case TRACE:
644  case VSHORTOUT:
645  case VNOETHER:
646  case VMINPOLY:
647  case 0: /* type in error case */
648  break; /* error recovery: do nothing */
649  //case COMMAND:
650  //case COMMAND:
651  default:
652  {
653  if (t>MAX_TOK)
654  {
655  blackbox *b=getBlackboxStuff(t);
656  if (b!=NULL) b->blackbox_destroy(b,d);
657  break;
658  }
659  else
660  Warn("s_internalDelete: cannot delete type %s(%d)",
661  Tok2Cmdname(t),t);
662  }
663  }
664 }
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
Definition: tok.h:209
const CanonicalForm int s
Definition: facAbsFact.cc:55
Definition: tok.h:205
ip_command * command
Definition: ipid.h:24
Definition: tok.h:48
#define ANY_TYPE
Definition: tok.h:30
#define Print
Definition: emacs.cc:83
Definition: tok.h:95
Definition: tok.h:206
?
Definition: coeffs.h:47
Definition: lists.h:22
Definition: tok.h:38
return P p
Definition: myNF.cc:203
Matrices of numbers.
Definition: bigintmat.h:51
Definition: tok.h:215
void id_Delete(ideal *h, ring r)
deletes an ideal/module/matrix
void * ADDRESS
Definition: auxiliary.h:116
coeffs coeffs_BIGINT
Definition: ipid.cc:54
BOOLEAN piKill(procinfov pi)
Definition: ipid.cc:655
#define IDHDL
Definition: tok.h:31
real floating point (GMP) numbers
Definition: coeffs.h:34
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
Definition: polys.cc:10
Definition: tok.h:210
Definition: tok.h:56
const ring r
Definition: syzextra.cc:208
Definition: intvec.h:14
void rKill(ring r)
Definition: ipshell.cc:6048
Definition: tok.h:58
#define omFreeBinAddr(addr)
Definition: omAllocDecl.h:258
#define omFree(addr)
Definition: omAllocDecl.h:261
#define assume(x)
Definition: mod2.h:403
The main handler for Singular numbers which are suitable for Singular polynomials.
const ring R
Definition: DebugPrint.cc:36
complex floating point (GMP) numbers
Definition: coeffs.h:42
static FORCE_INLINE char * nCoeffName(const coeffs cf)
Definition: coeffs.h:977
int m
Definition: cfEzgcd.cc:119
int i
Definition: cfEzgcd.cc:123
Definition: tok.h:208
Definition: tok.h:34
static void p_Delete(poly *p, const ring r)
Definition: p_polys.h:843
Definition: tok.h:211
const Variable & v
< [in] a sqrfree bivariate poly
Definition: facBivar.h:37
CanonicalForm cf
Definition: cfModGcd.cc:4024
Definition: tok.h:116
#define NULL
Definition: omList.c:10
slists * lists
Definition: mpr_numeric.h:146
omBin sip_command_bin
Definition: ipid.cc:49
const char * Tok2Cmdname(int tok)
Definition: gentable.cc:130
void Clean(ring r=currRing)
Definition: lists.h:25
Definition: tok.h:117
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete &#39;p&#39;
Definition: coeffs.h:459
polyrec * poly
Definition: hilb.h:10
#define omFreeBin(addr, bin)
Definition: omAllocDecl.h:259
Definition: tok.h:207
const poly b
Definition: syzextra.cc:213
#define NONE
Definition: tok.h:218
void nKillChar(coeffs r)
undo all initialisations
Definition: numbers.cc:496
void Werror(const char *fmt,...)
Definition: reporter.cc:189
void syKillComputation(syStrategy syzstr, ring r=currRing)
Definition: syz1.cc:1497
int l
Definition: cfEzgcd.cc:94
#define COMMAND
Definition: tok.h:29
blackbox * getBlackboxStuff(const int t)
return the structure to the type given by t
Definition: blackbox.cc:16
ssyStrategy * syStrategy
Definition: syz.h:35
#define Warn
Definition: emacs.cc:80

§ syMake()

void syMake ( leftv  v,
const char *  name,
package  pa = NULL 
)

Definition at line 1509 of file subexpr.cc.

1510 {
1511  /* resolv an identifier: (to DEF_CMD, if siq>0)
1512  * 1) reserved id: done by scanner
1513  * 2) `basering` / 'Current`
1514  * 3) existing identifier, local
1515  * 4) ringvar, ringpar, local ring
1516  * 5) existing identifier, global
1517  * 6) monom (resp. number), local ring: consisting of:
1518  * 6') ringvar, ringpar,global ring
1519  * 6'') monom (resp. number), local ring
1520  * 7) monom (resp. number), non-local ring
1521  * 8) basering
1522  * 9) `_`
1523  * 10) everything else is of type 0
1524  */
1525 #ifdef TEST
1526  if ((*id<' ')||(*id>(char)126))
1527  {
1528  Print("wrong id :%s:\n",id);
1529  }
1530 #endif
1531  idhdl save_ring=currRingHdl;
1532  v->Init();
1533  if(pa != NULL)
1534  {
1535  v->req_packhdl = pa;
1536  }
1537  else v->req_packhdl = currPack;
1538 // if (v->req_packhdl!=basePack)
1539 // Print("search %s in %s\n",id,v->req_packhdl->libname);
1540  idhdl h=NULL;
1541 #ifdef SIQ
1542  if (siq<=0)
1543 #endif
1544  {
1545  if (!isdigit(id[0]))
1546  {
1547  if (strcmp(id,"basering")==0)
1548  {
1549  if (currRingHdl!=NULL)
1550  {
1551  if (id!=IDID(currRingHdl)) omFreeBinAddr((ADDRESS)id);
1552  h=currRingHdl;
1553  goto id_found;
1554  }
1555  else
1556  {
1557  v->name = id;
1558  return; /* undefined */
1559  }
1560  }
1561  else if (strcmp(id,"Current")==0)
1562  {
1563  if (currPackHdl!=NULL)
1564  {
1565  omFreeBinAddr((ADDRESS)id);
1566  h=currPackHdl;
1567  goto id_found;
1568  }
1569  else
1570  {
1571  v->name = id;
1572  return; /* undefined */
1573  }
1574  }
1575  if(v->req_packhdl!=currPack)
1576  {
1577  h=v->req_packhdl->idroot->get(id,myynest);
1578  }
1579  else
1580  h=ggetid(id);
1581  /* 3) existing identifier, local */
1582  if ((h!=NULL) && (IDLEV(h)==myynest))
1583  {
1584  if (id!=IDID(h)) omFreeBinAddr((ADDRESS)id); /*assume strlen(id) <1000 */
1585  goto id_found;
1586  }
1587  }
1589  {
1590  currRingHdl=NULL;
1591  }
1592  /* 4. local ring: ringvar */
1593  if ((currRingHdl!=NULL) && (IDLEV(currRingHdl)==myynest)
1594  /*&& (!yyInRingConstruction)*/)
1595  {
1596  int vnr;
1597  if ((vnr=r_IsRingVar(id, currRing->names,currRing->N))>=0)
1598  {
1599  poly p=pOne();
1600  pSetExp(p,vnr+1,1);
1601  pSetm(p);
1602  v->data = (void *)p;
1603  v->name = id;
1604  v->rtyp = POLY_CMD;
1605  return;
1606  }
1607  if((n_NumberOfParameters(currRing->cf)>0)
1608  &&((vnr=r_IsRingVar(id, (char**)n_ParameterNames(currRing->cf),
1609  n_NumberOfParameters(currRing->cf))>=0)))
1610  {
1611  BOOLEAN ok=FALSE;
1612  poly p = pmInit(id,ok);
1613  if (ok && (p!=NULL))
1614  {
1615  v->data = pGetCoeff(p);
1616  pGetCoeff(p)=NULL;
1617  pLmFree(p);
1618  v->rtyp = NUMBER_CMD;
1619  v->name = id;
1620  return;
1621  }
1622  }
1623  }
1624  /* 5. existing identifier, global */
1625  if (h!=NULL)
1626  {
1627  if (id!=IDID(h)) omFreeBinAddr((ADDRESS)id); /*assume strlen(id) <1000 */
1628  goto id_found;
1629  }
1630  /* 6. local ring: number/poly */
1631  if ((currRingHdl!=NULL) && (IDLEV(currRingHdl)==myynest))
1632  {
1633  BOOLEAN ok=FALSE;
1634  /*poly p = (!yyInRingConstruction) ? pmInit(id,ok) : (poly)NULL;*/
1635  poly p = pmInit(id,ok);
1636  if (ok)
1637  {
1638  if (p==NULL)
1639  {
1640  v->data = (void *)nInit(0);
1641  v->rtyp = NUMBER_CMD;
1642  #ifdef HAVE_PLURAL
1643  // in this case we may have monomials equal to 0 in p_Read
1644  v->name = id;
1645  #else
1646  omFreeBinAddr((ADDRESS)id);
1647  #endif
1648  }
1649  else if (pIsConstant(p))
1650  {
1651  v->data = pGetCoeff(p);
1652  pGetCoeff(p)=NULL;
1653  pLmFree(p);
1654  v->rtyp = NUMBER_CMD;
1655  v->name = id;
1656  }
1657  else
1658  {
1659  v->data = p;
1660  v->rtyp = POLY_CMD;
1661  v->name = id;
1662  }
1663  return;
1664  }
1665  }
1666  /* 7. non-local ring: number/poly */
1667  {
1668  BOOLEAN ok=FALSE;
1669  poly p = ((currRing!=NULL) /* ring required */
1670  && (currRingHdl!=NULL)
1671  /*&& (!yyInRingConstruction) - not in decl */
1672  && (IDLEV(currRingHdl)!=myynest)) /* already in case 4/6 */
1673  ? pmInit(id,ok) : (poly)NULL;
1674  if (ok)
1675  {
1676  if (p==NULL)
1677  {
1678  v->data = (void *)nInit(0);
1679  v->rtyp = NUMBER_CMD;
1680  #ifdef HAVE_PLURAL
1681  // in this case we may have monomials equal to 0 in p_Read
1682  v->name = id;
1683  #else
1684  omFreeBinAddr((ADDRESS)id);
1685  #endif
1686  }
1687  else
1688  if (pIsConstant(p))
1689  {
1690  v->data = pGetCoeff(p);
1691  pGetCoeff(p)=NULL;
1692  pLmFree(p);
1693  v->rtyp = NUMBER_CMD;
1694  v->name = id;
1695  }
1696  else
1697  {
1698  v->data = p;
1699  v->rtyp = POLY_CMD;
1700  v->name = id;
1701  }
1702  //if (TEST_V_ALLWARN /*&& (myynest>0)*/
1703  //&& ((r_IsRingVar(id, currRing->names,currRing->N)>=0)
1704  // || ((n_NumberOfParameters(currRing->cf)>0)
1705  // &&(r_IsRingVar(id, (char**)n_ParameterNames(currRing->cf),
1706  // n_NumberOfParameters(currRing->cf))>=0))))
1707  //{
1708  //// WARNING: do not use ring variable names in procedures
1709  // Warn("use of variable >>%s<< in a procedure in line %s",id,my_yylinebuf);
1710  //}
1711  return;
1712  }
1713  }
1714  /* 8. basering ? */
1715  if ((myynest>1)&&(currRingHdl!=NULL))
1716  {
1717  if (strcmp(id,IDID(currRingHdl))==0)
1718  {
1719  if (IDID(currRingHdl)!=id) omFreeBinAddr((ADDRESS)id); /*assume strlen (id) <1000 */
1720  h=currRingHdl;
1721  goto id_found;
1722  }
1723  }
1724  if((v->req_packhdl!=basePack) && (v->req_packhdl==currPack))
1725  {
1726  h=basePack->idroot->get(id,myynest);
1727  if (h!=NULL)
1728  {
1729  if (id!=IDID(h)) omFreeBinAddr((ADDRESS)id); /*assume strlen(id) <1000 */
1730  v->req_packhdl=basePack;
1731  goto id_found;
1732  }
1733  }
1734  }
1735 #ifdef SIQ
1736  else
1737  v->rtyp=DEF_CMD;
1738 #endif
1739  /* 9: _ */
1740  if (strcmp(id,"_")==0)
1741  {
1742  omFreeBinAddr((ADDRESS)id);
1743  v->Copy(&sLastPrinted);
1744  }
1745  else
1746  {
1747  /* 10: everything else */
1748  /* v->rtyp = UNKNOWN;*/
1749  v->name = id;
1750  }
1751  currRingHdl=save_ring;
1752  return;
1753 id_found: // we have an id (in h) found, to set the data in from h
1754  if (IDTYP(h)!=ALIAS_CMD)
1755  {
1756  v->rtyp = IDHDL;
1757  v->flag = IDFLAG(h);
1758  v->attribute=IDATTR(h);
1759  }
1760  else
1761  {
1762  v->rtyp = ALIAS_CMD;
1763  }
1764  v->name = IDID(h);
1765  v->data = (char *)h;
1766  currRingHdl=save_ring;
1767 }
BOOLEAN yyInRingConstruction
Definition: grammar.cc:172
static FORCE_INLINE char const ** n_ParameterNames(const coeffs r)
Returns a (const!) pointer to (const char*) names of parameters.
Definition: coeffs.h:812
#define pSetm(p)
Definition: polys.h:253
#define Print
Definition: emacs.cc:83
idhdl currPackHdl
Definition: ipid.cc:61
BITSET flag
Definition: subexpr.h:91
#define IDID(a)
Definition: ipid.h:119
#define pSetExp(p, i, v)
Definition: polys.h:42
#define FALSE
Definition: auxiliary.h:95
return P p
Definition: myNF.cc:203
BOOLEAN siq
Definition: subexpr.cc:58
void Init()
Definition: subexpr.h:108
void * ADDRESS
Definition: auxiliary.h:116
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy ...
Definition: monomials.h:51
Definition: idrec.h:34
#define IDHDL
Definition: tok.h:31
static FORCE_INLINE int n_NumberOfParameters(const coeffs r)
Returns the number of parameters.
Definition: coeffs.h:808
void * data
Definition: subexpr.h:89
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
int r_IsRingVar(const char *n, char **names, int N)
Definition: ring.cc:222
Definition: tok.h:58
const char * name
Definition: subexpr.h:88
#define omFreeBinAddr(addr)
Definition: omAllocDecl.h:258
idhdl currRingHdl
Definition: ipid.cc:65
void Copy(leftv e)
Definition: subexpr.cc:695
#define pIsConstant(p)
like above, except that Comp might be != 0
Definition: polys.h:221
#define pOne()
Definition: polys.h:298
#define IDLEV(a)
Definition: ipid.h:118
Definition: tok.h:34
#define NULL
Definition: omList.c:10
package req_packhdl
Definition: subexpr.h:107
package basePack
Definition: ipid.cc:64
package currPack
Definition: ipid.cc:63
int rtyp
Definition: subexpr.h:92
sleftv sLastPrinted
Definition: subexpr.cc:55
#define IDFLAG(a)
Definition: ipid.h:117
#define pmInit(a, b)
Definition: polys.h:272
#define IDATTR(a)
Definition: ipid.h:120
static void pLmFree(poly p)
frees the space of the monomial m, assumes m != NULL coef is not freed, m is not advanced ...
Definition: polys.h:70
attr attribute
Definition: subexpr.h:90
polyrec * poly
Definition: hilb.h:10
#define nInit(i)
Definition: numbers.h:24
static Poly * h
Definition: janet.cc:978
int BOOLEAN
Definition: auxiliary.h:86
idhdl ggetid(const char *n, BOOLEAN, idhdl *packhdl)
Definition: ipid.cc:498

Variable Documentation

§ libstack_bin

omBin libstack_bin

Definition at line 52 of file subexpr.cc.

§ procinfo_bin

omBin procinfo_bin

Definition at line 51 of file subexpr.cc.

§ siq

BOOLEAN siq

Definition at line 58 of file subexpr.cc.

§ sLastPrinted

sleftv sLastPrinted

Definition at line 55 of file subexpr.cc.

§ sNoName

const char sNoName[]

Definition at line 56 of file subexpr.cc.

§ sSubexpr_bin

omBin sSubexpr_bin

Definition at line 49 of file subexpr.cc.