1 | /**************************************** |
---|
2 | * Computer Algebra System SINGULAR * |
---|
3 | ****************************************/ |
---|
4 | /* $Id: ipassign.cc,v 1.68 2003-03-10 16:43:50 Singular Exp $ */ |
---|
5 | |
---|
6 | /* |
---|
7 | * ABSTRACT: interpreter: |
---|
8 | * assignment of expressions and lists to objects or lists |
---|
9 | */ |
---|
10 | |
---|
11 | #include <stdlib.h> |
---|
12 | #include <string.h> |
---|
13 | #include <ctype.h> |
---|
14 | |
---|
15 | #include "mod2.h" |
---|
16 | #include "tok.h" |
---|
17 | #include "ipid.h" |
---|
18 | #include "intvec.h" |
---|
19 | #include "omalloc.h" |
---|
20 | #include "febase.h" |
---|
21 | #include "polys.h" |
---|
22 | #include "ideals.h" |
---|
23 | #include "matpol.h" |
---|
24 | #include "kstd1.h" |
---|
25 | #include "timer.h" |
---|
26 | #include "ring.h" |
---|
27 | #include "subexpr.h" |
---|
28 | #include "numbers.h" |
---|
29 | #include "lists.h" |
---|
30 | #include "longalg.h" |
---|
31 | #include "stairc.h" |
---|
32 | #include "maps.h" |
---|
33 | #include "syz.h" |
---|
34 | #include "weight.h" |
---|
35 | #include "ipconv.h" |
---|
36 | #include "attrib.h" |
---|
37 | #include "silink.h" |
---|
38 | #include "ipshell.h" |
---|
39 | |
---|
40 | /*=================== proc =================*/ |
---|
41 | static BOOLEAN jjECHO(leftv res, leftv a) |
---|
42 | { |
---|
43 | si_echo=(int)a->Data(); |
---|
44 | return FALSE; |
---|
45 | } |
---|
46 | static BOOLEAN jjPAGELENGTH(leftv res, leftv a) |
---|
47 | { |
---|
48 | pagelength=(int)a->Data(); |
---|
49 | return FALSE; |
---|
50 | } |
---|
51 | static BOOLEAN jjPRINTLEVEL(leftv res, leftv a) |
---|
52 | { |
---|
53 | printlevel=(int)a->Data(); |
---|
54 | return FALSE; |
---|
55 | } |
---|
56 | static BOOLEAN jjCOLMAX(leftv res, leftv a) |
---|
57 | { |
---|
58 | colmax=(int)a->Data(); |
---|
59 | return FALSE; |
---|
60 | } |
---|
61 | static BOOLEAN jjTIMER(leftv res, leftv a) |
---|
62 | { |
---|
63 | timerv=(int)a->Data(); |
---|
64 | initTimer(); |
---|
65 | return FALSE; |
---|
66 | } |
---|
67 | #ifdef HAVE_RTIMER |
---|
68 | static BOOLEAN jjRTIMER(leftv res, leftv a) |
---|
69 | { |
---|
70 | rtimerv=(int)a->Data(); |
---|
71 | initRTimer(); |
---|
72 | return FALSE; |
---|
73 | } |
---|
74 | #endif |
---|
75 | static BOOLEAN jjMAXDEG(leftv res, leftv a) |
---|
76 | { |
---|
77 | Kstd1_deg=(int)a->Data(); |
---|
78 | if (Kstd1_deg!=0) |
---|
79 | test |=Sy_bit(24); |
---|
80 | else |
---|
81 | test &=(~Sy_bit(24)); |
---|
82 | return FALSE; |
---|
83 | } |
---|
84 | static BOOLEAN jjMAXMULT(leftv res, leftv a) |
---|
85 | { |
---|
86 | Kstd1_mu=(int)a->Data(); |
---|
87 | if (Kstd1_mu!=0) |
---|
88 | test |=Sy_bit(23); |
---|
89 | else |
---|
90 | test &=(~Sy_bit(23)); |
---|
91 | return FALSE; |
---|
92 | } |
---|
93 | static BOOLEAN jjTRACE(leftv res, leftv a) |
---|
94 | { |
---|
95 | traceit=(int)a->Data(); |
---|
96 | return FALSE; |
---|
97 | } |
---|
98 | static BOOLEAN jjSHORTOUT(leftv res, leftv a) |
---|
99 | { |
---|
100 | if (currRing != NULL) |
---|
101 | { |
---|
102 | BOOLEAN shortOut = (BOOLEAN)a->Data(); |
---|
103 | #if HAVE_CAN_SHORT_OUT |
---|
104 | if (!shortOut) |
---|
105 | currRing->ShortOut = 0; |
---|
106 | else |
---|
107 | { |
---|
108 | if (currRing->CanShortOut) |
---|
109 | currRing->ShortOut = 1; |
---|
110 | } |
---|
111 | #else |
---|
112 | currRing->ShortOut = shortOut; |
---|
113 | #endif |
---|
114 | } |
---|
115 | return FALSE; |
---|
116 | } |
---|
117 | static BOOLEAN jjMINPOLY(leftv res, leftv a) |
---|
118 | { |
---|
119 | number p=(number)a->CopyD(NUMBER_CMD); |
---|
120 | if (nIsZero(p)) |
---|
121 | { |
---|
122 | currRing->minpoly=NULL; |
---|
123 | naMinimalPoly=NULL; |
---|
124 | } |
---|
125 | else |
---|
126 | { |
---|
127 | if ((rPar(currRing)!=1) |
---|
128 | || (rField_is_GF())) |
---|
129 | { |
---|
130 | WerrorS("no minpoly allowed"); |
---|
131 | return TRUE; |
---|
132 | } |
---|
133 | if (currRing->minpoly!=NULL) |
---|
134 | { |
---|
135 | WerrorS("minpoly already set"); |
---|
136 | return TRUE; |
---|
137 | } |
---|
138 | nNormalize(p); |
---|
139 | currRing->minpoly=p; |
---|
140 | naMinimalPoly=((lnumber)currRing->minpoly)->z; |
---|
141 | } |
---|
142 | return FALSE; |
---|
143 | } |
---|
144 | static BOOLEAN jjNOETHER(leftv res, leftv a) |
---|
145 | { |
---|
146 | poly p=(poly)a->CopyD(POLY_CMD); |
---|
147 | pDelete(&ppNoether); |
---|
148 | ppNoether=p; |
---|
149 | return FALSE; |
---|
150 | } |
---|
151 | /*=================== proc =================*/ |
---|
152 | static void jiAssignAttr(leftv l,leftv r) |
---|
153 | { |
---|
154 | // get the attribute of th right side |
---|
155 | // and set it to l |
---|
156 | leftv rv=r->LData(); |
---|
157 | if (rv!=NULL) |
---|
158 | { |
---|
159 | if (rv->e==NULL) |
---|
160 | { |
---|
161 | if (rv->attribute!=NULL) |
---|
162 | { |
---|
163 | attr la; |
---|
164 | if (r->rtyp!=IDHDL) |
---|
165 | { |
---|
166 | la=rv->attribute; |
---|
167 | rv->attribute=NULL; |
---|
168 | } |
---|
169 | else |
---|
170 | { |
---|
171 | la=rv->attribute->Copy(); |
---|
172 | } |
---|
173 | l->attribute=la; |
---|
174 | } |
---|
175 | l->flag=rv->flag; |
---|
176 | } |
---|
177 | } |
---|
178 | if (l->rtyp==IDHDL) |
---|
179 | { |
---|
180 | idhdl h=(idhdl)l->data; |
---|
181 | IDATTR(h)=l->attribute; |
---|
182 | IDFLAG(h)=l->flag; |
---|
183 | } |
---|
184 | } |
---|
185 | static BOOLEAN jiA_INT(leftv res, leftv a, Subexpr e) |
---|
186 | { |
---|
187 | if (e==NULL) |
---|
188 | { |
---|
189 | res->data=(void *)a->Data(); |
---|
190 | jiAssignAttr(res,a); |
---|
191 | } |
---|
192 | else |
---|
193 | { |
---|
194 | int i=e->start-1; |
---|
195 | if (i<0) |
---|
196 | { |
---|
197 | Werror("index[%d] must be positive",i+1); |
---|
198 | return TRUE; |
---|
199 | } |
---|
200 | intvec *iv=(intvec *)res->data; |
---|
201 | if (e->next==NULL) |
---|
202 | { |
---|
203 | if (i>=iv->length()) |
---|
204 | { |
---|
205 | intvec *iv1=new intvec(i+1); |
---|
206 | (*iv1)[i]=(int)a->Data(); |
---|
207 | intvec *ivn=ivAdd(iv,iv1); |
---|
208 | delete iv; |
---|
209 | delete iv1; |
---|
210 | res->data=(void *)ivn; |
---|
211 | } |
---|
212 | else |
---|
213 | (*iv)[i]=(int)a->Data(); |
---|
214 | } |
---|
215 | else |
---|
216 | { |
---|
217 | int c=e->next->start; |
---|
218 | if ((i>=iv->rows())||(c<1)||(c>iv->cols())) |
---|
219 | { |
---|
220 | Werror("wrong range [%d,%d] in intmat (%d,%d)",i+1,c,iv->rows(),iv->cols()); |
---|
221 | return TRUE; |
---|
222 | } |
---|
223 | else |
---|
224 | IMATELEM(*iv,i+1,c) = (int)a->Data(); |
---|
225 | } |
---|
226 | } |
---|
227 | return FALSE; |
---|
228 | } |
---|
229 | static BOOLEAN jiA_NUMBER(leftv res, leftv a, Subexpr e) |
---|
230 | { |
---|
231 | number p=(number)a->CopyD(NUMBER_CMD); |
---|
232 | if (res->data!=NULL) nDelete((number *)&res->data); |
---|
233 | nNormalize(p); |
---|
234 | res->data=(void *)p; |
---|
235 | jiAssignAttr(res,a); |
---|
236 | return FALSE; |
---|
237 | } |
---|
238 | static BOOLEAN jiA_LIST_RES(leftv res, leftv a,Subexpr e) |
---|
239 | { |
---|
240 | syStrategy r=(syStrategy)a->CopyD(RESOLUTION_CMD); |
---|
241 | if (res->data!=NULL) ((lists)res->data)->Clean(); |
---|
242 | res->data=(void *)syConvRes(r,TRUE); |
---|
243 | //jiAssignAttr(res,a); |
---|
244 | return FALSE; |
---|
245 | } |
---|
246 | static BOOLEAN jiA_LIST(leftv res, leftv a,Subexpr e) |
---|
247 | { |
---|
248 | lists l=(lists)a->CopyD(LIST_CMD); |
---|
249 | if (res->data!=NULL) ((lists)res->data)->Clean(); |
---|
250 | res->data=(void *)l; |
---|
251 | jiAssignAttr(res,a); |
---|
252 | return FALSE; |
---|
253 | } |
---|
254 | static BOOLEAN jiA_POLY(leftv res, leftv a,Subexpr e) |
---|
255 | { |
---|
256 | poly p=(poly)a->CopyD(POLY_CMD); |
---|
257 | pNormalize(p); |
---|
258 | if (e==NULL) |
---|
259 | { |
---|
260 | if (res->data!=NULL) pDelete((poly*)&res->data); |
---|
261 | res->data=(void*)p; |
---|
262 | jiAssignAttr(res,a); |
---|
263 | } |
---|
264 | else |
---|
265 | { |
---|
266 | int i,j; |
---|
267 | matrix m=(matrix)res->data; |
---|
268 | i=e->start; |
---|
269 | if (e->next==NULL) |
---|
270 | { |
---|
271 | j=i; i=1; |
---|
272 | // for all ideal like data types: check indices |
---|
273 | if (j>MATCOLS(m)) |
---|
274 | { |
---|
275 | pEnlargeSet(&(m->m),MATCOLS(m),j-MATCOLS(m)); |
---|
276 | MATCOLS(m)=j; |
---|
277 | } |
---|
278 | else if (j<=0) |
---|
279 | { |
---|
280 | Werror("index[%d] must be positive",j/*e->start*/); |
---|
281 | return TRUE; |
---|
282 | } |
---|
283 | } |
---|
284 | else |
---|
285 | { |
---|
286 | // for matrices: indices are correct (see ipExprArith3(..,'['..) ) |
---|
287 | j=e->next->start; |
---|
288 | } |
---|
289 | pDelete(&MATELEM(m,i,j)); |
---|
290 | MATELEM(m,i,j)=p; |
---|
291 | /* for module: update rank */ |
---|
292 | if ((p!=NULL) && (pGetComp(p)!=0)) |
---|
293 | { |
---|
294 | m->rank=max(m->rank,pMaxComp(p)); |
---|
295 | } |
---|
296 | } |
---|
297 | return FALSE; |
---|
298 | } |
---|
299 | static BOOLEAN jiA_1x1MATRIX(leftv res, leftv a,Subexpr e) |
---|
300 | { |
---|
301 | if ((res->rtyp!=MATRIX_CMD) /*|| (e!=NULL) - TRUE because of type poly */) |
---|
302 | return TRUE; |
---|
303 | matrix am=(matrix)a->CopyD(MATRIX_CMD); |
---|
304 | if ((MATROWS(am)!=1) || (MATCOLS(am)!=1)) |
---|
305 | { |
---|
306 | idDelete((ideal *)&am); |
---|
307 | return TRUE; |
---|
308 | } |
---|
309 | matrix m=(matrix)res->data; |
---|
310 | // indices are correct (see ipExprArith3(..,'['..) ) |
---|
311 | int i=e->start; |
---|
312 | int j=e->next->start; |
---|
313 | pDelete(&MATELEM(m,i,j)); |
---|
314 | pNormalize(MATELEM(am,1,1)); |
---|
315 | MATELEM(m,i,j)=MATELEM(am,1,1); |
---|
316 | MATELEM(am,1,1)=NULL; |
---|
317 | idDelete((ideal *)&am); |
---|
318 | return FALSE; |
---|
319 | } |
---|
320 | static BOOLEAN jiA_STRING(leftv res, leftv a, Subexpr e) |
---|
321 | { |
---|
322 | if (e==NULL) |
---|
323 | { |
---|
324 | void* tmp = res->data; |
---|
325 | res->data=(void *)a->CopyD(STRING_CMD); |
---|
326 | jiAssignAttr(res,a); |
---|
327 | omfree(tmp); |
---|
328 | } |
---|
329 | else |
---|
330 | { |
---|
331 | char *s=(char *)res->data; |
---|
332 | if ((e->start>0)&&(e->start<=(int)strlen(s))) |
---|
333 | s[e->start-1]=(char)(*((char *)a->Data())); |
---|
334 | else |
---|
335 | { |
---|
336 | Werror("string index %d out of range 1..%d",e->start,strlen(s)); |
---|
337 | return TRUE; |
---|
338 | } |
---|
339 | } |
---|
340 | return FALSE; |
---|
341 | } |
---|
342 | static BOOLEAN jiA_PROC(leftv res, leftv a, Subexpr e) |
---|
343 | { |
---|
344 | extern procinfo *iiInitSingularProcinfo(procinfo *pi, char *libname, |
---|
345 | char *procname, int line, |
---|
346 | long pos, BOOLEAN pstatic=FALSE); |
---|
347 | extern void piCleanUp(procinfov pi); |
---|
348 | |
---|
349 | if(res->data!=NULL) piCleanUp((procinfo *)res->data); |
---|
350 | if(a->rtyp==STRING_CMD) |
---|
351 | { |
---|
352 | res->data = (void *)omAlloc0Bin(procinfo_bin); |
---|
353 | ((procinfo *)(res->data))->language=LANG_NONE; |
---|
354 | iiInitSingularProcinfo((procinfo *)res->data,"",res->name,0,0); |
---|
355 | ((procinfo *)res->data)->data.s.body=(char *)a->CopyD(STRING_CMD); |
---|
356 | } |
---|
357 | else |
---|
358 | res->data=(void *)a->CopyD(PROC_CMD); |
---|
359 | jiAssignAttr(res,a); |
---|
360 | return FALSE; |
---|
361 | } |
---|
362 | static BOOLEAN jiA_INTVEC(leftv res, leftv a, Subexpr e) |
---|
363 | { |
---|
364 | if (res->data!=NULL) delete ((intvec *)res->data); |
---|
365 | res->data=(void *)a->CopyD(INTVEC_CMD); |
---|
366 | jiAssignAttr(res,a); |
---|
367 | return FALSE; |
---|
368 | } |
---|
369 | static BOOLEAN jiA_IDEAL(leftv res, leftv a, Subexpr e) |
---|
370 | { |
---|
371 | if (res->data!=NULL) idDelete((ideal*)&res->data); |
---|
372 | res->data=(void *)a->CopyD(MATRIX_CMD); |
---|
373 | idNormalize((ideal)res->data); |
---|
374 | jiAssignAttr(res,a); |
---|
375 | return FALSE; |
---|
376 | } |
---|
377 | static BOOLEAN jiA_RESOLUTION(leftv res, leftv a, Subexpr e) |
---|
378 | { |
---|
379 | if (res->data!=NULL) syKillComputation((syStrategy)res->data); |
---|
380 | res->data=(void *)a->CopyD(RESOLUTION_CMD); |
---|
381 | jiAssignAttr(res,a); |
---|
382 | return FALSE; |
---|
383 | } |
---|
384 | static BOOLEAN jiA_MODUL_P(leftv res, leftv a, Subexpr e) |
---|
385 | { |
---|
386 | if (res->data!=NULL) idDelete((ideal*)&res->data); |
---|
387 | ideal I=idInit(1,1); |
---|
388 | I->m[0]=(poly)a->CopyD(POLY_CMD); |
---|
389 | if (I->m[0]!=NULL) pSetCompP(I->m[0],1); |
---|
390 | pNormalize(I->m[0]); |
---|
391 | res->data=(void *)I; |
---|
392 | return FALSE; |
---|
393 | } |
---|
394 | static BOOLEAN jiA_IDEAL_M(leftv res, leftv a, Subexpr e) |
---|
395 | { |
---|
396 | if (res->data!=NULL) idDelete((ideal*)&res->data); |
---|
397 | matrix m=(matrix)a->CopyD(MATRIX_CMD); |
---|
398 | IDELEMS((ideal)m)=MATROWS(m)*MATCOLS(m); |
---|
399 | ((ideal)m)->rank=1; |
---|
400 | MATROWS(m)=1; |
---|
401 | idNormalize((ideal)m); |
---|
402 | res->data=(void *)m; |
---|
403 | return FALSE; |
---|
404 | } |
---|
405 | static BOOLEAN jiA_LINK(leftv res, leftv a, Subexpr e) |
---|
406 | { |
---|
407 | si_link l=(si_link)res->data; |
---|
408 | |
---|
409 | if (l!=NULL) slCleanUp(l); |
---|
410 | |
---|
411 | if (a->Typ() == STRING_CMD) |
---|
412 | { |
---|
413 | if (l == NULL) |
---|
414 | { |
---|
415 | l = (si_link) omAlloc0Bin(sip_link_bin); |
---|
416 | res->data = (void *) l; |
---|
417 | } |
---|
418 | return slInit(l, (char *) a->Data()); |
---|
419 | } |
---|
420 | else if (a->Typ() == LINK_CMD) |
---|
421 | { |
---|
422 | if (l != NULL) omFreeBin(l, sip_link_bin); |
---|
423 | res->data = slCopy((si_link)a->Data()); |
---|
424 | return FALSE; |
---|
425 | } |
---|
426 | return TRUE; |
---|
427 | } |
---|
428 | // assign map -> map |
---|
429 | static BOOLEAN jiA_MAP(leftv res, leftv a, Subexpr e) |
---|
430 | { |
---|
431 | if (res->data!=NULL) |
---|
432 | { |
---|
433 | omFree((ADDRESS)((map)res->data)->preimage); |
---|
434 | ((map)res->data)->preimage=NULL; |
---|
435 | idDelete((ideal*)&res->data); |
---|
436 | } |
---|
437 | res->data=(void *)a->CopyD(MAP_CMD); |
---|
438 | jiAssignAttr(res,a); |
---|
439 | return FALSE; |
---|
440 | } |
---|
441 | // assign ideal -> map |
---|
442 | static BOOLEAN jiA_MAP_ID(leftv res, leftv a, Subexpr e) |
---|
443 | { |
---|
444 | map f=(map)res->data; |
---|
445 | char *rn=f->preimage; // save the old/already assigned preimage ring name |
---|
446 | f->preimage=NULL; |
---|
447 | idDelete((ideal *)&f); |
---|
448 | res->data=(void *)a->CopyD(IDEAL_CMD); |
---|
449 | f=(map)res->data; |
---|
450 | idNormalize((ideal)f); |
---|
451 | f->preimage = rn; |
---|
452 | return FALSE; |
---|
453 | } |
---|
454 | static BOOLEAN jiA_QRING(leftv res, leftv a,Subexpr e) |
---|
455 | { |
---|
456 | // the follwing can only happen, if: |
---|
457 | // - the left side is of type qring AND not an id |
---|
458 | if ((e!=NULL)||(res->rtyp!=IDHDL)) |
---|
459 | { |
---|
460 | WerrorS("qring_id expected"); |
---|
461 | return TRUE; |
---|
462 | } |
---|
463 | ring qr; |
---|
464 | int i,j; |
---|
465 | int *pi; |
---|
466 | |
---|
467 | assumeStdFlag(a); |
---|
468 | #ifdef HAVE_PLURAL |
---|
469 | if (!hasFlag(a,FLAG_TWOSTD)) |
---|
470 | { |
---|
471 | Warn("%s is no twosided standard basis",a->Name()); |
---|
472 | } |
---|
473 | #endif |
---|
474 | qr=(ring)res->Data(); |
---|
475 | ring qrr=rCopy(currRing); |
---|
476 | memcpy4(qr,qrr,sizeof(ip_sring)); |
---|
477 | omFreeBin((ADDRESS)qrr, ip_sring_bin); |
---|
478 | if (qr->qideal!=NULL) idDelete(&qr->qideal); |
---|
479 | qr->qideal = (ideal)a->CopyD(IDEAL_CMD); |
---|
480 | //currRing=qr; |
---|
481 | //currRingHdl=(idhdl)res->data; |
---|
482 | //currQuotient=qr->qideal; |
---|
483 | rSetHdl((idhdl)res->data); |
---|
484 | return FALSE; |
---|
485 | } |
---|
486 | static BOOLEAN jiA_RING(leftv res, leftv a, Subexpr e) |
---|
487 | { |
---|
488 | BOOLEAN have_id=TRUE; |
---|
489 | if ((e!=NULL)||(res->rtyp!=IDHDL)) |
---|
490 | { |
---|
491 | //WerrorS("id expected"); |
---|
492 | //return TRUE; |
---|
493 | have_id=FALSE; |
---|
494 | } |
---|
495 | ring r=(ring)a->Data(); |
---|
496 | if (have_id) |
---|
497 | { |
---|
498 | idhdl rl=(idhdl)res->data; |
---|
499 | if (&IDRING(rl)!=NULL) rKill(rl); |
---|
500 | IDRING(rl)=r; |
---|
501 | if ((IDLEV((idhdl)a->data)!=myynest) && (r==currRing)) |
---|
502 | currRingHdl=(idhdl)res->data; |
---|
503 | } |
---|
504 | else |
---|
505 | { |
---|
506 | if (e==NULL) res->data=(char *)r; |
---|
507 | else |
---|
508 | { |
---|
509 | WerrorS("id expected"); |
---|
510 | return TRUE; |
---|
511 | } |
---|
512 | } |
---|
513 | r->ref++; |
---|
514 | return FALSE; |
---|
515 | } |
---|
516 | static BOOLEAN jiA_PACKAGE(leftv res, leftv a, Subexpr e) |
---|
517 | { |
---|
518 | res->data=(void *)a->CopyD(PACKAGE_CMD); |
---|
519 | jiAssignAttr(res,a); |
---|
520 | return FALSE; |
---|
521 | } |
---|
522 | /*=================== table =================*/ |
---|
523 | struct sValAssign dAssign[]= |
---|
524 | { |
---|
525 | // proc res arg |
---|
526 | {jiA_IDEAL, IDEAL_CMD, IDEAL_CMD } |
---|
527 | ,{jiA_IDEAL_M, IDEAL_CMD, MATRIX_CMD } |
---|
528 | ,{jiA_RESOLUTION,RESOLUTION_CMD,RESOLUTION_CMD } |
---|
529 | ,{jiA_INT, INT_CMD, INT_CMD } |
---|
530 | ,{jiA_IDEAL, MATRIX_CMD, MATRIX_CMD } |
---|
531 | ,{jiA_MAP_ID, MAP_CMD, IDEAL_CMD } |
---|
532 | ,{jiA_MAP, MAP_CMD, MAP_CMD } |
---|
533 | ,{jiA_IDEAL, MODUL_CMD, MODUL_CMD } |
---|
534 | ,{jiA_MODUL_P, MODUL_CMD, POLY_CMD } |
---|
535 | ,{jiA_POLY, POLY_CMD, POLY_CMD } |
---|
536 | ,{jiA_1x1MATRIX,POLY_CMD, MATRIX_CMD } |
---|
537 | ,{jiA_QRING, QRING_CMD, IDEAL_CMD } |
---|
538 | ,{jiA_RING, RING_CMD, RING_CMD } |
---|
539 | ,{jiA_RING, QRING_CMD, QRING_CMD } |
---|
540 | ,{jiA_STRING, STRING_CMD, STRING_CMD } |
---|
541 | ,{jiA_PROC, PROC_CMD, STRING_CMD } |
---|
542 | ,{jiA_PROC, PROC_CMD, PROC_CMD } |
---|
543 | ,{jiA_POLY, VECTOR_CMD, VECTOR_CMD } |
---|
544 | ,{jiA_INTVEC, INTVEC_CMD, INTVEC_CMD } |
---|
545 | ,{jiA_INTVEC, INTMAT_CMD, INTMAT_CMD } |
---|
546 | ,{jiA_NUMBER, NUMBER_CMD, NUMBER_CMD } |
---|
547 | ,{jiA_LIST_RES, LIST_CMD, RESOLUTION_CMD } |
---|
548 | ,{jiA_LIST, LIST_CMD, LIST_CMD } |
---|
549 | ,{jiA_LINK, LINK_CMD, STRING_CMD } |
---|
550 | ,{jiA_LINK, LINK_CMD, LINK_CMD } |
---|
551 | ,{jiA_PACKAGE, PACKAGE_CMD, PACKAGE_CMD } |
---|
552 | ,{NULL, 0, 0 } |
---|
553 | }; |
---|
554 | struct sValAssign_sys dAssign_sys[]= |
---|
555 | { |
---|
556 | // sysvars: |
---|
557 | {jjECHO, VECHO, INT_CMD } |
---|
558 | ,{jjPAGELENGTH, VPAGELENGTH, INT_CMD } |
---|
559 | ,{jjPRINTLEVEL, VPRINTLEVEL, INT_CMD } |
---|
560 | ,{jjCOLMAX, VCOLMAX, INT_CMD } |
---|
561 | ,{jjTIMER, VTIMER, INT_CMD } |
---|
562 | #ifdef HAVE_RTIMER |
---|
563 | ,{jjRTIMER, VRTIMER, INT_CMD } |
---|
564 | #endif |
---|
565 | ,{jjMAXDEG, VMAXDEG, INT_CMD } |
---|
566 | ,{jjMAXMULT, VMAXMULT, INT_CMD } |
---|
567 | ,{jjTRACE, TRACE, INT_CMD } |
---|
568 | ,{jjSHORTOUT, VSHORTOUT, INT_CMD } |
---|
569 | ,{jjMINPOLY, VMINPOLY, NUMBER_CMD } |
---|
570 | ,{jjNOETHER, VNOETHER, POLY_CMD } |
---|
571 | ,{NULL, 0, 0 } |
---|
572 | }; |
---|
573 | /*=================== operations ============================*/ |
---|
574 | /*2 |
---|
575 | * assign a = b |
---|
576 | */ |
---|
577 | static BOOLEAN jiAssign_1(leftv l, leftv r) |
---|
578 | { |
---|
579 | int rt=r->Typ(); |
---|
580 | if (rt==0) |
---|
581 | { |
---|
582 | if (!errorreported) Werror("`%s` is undefined",r->Fullname()); |
---|
583 | return TRUE; |
---|
584 | } |
---|
585 | |
---|
586 | int lt=l->Typ(); |
---|
587 | if((lt==0)/*&&(l->name!=NULL)*/) |
---|
588 | { |
---|
589 | if (!errorreported) Werror("left side `%s` is undefined",l->Fullname()); |
---|
590 | return TRUE; |
---|
591 | } |
---|
592 | if((rt==DEF_CMD)||(rt==NONE)) |
---|
593 | { |
---|
594 | WarnS("right side is not a datum, assignment ignored"); |
---|
595 | // if (!errorreported) |
---|
596 | // WerrorS("right side is not a datum"); |
---|
597 | //return TRUE; |
---|
598 | return FALSE; |
---|
599 | } |
---|
600 | |
---|
601 | int i=0; |
---|
602 | BOOLEAN nok=FALSE; |
---|
603 | |
---|
604 | if (lt==DEF_CMD) |
---|
605 | { |
---|
606 | if (l->rtyp==IDHDL) |
---|
607 | { |
---|
608 | IDTYP((idhdl)l->data)=rt; |
---|
609 | } |
---|
610 | else if (l->name!=NULL) |
---|
611 | { |
---|
612 | sleftv ll; |
---|
613 | iiDeclCommand(&ll,l,myynest,rt,&IDROOT); |
---|
614 | memcpy(l,&ll,sizeof(sleftv)); |
---|
615 | } |
---|
616 | else |
---|
617 | { |
---|
618 | l->rtyp=rt; |
---|
619 | } |
---|
620 | lt=rt; |
---|
621 | } |
---|
622 | else |
---|
623 | { |
---|
624 | if ((l->data==r->data)&&(l->e==NULL)&&(r->e==NULL)) |
---|
625 | return FALSE; |
---|
626 | } |
---|
627 | leftv ld=l; |
---|
628 | if ((l->rtyp==IDHDL)&&(lt!=QRING_CMD)&&(lt!=RING_CMD)) |
---|
629 | ld=(leftv)l->data; |
---|
630 | while (((dAssign[i].res!=lt) |
---|
631 | || (dAssign[i].arg!=rt)) |
---|
632 | && (dAssign[i].res!=0)) i++; |
---|
633 | if (dAssign[i].res!=0) |
---|
634 | { |
---|
635 | BOOLEAN b; |
---|
636 | b=dAssign[i].p(ld,r,l->e); |
---|
637 | if(l!=ld) /* i.e. l is IDHDL, l->data is ld */ |
---|
638 | { |
---|
639 | l->flag=ld->flag; |
---|
640 | l->attribute=ld->attribute; |
---|
641 | } |
---|
642 | return b; |
---|
643 | } |
---|
644 | // implicite type conversion ---------------------------------------------- |
---|
645 | if (dAssign[i].res==0) |
---|
646 | { |
---|
647 | int ri; |
---|
648 | leftv rn = (leftv)omAlloc0Bin(sleftv_bin); |
---|
649 | BOOLEAN failed=FALSE; |
---|
650 | i=0; |
---|
651 | while ((dAssign[i].res!=lt) |
---|
652 | && (dAssign[i].res!=0)) i++; |
---|
653 | while (dAssign[i].res==lt) |
---|
654 | { |
---|
655 | if ((ri=iiTestConvert(rt,dAssign[i].arg))!=0) |
---|
656 | { |
---|
657 | failed= iiConvert(rt,dAssign[i].arg,ri,r,rn); |
---|
658 | if(!failed) |
---|
659 | { |
---|
660 | failed= dAssign[i].p(ld,rn,l->e); |
---|
661 | } |
---|
662 | // everything done, clean up temp. variables |
---|
663 | rn->CleanUp(); |
---|
664 | omFreeBin((ADDRESS)rn, sleftv_bin); |
---|
665 | if (failed) |
---|
666 | { |
---|
667 | // leave loop, goto error handling |
---|
668 | break; |
---|
669 | } |
---|
670 | else |
---|
671 | { |
---|
672 | if(l!=ld) /* i.e. l is IDHDL, l->data is ld */ |
---|
673 | { |
---|
674 | l->flag=ld->flag; |
---|
675 | l->attribute=ld->attribute; |
---|
676 | } |
---|
677 | // everything ok, return |
---|
678 | return FALSE; |
---|
679 | } |
---|
680 | } |
---|
681 | i++; |
---|
682 | } |
---|
683 | // error handling --------------------------------------------------- |
---|
684 | if (!errorreported) |
---|
685 | { |
---|
686 | Werror("`%s` = `%s` is not supported" |
---|
687 | ,Tok2Cmdname(lt),Tok2Cmdname(rt)); |
---|
688 | if (BVERBOSE(V_SHOW_USE)) |
---|
689 | { |
---|
690 | i=0; |
---|
691 | while ((dAssign[i].res!=lt) |
---|
692 | && (dAssign[i].res!=0)) i++; |
---|
693 | while (dAssign[i].res==lt) |
---|
694 | { |
---|
695 | Werror("expected `%s` = `%s`" |
---|
696 | ,Tok2Cmdname(lt),Tok2Cmdname(dAssign[i].arg)); |
---|
697 | i++; |
---|
698 | } |
---|
699 | } |
---|
700 | } |
---|
701 | } |
---|
702 | return TRUE; |
---|
703 | } |
---|
704 | /*2 |
---|
705 | * assign sys_var = val |
---|
706 | */ |
---|
707 | static BOOLEAN iiAssign_sys(leftv l, leftv r) |
---|
708 | { |
---|
709 | int rt=r->Typ(); |
---|
710 | |
---|
711 | if (rt==0) |
---|
712 | { |
---|
713 | if (!errorreported) Werror("`%s` is undefined",r->Fullname()); |
---|
714 | return TRUE; |
---|
715 | } |
---|
716 | int i=0; |
---|
717 | int lt=l->rtyp; |
---|
718 | while (((dAssign_sys[i].res!=lt) |
---|
719 | || (dAssign_sys[i].arg!=rt)) |
---|
720 | && (dAssign_sys[i].res!=0)) i++; |
---|
721 | if (dAssign_sys[i].res!=0) |
---|
722 | { |
---|
723 | if (!dAssign_sys[i].p(l,r)) |
---|
724 | { |
---|
725 | // everything ok, clean up |
---|
726 | return FALSE; |
---|
727 | } |
---|
728 | } |
---|
729 | // implicite type conversion ---------------------------------------------- |
---|
730 | if (dAssign_sys[i].res==0) |
---|
731 | { |
---|
732 | int ri; |
---|
733 | leftv rn = (leftv)omAlloc0Bin(sleftv_bin); |
---|
734 | BOOLEAN failed=FALSE; |
---|
735 | i=0; |
---|
736 | while ((dAssign_sys[i].res!=lt) |
---|
737 | && (dAssign_sys[i].res!=0)) i++; |
---|
738 | while (dAssign_sys[i].res==lt) |
---|
739 | { |
---|
740 | if ((ri=iiTestConvert(rt,dAssign_sys[i].arg))!=0) |
---|
741 | { |
---|
742 | failed= ((iiConvert(rt,dAssign_sys[i].arg,ri,r,rn)) |
---|
743 | || (dAssign_sys[i].p(l,rn))); |
---|
744 | // everything done, clean up temp. variables |
---|
745 | rn->CleanUp(); |
---|
746 | omFreeBin((ADDRESS)rn, sleftv_bin); |
---|
747 | if (failed) |
---|
748 | { |
---|
749 | // leave loop, goto error handling |
---|
750 | break; |
---|
751 | } |
---|
752 | else |
---|
753 | { |
---|
754 | // everything ok, return |
---|
755 | return FALSE; |
---|
756 | } |
---|
757 | } |
---|
758 | i++; |
---|
759 | } |
---|
760 | // error handling --------------------------------------------------- |
---|
761 | if(!errorreported) |
---|
762 | { |
---|
763 | Werror("`%s` = `%s` is not supported" |
---|
764 | ,Tok2Cmdname(lt),Tok2Cmdname(rt)); |
---|
765 | if (BVERBOSE(V_SHOW_USE)) |
---|
766 | { |
---|
767 | i=0; |
---|
768 | while ((dAssign_sys[i].res!=lt) |
---|
769 | && (dAssign_sys[i].res!=0)) i++; |
---|
770 | while (dAssign_sys[i].res==lt) |
---|
771 | { |
---|
772 | Werror("expected `%s` = `%s`" |
---|
773 | ,Tok2Cmdname(lt),Tok2Cmdname(dAssign_sys[i].arg)); |
---|
774 | i++; |
---|
775 | } |
---|
776 | } |
---|
777 | } |
---|
778 | } |
---|
779 | return TRUE; |
---|
780 | } |
---|
781 | static BOOLEAN jiA_INTVEC_L(leftv l,leftv r) |
---|
782 | { |
---|
783 | /* right side is intvec, left side is list (of int)*/ |
---|
784 | BOOLEAN nok; |
---|
785 | int i=0; |
---|
786 | leftv l1=l; |
---|
787 | leftv h; |
---|
788 | sleftv t; |
---|
789 | intvec *iv=(intvec *)r->Data(); |
---|
790 | memset(&t,0,sizeof(sleftv)); |
---|
791 | t.rtyp=INT_CMD; |
---|
792 | while ((i<iv->length())&&(l!=NULL)) |
---|
793 | { |
---|
794 | t.data=(char *)(*iv)[i]; |
---|
795 | h=l->next; |
---|
796 | l->next=NULL; |
---|
797 | nok=jiAssign_1(l,&t); |
---|
798 | if (nok) return TRUE; |
---|
799 | i++; |
---|
800 | l=h; |
---|
801 | } |
---|
802 | l1->CleanUp(); |
---|
803 | r->CleanUp(); |
---|
804 | return FALSE; |
---|
805 | } |
---|
806 | static BOOLEAN jiA_VECTOR_L(leftv l,leftv r) |
---|
807 | { |
---|
808 | /* right side is vector, left side is list (of poly)*/ |
---|
809 | BOOLEAN nok; |
---|
810 | leftv l1=l; |
---|
811 | ideal I=idVec2Ideal((poly)r->Data()); |
---|
812 | leftv h; |
---|
813 | sleftv t; |
---|
814 | int i=0; |
---|
815 | while (l!=NULL) |
---|
816 | { |
---|
817 | memset(&t,0,sizeof(sleftv)); |
---|
818 | t.rtyp=POLY_CMD; |
---|
819 | if (i>=IDELEMS(I)) |
---|
820 | { |
---|
821 | t.data=NULL; |
---|
822 | } |
---|
823 | else |
---|
824 | { |
---|
825 | t.data=(char *)I->m[i]; |
---|
826 | I->m[i]=NULL; |
---|
827 | } |
---|
828 | h=l->next; |
---|
829 | l->next=NULL; |
---|
830 | nok=jiAssign_1(l,&t); |
---|
831 | t.CleanUp(); |
---|
832 | if (nok) |
---|
833 | { |
---|
834 | idDelete(&I); |
---|
835 | return TRUE; |
---|
836 | } |
---|
837 | i++; |
---|
838 | l=h; |
---|
839 | } |
---|
840 | idDelete(&I); |
---|
841 | l1->CleanUp(); |
---|
842 | r->CleanUp(); |
---|
843 | return FALSE; |
---|
844 | } |
---|
845 | static BOOLEAN jjA_L_LIST(leftv l, leftv r) |
---|
846 | /* left side: list, has to be a "real" variable |
---|
847 | * right side: expression list |
---|
848 | */ |
---|
849 | { |
---|
850 | int sl = r->listLength(); |
---|
851 | lists L=(lists)omAllocBin(slists_bin); |
---|
852 | lists oldL; |
---|
853 | leftv h=NULL,o_r=r; |
---|
854 | int i; |
---|
855 | int rt; |
---|
856 | |
---|
857 | L->Init(sl); |
---|
858 | for (i=0;i<sl;i++) |
---|
859 | { |
---|
860 | if (h!=NULL) { /* e.g. not in the first step: |
---|
861 | * h is the pointer to the old sleftv, |
---|
862 | * r is the pointer to the next sleftv |
---|
863 | * (in this moment) */ |
---|
864 | h->next=r; |
---|
865 | } |
---|
866 | h=r; |
---|
867 | r=r->next; |
---|
868 | h->next=NULL; |
---|
869 | rt=h->Typ(); |
---|
870 | if ((rt==0)||(rt==NONE)||(rt==DEF_CMD)) |
---|
871 | { |
---|
872 | L->Clean(); |
---|
873 | Werror("`%s` is undefined",h->Fullname()); |
---|
874 | //listall(); |
---|
875 | goto err; |
---|
876 | } |
---|
877 | //if ((rt==RING_CMD)||(rt==QRING_CMD)) |
---|
878 | //{ |
---|
879 | // L->m[i].rtyp=rt; |
---|
880 | // L->m[i].data=h->Data(); |
---|
881 | // ((ring)L->m[i].data)->ref++; |
---|
882 | //} |
---|
883 | //else |
---|
884 | L->m[i].Copy(h); |
---|
885 | if(errorreported) |
---|
886 | { |
---|
887 | L->Clean(); |
---|
888 | goto err; |
---|
889 | } |
---|
890 | } |
---|
891 | oldL=(lists)l->Data(); oldL->Clean(); |
---|
892 | if (l->rtyp==IDHDL) |
---|
893 | { |
---|
894 | IDLIST((idhdl)l->data)=L; |
---|
895 | ipMoveId((idhdl)l->data); |
---|
896 | } |
---|
897 | else |
---|
898 | { |
---|
899 | l->LData()->data=L; |
---|
900 | } |
---|
901 | err: |
---|
902 | o_r->CleanUp(); |
---|
903 | return errorreported; |
---|
904 | } |
---|
905 | static BOOLEAN jjA_L_INTVEC(leftv l,leftv r,intvec *iv) |
---|
906 | { |
---|
907 | /* left side is intvec/intmat, right side is list (of int,intvec,intmat)*/ |
---|
908 | leftv hh=r; |
---|
909 | int i = 0; |
---|
910 | while (hh!=NULL) |
---|
911 | { |
---|
912 | if (i>=iv->length()) break; |
---|
913 | if (hh->Typ() == INT_CMD) |
---|
914 | { |
---|
915 | (*iv)[i++] = (int)(hh->Data()); |
---|
916 | } |
---|
917 | else if ((hh->Typ() == INTVEC_CMD) |
---|
918 | ||(hh->Typ() == INTMAT_CMD)) |
---|
919 | { |
---|
920 | intvec *ivv = (intvec *)(hh->Data()); |
---|
921 | int ll = 0,l = min(ivv->length(),iv->length()); |
---|
922 | for (; l>0; l--) |
---|
923 | { |
---|
924 | (*iv)[i++] = (*ivv)[ll++]; |
---|
925 | } |
---|
926 | } |
---|
927 | else |
---|
928 | { |
---|
929 | delete iv; |
---|
930 | return TRUE; |
---|
931 | } |
---|
932 | hh = hh->next; |
---|
933 | } |
---|
934 | if (IDINTVEC((idhdl)l->data)!=NULL) delete IDINTVEC((idhdl)l->data); |
---|
935 | IDINTVEC((idhdl)l->data)=iv; |
---|
936 | return FALSE; |
---|
937 | } |
---|
938 | static BOOLEAN jjA_L_STRING(leftv l,leftv r) |
---|
939 | { |
---|
940 | /* left side is string, right side is list of string*/ |
---|
941 | leftv hh=r; |
---|
942 | int sl = 1; |
---|
943 | char *s; |
---|
944 | char *t; |
---|
945 | int tl; |
---|
946 | /* find the length */ |
---|
947 | while (hh!=NULL) |
---|
948 | { |
---|
949 | if (hh->Typ()!= STRING_CMD) |
---|
950 | { |
---|
951 | return TRUE; |
---|
952 | } |
---|
953 | sl += strlen((char *)hh->Data()); |
---|
954 | hh = hh->next; |
---|
955 | } |
---|
956 | s = (char * )omAlloc(sl); |
---|
957 | sl=0; |
---|
958 | hh = r; |
---|
959 | while (hh!=NULL) |
---|
960 | { |
---|
961 | t=(char *)hh->Data(); |
---|
962 | tl=strlen(t); |
---|
963 | memcpy(s+sl,t,tl); |
---|
964 | sl+=tl; |
---|
965 | hh = hh->next; |
---|
966 | } |
---|
967 | s[sl]='\0'; |
---|
968 | omFree((ADDRESS)IDDATA((idhdl)(l->data))); |
---|
969 | IDDATA((idhdl)(l->data))=s; |
---|
970 | return FALSE; |
---|
971 | } |
---|
972 | static BOOLEAN jjA_LIST_L(leftv l,leftv r) |
---|
973 | { |
---|
974 | /*left side are something, right side are lists*/ |
---|
975 | /*e.g. a,b,c=l */ |
---|
976 | //int ll=l->listLength(); |
---|
977 | if (l->listLength()==1) return jiAssign_1(l,r); |
---|
978 | BOOLEAN nok; |
---|
979 | sleftv t; |
---|
980 | leftv h; |
---|
981 | lists L=(lists)r->Data(); |
---|
982 | int rl=L->nr; |
---|
983 | int i=0; |
---|
984 | |
---|
985 | memset(&t,0,sizeof(sleftv)); |
---|
986 | while ((i<=rl)&&(l!=NULL)) |
---|
987 | { |
---|
988 | memset(&t,0,sizeof(sleftv)); |
---|
989 | t.Copy(&L->m[i]); |
---|
990 | h=l->next; |
---|
991 | l->next=NULL; |
---|
992 | nok=jiAssign_1(l,&t); |
---|
993 | if (nok) return TRUE; |
---|
994 | i++; |
---|
995 | l=h; |
---|
996 | } |
---|
997 | r->CleanUp(); |
---|
998 | return FALSE; |
---|
999 | } |
---|
1000 | static BOOLEAN jiA_MATRIX_L(leftv l,leftv r) |
---|
1001 | { |
---|
1002 | /* right side is matrix, left side is list (of poly)*/ |
---|
1003 | BOOLEAN nok=FALSE; |
---|
1004 | int i; |
---|
1005 | matrix m=(matrix)r->CopyD(MATRIX_CMD); |
---|
1006 | leftv h; |
---|
1007 | leftv ol=l; |
---|
1008 | leftv o_r=r; |
---|
1009 | sleftv t; |
---|
1010 | memset(&t,0,sizeof(sleftv)); |
---|
1011 | t.rtyp=POLY_CMD; |
---|
1012 | loop |
---|
1013 | { |
---|
1014 | i=0; |
---|
1015 | while ((i<MATROWS(m)*MATCOLS(m))&&(l!=NULL)) |
---|
1016 | { |
---|
1017 | t.data=(char *)m->m[i]; |
---|
1018 | m->m[i]=NULL; |
---|
1019 | h=l->next; |
---|
1020 | l->next=NULL; |
---|
1021 | nok=jiAssign_1(l,&t); |
---|
1022 | l->next=h; |
---|
1023 | if (nok) |
---|
1024 | { |
---|
1025 | idDelete((ideal *)&m); |
---|
1026 | goto ende; |
---|
1027 | } |
---|
1028 | i++; |
---|
1029 | l=h; |
---|
1030 | } |
---|
1031 | idDelete((ideal *)&m); |
---|
1032 | h=r; |
---|
1033 | r=r->next; |
---|
1034 | if (l==NULL) |
---|
1035 | { |
---|
1036 | if (r!=NULL) |
---|
1037 | { |
---|
1038 | Warn("list length mismatch in assign (l>r)"); |
---|
1039 | nok=TRUE; |
---|
1040 | } |
---|
1041 | break; |
---|
1042 | } |
---|
1043 | else if (r==NULL) |
---|
1044 | { |
---|
1045 | Warn("list length mismatch in assign (l<r)"); |
---|
1046 | nok=TRUE; |
---|
1047 | break; |
---|
1048 | } |
---|
1049 | if ((r->Typ()==IDEAL_CMD)||(r->Typ()==MATRIX_CMD)) |
---|
1050 | m=(matrix)r->CopyD(MATRIX_CMD); |
---|
1051 | else if (r->Typ()==POLY_CMD) |
---|
1052 | { |
---|
1053 | m=mpNew(1,1); |
---|
1054 | MATELEM(m,1,1)=(poly)r->CopyD(POLY_CMD); |
---|
1055 | pNormalize(MATELEM(m,1,1)); |
---|
1056 | } |
---|
1057 | else |
---|
1058 | { |
---|
1059 | nok=TRUE; |
---|
1060 | break; |
---|
1061 | } |
---|
1062 | } |
---|
1063 | ende: |
---|
1064 | o_r->CleanUp(); |
---|
1065 | ol->CleanUp(); |
---|
1066 | return nok; |
---|
1067 | } |
---|
1068 | static BOOLEAN jiA_STRING_L(leftv l,leftv r) |
---|
1069 | { |
---|
1070 | /*left side are strings, right side is a string*/ |
---|
1071 | /*e.g. s[2..3]="12" */ |
---|
1072 | /*the case s=t[1..4] is handled in iiAssign, |
---|
1073 | * the case s[2..3]=t[3..4] is handled in iiAssgn_rec*/ |
---|
1074 | int ll=l->listLength(); |
---|
1075 | int rl=r->listLength(); |
---|
1076 | BOOLEAN nok=FALSE; |
---|
1077 | sleftv t; |
---|
1078 | leftv h,l1=l; |
---|
1079 | int i=0; |
---|
1080 | char *ss; |
---|
1081 | char *s=(char *)r->Data(); |
---|
1082 | int sl=strlen(s); |
---|
1083 | |
---|
1084 | memset(&t,0,sizeof(sleftv)); |
---|
1085 | t.rtyp=STRING_CMD; |
---|
1086 | while ((i<sl)&&(l!=NULL)) |
---|
1087 | { |
---|
1088 | ss=(char *)omAlloc(2); |
---|
1089 | ss[1]='\0'; |
---|
1090 | ss[0]=s[i]; |
---|
1091 | t.data=ss; |
---|
1092 | h=l->next; |
---|
1093 | l->next=NULL; |
---|
1094 | nok=jiAssign_1(l,&t); |
---|
1095 | if (nok) |
---|
1096 | { |
---|
1097 | break; |
---|
1098 | } |
---|
1099 | i++; |
---|
1100 | l=h; |
---|
1101 | } |
---|
1102 | r->CleanUp(); |
---|
1103 | l1->CleanUp(); |
---|
1104 | return nok; |
---|
1105 | } |
---|
1106 | static BOOLEAN jiAssign_list(leftv l, leftv r) |
---|
1107 | { |
---|
1108 | int i=l->e->start-1; |
---|
1109 | if (i<0) |
---|
1110 | { |
---|
1111 | Werror("index[%d] must be positive",i+1); |
---|
1112 | return TRUE; |
---|
1113 | } |
---|
1114 | if(l->attribute!=NULL) |
---|
1115 | { |
---|
1116 | atKillAll((idhdl)l); |
---|
1117 | l->attribute=NULL; |
---|
1118 | } |
---|
1119 | l->flag=0; |
---|
1120 | lists li; |
---|
1121 | if (l->rtyp==IDHDL) |
---|
1122 | { |
---|
1123 | li=IDLIST((idhdl)l->data); |
---|
1124 | } |
---|
1125 | else |
---|
1126 | { |
---|
1127 | li=(lists)l->data; |
---|
1128 | } |
---|
1129 | if (i>li->nr) |
---|
1130 | { |
---|
1131 | li->m=(leftv)omreallocSize(li->m,(li->nr+1)*sizeof(sleftv),(i+1)*sizeof(sleftv)); |
---|
1132 | memset(&(li->m[li->nr+1]),0,(i-li->nr)*sizeof(sleftv)); |
---|
1133 | int j=li->nr+1; |
---|
1134 | for(;j<=i;j++) |
---|
1135 | li->m[j].rtyp=DEF_CMD; |
---|
1136 | li->nr=i; |
---|
1137 | } |
---|
1138 | leftv ld=&(li->m[i]); |
---|
1139 | ld->e=l->e->next; |
---|
1140 | BOOLEAN b; |
---|
1141 | if ((ld->rtyp!=LIST_CMD) |
---|
1142 | &&(ld->e==NULL) |
---|
1143 | &&(ld->Typ()!=r->Typ())) |
---|
1144 | { |
---|
1145 | sleftv tmp; |
---|
1146 | memset(&tmp,0,sizeof(sleftv)); |
---|
1147 | tmp.rtyp=DEF_CMD; |
---|
1148 | b=iiAssign(&tmp,r); |
---|
1149 | ld->CleanUp(); |
---|
1150 | memcpy(ld,&tmp,sizeof(sleftv)); |
---|
1151 | } |
---|
1152 | else |
---|
1153 | { |
---|
1154 | b=iiAssign(ld,r); |
---|
1155 | l->e->next=ld->e; |
---|
1156 | ld->e=NULL; |
---|
1157 | } |
---|
1158 | return b; |
---|
1159 | } |
---|
1160 | static BOOLEAN jiAssign_rec(leftv l, leftv r) |
---|
1161 | { |
---|
1162 | leftv l1=l; |
---|
1163 | leftv r1=r; |
---|
1164 | leftv lrest; |
---|
1165 | leftv rrest; |
---|
1166 | BOOLEAN b; |
---|
1167 | do |
---|
1168 | { |
---|
1169 | lrest=l->next; |
---|
1170 | rrest=r->next; |
---|
1171 | l->next=NULL; |
---|
1172 | r->next=NULL; |
---|
1173 | b=iiAssign(l,r); |
---|
1174 | l->next=lrest; |
---|
1175 | r->next=rrest; |
---|
1176 | l=lrest; |
---|
1177 | r=rrest; |
---|
1178 | } while ((!b)&&(l!=NULL)); |
---|
1179 | l1->CleanUp(); |
---|
1180 | r1->CleanUp(); |
---|
1181 | return b; |
---|
1182 | } |
---|
1183 | BOOLEAN iiAssign(leftv l, leftv r) |
---|
1184 | { |
---|
1185 | if (errorreported) return TRUE; |
---|
1186 | int ll=l->listLength(); |
---|
1187 | int rl; |
---|
1188 | int lt=l->Typ(); |
---|
1189 | int rt=NONE; |
---|
1190 | BOOLEAN b; |
---|
1191 | |
---|
1192 | if(l->attribute!=NULL) |
---|
1193 | { |
---|
1194 | if (l->rtyp==IDHDL) |
---|
1195 | { |
---|
1196 | atKillAll((idhdl)l->data); |
---|
1197 | l->attribute=NULL; |
---|
1198 | } |
---|
1199 | else |
---|
1200 | atKillAll((idhdl)l); |
---|
1201 | } |
---|
1202 | if(l->rtyp==IDHDL) |
---|
1203 | { |
---|
1204 | IDFLAG((idhdl)l->data)=0; |
---|
1205 | } |
---|
1206 | l->flag=0; |
---|
1207 | if (ll==1) |
---|
1208 | { |
---|
1209 | /* l[..] = ... */ |
---|
1210 | if((l->e!=NULL) |
---|
1211 | && (((l->rtyp==IDHDL) && (IDTYP((idhdl)l->data)==LIST_CMD)) |
---|
1212 | || (l->rtyp==LIST_CMD))) |
---|
1213 | { |
---|
1214 | b=jiAssign_list(l,r); |
---|
1215 | if(!b) |
---|
1216 | { |
---|
1217 | //Print("jjA_L_LIST: - 2 \n"); |
---|
1218 | if((l->rtyp==IDHDL) && (l->data!=NULL)) |
---|
1219 | { |
---|
1220 | ipMoveId((idhdl)l->data); |
---|
1221 | l->attribute=IDATTR((idhdl)l->data); |
---|
1222 | l->flag=IDFLAG((idhdl)l->data); |
---|
1223 | } |
---|
1224 | } |
---|
1225 | r->CleanUp(); |
---|
1226 | Subexpr h; |
---|
1227 | while (l->e!=NULL) |
---|
1228 | { |
---|
1229 | h=l->e->next; |
---|
1230 | omFreeBin((ADDRESS)l->e, sSubexpr_bin); |
---|
1231 | l->e=h; |
---|
1232 | } |
---|
1233 | return b; |
---|
1234 | } |
---|
1235 | rl=r->listLength(); |
---|
1236 | if (rl==1) |
---|
1237 | { |
---|
1238 | /* system variables = ... */ |
---|
1239 | if(((l->rtyp>=VECHO)&&(l->rtyp<=VPRINTLEVEL)) |
---|
1240 | ||((l->rtyp>=VALTVARS)&&(l->rtyp<=VMINPOLY))) |
---|
1241 | { |
---|
1242 | b=iiAssign_sys(l,r); |
---|
1243 | r->CleanUp(); |
---|
1244 | //l->CleanUp(); |
---|
1245 | return b; |
---|
1246 | } |
---|
1247 | rt=r->Typ(); |
---|
1248 | /* a = ... */ |
---|
1249 | if ((lt!=MATRIX_CMD) |
---|
1250 | &&(lt!=INTMAT_CMD) |
---|
1251 | &&((lt==rt)||(lt!=LIST_CMD))) |
---|
1252 | { |
---|
1253 | b=jiAssign_1(l,r); |
---|
1254 | if (l->rtyp==IDHDL) |
---|
1255 | { |
---|
1256 | if ((lt==DEF_CMD)||(lt==LIST_CMD)) |
---|
1257 | { |
---|
1258 | ipMoveId((idhdl)l->data); |
---|
1259 | } |
---|
1260 | l->attribute=IDATTR((idhdl)l->data); |
---|
1261 | l->flag=IDFLAG((idhdl)l->data); |
---|
1262 | l->CleanUp(); |
---|
1263 | } |
---|
1264 | r->CleanUp(); |
---|
1265 | return b; |
---|
1266 | } |
---|
1267 | if (((lt!=LIST_CMD) |
---|
1268 | &&((rt==MATRIX_CMD) |
---|
1269 | ||(rt==INTMAT_CMD) |
---|
1270 | ||(rt==INTVEC_CMD) |
---|
1271 | ||(rt==MODUL_CMD))) |
---|
1272 | ||((lt==LIST_CMD) |
---|
1273 | &&(rt==RESOLUTION_CMD)) |
---|
1274 | ) |
---|
1275 | { |
---|
1276 | b=jiAssign_1(l,r); |
---|
1277 | if((l->rtyp==IDHDL)&&(l->data!=NULL)) |
---|
1278 | { |
---|
1279 | if ((lt==DEF_CMD) || (lt==LIST_CMD)) |
---|
1280 | { |
---|
1281 | //Print("ipAssign - 3.0\n"); |
---|
1282 | ipMoveId((idhdl)l->data); |
---|
1283 | } |
---|
1284 | l->attribute=IDATTR((idhdl)l->data); |
---|
1285 | l->flag=IDFLAG((idhdl)l->data); |
---|
1286 | } |
---|
1287 | r->CleanUp(); |
---|
1288 | Subexpr h; |
---|
1289 | while (l->e!=NULL) |
---|
1290 | { |
---|
1291 | h=l->e->next; |
---|
1292 | omFreeBin((ADDRESS)l->e, sSubexpr_bin); |
---|
1293 | l->e=h; |
---|
1294 | } |
---|
1295 | return b; |
---|
1296 | } |
---|
1297 | } |
---|
1298 | if (rt==NONE) rt=r->Typ(); |
---|
1299 | } |
---|
1300 | else if (ll==(rl=r->listLength())) |
---|
1301 | { |
---|
1302 | b=jiAssign_rec(l,r); |
---|
1303 | return b; |
---|
1304 | } |
---|
1305 | else |
---|
1306 | { |
---|
1307 | if (rt==NONE) rt=r->Typ(); |
---|
1308 | if (rt==INTVEC_CMD) |
---|
1309 | return jiA_INTVEC_L(l,r); |
---|
1310 | else if (rt==VECTOR_CMD) |
---|
1311 | return jiA_VECTOR_L(l,r); |
---|
1312 | else if ((rt==IDEAL_CMD)||(rt==MATRIX_CMD)) |
---|
1313 | return jiA_MATRIX_L(l,r); |
---|
1314 | else if ((rt==STRING_CMD)&&(rl==1)) |
---|
1315 | return jiA_STRING_L(l,r); |
---|
1316 | Werror("length of lists in assignment does not match (l:%d,r:%d)", |
---|
1317 | ll,rl); |
---|
1318 | return TRUE; |
---|
1319 | } |
---|
1320 | |
---|
1321 | leftv hh=r; |
---|
1322 | BOOLEAN nok=FALSE; |
---|
1323 | BOOLEAN map_assign=FALSE; |
---|
1324 | switch (lt) |
---|
1325 | { |
---|
1326 | case INTVEC_CMD: |
---|
1327 | nok=jjA_L_INTVEC(l,r,new intvec(exprlist_length(r))); |
---|
1328 | break; |
---|
1329 | case INTMAT_CMD: |
---|
1330 | { |
---|
1331 | nok=jjA_L_INTVEC(l,r,new intvec(IDINTVEC((idhdl)l->data))); |
---|
1332 | break; |
---|
1333 | } |
---|
1334 | case MAP_CMD: |
---|
1335 | { |
---|
1336 | // first element in the list sl (r) must be a ring |
---|
1337 | if (((rt == RING_CMD)||(rt == QRING_CMD))&&(r->e==NULL)) |
---|
1338 | { |
---|
1339 | omFree((ADDRESS)IDMAP((idhdl)l->data)->preimage); |
---|
1340 | IDMAP((idhdl)l->data)->preimage = omStrDup (r->Fullname()); |
---|
1341 | /* advance the expressionlist to get the next element after the ring */ |
---|
1342 | hh = r->next; |
---|
1343 | //r=hh; |
---|
1344 | } |
---|
1345 | else |
---|
1346 | { |
---|
1347 | WerrorS("expected ring-name"); |
---|
1348 | nok=TRUE; |
---|
1349 | break; |
---|
1350 | } |
---|
1351 | if (hh==NULL) /* map-assign: map f=r; */ |
---|
1352 | { |
---|
1353 | WerrorS("expected image ideal"); |
---|
1354 | nok=TRUE; |
---|
1355 | break; |
---|
1356 | } |
---|
1357 | if ((hh->next==NULL)&&(hh->Typ()==IDEAL_CMD)) |
---|
1358 | return jiAssign_1(l,hh); /* map-assign: map f=r,i; */ |
---|
1359 | //no break, handle the rest like an ideal: |
---|
1360 | map_assign=TRUE; |
---|
1361 | } |
---|
1362 | case MATRIX_CMD: |
---|
1363 | case IDEAL_CMD: |
---|
1364 | case MODUL_CMD: |
---|
1365 | { |
---|
1366 | sleftv t; |
---|
1367 | matrix olm = (matrix)l->Data(); |
---|
1368 | int rk=olm->rank; |
---|
1369 | char *pr=((map)olm)->preimage; |
---|
1370 | BOOLEAN module_assign=(/*l->Typ()*/ lt==MODUL_CMD); |
---|
1371 | matrix lm ; |
---|
1372 | int num; |
---|
1373 | int j,k; |
---|
1374 | int i=0; |
---|
1375 | int mtyp=MATRIX_CMD; /*Type of left side object*/ |
---|
1376 | int etyp=POLY_CMD; /*Type of elements of left side object*/ |
---|
1377 | |
---|
1378 | if (lt /*l->Typ()*/==MATRIX_CMD) |
---|
1379 | { |
---|
1380 | num=olm->cols()*olm->rows(); |
---|
1381 | lm=mpNew(olm->rows(),olm->cols()); |
---|
1382 | } |
---|
1383 | else /* IDEAL_CMD or MODUL_CMD */ |
---|
1384 | { |
---|
1385 | num=exprlist_length(hh); |
---|
1386 | lm=(matrix)idInit(num,1); |
---|
1387 | rk=1; |
---|
1388 | if (module_assign) |
---|
1389 | { |
---|
1390 | mtyp=MODUL_CMD; |
---|
1391 | etyp=VECTOR_CMD; |
---|
1392 | } |
---|
1393 | } |
---|
1394 | |
---|
1395 | int ht; |
---|
1396 | loop |
---|
1397 | { |
---|
1398 | if (hh==NULL) |
---|
1399 | break; |
---|
1400 | else |
---|
1401 | { |
---|
1402 | matrix rm; |
---|
1403 | ht=hh->Typ(); |
---|
1404 | if ((j=iiTestConvert(ht,etyp))!=0) |
---|
1405 | { |
---|
1406 | nok=iiConvert(ht,etyp,j,hh,&t); |
---|
1407 | hh->next=t.next; |
---|
1408 | if (nok) break; |
---|
1409 | lm->m[i]=(poly)t.CopyD(etyp); |
---|
1410 | pNormalize(lm->m[i]); |
---|
1411 | if (module_assign) rk=max(rk,pMaxComp(lm->m[i])); |
---|
1412 | i++; |
---|
1413 | } |
---|
1414 | else |
---|
1415 | if ((j=iiTestConvert(ht,mtyp))!=0) |
---|
1416 | { |
---|
1417 | nok=iiConvert(ht,mtyp,j,hh,&t); |
---|
1418 | hh->next=t.next; |
---|
1419 | if (nok) break; |
---|
1420 | rm = (matrix)t.CopyD(mtyp); |
---|
1421 | if (module_assign) |
---|
1422 | { |
---|
1423 | j = min(num,rm->cols()); |
---|
1424 | rk=max(rk,rm->rank); |
---|
1425 | } |
---|
1426 | else |
---|
1427 | j = min(num-i,rm->rows() * rm->cols()); |
---|
1428 | for(k=0;k<j;k++,i++) |
---|
1429 | { |
---|
1430 | lm->m[i]=rm->m[k]; |
---|
1431 | pNormalize(lm->m[i]); |
---|
1432 | rm->m[k]=NULL; |
---|
1433 | } |
---|
1434 | idDelete((ideal *)&rm); |
---|
1435 | } |
---|
1436 | else |
---|
1437 | { |
---|
1438 | nok=TRUE; |
---|
1439 | break; |
---|
1440 | } |
---|
1441 | t.next=NULL;t.CleanUp(); |
---|
1442 | if (i==num) break; |
---|
1443 | hh=hh->next; |
---|
1444 | } |
---|
1445 | } |
---|
1446 | if (nok) |
---|
1447 | idDelete((ideal *)&lm); |
---|
1448 | else |
---|
1449 | { |
---|
1450 | idDelete((ideal *)&olm); |
---|
1451 | if (module_assign) lm->rank=rk; |
---|
1452 | else if (map_assign) ((map)lm)->preimage=pr; |
---|
1453 | l=l->LData(); |
---|
1454 | if (l->rtyp==IDHDL) |
---|
1455 | IDMATRIX((idhdl)l->data)=lm; |
---|
1456 | else |
---|
1457 | l->data=(char *)lm; |
---|
1458 | } |
---|
1459 | break; |
---|
1460 | } |
---|
1461 | case STRING_CMD: |
---|
1462 | nok=jjA_L_STRING(l,r); |
---|
1463 | break; |
---|
1464 | case LIST_CMD: |
---|
1465 | nok=jjA_L_LIST(l,r); |
---|
1466 | break; |
---|
1467 | case NONE: |
---|
1468 | case 0: |
---|
1469 | Werror("cannot assign to %s",l->Fullname()); |
---|
1470 | nok=TRUE; |
---|
1471 | break; |
---|
1472 | default: |
---|
1473 | WerrorS("assign not impl."); |
---|
1474 | nok=TRUE; |
---|
1475 | break; |
---|
1476 | } /* end switch: typ */ |
---|
1477 | if (nok && (!errorreported)) WerrorS("incompatible type in list assignment"); |
---|
1478 | r->CleanUp(); |
---|
1479 | return nok; |
---|
1480 | } |
---|