|
FORM v5.0.0-35-g6318119
|

Go to the source code of this file.
Macros | |
| #define | MaX(x, y) ((x) > (y) ? (x): (y)) |
| #define | MiN(x, y) ((x) < (y) ? (x): (y)) |
| #define | ABS(x) ( (x) < 0 ? -(x): (x) ) |
| #define | SGN(x) ( (x) > 0 ? 1 : (x) < 0 ? -1 : 0 ) |
| #define | REDLENG(x) ((((x)<0)?((x)+1):((x)-1))/2) |
| #define | INCLENG(x) (((x)<0)?(((x)*2)-1):(((x)*2)+1)) |
| #define | GETCOEF(x, y) x += *x;y = x[-1];x -= ABS(y);y=REDLENG(y) |
| #define | GETSTOP(x, y) y=x+(*x)-1;y -= ABS(*y)-1 |
| #define | StuffAdd(x, y) (((x)<0?-1:1)*(y)+((y)<0?-1:1)*(x)) |
| #define | EXCHN(t1, t2, n) { WORD a,i; for(i=0;i<n;i++){a=t1[i];t1[i]=t2[i];t2[i]=a;} } |
| #define | EXCH(x, y) { WORD a = (x); (x) = (y); (y) = a; } |
| #define | TOKENTOLINE(x, y) |
| #define | UngetFromStream(stream, c) ((stream)->nextchar[(stream)->isnextchar++]=c) |
| #define | AddLineFeed(s, n) { (s)[(n)++] = LINEFEED; } |
| #define | TryRecover(x) Terminate(-1) |
| #define | UngetChar(c) { pushbackchar = c; } |
| #define | ParseNumber(x, s) {(x)=0;while(*(s)>='0'&&*(s)<='9')(x)=10*(x)+*(s)++ -'0';} |
| #define | ParseSign(sgn, s) |
| #define | ParseSignedNumber(x, s) |
| #define | NCOPY(s, t, n) { while ( (n)-- > 0 ) { *s++ = *t++; } } |
| #define | NCOPYI(s, t, n) { while ( (n)-- > 0 ) { *s++ = *t++; } } |
| #define | NCOPYB(s, t, n) { while ( (n)-- > 0 ) { *s++ = *t++; } } |
| #define | NCOPYI32(s, t, n) { while ( (n)-- > 0 ) { *s++ = *t++; } } |
| #define | WCOPY(s, t, n) { int nn=n; WORD *ss=(WORD *)s, *tt=(WORD *)t; while ( (nn)-- > 0 ) { *ss++ = *tt++; } } |
| #define | NeedNumber(x, s, err) |
| #define | SKIPBLANKS(s) { while ( *(s) == ' ' || *(s) == '\t' ) (s)++; } |
| #define | FLUSHCONSOLE if ( AP.InOutBuf > 0 ) CharOut(LINEFEED) |
| #define | SKIPBRA1(s) |
| #define | SKIPBRA2(s) |
| #define | SKIPBRA3(s) |
| #define | SKIPBRA4(s) |
| #define | SKIPBRA5(s) |
| #define | CYCLE1(t, a, i) {t iX=*a; WORD jX; for(jX=1;jX<i;jX++)a[jX-1]=a[jX]; a[i-1]=iX;} |
| #define | AddToCB(c, wx) |
| #define | EXCHINOUT |
| #define | BACKINOUT |
| #define | CopyArg(to, from) |
| #define | FILLARG(w) |
| #define | COPYARG(w, t) |
| #define | ZEROARG(w) |
| #define | FILLFUN(w) |
| #define | COPYFUN(w, t) |
| #define | COPYFUN3(w, t) |
| #define | FILLFUN3(w) |
| #define | FILLSUB(w) |
| #define | COPYSUB(w, ww) |
| #define | FILLEXPR(w) |
| #define | NEXTARG(x) if(*x>0) x += *x; else if(*x <= -FUNCTION)x++; else x += 2; |
| #define | COPY1ARG(s1, t1) |
| #define | ZeroFillRange(w, begin, end) |
| #define | TABLESIZE(a, b) (((WORD)sizeof(a))/((WORD)sizeof(b))) |
| #define | WORDDIF(x, y) (WORD)(x-y) |
| #define | wsizeof(a) ((WORD)sizeof(a)) |
| #define | VARNAME(type, num) (AC.varnames->namebuffer+type[num].name) |
| #define | DOLLARNAME(type, num) (AC.dollarnames->namebuffer+type[num].name) |
| #define | EXPRNAME(num) (AC.exprnames->namebuffer+Expressions[num].name) |
| #define | PREV(x) prevorder?prevorder:x |
| #define | Terminate(x) do { TerminateImpl(x, __FILE__, __LINE__, __FUNCTION__); } while(0) |
| #define | SETERROR(x) { Terminate(-1); return(-1); } |
| #define | DUMMYUSE(x) (void)(x); |
| #define | ADDPOS(pp, x) (pp).p1 = ((pp).p1+(LONG)(x)) |
| #define | SETBASELENGTH(ss, x) (ss).p1 = (LONG)(x) |
| #define | SETBASEPOSITION(pp, x) (pp).p1 = (LONG)(x) |
| #define | ISEQUALPOSINC(pp1, pp2, x) ( (pp1).p1 == ((pp2).p1+(LONG)(x)) ) |
| #define | ISGEPOSINC(pp1, pp2, x) ( (pp1).p1 >= ((pp2).p1+(LONG)(x)) ) |
| #define | DIVPOS(pp, n) ( (pp).p1/(LONG)(n) ) |
| #define | MULPOS(pp, n) (pp).p1 *= (LONG)(n) |
| #define | DIFPOS(ss, pp1, pp2) (ss).p1 = ((pp1).p1-(pp2).p1) |
| #define | DIFBASE(pp1, pp2) ((pp1).p1-(pp2).p1) |
| #define | ADD2POS(pp1, pp2) (pp1).p1 += (pp2).p1 |
| #define | PUTZERO(pp) (pp).p1 = 0 |
| #define | BASEPOSITION(pp) ((pp).p1) |
| #define | SETSTARTPOS(pp) (pp).p1 = -2 |
| #define | NOTSTARTPOS(pp) ( (pp).p1 > -2 ) |
| #define | ISMINPOS(pp) ( (pp).p1 == -1 ) |
| #define | ISEQUALPOS(pp1, pp2) ( (pp1).p1 == (pp2).p1 ) |
| #define | ISNOTEQUALPOS(pp1, pp2) ( (pp1).p1 != (pp2).p1 ) |
| #define | ISLESSPOS(pp1, pp2) ( (pp1).p1 < (pp2).p1 ) |
| #define | ISGEPOS(pp1, pp2) ( (pp1).p1 >= (pp2).p1 ) |
| #define | ISNOTZEROPOS(pp) ( (pp).p1 != 0 ) |
| #define | ISZEROPOS(pp) ( (pp).p1 == 0 ) |
| #define | ISPOSPOS(pp) ( (pp).p1 > 0 ) |
| #define | ISNEGPOS(pp) ( (pp).p1 < 0 ) |
| #define | TOLONG(x) ((LONG)(x)) |
| #define | Add2Com(x) { WORD cod[2]; cod[0] = x; cod[1] = 2; AddNtoL(2,cod); } |
| #define | Add3Com(x1, x2) { WORD cod[3]; cod[0] = x1; cod[1] = 3; cod[2] = x2; AddNtoL(3,cod); } |
| #define | Add4Com(x1, x2, x3) |
| #define | Add5Com(x1, x2, x3, x4) |
| #define | WantAddPointers(x) |
| #define | WantAddLongs(x) |
| #define | WantAddPositions(x) |
| #define | FORM_INLINE inline |
| #define | MEMORYMACROS |
| #define | TermMalloc(x) ( (AT.TermMemTop <= 0 ) ? TermMallocAddMemory(BHEAD0), AT.TermMemHeap[--AT.TermMemTop]: AT.TermMemHeap[--AT.TermMemTop] ) |
| #define | NumberMalloc(x) ( (AT.NumberMemTop <= 0 ) ? NumberMallocAddMemory(BHEAD0), AT.NumberMemHeap[--AT.NumberMemTop]: AT.NumberMemHeap[--AT.NumberMemTop] ) |
| #define | CacheNumberMalloc(x) ( (AT.CacheNumberMemTop <= 0 ) ? CacheNumberMallocAddMemory(BHEAD0), AT.CacheNumberMemHeap[--AT.CacheNumberMemTop]: AT.CacheNumberMemHeap[--AT.CacheNumberMemTop] ) |
| #define | TermFree(TermMem, x) AT.TermMemHeap[AT.TermMemTop++] = (WORD *)(TermMem) |
| #define | NumberFree(NumberMem, x) AT.NumberMemHeap[AT.NumberMemTop++] = (UWORD *)(NumberMem) |
| #define | CacheNumberFree(NumberMem, x) AT.CacheNumberMemHeap[AT.CacheNumberMemTop++] = (UWORD *)(NumberMem) |
| #define | NestingChecksum() (AC.IfLevel + AC.RepLevel + AC.arglevel + AC.insidelevel + AC.termlevel + AC.inexprlevel + AC.dolooplevel +AC.SwitchLevel) |
| #define | MesNesting() MesPrint("&Illegal nesting of if, repeat, argument, inside, term, inexpression and do") |
| #define | MarkPolyRatFunDirty(T) |
| #define | PUSHPREASSIGNLEVEL |
| #define | POPPREASSIGNLEVEL |
| #define | EXTERNLOCK(x) |
| #define | INILOCK(x) |
| #define | LOCK(x) |
| #define | UNLOCK(x) |
| #define | EXTERNRWLOCK(x) |
| #define | INIRWLOCK(x) |
| #define | RWLOCKR(x) |
| #define | RWLOCKW(x) |
| #define | UNRWLOCK(x) |
| #define | MLOCK(x) |
| #define | MUNLOCK(x) |
| #define | GETIDENTITY |
| #define | GETBIDENTITY |
| #define | M_alloc(x) malloc((size_t)(x)) |
| #define | CompareTerms ((COMPARE)AR.CompareRoutine) |
| #define | FiniShuffle AN.SHvar.finishuf |
| #define | DoShtuffle ((DO_UFFLE)AN.SHvar.do_uffle) |
Typedefs | |
| typedef int(* | WRITEBUFTOEXTCHANNEL) (char *, size_t) |
| typedef int(* | GETCFROMEXTCHANNEL) (void) |
| typedef int(* | SETTERMINATORFOREXTERNALCHANNEL) (char *) |
| typedef int(* | SETKILLMODEFOREXTERNALCHANNEL) (int, int) |
| typedef LONG(* | WRITEFILE) (int, UBYTE *, LONG) |
| typedef WORD(* | GETTERM) (PHEAD WORD *) |
Functions | |
| void | TELLFILE (int, POSITION *) |
| void | StartVariables (void) |
| void | setSignalHandlers (void) |
| UBYTE * | CodeToLine (WORD, UBYTE *) |
| UBYTE * | AddArrayIndex (WORD, UBYTE *) |
| INDEXENTRY * | FindInIndex (WORD, FILEDATA *, WORD, WORD) |
| INDEXENTRY * | NextFileIndex (POSITION *) |
| WORD * | PasteTerm (PHEAD WORD, WORD *, WORD *, WORD, WORD) |
| UBYTE * | StrCopy (UBYTE *, UBYTE *) |
| UBYTE * | WrtPower (UBYTE *, WORD) |
| int | AccumGCD (PHEAD UWORD *, WORD *, UWORD *, WORD) |
| void | AddArgs (PHEAD WORD *, WORD *, WORD *) |
| int | AddCoef (PHEAD WORD **, WORD **) |
| int | AddLong (UWORD *, WORD, UWORD *, WORD, UWORD *, WORD *) |
| int | AddPLon (UWORD *, WORD, UWORD *, WORD, UWORD *, WORD *) |
| int | AddPoly (PHEAD WORD **, WORD **) |
| int | AddRat (PHEAD UWORD *, WORD, UWORD *, WORD, UWORD *, WORD *) |
| void | AddToLine (UBYTE *) |
| int | AddWild (PHEAD WORD, WORD, WORD) |
| int | BigLong (UWORD *, WORD, UWORD *, WORD) |
| int | BinomGen (PHEAD WORD *, WORD, WORD **, WORD, WORD, WORD, WORD, WORD, UWORD *, WORD) |
| int | CheckWild (PHEAD WORD, WORD, WORD, WORD *) |
| int | Chisholm (PHEAD WORD *, WORD) |
| int | CleanExpr (WORD) |
| void | CleanUp (WORD) |
| void | ClearWild (PHEAD0) |
| int | CompareFunctions (WORD *, WORD *) |
| int | Commute (WORD *, WORD *) |
| WORD | DetCommu (WORD *) |
| WORD | DoesCommu (WORD *) |
| int | CompArg (WORD *, WORD *) |
| WORD | CompCoef (WORD *, WORD *) |
| int | CompGroup (PHEAD WORD, WORD **, WORD *, WORD *, WORD) |
| WORD | Compare1 (PHEAD WORD *, WORD *, WORD) |
| WORD | CountDo (WORD *, WORD *) |
| WORD | CountFun (WORD *, WORD *) |
| WORD | DimensionSubterm (WORD *) |
| WORD | DimensionTerm (WORD *) |
| WORD | DimensionExpression (PHEAD WORD *) |
| int | Deferred (PHEAD WORD *, WORD) |
| int | DeleteStore (WORD) |
| WORD | DetCurDum (PHEAD WORD *) |
| void | DetVars (WORD *, WORD) |
| int | Distribute (DISTRIBUTE *, WORD) |
| int | DivLong (UWORD *, WORD, UWORD *, WORD, UWORD *, WORD *, UWORD *, WORD *) |
| int | DivRat (PHEAD UWORD *, WORD, UWORD *, WORD, UWORD *, WORD *) |
| int | Divvy (PHEAD UWORD *, WORD *, UWORD *, WORD) |
| int | DoDelta (WORD *) |
| int | DoDelta3 (PHEAD WORD *, WORD) |
| int | TestPartitions (WORD *, PARTI *) |
| int | DoPartitions (PHEAD WORD *, WORD) |
| int | CoCanonicalize (UBYTE *) |
| int | DoCanonicalize (PHEAD WORD *, WORD *) |
| int | GenDiagrams (PHEAD WORD *, WORD) |
| int | DoTopologyCanonicalize (PHEAD WORD *, WORD, WORD, WORD *) |
| int | DoShattering (PHEAD WORD *, WORD *, WORD *, WORD) |
| int | DoTableExpansion (WORD *, WORD) |
| int | DoDistrib (PHEAD WORD *, WORD) |
| int | DoShuffle (WORD *, WORD, WORD, WORD) |
| int | DoPermutations (PHEAD WORD *, WORD) |
| int | Shuffle (WORD *, WORD *, WORD *) |
| int | FinishShuffle (WORD *) |
| int | DoStuffle (WORD *, WORD, WORD, WORD) |
| int | Stuffle (WORD *, WORD *, WORD *) |
| int | FinishStuffle (WORD *) |
| WORD * | StuffRootAdd (WORD *, WORD *, WORD *) |
| int | TestUse (WORD *, WORD) |
| DBASE * | FindTB (UBYTE *) |
| int | CheckTableDeclarations (DBASE *) |
| void | Apply (WORD *, WORD) |
| int | ApplyExec (WORD *, int, WORD) |
| void | ApplyReset (WORD) |
| void | TableReset (void) |
| void | ReWorkT (WORD *, WORD *, WORD) |
| WORD | GetIfDollarNum (WORD *, WORD *) |
| int | FindVar (WORD *, WORD *) |
| int | DoIfStatement (PHEAD WORD *, WORD *) |
| int | DoOnePow (PHEAD WORD *, WORD, WORD, WORD *, WORD *, WORD, WORD *) |
| void | DoRevert (WORD *, WORD *) |
| int | DoSumF1 (PHEAD WORD *, WORD *, WORD, WORD) |
| int | DoSumF2 (PHEAD WORD *, WORD *, WORD, WORD) |
| int | DoTheta (PHEAD WORD *) |
| LONG | EndSort (PHEAD WORD *, int) |
| int | EntVar (WORD, UBYTE *, WORD, WORD, WORD, WORD) |
| int | EpfCon (PHEAD WORD *, WORD *, WORD, WORD) |
| int | EpfFind (PHEAD WORD *, WORD *) |
| WORD | EpfGen (WORD, WORD *, WORD *, WORD *, WORD) |
| int | EqualArg (WORD *, WORD, WORD) |
| int | Factorial (PHEAD WORD, UWORD *, WORD *) |
| int | Bernoulli (WORD, UWORD *, WORD *) |
| int | FactorIn (PHEAD WORD *, WORD) |
| int | FactorInExpr (PHEAD WORD *, WORD) |
| int | FindAll (PHEAD WORD *, WORD *, WORD, WORD *) |
| WORD | FindMulti (PHEAD WORD *, WORD *) |
| int | FindOnce (PHEAD WORD *, WORD *) |
| int | FindOnly (PHEAD WORD *, WORD *) |
| int | FindRest (PHEAD WORD *, WORD *) |
| void | FindSpecial (WORD *) |
| WORD | FindrNumber (WORD, VARRENUM *) |
| void | FiniLine (void) |
| int | FiniTerm (PHEAD WORD *, WORD *, WORD *, WORD, WORD) |
| int | FlushOut (POSITION *, FILEHANDLE *, int) |
| void | FunLevel (PHEAD WORD *) |
| void | AdjustRenumScratch (PHEAD0) |
| void | GarbHand (void) |
| int | GcdLong (PHEAD UWORD *, WORD, UWORD *, WORD, UWORD *, WORD *) |
| int | LcmLong (PHEAD UWORD *, WORD, UWORD *, WORD, UWORD *, WORD *) |
| void | GCD (UWORD *, WORD, UWORD *, WORD, UWORD *, WORD *) |
| ULONG | GCD2 (ULONG, ULONG) |
| int | Generator (PHEAD WORD *, WORD) |
| int | GetBinom (UWORD *, WORD *, WORD, WORD) |
| WORD | GetFromStore (WORD *, POSITION *, RENUMBER, WORD *, WORD) |
| int | GetLong (UBYTE *, UWORD *, WORD *) |
| WORD | GetMoreTerms (WORD *) |
| int | GetMoreFromMem (WORD *, WORD **) |
| WORD | GetOneTerm (PHEAD WORD *, FILEHANDLE *, POSITION *, int) |
| RENUMBER | GetTable (WORD, POSITION *, WORD) |
| WORD | GetTerm (PHEAD WORD *) |
| int | Glue (PHEAD WORD *, WORD *, WORD *, WORD) |
| int | InFunction (PHEAD WORD *, WORD *) |
| void | IniLine (WORD) |
| void | IniVars (void) |
| int | InsertTerm (PHEAD WORD *, WORD, WORD, WORD *, WORD *, WORD) |
| void | LongToLine (UWORD *, WORD) |
| int | MakeDirty (WORD *, WORD *, WORD) |
| void | MarkDirty (WORD *, WORD) |
| void | PolyFunDirty (PHEAD WORD *) |
| void | PolyFunClean (PHEAD WORD *) |
| int | MakeModTable (void) |
| int | MatchE (PHEAD WORD *, WORD *, WORD *, WORD) |
| int | MatchCy (PHEAD WORD *, WORD *, WORD *, WORD) |
| int | FunMatchCy (PHEAD WORD *, WORD *, WORD *, WORD) |
| int | FunMatchSy (PHEAD WORD *, WORD *, WORD *, WORD) |
| int | MatchArgument (PHEAD WORD *, WORD *) |
| int | MatchFunction (PHEAD WORD *, WORD *, WORD *) |
| int | MergePatches (WORD) |
| int | MesCerr (char *, UBYTE *) |
| int | MesComp (char *, UBYTE *, UBYTE *) |
| int | Modulus (WORD *) |
| void | MoveDummies (PHEAD WORD *, WORD) |
| int | MulLong (UWORD *, WORD, UWORD *, WORD, UWORD *, WORD *) |
| int | MulRat (PHEAD UWORD *, WORD, UWORD *, WORD, UWORD *, WORD *) |
| int | Mully (PHEAD UWORD *, WORD *, UWORD *, WORD) |
| int | MultDo (PHEAD WORD *, WORD *) |
| int | NewSort (PHEAD0) |
| int | ExtraSymbol (WORD, WORD, WORD, WORD *, WORD *) |
| int | Normalize (PHEAD WORD *) |
| int | BracketNormalize (PHEAD WORD *) |
| void | DropCoefficient (PHEAD WORD *) |
| void | DropSymbols (PHEAD WORD *) |
| int | PutInside (PHEAD WORD *, WORD *) |
| void | OpenTemp (void) |
| void | Pack (UWORD *, WORD *, UWORD *, WORD) |
| LONG | PasteFile (PHEAD WORD, WORD *, POSITION *, WORD **, RENUMBER, WORD *, WORD) |
| int | Permute (PERM *, WORD) |
| int | PermuteP (PERMP *, WORD) |
| int | PolyFunMul (PHEAD WORD *) |
| int | PopVariables (void) |
| int | PrepPoly (PHEAD WORD *, WORD) |
| int | Processor (void) |
| int | Product (UWORD *, WORD *, WORD) |
| void | PrtLong (UWORD *, WORD, UBYTE *) |
| void | PrtTerms (void) |
| void | PrintDeprecation (const char *, const char *) |
| void | PrintFeatureList (void) |
| void | PrintRunningTime (void) |
| LONG | GetRunningTime (void) |
| int | PutBracket (PHEAD WORD *) |
| LONG | PutIn (FILEHANDLE *, POSITION *, WORD *, WORD **, int) |
| int | PutInStore (INDEXENTRY *, WORD) |
| WORD | PutOut (PHEAD WORD *, POSITION *, FILEHANDLE *, WORD) |
| UWORD | Quotient (UWORD *, WORD *, WORD) |
| int | RaisPow (PHEAD UWORD *, WORD *, UWORD) |
| void | RaisPowCached (PHEAD WORD, WORD, UWORD **, WORD *) |
| WORD | RaisPowMod (WORD, WORD, WORD) |
| int | NormalModulus (UWORD *, WORD *) |
| int | MakeInverses (void) |
| int | GetModInverses (WORD, WORD, WORD *, WORD *) |
| int | GetLongModInverses (PHEAD UWORD *, WORD, UWORD *, WORD, UWORD *, WORD *, UWORD *, WORD *) |
| void | RatToLine (UWORD *, WORD) |
| int | RatioFind (PHEAD WORD *, WORD *) |
| int | RatioGen (PHEAD WORD *, WORD *, WORD, WORD) |
| WORD | ReNumber (PHEAD WORD *) |
| WORD | ReadSnum (UBYTE **) |
| WORD | Remain10 (UWORD *, WORD *) |
| WORD | Remain4 (UWORD *, WORD *) |
| int | ResetScratch (void) |
| int | ResolveSet (PHEAD WORD *, WORD *, WORD *) |
| int | RevertScratch (void) |
| int | ScanFunctions (PHEAD WORD *, WORD *, WORD) |
| void | SeekScratch (FILEHANDLE *, POSITION *) |
| void | SetEndScratch (FILEHANDLE *, POSITION *) |
| void | SetEndHScratch (FILEHANDLE *, POSITION *) |
| int | SetFileIndex (void) |
| int | Sflush (FILEHANDLE *) |
| int | Simplify (PHEAD UWORD *, WORD *, UWORD *, WORD *) |
| int | SortWild (WORD *, WORD) |
| FILE * | LocateBase (char **, char **, char *) |
| LONG | SplitMerge (PHEAD WORD **, LONG) |
| int | StoreTerm (PHEAD WORD *) |
| void | SubPLon (UWORD *, WORD, UWORD *, WORD, UWORD *, WORD *) |
| void | Substitute (PHEAD WORD *, WORD *, WORD) |
| int | SymFind (PHEAD WORD *, WORD *) |
| int | SymGen (PHEAD WORD *, WORD *, WORD, WORD) |
| WORD | Symmetrize (PHEAD WORD *, WORD *, WORD, WORD, WORD) |
| int | FullSymmetrize (PHEAD WORD *, int) |
| int | TakeModulus (UWORD *, WORD *, UWORD *, WORD, WORD) |
| int | TakeNormalModulus (UWORD *, WORD *, UWORD *, WORD, WORD) |
| void | TalToLine (UWORD) |
| int | TenVec (PHEAD WORD *, WORD *, WORD, WORD) |
| int | TenVecFind (PHEAD WORD *, WORD *) |
| int | TermRenumber (WORD *, RENUMBER, WORD) |
| void | TestDrop (void) |
| void | PutInVflags (WORD) |
| int | TestMatch (PHEAD WORD *, WORD *) |
| WORD | TestSub (PHEAD WORD *, WORD) |
| LONG | TimeCPU (WORD) |
| LONG | TimeChildren (WORD) |
| LONG | TimeWallClock (WORD) |
| LONG | Timer (int) |
| int | GetTimerInfo (LONG **, LONG **) |
| void | WriteTimerInfo (LONG *, LONG *) |
| LONG | GetWorkerTimes (void) |
| int | ToStorage (EXPRESSIONS, POSITION *) |
| void | TokenToLine (UBYTE *) |
| int | Trace4 (PHEAD WORD *, WORD *, WORD, WORD) |
| int | Trace4Gen (PHEAD TRACES *, WORD) |
| int | Trace4no (WORD, WORD *, TRACES *) |
| int | TraceFind (PHEAD WORD *, WORD *) |
| int | TraceN (PHEAD WORD *, WORD *, WORD, WORD) |
| int | TraceNgen (PHEAD TRACES *, WORD) |
| WORD | TraceNno (WORD, WORD *, TRACES *) |
| int | Traces (PHEAD WORD *, WORD *, WORD, WORD) |
| WORD | Trick (WORD *, TRACES *) |
| int | TryDo (PHEAD WORD *, WORD *, WORD) |
| void | UnPack (UWORD *, WORD, WORD *, WORD *) |
| int | VarStore (UBYTE *, WORD, WORD, WORD) |
| WORD | WildFill (PHEAD WORD *, WORD *, WORD *) |
| int | WriteAll (void) |
| int | WriteOne (UBYTE *, int, int, WORD) |
| void | WriteArgument (WORD *) |
| int | WriteExpression (WORD *, LONG) |
| int | WriteInnerTerm (WORD *, WORD) |
| void | WriteLists (void) |
| void | WriteSetup (void) |
| void | WriteStats (POSITION *, WORD, WORD) |
| int | WriteSubTerm (WORD *, WORD) |
| int | WriteTerm (WORD *, WORD *, WORD, WORD, WORD) |
| int | execarg (PHEAD WORD *, WORD) |
| int | execterm (PHEAD WORD *, WORD) |
| void | SpecialCleanup (PHEAD0) |
| void | SetMods (void) |
| void | UnSetMods (void) |
| int | DoExecute (WORD, WORD) |
| void | SetScratch (FILEHANDLE *, POSITION *) |
| void | Warning (char *) |
| void | HighWarning (char *) |
| int | SpareTable (TABLES) |
| UBYTE * | strDup1 (UBYTE *, char *) |
| void * | Malloc1 (LONG, const char *) |
| int | DoTail (int, UBYTE **) |
| int | OpenInput (void) |
| int | PutPreVar (UBYTE *, UBYTE *, UBYTE *, int) |
| void | Error0 (char *) |
| void | Error1 (char *, UBYTE *) |
| void | Error2 (char *, char *, UBYTE *) |
| UBYTE | ReadFromStream (STREAM *) |
| UBYTE | GetFromStream (STREAM *) |
| UBYTE | LookInStream (STREAM *) |
| STREAM * | OpenStream (UBYTE *, int, int, int) |
| int | LocateFile (UBYTE **, int) |
| STREAM * | CloseStream (STREAM *) |
| void | PositionStream (STREAM *, LONG) |
| int | ReverseStatements (STREAM *) |
| int | ProcessOption (UBYTE *, UBYTE *, int) |
| int | DoSetups (void) |
| void | TerminateImpl (int, const char *, int, const char *) NORETURN |
| NAMENODE * | GetNode (NAMETREE *, UBYTE *) |
| int | AddName (NAMETREE *, UBYTE *, WORD, WORD, int *) |
| int | GetName (NAMETREE *, UBYTE *, WORD *, int) |
| UBYTE * | GetFunction (UBYTE *, WORD *) |
| UBYTE * | GetNumber (UBYTE *, WORD *) |
| int | GetLastExprName (UBYTE *, WORD *) |
| int | GetAutoName (UBYTE *, WORD *) |
| int | GetVar (UBYTE *, WORD *, WORD *, int, int) |
| int | MakeDubious (NAMETREE *, UBYTE *, WORD *) |
| int | GetOName (NAMETREE *, UBYTE *, WORD *, int) |
| void | DumpTree (NAMETREE *) |
| void | DumpNode (NAMETREE *, WORD, WORD) |
| void | LinkTree (NAMETREE *, WORD, WORD) |
| void | CopyTree (NAMETREE *, NAMETREE *, WORD, WORD) |
| int | CompactifyTree (NAMETREE *, WORD) |
| NAMETREE * | MakeNameTree (void) |
| void | FreeNameTree (NAMETREE *) |
| int | AddExpression (UBYTE *, int, int) |
| int | AddSymbol (UBYTE *, int, int, int, int) |
| int | AddDollar (UBYTE *, WORD, WORD *, LONG) |
| int | ReplaceDollar (WORD, WORD, WORD *, LONG) |
| int | DollarRaiseLow (UBYTE *, LONG) |
| int | AddVector (UBYTE *, int, int) |
| int | AddDubious (UBYTE *) |
| int | AddIndex (UBYTE *, int, int) |
| UBYTE * | DoDimension (UBYTE *, int *, int *) |
| int | AddFunction (UBYTE *, int, int, int, int, int, int, int) |
| int | CoCommuteInSet (UBYTE *) |
| int | CoFunction (UBYTE *, int, int) |
| int | TestName (UBYTE *) |
| int | AddSet (UBYTE *, WORD) |
| int | DoElements (UBYTE *, SETS, UBYTE *) |
| int | DoTempSet (UBYTE *, UBYTE *) |
| int | NameConflict (int, UBYTE *) |
| int | OpenFile (char *) |
| int | OpenAddFile (char *) |
| int | ReOpenFile (char *) |
| int | CreateFile (char *) |
| int | CreateLogFile (char *) |
| void | CloseFile (int) |
| int | CopyFile (char *, char *) |
| int | CreateHandle (void) |
| LONG | ReadFile (int, UBYTE *, LONG) |
| LONG | ReadPosFile (PHEAD FILEHANDLE *, UBYTE *, LONG, POSITION *) |
| LONG | WriteFileToFile (int, UBYTE *, LONG) |
| void | SeekFile (int, POSITION *, int) |
| LONG | TellFile (int) |
| void | FlushFile (int) |
| int | GetPosFile (int, fpos_t *) |
| int | SetPosFile (int, fpos_t *) |
| void | SynchFile (int) |
| void | TruncateFile (int) |
| int | GetChannel (char *, int) |
| int | GetAppendChannel (char *) |
| int | CloseChannel (char *) |
| void | inictable (void) |
| KEYWORD * | findcommand (UBYTE *) |
| int | inicbufs (void) |
| void | StartFiles (void) |
| UBYTE * | MakeDate (void) |
| void | PreProcessor (void) |
| void * | FromList (LIST *) |
| void * | From0List (LIST *) |
| void * | FromVarList (LIST *) |
| int | DoubleList (void ***, int *, int, char *) |
| int | DoubleLList (void ***, LONG *, int, char *) |
| void | DoubleBuffer (void **, void **, int, char *) |
| void | ExpandBuffer (void **, LONG *, int) |
| LONG | iexp (LONG, int) |
| int | IsLikeVector (WORD *) |
| int | AreArgsEqual (WORD *, WORD *) |
| int | CompareArgs (WORD *, WORD *) |
| UBYTE * | SkipField (UBYTE *, int) |
| int | StrCmp (UBYTE *, UBYTE *) |
| int | StrICmp (UBYTE *, UBYTE *) |
| int | StrHICmp (UBYTE *, UBYTE *) |
| int | StrICont (UBYTE *, UBYTE *) |
| int | CmpArray (WORD *, WORD *, WORD) |
| int | ConWord (UBYTE *, UBYTE *) |
| int | StrLen (UBYTE *) |
| UBYTE * | GetPreVar (UBYTE *, int) |
| void | ToGeneral (WORD *, WORD *, WORD) |
| WORD | ToPolyFunGeneral (PHEAD WORD *) |
| int | ToFast (WORD *, WORD *) |
| SETUPPARAMETERS * | GetSetupPar (UBYTE *) |
| int | RecalcSetups (void) |
| int | AllocSetups (void) |
| SORTING * | AllocSort (LONG, LONG, LONG, LONG, int, int, LONG, int) |
| void | AllocSortFileName (SORTING *) |
| UBYTE * | LoadInputFile (UBYTE *, int) |
| UBYTE | GetInput (void) |
| void | ClearPushback (void) |
| UBYTE | GetChar (int) |
| void | CharOut (UBYTE) |
| void | UnsetAllowDelay (void) |
| void | PopPreVars (int) |
| void | IniModule (int) |
| void | IniSpecialModule (int) |
| int | ModuleInstruction (int *, int *) |
| int | PreProInstruction (void) |
| int | LoadInstruction (int) |
| int | LoadStatement (int) |
| KEYWORD * | FindKeyWord (UBYTE *, KEYWORD *, int) |
| KEYWORD * | FindInKeyWord (UBYTE *, KEYWORD *, int) |
| int | DoDefine (UBYTE *) |
| int | DoRedefine (UBYTE *) |
| int | TheDefine (UBYTE *, int) |
| int | TheUndefine (UBYTE *) |
| int | ClearMacro (UBYTE *) |
| int | DoUndefine (UBYTE *) |
| int | DoInclude (UBYTE *) |
| int | DoReverseInclude (UBYTE *) |
| int | Include (UBYTE *, int) |
| int | DoExternal (UBYTE *) |
| int | DoToExternal (UBYTE *) |
| int | DoFromExternal (UBYTE *) |
| int | DoPrompt (UBYTE *) |
| int | DoSetExternal (UBYTE *) |
| int | DoSetExternalAttr (UBYTE *) |
| int | DoRmExternal (UBYTE *) |
| int | DoFactDollar (UBYTE *) |
| WORD | GetDollarNumber (UBYTE **, DOLLARS) |
| int | DoSetRandom (UBYTE *) |
| int | DoOptimize (UBYTE *) |
| int | DoClearOptimize (UBYTE *) |
| int | DoSkipExtraSymbols (UBYTE *) |
| int | DoTimeOutAfter (UBYTE *) |
| int | DoMessage (UBYTE *) |
| int | DoPreOut (UBYTE *) |
| int | DoPreAppend (UBYTE *) |
| int | DoPreCreate (UBYTE *) |
| int | DoPreAssign (UBYTE *) |
| int | DoPreBreak (UBYTE *) |
| int | DoPreDefault (UBYTE *) |
| int | DoPreSwitch (UBYTE *) |
| int | DoPreEndSwitch (UBYTE *) |
| int | DoPreCase (UBYTE *) |
| int | DoPreShow (UBYTE *) |
| int | DoPreExchange (UBYTE *) |
| int | DoSystem (UBYTE *) |
| int | DoPipe (UBYTE *) |
| void | StartPrepro (void) |
| int | DoIfdef (UBYTE *, int) |
| int | DoIfydef (UBYTE *) |
| int | DoIfndef (UBYTE *) |
| int | DoElse (UBYTE *) |
| int | DoElseif (UBYTE *) |
| int | DoEndif (UBYTE *) |
| int | DoTerminate (UBYTE *) |
| int | DoIf (UBYTE *) |
| int | DoCall (UBYTE *) |
| int | DoDebug (UBYTE *) |
| int | DoContinueDo (UBYTE *) |
| int | DoDo (UBYTE *) |
| int | DoBreakDo (UBYTE *) |
| int | DoEnddo (UBYTE *) |
| int | DoEndprocedure (UBYTE *) |
| int | DoInside (UBYTE *) |
| int | DoEndInside (UBYTE *) |
| int | DoProcedure (UBYTE *) |
| int | DoPrePrintTimes (UBYTE *) |
| int | DoPreWrite (UBYTE *) |
| int | DoPreClose (UBYTE *) |
| int | DoPreRemove (UBYTE *) |
| int | DoPreSortReallocate (UBYTE *) |
| int | DoCommentChar (UBYTE *) |
| int | DoPrcExtension (UBYTE *) |
| int | DoPreReset (UBYTE *) |
| void | WriteString (int, UBYTE *, int) |
| void | WriteUnfinString (int, UBYTE *, int) |
| UBYTE * | AddToString (UBYTE *, UBYTE *, int) |
| UBYTE * | PreCalc (void) |
| UBYTE * | PreEval (UBYTE *, LONG *) |
| void | NumToStr (UBYTE *, LONG) |
| int | PreCmp (int, int, UBYTE *, int, int, UBYTE *, int) |
| int | PreEq (int, int, UBYTE *, int, int, UBYTE *, int) |
| UBYTE * | pParseObject (UBYTE *, int *, LONG *) |
| UBYTE * | PreIfEval (UBYTE *, int *) |
| int | EvalPreIf (UBYTE *) |
| int | PreLoad (PRELOAD *, UBYTE *, UBYTE *, int, char *) |
| int | PreSkip (UBYTE *, UBYTE *, int) |
| UBYTE * | EndOfToken (UBYTE *) |
| void | SetSpecialMode (int, int) |
| void | MakeGlobal (void) |
| int | ExecModule (int) |
| int | ExecStore (void) |
| void | FullCleanUp (void) |
| int | DoExecStatement (void) |
| int | DoPipeStatement (void) |
| int | DoPolyfun (UBYTE *) |
| int | DoPolyratfun (UBYTE *) |
| int | CompileStatement (UBYTE *) |
| UBYTE * | ToToken (UBYTE *) |
| int | GetDollar (UBYTE *) |
| void | MesWork (void) NORETURN |
| int | MesPrint (const char *,...) |
| int | MesCall (char *) |
| UBYTE * | NumCopy (WORD, UBYTE *) |
| char * | LongCopy (LONG, char *) |
| char * | LongLongCopy (off_t *, char *) |
| void | ReserveTempFiles (int) |
| void | PrintTerm (WORD *, char *) |
| void | PrintTermC (WORD *, char *) |
| void | PrintSubTerm (WORD *, char *) |
| void | PrintWords (WORD *, LONG) |
| void | PrintSeq (WORD *, char *) |
| int | ExpandTripleDots (int) |
| LONG | ComPress (WORD **, LONG *) |
| void | StageSort (FILEHANDLE *) |
| void | M_free (void *, const char *) |
| void | ClearWildcardNames (void) |
| int | AddWildcardName (UBYTE *) |
| int | GetWildcardName (UBYTE *) |
| void | Globalize (int) |
| void | ResetVariables (int) |
| void | AddToPreTypes (int) |
| void | MessPreNesting (int) |
| LONG | GetStreamPosition (STREAM *) |
| WORD * | DoubleCbuffer (int, WORD *, int) |
| WORD * | AddLHS (int) |
| WORD * | AddRHS (int, int) |
| int | AddNtoL (int, WORD *) |
| int | AddNtoC (int, int, WORD *, int) |
| void | DoubleIfBuffers (void) |
| STREAM * | CreateStream (UBYTE *) |
| int | setonoff (UBYTE *, int *, int, int) |
| int | DoPrint (UBYTE *, int) |
| int | SetExpr (UBYTE *, int, int) |
| void | AddToCom (int, WORD *) |
| int | Add2ComStrings (int, WORD *, UBYTE *, UBYTE *) |
| int | DoSymmetrize (UBYTE *, int) |
| int | DoArgument (UBYTE *, int) |
| int | ArgFactorize (PHEAD WORD *, WORD *) |
| WORD * | TakeArgContent (PHEAD WORD *, WORD *) |
| WORD * | MakeInteger (PHEAD WORD *, WORD *, WORD *) |
| WORD * | MakeMod (PHEAD WORD *, WORD *, WORD *) |
| WORD | FindArg (PHEAD WORD *) |
| int | InsertArg (PHEAD WORD *, WORD *, int) |
| int | CleanupArgCache (PHEAD WORD) |
| int | ArgSymbolMerge (WORD *, WORD *) |
| int | ArgDotproductMerge (WORD *, WORD *) |
| void | SortWeights (LONG *, LONG *, WORD) |
| int | DoBrackets (UBYTE *, int) |
| int | DoPutInside (UBYTE *, int) |
| WORD * | CountComp (UBYTE *, WORD *) |
| int | CoAntiBracket (UBYTE *) |
| int | CoAntiSymmetrize (UBYTE *) |
| int | DoArgPlode (UBYTE *, int) |
| int | CoArgExplode (UBYTE *) |
| int | CoArgImplode (UBYTE *) |
| int | CoArgument (UBYTE *) |
| int | CoInside (UBYTE *) |
| int | ExecInside (UBYTE *) |
| int | CoInExpression (UBYTE *) |
| int | CoInParallel (UBYTE *) |
| int | CoNotInParallel (UBYTE *) |
| int | DoInParallel (UBYTE *, int) |
| int | CoEndInExpression (UBYTE *) |
| int | CoBracket (UBYTE *) |
| int | CoPutInside (UBYTE *) |
| int | CoAntiPutInside (UBYTE *) |
| int | CoMultiBracket (UBYTE *) |
| int | CoCFunction (UBYTE *) |
| int | CoCTensor (UBYTE *) |
| int | CoCollect (UBYTE *) |
| int | CoCompress (UBYTE *) |
| int | CoContract (UBYTE *) |
| int | CoCycleSymmetrize (UBYTE *) |
| int | CoDelete (UBYTE *) |
| int | CoTableBase (UBYTE *) |
| int | CoApply (UBYTE *) |
| int | CoDenominators (UBYTE *) |
| int | CoDimension (UBYTE *) |
| int | CoDiscard (UBYTE *) |
| int | CoDisorder (UBYTE *) |
| int | CoDrop (UBYTE *) |
| int | CoDropCoefficient (UBYTE *) |
| int | CoDropSymbols (UBYTE *) |
| int | CoElse (UBYTE *) |
| int | CoElseIf (UBYTE *) |
| int | CoEndArgument (UBYTE *) |
| int | CoEndInside (UBYTE *) |
| int | CoEndIf (UBYTE *) |
| int | CoEndRepeat (UBYTE *) |
| int | CoEndTerm (UBYTE *) |
| int | CoEndWhile (UBYTE *) |
| int | CoExit (UBYTE *) |
| int | CoFactArg (UBYTE *) |
| int | CoFactDollar (UBYTE *) |
| int | CoFactorize (UBYTE *) |
| int | CoNFactorize (UBYTE *) |
| int | CoUnFactorize (UBYTE *) |
| int | CoNUnFactorize (UBYTE *) |
| int | DoFactorize (UBYTE *, int) |
| int | CoFill (UBYTE *) |
| int | CoFillExpression (UBYTE *) |
| int | CoFixIndex (UBYTE *) |
| int | CoFormat (UBYTE *) |
| int | CoGlobal (UBYTE *) |
| int | CoGlobalFactorized (UBYTE *) |
| int | CoGoTo (UBYTE *) |
| int | CoId (UBYTE *) |
| int | CoIdNew (UBYTE *) |
| int | CoIdOld (UBYTE *) |
| int | CoIf (UBYTE *) |
| int | CoIfMatch (UBYTE *) |
| int | CoIfNoMatch (UBYTE *) |
| int | CoIndex (UBYTE *) |
| int | CoInsideFirst (UBYTE *) |
| int | CoKeep (UBYTE *) |
| int | CoLabel (UBYTE *) |
| int | CoLoad (UBYTE *) |
| int | CoLocal (UBYTE *) |
| int | CoLocalFactorized (UBYTE *) |
| int | CoMany (UBYTE *) |
| int | CoMerge (UBYTE *) |
| int | CoStuffle (UBYTE *) |
| int | CoMetric (UBYTE *) |
| int | CoModOption (UBYTE *) |
| int | CoModuleOption (UBYTE *) |
| int | CoModulus (UBYTE *) |
| int | CoMulti (UBYTE *) |
| int | CoMultiply (UBYTE *) |
| int | CoNFunction (UBYTE *) |
| int | CoNPrint (UBYTE *) |
| int | CoNTensor (UBYTE *) |
| int | CoNWrite (UBYTE *) |
| int | CoNoDrop (UBYTE *) |
| int | CoNoSkip (UBYTE *) |
| int | CoNormalize (UBYTE *) |
| int | CoMakeInteger (UBYTE *) |
| int | CoFlags (UBYTE *, int) |
| int | CoOff (UBYTE *) |
| int | CoOn (UBYTE *) |
| int | CoOnce (UBYTE *) |
| int | CoOnly (UBYTE *) |
| int | CoOptimizeOption (UBYTE *) |
| int | CoPolyFun (UBYTE *) |
| int | CoPolyRatFun (UBYTE *) |
| int | CoPrint (UBYTE *) |
| int | CoPrintB (UBYTE *) |
| int | CoProperCount (UBYTE *) |
| int | CoUnitTrace (UBYTE *) |
| int | CoRCycleSymmetrize (UBYTE *) |
| int | CoRatio (UBYTE *) |
| int | CoRedefine (UBYTE *) |
| int | CoRenumber (UBYTE *) |
| int | CoRepeat (UBYTE *) |
| int | CoSave (UBYTE *) |
| int | CoSelect (UBYTE *) |
| int | CoSet (UBYTE *) |
| int | CoSetExitFlag (UBYTE *) |
| int | CoSkip (UBYTE *) |
| int | CoProcessBucket (UBYTE *) |
| int | CoPushHide (UBYTE *) |
| int | CoPopHide (UBYTE *) |
| int | CoHide (UBYTE *) |
| int | CoIntoHide (UBYTE *) |
| int | CoNoIntoHide (UBYTE *) |
| int | CoNoHide (UBYTE *) |
| int | CoUnHide (UBYTE *) |
| int | CoNoUnHide (UBYTE *) |
| int | CoSort (UBYTE *) |
| int | CoSplitArg (UBYTE *) |
| int | CoSplitFirstArg (UBYTE *) |
| int | CoSplitLastArg (UBYTE *) |
| int | CoSum (UBYTE *) |
| int | CoSymbol (UBYTE *) |
| int | CoSymmetrize (UBYTE *) |
| int | DoTable (UBYTE *, int) |
| int | CoTable (UBYTE *) |
| int | CoTerm (UBYTE *) |
| int | CoNTable (UBYTE *) |
| int | CoCTable (UBYTE *) |
| void | EmptyTable (TABLES) |
| int | CoToTensor (UBYTE *) |
| int | CoToVector (UBYTE *) |
| int | CoTrace4 (UBYTE *) |
| int | CoTraceN (UBYTE *) |
| int | CoChisholm (UBYTE *) |
| int | CoTransform (UBYTE *) |
| int | CoClearTable (UBYTE *) |
| int | DoChain (UBYTE *, int) |
| int | CoChainin (UBYTE *) |
| int | CoChainout (UBYTE *) |
| int | CoTryReplace (UBYTE *) |
| int | CoVector (UBYTE *) |
| int | CoWhile (UBYTE *) |
| int | CoWrite (UBYTE *) |
| int | CoAuto (UBYTE *) |
| int | CoSwitch (UBYTE *) |
| int | CoCase (UBYTE *) |
| int | CoBreak (UBYTE *) |
| int | CoDefault (UBYTE *) |
| int | CoEndSwitch (UBYTE *) |
| int | CoTBaddto (UBYTE *) |
| int | CoTBaudit (UBYTE *) |
| int | CoTBcleanup (UBYTE *) |
| int | CoTBcreate (UBYTE *) |
| int | CoTBenter (UBYTE *) |
| int | CoTBhelp (UBYTE *) |
| int | CoTBload (UBYTE *) |
| int | CoTBoff (UBYTE *) |
| int | CoTBon (UBYTE *) |
| int | CoTBopen (UBYTE *) |
| int | CoTBreplace (UBYTE *) |
| int | CoTBuse (UBYTE *) |
| int | CoTestUse (UBYTE *) |
| int | CoThreadBucket (UBYTE *) |
| int | AddComString (int, WORD *, UBYTE *, int) |
| int | CompileAlgebra (UBYTE *, int, WORD *) |
| int | IsIdStatement (UBYTE *) |
| UBYTE * | IsRHS (UBYTE *, UBYTE) |
| int | ParenthesesTest (UBYTE *) |
| int | tokenize (UBYTE *, WORD) |
| void | WriteTokens (SBYTE *) |
| int | simp1token (SBYTE *) |
| int | simpwtoken (SBYTE *) |
| int | simp2token (SBYTE *) |
| int | simp3atoken (SBYTE *, int) |
| int | simp3btoken (SBYTE *, int) |
| int | simp4token (SBYTE *) |
| int | simp5token (SBYTE *, int) |
| int | simp6token (SBYTE *, int) |
| UBYTE * | SkipAName (UBYTE *) |
| int | TestTables (void) |
| int | GetLabel (UBYTE *) |
| int | CoIdExpression (UBYTE *, int) |
| int | CoAssign (UBYTE *) |
| int | DoExpr (UBYTE *, int, int) |
| int | CompileSubExpressions (SBYTE *) |
| int | CodeGenerator (SBYTE *) |
| int | CompleteTerm (WORD *, UWORD *, UWORD *, WORD, WORD, int) |
| int | CodeFactors (SBYTE *s) |
| WORD | GenerateFactors (WORD, WORD) |
| int | InsTree (int, int) |
| int | FindTree (int, WORD *) |
| void | RedoTree (CBUF *, int) |
| void | ClearTree (int) |
| int | CatchDollar (int) |
| int | AssignDollar (PHEAD WORD *, WORD) |
| UBYTE * | WriteDollarToBuffer (WORD, WORD) |
| UBYTE * | WriteDollarFactorToBuffer (WORD, WORD, WORD) |
| void | AddToDollarBuffer (UBYTE *) |
| int | PutTermInDollar (WORD *, WORD) |
| void | TermAssign (WORD *) |
| void | WildDollars (PHEAD WORD *) |
| LONG | numcommute (WORD *, LONG *) |
| int | FullRenumber (PHEAD WORD *, WORD) |
| int | Lus (WORD *, WORD, WORD, WORD, WORD, WORD) |
| int | FindLus (int, int, int) |
| int | CoReplaceLoop (UBYTE *) |
| int | CoFindLoop (UBYTE *) |
| int | DoFindLoop (UBYTE *, int) |
| int | CoFunPowers (UBYTE *) |
| int | SortTheList (int *, int) |
| int | MatchIsPossible (WORD *, WORD *) |
| int | StudyPattern (WORD *) |
| WORD | DolToTensor (PHEAD WORD) |
| WORD | DolToFunction (PHEAD WORD) |
| WORD | DolToVector (PHEAD WORD) |
| WORD | DolToNumber (PHEAD WORD) |
| WORD | DolToSymbol (PHEAD WORD) |
| WORD | DolToIndex (PHEAD WORD) |
| LONG | DolToLong (PHEAD WORD) |
| int | DollarFactorize (PHEAD WORD) |
| int | CoPrintTable (UBYTE *) |
| int | CoDeallocateTable (UBYTE *) |
| void | CleanDollarFactors (DOLLARS) |
| WORD * | TakeDollarContent (PHEAD WORD *, WORD **) |
| WORD * | MakeDollarInteger (PHEAD WORD *, WORD **) |
| WORD * | MakeDollarMod (PHEAD WORD *, WORD **) |
| int | GetDolNum (PHEAD WORD *, WORD *) |
| void | AddPotModdollar (WORD) |
| int | Optimize (WORD, int) |
| int | ClearOptimize (void) |
| int | TakeLongRoot (UWORD *, WORD *, WORD) |
| int | TakeRatRoot (UWORD *, WORD *, WORD) |
| int | MakeRational (WORD, WORD, WORD *, WORD *) |
| int | MakeLongRational (PHEAD UWORD *, WORD, UWORD *, WORD, UWORD *, WORD *) |
| void | ClearTableTree (TABLES) |
| int | InsTableTree (TABLES, WORD *) |
| void | RedoTableTree (TABLES, int) |
| int | FindTableTree (TABLES, WORD *, int) |
| void | finishcbuf (WORD) |
| void | clearcbuf (WORD) |
| void | CleanUpSort (int) |
| FILEHANDLE * | AllocFileHandle (WORD, char *) |
| void | DeAllocFileHandle (FILEHANDLE *) |
| void | LowerSortLevel (void) |
| WORD * | PolyRatFunSpecial (PHEAD WORD *, WORD *) |
| void | SimpleSplitMergeRec (WORD *, WORD, WORD *) |
| void | SimpleSplitMerge (WORD *, WORD) |
| WORD | BinarySearch (WORD *, WORD, WORD) |
| int | InsideDollar (PHEAD WORD *, WORD) |
| DOLLARS | DolToTerms (PHEAD WORD) |
| WORD | EvalDoLoopArg (PHEAD WORD *, WORD) |
| int | SetExprCases (int, int, int) |
| int | TestSelect (WORD *, WORD *) |
| void | SubsInAll (PHEAD0) |
| void | TransferBuffer (int, int, int) |
| int | TakeIDfunction (PHEAD WORD *) |
| int | MakeSetupAllocs (void) |
| NORMDATA * | AllocNormData (void) |
| int | TryFileSetups (void) |
| void | ExchangeExpressions (int, int) |
| void | ExchangeDollars (int, int) |
| int | GetFirstBracket (WORD *, int) |
| int | GetFirstTerm (WORD *, int, int) |
| int | GetContent (WORD *, int) |
| int | CleanupTerm (WORD *) |
| WORD | ContentMerge (PHEAD WORD *, WORD *) |
| UBYTE * | PreIfDollarEval (UBYTE *, int *) |
| LONG | TermsInDollar (WORD) |
| LONG | SizeOfDollar (WORD) |
| LONG | TermsInExpression (WORD) |
| LONG | SizeOfExpression (WORD) |
| WORD * | TranslateExpression (UBYTE *) |
| int | IsSetMember (WORD *, WORD) |
| int | IsMultipleOf (WORD *, WORD *) |
| int | TwoExprCompare (WORD *, WORD *, int) |
| void | UpdatePositions (void) |
| void | M_check (void) |
| void | M_print (void) |
| void | M_check1 (void) |
| void | PrintTime (UBYTE *) |
| POSITION * | FindBracket (WORD, WORD *) |
| void | PutBracketInIndex (PHEAD WORD *, POSITION *) |
| void | ClearBracketIndex (WORD) |
| void | OpenBracketIndex (WORD) |
| int | DoNoParallel (UBYTE *) |
| int | DoParallel (UBYTE *) |
| int | DoModSum (UBYTE *) |
| int | DoModMax (UBYTE *) |
| int | DoModMin (UBYTE *) |
| int | DoModLocal (UBYTE *) |
| UBYTE * | DoModDollar (UBYTE *, int) |
| int | DoProcessBucket (UBYTE *) |
| int | DoinParallel (UBYTE *) |
| int | DonotinParallel (UBYTE *) |
| int | FlipTable (FUNCTIONS, int) |
| int | ChainIn (PHEAD WORD *, WORD) |
| int | ChainOut (PHEAD WORD *, WORD) |
| int | ArgumentImplode (PHEAD WORD *, WORD *) |
| int | ArgumentExplode (PHEAD WORD *, WORD *) |
| int | DenToFunction (WORD *, WORD) |
| WORD | HowMany (PHEAD WORD *, WORD *) |
| void | RemoveDollars (void) |
| LONG | CountTerms1 (PHEAD0) |
| LONG | TermsInBracket (PHEAD WORD *, WORD) |
| int | Crash (void) |
| char * | str_dup (char *) |
| void | convertblock (INDEXBLOCK *, INDEXBLOCK *, int) |
| void | convertnamesblock (NAMESBLOCK *, NAMESBLOCK *, int) |
| void | convertiniinfo (INIINFO *, INIINFO *, int) |
| int | ReadIndex (DBASE *) |
| int | WriteIndexBlock (DBASE *, MLONG) |
| int | WriteNamesBlock (DBASE *, MLONG) |
| int | WriteIndex (DBASE *) |
| int | WriteIniInfo (DBASE *) |
| int | ReadIniInfo (DBASE *) |
| int | AddToIndex (DBASE *, MLONG) |
| DBASE * | GetDbase (char *, MLONG) |
| DBASE * | OpenDbase (char *) |
| char * | ReadObject (DBASE *, MLONG, char *) |
| char * | ReadijObject (DBASE *, MLONG, MLONG, char *) |
| int | ExistsObject (DBASE *, MLONG, char *) |
| int | DeleteObject (DBASE *, MLONG, char *) |
| int | WriteObject (DBASE *, MLONG, char *, char *, MLONG) |
| MLONG | AddObject (DBASE *, MLONG, char *, char *) |
| DBASE * | NewDbase (char *, MLONG) |
| void | FreeTableBase (DBASE *) |
| int | ComposeTableNames (DBASE *) |
| int | PutTableNames (DBASE *) |
| MLONG | AddTableName (DBASE *, char *, TABLES) |
| MLONG | GetTableName (DBASE *, char *) |
| MLONG | FindTableNumber (DBASE *, char *) |
| int | TryEnvironment (void) |
| int | CopyExpression (FILEHANDLE *, FILEHANDLE *) |
| int | set_in (UBYTE, set_of_char) |
| one_byte | set_set (UBYTE, set_of_char) |
| one_byte | set_del (UBYTE, set_of_char) |
| one_byte | set_sub (set_of_char, set_of_char, set_of_char) |
| int | DoPreAddSeparator (UBYTE *) |
| int | DoPreRmSeparator (UBYTE *) |
| int | openExternalChannel (UBYTE *, int, UBYTE *, UBYTE *) |
| int | initPresetExternalChannels (UBYTE *, int) |
| int | closeExternalChannel (int) |
| int | selectExternalChannel (int) |
| int | getCurrentExternalChannel (void) |
| void | closeAllExternalChannels (void) |
| UBYTE * | defineChannel (UBYTE *, HANDLERS *) |
| int | writeToChannel (int, UBYTE *, HANDLERS *) |
| int | writeBufToExtChannelOk (char *, size_t) |
| int | getcFromExtChannelOk (void) |
| int | setKillModeForExternalChannelOk (int, int) |
| int | setTerminatorForExternalChannelOk (char *) |
| int | getcFromExtChannelFailure (void) |
| int | setKillModeForExternalChannelFailure (int, int) |
| int | setTerminatorForExternalChannelFailure (char *) |
| int | writeBufToExtChannelFailure (char *, size_t) |
| int | ReleaseTB (void) |
| int | SymbolNormalize (WORD *) |
| int | TestFunFlag (PHEAD WORD *) |
| WORD | CompareSymbols (PHEAD WORD *, WORD *, WORD) |
| WORD | CompareHSymbols (PHEAD WORD *, WORD *, WORD) |
| WORD | NextPrime (PHEAD WORD) |
| WORD | Moebius (PHEAD WORD) |
| UWORD | wranf (PHEAD0) |
| UWORD | iranf (PHEAD UWORD) |
| void | iniwranf (PHEAD0) |
| UBYTE * | PreRandom (UBYTE *) |
| WORD * | PolyNormPoly (PHEAD WORD) |
| WORD * | EvaluateGcd (PHEAD WORD *) |
| int | TreatPolyRatFun (PHEAD WORD *) |
| int | ReadSaveHeader (void) |
| LONG | ReadSaveIndex (FILEINDEX *) |
| LONG | ReadSaveExpression (UBYTE *, UBYTE *, LONG *, LONG *) |
| UBYTE * | ReadSaveTerm32 (UBYTE *, UBYTE *, UBYTE **, UBYTE *, UBYTE *, int) |
| LONG | ReadSaveVariables (UBYTE *, UBYTE *, LONG *, LONG *, INDEXENTRY *, LONG *) |
| LONG | WriteStoreHeader (WORD) |
| void | InitRecovery (void) |
| int | CheckRecoveryFile (void) |
| void | DeleteRecoveryFile (void) |
| char * | RecoveryFilename (void) |
| int | DoRecovery (int *) |
| void | DoCheckpoint (int) |
| void | NumberMallocAddMemory (PHEAD0) |
| void | CacheNumberMallocAddMemory (PHEAD0) |
| void | TermMallocAddMemory (PHEAD0) |
| void | ExprStatus (EXPRESSIONS) |
| void | iniTools (void) |
| int | TestTerm (WORD *) |
| int | RunTransform (PHEAD WORD *term, WORD *params) |
| int | RunEncode (PHEAD WORD *fun, WORD *args, WORD *info) |
| int | RunDecode (PHEAD WORD *fun, WORD *args, WORD *info) |
| int | RunReplace (PHEAD WORD *fun, WORD *args, WORD *info) |
| int | RunImplode (WORD *fun, WORD *args) |
| int | RunExplode (PHEAD WORD *fun, WORD *args) |
| int | TestArgNum (int n, int totarg, WORD *args) |
| WORD | PutArgInScratch (WORD *arg, UWORD *scrat) |
| UBYTE * | ReadRange (UBYTE *s, WORD *out, int par) |
| int | FindRange (PHEAD WORD *, WORD *, WORD *, WORD) |
| int | RunPermute (PHEAD WORD *fun, WORD *args, WORD *info) |
| int | RunReverse (PHEAD WORD *fun, WORD *args) |
| int | RunCycle (PHEAD WORD *fun, WORD *args, WORD *info) |
| int | RunAddArg (PHEAD WORD *fun, WORD *args) |
| int | RunMulArg (PHEAD WORD *fun, WORD *args) |
| int | RunIsLyndon (PHEAD WORD *fun, WORD *args, int par) |
| WORD | RunToLyndon (PHEAD WORD *fun, WORD *args, int par) |
| int | RunDropArg (PHEAD WORD *fun, WORD *args) |
| int | RunSelectArg (PHEAD WORD *fun, WORD *args) |
| int | RunDedup (PHEAD WORD *fun, WORD *args) |
| int | RunZtoHArg (PHEAD WORD *fun, WORD *args) |
| int | RunHtoZArg (PHEAD WORD *fun, WORD *args) |
| int | NormPolyTerm (PHEAD WORD *) |
| WORD | ComparePoly (WORD *, WORD *, WORD) |
| int | ConvertToPoly (PHEAD WORD *, WORD *, WORD *, WORD) |
| int | LocalConvertToPoly (PHEAD WORD *, WORD *, WORD, WORD) |
| int | ConvertFromPoly (PHEAD WORD *, WORD *, WORD, WORD, WORD, WORD) |
| int | FindSubterm (WORD *) |
| int | FindLocalSubterm (PHEAD WORD *, WORD) |
| void | PrintSubtermList (int, int) |
| void | PrintExtraSymbol (int, WORD *, int) |
| int | FindSubexpression (WORD *) |
| void | UpdateMaxSize (void) |
| int | CoToPolynomial (UBYTE *) |
| int | CoFromPolynomial (UBYTE *) |
| int | CoArgToExtraSymbol (UBYTE *) |
| int | CoExtraSymbols (UBYTE *) |
| UBYTE * | GetDoParam (UBYTE *, WORD **, int) |
| WORD * | GetIfDollarFactor (UBYTE **, WORD *) |
| int | CoDo (UBYTE *) |
| int | CoEndDo (UBYTE *) |
| int | ExtraSymFun (PHEAD WORD *, WORD) |
| int | PruneExtraSymbols (WORD) |
| int | IniFbuffer (WORD) |
| void | IniFbufs (void) |
| int | GCDfunction (PHEAD WORD *, WORD) |
| WORD * | GCDfunction3 (PHEAD WORD *, WORD *) |
| int | ReadPolyRatFun (PHEAD WORD *) |
| int | FromPolyRatFun (PHEAD WORD *, WORD **, WORD **) |
| WORD * | PolyDiv (PHEAD WORD *, WORD *, char *) |
| void | GCDclean (PHEAD WORD *, WORD *) |
| WORD * | TakeSymbolContent (PHEAD WORD *, WORD *) |
| int | GCDterms (PHEAD WORD *, WORD *, WORD *) |
| WORD * | PutExtraSymbols (PHEAD WORD *, WORD, int *) |
| WORD * | TakeExtraSymbols (PHEAD WORD *, WORD) |
| WORD * | MultiplyWithTerm (PHEAD WORD *, WORD *, WORD) |
| WORD * | TakeContent (PHEAD WORD *, WORD *) |
| int | MergeSymbolLists (PHEAD WORD *, WORD *, int) |
| int | MergeDotproductLists (PHEAD WORD *, WORD *, int) |
| WORD * | CreateExpression (PHEAD WORD) |
| int | DIVfunction (PHEAD WORD *, WORD, int) |
| WORD * | MULfunc (PHEAD WORD *, WORD *) |
| WORD * | ConvertArgument (PHEAD WORD *, int *) |
| int | ExpandRat (PHEAD WORD *) |
| int | InvPoly (PHEAD WORD *, WORD, WORD) |
| WORD | TestDoLoop (PHEAD WORD *, WORD) |
| WORD | TestEndDoLoop (PHEAD WORD *, WORD) |
| WORD * | poly_gcd (PHEAD WORD *, WORD *, WORD) |
| WORD * | poly_div (PHEAD WORD *, WORD *, WORD) |
| WORD * | poly_rem (PHEAD WORD *, WORD *, WORD) |
| WORD * | poly_inverse (PHEAD WORD *, WORD *) |
| WORD * | poly_mul (PHEAD WORD *, WORD *) |
| WORD * | poly_ratfun_add (PHEAD WORD *, WORD *) |
| int | poly_ratfun_normalize (PHEAD WORD *) |
| int | poly_factorize_argument (PHEAD WORD *, WORD *) |
| WORD * | poly_factorize_dollar (PHEAD WORD *) |
| int | poly_factorize_expression (EXPRESSIONS) |
| int | poly_unfactorize_expression (EXPRESSIONS) |
| void | poly_free_poly_vars (PHEAD const char *) |
| void | optimize_print_code (int) |
| int | DoPreAdd (UBYTE *s) |
| int | DoPreUseDictionary (UBYTE *s) |
| int | DoPreCloseDictionary (UBYTE *s) |
| int | DoPreOpenDictionary (UBYTE *s) |
| void | RemoveDictionary (DICTIONARY *dict) |
| void | UnSetDictionary (void) |
| int | SetDictionaryOptions (UBYTE *options) |
| int | AddToDictionary (DICTIONARY *dict, UBYTE *left, UBYTE *right) |
| int | AddDictionary (UBYTE *name) |
| int | FindDictionary (UBYTE *name) |
| UBYTE * | IsExponentSign (void) |
| UBYTE * | IsMultiplySign (void) |
| void | TransformRational (UWORD *a, WORD na) |
| void | WriteDictionary (DICTIONARY *) |
| void | ShrinkDictionary (DICTIONARY *) |
| void | MultiplyToLine (void) |
| UBYTE * | FindSymbol (WORD num) |
| UBYTE * | FindVector (WORD num) |
| UBYTE * | FindIndex (WORD num) |
| UBYTE * | FindFunction (WORD num) |
| UBYTE * | FindFunWithArgs (WORD *t) |
| UBYTE * | FindExtraSymbol (WORD num) |
| LONG | DictToBytes (DICTIONARY *dict, UBYTE *buf) |
| DICTIONARY * | DictFromBytes (UBYTE *buf) |
| int | CoCreateSpectator (UBYTE *inp) |
| int | CoToSpectator (UBYTE *inp) |
| int | CoRemoveSpectator (UBYTE *inp) |
| int | CoEmptySpectator (UBYTE *inp) |
| int | CoCopySpectator (UBYTE *inp) |
| int | PutInSpectator (WORD *, WORD) |
| void | ClearSpectators (WORD) |
| WORD | GetFromSpectator (WORD *, WORD) |
| void | FlushSpectators (void) |
| WORD * | PreGCD (PHEAD WORD *, WORD *, int) |
| int | ReadFromScratch (FILEHANDLE *, POSITION *, UBYTE *, POSITION *) |
| int | AddToScratch (FILEHANDLE *, POSITION *, UBYTE *, POSITION *, int) |
| int | DoPreAppendPath (UBYTE *) |
| int | DoPrePrependPath (UBYTE *) |
| int | DoSwitch (PHEAD WORD *, WORD *) |
| int | DoEndSwitch (PHEAD WORD *, WORD *) |
| SWITCHTABLE * | FindCase (WORD, WORD) |
| void | SwitchSplitMergeRec (SWITCHTABLE *, WORD, SWITCHTABLE *) |
| void | SwitchSplitMerge (SWITCHTABLE *, WORD) |
| int | DoubleSwitchBuffers (void) |
| int | DistrN (int, int *, int, int *) |
| int | DoNamespace (UBYTE *) |
| int | DoEndNamespace (UBYTE *) |
| int | DoUse (UBYTE *) |
| UBYTE * | SkipName (UBYTE *) |
| UBYTE * | ConstructName (UBYTE *, UBYTE) |
| int | DoSetUserFlag (UBYTE *) |
| int | DoClearUserFlag (UBYTE *) |
| VERTEX * | CreateVertex (MODEL *) |
| UBYTE * | ReadParticle (UBYTE *, VERTEX *, MODEL *, int) |
| int | CoModel (UBYTE *) |
| int | CoParticle (UBYTE *) |
| int | CoVertex (UBYTE *) |
| int | CoEndModel (UBYTE *) |
| int | LoadModel (MODEL *) |
| int | CoSetUserFlag (UBYTE *) |
| int | CoClearUserFlag (UBYTE *) |
| int | CoCreateAllLoops (UBYTE *) |
| int | CoCreateAllPaths (UBYTE *) |
| int | CoCreateAll (UBYTE *) |
| int | AllLoops (PHEAD WORD *, WORD) |
| LONG | StartLoops (PHEAD WORD *, WORD, LONG, WORD, WORD *, WORD, WORD *, WORD) |
| LONG | GenLoops (PHEAD WORD *, WORD, LONG, WORD, WORD *, WORD, WORD *, WORD) |
| void | LoopOutput (PHEAD WORD *, WORD, WORD *, WORD) |
| int | AllPaths (PHEAD WORD *, WORD) |
| LONG | GenPaths (PHEAD WORD *, WORD, LONG, WORD, WORD *, WORD, WORD *, WORD) |
| void | PathOutput (PHEAD WORD *, WORD, WORD *, WORD) |
Contains macros and function declarations.
Definition in file declare.h.
| #define GETCOEF | ( | x, | |
| y | |||
| ) | x += *x;y = x[-1];x -= ABS(y);y=REDLENG(y) |
| #define StuffAdd | ( | x, | |
| y | |||
| ) | (((x)<0?-1:1)*(y)+((y)<0?-1:1)*(x)) |
| #define EXCHN | ( | t1, | |
| t2, | |||
| n | |||
| ) | { WORD a,i; for(i=0;i<n;i++){a=t1[i];t1[i]=t2[i];t2[i]=a;} } |
| #define EXCH | ( | x, | |
| y | |||
| ) | { WORD a = (x); (x) = (y); (y) = a; } |
| #define TOKENTOLINE | ( | x, | |
| y | |||
| ) |
| #define UngetFromStream | ( | stream, | |
| c | |||
| ) | ((stream)->nextchar[(stream)->isnextchar++]=c) |
| #define ParseNumber | ( | x, | |
| s | |||
| ) | {(x)=0;while(*(s)>='0'&&*(s)<='9')(x)=10*(x)+*(s)++ -'0';} |
| #define ParseSign | ( | sgn, | |
| s | |||
| ) |
| #define ParseSignedNumber | ( | x, | |
| s | |||
| ) |
| #define NCOPY | ( | s, | |
| t, | |||
| n | |||
| ) | { while ( (n)-- > 0 ) { *s++ = *t++; } } |
| #define NCOPYI | ( | s, | |
| t, | |||
| n | |||
| ) | { while ( (n)-- > 0 ) { *s++ = *t++; } } |
| #define NCOPYB | ( | s, | |
| t, | |||
| n | |||
| ) | { while ( (n)-- > 0 ) { *s++ = *t++; } } |
| #define NCOPYI32 | ( | s, | |
| t, | |||
| n | |||
| ) | { while ( (n)-- > 0 ) { *s++ = *t++; } } |
| #define WCOPY | ( | s, | |
| t, | |||
| n | |||
| ) | { int nn=n; WORD *ss=(WORD *)s, *tt=(WORD *)t; while ( (nn)-- > 0 ) { *ss++ = *tt++; } } |
| #define NeedNumber | ( | x, | |
| s, | |||
| err | |||
| ) |
| #define SKIPBLANKS | ( | s | ) | { while ( *(s) == ' ' || *(s) == '\t' ) (s)++; } |
| #define FLUSHCONSOLE if ( AP.InOutBuf > 0 ) CharOut(LINEFEED) |
| #define SKIPBRA1 | ( | s | ) |
| #define SKIPBRA2 | ( | s | ) |
| #define SKIPBRA3 | ( | s | ) |
| #define SKIPBRA4 | ( | s | ) |
| #define SKIPBRA5 | ( | s | ) |
| #define CYCLE1 | ( | t, | |
| a, | |||
| i | |||
| ) | {t iX=*a; WORD jX; for(jX=1;jX<i;jX++)a[jX-1]=a[jX]; a[i-1]=iX;} |
| #define AddToCB | ( | c, | |
| wx | |||
| ) |
| #define EXCHINOUT |
| #define BACKINOUT |
| #define CopyArg | ( | to, | |
| from | |||
| ) |
| #define NEXTARG | ( | x | ) | if(*x>0) x += *x; else if(*x <= -FUNCTION)x++; else x += 2; |
| #define COPY1ARG | ( | s1, | |
| t1 | |||
| ) |
| #define ZeroFillRange | ( | w, | |
| begin, | |||
| end | |||
| ) |
Fills a buffer by zero in the range [begin,end).
| w | The buffer. |
| begin | The index for the beginning of the range. |
| end | The index for the end of the range (exclusive). |
| #define TABLESIZE | ( | a, | |
| b | |||
| ) | (((WORD)sizeof(a))/((WORD)sizeof(b))) |
| #define VARNAME | ( | type, | |
| num | |||
| ) | (AC.varnames->namebuffer+type[num].name) |
| #define DOLLARNAME | ( | type, | |
| num | |||
| ) | (AC.dollarnames->namebuffer+type[num].name) |
| #define EXPRNAME | ( | num | ) | (AC.exprnames->namebuffer+Expressions[num].name) |
| #define Terminate | ( | x | ) | do { TerminateImpl(x, __FILE__, __LINE__, __FUNCTION__); } while(0) |
| #define ISEQUALPOSINC | ( | pp1, | |
| pp2, | |||
| x | |||
| ) | ( (pp1).p1 == ((pp2).p1+(LONG)(x)) ) |
| #define ISGEPOSINC | ( | pp1, | |
| pp2, | |||
| x | |||
| ) | ( (pp1).p1 >= ((pp2).p1+(LONG)(x)) ) |
| #define DIFPOS | ( | ss, | |
| pp1, | |||
| pp2 | |||
| ) | (ss).p1 = ((pp1).p1-(pp2).p1) |
| #define ISNOTEQUALPOS | ( | pp1, | |
| pp2 | |||
| ) | ( (pp1).p1 != (pp2).p1 ) |
| #define Add2Com | ( | x | ) | { WORD cod[2]; cod[0] = x; cod[1] = 2; AddNtoL(2,cod); } |
| #define Add3Com | ( | x1, | |
| x2 | |||
| ) | { WORD cod[3]; cod[0] = x1; cod[1] = 3; cod[2] = x2; AddNtoL(3,cod); } |
| #define Add4Com | ( | x1, | |
| x2, | |||
| x3 | |||
| ) |
| #define Add5Com | ( | x1, | |
| x2, | |||
| x3, | |||
| x4 | |||
| ) |
| #define WantAddPointers | ( | x | ) |
| #define WantAddLongs | ( | x | ) |
| #define WantAddPositions | ( | x | ) |
| #define TermMalloc | ( | x | ) | ( (AT.TermMemTop <= 0 ) ? TermMallocAddMemory(BHEAD0), AT.TermMemHeap[--AT.TermMemTop]: AT.TermMemHeap[--AT.TermMemTop] ) |
| #define NumberMalloc | ( | x | ) | ( (AT.NumberMemTop <= 0 ) ? NumberMallocAddMemory(BHEAD0), AT.NumberMemHeap[--AT.NumberMemTop]: AT.NumberMemHeap[--AT.NumberMemTop] ) |
| #define CacheNumberMalloc | ( | x | ) | ( (AT.CacheNumberMemTop <= 0 ) ? CacheNumberMallocAddMemory(BHEAD0), AT.CacheNumberMemHeap[--AT.CacheNumberMemTop]: AT.CacheNumberMemHeap[--AT.CacheNumberMemTop] ) |
| #define TermFree | ( | TermMem, | |
| x | |||
| ) | AT.TermMemHeap[AT.TermMemTop++] = (WORD *)(TermMem) |
| #define NumberFree | ( | NumberMem, | |
| x | |||
| ) | AT.NumberMemHeap[AT.NumberMemTop++] = (UWORD *)(NumberMem) |
| #define CacheNumberFree | ( | NumberMem, | |
| x | |||
| ) | AT.CacheNumberMemHeap[AT.CacheNumberMemTop++] = (UWORD *)(NumberMem) |
| #define NestingChecksum | ( | ) | (AC.IfLevel + AC.RepLevel + AC.arglevel + AC.insidelevel + AC.termlevel + AC.inexprlevel + AC.dolooplevel +AC.SwitchLevel) |
| #define MesNesting | ( | ) | MesPrint("&Illegal nesting of if, repeat, argument, inside, term, inexpression and do") |
| #define MarkPolyRatFunDirty | ( | T | ) |
| #define PUSHPREASSIGNLEVEL |
| #define POPPREASSIGNLEVEL |
| #define EXTERNLOCK | ( | x | ) |
|
extern |
All functions (well, nearly all) are declared here.
Definition at line 952 of file startup.c.
References AddNtoC(), AddRHS(), Compare1(), inicbufs(), FuNcTiOn::name, PF_BroadcastNumber(), PutPreVar(), and FuNcTiOn::symmetric.

