3 IMPORT S
:= SYSTEM
, stdlib
:= PosixCstdlib
, stdio
:= PosixCstdio
,
4 time
:= PosixCtime
, wctype
:= PosixCwctype
, sysmman
:= PosixCsys_mman
,
5 dlfcn
:= PosixCdlfcn
, fcntl
:= PosixCfcntl
, types
:= PosixCtypes
,
6 unistd
:= PosixCunistd
, signal
:= PosixCsignal
, setjmp
:= PosixCsetjmp
,
11 (* add signal blocking to avoid race conditions in Try/Trap/TrapHandler *)
12 (* add BeepHook for Beep *)
17 littleEndian
* = FALSE
;
18 timeResolution
* = 1000; (* ticks per second *)
20 processor
* = 1; (* generic c *)
22 objType
* = "ocf"; (* file types *)
26 (* loader constants *)
40 strictStackSweep
= FALSE
;
41 N
= 128 DIV 16; (* free lists *)
43 (* kernel flags in module desc *)
44 init
= 16; dyn
= 17; dll
= 24; iptrs
= 30;
46 (* meta interface consts *)
47 mConst
= 1; mTyp
= 2; mVar
= 3; mProc
= 4; mField
= 5;
50 Name
* = ARRAY nameLen
OF CHAR;
51 Utf8Name
* = ARRAY nameLen
OF SHORTCHAR
;
54 Module
* = POINTER TO RECORD [untagged
]
56 opts
-: SET; (* 0..15: compiler opts, 16..31: kernel flags *)
57 refcnt
-: INTEGER; (* <0: module invalidated *)
58 compTime
-, loadTime
-: ARRAY 6 OF SHORTINT;
59 ext
-: INTEGER; (* currently not used *)
60 term
-: Command
; (* terminator *)
61 nofimps
-, nofptrs
-: INTEGER;
62 csize
-, dsize
-, rsize
-: INTEGER;
63 code
-, data
-, refs
-: INTEGER;
64 procBase
-, varBase
-: INTEGER; (* meta base addresses *)
65 names
-: POINTER TO ARRAY [untagged
] OF SHORTCHAR
; (* names[0] = 0X *)
66 ptrs
-: POINTER TO ARRAY [untagged
] OF INTEGER;
67 imports
-: POINTER TO ARRAY [untagged
] OF Module
;
68 export
-: Directory
; (* exported objects (name sorted) *)
72 Type
* = POINTER TO RECORD [untagged
]
73 (* record: ptr to method n at offset - 4 * (n+1) *)
74 size
-: INTEGER; (* record: size, array: #elem, dyn array: 0, proc: sigfp *)
76 id
-: INTEGER; (* name idx * 256 + lev * 16 + attr * 4 + form *)
77 base
-: ARRAY 16 OF Type
; (* signature if form = ProcTyp *)
78 fields
-: Directory
; (* new fields (declaration order) *)
79 ptroffs
-: ARRAY any
OF INTEGER (* array of any length *)
82 Object
* = POINTER TO ObjDesc
;
84 ObjDesc
* = RECORD [untagged
]
86 offs
-: INTEGER; (* pvfprint for record types *)
87 id
-: INTEGER; (* name idx * 256 + vis * 16 + mode *)
88 struct
-: Type (* id of basic type or pointer to typedesc/signature *)
91 Directory
* = POINTER TO RECORD [untagged
]
92 num
-: INTEGER; (* number of entries *)
93 obj
-: ARRAY any
OF ObjDesc (* array of any length *)
96 Signature
* = POINTER TO RECORD [untagged
]
97 retStruct
-: Type
; (* id of basic type or pointer to typedesc or 0 *)
98 num
-: INTEGER; (* number of parameters *)
99 par
-: ARRAY any
OF RECORD [untagged
] (* parameters *)
100 id
-: INTEGER; (* name idx * 256 + kind *)
101 struct
-: Type (* id of basic type or pointer to typedesc *)
105 Handler
* = PROCEDURE;
107 Reducer
* = POINTER TO ABSTRACT
RECORD
111 Identifier
* = ABSTRACT
RECORD
116 TrapCleaner
* = POINTER TO ABSTRACT
RECORD
120 TryHandler
* = PROCEDURE (a
, b
, c
: INTEGER);
122 (* meta extension suport *)
124 ItemExt
* = POINTER TO ABSTRACT
RECORD END;
127 obj
*, vis
*, typ
*, adr
*: INTEGER;
134 Hook
* = POINTER TO ABSTRACT
RECORD END;
136 LoaderHook
* = POINTER TO ABSTRACT
RECORD (Hook
)
138 importing
*, imported
*, object
*: ARRAY 256 OF CHAR
141 Block
= POINTER TO RECORD [untagged
]
143 last
: INTEGER; (* arrays: last element *)
144 actual
: INTEGER; (* arrays: used during mark phase *)
145 first
: INTEGER (* arrays: first element *)
148 FreeBlock
= POINTER TO FreeDesc
;
150 FreeDesc
= RECORD [untagged
]
151 tag
: Type
; (* f.tag = ADR(f.size) *)
156 Cluster
= POINTER TO RECORD [untagged
]
157 size
: INTEGER; (* total size *)
159 max
: INTEGER (* exe: reserved size, dll: original address *)
160 (* start of first block *)
163 FList
= POINTER TO RECORD
169 CList
= POINTER TO RECORD
176 PtrType
= RECORD v
: S
.PTR
END; (* used for array of pointer *)
177 Char8Type
= RECORD v
: SHORTCHAR
END;
178 Char16Type
= RECORD v
: CHAR END;
179 Int8Type
= RECORD v
: BYTE END;
180 Int16Type
= RECORD v
: SHORTINT END;
181 Int32Type
= RECORD v
: INTEGER END;
182 Int64Type
= RECORD v
: LONGINT END;
183 BoolType
= RECORD v
: BOOLEAN END;
184 SetType
= RECORD v
: SET END;
185 Real32Type
= RECORD v
: SHORTREAL
END;
186 Real64Type
= RECORD v
: REAL END;
187 ProcType
= RECORD v
: PROCEDURE END;
188 UPtrType
= RECORD v
: INTEGER END;
189 StrPtr
= POINTER TO ARRAY [untagged
] OF SHORTCHAR
;
191 (* SYSTEM.h -> SYSTEM_DLINK *)
192 DLink
= POINTER TO RECORD [untagged
]
196 ArrStrPtr
= POINTER TO ARRAY [untagged
] OF StrPtr
;
198 ADDRESS
* = types
.Pvoid
;
205 err
-, pc
-, sp
-, fp
-, stack
-, val
-: INTEGER;
207 isTry
, checkReadable
: BOOLEAN;
208 startEnv
, checkReadableEnv
: setjmp
.sigjmp_buf
;
209 tryEnv
: setjmp
.jmp_buf
;
210 startDLink
, tryDLink
: DLink
;
214 pagesize
: unistd
.long
;
216 free
: ARRAY N
OF FreeBlock
; (* free list *)
217 sentinelBlock
: FreeDesc
;
219 candidates
: ARRAY 1024 OF INTEGER;
221 allocated
: INTEGER; (* bytes allocated on BlackBox heap *)
222 total
: INTEGER; (* current total size of BlackBox heap *)
223 used
: INTEGER; (* bytes allocated on system heap *)
225 hotFinalizers
: FList
;
228 trapStack
: TrapCleaner
;
229 actual
: Module
; (* valid during module initialization *)
231 trapViewer
, trapChecker
: Handler
;
232 trapped
, guarded
, secondTrap
: BOOLEAN;
233 interrupted
: BOOLEAN;
234 static
, inDll
, terminating
: BOOLEAN;
240 wouldFinalize
: BOOLEAN;
242 watcher
*: PROCEDURE (event
: INTEGER); (* for debugging *)
246 PROCEDURE Erase (adr
, words
: INTEGER);
248 ASSERT(words
>= 0, 20);
257 PROCEDURE (VAR id
: Identifier
) Identified
* (): BOOLEAN, NEW, ABSTRACT
;
258 PROCEDURE (r
: Reducer
) Reduce
* (full
: BOOLEAN), NEW, ABSTRACT
;
259 PROCEDURE (c
: TrapCleaner
) Cleanup
*, NEW, EMPTY
;
261 (* meta extension suport *)
263 PROCEDURE (e
: ItemExt
) Lookup
* (name
: ARRAY OF CHAR; VAR i
: ANYREC
), NEW, ABSTRACT
;
264 PROCEDURE (e
: ItemExt
) Index
* (index
: INTEGER; VAR elem
: ANYREC
), NEW, ABSTRACT
;
265 PROCEDURE (e
: ItemExt
) Deref
* (VAR ref
: ANYREC
), NEW, ABSTRACT
;
267 PROCEDURE (e
: ItemExt
) Valid
* (): BOOLEAN, NEW, ABSTRACT
;
268 PROCEDURE (e
: ItemExt
) Size
* (): INTEGER, NEW, ABSTRACT
;
269 PROCEDURE (e
: ItemExt
) BaseTyp
* (): INTEGER, NEW, ABSTRACT
;
270 PROCEDURE (e
: ItemExt
) Len
* (): INTEGER, NEW, ABSTRACT
;
272 PROCEDURE (e
: ItemExt
) Call
* (OUT ok
: BOOLEAN), NEW, ABSTRACT
;
273 PROCEDURE (e
: ItemExt
) BoolVal
* (): BOOLEAN, NEW, ABSTRACT
;
274 PROCEDURE (e
: ItemExt
) PutBoolVal
* (x
: BOOLEAN), NEW, ABSTRACT
;
275 PROCEDURE (e
: ItemExt
) CharVal
* (): CHAR, NEW, ABSTRACT
;
276 PROCEDURE (e
: ItemExt
) PutCharVal
* (x
: CHAR), NEW, ABSTRACT
;
277 PROCEDURE (e
: ItemExt
) IntVal
* (): INTEGER, NEW, ABSTRACT
;
278 PROCEDURE (e
: ItemExt
) PutIntVal
* (x
: INTEGER), NEW, ABSTRACT
;
279 PROCEDURE (e
: ItemExt
) LongVal
* (): LONGINT, NEW, ABSTRACT
;
280 PROCEDURE (e
: ItemExt
) PutLongVal
* (x
: LONGINT), NEW, ABSTRACT
;
281 PROCEDURE (e
: ItemExt
) RealVal
* (): REAL, NEW, ABSTRACT
;
282 PROCEDURE (e
: ItemExt
) PutRealVal
* (x
: REAL), NEW, ABSTRACT
;
283 PROCEDURE (e
: ItemExt
) SetVal
* (): SET, NEW, ABSTRACT
;
284 PROCEDURE (e
: ItemExt
) PutSetVal
* (x
: SET), NEW, ABSTRACT
;
285 PROCEDURE (e
: ItemExt
) PtrVal
* (): ANYPTR
, NEW, ABSTRACT
;
286 PROCEDURE (e
: ItemExt
) PutPtrVal
* (x
: ANYPTR
), NEW, ABSTRACT
;
287 PROCEDURE (e
: ItemExt
) GetSStringVal
* (OUT x
: ARRAY OF SHORTCHAR
;
288 OUT ok
: BOOLEAN), NEW, ABSTRACT
;
289 PROCEDURE (e
: ItemExt
) PutSStringVal
* (IN x
: ARRAY OF SHORTCHAR
;
290 OUT ok
: BOOLEAN), NEW, ABSTRACT
;
291 PROCEDURE (e
: ItemExt
) GetStringVal
* (OUT x
: ARRAY OF CHAR; OUT ok
: BOOLEAN), NEW, ABSTRACT
;
292 PROCEDURE (e
: ItemExt
) PutStringVal
* (IN x
: ARRAY OF CHAR; OUT ok
: BOOLEAN), NEW, ABSTRACT
;
294 (* -------------------- miscellaneous tools -------------------- *)
296 PROCEDURE IsUpper
* (ch
: CHAR): BOOLEAN;
298 RETURN wctype
.iswupper(ORD(ch
)) # 0
301 PROCEDURE Upper
* (ch
: CHAR): CHAR;
303 RETURN CHR(wctype
.towupper(ORD(ch
)))
306 PROCEDURE IsLower
* (ch
: CHAR): BOOLEAN;
308 RETURN wctype
.iswlower(ORD(ch
)) # 0
311 PROCEDURE Lower
* (ch
: CHAR): CHAR;
313 RETURN CHR(wctype
.towlower(ORD(ch
)))
316 PROCEDURE IsAlpha
* (ch
: CHAR): BOOLEAN;
318 RETURN wctype
.iswalpha(ORD(ch
)) # 0
321 PROCEDURE Utf8ToString
* (IN in
: ARRAY OF SHORTCHAR
; OUT out
: ARRAY OF CHAR; OUT res
: INTEGER);
322 VAR i
, j
, val
, max
: INTEGER; ch
: SHORTCHAR
;
324 PROCEDURE FormatError();
325 BEGIN out
:= in$
; res
:= 2 (*format error*)
329 ch
:= in
[0]; i
:= 1; j
:= 0; max
:= LEN(out
) - 1;
330 WHILE (ch
# 0X
) & (j
< max
) DO
334 val
:= ORD(ch
) - 192;
335 IF val
< 0 THEN FormatError
; RETURN END ;
336 ch
:= in
[i
]; INC(i
); val
:= val
* 64 + ORD(ch
) - 128;
337 IF (ch
< 80X
) OR (ch
>= 0E0X
) THEN FormatError
; RETURN END ;
338 out
[j
] := CHR(val
); INC(j
)
340 val
:= ORD(ch
) - 224;
341 ch
:= in
[i
]; INC(i
); val
:= val
* 64 + ORD(ch
) - 128;
342 IF (ch
< 80X
) OR (ch
>= 0E0X
) THEN FormatError
; RETURN END ;
343 ch
:= in
[i
]; INC(i
); val
:= val
* 64 + ORD(ch
) - 128;
344 IF (ch
< 80X
) OR (ch
>= 0E0X
) THEN FormatError
; RETURN END ;
345 out
[j
] := CHR(val
); INC(j
)
352 IF ch
= 0X
THEN res
:= 0 (*ok*) ELSE res
:= 1 (*truncated*) END
355 PROCEDURE StringToUtf8
* (IN in
: ARRAY OF CHAR; OUT out
: ARRAY OF SHORTCHAR
; OUT res
: INTEGER);
356 VAR i
, j
, val
, max
: INTEGER;
358 i
:= 0; j
:= 0; max
:= LEN(out
) - 3;
359 WHILE (in
[i
] # 0X
) & (j
< max
) DO
360 val
:= ORD(in
[i
]); INC(i
);
362 out
[j
] := SHORT(CHR(val
)); INC(j
)
363 ELSIF val
< 2048 THEN
364 out
[j
] := SHORT(CHR(val
DIV 64 + 192)); INC(j
);
365 out
[j
] := SHORT(CHR(val
MOD 64 + 128)); INC(j
)
367 out
[j
] := SHORT(CHR(val
DIV 4096 + 224)); INC(j
);
368 out
[j
] := SHORT(CHR(val
DIV 64 MOD 64 + 128)); INC(j
);
369 out
[j
] := SHORT(CHR(val
MOD 64 + 128)); INC(j
)
373 IF in
[i
] = 0X
THEN res
:= 0 (*ok*) ELSE res
:= 1 (*truncated*) END
376 PROCEDURE SplitName
* (name
: ARRAY OF CHAR; VAR head
, tail
: ARRAY OF CHAR);
378 VAR i
, j
: INTEGER; ch
, lch
: CHAR;
380 i
:= 0; ch
:= name
[0];
383 head
[i
] := ch
; lch
:= ch
; INC(i
); ch
:= name
[i
]
384 UNTIL (ch
= 0X
) OR (ch
= ".") OR IsUpper(ch
) & ~
IsUpper(lch
);
385 IF ch
= "." THEN i
:= 0; ch
:= name
[0] END;
386 head
[i
] := 0X
; j
:= 0;
387 WHILE ch
# 0X
DO tail
[j
] := ch
; INC(i
); INC(j
); ch
:= name
[i
] END;
389 IF tail
= "" THEN tail
:= head$
; head
:= "" END
390 ELSE head
:= ""; tail
:= ""
394 PROCEDURE MakeFileName
* (VAR name
: ARRAY OF CHAR; type
: ARRAY OF CHAR);
395 VAR i
, j
: INTEGER; ext
: ARRAY 8 OF CHAR; ch
: CHAR;
398 WHILE (name
[i
] # 0X
) & (name
[i
] # ".") DO INC(i
) END;
399 IF name
[i
] = "." THEN
400 IF name
[i
+ 1] = 0X
THEN name
[i
] := 0X
END
402 IF type
= "" THEN ext
:= docType
ELSE ext
:= type$
END;
403 IF i
< LEN(name
) - LEN(ext$
) - 1 THEN
404 name
[i
] := "."; INC(i
); j
:= 0; ch
:= ext
[0];
406 name
[i
] := Lower(ch
); INC(i
); INC(j
); ch
:= ext
[j
]
414 PROCEDURE Time* (): LONGINT;
415 VAR res: time.int; tp: time.struct_timespec;
417 ASSERT(timeResolution >= 1);
418 ASSERT(timeResolution <= 1000000000);
419 res := time.clock_gettime(time.CLOCK_MONOTONIC, tp);
420 ASSERT(res = 0, 100);
421 RETURN tp.tv_sec * LONG(timeResolution) + tp.tv_nsec DIV LONG(1000000000 DIV timeResolution)
425 PROCEDURE Time
* (): LONGINT;
434 PROCEDURE SearchProcVar
* (var
: INTEGER; VAR m
: Module
; VAR adr
: INTEGER);
436 adr
:= var
; m
:= NIL;
439 WHILE (m
# NIL) & ((var
< m
.code
) OR (var
>= m
.code
+ m
.csize
)) DO m
:= m
.next
END;
440 IF m
# NIL THEN DEC(adr
, m
.code
) END
444 (* -------------------- system memory management --------------------- *)
446 PROCEDURE [code
] MAP_ANON (): INTEGER "MAP_ANON";
448 PROCEDURE AllocMem (size
: sysmman
.size_t
; VAR max
: sysmman
.size_t
): ADDRESS
;
449 CONST msgstr
= "mmap failed errno "; idx
= LEN(msgstr
);
450 VAR res
: fcntl
.int
; ptr
: ADDRESS
; msg
: ARRAY idx
+ 5 OF SHORTCHAR
;
452 max
:= (size
+ pagesize
- 1) DIV pagesize
* pagesize
;
453 ptr
:= sysmman
.mmap(0, max
, sysmman
.PROT_READ
+ sysmman
.PROT_WRITE
, sysmman
.MAP_PRIVATE
+ MAP_ANON(), -1, 0);
454 IF ptr
= sysmman
.MAP_FAILED
THEN
455 res
:= macro
.errno();
457 msg
[idx
+ 0] := SHORT(CHR(ORD("0") + res
DIV 100 MOD 10));
458 msg
[idx
+ 1] := SHORT(CHR(ORD("0") + res
DIV 10 MOD 10));
459 msg
[idx
+ 2] := SHORT(CHR(ORD("0") + res
MOD 10));
462 res
:= unistd
.write(2, S
.ADR(msg
), LEN(msg$
));
468 PROCEDURE FreeMem (adr
: ADDRESS
; size
: sysmman
.size_t
);
469 VAR res
: sysmman
.int
;
471 size
:= (size
+ pagesize
- 1) DIV pagesize
* pagesize
;
472 res
:= sysmman
.munmap(adr
, size
);
476 PROCEDURE AllocHeapMem (size
: INTEGER; VAR c
: Cluster
);
477 CONST N
= 65536; (* cluster size for dll *)
478 VAR adr
, allocated
, newsize
: INTEGER;
481 ASSERT(size
> 0, 100); adr
:= 0;
483 adr
:= AllocMem(N
, newsize
);
487 adr
:= AllocMem(size
, newsize
);
490 IF adr
= 0 THEN c
:= NIL
492 c
:= S
.VAL(Cluster
, (adr
+ 15) DIV 16 * 16); c
.max
:= adr
;
493 c
.size
:= allocated
- (S
.VAL(INTEGER, c
) - adr
);
494 INC(used
, c
.size
); INC(total
, c
.size
)
496 ASSERT((adr
= 0) OR (adr
MOD 16 = 0) & (c
.size
>= size
), 101);
497 (* post: (c = NIL) OR (c MOD 16 = 0) & (c.size >= size) *)
500 PROCEDURE FreeHeapMem (c
: Cluster
);
502 DEC(used
, c
.size
); DEC(total
, c
.size
);
503 FreeMem(S
.VAL(ADDRESS
, c
.max
), c
.size
)
506 PROCEDURE HeapFull (size
: INTEGER): BOOLEAN;
511 PROCEDURE AllocModMem
* (descSize
, modSize
: INTEGER; VAR descAdr
, modAdr
: INTEGER);
513 descAdr
:= 0; modAdr
:= 0;
514 descAdr
:= AllocMem(descSize
, descSize
);
516 modAdr
:= AllocMem(modSize
, modSize
);
518 FreeMem(descAdr
, descSize
)
520 INC(used
, descSize
+ modSize
)
525 PROCEDURE DeallocModMem
* (descSize
, modSize
, descAdr
, modAdr
: INTEGER);
527 FreeMem(descAdr
, descSize
);
528 FreeMem(modAdr
, modSize
);
529 DEC(used
, descSize
+ modSize
)
532 PROCEDURE InvalModMem (modSize
, modAdr
: INTEGER);
534 FreeMem(modAdr
, modSize
)
537 PROCEDURE IsReadable
* (from
, to
: INTEGER): BOOLEAN;
538 VAR r
: BOOLEAN; jmp
: setjmp
.sigjmp_buf
; res
: setjmp
.int
; i
: INTEGER; x
: BYTE;
541 jmp
:= checkReadableEnv
;
542 checkReadable
:= TRUE
;
543 res
:= setjmp
.sigsetjmp(checkReadableEnv
, 1);
546 FOR i
:= from
TO to
DO
550 FOR i
:= to
TO from BY
-1 DO
555 checkReadableEnv
:= jmp
;
560 (* --------------------- NEW implementation (portable) -------------------- *)
562 PROCEDURE^
NewBlock (size
: INTEGER): Block
;
564 PROCEDURE NewRec
* (typ
: INTEGER): INTEGER; (* implementation of NEW(ptr) *)
565 VAR size
, adr
: INTEGER; b
: Block
; tag
: Type
; l
: FList
;
568 tag
:= S
.VAL(Type
, typ
);
569 b
:= NewBlock(tag
.size
);
572 S
.GET(typ
- 4, size
);
573 IF size
# 0 THEN (* record uses a finalizer *)
574 l
:= S
.VAL(FList
, S
.ADR(b
.last
)); (* anchor new object! *)
575 l
:= S
.VAL(FList
, NewRec(S
.TYP(FList
))); (* NEW(l) *)
576 l
.blk
:= b
; l
.next
:= finalizers
; finalizers
:= l
583 HALT(100) (* COM interface pointers not supported *)
588 PROCEDURE NewArr
* (eltyp
, nofelem
, nofdim
: INTEGER): INTEGER; (* impl. of NEW(ptr, dim0, dim1, ...) *)
589 VAR b
: Block
; size
, headSize
: INTEGER; t
: Type
;
592 |
-1: HALT(100) (* COM interface pointers not supported *)
593 |
0: eltyp
:= S
.ADR(PtrType
)
594 |
1: eltyp
:= S
.ADR(Char8Type
)
595 |
2: eltyp
:= S
.ADR(Int16Type
)
596 |
3: eltyp
:= S
.ADR(Int8Type
)
597 |
4: eltyp
:= S
.ADR(Int32Type
)
598 |
5: eltyp
:= S
.ADR(BoolType
)
599 |
6: eltyp
:= S
.ADR(SetType
)
600 |
7: eltyp
:= S
.ADR(Real32Type
)
601 |
8: eltyp
:= S
.ADR(Real64Type
)
602 |
9: eltyp
:= S
.ADR(Char16Type
)
603 |
10: eltyp
:= S
.ADR(Int64Type
)
604 |
11: eltyp
:= S
.ADR(ProcType
)
605 |
12: eltyp
:= S
.ADR(UPtrType
)
607 ASSERT(~
ODD(eltyp
), 101) (* COM interface pointers not supported *)
609 t
:= S
.VAL(Type
, eltyp
);
610 headSize
:= 4 * nofdim
+ 12;
611 size
:= headSize
+ nofelem
* t
.size
;
614 b
.tag
:= S
.VAL(Type
, eltyp
+ 2); (* tag + array mark *)
615 b
.last
:= S
.ADR(b
.last
) + size
- t
.size
; (* pointer to last elem *)
616 b
.first
:= S
.ADR(b
.last
) + headSize
; (* pointer to first elem *)
623 (* -------------------- handler installation (portable) --------------------- *)
625 PROCEDURE ThisFinObj
* (VAR id
: Identifier
): ANYPTR
;
628 ASSERT(id
.typ
# 0, 100);
631 IF S
.VAL(INTEGER, l
.blk
.tag
) = id
.typ
THEN
632 id
.obj
:= S
.VAL(ANYPTR
, S
.ADR(l
.blk
.last
));
633 IF id
.Identified() THEN RETURN id
.obj
END
640 PROCEDURE InstallReducer
* (r
: Reducer
);
642 r
.next
:= reducers
; reducers
:= r
645 PROCEDURE InstallTrapViewer
* (h
: Handler
);
648 END InstallTrapViewer
;
650 PROCEDURE InstallTrapChecker
* (h
: Handler
);
653 END InstallTrapChecker
;
655 PROCEDURE PushTrapCleaner
* (c
: TrapCleaner
);
658 t
:= trapStack
; WHILE (t
# NIL) & (t
# c
) DO t
:= t
.next
END;
660 c
.next
:= trapStack
; trapStack
:= c
663 PROCEDURE PopTrapCleaner
* (c
: TrapCleaner
);
667 WHILE (trapStack
# NIL) & (t
# c
) DO
668 t
:= trapStack
; trapStack
:= trapStack
.next
672 PROCEDURE InstallCleaner
* (p
: Command
);
675 c
:= S
.VAL(CList
, NewRec(S
.TYP(CList
))); (* NEW(c) *)
676 c
.do
:= p
; c
.trapped
:= FALSE
; c
.next
:= cleaners
; cleaners
:= c
679 PROCEDURE RemoveCleaner
* (p
: Command
);
682 c
:= cleaners
; c0
:= NIL;
683 WHILE (c
# NIL) & (c
.do
# p
) DO c0
:= c
; c
:= c
.next
END;
685 IF c0
= NIL THEN cleaners
:= cleaners
.next
ELSE c0
.next
:= c
.next
END
692 c
:= cleaners
; c0
:= NIL;
695 c
.trapped
:= TRUE
; c
.do
; c
.trapped
:= FALSE
; c0
:= c
697 IF c0
= NIL THEN cleaners
:= cleaners
.next
698 ELSE c0
.next
:= c
.next
705 (* -------------------- meta information (portable) --------------------- *)
707 PROCEDURE (h
: LoaderHook
) ThisMod
* (IN name
: ARRAY OF CHAR): Module
, NEW, ABSTRACT
;
709 PROCEDURE SetLoaderHook
*(h
: LoaderHook
);
714 PROCEDURE InitModule (mod
: Module
); (* initialize linked modules *)
717 IF ~
(dyn
IN mod
.opts
) & (mod
.next
# NIL) & ~
(init
IN mod
.next
.opts
) THEN InitModule(mod
.next
) END;
718 IF ~
(init
IN mod
.opts
) THEN
719 body
:= S
.VAL(Command
, mod
.code
);
720 INCL(mod
.opts
, init
);
722 body(); actual
:= NIL
726 PROCEDURE ThisLoadedMod
* (IN name
: ARRAY OF CHAR): Module
; (* loaded modules only *)
727 VAR m
: Module
; res
: INTEGER; n
: Utf8Name
;
729 StringToUtf8(name
, n
, res
); ASSERT(res
= 0);
732 WHILE (m
# NIL) & ((m
.name
# n
) OR (m
.refcnt
< 0)) DO m
:= m
.next
END;
733 IF (m
# NIL) & ~
(init
IN m
.opts
) THEN InitModule(m
) END;
734 IF m
= NIL THEN loadres
:= moduleNotFound
END;
738 PROCEDURE ThisMod
* (IN name
: ARRAY OF CHAR): Module
;
742 RETURN loader
.ThisMod(name
)
744 RETURN ThisLoadedMod(name
)
748 PROCEDURE LoadMod
* (IN name
: ARRAY OF CHAR);
754 PROCEDURE GetLoaderResult
* (OUT res
: INTEGER; OUT importing
, imported
, object
: ARRAY OF CHAR);
758 importing
:= loader
.importing$
;
759 imported
:= loader
.imported$
;
760 object
:= loader
.object$
769 PROCEDURE ThisObject
* (mod
: Module
; IN name
: ARRAY OF CHAR): Object
;
770 VAR l
, r
, m
, res
: INTEGER; p
: StrPtr
; n
: Utf8Name
;
772 StringToUtf8(name
, n
, res
); ASSERT(res
= 0);
773 l
:= 0; r
:= mod
.export
.num
;
774 WHILE l
< r
DO (* binary search *)
776 p
:= S
.VAL(StrPtr
, S
.ADR(mod
.names
[mod
.export
.obj
[m
].id
DIV 256]));
777 IF p^
= n
THEN RETURN S
.VAL(Object
, S
.ADR(mod
.export
.obj
[m
])) END;
778 IF p^
< n
THEN l
:= m
+ 1 ELSE r
:= m
END
783 PROCEDURE ThisDesc
* (mod
: Module
; fprint
: INTEGER): Object
;
786 i
:= 0; n
:= mod
.export
.num
;
787 WHILE (i
< n
) & (mod
.export
.obj
[i
].id
DIV 256 = 0) DO
788 IF mod
.export
.obj
[i
].offs
= fprint
THEN RETURN S
.VAL(Object
, S
.ADR(mod
.export
.obj
[i
])) END;
794 PROCEDURE ThisField
* (rec
: Type
; IN name
: ARRAY OF CHAR): Object
;
795 VAR n
, res
: INTEGER; p
: StrPtr
; obj
: Object
; m
: Module
; nn
: Utf8Name
;
797 StringToUtf8(name
, nn
, res
); ASSERT(res
= 0);
799 obj
:= S
.VAL(Object
, S
.ADR(rec
.fields
.obj
[0])); n
:= rec
.fields
.num
;
801 p
:= S
.VAL(StrPtr
, S
.ADR(m
.names
[obj
.id
DIV 256]));
802 IF p^
= nn
THEN RETURN obj
END;
803 DEC(n
); INC(S
.VAL(INTEGER, obj
), 16)
808 PROCEDURE ThisCommand
* (mod
: Module
; IN name
: ARRAY OF CHAR): Command
;
809 VAR x
: Object
; sig
: Signature
;
811 x
:= ThisObject(mod
, name
);
812 IF (x
# NIL) & (x
.id
MOD 16 = mProc
) THEN
813 sig
:= S
.VAL(Signature
, x
.struct
);
814 IF (sig
.retStruct
= NIL) & (sig
.num
= 0) THEN RETURN S
.VAL(Command
, mod
.procBase
+ x
.offs
) END
819 PROCEDURE ThisType
* (mod
: Module
; IN name
: ARRAY OF CHAR): Type
;
822 x
:= ThisObject(mod
, name
);
823 IF (x
# NIL) & (x
.id
MOD 16 = mTyp
) & (S
.VAL(INTEGER, x
.struct
) DIV 256 # 0) THEN
830 PROCEDURE TypeOf
* (IN rec
: ANYREC
): Type
;
832 RETURN S
.VAL(Type
, S
.TYP(rec
))
835 PROCEDURE LevelOf
* (t
: Type
): SHORTINT;
837 RETURN SHORT(t
.id
DIV 16 MOD 16)
840 PROCEDURE NewObj
* (VAR o
: S
.PTR
; t
: Type
);
843 IF t
.size
= -1 THEN o
:= NIL
845 i
:= 0; WHILE t
.ptroffs
[i
] >= 0 DO INC(i
) END;
846 IF t
.ptroffs
[i
+1] >= 0 THEN INC(S
.VAL(INTEGER, t
)) END; (* with interface pointers *)
847 o
:= S
.VAL(S
.PTR
, NewRec(S
.VAL(INTEGER, t
))) (* generic NEW *)
851 PROCEDURE GetModName
* (mod
: Module
; OUT name
: Name
);
854 Utf8ToString(mod
.name
, name
, res
); ASSERT(res
= 0)
857 PROCEDURE GetObjName
* (mod
: Module
; obj
: Object
; OUT name
: Name
);
858 VAR p
: StrPtr
; res
: INTEGER;
860 p
:= S
.VAL(StrPtr
, S
.ADR(mod
.names
[obj
.id
DIV 256]));
861 Utf8ToString(p^$
, name
, res
); ASSERT(res
= 0)
864 PROCEDURE GetTypeName
* (t
: Type
; OUT name
: Name
);
865 VAR p
: StrPtr
; res
: INTEGER;
867 p
:= S
.VAL(StrPtr
, S
.ADR(t
.mod
.names
[t
.id
DIV 256]));
868 Utf8ToString(p^$
, name
, res
); ASSERT(res
= 0)
871 PROCEDURE RegisterMod
* (mod
: Module
);
872 VAR i
: INTEGER; epoch
: time
.time_t
; tm
: time
.struct_tm
; ptm
: time
.Pstruct_tm
;
874 mod
.next
:= modList
; modList
:= mod
; mod
.refcnt
:= 0; INCL(mod
.opts
, dyn
); i
:= 0;
875 WHILE i
< mod
.nofimps
DO
876 IF mod
.imports
[i
] # NIL THEN INC(mod
.imports
[i
].refcnt
) END;
879 epoch
:= time
.time(NIL);
880 ptm
:= time
.localtime_r(epoch
, tm
);
882 mod
.loadTime
[0] := SHORT(tm
.tm_year
+ 1900);
883 mod
.loadTime
[1] := SHORT(tm
.tm_mon
+ 1);
884 mod
.loadTime
[2] := SHORT(tm
.tm_mday
);
885 mod
.loadTime
[3] := SHORT(tm
.tm_hour
);
886 mod
.loadTime
[4] := SHORT(tm
.tm_min
);
887 mod
.loadTime
[5] := SHORT(tm
.tm_sec
)
889 mod
.loadTime
[0] := 0;
890 mod
.loadTime
[1] := 0;
891 mod
.loadTime
[2] := 0;
892 mod
.loadTime
[3] := 0;
893 mod
.loadTime
[4] := 0;
896 IF ~
(init
IN mod
.opts
) THEN InitModule(mod
) END
901 PROCEDURE UnloadMod
* (mod
: Module
);
902 VAR i
: INTEGER; t
: Command
;
904 IF mod
.refcnt
= 0 THEN
905 t
:= mod
.term
; mod
.term
:= NIL;
906 IF t
# NIL THEN t() END; (* terminate module *)
908 WHILE i
< mod
.nofptrs
DO (* release global pointers *)
909 S
.PUT(mod
.varBase
+ mod
.ptrs
[i
], 0); INC(i
)
911 Collect
; (* call finalizers *)
913 WHILE i
< mod
.nofimps
DO (* release imported modules *)
914 IF mod
.imports
[i
] # NIL THEN DEC(mod
.imports
[i
].refcnt
) END;
918 IF dyn
IN mod
.opts
THEN (* release memory *)
919 InvalModMem(mod
.data
+ mod
.dsize
- mod
.refs
, mod
.refs
)
924 (* -------------------- dynamic procedure call --------------------- *)
933 open array address length .. length
936 PROCEDURE Call
* (adr
: ADDRESS
; sig
: Signature
; IN par
: ARRAY OF INTEGER; n
: INTEGER): LONGINT;
939 mConst
= 1; mTyp
= 2; mVar
= 3; mProc
= 4; mField
= 5;
941 mBool
= 1; mChar8
= 2; mChar16
= 3; mInt8
= 4; mInt16
= 5; mInt32
= 6;
942 mReal32
= 7; mReal64
= 8; mSet
= 9; mInt64
= 10; mAnyRec
= 11; mAnyPtr
= 12; mSysPtr
= 13;
944 mProctyp
= 0; mRecord
= 1; mArray
= 2; mPointer
= 3;
945 (* ??? obj.id DIV 16 MOD 16 *)
946 mInternal
= 1; mReadonly
= 2; mPrivate
= 3; mExported
= 4;
947 (* sig.par[].id MOD 16 *)
948 mValue
= 10; mInPar
= 11; mOutPar
= 12; mVarPar
= 13;
949 mInterface
= 32; mGuid
= 33; mResult
= 34;
950 (* implementation restrictions *)
955 Ptype
= POINTER TO LibFFI
.type
;
956 PPtype
= POINTER TO ARRAY [untagged
] OF Ptype
;
958 status
: LibFFI
.status
;
959 kind
, form
, size
: INTEGER;
960 i
, p
, d
, cn
, ut
, ue
: INTEGER;
963 earg
: ARRAY maxElms
OF Ptype
;
964 targ
: ARRAY maxStrs
OF LibFFI
.type
;
965 farg
: ARRAY maxPars
OF Ptype
;
966 varg
: ARRAY maxPars
OF ADDRESS
;
970 PROCEDURE SetType (IN typ
: LibFFI
.type
);
972 farg
[cn
] := S
.VAL(Ptype
, S
.ADR(typ
));
975 PROCEDURE PushAdr (size
: INTEGER);
977 ASSERT(size
IN {1, 2, 4, 8}, 20);
978 ASSERT(littleEndian
OR (size
<= 4), 100); (* !!! swap 64bit value *)
979 varg
[cn
] := S
.ADR(par
[d
]);
980 INC(cn
); INC(d
, MAX(1, size
DIV 4))
983 PROCEDURE PushVal (size
: INTEGER);
985 ASSERT(size
IN {1, 2, 4, 8}, 20);
986 ASSERT(littleEndian
OR (size
<= 4), 100); (* !!! swap 64bit value *)
988 INC(cn
); INC(d
, MAX(1, size
DIV 4))
991 PROCEDURE Push (IN typ
: LibFFI
.type
);
993 SetType(typ
); PushAdr(typ
.size
)
997 p
:= 0; cn
:= 0; d
:= 0; ut
:= 0; ue
:= 0;
999 typ
:= sig
.par
[p
].struct
;
1000 kind
:= sig
.par
[p
].id
MOD 16;
1001 IF S
.VAL(ADDRESS
, typ
) DIV 256 = 0 THEN (* basic types *)
1002 form
:= S
.VAL(ADDRESS
, typ
) MOD 256;
1003 IF kind
= mValue
THEN
1005 | mBool
, mChar8
: Push(LibFFI
.type_uint8
)
1006 | mChar16
: Push(LibFFI
.type_uint16
)
1007 | mInt8
: Push(LibFFI
.type_sint8
)
1008 | mInt16
: Push(LibFFI
.type_sint16
)
1009 | mInt32
: Push(LibFFI
.type_sint32
)
1010 | mReal32
: Push(LibFFI
.type_float
)
1011 | mReal64
: Push(LibFFI
.type_double
)
1012 | mSet
: Push(LibFFI
.type_uint32
)
1013 | mInt64
: Push(LibFFI
.type_sint64
)
1014 | mAnyPtr
, mSysPtr
: Push(LibFFI
.type_pointer
)
1015 ELSE HALT(100) (* unsupported type *)
1017 ELSIF kind
IN {mInPar
..mVarPar
} THEN
1019 | mBool
..mInt64
, mAnyPtr
, mSysPtr
: Push(LibFFI
.type_pointer
)
1020 | mAnyRec
: Push(LibFFI
.type_pointer
); Push(LibFFI
.type_pointer
) (* address + tag *)
1021 ELSE HALT(101) (* unsupported type *)
1024 HALT(102) (* unsupported parameter kind *)
1027 CASE typ
.id
MOD 4 OF
1028 | mProctyp
, mPointer
:
1029 Push(LibFFI
.type_pointer
)
1031 IF kind
= mValue
THEN
1033 targ
[ut
].alignment
:= 0;
1034 targ
[ut
].type
:= LibFFI
.TYPE_STRUCT
;
1035 targ
[ut
].elements
:= S
.VAL(PPtype
, S
.ADR(earg
[ue
]));
1036 SetType(targ
[ut
]); INC(ut
);
1037 size
:= MAX(1, typ
.size
);
1038 (* !!! better to pass original layout *)
1040 earg
[ue
] := S
.VAL(Ptype
, S
.ADR(LibFFI
.type_uint64
));
1041 INC(ue
); DEC(size
, 8)
1044 earg
[ue
] := S
.VAL(Ptype
, S
.ADR(LibFFI
.type_uint32
));
1045 INC(ue
); DEC(size
, 4)
1048 earg
[ue
] := S
.VAL(Ptype
, S
.ADR(LibFFI
.type_uint16
));
1049 INC(ue
); DEC(size
, 2)
1052 earg
[ue
] := S
.VAL(Ptype
, S
.ADR(LibFFI
.type_uint32
));
1057 PushVal(LibFFI
.type_pointer
.size
);
1058 INC(d
) (* skip tag *)
1059 ELSIF kind
IN {mInPar
..mVarPar
} THEN
1060 Push(LibFFI
.type_pointer
); (* address *)
1061 Push(LibFFI
.type_pointer
); (* tag *)
1062 ELSE HALT(103) (* unsupported parameter kind *)
1065 Push(LibFFI
.type_pointer
);
1066 ASSERT(kind
IN {mValue
..mVarPar
}, 104); (* unsupported parameter kind *)
1067 (* array copying generated by CPfront, so we can just pass address *)
1068 IF typ
.size
= 0 THEN (* open array *)
1069 FOR i
:= 0 TO typ
.id
DIV 16 - 1 DO
1070 Push(LibFFI
.type_sint32
) (* dim size *)
1072 ELSE (* fix array *)
1073 INC(d
) (* skip size *)
1080 typ
:= sig
.retStruct
;
1081 IF typ
= NIL THEN fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_void
))
1082 ELSIF S
.VAL(ADDRESS
, typ
) DIV 256 = 0 THEN
1083 form
:= S
.VAL(ADDRESS
, typ
) MOD 256;
1085 | mBool
, mChar8
: fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_uint8
))
1086 | mChar16
: fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_uint16
))
1087 | mInt8
: fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_sint8
))
1088 | mInt16
: fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_sint16
))
1089 | mInt32
: fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_sint32
))
1090 | mReal32
: fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_float
))
1091 | mReal64
: fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_double
))
1092 | mSet
: fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_uint32
))
1093 | mInt64
: fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_sint64
))
1094 | mAnyPtr
, mSysPtr
: fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_pointer
))
1095 ELSE HALT(106) (* unsupported type *)
1098 CASE typ
.id
MOD 4 OF
1099 | mProctyp
, mPointer
: fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_pointer
))
1100 ELSE HALT(107) (* unsupported type *)
1103 status
:= LibFFI
.prep_cif(cif
, LibFFI
.DEFAULT_ABI
, cn
, fret
, farg
);
1104 ASSERT(status
= LibFFI
.OK
, 108);
1106 IF littleEndian
THEN LibFFI
.call(cif
, adr
, S
.ADR(vret
), S
.ADR(varg
))
1107 ELSE LibFFI
.call(cif
, adr
, S
.ADR(vret
) + (8 - fret
.size
), S
.ADR(varg
))
1112 (* -------------------- reference information (portable) --------------------- *)
1114 PROCEDURE RefCh (VAR ref
: INTEGER; OUT ch
: SHORTCHAR
);
1116 S
.GET(ref
, ch
); INC(ref
)
1119 PROCEDURE RefNum (VAR ref
: INTEGER; OUT x
: INTEGER);
1120 VAR s
, n
: INTEGER; ch
: SHORTCHAR
;
1122 s
:= 0; n
:= 0; RefCh(ref
, ch
);
1123 WHILE ORD(ch
) >= 128 DO INC(n
, ASH(ORD(ch
) - 128, s
) ); INC(s
, 7); RefCh(ref
, ch
) END;
1124 x
:= n
+ ASH(ORD(ch
) MOD 64 - ORD(ch
) DIV 64 * 64, s
)
1127 PROCEDURE RefName (VAR ref
: INTEGER; OUT n
: Utf8Name
);
1128 VAR i
: INTEGER; ch
: SHORTCHAR
;
1130 i
:= 0; RefCh(ref
, ch
);
1131 WHILE ch
# 0X
DO n
[i
] := ch
; INC(i
); RefCh(ref
, ch
) END;
1135 PROCEDURE GetRefProc
* (VAR ref
: INTEGER; OUT adr
: INTEGER; OUT name
: Utf8Name
);
1139 WHILE ch
>= 0FDX
DO (* skip variables *)
1140 INC(ref
); RefCh(ref
, ch
);
1141 IF ch
= 10X
THEN INC(ref
, 4) END;
1142 RefNum(ref
, adr
); RefName(ref
, name
); S
.GET(ref
, ch
)
1144 WHILE (ch
> 0X
) & (ch
< 0FCX
) DO (* skip source refs *)
1145 INC(ref
); RefNum(ref
, adr
); S
.GET(ref
, ch
)
1147 IF ch
= 0FCX
THEN INC(ref
); RefNum(ref
, adr
); RefName(ref
, name
)
1152 PROCEDURE GetRefVar
* (VAR ref
: INTEGER; OUT mode
, form
: SHORTCHAR
; OUT desc
: Type
; OUT adr
: INTEGER; OUT name
: Utf8Name
);
1154 S
.GET(ref
, mode
); desc
:= NIL;
1155 IF mode
>= 0FDX
THEN
1156 mode
:= SHORT(CHR(ORD(mode
) - 0FCH
));
1157 INC(ref
); RefCh(ref
, form
);
1159 S
.GET(ref
, desc
); INC(ref
, 4); form
:= SHORT(CHR(16 + desc
.id
MOD 4))
1161 RefNum(ref
, adr
); RefName(ref
, name
)
1163 mode
:= 0X
; form
:= 0X
; adr
:= 0
1167 PROCEDURE SourcePos
* (mod
: Module
; codePos
: INTEGER): INTEGER;
1168 VAR ref
, pos
, ad
, d
: INTEGER; ch
: SHORTCHAR
; name
: Utf8Name
;
1170 IF mod
# NIL THEN (* mf, 12.02.04 *)
1171 ref
:= mod
.refs
; pos
:= 0; ad
:= 0; S
.GET(ref
, ch
);
1173 WHILE (ch
> 0X
) & (ch
< 0FCX
) DO (* srcref: {dAdr,dPos} *)
1174 INC(ad
, ORD(ch
)); INC(ref
); RefNum(ref
, d
);
1175 IF ad
> codePos
THEN RETURN pos
END;
1176 INC(pos
, d
); S
.GET(ref
, ch
)
1178 IF ch
= 0FCX
THEN (* proc: 0FCX,Adr,Name *)
1179 INC(ref
); RefNum(ref
, d
); RefName(ref
, name
); S
.GET(ref
, ch
);
1180 IF (d
> codePos
) & (pos
> 0) THEN RETURN pos
END
1182 WHILE ch
>= 0FDX
DO (* skip variables: Mode, Form, adr, Name *)
1183 INC(ref
); RefCh(ref
, ch
);
1184 IF ch
= 10X
THEN INC(ref
, 4) END;
1185 RefNum(ref
, d
); RefName(ref
, name
); S
.GET(ref
, ch
)
1192 PROCEDURE LoadDll
* (IN name
: ARRAY OF CHAR; VAR ok
: BOOLEAN);
1193 VAR h
: ADDRESS
; file
: Utf8Name
; res
: INTEGER;
1195 StringToUtf8(name
, file
, res
);
1197 h
:= dlfcn
.dlopen(file
, dlfcn
.RTLD_LAZY
+ dlfcn
.RTLD_GLOBAL
);
1204 PROCEDURE ThisDllObj
* (mode
, fprint
: INTEGER; IN dll
, name
: ARRAY OF CHAR): INTEGER;
1205 VAR h
, p
: ADDRESS
; file
, sym
: Utf8Name
; res
: INTEGER; err
: dlfcn
.int
;
1207 StringToUtf8(dll
, file
, res
);
1209 h
:= dlfcn
.dlopen(file
, dlfcn
.RTLD_LAZY
+ dlfcn
.RTLD_GLOBAL
);
1211 StringToUtf8(name
, sym
, res
);
1213 p
:= dlfcn
.dlsym(h
, sym
)
1217 err
:= dlfcn
.dlclose(h
);
1218 ASSERT(err
= 0, 100)
1228 (* -------------------- garbage collector (portable) --------------------- *)
1230 PROCEDURE Mark (this
: Block
);
1231 VAR father
, son
: Block
; tag
: Type
; flag
, offset
, actual
: INTEGER;
1233 IF ~
ODD(S
.VAL(INTEGER, this
.tag
)) THEN
1236 INC(S
.VAL(INTEGER, this
.tag
));
1237 flag
:= S
.VAL(INTEGER, this
.tag
) MOD 4;
1238 tag
:= S
.VAL(Type
, S
.VAL(INTEGER, this
.tag
) - flag
);
1239 IF flag
>= 2 THEN actual
:= this
.first
; this
.actual
:= actual
1240 ELSE actual
:= S
.ADR(this
.last
)
1243 offset
:= tag
.ptroffs
[0];
1245 INC(S
.VAL(INTEGER, tag
), offset
+ 4); (* restore tag *)
1246 IF (flag
>= 2) & (actual
< this
.last
) & (offset
< -4) THEN (* next array element *)
1247 INC(actual
, tag
.size
); this
.actual
:= actual
1249 this
.tag
:= S
.VAL(Type
, S
.VAL(INTEGER, tag
) + flag
);
1250 IF father
= NIL THEN RETURN END;
1251 son
:= this
; this
:= father
;
1252 flag
:= S
.VAL(INTEGER, this
.tag
) MOD 4;
1253 tag
:= S
.VAL(Type
, S
.VAL(INTEGER, this
.tag
) - flag
);
1254 offset
:= tag
.ptroffs
[0];
1255 IF flag
>= 2 THEN actual
:= this
.actual
ELSE actual
:= S
.ADR(this
.last
) END;
1256 S
.GET(actual
+ offset
, father
); S
.PUT(actual
+ offset
, S
.ADR(son
.last
));
1257 INC(S
.VAL(INTEGER, tag
), 4)
1260 S
.GET(actual
+ offset
, son
);
1262 DEC(S
.VAL(INTEGER, son
), 4);
1263 IF ~
ODD(S
.VAL(INTEGER, son
.tag
)) THEN (* down *)
1264 this
.tag
:= S
.VAL(Type
, S
.VAL(INTEGER, tag
) + flag
);
1265 S
.PUT(actual
+ offset
, father
); father
:= this
; this
:= son
;
1269 INC(S
.VAL(INTEGER, tag
), 4)
1276 PROCEDURE MarkGlobals
;
1277 VAR m
: Module
; i
, p
: INTEGER;
1281 IF m
.refcnt
>= 0 THEN
1283 WHILE i
< m
.nofptrs
DO
1284 S
.GET(m
.varBase
+ m
.ptrs
[i
], p
); INC(i
);
1285 IF p
# 0 THEN Mark(S
.VAL(Block
, p
- 4)) END
1292 PROCEDURE Next (b
: Block
): Block
; (* next block in same cluster *)
1295 S
.GET(S
.VAL(INTEGER, b
.tag
) DIV 4 * 4, size
);
1296 IF ODD(S
.VAL(INTEGER, b
.tag
) DIV 2) THEN INC(size
, b
.last
- S
.ADR(b
.last
)) END;
1297 RETURN S
.VAL(Block
, S
.VAL(INTEGER, b
) + (size
+ 19) DIV 16 * 16)
1300 PROCEDURE CheckCandidates
;
1301 (* pre: nofcand > 0 *)
1302 VAR i
, j
, h
, p
, end
: INTEGER; c
: Cluster
; blk
, next
: Block
;
1304 (* sort candidates (shellsort) *)
1305 h
:= 1; REPEAT h
:= h
*3 + 1 UNTIL h
> nofcand
;
1306 REPEAT h
:= h
DIV 3; i
:= h
;
1307 WHILE i
< nofcand
DO p
:= candidates
[i
]; j
:= i
;
1308 WHILE (j
>= h
) & (candidates
[j
-h
] > p
) DO
1309 candidates
[j
] := candidates
[j
-h
]; j
:= j
-h
1311 candidates
[j
] := p
; INC(i
)
1317 blk
:= S
.VAL(Block
, S
.VAL(INTEGER, c
) + 12);
1318 end
:= S
.VAL(INTEGER, blk
) + (c
.size
- 12) DIV 16 * 16;
1319 WHILE candidates
[i
] < S
.VAL(INTEGER, blk
) DO
1321 IF i
= nofcand
THEN RETURN END
1323 WHILE S
.VAL(INTEGER, blk
) < end
DO
1325 IF candidates
[i
] < S
.VAL(INTEGER, next
) THEN
1326 IF (S
.VAL(INTEGER, blk
.tag
) # S
.ADR(blk
.last
)) (* not a free block *)
1327 & (~strictStackSweep
OR (candidates
[i
] = S
.ADR(blk
.last
))) THEN
1332 IF i
= nofcand
THEN RETURN END
1333 UNTIL candidates
[i
] >= S
.VAL(INTEGER, next
)
1335 IF (S
.VAL(INTEGER, blk
.tag
) MOD 4 = 0) & (S
.VAL(INTEGER, blk
.tag
) # S
.ADR(blk
.last
))
1336 & (blk
.tag
.base
[0] = NIL) & (blk
.actual
> 0) THEN (* referenced interface record *)
1343 END CheckCandidates
;
1345 PROCEDURE MarkLocals
;
1346 VAR sp
, p
, min
, max
: INTEGER; c
: Cluster
;
1348 sp
:= S
.ADR(sp
); nofcand
:= 0; c
:= root
;
1349 WHILE c
.next
# NIL DO c
:= c
.next
END;
1350 min
:= S
.VAL(INTEGER, root
); max
:= S
.VAL(INTEGER, c
) + c
.size
;
1351 WHILE sp
< baseStack
DO
1353 IF (p
> min
) & (p
< max
) & (~strictStackSweep
OR (p
MOD 16 = 0)) THEN
1354 candidates
[nofcand
] := p
; INC(nofcand
);
1355 IF nofcand
= LEN(candidates
) - 1 THEN CheckCandidates
; nofcand
:= 0 END
1359 candidates
[nofcand
] := max
; INC(nofcand
); (* ensure complete scan for interface mark*)
1360 IF nofcand
> 0 THEN CheckCandidates
END
1363 PROCEDURE MarkFinObj
;
1366 wouldFinalize
:= FALSE
;
1369 IF ~
ODD(S
.VAL(INTEGER, f
.blk
.tag
)) THEN wouldFinalize
:= TRUE
END;
1374 WHILE f
# NIL DO IF ~
ODD(S
.VAL(INTEGER, f
.blk
.tag
)) THEN wouldFinalize
:= TRUE
END;
1380 PROCEDURE CheckFinalizers
;
1381 VAR f
, g
, h
, k
: FList
;
1383 f
:= finalizers
; g
:= NIL;
1384 IF hotFinalizers
= NIL THEN k
:= NIL
1387 WHILE k
.next
# NIL DO k
:= k
.next
END
1390 h
:= f
; f
:= f
.next
;
1391 IF ~
ODD(S
.VAL(INTEGER, h
.blk
.tag
)) THEN
1392 IF g
= NIL THEN finalizers
:= f
ELSE g
.next
:= f
END;
1393 IF k
= NIL THEN hotFinalizers
:= h
ELSE k
.next
:= h
END;
1394 k
:= h
; h
.next
:= NIL
1399 WHILE h
# NIL DO Mark(h
.blk
); h
:= h
.next
END
1400 END CheckFinalizers
;
1402 PROCEDURE ExecFinalizer (a
, b
, c
: INTEGER);
1403 VAR f
: FList
; fin
: PROCEDURE(this
: ANYPTR
);
1405 f
:= S
.VAL(FList
, a
);
1406 S
.GET(S
.VAL(INTEGER, f
.blk
.tag
) - 4, fin
); (* method 0 *)
1407 IF (fin
# NIL) & (f
.blk
.tag
.mod
.refcnt
>= 0) THEN fin(S
.VAL(ANYPTR
, S
.ADR(f
.blk
.last
))) END;
1410 PROCEDURE^ Try
* (h
: TryHandler
; a
, b
, c
: INTEGER); (* COMPILER DEPENDENT *)
1412 PROCEDURE CallFinalizers
;
1415 WHILE hotFinalizers
# NIL DO
1416 f
:= hotFinalizers
; hotFinalizers
:= hotFinalizers
.next
;
1417 Try(ExecFinalizer
, S
.VAL(INTEGER, f
), 0, 0)
1419 wouldFinalize
:= FALSE
1422 PROCEDURE Insert (blk
: FreeBlock
; size
: INTEGER); (* insert block in free list *)
1425 blk
.size
:= size
- 4; blk
.tag
:= S
.VAL(Type
, S
.ADR(blk
.size
));
1426 i
:= MIN(N
- 1, (blk
.size
DIV 16));
1427 blk
.next
:= free
[i
]; free
[i
] := blk
1430 PROCEDURE Sweep (dealloc
: BOOLEAN);
1431 VAR cluster
, last
, c
: Cluster
; blk
, next
: Block
; fblk
, b
, t
: FreeBlock
; end
, i
: INTEGER;
1433 cluster
:= root
; last
:= NIL; allocated
:= 0;
1435 REPEAT DEC(i
); free
[i
] := sentinel
UNTIL i
= 0;
1436 WHILE cluster
# NIL DO
1437 blk
:= S
.VAL(Block
, S
.VAL(INTEGER, cluster
) + 12);
1438 end
:= S
.VAL(INTEGER, blk
) + (cluster
.size
- 12) DIV 16 * 16;
1440 WHILE S
.VAL(INTEGER, blk
) < end
DO
1442 IF ODD(S
.VAL(INTEGER, blk
.tag
)) THEN
1444 Insert(fblk
, S
.VAL(INTEGER, blk
) - S
.VAL(INTEGER, fblk
));
1447 DEC(S
.VAL(INTEGER, blk
.tag
)); (* unmark *)
1448 INC(allocated
, S
.VAL(INTEGER, next
) - S
.VAL(INTEGER, blk
))
1449 ELSIF fblk
= NIL THEN
1450 fblk
:= S
.VAL(FreeBlock
, blk
)
1454 IF dealloc
& (S
.VAL(INTEGER, fblk
) = S
.VAL(INTEGER, cluster
) + 12) THEN (* deallocate cluster *)
1455 c
:= cluster
; cluster
:= cluster
.next
;
1456 IF last
= NIL THEN root
:= cluster
ELSE last
.next
:= cluster
END;
1459 IF fblk
# NIL THEN Insert(fblk
, end
- S
.VAL(INTEGER, fblk
)) END;
1460 last
:= cluster
; cluster
:= cluster
.next
1463 (* reverse free list *)
1467 b
:= free
[i
]; fblk
:= sentinel
;
1468 WHILE b
# sentinel
DO t
:= b
; b
:= t
.next
; t
.next
:= fblk
; fblk
:= t
END;
1476 CallFinalizers
; (* trap cleanup *)
1485 PROCEDURE FastCollect
*;
1495 PROCEDURE WouldFinalize
* (): BOOLEAN;
1497 RETURN wouldFinalize
1500 (* --------------------- memory allocation (portable) -------------------- *)
1502 PROCEDURE OldBlock (size
: INTEGER): FreeBlock
; (* size MOD 16 = 0 *)
1503 VAR b
, l
: FreeBlock
; s
, i
: INTEGER;
1506 i
:= MIN(N
- 1, s
DIV 16);
1507 WHILE (i
# N
- 1) & (free
[i
] = sentinel
) DO INC(i
) END;
1508 b
:= free
[i
]; l
:= NIL;
1509 WHILE b
.size
< s
DO l
:= b
; b
:= b
.next
END;
1510 IF b
# sentinel
THEN
1511 IF l
= NIL THEN free
[i
] := b
.next
ELSE l
.next
:= b
.next
END
1517 PROCEDURE LastBlock (limit
: INTEGER): FreeBlock
; (* size MOD 16 = 0 *)
1518 VAR b
, l
: FreeBlock
; s
, i
: INTEGER;
1523 b
:= free
[i
]; l
:= NIL;
1524 WHILE (b
# sentinel
) & (S
.VAL(INTEGER, b
) + b
.size
# s
) DO l
:= b
; b
:= b
.next
END;
1525 IF b
# sentinel
THEN
1526 IF l
= NIL THEN free
[i
] := b
.next
ELSE l
.next
:= b
.next
END
1530 UNTIL (b
# NIL) OR (i
= N
);
1534 PROCEDURE NewBlock (size
: INTEGER): Block
;
1535 VAR tsize
, a
, s
: INTEGER; b
: FreeBlock
; new
, c
: Cluster
; r
: Reducer
;
1537 ASSERT(size
>= 0, 20);
1538 IF size
> MAX(INTEGER) - 19 THEN RETURN NIL END;
1539 tsize
:= (size
+ 19) DIV 16 * 16;
1540 b
:= OldBlock(tsize
); (* 1) search for free block *)
1542 FastCollect
; b
:= OldBlock(tsize
); (* 2) collect *)
1544 Collect
; b
:= OldBlock(tsize
); (* 2a) fully collect *)
1547 AllocHeapMem(tsize
+ 12, new
); (* 3) allocate new cluster *)
1549 IF (root
= NIL) OR (S
.VAL(INTEGER, new
) < S
.VAL(INTEGER, root
)) THEN
1550 new
.next
:= root
; root
:= new
1553 WHILE (c
.next
# NIL) & (S
.VAL(INTEGER, new
) > S
.VAL(INTEGER, c
.next
)) DO c
:= c
.next
END;
1554 new
.next
:= c
.next
; c
.next
:= new
1556 b
:= S
.VAL(FreeBlock
, S
.VAL(INTEGER, new
) + 12);
1557 b
.size
:= (new
.size
- 12) DIV 16 * 16 - 4
1559 RETURN NIL (* 4) give up *)
1564 a
:= b
.size
+ 4 - tsize
;
1565 IF a
> 0 THEN Insert(S
.VAL(FreeBlock
, S
.VAL(INTEGER, b
) + tsize
), a
) END;
1566 IF size
> 0 THEN Erase(S
.ADR(b
.size
), (size
+ 3) DIV 4) END;
1567 INC(allocated
, tsize
);
1568 RETURN S
.VAL(Block
, b
)
1571 PROCEDURE Allocated
* (): INTEGER;
1576 PROCEDURE Used
* (): INTEGER;
1581 PROCEDURE Root
* (): INTEGER;
1583 RETURN S
.VAL(INTEGER, root
)
1586 (* -------------------- Trap Handling --------------------- *)
1588 PROCEDURE [code
] GetDLink (): DLink
"(Kernel_DLink)SYSTEM_dlink";
1589 PROCEDURE [code
] SetDLink (dl
: DLink
) "SYSTEM_dlink = (SYSTEM_DLINK*)dl";
1591 PROCEDURE Start
* (code
: Command
);
1592 VAR res
: setjmp
.int
; dl
: DLink
;
1595 baseStack
:= S
.ADR(code
); (* XXX: expected that target uses one stack *)
1596 startDLink
:= GetDLink();
1597 res
:= setjmp
.sigsetjmp(startEnv
, 1);
1601 PROCEDURE Quit
* (exitCode
: INTEGER);
1602 VAR m
: Module
; term
: Command
; t
: BOOLEAN;
1604 trapViewer
:= NIL; trapChecker
:= NIL; restart
:= NIL;
1605 t
:= terminating
; terminating
:= TRUE
; m
:= modList
;
1606 WHILE m
# NIL DO (* call terminators *)
1607 IF ~static
OR ~t
THEN
1608 term
:= m
.term
; m
.term
:= NIL;
1609 IF term
# NIL THEN term() END
1614 hotFinalizers
:= finalizers
; finalizers
:= NIL;
1616 stdlib
.exit(exitCode
)
1619 PROCEDURE FatalError
* (id
: INTEGER; str
: ARRAY OF CHAR);
1620 VAR res
: stdio
.int
; title
: ARRAY 16 OF CHAR; text
: ARRAY 256 OF SHORTCHAR
;
1622 title
:= "Error xy";
1623 title
[6] := CHR(id
DIV 10 + ORD("0"));
1624 title
[7] := CHR(id
MOD 10 + ORD("0"));
1625 res
:= unistd
.write(2, S
.ADR(title
), 8);
1629 PROCEDURE DefaultTrapViewer
;
1630 VAR out
: ARRAY 256 OF SHORTCHAR
; c
, len
: INTEGER; res
: unistd
.int
; dl
: DLink
;
1632 PROCEDURE WriteString (IN s
: ARRAY OF SHORTCHAR
);
1636 WHILE (len
< LEN(out
) - 1) & (s
[i
] # 0X
) DO out
[len
] := s
[i
]; INC(i
); INC(len
) END
1639 PROCEDURE WriteHex (x
, n
: INTEGER);
1642 IF len
+ n
< LEN(out
) THEN
1645 y
:= x
MOD 16; x
:= x
DIV 16;
1646 IF y
> 9 THEN y
:= y
+ (ORD("A") - ORD("0") - 10) END;
1647 out
[i
] := SHORT(CHR(y
+ ORD("0"))); DEC(i
)
1655 IF len
< LEN(out
) - 1 THEN out
[len
] := 0AX
; INC(len
) END
1660 WriteString("====== ");
1661 IF err
= 129 THEN WriteString("invalid with")
1662 ELSIF err
= 130 THEN WriteString("invalid case")
1663 ELSIF err
= 131 THEN WriteString("function without return")
1664 ELSIF err
= 132 THEN WriteString("type guard")
1665 ELSIF err
= 133 THEN WriteString("implied type guard")
1666 ELSIF err
= 134 THEN WriteString("value out of range")
1667 ELSIF err
= 135 THEN WriteString("index out of range")
1668 ELSIF err
= 136 THEN WriteString("string too long")
1669 ELSIF err
= 137 THEN WriteString("stack overflow")
1670 ELSIF err
= 138 THEN WriteString("integer overflow")
1671 ELSIF err
= 139 THEN WriteString("division by zero")
1672 ELSIF err
= 140 THEN WriteString("infinite real result")
1673 ELSIF err
= 141 THEN WriteString("real underflow")
1674 ELSIF err
= 142 THEN WriteString("real overflow")
1675 ELSIF err
= 143 THEN WriteString("undefined real result")
1676 ELSIF err
= 144 THEN WriteString("not a number")
1677 ELSIF err
= 200 THEN WriteString("keyboard interrupt")
1678 ELSIF err
= 201 THEN WriteString("NIL dereference")
1679 ELSIF err
= 202 THEN WriteString("illegal instruction: ");
1681 ELSIF err
= 203 THEN WriteString("illegal memory read [ad = ");
1682 WriteHex(val
, 8); WriteString("]")
1683 ELSIF err
= 204 THEN WriteString("illegal memory write [ad = ");
1684 WriteHex(val
, 8); WriteString("]")
1685 ELSIF err
= 205 THEN WriteString("illegal execution [ad = ");
1686 WriteHex(val
, 8); WriteString("]")
1687 ELSIF err
= 257 THEN WriteString("out of memory")
1688 ELSIF err
= 10001H
THEN WriteString("bus error")
1689 ELSIF err
= 10002H
THEN WriteString("address error")
1690 ELSIF err
= 10007H
THEN WriteString("fpu error")
1691 ELSIF err
< 0 THEN WriteString("exception #"); WriteHex(-err
, 2)
1692 ELSE err
:= err
DIV 100 * 256 + err
DIV 10 MOD 10 * 16 + err
MOD 10;
1693 WriteString("trap #"); WriteHex(err
, 3)
1695 WriteString(" ======");
1698 (* skip Kernel.DefaultTrapViewer & Kernel.Trap/Kernel.TrapHandler *)
1700 WHILE (c
> 0) & (dl
# NIL) DO
1706 WHILE (c
> 0) & (dl
# NIL) DO
1707 WriteString("- "); WriteString(dl
.name$
); WriteLn
;
1712 res
:= unistd
.write(2, S
.ADR(out
), len
)
1713 END DefaultTrapViewer
;
1715 PROCEDURE TrapCleanup
;
1718 WHILE trapStack
# NIL DO
1719 t
:= trapStack
; trapStack
:= trapStack
.next
; t
.Cleanup
1721 IF (trapChecker
# NIL) & (err
# 128) THEN trapChecker
END
1724 PROCEDURE SetTrapGuard
* (on
: BOOLEAN);
1729 PROCEDURE Try
* (h
: TryHandler
; a
, b
, c
: INTEGER);
1730 VAR oldIsTry
: BOOLEAN; oldTryEnv
: setjmp
.jmp_buf
; oldTryDLink
: DLink
; res
: setjmp
.int
;
1732 oldIsTry
:= isTry
; oldTryEnv
:= tryEnv
; oldTryDLink
:= tryDLink
;
1733 isTry
:= TRUE
; tryDLink
:= GetDLink();
1734 res
:= setjmp
._setjmp(tryEnv
);
1735 IF res
= 0 THEN h(a
, b
, c
) END;
1736 isTry
:= oldIsTry
; tryEnv
:= oldTryEnv
; tryDLink
:= oldTryDLink
1739 PROCEDURE Trap
* (n
: INTEGER);
1743 IF ~secondTrap
THEN trapped
:= FALSE
; secondTrap
:= TRUE
END
1745 IF n
>= 0 THEN err
:= n
1746 ELSE err
:= -n
+ 128
1748 pc
:= 0; sp
:= 0; fp
:= 0; stack
:= 0; val
:= 0;
1754 setjmp
._longjmp(tryEnv
, 1)
1756 IF (err
= 128) OR (err
= 200) & ~intTrap
THEN (* do nothing *)
1757 ELSIF (trapViewer
# NIL) & (restart
# NIL) & ~trapped
& ~guarded
THEN
1758 trapped
:= TRUE
; trapViewer()
1759 ELSE DefaultTrapViewer
1761 trapped
:= FALSE
; secondTrap
:= FALSE
;
1762 IF restart
# NIL THEN
1763 SetDLink(startDLink
);
1764 setjmp
.siglongjmp(startEnv
, 1)
1769 PROCEDURE [ccall
] TrapHandler (signo
: signal
.int
; IN info
: signal
.siginfo_t
; context
: ADDRESS
);
1770 VAR res
: signal
.int
;
1772 IF checkReadable
THEN
1773 setjmp
.siglongjmp(checkReadableEnv
, 1)
1777 IF ~secondTrap
THEN trapped
:= FALSE
; secondTrap
:= TRUE
END
1779 err
:= -signo
; pc
:= 0; sp
:= 0; fp
:= 0; stack
:= baseStack
; val
:= 0;
1782 val
:= info
.si_code
;
1783 pc
:= info
.info
.sigfpe
.si_addr
;
1784 CASE info
.si_code
OF
1785 | signal
.FPE_INTDIV
: err
:= 139 (* division by zero *)
1786 | signal
.FPE_INTOVF
: err
:= 138 (* integer overflow *)
1787 | signal
.FPE_FLTDIV
: err
:= 140 (* fpu: division by zero *)
1788 | signal
.FPE_FLTOVF
: err
:= 142 (* fpu: overflow *)
1789 | signal
.FPE_FLTUND
: err
:= 141 (* fpu: underflow *)
1790 (* !!! | signal.FPE_FLTRES: err := ??? (* fpu: *) *)
1791 | signal
.FPE_FLTINV
: err
:= 143 (* val := opcode *) (* fpu: invalid op *)
1792 (* !!! | signal.FPE_FLTSUB: err := ??? (* fpu: *) *)
1796 val
:= info
.si_code
;
1797 err
:= 200 (* keyboard interrupt *)
1799 val
:= info
.info
.sigsegv
.si_addr
;
1800 err
:= 203 (* illigal read *)
1802 val
:= info
.info
.sigbus
.si_addr
;
1803 err
:= 10001H (* bus error *)
1805 pc
:= info
.info
.sigill
.si_addr
;
1806 err
:= 202; (* illigal instruction *)
1807 IF IsReadable(pc
, pc
+ 4) THEN
1816 setjmp
._longjmp(tryEnv
, 1)
1818 IF (err
= 128) OR (err
= 200) & ~intTrap
THEN (* do nothing *)
1819 ELSIF (trapViewer
# NIL) & (restart
# NIL) & ~trapped
& ~guarded
THEN
1820 trapped
:= TRUE
; trapViewer()
1821 ELSE DefaultTrapViewer
1823 trapped
:= FALSE
; secondTrap
:= FALSE
;
1824 IF restart
# NIL THEN
1825 setjmp
.siglongjmp(startEnv
, 1)
1830 (* -------------------- Initialization --------------------- *)
1832 PROCEDURE InstallTrap (signo
: signal
.int
);
1833 VAR act
: signal
._struct_sigaction
; (* !!! CPfront hack *) res
: signal
.int
;
1835 act
.sa_handler
:= NIL;
1836 res
:= signal
.sigemptyset(act
.sa_mask
);
1837 act
.sa_flags
:= signal
.SA_NODEFER
+ signal
.SA_SIGINFO
;
1838 act
.sa_sigaction
:= TrapHandler
;
1839 res
:= signal
.sigaction(signo
, S
.VAL(signal
.struct_sigaction
, act
), NIL);
1842 PROCEDURE InstallTrapVectors
;
1844 InstallTrap(signal
.SIGFPE
);
1845 InstallTrap(signal
.SIGINT
);
1846 InstallTrap(signal
.SIGSEGV
);
1847 InstallTrap(signal
.SIGBUS
);
1848 InstallTrap(signal
.SIGILL
)
1849 END InstallTrapVectors
;
1851 PROCEDURE RemoveTrapVectors
;
1852 END RemoveTrapVectors
;
1858 baseStack
:= S
.ADR(i
); (* XXX *)
1859 pagesize
:= unistd
.sysconf(unistd
._SC_PAGESIZE
);
1862 allocated
:= 0; total
:= 0; used
:= 0;
1863 sentinelBlock
.size
:= MAX(INTEGER);
1864 sentinel
:= S
.ADR(sentinelBlock
);
1866 REPEAT DEC(i
); free
[i
] := sentinel
UNTIL i
= 0;
1874 InitModule(modList
);
1875 IF ~inDll
THEN Quit(1) END
1879 PROCEDURE [code
] SYSTEM_argCount (): INTEGER "SYSTEM_argCount";
1880 PROCEDURE [code
] SYSTEM_argVector (): ArrStrPtr
"(Kernel_ArrStrPtr)SYSTEM_argVector";
1881 PROCEDURE [code
] SYSTEM_modlist (): Module
"(Kernel_Module)SYSTEM_modlist";
1884 IF modList
= NIL THEN (* only once *)
1885 argc
:= SYSTEM_argCount();
1886 argv
:= SYSTEM_argVector();
1887 modList
:= SYSTEM_modlist();
1888 static
:= init
IN modList
.opts
;
1889 inDll
:= dll
IN modList
.opts
;
1893 IF ~terminating
THEN
1894 terminating
:= TRUE
;