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
|
subroutine intl_e()
c =============================================================
c extraction pour les list tlist, mlist
c =============================================================
c
c Copyright INRIA
include '../stack.h'
c
c
integer rhs1,vol1,vol2,vol
integer op,top1,top2
integer strpos
external strpos
logical ptover
integer id(nsiz)
integer iadr,sadr
c
c
iadr(l)=l+l-1
sadr(l)=(l/2)+1
c
icall=0
c
if(rstk(pt).eq.403) goto 45
if(rstk(pt).eq.405) goto 35
if(rstk(pt).eq.404) goto 36
rhs1=rhs
top0=top
fun=0
if(rhs.gt.2) then
fin=-fin
return
endif
if(rhs.le.0) then
call error(39)
return
endif
icount=0
c arg2(arg1)
c ==========
c get arg2
10 continue
lw=lstk(top+1)
c
top2=top
c get arg1
top=top-1
top1=top
il1=iadr(lstk(top))
if(istk(il1).lt.0) il1=iadr(istk(il1+1))
if(istk(il1).eq.15.and.istk(il1+1).eq.0) then
c . arg2(list()) -->arg2
il2=iadr(lstk(top2))
if(istk(il2).lt.0) top2=istk(il2+2)
call unsfdcopy(lstk(top2+1)-lstk(top2),stk(lstk(top2)),1,
& stk(lstk(top)),1)
lstk(top+1)=lstk(top)+lstk(top2+1)-lstk(top2)
return
endif
c
ilind=iadr(lw)
if(istk(il1).ne.15) then
lw=lw+1
m1=1
else
m1=istk(il1+1)
lw=sadr(ilind+m1)
endif
c go ahead along the path
call followpath(top1,top2,il1ir,vol1,il2ir,vol2,istk(ilind),
$ icount,info,lw)
if(err.gt.0) return
if(vol2.eq.0) then
c empty field found
err=istk(ilind-1+icount)
call error(117)
return
endif
il1i=il1ir
if(istk(il1i).lt.0) il1i=iadr(istk(il1i+1))
il2i=il2ir
if(istk(il2i).lt.0) il2i=iadr(istk(il2i+1))
if(info.eq.2.or.info.eq.4) then
c . syntax is arg2(...)(i,j,..)(...)
c . matrix index (i,..) syntax
lstk(top+2)=lw
if (istk(il1i).eq.15) then
c . more than one index
c . transform index list(i,j,...) in the list in sequence of variables
c . at the top of the stack
m1i=istk(il1i+1)
ll1=sadr(il1i+m1i+3)
top=top2+1
call unsfdcopy(istk(il1i+m1i+2)-1,stk(ll1),1,
$ stk(lstk(top)),1)
do 16 k1=1,m1i
lstk(top+1)=lstk(top)+istk(il1i+2+k1)-istk(il1i+1+k1)
top=top+1
16 continue
top=top-1
rhs=1+m1i
m2i=istk(il2i+1)
else
c . a matrix index
if(m1.gt.icount.and.info.eq.4) then
c . arg2(...)(i,j,..)(...)
if(istk(il2i).ne.9) then
c . too many indices in index list
call error(21)
return
endif
endif
c . arg2(...)(i,j,..) a matrix single index,
c . use standard extraction to finish the job
c . copy index at the top of the stack
top=top2
call copyvar(il1ir,vol1)
rhs=2
endif
goto 30
elseif(info.eq.3) then
c . current list index is not a single index (multiple extraction)
if(icount.ne.m1) then
c . only final index handled
call error(43)
return
endif
if(istk(il1i).eq.10) then
if(istk(il2i).ne.16.and.istk(il2i).ne.17) then
call error(21)
return
endif
c . named indexes
ilfn=iadr(sadr(il2i+istk(il2i+1)+3))
nn=istk(ilfn+1)*istk(ilfn+2)
ilptr=ilfn+5
lfn=ilfn+5+nn
ili=iadr(lw)
lw=sadr(ili+nn)
nind=istk(il1i+1)*istk(il1i+2)
do 20 k=1,nind
nname=istk(il1i+4+k)-istk(il1i+3+k)
ilname=il1i+4+nind+istk(il1i+3+k)
c . look for corresponding index if any
ipos=strpos(istk(ilptr),nn-1,istk(lfn),istk(ilname),
$ nname)
if(ipos.le.0) then
c . no such name in the field names
if(icount.eq.1.and.m1.eq.1) then
c . syntax is arg2('xxx')
fin=-fin
top=top2
rhs1=rhs
return
else
c . syntax is arg2(...)('xxx')(...)
c . set the index
top=top2
call copyvar(il1ir,vol1)
rhs=2
goto 30
endif
else
istk(ili+k-1)=ipos+1
endif
20 continue
call extractfields(il2i,istk(ili),nind,lw)
else
m2i=istk(il2i+1)
call indxg(il1i,m2i,ili,n,mx,lw,10)
call extractfields(il2i,istk(ili),n,lw)
endif
return
elseif(info.eq.5) then
c . end of arg1 list (index list) reached
c . copy the designed sublist at the top of the stack
top=top-1
call copyvar(il2ir,vol2)
return
elseif(info.eq.6) then
c . index is out of bounds
call error(21)
return
elseif(info.eq.1) then
c . current index is a name which is not an explicit field name
if(icount.eq.1.and.m1.eq.1) then
c . syntax is arg2.xxx
fin=-fin
top=top2
rhs1=rhs
return
else
c . syntax is arg2(...).xxx(...)
c . set the index
top=top2
call copyvar(il1ir,vol1)
rhs=2
goto 30
endif
endif
30 continue
c escape from standard list algorithm to handle special cases:
c (matrix/vector extraction, method..)
if(istk(il2i).ge.15.and.istk(il2i).le.17) goto 40
c
c standard matrix extraction
call createref(il2i,0,vol2)
c
34 fin=3
c back to allops for standard extraction
if (ptover(1,psiz)) return
icall=4
ids(1,pt)=icount
ids(2,pt)=m1
ids(4,pt)=lhs
rstk(pt)=405
c *call* allops
return
35 continue
icall=0
if(err1.ne.0) then
pt=pt-1
return
endif
icount=ids(1,pt)
m1=ids(2,pt)
lhs=ids(4,pt)
pt=pt-1
if (m1.le.icount) then
c . nothing more to do here but to move results at its correct location
vol=lstk(top+1)-lstk(top)
call unsfdcopy(vol,stk(lstk(top)),1,stk(lstk(top-2)),1)
top=top-2
lstk(top+1)=lstk(top)+vol
fin=0
return
endif
c m1 > icount handle, ... case
c finish extraction using overloading
c build new index list using the remaining entries of the
c original index list
ilind=iadr(lstk(top-2))
if(istk(ilind).lt.0) ilind=iadr(istk(ilind+1))
nlist=istk(ilind+1)
ll=sadr(ilind+3+nlist)
if(m1-icount.eq.1) then
il1i=iadr(ll+istk(ilind+1+icount+1)-1)
if (istk(il1i).ne.15) then
vol=istk(ilind+2+icount+1)-istk(ilind+1+icount+1)
call copyvar(il1i,vol)
rhs=2
else
c . transform index list(i,j,...) in the list in sequence of variables
c . at the top of the stack
m1i=istk(il1i+1)
ll1=sadr(il1i+m1i+3)
call unsfdcopy(istk(il1i+m1i+2)-1,stk(ll1),1,
$ stk(lstk(top+1)),1)
do k1=1,m1i
top=top+1
lstk(top+1)=lstk(top)+istk(il1i+2+k1)-istk(il1i+1+k1)
enddo
rhs=1+m1i
m2i=istk(il2i+1)
endif
else
do i=1,m1-icount
ilindi=iadr(ll+istk(ilind+1+icount+i)-1)
vol=istk(ilind+2+icount+i)-istk(ilind+1+icount+i)
call copyvar(ilindi,vol)
enddo
if(m1-icount.gt.1) call mklist(m1-icount)
rhs=2
endif
c create a reference on the handle
call createref1(top-rhs+1)
if (ptover(1,psiz)) return
fun=0
fin=3
icall=4
rstk(pt)=404
c *call* allops
return
36 continue
pt=pt-1
c move results at its correct location
vol=lstk(top+1)-lstk(top)
call unsfdcopy(vol,stk(lstk(top)),1,stk(lstk(top-3)),1)
top=top-3
lstk(top+1)=lstk(top)+vol
fin=0
return
40 continue
c list mlist or tlist coded matrix extraction or other method
c . form the sublist
call copyvar(il2i,vol2)
if (ptover(1,psiz)) return
ids(1,pt)=icount
ids(2,pt)=m1
ids(4,pt)=lhs
c only last index may select many lhs elements
if (icount.ne.m1) lhs=1
fun=0
fin=-fin
rstk(pt)=403
c *call* macro or matfns
return
45 continue
c restore context
if(err1.ne.0) then
pt=pt-1
return
endif
icount=ids(1,pt)
m1=ids(2,pt)
lhs=ids(4,pt)
fin=3
pt=pt-1
if(icount.eq.m1) then
c . put the result at the top of the stack and return
vol=lstk(top+1)-lstk(top-lhs+1)
im=lstk(top-lhs+1)-lstk(top-lhs-1)
call unsfdcopy(vol,stk(lstk(top-lhs+1)),1,
$ stk(lstk(top-lhs-1)),1)
top=top-2
do 46 k=1,lhs
lstk(top-lhs+k+1)=lstk(top-lhs+k+3)-im
46 continue
return
else
c . move result ajust after the index
ll2=lstk(top+1)-lstk(top)
call unsfdcopy(ll2,stk(lstk(top)),1,stk(lstk(top-1)),1)
lstk(top)=lstk(top-1)+ll2
top=top-1
c . goto back to the standard list algorithm
goto 10
endif
c
end
subroutine forcerhs(n,ierr)
c this routine allows to change the apparent lhs of a list
c extraction when it extraction appears in an input argument
c list. The lhs is changed from 1 to the number of extracted
c variables.
c
integer n,ierr
include '../stack.h'
ierr=0
c write(6,'(''forcerhs'',i5)') n
if(rstk(pt-1).eq.617) then
c in a compiled function
pstk(pt-1)=pstk(pt-1)+n-1
elseif(rstk(pt-1).eq.501) then
c in a compiled function retained for 2.4.1 compatiblity
ids(5,pt-1)=ids(5,pt-1)+n-1
elseif(pt.ge.4) then
if(rstk(pt-3).eq.307.or.rstk(pt-3).eq.702) then
pstk(pt-3)=pstk(pt-3)-1+n
else
ierr=1
endif
else
ierr=1
endif
return
end
subroutine extractfields(illist,ind,n,lw)
c Copyright INRIA
c
c given a list beginning at istk(illist), a vector of n indexes ind
c extractfields creates n variables corresponding to the n fields
c
c if n==-1 all fieds are extracted
c
include '../stack.h'
integer ind(*)
c
integer vol2
integer iadr,sadr
c
iadr(l)=l+l-1
sadr(l)=(l/2)+1
c
if(n.eq.-1) then
c . L(:)
n=istk(illist+1)
llist=sadr(illist+3+n)
c . Check lhs
if(lhs.le.1) then
if(n.ne.lhs) then
call forcerhs(n,ierr)
if(ierr.ne.0) then
call error(41)
return
endif
endif
else
if(n.ne.lhs) then
call error(41)
return
endif
endif
c . check if it is possible to create n new variables
if(top+1+n.ge.bot) then
call error(18)
return
endif
c . create table of pointers on new variables
do 31 i=1,n
vol2=istk(illist+2+i)-istk(illist+1+i)
if(vol2.eq.0) then
err=i
call error(117)
return
endif
lstk(top+1)=lstk(top)+vol2
top=top+1
31 continue
top=top-1
c . copy the fields
l=lstk(top-n+1)
call unsfdcopy(istk(illist+n+2)-1,stk(llist),1,stk(l),1)
else
c . L([....])
llist=sadr(illist+3+istk(illist+1))
if(n.ne.lhs) then
call forcerhs(n,ierr)
if(ierr.ne.0) then
call error(41)
return
endif
endif
c . check if it is possible to create n new variables
if(top+n+1.ge.bot) then
call error(18)
return
endif
c . create table of pointers on new variables
do 52 i=1,n
k=ind(i)
if(k.le.0.or.k.gt.istk(illist+1)) then
call error(21)
return
endif
vol2=istk(illist+2+k)-istk(illist+1+k)
if(vol2.eq.0) then
err=k
call error(117)
return
endif
lstk(top+1)=lstk(top)+vol2
top=top+1
52 continue
top=top-1
c . preserve fields adress (newly created variables may
c . overwrite beginining of the given list)
ill=iadr(max(lw,lstk(top+1)))
lw=sadr(ill+n)
err=sadr(ill+n)-lstk(bot)
if(err.gt.0) then
call error(17)
return
endif
do 54 i=1,n
k=ind(i)
istk(ill-1+i)=istk(illist+1+k)+llist-1
54 continue
c . copy the fields
do 55 i=1,n
k=top-n+i
call unsfdcopy(lstk(k+1)-lstk(k),stk(istk(ill-1+i)),1,
$ stk(lstk(k)),1)
55 continue
endif
return
end
|