|
extern |
|
extern |
|
extern |
Puts the term at position in the accumulator accum at position 'number+1'. if times > 0 the coefficient of this term is multiplied by times/divby.
| number | The number of term fragments in accum that should be skipped |
| accum | The accumulator of term fragments |
| position | A position in (typically) a compiler buffer from where a (piece of a) term comes. |
| times | Multiply the result by this |
| divby | Divide the result by this. |
This routine is typically used when we have to replace a (sub)expression pointer by a power of a (sub)expression. This uses mostly a binomial expansion and the new term is the old term multiplied one by one by terms of the new expression. The factors times and divby keep track of the binomial coefficient. Once this is complete, the routine FiniTerm will make the contents of the accumulator into a proper term that still needs to be normalized.
Definition at line 2985 of file proces.c.
Referenced by Generator().
|
extern |
|
extern |
Adds the arguments of two occurrences of the PolyFun.
| s1 | Pointer to the first occurrence. |
| s2 | Pointer to the second occurrence. |
| m | Pointer to where the answer should be. |
Definition at line 2048 of file sort.c.
Referenced by AddPoly(), and MergePatches().
|
extern |
Adds the coefficients of the terms *ps1 and *ps2. The problem comes when there is not enough space for a new longer coefficient. First a local solution is tried. If this is not successful we need to move terms around. The possibility of a garbage collection should not be ignored, as avoiding this costs very much extra space which is nearly wasted otherwise.
If the return value is zero the terms cancelled.
The resulting term is left in *ps1.
Definition at line 1747 of file sort.c.
References GarbHand(), and NormalModulus().
Referenced by SplitMerge().

