Context Navigation

source: git/Singular/iparith.cc @ 0e9b4e

spielwiese

Last change on this file since 0e9b4e was 0e9b4e, checked in by Olaf Bachmann <obachman@…>, 25 years ago
* clean up git-svn-id: file:///usr/local/Singular/svn/trunk@3754 2c84dea3-7e68-4137-9b89-c4e89433aadc
Property mode set to `100644`
File size: 168.8 KB

Line
1	/****************************************
2	* Computer Algebra System SINGULAR *
3	****************************************/
4	/* $Id: iparith.cc,v 1.182 1999-10-20 13:30:01 obachman Exp $ */
5
6	/*
7	* ABSTRACT: table driven kernel interface, used by interpreter
8	*/
9
10	#include <stdlib.h>
11	#include <string.h>
12	#include <ctype.h>
13	#include <stdio.h>
14	#include <time.h>
15	#include <unistd.h>
16
17	#include "mod2.h"
18	#include "tok.h"
19	#include "ipid.h"
20	#include "intvec.h"
21	#include "mmemory.h"
22	#include "febase.h"
23	#include "longalg.h"
24	#include "polys.h"
25	#include "ideals.h"
26	#include "matpol.h"
27	#include "kstd1.h"
28	#include "timer.h"
29	#include "ring.h"
30	#include "subexpr.h"
31	#include "lists.h"
32	#include "numbers.h"
33	#include "stairc.h"
34	#include "maps.h"
35	#include "syz.h"
36	#include "weight.h"
37	#include "ipconv.h"
38	#include "ipprint.h"
39	#include "sing_dld.h"
40	#include "attrib.h"
41	#include "silink.h"
42	#include "sparsmat.h"
43	#ifdef HAVE_FACTORY
44	#include "clapsing.h"
45	#include "kstdfac.h"
46	#endif
47	#ifdef HAVE_FGLM
48	#include "fglm.h"
49	#endif
50	#ifdef HAVE_SPECTRUM
51	#include "spectrum.h"
52	#endif
53
54	#include "ipshell.h"
55
56	#include "mpr_inout.h"
57
58	/=============== types =====================/
59	struct sValCmdTab
60	{
61	short cmd;
62	short start;
63	};
64
65	typedef sValCmdTab jjValCmdTab[];
66
67	/* ifdef GENTABLE: definitions are in ipshell.h */
68	#ifndef GENTABLE
69	typedef char * (Proc1)(char );
70	struct sValCmd1
71	{
72	proc1 p;
73	short cmd;
74	short res;
75	short arg;
76	};
77
78	typedef BOOLEAN (*proc2)(leftv,leftv,leftv);
79	struct sValCmd2
80	{
81	proc2 p;
82	short cmd;
83	short res;
84	short arg1;
85	short arg2;
86	};
87
88	typedef BOOLEAN (*proc3)(leftv,leftv,leftv,leftv);
89	struct sValCmd3
90	{
91	proc3 p;
92	short cmd;
93	short res;
94	short arg1;
95	short arg2;
96	short arg3;
97	};
98	struct sValCmdM
99	{
100	proc1 p;
101	short cmd;
102	short res;
103	short number_of_args; /* -1: any, -2: any >0, .. */
104	};
105	#endif
106
107	/============= proc =======================/
108	static BOOLEAN jjLOAD(leftv res, leftv v, BOOLEAN autoexport = FALSE);
109	static int iiTabIndex(const jjValCmdTab dArithTab, const int len, const int op);
110	#ifdef MDEBUG
111	#define jjMakeSub(A) jjDBMakeSub(A,__FILE__,__LINE__)
112	static Subexpr jjDBMakeSub(leftv e,char *f, int l);
113	#else
114	static Subexpr jjMakeSub(leftv e);
115	#endif
116
117	/============= vars ======================/
118	extern int cmdtok;
119	extern BOOLEAN expected_parms;
120
121	int iiOp; /* the current operation*/
122
123	#ifdef GENTABLE
124	cmdnames cmds[] =
125	{ // name-string alias tokval toktype
126	{ "$INVALID$", 0, -1, 0},
127	{ "and", 0, '&' , '&'},
128	{ "attrib", 0, ATTRIB_CMD , CMD_123},
129	{ "bareiss", 0, BAREISS_CMD , CMD_123},
130	{ "betti", 0, BETTI_CMD , CMD_12},
131	{ "break", 0, BREAK_CMD , BREAK_CMD},
132	{ "char", 0, CHARACTERISTIC_CMD ,CMD_1},
133	{ "char_series", 0, CHAR_SERIES_CMD , CMD_1},
134	{ "charstr", 0, CHARSTR_CMD , CMD_1},
135	{ "cleardenom", 0, CONTENT_CMD , CMD_1},
136	{ "close", 0, CLOSE_CMD , CMD_1},
137	{ "coef", 0, COEF_CMD , CMD_M},
138	{ "coeffs", 0, COEFFS_CMD , CMD_23},
139	{ "continue", 0, CONTINUE_CMD , CONTINUE_CMD},
140	{ "contract", 0, CONTRACT_CMD , CMD_2},
141	{ "dbprint", 0, DBPRINT_CMD , CMD_M},
142	{ "def", 0, DEF_CMD , ROOT_DECL},
143	{ "defined", 0, DEFINED_CMD , CMD_1},
144	{ "deg", 0, DEG_CMD , CMD_12},
145	{ "degree", 0, DEGREE_CMD , CMD_1},
146	{ "delete", 0, DELETE_CMD , CMD_2},
147	{ "det", 0, DET_CMD , CMD_1},
148	{ "diff", 0, DIFF_CMD , CMD_2},
149	{ "dim", 0, DIM_CMD , CMD_1},
150	{ "div", 0, INTDIV , INTDIV},
151	#ifdef DRING
152	{ "dring", 0, DRING_CMD , DRING_CMD},
153	#endif
154	{ "dump", 0, DUMP_CMD, CMD_1},
155	{ "extgcd", 0, EXTGCD_CMD , CMD_2},
156	{ "EXTGCD", 2, EXTGCD_CMD , CMD_2},
157	{ "ERROR", 0, ERROR_CMD , CMD_1},
158	{ "eliminate", 0, ELIMINATION_CMD, CMD_23},
159	{ "else", 0, ELSE_CMD , ELSE_CMD},
160	{ "eval", 0, EVAL , EVAL},
161	{ "example", 0, EXAMPLE_CMD , EXAMPLE_CMD},
162	{ "execute", 0, EXECUTE_CMD , EXECUTE_CMD},
163	{ "export", 0, EXPORT_CMD , EXPORT_CMD},
164	#ifdef HAVE_NAMESPACES
165	{ "exportto", 0, EXPORTTO_CMD , CMD_M},
166	#endif
167	{ "factorize", 0, FAC_CMD , CMD_12},
168	{ "fetch", 0, FETCH_CMD , CMD_2},
169	{ "fglm", 0, FGLM_CMD , CMD_2},
170	{ "find", 0, FIND_CMD , CMD_23},
171	{ "finduni", 0, FINDUNI_CMD, CMD_1},
172	{ "forif", 0, IF_CMD , IF_CMD},
173	{ "freemodule", 0, FREEMODULE_CMD , CMD_1},
174	{ "facstd", 0, FACSTD_CMD , CMD_12},
175	{ "gen", 0, E_CMD , CMD_1},
176	{ "getdump", 0, GETDUMP_CMD, CMD_1},
177	{ "gcd", 0, GCD_CMD , CMD_2},
178	{ "GCD", 2, GCD_CMD , CMD_2},
179	{ "hilb", 0, HILBERT_CMD , CMD_12},
180	{ "highcorner", 0, HIGHCORNER_CMD, CMD_1},
181	{ "homog", 0, HOMOG_CMD , CMD_12},
182	{ "hres", 0, HRES_CMD , CMD_2},
183	{ "ideal", 0, IDEAL_CMD , IDEAL_CMD},
184	{ "if", 0, IF_CMD , IF_CMD},
185	{ "imap", 0, IMAP_CMD , CMD_2},
186	#ifdef HAVE_NAMESPACES
187	{ "importfrom", 0, IMPORTFROM_CMD , CMD_M},
188	#endif
189	{ "indepSet", 0, INDEPSET_CMD , CMD_12},
190	{ "insert", 0, INSERT_CMD , CMD_23},
191	{ "int", 0, INT_CMD , ROOT_DECL},
192	{ "interred", 0, INTERRED_CMD , CMD_1},
193	{ "intersect", 0, INTERSECT_CMD , CMD_M},
194	{ "intmat", 0, INTMAT_CMD , INTMAT_CMD},
195	{ "intvec", 0, INTVEC_CMD , ROOT_DECL_LIST},
196	{ "jacob", 0, JACOB_CMD , CMD_1},
197	{ "jet", 0, JET_CMD , CMD_23},
198	{ "kbase", 0, KBASE_CMD , CMD_12},
199	{ "keepring", 0, KEEPRING_CMD , KEEPRING_CMD},
200	{ "kill", 0, KILL_CMD , KILL_CMD},
201	{ "killattrib", 0, KILLATTR_CMD , CMD_12},
202	{ "koszul", 0, KOSZUL_CMD , CMD_23},
203	{ "laguerre", 0, LAGSOLVE_CMD, CMD_3},
204	{ "lead", 0, LEAD_CMD , CMD_1},
205	{ "leadcoef", 0, LEADCOEF_CMD , CMD_1},
206	{ "leadexp", 0, LEADEXP_CMD , CMD_1},
207	{ "leadmonom", 0, LEADMONOM_CMD , CMD_1},
208	{ "LIB", 0, LIB_CMD , SYSVAR},
209	{ "lift", 0, LIFT_CMD , CMD_23},
210	{ "liftstd", 0, LIFTSTD_CMD , CMD_2},
211	{ "link", 0, LINK_CMD , ROOT_DECL},
212	{ "listvar", 0, LISTVAR_CMD , LISTVAR_CMD},
213	{ "list", 0, LIST_CMD , ROOT_DECL_LIST},
214	{ "load", 0, LOAD_CMD , CMD_12},
215	{ "lres", 0, LRES_CMD , CMD_2},
216	{ "map", 0, MAP_CMD , RING_DECL},
217	{ "matrix", 0, MATRIX_CMD , MATRIX_CMD},
218	{ "maxideal", 0, MAXID_CMD , CMD_1},
219	{ "memory", 0, MEMORY_CMD , CMD_1},
220	{ "minbase", 0, MINBASE_CMD , CMD_1},
221	{ "minor", 0, MINOR_CMD , CMD_2},
222	{ "minres", 0, MINRES_CMD , CMD_1},
223	{ "mod", 0, '%', '%'},
224	{ "module", 0, MODUL_CMD , MODUL_CMD},
225	{ "modulo", 0, MODULO_CMD , CMD_2},
226	{ "monitor", 0, MONITOR_CMD , CMD_12},
227	{ "mpresmat", 0, MPRES_CMD, CMD_2},
228	{ "mult", 0, MULTIPLICITY_CMD , CMD_1},
229	#ifdef OLD_RES
230	{ "mres", 0, MRES_CMD , CMD_23},
231	#else
232	{ "mres", 0, MRES_CMD , CMD_2},
233	#endif
234	{ "mstd", 0, MSTD_CMD , CMD_1},
235	{ "nameof", 0, NAMEOF_CMD , CMD_1},
236	{ "names", 0, NAMES_CMD , CMD_M},
237	{ "ncols", 0, COLS_CMD , CMD_1},
238	{ "not", 0, NOT , NOT},
239	{ "npars", 0, NPARS_CMD , CMD_1},
240	#ifdef OLD_RES
241	{ "nres", 0, RES_CMD , CMD_23},
242	#else
243	{ "nres", 0, RES_CMD , CMD_2},
244	#endif
245	{ "nrows", 0, ROWS_CMD , CMD_1},
246	{ "number", 0, NUMBER_CMD , RING_DECL},
247	{ "nvars", 0, NVARS_CMD , CMD_1},
248	{ "open", 0, OPEN_CMD , CMD_1},
249	{ "option", 0, OPTION_CMD , CMD_M},
250	{ "or", 0, '\|' , '\|'},
251	{ "ord", 0, ORD_CMD , CMD_1},
252	{ "ordstr", 0, ORDSTR_CMD , CMD_1},
253	{ "package", 0, PACKAGE_CMD , ROOT_DECL},
254	{ "par", 0, PAR_CMD , CMD_1},
255	{ "parameter", 0, PARAMETER , PARAMETER},
256	{ "pardeg", 0, PARDEG_CMD , CMD_1},
257	{ "parstr", 0, PARSTR_CMD , CMD_12},
258	{ "poly", 0, POLY_CMD , RING_DECL},
259	{ "preimage", 0, PREIMAGE_CMD , CMD_13},
260	{ "prime", 0, PRIME_CMD , CMD_1},
261	{ "print", 0, PRINT_CMD , CMD_12},
262	{ "prune", 0, PRUNE_CMD , CMD_1},
263	{ "proc", 0, PROC_CMD , PROC_CMD},
264	{ "qhweight", 0, QHWEIGHT_CMD , CMD_1},
265	{ "qring", 0, QRING_CMD , ROOT_DECL},
266	{ "quote", 0, QUOTE , QUOTE},
267	{ "quotient", 0, QUOTIENT_CMD , CMD_2},
268	{ "random", 0, RANDOM_CMD , CMD_23},
269	{ "read", 0, READ_CMD , CMD_12},
270	{ "reduce", 0, REDUCE_CMD , CMD_23},
271	{ "regularity", 0, REGULARITY_CMD , CMD_1},
272	{ "reservedName",0, RESERVEDNAME_CMD , CMD_M},
273	{ "resolution", 0, RESOLUTION_CMD , RING_DECL},
274	{ "resultant", 0, RESULTANT_CMD, CMD_3},
275	{ "return", 0, RETURN , RETURN},
276	{ "RETURN", 0, END_GRAMMAR , RETURN},
277	{ "ring", 0, RING_CMD , RING_CMD},
278	{ "rvar", 0, IS_RINGVAR , CMD_1},
279	{ "setring", 0, SETRING_CMD , SETRING_CMD},
280	{ "simplify", 0, SIMPLIFY_CMD , CMD_2},
281	{ "size", 0, COUNT_CMD , CMD_1},
282	{ "sortvec", 0, SORTVEC_CMD , CMD_1},
283	#ifdef HAVE_SPECTRUM
284	{ "Spectrum", 0, SPECTRUM_CMD , CMD_123},
285	{ "semic", 0, SEMIC_CMD , CMD_23},
286	#endif
287	#ifdef OLD_RES
288	{ "sres", 0, SRES_CMD , CMD_23},
289	#else
290	{ "sres", 0, SRES_CMD , CMD_2},
291	#endif
292	{ "status", 0, STATUS_CMD, CMD_M},
293	{ "std", 0, STD_CMD , CMD_123},
294	{ "string", 0, STRING_CMD , ROOT_DECL_LIST},
295	{ "subst", 0, SUBST_CMD , CMD_M},
296	{ "system", 0, SYSTEM_CMD, CMD_M},
297	{ "syz", 0, SYZYGY_CMD , CMD_1},
298	{ "test", 0, TEST_CMD , CMD_M},
299	{ "trace", 0, TRACE_CMD , CMD_1},
300	{ "transpose", 0, TRANSPOSE_CMD , CMD_1},
301	{ "type", 0, TYPE_CMD , TYPE_CMD},
302	{ "typeof", 0, TYPEOF_CMD , CMD_1},
303	#ifdef HAVE_NAMESPACES
304	{ "unload", 0, UNLOAD_CMD , CMD_M},
305	#endif
306	{ "uressolve", 0, URSOLVE_CMD, CMD_M},
307	{ "vandermonde", 0, VANDER_CMD, CMD_3},
308	{ "var", 0, VAR_CMD , CMD_1},
309	{ "varstr", 0, VARSTR_CMD , CMD_12},
310	{ "vdim", 0, VDIM_CMD , CMD_1},
311	{ "vector", 0, VECTOR_CMD , RING_DECL},
312	{ "wedge", 0, WEDGE_CMD , CMD_2},
313	{ "weight", 0, WEIGHT_CMD , CMD_1},
314	{ "whileif", 0, IF_CMD , IF_CMD},
315	{ "write", 0, WRITE_CMD , CMD_M},
316	/* delete for next version:*/
317	{ "IN", 1, LEAD_CMD , CMD_1},
318	{ "NF", 1, REDUCE_CMD , CMD_23},
319	{ "multiplicity",1, MULTIPLICITY_CMD , CMD_1},
320	{ "verbose", 2, OPTION_CMD , CMD_M},
321	// { "rank", 1, ROWS_CMD , CMD_1},
322	// { "Current", 0, -1 , SYSVAR},
323	// { "Top", 0, -1 , SYSVAR},
324	// { "Up", 0, -1 , SYSVAR},
325
326	/* set sys vars*/
327	//#ifdef SRING
328	{ "alternating", 0, VALTVARS , SYSVAR},
329	//#endif
330	{ "degBound", 0, VMAXDEG , SYSVAR},
331	{ "echo", 0, VECHO , SYSVAR},
332	{ "minpoly", 0, VMINPOLY , SYSVAR},
333	{ "multBound", 0, VMAXMULT , SYSVAR},
334	{ "noether", 0, VNOETHER , SYSVAR},
335	{ "pagelength", 0, VPAGELENGTH , SYSVAR},
336	{ "pagewidth", 0, VCOLMAX , SYSVAR},
337	{ "printlevel", 0, VPRINTLEVEL , SYSVAR},
338	{ "short", 0, VSHORTOUT , SYSVAR},
339	{ "timer", 0, VTIMER , SYSVAR},
340	{ "rtimer", 0, VRTIMER, SYSVAR},
341	{ "TRACE", 0, TRACE , SYSVAR},
342	{ "voice", 0, VOICE , SYSVAR},
343
344	/* other reserved words:scanner.l */
345	{ "pause", 2, -1 , 0},
346	{ "while", 0, -1 , 0},
347	{ "for", 0, -1 , 0},
348	{ "help", 0, -1 , 0},
349	{ "newline", 0, -1 , 0},
350	{ "exit", 0, -1 , 0},
351	{ "quit", 0, -1 , 0},
352	/* end of list marker */
353	{ NULL, 0, 0, 0}
354	};
355	#endif
356
357	/=================== operations with 2 args.: static proc =================/
358	static BOOLEAN jjOP_IV_I(leftv res, leftv u, leftv v)
359	{
360	intvec* aa= (intvec *)u->CopyD(INTVEC_CMD);
361	int bb = (int)(v->Data());
362	if (errorreported) return TRUE;
363	switch (iiOp)
364	{
365	case '+': (*aa) += bb; break;
366	case '-': (*aa) -= bb; break;
367	case '': (aa) *= bb; break;
368	case '/':
369	case INTDIV: (*aa) /= bb; break;
370	case '%': (*aa) %= bb; break;
371	}
372	res->data=(char *)aa;
373	return FALSE;
374	}
375	static BOOLEAN jjOP_I_IV(leftv res, leftv u, leftv v)
376	{
377	return jjOP_IV_I(res,v,u);
378	}
379	static BOOLEAN jjOP_IM_I(leftv res, leftv u, leftv v)
380	{
381	intvec* aa= (intvec *)u->CopyD(INTVEC_CMD);
382	int bb = (int)(v->Data());
383	int i=min(aa->rows(),aa->cols());
384	switch (iiOp)
385	{
386	case '+': for (;i>0;i--) IMATELEM(*aa,i,i) += bb;
387	break;
388	case '-': for (;i>0;i--) IMATELEM(*aa,i,i) -= bb;
389	break;
390	}
391	res->data=(char *)aa;
392	return FALSE;
393	}
394	static BOOLEAN jjOP_I_IM(leftv res, leftv u, leftv v)
395	{
396	return jjOP_IM_I(res,v,u);
397	}
398	static BOOLEAN jjDOTDOT(leftv res, leftv u, leftv v)
399	{
400	res->data=(char *)new intvec((int)u->Data(),(int)v->Data());
401	return FALSE;
402	}
403	static void jjEQUAL_REST(leftv res,leftv u,leftv v)
404	{
405	if ((res->data) && (u->next!=NULL) && (v->next!=NULL))
406	{
407	int save_iiOp=iiOp;
408	if (iiOp==NOTEQUAL)
409	iiExprArith2(res,u->next,EQUAL_EQUAL,v->next);
410	else
411	iiExprArith2(res,u->next,iiOp,v->next);
412	iiOp=save_iiOp;
413	}
414	if (iiOp==NOTEQUAL) res->data=(char *)(!(int)res->data);
415	}
416	static BOOLEAN jjCOMPARE_IV(leftv res, leftv u, leftv v)
417	{
418	intvec* a = (intvec * )(u->Data());
419	intvec* b = (intvec * )(v->Data());
420	int r=a->compare(b);
421	switch (iiOp)
422	{
423	case '<':
424	res->data = (char *) (r<0);
425	break;
426	case '>':
427	res->data = (char *) (r>0);
428	break;
429	case LE:
430	res->data = (char *) (r<=0);
431	break;
432	case GE:
433	res->data = (char *) (r>=0);
434	break;
435	case EQUAL_EQUAL:
436	case NOTEQUAL: /* negation handled by jjEQUAL_REST */
437	res->data = (char *) (r==0);
438	break;
439	}
440	jjEQUAL_REST(res,u,v);
441	return r==-2;
442	}
443	static BOOLEAN jjCOMPARE_IV_I(leftv res, leftv u, leftv v)
444	{
445	intvec* a = (intvec * )(u->Data());
446	int b = (int ) (v->Data());
447	int r=a->compare(b);
448	switch (iiOp)
449	{
450	case '<':
451	res->data = (char *) (r<0);
452	break;
453	case '>':
454	res->data = (char *) (r>0);
455	break;
456	case LE:
457	res->data = (char *) (r<=0);
458	break;
459	case GE:
460	res->data = (char *) (r>=0);
461	break;
462	case EQUAL_EQUAL:
463	case NOTEQUAL: /* negation handled by jjEQUAL_REST */
464	res->data = (char *) (r==0);
465	break;
466	}
467	jjEQUAL_REST(res,u,v);
468	return FALSE;
469	}
470	static BOOLEAN jjCOMPARE_P(leftv res, leftv u, leftv v)
471	{
472	poly p=(poly)u->Data();
473	poly q=(poly)v->Data();
474	int r=pComp(p,q);
475	if (r==0)
476	{
477	/* compare lead coeffs */
478	number h=nSub(pGetCoeff(p),pGetCoeff(q));
479	r = -1+nIsZero(h)+2nGreaterZero(h); / -1: <, 0:==, 1: > */
480	nDelete(&h);
481	}
482	else if (p==NULL)
483	{
484	if (q==NULL)
485	{
486	/* compare 0, 0 */
487	r=0;
488	}
489	else if(pIsConstant(q))
490	{
491	/* compare 0, const */
492	r = 1-2nGreaterZero(pGetCoeff(q)); / -1: <, 1: > */
493	}
494	}
495	else if (q==NULL)
496	{
497	if (pIsConstant(p))
498	{
499	/* compare const, 0 */
500	r = -1+2nGreaterZero(pGetCoeff(p)); / -1: <, 1: > */
501	}
502	}
503	switch (iiOp)
504	{
505	case '<':
506	res->data = (char *) (r < 0);
507	break;
508	case '>':
509	res->data = (char *) (r > 0);
510	break;
511	case LE:
512	res->data = (char *) (r <= 0);
513	break;
514	case GE:
515	res->data = (char *) (r >= 0);
516	break;
517	//case EQUAL_EQUAL:
518	//case NOTEQUAL: /* negation handled by jjEQUAL_REST */
519	// res->data = (char *) (r == 0);
520	// break;
521	}
522	jjEQUAL_REST(res,u,v);
523	return FALSE;
524	}
525	static BOOLEAN jjCOMPARE_S(leftv res, leftv u, leftv v)
526	{
527	char* a = (char * )(u->Data());
528	char* b = (char * )(v->Data());
529	int result = strcmp(a,b);
530	switch (iiOp)
531	{
532	case '<':
533	res->data = (char *) (result < 0);
534	break;
535	case '>':
536	res->data = (char *) (result > 0);
537	break;
538	case LE:
539	res->data = (char *) (result <= 0);
540	break;
541	case GE:
542	res->data = (char *) (result >= 0);
543	break;
544	case EQUAL_EQUAL:
545	case NOTEQUAL: /* negation handled by jjEQUAL_REST */
546	res->data = (char *) (result == 0);
547	break;
548	}
549	jjEQUAL_REST(res,u,v);
550	return FALSE;
551	}
552	static BOOLEAN jjOP_REST(leftv res, leftv u, leftv v)
553	{
554	if (u->Next()!=NULL)
555	{
556	u=u->next;
557	res->next = (leftv)AllocSizeOf(sleftv);
558	return iiExprArith2(res->next,u,iiOp,v);
559	}
560	else if (v->Next()!=NULL)
561	{
562	v=v->next;
563	res->next = (leftv)AllocSizeOf(sleftv);
564	return iiExprArith2(res->next,u,iiOp,v);
565	}
566	return FALSE;
567	}
568	static BOOLEAN jjPOWER_I(leftv res, leftv u, leftv v)
569	{
570	int b=(int)u->Data();
571	int e=(int)v->Data();
572	int rc = 1;
573	BOOLEAN overflow=FALSE;
574	if ((e >= 0)&&(b!=0))
575	{
576	int oldrc;
577	while ((e--)!=0)
578	{
579	oldrc=rc;
580	rc *= b;
581	if (!overflow)
582	{
583	if(rc/b!=oldrc) overflow=TRUE;
584	}
585	}
586	if (overflow)
587	Warn("int overflow(^), result may be wrong");
588	res->data = (char *)rc;
589	if (u!=NULL) return jjOP_REST(res,u,v);
590	return FALSE;
591	}
592	else
593	{
594	WerrorS("exponent must be non-negative");
595	return TRUE;
596	}
597	}
598	static BOOLEAN jjPOWER_N(leftv res, leftv u, leftv v)
599	{
600	int e=(int)v->Data();
601	number n=(number)u->CopyD(NUMBER_CMD);
602	if (e<0)
603	{
604	number m=nInvers(n);
605	nDelete(&n);
606	n=m;
607	e=-e;
608	}
609	nPower(n,e,(number*)&res->data);
610	nDelete(&n);
611	if (u!=NULL) return jjOP_REST(res,u,v);
612	return FALSE;
613	}
614	static BOOLEAN jjPOWER_P(leftv res, leftv u, leftv v)
615	{
616	res->data = (char *)pPower((poly)u->CopyD(POLY_CMD),(int)v->Data());
617	if (u!=NULL) return jjOP_REST(res,u,v);
618	return FALSE;
619	}
620	static BOOLEAN jjPOWER_ID(leftv res, leftv u, leftv v)
621	{
622	res->data = (char *)idPower((ideal)(u->Data()),(int)(v->Data()));
623	if (u!=NULL) return jjOP_REST(res,u,v);
624	return FALSE;
625	}
626	static BOOLEAN jjPLUSMINUS_Gen(leftv res, leftv u, leftv v)
627	{
628	u=u->next;
629	v=v->next;
630	if (u==NULL)
631	{
632	if (v==NULL) return FALSE; /* u==NULL, v==NULL */
633	if (iiOp=='-') /* u==NULL, v<>NULL, iiOp=='-'*/
634	{
635	do
636	{
637	if (res->next==NULL)
638	res->next = (leftv)Alloc0SizeOf(sleftv);
639	leftv tmp_v=v->next;
640	v->next=NULL;
641	BOOLEAN b=iiExprArith1(res->next,v,'-');
642	v->next=tmp_v;
643	if (b)
644	return TRUE;
645	v=tmp_v;
646	res=res->next;
647	} while (v!=NULL);
648	return FALSE;
649	}
650	loop /* u==NULL, v<>NULL, iiOp=='+' */
651	{
652	res->next = (leftv)Alloc0SizeOf(sleftv);
653	res=res->next;
654	res->data = v->CopyD();
655	res->rtyp = v->Typ();
656	v=v->next;
657	if (v==NULL) return FALSE;
658	}
659	}
660	if (v!=NULL) /* u<>NULL, v<>NULL */
661	{
662	do
663	{
664	res->next = (leftv)Alloc0SizeOf(sleftv);
665	leftv tmp_u=u->next; u->next=NULL;
666	leftv tmp_v=v->next; v->next=NULL;
667	BOOLEAN b=iiExprArith2(res->next,u,iiOp,v);
668	u->next=tmp_u;
669	v->next=tmp_v;
670	if (b)
671	return TRUE;
672	u=tmp_u;
673	v=tmp_v;
674	res=res->next;
675	} while ((u!=NULL) && (v!=NULL));
676	return FALSE;
677	}
678	loop /* u<>NULL, v==NULL */
679	{
680	res->next = (leftv)Alloc0SizeOf(sleftv);
681	res=res->next;
682	res->data = u->CopyD();
683	res->rtyp = u->Typ();
684	u=u->next;
685	if (u==NULL) return FALSE;
686	}
687	}
688	static BOOLEAN jjCOLCOL(leftv res, leftv u, leftv v)
689	{
690	#ifdef HAVE_NAMESPACES
691	BOOLEAN iiReLoadLib(idhdl packhdl);
692	BOOLEAN iiTryLoadLib(leftv v, char *id);
693	idhdl packhdl;
694
695	switch(u->Typ())
696	{
697	case 0:
698	//Print("%s of type 'ANY'. Trying load.\n", v->name);
699	if(iiTryLoadLib(u, u->name))
700	{
701	Werror("'%s' no such package", u->name);
702	return TRUE;
703	}
704	// else: use next case !!! no break !!!
705
706	case PACKAGE_CMD:
707	packhdl = (idhdl)u->data;
708	if(!IDPACKAGE(packhdl)->loaded)
709	{
710	//if(iiReLoadLib(packhdl))
711	// Werror("unable to reload package '%s'", IDID(packhdl));
712	}
713	if(v->rtyp == IDHDL)
714	{
715	v->name = mstrdup(v->name);
716	}
717	namespaceroot->push( IDPACKAGE(packhdl), IDID(packhdl));
718	syMake(v, v->name, packhdl);
719	memcpy(res, v, sizeof(sleftv));
720	memset(v, 0, sizeof(sleftv));
721	namespaceroot->pop();
722	break;
723
724	case DEF_CMD:
725	break;
726
727	default:
728	WerrorS("<package>::<id> expected");
729	return TRUE;
730	}
731	#else /* HAVE_NAMESPACES */
732	WerrorS("package is not supported in this version");
733	#endif /* HAVE_NAMESPACES */
734	return FALSE;
735	}
736	static BOOLEAN jjPLUS_I(leftv res, leftv u, leftv v)
737	{
738	unsigned int a=(unsigned int)u->Data();
739	unsigned int b=(unsigned int)v->Data();
740	unsigned int c=a+b;
741	res->data = (char *)c;
742	if (((Sy_bit(31)&a)==(Sy_bit(31)&b))&&((Sy_bit(31)&a)!=(Sy_bit(31)&c)))
743	{
744	Warn("int overflow(+), result may be wrong");
745	}
746	return jjPLUSMINUS_Gen(res,u,v);
747	}
748	static BOOLEAN jjPLUS_N(leftv res, leftv u, leftv v)
749	{
750	res->data = (char *)(nAdd((number)u->Data(), (number)v->Data()));
751	return jjPLUSMINUS_Gen(res,u,v);
752	}
753	static BOOLEAN jjPLUS_P(leftv res, leftv u, leftv v)
754	{
755	res->data = (char *)(pAdd((poly)u->CopyD(POLY_CMD) , (poly)v->CopyD(POLY_CMD)));
756	return jjPLUSMINUS_Gen(res,u,v);
757	}
758	static BOOLEAN jjPLUS_IV(leftv res, leftv u, leftv v)
759	{
760	res->data = (char )ivAdd((intvec)(u->Data()), (intvec*)(v->Data()));
761	if (res->data==NULL)
762	{
763	WerrorS("intmat size not compatible");
764	return TRUE;
765	}
766	return jjPLUSMINUS_Gen(res,u,v);
767	}
768	static BOOLEAN jjPLUS_MA(leftv res, leftv u, leftv v)
769	{
770	res->data = (char *)(mpAdd((matrix)u->Data() , (matrix)v->Data()));
771	if (res->data==NULL)
772	{
773	WerrorS("matrix size not compatible");
774	return TRUE;
775	}
776	return jjPLUSMINUS_Gen(res,u,v);
777	}
778	static BOOLEAN jjPLUS_MA_P(leftv res, leftv u, leftv v)
779	{
780	matrix m=(matrix)u->Data();
781	matrix p= mpInitP(m->nrows,m->ncols,(poly)(v->CopyD(POLY_CMD)));
782	if (iiOp=='+')
783	res->data = (char *)mpAdd(m , p);
784	else
785	res->data = (char *)mpSub(m , p);
786	idDelete((ideal *)&p);
787	return jjPLUSMINUS_Gen(res,u,v);
788	}
789	static BOOLEAN jjPLUS_P_MA(leftv res, leftv u, leftv v)
790	{
791	return jjPLUS_MA_P(res,v,u);
792	}
793	static BOOLEAN jjPLUS_S(leftv res, leftv u, leftv v)
794	{
795	char* a = (char * )(u->Data());
796	char* b = (char * )(v->Data());
797	char* r = (char * )AllocL(strlen(a) + strlen(b) + 1);
798	strcpy(r,a);
799	strcat(r,b);
800	res->data=r;
801	return jjPLUSMINUS_Gen(res,u,v);
802	}
803	static BOOLEAN jjPLUS_ID(leftv res, leftv u, leftv v)
804	{
805	res->data = (char *)idAdd((ideal)u->Data(),(ideal)v->Data());
806	return jjPLUSMINUS_Gen(res,u,v);
807	}
808	static BOOLEAN jjMINUS_I(leftv res, leftv u, leftv v)
809	{
810	unsigned int a=(unsigned int)u->Data();
811	unsigned int b=(unsigned int)v->Data();
812	unsigned int c=a-b;
813	if (((Sy_bit(31)&a)!=(Sy_bit(31)&b))&&((Sy_bit(31)&a)!=(Sy_bit(31)&c)))
814	{
815	Warn("int overflow(-), result may be wrong");
816	}
817	res->data = (char *)c;
818	return jjPLUSMINUS_Gen(res,u,v);
819	}
820	static BOOLEAN jjMINUS_N(leftv res, leftv u, leftv v)
821	{
822	res->data = (char *)(nSub((number)u->Data(), (number)v->Data()));
823	return jjPLUSMINUS_Gen(res,u,v);
824	}
825	static BOOLEAN jjMINUS_P(leftv res, leftv u, leftv v)
826	{
827	res->data = (char *)(pSub((poly)u->CopyD(POLY_CMD) , (poly)v->CopyD(POLY_CMD)));
828	return jjPLUSMINUS_Gen(res,u,v);
829	}
830	static BOOLEAN jjMINUS_IV(leftv res, leftv u, leftv v)
831	{
832	res->data = (char )ivSub((intvec)(u->Data()), (intvec*)(v->Data()));
833	if (res->data==NULL)
834	{
835	WerrorS("intmat size not compatible");
836	return TRUE;
837	}
838	return jjPLUSMINUS_Gen(res,u,v);
839	}
840	static BOOLEAN jjMINUS_MA(leftv res, leftv u, leftv v)
841	{
842	res->data = (char *)(mpSub((matrix)u->Data() , (matrix)v->Data()));
843	if (res->data==NULL)
844	{
845	WerrorS("matrix size not compatible");
846	return TRUE;
847	}
848	return jjPLUSMINUS_Gen(res,u,v);
849	}
850	static BOOLEAN jjTIMES_I(leftv res, leftv u, leftv v)
851	{
852	int a=(int)u->Data();
853	int b=(int)v->Data();
854	int c=a * b;
855	if ((b!=0) && (c/b !=a))
856	Warn("int overflow(*), result may be wrong");
857	res->data = (char *)c;
858	if ((u->Next()!=NULL) \|\| (v->Next()!=NULL))
859	return jjOP_REST(res,u,v);
860	return FALSE;
861	}
862	static BOOLEAN jjTIMES_N(leftv res, leftv u, leftv v)
863	{
864	res->data = (char *)(nMult( (number)u->Data(), (number)v->Data()));
865	if ((v->next!=NULL) \|\| (u->next!=NULL))
866	return jjOP_REST(res,u,v);
867	return FALSE;
868	}
869	static BOOLEAN jjTIMES_P(leftv res, leftv u, leftv v)
870	{
871	poly a;
872	poly b;
873
874	if (v->next==NULL)
875	{
876	a=(poly)u->CopyD(POLY_CMD); // works also for VECTOR_CMD
877	if (u->next==NULL)
878	{
879	b=(poly)v->CopyD(POLY_CMD); // works also for VECTOR_CMD
880	res->data = (char *)(pMult( a, b));
881	return FALSE;
882	}
883	// u->next exists: copy v
884	b=pCopy((poly)v->Data());
885	res->data = (char *)(pMult( a, b));
886	return jjOP_REST(res,u,v);
887	}
888	// v->next exists: copy u
889	a=pCopy((poly)u->Data());
890	b=(poly)v->CopyD(POLY_CMD); // works also for VECTOR_CMD
891	res->data = (char *)(pMult( a, b));
892	return jjOP_REST(res,u,v);
893	}
894	static BOOLEAN jjTIMES_ID(leftv res, leftv u, leftv v)
895	{
896	res->data = (char *)idMult((ideal)u->Data(),(ideal)v->Data());
897	if ((v->next!=NULL) \|\| (u->next!=NULL))
898	return jjOP_REST(res,u,v);
899	return FALSE;
900	}
901	static BOOLEAN jjTIMES_IV(leftv res, leftv u, leftv v)
902	{
903	res->data = (char )ivMult((intvec)(u->Data()), (intvec*)(v->Data()));
904	if (res->data==NULL)
905	{
906	WerrorS("intmat size not compatible");
907	return TRUE;
908	}
909	if ((v->next!=NULL) \|\| (u->next!=NULL))
910	return jjOP_REST(res,u,v);
911	return FALSE;
912	}
913	static BOOLEAN jjTIMES_MA_P1(leftv res, leftv u, leftv v)
914	{
915	poly p=(poly)v->CopyD(POLY_CMD);
916	int r=pMaxComp(p);/* recompute the rank for the case idealvector/
917	ideal I= (ideal)mpMultP((matrix)u->CopyD(MATRIX_CMD),p);
918	if (r>0) I->rank=r;
919	res->data = (char *)I;
920	return FALSE;
921	}
922	static BOOLEAN jjTIMES_MA_P2(leftv res, leftv u, leftv v)
923	{
924	return jjTIMES_MA_P1(res,v,u);
925	}
926	static BOOLEAN jjTIMES_MA_N1(leftv res, leftv u, leftv v)
927	{
928	number n=(number)v->CopyD(NUMBER_CMD);
929	poly p=pOne();
930	pSetCoeff(p,n);
931	res->data = (char *)mpMultP((matrix)u->CopyD(MATRIX_CMD),p);
932	return FALSE;
933	}
934	static BOOLEAN jjTIMES_MA_N2(leftv res, leftv u, leftv v)
935	{
936	return jjTIMES_MA_N1(res,v,u);
937	}
938	static BOOLEAN jjTIMES_MA_I1(leftv res, leftv u, leftv v)
939	{
940	res->data = (char *)mpMultI((matrix)u->CopyD(MATRIX_CMD),(int)v->Data());
941	return FALSE;
942	}
943	static BOOLEAN jjTIMES_MA_I2(leftv res, leftv u, leftv v)
944	{
945	return jjTIMES_MA_I1(res,v,u);
946	}
947	static BOOLEAN jjTIMES_MA(leftv res, leftv u, leftv v)
948	{
949	res->data = (char *)mpMult((matrix)u->Data(),(matrix)v->Data());
950	if (res->data==NULL)
951	{
952	WerrorS("matrix size not compatible");
953	return TRUE;
954	}
955	if ((v->next!=NULL) \|\| (u->next!=NULL))
956	return jjOP_REST(res,u,v);
957	return FALSE;
958	}
959	static BOOLEAN jjGE_I(leftv res, leftv u, leftv v)
960	{
961	res->data = (char *)((int)u->Data() >= (int)v->Data());
962	return FALSE;
963	}
964	static BOOLEAN jjGE_N(leftv res, leftv u, leftv v)
965	{
966	number h=nSub((number)u->Data(),(number)v->Data());
967	res->data = (char *) (nGreaterZero(h)\|\|(nIsZero(h)));
968	nDelete(&h);
969	return FALSE;
970	}
971	static BOOLEAN jjGT_I(leftv res, leftv u, leftv v)
972	{
973	res->data = (char *)((int)u->Data()>(int)v->Data());
974	return FALSE;
975	}
976	static BOOLEAN jjGT_N(leftv res, leftv u, leftv v)
977	{
978	number h=nSub((number)u->Data(),(number)v->Data());
979	res->data = (char *) (nGreaterZero(h)&&(!nIsZero(h)));
980	nDelete(&h);
981	return FALSE;
982	}
983	static BOOLEAN jjLE_I(leftv res, leftv u, leftv v)
984	{
985	res->data = (char *)((int)u->Data() <= (int)v->Data());
986	return FALSE;
987	}
988	static BOOLEAN jjLE_N(leftv res, leftv u, leftv v)
989	{
990	number h=nSub((number)v->Data(),(number)u->Data());
991	res->data = (char *) (nGreaterZero(h)\|\|nIsZero(h));
992	nDelete(&h);
993	return FALSE;
994	}
995	static BOOLEAN jjLT_I(leftv res, leftv u, leftv v)
996	{
997	res->data = (char *)((int)u->Data() < (int)v->Data());
998	return FALSE;
999	}
1000	static BOOLEAN jjLT_N(leftv res, leftv u, leftv v)
1001	{
1002	number h=nSub((number)v->Data(),(number)u->Data());
1003	res->data = (char *) (nGreaterZero(h)&&(!nIsZero(h)));
1004	nDelete(&h);
1005	return FALSE;
1006	}
1007	static BOOLEAN jjDIV_I(leftv res, leftv u, leftv v)
1008	{
1009	int a= (int) u->Data();
1010	int b= (int) v->Data();
1011	if (b==0)
1012	{
1013	WerrorS("div. by 0");
1014	return TRUE;
1015	}
1016	//int c=a%ABS(b);
1017	//if(c<0) c+=ABS(b);
1018	//res->data = (char *)((a-c) / b);
1019	res->data = (char *)(a / b);
1020	return FALSE;
1021	}
1022	static BOOLEAN jjDIV_N(leftv res, leftv u, leftv v)
1023	{
1024	number q=(number)v->Data();
1025	if (nIsZero(q))
1026	{
1027	WerrorS("div. by 0");
1028	return TRUE;
1029	}
1030	q = nDiv((number)u->Data(),q);
1031	nNormalize(q);
1032	res->data = (char *)q;
1033	return FALSE;
1034	}
1035	static BOOLEAN jjDIV_P(leftv res, leftv u, leftv v)
1036	{
1037	poly q=(poly)v->Data();
1038	if (q==NULL)
1039	{
1040	WerrorS("div. by 0");
1041	return TRUE;
1042	}
1043	if (pNext(q)!=NULL)
1044	{
1045	#ifdef HAVE_FACTORY
1046	res->data=(void*)(singclap_pdivide((poly)(u->Data()),
1047	(poly)(v->Data())));
1048	#else
1049	WerrorS("division only by a monomial");
1050	return TRUE;
1051	#endif
1052	}
1053	else
1054	{
1055	res->data = (char *)pDivideM((poly)u->CopyD(POLY_CMD),pHead(q));
1056	}
1057	return FALSE;
1058	}
1059	static BOOLEAN jjMOD_I(leftv res, leftv u, leftv v)
1060	{
1061	int a=(int)u->Data();
1062	int b=ABS((int)v->Data());
1063	if (errorreported) return TRUE;
1064	if (b==0)
1065	{
1066	WerrorS("div. by 0");
1067	return TRUE;
1068	}
1069	int c=a%b;
1070	if(c<0) c+=b;
1071	res->data = (char *)c;
1072	return FALSE;
1073	}
1074	static BOOLEAN jjEQUAL_I(leftv res, leftv u, leftv v)
1075	{
1076	res->data = (char *)((int)u->Data() == (int)v->Data());
1077	jjEQUAL_REST(res,u,v);
1078	return FALSE;
1079	}
1080	static BOOLEAN jjEQUAL_Ma(leftv res, leftv u, leftv v)
1081	{
1082	res->data = (char *)mpEqual((matrix)u->Data(),(matrix)v->Data());
1083	jjEQUAL_REST(res,u,v);
1084	return FALSE;
1085	}
1086	static BOOLEAN jjEQUAL_N(leftv res, leftv u, leftv v)
1087	{
1088	res->data = (char *)nEqual((number)u->Data(),(number)v->Data());
1089	jjEQUAL_REST(res,u,v);
1090	return FALSE;
1091	}
1092	static BOOLEAN jjEQUAL_P(leftv res, leftv u, leftv v)
1093	{
1094	poly p=(poly)u->Data();
1095	poly q=(poly)v->Data();
1096	if (p==NULL)
1097	{
1098	res->data=(char *)(q==NULL);
1099	}
1100	else
1101	{
1102	if (q==NULL) res->data=(char *)FALSE;
1103	else
1104	{
1105	int r=pComp(p,q);
1106	if (r==0)
1107	{
1108	p=pSub(pCopy(p),pCopy(q));
1109	res->data = (char *) (p==NULL);
1110	pDelete(&p);
1111	}
1112	else
1113	res->data = (char *) FALSE;
1114	}
1115	}
1116	jjEQUAL_REST(res,u,v);
1117	return FALSE;
1118	}
1119	static BOOLEAN jjAND_I(leftv res, leftv u, leftv v)
1120	{
1121	res->data = (char *)((int)u->Data() && (int)v->Data());
1122	return FALSE;
1123	}
1124	static BOOLEAN jjOR_I(leftv res, leftv u, leftv v)
1125	{
1126	res->data = (char *)((int)u->Data() \|\| (int)v->Data());
1127	return FALSE;
1128	}
1129	static BOOLEAN jjINDEX_I(leftv res, leftv u, leftv v)
1130	{
1131	res->rtyp=u->rtyp; u->rtyp=0;
1132	res->data=u->data; u->data=NULL;
1133	res->name=u->name; u->name=NULL;
1134	#ifdef HAVE_NAMESPACES
1135	res->packhdl=u->packhdl; u->packhdl=NULL;
1136	res->req_packhdl=u->req_packhdl; u->req_packhdl=NULL;
1137	#endif /* HAVE_NAMESPACES */
1138	res->e=u->e; u->e=NULL;
1139	if (res->e==NULL) res->e=jjMakeSub(v);
1140	else
1141	{
1142	Subexpr sh=res->e;
1143	while (sh->next != NULL) sh=sh->next;
1144	sh->next=jjMakeSub(v);
1145	}
1146	return FALSE;
1147	}
1148	static BOOLEAN jjINDEX_IV(leftv res, leftv u, leftv v)
1149	{
1150	if ((u->rtyp!=IDHDL)\|\|(u->e!=NULL))
1151	{
1152	WerrorS("indexed object must have a name");
1153	return TRUE;
1154	}
1155	intvec * iv=(intvec *)v->Data();
1156	leftv p=NULL;
1157	int i;
1158	sleftv t;
1159
1160	memset(&t,0,sizeof(t));
1161	t.rtyp=INT_CMD;
1162	for (i=0;i<iv->length(); i++)
1163	{
1164	t.data=(char )(iv)[i];
1165	if (p==NULL)
1166	{
1167	p=res;
1168	}
1169	else
1170	{
1171	p->next=(leftv)Alloc0SizeOf(sleftv);
1172	p=p->next;
1173	}
1174	p->rtyp=IDHDL;
1175	p->data=u->data;
1176	p->name=u->name;
1177	#ifdef HAVE_NAMESPACES
1178	p->packhdl=u->packhdl;
1179	#endif /* HAVE_NAMESPACES */
1180	p->flag\|=u->flag;
1181	p->e=jjMakeSub(&t);
1182	}
1183	u->rtyp=0;
1184	u->data=NULL;
1185	u->name=NULL;
1186	return FALSE;
1187	}
1188	static BOOLEAN jjINDEX_P(leftv res, leftv u, leftv v)
1189	{
1190	poly p=(poly)u->Data();
1191	int i=(int)v->Data();
1192	int j=0;
1193	while (p!=NULL)
1194	{
1195	j++;
1196	if (j==i)
1197	{
1198	res->data=(char *)pHead(p);
1199	return FALSE;
1200	}
1201	pIter(p);
1202	}
1203	return FALSE;
1204	}
1205	static BOOLEAN jjINDEX_P_IV(leftv res, leftv u, leftv v)
1206	{
1207	poly p=(poly)u->Data();
1208	poly r=NULL;
1209	intvec iv=(intvec )v->CopyD(INTVEC_CMD);
1210	int i;
1211	int sum=0;
1212	for(i=iv->length()-1;i>=0;i--)
1213	sum+=(*iv)[i];
1214	int j=0;
1215	while ((p!=NULL) && (sum>0))
1216	{
1217	j++;
1218	for(i=iv->length()-1;i>=0;i--)
1219	{
1220	if (j==(*iv)[i])
1221	{
1222	r=pAdd(r,pHead(p));
1223	sum-=j;
1224	(*iv)[i]=0;
1225	break;
1226	}
1227	}
1228	pIter(p);
1229	}
1230	delete iv;
1231	res->data=(char *)r;
1232	return FALSE;
1233	}
1234	static BOOLEAN jjINDEX_V(leftv res, leftv u, leftv v)
1235	{
1236	poly p=(poly)u->CopyD(VECTOR_CMD);
1237	poly r=p; // pointer to the beginning of component i
1238	poly o=NULL;
1239	int i=(int)v->Data();
1240	while (p!=NULL)
1241	{
1242	if (pGetComp(p)!=i)
1243	{
1244	if (r==p) r=pNext(p);
1245	if (o!=NULL)
1246	{
1247	pDelete1(&pNext(o));
1248	p=pNext(o);
1249	}
1250	else
1251	pDelete1(&p);
1252	}
1253	else
1254	{
1255	pSetComp(p, 0);
1256	o=p;
1257	p=pNext(o);
1258	}
1259	}
1260	res->data=(char *)r;
1261	return FALSE;
1262	}
1263	static BOOLEAN jjINDEX_V_IV(leftv res, leftv u, leftv v)
1264	{
1265	poly p=(poly)u->CopyD(VECTOR_CMD);
1266	if (p!=NULL)
1267	{
1268	poly r=pOne();
1269	poly hp=r;
1270	intvec iv=(intvec )v->Data();
1271	int i;
1272	loop
1273	{
1274	for(i=0;i<iv->length();i++)
1275	{
1276	if (pGetComp(p)==(*iv)[i])
1277	{
1278	poly h;
1279	pSplit(p,&h);
1280	pNext(hp)=p;
1281	p=h;
1282	pIter(hp);
1283	break;
1284	}
1285	}
1286	if (p==NULL) break;
1287	if (i==iv->length())
1288	{
1289	pDelete1(&p);
1290	if (p==NULL) break;
1291	}
1292	}
1293	pDelete1(&r);
1294	res->data=(char *)r;
1295	}
1296	return FALSE;
1297	}
1298	static BOOLEAN jjKLAMMER(leftv res, leftv u, leftv v)
1299	{
1300	if(u->name==NULL) return TRUE;
1301	char * nn = (char *)AllocL(strlen(u->name) + 14);
1302	sprintf(nn,"%s(%d)",u->name,(int)v->Data());
1303	FreeL((ADDRESS)u->name);
1304	u->name=NULL;
1305	char *n=mstrdup(nn);
1306	FreeL((ADDRESS)nn);
1307	#ifdef HAVE_NAMESPACES
1308	if(u->req_packhdl != NULL)
1309	{
1310	namespaceroot->push( IDPACKAGE(u->req_packhdl), IDID(u->req_packhdl));
1311	syMake(res,n);
1312	namespaceroot->pop();
1313	}
1314	else
1315	#endif /* HAVE_NAMESPACES */
1316	syMake(res,n);
1317	return FALSE;
1318	}
1319	static BOOLEAN jjKLAMMER_IV(leftv res, leftv u, leftv v)
1320	{
1321	intvec * iv=(intvec *)v->Data();
1322	leftv p=NULL;
1323	int i;
1324	int slen = strlen(u->name) + 14;
1325	char n = (char) Alloc(slen);
1326	#ifdef HAVE_NAMESPACES
1327	BOOLEAN needpop=FALSE;
1328
1329	if(u->req_packhdl != NULL)
1330	{
1331	namespaceroot->push( IDPACKAGE(u->req_packhdl), IDID(u->req_packhdl));
1332	needpop = TRUE;
1333	}
1334	#endif /* HAVE_NAMESPACES */
1335
1336	for (i=0;i<iv->length(); i++)
1337	{
1338	if (p==NULL)
1339	{
1340	p=res;
1341	}
1342	else
1343	{
1344	p->next=(leftv)Alloc0SizeOf(sleftv);
1345	p=p->next;
1346	}
1347	sprintf(n,"%s(%d)",u->name,(*iv)[i]);
1348	syMake(p,mstrdup(n));
1349	}
1350	FreeL((ADDRESS)u->name);
1351	u->name = NULL;
1352	Free(n, slen);
1353	#ifdef HAVE_NAMESPACES
1354	if(needpop) namespaceroot->pop();
1355	#endif /* HAVE_NAMESPACES */
1356	return FALSE;
1357	}
1358	static BOOLEAN jjPROC(leftv res, leftv u, leftv v)
1359	{
1360	#ifdef HAVE_NAMESPACES
1361	leftv sl = iiMake_proc((idhdl)u->data,u,v);
1362	#else /* HAVE_NAMESPACES */
1363	leftv sl = iiMake_proc((idhdl)u->data,v);
1364	#endif /* HAVE_NAMESPACES */
1365	if (sl==NULL)
1366	{
1367	return TRUE;
1368	}
1369	else
1370	{
1371	memcpy(res,sl,sizeof(sleftv));
1372	}
1373	return FALSE;
1374	}
1375	static BOOLEAN jjMAP(leftv res, leftv u, leftv v)
1376	{
1377	//Print("try to map %s with %s\n",$3.Name(),$1.Name());
1378	leftv sl=NULL;
1379	if ((v->e==NULL)&&(v->name!=NULL))
1380	{
1381	map m=(map)u->Data();
1382	sl=iiMap(m,v->name);
1383	}
1384	else
1385	{
1386	Werror("%s(<name>) expected",u->Name());
1387	}
1388	if (sl==NULL) return TRUE;
1389	memcpy(res,sl,sizeof(sleftv));
1390	FreeSizeOf((ADDRESS)sl,sleftv);
1391	return FALSE;
1392	}
1393	static BOOLEAN jjCALL2MANY(leftv res, leftv u, leftv v)
1394	{
1395	u->next=(leftv)AllocSizeOf(sleftv);
1396	memcpy(u->next,v,sizeof(sleftv));
1397	BOOLEAN r=iiExprArithM(res,u,iiOp);
1398	v->rtyp=0; v->data=NULL; // iiExprArithM did the CleanUp
1399	return r;
1400	}
1401	static BOOLEAN jjCOEF(leftv res, leftv u, leftv v)
1402	{
1403	res->data=(char *)mpCoeffProc((poly)u->Data(),(poly)v->Data());
1404	return FALSE;
1405	}
1406	static BOOLEAN jjCOEFFS_Id(leftv res, leftv u, leftv v)
1407	{
1408	int i=pVar((poly)v->Data());
1409	if (i==0)
1410	{
1411	WerrorS("ringvar expected");
1412	return TRUE;
1413	}
1414	res->data=(char *)mpCoeffs((ideal)u->CopyD(),i);
1415	return FALSE;
1416	}
1417	static BOOLEAN jjCONTRACT(leftv res, leftv u, leftv v)
1418	{
1419	res->data=(char *)idDiffOp((ideal)u->Data(),(ideal)v->Data(),FALSE);
1420	return FALSE;
1421	}
1422	static BOOLEAN jjDEG_IV(leftv res, leftv u, leftv v)
1423	{
1424	short iv=iv2array((intvec )v->Data());
1425	res->data = (char *)pDegW((poly)u->Data(),iv);
1426	Free((ADDRESS)iv,(pVariables+1)*sizeof(short));
1427	return FALSE;
1428	}
1429	static BOOLEAN jjDIFF_P(leftv res, leftv u, leftv v)
1430	{
1431	int i=pVar((poly)v->Data());
1432	if (i==0)
1433	{
1434	WerrorS("ringvar expected");
1435	return TRUE;
1436	}
1437	res->data=(char *)pDiff((poly)(u->Data()),i);
1438	return FALSE;
1439	}
1440	static BOOLEAN jjDIFF_ID(leftv res, leftv u, leftv v)
1441	{
1442	int i=pVar((poly)v->Data());
1443	if (i==0)
1444	{
1445	WerrorS("ringvar expected");
1446	return TRUE;
1447	}
1448	res->data=(char *)idDiff((matrix)(u->Data()),i);
1449	return FALSE;
1450	}
1451	static BOOLEAN jjDIFF_ID_ID(leftv res, leftv u, leftv v)
1452	{
1453	res->data=(char *)idDiffOp((ideal)u->Data(),(ideal)v->Data());
1454	return FALSE;
1455	}
1456
1457	static BOOLEAN jjELIMIN(leftv res, leftv u, leftv v)
1458	{
1459	res->data=(char *)idElimination((ideal)u->Data(),(poly)v->Data());
1460	setFlag(res,FLAG_STD);
1461	return FALSE;
1462	}
1463	static BOOLEAN jjERROR(leftv res, leftv u)
1464	{
1465	WerrorS((char *)u->Data());
1466	return TRUE;
1467	}
1468	static BOOLEAN jjDIM2(leftv res, leftv v, leftv w)
1469	{
1470	assumeStdFlag(v);
1471	if(currQuotient==NULL)
1472	res->data = (char *)scDimInt((ideal)(v->Data()),(ideal)w->Data());
1473	else
1474	{
1475	ideal q=idSimpleAdd(currQuotient,(ideal)w->Data());
1476	res->data = (char *)scDimInt((ideal)(v->Data()),q);
1477	idDelete(&q);
1478	}
1479	return FALSE;
1480	}
1481	static BOOLEAN jjEXTGCD_I(leftv res, leftv u, leftv v)
1482	{
1483	int p0=ABS((int)u->Data()),p1=ABS((int)v->Data());
1484	int f0 = 1, f1 = 0, g0 = 0, g1 = 1, q, r;
1485
1486	while ( p1!=0 )
1487	{
1488	q=p0 / p1;
1489	r=p0 % p1;
1490	p0 = p1; p1 = r;
1491	r = g0 - g1 * q;
1492	g0 = g1; g1 = r;
1493	r = f0 - f1 * q;
1494	f0 = f1; f1 = r;
1495	}
1496	int a = f0;
1497	int b = g0;
1498	if ( (int)u->Data() < 0 ) a=-a;
1499	if ( (int)v->Data() < 0 ) b=-b;
1500	lists L=(lists)AllocSizeOf(slists);
1501	L->Init(3);
1502	L->m[0].rtyp=INT_CMD;
1503	L->m[0].data=(void *)p0;
1504	L->m[1].rtyp=INT_CMD;
1505	L->m[1].data=(void *)a;
1506	L->m[2].rtyp=INT_CMD;
1507	L->m[2].data=(void *)b;
1508	res->rtyp=LIST_CMD;
1509	res->data=(char *)L;
1510	return FALSE;
1511	}
1512	#ifdef HAVE_FACTORY
1513	static BOOLEAN jjFACSTD2(leftv res, leftv v, leftv w)
1514	{
1515	res->data=(void *)kStdfac((ideal)v->Data(),NULL,testHomog,NULL,
1516	(ideal)w->Data());
1517	setFlag(res,FLAG_STD);
1518	return FALSE;
1519	}
1520	#endif
1521	static BOOLEAN jjFETCH(leftv res, leftv u, leftv v)
1522	{
1523	ring r=(ring)u->Data();
1524	idhdl w;
1525	int op=iiOp;
1526
1527	if ((w=r->idroot->get(v->Name(),myynest))!=NULL)
1528	{
1529	int *perm=NULL;
1530	int *par_perm=NULL;
1531	int par_perm_size=0;
1532	BOOLEAN bo;
1533	//if (!nSetMap(rInternalChar(r),r->parameter,rPar(r),r->minpoly))
1534	if (!nSetMap(r))
1535	{
1536	if (rEqual(r,currRing))
1537	{
1538	nMap=nCopy;
1539	}
1540	else
1541	// Allow imap/fetch to be make an exception only for:
1542	if ( (rField_is_Q_a(r) && // Q(a..) -> Q(a..) \|\| Q \|\| Zp \|\| Zp(a)
1543	(rField_is_Q() \|\| rField_is_Q_a() \|\|
1544	(rField_is_Zp() \|\| rField_is_Zp_a())))
1545	\|\|
1546	(rField_is_Zp_a(r) && // Zp(a..) -> Zp(a..) \|\| Zp
1547	(rField_is_Zp(currRing, rInternalChar(r)) \|\|
1548	rField_is_Zp_a(currRing, rInternalChar(r)))) )
1549	{
1550	par_perm_size=rPar(r);
1551	BITSET save_test=test;
1552	naSetChar(rInternalChar(r),TRUE,r->parameter,rPar(r));
1553	nSetChar(currRing,TRUE);
1554	test=save_test;
1555	}
1556	else
1557	{
1558	goto err_fetch;
1559	}
1560	}
1561	if ((iiOp!=FETCH_CMD) \|\| (r->N!=pVariables) \|\| (rPar(r)!=rPar(currRing)))
1562	{
1563	perm=(int )Alloc0((r->N+1)sizeof(int));
1564	if (par_perm_size!=0)
1565	par_perm=(int )Alloc0(par_perm_sizesizeof(int));
1566	op=IMAP_CMD;
1567	if (iiOp==IMAP_CMD)
1568	{
1569	maFindPerm(r->names, r->N, r->parameter, r->P,
1570	currRing->names,currRing->N,currRing->parameter, currRing->P,
1571	perm,par_perm, currRing->ch);
1572	}
1573	else
1574	{
1575	int i;
1576	if (par_perm_size!=0)
1577	for(i=0;i<min(rPar(r),rPar(currRing));i++) par_perm[i]=-(i+1);
1578	for(i=1;i<=min(r->N,pVariables);i++) perm[i]=i;
1579	}
1580	}
1581	sleftv tmpW;
1582	memset(&tmpW,0,sizeof(sleftv));
1583	tmpW.rtyp=IDTYP(w);
1584	tmpW.data=IDDATA(w);
1585	if ((bo=maApplyFetch(op,NULL,res,&tmpW, r,
1586	perm,par_perm,par_perm_size)))
1587	{
1588	Werror("cannot map %s of type %s(%d)",v->name, Tok2Cmdname(w->typ),w->typ);
1589	}
1590	if (perm!=NULL)
1591	Free((ADDRESS)perm,(r->N+1)*sizeof(int));
1592	if (par_perm!=NULL)
1593	Free((ADDRESS)par_perm,par_perm_size*sizeof(int));
1594	return bo;
1595	}
1596	else
1597	{
1598	Werror("identifier %s not found in %s",v->Fullname(),u->Fullname());
1599	}
1600	return TRUE;
1601	err_fetch:
1602	Werror("no identity map from %s",u->Fullname());
1603	return TRUE;
1604	}
1605	static BOOLEAN jjFIND2(leftv res, leftv u, leftv v)
1606	{
1607	/*4
1608	* look for the substring what in the string where
1609	* return the position of the first char of what in where
1610	* or 0
1611	*/
1612	char where=(char )u->Data();
1613	char what=(char )v->Data();
1614	char *found = strstr(where,what);
1615	if (found != NULL)
1616	{
1617	res->data=(char *)((found-where)+1);
1618	}
1619	/else res->data=NULL;/
1620	return FALSE;
1621	}
1622	static BOOLEAN jjGCD_I(leftv res, leftv u, leftv v)
1623	{
1624	int p0=ABS((int)u->Data()),p1=ABS((int)v->Data());
1625	int r;
1626
1627	while ( p1!=0 )
1628	{
1629	r=p0 % p1;
1630	p0 = p1; p1 = r;
1631	}
1632	res->rtyp=INT_CMD;
1633	res->data=(char *)p0;
1634	return FALSE;
1635	}
1636	static BOOLEAN jjHILBERT2(leftv res, leftv u, leftv v)
1637	{
1638	assumeStdFlag(u);
1639	intvec module_w=(intvec)atGet(u,"isHomog");
1640	intvec *iv=hFirstSeries((ideal)u->Data(),module_w,currQuotient);
1641	switch((int)v->Data())
1642	{
1643	case 1:
1644	res->data=(void *)iv;
1645	return FALSE;
1646	case 2:
1647	res->data=(void *)hSecondSeries(iv);
1648	delete iv;
1649	return FALSE;
1650	}
1651	WerrorS(feNotImplemented);
1652	delete iv;
1653	return TRUE;
1654	}
1655	static BOOLEAN jjHOMOG_P(leftv res, leftv u, leftv v)
1656	{
1657	int i=pVar((poly)v->Data());
1658	if (i==0)
1659	{
1660	WerrorS("ringvar expected");
1661	return TRUE;
1662	}
1663	res->data = (char *)pHomogen((poly)u->Data(),i);
1664	return FALSE;
1665	}
1666	static BOOLEAN jjHOMOG_ID(leftv res, leftv u, leftv v)
1667	{
1668	int i=pVar((poly)v->Data());
1669	if (i==0)
1670	{
1671	WerrorS("ringvar expected");
1672	return TRUE;
1673	}
1674	res->data = (char *)idHomogen((ideal)u->Data(),i);
1675	return FALSE;
1676	}
1677	static BOOLEAN jjINDEPSET2(leftv res, leftv u, leftv v)
1678	{
1679	assumeStdFlag(u);
1680	res->data=(void *)scIndIndset((ideal)(u->Data()),(int)(v->Data()),
1681	currQuotient);
1682	return FALSE;
1683	}
1684	static BOOLEAN jjINTERSECT(leftv res, leftv u, leftv v)
1685	{
1686	res->data=(char *)idSect((ideal)u->Data(),(ideal)v->Data());
1687	setFlag(res,FLAG_STD);
1688	return FALSE;
1689	}
1690	static BOOLEAN jjJET_P(leftv res, leftv u, leftv v)
1691	{
1692	res->data = (char *)pJet((poly)u->Data(),(int)v->Data());
1693	return FALSE;
1694	}
1695	static BOOLEAN jjJET_ID(leftv res, leftv u, leftv v)
1696	{
1697	res->data = (char *)idJet((ideal)u->Data(),(int)v->Data());
1698	return FALSE;
1699	}
1700	static BOOLEAN jjKBASE2(leftv res, leftv u, leftv v)
1701	{
1702	assumeStdFlag(u);
1703	res->data = (char *)scKBase((int)v->Data(),
1704	(ideal)(u->Data()),currQuotient);
1705	return FALSE;
1706	}
1707	static BOOLEAN jjKoszul(leftv res, leftv u, leftv v)
1708	{
1709	return mpKoszul(res, u,v);
1710	}
1711	static BOOLEAN jjKoszul_Id(leftv res, leftv u, leftv v)
1712	{
1713	sleftv h;
1714	memset(&h,0,sizeof(sleftv));
1715	h.rtyp=INT_CMD;
1716	h.data=(void *)IDELEMS((ideal)v->Data());
1717	return mpKoszul(res, &h, u, v);
1718	}
1719	static BOOLEAN jjLIFT(leftv res, leftv u, leftv v)
1720	{
1721	ideal m;
1722	int ul= IDELEMS((ideal)u->Data());
1723	int vl= IDELEMS((ideal)v->Data());
1724	if (hasFlag(u,FLAG_STD))
1725	{
1726	m = idLift((ideal)u->Data(),(ideal)v->Data());
1727	res->data = (char *)idModule2formatedMatrix(m,ul,vl);
1728	}
1729	else
1730	{
1731	// matrix ma=mpNew(1,1);
1732	// ideal mo=idLiftStd((ideal)u->CopyD(),currQuotient,&ma,testHomog);
1733	// m = idLift(mo,(ideal)v->Data());
1734	// matrix r=idModule2formatedMatrix(m, IDELEMS(mo),vl);
1735	// idDelete(&mo);
1736	// // idDelete(&m); already done by idModule2formatedMatrix
1737	// res->data=(char *)mpMult(ma,r);
1738	// idDelete((ideal *)&ma);
1739	// idDelete((ideal *)&r);
1740	m = idLiftNonStB((ideal)u->Data(),(ideal)v->Data());
1741	res->data = (char *)idModule2formatedMatrix(m,ul,vl);
1742	}
1743	return FALSE;
1744	}
1745	static BOOLEAN jjLIFTSTD(leftv res, leftv u, leftv v)
1746	{
1747	if ((v->rtyp!=IDHDL)\|\|(v->e!=NULL)) return TRUE;
1748	idhdl h=(idhdl)v->data;
1749	// CopyD for IDEAL_CMD and MODUL_CMD are identical:
1750	res->data = (char *)idLiftStd((ideal)u->Data(), currQuotient,
1751	&(h->data.umatrix),testHomog);
1752	setFlag(res,FLAG_STD);
1753	return FALSE;
1754	}
1755	static BOOLEAN jjMINOR(leftv res, leftv u, leftv v)
1756	{
1757	res->data = (char *)idMinors((matrix)u->Data(),(int)v->Data());
1758	return FALSE;
1759	}
1760	static BOOLEAN jjMODULO(leftv res, leftv u, leftv v)
1761	{
1762	res->data = (char *)idModulo((ideal)u->Data(),(ideal)v->Data());
1763	return FALSE;
1764	}
1765	static BOOLEAN jjMONITOR2(leftv res, leftv u,leftv v)
1766	{
1767	char opt=(char )v->Data();
1768	int mode=0;
1769	while(*opt!='\0')
1770	{
1771	if (*opt=='i') mode \|= PROT_I;
1772	else if (*opt=='o') mode \|= PROT_O;
1773	opt++;
1774	}
1775	monitor((char *)(u->Data()),mode);
1776	return FALSE;
1777	}
1778	static BOOLEAN jjPARSTR2(leftv res, leftv u, leftv v)
1779	{
1780	idhdl h=(idhdl)u->data;
1781	int i=(int)v->Data();
1782	int p=0;
1783	if ((0<i)
1784	&& (IDRING(h)->parameter!=NULL)
1785	&& (i<=(p=rPar(IDRING(h)))))
1786	res->data=mstrdup(IDRING(h)->parameter[i-1]);
1787	else
1788	{
1789	Werror("par number %d out of range 1..%d",i,p);
1790	return TRUE;
1791	}
1792	return FALSE;
1793	}
1794	static BOOLEAN jjQUOT(leftv res, leftv u, leftv v)
1795	{
1796	res->data = (char *)idQuot((ideal)u->Data(),(ideal)v->Data(),
1797	hasFlag(u,FLAG_STD),u->Typ()==v->Typ());
1798	idDelMultiples((ideal)(res->data));
1799	return FALSE;
1800	}
1801	static BOOLEAN jjRANDOM(leftv res, leftv u, leftv v)
1802	{
1803	int i=(int)u->Data();
1804	int j=(int)v->Data();
1805	#ifdef buildin_rand
1806	res->data =(char *)((i > j) ? i : (siRand() % (j-i+1)) + i);
1807	#else
1808	res->data =(char *)((i > j) ? i : (rand() % (j-i+1)) + i);
1809	#endif
1810	return FALSE;
1811	}
1812	static BOOLEAN jjREAD2(leftv res, leftv u, leftv v)
1813	{
1814	si_link l=(si_link)u->Data();
1815	leftv r=slRead(l,v);
1816	if (r==NULL)
1817	{
1818	const char *s;
1819	if ((l!=NULL)&&(l->name!=NULL)) s=l->name;
1820	else s=sNoName;
1821	Werror("cannot read from `%s`",s);
1822	return TRUE;
1823	}
1824	memcpy(res,r,sizeof(sleftv));
1825	FreeSizeOf((ADDRESS)r,sleftv);
1826	return FALSE;
1827	}
1828	static BOOLEAN jjREDUCE_P(leftv res, leftv u, leftv v)
1829	{
1830	assumeStdFlag(v);
1831	res->data = (char *)kNF((ideal)v->Data(),currQuotient,(poly)u->Data());
1832	return FALSE;
1833	}
1834	static BOOLEAN jjREDUCE_ID(leftv res, leftv u, leftv v)
1835	{
1836	assumeStdFlag(v);
1837	res->data = (char *)kNF((ideal)v->Data(),currQuotient,(ideal)u->Data());
1838	return FALSE;
1839	}
1840	static BOOLEAN jjRES(leftv res, leftv u, leftv v)
1841	{
1842	int maxl=(int)v->Data();
1843	if (maxl<0)
1844	{
1845	WerrorS("length for res must not be negative");
1846	return TRUE;
1847	}
1848	int l=0;
1849	//resolvente r;
1850	syStrategy r;
1851	intvec **weights=NULL;
1852	int wmaxl=maxl;
1853	ideal u_id=(ideal)u->Data();
1854	maxl--;
1855	if ((maxl==-1) && (iiOp!=MRES_CMD))
1856	maxl = pVariables-1;
1857	if ((iiOp == RES_CMD) \|\| (iiOp == MRES_CMD))
1858	{
1859	intvec * iv=(intvec*)atGet(u,"isHomog");
1860	r=syResolution(u_id,maxl, iv, iiOp==MRES_CMD);
1861	}
1862	else if (iiOp==SRES_CMD)
1863	// r=sySchreyerResolvente(u_id,maxl+1,&l);
1864	r=sySchreyer(u_id,maxl+1);
1865	else if (iiOp == LRES_CMD)
1866	{
1867	int dummy;
1868	if((currQuotient!=NULL)\|\|
1869	(!idHomIdeal (u_id,NULL)))
1870	{
1871	WerrorS
1872	("`lres` not implemented for inhomogeneous input or qring");
1873	return TRUE;
1874	}
1875	r=syLaScala3(u_id,&dummy);
1876	}
1877	else
1878	{
1879	int dummy;
1880	if((currQuotient!=NULL)\|\|
1881	(!idHomIdeal (u_id,NULL)))
1882	{
1883	WerrorS
1884	("`hres` not implemented for inhomogeneous input or qring");
1885	return TRUE;
1886	}
1887	r=syHilb(u_id,&dummy);
1888	}
1889	if (r==NULL) return TRUE;
1890	//res->data=(void *)liMakeResolv(r,l,wmaxl,u->Typ(),weights);
1891	r->list_length=wmaxl;
1892	res->data=(void *)r;
1893	return FALSE;
1894	}
1895	static BOOLEAN jjRSUM(leftv res, leftv u, leftv v)
1896	{
1897	ring r;
1898	int i=rSum((ring)u->Data(),(ring)v->Data(),r);
1899	res->data = (char *)r;
1900	return (i==-1);
1901	}
1902	#define SIMPL_LMDIV 32
1903	#define SIMPL_LMEQ 16
1904	#define SIMPL_MULT 8
1905	#define SIMPL_EQU 4
1906	#define SIMPL_NULL 2
1907	#define SIMPL_NORM 1
1908	static BOOLEAN jjSIMPL_ID(leftv res, leftv u, leftv v)
1909	{
1910	int sw = (int)v->Data();
1911	// CopyD for IDEAL_CMD and MODUL_CMD are identical:
1912	ideal id = (ideal)u->CopyD(IDEAL_CMD);
1913	if (sw & SIMPL_LMDIV)
1914	{
1915	idDelDiv(id);
1916	}
1917	if (sw & SIMPL_LMEQ)
1918	{
1919	idDelLmEquals(id);
1920	}
1921	if (sw & SIMPL_NULL)
1922	{
1923	idSkipZeroes(id);
1924	}
1925	if (sw & SIMPL_NORM)
1926	{
1927	idNorm(id);
1928	}
1929	if (sw & SIMPL_MULT)
1930	{
1931	idDelMultiples(id);
1932	}
1933	else if(sw & SIMPL_EQU)
1934	{
1935	idDelEquals(id);
1936	}
1937	res->data = (char * )id;
1938	return FALSE;
1939	}
1940	static BOOLEAN jjSTATUS2(leftv res, leftv u, leftv v)
1941	{
1942	res->data = mstrdup(slStatus((si_link) u->Data(), (char *) v->Data()));
1943	return FALSE;
1944	}
1945	static BOOLEAN jjSIMPL_P(leftv res, leftv u, leftv v)
1946	{
1947	int sw = (int)v->Data();
1948	// CopyD for POLY_CMD and VECTOR_CMD are identical:
1949	poly p = (poly)u->CopyD(POLY_CMD);
1950	if (sw & SIMPL_NORM)
1951	{
1952	pNorm(p);
1953	}
1954	res->data = (char * )p;
1955	return FALSE;
1956	}
1957	static BOOLEAN jjSTD_HILB(leftv res, leftv u, leftv v)
1958	{
1959	ideal result;
1960	intvec w=(intvec )atGet(u,"isHomog");
1961	tHomog hom=testHomog;
1962	if (w!=NULL)
1963	{
1964	w=ivCopy(w);
1965	hom=isHomog;
1966	}
1967	result=kStd((ideal)(u->Data()),currQuotient,hom,&w,(intvec *)v->Data());
1968	idSkipZeroes(result);
1969	res->data = (char *)result;
1970	setFlag(res,FLAG_STD);
1971	if (w!=NULL) atSet(res,mstrdup("isHomog"),w,INTVEC_CMD);
1972	return FALSE;
1973	}
1974	static BOOLEAN jjSTD_1(leftv res, leftv u, leftv v)
1975	{
1976	ideal result;
1977	intvec w=(intvec )atGet(u,"isHomog");
1978	tHomog hom=testHomog;
1979	if (w!=NULL)
1980	{
1981	w=ivCopy(w);
1982	hom=isHomog;
1983	}
1984	ideal i1=(ideal)u->Data();
1985	ideal i0=idInit(1,i1->rank);
1986	i0->m[0]=(poly)v->Data();
1987	i1=idSimpleAdd(i1,i0);
1988	i0->m[0]=NULL;
1989	idDelete(&i0);
1990	BITSET save_test=test;
1991	test\|=Sy_bit(OPT_SB_1);
1992	result=kStd(i1,currQuotient,hom,&w);
1993	test=save_test;
1994	idDelete(&i1);
1995	idSkipZeroes(result);
1996	res->data = (char *)result;
1997	setFlag(res,FLAG_STD);
1998	if (w!=NULL) atSet(res,mstrdup("isHomog"),w,INTVEC_CMD);
1999	return FALSE;
2000	}
2001	static BOOLEAN jjVARSTR2(leftv res, leftv u, leftv v)
2002	{
2003	idhdl h=(idhdl)u->data;
2004	int i=(int)v->Data();
2005	if ((0<i) && (i<=IDRING(h)->N))
2006	res->data=mstrdup(IDRING(h)->names[i-1]);
2007	else
2008	{
2009	Werror("var number %d out of range 1..%d",i,IDRING(h)->N);
2010	return TRUE;
2011	}
2012	return FALSE;
2013	}
2014	static BOOLEAN jjWEDGE(leftv res, leftv u, leftv v)
2015	{
2016	res->data = (char *)mpWedge((matrix)u->Data(),(int)v->Data());
2017	return FALSE;
2018	}
2019	#define jjWRONG2 (proc2)jjWRONG
2020	#define jjWRONG3 (proc3)jjWRONG
2021	static BOOLEAN jjWRONG(leftv res, leftv u)
2022	{
2023	return TRUE;
2024	}
2025
2026	static BOOLEAN jjLOAD_E(leftv res, leftv v, leftv u)
2027	{
2028	char * s=(char *)u->Data();
2029	if(strcmp(s, "with")==0)
2030	return jjLOAD(res, v, TRUE);
2031	WerrorS("invalid second argument");
2032	WerrorS("load(\"libname\" [,\"with\"]);");
2033	return TRUE;
2034	}
2035
2036	/=================== operations with 2 args.: table =================/
2037
2038	struct sValCmd2 dArith2[]=
2039	{
2040	// operations:
2041	// proc cmd res arg1 arg2
2042	{jjCOLCOL, COLONCOLON, ANY_TYPE, DEF_CMD, DEF_CMD PROFILER}
2043	,{jjPLUS_I, '+', INT_CMD, INT_CMD, INT_CMD PROFILER}
2044	,{jjPLUS_N, '+', NUMBER_CMD, NUMBER_CMD, NUMBER_CMD PROFILER}
2045	,{jjPLUS_P, '+', POLY_CMD, POLY_CMD, POLY_CMD PROFILER}
2046	,{jjPLUS_P, '+', VECTOR_CMD, VECTOR_CMD, VECTOR_CMD PROFILER}
2047	,{jjPLUS_ID, '+', IDEAL_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
2048	,{jjPLUS_ID, '+', MODUL_CMD, MODUL_CMD, MODUL_CMD PROFILER}
2049	,{jjPLUS_P_MA, '+', MATRIX_CMD, POLY_CMD, MATRIX_CMD PROFILER}
2050	,{jjPLUS_MA_P, '+', MATRIX_CMD, MATRIX_CMD, POLY_CMD PROFILER}
2051	,{jjPLUS_MA, '+', MATRIX_CMD, MATRIX_CMD, MATRIX_CMD PROFILER}
2052	,{jjPLUS_S, '+', STRING_CMD, STRING_CMD, STRING_CMD PROFILER}
2053	,{jjOP_IV_I, '+', INTVEC_CMD, INTVEC_CMD, INT_CMD PROFILER}
2054	,{jjOP_I_IV, '+', INTVEC_CMD, INT_CMD, INTVEC_CMD PROFILER}
2055	,{jjOP_IM_I, '+', INTMAT_CMD, INTMAT_CMD, INT_CMD PROFILER}
2056	,{jjOP_I_IM, '+', INTMAT_CMD, INT_CMD, INTMAT_CMD PROFILER}
2057	,{jjPLUS_IV, '+', INTVEC_CMD, INTVEC_CMD, INTVEC_CMD PROFILER}
2058	,{jjPLUS_IV, '+', INTMAT_CMD, INTMAT_CMD, INTMAT_CMD PROFILER}
2059	,{lAdd, '+', LIST_CMD, LIST_CMD, LIST_CMD PROFILER}
2060	,{jjRSUM, '+', RING_CMD, RING_CMD, RING_CMD PROFILER}
2061	,{jjMINUS_I, '-', INT_CMD, INT_CMD, INT_CMD PROFILER}
2062	,{jjMINUS_N, '-', NUMBER_CMD, NUMBER_CMD, NUMBER_CMD PROFILER}
2063	,{jjMINUS_P, '-', POLY_CMD, POLY_CMD, POLY_CMD PROFILER}
2064	,{jjMINUS_P, '-', VECTOR_CMD, VECTOR_CMD, VECTOR_CMD PROFILER}
2065	,{jjPLUS_MA_P, '-', MATRIX_CMD, MATRIX_CMD, POLY_CMD PROFILER}
2066	,{jjMINUS_MA, '-', MATRIX_CMD, MATRIX_CMD, MATRIX_CMD PROFILER}
2067	,{jjOP_IV_I, '-', INTVEC_CMD, INTVEC_CMD, INT_CMD PROFILER}
2068	,{jjOP_IM_I, '-', INTMAT_CMD, INTMAT_CMD, INT_CMD PROFILER}
2069	,{jjMINUS_IV, '-', INTVEC_CMD, INTVEC_CMD, INTVEC_CMD PROFILER}
2070	,{jjMINUS_IV, '-', INTMAT_CMD, INTMAT_CMD, INTMAT_CMD PROFILER}
2071	,{jjTIMES_I, '*', INT_CMD, INT_CMD, INT_CMD PROFILER}
2072	,{jjTIMES_N, '*', NUMBER_CMD, NUMBER_CMD, NUMBER_CMD PROFILER}
2073	,{jjTIMES_P, '*', POLY_CMD, POLY_CMD, POLY_CMD PROFILER}
2074	,{jjTIMES_P, '*', VECTOR_CMD, POLY_CMD, VECTOR_CMD PROFILER}
2075	,{jjTIMES_P, '*', VECTOR_CMD, VECTOR_CMD, POLY_CMD PROFILER}
2076	,{jjTIMES_MA_P1,'*', IDEAL_CMD, IDEAL_CMD, POLY_CMD PROFILER}
2077	,{jjTIMES_MA_P2,'*', IDEAL_CMD, POLY_CMD, IDEAL_CMD PROFILER}
2078	,{jjTIMES_ID, '*', IDEAL_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
2079	,{jjTIMES_MA_P1,'*', MODUL_CMD, IDEAL_CMD, VECTOR_CMD PROFILER}
2080	,{jjTIMES_MA_P2,'*', MODUL_CMD, VECTOR_CMD, IDEAL_CMD PROFILER}
2081	,{jjTIMES_ID, '*', MODUL_CMD, IDEAL_CMD, MODUL_CMD PROFILER}
2082	,{jjTIMES_ID, '*', MODUL_CMD, MODUL_CMD, IDEAL_CMD PROFILER}
2083	,{jjTIMES_MA_P1,'*', MATRIX_CMD, MATRIX_CMD, POLY_CMD PROFILER}
2084	,{jjTIMES_MA_P2,'*', MATRIX_CMD, POLY_CMD, MATRIX_CMD PROFILER}
2085	,{jjTIMES_MA_N1,'*', MATRIX_CMD, MATRIX_CMD, NUMBER_CMD PROFILER}
2086	,{jjTIMES_MA_N2,'*', MATRIX_CMD, NUMBER_CMD, MATRIX_CMD PROFILER}
2087	,{jjTIMES_MA_I1,'*', MATRIX_CMD, MATRIX_CMD, INT_CMD PROFILER}
2088	,{jjTIMES_MA_I2,'*', MATRIX_CMD, INT_CMD, MATRIX_CMD PROFILER}
2089	,{jjTIMES_MA, '*', MATRIX_CMD, MATRIX_CMD, MATRIX_CMD PROFILER}
2090	,{jjOP_IV_I, '*', INTVEC_CMD, INTVEC_CMD, INT_CMD PROFILER}
2091	,{jjOP_I_IV, '*', INTVEC_CMD, INT_CMD, INTVEC_CMD PROFILER}
2092	,{jjOP_IV_I, '*', INTMAT_CMD, INTMAT_CMD, INT_CMD PROFILER}
2093	,{jjOP_I_IV, '*', INTMAT_CMD, INT_CMD, INTMAT_CMD PROFILER}
2094	,{jjTIMES_IV, '*', INTVEC_CMD, INTMAT_CMD, INTVEC_CMD PROFILER}
2095	,{jjTIMES_IV, '*', INTMAT_CMD, INTMAT_CMD, INTMAT_CMD PROFILER}
2096	,{jjTIMES_IV, '*', INTMAT_CMD, INTVEC_CMD, INTMAT_CMD PROFILER}
2097	,{jjDIV_N, '/', NUMBER_CMD, NUMBER_CMD, NUMBER_CMD PROFILER}
2098	,{jjDIV_P, '/', POLY_CMD, POLY_CMD, POLY_CMD PROFILER}
2099	,{jjDIV_P, '/', VECTOR_CMD, VECTOR_CMD, POLY_CMD PROFILER}
2100	,{jjDIV_I, '/', INT_CMD, INT_CMD, INT_CMD PROFILER}
2101	,{jjOP_IV_I, '/', INTVEC_CMD, INTVEC_CMD, INT_CMD PROFILER}
2102	,{jjOP_IV_I, '/', INTMAT_CMD, INTMAT_CMD, INT_CMD PROFILER}
2103	,{jjDIV_I, INTDIV, INT_CMD, INT_CMD, INT_CMD PROFILER}
2104	,{jjOP_IV_I, INTDIV, INTVEC_CMD, INTVEC_CMD, INT_CMD PROFILER}
2105	,{jjOP_IV_I, INTDIV, INTMAT_CMD, INTMAT_CMD, INT_CMD PROFILER}
2106	,{jjMOD_I, '%', INT_CMD, INT_CMD, INT_CMD PROFILER}
2107	,{jjOP_IV_I, '%', INTVEC_CMD, INTVEC_CMD, INT_CMD PROFILER}
2108	,{jjOP_IV_I, '%', INTMAT_CMD, INTMAT_CMD, INT_CMD PROFILER}
2109	,{jjPOWER_I, '^', INT_CMD, INT_CMD, INT_CMD PROFILER}
2110	,{jjPOWER_N, '^', NUMBER_CMD, NUMBER_CMD, INT_CMD PROFILER}
2111	,{jjPOWER_P, '^', POLY_CMD, POLY_CMD, INT_CMD PROFILER}
2112	,{jjPOWER_ID, '^', IDEAL_CMD, IDEAL_CMD, INT_CMD PROFILER}
2113	,{jjLE_I, LE, INT_CMD, INT_CMD, INT_CMD PROFILER}
2114	,{jjLE_N, LE, INT_CMD, NUMBER_CMD, NUMBER_CMD PROFILER}
2115	,{jjCOMPARE_S, LE, INT_CMD, STRING_CMD, STRING_CMD PROFILER}
2116	,{jjCOMPARE_IV_I,LE, INT_CMD, INTVEC_CMD, INT_CMD PROFILER}
2117	,{jjCOMPARE_IV,LE, INT_CMD, INTVEC_CMD, INTVEC_CMD PROFILER}
2118	,{jjCOMPARE_P, LE, INT_CMD, POLY_CMD, POLY_CMD PROFILER}
2119	,{jjCOMPARE_P, LE, INT_CMD, VECTOR_CMD, VECTOR_CMD PROFILER}
2120	,{jjLT_I, '<', INT_CMD, INT_CMD, INT_CMD PROFILER}
2121	,{jjLT_N, '<', INT_CMD, NUMBER_CMD, NUMBER_CMD PROFILER}
2122	,{jjCOMPARE_IV_I,'<', INT_CMD, INTVEC_CMD, INT_CMD PROFILER}
2123	,{jjCOMPARE_IV,'<', INT_CMD, INTVEC_CMD, INTVEC_CMD PROFILER}
2124	,{jjCOMPARE_S, '<', INT_CMD, STRING_CMD, STRING_CMD PROFILER}
2125	,{jjCOMPARE_P, '<', INT_CMD, POLY_CMD, POLY_CMD PROFILER}
2126	,{jjCOMPARE_P, '<', INT_CMD, VECTOR_CMD, VECTOR_CMD PROFILER}
2127	,{jjGE_I, GE, INT_CMD, INT_CMD, INT_CMD PROFILER}
2128	,{jjGE_N, GE, INT_CMD, NUMBER_CMD, NUMBER_CMD PROFILER}
2129	,{jjCOMPARE_S, GE, INT_CMD, STRING_CMD, STRING_CMD PROFILER}
2130	,{jjCOMPARE_IV_I,GE, INT_CMD, INTVEC_CMD, INT_CMD PROFILER}
2131	,{jjCOMPARE_IV,GE, INT_CMD, INTVEC_CMD, INTVEC_CMD PROFILER}
2132	,{jjCOMPARE_P, GE, INT_CMD, POLY_CMD, POLY_CMD PROFILER}
2133	,{jjCOMPARE_P, GE, INT_CMD, VECTOR_CMD, VECTOR_CMD PROFILER}
2134	,{jjGT_I, '>', INT_CMD, INT_CMD, INT_CMD PROFILER}
2135	,{jjGT_N, '>', INT_CMD, NUMBER_CMD, NUMBER_CMD PROFILER}
2136	,{jjCOMPARE_S, '>', INT_CMD, STRING_CMD, STRING_CMD PROFILER}
2137	,{jjCOMPARE_IV_I,'>', INT_CMD, INTVEC_CMD, INT_CMD PROFILER}
2138	,{jjCOMPARE_IV,'>', INT_CMD, INTVEC_CMD, INTVEC_CMD PROFILER}
2139	,{jjCOMPARE_P, '>', INT_CMD, POLY_CMD, POLY_CMD PROFILER}
2140	,{jjCOMPARE_P, '>', INT_CMD, VECTOR_CMD, VECTOR_CMD PROFILER}
2141	,{jjAND_I, '&', INT_CMD, INT_CMD, INT_CMD PROFILER}
2142	,{jjOR_I, '\|', INT_CMD, INT_CMD, INT_CMD PROFILER}
2143	,{jjEQUAL_I, EQUAL_EQUAL, INT_CMD, INT_CMD, INT_CMD PROFILER}
2144	,{jjEQUAL_N, EQUAL_EQUAL, INT_CMD, NUMBER_CMD, NUMBER_CMD PROFILER}
2145	,{jjCOMPARE_S, EQUAL_EQUAL, INT_CMD, STRING_CMD, STRING_CMD PROFILER}
2146	,{jjEQUAL_P, EQUAL_EQUAL, INT_CMD, POLY_CMD, POLY_CMD PROFILER}
2147	,{jjEQUAL_P, EQUAL_EQUAL, INT_CMD, VECTOR_CMD, VECTOR_CMD PROFILER}
2148	,{jjCOMPARE_IV_I,EQUAL_EQUAL, INT_CMD, INTVEC_CMD, INT_CMD PROFILER}
2149	,{jjCOMPARE_IV,EQUAL_EQUAL, INT_CMD, INTVEC_CMD, INTVEC_CMD PROFILER}
2150	,{jjCOMPARE_IV,EQUAL_EQUAL, INT_CMD, INTMAT_CMD, INTMAT_CMD PROFILER}
2151	,{jjEQUAL_Ma, EQUAL_EQUAL, INT_CMD, MATRIX_CMD, MATRIX_CMD PROFILER}
2152	,{jjWRONG2, EQUAL_EQUAL, 0, IDEAL_CMD, IDEAL_CMD PROFILER}
2153	,{jjWRONG2, EQUAL_EQUAL, 0, MODUL_CMD, MODUL_CMD PROFILER}
2154	,{jjEQUAL_I, NOTEQUAL, INT_CMD, INT_CMD, INT_CMD PROFILER}
2155	,{jjEQUAL_N, NOTEQUAL, INT_CMD, NUMBER_CMD, NUMBER_CMD PROFILER}
2156	,{jjCOMPARE_S, NOTEQUAL, INT_CMD, STRING_CMD, STRING_CMD PROFILER}
2157	,{jjEQUAL_P, NOTEQUAL, INT_CMD, POLY_CMD, POLY_CMD PROFILER}
2158	,{jjEQUAL_P, NOTEQUAL, INT_CMD, VECTOR_CMD, VECTOR_CMD PROFILER}
2159	,{jjCOMPARE_IV,NOTEQUAL, INT_CMD, INTVEC_CMD, INTVEC_CMD PROFILER}
2160	,{jjCOMPARE_IV,NOTEQUAL, INT_CMD, INTMAT_CMD, INTMAT_CMD PROFILER}
2161	,{jjEQUAL_Ma, NOTEQUAL, INT_CMD, MATRIX_CMD, MATRIX_CMD PROFILER}
2162	,{jjWRONG2, NOTEQUAL, 0, IDEAL_CMD, IDEAL_CMD PROFILER}
2163	,{jjWRONG2, NOTEQUAL, 0, MODUL_CMD, MODUL_CMD PROFILER}
2164	,{jjDOTDOT, DOTDOT, INTVEC_CMD, INT_CMD, INT_CMD PROFILER}
2165	,{jjINDEX_I, '[', INT_CMD, INTVEC_CMD, INT_CMD PROFILER}
2166	,{jjINDEX_IV, '[', INT_CMD, INTVEC_CMD, INTVEC_CMD PROFILER}
2167	,{jjINDEX_I, '[', POLY_CMD, IDEAL_CMD, INT_CMD PROFILER}
2168	,{jjINDEX_I, '[', POLY_CMD, MAP_CMD, INT_CMD PROFILER}
2169	,{jjINDEX_IV, '[', POLY_CMD, IDEAL_CMD, INTVEC_CMD PROFILER}
2170	,{jjINDEX_I, '[', VECTOR_CMD, MODUL_CMD, INT_CMD PROFILER}
2171	,{jjINDEX_IV, '[', VECTOR_CMD, MODUL_CMD, INTVEC_CMD PROFILER}
2172	,{jjINDEX_I, '[', STRING_CMD, STRING_CMD, INT_CMD PROFILER}
2173	,{jjINDEX_IV, '[', STRING_CMD, STRING_CMD, INTVEC_CMD PROFILER}
2174	,{jjINDEX_I, '[', ANY_TYPE/set by p/,LIST_CMD, INT_CMD PROFILER}
2175	,{jjINDEX_IV, '[', ANY_TYPE/set by p/,LIST_CMD, INTVEC_CMD PROFILER}
2176	,{jjINDEX_P, '[', POLY_CMD, POLY_CMD, INT_CMD PROFILER}
2177	,{jjINDEX_P_IV,'[', POLY_CMD, POLY_CMD, INTVEC_CMD PROFILER}
2178	,{jjINDEX_V, '[', POLY_CMD, VECTOR_CMD, INT_CMD PROFILER}
2179	,{jjINDEX_V_IV,'[', VECTOR_CMD, VECTOR_CMD, INTVEC_CMD PROFILER}
2180	,{jjPROC, '(', ANY_TYPE/set by p/,PROC_CMD, DEF_CMD PROFILER}
2181	,{jjMAP, '(', ANY_TYPE/set by p/,MAP_CMD, DEF_CMD PROFILER}
2182	,{jjKLAMMER, '(', ANY_TYPE/set by p/,ANY_TYPE, INT_CMD PROFILER}
2183	,{jjKLAMMER_IV,'(', ANY_TYPE/set by p/,ANY_TYPE, INTVEC_CMD PROFILER}
2184	// and the procedures with 2 arguments:
2185	,{atATTRIB2, ATTRIB_CMD, NONE/set by p/,DEF_CMD, STRING_CMD PROFILER}
2186	,{jjWRONG2, BAREISS_CMD, 0, DEF_CMD, DEF_CMD PROFILER}
2187	,{syBetti2, BETTI_CMD, INTMAT_CMD, RESOLUTION_CMD, INT_CMD PROFILER}
2188	,{jjCOEF, COEF_CMD, MATRIX_CMD, POLY_CMD, POLY_CMD PROFILER}
2189	,{jjCOEFFS_Id, COEFFS_CMD, MATRIX_CMD, IDEAL_CMD, POLY_CMD PROFILER}
2190	,{jjCOEFFS_Id, COEFFS_CMD, MATRIX_CMD, MODUL_CMD, POLY_CMD PROFILER}
2191	,{jjCONTRACT, CONTRACT_CMD, MATRIX_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
2192	,{jjDEG_IV, DEG_CMD, INT_CMD, POLY_CMD, INTVEC_CMD PROFILER}
2193	,{lDelete, DELETE_CMD, LIST_CMD, LIST_CMD, INT_CMD PROFILER}
2194	,{jjDIFF_P, DIFF_CMD, POLY_CMD, POLY_CMD, POLY_CMD PROFILER}
2195	,{jjDIFF_P, DIFF_CMD, VECTOR_CMD, VECTOR_CMD, POLY_CMD PROFILER}
2196	,{jjDIFF_ID, DIFF_CMD, IDEAL_CMD, IDEAL_CMD, POLY_CMD PROFILER}
2197	,{jjDIFF_ID_ID,DIFF_CMD, MATRIX_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
2198	,{jjDIFF_ID, DIFF_CMD, MODUL_CMD, MODUL_CMD, POLY_CMD PROFILER}
2199	,{jjDIFF_ID, DIFF_CMD, MATRIX_CMD, MATRIX_CMD, POLY_CMD PROFILER}
2200	,{jjDIM2, DIM_CMD, INT_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
2201	,{jjDIM2, DIM_CMD, INT_CMD, MODUL_CMD, IDEAL_CMD PROFILER}
2202	,{jjELIMIN, ELIMINATION_CMD,IDEAL_CMD, IDEAL_CMD, POLY_CMD PROFILER}
2203	,{jjELIMIN, ELIMINATION_CMD,MODUL_CMD, MODUL_CMD, POLY_CMD PROFILER}
2204	,{jjEXTGCD_I, EXTGCD_CMD, LIST_CMD, INT_CMD, INT_CMD PROFILER}
2205	#ifdef HAVE_FACTORY
2206	,{jjEXTGCD_P, EXTGCD_CMD, LIST_CMD, POLY_CMD, POLY_CMD PROFILER}
2207	,{jjSQR_FREE_DEC,FAC_CMD, IDEAL_CMD, POLY_CMD, INT_CMD PROFILER}
2208	,{jjFACSTD2, FACSTD_CMD, LIST_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
2209	#else
2210	,{jjWRONG2, EXTGCD_CMD, LIST_CMD, POLY_CMD, POLY_CMD PROFILER}
2211	,{jjWRONG2, FAC_CMD, IDEAL_CMD, POLY_CMD, INT_CMD PROFILER}
2212	,{jjWRONG2, FACSTD_CMD, LIST_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
2213	#endif
2214	,{jjFETCH, FETCH_CMD, ANY_TYPE/set by p/,RING_CMD, ANY_TYPE PROFILER}
2215	,{jjFETCH, FETCH_CMD, ANY_TYPE/set by p/,QRING_CMD, ANY_TYPE PROFILER}
2216	#ifdef HAVE_FGLM
2217	,{fglmProc, FGLM_CMD, IDEAL_CMD, RING_CMD, DEF_CMD PROFILER}
2218	,{fglmProc, FGLM_CMD, IDEAL_CMD, QRING_CMD, DEF_CMD PROFILER}
2219	#else
2220	,{jjWRONG2, FGLM_CMD, IDEAL_CMD, RING_CMD, DEF_CMD PROFILER}
2221	,{jjWRONG2, FGLM_CMD, IDEAL_CMD, QRING_CMD, DEF_CMD PROFILER}
2222	#endif
2223	,{jjFIND2, FIND_CMD, INT_CMD, STRING_CMD, STRING_CMD PROFILER}
2224	,{jjGCD_I, GCD_CMD, INT_CMD, INT_CMD, INT_CMD PROFILER}
2225	#ifdef HAVE_FACTORY
2226	,{jjGCD_P, GCD_CMD, POLY_CMD, POLY_CMD, POLY_CMD PROFILER}
2227	#else
2228	,{jjWRONG2, GCD_CMD, POLY_CMD, POLY_CMD, POLY_CMD PROFILER}
2229	#endif
2230	,{jjHILBERT2, HILBERT_CMD, INTVEC_CMD, IDEAL_CMD, INT_CMD PROFILER}
2231	,{jjHILBERT2, HILBERT_CMD, INTVEC_CMD, MODUL_CMD, INT_CMD PROFILER}
2232	,{jjHOMOG_P, HOMOG_CMD, POLY_CMD, POLY_CMD, POLY_CMD PROFILER}
2233	,{jjHOMOG_P, HOMOG_CMD, VECTOR_CMD, VECTOR_CMD, POLY_CMD PROFILER}
2234	,{jjHOMOG_ID, HOMOG_CMD, IDEAL_CMD, IDEAL_CMD, POLY_CMD PROFILER}
2235	,{jjHOMOG_ID, HOMOG_CMD, MODUL_CMD, MODUL_CMD, POLY_CMD PROFILER}
2236	,{jjRES, HRES_CMD, RESOLUTION_CMD, IDEAL_CMD, INT_CMD PROFILER}
2237	,{jjCALL2MANY, IDEAL_CMD, IDEAL_CMD, DEF_CMD, DEF_CMD PROFILER}
2238	,{jjFETCH, IMAP_CMD, ANY_TYPE/set by p/,RING_CMD, ANY_TYPE PROFILER}
2239	,{jjFETCH, IMAP_CMD, ANY_TYPE/set by p/,QRING_CMD, ANY_TYPE PROFILER}
2240	,{jjINDEPSET2, INDEPSET_CMD, LIST_CMD, IDEAL_CMD, INT_CMD PROFILER}
2241	,{lInsert, INSERT_CMD, LIST_CMD, LIST_CMD, DEF_CMD PROFILER}
2242	,{jjINTERSECT, INTERSECT_CMD, IDEAL_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
2243	,{jjINTERSECT, INTERSECT_CMD, MODUL_CMD, MODUL_CMD, MODUL_CMD PROFILER}
2244	,{jjJET_P, JET_CMD, POLY_CMD, POLY_CMD, INT_CMD PROFILER}
2245	,{jjJET_ID, JET_CMD, IDEAL_CMD, IDEAL_CMD, INT_CMD PROFILER}
2246	,{jjJET_P, JET_CMD, VECTOR_CMD, VECTOR_CMD, INT_CMD PROFILER}
2247	,{jjJET_ID, JET_CMD, MODUL_CMD, MODUL_CMD, INT_CMD PROFILER}
2248	,{jjJET_ID, JET_CMD, MATRIX_CMD, MATRIX_CMD, INT_CMD PROFILER}
2249	,{jjKBASE2, KBASE_CMD, IDEAL_CMD, IDEAL_CMD, INT_CMD PROFILER}
2250	,{jjKBASE2, KBASE_CMD, MODUL_CMD, MODUL_CMD, INT_CMD PROFILER}
2251	,{atKILLATTR2, KILLATTR_CMD, NONE, IDHDL, STRING_CMD PROFILER}
2252	,{jjKoszul, KOSZUL_CMD, MATRIX_CMD, INT_CMD, INT_CMD PROFILER}
2253	,{jjKoszul_Id, KOSZUL_CMD, MATRIX_CMD, INT_CMD, IDEAL_CMD PROFILER}
2254	,{jjLIFT, LIFT_CMD, MATRIX_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
2255	,{jjLIFT, LIFT_CMD, MATRIX_CMD, MODUL_CMD, MODUL_CMD PROFILER}
2256	,{jjLIFTSTD, LIFTSTD_CMD, IDEAL_CMD, IDEAL_CMD, MATRIX_CMD PROFILER}
2257	,{jjLIFTSTD, LIFTSTD_CMD, MODUL_CMD, MODUL_CMD, MATRIX_CMD PROFILER}
2258	,{jjCALL2MANY, LIST_CMD, LIST_CMD, DEF_CMD, DEF_CMD PROFILER}
2259	,{jjRES, LRES_CMD, RESOLUTION_CMD, IDEAL_CMD, INT_CMD PROFILER}
2260	,{jjMINOR, MINOR_CMD, IDEAL_CMD, MATRIX_CMD, INT_CMD PROFILER}
2261	,{jjCALL2MANY, MODUL_CMD, MODUL_CMD, DEF_CMD, DEF_CMD PROFILER}
2262	,{jjMODULO, MODULO_CMD, MODUL_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
2263	,{jjMODULO, MODULO_CMD, MODUL_CMD, MODUL_CMD, MODUL_CMD PROFILER}
2264	,{jjMONITOR2, MONITOR_CMD, NONE, STRING_CMD, STRING_CMD PROFILER}
2265	//,{jjRES, MRES_CMD, LIST_CMD, IDEAL_CMD, INT_CMD PROFILER}
2266	//,{jjRES, MRES_CMD, LIST_CMD, MODUL_CMD, INT_CMD PROFILER}
2267	,{jjRES, MRES_CMD, RESOLUTION_CMD, IDEAL_CMD, INT_CMD PROFILER}
2268	,{jjRES, MRES_CMD, RESOLUTION_CMD, MODUL_CMD, INT_CMD PROFILER}
2269	,{jjPARSTR2, PARSTR_CMD, STRING_CMD, RING_CMD, INT_CMD PROFILER}
2270	,{jjPARSTR2, PARSTR_CMD, STRING_CMD, QRING_CMD, INT_CMD PROFILER}
2271	,{jjPRINT_FORMAT, PRINT_CMD, ANY_TYPE, DEF_CMD, STRING_CMD PROFILER}
2272	,{jjQUOT, QUOTIENT_CMD, IDEAL_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
2273	,{jjQUOT, QUOTIENT_CMD, MODUL_CMD, MODUL_CMD, IDEAL_CMD PROFILER}
2274	,{jjQUOT, QUOTIENT_CMD, IDEAL_CMD, MODUL_CMD, MODUL_CMD PROFILER}
2275	,{jjRANDOM, RANDOM_CMD, INT_CMD, INT_CMD, INT_CMD PROFILER}
2276	,{jjREAD2, READ_CMD, STRING_CMD, LINK_CMD, STRING_CMD PROFILER}
2277	,{jjREDUCE_P, REDUCE_CMD, POLY_CMD, POLY_CMD, IDEAL_CMD PROFILER}
2278	,{jjREDUCE_P, REDUCE_CMD, VECTOR_CMD, VECTOR_CMD, IDEAL_CMD PROFILER}
2279	,{jjREDUCE_P, REDUCE_CMD, VECTOR_CMD, VECTOR_CMD, MODUL_CMD PROFILER}
2280	,{jjREDUCE_ID, REDUCE_CMD, IDEAL_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
2281	,{jjREDUCE_ID, REDUCE_CMD, MODUL_CMD, MODUL_CMD, MODUL_CMD PROFILER}
2282	,{jjREDUCE_ID, REDUCE_CMD, MODUL_CMD, MODUL_CMD, IDEAL_CMD PROFILER}
2283	//,{jjRES, RES_CMD, LIST_CMD, IDEAL_CMD, INT_CMD PROFILER}
2284	//,{jjRES, RES_CMD, LIST_CMD, MODUL_CMD, INT_CMD PROFILER}
2285	,{jjRES, RES_CMD, RESOLUTION_CMD, IDEAL_CMD, INT_CMD PROFILER}
2286	,{jjRES, RES_CMD, RESOLUTION_CMD, MODUL_CMD, INT_CMD PROFILER}
2287	,{jjSTATUS2, STATUS_CMD, STRING_CMD, LINK_CMD, STRING_CMD PROFILER}
2288	,{jjSIMPL_P, SIMPLIFY_CMD, POLY_CMD, POLY_CMD, INT_CMD PROFILER}
2289	,{jjSIMPL_P, SIMPLIFY_CMD, VECTOR_CMD, VECTOR_CMD, INT_CMD PROFILER}
2290	,{jjSIMPL_ID, SIMPLIFY_CMD, IDEAL_CMD, IDEAL_CMD, INT_CMD PROFILER}
2291	,{jjSIMPL_ID, SIMPLIFY_CMD, MODUL_CMD, MODUL_CMD, INT_CMD PROFILER}
2292	#ifdef HAVE_SPECTRUM
2293	,{spectrumProc2,SPECTRUM_CMD, LIST_CMD, POLY_CMD, INT_CMD PROFILER}
2294	,{semicProc, SEMIC_CMD, INT_CMD, LIST_CMD, LIST_CMD PROFILER}
2295	#endif
2296	//,{jjRES, SRES_CMD, LIST_CMD, IDEAL_CMD, INT_CMD PROFILER}
2297	//,{jjRES, SRES_CMD, LIST_CMD, MODUL_CMD, INT_CMD PROFILER}
2298	,{jjRES, SRES_CMD, RESOLUTION_CMD, IDEAL_CMD, INT_CMD PROFILER}
2299	,{jjRES, SRES_CMD, RESOLUTION_CMD, MODUL_CMD, INT_CMD PROFILER}
2300	,{jjCALL2MANY, SYSTEM_CMD, ANY_TYPE/set by p/,STRING_CMD, DEF_CMD PROFILER}
2301	,{jjSTD_1, STD_CMD, IDEAL_CMD, IDEAL_CMD, POLY_CMD PROFILER}
2302	,{jjSTD_1, STD_CMD, MODUL_CMD, MODUL_CMD, VECTOR_CMD PROFILER}
2303	,{jjSTD_HILB, STD_CMD, IDEAL_CMD, IDEAL_CMD, INTVEC_CMD PROFILER}
2304	,{jjSTD_HILB, STD_CMD, MODUL_CMD, MODUL_CMD, INTVEC_CMD PROFILER}
2305	,{jjVARSTR2, VARSTR_CMD, STRING_CMD, RING_CMD, INT_CMD PROFILER}
2306	,{jjVARSTR2, VARSTR_CMD, STRING_CMD, QRING_CMD, INT_CMD PROFILER}
2307	,{jjWEDGE, WEDGE_CMD, MATRIX_CMD, MATRIX_CMD, INT_CMD PROFILER}
2308	,{jjLOAD_E, LOAD_CMD, NONE, STRING_CMD, STRING_CMD PROFILER}
2309	,{nuMPResMat, MPRES_CMD, MODUL_CMD, IDEAL_CMD, INT_CMD PROFILER}
2310	,{NULL, 0, 0, 0, 0 PROFILER}
2311	};
2312	/=================== operations with 1 arg.: static proc =================/
2313	static BOOLEAN jjDUMMY(leftv res, leftv u)
2314	{
2315	res->data = (char *)u->CopyD();
2316	return FALSE;
2317	}
2318	static BOOLEAN jjNULL(leftv res, leftv u)
2319	{
2320	return FALSE;
2321	}
2322	//static BOOLEAN jjPLUSPLUS(leftv res, leftv u)
2323	//{
2324	// res->data = (char *)((int)u->Data()+1);
2325	// return FALSE;
2326	//}
2327	//static BOOLEAN jjMINUSMINUS(leftv res, leftv u)
2328	//{
2329	// res->data = (char *)((int)u->Data()-1);
2330	// return FALSE;
2331	//}
2332	static BOOLEAN jjPLUSPLUS(leftv res, leftv u)
2333	{
2334	if (IDTYP((idhdl)u->data)==INT_CMD)
2335	{
2336	if (iiOp==PLUSPLUS) IDINT((idhdl)u->data)++;
2337	else IDINT((idhdl)u->data)--;
2338	return FALSE;
2339	}
2340	return TRUE;
2341	}
2342	static BOOLEAN jjUMINUS_I(leftv res, leftv u)
2343	{
2344	res->data = (char *)(-(int)u->Data());
2345	return FALSE;
2346	}
2347	static BOOLEAN jjUMINUS_N(leftv res, leftv u)
2348	{
2349	number n=(number)u->CopyD(NUMBER_CMD);
2350	n=nNeg(n);
2351	res->data = (char *)n;
2352	return FALSE;
2353	}
2354	static BOOLEAN jjUMINUS_P(leftv res, leftv u)
2355	{
2356	res->data = (char *)pNeg((poly)u->CopyD(POLY_CMD));
2357	return FALSE;
2358	}
2359	static BOOLEAN jjUMINUS_MA(leftv res, leftv u)
2360	{
2361	poly m1=pISet(-1);
2362	res->data = (char *)mpMultP((matrix)u->CopyD(MATRIX_CMD),m1);
2363	return FALSE;
2364	}
2365	static BOOLEAN jjUMINUS_IV(leftv res, leftv u)
2366	{
2367	intvec iv=(intvec )u->CopyD(INTVEC_CMD);
2368	(iv)=(-1);
2369	res->data = (char *)iv;
2370	return FALSE;
2371	}
2372	static BOOLEAN jjPROC1(leftv res, leftv u)
2373	{
2374	if ((u->rtyp!=IDHDL) \|\| (u->e!=NULL))
2375	return TRUE;
2376	#ifdef HAVE_NAMESPACES
2377	leftv sl = iiMake_proc((idhdl) u->data,u,NULL);
2378	#else /* HAVE_NAMESPACES */
2379	leftv sl = iiMake_proc((idhdl) u->data,NULL);
2380	#endif /* HAVE_NAMESPACES */
2381	if (sl==NULL)
2382	{
2383	return TRUE;
2384	}
2385	else
2386	{
2387	memcpy(res,sl,sizeof(sleftv));
2388	}
2389	return FALSE;
2390	}
2391	static BOOLEAN jjBAREISS(leftv res, leftv v)
2392	{
2393	//matrix m=(matrix)v->Data();
2394	//lists l=mpBareiss(m,FALSE);
2395	lists l=smCallNewBareiss((ideal)v->Data(),0,0);
2396	res->data = (char *)l;
2397	return FALSE;
2398	}
2399	static BOOLEAN jjBAREISS_IM(leftv res, leftv v)
2400	{
2401	intvec m=(intvec )v->CopyD(INTMAT_CMD);
2402	ivTriangMat(m,1,1);
2403	res->data = (char *)m;
2404	return FALSE;
2405	}
2406	static BOOLEAN jjCALL1MANY(leftv res, leftv u)
2407	{
2408	return iiExprArithM(res,u,iiOp);
2409	}
2410	static BOOLEAN jjCHAR(leftv res, leftv v)
2411	{
2412	res->data = (char *)rChar((ring)v->Data());
2413	return FALSE;
2414	}
2415	static BOOLEAN jjCOLS(leftv res, leftv v)
2416	{
2417	res->data = (char *)MATCOLS((matrix)(v->Data()));
2418	return FALSE;
2419	}
2420	static BOOLEAN jjCOLS_IV(leftv res, leftv v)
2421	{
2422	res->data = (char )((intvec)(v->Data()))->cols();
2423	return FALSE;
2424	}
2425	static BOOLEAN jjCONTENT(leftv res, leftv v)
2426	{
2427	// CopyD for POLY_CMD and VECTOR_CMD are identical:
2428	poly p=(poly)v->CopyD(POLY_CMD);
2429	if (p!=NULL) pCleardenom(p);
2430	res->data = (char *)p;
2431	return FALSE;
2432	}
2433	static BOOLEAN jjCOUNT_N(leftv res, leftv v)
2434	{
2435	res->data = (char *)nSize((number)v->Data());
2436	return FALSE;
2437	}
2438	static BOOLEAN jjCOUNT_L(leftv res, leftv v)
2439	{
2440	lists l=(lists)v->Data();
2441	res->data = (char *)(l->nr+1);
2442	return FALSE;
2443	}
2444	static BOOLEAN jjCOUNT_M(leftv res, leftv v)
2445	{
2446	matrix m=(matrix)v->Data();
2447	res->data = (char )(MATROWS(m)MATCOLS(m));
2448	return FALSE;
2449	}
2450	static BOOLEAN jjCOUNT_IV(leftv res, leftv v)
2451	{
2452	res->data = (char )((intvec)(v->Data()))->length();
2453	return FALSE;
2454	}
2455	static BOOLEAN jjDEG(leftv res, leftv v)
2456	{
2457	int dummy;
2458	poly p=(poly)v->Data();
2459	if (p!=NULL) res->data = (char *)pLDeg(p,&dummy);
2460	else res->data=(char *)-1;
2461	return FALSE;
2462	}
2463	static BOOLEAN jjDEGREE(leftv res, leftv v)
2464	{
2465	assumeStdFlag(v);
2466	scDegree((ideal)v->Data(),currQuotient);
2467	return FALSE;
2468	}
2469	static BOOLEAN jjDEFINED(leftv res, leftv v)
2470	{
2471	if ((v->rtyp==IDHDL)
2472	&& ((myynest==IDLEV((idhdl)v->data))\|\|(0==IDLEV((idhdl)v->data))))
2473	{
2474	res->data=(void *)(IDLEV((idhdl)v->data)+1);
2475	}
2476	else if (v->rtyp!=0) res->data=(void *)(-1);
2477	return FALSE;
2478	}
2479	#ifdef HAVE_FACTORY
2480	static BOOLEAN jjDET(leftv res, leftv v)
2481	{
2482	int i,j;
2483	matrix m=(matrix)v->Data();
2484	if (currRing->parameter==NULL)
2485	{
2486	for(i=m->rows();i>0;i--)
2487	{
2488	for(j=m->cols();j>0;j--)
2489	{
2490	if((MATELEM(m,i,j)!=NULL)
2491	&& (!pIsConstant(MATELEM(m,i,j))))
2492	{
2493	goto nonconst;
2494	}
2495	}
2496	}
2497	res->data = (char *)singclap_det(m);
2498	return FALSE;
2499	}
2500	nonconst:
2501	ideal I=idMatrix2Module(mpCopy(m));
2502	// TBC: CHECK THIS (barei.tst)!!
2503	// ideal I=idMatrix2Module(m);
2504	// v->SetData(NULL);
2505	poly p=smCallDet(I);
2506	idDelete(&I);
2507	res ->data = (char *)p;
2508	return FALSE;
2509	}
2510	static BOOLEAN jjDET_I(leftv res, leftv v)
2511	{
2512	intvec * m=(intvec*)v->Data();
2513	int i,j;
2514	i=m->rows();j=m->cols();
2515	if(i==j)
2516	res->data = (char *)singclap_det_i(m);
2517	else
2518	{
2519	Werror("det of %d x %d intmat",i,j);
2520	return TRUE;
2521	}
2522	return FALSE;
2523	}
2524	static BOOLEAN jjDET_S(leftv res, leftv v)
2525	{
2526	ideal I=(ideal)v->Data();
2527	poly p=smCallDet(I);
2528	res->data = (char *)p;
2529	return FALSE;
2530	}
2531	#endif
2532	static BOOLEAN jjDIM(leftv res, leftv v)
2533	{
2534	assumeStdFlag(v);
2535	res->data = (char *)scDimInt((ideal)(v->Data()),currQuotient);
2536	return FALSE;
2537	}
2538	static BOOLEAN jjDUMP(leftv res, leftv v)
2539	{
2540	si_link l = (si_link)v->Data();
2541	if (slDump(l))
2542	{
2543	const char *s;
2544	if ((l!=NULL)&&(l->name!=NULL)) s=l->name;
2545	else s=sNoName;
2546	Werror("cannot dump to `%s`",s);
2547	return TRUE;
2548	}
2549	else
2550	return FALSE;
2551	}
2552	static BOOLEAN jjE(leftv res, leftv v)
2553	{
2554	res->data = (char *)pOne();
2555	pSetComp((poly)res->data,(int)v->Data());
2556	pSetm((poly)res->data);
2557	return FALSE;
2558	}
2559	#ifdef HAVE_FACTORY
2560	static BOOLEAN jjFACSTD(leftv res, leftv v)
2561	{
2562	res->data=(void *)kStdfac((ideal)v->Data(),NULL,testHomog,NULL);
2563	setFlag(res,FLAG_STD);
2564	return FALSE;
2565	}
2566	#endif
2567	static BOOLEAN jjGETDUMP(leftv res, leftv v)
2568	{
2569	si_link l = (si_link)v->Data();
2570	if (slGetDump(l))
2571	{
2572	const char *s;
2573	if ((l!=NULL)&&(l->name!=NULL)) s=l->name;
2574	else s=sNoName;
2575	Werror("cannot get dump from `%s`",s);
2576	return TRUE;
2577	}
2578	else
2579	return FALSE;
2580	}
2581	static BOOLEAN jjHIGHCORNER(leftv res, leftv v)
2582	{
2583	assumeStdFlag(v);
2584	ideal I=(ideal)v->Data();
2585	res->data=(void *)iiHighCorner(I,0);
2586	return FALSE;
2587	}
2588	static BOOLEAN jjHIGHCORNER_M(leftv res, leftv v)
2589	{
2590	assumeStdFlag(v);
2591	intvec w=(intvec)atGet(v,"isHomog");
2592	BOOLEAN delete_w=FALSE;
2593	ideal I=(ideal)v->Data();
2594	int i;
2595	poly p=NULL,po=NULL;
2596	int rk=idRankFreeModule(I);
2597	if (w==NULL)
2598	{
2599	w = new intvec(rk);
2600	delete_w=TRUE;
2601	}
2602	for(i=rk;i>0;i--)
2603	{
2604	p=iiHighCorner(I,i);
2605	if (p==NULL)
2606	{
2607	Werror("module must be zero-dimensional");
2608	if (delete_w) delete w;
2609	return TRUE;
2610	}
2611	if (po==NULL)
2612	{
2613	po=p;
2614	}
2615	else
2616	{
2617	// now po!=NULL, p!=NULL
2618	int d=(pFDeg(po)-(w)[pGetComp(po)-1] - pFDeg(p)+(w)[i-1]);
2619	if (d==0)
2620	d=pComp0(po,p);
2621	if (d > 0)
2622	{
2623	pDelete(&p);
2624	}
2625	else // (d < 0)
2626	{
2627	pDelete(&po); po=p;
2628	}
2629	}
2630	}
2631	if (delete_w) delete w;
2632	res->data=(void *)po;
2633	return FALSE;
2634	}
2635	static BOOLEAN jjHILBERT(leftv res, leftv v)
2636	{
2637	assumeStdFlag(v);
2638	intvec module_w=(intvec)atGet(v,"isHomog");
2639	//scHilbertPoly((ideal)v->Data(),currQuotient);
2640	hLookSeries((ideal)v->Data(),module_w,currQuotient);
2641	return FALSE;
2642	}
2643	static BOOLEAN jjHILBERT_IV(leftv res, leftv v)
2644	{
2645	res->data=(void )hSecondSeries((intvec )v->Data());
2646	return FALSE;
2647	}
2648	static BOOLEAN jjHOMOG1(leftv res, leftv v)
2649	{
2650	intvec *w;
2651	res->data=(void *)idHomModule((ideal)v->Data(),currQuotient,&w);
2652	if ((v->rtyp==IDHDL)&&(w!=NULL))
2653	atSet((idhdl)v->data,mstrdup("isHomog"),w,INTVEC_CMD);
2654	return FALSE;
2655	}
2656	static BOOLEAN jjIDEAL_Ma(leftv res, leftv v)
2657	{
2658	matrix mat=(matrix)v->CopyD(MATRIX_CMD);
2659	IDELEMS((ideal)mat)=MATCOLS(mat)*MATROWS(mat);
2660	MATROWS(mat)=1;
2661	mat->rank=1;
2662	res->data=(char *)mat;
2663	return FALSE;
2664	}
2665	static BOOLEAN jjIDEAL_Map(leftv res, leftv v)
2666	{
2667	map m=(map)v->CopyD(MAP_CMD);
2668	FreeL((ADDRESS)m->preimage);
2669	m->preimage=NULL;
2670	ideal I=(ideal)m;
2671	I->rank=1;
2672	res->data=(char *)I;
2673	return FALSE;
2674	}
2675	static BOOLEAN jjIDEAL_R(leftv res, leftv v)
2676	{
2677	if (currRing!=NULL)
2678	{
2679	ring q=(ring)v->Data();
2680	if (rEqual(currRing, q, 0))
2681	{
2682	if (q->qideal==NULL)
2683	res->data=(char *)idInit(1,1);
2684	else
2685	res->data=(char *)idCopy(q->qideal);
2686	return FALSE;
2687	}
2688	}
2689	WerrorS("can only get ideal from identical qring");
2690	return TRUE;
2691	}
2692	static BOOLEAN jjIm2Iv(leftv res, leftv v)
2693	{
2694	intvec iv = (intvec )v->CopyD(INTMAT_CMD);
2695	iv->makeVector();
2696	res->data = iv;
2697	return FALSE;
2698	}
2699	static BOOLEAN jjINDEPSET(leftv res, leftv v)
2700	{
2701	assumeStdFlag(v);
2702	res->data=(void *)scIndIntvec((ideal)(v->Data()),currQuotient);
2703	return FALSE;
2704	}
2705	static BOOLEAN jjINTERRED(leftv res, leftv v)
2706	{
2707	ideal result=kInterRed((ideal)(v->Data()),currQuotient);
2708	//if (result==NULL) return TRUE;
2709	idSkipZeroes(result);
2710	res->data = result;
2711	return FALSE;
2712	}
2713	static BOOLEAN jjIS_RINGVAR_P(leftv res, leftv v)
2714	{
2715	res->data = (char *)pVar((poly)v->Data());
2716	return FALSE;
2717	}
2718	static BOOLEAN jjIS_RINGVAR_S(leftv res, leftv v)
2719	{
2720	res->data = (char )(rIsRingVar((char )v->Data())+1);
2721	return FALSE;
2722	}
2723	static BOOLEAN jjIS_RINGVAR0(leftv res, leftv v)
2724	{
2725	res->data = (char *)0;
2726	return FALSE;
2727	}
2728	static BOOLEAN jjJACOB_P(leftv res, leftv v)
2729	{
2730	ideal i=idInit(pVariables,1);
2731	int k;
2732	poly p=(poly)(v->Data());
2733	for (k=pVariables;k>0;k--)
2734	{
2735	i->m[k-1]=pDiff(p,k);
2736	}
2737	res->data = (char *)i;
2738	return FALSE;
2739	}
2740	static BOOLEAN jjKBASE(leftv res, leftv v)
2741	{
2742	assumeStdFlag(v);
2743	res->data = (char *)scKBase(-1,(ideal)(v->Data()),currQuotient);
2744	return FALSE;
2745	}
2746	static BOOLEAN jjKLAMMER_LIB(leftv res, leftv u)
2747	{
2748	char * s=(char *)u->Data();
2749	return iiLibCmd(s);
2750	}
2751	#ifdef MDEBUG
2752	static BOOLEAN jjpHead(leftv res, leftv v)
2753	{
2754	res->data=(char *)pHead((poly)v->Data());
2755	return FALSE;
2756	}
2757	#endif
2758	static BOOLEAN jjL2R(leftv res, leftv v)
2759	{
2760	res->data=(char *)syConvList((lists)v->Data());
2761	if (res->data != NULL)
2762	return FALSE;
2763	else
2764	return TRUE;
2765	}
2766	static BOOLEAN jjLEADCOEF(leftv res, leftv v)
2767	{
2768	poly p=(poly)v->Data();
2769	if (p==NULL)
2770	{
2771	res->data=(char *)nInit(0);
2772	}
2773	else
2774	{
2775	res->data=(char *)nCopy(pGetCoeff(p));
2776	}
2777	return FALSE;
2778	}
2779	static BOOLEAN jjLEADEXP(leftv res, leftv v)
2780	{
2781	poly p=(poly)v->Data();
2782	int s=pVariables;
2783	if (v->Typ()==VECTOR_CMD) s++;
2784	intvec *iv=new intvec(s);
2785	if (p!=NULL)
2786	{
2787	for(int i = pVariables;i;i--)
2788	{
2789	(*iv)[i-1]=pGetExp(p,i);
2790	}
2791	if (s!=pVariables)
2792	(*iv)[pVariables]=pGetComp(p);
2793	}
2794	res->data=(char *)iv;
2795	return FALSE;
2796	}
2797	static BOOLEAN jjLEADMONOM(leftv res, leftv v)
2798	{
2799	poly p=(poly)v->Data();
2800	if (p == NULL)
2801	{
2802	res->data = (char*) NULL;
2803	}
2804	else
2805	{
2806	poly lm = pCopy1(p);
2807	pSetCoeff(lm, nInit(1));
2808	res->data = (char*) lm;
2809	}
2810	return FALSE;
2811	}
2812	static BOOLEAN jjLIB(leftv res, leftv v)
2813	{
2814	return iiLibCmd((char *)v->CopyD(STRING_CMD));
2815	}
2816	static BOOLEAN jjMEMORY(leftv res, leftv v)
2817	{
2818	#ifdef MM_COUNT
2819	switch(((int)v->Data()))
2820	{
2821	case 0:
2822	res->data = (char *)mmMemUsed();
2823	break;
2824	case 1:
2825	res->data = (char *)mmMemAlloc();
2826	break;
2827	#ifdef HAVE_SBRK
2828	case 2:
2829	res->data = (char *)mmMemPhysical();
2830	break;
2831	#endif
2832	default:
2833	mmPrintStat();
2834	res->data = (char *)0;
2835	}
2836	return FALSE;
2837	#else
2838	res->data = (char *)0;
2839	return FALSE;
2840	#endif
2841	}
2842	static BOOLEAN jjMONITOR1(leftv res, leftv v)
2843	{
2844	monitor((char *)(v->Data()),PROT_I);
2845	return FALSE;
2846	}
2847	static BOOLEAN jjMSTD(leftv res, leftv v)
2848	{
2849	res->data=(void *)min_std((ideal)v->Data(),currQuotient,testHomog,NULL);
2850	return FALSE;
2851	}
2852	static BOOLEAN jjMULT(leftv res, leftv v)
2853	{
2854	assumeStdFlag(v);
2855	res->data = (char *)scMultInt((ideal)(v->Data()),currQuotient);
2856	return FALSE;
2857	}
2858	static BOOLEAN jjNAMEOF(leftv res, leftv v)
2859	{
2860	res->data = (char *)v->name;
2861	if (res->data==NULL) res->data=mstrdup("");
2862	v->name=NULL;
2863	return FALSE;
2864	}
2865	static BOOLEAN jjNAMES(leftv res, leftv v)
2866	{
2867	res->data=ipNameList(((ring)v->Data())->idroot);
2868	return FALSE;
2869	}
2870	static BOOLEAN jjNVARS(leftv res, leftv v)
2871	{
2872	res->data = (char *)(((ring)(v->Data()))->N);
2873	return FALSE;
2874	}
2875	static BOOLEAN jjOpenClose(leftv res, leftv v)
2876	{
2877	si_link l=(si_link)v->Data();
2878	if (iiOp==OPEN_CMD) return slOpen(l, SI_LINK_OPEN);
2879	else return slClose(l);
2880	}
2881	static BOOLEAN jjORD(leftv res, leftv v)
2882	{
2883	poly p=(poly)v->Data();
2884	res->data=(char *)( p==NULL ? -1 : pFDeg(p) );
2885	return FALSE;
2886	}
2887	static BOOLEAN jjPAR1(leftv res, leftv v)
2888	{
2889	int i=(int)v->Data();
2890	int p=0;
2891	p=rPar(currRing);
2892	if ((0<i) && (i<=p))
2893	{
2894	res->data=(char *)nPar(i);
2895	}
2896	else
2897	{
2898	Werror("par number %d out of range 1..%d",i,p);
2899	return TRUE;
2900	}
2901	return FALSE;
2902	}
2903	static BOOLEAN jjPARDEG(leftv res, leftv v)
2904	{
2905	res->data = (char *)nParDeg((number)v->Data());
2906	return FALSE;
2907	}
2908	static BOOLEAN jjPARSTR1(leftv res, leftv v)
2909	{
2910	if (currRing==NULL)
2911	{
2912	WerrorS("no ring active");
2913	return TRUE;
2914	}
2915	int i=(int)v->Data();
2916	int p=0;
2917	if ((0<i) && (currRing->parameter!=NULL) && (i<=(p=rPar(currRing))))
2918	res->data=mstrdup(currRing->parameter[i-1]);
2919	else
2920	{
2921	Werror("par number %d out of range 1..%d",i,p);
2922	return TRUE;
2923	}
2924	return FALSE;
2925	}
2926	static BOOLEAN jjP2I(leftv res, leftv v)
2927	{
2928	poly p=(poly)v->Data();
2929	if (p==NULL) { /res->data=(char )0;*/ return FALSE; }
2930	if ((pNext(p)!=NULL)\|\| (!pIsConstant(p)))
2931	{
2932	WerrorS("poly must be constant");
2933	return TRUE;
2934	}
2935	res->data = (char *)nInt(pGetCoeff(p));
2936	return FALSE;
2937	}
2938	static BOOLEAN jjPREIMAGE_R(leftv res, leftv v)
2939	{
2940	map mapping=(map)v->Data();
2941	syMake(res,mstrdup(mapping->preimage));
2942	return FALSE;
2943	}
2944	static BOOLEAN jjPRIME(leftv res, leftv v)
2945	{
2946	int i = IsPrime((int)(v->Data()));
2947	res->data = (char *)(i > 1 ? i : 2);
2948	return FALSE;
2949	}
2950	static BOOLEAN jjP2N(leftv res, leftv v)
2951	{
2952	number n;
2953	poly p;
2954	if (((p=(poly)v->Data())!=NULL)
2955	&& (pIsConstant(p)))
2956	{
2957	n=nCopy(pGetCoeff(p));
2958	}
2959	else
2960	{
2961	n=nInit(0);
2962	}
2963	res->data = (char *)n;
2964	return FALSE;
2965	}
2966	static BOOLEAN jjRESERVEDNAME(leftv res, leftv v)
2967	{
2968	char s= (char )v->Data();
2969	int i = 1;
2970	int l = strlen(s);
2971	while (cmds[i].tokval!=0)
2972	{
2973	if (strcmp(s, cmds[i].name) == 0)
2974	{
2975	res->data = (char *)1;
2976	return FALSE;
2977	}
2978	i++;
2979	}
2980	//res->data = (char *)0;
2981	return FALSE;
2982	}
2983	static BOOLEAN jjREAD(leftv res, leftv v)
2984	{
2985	return jjREAD2(res,v,NULL);
2986	}
2987	static BOOLEAN jjREGULARITY(leftv res, leftv v)
2988	{
2989	res->data = (char *)iiRegularity((lists)v->Data());
2990	return FALSE;
2991	}
2992	static BOOLEAN jjROWS(leftv res, leftv v)
2993	{
2994	ideal i = (ideal)v->Data();
2995	res->data = (char *)i->rank;
2996	return FALSE;
2997	}
2998	static BOOLEAN jjROWS_IV(leftv res, leftv v)
2999	{
3000	res->data = (char )((intvec)(v->Data()))->rows();
3001	return FALSE;
3002	}
3003	static BOOLEAN jjRPAR(leftv res, leftv v)
3004	{
3005	res->data = (char *)rPar(((ring)v->Data()));
3006	return FALSE;
3007	}
3008	static BOOLEAN jjSTD(leftv res, leftv v)
3009	{
3010	ideal result;
3011	intvec w=(intvec )atGet(v,"isHomog");
3012	tHomog hom=testHomog;
3013	if (w!=NULL)
3014	{
3015	w=ivCopy(w);
3016	hom=isHomog;
3017	}
3018	//if (hasFlag(v,FLAG_STD))
3019	// result=stdred((ideal)v->Data(),currQuotient,hom,&w);
3020	//else
3021	result=kStd((ideal)(v->Data()),currQuotient,hom,&w);
3022	idSkipZeroes(result);
3023	res->data = (char *)result;
3024	setFlag(res,FLAG_STD);
3025	if (w!=NULL) atSet(res,mstrdup("isHomog"),w,INTVEC_CMD);
3026	return FALSE;
3027	}
3028	static BOOLEAN jjSort_Id(leftv res, leftv v)
3029	{
3030	res->data = (char *)idSort((ideal)v->Data());
3031	return FALSE;
3032	}
3033	static BOOLEAN jjSYZYGY(leftv res, leftv v)
3034	{
3035	intvec *w=NULL;
3036	res->data = (char *)idSyzygies((ideal)v->Data(),currQuotient,testHomog,&w);
3037	if (w!=NULL) delete w;
3038	return FALSE;
3039	}
3040	static BOOLEAN jjTRACE_IV(leftv res, leftv v)
3041	{
3042	res->data = (char )ivTrace((intvec)(v->Data()));
3043	return FALSE;
3044	}
3045	static BOOLEAN jjTRANSP_IV(leftv res, leftv v)
3046	{
3047	res->data = (char )ivTranp((intvec)(v->Data()));
3048	return FALSE;
3049	}
3050	static BOOLEAN jjTYPEOF(leftv res, leftv v)
3051	{
3052	switch ((int)v->data)
3053	{
3054	case INT_CMD: res->data=mstrdup("int"); break;
3055	case POLY_CMD: res->data=mstrdup("poly"); break;
3056	case VECTOR_CMD: res->data=mstrdup("vector"); break;
3057	case STRING_CMD: res->data=mstrdup("string"); break;
3058	case INTVEC_CMD: res->data=mstrdup("intvec"); break;
3059	case IDEAL_CMD: res->data=mstrdup("ideal"); break;
3060	case MATRIX_CMD: res->data=mstrdup("matrix"); break;
3061	case MODUL_CMD: res->data=mstrdup("module"); break;
3062	case MAP_CMD: res->data=mstrdup("map"); break;
3063	case PROC_CMD: res->data=mstrdup("proc"); break;
3064	case RING_CMD: res->data=mstrdup("ring"); break;
3065	case QRING_CMD: res->data=mstrdup("qring"); break;
3066	case INTMAT_CMD: res->data=mstrdup("intmat"); break;
3067	case NUMBER_CMD: res->data=mstrdup("number"); break;
3068	case LIST_CMD: res->data=mstrdup("list"); break;
3069	case PACKAGE_CMD: res->data=mstrdup("package"); break;
3070	case LINK_CMD: res->data=mstrdup("link"); break;
3071	case RESOLUTION_CMD:res->data=mstrdup("resolution");break;
3072	case DEF_CMD:
3073	case NONE: res->data=mstrdup("none"); break;
3074	default: res->data=mstrdup("?unknown type?");
3075	}
3076	return FALSE;
3077	}
3078	static BOOLEAN jjVAR1(leftv res, leftv v)
3079	{
3080	int i=(int)v->Data();
3081	if ((0<i) && (i<=currRing->N))
3082	{
3083	poly p=pOne();
3084	pSetExp(p,i,1);
3085	pSetm(p);
3086	res->data=(char *)p;
3087	}
3088	else
3089	{
3090	Werror("var number %d out of range 1..%d",i,currRing->N);
3091	return TRUE;
3092	}
3093	return FALSE;
3094	}
3095	static BOOLEAN jjVARSTR1(leftv res, leftv v)
3096	{
3097	if (currRing==NULL)
3098	{
3099	WerrorS("no ring active");
3100	return TRUE;
3101	}
3102	int i=(int)v->Data();
3103	if ((0<i) && (i<=currRing->N))
3104	res->data=mstrdup(currRing->names[i-1]);
3105	else
3106	{
3107	Werror("var number %d out of range 1..%d",i,currRing->N);
3108	return TRUE;
3109	}
3110	return FALSE;
3111	}
3112	static BOOLEAN jjVDIM(leftv res, leftv v)
3113	{
3114	assumeStdFlag(v);
3115	res->data = (char *)scMult0Int((ideal)v->Data(),currQuotient);
3116	return FALSE;
3117	}
3118
3119	static BOOLEAN jjLOAD1(leftv res, leftv v)
3120	{
3121	return jjLOAD(res, v);
3122	}
3123
3124	static BOOLEAN jjLOAD(leftv res, leftv v, BOOLEAN autoexport)
3125	{
3126	char * s=mstrdup((char *)v->Data());
3127	char libnamebuf[256];
3128	lib_types LT = type_of_LIB(s, libnamebuf);
3129	BOOLEAN result = TRUE;
3130	#ifdef HAVE_DYNAMIC_LOADING
3131	extern BOOLEAN load_modules(char newlib, char fullpath, BOOLEAN tellerror);
3132	#endif /* HAVE_DYNAMIC_LOADING */
3133
3134	switch(LT)
3135	{
3136	default:
3137	case LT_NONE:
3138	Werror("%s: unknown type", s);
3139	break;
3140
3141	case LT_SINGULAR:
3142	#ifdef HAVE_NAMESPACES
3143	result = iiLibCmd(s, autoexport);
3144	#else
3145	result = iiLibCmd(s);
3146	#endif
3147	break;
3148
3149	case LT_ELF:
3150	#ifdef HAVE_DYNAMIC_LOADING
3151	result = load_modules(s, libnamebuf, autoexport);
3152	#else /* HAVE_DYNAMIC_LOADING */
3153	WerrorS("Dynamic modules are not supported by this version of Singular");
3154	#endif /* HAVE_DYNAMIC_LOADING */
3155	break;
3156
3157	case LT_HPUX:
3158	#ifdef HAVE_DYNAMIC_LOADING
3159	result = load_modules(s, libnamebuf, autoexport);
3160	#else /* HAVE_DYNAMIC_LOADING */
3161	WerrorS("Dynamic modules are not supported by this version of Singular");
3162	#endif /* HAVE_DYNAMIC_LOADING */
3163	break;
3164	}
3165	return result;
3166	}
3167
3168	/=================== operations with 1 arg.: table =================/
3169
3170	#ifdef INIT_BUG
3171	#define XS(A) -((short)A)
3172	#define jjstrlen (proc1)1
3173	#define jjpLength (proc1)2
3174	#define jjidElem (proc1)3
3175	#define jjmpDetBareiss (proc1)4
3176	#define jjidFreeModule (proc1)5
3177	#define jjidVec2Ideal (proc1)6
3178	#define jjrCharStr (proc1)7
3179	#ifndef MDEBUG
3180	#define jjpHead (proc1)8
3181	#endif
3182	#define jjidHead (proc1)9
3183	#define jjidMaxIdeal (proc1)10
3184	#define jjidMinBase (proc1)11
3185	#define jjsyMinBase (proc1)12
3186	#define jjpMaxComp (proc1)13
3187	#define jjmpTrace (proc1)14
3188	#define jjmpTransp (proc1)15
3189	#define jjrOrdStr (proc1)16
3190	#define jjrVarStr (proc1)18
3191	#define jjrParStr (proc1)19
3192	#define jjidMinEmbedding (proc1)20
3193	#define jjCOUNT_R (proc1)22
3194	#define jjDIM_R (proc1)23
3195	#define jjMINRES_R (proc1)24
3196	#define jjidTransp (proc1)25
3197
3198	extern struct sValCmd1 dArith1[];
3199	void jjInitTab1()
3200	{
3201	int i=0;
3202	for (;dArith1[i].cmd!=0;i++)
3203	{
3204	if (dArith1[i].res<0)
3205	{
3206	switch ((int)dArith1[i].p)
3207	{
3208	case (int)jjstrlen: dArith1[i].p=(proc1)strlen; break;
3209	case (int)jjpLength: dArith1[i].p=(proc1)pLength; break;
3210	case (int)jjidElem: dArith1[i].p=(proc1)idElem; break;
3211	case (int)jjidVec2Ideal: dArith1[i].p=(proc1)idVec2Ideal; break;
3212	#ifndef HAVE_FACTORY
3213	case (int)jjmpDetBareiss: dArith1[i].p=(proc1)mpDetBareiss; break;
3214	#endif
3215	case (int)jjidFreeModule: dArith1[i].p=(proc1)idFreeModule; break;
3216	case (int)jjrCharStr: dArith1[i].p=(proc1)rCharStr; break;
3217	#ifndef MDEBUG
3218	case (int)jjpHead: dArith1[i].p=(proc1)pHeadProc; break;
3219	#endif
3220	case (int)jjidHead: dArith1[i].p=(proc1)idHead; break;
3221	case (int)jjidMaxIdeal: dArith1[i].p=(proc1)idMaxIdeal; break;
3222	case (int)jjidMinBase: dArith1[i].p=(proc1)idMinBase; break;
3223	case (int)jjsyMinBase: dArith1[i].p=(proc1)syMinBase; break;
3224	case (int)jjpMaxComp: dArith1[i].p=(proc1)pMaxComp; break;
3225	case (int)jjmpTrace: dArith1[i].p=(proc1)mpTrace; break;
3226	case (int)jjmpTransp: dArith1[i].p=(proc1)mpTransp; break;
3227	case (int)jjrOrdStr: dArith1[i].p=(proc1)rOrdStr; break;
3228	case (int)jjrVarStr: dArith1[i].p=(proc1)rVarStr; break;
3229	case (int)jjrParStr: dArith1[i].p=(proc1)rParStr; break;
3230	case (int)jjidMinEmbedding: dArith1[i].p=(proc1)idMinEmbedding; break;
3231	case (int)jjCOUNT_R: dArith1[i].p=(proc1)syLength; break;
3232	case (int)jjDIM_R: dArith1[i].p=(proc1)syDim; break;
3233	case (int)jjMINRES_R: dArith1[i].p=(proc1)syMinimize; break;
3234	case (int)jjidTransp: dArith1[i].p=(proc1)idTransp; break;
3235	#ifdef GENTABLE
3236	default: Werror("missing proc1-definition for %d",(int)dArith1[i].p);
3237	#endif
3238	}
3239	}
3240	}
3241	}
3242	#else
3243	#if defined(PROC_BUG)
3244	#define XS(A) A
3245	static BOOLEAN jjstrlen(leftv res, leftv v)
3246	{
3247	res->data = (char )strlen((char )v->Data());
3248	return FALSE;
3249	}
3250	static BOOLEAN jjpLength(leftv res, leftv v)
3251	{
3252	res->data = (char *)pLength((poly)v->Data());
3253	return FALSE;
3254	}
3255	static BOOLEAN jjidElem(leftv res, leftv v)
3256	{
3257	res->data = (char *)idElem((ideal)v->Data());
3258	return FALSE;
3259	}
3260	static BOOLEAN jjmpDetBareiss(leftv res, leftv v)
3261	{
3262	res->data = (char *)mpDetBareiss((matrix)v->Data());
3263	return FALSE;
3264	}
3265	static BOOLEAN jjidFreeModule(leftv res, leftv v)
3266	{
3267	res->data = (char *)idFreeModule((int)v->Data());
3268	return FALSE;
3269	}
3270	static BOOLEAN jjidVec2Ideal(leftv res, leftv v)
3271	{
3272	res->data = (char *)idVec2Ideal((poly)v->Data());
3273	return FALSE;
3274	}
3275	static BOOLEAN jjrCharStr(leftv res, leftv v)
3276	{
3277	res->data = rCharStr((ring)v->Data());
3278	return FALSE;
3279	}
3280	#ifndef MDEBUG
3281	static BOOLEAN jjpHead(leftv res, leftv v)
3282	{
3283	res->data = (char *)pHead((poly)v->Data());
3284	return FALSE;
3285	}
3286	#endif
3287	static BOOLEAN jjidHead(leftv res, leftv v)
3288	{
3289	res->data = (char *)idHead((ideal)v->Data());
3290	return FALSE;
3291	}
3292	static BOOLEAN jjidMaxIdeal(leftv res, leftv v)
3293	{
3294	res->data = (char *)idMaxIdeal((int)v->Data());
3295	return FALSE;
3296	}
3297	static BOOLEAN jjidMinBase(leftv res, leftv v)
3298	{
3299	res->data = (char *)idMinBase((ideal)v->Data());
3300	return FALSE;
3301	}
3302	static BOOLEAN jjsyMinBase(leftv res, leftv v)
3303	{
3304	res->data = (char *)syMinBase((ideal)v->Data());
3305	return FALSE;
3306	}
3307	static BOOLEAN jjpMaxComp(leftv res, leftv v)
3308	{
3309	res->data = (char *)pMaxComp((poly)v->Data());
3310	return FALSE;
3311	}
3312	static BOOLEAN jjmpTrace(leftv res, leftv v)
3313	{
3314	res->data = (char *)mpTrace((matrix)v->Data());
3315	return FALSE;
3316	}
3317	static BOOLEAN jjmpTransp(leftv res, leftv v)
3318	{
3319	res->data = (char *)mpTransp((matrix)v->Data());
3320	return FALSE;
3321	}
3322	static BOOLEAN jjrOrdStr(leftv res, leftv v)
3323	{
3324	res->data = rOrdStr((ring)v->Data());
3325	return FALSE;
3326	}
3327	static BOOLEAN jjrVarStr(leftv res, leftv v)
3328	{
3329	res->data = rVarStr((ring)v->Data());
3330	return FALSE;
3331	}
3332	static BOOLEAN jjrParStr(leftv res, leftv v)
3333	{
3334	res->data = rParStr((ring)v->Data());
3335	return FALSE;
3336	}
3337	static BOOLEAN jjidMinEmbedding(leftv res, leftv v)
3338	{
3339	res->data = (char *)idMinEmbedding((ideal)v->Data());
3340	return FALSE;
3341	}
3342	static BOOLEAN jjCOUNT_R(leftv res, leftv v)
3343	{
3344	res->data=(char *)syLength((syStrategy)v->Data());
3345	return FALSE;
3346	}
3347	static BOOLEAN jjDIM_R(leftv res, leftv v)
3348	{
3349	res->data = (char *)syDim((syStrategy)v->Data());
3350	return FALSE;
3351	}
3352	static BOOLEAN jjMINRES_R(leftv res, leftv v)
3353	{
3354	res->data=(char *)syMinimize((syStrategy)v->Data());
3355	return FALSE;
3356	}
3357	static BOOLEAN jjidTransp(leftv res, leftv v)
3358	{
3359	res->data = (char *)idTransp((ideal)v->Data());
3360	return FALSE;
3361	}
3362	#else
3363	#define XS(A) -((short)A)
3364	#define jjstrlen (proc1)strlen
3365	#define jjpLength (proc1)pLength
3366	#define jjidElem (proc1)idElem
3367	#define jjmpDetBareiss (proc1)mpDetBareiss
3368	#define jjidFreeModule (proc1)idFreeModule
3369	#define jjidVec2Ideal (proc1)idVec2Ideal
3370	#define jjrCharStr (proc1)rCharStr
3371	#ifndef MDEBUG
3372	#define jjpHead (proc1)pHead
3373	#endif
3374	#define jjidHead (proc1)idHead
3375	#define jjidMaxIdeal (proc1)idMaxIdeal
3376	#define jjidMinBase (proc1)idMinBase
3377	#define jjsyMinBase (proc1)syMinBase
3378	#define jjpMaxComp (proc1)pMaxComp
3379	#define jjmpTrace (proc1)mpTrace
3380	#define jjmpTransp (proc1)mpTransp
3381	#define jjrOrdStr (proc1)rOrdStr
3382	#define jjrVarStr (proc1)rVarStr
3383	#define jjrParStr (proc1)rParStr
3384	#define jjidMinEmbedding (proc1)idMinEmbedding
3385	#define jjCOUNT_R (proc1)syLength
3386	#define jjDIM_R (proc1)syDim
3387	#define jjMINRES_R (proc1)syMinimize
3388	#define jjidTransp (proc1)idTransp
3389	#endif
3390	#endif
3391	static BOOLEAN jjnInt(leftv res, leftv u)
3392	{
3393	number n=(number)u->CopyD(NUMBER_CMD);
3394	res->data=(char *)nInt(n);
3395	nDelete(&n);
3396	return FALSE;
3397	}
3398	#define s short
3399	struct sValCmd1 dArith1[]=
3400	{
3401	// operations:
3402	// proc cmd res arg
3403	// {jjPLUSPLUS, PLUSPLUS, INT_CMD, INT_CMD }
3404	//,{jjMINUSMINUS, MINUSMINUS, INT_CMD, INT_CMD }
3405	{jjPLUSPLUS, PLUSPLUS, NONE, IDHDL }
3406	,{jjPLUSPLUS, MINUSMINUS, NONE, IDHDL }
3407	,{jjUMINUS_I, '-', INT_CMD, INT_CMD }
3408	,{jjUMINUS_N, '-', NUMBER_CMD, NUMBER_CMD }
3409	,{jjUMINUS_P, '-', POLY_CMD, POLY_CMD }
3410	,{jjUMINUS_P, '-', VECTOR_CMD, VECTOR_CMD }
3411	,{jjUMINUS_MA, '-', MATRIX_CMD, MATRIX_CMD }
3412	,{jjUMINUS_IV, '-', INTVEC_CMD, INTVEC_CMD }
3413	,{jjUMINUS_IV, '-', INTMAT_CMD, INTMAT_CMD }
3414	,{jjPROC1, '(', ANY_TYPE/set by p/,PROC_CMD }
3415	,{jjKLAMMER_LIB,'(', NONE, STRING_CMD }
3416	// and the procedures with 1 argument:
3417	,{atATTRIB1, ATTRIB_CMD, NONE, DEF_CMD }
3418	,{jjBAREISS_IM, BAREISS_CMD, INTMAT_CMD, INTMAT_CMD }
3419	,{jjBAREISS, BAREISS_CMD, LIST_CMD, MODUL_CMD }
3420	,{jjBETTI, BETTI_CMD, INTMAT_CMD, LIST_CMD }
3421	,{syBetti1, BETTI_CMD, INTMAT_CMD, RESOLUTION_CMD }
3422	,{jjCHAR, CHARACTERISTIC_CMD, INT_CMD, RING_CMD }
3423	,{jjCHAR, CHARACTERISTIC_CMD, INT_CMD, QRING_CMD }
3424	#ifdef HAVE_FACTORY
3425	,{jjCHARSERIES, CHAR_SERIES_CMD, MATRIX_CMD, IDEAL_CMD }
3426	#else
3427	,{jjWRONG, CHAR_SERIES_CMD, MATRIX_CMD, IDEAL_CMD }
3428	#endif
3429	,{jjrCharStr, CHARSTR_CMD, XS(STRING_CMD), RING_CMD }
3430	,{jjrCharStr, CHARSTR_CMD, XS(STRING_CMD), QRING_CMD }
3431	,{jjOpenClose, CLOSE_CMD, NONE, LINK_CMD }
3432	,{jjWRONG, COLS_CMD, 0, VECTOR_CMD }
3433	,{jjCOLS, COLS_CMD, INT_CMD, MATRIX_CMD }
3434	,{jjCOLS, COLS_CMD, INT_CMD, IDEAL_CMD }
3435	,{jjCOLS, COLS_CMD, INT_CMD, MODUL_CMD }
3436	,{jjCOLS_IV, COLS_CMD, INT_CMD, INTMAT_CMD }
3437	,{jjWRONG, COLS_CMD, 0, INTVEC_CMD }
3438	,{jjCONTENT, CONTENT_CMD, POLY_CMD, POLY_CMD }
3439	,{jjCONTENT, CONTENT_CMD, VECTOR_CMD, VECTOR_CMD }
3440	,{jjCOUNT_N, COUNT_CMD, INT_CMD, NUMBER_CMD }
3441	,{jjCOUNT_R, COUNT_CMD, XS(INT_CMD), RESOLUTION_CMD }
3442	,{jjstrlen, COUNT_CMD, XS(INT_CMD), STRING_CMD }
3443	,{jjpLength, COUNT_CMD, XS(INT_CMD), POLY_CMD }
3444	,{jjpLength, COUNT_CMD, XS(INT_CMD), VECTOR_CMD }
3445	,{jjidElem, COUNT_CMD, XS(INT_CMD), IDEAL_CMD }
3446	,{jjidElem, COUNT_CMD, XS(INT_CMD), MODUL_CMD }
3447	,{jjCOUNT_M, COUNT_CMD, INT_CMD, MATRIX_CMD }
3448	,{jjCOUNT_IV, COUNT_CMD, INT_CMD, INTVEC_CMD }
3449	,{jjCOUNT_IV, COUNT_CMD, INT_CMD, INTMAT_CMD }
3450	,{jjCOUNT_L, COUNT_CMD, INT_CMD, LIST_CMD }
3451	,{jjNULL, DEF_CMD, DEF_CMD, INT_CMD }
3452	,{jjWRONG, DEF_CMD, 0, ANY_TYPE }
3453	,{jjDEG, DEG_CMD, INT_CMD, POLY_CMD }
3454	,{jjDEG, DEG_CMD, INT_CMD, VECTOR_CMD }
3455	,{jjDEGREE, DEGREE_CMD, NONE, IDEAL_CMD }
3456	,{jjDEGREE, DEGREE_CMD, NONE, MODUL_CMD }
3457	,{jjDEFINED, DEFINED_CMD, INT_CMD, DEF_CMD }
3458	#ifdef HAVE_FACTORY
3459	,{jjDET_I, DET_CMD, INT_CMD, INTMAT_CMD }
3460	,{jjDET, DET_CMD, POLY_CMD, MATRIX_CMD }
3461	,{jjDET_S, DET_CMD, POLY_CMD, MODUL_CMD }
3462	#else
3463	,{jjWRONG, DET_CMD, INT_CMD, INTMAT_CMD }
3464	,{jjmpDetBareiss,DET_CMD, XS(POLY_CMD), MATRIX_CMD }
3465	#endif
3466	,{jjDIM, DIM_CMD, INT_CMD, IDEAL_CMD }
3467	,{jjDIM, DIM_CMD, INT_CMD, MODUL_CMD }
3468	,{jjDIM_R, DIM_CMD, XS(INT_CMD), RESOLUTION_CMD }
3469	,{jjDUMP, DUMP_CMD, NONE, LINK_CMD }
3470	,{jjE, E_CMD, VECTOR_CMD, INT_CMD }
3471	,{jjERROR, ERROR_CMD, NONE, STRING_CMD }
3472	#ifdef HAVE_FACTORY
3473	,{jjFAC_P, FAC_CMD, LIST_CMD, POLY_CMD }
3474	#else
3475	,{jjWRONG, FAC_CMD, LIST_CMD, POLY_CMD }
3476	#endif
3477	#ifdef HAVE_FGLM
3478	,{findUniProc, FINDUNI_CMD, IDEAL_CMD, IDEAL_CMD}
3479	#else
3480	,{jjWRONG, FINDUNI_CMD, IDEAL_CMD, IDEAL_CMD}
3481	#endif
3482	,{jjidFreeModule,FREEMODULE_CMD, XS(MODUL_CMD), INT_CMD }
3483	#ifdef HAVE_FACTORY
3484	,{jjFACSTD, FACSTD_CMD, LIST_CMD, IDEAL_CMD }
3485	#else
3486	,{jjWRONG, FACSTD_CMD, LIST_CMD, IDEAL_CMD }
3487	#endif
3488	,{jjGETDUMP, GETDUMP_CMD, NONE, LINK_CMD }
3489	,{jjHIGHCORNER, HIGHCORNER_CMD, POLY_CMD, IDEAL_CMD }
3490	,{jjHIGHCORNER_M, HIGHCORNER_CMD,VECTOR_CMD, MODUL_CMD }
3491	,{jjHILBERT, HILBERT_CMD, NONE, IDEAL_CMD }
3492	,{jjHILBERT, HILBERT_CMD, NONE, MODUL_CMD }
3493	,{jjHILBERT_IV, HILBERT_CMD, INTVEC_CMD, INTVEC_CMD }
3494	,{jjHOMOG1, HOMOG_CMD, INT_CMD, IDEAL_CMD }
3495	,{jjHOMOG1, HOMOG_CMD, INT_CMD, MODUL_CMD }
3496	,{jjidVec2Ideal,IDEAL_CMD, XS(IDEAL_CMD), VECTOR_CMD }
3497	,{jjIDEAL_Ma, IDEAL_CMD, IDEAL_CMD, MATRIX_CMD }
3498	,{jjIDEAL_R, IDEAL_CMD, IDEAL_CMD, QRING_CMD }
3499	,{jjIDEAL_R, IDEAL_CMD, IDEAL_CMD, RING_CMD }
3500	,{jjIDEAL_Map, IDEAL_CMD, IDEAL_CMD, MAP_CMD }
3501	,{jjDUMMY, IDEAL_CMD, IDEAL_CMD, IDEAL_CMD }
3502	,{jjINDEPSET, INDEPSET_CMD, INTVEC_CMD, IDEAL_CMD }
3503	,{jjDUMMY, INT_CMD, INT_CMD, INT_CMD }
3504	,{jjnInt, INT_CMD, INT_CMD, NUMBER_CMD }
3505	,{jjP2I, INT_CMD, INT_CMD, POLY_CMD }
3506	,{jjINTERRED, INTERRED_CMD, IDEAL_CMD, IDEAL_CMD }
3507	,{jjINTERRED, INTERRED_CMD, MODUL_CMD, MODUL_CMD }
3508	,{jjDUMMY, INTMAT_CMD, INTMAT_CMD, INTMAT_CMD }
3509	,{jjIm2Iv, INTVEC_CMD, INTVEC_CMD, INTMAT_CMD }
3510	,{jjDUMMY, INTVEC_CMD, INTVEC_CMD, INTVEC_CMD }
3511	,{jjIS_RINGVAR_P, IS_RINGVAR, INT_CMD, POLY_CMD }
3512	,{jjIS_RINGVAR_S, IS_RINGVAR, INT_CMD, STRING_CMD }
3513	,{jjIS_RINGVAR0,IS_RINGVAR, INT_CMD, ANY_TYPE }
3514	,{jjJACOB_P, JACOB_CMD, IDEAL_CMD, POLY_CMD }
3515	,{mpJacobi, JACOB_CMD, MATRIX_CMD, IDEAL_CMD }
3516	,{jjKBASE, KBASE_CMD, IDEAL_CMD, IDEAL_CMD }
3517	,{jjKBASE, KBASE_CMD, MODUL_CMD, MODUL_CMD }
3518	,{atKILLATTR1, KILLATTR_CMD, NONE, IDHDL }
3519	#ifdef MDEBUG
3520	,{jjpHead, LEAD_CMD, POLY_CMD, POLY_CMD }
3521	#else
3522	,{jjpHead, LEAD_CMD, XS(POLY_CMD), POLY_CMD }
3523	#endif
3524	,{jjidHead, LEAD_CMD, XS(IDEAL_CMD), IDEAL_CMD }
3525	#ifdef MDEBUG
3526	,{jjpHead, LEAD_CMD, VECTOR_CMD, VECTOR_CMD }
3527	#else
3528	,{jjpHead, LEAD_CMD, XS(VECTOR_CMD), VECTOR_CMD }
3529	#endif
3530	,{jjidHead, LEAD_CMD, XS(MODUL_CMD), MODUL_CMD }
3531	,{jjLEADCOEF, LEADCOEF_CMD, NUMBER_CMD, POLY_CMD }
3532	,{jjLEADCOEF, LEADCOEF_CMD, NUMBER_CMD, VECTOR_CMD }
3533	,{jjLEADEXP, LEADEXP_CMD, INTVEC_CMD, POLY_CMD }
3534	,{jjLEADEXP, LEADEXP_CMD, INTVEC_CMD, VECTOR_CMD }
3535	,{jjLEADMONOM, LEADMONOM_CMD, POLY_CMD, POLY_CMD }
3536	,{jjLEADMONOM, LEADMONOM_CMD, VECTOR_CMD, VECTOR_CMD }
3537	,{jjLIB, LIB_CMD, NONE, STRING_CMD }
3538	,{jjDUMMY, LINK_CMD, LINK_CMD, LINK_CMD}
3539	,{jjCALL1MANY, LIST_CMD, LIST_CMD, DEF_CMD }
3540	,{jjWRONG, MAP_CMD, 0, ANY_TYPE}
3541	,{jjDUMMY, MATRIX_CMD, MATRIX_CMD, MATRIX_CMD }
3542	,{jjidMaxIdeal, MAXID_CMD, XS(IDEAL_CMD), INT_CMD }
3543	,{jjMEMORY, MEMORY_CMD, INT_CMD, INT_CMD }
3544	,{jjidMinBase, MINBASE_CMD, XS(IDEAL_CMD), IDEAL_CMD }
3545	,{jjidMinBase, MINBASE_CMD, XS(MODUL_CMD), MODUL_CMD }
3546	,{jjMINRES, MINRES_CMD, LIST_CMD, LIST_CMD }
3547	,{jjMINRES_R, MINRES_CMD, XS(RESOLUTION_CMD), RESOLUTION_CMD }
3548	,{jjDUMMY, MODUL_CMD, MODUL_CMD, MODUL_CMD }
3549	,{jjMONITOR1, MONITOR_CMD, NONE, STRING_CMD }
3550	,{jjMULT, MULTIPLICITY_CMD, INT_CMD, IDEAL_CMD }
3551	,{jjMULT, MULTIPLICITY_CMD, INT_CMD, MODUL_CMD }
3552	,{jjMSTD, MSTD_CMD, LIST_CMD, IDEAL_CMD }
3553	,{jjMSTD, MSTD_CMD, LIST_CMD, MODUL_CMD }
3554	,{jjNAMEOF, NAMEOF_CMD, STRING_CMD, ANY_TYPE }
3555	,{jjNAMES, NAMES_CMD, LIST_CMD, PACKAGE_CMD }
3556	,{jjNAMES, NAMES_CMD, LIST_CMD, RING_CMD }
3557	,{jjNAMES, NAMES_CMD, LIST_CMD, QRING_CMD }
3558	,{jjDUMMY, NUMBER_CMD, NUMBER_CMD, NUMBER_CMD }
3559	,{jjP2N, NUMBER_CMD, NUMBER_CMD, POLY_CMD }
3560	,{jjRPAR, NPARS_CMD, INT_CMD, RING_CMD }
3561	,{jjRPAR, NPARS_CMD, INT_CMD, QRING_CMD }
3562	,{jjNVARS, NVARS_CMD, INT_CMD, RING_CMD }
3563	,{jjNVARS, NVARS_CMD, INT_CMD, QRING_CMD }
3564	,{jjOpenClose, OPEN_CMD, NONE, LINK_CMD }
3565	,{jjORD, ORD_CMD, INT_CMD, POLY_CMD }
3566	,{jjORD, ORD_CMD, INT_CMD, VECTOR_CMD }
3567	,{jjrOrdStr, ORDSTR_CMD, XS(STRING_CMD), RING_CMD }
3568	,{jjrOrdStr, ORDSTR_CMD, XS(STRING_CMD), QRING_CMD }
3569	,{jjPAR1, PAR_CMD, NUMBER_CMD, INT_CMD }
3570	,{jjPARDEG, PARDEG_CMD, INT_CMD, NUMBER_CMD }
3571	,{jjPARSTR1, PARSTR_CMD, STRING_CMD, INT_CMD }
3572	,{jjrParStr, PARSTR_CMD, XS(STRING_CMD), RING_CMD }
3573	,{jjrParStr, PARSTR_CMD, XS(STRING_CMD), QRING_CMD }
3574	,{jjDUMMY, POLY_CMD, POLY_CMD, POLY_CMD }
3575	,{jjPREIMAGE_R, PREIMAGE_CMD, RING_CMD, MAP_CMD }
3576	,{jjPRIME, PRIME_CMD, INT_CMD, INT_CMD }
3577	,{jjPRINT, PRINT_CMD, NONE, LIST_CMD}
3578	,{jjPRINT, PRINT_CMD, NONE, DEF_CMD}
3579	,{jjidMinEmbedding, PRUNE_CMD, XS(MODUL_CMD), MODUL_CMD }
3580	,{kQHWeight, QHWEIGHT_CMD, INTVEC_CMD, IDEAL_CMD }
3581	,{kQHWeight, QHWEIGHT_CMD, INTVEC_CMD, MODUL_CMD }
3582	,{jjWRONG, QRING_CMD, 0, ANY_TYPE}
3583	,{jjREAD, READ_CMD, STRING_CMD, LINK_CMD }
3584	,{jjREGULARITY, REGULARITY_CMD, INT_CMD, LIST_CMD }
3585	,{jjRESERVEDNAME,RESERVEDNAME_CMD, INT_CMD, STRING_CMD }
3586	,{jjL2R, RESOLUTION_CMD, RESOLUTION_CMD, LIST_CMD }
3587	,{jjDUMMY, RESOLUTION_CMD, RESOLUTION_CMD, RESOLUTION_CMD }
3588	,{jjDUMMY, RING_CMD, RING_CMD, RING_CMD}
3589	,{jjWRONG, ROWS_CMD, 0, POLY_CMD }
3590	,{jjpMaxComp, ROWS_CMD, XS(INT_CMD), VECTOR_CMD }
3591	,{jjROWS, ROWS_CMD, INT_CMD, MODUL_CMD }
3592	,{jjROWS, ROWS_CMD, INT_CMD, MATRIX_CMD }
3593	,{jjROWS_IV, ROWS_CMD, INT_CMD, INTMAT_CMD }
3594	,{jjCOUNT_IV, ROWS_CMD, INT_CMD, INTVEC_CMD }
3595	,{jjSort_Id, SORTVEC_CMD, INTVEC_CMD, IDEAL_CMD }
3596	,{jjSort_Id, SORTVEC_CMD, INTVEC_CMD, MODUL_CMD }
3597	#ifdef HAVE_SPECTRUM
3598	,{spectrumProc, SPECTRUM_CMD, LIST_CMD, POLY_CMD }
3599	#endif
3600	,{jjSTD, STD_CMD, IDEAL_CMD, IDEAL_CMD }
3601	,{jjSTD, STD_CMD, MODUL_CMD, MODUL_CMD }
3602	,{jjDUMMY, STRING_CMD, STRING_CMD, STRING_CMD }
3603	,{jjSYSTEM, SYSTEM_CMD, NONE, STRING_CMD }
3604	,{jjSYZYGY, SYZYGY_CMD, MODUL_CMD, IDEAL_CMD }
3605	,{jjSYZYGY, SYZYGY_CMD, MODUL_CMD, MODUL_CMD }
3606	,{jjWRONG, TRACE_CMD, 0, INTVEC_CMD }
3607	,{jjWRONG, TRACE_CMD, 0, IDEAL_CMD }
3608	,{jjTRACE_IV, TRACE_CMD, INT_CMD, INTMAT_CMD }
3609	,{jjmpTrace, TRACE_CMD, XS(POLY_CMD), MATRIX_CMD }
3610	,{jjTRANSP_IV, TRANSPOSE_CMD, INTMAT_CMD, INTVEC_CMD }
3611	,{jjTRANSP_IV, TRANSPOSE_CMD, INTMAT_CMD, INTMAT_CMD }
3612	,{jjmpTransp, TRANSPOSE_CMD, XS(MATRIX_CMD), MATRIX_CMD }
3613	,{jjidTransp, TRANSPOSE_CMD, XS(MODUL_CMD), MODUL_CMD }
3614	,{jjTYPEOF, TYPEOF_CMD, STRING_CMD, ANY_TYPE }
3615	,{jjDUMMY, VECTOR_CMD, VECTOR_CMD, VECTOR_CMD }
3616	,{jjVDIM, VDIM_CMD, INT_CMD, IDEAL_CMD }
3617	,{jjVDIM, VDIM_CMD, INT_CMD, MODUL_CMD }
3618	,{jjVAR1, VAR_CMD, POLY_CMD, INT_CMD }
3619	,{jjVARSTR1, VARSTR_CMD, STRING_CMD, INT_CMD }
3620	,{jjrVarStr, VARSTR_CMD, XS(STRING_CMD), RING_CMD }
3621	,{jjrVarStr, VARSTR_CMD, XS(STRING_CMD), QRING_CMD }
3622	,{kWeight, WEIGHT_CMD, INTVEC_CMD, IDEAL_CMD }
3623	,{kWeight, WEIGHT_CMD, INTVEC_CMD, MODUL_CMD }
3624	,{jjLOAD1, LOAD_CMD, NONE, STRING_CMD }
3625	,{NULL, 0, 0, 0}
3626	};
3627	#undef s
3628	/=================== operations with 3 args.: static proc =================/
3629	static BOOLEAN jjBRACK_S(leftv res, leftv u, leftv v,leftv w)
3630	{
3631	char s= (char )u->Data();
3632	int r = (int)v->Data();
3633	int c = (int)w->Data();
3634	int l = strlen(s);
3635
3636	if ( (r<1) \|\| (r>l) \|\| (c<0) )
3637	{
3638	Werror("wrong range[%d,%d] in string %s",r,c,u->Fullname());
3639	return TRUE;
3640	}
3641	res->data = (char *)AllocL(c+1);
3642	sprintf((char )res->data,"%-.*s",c,c,s+r-1);
3643	return FALSE;
3644	}
3645	static BOOLEAN jjBRACK_Im(leftv res, leftv u, leftv v,leftv w)
3646	{
3647	intvec iv = (intvec )u->Data();
3648	int r = (int)v->Data();
3649	int c = (int)w->Data();
3650	if ((r<1)\|\|(r>iv->rows())\|\|(c<1)\|\|(c>iv->cols()))
3651	{
3652	Werror("wrong range[%d,%d] in intmat %s(%d x %d)",
3653	r,c,u->Fullname(),iv->rows(),iv->cols());
3654	return TRUE;
3655	}
3656	res->data=u->data;
3657	u->data=NULL;
3658	res->rtyp=u->rtyp;
3659	u->rtyp=0;
3660	res->name=u->name;
3661	u->name=NULL;
3662	Subexpr e=jjMakeSub(v);
3663	e->next=jjMakeSub(w);
3664	if (u->e==NULL) res->e=e;
3665	else
3666	{
3667	Subexpr h=u->e;
3668	while (h->next!=NULL) h=h->next;
3669	h->next=e;
3670	res->e=u->e;
3671	u->e=NULL;
3672	}
3673	return FALSE;
3674	}
3675	static BOOLEAN jjBRACK_Ma(leftv res, leftv u, leftv v,leftv w)
3676	{
3677	matrix m= (matrix)u->Data();
3678	int r = (int)v->Data();
3679	int c = (int)w->Data();
3680	//Print("gen. elem %d, %d\n",r,c);
3681	if ((r<1)\|\|(r>MATROWS(m))\|\|(c<1)\|\|(c>MATCOLS(m)))
3682	{
3683	Werror("wrong range[%d,%d] in matrix %s(%d x %d)",r,c,u->Fullname(),
3684	MATROWS(m),MATCOLS(m));
3685	return TRUE;
3686	}
3687	res->data=u->data;
3688	u->data=NULL;
3689	res->rtyp=u->rtyp;
3690	u->rtyp=0;
3691	res->name=u->name;
3692	u->name=NULL;
3693	Subexpr e=jjMakeSub(v);
3694	e->next=jjMakeSub(w);
3695	if (u->e==NULL)
3696	res->e=e;
3697	else
3698	{
3699	Subexpr h=u->e;
3700	while (h->next!=NULL) h=h->next;
3701	h->next=e;
3702	res->e=u->e;
3703	u->e=NULL;
3704	}
3705	return FALSE;
3706	}
3707	static BOOLEAN jjBRACK_Ma_I_IV(leftv res, leftv u, leftv v,leftv w)
3708	{
3709	sleftv t;
3710	sleftv ut;
3711	leftv p=NULL;
3712	intvec iv=(intvec )w->Data();
3713	int l;
3714	BOOLEAN nok;
3715
3716	if ((u->rtyp!=IDHDL)\|\|(u->e!=NULL))
3717	{
3718	WerrorS("cannot build expression lists from unnamed objects");
3719	return TRUE;
3720	}
3721	memcpy(&ut,u,sizeof(ut));
3722	memset(&t,0,sizeof(t));
3723	t.rtyp=INT_CMD;
3724	for (l=0;l< iv->length(); l++)
3725	{
3726	t.data=(char )(iv)[l];
3727	if (p==NULL)
3728	{
3729	p=res;
3730	}
3731	else
3732	{
3733	p->next=(leftv)Alloc0SizeOf(sleftv);
3734	p=p->next;
3735	}
3736	memcpy(u,&ut,sizeof(ut));
3737	if (u->Typ() == MATRIX_CMD)
3738	nok=jjBRACK_Ma(p,u,v,&t);
3739	else /* INTMAT_CMD */
3740	nok=jjBRACK_Im(p,u,v,&t);
3741	if (nok)
3742	{
3743	while (res->next!=NULL)
3744	{
3745	p=res->next->next;
3746	FreeSizeOf((ADDRESS)res->next,sleftv);
3747	// res->e aufraeumen !!!!
3748	res->next=p;
3749	}
3750	return TRUE;
3751	}
3752	}
3753	return FALSE;
3754	}
3755	static BOOLEAN jjBRACK_Ma_IV_I(leftv res, leftv u, leftv v,leftv w)
3756	{
3757	sleftv t;
3758	sleftv ut;
3759	leftv p=NULL;
3760	intvec iv=(intvec )v->Data();
3761	int l;
3762	BOOLEAN nok;
3763
3764	if ((u->rtyp!=IDHDL)\|\|(u->e!=NULL))
3765	{
3766	WerrorS("cannot build expression lists from unnamed objects");
3767	return TRUE;
3768	}
3769	memcpy(&ut,u,sizeof(ut));
3770	memset(&t,0,sizeof(t));
3771	t.rtyp=INT_CMD;
3772	for (l=0;l< iv->length(); l++)
3773	{
3774	t.data=(char )((iv)[l]);
3775	if (p==NULL)
3776	{
3777	p=res;
3778	}
3779	else
3780	{
3781	p->next=(leftv)Alloc0SizeOf(sleftv);
3782	p=p->next;
3783	}
3784	memcpy(u,&ut,sizeof(ut));
3785	if (u->Typ() == MATRIX_CMD)
3786	nok=jjBRACK_Ma(p,u,&t,w);
3787	else /* INTMAT_CMD */
3788	nok=jjBRACK_Im(p,u,&t,w);
3789	if (nok)
3790	{
3791	while (res->next!=NULL)
3792	{
3793	p=res->next->next;
3794	FreeSizeOf((ADDRESS)res->next,sleftv);
3795	// res->e aufraeumen !!
3796	res->next=p;
3797	}
3798	return TRUE;
3799	}
3800	}
3801	return FALSE;
3802	}
3803	static BOOLEAN jjBRACK_Ma_IV_IV(leftv res, leftv u, leftv v,leftv w)
3804	{
3805	sleftv t1,t2,ut;
3806	leftv p=NULL;
3807	intvec vv=(intvec )v->Data();
3808	intvec wv=(intvec )w->Data();
3809	int vl;
3810	int wl;
3811	BOOLEAN nok;
3812
3813	if ((u->rtyp!=IDHDL)\|\|(u->e!=NULL))
3814	{
3815	WerrorS("cannot build expression lists from unnamed objects");
3816	return TRUE;
3817	}
3818	memcpy(&ut,u,sizeof(ut));
3819	memset(&t1,0,sizeof(sleftv));
3820	memset(&t2,0,sizeof(sleftv));
3821	t1.rtyp=INT_CMD;
3822	t2.rtyp=INT_CMD;
3823	for (vl=0;vl< vv->length(); vl++)
3824	{
3825	t1.data=(char )((vv)[vl]);
3826	for (wl=0;wl< wv->length(); wl++)
3827	{
3828	t2.data=(char )((wv)[wl]);
3829	if (p==NULL)
3830	{
3831	p=res;
3832	}
3833	else
3834	{
3835	p->next=(leftv)Alloc0SizeOf(sleftv);
3836	p=p->next;
3837	}
3838	memcpy(u,&ut,sizeof(ut));
3839	if (u->Typ() == MATRIX_CMD)
3840	nok=jjBRACK_Ma(p,u,&t1,&t2);
3841	else /* INTMAT_CMD */
3842	nok=jjBRACK_Im(p,u,&t1,&t2);
3843	if (nok)
3844	{
3845	res->CleanUp();
3846	return TRUE;
3847	}
3848	}
3849	}
3850	return FALSE;
3851	}
3852	static BOOLEAN jjPROC3(leftv res, leftv u, leftv v, leftv w)
3853	{
3854	v->next=(leftv)AllocSizeOf(sleftv);
3855	memcpy(v->next,w,sizeof(sleftv));
3856	BOOLEAN r=iiExprArith2(res,u,'(',v);
3857	v->rtyp=0; v->data=NULL;
3858	w->rtyp=0; w->data=NULL;
3859	return r;
3860	}
3861	static BOOLEAN jjCALL3MANY(leftv res, leftv u, leftv v, leftv w)
3862	{
3863	u->next=(leftv)AllocSizeOf(sleftv);
3864	memcpy(u->next,v,sizeof(sleftv));
3865	u->next->next=(leftv)AllocSizeOf(sleftv);
3866	memcpy(u->next->next,w,sizeof(sleftv));
3867	BOOLEAN r=iiExprArithM(res,u,iiOp);
3868	v->rtyp=0; v->data=NULL; // iiExprArithM did the CleanUp
3869	w->rtyp=0; w->data=NULL;
3870	return r;
3871	}
3872	static BOOLEAN jjBAREISS3(leftv res, leftv u, leftv v, leftv w)
3873	{
3874	lists l=smCallNewBareiss((ideal)u->Data(),(int)v->Data(),(int)w->Data());
3875	res->data = (char *)l;
3876	return FALSE;
3877	}
3878	static BOOLEAN jjCOEFFS3_Id(leftv res, leftv u, leftv v, leftv w)
3879	{
3880	if ((w->rtyp!=IDHDL)\|\|(w->e!=NULL))
3881	{
3882	WerrorS("3rd argument must be a name of a matrix");
3883	return TRUE;
3884	}
3885	ideal i=(ideal)u->Data();
3886	int rank=(int)i->rank;
3887	BOOLEAN r=jjCOEFFS_Id(res,u,v);
3888	if (r) return TRUE;
3889	mpMonomials((matrix)res->data, rank, pVar((poly)v->Data()),(matrix)w->Data());
3890	return FALSE;
3891	}
3892	static BOOLEAN jjCOEFFS3_KB(leftv res, leftv u, leftv v, leftv w)
3893	{
3894	res->data=(void*)idCoeffOfKBase((ideal)(u->Data()),
3895	(ideal)(v->Data()),(poly)(w->Data()));
3896	return FALSE;
3897	}
3898	static BOOLEAN jjCOEFFS3_P(leftv res, leftv u, leftv v, leftv w)
3899	{
3900	if ((w->rtyp!=IDHDL)\|\|(w->e!=NULL))
3901	{
3902	WerrorS("3rd argument must be a name of a matrix");
3903	return TRUE;
3904	}
3905	// CopyD for POLY_CMD and VECTOR_CMD are identical:
3906	poly p=(poly)u->CopyD(POLY_CMD);
3907	ideal i=idInit(1,1);
3908	i->m[0]=p;
3909	sleftv t;
3910	memset(&t,0,sizeof(t));
3911	t.data=(char *)i;
3912	t.rtyp=IDEAL_CMD;
3913	int rank=1;
3914	if (u->Typ()==VECTOR_CMD)
3915	{
3916	i->rank=rank=pMaxComp(p);
3917	t.rtyp=MODUL_CMD;
3918	}
3919	BOOLEAN r=jjCOEFFS_Id(res,&t,v);
3920	t.CleanUp();
3921	if (r) return TRUE;
3922	mpMonomials((matrix)res->data, rank, pVar((poly)v->Data()),(matrix)w->Data());
3923	return FALSE;
3924	}
3925	static BOOLEAN jjELIMIN_HILB(leftv res, leftv u, leftv v, leftv w)
3926	{
3927	res->data=(char *)idElimination((ideal)u->Data(),(poly)v->Data(),
3928	(intvec *)w->Data());
3929	setFlag(res,FLAG_STD);
3930	return FALSE;
3931	}
3932	static BOOLEAN jjFIND3(leftv res, leftv u, leftv v, leftv w)
3933	{
3934	/*4
3935	* look for the substring what in the string where
3936	* starting at position n
3937	* return the position of the first char of what in where
3938	* or 0
3939	*/
3940	int n=(int)w->Data();
3941	char where=(char )u->Data();
3942	char what=(char )v->Data();
3943	char *found;
3944	if ((1>n)\|\|(n>(int)strlen(where)))
3945	{
3946	Werror("start position %d out of range",n);
3947	return TRUE;
3948	}
3949	found = strchr(where+n-1,*what);
3950	if (*(what+1)!='\0')
3951	{
3952	while((found !=NULL) && (strncmp(found+1,what+1,strlen(what+1))!=0))
3953	{
3954	found=strchr(found+1,*what);
3955	}
3956	}
3957	if (found != NULL)
3958	{
3959	res->data=(char *)((found-where)+1);
3960	}
3961	return FALSE;
3962	}
3963	static BOOLEAN jjINTMAT3(leftv res, leftv u, leftv v,leftv w)
3964	{
3965	intvec* im= new intvec((int)v->Data(),(int)w->Data(), 0);
3966	intvec* arg = (intvec*) u->Data();
3967	int i, n = min(im->cols()im->rows(), arg->cols()arg->rows());
3968
3969	for (i=0; i<n; i++)
3970	{
3971	(im)[i] = (arg)[i];
3972	}
3973
3974	res->data = (char *)im;
3975	return FALSE;
3976	}
3977	static BOOLEAN jjJET_P_IV(leftv res, leftv u, leftv v, leftv w)
3978	{
3979	short iw=iv2array((intvec )w->Data());
3980	res->data = (char *)pJetW((poly)u->Data(),(int)v->Data(),iw);
3981	Free((ADDRESS)iw,(pVariables+1)*sizeof(short));
3982	return FALSE;
3983	}
3984	static BOOLEAN jjJET_ID_IV(leftv res, leftv u, leftv v, leftv w)
3985	{
3986	res->data = (char *)idJetW((ideal)u->Data(),(int)v->Data(),
3987	(intvec *)w->Data());
3988	return FALSE;
3989	}
3990	static BOOLEAN jjPREIMAGE(leftv res, leftv u, leftv v, leftv w)
3991	{
3992	idhdl h;
3993	ring rr;
3994	map mapping;
3995
3996	if ((v->name==NULL) \|\| (w->name==NULL))
3997	{
3998	WerrorS("2nd/3rd arguments must have names");
3999	return TRUE;
4000	}
4001	rr=(ring)u->Data();
4002	const char *ring_name=u->Name();
4003	if ((h=rr->idroot->get(v->name,myynest))!=NULL)
4004	{
4005	if (h->typ==MAP_CMD)
4006	{
4007	mapping=IDMAP(h);
4008	idhdl preim_ring=idroot->get(mapping->preimage,myynest);
4009	if ((preim_ring==NULL)
4010	\|\| (IDRING(preim_ring)!=currRing))
4011	{
4012	Werror("preimage ring `%s` is not the basering",mapping->preimage);
4013	return TRUE;
4014	}
4015	}
4016	else if (h->typ==IDEAL_CMD)
4017	{
4018	mapping=IDMAP(h);
4019	}
4020	else
4021	{
4022	Werror("`%s` is no map nor ideal",IDID(h));
4023	return TRUE;
4024	}
4025	}
4026	else
4027	{
4028	Werror("`%s` is not defined in `%s`",v->name,ring_name);
4029	return TRUE;
4030	}
4031	if ((h=rr->idroot->get(w->name,myynest))!=NULL)
4032	{
4033	if (h->typ==IDEAL_CMD)
4034	{
4035	res->data=(char *)maGetPreimage(rr,mapping,IDIDEAL(h));
4036	}
4037	else
4038	{
4039	Werror("`%s` is no ideal",IDID(h));
4040	return TRUE;
4041	}
4042	}
4043	else
4044	{
4045	Werror("`%s` is not defined in `%s`",w->name,ring_name);
4046	return TRUE;
4047	}
4048	return FALSE;
4049	}
4050	static BOOLEAN jjRANDOM_Im(leftv res, leftv u, leftv v, leftv w)
4051	{
4052	int di, k;
4053	int i=(int)u->Data();
4054	int r=(int)v->Data();
4055	int c=(int)w->Data();
4056	intvec *iv = new intvec(r, c, 0);
4057	if (iv->rows()==0)
4058	{
4059	delete iv;
4060	return TRUE;
4061	}
4062	if (i!=0)
4063	{
4064	if (i<0) i = -i;
4065	di = 2 * i + 1;
4066	for (k=0; k<iv->length(); k++)
4067	{
4068	#ifdef buildin_rand
4069	(*iv)[k] = ((siRand() % di) - i);
4070	#else
4071	(*iv)[k] = ((rand() % di) - i);
4072	#endif
4073	}
4074	}
4075	res->data = (char *)iv;
4076	return FALSE;
4077	}
4078	static BOOLEAN jjSUBST_Test(leftv v,leftv w,
4079	int &ringvar, poly &monomexpr)
4080	{
4081	monomexpr=(poly)w->Data();
4082	if (pLength(monomexpr)>1)
4083	{
4084	Werror("`%s` substitutes a ringvar only by a term",
4085	Tok2Cmdname(SUBST_CMD));
4086	return TRUE;
4087	}
4088	if (!(ringvar=pVar((poly)v->Data())))
4089	{
4090	WerrorS("ringvar expected");
4091	return TRUE;
4092	}
4093	return FALSE;
4094	}
4095	static BOOLEAN jjSUBST_P(leftv res, leftv u, leftv v,leftv w)
4096	{
4097	int ringvar;
4098	poly monomexpr;
4099	BOOLEAN nok=jjSUBST_Test(v,w,ringvar,monomexpr);
4100	if (nok) return TRUE;
4101	res->data = pSubst((poly)u->CopyD(res->rtyp),ringvar,monomexpr);
4102	return FALSE;
4103	}
4104	static BOOLEAN jjSUBST_Id(leftv res, leftv u, leftv v,leftv w)
4105	{
4106	int ringvar;
4107	poly monomexpr;
4108	BOOLEAN nok=jjSUBST_Test(v,w,ringvar,monomexpr);
4109	if (nok) return TRUE;
4110	res->data = idSubst((ideal)u->CopyD(res->rtyp),ringvar,monomexpr);
4111	return FALSE;
4112	}
4113	// we do not want to have jjSUBST_Id_X inlined:
4114	static BOOLEAN jjSUBST_Id_X(leftv res, leftv u, leftv v,leftv w,
4115	int input_type);
4116	static BOOLEAN jjSUBST_Id_I(leftv res, leftv u, leftv v,leftv w)
4117	{
4118	return jjSUBST_Id_X(res,u,v,w,INT_CMD);
4119	}
4120	static BOOLEAN jjSUBST_Id_N(leftv res, leftv u, leftv v,leftv w)
4121	{
4122	return jjSUBST_Id_X(res,u,v,w,NUMBER_CMD);
4123	}
4124	static BOOLEAN jjSUBST_Id_X(leftv res, leftv u, leftv v,leftv w, int input_type)
4125	{
4126	sleftv tmp;
4127	memset(&tmp,0,sizeof(tmp));
4128	// do not check the result, conversion form int/number to poly works always
4129	iiConvert(input_type,POLY_CMD,iiTestConvert(input_type,POLY_CMD),w,&tmp);
4130	BOOLEAN b=jjSUBST_Id(res,u,v,&tmp);
4131	tmp.CleanUp();
4132	return b;
4133	}
4134	static BOOLEAN jjMATRIX_Id(leftv res, leftv u, leftv v,leftv w)
4135	{
4136	matrix m=mpNew((int)v->Data(),(int)w->Data());
4137	ideal I=(ideal)u->CopyD(IDEAL_CMD);
4138	int i=min(IDELEMS(I),(int)v->Data()*(int)w->Data());
4139	//for(i=i-1;i>=0;i--)
4140	//{
4141	// m->m[i]=I->m[i];
4142	// I->m[i]=NULL;
4143	//}
4144	memcpy4(m->m,I->m,i*sizeof(poly));
4145	memset(I->m,0,i*sizeof(poly));
4146	idDelete(&I);
4147	res->data = (char *)m;
4148	return FALSE;
4149	}
4150	static BOOLEAN jjMATRIX_Mo(leftv res, leftv u, leftv v,leftv w)
4151	{
4152	res->data = (char *)idModule2formatedMatrix((ideal)u->CopyD(MODUL_CMD),
4153	(int)v->Data(),(int)w->Data());
4154	return FALSE;
4155	}
4156	static BOOLEAN jjMATRIX_Ma(leftv res, leftv u, leftv v,leftv w)
4157	{
4158	matrix m=mpNew((int)v->Data(),(int)w->Data());
4159	matrix I=(matrix)u->CopyD(MATRIX_CMD);
4160	int r=min(MATROWS(I),(int)v->Data());
4161	int c=min(MATCOLS(I),(int)w->Data());
4162	int i,j;
4163	for(i=r;i>0;i--)
4164	{
4165	for(j=c;j>0;j--)
4166	{
4167	MATELEM(m,i,j)=MATELEM(I,i,j);
4168	MATELEM(I,i,j)=NULL;
4169	}
4170	}
4171	idDelete((ideal *)&I);
4172	res->data = (char *)m;
4173	return FALSE;
4174	}
4175	static BOOLEAN jjLIFT3(leftv res, leftv u, leftv v, leftv w)
4176	{
4177	int sw=(int)w->Data();
4178	if (sw==0)
4179	{
4180	return jjLIFT(res,u,v);
4181	}
4182	else
4183	{
4184	ideal m;
4185	ideal ui=(ideal)u->Data();
4186	ideal vi=(ideal)v->Data();
4187	int ul= IDELEMS(ui);
4188	int vl= IDELEMS(vi);
4189	m = idLiftNonStB(ui,vi, sw);
4190	res->data = (char *)idModule2formatedMatrix(m,ul,vl);
4191	}
4192	return FALSE;
4193	}
4194	static BOOLEAN jjREDUCE3_P(leftv res, leftv u, leftv v, leftv w)
4195	{
4196	assumeStdFlag(v);
4197	res->data = (char *)kNF((ideal)v->Data(),currQuotient,(poly)u->Data(),
4198	0,(int)w->Data());
4199	return FALSE;
4200	}
4201	static BOOLEAN jjREDUCE3_ID(leftv res, leftv u, leftv v, leftv w)
4202	{
4203	assumeStdFlag(v);
4204	res->data = (char *)kNF((ideal)v->Data(),currQuotient,(ideal)u->Data(),
4205	0,(int)w->Data());
4206	return FALSE;
4207	}
4208	#ifdef OLD_RES
4209	static BOOLEAN jjRES3(leftv res, leftv u, leftv v, leftv w)
4210	{
4211	int maxl=(int)v->Data();
4212	int l=0;
4213	resolvente r;
4214	intvec **weights=NULL;
4215	int wmaxl=maxl;
4216	maxl--;
4217	if ((maxl==-1) && (iiOp!=MRES_CMD))
4218	maxl = pVariables-1;
4219	if ((iiOp == RES_CMD) \|\| (iiOp == MRES_CMD))
4220	{
4221	intvec * iv=(intvec*)atGet(u,"isHomog");
4222	if (iv!=NULL)
4223	{
4224	weights = (intvec**)Alloc0SizeOf(void_ptr);
4225	weights[0] = ivCopy(iv);
4226	l=1;
4227	}
4228	r=syResolvente((ideal)u->Data(),maxl,&l, &weights, iiOp==MRES_CMD);
4229	}
4230	else
4231	r=sySchreyerResolvente((ideal)u->Data(),maxl+1,&l);
4232	if (r==NULL) return TRUE;
4233	int t3=u->Typ();
4234	iiMakeResolv(r,l,wmaxl,w->name,t3,weights);
4235	return FALSE;
4236	return TRUE;
4237	}
4238	#endif
4239	static BOOLEAN jjSTATUS3(leftv res, leftv u, leftv v, leftv w)
4240	{
4241	int yes;
4242	jjSTATUS2(res, u, v);
4243	yes = (strcmp((char ) res->data, (char ) w->Data()) == 0);
4244	FreeL((ADDRESS) res->data);
4245	res->data = (void *) yes;
4246	return FALSE;
4247	}
4248	static BOOLEAN jjSTD_HILB_W(leftv res, leftv u, leftv v, leftv w)
4249	{
4250	ideal result;
4251	intvec ww=(intvec )atGet(u,"isHomog");
4252	tHomog hom=testHomog;
4253	if (ww!=NULL)
4254	{
4255	ww=ivCopy(ww);
4256	hom=isHomog;
4257	}
4258	result=kStd((ideal)(u->Data()),
4259	currQuotient,
4260	hom,
4261	&ww, // module weights
4262	(intvec *)v->Data(), // hilbert series
4263	0,0, // syzComp, newIdeal
4264	(intvec *)w->Data()); // weights of vars
4265	idSkipZeroes(result);
4266	res->data = (char *)result;
4267	setFlag(res,FLAG_STD);
4268	if (ww!=NULL) atSet(res,mstrdup("isHomog"),ww,INTVEC_CMD);
4269	return FALSE;
4270	}
4271
4272	/=================== operations with 3 args.: table =================/
4273	struct sValCmd3 dArith3[]=
4274	{
4275	// operations:
4276	// proc cmd res arg1 arg2 arg3
4277	{jjBRACK_S, '[', STRING_CMD, STRING_CMD, INT_CMD, INT_CMD }
4278	,{jjBRACK_Im, '[', INT_CMD, INTMAT_CMD, INT_CMD, INT_CMD }
4279	,{jjBRACK_Ma_I_IV, '[', INT_CMD, INTMAT_CMD, INT_CMD, INTVEC_CMD }
4280	,{jjBRACK_Ma_IV_I, '[', INT_CMD, INTMAT_CMD, INTVEC_CMD, INT_CMD }
4281	,{jjBRACK_Ma_IV_IV, '[', INT_CMD, INTMAT_CMD, INTVEC_CMD, INTVEC_CMD }
4282	,{jjBRACK_Ma, '[', POLY_CMD, MATRIX_CMD, INT_CMD, INT_CMD }
4283	,{jjBRACK_Ma_I_IV, '[', POLY_CMD, MATRIX_CMD, INT_CMD, INTVEC_CMD }
4284	,{jjBRACK_Ma_IV_I, '[', POLY_CMD, MATRIX_CMD, INTVEC_CMD, INT_CMD }
4285	,{jjBRACK_Ma_IV_IV, '[', POLY_CMD, MATRIX_CMD, INTVEC_CMD, INTVEC_CMD }
4286	,{jjPROC3, '(', ANY_TYPE, PROC_CMD, DEF_CMD, DEF_CMD }
4287	,{atATTRIB3, ATTRIB_CMD, NONE, IDHDL, STRING_CMD, DEF_CMD }
4288	,{jjBAREISS3, BAREISS_CMD,LIST_CMD, MODUL_CMD, INT_CMD, INT_CMD }
4289	,{jjCOEFFS3_P, COEFFS_CMD, MATRIX_CMD, POLY_CMD, POLY_CMD, MATRIX_CMD }
4290	,{jjCOEFFS3_P, COEFFS_CMD, MATRIX_CMD, VECTOR_CMD, POLY_CMD, MATRIX_CMD }
4291	,{jjCOEFFS3_Id, COEFFS_CMD, MATRIX_CMD, IDEAL_CMD, POLY_CMD, MATRIX_CMD }
4292	,{jjCOEFFS3_Id, COEFFS_CMD, MATRIX_CMD, MODUL_CMD, POLY_CMD, MATRIX_CMD }
4293	,{jjCOEFFS3_KB, COEFFS_CMD, MATRIX_CMD, IDEAL_CMD, IDEAL_CMD, POLY_CMD }
4294	,{jjCOEFFS3_KB, COEFFS_CMD, MATRIX_CMD, MODUL_CMD, MODUL_CMD, POLY_CMD }
4295	,{jjELIMIN_HILB, ELIMINATION_CMD,IDEAL_CMD, IDEAL_CMD, POLY_CMD, INTVEC_CMD }
4296	,{jjFIND3, FIND_CMD, INT_CMD, STRING_CMD, STRING_CMD, INT_CMD }
4297	,{jjCALL3MANY, IDEAL_CMD, IDEAL_CMD, DEF_CMD, DEF_CMD, DEF_CMD }
4298	//,{jjCALL3MANY, INTERSECT_CMD, NONE, DEF_CMD, DEF_CMD, DEF_CMD }
4299	,{lInsert3, INSERT_CMD, LIST_CMD, LIST_CMD, DEF_CMD, INT_CMD }
4300	,{jjINTMAT3, INTMAT_CMD, INTMAT_CMD, INTMAT_CMD, INT_CMD, INT_CMD }
4301	,{jjCALL3MANY, INTVEC_CMD, INTVEC_CMD, DEF_CMD, DEF_CMD, DEF_CMD }
4302	,{jjJET_P_IV, JET_CMD, POLY_CMD, POLY_CMD, INT_CMD, INTVEC_CMD }
4303	,{jjJET_ID_IV, JET_CMD, IDEAL_CMD, IDEAL_CMD, INT_CMD, INTVEC_CMD }
4304	,{jjJET_P_IV, JET_CMD, VECTOR_CMD, VECTOR_CMD, INT_CMD, INTVEC_CMD }
4305	,{jjJET_ID_IV, JET_CMD, MODUL_CMD, MODUL_CMD, INT_CMD, INTVEC_CMD }
4306	,{mpKoszul, KOSZUL_CMD, MATRIX_CMD, INT_CMD, INT_CMD, IDEAL_CMD }
4307	,{jjCALL3MANY, LIST_CMD, LIST_CMD, DEF_CMD, DEF_CMD, DEF_CMD }
4308	,{jjMATRIX_Id, MATRIX_CMD, MATRIX_CMD, IDEAL_CMD, INT_CMD, INT_CMD }
4309	,{jjMATRIX_Mo, MATRIX_CMD, MATRIX_CMD, MODUL_CMD, INT_CMD, INT_CMD }
4310	,{jjMATRIX_Ma, MATRIX_CMD, MATRIX_CMD, MATRIX_CMD, INT_CMD, INT_CMD }
4311	,{jjCALL3MANY, MODUL_CMD, MODUL_CMD, DEF_CMD, DEF_CMD, DEF_CMD }
4312	#ifdef OLD_RES
4313	,{jjRES3, MRES_CMD, NONE, IDEAL_CMD, INT_CMD, ANY_TYPE }
4314	,{jjRES3, MRES_CMD, NONE, MODUL_CMD, INT_CMD, ANY_TYPE }
4315	#endif
4316	,{jjLIFT3, LIFT_CMD, MATRIX_CMD, IDEAL_CMD, IDEAL_CMD, INT_CMD }
4317	,{jjPREIMAGE, PREIMAGE_CMD, IDEAL_CMD, RING_CMD, ANY_TYPE, ANY_TYPE }
4318	,{jjPREIMAGE, PREIMAGE_CMD, IDEAL_CMD, QRING_CMD, ANY_TYPE, ANY_TYPE }
4319	,{jjRANDOM_Im, RANDOM_CMD, INTMAT_CMD, INT_CMD, INT_CMD, INT_CMD }
4320	,{jjREDUCE3_P, REDUCE_CMD, POLY_CMD, POLY_CMD, IDEAL_CMD, INT_CMD }
4321	,{jjREDUCE3_P, REDUCE_CMD, VECTOR_CMD, VECTOR_CMD, IDEAL_CMD, INT_CMD }
4322	,{jjREDUCE3_P, REDUCE_CMD, VECTOR_CMD, VECTOR_CMD, MODUL_CMD, INT_CMD }
4323	,{jjREDUCE3_ID, REDUCE_CMD, IDEAL_CMD, IDEAL_CMD, IDEAL_CMD, INT_CMD }
4324	,{jjREDUCE3_ID, REDUCE_CMD, MODUL_CMD, MODUL_CMD, MODUL_CMD, INT_CMD }
4325	,{jjREDUCE3_ID, REDUCE_CMD, MODUL_CMD, MODUL_CMD, IDEAL_CMD, INT_CMD }
4326	#ifdef OLD_RES
4327	,{jjRES3, RES_CMD, NONE, IDEAL_CMD, INT_CMD, ANY_TYPE }
4328	,{jjRES3, RES_CMD, NONE, MODUL_CMD, INT_CMD, ANY_TYPE }
4329	#endif
4330	#ifdef HAVE_FACTORY
4331	,{jjRESULTANT, RESULTANT_CMD, POLY_CMD,POLY_CMD, POLY_CMD, POLY_CMD }
4332	#else
4333	,{jjWRONG3, RESULTANT_CMD, POLY_CMD,POLY_CMD, POLY_CMD, POLY_CMD }
4334	#endif
4335	#ifdef HAVE_SPECTRUM
4336	,{semicProc3, SEMIC_CMD, INT_CMD, LIST_CMD, LIST_CMD, INT_CMD }
4337	,{spectrumOp3, SPECTRUM_CMD, LIST_CMD, LIST_CMD, STRING_CMD, INT_CMD }
4338	,{spectrumOp3, SPECTRUM_CMD, LIST_CMD, LIST_CMD, STRING_CMD, LIST_CMD }
4339	#endif
4340	#ifdef OLD_RES
4341	,{jjRES3, SRES_CMD, NONE, IDEAL_CMD, INT_CMD, ANY_TYPE }
4342	,{jjRES3, SRES_CMD, NONE, MODUL_CMD, INT_CMD, ANY_TYPE }
4343	#endif
4344	,{jjSTATUS3, STATUS_CMD, INT_CMD, LINK_CMD, STRING_CMD, STRING_CMD}
4345	,{jjSTD_HILB_W, STD_CMD, IDEAL_CMD, IDEAL_CMD, INTVEC_CMD, INTVEC_CMD}
4346	,{jjSTD_HILB_W, STD_CMD, MODUL_CMD, MODUL_CMD, INTVEC_CMD, INTVEC_CMD}
4347	,{jjSUBST_P, SUBST_CMD, POLY_CMD, POLY_CMD, POLY_CMD, POLY_CMD }
4348	,{jjSUBST_P, SUBST_CMD, POLY_CMD, POLY_CMD, POLY_CMD, POLY_CMD }
4349	,{jjSUBST_P, SUBST_CMD, VECTOR_CMD, VECTOR_CMD, POLY_CMD, POLY_CMD }
4350	,{jjSUBST_Id, SUBST_CMD, IDEAL_CMD, IDEAL_CMD, POLY_CMD, POLY_CMD }
4351	,{jjSUBST_Id, SUBST_CMD, MODUL_CMD, MODUL_CMD, POLY_CMD, POLY_CMD }
4352	,{jjSUBST_Id, SUBST_CMD, MATRIX_CMD, MATRIX_CMD, POLY_CMD, POLY_CMD }
4353	,{jjSUBST_Id_I, SUBST_CMD, MATRIX_CMD, MATRIX_CMD, POLY_CMD, INT_CMD }
4354	,{jjSUBST_Id_N, SUBST_CMD, MATRIX_CMD, MATRIX_CMD, POLY_CMD, NUMBER_CMD }
4355	,{jjCALL3MANY, SYSTEM_CMD, NONE, STRING_CMD, DEF_CMD, DEF_CMD }
4356	,{nuLagSolve, LAGSOLVE_CMD,LIST_CMD, POLY_CMD, INT_CMD, INT_CMD }
4357	,{nuVanderSys, VANDER_CMD, POLY_CMD, IDEAL_CMD, IDEAL_CMD, INT_CMD }
4358	,{NULL, 0, 0, 0, 0, 0 }
4359	};
4360	/=================== operations with many arg.: static proc =================/
4361	static BOOLEAN jjCALL1ARG(leftv res, leftv v)
4362	{
4363	return iiExprArith1(res,v,iiOp);
4364	}
4365	static BOOLEAN jjCALL2ARG(leftv res, leftv u)
4366	{
4367	leftv v=u->next;
4368	u->next=NULL;
4369	BOOLEAN b=iiExprArith2(res,u,iiOp,v, (iiOp > 255));
4370	u->next=v;
4371	return b;
4372	}
4373	static BOOLEAN jjCALL3ARG(leftv res, leftv u)
4374	{
4375	leftv v = u->next;
4376	leftv w = v->next;
4377	u->next = NULL;
4378	v->next = NULL;
4379	BOOLEAN b = iiExprArith3(res, iiOp, u, v, w);
4380	u->next = v;
4381	v->next = w;
4382	return b;
4383	}
4384
4385	static BOOLEAN jjCOEF_M(leftv res, leftv v)
4386	{
4387	if((v->Typ() != VECTOR_CMD)
4388	\|\| (v->next->Typ() != POLY_CMD)
4389	\|\| (v->next->next->Typ() != MATRIX_CMD)
4390	\|\| (v->next->next->next->Typ() != MATRIX_CMD))
4391	return TRUE;
4392	if (v->next->next->rtyp!=IDHDL) return TRUE;
4393	idhdl c=(idhdl)v->next->next->data;
4394	if (v->next->next->next->rtyp!=IDHDL) return TRUE;
4395	idhdl m=(idhdl)v->next->next->next->data;
4396	idDelete((ideal *)&(c->data.uideal));
4397	idDelete((ideal *)&(m->data.uideal));
4398	mpCoef2((poly)v->Data(),(poly)v->next->Data(),
4399	(matrix )&(c->data.umatrix),(matrix )&(m->data.umatrix));
4400	return FALSE;
4401	}
4402	static BOOLEAN jjIDEAL_PL(leftv res, leftv v)
4403	{
4404	int s=1;
4405	leftv h=v;
4406	if (h!=NULL) s=exprlist_length(h);
4407	ideal id=idInit(s,1);
4408	int rank=1;
4409	int i=0;
4410	poly p;
4411	while (h!=NULL)
4412	{
4413	switch(h->Typ())
4414	{
4415	case POLY_CMD:
4416	{
4417	p=(poly)h->CopyD(POLY_CMD);
4418	break;
4419	}
4420	case INT_CMD:
4421	{
4422	number n=nInit((int)h->Data());
4423	if (!nIsZero(n))
4424	{
4425	p=pOne();
4426	pSetCoeff(p,n);
4427	}
4428	else
4429	{
4430	p=NULL;
4431	nDelete(&n);
4432	}
4433	break;
4434	}
4435	case NUMBER_CMD:
4436	{
4437	number n=(number)h->CopyD(NUMBER_CMD);
4438	if (!nIsZero(n))
4439	{
4440	p=pOne();
4441	pSetCoeff(p,n);
4442	}
4443	else
4444	{
4445	p=NULL;
4446	nDelete(&n);
4447	}
4448	break;
4449	}
4450	case VECTOR_CMD:
4451	{
4452	p=(poly)h->CopyD(VECTOR_CMD);
4453	if (iiOp!=MODUL_CMD)
4454	{
4455	idDelete(&id);
4456	pDelete(&p);
4457	return TRUE;
4458	}
4459	rank=max(rank,pMaxComp(p));
4460	break;
4461	}
4462	default:
4463	{
4464	idDelete(&id);
4465	return TRUE;
4466	}
4467	}
4468	if ((iiOp==MODUL_CMD)&&(p!=NULL)&&(pGetComp(p)==0))
4469	{
4470	pSetCompP(p,1);
4471	}
4472	id->m[i]=p;
4473	i++;
4474	h=h->next;
4475	}
4476	id->rank=rank;
4477	res->data=(char *)id;
4478	return FALSE;
4479	}
4480	static BOOLEAN jjINTERSECT_PL(leftv res, leftv v)
4481	{
4482	leftv h=v;
4483	int l=v->listLength();
4484	resolvente r=(resolvente)Alloc0(l*sizeof(ideal));
4485	BOOLEAN copied=(BOOLEAN )Alloc0(l*sizeof(BOOLEAN));
4486	int t=0;
4487	// try to convert to IDEAL_CMD
4488	while (h!=NULL)
4489	{
4490	if (iiTestConvert(h->Typ(),IDEAL_CMD)!=0)
4491	{
4492	t=IDEAL_CMD;
4493	}
4494	else break;
4495	h=h->next;
4496	}
4497	// if failure, try MODUL_CMD
4498	if (t==0)
4499	{
4500	h=v;
4501	while (h!=NULL)
4502	{
4503	if (iiTestConvert(h->Typ(),MODUL_CMD)!=0)
4504	{
4505	t=MODUL_CMD;
4506	}
4507	else break;
4508	h=h->next;
4509	}
4510	}
4511	// check for success in converting
4512	if (t==0)
4513	{
4514	WerrorS("cannot convert to ideal or module");
4515	return TRUE;
4516	}
4517	// call idMultSect
4518	h=v;
4519	int i=0;
4520	sleftv tmp;
4521	while (h!=NULL)
4522	{
4523	if (h->Typ()==t)
4524	{
4525	r[i]=(ideal)h->Data(); /no copy/
4526	h=h->next;
4527	}
4528	else if(iiConvert(h->Typ(),t,iiTestConvert(h->Typ(),t),h,&tmp))
4529	{
4530	Free((ADDRESS)copied,l*sizeof(BOOLEAN));
4531	Free((ADDRESS)r,l*sizeof(ideal));
4532	Werror("cannot convert arg. %d to %s",i+1,Tok2Cmdname(t));
4533	return TRUE;
4534	}
4535	else
4536	{
4537	r[i]=(ideal)tmp.Data(); /now it's a copy/
4538	copied[i]=TRUE;
4539	h=tmp.next;
4540	}
4541	i++;
4542	}
4543	res->rtyp=t;
4544	res->data=(char *)idMultSect(r,i);
4545	while(i>0)
4546	{
4547	i--;
4548	if (copied[i]) idDelete(&(r[i]));
4549	}
4550	Free((ADDRESS)copied,l*sizeof(BOOLEAN));
4551	Free((ADDRESS)r,l*sizeof(ideal));
4552	return FALSE;
4553	}
4554	static BOOLEAN jjINTVEC_PL(leftv res, leftv v)
4555	{
4556	int i=0;
4557	leftv h=v;
4558	if (h!=NULL) i=exprlist_length(h);
4559	intvec *iv=new intvec(i);
4560	i=0;
4561	while (h!=NULL)
4562	{
4563	if(h->Typ()==INT_CMD)
4564	{
4565	(*iv)[i]=(int)h->Data();
4566	}
4567	else
4568	{
4569	delete iv;
4570	return TRUE;
4571	}
4572	i++;
4573	h=h->next;
4574	}
4575	res->data=(char *)iv;
4576	return FALSE;
4577	}
4578	static BOOLEAN jjKLAMMER_PL(leftv res, leftv u)
4579	{
4580	if ((yyInRingConstruction)
4581	&& ((strcmp(u->Name(),"real")==0) \|\| (strcmp(u->Name(),"complex")==0)))
4582	{
4583	memcpy(res,u,sizeof(sleftv));
4584	memset(u,0,sizeof(sleftv));
4585	return FALSE;
4586	}
4587	leftv v=u->next;
4588	BOOLEAN b;
4589	if(v==NULL)
4590	b=iiExprArith1(res,u,iiOp);
4591	else
4592	{
4593	u->next=NULL;
4594	b=iiExprArith2(res,u,iiOp,v);
4595	u->next=v;
4596	}
4597	return b;
4598	}
4599	static BOOLEAN jjLIST_PL(leftv res, leftv v)
4600	{
4601	int sl=0;
4602	if (v!=NULL) sl = v->listLength();
4603	lists L;
4604	if((sl==1)&&(v->Typ()==RESOLUTION_CMD))
4605	{
4606	L=syConvRes((syStrategy)v->Data());
4607	}
4608	else
4609	{
4610	L=(lists)AllocSizeOf(slists);
4611	leftv h=NULL;
4612	int i;
4613	int rt;
4614
4615	L->Init(sl);
4616	for (i=0;i<sl;i++)
4617	{
4618	if (h!=NULL) { /* e.g. not in the first step:
4619	* h is the pointer to the old sleftv,
4620	* v is the pointer to the next sleftv
4621	* (in this moment) */
4622	h->next=v;
4623	}
4624	h=v;
4625	v=v->next;
4626	h->next=NULL;
4627	rt=h->Typ();
4628	if (rt==0)
4629	{
4630	L->Clean();
4631	Werror("`%s` is undefined",h->Fullname());
4632	return TRUE;
4633	}
4634	if ((rt==RING_CMD)\|\|(rt==QRING_CMD))
4635	{
4636	L->m[i].rtyp=rt;
4637	L->m[i].data=h->Data();
4638	((ring)L->m[i].data)->ref++;
4639	}
4640	else
4641	L->m[i].Copy(h);
4642	}
4643	}
4644	res->data=(char *)L;
4645	return FALSE;
4646	}
4647	static BOOLEAN jjNAMES0(leftv res, leftv v)
4648	{
4649	res->data=(void *)ipNameList(IDROOT);
4650	return FALSE;
4651	}
4652	static BOOLEAN jjOPTION_PL(leftv res, leftv v)
4653	{
4654	if(v==NULL)
4655	{
4656	res->data=(char *)showOption();
4657	return FALSE;
4658	}
4659	res->rtyp=NONE;
4660	return setOption(res,v);
4661	}
4662	static BOOLEAN jjRESERVED0(leftv res, leftv v)
4663	{
4664	int i=1;
4665	loop
4666	{
4667	Print("%-20s",cmds[i].name);
4668	i++;
4669	if(cmds[i].name==NULL)
4670	break;
4671	if ((i%3)==1) PrintLn();
4672	}
4673	PrintLn();
4674	return FALSE;
4675	}
4676	static BOOLEAN jjSTRING_PL(leftv res, leftv v)
4677	{
4678	if (v == NULL)
4679	{
4680	res->data = mstrdup("");
4681	return FALSE;
4682	}
4683	int n = v->listLength();
4684	if (n == 1)
4685	{
4686	res->data = v->String();
4687	return FALSE;
4688	}
4689
4690	char slist = (char) Alloc(nsizeof(char));
4691	int i, j;
4692
4693	for (i=0, j=0; i<n; i++, v = v ->next)
4694	{
4695	slist[i] = v->String();
4696	assume(slist[i] != NULL);
4697	j+=strlen(slist[i]);
4698	}
4699	char* s = (char) AllocL((j+1)sizeof(char));
4700	*s='\0';
4701	for (i=0;i<n;i++)
4702	{
4703	strcat(s, slist[i]);
4704	FreeL(slist[i]);
4705	}
4706	Free(slist, nsizeof(char));
4707	res->data = s;
4708	return FALSE;
4709	}
4710	static BOOLEAN jjTEST(leftv res, leftv v)
4711	{
4712	do
4713	{
4714	if (v->Typ()!=INT_CMD)
4715	return TRUE;
4716	test_cmd((int)v->Data());
4717	v=v->next;
4718	}
4719	while (v!=NULL);
4720	return FALSE;
4721	}
4722
4723	#ifndef __MWERKS__
4724	static BOOLEAN jjSTATUS_M(leftv res, leftv v)
4725	{
4726	if ((v->Typ() != LINK_CMD) \|\|
4727	(v->next->Typ() != STRING_CMD) \|\|
4728	(v->next->next->Typ() != STRING_CMD) \|\|
4729	(v->next->next->next->Typ() != INT_CMD))
4730	return TRUE;
4731	jjSTATUS3(res, v, v->next, v->next->next);
4732	#if defined(HAVE_USLEEP)
4733	if (((int) res->data) == 0)
4734	{
4735	int i_s = (int) v->next->next->next->Data();
4736	if (i_s > 0)
4737	{
4738	usleep((int) v->next->next->next->Data());
4739	jjSTATUS3(res, v, v->next, v->next->next);
4740	}
4741	}
4742	#elif defined(HAVE_SLEEP)
4743	if (((int) res->data) == 0)
4744	{
4745	int i_s = (int) v->next->next->next->Data();
4746	if (i_s > 0)
4747	{
4748	sleep((is - 1)/1000000 + 1);
4749	jjSTATUS3(res, v, v->next, v->next->next);
4750	}
4751	}
4752	#endif
4753	return FALSE;
4754	}
4755	#endif
4756	static BOOLEAN jjSUBST_M(leftv res, leftv u)
4757	{
4758	leftv v = u->next;
4759	leftv w = v->next;
4760	leftv rest = w->next;
4761
4762	u->next = NULL;
4763	v->next = NULL;
4764	w->next = NULL;
4765	BOOLEAN b = iiExprArith3(res, iiOp, u, v, w);
4766	if ((rest!=NULL) && (!b))
4767	{
4768	sleftv tmp_res;
4769	leftv tmp_next=res->next;
4770	res->next=rest;
4771	memset(&tmp_res,0,sizeof(tmp_res));
4772	b = iiExprArithM(&tmp_res,res,iiOp);
4773	memcpy(res,&tmp_res,sizeof(tmp_res));
4774	res->next=tmp_next;
4775	}
4776	u->next = v;
4777	v->next = w;
4778	// rest was w->next, but is already cleaned
4779	return b;
4780	}
4781
4782	#ifdef HAVE_NAMESPACES
4783	static BOOLEAN jjIMPORTFROM(leftv res, leftv v);
4784
4785	static BOOLEAN jjEXPORTTO(leftv res, leftv v)
4786	{
4787	BOOLEAN nok=TRUE;
4788	leftv u=v;
4789	if(u->rtyp==NSHDL)
4790	{
4791	namehdl ns = (namehdl)(u->data);
4792	idhdl h = namespaceroot->root->get(ns->name, 0, TRUE);
4793	//Print("Export to '%s', lev %d\n", ns->name, ns->myynest);
4794	while(v->next!=NULL)
4795	{
4796	nok = iiInternalExport(v->next, ns->myynest, h);
4797	if(nok) { return nok; }
4798
4799	v = v->next;
4800	}
4801	return FALSE;
4802	}
4803	if(u->Typ()==PACKAGE_CMD)
4804	{
4805	//PrintS("export to package\n");
4806	while(v->next!=NULL)
4807	{
4808	nok = iiInternalExport(v->next, 0, u->data);
4809	if(nok) return nok;
4810	v = v->next;
4811	}
4812	return FALSE;
4813	}
4814	return TRUE;
4815	}
4816	#endif /* HAVE_NAMESPACES */
4817	#ifdef HAVE_NAMESPACES
4818	static BOOLEAN jjIMPORTFROM(leftv res, leftv v)
4819	{
4820	BOOLEAN nok=FALSE;
4821	PrintS("jjIMPORT_FROM()\n");
4822	if(v->rtyp==NSHDL)
4823	{
4824	PrintS("Import from toplevel\n");
4825	//While-schleife!!!
4826	return FALSE;
4827	}
4828	if(v->Typ()==PACKAGE_CMD)
4829	{
4830	Print("Import from package %s\n", v->name);
4831	while(v->next!=NULL)
4832	{
4833	//nok = iiInternalImport(v->next, 0, v->data);
4834	if(nok) return nok;
4835	v = v->next;
4836	}
4837	return FALSE;
4838	}
4839	return TRUE;
4840	}
4841	#endif
4842	#ifdef HAVE_NAMESPACES
4843	static BOOLEAN jjUNLOAD(leftv res, leftv v)
4844	{
4845	if(v->Typ()==PACKAGE_CMD)
4846	{
4847	char *typ;
4848	idhdl h = (idhdl)v->data;
4849	package d=(package)v->Data();
4850	switch (d->language)
4851	{
4852	case LANG_C:
4853	typ="object";
4854	break;
4855	case LANG_SINGULAR:
4856	case LANG_NONE:
4857	default:
4858	killhdl(h);
4859	}
4860	return FALSE;
4861	}
4862	return TRUE;
4863	}
4864	#endif
4865	/=================== operations with many arg.: table =================/
4866	/* number_of_args: -1: any, -2: any >0, .. */
4867	struct sValCmdM dArithM[]=
4868	{
4869	// operations:
4870	// proc cmd res number_of_args
4871	{jjKLAMMER_PL, '(', ANY_TYPE, -2 }
4872	,{jjCALL2ARG, COEF_CMD, MATRIX_CMD, 2 }
4873	,{jjCOEF_M, COEF_CMD, NONE, 4 }
4874	,{jjDBPRINT, DBPRINT_CMD, NONE, -2 }
4875	,{jjCALL1ARG, IDEAL_CMD, IDEAL_CMD, 1 }
4876	,{jjIDEAL_PL, IDEAL_CMD, IDEAL_CMD, -1 }
4877	,{jjCALL2ARG, INTERSECT_CMD, IDEAL_CMD, 2 }
4878	,{jjINTERSECT_PL,INTERSECT_CMD, IDEAL_CMD, -2 }
4879	,{jjCALL1ARG, INTVEC_CMD, INTVEC_CMD, 1 }
4880	,{jjINTVEC_PL, INTVEC_CMD, INTVEC_CMD, -1 }
4881	,{jjLIST_PL, LIST_CMD, LIST_CMD, -1 }
4882	,{jjCALL1ARG, MODUL_CMD, MODUL_CMD, 1 }
4883	,{jjIDEAL_PL, MODUL_CMD, MODUL_CMD, -1 }
4884	,{jjCALL1ARG, NAMES_CMD, LIST_CMD, 1 }
4885	,{jjNAMES0, NAMES_CMD, LIST_CMD, 0 }
4886	,{jjOPTION_PL, OPTION_CMD, STRING_CMD/or set by p/,-1 }
4887	,{jjCALL1ARG, RESERVEDNAME_CMD, INT_CMD, 1 }
4888	,{jjRESERVED0, RESERVEDNAME_CMD, NONE, 0 }
4889	,{jjSTRING_PL, STRING_CMD, STRING_CMD, -1 }
4890	,{jjCALL3ARG, SUBST_CMD, NONE/set by p/, 3 }
4891	,{jjSUBST_M, SUBST_CMD, NONE/set by p/, -2 }
4892	,{jjSYSTEM, SYSTEM_CMD, NONE/or set by p/,-2 }
4893	,{jjTEST, TEST_CMD, NONE, -2 }
4894	,{iiWRITE, WRITE_CMD, NONE, -2 }
4895	,{jjCALL2ARG, STATUS_CMD, STRING_CMD, 2 }
4896	,{jjCALL3ARG, STATUS_CMD, INT_CMD, 3 }
4897	#ifndef __MWERKS__
4898	,{jjSTATUS_M, STATUS_CMD, INT_CMD, 4 }
4899	#endif
4900	#ifdef HAVE_NAMESPACES
4901	,{jjIMPORTFROM,IMPORTFROM_CMD, ANY_TYPE, -2 }
4902	,{jjEXPORTTO, EXPORTTO_CMD, NONE, -2 }
4903	,{jjUNLOAD, UNLOAD_CMD, NONE, -2 }
4904	#endif /* HAVE_NAMESPACES */
4905	,{nuUResSolve, URSOLVE_CMD, LIST_CMD, 4 }
4906	,{NULL, 0, 0, 0 }
4907	};
4908	#ifdef MDEBUG
4909	static Subexpr jjDBMakeSub(leftv e,char *f, int l)
4910	#else
4911	static Subexpr jjMakeSub(leftv e)
4912	#endif
4913	{
4914	// assume: e->Typ()==INT_CMD
4915	#ifdef MDEBUG
4916	Subexpr r=(Subexpr)mmDBAllocBlock0(sizeof(*r),f,l);
4917	#else
4918	Subexpr r=(Subexpr)Alloc0SizeOf(sSubexpr);
4919	#endif
4920	r->start =(int)e->Data();
4921	return r;
4922	}
4923
4924	/================ generating tables ============================/
4925	#ifdef GENTABLE
4926	extern struct sValAssign dAssign[];
4927	struct sValCmdTab dArithTab1[]={ {0,0}};
4928	#define JJTAB1LEN 0
4929	struct sValCmdTab dArithTab2[]={ {0,0}};
4930	#define JJTAB2LEN 0
4931	void ttGen1()
4932	{
4933	FILE *outfile = myfopen("iparith.inc","w");
4934	int i,j,l1=0,l2=0;
4935	currRing=(ring)AllocSizeOf(sip_sring);
4936	fprintf(outfile,
4937	"/****************************************\n"
4938	"* Computer Algebra System SINGULAR *\n"
4939	"****************************************/\n\n");
4940	/-------------------------------------------------------------------/
4941	fprintf(outfile,"// syntax table for Singular\n//\n");
4942	fprintf(outfile,"// - search for an exact match of the argument types\n");
4943	fprintf(outfile,"// - otherwise search for the first possibility\n");
4944	fprintf(outfile,"// with converted types of the arguments\n");
4945	fprintf(outfile,"// - otherwise report an error\n//\n");
4946
4947	int op;
4948	i=0;
4949	while ((op=dArith1[i].cmd)!=0)
4950	{
4951	if (dArith1[i].p==jjWRONG)
4952	fprintf(outfile,"// DUMMY ");
4953	char *s = iiTwoOps(op);
4954	fprintf(outfile,"// operation: %s (%s) -> %s\n",
4955	s,
4956	Tok2Cmdname(dArith1[i].arg),
4957	Tok2Cmdname(ABS(dArith1[i].res)));
4958	i++;
4959	}
4960	fprintf(outfile,"/---------------------------------------------/\n");
4961	i=0;
4962	while ((op=dArith2[i].cmd)!=0)
4963	{
4964	if (dArith2[i].p==jjWRONG2)
4965	fprintf(outfile,"// DUMMY ");
4966	char *s = iiTwoOps(op);
4967	fprintf(outfile,"// operation: %s (%s, %s) -> %s\n",
4968	s,
4969	Tok2Cmdname(dArith2[i].arg1),
4970	Tok2Cmdname(dArith2[i].arg2),
4971	Tok2Cmdname(dArith2[i].res));
4972	i++;
4973	}
4974	fprintf(outfile,"/---------------------------------------------/\n");
4975	i=0;
4976	while ((op=dArith3[i].cmd)!=0)
4977	{
4978	char *s = iiTwoOps(op);
4979	if (dArith3[i].p==jjWRONG3)
4980	fprintf(outfile,"// DUMMY ");
4981	fprintf(outfile,"// operation: %s (%s, %s, %s) -> %s\n",
4982	s,
4983	Tok2Cmdname(dArith3[i].arg1),
4984	Tok2Cmdname(dArith3[i].arg2),
4985	Tok2Cmdname(dArith3[i].arg3),
4986	Tok2Cmdname(dArith3[i].res));
4987	i++;
4988	}
4989	fprintf(outfile,"/---------------------------------------------/\n");
4990	i=0;
4991	while ((op=dArithM[i].cmd)!=0)
4992	{
4993	char *s = iiTwoOps(op);
4994	fprintf(outfile,"// operation: %s (...) -> %s",
4995	s,
4996	Tok2Cmdname(dArithM[i].res));
4997	switch(dArithM[i].number_of_args)
4998	{
4999	case -2:
5000	fprintf(outfile," ( number of arguments >0 )\n");
5001	break;
5002	case -1:
5003	fprintf(outfile," ( any number of arguments )\n");
5004	break;
5005	default:
5006	fprintf(outfile," ( %d arguments )\n",dArithM[i].number_of_args);
5007	break;
5008	}
5009	i++;
5010	}
5011	fprintf(outfile,"/---------------------------------------------/\n");
5012	i=0;
5013	while ((op=dAssign[i].res)!=0)
5014	{
5015	fprintf(outfile,"// assign: %s = %s\n",
5016	Tok2Cmdname(op/dAssign[i].res/),
5017	Tok2Cmdname(dAssign[i].arg));
5018	i++;
5019	}
5020	/-------------------------------------------------------------------/
5021	fprintf(outfile,"/---------------------------------------------/\n");
5022	for (j=257;j<=MAX_TOK+1;j++)
5023	{
5024	for(i=257;i<=MAX_TOK+1;i++)
5025	{
5026	if ((i!=j) && (j!=IDHDL) && (j!=DEF_CMD) && (j!=ANY_TYPE)
5027	&& iiTestConvert(i,j))
5028	{
5029	fprintf(outfile,"// convert %s -> %s\n",
5030	Tok2Cmdname(i), Tok2Cmdname(j));
5031	if (j==ANY_TYPE) break;
5032	}
5033	}
5034	}
5035	fprintf(outfile,"/---------------------------------------------/\n");
5036	char ops[]="=><+*/[.^,%(;";
5037	for(i=0;ops[i]!='\0';i++)
5038	fprintf(outfile,"// token %d : %c\n", (int)ops[i], ops[i]);
5039	for (i=257;i<=MAX_TOK;i++)
5040	{
5041	char *s=iiTwoOps(i);
5042	if (s[0]!='$')
5043	{
5044	fprintf(outfile,"// token %d : %s\n", i, s);
5045	}
5046	}
5047	/-------------------------------------------------------------------/
5048	fprintf(outfile,"/--max. token: %d, gr: %d --/\n",MAX_TOK,UMINUS);
5049	/-------------------------------------------------------------------/
5050	fprintf(outfile,"/---------------------------------------------/\n");
5051	fprintf(outfile,
5052	"struct sValCmdTab dArithTab1[]=\n"
5053	"{\n");
5054	for (j=1;j<=MAX_TOK+1;j++)
5055	{
5056	for(i=0;dArith1[i].cmd!=0;i++)
5057	{
5058	if (dArith1[i].cmd==j)
5059	{
5060	fprintf(outfile," { %d,%d },\n",j,i);
5061	l1++;
5062	break;
5063	}
5064	}
5065	}
5066	fprintf(outfile," { 10000,0 }\n};\n");
5067	fprintf(outfile,"#define JJTAB1LEN %d\n",l1);
5068	/-------------------------------------------------------------------/
5069	fprintf(outfile,
5070	"struct sValCmdTab dArithTab2[]=\n"
5071	"{\n");
5072	for (j=1;j<=MAX_TOK+1;j++)
5073	{
5074	for(i=0;dArith2[i].cmd!=0;i++)
5075	{
5076	if (dArith2[i].cmd==j)
5077	{
5078	fprintf(outfile," { %d,%d },\n",j,i);
5079	l2++;
5080	break;
5081	}
5082	}
5083	}
5084	fprintf(outfile," { 10000,0 }\n};\n");
5085	fprintf(outfile,"#define JJTAB2LEN %d\n",l2);
5086	fclose(outfile);
5087	}
5088	/-------------------------------------------------------------------/
5089	void ttGen2()
5090	{
5091	FILE *outfile = myfopen("iparith.inc","a");
5092	fprintf(outfile,
5093	"/****************************************\n"
5094	"* Computer Algebra System SINGULAR *\n"
5095	"****************************************/\n\n");
5096	/-------------------------------------------------------------------/
5097	fprintf(outfile,"// identifier table for Singular\n//\n");
5098
5099	fprintf(outfile,
5100	"cmdnames cmds[] =\n"
5101	"{ // name-string alias tokval toktype\n"
5102	"{ \"$INVALID$\", 0, -1, 0},\n");
5103	int i=1;
5104	int m=-1;
5105	int id_nr=0;
5106	BOOLEAN f=FALSE;
5107	loop
5108	{
5109	while (cmds[i].tokval!=0)
5110	{
5111	if ((cmds[i].tokval!=-1)&&(cmds[i].name!=NULL))
5112	{
5113	if(m==-1)
5114	{
5115	m=i;
5116	f=TRUE;
5117	}
5118	else if(strcmp(cmds[m].name,cmds[i].name)>0)
5119	{
5120	m=i;
5121	f=TRUE;
5122	}
5123	}
5124	i++;
5125	}
5126	if(f)
5127	{
5128	id_nr++;
5129	if(cmds[m].tokval==VRTIMER) fprintf(outfile,"#ifdef HAVE_RTIMER\n");
5130	fprintf(outfile," {\"%s\", %*d, %3d, ",cmds[m].name,
5131	20-strlen(cmds[m].name),
5132	cmds[m].alias,
5133	cmds[m].tokval);
5134	switch(cmds[m].toktype)
5135	{
5136	case CMD_1: fprintf(outfile,"CMD_1 },\n"); break;
5137	case CMD_2: fprintf(outfile,"CMD_2 },\n"); break;
5138	case CMD_3: fprintf(outfile,"CMD_3 },\n"); break;
5139	case CMD_12: fprintf(outfile,"CMD_12 },\n"); break;
5140	case CMD_123 : fprintf(outfile,"CMD_123 },\n"); break;
5141	case CMD_23: fprintf(outfile,"CMD_23 },\n"); break;
5142	case CMD_M: fprintf(outfile,"CMD_M },\n"); break;
5143	case SYSVAR: fprintf(outfile,"SYSVAR },\n"); break;
5144	case ROOT_DECL: fprintf(outfile,"ROOT_DECL },\n"); break;
5145	case ROOT_DECL_LIST: fprintf(outfile,"ROOT_DECL_LIST },\n"); break;
5146	case RING_DECL: fprintf(outfile,"RING_DECL },\n"); break;
5147	case NONE: fprintf(outfile,"NONE },\n"); break;
5148	default: if((cmds[m].toktype>' ')
5149	&&(cmds[m].toktype<127))
5150	{
5151	fprintf(outfile,"'%c' },\n",cmds[m].toktype);
5152	}
5153	else
5154	{
5155	fprintf(outfile,"%d },\n",cmds[m].toktype);
5156	}
5157	break;
5158	}
5159	if(cmds[m].tokval==VRTIMER) fprintf(outfile,"#endif\n");
5160	cmds[m].name=NULL;
5161	m=-1;
5162	i=1;
5163	f=FALSE;
5164	}
5165	else break;
5166	}
5167	fprintf(outfile,
5168	"/* list of scanner identifiers/only for feread/reservedName */\n");
5169	f=FALSE;
5170	i=1;m=-1;
5171	loop
5172	{
5173	while (cmds[i].tokval!=0)
5174	{
5175	if (cmds[i].name!=NULL)
5176	{
5177	if(m==-1)
5178	{
5179	m=i;
5180	f=TRUE;
5181	}
5182	else if(strcmp(cmds[m].name,cmds[i].name)>0)
5183	{
5184	m=i;
5185	f=TRUE;
5186	}
5187	}
5188	i++;
5189	}
5190	if(f)
5191	{
5192	fprintf(outfile," {\"%s\", %*d, -1, 0 },\n",cmds[m].name,
5193	20-strlen(cmds[m].name),
5194	0/cmds[m].alias/
5195	/-1 cmds[m].tokval/
5196	/0 cmds[m].toktype/);
5197	cmds[m].name=NULL;
5198	m=-1;
5199	i=1;
5200	f=FALSE;
5201	}
5202	else break;
5203	}
5204	fprintf(outfile,
5205	"/* end of list marker */\n"
5206	" { NULL, 0, 0, 0}\n"
5207	"};\n"
5208	"#ifdef HAVE_RTIMER\n"
5209	"#define LAST_IDENTIFIER %d\n"
5210	"#else\n"
5211	"#define LAST_IDENTIFIER %d\n"
5212	"#endif\n",id_nr,id_nr-1);
5213	fclose(outfile);
5214	}
5215	/-------------------------------------------------------------------/
5216	#if 0
5217	void ttGen3()
5218	{
5219	FILE *outfile = myfopen("mpsr_tok.inc","w");
5220	fprintf(outfile,
5221	"/****************************************\n"
5222	"* Computer Algebra System SINGULAR *\n"
5223	"****************************************/\n\n");
5224	/-------------------------------------------------------------------/
5225	fprintf(outfile,"// token table for Singular\n//\n");
5226
5227	fprintf(outfile,
5228	"short vtok[] =\n"
5229	"{\n");
5230	// operations with 1 arg: ===========================================
5231	int i=0;
5232	while (dArith1[i].cmd!=0)
5233	{
5234	if ((dArith1[i].p!=jjWRONG)
5235	&&((i==0)\|\|(dArith1[i].cmd!=dArith1[i-1].cmd)))
5236	{
5237	fprintf(outfile," %d,\n",dArith1[i].cmd);
5238	}
5239	i++;
5240	}
5241	// operations with 2 args: ===========================================
5242	i=0;
5243	while (dArith2[i].cmd!=0)
5244	{
5245	if ((dArith2[i].p!=jjWRONG2)
5246	&&((i==0)\|\|(dArith2[i].cmd!=dArith2[i-1].cmd)))
5247	{
5248	fprintf(outfile," %d,\n",dArith2[i].cmd);
5249	}
5250	i++;
5251	}
5252	// operations with 3 args: ===========================================
5253	i=0;
5254	while (dArith3[i].cmd!=0)
5255	{
5256	if (
5257	((i==0)\|\|(dArith3[i].cmd!=dArith3[i-1].cmd)))
5258	{
5259	fprintf(outfile," %d,\n",dArith3[i].cmd);
5260	}
5261	i++;
5262	}
5263	// operations with many args: ===========================================
5264	i=0;
5265	while (dArithM[i].cmd!=0)
5266	{
5267	if (
5268	((i==0)\|\|(dArithM[i].cmd!=dArithM[i-1].cmd)))
5269	{
5270	fprintf(outfile," %d,\n",dArithM[i].cmd);
5271	}
5272	i++;
5273	}
5274	// ====================================================================
5275	fprintf(outfile,
5276	"/* end of list marker */\n"
5277	" %d };\n",MAX_TOK);
5278	fclose(outfile);
5279	}
5280	#endif
5281	/-------------------------------------------------------------------/
5282	#else
5283	#include "iparith.inc"
5284	#endif
5285
5286	/=================== operations with 2 args. ============================/
5287
5288	BOOLEAN iiExprArith2(leftv res, leftv a, int op, leftv b, BOOLEAN proccall)
5289	{
5290	#ifndef GENTABLE
5291	memset(res,0,sizeof(sleftv));
5292
5293	if (!errorreported)
5294	{
5295	#ifdef SIQ
5296	if (siq>0)
5297	{
5298	//Print("siq:%d\n",siq);
5299	command d=(command)Alloc0SizeOf(ip_command);
5300	memcpy(&d->arg1,a,sizeof(sleftv));
5301	memcpy(&d->arg2,b,sizeof(sleftv));
5302	d->argc=2;
5303	d->op=op;
5304	res->data=(char *)d;
5305	res->rtyp=COMMAND;
5306	return FALSE;
5307	}
5308	#endif
5309	int at=a->Typ();
5310	int bt=b->Typ();
5311	int i=iiTabIndex(dArithTab2,JJTAB2LEN,op);
5312	int index=i;
5313
5314	iiOp=op;
5315	while (dArith2[i].cmd==op)
5316	{
5317	if ((at==dArith2[i].arg1)
5318	&& (bt==dArith2[i].arg2))
5319	{
5320	res->rtyp=dArith2[i].res;
5321	if (dArith2[i].p(res,a,b))
5322	{
5323	break;// leave loop, goto error handling
5324	}
5325	a->CleanUp();
5326	b->CleanUp();
5327	//Print("op: %d,result typ:%d\n",op,res->rtyp);
5328	return FALSE;
5329	}
5330	i++;
5331	}
5332	// implicite type conversion ----------------------------------------------
5333	if (dArith2[i].cmd!=op)
5334	{
5335	int ai,bi;
5336	leftv an = (leftv)Alloc0SizeOf(sleftv);
5337	leftv bn = (leftv)Alloc0SizeOf(sleftv);
5338	BOOLEAN failed=FALSE;
5339	i=index; /iiTabIndex(dArithTab2,JJTAB2LEN,op);/
5340	//Print("op: %c, type: %s %s\n",op,Tok2Cmdname(at),Tok2Cmdname(bt));
5341	while (dArith2[i].cmd==op)
5342	{
5343	//Print("test %s %s\n",Tok2Cmdname(dArith2[i].arg1),Tok2Cmdname(dArith2[i].arg2));
5344	if ((ai=iiTestConvert(at,dArith2[i].arg1))!=0)
5345	{
5346	if ((bi=iiTestConvert(bt,dArith2[i].arg2))!=0)
5347	{
5348	res->rtyp=dArith2[i].res;
5349	failed= ((iiConvert(at,dArith2[i].arg1,ai,a,an))
5350	\|\| (iiConvert(bt,dArith2[i].arg2,bi,b,bn))
5351	\|\| (dArith2[i].p(res,an,bn)));
5352	// everything done, clean up temp. variables
5353	if (failed)
5354	{
5355	// leave loop, goto error handling
5356	break;
5357	}
5358	else
5359	{
5360	// everything ok, clean up and return
5361	an->CleanUp();
5362	bn->CleanUp();
5363	FreeSizeOf((ADDRESS)an,sleftv);
5364	FreeSizeOf((ADDRESS)bn,sleftv);
5365	a->CleanUp();
5366	b->CleanUp();
5367	return FALSE;
5368	}
5369	}
5370	}
5371	i++;
5372	}
5373	an->CleanUp();
5374	bn->CleanUp();
5375	FreeSizeOf((ADDRESS)an,sleftv);
5376	FreeSizeOf((ADDRESS)bn,sleftv);
5377	}
5378	// error handling ---------------------------------------------------
5379	const char *s=NULL;
5380	if (!errorreported)
5381	{
5382	if ((at==0) && (a->Fullname()!=sNoName))
5383	{
5384	s=a->Fullname();
5385	}
5386	else if ((bt==0) && (b->Fullname()!=sNoName))
5387	{
5388	s=b->Fullname();
5389	}
5390	if (s!=NULL)
5391	Werror("`%s` is not defined",s);
5392	else
5393	{
5394	i=index; /iiTabIndex(dArithTab2,JJTAB2LEN,op);/
5395	s = iiTwoOps(op);
5396	if (proccall)
5397	{
5398	Werror("%s(`%s`,`%s`) is not supported"
5399	,s,Tok2Cmdname(at),Tok2Cmdname(bt));
5400	}
5401	else
5402	{
5403	Werror("`%s` %s `%s` is not supported"
5404	,Tok2Cmdname(at),s,Tok2Cmdname(bt));
5405	}
5406	if (BVERBOSE(V_SHOW_USE))
5407	{
5408	while (dArith2[i].cmd==op)
5409	{
5410	if(((at==dArith2[i].arg1)\|\|(bt==dArith2[i].arg2))
5411	&& (dArith2[i].res!=0)
5412	&& (dArith2[i].p!=jjWRONG2))
5413	{
5414	if (proccall)
5415	Werror("expected %s(`%s`,`%s`)"
5416	,s,Tok2Cmdname(dArith2[i].arg1),Tok2Cmdname(dArith2[i].arg2));
5417	else
5418	Werror("expected `%s` %s `%s`"
5419	,Tok2Cmdname(dArith2[i].arg1),s,Tok2Cmdname(dArith2[i].arg2));
5420	}
5421	i++;
5422	}
5423	}
5424	}
5425	}
5426	res->rtyp = UNKNOWN;
5427	}
5428	a->CleanUp();
5429	b->CleanUp();
5430	#endif
5431	return TRUE;
5432	}
5433
5434	/==================== operations with 1 arg. ===============================/
5435
5436	BOOLEAN iiExprArith1(leftv res, leftv a, int op)
5437	{
5438	#ifndef GENTABLE
5439	memset(res,0,sizeof(sleftv));
5440
5441	if (!errorreported)
5442	{
5443	#ifdef SIQ
5444	if (siq>0)
5445	{
5446	//Print("siq:%d\n",siq);
5447	command d=(command)Alloc0SizeOf(ip_command);
5448	memcpy(&d->arg1,a,sizeof(sleftv));
5449	d->op=op;
5450	d->argc=1;
5451	res->data=(char *)d;
5452	res->rtyp=COMMAND;
5453	return FALSE;
5454	}
5455	#endif
5456	int at=a->Typ();
5457	BOOLEAN failed=FALSE;
5458
5459	iiOp=op;
5460	int i=iiTabIndex(dArithTab1,JJTAB1LEN,op);
5461	int ti = i;
5462	while (dArith1[i].cmd==op)
5463	{
5464	if (at==dArith1[i].arg)
5465	{
5466	res->rtyp=dArith1[i].res;
5467	if (dArith1[i].res<0)
5468	{
5469	res->rtyp=-res->rtyp;
5470	#ifdef PROC_BUG
5471	dArith1[i].p(res,a);
5472	#else
5473	res->data=(char )((Proc1)dArith1[i].p)((char )a->Data());
5474	#endif
5475	}
5476	else if (dArith1[i].p(res,a))
5477	{
5478	break;// leave loop, goto error handling
5479	}
5480	if (a->Next()!=NULL)
5481	{
5482	res->next=(leftv)AllocSizeOf(sleftv);
5483	failed=iiExprArith1(res->next,a->next,op);
5484	}
5485	a->CleanUp();
5486	return failed;
5487	}
5488	i++;
5489	}
5490	// implicite type conversion --------------------------------------------
5491	if (dArith1[i].cmd!=op)
5492	{
5493	int ai;
5494	leftv an = (leftv)Alloc0SizeOf(sleftv);
5495	i=ti;
5496	//Print("fuer %c , typ: %s\n",op,Tok2Cmdname(at));
5497	while (dArith1[i].cmd==op)
5498	{
5499	//Print("test %s\n",Tok2Cmdname(dArith1[i].arg));
5500	if ((ai=iiTestConvert(at,dArith1[i].arg))!=0)
5501	{
5502	res->rtyp=dArith1[i].res;
5503	if (dArith1[i].res<0)
5504	{
5505	res->rtyp=-res->rtyp;
5506	failed= iiConvert(at,dArith1[i].arg,ai,a,an);
5507	if (!failed)
5508	{
5509	#ifdef PROC_BUG
5510	dArith1[i].p(res,a);
5511	#else
5512	res->data=(char )((Proc1)dArith1[i].p)((char )an->Data());
5513	#endif
5514	}
5515	}
5516	else
5517	{
5518	failed= ((iiConvert(at,dArith1[i].arg,ai,a,an))
5519	\|\| (dArith1[i].p(res,an)));
5520	}
5521	// everything done, clean up temp. variables
5522	if (failed)
5523	{
5524	// leave loop, goto error handling
5525	break;
5526	}
5527	else
5528	{
5529	if (an->Next() != NULL)
5530	{
5531	res->next = (leftv)AllocSizeOf(sleftv);
5532	failed=iiExprArith1(res->next,an->next,op);
5533	}
5534	// everything ok, clean up and return
5535	an->CleanUp();
5536	FreeSizeOf((ADDRESS)an,sleftv);
5537	a->CleanUp();
5538	return failed;
5539	}
5540	}
5541	i++;
5542	}
5543	an->CleanUp();
5544	FreeSizeOf((ADDRESS)an,sleftv);
5545	}
5546	// error handling
5547	if (!errorreported)
5548	{
5549	if ((at==0) && (a->Fullname()!=sNoName))
5550	{
5551	Werror("`%s` is not defined",a->Fullname());
5552	}
5553	else
5554	{
5555	i=ti;
5556	char *s = iiTwoOps(op);
5557	Werror("%s(`%s`) is not supported"
5558	,s,Tok2Cmdname(at));
5559	if (BVERBOSE(V_SHOW_USE))
5560	{
5561	while (dArith1[i].cmd==op)
5562	{
5563	if ((dArith1[i].res!=0)
5564	&& (dArith1[i].p!=jjWRONG))
5565	Werror("expected %s(`%s`)"
5566	,s,Tok2Cmdname(dArith1[i].arg));
5567	i++;
5568	}
5569	}
5570	}
5571	}
5572	res->rtyp = UNKNOWN;
5573	}
5574	a->CleanUp();
5575	#endif
5576	return TRUE;
5577	}
5578
5579	/=================== operations with 3 args. ============================/
5580
5581	BOOLEAN iiExprArith3(leftv res, int op, leftv a, leftv b, leftv c)
5582	{
5583	#ifndef GENTABLE
5584	memset(res,0,sizeof(sleftv));
5585
5586	if (!errorreported)
5587	{
5588	#ifdef SIQ
5589	if (siq>0)
5590	{
5591	//Print("siq:%d\n",siq);
5592	command d=(command)Alloc0SizeOf(ip_command);
5593	memcpy(&d->arg1,a,sizeof(sleftv));
5594	memcpy(&d->arg2,b,sizeof(sleftv));
5595	memcpy(&d->arg3,c,sizeof(sleftv));
5596	d->op=op;
5597	d->argc=3;
5598	res->data=(char *)d;
5599	res->rtyp=COMMAND;
5600	return FALSE;
5601	}
5602	#endif
5603	int at=a->Typ();
5604	int bt=b->Typ();
5605	int ct=c->Typ();
5606
5607	iiOp=op;
5608	int i=0;
5609	while ((dArith3[i].cmd!=op)&&(dArith3[i].cmd!=0)) i++;
5610	while (dArith3[i].cmd==op)
5611	{
5612	if ((at==dArith3[i].arg1)
5613	&& (bt==dArith3[i].arg2)
5614	&& (ct==dArith3[i].arg3))
5615	{
5616	res->rtyp=dArith3[i].res;
5617	if (dArith3[i].p(res,a,b,c))
5618	{
5619	break;// leave loop, goto error handling
5620	}
5621	a->CleanUp();
5622	b->CleanUp();
5623	c->CleanUp();
5624	return FALSE;
5625	}
5626	i++;
5627	}
5628	// implicite type conversion ----------------------------------------------
5629	if (dArith3[i].cmd!=op)
5630	{
5631	int ai,bi,ci;
5632	leftv an = (leftv)Alloc0SizeOf(sleftv);
5633	leftv bn = (leftv)Alloc0SizeOf(sleftv);
5634	leftv cn = (leftv)Alloc0SizeOf(sleftv);
5635	BOOLEAN failed=FALSE;
5636	i=0;
5637	while ((dArith3[i].cmd!=op)&&(dArith3[i].cmd!=0)) i++;
5638	while (dArith3[i].cmd==op)
5639	{
5640	if ((ai=iiTestConvert(at,dArith3[i].arg1))!=0)
5641	{
5642	if ((bi=iiTestConvert(bt,dArith3[i].arg2))!=0)
5643	{
5644	if ((ci=iiTestConvert(ct,dArith3[i].arg3))!=0)
5645	{
5646	res->rtyp=dArith3[i].res;
5647	failed= ((iiConvert(at,dArith3[i].arg1,ai,a,an))
5648	\|\| (iiConvert(bt,dArith3[i].arg2,bi,b,bn))
5649	\|\| (iiConvert(ct,dArith3[i].arg3,ci,c,cn))
5650	\|\| (dArith3[i].p(res,an,bn,cn)));
5651	// everything done, clean up temp. variables
5652	if (failed)
5653	{
5654	// leave loop, goto error handling
5655	break;
5656	}
5657	else
5658	{
5659	// everything ok, clean up and return
5660	an->CleanUp();
5661	bn->CleanUp();
5662	cn->CleanUp();
5663	FreeSizeOf((ADDRESS)an,sleftv);
5664	FreeSizeOf((ADDRESS)bn,sleftv);
5665	FreeSizeOf((ADDRESS)cn,sleftv);
5666	a->CleanUp();
5667	b->CleanUp();
5668	c->CleanUp();
5669	//Print("op: %d,result typ:%d\n",op,res->rtyp);
5670	return FALSE;
5671	}
5672	}
5673	}
5674	}
5675	i++;
5676	}
5677	an->CleanUp();
5678	bn->CleanUp();
5679	cn->CleanUp();
5680	FreeSizeOf((ADDRESS)an,sleftv);
5681	FreeSizeOf((ADDRESS)bn,sleftv);
5682	FreeSizeOf((ADDRESS)cn,sleftv);
5683	}
5684	// error handling ---------------------------------------------------
5685	if (!errorreported)
5686	{
5687	const char *s=NULL;
5688	if ((at==0) && (a->Fullname()!=sNoName))
5689	{
5690	s=a->Fullname();
5691	}
5692	else if ((bt==0) && (b->Fullname()!=sNoName))
5693	{
5694	s=b->Fullname();
5695	}
5696	else if ((ct==0) && (c->Fullname()!=sNoName))
5697	{
5698	s=c->Fullname();
5699	}
5700	if (s!=NULL)
5701	Werror("`%s` is not defined",s);
5702	else
5703	{
5704	i=0;
5705	while ((dArith3[i].cmd!=op)&&(dArith3[i].cmd!=0)) i++;
5706	char *s = iiTwoOps(op);
5707	Werror("%s(`%s`,`%s`,`%s`) is not supported"
5708	,s,Tok2Cmdname(at),Tok2Cmdname(bt),Tok2Cmdname(ct));
5709	if (BVERBOSE(V_SHOW_USE))
5710	{
5711	while (dArith3[i].cmd==op)
5712	{
5713	if(((at==dArith3[i].arg1)
5714	\|\|(bt==dArith3[i].arg2)
5715	\|\|(ct==dArith3[i].arg3))
5716	&& (dArith3[i].res!=0))
5717	{
5718	Werror("expected %s(`%s`,`%s`,`%s`)"
5719	,s,Tok2Cmdname(dArith3[i].arg1)
5720	,Tok2Cmdname(dArith3[i].arg2)
5721	,Tok2Cmdname(dArith3[i].arg3));
5722	}
5723	i++;
5724	}
5725	}
5726	}
5727	}
5728	res->rtyp = UNKNOWN;
5729	}
5730	a->CleanUp();
5731	b->CleanUp();
5732	c->CleanUp();
5733	//Print("op: %d,result typ:%d\n",op,res->rtyp);
5734	#endif
5735	return TRUE;
5736	}
5737	/==================== operations with many arg. ===============================/
5738
5739	BOOLEAN jjANY2LIST(leftv res, leftv v, int cnt)
5740	{
5741	// cnt = 0: all
5742	// cnt = 1: only first one
5743	leftv next;
5744	BOOLEAN failed = TRUE;
5745	if(v==NULL) return failed;
5746	res->rtyp = LIST_CMD;
5747	if(cnt) v->next = NULL;
5748	next = v->next; // saving next-pointer
5749	failed = jjLIST_PL(res, v);
5750	v->next = next; // writeback next-pointer
5751	return failed;
5752	}
5753
5754	BOOLEAN iiExprArithM(leftv res, leftv a, int op)
5755	{
5756	#ifndef GENTABLE
5757	memset(res,0,sizeof(sleftv));
5758
5759	if (!errorreported)
5760	{
5761	#ifdef SIQ
5762	if (siq>0)
5763	{
5764	//Print("siq:%d\n",siq);
5765	command d=(command)Alloc0SizeOf(ip_command);
5766	d->op=op;
5767	res->data=(char *)d;
5768	if (a!=NULL)
5769	{
5770	d->argc=a->listLength();
5771	// else : d->argc=0;
5772	memcpy(&d->arg1,a,sizeof(sleftv));
5773	switch(d->argc)
5774	{
5775	case 3:
5776	memcpy(&d->arg3,a->next->next,sizeof(sleftv));
5777	a->next->next->rtyp=0;
5778	a->next->next->data=NULL;
5779	a->next->next->name=NULL;
5780	a->next->next->attribute=NULL;
5781	case 2:
5782	memcpy(&d->arg2,a->next,sizeof(sleftv));
5783	a->next->rtyp=0;
5784	a->next->name=NULL;
5785	a->next->data=NULL;
5786	a->next->attribute=NULL;
5787	d->arg2.next=NULL;
5788	case 1:
5789	d->arg1.next=NULL;
5790	}
5791	if (d->argc>3) a->next=NULL;
5792	a->rtyp=0;
5793	a->data=NULL;
5794	a->name=NULL;
5795	a->CleanUp();
5796	}
5797	res->rtyp=COMMAND;
5798	return FALSE;
5799	}
5800	#endif
5801	BOOLEAN failed=FALSE;
5802	int args=0;
5803	if (a!=NULL) args=a->listLength();
5804
5805	iiOp=op;
5806	int i=0;
5807	while ((dArithM[i].cmd!=op)&&(dArithM[i].cmd!=0)) i++;
5808	int ii=i;
5809	while (dArithM[i].cmd==op)
5810	{
5811	if ((args==dArithM[i].number_of_args)
5812	\|\| (dArithM[i].number_of_args==-1)
5813	\|\| ((dArithM[i].number_of_args==-2)&&(args>0)))
5814	{
5815	res->rtyp=dArithM[i].res;
5816	if (dArithM[i].p(res,a))
5817	{
5818	break;// leave loop, goto error handling
5819	}
5820	if (a!=NULL) a->CleanUp();
5821	//Print("op: %d,result typ:%d\n",op,res->rtyp);
5822	return failed;
5823	}
5824	i++;
5825	}
5826	// error handling
5827	if (!errorreported)
5828	{
5829	if ((args>0) && (a->rtyp==0) && (a->Name()!=sNoName))
5830	{
5831	Werror("`%s` is not defined",a->Fullname());
5832	}
5833	else
5834	{
5835	char *s = iiTwoOps(op);
5836	Werror("%s(...) is not supported",s);
5837	}
5838	}
5839	res->rtyp = UNKNOWN;
5840	}
5841	if (a!=NULL) a->CleanUp();
5842	//Print("op: %d,result typ:%d\n",op,res->rtyp);
5843	#endif
5844	return TRUE;
5845	}
5846
5847	/=================== general utilities ============================/
5848	int IsCmd(char *n, int & tok)
5849	{
5850	int an=1;
5851	int i,v;
5852	#ifndef GENTABLE
5853	int en=LAST_IDENTIFIER;
5854
5855	loop
5856	{
5857	if(an>=en-1)
5858	{
5859	if (strcmp(n, cmds[an].name) == 0)
5860	{
5861	i=an;
5862	break;
5863	}
5864	else if ((an!=en) && (strcmp(n, cmds[en].name) == 0))
5865	{
5866	i=en;
5867	break;
5868	}
5869	else
5870	{
5871	return 0;
5872	}
5873	}
5874	i=(an+en)/2;
5875	if (n < (cmds[i].name))
5876	{
5877	en=i-1;
5878	}
5879	else if (n > (cmds[i].name))
5880	{
5881	an=i+1;
5882	}
5883	else
5884	{
5885	v=strcmp(n,cmds[i].name);
5886	if(v<0)
5887	{
5888	en=i-1;
5889	}
5890	else if(v>0)
5891	{
5892	an=i+1;
5893	}
5894	else /v==0/
5895	{
5896	break;
5897	}
5898	}
5899	}
5900	lastreserved=cmds[i].name;
5901	tok=cmds[i].tokval;
5902	if(cmds[i].alias==2)
5903	{
5904	Warn("outdated identifier `%s` used - please change your code",
5905	cmds[i].name);
5906	cmds[i].alias=1;
5907	}
5908	if (currRingHdl==NULL)
5909	{
5910	#ifdef SIQ
5911	if (siq<=0)
5912	{
5913	#endif
5914	if ((tok>=BEGIN_RING) && (tok<=END_RING))
5915	{
5916	WerrorS("no ring active");
5917	return 0;
5918	}
5919	#ifdef SIQ
5920	}
5921	#endif
5922	}
5923	if (!expected_parms)
5924	{
5925	switch (tok)
5926	{
5927	case IDEAL_CMD:
5928	case INT_CMD:
5929	case INTVEC_CMD:
5930	case MAP_CMD:
5931	case MATRIX_CMD:
5932	case MODUL_CMD:
5933	case POLY_CMD:
5934	case PROC_CMD:
5935	case RING_CMD:
5936	case STRING_CMD:
5937	cmdtok = tok;
5938	break;
5939	}
5940	}
5941	#endif
5942	return cmds[i].toktype;
5943	}
5944	static int iiTabIndex(const jjValCmdTab dArithTab, const int len, const int op)
5945	{
5946	#ifndef GENTABLE
5947	int a=0;
5948	int e=len;
5949	int p=len/2;
5950	do
5951	{
5952	if (op==dArithTab[p].cmd) return dArithTab[p].start;
5953	if (op<dArithTab[p].cmd) e=p-1;
5954	else a = p+1;
5955	p=a+(e-a)/2;
5956	}
5957	while ( a <= e);
5958
5959	#endif
5960	assume(0);
5961	return 0;
5962	}
5963

Note: See TracBrowser for help on using the repository browser.

Download in other formats: