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>
#include <Singular/fevoices.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

BOOLEAN siq
 
sleftv sLastPrinted
 
omBin sSubexpr_bin
 
omBin procinfo_bin
 
omBin libstack_bin
 

Data Structure Documentation

◆ proc_singular

class proc_singular

Definition at line 23 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 45 of file subexpr.h.

Data Fields
struct proc_object o
proc_singular s

◆ procinfo

class procinfo

Definition at line 53 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 68 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 66 of file subexpr.h.

Enumeration Type Documentation

◆ language_defs

Enumerator
LANG_NONE 
LANG_TOP 
LANG_SINGULAR 
LANG_C 
LANG_MAX 

Definition at line 22 of file subexpr.h.

Function Documentation

◆ assumeStdFlag()

BOOLEAN assumeStdFlag ( leftv  h)

Definition at line 1474 of file subexpr.cc.

1475 {
1476  if (h->e!=NULL)
1477  {
1478  leftv hh=h->LData();
1479  if (h!=hh) return assumeStdFlag(h->LData());
1480  }
1481  if (!hasFlag(h,FLAG_STD))
1482  {
1483  if (!TEST_VERB_NSB)
1484  {
1485  if (TEST_V_ALLWARN)
1486  Warn("%s is no standard basis in >>%s<<",h->Name(),my_yylinebuf);
1487  else
1488  Warn("%s is no standard basis",h->Name());
1489  }
1490  return FALSE;
1491  }
1492  return TRUE;
1493 }
#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:94
#define TRUE
Definition: auxiliary.h:98
const char * Name()
Definition: subexpr.h:121
char my_yylinebuf[80]
Definition: febase.cc:48
BOOLEAN assumeStdFlag(leftv h)
Definition: subexpr.cc:1474
#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:1406
#define TEST_V_ALLWARN
Definition: options.h:135
#define Warn
Definition: emacs.cc:80

◆ iiSleftv2name()

const char* iiSleftv2name ( leftv  v)

Definition at line 1952 of file subexpr.cc.

1953 {
1954  return(v->name);
1955 }
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:60
#define pi
Definition: libparse.cc:1143

◆ piKill()

BOOLEAN piKill ( procinfov  l)

Definition at line 652 of file ipid.cc.