|
extern |
|
extern |
|
extern |
Routine should be called when S->PolyWise != 0. It points then to the position of AR.PolyFun in both terms.
We add the contents of the arguments of the two polynomials. Special attention has to be given to special arguments. We have to reserve a space equal to the size of one term + the size of the argument of the other. The addition has to be done in this routine because not all objects are reentrant.
Newer addition (12-nov-2007). The PolyFun can have two arguments. In that case S->PolyFlag is 2 and we have to call the routine for adding rational polynomials. We have to be rather careful what happens with: The location of the output The order of the terms in the arguments At first we allow only univariate polynomials in the PolyFun. This restriction will be lifted a.s.a.p.
| ps1 | A pointer to the position of the first term |
| ps2 | A pointer to the position of the second term |
Definition at line 1876 of file sort.c.
References AddArgs(), GarbHand(), and poly_ratfun_add().
Referenced by SplitMerge().

|
extern |
|
extern |
Definition at line 1544 of file wildcard.c.
|
extern |
|
extern |
|
extern |
Definition at line 1791 of file wildcard.c.
|
extern |
Definition at line 1518 of file wildcard.c.
|
extern |
Routine takes a1 mod m1 and a2 mod m2 and returns a mod m1*m2 with a mod m1 = a1 and a mod m2 = a2
Chinese remainder: a%(m1*m2) = q1*m1+a1 a%(m1*m2) = q2*m2+a2 Compute n1 such that (n1*m1)m2 is one Compute n2 such that (n2*m2)m1 is one Then (a1*n2*m2+a2*n1*m1)%(m1*m2) is a%(m1*m2)
Definition at line 3048 of file reken.c.
Referenced by Compare1().
|
extern |
Definition at line 373 of file function.c.
|
extern |
Compares two terms. The answer is: 0 equal ( with exception of the coefficient if level == 0. ) >0 term1 comes first. <0 term2 comes first. Some special precautions may be needed to keep the CompCoef routine from generating overflows, although this is very unlikely in subterms. This routine should not return an error condition.
Originally this routine was called Compare. With the treatment of special polynomials with terms that contain only symbols and the need for extreme speed for the polynomial routines we made a special compare routine and now we store the address of the current compare routine in AR.CompareRoutine and have a macro Compare which makes all existing code work properly and we can just replace the routine on a thread by thread basis (each thread has its own AR struct).
| term1 | First input term |
| term2 | Second input term |
| level | The sorting level (may influence on the result) |
When there are floating point numbers active (float_ = FLOATFUN) the presence of one or more float_ functions is returned in AT.SortFloatMode: 0: no float_ 1: float_ in term1 only 2: float_ in term2 only 3: float_ in both terms
Definition at line 2341 of file sort.c.
References CompCoef().
Referenced by InFunction(), poly_sort(), and StartVariables().

|
extern |
Picks up the deferred brackets. These are the bracket contents of which we postpone the reading when we use the 'Keep Brackets' statement. These contents are multiplying the terms just before they are sent to the sorting system. Special attention goes to having it thread-safe We have to lock positioning the file and reading it in a thread specific buffer.
| term | The term that must be multiplied by the contents of the current bracket |
| level | The compiler level. This is needed because after multiplying term by term we call Generator again. |
Definition at line 4837 of file proces.c.
References Generator(), and InsertTerm().
Referenced by Generator().

|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
Definition at line 64 of file diagrams.c.
|
extern |
Definition at line 185 of file diagrams.c.
|
extern |
Definition at line 806 of file diawrap.cc.
|
extern |
Definition at line 346 of file diagrams.c.
|
extern |
Definition at line 555 of file diagrams.c.
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
Routine gets one power of an expression in the scratch system. If there are more powers needed there will be a recursion.
No attempt is made to use binomials because we have no information about commuting properties.
There is a searching for the contents of brackets if needed. This searching may be rather slow because of the single links.
| term | is the term we are adding to. |
| power | is the power of the expression that we need. |
| nexp | is the number of the expression. |
| accum | is the accumulator of terms. It accepts the termfragments that are made into a proper term in FiniTerm |
| aa | points to the start of the entire accumulator. In *aa we store the number of term fragments that are in the accumulator. |
| level | is the current depth in the tree of statements. It is needed to continue to the next operation/substitution with each generated term |
| freeze | is the pointer to the bracket information that should be matched. |
Definition at line 4616 of file proces.c.
References DoOnePow(), FiniTerm(), Generator(), and FiLe::handle.
Referenced by DoOnePow(), and Generator().

