1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
|
subroutine intl_i
c =============================================================
c list insertions arg3(arg1)=arg2
c =============================================================
c
c Copyright INRIA
include '../stack.h'
c
integer vol1,vol2,vol3,volv
integer top3,top2,top1
integer strpos
external strpos
logical ptover
integer id(nsiz)
integer iadr,sadr
c
iadr(l)=l+l-1
sadr(l)=(l/2)+1
c
if (ddt .eq. 4) then
write(buf(1:8),'(2i4)') pt,rstk(pt)
call basout(io,wte,' intl_i pt:'//buf(1:4)//' rstk(pt):'
& //buf(5:8))
endif
c
01 icall=0
c handle recursion
if(rstk(pt).eq.406.or.rstk(pt).eq.407) then
if(err1.ne.0) then
pt=pt-1
return
endif
ilrec=pstk(pt)
il1i=istk(ilrec+1)
ilind=istk(ilrec+2)
icount=istk(ilrec+3)
top1=istk(ilrec+4)
il3i=istk(ilrec+5)
vol3=istk(ilrec+6)
goto(35,45,65,55,81,84) istk(ilrec)
endif
fun=0
05 lw=lstk(top+1)
c
if(rhs.ge.4) then
c . l(i,j,..)
fin=-fin
return
endif
ltop=lstk(top+1)
c get arg3
top3=top
il3=iadr(lstk(top))
if(abs(istk(il3)).lt.14.or.abs(istk(il3)).gt.17) then
c . arg3 is not a list
fin=-fin
return
endif
c
c get arg2
top=top-1
top2=top
il2=iadr(lstk(top))
il2r=il2
if(istk(il2).lt.0) then
vol2=istk(il2+3)
il2=iadr(istk(il2+1))
else
vol2=lstk(top+1)-lstk(top)
endif
c
c get arg1
top=top-1
top1=top
il1=iadr(lstk(top))
if(istk(il1).lt.0) il1=iadr(istk(il1+1))
m1=istk(il1+1)
ilind=iadr(lw)
c
c get room for index list
if(istk(il1).ne.15) then
lw=lw+1
else
lw=sadr(ilind+m1)
endif
c protect index list
lstk(top3+1)=lw
c go ahead along the path
icount=0
call followpath(top1,top3,il1ir,vol1,il3ir,vol3,
$ istk(ilind),icount,info,lw)
if(err.gt.0) return
il1i=il1ir
if(istk(il1i).lt.0) il1i=iadr(istk(il1i+1))
il3i=il3ir
if(istk(il3i).lt.0) il3i=iadr(istk(il3i+1))
c get room for recursion data
ilrec=iadr(lw)
lw=sadr(ilrec+7)
c protect recursion data
lstk(top3+1)=lw
istk(ilrec+1)=il1i
istk(ilrec+2)=ilind
istk(ilrec+3)=icount
istk(ilrec+4)=top1
istk(ilrec+5)=il3i
istk(ilrec+6)=vol3
if(info.eq.5.or.info.eq.6) then
c . end of arg1 list reached
c . replace designed sublist of arg3 by arg2
call insertfield(il2,vol2,il3,istk(ilind),icount,lrn,lw,info)
if(err.gt.0) return
goto 90
elseif(info.eq.3) then
c . current list index is not a single index (multiple insertion)
call error(43)
return
elseif(info.eq.2.or.info.eq.4) then
c . syntax is arg3(...)(i,j,..)(...)=arg2
c . matrix index (i,..) syntax
if(istk(il3i).eq.17.or.istk(il3i).eq.16) then
if(icount.eq.1.and.abs(m1).eq.1) then
c . syntax is arg3('xxx')=arg2 or arg3(i)=arg2
fin=-2
top=top3
rhs=3
lstk(top+1)=ltop
return
else
goto 40
endif
elseif(istk(il3i).eq.9) then
c . handle case
goto 80
else
goto 30
endif
elseif(info.eq.1) then
c . current index is a name which is not an explicit field name
top=top3
rhs=3
if(icount.eq.1.and.m1.eq.1) then
c if(icount.eq.1) then
c . syntax is arg3('xxx')=arg2
fin=-2
lstk(top+1)=ltop
return
else
c . syntax is arg3(...)('xxx')(...)=arg1
c . set the index
c call copyvar(il1ir,vol1)
c if(err.gt.0) return
goto 40
endif
endif
30 continue
c last index points on a matrix, use standard matrix insertion
c to finish
top=top3
if (istk(il1i).eq.15) then
c . more than one index
c . transform index list(i,j,...) in the list in sequence of
c . variables at the top of the stack
call lst2vars(il1i,m1i)
if(err.gt.0) return
rhs=2+m1i
else
c . a matrix single index
if(m1.gt.icount) then
c . arg3(...)(i,j,..)(...)=arg2 :too many indices in index list
call error(21)
return
endif
c . arg3(...)(i,j,..)=arg2: a matrix single index
c . copy it at the top of the stack (may be possible to put a pointer)
call copyvar(il1ir,vol1)
if(err.gt.0) return
rhs=3
endif
c create a pointer on arg2
call createref(il2,top2,vol2)
if(err.gt.0) return
c create a pointer on the designed matrix (part of arg3)
if(vol3.gt.0) then
call createref(il3i,0,vol3)
if(err.gt.0) return
else
c . the list entry is undefined
call defmat
if(err.gt.0) return
endif
c call allops for standard insertion
fin=2
if (ptover(1,psiz)) return
icall=4
istk(ilrec)=1
pstk(pt)=ilrec
rstk(pt)=406
c *call* allops
return
35 continue
ilv=iadr(lstk(top))
if(istk(ilv).lt.0.or.istk(il3i).eq.9) then
c . matrix or handle has been modified in place, nothing more to be done
top=top-3
pt=pt-1
info=0
goto 90
else
c . insert the matrix in main list
volv=lstk(top+1)-lstk(top)
lw=lstk(top+1)
il3=iadr(lstk(top1+2))
call insertfield(ilv,volv,il3,istk(ilind),icount-1,lrn,lw,info)
if(err.gt.0) return
pt=pt-1
top=top-3
goto 90
endif
40 continue
c mlist or tlist coded matrix insertion or other method
c if k+1<n then
c A3(i1)..(ik)(ik+1)(ik+2)..(in)=A2 is decomposed as follow
c . Temp1=A3(i1)..(ik)
c . Temp2=Temp1(ik+1)
c . Temp2(ik+2)..(in)=A2
c . Temp1(ik+1)=Temp2
c . A3(i1)..(ik)=Temp1
c else
c A3(i1)..(ik)(ik+1)=A2 is decomposed as follow
c . Temp1=A3(i1)..(ik)
c . Temp1(ik+1)=A2
c . A3(i1)..(ik)=Temp1
c top of stack contains [A1, A2, A3]
k=icount-1
top=top3
c put ik+1 in the stack for further use
if (istk(il1i).ne.15) then
ill=iadr(sadr(il1+3+m1)+istk(il1+1+(k+1))-1)
call copyvar(ill,istk(il1+2+(k+1))-istk(il1+1+(k+1)))
if(err.gt.0) return
rhs=3
else
c . more than one index
c . transform index list(i,j,...) in the list in sequence of
c . variables at the top of the stack
call lst2vars(il1i,m1i)
if(err.gt.0) return
rhs=2+m1i
endif
if(k+1.lt.m1) then
c put (ik+2)..(in) in the stack for further use
ll=sadr(il1+3+m1)+istk(il1+1+(k+2))-1
volv=istk(il1+2+m1)-istk(il1+3+k)
if(k+2.eq.m1) then
c il suffirait de mettre un ptr ici
call copyvar(iadr(ll),volv)
if(err.gt.0) return
else
top=top+1
ilv=iadr(lstk(top))
istk(ilv)=15
istk(ilv+1)=m1-(k+1)
istk(ilv+2)=1
ilv=ilv+2
do 42 i=1,m1-(k+1)
ilv=ilv+1
istk(ilv)=istk(ilv-1)+istk(il1+3+k+i)-istk(il1+2+k+i)
42 continue
call unsfdcopy(volv,stk(ll),1,stk(sadr(ilv+1)),1)
lstk(top+1)=sadr(ilv+1)+volv
endif
endif
c put a pointer to A2 in the stack for further use
call createref(il2,top2,vol2)
if(err.gt.0) return
if(k+1.eq.m1) goto 56
c Temp2=Temp1(ik+1) extraction:
c - form index ik+1
if (istk(il1i).ne.15) then
ill=iadr(sadr(il1+3+m1)+istk(il1+1+(k+1))-1)
call copyvar(ill,istk(il1+2+(k+1))-istk(il1+1+(k+1)))
if(err.gt.0) return
rhs=2
else
c . more than one index
c . transform index list(i,j,...) in the list in sequence of
c . variables at the top of the stack
call lst2vars(il1i,m1i)
if(err.gt.0) return
rhs=1+m1i
endif
c - form the sublist Temp1=A3(i1)..(ik)
call copyvar(il3i,vol3)
if(err.gt.0) return
c top of stack contains [A1, A2, A3,ik+1, (ik+2)..(in),&a2,ik+1,Temp1]
c - save context for recursion
if (ptover(1,psiz)) return
pstk(pt)=ilrec
istk(ilrec)=2
fun=0
fin=-5
rstk(pt)=406
c *call* allops
return
45 continue
c - top variable contains Temp2
c - restore context
lw=lstk(top+1)
ltop=lw
k=icount-1
il1=iadr(lstk(top1))
if(istk(il1).lt.0) il1=iadr(istk(il1+1))
m1=istk(il1+1)
c
c re-enter intl_i to realize Temp2(ik+2)..(in)=A2 insertion
c top of stack contains : [A1, A2, A3,ik+1,(ik+2)..(in), &A2, Temp2]
c
c pt=pt-1
c if (ptover(1,psiz)) return
c save context for recursion
istk(ilrec)=4
rstk(pt)=407
rhs=3
fin=2
if (istk(iadr(lstk(top))).eq.1) then
c . insertion in an empty matrix
c . get the type of the inserted variable
ityp=abs(istk(iadr(lstk(top-1))))
if(ityp.ne.15.and.ityp.ne.16.and.ityp.ne.17) then
c . not a list, *call* allops
icall=4
return
endif
endif
c *call* intl_i
goto 05
55 continue
c top variable contains new Temp2 value
pt=pt-1
c put Temp1=A3(i1)..(ik) at the top of the stack
56 call copyvar(il3i,vol3)
if(err.gt.0) return
c top of stack contains : [A1, A2, A3, ik+1,Temp2,Temp1]
c return to parser for Temp1(ik+1)=Temp2 insertion
if (ptover(1,psiz)) return
c save context for recursion
pstk(pt)=ilrec
istk(ilrec)=3
rhs=3
if (istk(il1i).eq.15) rhs=2+istk(il1i+1)
c *call* intl_i
fun=0
fin=-2
rstk(pt)=406
c *call* macro or matfns
return
65 continue
c top of stack contains : [A1, A2, A3, Temp1]
c restore context
pt=pt-1
lw=lstk(top+1)
k=icount-1
if(k.eq.0) then
c . temp1 contains the result
lrn=lstk(top)
top=top-3
info=1
goto 90
endif
c
c realize insertion A3(i1)..(ik)=Temp1
ilv=iadr(lstk(top))
volv=lstk(top+1)-lstk(top)
il3=iadr(lstk(top1+2))
call insertfield(ilv,volv,il3,istk(ilind),icount-1,lrn,lw,info)
if(err.gt.0) return
top=top-3
goto 90
80 continue
c special case for property assignation of a handle field of a list
c handle case ...h.property...=arg2
c or ...h(i,j).property...=arg2
c change the property value of the entity pointed to by
c handle and does not change the list
c
top=top3
c case ...h(i,j).property...=arg2 or ...h(i).property...=arg2
c first extract the handle or sub handle
if (istk(il1i).eq.10) then
c . handle case ...h.property...=arg2
icount=icount-1
call createref(il3i,0,vol3)
goto 82
elseif (istk(il1i).eq.15) then
c . sub handle case ...h(i,j).property...=arg2
call lst2vars(il1i,m1i)
if(err.gt.0) return
rhs=1+m1i
else
c . sub handle case ...h(i).property...=arg2
call copyvar(il1ir,vol1)
rhs=2
endif
c create a pointer on the matrix of handle
call createref(il3i,0,vol3)
fin=3
c back to allops for h(i) or h(i,j) extraction
if (ptover(1,psiz)) return
icall=4
pstk(pt)=ilrec
istk(ilrec)=5
rstk(pt)=406
c *call* allops
return
c
81 continue
icall=0
if(err1.ne.0) then
pt=pt-1
return
endif
il1=iadr(lstk(top1))
if(istk(il1).lt.0) il1=iadr(istk(il1+1))
m1=istk(il1+1)
top2=top1+1
top3=top2+1
pt=pt-1
82 continue
c change handle property
c build new index list using the remaining entries of the
c original index list
ll=sadr(il1+3+m1)
do i=1,m1-icount
ilindi=iadr(ll+istk(il1+1+icount+i)-1)
volv=istk(il1+2+icount+i)-istk(il1+1+icount+i)
call copyvar(ilindi,volv)
enddo
if (m1-icount.gt.1) call mklist(m1-icount)
rhs=3
83 call createref1(top2)
call createref1(top3+1)
fun=0
fin=-2
if (ptover(1,psiz)) return
istk(ilrec)=6
pstk(pt)=ilrec
rstk(pt)=406
c *call* allops
return
84 continue
pt=pt-1
top3=top1+2
c notify that result has already been stored
k1=istk(iadr(lstk(top3))+2)
top=top3-3
call setref(k1)
fin=2
return
90 continue
if(info.eq.0) then
c . insertion has been done in place,
top3=top1+2
if(rstk(pt).eq.407) then
il3=iadr(lstk(top3))
top=top-1
call copyvar(il3,lstk(top3+1)-lstk(top3))
if(err.gt.0) return
goto 01
else
c . notify that result has already been stored
k1=istk(iadr(lstk(top3))+2)
top=top-1
call setref(k1)
fin=2
return
endif
elseif(info.eq.1) then
c . insertfield has created the result at adress lrn. stored it
if(rstk(pt).eq.407) then
il1=iadr(lrn)
m=istk(il1+1)
top=top-1
call copyvar(il1,sadr(4+m)+(istk(il1+2+m)-1))
if(err.gt.0) return
goto 01
else
c . set lstk pointers to the newly created variable
lt=lstk(top)
lstk(top)=lrn
il1=iadr(lrn)
m=istk(il1+1)
lstk(top+1)=sadr(il1+3+m)+(istk(il1+2+m)-1)
c . store it
lhs=1
c . modification according to those in run.f 22/08/00
if(rstk(pt).eq.607) then
c . called by run
call stackp(istk(pstk(pt)),0)
elseif(rstk(pt).eq.601) then
c . called by run version 2.7 and earlier
call stackp(istk(pstk(pt)+1),0)
else
c . called by parse
call stackp(ids(1,pt),0)
endif
if(err.gt.0) return
lstk(top+1)=lt
c . notify that result has already been stored
call setref(fin)
return
endif
endif
c
99 return
end
|