653 {
654  (pi->ref)--;
655  if (pi->ref == 0)
656  {
657  if (pi->language==LANG_SINGULAR)
658  {
660  while (p!=NULL)
661  {
662  if (p->pi==pi && pi->ref <= 1)
663  {
664  Warn("`%s` in use, can not be killed",pi->procname);
665  return TRUE;
666  }
667  p=p->next;
668  }
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:94
return P p
Definition: myNF.cc:203
#define TRUE
Definition: auxiliary.h:98
void * ADDRESS
Definition: auxiliary.h:115
Definition: fevoices.h:58
Voice * next
Definition: fevoices.h:61
omBin procinfo_bin
Definition: subexpr.cc:51
Definition: subexpr.h:22
procinfo * pi
Definition: fevoices.h:64
#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 628 of file ipid.cc.

629 {
630  if((pi == NULL)||(pi->language==LANG_NONE)) return "empty proc";
631  else if (strcmp(request, "libname") == 0) return pi->libname;
632  else if (strcmp(request, "procname") == 0) return pi->procname;
633  else if (strcmp(request, "type") == 0)
634  {
635  switch (pi->language)
636  {
637  case LANG_SINGULAR: return "singular"; break;
638  case LANG_C: return "object"; break;
639  case LANG_NONE: return "none"; break;
640  default: return "unknown language";
641  }
642  }
643  else if (strcmp(request, "ref") == 0)
644  {
645  char p[8];
646  sprintf(p, "%d", pi->ref);
647  return omStrDup(p); // MEMORY-LEAK
648  }
649  return "??";
650 }
return P p
Definition: myNF.cc:203
language_defs language
Definition: subexpr.h:59
short ref
Definition: subexpr.h:60
char * procname
Definition: subexpr.h:57
Definition: subexpr.h:22
char * libname
Definition: subexpr.h:56
#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 495 of file subexpr.cc.

496 {
497  assume(d!=NULL);
498  switch (t)
499  {
500  case CRING_CMD:
501  {
502  coeffs cf=(coeffs)d;
503  if ((cf->ref<=1)&&
504  ((cf->type <=n_long_R)
505  ||((cf->type >=n_long_C)&&(cf->type <=n_CF))))
506  {
507  Werror("cannot kill %s",nCoeffName(cf));
508  }
509  else
510  nKillChar((coeffs)d);
511  break;
512  }
513 #ifdef SINGULAR_4_2
514  case CNUMBER_CMD:
515  {
516  number2 n=(number2)d;
517  n2Delete(n);
518  break;
519  }
520  case CPOLY_CMD:
521  {
522  poly2 n=(poly2)d;
523  p2Delete(n);
524  break;
525  }
526  case CMATRIX_CMD: //like BIGINTMAT
527 #endif
528  case BIGINTMAT_CMD:
529  {
530  bigintmat *v=(bigintmat*)d;
531  delete v;
532  break;
533  }
534  case INTVEC_CMD:
535  case INTMAT_CMD:
536  {
537  intvec *v=(intvec*)d;
538  delete v;
539  break;
540  }
541  case MAP_CMD:
542  {
543  map m=(map)d;
544  omFreeBinAddr((ADDRESS)m->preimage);
545  m->preimage=NULL;
546  /* no break: continue as IDEAL*/
547  }
548  case MATRIX_CMD:
549  case IDEAL_CMD:
550  case MODUL_CMD:
551  {
552  ideal i=(ideal)d;
553  id_Delete(&i,r);
554  break;
555  }
556  case STRING_CMD:
557  omFree(d);
558  break;
559  //case PACKAGE_CMD:
560  // return (void *)paCopy((package) d);
561  case PROC_CMD:
562  piKill((procinfo*)d);
563  break;
564  case POLY_CMD:
565  case VECTOR_CMD:
566  {
567  poly p=(poly)d;
568  p_Delete(&p,r);
569  break;
570  }
571  case NUMBER_CMD:
572  {
573  number n=(number)d;
574  n_Delete(&n,r->cf);
575  break;
576  }
577  case BIGINT_CMD:
578  {
579  number n=(number)d;
581  break;
582  }
583  case LIST_CMD:
584  {
585  lists l=(lists)d;
586  l->Clean(r);
587  break;
588  }
589  case LINK_CMD:
590  {
591  si_link l=(si_link)d;
592  slKill(l);
593  break;
594  }
595  case RING_CMD:
596  {
597  ring R=(ring)d;
598  if ((R!=currRing)||(R->ref>=0))
599  rKill(R);
600  #ifdef TEST
601  else
602  Print("currRing? ref=%d\n",R->ref);
603  #endif
604  break;
605  }
606  case RESOLUTION_CMD:
607  {
609  if (s!=NULL) syKillComputation(s,r);
610  break;
611  }
612  case COMMAND:
613  {
614  command cmd=(command)d;
615  if (cmd->arg1.rtyp!=0) cmd->arg1.CleanUp(r);
616  if (cmd->arg2.rtyp!=0) cmd->arg2.CleanUp(r);
617  if (cmd->arg3.rtyp!=0) cmd->arg3.CleanUp(r);
619  break;
620  }
621  case INT_CMD:
622  case DEF_CMD:
623  case ALIAS_CMD:
624  case PACKAGE_CMD:
625  case IDHDL:
626  case NONE:
627  case ANY_TYPE:
628  case VECHO:
629  case VPRINTLEVEL:
630  case VCOLMAX:
631  case VTIMER:
632  case VRTIMER:
633  case VOICE:
634  case VMAXDEG:
635  case VMAXMULT:
636  case TRACE:
637  case VSHORTOUT:
638  case VNOETHER:
639  case VMINPOLY:
640  case 0: /* type in error case */
641  break; /* error recovery: do nothing */
642  //case COMMAND:
643  //case COMMAND:
644  default:
645  {
646  if (t>MAX_TOK)
647  {
648  blackbox *b=getBlackboxStuff(t);
649  if (b!=NULL) b->blackbox_destroy(b,d);
650  break;
651  }
652  else
653  Warn("s_internalDelete: cannot delete type %s(%d)",
654  Tok2Cmdname(t),t);
655  }
656  }
657 }
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:207
const CanonicalForm int s
Definition: facAbsFact.cc:55
Definition: tok.h:203
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:204
?
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:213
void id_Delete(ideal *h, ring r)
deletes an ideal/module/matrix
void * ADDRESS
Definition: auxiliary.h:115
coeffs coeffs_BIGINT
Definition: ipid.cc:54
BOOLEAN piKill(procinfov pi)
Definition: ipid.cc:652
#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:208
Definition: tok.h:56
const ring r
Definition: syzextra.cc:208
Definition: intvec.h:14
void rKill(ring r)
Definition: ipshell.cc:6056
Definition: tok.h:58
#define omFreeBinAddr(addr)
Definition: omAllocDecl.h:258
#define omFree(addr)
Definition: omAllocDecl.h:261
#define assume(x)
Definition: mod2.h:394
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:980
int m
Definition: cfEzgcd.cc:119
int i
Definition: cfEzgcd.cc:123
Definition: tok.h:206
Definition: tok.h:34
static void p_Delete(poly *p, const ring r)
Definition: p_polys.h:843
Definition: tok.h:209
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:132
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:205
const poly b
Definition: syzextra.cc:213
#define NONE
Definition: tok.h:216
void nKillChar(coeffs r)
undo all initialisations
Definition: numbers.cc:504
void Werror(const char *fmt,...)
Definition: reporter.cc:189
void syKillComputation(syStrategy syzstr, ring r=currRing)
Definition: syz1.cc:1503
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 1500 of file subexpr.cc.

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

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 57 of file subexpr.cc.

◆ sLastPrinted

sleftv sLastPrinted

Definition at line 55 of file subexpr.cc.

◆ sSubexpr_bin

omBin sSubexpr_bin

Definition at line 49 of file subexpr.cc.