|
extern |
|
extern |
|
extern |
Finishes a sort. At AR.sLevel == 0 the output is to the regular output stream. When AR.sLevel > 0, the parameter par determines the actual output. The AR.sLevel will be popped. All ongoing stages are finished and if the sortfile is open it is closed. The statistics are printed when AR.sLevel == 0 par == 0 Output to the buffer. par == 1 Sort for function arguments. The output will be copied into the buffer. It is assumed that this is in the WorkSpace. par == 2 Sort for $-variable. We return the address of the buffer that contains the output in buffer (treated like WORD **). We first catch the output in a file (unless we can intercept things after the small buffer has been sorted) Then we read from the file into a buffer. Only when par == 0 data compression can be attempted at AT.SS==AT.S0.
| buffer | buffer for output when needed |
| par | See above |
Definition at line 454 of file sort.c.
References ComPress(), FlushOut(), MergePatches(), PF_EndSort(), PutOut(), SplitMerge(), StageSort(), and WriteStats().
Referenced by generate_expression(), get_expression(), InFunction(), MakeDollarInteger(), MakeDollarMod(), PF_CollectModifiedDollars(), PF_Processor(), poly_factorize_expression(), poly_sort(), poly_unfactorize_expression(), PolyFunMul(), Processor(), TakeArgContent(), and TestMatch().

|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
Concatenates the contents of the accumulator into a single legal term, which replaces the subexpression pointer
| term | the input term with the (sub)expression subterm |
| accum | the accumulator with the term fragments |
| termout | the location where the output should be written |
| number | the number of term fragments in the accumulator |
| tepos | the position of the subterm in term to be replaced |
Definition at line 3050 of file proces.c.
Referenced by DoOnePow(), and Generator().
|
extern |
Completes output to an output file and writes the trailing zero.
| position | The position in the file after writing |
| fi | The file (or its cache) |
| compr | Indicates whether there should be compression with gzip. |
Definition at line 1533 of file sort.c.
References FiLe::handle, BrAcKeTiNfO::indexbuffer, and PF_ISendSbuf().
Referenced by EndSort(), MergePatches(), PF_EndSort(), and Processor().

|
extern |
Garbage collection that takes place when the small extension is full and we need to place more terms there. When this is the case there are many holes in the small buffer and the whole can be compactified. The major complication is the buffer for SplitMerge. There are to options for temporary memory: 1: find some buffer that has enough space (maybe in the large buffer). 2: allocate a buffer. Give it back afterwards of course. If the small extension is properly dimensioned this routine should be called very rarely. Most of the time it will be called when the polyfun or polyratfun is active.
|
extern |
|
extern |
|
extern |
The heart of the program. Here the expansion tree is set up in one giant recursion
| term | the input term. may be overwritten |
| level | the level in the compiler buffer (number of statement) |
The routine looks first whether there are unsubstituted (sub)expressions. If so, one of them gets inserted term by term and the new term is used in a renewed call to Generator. If there are no (sub)expressions, the term is normalized, the compiler level is raised (next statement) and the program looks what type of statement this is. If this is a special statement it is either treated on the spot or the appropriate routine is called. If it is a substitution, the pattern matcher is called (TestMatch) which tells whether there was a match. If so we need to call TestSub again to test for (sub)expressions. If we run out of levels, the term receives a final treatment for modulus calculus and/or brackets and is then sent off to the sorting routines.
Definition at line 3249 of file proces.c.
References Deferred(), DoOnePow(), FiniTerm(), Generator(), InFunction(), InsertTerm(), CbUf::lhs, VaRrEnUm::lo, PasteFile(), PasteTerm(), PF_Deferred(), CbUf::Pointer, PolyFunMul(), PrepPoly(), PutPreVar(), CbUf::rhs, StoreTerm(), ReNuMbEr::symb, and TestMatch().
Referenced by Deferred(), DoOnePow(), generate_expression(), Generator(), InFunction(), MakeDollarInteger(), MakeDollarMod(), PF_CollectModifiedDollars(), PF_Deferred(), PF_Processor(), poly_factorize_expression(), poly_unfactorize_expression(), Processor(), and TestMatch().

|
extern |
|
extern |
|
extern |
|
extern |
Makes the replacement of the subexpression with the number 'replac' in a function argument. Additional information is passed in some of the AR, AN, AT variables.
| term | The input term |
| termout | The output term |
Special attention should be given to nested functions!
Definition at line 2160 of file proces.c.
References Compare1(), CompareSymbols(), EndSort(), Generator(), LowerSortLevel(), NewSort(), StoreTerm(), and SymbolNormalize().
Referenced by Generator().

|
extern |
Puts the terms 'term' and 'position' together into a single legal term in termout. replac is the number of the subexpression that should be replaced. It must be a positive term. When action is needed in the argument of a function all terms in that argument are dealt with recursively. The subexpression is sorted. Only one subexpression is done at a time this way.
| term | the input term |
| replac | number of the subexpression pointer to replace |
| extractbuff | number of the compiler buffer replac refers to |
| position | position from where to take the term in the compiler buffer |
| termout | the output term |
| tepos | offset in term where the subexpression is. |
Definition at line 2727 of file proces.c.
Referenced by Deferred(), Generator(), and PF_Deferred().
|
extern |
Definition at line 51 of file function.c.
|
extern |
Definition at line 97 of file function.c.
|
extern |
Definition at line 139 of file function.c.
|
extern |
Definition at line 174 of file function.c.
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
Definition at line 826 of file function.c.
|
extern |
The general merge routine. Can be used for the large buffer and the file merging. The array S->Patches tells where the patches start S->pStop tells where they end (has to be computed first). The end of a 'line to be merged' is indicated by a zero. If the end is reached without running into a zero or a term runs over the boundary of a patch it is a file merging operation and a new piece from the file is read in.
| par | If par == 0 the sort is for file -> outputfile. If par == 1 the sort is for large buffer -> sortfile. If par == 2 the sort is for large buffer -> outputfile. |
Definition at line 3461 of file sort.c.
References AddArgs(), FlushOut(), FiLe::handle, NormalModulus(), poly_ratfun_add(), PutIn(), PutOut(), Sflush(), and StageSort().
Referenced by EndSort(), and StoreTerm().

|
extern |
|
extern |
|
extern |
|
extern |
Starts a new sort. At the lowest level this is a 'main sort' with the struct according to the parameters in S0. At higher levels this is a sort for functions, subroutines or dollars. We prepare the arrays and structs.
Definition at line 359 of file sort.c.
Referenced by generate_expression(), get_expression(), InFunction(), MakeDollarInteger(), MakeDollarMod(), PF_CollectModifiedDollars(), PF_Processor(), poly_factorize_expression(), poly_sort(), poly_unfactorize_expression(), PolyFunMul(), Processor(), TakeArgContent(), and TestMatch().
|
extern |
|
extern |
|
extern |
Gets a term from stored expression expr and puts it in the accumulator at position number. It returns the length of the term that came from file.
| number | number of partial terms to skip in accum |
| accum | the accumulator |
| position | file position from where to get the stored term |
| accfill | returns tail position in accum |
| renumber | the renumber struct for the variables in the stored expression |
| freeze | information about if we need only the contents of a bracket |
| nexpr | the number of the stored expression |
Definition at line 2863 of file proces.c.
Referenced by Generator().
|
extern |
Multiplies the arguments of multiple occurrences of the polyfun. In this routine we do the original PolyFun with one argument only. The PolyRatFun (PolyFunType = 2) is done in a dedicated routine in the file polywrap.cc The new result is written over the old result.
| term | It contains the input term and later the output. |
Definition at line 5353 of file proces.c.
References EndSort(), LowerSortLevel(), NewSort(), poly_ratfun_normalize(), and StoreTerm().
Referenced by Generator().

|
extern |
Routine checks whether the count of function AR.PolyFun is zero or one. If it is one and it has one scalarlike argument the coefficient of the term is pulled inside the argument. If the count is zero a new function is made with the coefficient as its only argument. The function should be placed at its proper position.
When this function is active it places the PolyFun as last object before the coefficient. This is needed because otherwise the compress algorithm has problems in MergePatches.
The bracket routine should also place the PolyFun at a comparable spot. The compression should then stop at the PolyFun. It doesn't really have to stop when writing the final result but this may be too complicated.
The parameter par tells whether we are at groundlevel or inside a function or dollar variable.
Definition at line 4965 of file proces.c.
References poly_ratfun_normalize().
Referenced by Generator().

|
extern |
This is the central processor. It accepts a stream of Expressions which is accessed by calls to GetTerm. The expressions reside either in AR.infile or AR.hidefile The definitions of an expression are seen as an id-statement, so the primary Expressions should be written to the system of scratch files as single terms with an expression pointer. Each expression is terminated with a zero and the whole is terminated by two zeroes.
The routine DoExecute should determine whether results are to be printed, should revert the scratch I/O directions etc. In principle it is DoExecute that calls Processor.
Definition at line 64 of file proces.c.
References CbUf::Buffer, EndSort(), FlushOut(), Generator(), CbUf::lhs, LowerSortLevel(), NewSort(), PF_BroadcastRHS(), PF_InParallelProcessor(), PF_Processor(), CbUf::Pointer, poly_factorize_expression(), poly_unfactorize_expression(), PutOut(), CbUf::rhs, and StoreTerm().

|
extern |
|
extern |
Prints the list of available features.
Definition at line 131 of file features.cc.
|
extern |
Reads a new patch from position in file handle. It is put at buffer, anything after take is moved forward. This would be part of a term that hasn't been used yet. Because of this there should be some space before the start of the buffer
| file | The file system from which to read |
| position | The position from which to read |
| buffer | The buffer into which to read |
| take | The unused tail should be moved before the buffer |
| npat | The number of the patch. Is needed if the information was compressed with gzip, because each patch has its own independent gzip encoding. |
Definition at line 1025 of file sort.c.
References FiLe::handle.
Referenced by MergePatches().
|
extern |
|
extern |
Routine writes one term to file handle at position. It returns the new value of the position.
NOTE: For 'final output' we may have to index the brackets. See the struct BRACKETINDEX. We should maintain: 1: a list with brackets array with the brackets 2: a list of objects of type BRACKETINDEX. It contains array with either pointers or offsets to the list of brackets. starting positions in the file. The index may be tied to a maximum size. In that case we may have to prune the list occasionally.
| term | The term to be written |
| position | The position in the file. Afterwards it is updated |
| fi | The file (or its cache) to which should be written |
| ncomp | Information about what type of compression should be used |
Definition at line 1171 of file sort.c.
References FiLe::handle, and PF_ISendSbuf().
Referenced by EndSort(), generate_expression(), MergePatches(), PF_EndSort(), PF_Processor(), and Processor().

|
extern |
Computes power x^n and caches the value
Calculates the power x^n and stores the results for caching purposes. The pointer c (i.e., the pointer, and not what it points to) is overwritten. What it points to should not be overwritten in the calling function.
Definition at line 1297 of file reken.c.
Referenced by poly::divmod_heap(), poly::divmod_univar(), and poly::mul_heap().
|
extern |
Brings a modular representation in the range -p/2 to +p/2 The return value tells whether anything was done. Routine made in the general modulus revamp of July 2008 (JV).
Definition at line 1404 of file reken.c.
Referenced by AddCoef(), and MergePatches().
|
extern |
Makes a table of inverses in modular calculus The modulus is in AC.cmod and AC.ncmod One should notice that the table of inverses can only be made if the modulus fits inside a single FORM word. Otherwise the table lookup becomes too difficult and the table too long.
Definition at line 1441 of file reken.c.
References GetModInverses().

|
extern |
Input m1 and m2, which are relative prime. determines a*m1+b*m2 = 1 (and 1 is the gcd of m1 and m2) then a*m1 = 1 mod m2 and hence im1 = a. and b*m2 = 1 mod m1 and hence im2 = b. Set m1 = 0*m1+1*m2 = a1*m1+b1*m2 m2 = 1*m1+0*m2 = a2*m1+b2*m2 If everything is OK, the return value is zero
Definition at line 1477 of file reken.c.
Referenced by poly::divmod_heap(), poly::divmod_univar(), MakeDollarMod(), MakeInverses(), MakeMod(), TakeContent(), and TakeSymbolContent().
|
extern |
|
extern |
|
extern |
Definition at line 1361 of file wildcard.c.
|
extern |
Definition at line 1618 of file function.c.
|
extern |
|
extern |
|
extern |
|
extern |
Reads the next file index and puts it into AR.StoreData.Index. TODO
Definition at line 2320 of file store.c.
References WriteStoreHeader().

|
extern |
Puts the contents of a buffer to output Only to be used when there is a single patch in the large buffer.
| fi | The filesystem (or its cache) to which the patch should be written |
Definition at line 1085 of file sort.c.
References FiLe::handle.
Referenced by MergePatches().
|
extern |
|
extern |
Sorts the wildcard entries in the parameter w. Double entries are removed. Full space taken is nw words. Routine serves for the reading of wildcards in the compiler. The entries come in the format: (type,4,number,0) in which the zero is reserved for the future replacement of 'number'.
| w | buffer with wildcard entries. |
| nw | number of wildcard entries. |
|
extern |
|
extern |
Algorithm by J.A.M.Vermaseren (31-7-1988)
Note that AN.SplitScratch and AN.InScratch are used also in GarbHand
Merge sort in memory. The input is an array of pointers. Sorting is done recursively by dividing the array in two equal parts and calling SplitMerge for each. When the parts are small enough we can do the compare and take the appropriate action. An addition is that we look for 'runs'. Sequences that are already ordered. This happens a lot when there is very little action in a module. This made FORM faster by a few percent.
| Pointer | The array of pointers to the terms to be sorted. |
| number | The number of pointers in Pointer. |
The terms are supposed to be sitting in the small buffer and there is supposed to be an extension to this buffer for when there are two terms that should be added and the result takes more space than each of the original terms. The notation guarantees that the result never needs more space than the sum of the spaces of the original terms.
Definition at line 3066 of file sort.c.
References AddCoef(), AddPoly(), and SplitMerge().
Referenced by EndSort(), SplitMerge(), and StoreTerm().

|
extern |
The central routine to accept terms, store them and keep things at least partially sorted. A call to EndSort will then complete storing and sorting.
| term | The term to be stored |
Definition at line 4244 of file sort.c.
References ComPress(), MergePatches(), SplitMerge(), and WriteStats().
Referenced by Generator(), get_expression(), InFunction(), PF_Processor(), poly_sort(), PolyFunMul(), Processor(), and TakeArgContent().

|
extern |
|
extern |
|
extern |
Definition at line 633 of file function.c.
|
extern |
Definition at line 518 of file function.c.
|
extern |
Definition at line 213 of file function.c.
|
extern |
Definition at line 473 of file function.c.
|
extern |
|
extern |
|
extern |
|
extern |
!! WORD *memterm=term; static LONG ctrap=0; !!!
!! ctrap++; !!!
Definition at line 2427 of file store.c.
References ReNuMbEr::func, ReNuMbEr::funnum, ReNuMbEr::indi, ReNuMbEr::indnum, ReNuMbEr::symb, ReNuMbEr::symnum, TermRenumber(), ReNuMbEr::vecnum, and ReNuMbEr::vect.
Referenced by TermRenumber().

|
extern |
This routine governs the pattern matching. If it decides that a substitution should be made, this can be either the insertion of a right hand side (C->rhs) or the automatic generation of terms as a result of an operation (like trace). The object to be replaced is removed from term and a subexpression pointer is inserted. If the substitution is made more than once there can be more subexpression pointers. Its number is positive as it corresponds to the level at which the C->rhs can be found in the compiler output. The subexpression pointer contains the wildcard substitution information. The power is found in *AT.TMout. For operations the subexpression pointer is negative and corresponds to an address in the array AT.TMout. In this array are then the instructions for the routine to be called and its number in the array 'Operations' The format is here: length,functionnumber,length-2 parameters
There is a certain complexity wrt repeat levels. Another complication is the poking of the wildcard values in the subexpression prototype in the compiler buffer. This was how things were done in the past with sequential FORM, but with the advent of TFORM this cannot be maintained. Now, for TFORM we make a copy of it. 7-may-2008 (JV): We cannot yet guarantee that this has been done 100% correctly. There are errors that occur in TFORM only and that may indicate problems.
Definition at line 97 of file pattern.c.
References AddRHS(), EndSort(), Generator(), CbUf::lhs, LowerSortLevel(), and NewSort().
Referenced by Generator().

|
extern |
Returns the CPU time.
| par | If zero, the CPU time will be reset to 0. |
Definition at line 3487 of file tools.c.
Referenced by PF_GetSlaveTimes(), PF_Processor(), and WriteStats().
|
extern |
Returns the wall-clock time.
| par | If zero, the wall-clock time will be reset to 0. |
Definition at line 3413 of file tools.c.
Referenced by DoCheckpoint(), DoRecovery(), find_Horner_MCTS(), optimize_expression_given_Horner(), optimize_greedy(), and WriteStats().
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
Definition at line 65 of file wildcard.c.
|
extern |
|
extern |
Writes the statistics.
| plspace | The size in bytes currently occupied |
| par | par = 0 = STATSSPLITMERGE after a splitmerge. par = 1 = STATSMERGETOFILE after merge to sortfile. par = 2 = STATSPOSTSORT after the sort |
| checkLogType | == CHECKLOGTYPE: The output should not go to the log file if AM.LogType is 1. |
current expression is to be found in AR.CurExpr. terms are in S->TermsLeft. S->GenTerms.
Definition at line 129 of file sort.c.
References TimeCPU(), and TimeWallClock().
Referenced by EndSort(), PF_Processor(), and StoreTerm().

|
extern |
|
extern |
Definition at line 56 of file argument.c.
|
extern |
Definition at line 1775 of file argument.c.
|
extern |
|
extern |
|
extern |
|
extern |
Inserts/Updates a preprocessor variable in the name administration.
| name | Character string with the variable name. |
| value | Character string with a possible value. Special case: if this argument is zero, then we have no value. Note: This is different from having an empty argument! This should only occur when the name starts with a ? |
| args | Character string with possible arguments. |
| mode | =0: always create a new name entry, =1: try to do a redefinition if possible. |
Definition at line 724 of file pre.c.
Referenced by ClearOptimize(), Generator(), Optimize(), PF_BroadcastRedefinedPreVars(), StartVariables(), and TheDefine().
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
Copies a file with name *source to a file named *dest. The involved files must not be open. Returns non-zero if an error occurred. Uses if possible the combined large and small sorting buffers as cache.
Definition at line 1103 of file tools.c.
Referenced by DoRecovery().
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
Definition at line 315 of file compiler.c.
|
extern |
Definition at line 341 of file compiler.c.
|
extern |
Creates a new compiler buffer and returns its ID number.
Definition at line 47 of file comtool.c.
References CbUf::boomlijst, CbUf::Buffer, CbUf::BufferSize, CbUf::CanCommu, CbUf::dimension, CbUf::lhs, CbUf::numdum, CbUf::NumTerms, CbUf::Pointer, CbUf::rhs, and CbUf::Top.
Referenced by AddRHS(), and StartVariables().
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
Skips from s to the end of a declaration field (e.g., x, 1+2*[x+a], or f({x,[x+a]},1)).
| [in] | s | Pointer to a null-terminated input buffer. |
| [in] | level | Number of parentheses that still have to be closed. |
|
extern |
|
extern |
|
extern |
|
extern |
Preprocessor assignment. Possible arguments and values are treated and the new preprocessor variable is put into the name administration.
| s | Pointer to the character string following the preprocessor command. |
| mode | Bitmask. 0-bit clear: always create a new name entry, 0-bit set: try to redefine an existing name, 1-bit set: ignore preprocessor if/switch status. |
Definition at line 2030 of file pre.c.
References PutPreVar().

|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
Skips over alphanumeric characters to find the end of the token.
[x+a]). To handle them, use SkipAName instead.| [in] | s | Pointer to a null-terminated input buffer. |
|
extern |
|
extern |
Definition at line 572 of file compiler.c.
|
extern |
Skips over non-alphanumeric characters to find the start of a token.
[x+a]). To handle them, consider simply skipping whitespace, e.g., by using SkipSpaces.| [in] | s | Pointer to a null-terminated input buffer. |
|
extern |
Gets a list of pointers to terms and compresses the terms. In n it collects the number of terms and the return value of the function is the space that is occupied.
We have to pay some special attention to the compression of terms with a PolyFun. This PolyFun should occur only straight before the coefficient, so we can use the same trick as for the coefficient to sabotage compression of this object (Replace in the history the function pointer by zero. This is safe, because terms that would be identical otherwise would have been added).
| ss | Array of pointers to terms to be compressed. |
| n | Number of pointers in ss. |
Definition at line 2900 of file sort.c.
Referenced by EndSort(), and StoreTerm().
|
extern |
Prepares a stage 4 or higher sort. Stage 4 sorts occur when the sort file contains more patches than can be merged in one pass.
Definition at line 4369 of file sort.c.
References FiLe::handle.
Referenced by EndSort(), and MergePatches().
|
extern |
Doubles a compiler buffer.
| num | The ID number for the buffer to be doubled. |
| w | The pointer to the end (exclusive) of the current buffer. The contents in the range of [cbuf[num].Buffer,w) will be kept. |
Definition at line 143 of file comtool.c.
References CbUf::Buffer, CbUf::BufferSize, CbUf::lhs, CbUf::Pointer, CbUf::rhs, and CbUf::Top.
|
extern |
Adds an LHS to a compiler buffer and returns the pointer to a buffer for the new LHS.
| num | The ID number for the buffer to get another LHS. |
Definition at line 188 of file comtool.c.
References CbUf::lhs, and CbUf::Pointer.
Referenced by AddNtoL().
|
extern |
Adds an RHS to a compiler buffer and returns the pointer to a buffer for the new RHS.
| num | The ID number for the buffer to get another RHS. |
| type | If 0, the subexpression tree will be reallocated. |
Definition at line 214 of file comtool.c.
References TaBlEs::buffers, TaBlEs::buffersfill, TaBlEs::bufferssize, TaBlEs::bufnum, CbUf::CanCommu, CbUf::dimension, inicbufs(), CbUf::numdum, CbUf::NumTerms, CbUf::Pointer, and CbUf::rhs.
Referenced by InsertArg(), StartVariables(), and TestMatch().

