7c2c0bf26f9052a1bf73235b000c60cb52b07596
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
,
10 (* add signal blocking to avoid race conditions in Try/Trap/TrapHandler *)
11 (* add BeepHook for Beep *)
17 timeResolution
* = 1000; (* ticks per second *)
19 processor
* = 1; (* generic c *)
21 objType
* = "ocf"; (* file types *)
25 (* loader constants *)
39 strictStackSweep
= FALSE
;
40 N
= 128 DIV 16; (* free lists *)
42 (* kernel flags in module desc *)
43 init
= 16; dyn
= 17; dll
= 24; iptrs
= 30;
45 (* meta interface consts *)
46 mConst
= 1; mTyp
= 2; mVar
= 3; mProc
= 4; mField
= 5;
49 Name
* = ARRAY nameLen
OF CHAR;
50 Utf8Name
* = ARRAY nameLen
OF SHORTCHAR
;
53 Module
* = POINTER TO RECORD [untagged
]
55 opts
-: SET; (* 0..15: compiler opts, 16..31: kernel flags *)
56 refcnt
-: INTEGER; (* <0: module invalidated *)
57 compTime
-, loadTime
-: ARRAY 6 OF SHORTINT;
58 ext
-: INTEGER; (* currently not used *)
59 term
-: Command
; (* terminator *)
60 nofimps
-, nofptrs
-: INTEGER;
61 csize
-, dsize
-, rsize
-: INTEGER;
62 code
-, data
-, refs
-: INTEGER;
63 procBase
-, varBase
-: INTEGER; (* meta base addresses *)
64 names
-: POINTER TO ARRAY [untagged
] OF SHORTCHAR
; (* names[0] = 0X *)
65 ptrs
-: POINTER TO ARRAY [untagged
] OF INTEGER;
66 imports
-: POINTER TO ARRAY [untagged
] OF Module
;
67 export
-: Directory
; (* exported objects (name sorted) *)
71 Type
* = POINTER TO RECORD [untagged
]
72 (* record: ptr to method n at offset - 4 * (n+1) *)
73 size
-: INTEGER; (* record: size, array: #elem, dyn array: 0, proc: sigfp *)
75 id
-: INTEGER; (* name idx * 256 + lev * 16 + attr * 4 + form *)
76 base
-: ARRAY 16 OF Type
; (* signature if form = ProcTyp *)
77 fields
-: Directory
; (* new fields (declaration order) *)
78 ptroffs
-: ARRAY any
OF INTEGER (* array of any length *)
81 Object
* = POINTER TO ObjDesc
;
83 ObjDesc
* = RECORD [untagged
]
85 offs
-: INTEGER; (* pvfprint for record types *)
86 id
-: INTEGER; (* name idx * 256 + vis * 16 + mode *)
87 struct
-: Type (* id of basic type or pointer to typedesc/signature *)
90 Directory
* = POINTER TO RECORD [untagged
]
91 num
-: INTEGER; (* number of entries *)
92 obj
-: ARRAY any
OF ObjDesc (* array of any length *)
95 Signature
* = POINTER TO RECORD [untagged
]
96 retStruct
-: Type
; (* id of basic type or pointer to typedesc or 0 *)
97 num
-: INTEGER; (* number of parameters *)
98 par
-: ARRAY any
OF RECORD [untagged
] (* parameters *)
99 id
-: INTEGER; (* name idx * 256 + kind *)
100 struct
-: Type (* id of basic type or pointer to typedesc *)
104 Handler
* = PROCEDURE;
106 Reducer
* = POINTER TO ABSTRACT
RECORD
110 Identifier
* = ABSTRACT
RECORD
115 TrapCleaner
* = POINTER TO ABSTRACT
RECORD
119 TryHandler
* = PROCEDURE (a
, b
, c
: INTEGER);
121 (* meta extension suport *)
123 ItemExt
* = POINTER TO ABSTRACT
RECORD END;
126 obj
*, vis
*, typ
*, adr
*: INTEGER;
133 Hook
* = POINTER TO ABSTRACT
RECORD END;
135 LoaderHook
* = POINTER TO ABSTRACT
RECORD (Hook
)
137 importing
*, imported
*, object
*: ARRAY 256 OF CHAR
140 Block
= POINTER TO RECORD [untagged
]
142 last
: INTEGER; (* arrays: last element *)
143 actual
: INTEGER; (* arrays: used during mark phase *)
144 first
: INTEGER (* arrays: first element *)
147 FreeBlock
= POINTER TO FreeDesc
;
149 FreeDesc
= RECORD [untagged
]
150 tag
: Type
; (* f.tag = ADR(f.size) *)
155 Cluster
= POINTER TO RECORD [untagged
]
156 size
: INTEGER; (* total size *)
158 max
: INTEGER (* exe: reserved size, dll: original address *)
159 (* start of first block *)
162 FList
= POINTER TO RECORD
168 CList
= POINTER TO RECORD
175 PtrType
= RECORD v
: S
.PTR
END; (* used for array of pointer *)
176 Char8Type
= RECORD v
: SHORTCHAR
END;
177 Char16Type
= RECORD v
: CHAR END;
178 Int8Type
= RECORD v
: BYTE END;
179 Int16Type
= RECORD v
: SHORTINT END;
180 Int32Type
= RECORD v
: INTEGER END;
181 Int64Type
= RECORD v
: LONGINT END;
182 BoolType
= RECORD v
: BOOLEAN END;
183 SetType
= RECORD v
: SET END;
184 Real32Type
= RECORD v
: SHORTREAL
END;
185 Real64Type
= RECORD v
: REAL END;
186 ProcType
= RECORD v
: PROCEDURE END;
187 UPtrType
= RECORD v
: INTEGER END;
188 StrPtr
= POINTER TO ARRAY [untagged
] OF SHORTCHAR
;
190 (* SYSTEM.h -> SYSTEM_DLINK *)
191 DLink
= POINTER TO RECORD [untagged
]
195 ArrStrPtr
= POINTER TO ARRAY [untagged
] OF StrPtr
;
197 ADDRESS
* = types
.Pvoid
;
204 err
-, pc
-, sp
-, fp
-, stack
-, val
-: INTEGER;
206 isTry
, checkReadable
: BOOLEAN;
207 startEnv
, checkReadableEnv
: setjmp
.sigjmp_buf
;
208 tryEnv
: setjmp
.jmp_buf
;
209 startDLink
, tryDLink
: DLink
;
213 pagesize
: unistd
.long
;
215 free
: ARRAY N
OF FreeBlock
; (* free list *)
216 sentinelBlock
: FreeDesc
;
218 candidates
: ARRAY 1024 OF INTEGER;
220 allocated
: INTEGER; (* bytes allocated on BlackBox heap *)
221 total
: INTEGER; (* current total size of BlackBox heap *)
222 used
: INTEGER; (* bytes allocated on system heap *)
224 hotFinalizers
: FList
;
227 trapStack
: TrapCleaner
;
228 actual
: Module
; (* valid during module initialization *)
230 trapViewer
, trapChecker
: Handler
;
231 trapped
, guarded
, secondTrap
: BOOLEAN;
232 interrupted
: BOOLEAN;
233 static
, inDll
, terminating
: BOOLEAN;
239 wouldFinalize
: BOOLEAN;
241 watcher
*: PROCEDURE (event
: INTEGER); (* for debugging *)
245 PROCEDURE Erase (adr
, words
: INTEGER);
247 ASSERT(words
>= 0, 20);
256 PROCEDURE (VAR id
: Identifier
) Identified
* (): BOOLEAN, NEW, ABSTRACT
;
257 PROCEDURE (r
: Reducer
) Reduce
* (full
: BOOLEAN), NEW, ABSTRACT
;
258 PROCEDURE (c
: TrapCleaner
) Cleanup
*, NEW, EMPTY
;
260 (* meta extension suport *)
262 PROCEDURE (e
: ItemExt
) Lookup
* (name
: ARRAY OF CHAR; VAR i
: ANYREC
), NEW, ABSTRACT
;
263 PROCEDURE (e
: ItemExt
) Index
* (index
: INTEGER; VAR elem
: ANYREC
), NEW, ABSTRACT
;
264 PROCEDURE (e
: ItemExt
) Deref
* (VAR ref
: ANYREC
), NEW, ABSTRACT
;
266 PROCEDURE (e
: ItemExt
) Valid
* (): BOOLEAN, NEW, ABSTRACT
;
267 PROCEDURE (e
: ItemExt
) Size
* (): INTEGER, NEW, ABSTRACT
;
268 PROCEDURE (e
: ItemExt
) BaseTyp
* (): INTEGER, NEW, ABSTRACT
;
269 PROCEDURE (e
: ItemExt
) Len
* (): INTEGER, NEW, ABSTRACT
;
271 PROCEDURE (e
: ItemExt
) Call
* (OUT ok
: BOOLEAN), NEW, ABSTRACT
;
272 PROCEDURE (e
: ItemExt
) BoolVal
* (): BOOLEAN, NEW, ABSTRACT
;
273 PROCEDURE (e
: ItemExt
) PutBoolVal
* (x
: BOOLEAN), NEW, ABSTRACT
;
274 PROCEDURE (e
: ItemExt
) CharVal
* (): CHAR, NEW, ABSTRACT
;
275 PROCEDURE (e
: ItemExt
) PutCharVal
* (x
: CHAR), NEW, ABSTRACT
;
276 PROCEDURE (e
: ItemExt
) IntVal
* (): INTEGER, NEW, ABSTRACT
;
277 PROCEDURE (e
: ItemExt
) PutIntVal
* (x
: INTEGER), NEW, ABSTRACT
;
278 PROCEDURE (e
: ItemExt
) LongVal
* (): LONGINT, NEW, ABSTRACT
;
279 PROCEDURE (e
: ItemExt
) PutLongVal
* (x
: LONGINT), NEW, ABSTRACT
;
280 PROCEDURE (e
: ItemExt
) RealVal
* (): REAL, NEW, ABSTRACT
;
281 PROCEDURE (e
: ItemExt
) PutRealVal
* (x
: REAL), NEW, ABSTRACT
;
282 PROCEDURE (e
: ItemExt
) SetVal
* (): SET, NEW, ABSTRACT
;
283 PROCEDURE (e
: ItemExt
) PutSetVal
* (x
: SET), NEW, ABSTRACT
;
284 PROCEDURE (e
: ItemExt
) PtrVal
* (): ANYPTR
, NEW, ABSTRACT
;
285 PROCEDURE (e
: ItemExt
) PutPtrVal
* (x
: ANYPTR
), NEW, ABSTRACT
;
286 PROCEDURE (e
: ItemExt
) GetSStringVal
* (OUT x
: ARRAY OF SHORTCHAR
;
287 OUT ok
: BOOLEAN), NEW, ABSTRACT
;
288 PROCEDURE (e
: ItemExt
) PutSStringVal
* (IN x
: ARRAY OF SHORTCHAR
;
289 OUT ok
: BOOLEAN), NEW, ABSTRACT
;
290 PROCEDURE (e
: ItemExt
) GetStringVal
* (OUT x
: ARRAY OF CHAR; OUT ok
: BOOLEAN), NEW, ABSTRACT
;
291 PROCEDURE (e
: ItemExt
) PutStringVal
* (IN x
: ARRAY OF CHAR; OUT ok
: BOOLEAN), NEW, ABSTRACT
;
293 (* -------------------- miscellaneous tools -------------------- *)
295 PROCEDURE IsUpper
* (ch
: CHAR): BOOLEAN;
297 RETURN wctype
.iswupper(ORD(ch
)) # 0
300 PROCEDURE Upper
* (ch
: CHAR): CHAR;
302 RETURN CHR(wctype
.towupper(ORD(ch
)))
305 PROCEDURE IsLower
* (ch
: CHAR): BOOLEAN;
307 RETURN wctype
.iswlower(ORD(ch
)) # 0
310 PROCEDURE Lower
* (ch
: CHAR): CHAR;
312 RETURN CHR(wctype
.towlower(ORD(ch
)))
315 PROCEDURE IsAlpha
* (ch
: CHAR): BOOLEAN;
317 RETURN wctype
.iswalpha(ORD(ch
)) # 0
320 PROCEDURE Utf8ToString
* (IN in
: ARRAY OF SHORTCHAR
; OUT out
: ARRAY OF CHAR; OUT res
: INTEGER);
321 VAR i
, j
, val
, max
: INTEGER; ch
: SHORTCHAR
;
323 PROCEDURE FormatError();
324 BEGIN out
:= in$
; res
:= 2 (*format error*)
328 ch
:= in
[0]; i
:= 1; j
:= 0; max
:= LEN(out
) - 1;
329 WHILE (ch
# 0X
) & (j
< max
) DO
333 val
:= ORD(ch
) - 192;
334 IF val
< 0 THEN FormatError
; RETURN END ;
335 ch
:= in
[i
]; INC(i
); val
:= val
* 64 + ORD(ch
) - 128;
336 IF (ch
< 80X
) OR (ch
>= 0E0X
) THEN FormatError
; RETURN END ;
337 out
[j
] := CHR(val
); INC(j
)
339 val
:= ORD(ch
) - 224;
340 ch
:= in
[i
]; INC(i
); val
:= val
* 64 + ORD(ch
) - 128;
341 IF (ch
< 80X
) OR (ch
>= 0E0X
) THEN FormatError
; RETURN END ;
342 ch
:= in
[i
]; INC(i
); val
:= val
* 64 + ORD(ch
) - 128;
343 IF (ch
< 80X
) OR (ch
>= 0E0X
) THEN FormatError
; RETURN END ;
344 out
[j
] := CHR(val
); INC(j
)
351 IF ch
= 0X
THEN res
:= 0 (*ok*) ELSE res
:= 1 (*truncated*) END
354 PROCEDURE StringToUtf8
* (IN in
: ARRAY OF CHAR; OUT out
: ARRAY OF SHORTCHAR
; OUT res
: INTEGER);
355 VAR i
, j
, val
, max
: INTEGER;
357 i
:= 0; j
:= 0; max
:= LEN(out
) - 3;
358 WHILE (in
[i
] # 0X
) & (j
< max
) DO
359 val
:= ORD(in
[i
]); INC(i
);
361 out
[j
] := SHORT(CHR(val
)); INC(j
)
362 ELSIF val
< 2048 THEN
363 out
[j
] := SHORT(CHR(val
DIV 64 + 192)); INC(j
);
364 out
[j
] := SHORT(CHR(val
MOD 64 + 128)); INC(j
)
366 out
[j
] := SHORT(CHR(val
DIV 4096 + 224)); INC(j
);
367 out
[j
] := SHORT(CHR(val
DIV 64 MOD 64 + 128)); INC(j
);
368 out
[j
] := SHORT(CHR(val
MOD 64 + 128)); INC(j
)
372 IF in
[i
] = 0X
THEN res
:= 0 (*ok*) ELSE res
:= 1 (*truncated*) END
375 PROCEDURE SplitName
* (name
: ARRAY OF CHAR; VAR head
, tail
: ARRAY OF CHAR);
377 VAR i
, j
: INTEGER; ch
, lch
: CHAR;
379 i
:= 0; ch
:= name
[0];
382 head
[i
] := ch
; lch
:= ch
; INC(i
); ch
:= name
[i
]
383 UNTIL (ch
= 0X
) OR (ch
= ".") OR IsUpper(ch
) & ~
IsUpper(lch
);
384 IF ch
= "." THEN i
:= 0; ch
:= name
[0] END;
385 head
[i
] := 0X
; j
:= 0;
386 WHILE ch
# 0X
DO tail
[j
] := ch
; INC(i
); INC(j
); ch
:= name
[i
] END;
388 IF tail
= "" THEN tail
:= head$
; head
:= "" END
389 ELSE head
:= ""; tail
:= ""
393 PROCEDURE MakeFileName
* (VAR name
: ARRAY OF CHAR; type
: ARRAY OF CHAR);
394 VAR i
, j
: INTEGER; ext
: ARRAY 8 OF CHAR; ch
: CHAR;
397 WHILE (name
[i
] # 0X
) & (name
[i
] # ".") DO INC(i
) END;
398 IF name
[i
] = "." THEN
399 IF name
[i
+ 1] = 0X
THEN name
[i
] := 0X
END
401 IF type
= "" THEN ext
:= docType
ELSE ext
:= type$
END;
402 IF i
< LEN(name
) - LEN(ext$
) - 1 THEN
403 name
[i
] := "."; INC(i
); j
:= 0; ch
:= ext
[0];
405 name
[i
] := Lower(ch
); INC(i
); INC(j
); ch
:= ext
[j
]
412 PROCEDURE Time
* (): LONGINT;
413 VAR res
: time
.int
; tp
: time
.struct_timespec
;
415 ASSERT(timeResolution
>= 1);
416 ASSERT(timeResolution
<= 1000000000);
417 res
:= time
.clock_gettime(time
.CLOCK_MONOTONIC
, tp
);
418 ASSERT(res
= 0, 100);
419 RETURN tp
.tv_sec
* LONG(timeResolution
) + tp
.tv_nsec
DIV LONG(1000000000 DIV timeResolution
)
426 PROCEDURE SearchProcVar
* (var
: INTEGER; VAR m
: Module
; VAR adr
: INTEGER);
428 adr
:= var
; m
:= NIL;
431 WHILE (m
# NIL) & ((var
< m
.code
) OR (var
>= m
.code
+ m
.csize
)) DO m
:= m
.next
END;
432 IF m
# NIL THEN DEC(adr
, m
.code
) END
436 (* -------------------- system memory management --------------------- *)
438 PROCEDURE AllocMem (size
: sysmman
.size_t
; VAR max
: sysmman
.size_t
): ADDRESS
;
439 VAR fd
, flags
, res
: fcntl
.int
; ptr
: ADDRESS
;
441 max
:= (size
+ pagesize
- 1) DIV pagesize
* pagesize
;
442 fd
:= fcntl
.open("/dev/zero", fcntl
.O_RDWR
, 0);
444 flags
:= sysmman
.PROT_READ
+ sysmman
.PROT_WRITE
;
445 ptr
:= sysmman
.mmap(0, max
, flags
, sysmman
.MAP_PRIVATE
, fd
, 0);
446 IF ptr
= sysmman
.MAP_FAILED
THEN ptr
:= 0 END;
447 res
:= unistd
.close(fd
);
455 PROCEDURE FreeMem (adr
: ADDRESS
; size
: sysmman
.size_t
);
456 VAR res
: sysmman
.int
;
458 size
:= (size
+ pagesize
- 1) DIV pagesize
* pagesize
;
459 res
:= sysmman
.munmap(adr
, size
);
463 PROCEDURE AllocHeapMem (size
: INTEGER; VAR c
: Cluster
);
464 CONST N
= 65536; (* cluster size for dll *)
465 VAR adr
, allocated
, newsize
: INTEGER;
468 ASSERT(size
> 0, 100); adr
:= 0;
470 adr
:= AllocMem(N
, newsize
);
474 adr
:= AllocMem(size
, newsize
);
477 IF adr
= 0 THEN c
:= NIL
479 c
:= S
.VAL(Cluster
, (adr
+ 15) DIV 16 * 16); c
.max
:= adr
;
480 c
.size
:= allocated
- (S
.VAL(INTEGER, c
) - adr
);
481 INC(used
, c
.size
); INC(total
, c
.size
)
483 ASSERT((adr
= 0) OR (adr
MOD 16 = 0) & (c
.size
>= size
), 101);
484 (* post: (c = NIL) OR (c MOD 16 = 0) & (c.size >= size) *)
487 PROCEDURE FreeHeapMem (c
: Cluster
);
489 DEC(used
, c
.size
); DEC(total
, c
.size
);
490 FreeMem(S
.VAL(ADDRESS
, c
.max
), c
.size
)
493 PROCEDURE HeapFull (size
: INTEGER): BOOLEAN;
498 PROCEDURE AllocModMem
* (descSize
, modSize
: INTEGER; VAR descAdr
, modAdr
: INTEGER);
500 descAdr
:= 0; modAdr
:= 0;
501 descAdr
:= AllocMem(descSize
, descSize
);
503 modAdr
:= AllocMem(modSize
, modSize
);
505 FreeMem(descAdr
, descSize
)
507 INC(used
, descSize
+ modSize
)
512 PROCEDURE DeallocModMem
* (descSize
, modSize
, descAdr
, modAdr
: INTEGER);
514 FreeMem(descAdr
, descSize
);
515 FreeMem(modAdr
, modSize
);
516 DEC(used
, descSize
+ modSize
)
519 PROCEDURE InvalModMem (modSize
, modAdr
: INTEGER);
521 FreeMem(modAdr
, modSize
)
524 PROCEDURE TryRead (from
, to
, c
: INTEGER);
525 VAR i
: INTEGER; x
: BYTE;
528 FOR i
:= from
TO to
DO
532 FOR i
:= to
TO from BY
-1 DO
538 PROCEDURE^ Try
* (h
: TryHandler
; a
, b
, c
: INTEGER);
540 PROCEDURE IsReadable
* (from
, to
: INTEGER): BOOLEAN;
541 VAR r
: BOOLEAN; res
: setjmp
.int
; i
: INTEGER; x
: BYTE;
544 checkReadable
:= TRUE
;
545 res
:= setjmp
.sigsetjmp(checkReadableEnv
, 1);
548 FOR i
:= from
TO to
DO
552 FOR i
:= to
TO from BY
-1 DO
561 (* --------------------- NEW implementation (portable) -------------------- *)
563 PROCEDURE^
NewBlock (size
: INTEGER): Block
;
565 PROCEDURE NewRec
* (typ
: INTEGER): INTEGER; (* implementation of NEW(ptr) *)
566 VAR size
, adr
: INTEGER; b
: Block
; tag
: Type
; l
: FList
;
569 tag
:= S
.VAL(Type
, typ
);
570 b
:= NewBlock(tag
.size
);
573 S
.GET(typ
- 4, size
);
574 IF size
# 0 THEN (* record uses a finalizer *)
575 l
:= S
.VAL(FList
, S
.ADR(b
.last
)); (* anchor new object! *)
576 l
:= S
.VAL(FList
, NewRec(S
.TYP(FList
))); (* NEW(l) *)
577 l
.blk
:= b
; l
.next
:= finalizers
; finalizers
:= l
584 HALT(100) (* COM interface pointers not supported *)
589 PROCEDURE NewArr
* (eltyp
, nofelem
, nofdim
: INTEGER): INTEGER; (* impl. of NEW(ptr, dim0, dim1, ...) *)
590 VAR b
: Block
; size
, headSize
: INTEGER; t
: Type
;
593 |
-1: HALT(100) (* COM interface pointers not supported *)
594 |
0: eltyp
:= S
.ADR(PtrType
)
595 |
1: eltyp
:= S
.ADR(Char8Type
)
596 |
2: eltyp
:= S
.ADR(Int16Type
)
597 |
3: eltyp
:= S
.ADR(Int8Type
)
598 |
4: eltyp
:= S
.ADR(Int32Type
)
599 |
5: eltyp
:= S
.ADR(BoolType
)
600 |
6: eltyp
:= S
.ADR(SetType
)
601 |
7: eltyp
:= S
.ADR(Real32Type
)
602 |
8: eltyp
:= S
.ADR(Real64Type
)
603 |
9: eltyp
:= S
.ADR(Char16Type
)
604 |
10: eltyp
:= S
.ADR(Int64Type
)
605 |
11: eltyp
:= S
.ADR(ProcType
)
606 |
12: HALT(101) (* COM interface pointers not supported *)
608 ASSERT(~
ODD(eltyp
), 102) (* COM interface pointers not supported *)
610 t
:= S
.VAL(Type
, eltyp
);
611 headSize
:= 4 * nofdim
+ 12;
612 size
:= headSize
+ nofelem
* t
.size
;
615 b
.tag
:= S
.VAL(Type
, eltyp
+ 2); (* tag + array mark *)
616 b
.last
:= S
.ADR(b
.last
) + size
- t
.size
; (* pointer to last elem *)
617 b
.first
:= S
.ADR(b
.last
) + headSize
; (* pointer to first elem *)
624 (* -------------------- handler installation (portable) --------------------- *)
626 PROCEDURE ThisFinObj
* (VAR id
: Identifier
): ANYPTR
;
629 ASSERT(id
.typ
# 0, 100);
632 IF S
.VAL(INTEGER, l
.blk
.tag
) = id
.typ
THEN
633 id
.obj
:= S
.VAL(ANYPTR
, S
.ADR(l
.blk
.last
));
634 IF id
.Identified() THEN RETURN id
.obj
END
641 PROCEDURE InstallReducer
* (r
: Reducer
);
643 r
.next
:= reducers
; reducers
:= r
646 PROCEDURE InstallTrapViewer
* (h
: Handler
);
649 END InstallTrapViewer
;
651 PROCEDURE InstallTrapChecker
* (h
: Handler
);
654 END InstallTrapChecker
;
656 PROCEDURE PushTrapCleaner
* (c
: TrapCleaner
);
659 t
:= trapStack
; WHILE (t
# NIL) & (t
# c
) DO t
:= t
.next
END;
661 c
.next
:= trapStack
; trapStack
:= c
664 PROCEDURE PopTrapCleaner
* (c
: TrapCleaner
);
668 WHILE (trapStack
# NIL) & (t
# c
) DO
669 t
:= trapStack
; trapStack
:= trapStack
.next
673 PROCEDURE InstallCleaner
* (p
: Command
);
676 c
:= S
.VAL(CList
, NewRec(S
.TYP(CList
))); (* NEW(c) *)
677 c
.do
:= p
; c
.trapped
:= FALSE
; c
.next
:= cleaners
; cleaners
:= c
680 PROCEDURE RemoveCleaner
* (p
: Command
);
683 c
:= cleaners
; c0
:= NIL;
684 WHILE (c
# NIL) & (c
.do
# p
) DO c0
:= c
; c
:= c
.next
END;
686 IF c0
= NIL THEN cleaners
:= cleaners
.next
ELSE c0
.next
:= c
.next
END
693 c
:= cleaners
; c0
:= NIL;
696 c
.trapped
:= TRUE
; c
.do
; c
.trapped
:= FALSE
; c0
:= c
698 IF c0
= NIL THEN cleaners
:= cleaners
.next
699 ELSE c0
.next
:= c
.next
706 (* -------------------- meta information (portable) --------------------- *)
708 PROCEDURE (h
: LoaderHook
) ThisMod
* (IN name
: ARRAY OF CHAR): Module
, NEW, ABSTRACT
;
710 PROCEDURE SetLoaderHook
*(h
: LoaderHook
);
715 PROCEDURE InitModule (mod
: Module
); (* initialize linked modules *)
718 IF ~
(dyn
IN mod
.opts
) & (mod
.next
# NIL) & ~
(init
IN mod
.next
.opts
) THEN InitModule(mod
.next
) END;
719 IF ~
(init
IN mod
.opts
) THEN
720 body
:= S
.VAL(Command
, mod
.code
);
721 INCL(mod
.opts
, init
);
723 body(); actual
:= NIL
727 PROCEDURE ThisLoadedMod
* (IN name
: ARRAY OF CHAR): Module
; (* loaded modules only *)
728 VAR m
: Module
; res
: INTEGER; n
: Utf8Name
;
730 StringToUtf8(name
, n
, res
); ASSERT(res
= 0);
733 WHILE (m
# NIL) & ((m
.name
# n
) OR (m
.refcnt
< 0)) DO m
:= m
.next
END;
734 IF (m
# NIL) & ~
(init
IN m
.opts
) THEN InitModule(m
) END;
735 IF m
= NIL THEN loadres
:= moduleNotFound
END;
739 PROCEDURE ThisMod
* (IN name
: ARRAY OF CHAR): Module
;
743 RETURN loader
.ThisMod(name
)
745 RETURN ThisLoadedMod(name
)
749 PROCEDURE LoadMod
* (IN name
: ARRAY OF CHAR);
755 PROCEDURE GetLoaderResult
* (OUT res
: INTEGER; OUT importing
, imported
, object
: ARRAY OF CHAR);
759 importing
:= loader
.importing$
;
760 imported
:= loader
.imported$
;
761 object
:= loader
.object$
770 PROCEDURE ThisObject
* (mod
: Module
; IN name
: ARRAY OF CHAR): Object
;
771 VAR l
, r
, m
, res
: INTEGER; p
: StrPtr
; n
: Utf8Name
;
773 StringToUtf8(name
, n
, res
); ASSERT(res
= 0);
774 l
:= 0; r
:= mod
.export
.num
;
775 WHILE l
< r
DO (* binary search *)
777 p
:= S
.VAL(StrPtr
, S
.ADR(mod
.names
[mod
.export
.obj
[m
].id
DIV 256]));
778 IF p^
= n
THEN RETURN S
.VAL(Object
, S
.ADR(mod
.export
.obj
[m
])) END;
779 IF p^
< n
THEN l
:= m
+ 1 ELSE r
:= m
END
784 PROCEDURE ThisDesc
* (mod
: Module
; fprint
: INTEGER): Object
;
787 i
:= 0; n
:= mod
.export
.num
;
788 WHILE (i
< n
) & (mod
.export
.obj
[i
].id
DIV 256 = 0) DO
789 IF mod
.export
.obj
[i
].offs
= fprint
THEN RETURN S
.VAL(Object
, S
.ADR(mod
.export
.obj
[i
])) END;
795 PROCEDURE ThisField
* (rec
: Type
; IN name
: ARRAY OF CHAR): Object
;
796 VAR n
, res
: INTEGER; p
: StrPtr
; obj
: Object
; m
: Module
; nn
: Utf8Name
;
798 StringToUtf8(name
, nn
, res
); ASSERT(res
= 0);
800 obj
:= S
.VAL(Object
, S
.ADR(rec
.fields
.obj
[0])); n
:= rec
.fields
.num
;
802 p
:= S
.VAL(StrPtr
, S
.ADR(m
.names
[obj
.id
DIV 256]));
803 IF p^
= nn
THEN RETURN obj
END;
804 DEC(n
); INC(S
.VAL(INTEGER, obj
), 16)
809 PROCEDURE ThisCommand
* (mod
: Module
; IN name
: ARRAY OF CHAR): Command
;
810 VAR x
: Object
; sig
: Signature
;
812 x
:= ThisObject(mod
, name
);
813 IF (x
# NIL) & (x
.id
MOD 16 = mProc
) THEN
814 sig
:= S
.VAL(Signature
, x
.struct
);
815 IF (sig
.retStruct
= NIL) & (sig
.num
= 0) THEN RETURN S
.VAL(Command
, mod
.procBase
+ x
.offs
) END
820 PROCEDURE ThisType
* (mod
: Module
; IN name
: ARRAY OF CHAR): Type
;
823 x
:= ThisObject(mod
, name
);
824 IF (x
# NIL) & (x
.id
MOD 16 = mTyp
) & (S
.VAL(INTEGER, x
.struct
) DIV 256 # 0) THEN
831 PROCEDURE TypeOf
* (IN rec
: ANYREC
): Type
;
833 RETURN S
.VAL(Type
, S
.TYP(rec
))
836 PROCEDURE LevelOf
* (t
: Type
): SHORTINT;
838 RETURN SHORT(t
.id
DIV 16 MOD 16)
841 PROCEDURE NewObj
* (VAR o
: S
.PTR
; t
: Type
);
844 IF t
.size
= -1 THEN o
:= NIL
846 i
:= 0; WHILE t
.ptroffs
[i
] >= 0 DO INC(i
) END;
847 IF t
.ptroffs
[i
+1] >= 0 THEN INC(S
.VAL(INTEGER, t
)) END; (* with interface pointers *)
848 o
:= S
.VAL(S
.PTR
, NewRec(S
.VAL(INTEGER, t
))) (* generic NEW *)
852 PROCEDURE GetModName
* (mod
: Module
; OUT name
: Name
);
855 Utf8ToString(mod
.name
, name
, res
); ASSERT(res
= 0)
858 PROCEDURE GetObjName
* (mod
: Module
; obj
: Object
; OUT name
: Name
);
859 VAR p
: StrPtr
; res
: INTEGER;
861 p
:= S
.VAL(StrPtr
, S
.ADR(mod
.names
[obj
.id
DIV 256]));
862 Utf8ToString(p^$
, name
, res
); ASSERT(res
= 0)
865 PROCEDURE GetTypeName
* (t
: Type
; OUT name
: Name
);
866 VAR p
: StrPtr
; res
: INTEGER;
868 p
:= S
.VAL(StrPtr
, S
.ADR(t
.mod
.names
[t
.id
DIV 256]));
869 Utf8ToString(p^$
, name
, res
); ASSERT(res
= 0)
872 PROCEDURE RegisterMod
* (mod
: Module
);
873 VAR i
: INTEGER; epoch
: time
.time_t
; tm
: time
.struct_tm
; ptm
: time
.Pstruct_tm
;
875 mod
.next
:= modList
; modList
:= mod
; mod
.refcnt
:= 0; INCL(mod
.opts
, dyn
); i
:= 0;
876 WHILE i
< mod
.nofimps
DO
877 IF mod
.imports
[i
] # NIL THEN INC(mod
.imports
[i
].refcnt
) END;
880 epoch
:= time
.time(NIL);
881 ptm
:= time
.localtime_r(epoch
, tm
);
883 mod
.loadTime
[0] := SHORT(tm
.tm_year
+ 1900);
884 mod
.loadTime
[1] := SHORT(tm
.tm_mon
+ 1);
885 mod
.loadTime
[2] := SHORT(tm
.tm_mday
);
886 mod
.loadTime
[3] := SHORT(tm
.tm_hour
);
887 mod
.loadTime
[4] := SHORT(tm
.tm_min
);
888 mod
.loadTime
[5] := SHORT(tm
.tm_sec
)
890 mod
.loadTime
[0] := 0;
891 mod
.loadTime
[1] := 0;
892 mod
.loadTime
[2] := 0;
893 mod
.loadTime
[3] := 0;
894 mod
.loadTime
[4] := 0;
897 IF ~
(init
IN mod
.opts
) THEN InitModule(mod
) END
902 PROCEDURE UnloadMod
* (mod
: Module
);
903 VAR i
: INTEGER; t
: Command
;
905 IF mod
.refcnt
= 0 THEN
906 t
:= mod
.term
; mod
.term
:= NIL;
907 IF t
# NIL THEN t() END; (* terminate module *)
909 WHILE i
< mod
.nofptrs
DO (* release global pointers *)
910 S
.PUT(mod
.varBase
+ mod
.ptrs
[i
], 0); INC(i
)
912 Collect
; (* call finalizers *)
914 WHILE i
< mod
.nofimps
DO (* release imported modules *)
915 IF mod
.imports
[i
] # NIL THEN DEC(mod
.imports
[i
].refcnt
) END;
919 IF dyn
IN mod
.opts
THEN (* release memory *)
920 InvalModMem(mod
.data
+ mod
.dsize
- mod
.refs
, mod
.refs
)
925 (* -------------------- dynamic procedure call --------------------- *)
934 open array address length .. length
937 PROCEDURE Call
* (adr
: ADDRESS
; sig
: Signature
; IN par
: ARRAY OF INTEGER; n
: INTEGER): LONGINT;
940 mConst
= 1; mTyp
= 2; mVar
= 3; mProc
= 4; mField
= 5;
942 mBool
= 1; mChar8
= 2; mChar16
= 3; mInt8
= 4; mInt16
= 5; mInt32
= 6;
943 mReal32
= 7; mReal64
= 8; mSet
= 9; mInt64
= 10; mAnyRec
= 11; mAnyPtr
= 12; mSysPtr
= 13;
945 mProctyp
= 0; mRecord
= 1; mArray
= 2; mPointer
= 3;
946 (* ??? obj.id DIV 16 MOD 16 *)
947 mInternal
= 1; mReadonly
= 2; mPrivate
= 3; mExported
= 4;
948 (* sig.par[].id MOD 16 *)
949 mValue
= 10; mInPar
= 11; mOutPar
= 12; mVarPar
= 13;
950 mInterface
= 32; mGuid
= 33; mResult
= 34;
951 (* implementation restrictions *)
956 Ptype
= POINTER TO LibFFI
.type
;
957 PPtype
= POINTER TO ARRAY [untagged
] OF Ptype
;
959 status
: LibFFI
.status
;
960 kind
, form
, size
: INTEGER;
961 i
, p
, d
, cn
, ut
, ue
: INTEGER;
964 earg
: ARRAY maxElms
OF Ptype
;
965 targ
: ARRAY maxStrs
OF LibFFI
.type
;
966 farg
: ARRAY maxPars
OF Ptype
;
967 varg
: ARRAY maxPars
OF ADDRESS
;
971 PROCEDURE SetType (IN typ
: LibFFI
.type
);
973 farg
[cn
] := S
.VAL(Ptype
, S
.ADR(typ
));
976 PROCEDURE PushAdr (size
: INTEGER);
978 ASSERT(size
IN {1, 2, 4, 8}, 20);
979 ASSERT(littleEndian
OR (size
<= 4), 100); (* !!! swap 64bit value *)
980 varg
[cn
] := S
.ADR(par
[d
]);
981 INC(cn
); INC(d
, MAX(1, size
DIV 4))
984 PROCEDURE PushVal (size
: INTEGER);
986 ASSERT(size
IN {1, 2, 4, 8}, 20);
987 ASSERT(littleEndian
OR (size
<= 4), 100); (* !!! swap 64bit value *)
989 INC(cn
); INC(d
, MAX(1, size
DIV 4))
992 PROCEDURE Push (IN typ
: LibFFI
.type
);
994 SetType(typ
); PushAdr(typ
.size
)
998 p
:= 0; cn
:= 0; d
:= 0; ut
:= 0; ue
:= 0;
1000 typ
:= sig
.par
[p
].struct
;
1001 kind
:= sig
.par
[p
].id
MOD 16;
1002 IF S
.VAL(ADDRESS
, typ
) DIV 256 = 0 THEN (* basic types *)
1003 form
:= S
.VAL(ADDRESS
, typ
) MOD 256;
1004 IF kind
= mValue
THEN
1006 | mBool
, mChar8
: Push(LibFFI
.type_uint8
)
1007 | mChar16
: Push(LibFFI
.type_uint16
)
1008 | mInt8
: Push(LibFFI
.type_sint8
)
1009 | mInt16
: Push(LibFFI
.type_sint16
)
1010 | mInt32
: Push(LibFFI
.type_sint32
)
1011 | mReal32
: Push(LibFFI
.type_float
)
1012 | mReal64
: Push(LibFFI
.type_double
)
1013 | mSet
: Push(LibFFI
.type_uint32
)
1014 | mInt64
: Push(LibFFI
.type_sint64
)
1015 | mAnyPtr
, mSysPtr
: Push(LibFFI
.type_pointer
)
1016 ELSE HALT(100) (* unsupported type *)
1018 ELSIF kind
IN {mInPar
..mVarPar
} THEN
1020 | mBool
..mInt64
, mAnyPtr
, mSysPtr
: Push(LibFFI
.type_pointer
)
1021 | mAnyRec
: Push(LibFFI
.type_pointer
); Push(LibFFI
.type_pointer
) (* address + tag *)
1022 ELSE HALT(101) (* unsupported type *)
1025 HALT(102) (* unsupported parameter kind *)
1028 CASE typ
.id
MOD 4 OF
1029 | mProctyp
, mPointer
:
1030 Push(LibFFI
.type_pointer
)
1032 IF kind
= mValue
THEN
1034 targ
[ut
].alignment
:= 0;
1035 targ
[ut
].type
:= LibFFI
.TYPE_STRUCT
;
1036 targ
[ut
].elements
:= S
.VAL(PPtype
, S
.ADR(earg
[ue
]));
1037 SetType(targ
[ut
]); INC(ut
);
1038 size
:= MAX(1, typ
.size
);
1039 (* !!! better to pass original layout *)
1041 earg
[ue
] := S
.VAL(Ptype
, S
.ADR(LibFFI
.type_uint64
));
1042 INC(ue
); DEC(size
, 8)
1045 earg
[ue
] := S
.VAL(Ptype
, S
.ADR(LibFFI
.type_uint32
));
1046 INC(ue
); DEC(size
, 4)
1049 earg
[ue
] := S
.VAL(Ptype
, S
.ADR(LibFFI
.type_uint16
));
1050 INC(ue
); DEC(size
, 2)
1053 earg
[ue
] := S
.VAL(Ptype
, S
.ADR(LibFFI
.type_uint32
));
1058 PushVal(LibFFI
.type_pointer
.size
);
1059 INC(d
) (* skip tag *)
1060 ELSIF kind
IN {mInPar
..mVarPar
} THEN
1061 Push(LibFFI
.type_pointer
); (* address *)
1062 Push(LibFFI
.type_pointer
); (* tag *)
1063 ELSE HALT(103) (* unsupported parameter kind *)
1066 Push(LibFFI
.type_pointer
);
1067 ASSERT(kind
IN {mValue
..mVarPar
}, 104); (* unsupported parameter kind *)
1068 (* array copying generated by CPfront, so we can just pass address *)
1069 IF typ
.size
= 0 THEN (* open array *)
1070 FOR i
:= 0 TO typ
.id
DIV 16 - 1 DO
1071 Push(LibFFI
.type_sint32
) (* dim size *)
1073 ELSE (* fix array *)
1074 INC(d
) (* skip size *)
1081 typ
:= sig
.retStruct
;
1082 IF typ
= NIL THEN fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_void
))
1083 ELSIF S
.VAL(ADDRESS
, typ
) DIV 256 = 0 THEN
1084 form
:= S
.VAL(ADDRESS
, typ
) MOD 256;
1086 | mBool
, mChar8
: fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_uint8
))
1087 | mChar16
: fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_uint16
))
1088 | mInt8
: fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_sint8
))
1089 | mInt16
: fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_sint16
))
1090 | mInt32
: fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_sint32
))
1091 | mReal32
: fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_float
))
1092 | mReal64
: fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_double
))
1093 | mSet
: fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_uint32
))
1094 | mInt64
: fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_sint64
))
1095 | mAnyPtr
, mSysPtr
: fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_pointer
))
1096 ELSE HALT(106) (* unsupported type *)
1099 CASE typ
.id
MOD 4 OF
1100 | mProctyp
, mPointer
: fret
:= S
.VAL(Ptype
, S
.ADR(LibFFI
.type_pointer
))
1101 ELSE HALT(107) (* unsupported type *)
1104 status
:= LibFFI
.prep_cif(cif
, LibFFI
.DEFAULT_ABI
, cn
, fret
, farg
);
1105 ASSERT(status
= LibFFI
.OK
, 108);
1107 IF littleEndian
THEN LibFFI
.call(cif
, adr
, S
.ADR(vret
), S
.ADR(varg
))
1108 ELSE LibFFI
.call(cif
, adr
, S
.ADR(vret
) + (8 - fret
.size
), S
.ADR(varg
))
1113 (* -------------------- reference information (portable) --------------------- *)
1115 PROCEDURE RefCh (VAR ref
: INTEGER; OUT ch
: SHORTCHAR
);
1117 S
.GET(ref
, ch
); INC(ref
)
1120 PROCEDURE RefNum (VAR ref
: INTEGER; OUT x
: INTEGER);
1121 VAR s
, n
: INTEGER; ch
: SHORTCHAR
;
1123 s
:= 0; n
:= 0; RefCh(ref
, ch
);
1124 WHILE ORD(ch
) >= 128 DO INC(n
, ASH(ORD(ch
) - 128, s
) ); INC(s
, 7); RefCh(ref
, ch
) END;
1125 x
:= n
+ ASH(ORD(ch
) MOD 64 - ORD(ch
) DIV 64 * 64, s
)
1128 PROCEDURE RefName (VAR ref
: INTEGER; OUT n
: Utf8Name
);
1129 VAR i
: INTEGER; ch
: SHORTCHAR
;
1131 i
:= 0; RefCh(ref
, ch
);
1132 WHILE ch
# 0X
DO n
[i
] := ch
; INC(i
); RefCh(ref
, ch
) END;
1136 PROCEDURE GetRefProc
* (VAR ref
: INTEGER; OUT adr
: INTEGER; OUT name
: Utf8Name
);
1140 WHILE ch
>= 0FDX
DO (* skip variables *)
1141 INC(ref
); RefCh(ref
, ch
);
1142 IF ch
= 10X
THEN INC(ref
, 4) END;
1143 RefNum(ref
, adr
); RefName(ref
, name
); S
.GET(ref
, ch
)
1145 WHILE (ch
> 0X
) & (ch
< 0FCX
) DO (* skip source refs *)
1146 INC(ref
); RefNum(ref
, adr
); S
.GET(ref
, ch
)
1148 IF ch
= 0FCX
THEN INC(ref
); RefNum(ref
, adr
); RefName(ref
, name
)
1153 PROCEDURE GetRefVar
* (VAR ref
: INTEGER; OUT mode
, form
: SHORTCHAR
; OUT desc
: Type
; OUT adr
: INTEGER; OUT name
: Utf8Name
);
1155 S
.GET(ref
, mode
); desc
:= NIL;
1156 IF mode
>= 0FDX
THEN
1157 mode
:= SHORT(CHR(ORD(mode
) - 0FCH
));
1158 INC(ref
); RefCh(ref
, form
);
1160 S
.GET(ref
, desc
); INC(ref
, 4); form
:= SHORT(CHR(16 + desc
.id
MOD 4))
1162 RefNum(ref
, adr
); RefName(ref
, name
)
1164 mode
:= 0X
; form
:= 0X
; adr
:= 0
1168 PROCEDURE SourcePos
* (mod
: Module
; codePos
: INTEGER): INTEGER;
1169 VAR ref
, pos
, ad
, d
: INTEGER; ch
: SHORTCHAR
; name
: Utf8Name
;
1171 IF mod
# NIL THEN (* mf, 12.02.04 *)
1172 ref
:= mod
.refs
; pos
:= 0; ad
:= 0; S
.GET(ref
, ch
);
1174 WHILE (ch
> 0X
) & (ch
< 0FCX
) DO (* srcref: {dAdr,dPos} *)
1175 INC(ad
, ORD(ch
)); INC(ref
); RefNum(ref
, d
);
1176 IF ad
> codePos
THEN RETURN pos
END;
1177 INC(pos
, d
); S
.GET(ref
, ch
)
1179 IF ch
= 0FCX
THEN (* proc: 0FCX,Adr,Name *)
1180 INC(ref
); RefNum(ref
, d
); RefName(ref
, name
); S
.GET(ref
, ch
);
1181 IF (d
> codePos
) & (pos
> 0) THEN RETURN pos
END
1183 WHILE ch
>= 0FDX
DO (* skip variables: Mode, Form, adr, Name *)
1184 INC(ref
); RefCh(ref
, ch
);
1185 IF ch
= 10X
THEN INC(ref
, 4) END;
1186 RefNum(ref
, d
); RefName(ref
, name
); S
.GET(ref
, ch
)
1193 PROCEDURE LoadDll
* (IN name
: ARRAY OF CHAR; VAR ok
: BOOLEAN);
1194 VAR h
: ADDRESS
; file
: Utf8Name
; res
: INTEGER;
1196 StringToUtf8(name
, file
, res
);
1198 h
:= dlfcn
.dlopen(file
, dlfcn
.RTLD_LAZY
+ dlfcn
.RTLD_GLOBAL
);
1205 PROCEDURE ThisDllObj
* (mode
, fprint
: INTEGER; IN dll
, name
: ARRAY OF CHAR): INTEGER;
1206 VAR h
, p
: ADDRESS
; file
, sym
: Utf8Name
; res
: INTEGER; err
: dlfcn
.int
;
1208 StringToUtf8(dll
, file
, res
);
1210 h
:= dlfcn
.dlopen(file
, dlfcn
.RTLD_LAZY
+ dlfcn
.RTLD_GLOBAL
);
1212 StringToUtf8(name
, sym
, res
);
1214 p
:= dlfcn
.dlsym(h
, sym
)
1218 err
:= dlfcn
.dlclose(h
);
1219 ASSERT(err
= 0, 100)
1229 (* -------------------- garbage collector (portable) --------------------- *)
1231 PROCEDURE Mark (this
: Block
);
1232 VAR father
, son
: Block
; tag
: Type
; flag
, offset
, actual
: INTEGER;
1234 IF ~
ODD(S
.VAL(INTEGER, this
.tag
)) THEN
1237 INC(S
.VAL(INTEGER, this
.tag
));
1238 flag
:= S
.VAL(INTEGER, this
.tag
) MOD 4;
1239 tag
:= S
.VAL(Type
, S
.VAL(INTEGER, this
.tag
) - flag
);
1240 IF flag
>= 2 THEN actual
:= this
.first
; this
.actual
:= actual
1241 ELSE actual
:= S
.ADR(this
.last
)
1244 offset
:= tag
.ptroffs
[0];
1246 INC(S
.VAL(INTEGER, tag
), offset
+ 4); (* restore tag *)
1247 IF (flag
>= 2) & (actual
< this
.last
) & (offset
< -4) THEN (* next array element *)
1248 INC(actual
, tag
.size
); this
.actual
:= actual
1250 this
.tag
:= S
.VAL(Type
, S
.VAL(INTEGER, tag
) + flag
);
1251 IF father
= NIL THEN RETURN END;
1252 son
:= this
; this
:= father
;
1253 flag
:= S
.VAL(INTEGER, this
.tag
) MOD 4;
1254 tag
:= S
.VAL(Type
, S
.VAL(INTEGER, this
.tag
) - flag
);
1255 offset
:= tag
.ptroffs
[0];
1256 IF flag
>= 2 THEN actual
:= this
.actual
ELSE actual
:= S
.ADR(this
.last
) END;
1257 S
.GET(actual
+ offset
, father
); S
.PUT(actual
+ offset
, S
.ADR(son
.last
));
1258 INC(S
.VAL(INTEGER, tag
), 4)
1261 S
.GET(actual
+ offset
, son
);
1263 DEC(S
.VAL(INTEGER, son
), 4);
1264 IF ~
ODD(S
.VAL(INTEGER, son
.tag
)) THEN (* down *)
1265 this
.tag
:= S
.VAL(Type
, S
.VAL(INTEGER, tag
) + flag
);
1266 S
.PUT(actual
+ offset
, father
); father
:= this
; this
:= son
;
1270 INC(S
.VAL(INTEGER, tag
), 4)
1277 PROCEDURE MarkGlobals
;
1278 VAR m
: Module
; i
, p
: INTEGER;
1282 IF m
.refcnt
>= 0 THEN
1284 WHILE i
< m
.nofptrs
DO
1285 S
.GET(m
.varBase
+ m
.ptrs
[i
], p
); INC(i
);
1286 IF p
# 0 THEN Mark(S
.VAL(Block
, p
- 4)) END
1293 PROCEDURE Next (b
: Block
): Block
; (* next block in same cluster *)
1296 S
.GET(S
.VAL(INTEGER, b
.tag
) DIV 4 * 4, size
);
1297 IF ODD(S
.VAL(INTEGER, b
.tag
) DIV 2) THEN INC(size
, b
.last
- S
.ADR(b
.last
)) END;
1298 RETURN S
.VAL(Block
, S
.VAL(INTEGER, b
) + (size
+ 19) DIV 16 * 16)
1301 PROCEDURE CheckCandidates
;
1302 (* pre: nofcand > 0 *)
1303 VAR i
, j
, h
, p
, end
: INTEGER; c
: Cluster
; blk
, next
: Block
;
1305 (* sort candidates (shellsort) *)
1306 h
:= 1; REPEAT h
:= h
*3 + 1 UNTIL h
> nofcand
;
1307 REPEAT h
:= h
DIV 3; i
:= h
;
1308 WHILE i
< nofcand
DO p
:= candidates
[i
]; j
:= i
;
1309 WHILE (j
>= h
) & (candidates
[j
-h
] > p
) DO
1310 candidates
[j
] := candidates
[j
-h
]; j
:= j
-h
1312 candidates
[j
] := p
; INC(i
)
1318 blk
:= S
.VAL(Block
, S
.VAL(INTEGER, c
) + 12);
1319 end
:= S
.VAL(INTEGER, blk
) + (c
.size
- 12) DIV 16 * 16;
1320 WHILE candidates
[i
] < S
.VAL(INTEGER, blk
) DO
1322 IF i
= nofcand
THEN RETURN END
1324 WHILE S
.VAL(INTEGER, blk
) < end
DO
1326 IF candidates
[i
] < S
.VAL(INTEGER, next
) THEN
1327 IF (S
.VAL(INTEGER, blk
.tag
) # S
.ADR(blk
.last
)) (* not a free block *)
1328 & (~strictStackSweep
OR (candidates
[i
] = S
.ADR(blk
.last
))) THEN
1333 IF i
= nofcand
THEN RETURN END
1334 UNTIL candidates
[i
] >= S
.VAL(INTEGER, next
)
1336 IF (S
.VAL(INTEGER, blk
.tag
) MOD 4 = 0) & (S
.VAL(INTEGER, blk
.tag
) # S
.ADR(blk
.last
))
1337 & (blk
.tag
.base
[0] = NIL) & (blk
.actual
> 0) THEN (* referenced interface record *)
1344 END CheckCandidates
;
1346 PROCEDURE MarkLocals
;
1347 VAR sp
, p
, min
, max
: INTEGER; c
: Cluster
;
1349 sp
:= S
.ADR(sp
); nofcand
:= 0; c
:= root
;
1350 WHILE c
.next
# NIL DO c
:= c
.next
END;
1351 min
:= S
.VAL(INTEGER, root
); max
:= S
.VAL(INTEGER, c
) + c
.size
;
1352 WHILE sp
< baseStack
DO
1354 IF (p
> min
) & (p
< max
) & (~strictStackSweep
OR (p
MOD 16 = 0)) THEN
1355 candidates
[nofcand
] := p
; INC(nofcand
);
1356 IF nofcand
= LEN(candidates
) - 1 THEN CheckCandidates
; nofcand
:= 0 END
1360 candidates
[nofcand
] := max
; INC(nofcand
); (* ensure complete scan for interface mark*)
1361 IF nofcand
> 0 THEN CheckCandidates
END
1364 PROCEDURE MarkFinObj
;
1367 wouldFinalize
:= FALSE
;
1370 IF ~
ODD(S
.VAL(INTEGER, f
.blk
.tag
)) THEN wouldFinalize
:= TRUE
END;
1375 WHILE f
# NIL DO IF ~
ODD(S
.VAL(INTEGER, f
.blk
.tag
)) THEN wouldFinalize
:= TRUE
END;
1381 PROCEDURE CheckFinalizers
;
1382 VAR f
, g
, h
, k
: FList
;
1384 f
:= finalizers
; g
:= NIL;
1385 IF hotFinalizers
= NIL THEN k
:= NIL
1388 WHILE k
.next
# NIL DO k
:= k
.next
END
1391 h
:= f
; f
:= f
.next
;
1392 IF ~
ODD(S
.VAL(INTEGER, h
.blk
.tag
)) THEN
1393 IF g
= NIL THEN finalizers
:= f
ELSE g
.next
:= f
END;
1394 IF k
= NIL THEN hotFinalizers
:= h
ELSE k
.next
:= h
END;
1395 k
:= h
; h
.next
:= NIL
1400 WHILE h
# NIL DO Mark(h
.blk
); h
:= h
.next
END
1401 END CheckFinalizers
;
1403 PROCEDURE ExecFinalizer (a
, b
, c
: INTEGER);
1404 VAR f
: FList
; fin
: PROCEDURE(this
: ANYPTR
);
1406 f
:= S
.VAL(FList
, a
);
1407 S
.GET(S
.VAL(INTEGER, f
.blk
.tag
) - 4, fin
); (* method 0 *)
1408 IF (fin
# NIL) & (f
.blk
.tag
.mod
.refcnt
>= 0) THEN fin(S
.VAL(ANYPTR
, S
.ADR(f
.blk
.last
))) END;
1411 PROCEDURE^ Try
* (h
: TryHandler
; a
, b
, c
: INTEGER); (* COMPILER DEPENDENT *)
1413 PROCEDURE CallFinalizers
;
1416 WHILE hotFinalizers
# NIL DO
1417 f
:= hotFinalizers
; hotFinalizers
:= hotFinalizers
.next
;
1418 Try(ExecFinalizer
, S
.VAL(INTEGER, f
), 0, 0)
1420 wouldFinalize
:= FALSE
1423 PROCEDURE Insert (blk
: FreeBlock
; size
: INTEGER); (* insert block in free list *)
1426 blk
.size
:= size
- 4; blk
.tag
:= S
.VAL(Type
, S
.ADR(blk
.size
));
1427 i
:= MIN(N
- 1, (blk
.size
DIV 16));
1428 blk
.next
:= free
[i
]; free
[i
] := blk
1431 PROCEDURE Sweep (dealloc
: BOOLEAN);
1432 VAR cluster
, last
, c
: Cluster
; blk
, next
: Block
; fblk
, b
, t
: FreeBlock
; end
, i
: INTEGER;
1434 cluster
:= root
; last
:= NIL; allocated
:= 0;
1436 REPEAT DEC(i
); free
[i
] := sentinel
UNTIL i
= 0;
1437 WHILE cluster
# NIL DO
1438 blk
:= S
.VAL(Block
, S
.VAL(INTEGER, cluster
) + 12);
1439 end
:= S
.VAL(INTEGER, blk
) + (cluster
.size
- 12) DIV 16 * 16;
1441 WHILE S
.VAL(INTEGER, blk
) < end
DO
1443 IF ODD(S
.VAL(INTEGER, blk
.tag
)) THEN
1445 Insert(fblk
, S
.VAL(INTEGER, blk
) - S
.VAL(INTEGER, fblk
));
1448 DEC(S
.VAL(INTEGER, blk
.tag
)); (* unmark *)
1449 INC(allocated
, S
.VAL(INTEGER, next
) - S
.VAL(INTEGER, blk
))
1450 ELSIF fblk
= NIL THEN
1451 fblk
:= S
.VAL(FreeBlock
, blk
)
1455 IF dealloc
& (S
.VAL(INTEGER, fblk
) = S
.VAL(INTEGER, cluster
) + 12) THEN (* deallocate cluster *)
1456 c
:= cluster
; cluster
:= cluster
.next
;
1457 IF last
= NIL THEN root
:= cluster
ELSE last
.next
:= cluster
END;
1460 IF fblk
# NIL THEN Insert(fblk
, end
- S
.VAL(INTEGER, fblk
)) END;
1461 last
:= cluster
; cluster
:= cluster
.next
1464 (* reverse free list *)
1468 b
:= free
[i
]; fblk
:= sentinel
;
1469 WHILE b
# sentinel
DO t
:= b
; b
:= t
.next
; t
.next
:= fblk
; fblk
:= t
END;
1477 CallFinalizers
; (* trap cleanup *)
1486 PROCEDURE FastCollect
*;
1496 PROCEDURE WouldFinalize
* (): BOOLEAN;
1498 RETURN wouldFinalize
1501 (* --------------------- memory allocation (portable) -------------------- *)
1503 PROCEDURE OldBlock (size
: INTEGER): FreeBlock
; (* size MOD 16 = 0 *)
1504 VAR b
, l
: FreeBlock
; s
, i
: INTEGER;
1507 i
:= MIN(N
- 1, s
DIV 16);
1508 WHILE (i
# N
- 1) & (free
[i
] = sentinel
) DO INC(i
) END;
1509 b
:= free
[i
]; l
:= NIL;
1510 WHILE b
.size
< s
DO l
:= b
; b
:= b
.next
END;
1511 IF b
# sentinel
THEN
1512 IF l
= NIL THEN free
[i
] := b
.next
ELSE l
.next
:= b
.next
END
1518 PROCEDURE LastBlock (limit
: INTEGER): FreeBlock
; (* size MOD 16 = 0 *)
1519 VAR b
, l
: FreeBlock
; s
, i
: INTEGER;
1524 b
:= free
[i
]; l
:= NIL;
1525 WHILE (b
# sentinel
) & (S
.VAL(INTEGER, b
) + b
.size
# s
) DO l
:= b
; b
:= b
.next
END;
1526 IF b
# sentinel
THEN
1527 IF l
= NIL THEN free
[i
] := b
.next
ELSE l
.next
:= b
.next
END
1531 UNTIL (b
# NIL) OR (i
= N
);
1535 PROCEDURE NewBlock (size
: INTEGER): Block
;
1536 VAR tsize
, a
, s
: INTEGER; b
: FreeBlock
; new
, c
: Cluster
; r
: Reducer
;
1538 ASSERT(size
>= 0, 20);
1539 IF size
> MAX(INTEGER) - 19 THEN RETURN NIL END;
1540 tsize
:= (size
+ 19) DIV 16 * 16;
1541 b
:= OldBlock(tsize
); (* 1) search for free block *)
1543 FastCollect
; b
:= OldBlock(tsize
); (* 2) collect *)
1545 Collect
; b
:= OldBlock(tsize
); (* 2a) fully collect *)
1548 AllocHeapMem(tsize
+ 12, new
); (* 3) allocate new cluster *)
1550 IF (root
= NIL) OR (S
.VAL(INTEGER, new
) < S
.VAL(INTEGER, root
)) THEN
1551 new
.next
:= root
; root
:= new
1554 WHILE (c
.next
# NIL) & (S
.VAL(INTEGER, new
) > S
.VAL(INTEGER, c
.next
)) DO c
:= c
.next
END;
1555 new
.next
:= c
.next
; c
.next
:= new
1557 b
:= S
.VAL(FreeBlock
, S
.VAL(INTEGER, new
) + 12);
1558 b
.size
:= (new
.size
- 12) DIV 16 * 16 - 4
1560 RETURN NIL (* 4) give up *)
1565 a
:= b
.size
+ 4 - tsize
;
1566 IF a
> 0 THEN Insert(S
.VAL(FreeBlock
, S
.VAL(INTEGER, b
) + tsize
), a
) END;
1567 IF size
> 0 THEN Erase(S
.ADR(b
.size
), (size
+ 3) DIV 4) END;
1568 INC(allocated
, tsize
);
1569 RETURN S
.VAL(Block
, b
)
1572 PROCEDURE Allocated
* (): INTEGER;
1577 PROCEDURE Used
* (): INTEGER;
1582 PROCEDURE Root
* (): INTEGER;
1584 RETURN S
.VAL(INTEGER, root
)
1587 (* -------------------- Trap Handling --------------------- *)
1589 PROCEDURE [code
] GetDLink (): DLink
"(Kernel_DLink)SYSTEM_dlink";
1590 PROCEDURE [code
] SetDLink (dl
: DLink
) "SYSTEM_dlink = (SYSTEM_DLINK*)dl";
1592 PROCEDURE Start
* (code
: Command
);
1593 VAR res
: setjmp
.int
; dl
: DLink
;
1596 baseStack
:= S
.ADR(code
); (* XXX: expected that target uses one stack *)
1597 startDLink
:= GetDLink();
1598 res
:= setjmp
.sigsetjmp(startEnv
, 1);
1602 PROCEDURE Quit
* (exitCode
: INTEGER);
1603 VAR m
: Module
; term
: Command
; t
: BOOLEAN;
1605 trapViewer
:= NIL; trapChecker
:= NIL; restart
:= NIL;
1606 t
:= terminating
; terminating
:= TRUE
; m
:= modList
;
1607 WHILE m
# NIL DO (* call terminators *)
1608 IF ~static
OR ~t
THEN
1609 term
:= m
.term
; m
.term
:= NIL;
1610 IF term
# NIL THEN term() END
1615 hotFinalizers
:= finalizers
; finalizers
:= NIL;
1617 stdlib
.exit(exitCode
)
1620 PROCEDURE FatalError
* (id
: INTEGER; str
: ARRAY OF CHAR);
1621 VAR res
: stdio
.int
; title
: ARRAY 16 OF CHAR; text
: ARRAY 256 OF SHORTCHAR
;
1623 title
:= "Error xy";
1624 title
[6] := CHR(id
DIV 10 + ORD("0"));
1625 title
[7] := CHR(id
MOD 10 + ORD("0"));
1626 res
:= unistd
.write(2, S
.ADR(title
), 8);
1630 PROCEDURE DefaultTrapViewer
;
1631 VAR out
: ARRAY 256 OF SHORTCHAR
; c
, len
: INTEGER; res
: unistd
.int
; dl
: DLink
;
1633 PROCEDURE WriteString (IN s
: ARRAY OF SHORTCHAR
);
1637 WHILE (len
< LEN(out
) - 1) & (s
[i
] # 0X
) DO out
[len
] := s
[i
]; INC(i
); INC(len
) END
1640 PROCEDURE WriteHex (x
, n
: INTEGER);
1643 IF len
+ n
< LEN(out
) THEN
1646 y
:= x
MOD 16; x
:= x
DIV 16;
1647 IF y
> 9 THEN y
:= y
+ (ORD("A") - ORD("0") - 10) END;
1648 out
[i
] := SHORT(CHR(y
+ ORD("0"))); DEC(i
)
1656 IF len
< LEN(out
) - 1 THEN out
[len
] := 0AX
; INC(len
) END
1661 WriteString("====== ");
1662 IF err
= 129 THEN WriteString("invalid with")
1663 ELSIF err
= 130 THEN WriteString("invalid case")
1664 ELSIF err
= 131 THEN WriteString("function without return")
1665 ELSIF err
= 132 THEN WriteString("type guard")
1666 ELSIF err
= 133 THEN WriteString("implied type guard")
1667 ELSIF err
= 134 THEN WriteString("value out of range")
1668 ELSIF err
= 135 THEN WriteString("index out of range")
1669 ELSIF err
= 136 THEN WriteString("string too long")
1670 ELSIF err
= 137 THEN WriteString("stack overflow")
1671 ELSIF err
= 138 THEN WriteString("integer overflow")
1672 ELSIF err
= 139 THEN WriteString("division by zero")
1673 ELSIF err
= 140 THEN WriteString("infinite real result")
1674 ELSIF err
= 141 THEN WriteString("real underflow")
1675 ELSIF err
= 142 THEN WriteString("real overflow")
1676 ELSIF err
= 143 THEN WriteString("undefined real result")
1677 ELSIF err
= 144 THEN WriteString("not a number")
1678 ELSIF err
= 200 THEN WriteString("keyboard interrupt")
1679 ELSIF err
= 201 THEN WriteString("NIL dereference")
1680 ELSIF err
= 202 THEN WriteString("illegal instruction: ");
1682 ELSIF err
= 203 THEN WriteString("illegal memory read [ad = ");
1683 WriteHex(val
, 8); WriteString("]")
1684 ELSIF err
= 204 THEN WriteString("illegal memory write [ad = ");
1685 WriteHex(val
, 8); WriteString("]")
1686 ELSIF err
= 205 THEN WriteString("illegal execution [ad = ");
1687 WriteHex(val
, 8); WriteString("]")
1688 ELSIF err
= 257 THEN WriteString("out of memory")
1689 ELSIF err
= 10001H
THEN WriteString("bus error")
1690 ELSIF err
= 10002H
THEN WriteString("address error")
1691 ELSIF err
= 10007H
THEN WriteString("fpu error")
1692 ELSIF err
< 0 THEN WriteString("exception #"); WriteHex(-err
, 2)
1693 ELSE err
:= err
DIV 100 * 256 + err
DIV 10 MOD 10 * 16 + err
MOD 10;
1694 WriteString("trap #"); WriteHex(err
, 3)
1696 WriteString(" ======");
1699 (* skip Kernel.DefaultTrapViewer & Kernel.Trap/Kernel.TrapHandler *)
1701 WHILE (c
> 0) & (dl
# NIL) DO
1707 WHILE (c
> 0) & (dl
# NIL) DO
1708 WriteString("- "); WriteString(dl
.name$
); WriteLn
;
1713 res
:= unistd
.write(2, S
.ADR(out
), len
)
1714 END DefaultTrapViewer
;
1716 PROCEDURE TrapCleanup
;
1719 WHILE trapStack
# NIL DO
1720 t
:= trapStack
; trapStack
:= trapStack
.next
; t
.Cleanup
1722 IF (trapChecker
# NIL) & (err
# 128) THEN trapChecker
END
1725 PROCEDURE SetTrapGuard
* (on
: BOOLEAN);
1730 PROCEDURE Try
* (h
: TryHandler
; a
, b
, c
: INTEGER);
1731 VAR oldIsTry
: BOOLEAN; oldTryEnv
: setjmp
.jmp_buf
; oldTryDLink
: DLink
; res
: setjmp
.int
;
1733 oldIsTry
:= isTry
; oldTryEnv
:= tryEnv
; oldTryDLink
:= tryDLink
;
1734 isTry
:= TRUE
; tryDLink
:= GetDLink();
1735 res
:= setjmp
._setjmp(tryEnv
);
1736 IF res
= 0 THEN h(a
, b
, c
) END;
1737 isTry
:= oldIsTry
; tryEnv
:= oldTryEnv
; tryDLink
:= oldTryDLink
1740 PROCEDURE Trap
* (n
: INTEGER);
1744 IF ~secondTrap
THEN trapped
:= FALSE
; secondTrap
:= TRUE
END
1746 IF n
>= 0 THEN err
:= n
1747 ELSE err
:= -n
+ 128
1749 pc
:= 0; sp
:= 0; fp
:= 0; stack
:= 0; val
:= 0;
1755 setjmp
._longjmp(tryEnv
, 1)
1757 IF (err
= 128) OR (err
= 200) & ~intTrap
THEN (* do nothing *)
1758 ELSIF (trapViewer
# NIL) & (restart
# NIL) & ~trapped
& ~guarded
THEN
1759 trapped
:= TRUE
; trapViewer()
1760 ELSE DefaultTrapViewer
1762 trapped
:= FALSE
; secondTrap
:= FALSE
;
1763 IF restart
# NIL THEN
1764 SetDLink(startDLink
);
1765 setjmp
.siglongjmp(startEnv
, 1)
1770 PROCEDURE [ccall
] TrapHandler (signo
: signal
.int
; IN info
: signal
.siginfo_t
; context
: ADDRESS
);
1771 VAR res
: signal
.int
;
1773 IF checkReadable
THEN
1774 setjmp
.siglongjmp(checkReadableEnv
, 1)
1778 IF ~secondTrap
THEN trapped
:= FALSE
; secondTrap
:= TRUE
END
1780 err
:= -signo
; pc
:= 0; sp
:= 0; fp
:= 0; stack
:= baseStack
; val
:= 0;
1783 val
:= info
.si_code
;
1784 pc
:= info
.info
.sigfpe
.si_addr
;
1785 CASE info
.si_code
OF
1786 | signal
.FPE_INTDIV
: err
:= 139 (* division by zero *)
1787 | signal
.FPE_INTOVF
: err
:= 138 (* integer overflow *)
1788 | signal
.FPE_FLTDIV
: err
:= 140 (* fpu: division by zero *)
1789 | signal
.FPE_FLTOVF
: err
:= 142 (* fpu: overflow *)
1790 | signal
.FPE_FLTUND
: err
:= 141 (* fpu: underflow *)
1791 (* !!! | signal.FPE_FLTRES: err := ??? (* fpu: *) *)
1792 | signal
.FPE_FLTINV
: err
:= 143 (* val := opcode *) (* fpu: invalid op *)
1793 (* !!! | signal.FPE_FLTSUB: err := ??? (* fpu: *) *)
1797 val
:= info
.si_code
;
1798 err
:= 200 (* keyboard interrupt *)
1800 val
:= info
.info
.sigsegv
.si_addr
;
1801 err
:= 203 (* illigal read *)
1803 val
:= info
.info
.sigbus
.si_addr
;
1804 err
:= 10001H (* bus error *)
1806 pc
:= info
.info
.sigill
.si_addr
;
1807 err
:= 202; (* illigal instruction *)
1808 IF IsReadable(pc
, pc
+ 4) THEN
1810 (* !!! err := halt code *)
1818 setjmp
._longjmp(tryEnv
, 1)
1820 IF (err
= 128) OR (err
= 200) & ~intTrap
THEN (* do nothing *)
1821 ELSIF (trapViewer
# NIL) & (restart
# NIL) & ~trapped
& ~guarded
THEN
1822 trapped
:= TRUE
; trapViewer()
1823 ELSE DefaultTrapViewer
1825 trapped
:= FALSE
; secondTrap
:= FALSE
;
1826 IF restart
# NIL THEN
1827 setjmp
.siglongjmp(startEnv
, 1)
1832 (* -------------------- Initialization --------------------- *)
1834 PROCEDURE InstallTrap (signo
: signal
.int
);
1835 VAR act
: signal
._struct_sigaction
; (* !!! CPfront hack *) res
: signal
.int
;
1837 act
.sa_handler
:= NIL;
1838 res
:= signal
.sigemptyset(act
.sa_mask
);
1839 act
.sa_flags
:= signal
.SA_NODEFER
+ signal
.SA_SIGINFO
;
1840 act
.sa_sigaction
:= TrapHandler
;
1841 res
:= signal
.sigaction(signo
, S
.VAL(signal
.struct_sigaction
, act
), NIL);
1844 PROCEDURE InstallTrapVectors
;
1846 InstallTrap(signal
.SIGFPE
);
1847 InstallTrap(signal
.SIGINT
);
1848 InstallTrap(signal
.SIGSEGV
);
1849 InstallTrap(signal
.SIGBUS
);
1850 InstallTrap(signal
.SIGILL
)
1851 END InstallTrapVectors
;
1853 PROCEDURE RemoveTrapVectors
;
1854 END RemoveTrapVectors
;
1860 baseStack
:= S
.ADR(i
); (* XXX *)
1861 pagesize
:= unistd
.sysconf(unistd
._SC_PAGESIZE
);
1864 allocated
:= 0; total
:= 0; used
:= 0;
1865 sentinelBlock
.size
:= MAX(INTEGER);
1866 sentinel
:= S
.ADR(sentinelBlock
);
1868 REPEAT DEC(i
); free
[i
] := sentinel
UNTIL i
= 0;
1876 InitModule(modList
);
1877 IF ~inDll
THEN Quit(1) END
1881 PROCEDURE [code
] SYSTEM_argCount (): INTEGER "SYSTEM_argCount";
1882 PROCEDURE [code
] SYSTEM_argVector (): ArrStrPtr
"(Kernel_ArrStrPtr)SYSTEM_argVector";
1883 PROCEDURE [code
] SYSTEM_modlist (): Module
"(Kernel_Module)SYSTEM_modlist";
1886 IF modList
= NIL THEN (* only once *)
1887 argc
:= SYSTEM_argCount();
1888 argv
:= SYSTEM_argVector();
1889 modList
:= SYSTEM_modlist();
1890 static
:= init
IN modList
.opts
;
1891 inDll
:= dll
IN modList
.opts
;
1895 IF ~terminating
THEN
1896 terminating
:= TRUE
;