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