|
extern |
Adds an LHS with the given data to the current compiler buffer.
| n | The length of the data. |
| array | The data to be added. |
Definition at line 288 of file comtool.c.
References AddLHS(), DoubleCbuffer(), CbUf::Pointer, and CbUf::Top.

|
extern |
Adds the given data to the last LHS/RHS in a compiler buffer.
| bufnum | The ID number for the buffer where the data will be added. |
| n | The length of the data. |
| array | The data to be added. |
Definition at line 317 of file comtool.c.
References DoubleCbuffer(), CbUf::Pointer, and CbUf::Top.
Referenced by InsertArg(), and StartVariables().

|
extern |
Definition at line 498 of file compcomm.c.
|
extern |
Definition at line 1049 of file compcomm.c.
|
extern |
Definition at line 1520 of file compcomm.c.
|
extern |
Definition at line 1657 of file compcomm.c.
|
extern |
Definition at line 1731 of file compcomm.c.
|
extern |
Definition at line 2242 of file compcomm.c.
|
extern |
Definition at line 1870 of file compcomm.c.
|
extern |
Definition at line 2066 of file argument.c.
|
extern |
Implements part of the old ExecArg in which we take common factors from arguments with more than one term. The common pieces are put in argout as a sequence of arguments. The part with the multiple terms that are now relative prime is put in argfree which is allocated via TermMalloc and is given as the return value. The difference with the old code is that negative powers are always removed. Hence it is as in MakeInteger in which only numerators will be left: now only zero or positive powers will be remaining.
Definition at line 2772 of file argument.c.
References EndSort(), MakeInteger(), MakeMod(), NewSort(), and StoreTerm().

|
extern |
For normalizing everything to integers we have to determine for all elements of this argument the LCM of the denominators and the GCD of the numerators. The input argument is in argin. The number that comes out should go to argout. The new pointer in the argout buffer is the return value. The normalized argument is in argfree.
Definition at line 3318 of file argument.c.
Referenced by TakeArgContent().
|
extern |
Similar to MakeInteger but now with modulus arithmetic using only a one WORD 'prime'. We make the coefficient of the first term in the argument equal to one. Already the coefficients are taken modulus AN.cmod and AN.ncmod == 1
Definition at line 3489 of file argument.c.
References GetModInverses().
Referenced by TakeArgContent().

|
extern |
Looks the argument up in the (workers) table. If it is found the number in the table is returned (plus one to make it positive). If it is not found we look in the compiler provided table. If it is found - the number in the table is returned (minus one to make it negative). If in neither table we return zero.
Definition at line 2519 of file argument.c.
|
extern |
Inserts the argument into the (workers) table. If the table is too full we eliminate half of it. The eliminated elements are the ones that have not been used most recently, weighted by their total use and age(?). If par == 0 it inserts in the regular factorization cache If par == 1 it inserts in the cache defined with the FactorCache statement
Definition at line 2543 of file argument.c.
References AddNtoC(), AddRHS(), and CleanupArgCache().

|
extern |
Cleans up the argument factorization cache. We throw half the elements. For a weight of what we want to keep we use the product of usage and the number in the buffer.
Definition at line 2578 of file argument.c.
References CbUf::boomlijst, CbUf::Buffer, CbUf::Pointer, CbUf::rhs, SortWeights(), and tree::usage.
Referenced by InsertArg().

|
extern |
Definition at line 2649 of file argument.c.
|
extern |
Definition at line 2704 of file argument.c.
|
extern |
Sorts an array of LONGS in the same way SplitMerge (in sort.c) works We use gradual division in two.
Definition at line 3534 of file argument.c.
References SortWeights().
Referenced by CleanupArgCache(), and SortWeights().

|
extern |
Definition at line 3777 of file compcomm.c.
|
extern |
Definition at line 7070 of file compcomm.c.
|
extern |
Definition at line 4055 of file compcomm.c.
|
extern |
Definition at line 3912 of file compcomm.c.
|
extern |
Definition at line 2369 of file compcomm.c.
|
extern |
Definition at line 5730 of file compcomm.c.
|
extern |
Definition at line 5786 of file compcomm.c.
|
extern |
Definition at line 5793 of file compcomm.c.
|
extern |
Definition at line 2121 of file compcomm.c.
|
extern |
Definition at line 2154 of file compcomm.c.
|
extern |
Definition at line 3382 of file compcomm.c.
|
extern |
Definition at line 3288 of file compcomm.c.
|
extern |
Definition at line 3298 of file compcomm.c.
|
extern |
Definition at line 3313 of file compcomm.c.
|
extern |
Definition at line 3435 of file compcomm.c.
|
extern |
Definition at line 3904 of file compcomm.c.
|
extern |
Definition at line 7067 of file compcomm.c.
|
extern |
Definition at line 7068 of file compcomm.c.
|
extern |
Definition at line 3923 of file compcomm.c.
|
extern |
Definition at line 436 of file compcomm.c.
|
extern |
Definition at line 514 of file compcomm.c.
|
extern |
Definition at line 1795 of file compcomm.c.
|
extern |
Definition at line 2376 of file compcomm.c.
|
extern |
Definition at line 950 of file compcomm.c.
|
extern |
Definition at line 5882 of file compcomm.c.
|
extern |
Definition at line 1772 of file compcomm.c.
|
extern |
Definition at line 1565 of file compcomm.c.
|
extern |
Definition at line 5911 of file compcomm.c.
|
extern |
Definition at line 5925 of file compcomm.c.
|
extern |
Definition at line 4885 of file compcomm.c.
|
extern |
Definition at line 4912 of file compcomm.c.
|
extern |
Definition at line 2128 of file compcomm.c.
|
extern |
Definition at line 2161 of file compcomm.c.
|
extern |
Definition at line 4939 of file compcomm.c.
|
extern |
Definition at line 3739 of file compcomm.c.
|
extern |
Definition at line 5288 of file compcomm.c.
|
extern |
Definition at line 5005 of file compcomm.c.
|
extern |
Definition at line 3261 of file compcomm.c.
|
extern |
Definition at line 2222 of file compcomm.c.
|
extern |
Definition at line 6441 of file compcomm.c.
|
extern |
Definition at line 6470 of file compcomm.c.
|
extern |
Definition at line 6477 of file compcomm.c.
|
extern |
Definition at line 6484 of file compcomm.c.
|
extern |
Definition at line 6491 of file compcomm.c.
|
extern |
Definition at line 6498 of file compcomm.c.
|
extern |
Definition at line 1007 of file compcomm.c.
|
extern |
Definition at line 156 of file compcomm.c.
|
extern |
Definition at line 1824 of file compcomm.c.
|
extern |
Definition at line 4245 of file compcomm.c.
|
extern |
Definition at line 936 of file compcomm.c.
|
extern |
Definition at line 995 of file compcomm.c.
|
extern |
Definition at line 1843 of file compcomm.c.
|
extern |
Definition at line 5571 of file compcomm.c.
|
extern |
Definition at line 5627 of file compcomm.c.
|
extern |
Definition at line 1041 of file compcomm.c.
|
extern |
Definition at line 3578 of file compcomm.c.
|
extern |
Definition at line 1279 of file compcomm.c.
|
extern |
Definition at line 2415 of file compcomm.c.
|
extern |
Definition at line 1572 of file compcomm.c.
|
extern |
Definition at line 1586 of file compcomm.c.
|
extern |
Definition at line 2187 of file compcomm.c.
|
extern |
Definition at line 2194 of file compcomm.c.
|
extern |
Definition at line 563 of file compcomm.c.
|
extern |
Definition at line 598 of file compcomm.c.
|
extern |
Definition at line 664 of file compcomm.c.
|
extern |
Definition at line 6631 of file compcomm.c.
|
extern |
Definition at line 5354 of file compcomm.c.
|
extern |
Definition at line 5401 of file compcomm.c.
|
extern |
Definition at line 1265 of file compcomm.c.
|
extern |
Definition at line 1272 of file compcomm.c.
|
extern |
Definition at line 943 of file compcomm.c.
|
extern |
Definition at line 5205 of file compcomm.c.
|
extern |
Definition at line 2383 of file compcomm.c.
|
extern |
Definition at line 2442 of file compcomm.c.
|
extern |
Definition at line 2482 of file compcomm.c.
|
extern |
Definition at line 2587 of file compcomm.c.
|
extern |
Definition at line 3716 of file compcomm.c.
|
extern |
Definition at line 3461 of file compcomm.c.
|
extern |
Definition at line 1579 of file compcomm.c.
|
extern |
Definition at line 5682 of file compcomm.c.
|
extern |
Definition at line 1286 of file compcomm.c.
|
extern |
Definition at line 1330 of file compcomm.c.
|
extern |
Definition at line 1593 of file compcomm.c.
|
extern |
Definition at line 1611 of file compcomm.c.
|
extern |
Definition at line 1629 of file compcomm.c.
|
extern |
Definition at line 1636 of file compcomm.c.
|
extern |
Definition at line 1643 of file compcomm.c.
|
extern |
Definition at line 1650 of file compcomm.c.
|
extern |
Definition at line 5315 of file compcomm.c.
|
extern |
Definition at line 2201 of file compcomm.c.
|
extern |
Definition at line 2208 of file compcomm.c.
|
extern |
Definition at line 2215 of file compcomm.c.
|
extern |
Definition at line 2608 of file compcomm.c.
|
extern |
Definition at line 2362 of file compcomm.c.
|
extern |
Definition at line 5240 of file compcomm.c.
|
extern |
Definition at line 2728 of file compcomm.c.
|
extern |
Definition at line 2896 of file compcomm.c.
|
extern |
Definition at line 2966 of file compcomm.c.
|
extern |
Definition at line 3053 of file compcomm.c.
|
extern |
Definition at line 3113 of file compcomm.c.
|
extern |
Definition at line 87 of file transform.c.
|
extern |
Definition at line 5800 of file compcomm.c.
|
extern |
Definition at line 3195 of file compcomm.c.
|
extern |
Definition at line 3239 of file compcomm.c.
|
extern |
Definition at line 3251 of file compcomm.c.
|
extern |
Definition at line 3475 of file compcomm.c.
|
extern |
Definition at line 4984 of file compcomm.c.
|
extern |
Definition at line 2390 of file compcomm.c.
|
extern |
Definition at line 7190 of file compcomm.c.
|
extern |
Definition at line 7236 of file compcomm.c.
|
extern |
Definition at line 7286 of file compcomm.c.
|
extern |
Definition at line 7312 of file compcomm.c.
|
extern |
Definition at line 7339 of file compcomm.c.
|
extern |
Definition at line 5700 of file compcomm.c.
|
extern |
Definition at line 1672 of file compcomm.c.
|
extern |
Definition at line 536 of file compiler.c.
|
extern |
Definition at line 522 of file compiler.c.
|
extern |
Definition at line 476 of file compiler.c.
|
extern |
Definition at line 385 of file compiler.c.
|
extern |
Skips a name and gives a pointer to the character after the name. If there is not a proper name, it emits a compiler message and then returns a null pointer. This function supports formal names (e.g., [x+a]) and $-variables in addition to ordinary identifiers.
| [in] | s | Pointer to a null-terminated input string that starts with a name. |
Definition at line 443 of file compiler.c.
|
extern |
Definition at line 706 of file compiler.c.
|
extern |
Definition at line 750 of file compiler.c.
|
extern |
Definition at line 885 of file compiler.c.
|
extern |
Definition at line 1948 of file compiler.c.
|
extern |
Definition at line 1985 of file compiler.c.
|
extern |
Definition at line 2282 of file compiler.c.
|
extern |
|
extern |
|
extern |
|
extern |
Definition at line 5158 of file compcomm.c.
|
extern |
Definition at line 5150 of file compcomm.c.
|
extern |
Definition at line 5033 of file compcomm.c.
|
extern |
Definition at line 5178 of file compcomm.c.
|
extern |
|
extern |
For normalizing everything to integers we have to determine for all elements of this argument the LCM of the denominators and the GCD of the numerators. The input argument is in bufin. The number that comes out is the return value. The normalized argument is in bufout.
Definition at line 3610 of file dollar.c.
References EndSort(), Generator(), and NewSort().

|
extern |
Similar to MakeDollarInteger but now with modulus arithmetic using only a one WORD 'prime'. We make the coefficient of the first term in the argument equal to one. Already the coefficients are taken modulus AN.cmod and AN.ncmod == 1
Definition at line 3784 of file dollar.c.
References EndSort(), Generator(), GetModInverses(), and NewSort().

|
extern |
|
extern |
Optimization of expression
This method takes an input expression and generates optimized code to calculate its value. The following methods are called to do so:
(1) get_expression : to read to expression
(2) get_brackets : find brackets for simultaneous optimization
(3) occurrence_order or find_Horner_MCTS : to determine (the) Horner scheme(s) to use; this depends on AO.optimize.horner
(4) optimize_expression_given_Horner : to do the optimizations for each Horner scheme; this method does either CSE or greedy optimizations dependings on AO.optimize.method
(5) generate_output : to format the output in Form notation and store it in a buffer
(6a) optimize_print_code : to print the expression (for "Print") or (6b) generate_expression : to modify the expression (for "#Optimize")
On ParFORM, all the processes must call this function at the same time. Then
(1) Because only the master can access to the expression to be optimized, the master broadcast the expression to all the slaves after reading the expression (PF_get_expression).
(2) get_brackets reads optimize_expr as the input and it works also on the slaves. We leave it although the bracket information is not needed on the slaves (used in (5) on the master).
(3) and (4) find_Horner_MCTS and optimize_expression_given_Horner are parallelized.
(5), (6a) and (6b) are needed only on the master.
Definition at line 4637 of file optimize.cc.
References ClearOptimize(), count_operators(), find_Horner_MCTS(), generate_expression(), generate_output(), get_brackets(), get_expression(), occurrence_order(), optimize_expression_given_Horner(), optimize_print_code(), PF_Broadcast(), PF_LongMultiBroadcast(), PF_Pack(), PF_PrepareLongMultiPack(), PF_PreparePack(), PF_Unpack(), and PutPreVar().

|
extern |
Optimization of expression
Clears the buffers that were used for optimization output. Clears the expression from the buffers (marks it to be dropped). Note: we need to use the expression by its name, because numbers may change if we drop other expressions between when we do the optimizations and clear the results (in execute.c). Also this is not 100% safe, because we could overwrite the optimized expression. But that can be done only in a Local or Global statement and hence we only have to test there that we might have to call ClearOptimize first. (in file comexpr.c)
Definition at line 4974 of file optimize.cc.
References PutPreVar().
Referenced by Optimize().

|
extern |
|
extern |
|
extern |
|
extern |
Frees a compiler buffer.
| num | The ID number for the buffer to be freed. |
Definition at line 89 of file comtool.c.
References CbUf::boomlijst, CbUf::Buffer, CbUf::BufferSize, CbUf::CanCommu, CbUf::lhs, CbUf::NumTerms, CbUf::Pointer, CbUf::rhs, and CbUf::Top.
Referenced by PF_BroadcastCBuf().
|
extern |
Clears contents in a compiler buffer.
| num | The ID number for the buffer to be cleared. |
Definition at line 116 of file comtool.c.
References CbUf::boomlijst, CbUf::Buffer, CbUf::Pointer, and CbUf::rhs.
|
extern |
|
extern |
|
extern |
|
extern |
Lowers the level in the sort system.
Definition at line 4661 of file sort.c.
Referenced by generate_expression(), get_expression(), InFunction(), PF_CollectModifiedDollars(), PF_Processor(), poly_factorize_expression(), poly_sort(), poly_unfactorize_expression(), PolyFunMul(), Processor(), and TestMatch().
|
extern |
|
extern |
|
extern |
Evaluates one argument of a do loop. Such an argument is constructed from SNUMBERs DOLLAREXPRESSIONs and possibly DOLLAREXPR2s which indicate factors of the preceding dollar. Hence we have SNUMBER,num DOLLAREXPRESSION,numdollar DOLLAREXPRESSION,numdollar,DOLLAREXPR2,numfactor DOLLAREXPRESSION,numdollar,DOLLAREXPR2,numfactor,DOLLAREXPR2,numfactor etc. Because we have a do-loop at every stage we should have a number. The notation in DOLLAREXPR2 is that >= 0 is number of yet another dollar and < 0 is -n-1 with n the array element or zero. The return value is the (short) number. The routine works its way through the list in a recursive manner.
Definition at line 2633 of file dollar.c.
References EvalDoLoopArg().
Referenced by EvalDoLoopArg().

|
extern |
Definition at line 1365 of file compcomm.c.
|
extern |
|
extern |
Gets the first term of an expression. Routine should be thread safe.
| [out] | term | Pointer to the buffer where the term should be written. |
| [in] | num | The expression number from which to get the term. |
| [in] | pre | Denotes a pre-processor call (1) or not (0). Used to determine the correct source file for the expression. |
Definition at line 1866 of file execute.c.
References FiLe::handle, VaRrEnUm::lo, and ReNuMbEr::symb.
|
extern |
|
extern |
|
extern |
|
extern |
Definition at line 691 of file function.c.
|
extern |
Definition at line 748 of file function.c.
|
extern |
Definition at line 1851 of file argument.c.
|
extern |
Definition at line 1955 of file argument.c.
|
extern |
Definition at line 2557 of file wildcard.c.
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
Routine normalizes terms that contain only symbols. Regular minimum and maximum properties are ignored.
We check whether there are negative powers in the output. This is not allowed.
Definition at line 5195 of file normal.c.
Referenced by InFunction(), and poly_sort().
|
extern |
Compares the terms, based on the value of AN.polysortflag. If term1 < term2 the return value is -1 If term1 > term2 the return value is 1 If term1 = term2 the return value is 0 The coefficients may differ. The terms contain only a single subterm of type SYMBOL. If AN.polysortflag = 0 it is a 'regular' compare. If AN.polysortflag = 1 the sum of the powers is more important par is a dummy parameter to make the parameter field identical to that of Compare1 which is the regular compare routine in sort.c
Definition at line 2804 of file sort.c.
Referenced by InFunction(), and poly_sort().
|
extern |
Compares terms that can have only SYMBOL and HAAKJE subterms. If term1 < term2 the return value is -1 If term1 > term2 the return value is 1 If term1 = term2 the return value is 0 par is a dummy parameter to make the parameter field identical to that of Compare1 which is the regular compare routine in sort.c
|
extern |
Gives the next prime number in the list of prime numbers.
If the list isn't long enough we expand it. For ease in ParForm and because these lists shouldn't be very big we let each worker keep its own list.
The list is cut off at MAXPOWER, because we don't want to get into trouble that the power of a variable gets larger than the prime number.
|
extern |
Reads the header in the save file and sets function pointers and flags according to the information found there. Must be called before any other ReadSave... function.
Currently works only for the exchange between 32bit and 64bit machines (WORD size must be 2 or 4 bytes)!
It is called by CoLoad().
|
extern |
Reads a FILEINDEX from the open save file specified by AO.SaveData.Handle. Translations for adjusting endianness and data sizes are done if necessary.
Depends on the assumption that sizeof(FILEINDEX) is the same everywhere. If FILEINDEX or INDEXENTRY change, then this functions has to be adjusted.
Called by CoLoad() and FindInIndex().
| fileind | contains the read FILEINDEX after successful return. must point to allocated, big enough memory. |
Definition at line 4175 of file store.c.
References INFILEINDEX, FiLeInDeX::next, FiLeInDeX::number, and FuNcTiOn::number.
|
extern |
Reads an expression from the open file specified by AO.SaveData.Handle. The endianness flip and a resizing without renumbering is done in this function. Thereafter the buffer consists of chunks with a uniform maximal word size (32bit at the moment). The actual renumbering is then done by calling the function ReadSaveTerm32(). The result is returned in buffer.
If the translation at some point doesn't fit into the buffer anymore, the function returns and must be called again. In any case size returns the number of successfully read bytes, outsize returns the number of successfully written bytes, and the file will be positioned at the next byte after the successfully read data.
It is called by PutInStore().
| buffer | output buffer, holds the (translated) expression |
| top | end of buffer |
| size | number of read bytes |
| outsize | number of written bytes |
Definition at line 5138 of file store.c.
References ReadSaveTerm32().

|
extern |
Reads a single term from the given buffer at bin and write the translated term back to this buffer at bout.
ReadSaveTerm32() is currently the only instantiation of a ReadSaveTerm-function. It only deals with data that already has the correct endianness and that is resized to 32bit words but without being renumbered or translated in any other way. It uses the compress buffer AR.CompressBuffer.
The function is reentrant in order to cope with nested function arguments. It is called by ReadSaveExpression() and itself.
The return value indicates the position in the input buffer up to which the data has already been successfully processed. The parameter bout returns the corresponding position in the output buffer.
| bin | start of the input buffer |
| binend | end of the input buffer |
| bout | as input points to the beginning of the output buffer, as output points behind the already translated data in the output buffer |
| boutend | end of already decompressed data in output buffer |
| top | end of output buffer |
| terminbuf | flag whether decompressed data is already in the output buffer. used in recursive calls |
Definition at line 4728 of file store.c.
References ReadSaveTerm32().
Referenced by ReadSaveExpression(), and ReadSaveTerm32().

|
extern |
Reads the variables from the open file specified by AO.SaveData.Handle. It reads the *size bytes and writes them to the *buffer. It is called by PutInStore().
If translation is necessary, the data might shrink or grow in size, then *size is adjusted so that the reading and writing fits into the memory from the buffer to the top. The actual number of read bytes is returned in *size, the number of written bytes is returned in *outsize.
If the *size is smaller than the actual size of the variables, this function will be called several times and needs to remember the current position in the variable structure. The parameter stage does this job. When ReadSaveVariables() is called for the first time, this parameter should have the value -1.
The parameter ind is used to get the number of variables.
| buffer | read variables are written into this allocated memory |
| top | upper end of allocated memory |
| size | number of bytes to read. might return a smaller number of read bytes if translation was necessary |
| outsize | if translation has be done, outsize contains the number of written bytes |
| ind | pointer of INDEXENTRY for the current expression. read-only |
| stage | should be -1 for the first call, will be increased by ReadSaveVariables to memorize the position in the variable structure |
Definition at line 4361 of file store.c.
References InDeXeNtRy::nfunctions, InDeXeNtRy::nindices, InDeXeNtRy::nsymbols, InDeXeNtRy::nvectors, and FuNcTiOn::spec.
|
extern |
Writes header with information about system architecture and FORM revision to an open store file.
Called by SetFileIndex().
| handle | specifies open file to which header will be written |
Definition at line 3964 of file store.c.
References STOREHEADER::endianness, STOREHEADER::lenLONG, STOREHEADER::lenPOINTER, STOREHEADER::lenPOS, STOREHEADER::lenWORD, STOREHEADER::maxpower, STOREHEADER::sFun, STOREHEADER::sInd, STOREHEADER::sSym, STOREHEADER::sVec, and STOREHEADER::wildoffset.
Referenced by SetFileIndex().
|
extern |
Sets up the strings for the filenames of the recovery files. This functions should only be called once to avoid memory leaks and after AM.TempDir has been initialized.
Definition at line 399 of file checkpoint.c.
|
extern |
Checks whether a snapshot/recovery file exists. Returns 1 if it exists, 0 otherwise.
Definition at line 278 of file checkpoint.c.
References RecoveryFilename().

|
extern |
Deletes the recovery files. It is called by CleanUp() in the case of a successful completion.
Definition at line 333 of file checkpoint.c.
|
extern |
Returns pointer to recovery filename.
Definition at line 364 of file checkpoint.c.
Referenced by CheckRecoveryFile(), and DoRecovery().
|
extern |
Reads from the recovery file and restores all necessary variables and states in FORM, so that the execution can recommence in preprocessor() as if no restart of FORM had occurred.
The recovery file is read into memory as a whole. The pointer p then points into this memory at the next non-processed data. The macros by which variables are restored, like R_SET, automatically increase p appropriately.
If something goes wrong, the function returns with a non-zero value.
Allocated memory that would be lost when overwriting the global structs with data from the file is freed first. A major part of the code deals with the restoration of pointers. The idiom we use is to memorize the original pointer value (org), allocate new memory and copy the data from the file into this memory, calculate the offset between the old pointer value and the new allocated memory position (ofs), and then correct all affected pointers (+=ofs).
We rely on the fact that several variables (especially in AM) are already assigned the correct values by the startup functions. That means, in principle, that a change in the setup files between snapshot creation and recovery will be noticed.
Definition at line 1402 of file checkpoint.c.
References TaBlEs::argtail, TaBlEs::boomlijst, BrAcKeTiNfO::bracketbuffer, TaBlEs::buffers, TaBlEs::bufferssize, CopyFile(), TaBlEs::flags, ReNuMbEr::func, ReNuMbEr::funnum, VaRrEnUm::hi, BrAcKeTiNfO::indexbuffer, ReNuMbEr::indi, ReNuMbEr::indnum, VaRrEnUm::lo, TaBlEs::MaxTreeSize, TaBlEs::mm, TaBlEs::numind, TaBlEs::pattern, TaBlEs::prototype, TaBlEs::prototypeSize, RecoveryFilename(), ExPrEsSiOn::renumlists, TaBlEs::reserved, TaBlEs::spare, TaBlEs::sparse, VaRrEnUm::start, ReNuMbEr::symb, ReNuMbEr::symnum, TaBlEs::tablepointers, TimeWallClock(), TaBlEs::totind, ReNuMbEr::vecnum, and ReNuMbEr::vect.

|
extern |
Checks whether a snapshot should be done. Calls DoSnapshot() to create the snapshot.
Definition at line 3110 of file checkpoint.c.
References PF_BroadcastNumber(), PF_RecvFile(), PF_SendFile(), and TimeWallClock().

|
extern |
|
extern |
Tests the consistency of the term. Returns 0 when the term is OK. Any nonzero value is trouble. In the current version the testing isn't 100% complete. For instance, we don't check the validity of the symbols nor do we check the range of their powers. Etc. This should be extended when the need is there.
| term | the term to be tested |
Definition at line 3798 of file tools.c.
References TestTerm().
Referenced by TestTerm().

|
extern |
Definition at line 750 of file transform.c.
|
extern |
Definition at line 1006 of file transform.c.
|
extern |
Definition at line 1193 of file transform.c.
|
extern |
Definition at line 1363 of file transform.c.
|
extern |
Definition at line 1841 of file transform.c.
|
extern |
Definition at line 2042 of file transform.c.
|
extern |
Definition at line 3307 of file transform.c.
|
extern |
Definition at line 3376 of file transform.c.
|
extern |
Definition at line 3412 of file transform.c.
|
extern |
Definition at line 3572 of file transform.c.
|
extern |
Definition at line 2156 of file transform.c.
|
extern |
Definition at line 2383 of file transform.c.
|
extern |
Definition at line 2559 of file transform.c.
|
extern |
Definition at line 2711 of file transform.c.
|
extern |
Definition at line 2800 of file transform.c.
|
extern |
Definition at line 2941 of file transform.c.
|
extern |
Definition at line 3019 of file transform.c.
|
extern |
Definition at line 3131 of file transform.c.
|
extern |
Definition at line 3157 of file transform.c.
|
extern |
Definition at line 2470 of file transform.c.
|
extern |
Definition at line 3185 of file transform.c.
|
extern |
Definition at line 3241 of file transform.c.
|
extern |
Definition at line 53 of file notation.c.
|
extern |
Definition at line 307 of file notation.c.
|
extern |
Converts a generic term to polynomial notation in which there are only symbols and brackets. During conversion there will be only symbols. Brackets are stripped. Objects that need 'translation' are put inside a special compiler buffer and represented by a symbol. The numbering of the extra symbols is down from the maximum. In principle there can be a problem when running into the already assigned ones. This uses the FindTree for searching in the global tree and then looks further in the AT.ebufnum. This allows fully parallel processing. Hence we need no locks. Cannot be used in the same module as ConvertToPoly.
Definition at line 510 of file notation.c.
Referenced by poly_factorize_expression().
|
extern |
Definition at line 660 of file notation.c.
|
extern |
Definition at line 773 of file notation.c.
|
extern |
Definition at line 843 of file notation.c.
|
extern |
Definition at line 897 of file notation.c.
|
extern |
Definition at line 1009 of file notation.c.
|
extern |
Definition at line 1096 of file notation.c.
|
extern |
Definition at line 5948 of file compcomm.c.
|
extern |
Definition at line 6023 of file compcomm.c.
|
extern |
Definition at line 6049 of file compcomm.c.
|
extern |
Definition at line 6099 of file compcomm.c.
|
extern |
Definition at line 6230 of file compcomm.c.
|
extern |
Definition at line 6172 of file compcomm.c.
|
extern |
Definition at line 6307 of file compcomm.c.
|
extern |
Definition at line 6410 of file compcomm.c.
|
extern |
Definition at line 1149 of file notation.c.
|
extern |
Definition at line 1217 of file notation.c.
|
extern |
Initialize a factorization cache buffer. We set the size of the rhs and boomlijst buffers immediately to their final values.
Definition at line 614 of file comtool.c.
References tree::blnce, CbUf::boomlijst, CbUf::CanCommu, CbUf::dimension, tree::left, CbUf::numdum, CbUf::NumTerms, tree::parent, CbUf::rhs, tree::right, tree::usage, and tree::value.
|
extern |
|
extern |
|
extern |
|
extern |
Implements part of the old ExecArg in which we take common factors from arguments with more than one term. We allow only symbols as this code is used for the polyratfun only. We have a special routine, because the generic TakeContent does too much work and speed is at a premium here. Input: in is the input expression as a sequence of terms. Output: term: the content return value: the contentfree expression. it is in new allocation, made by TermMalloc. (should be in a TermMalloc space?)
Definition at line 2434 of file ratio.c.
References GetModInverses().

|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
Implements part of the old ExecArg in which we take common factors from arguments with more than one term. Here the input is a sequence of terms in 'in' and the answer is a content-free sequence of terms. This sequence has been allocated by the Malloc1 routine in a call to EndSort, unless the expression was already content-free. In that case the input pointer is returned. The content is returned in term. This is supposed to be a separate allocation, made by TermMalloc in the calling routine.
Definition at line 1376 of file ratio.c.
References GetModInverses().

|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
Polynomial gcd
This method calculates the greatest common divisor of two polynomials, given by two zero-terminated Form-style term lists.
Definition at line 124 of file polywrap.cc.
References poly_determine_modulus().

|
extern |
Definition at line 435 of file polywrap.cc.
|
extern |
Definition at line 463 of file polywrap.cc.
|
extern |
Definition at line 1743 of file polywrap.cc.
|
extern |
Definition at line 1948 of file polywrap.cc.
|
extern |
Addition of PolyRatFuns
This method gets two pointers to polyratfuns with up to two arguments each and calculates the sum.
Definition at line 633 of file polywrap.cc.
References poly_determine_modulus(), poly_ratfun_read(), and poly_sort().
Referenced by AddPoly(), and MergePatches().

|
extern |
Multiplication/normalization of PolyRatFuns
This method searches a term for multiple polyratfuns and multiplies their contents. The result is properly normalized. Normalization also works for terms with a single polyratfun.
Definition at line 769 of file polywrap.cc.
References poly_determine_modulus(), poly_ratfun_read(), and poly_sort().
Referenced by PolyFunMul(), and PrepPoly().

|
extern |
Factorization of function arguments
This method factorizes the Form-style argument argin.
Definition at line 1112 of file polywrap.cc.
References poly_factorize().

|
extern |
Factorization of dollar variables
This method factorizes a dollar variable.
Definition at line 1146 of file polywrap.cc.
References poly_factorize().

|
extern |
Factorization of expressions
This method factorizes an expression.
Definition at line 1178 of file polywrap.cc.
References EndSort(), Generator(), FiLe::handle, LocalConvertToPoly(), LowerSortLevel(), NewSort(), and poly_determine_modulus().
Referenced by PF_Processor(), and Processor().

|
extern |
Unfactorization of expressions
This method expands a factorized expression.
Definition at line 1535 of file polywrap.cc.
References EndSort(), Generator(), FiLe::handle, LowerSortLevel(), and NewSort().
Referenced by PF_Processor(), and Processor().

|
extern |
Definition at line 2014 of file polywrap.cc.
|
extern |
Print optimized code
This method prints the optimized code via "PrintExtraSymbol". Depending on the flag, the original expression is printed (for "Print") or not (for "#Optimize / #write "O").
Definition at line 4524 of file optimize.cc.
Referenced by Optimize().
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
Definition at line 89 of file spectator.c.
|
extern |
Definition at line 181 of file spectator.c.
|
extern |
Definition at line 233 of file spectator.c.
|
extern |
Definition at line 293 of file spectator.c.
|
extern |
Definition at line 459 of file spectator.c.
|
extern |
Definition at line 345 of file spectator.c.
|
extern |
Definition at line 675 of file spectator.c.
|
extern |
Definition at line 601 of file spectator.c.
|
extern |
Definition at line 402 of file spectator.c.
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
| int LoadModel | ( | MODEL * | m | ) |
Definition at line 58 of file diawrap.cc.
| int CoSetUserFlag | ( | UBYTE * | s | ) |
Definition at line 7407 of file compcomm.c.
| int CoClearUserFlag | ( | UBYTE * | s | ) |
Definition at line 7435 of file compcomm.c.
| int CoCreateAllLoops | ( | UBYTE * | s | ) |
Definition at line 7472 of file compcomm.c.
| int CoCreateAllPaths | ( | UBYTE * | s | ) |
Definition at line 7592 of file compcomm.c.
| int CoCreateAll | ( | UBYTE * | s | ) |
Definition at line 7720 of file compcomm.c.
| LONG StartLoops | ( | PHEAD WORD * | term, |
| WORD | level, | ||
| LONG | vert, | ||
| WORD | nvert, | ||
| WORD * | arglist, | ||
| WORD | nargs, | ||
| WORD * | loop, | ||
| WORD | nloop | ||
| ) |
| LONG GenLoops | ( | PHEAD WORD * | term, |
| WORD | level, | ||
| LONG | vert, | ||
| WORD | nvert, | ||
| WORD * | arglist, | ||
| WORD | nargs, | ||
| WORD * | loop, | ||
| WORD | nloop | ||
| ) |
| void LoopOutput | ( | PHEAD WORD * | term, |
| WORD | level, | ||
| WORD * | loop, | ||
| WORD | nloop | ||
| ) |
| LONG GenPaths | ( | PHEAD WORD * | term, |
| WORD | level, | ||
| LONG | vert, | ||
| WORD | nvert, | ||
| WORD * | arglist, | ||
| WORD | nargs, | ||
| WORD * | path, | ||
| WORD | npath | ||
| ) |