3 IMPORT S
:= SYSTEM
, stdlib
:= PosixCstdlib
, stdio
:= PosixCstdio
,
4 time
:= PosixCtime
, wctype
:= PosixCwctype
, sysmman
:= PosixCsys_mman
,
5 dlfcn
:= PosixCdlfcn
, types
:= PosixCtypes
, fcntl
:= PosixCfcntl
,
6 unistd
:= PosixCunistd
, signal
:= PosixCsignal
, setjmp
:= PosixCsetjmp
;
9 (* add signal blocking to avoid race conditions in Try/Trap/TrapHandler *)
10 (* add BeepHook for Beep *)
11 (* implement Call using libffi *)
17 timeResolution
* = 1000; (* ticks per second *)
19 processor
* = 1; (* generic c *)
21 objType
* = "ocf"; (* file types *)
25 (* loader constants *)
40 SP
= 4; (* register number of stack pointer *)
41 FP
= 5; (* register number of frame pointer *)
42 ML
= 3; (* register which holds the module list at program start *)
44 strictStackSweep
= FALSE
;
45 N
= 128 DIV 16; (* free lists *)
47 (* kernel flags in module desc *)
48 init
= 16; dyn
= 17; dll
= 24; iptrs
= 30;
50 (* meta interface consts *)
51 mConst
= 1; mTyp
= 2; mVar
= 3; mProc
= 4; mField
= 5;
54 Name
* = ARRAY nameLen
OF CHAR;
55 Utf8Name
* = ARRAY nameLen
OF SHORTCHAR
;
58 Module
* = POINTER TO RECORD [untagged
]
60 opts
-: SET; (* 0..15: compiler opts, 16..31: kernel flags *)
61 refcnt
-: INTEGER; (* <0: module invalidated *)
62 compTime
-, loadTime
-: ARRAY 6 OF SHORTINT;
63 ext
-: INTEGER; (* currently not used *)
64 term
-: Command
; (* terminator *)
65 nofimps
-, nofptrs
-: INTEGER;
66 csize
-, dsize
-, rsize
-: INTEGER;
67 code
-, data
-, refs
-: INTEGER;
68 procBase
-, varBase
-: INTEGER; (* meta base addresses *)
69 names
-: POINTER TO ARRAY [untagged
] OF SHORTCHAR
; (* names[0] = 0X *)
70 ptrs
-: POINTER TO ARRAY [untagged
] OF INTEGER;
71 imports
-: POINTER TO ARRAY [untagged
] OF Module
;
72 export
-: Directory
; (* exported objects (name sorted) *)
76 Type
* = POINTER TO RECORD [untagged
]
77 (* record: ptr to method n at offset - 4 * (n+1) *)
78 size
-: INTEGER; (* record: size, array: #elem, dyn array: 0, proc: sigfp *)
80 id
-: INTEGER; (* name idx * 256 + lev * 16 + attr * 4 + form *)
81 base
-: ARRAY 16 OF Type
; (* signature if form = ProcTyp *)
82 fields
-: Directory
; (* new fields (declaration order) *)
83 ptroffs
-: ARRAY any
OF INTEGER (* array of any length *)
86 Object
* = POINTER TO ObjDesc
;
88 ObjDesc
* = RECORD [untagged
]
90 offs
-: INTEGER; (* pvfprint for record types *)
91 id
-: INTEGER; (* name idx * 256 + vis * 16 + mode *)
92 struct
-: Type (* id of basic type or pointer to typedesc/signature *)
95 Directory
* = POINTER TO RECORD [untagged
]
96 num
-: INTEGER; (* number of entries *)
97 obj
-: ARRAY any
OF ObjDesc (* array of any length *)
100 Signature
* = POINTER TO RECORD [untagged
]
101 retStruct
-: Type
; (* id of basic type or pointer to typedesc or 0 *)
102 num
-: INTEGER; (* number of parameters *)
103 par
-: ARRAY any
OF RECORD [untagged
] (* parameters *)
104 id
-: INTEGER; (* name idx * 256 + kind *)
105 struct
-: Type (* id of basic type or pointer to typedesc *)
109 Handler
* = PROCEDURE;
111 Reducer
* = POINTER TO ABSTRACT
RECORD
115 Identifier
* = ABSTRACT
RECORD
120 TrapCleaner
* = POINTER TO ABSTRACT
RECORD
124 TryHandler
* = PROCEDURE (a
, b
, c
: INTEGER);
126 (* meta extension suport *)
128 ItemExt
* = POINTER TO ABSTRACT
RECORD END;
131 obj
*, vis
*, typ
*, adr
*: INTEGER;
138 Hook
* = POINTER TO ABSTRACT
RECORD END;
140 LoaderHook
* = POINTER TO ABSTRACT
RECORD (Hook
)
142 importing
*, imported
*, object
*: ARRAY 256 OF CHAR
145 Block
= POINTER TO RECORD [untagged
]
147 last
: INTEGER; (* arrays: last element *)
148 actual
: INTEGER; (* arrays: used during mark phase *)
149 first
: INTEGER (* arrays: first element *)
152 FreeBlock
= POINTER TO FreeDesc
;
154 FreeDesc
= RECORD [untagged
]
155 tag
: Type
; (* f.tag = ADR(f.size) *)
160 Cluster
= POINTER TO RECORD [untagged
]
161 size
: INTEGER; (* total size *)
163 max
: INTEGER (* exe: reserved size, dll: original address *)
164 (* start of first block *)
167 FList
= POINTER TO RECORD
173 CList
= POINTER TO RECORD
180 PtrType
= RECORD v
: S
.PTR
END; (* used for array of pointer *)
181 Char8Type
= RECORD v
: SHORTCHAR
END;
182 Char16Type
= RECORD v
: CHAR END;
183 Int8Type
= RECORD v
: BYTE END;
184 Int16Type
= RECORD v
: SHORTINT END;
185 Int32Type
= RECORD v
: INTEGER END;
186 Int64Type
= RECORD v
: LONGINT END;
187 BoolType
= RECORD v
: BOOLEAN END;
188 SetType
= RECORD v
: SET END;
189 Real32Type
= RECORD v
: SHORTREAL
END;
190 Real64Type
= RECORD v
: REAL END;
191 ProcType
= RECORD v
: PROCEDURE END;
192 UPtrType
= RECORD v
: INTEGER END;
193 StrPtr
= POINTER TO ARRAY [untagged
] OF SHORTCHAR
;
195 ArrStrPtr
= POINTER TO ARRAY [untagged
] OF StrPtr
;
197 ADDRESS
* = types
.Pvoid
;
204 err
-, pc
-, sp
-, fp
-, stack
-, val
-: INTEGER;
207 startEnv
: setjmp
.sigjmp_buf
;
208 tryEnv
: setjmp
.jmp_buf
;
212 pagesize
: unistd
.long
;
214 free
: ARRAY N
OF FreeBlock
; (* free list *)
215 sentinelBlock
: FreeDesc
;
217 candidates
: ARRAY 1024 OF INTEGER;
219 allocated
: INTEGER; (* bytes allocated on BlackBox heap *)
220 total
: INTEGER; (* current total size of BlackBox heap *)
221 used
: INTEGER; (* bytes allocated on system heap *)
223 hotFinalizers
: FList
;
226 trapStack
: TrapCleaner
;
227 actual
: Module
; (* valid during module initialization *)
229 trapViewer
, trapChecker
: Handler
;
230 trapped
, guarded
, secondTrap
: BOOLEAN;
231 interrupted
: BOOLEAN;
232 static
, inDll
, terminating
: BOOLEAN;
238 wouldFinalize
: BOOLEAN;
240 watcher
*: PROCEDURE (event
: INTEGER); (* for debugging *)
244 PROCEDURE Erase (adr
, words
: INTEGER);
246 ASSERT(words
>= 0, 20);
255 PROCEDURE (VAR id
: Identifier
) Identified
* (): BOOLEAN, NEW, ABSTRACT
;
256 PROCEDURE (r
: Reducer
) Reduce
* (full
: BOOLEAN), NEW, ABSTRACT
;
257 PROCEDURE (c
: TrapCleaner
) Cleanup
*, NEW, EMPTY
;
259 (* meta extension suport *)
261 PROCEDURE (e
: ItemExt
) Lookup
* (name
: ARRAY OF CHAR; VAR i
: ANYREC
), NEW, ABSTRACT
;
262 PROCEDURE (e
: ItemExt
) Index
* (index
: INTEGER; VAR elem
: ANYREC
), NEW, ABSTRACT
;
263 PROCEDURE (e
: ItemExt
) Deref
* (VAR ref
: ANYREC
), NEW, ABSTRACT
;
265 PROCEDURE (e
: ItemExt
) Valid
* (): BOOLEAN, NEW, ABSTRACT
;
266 PROCEDURE (e
: ItemExt
) Size
* (): INTEGER, NEW, ABSTRACT
;
267 PROCEDURE (e
: ItemExt
) BaseTyp
* (): INTEGER, NEW, ABSTRACT
;
268 PROCEDURE (e
: ItemExt
) Len
* (): INTEGER, NEW, ABSTRACT
;
270 PROCEDURE (e
: ItemExt
) Call
* (OUT ok
: BOOLEAN), NEW, ABSTRACT
;
271 PROCEDURE (e
: ItemExt
) BoolVal
* (): BOOLEAN, NEW, ABSTRACT
;
272 PROCEDURE (e
: ItemExt
) PutBoolVal
* (x
: BOOLEAN), NEW, ABSTRACT
;
273 PROCEDURE (e
: ItemExt
) CharVal
* (): CHAR, NEW, ABSTRACT
;
274 PROCEDURE (e
: ItemExt
) PutCharVal
* (x
: CHAR), NEW, ABSTRACT
;
275 PROCEDURE (e
: ItemExt
) IntVal
* (): INTEGER, NEW, ABSTRACT
;
276 PROCEDURE (e
: ItemExt
) PutIntVal
* (x
: INTEGER), NEW, ABSTRACT
;
277 PROCEDURE (e
: ItemExt
) LongVal
* (): LONGINT, NEW, ABSTRACT
;
278 PROCEDURE (e
: ItemExt
) PutLongVal
* (x
: LONGINT), NEW, ABSTRACT
;
279 PROCEDURE (e
: ItemExt
) RealVal
* (): REAL, NEW, ABSTRACT
;
280 PROCEDURE (e
: ItemExt
) PutRealVal
* (x
: REAL), NEW, ABSTRACT
;
281 PROCEDURE (e
: ItemExt
) SetVal
* (): SET, NEW, ABSTRACT
;
282 PROCEDURE (e
: ItemExt
) PutSetVal
* (x
: SET), NEW, ABSTRACT
;
283 PROCEDURE (e
: ItemExt
) PtrVal
* (): ANYPTR
, NEW, ABSTRACT
;
284 PROCEDURE (e
: ItemExt
) PutPtrVal
* (x
: ANYPTR
), NEW, ABSTRACT
;
285 PROCEDURE (e
: ItemExt
) GetSStringVal
* (OUT x
: ARRAY OF SHORTCHAR
;
286 OUT ok
: BOOLEAN), NEW, ABSTRACT
;
287 PROCEDURE (e
: ItemExt
) PutSStringVal
* (IN x
: ARRAY OF SHORTCHAR
;
288 OUT ok
: BOOLEAN), NEW, ABSTRACT
;
289 PROCEDURE (e
: ItemExt
) GetStringVal
* (OUT x
: ARRAY OF CHAR; OUT ok
: BOOLEAN), NEW, ABSTRACT
;
290 PROCEDURE (e
: ItemExt
) PutStringVal
* (IN x
: ARRAY OF CHAR; OUT ok
: BOOLEAN), NEW, ABSTRACT
;
292 (* -------------------- miscellaneous tools -------------------- *)
294 PROCEDURE IsUpper
* (ch
: CHAR): BOOLEAN;
296 RETURN wctype
.iswupper(ORD(ch
)) # 0
299 PROCEDURE Upper
* (ch
: CHAR): CHAR;
301 RETURN CHR(wctype
.towupper(ORD(ch
)))
304 PROCEDURE IsLower
* (ch
: CHAR): BOOLEAN;
306 RETURN wctype
.iswlower(ORD(ch
)) # 0
309 PROCEDURE Lower
* (ch
: CHAR): CHAR;
311 RETURN CHR(wctype
.towlower(ORD(ch
)))
314 PROCEDURE IsAlpha
* (ch
: CHAR): BOOLEAN;
316 RETURN wctype
.iswalpha(ORD(ch
)) # 0
319 PROCEDURE Utf8ToString
* (IN in
: ARRAY OF SHORTCHAR
; OUT out
: ARRAY OF CHAR; OUT res
: INTEGER);
320 VAR i
, j
, val
, max
: INTEGER; ch
: SHORTCHAR
;
322 PROCEDURE FormatError();
323 BEGIN out
:= in$
; res
:= 2 (*format error*)
327 ch
:= in
[0]; i
:= 1; j
:= 0; max
:= LEN(out
) - 1;
328 WHILE (ch
# 0X
) & (j
< max
) DO
332 val
:= ORD(ch
) - 192;
333 IF val
< 0 THEN FormatError
; RETURN END ;
334 ch
:= in
[i
]; INC(i
); val
:= val
* 64 + ORD(ch
) - 128;
335 IF (ch
< 80X
) OR (ch
>= 0E0X
) THEN FormatError
; RETURN END ;
336 out
[j
] := CHR(val
); INC(j
)
338 val
:= ORD(ch
) - 224;
339 ch
:= in
[i
]; INC(i
); val
:= val
* 64 + ORD(ch
) - 128;
340 IF (ch
< 80X
) OR (ch
>= 0E0X
) THEN FormatError
; RETURN END ;
341 ch
:= in
[i
]; INC(i
); val
:= val
* 64 + ORD(ch
) - 128;
342 IF (ch
< 80X
) OR (ch
>= 0E0X
) THEN FormatError
; RETURN END ;
343 out
[j
] := CHR(val
); INC(j
)
350 IF ch
= 0X
THEN res
:= 0 (*ok*) ELSE res
:= 1 (*truncated*) END
353 PROCEDURE StringToUtf8
* (IN in
: ARRAY OF CHAR; OUT out
: ARRAY OF SHORTCHAR
; OUT res
: INTEGER);
354 VAR i
, j
, val
, max
: INTEGER;
356 i
:= 0; j
:= 0; max
:= LEN(out
) - 3;
357 WHILE (in
[i
] # 0X
) & (j
< max
) DO
358 val
:= ORD(in
[i
]); INC(i
);
360 out
[j
] := SHORT(CHR(val
)); INC(j
)
361 ELSIF val
< 2048 THEN
362 out
[j
] := SHORT(CHR(val
DIV 64 + 192)); INC(j
);
363 out
[j
] := SHORT(CHR(val
MOD 64 + 128)); INC(j
)
365 out
[j
] := SHORT(CHR(val
DIV 4096 + 224)); INC(j
);
366 out
[j
] := SHORT(CHR(val
DIV 64 MOD 64 + 128)); INC(j
);
367 out
[j
] := SHORT(CHR(val
MOD 64 + 128)); INC(j
)
371 IF in
[i
] = 0X
THEN res
:= 0 (*ok*) ELSE res
:= 1 (*truncated*) END
374 PROCEDURE SplitName
* (name
: ARRAY OF CHAR; VAR head
, tail
: ARRAY OF CHAR);
376 VAR i
, j
: INTEGER; ch
, lch
: CHAR;
378 i
:= 0; ch
:= name
[0];
381 head
[i
] := ch
; lch
:= ch
; INC(i
); ch
:= name
[i
]
382 UNTIL (ch
= 0X
) OR (ch
= ".") OR IsUpper(ch
) & ~
IsUpper(lch
);
383 IF ch
= "." THEN i
:= 0; ch
:= name
[0] END;
384 head
[i
] := 0X
; j
:= 0;
385 WHILE ch
# 0X
DO tail
[j
] := ch
; INC(i
); INC(j
); ch
:= name
[i
] END;
387 IF tail
= "" THEN tail
:= head$
; head
:= "" END
388 ELSE head
:= ""; tail
:= ""
392 PROCEDURE MakeFileName
* (VAR name
: ARRAY OF CHAR; type
: ARRAY OF CHAR);
393 VAR i
, j
: INTEGER; ext
: ARRAY 8 OF CHAR; ch
: CHAR;
396 WHILE (name
[i
] # 0X
) & (name
[i
] # ".") DO INC(i
) END;
397 IF name
[i
] = "." THEN
398 IF name
[i
+ 1] = 0X
THEN name
[i
] := 0X
END
400 IF type
= "" THEN ext
:= docType
ELSE ext
:= type$
END;
401 IF i
< LEN(name
) - LEN(ext$
) - 1 THEN
402 name
[i
] := "."; INC(i
); j
:= 0; ch
:= ext
[0];
404 name
[i
] := Lower(ch
); INC(i
); INC(j
); ch
:= ext
[j
]
411 PROCEDURE Time
* (): LONGINT;
412 VAR res
: time
.int
; tp
: time
.struct_timespec
;
414 ASSERT(timeResolution
>= 1);
415 ASSERT(timeResolution
<= 1000000000);
416 res
:= time
.clock_gettime(time
.CLOCK_MONOTONIC
, tp
);
417 ASSERT(res
= 0, 100);
418 RETURN tp
.tv_sec
* LONG(timeResolution
) + tp
.tv_nsec
DIV LONG(1000000000 DIV timeResolution
)
425 PROCEDURE SearchProcVar
* (var
: INTEGER; VAR m
: Module
; VAR adr
: INTEGER);
427 adr
:= var
; m
:= NIL;
430 WHILE (m
# NIL) & ((var
< m
.code
) OR (var
>= m
.code
+ m
.csize
)) DO m
:= m
.next
END;
431 IF m
# NIL THEN DEC(adr
, m
.code
) END
435 (* -------------------- system memory management --------------------- *)
437 PROCEDURE AllocMem (size
: sysmman
.size_t
; VAR max
: sysmman
.size_t
): ADDRESS
;
438 VAR fd
, flags
, res
: fcntl
.int
; ptr
: ADDRESS
;
440 max
:= (size
+ pagesize
- 1) DIV pagesize
* pagesize
;
441 fd
:= fcntl
.open("/dev/zero", fcntl
.O_RDWR
, 0);
443 flags
:= sysmman
.PROT_READ
+ sysmman
.PROT_WRITE
;
444 ptr
:= sysmman
.mmap(0, max
, flags
, sysmman
.MAP_PRIVATE
, fd
, 0);
445 IF ptr
= sysmman
.MAP_FAILED
THEN ptr
:= 0 END;
446 res
:= unistd
.close(fd
);
454 PROCEDURE FreeMem (adr
: ADDRESS
; size
: sysmman
.size_t
);
457 size
:= (size
+ pagesize
- 1) DIV pagesize
* pagesize
;
458 res
:= sysmman
.munmap(adr
, size
);
462 PROCEDURE AllocHeapMem (size
: INTEGER; VAR c
: Cluster
);
463 CONST N
= 65536; (* cluster size for dll *)
464 VAR adr
, allocated
, newsize
: INTEGER;
467 ASSERT(size
> 0, 100); adr
:= 0;
469 adr
:= AllocMem(N
, newsize
);
473 adr
:= AllocMem(size
, newsize
);
476 IF adr
= 0 THEN c
:= NIL
478 c
:= S
.VAL(Cluster
, (adr
+ 15) DIV 16 * 16); c
.max
:= adr
;
479 c
.size
:= allocated
- (S
.VAL(INTEGER, c
) - adr
);
480 INC(used
, c
.size
); INC(total
, c
.size
)
482 ASSERT((adr
= 0) OR (adr
MOD 16 = 0) & (c
.size
>= size
), 101);
483 (* post: (c = NIL) OR (c MOD 16 = 0) & (c.size >= size) *)
486 PROCEDURE FreeHeapMem (c
: Cluster
);
488 DEC(used
, c
.size
); DEC(total
, c
.size
);
489 FreeMem(S
.VAL(ADDRESS
, c
.max
), c
.size
)
492 PROCEDURE HeapFull (size
: INTEGER): BOOLEAN;
497 PROCEDURE AllocModMem
* (descSize
, modSize
: INTEGER; VAR descAdr
, modAdr
: INTEGER);
499 descAdr
:= 0; modAdr
:= 0;
500 descAdr
:= AllocMem(descSize
, descSize
);
502 modAdr
:= AllocMem(modSize
, modSize
);
504 FreeMem(descAdr
, descSize
)
506 INC(used
, descSize
+ modSize
)
511 PROCEDURE DeallocModMem
* (descSize
, modSize
, descAdr
, modAdr
: INTEGER);
513 FreeMem(descAdr
, descSize
);
514 FreeMem(modAdr
, modSize
);
515 DEC(used
, descSize
+ modSize
)
518 PROCEDURE InvalModMem (modSize
, modAdr
: INTEGER);
520 FreeMem(modAdr
, modSize
)
523 PROCEDURE TryRead (from
, to
, c
: INTEGER);
524 VAR i
: INTEGER; x
: BYTE;
527 FOR i
:= from
TO to
DO
531 FOR i
:= to
TO from BY
-1 DO
537 PROCEDURE^ Try
* (h
: TryHandler
; a
, b
, c
: INTEGER);
539 PROCEDURE IsReadable
* (from
, to
: INTEGER): BOOLEAN;
543 Try(TryRead
, from
, to
, 0);
547 (* --------------------- NEW implementation (portable) -------------------- *)
549 PROCEDURE^
NewBlock (size
: INTEGER): Block
;
551 PROCEDURE NewRec
* (typ
: INTEGER): INTEGER; (* implementation of NEW(ptr) *)
552 VAR size
, adr
: INTEGER; b
: Block
; tag
: Type
; l
: FList
;
555 tag
:= S
.VAL(Type
, typ
);
556 b
:= NewBlock(tag
.size
);
559 S
.GET(typ
- 4, size
);
560 IF size
# 0 THEN (* record uses a finalizer *)
561 l
:= S
.VAL(FList
, S
.ADR(b
.last
)); (* anchor new object! *)
562 l
:= S
.VAL(FList
, NewRec(S
.TYP(FList
))); (* NEW(l) *)
563 l
.blk
:= b
; l
.next
:= finalizers
; finalizers
:= l
570 HALT(100) (* COM interface pointers not supported *)
575 PROCEDURE NewArr
* (eltyp
, nofelem
, nofdim
: INTEGER): INTEGER; (* impl. of NEW(ptr, dim0, dim1, ...) *)
576 VAR b
: Block
; size
, headSize
: INTEGER; t
: Type
;
579 |
-1: HALT(100) (* COM interface pointers not supported *)
580 |
0: eltyp
:= S
.ADR(PtrType
)
581 |
1: eltyp
:= S
.ADR(Char8Type
)
582 |
2: eltyp
:= S
.ADR(Int16Type
)
583 |
3: eltyp
:= S
.ADR(Int8Type
)
584 |
4: eltyp
:= S
.ADR(Int32Type
)
585 |
5: eltyp
:= S
.ADR(BoolType
)
586 |
6: eltyp
:= S
.ADR(SetType
)
587 |
7: eltyp
:= S
.ADR(Real32Type
)
588 |
8: eltyp
:= S
.ADR(Real64Type
)
589 |
9: eltyp
:= S
.ADR(Char16Type
)
590 |
10: eltyp
:= S
.ADR(Int64Type
)
591 |
11: eltyp
:= S
.ADR(ProcType
)
592 |
12: HALT(101) (* COM interface pointers not supported *)
594 ASSERT(~
ODD(eltyp
), 102) (* COM interface pointers not supported *)
596 t
:= S
.VAL(Type
, eltyp
);
597 headSize
:= 4 * nofdim
+ 12;
598 size
:= headSize
+ nofelem
* t
.size
;
601 b
.tag
:= S
.VAL(Type
, eltyp
+ 2); (* tag + array mark *)
602 b
.last
:= S
.ADR(b
.last
) + size
- t
.size
; (* pointer to last elem *)
603 b
.first
:= S
.ADR(b
.last
) + headSize
; (* pointer to first elem *)
610 (* -------------------- handler installation (portable) --------------------- *)
612 PROCEDURE ThisFinObj
* (VAR id
: Identifier
): ANYPTR
;
615 ASSERT(id
.typ
# 0, 100);
618 IF S
.VAL(INTEGER, l
.blk
.tag
) = id
.typ
THEN
619 id
.obj
:= S
.VAL(ANYPTR
, S
.ADR(l
.blk
.last
));
620 IF id
.Identified() THEN RETURN id
.obj
END
627 PROCEDURE InstallReducer
* (r
: Reducer
);
629 r
.next
:= reducers
; reducers
:= r
632 PROCEDURE InstallTrapViewer
* (h
: Handler
);
635 END InstallTrapViewer
;
637 PROCEDURE InstallTrapChecker
* (h
: Handler
);
640 END InstallTrapChecker
;
642 PROCEDURE PushTrapCleaner
* (c
: TrapCleaner
);
645 t
:= trapStack
; WHILE (t
# NIL) & (t
# c
) DO t
:= t
.next
END;
647 c
.next
:= trapStack
; trapStack
:= c
650 PROCEDURE PopTrapCleaner
* (c
: TrapCleaner
);
654 WHILE (trapStack
# NIL) & (t
# c
) DO
655 t
:= trapStack
; trapStack
:= trapStack
.next
659 PROCEDURE InstallCleaner
* (p
: Command
);
662 c
:= S
.VAL(CList
, NewRec(S
.TYP(CList
))); (* NEW(c) *)
663 c
.do
:= p
; c
.trapped
:= FALSE
; c
.next
:= cleaners
; cleaners
:= c
666 PROCEDURE RemoveCleaner
* (p
: Command
);
669 c
:= cleaners
; c0
:= NIL;
670 WHILE (c
# NIL) & (c
.do
# p
) DO c0
:= c
; c
:= c
.next
END;
672 IF c0
= NIL THEN cleaners
:= cleaners
.next
ELSE c0
.next
:= c
.next
END
679 c
:= cleaners
; c0
:= NIL;
682 c
.trapped
:= TRUE
; c
.do
; c
.trapped
:= FALSE
; c0
:= c
684 IF c0
= NIL THEN cleaners
:= cleaners
.next
685 ELSE c0
.next
:= c
.next
692 (* -------------------- meta information (portable) --------------------- *)
694 PROCEDURE (h
: LoaderHook
) ThisMod
* (IN name
: ARRAY OF CHAR): Module
, NEW, ABSTRACT
;
696 PROCEDURE SetLoaderHook
*(h
: LoaderHook
);
701 PROCEDURE InitModule (mod
: Module
); (* initialize linked modules *)
704 IF ~
(dyn
IN mod
.opts
) & (mod
.next
# NIL) & ~
(init
IN mod
.next
.opts
) THEN InitModule(mod
.next
) END;
705 IF ~
(init
IN mod
.opts
) THEN
706 body
:= S
.VAL(Command
, mod
.code
);
707 INCL(mod
.opts
, init
);
709 body(); actual
:= NIL
713 PROCEDURE ThisLoadedMod
* (IN name
: ARRAY OF CHAR): Module
; (* loaded modules only *)
714 VAR m
: Module
; res
: INTEGER; n
: Utf8Name
;
716 StringToUtf8(name
, n
, res
); ASSERT(res
= 0);
719 WHILE (m
# NIL) & ((m
.name
# n
) OR (m
.refcnt
< 0)) DO m
:= m
.next
END;
720 IF (m
# NIL) & ~
(init
IN m
.opts
) THEN InitModule(m
) END;
721 IF m
= NIL THEN loadres
:= moduleNotFound
END;
725 PROCEDURE ThisMod
* (IN name
: ARRAY OF CHAR): Module
;
729 RETURN loader
.ThisMod(name
)
731 RETURN ThisLoadedMod(name
)
735 PROCEDURE LoadMod
* (IN name
: ARRAY OF CHAR);
741 PROCEDURE GetLoaderResult
* (OUT res
: INTEGER; OUT importing
, imported
, object
: ARRAY OF CHAR);
745 importing
:= loader
.importing$
;
746 imported
:= loader
.imported$
;
747 object
:= loader
.object$
756 PROCEDURE ThisObject
* (mod
: Module
; IN name
: ARRAY OF CHAR): Object
;
757 VAR l
, r
, m
, res
: INTEGER; p
: StrPtr
; n
: Utf8Name
;
759 StringToUtf8(name
, n
, res
); ASSERT(res
= 0);
760 l
:= 0; r
:= mod
.export
.num
;
761 WHILE l
< r
DO (* binary search *)
763 p
:= S
.VAL(StrPtr
, S
.ADR(mod
.names
[mod
.export
.obj
[m
].id
DIV 256]));
764 IF p^
= n
THEN RETURN S
.VAL(Object
, S
.ADR(mod
.export
.obj
[m
])) END;
765 IF p^
< n
THEN l
:= m
+ 1 ELSE r
:= m
END
770 PROCEDURE ThisDesc
* (mod
: Module
; fprint
: INTEGER): Object
;
773 i
:= 0; n
:= mod
.export
.num
;
774 WHILE (i
< n
) & (mod
.export
.obj
[i
].id
DIV 256 = 0) DO
775 IF mod
.export
.obj
[i
].offs
= fprint
THEN RETURN S
.VAL(Object
, S
.ADR(mod
.export
.obj
[i
])) END;
781 PROCEDURE ThisField
* (rec
: Type
; IN name
: ARRAY OF CHAR): Object
;
782 VAR n
, res
: INTEGER; p
: StrPtr
; obj
: Object
; m
: Module
; nn
: Utf8Name
;
784 StringToUtf8(name
, nn
, res
); ASSERT(res
= 0);
786 obj
:= S
.VAL(Object
, S
.ADR(rec
.fields
.obj
[0])); n
:= rec
.fields
.num
;
788 p
:= S
.VAL(StrPtr
, S
.ADR(m
.names
[obj
.id
DIV 256]));
789 IF p^
= nn
THEN RETURN obj
END;
790 DEC(n
); INC(S
.VAL(INTEGER, obj
), 16)
795 PROCEDURE ThisCommand
* (mod
: Module
; IN name
: ARRAY OF CHAR): Command
;
796 VAR x
: Object
; sig
: Signature
;
798 x
:= ThisObject(mod
, name
);
799 IF (x
# NIL) & (x
.id
MOD 16 = mProc
) THEN
800 sig
:= S
.VAL(Signature
, x
.struct
);
801 IF (sig
.retStruct
= NIL) & (sig
.num
= 0) THEN RETURN S
.VAL(Command
, mod
.procBase
+ x
.offs
) END
806 PROCEDURE ThisType
* (mod
: Module
; IN name
: ARRAY OF CHAR): Type
;
809 x
:= ThisObject(mod
, name
);
810 IF (x
# NIL) & (x
.id
MOD 16 = mTyp
) & (S
.VAL(INTEGER, x
.struct
) DIV 256 # 0) THEN
817 PROCEDURE TypeOf
* (IN rec
: ANYREC
): Type
;
819 RETURN S
.VAL(Type
, S
.TYP(rec
))
822 PROCEDURE LevelOf
* (t
: Type
): SHORTINT;
824 RETURN SHORT(t
.id
DIV 16 MOD 16)
827 PROCEDURE NewObj
* (VAR o
: S
.PTR
; t
: Type
);
830 IF t
.size
= -1 THEN o
:= NIL
832 i
:= 0; WHILE t
.ptroffs
[i
] >= 0 DO INC(i
) END;
833 IF t
.ptroffs
[i
+1] >= 0 THEN INC(S
.VAL(INTEGER, t
)) END; (* with interface pointers *)
834 o
:= S
.VAL(S
.PTR
, NewRec(S
.VAL(INTEGER, t
))) (* generic NEW *)
838 PROCEDURE GetModName
* (mod
: Module
; OUT name
: Name
);
841 Utf8ToString(mod
.name
, name
, res
); ASSERT(res
= 0)
844 PROCEDURE GetObjName
* (mod
: Module
; obj
: Object
; OUT name
: Name
);
845 VAR p
: StrPtr
; res
: INTEGER;
847 p
:= S
.VAL(StrPtr
, S
.ADR(mod
.names
[obj
.id
DIV 256]));
848 Utf8ToString(p^$
, name
, res
); ASSERT(res
= 0)
851 PROCEDURE GetTypeName
* (t
: Type
; OUT name
: Name
);
852 VAR p
: StrPtr
; res
: INTEGER;
854 p
:= S
.VAL(StrPtr
, S
.ADR(t
.mod
.names
[t
.id
DIV 256]));
855 Utf8ToString(p^$
, name
, res
); ASSERT(res
= 0)
858 PROCEDURE RegisterMod
* (mod
: Module
);
859 VAR i
: INTEGER; epoch
: time
.time_t
; tm
: time
.struct_tm
; ptm
: time
.Pstruct_tm
;
861 mod
.next
:= modList
; modList
:= mod
; mod
.refcnt
:= 0; INCL(mod
.opts
, dyn
); i
:= 0;
862 WHILE i
< mod
.nofimps
DO
863 IF mod
.imports
[i
] # NIL THEN INC(mod
.imports
[i
].refcnt
) END;
866 epoch
:= time
.time(NIL);
867 ptm
:= time
.localtime_r(epoch
, tm
);
869 mod
.loadTime
[0] := SHORT(tm
.tm_year
+ 1900);
870 mod
.loadTime
[1] := SHORT(tm
.tm_mon
+ 1);
871 mod
.loadTime
[2] := SHORT(tm
.tm_mday
);
872 mod
.loadTime
[3] := SHORT(tm
.tm_hour
);
873 mod
.loadTime
[4] := SHORT(tm
.tm_min
);
874 mod
.loadTime
[5] := SHORT(tm
.tm_sec
)
876 mod
.loadTime
[0] := 0;
877 mod
.loadTime
[1] := 0;
878 mod
.loadTime
[2] := 0;
879 mod
.loadTime
[3] := 0;
880 mod
.loadTime
[4] := 0;
883 IF ~
(init
IN mod
.opts
) THEN InitModule(mod
) END
888 PROCEDURE UnloadMod
* (mod
: Module
);
889 VAR i
: INTEGER; t
: Command
;
891 IF mod
.refcnt
= 0 THEN
892 t
:= mod
.term
; mod
.term
:= NIL;
893 IF t
# NIL THEN t() END; (* terminate module *)
895 WHILE i
< mod
.nofptrs
DO (* release global pointers *)
896 S
.PUT(mod
.varBase
+ mod
.ptrs
[i
], 0); INC(i
)
898 Collect
; (* call finalizers *)
900 WHILE i
< mod
.nofimps
DO (* release imported modules *)
901 IF mod
.imports
[i
] # NIL THEN DEC(mod
.imports
[i
].refcnt
) END;
905 IF dyn
IN mod
.opts
THEN (* release memory *)
906 InvalModMem(mod
.data
+ mod
.dsize
- mod
.refs
, mod
.refs
)
911 (* -------------------- dynamic procedure call --------------------- *)
913 PROCEDURE Call
* (adr
: INTEGER; sig
: Signature
; IN par
: ARRAY OF INTEGER; n
: INTEGER): LONGINT;
919 (* -------------------- reference information (portable) --------------------- *)
921 PROCEDURE RefCh (VAR ref
: INTEGER; OUT ch
: SHORTCHAR
);
923 S
.GET(ref
, ch
); INC(ref
)
926 PROCEDURE RefNum (VAR ref
: INTEGER; OUT x
: INTEGER);
927 VAR s
, n
: INTEGER; ch
: SHORTCHAR
;
929 s
:= 0; n
:= 0; RefCh(ref
, ch
);
930 WHILE ORD(ch
) >= 128 DO INC(n
, ASH(ORD(ch
) - 128, s
) ); INC(s
, 7); RefCh(ref
, ch
) END;
931 x
:= n
+ ASH(ORD(ch
) MOD 64 - ORD(ch
) DIV 64 * 64, s
)
934 PROCEDURE RefName (VAR ref
: INTEGER; OUT n
: Utf8Name
);
935 VAR i
: INTEGER; ch
: SHORTCHAR
;
937 i
:= 0; RefCh(ref
, ch
);
938 WHILE ch
# 0X
DO n
[i
] := ch
; INC(i
); RefCh(ref
, ch
) END;
942 PROCEDURE GetRefProc
* (VAR ref
: INTEGER; OUT adr
: INTEGER; OUT name
: Utf8Name
);
946 WHILE ch
>= 0FDX
DO (* skip variables *)
947 INC(ref
); RefCh(ref
, ch
);
948 IF ch
= 10X
THEN INC(ref
, 4) END;
949 RefNum(ref
, adr
); RefName(ref
, name
); S
.GET(ref
, ch
)
951 WHILE (ch
> 0X
) & (ch
< 0FCX
) DO (* skip source refs *)
952 INC(ref
); RefNum(ref
, adr
); S
.GET(ref
, ch
)
954 IF ch
= 0FCX
THEN INC(ref
); RefNum(ref
, adr
); RefName(ref
, name
)
959 PROCEDURE GetRefVar
* (VAR ref
: INTEGER; OUT mode
, form
: SHORTCHAR
; OUT desc
: Type
; OUT adr
: INTEGER; OUT name
: Utf8Name
);
961 S
.GET(ref
, mode
); desc
:= NIL;
963 mode
:= SHORT(CHR(ORD(mode
) - 0FCH
));
964 INC(ref
); RefCh(ref
, form
);
966 S
.GET(ref
, desc
); INC(ref
, 4); form
:= SHORT(CHR(16 + desc
.id
MOD 4))
968 RefNum(ref
, adr
); RefName(ref
, name
)
970 mode
:= 0X
; form
:= 0X
; adr
:= 0
974 PROCEDURE SourcePos
* (mod
: Module
; codePos
: INTEGER): INTEGER;
975 VAR ref
, pos
, ad
, d
: INTEGER; ch
: SHORTCHAR
; name
: Utf8Name
;
977 IF mod
# NIL THEN (* mf, 12.02.04 *)
978 ref
:= mod
.refs
; pos
:= 0; ad
:= 0; S
.GET(ref
, ch
);
980 WHILE (ch
> 0X
) & (ch
< 0FCX
) DO (* srcref: {dAdr,dPos} *)
981 INC(ad
, ORD(ch
)); INC(ref
); RefNum(ref
, d
);
982 IF ad
> codePos
THEN RETURN pos
END;
983 INC(pos
, d
); S
.GET(ref
, ch
)
985 IF ch
= 0FCX
THEN (* proc: 0FCX,Adr,Name *)
986 INC(ref
); RefNum(ref
, d
); RefName(ref
, name
); S
.GET(ref
, ch
);
987 IF (d
> codePos
) & (pos
> 0) THEN RETURN pos
END
989 WHILE ch
>= 0FDX
DO (* skip variables: Mode, Form, adr, Name *)
990 INC(ref
); RefCh(ref
, ch
);
991 IF ch
= 10X
THEN INC(ref
, 4) END;
992 RefNum(ref
, d
); RefName(ref
, name
); S
.GET(ref
, ch
)
999 PROCEDURE LoadDll
* (IN name
: ARRAY OF CHAR; VAR ok
: BOOLEAN);
1000 VAR h
: ADDRESS
; file
: Utf8Name
; res
: INTEGER;
1002 StringToUtf8(name
, file
, res
);
1004 h
:= dlfcn
.dlopen(file
, dlfcn
.RTLD_LAZY
+ dlfcn
.RTLD_GLOBAL
);
1011 PROCEDURE ThisDllObj
* (mode
, fprint
: INTEGER; IN dll
, name
: ARRAY OF CHAR): INTEGER;
1012 VAR h
, p
: ADDRESS
; file
, sym
: Utf8Name
; res
: INTEGER; err
: dlfcn
.int
;
1014 StringToUtf8(dll
, file
, res
);
1016 h
:= dlfcn
.dlopen(file
, dlfcn
.RTLD_LAZY
+ dlfcn
.RTLD_GLOBAL
);
1018 StringToUtf8(name
, sym
, res
);
1020 p
:= dlfcn
.dlsym(h
, sym
)
1024 err
:= dlfcn
.dlclose(h
);
1025 ASSERT(err
= 0, 100)
1035 (* -------------------- garbage collector (portable) --------------------- *)
1037 PROCEDURE Mark (this
: Block
);
1038 VAR father
, son
: Block
; tag
: Type
; flag
, offset
, actual
: INTEGER;
1040 IF ~
ODD(S
.VAL(INTEGER, this
.tag
)) THEN
1043 INC(S
.VAL(INTEGER, this
.tag
));
1044 flag
:= S
.VAL(INTEGER, this
.tag
) MOD 4;
1045 tag
:= S
.VAL(Type
, S
.VAL(INTEGER, this
.tag
) - flag
);
1046 IF flag
>= 2 THEN actual
:= this
.first
; this
.actual
:= actual
1047 ELSE actual
:= S
.ADR(this
.last
)
1050 offset
:= tag
.ptroffs
[0];
1052 INC(S
.VAL(INTEGER, tag
), offset
+ 4); (* restore tag *)
1053 IF (flag
>= 2) & (actual
< this
.last
) & (offset
< -4) THEN (* next array element *)
1054 INC(actual
, tag
.size
); this
.actual
:= actual
1056 this
.tag
:= S
.VAL(Type
, S
.VAL(INTEGER, tag
) + flag
);
1057 IF father
= NIL THEN RETURN END;
1058 son
:= this
; this
:= father
;
1059 flag
:= S
.VAL(INTEGER, this
.tag
) MOD 4;
1060 tag
:= S
.VAL(Type
, S
.VAL(INTEGER, this
.tag
) - flag
);
1061 offset
:= tag
.ptroffs
[0];
1062 IF flag
>= 2 THEN actual
:= this
.actual
ELSE actual
:= S
.ADR(this
.last
) END;
1063 S
.GET(actual
+ offset
, father
); S
.PUT(actual
+ offset
, S
.ADR(son
.last
));
1064 INC(S
.VAL(INTEGER, tag
), 4)
1067 S
.GET(actual
+ offset
, son
);
1069 DEC(S
.VAL(INTEGER, son
), 4);
1070 IF ~
ODD(S
.VAL(INTEGER, son
.tag
)) THEN (* down *)
1071 this
.tag
:= S
.VAL(Type
, S
.VAL(INTEGER, tag
) + flag
);
1072 S
.PUT(actual
+ offset
, father
); father
:= this
; this
:= son
;
1076 INC(S
.VAL(INTEGER, tag
), 4)
1083 PROCEDURE MarkGlobals
;
1084 VAR m
: Module
; i
, p
: INTEGER;
1088 IF m
.refcnt
>= 0 THEN
1090 WHILE i
< m
.nofptrs
DO
1091 S
.GET(m
.varBase
+ m
.ptrs
[i
], p
); INC(i
);
1092 IF p
# 0 THEN Mark(S
.VAL(Block
, p
- 4)) END
1099 PROCEDURE Next (b
: Block
): Block
; (* next block in same cluster *)
1102 S
.GET(S
.VAL(INTEGER, b
.tag
) DIV 4 * 4, size
);
1103 IF ODD(S
.VAL(INTEGER, b
.tag
) DIV 2) THEN INC(size
, b
.last
- S
.ADR(b
.last
)) END;
1104 RETURN S
.VAL(Block
, S
.VAL(INTEGER, b
) + (size
+ 19) DIV 16 * 16)
1107 PROCEDURE CheckCandidates
;
1108 (* pre: nofcand > 0 *)
1109 VAR i
, j
, h
, p
, end
: INTEGER; c
: Cluster
; blk
, next
: Block
;
1111 (* sort candidates (shellsort) *)
1112 h
:= 1; REPEAT h
:= h
*3 + 1 UNTIL h
> nofcand
;
1113 REPEAT h
:= h
DIV 3; i
:= h
;
1114 WHILE i
< nofcand
DO p
:= candidates
[i
]; j
:= i
;
1115 WHILE (j
>= h
) & (candidates
[j
-h
] > p
) DO
1116 candidates
[j
] := candidates
[j
-h
]; j
:= j
-h
1118 candidates
[j
] := p
; INC(i
)
1124 blk
:= S
.VAL(Block
, S
.VAL(INTEGER, c
) + 12);
1125 end
:= S
.VAL(INTEGER, blk
) + (c
.size
- 12) DIV 16 * 16;
1126 WHILE candidates
[i
] < S
.VAL(INTEGER, blk
) DO
1128 IF i
= nofcand
THEN RETURN END
1130 WHILE S
.VAL(INTEGER, blk
) < end
DO
1132 IF candidates
[i
] < S
.VAL(INTEGER, next
) THEN
1133 IF (S
.VAL(INTEGER, blk
.tag
) # S
.ADR(blk
.last
)) (* not a free block *)
1134 & (~strictStackSweep
OR (candidates
[i
] = S
.ADR(blk
.last
))) THEN
1139 IF i
= nofcand
THEN RETURN END
1140 UNTIL candidates
[i
] >= S
.VAL(INTEGER, next
)
1142 IF (S
.VAL(INTEGER, blk
.tag
) MOD 4 = 0) & (S
.VAL(INTEGER, blk
.tag
) # S
.ADR(blk
.last
))
1143 & (blk
.tag
.base
[0] = NIL) & (blk
.actual
> 0) THEN (* referenced interface record *)
1150 END CheckCandidates
;
1152 PROCEDURE MarkLocals
;
1153 VAR sp
, p
, min
, max
: INTEGER; c
: Cluster
;
1155 sp
:= S
.ADR(sp
); nofcand
:= 0; c
:= root
;
1156 WHILE c
.next
# NIL DO c
:= c
.next
END;
1157 min
:= S
.VAL(INTEGER, root
); max
:= S
.VAL(INTEGER, c
) + c
.size
;
1158 WHILE sp
< baseStack
DO
1160 IF (p
> min
) & (p
< max
) & (~strictStackSweep
OR (p
MOD 16 = 0)) THEN
1161 candidates
[nofcand
] := p
; INC(nofcand
);
1162 IF nofcand
= LEN(candidates
) - 1 THEN CheckCandidates
; nofcand
:= 0 END
1166 candidates
[nofcand
] := max
; INC(nofcand
); (* ensure complete scan for interface mark*)
1167 IF nofcand
> 0 THEN CheckCandidates
END
1170 PROCEDURE MarkFinObj
;
1173 wouldFinalize
:= FALSE
;
1176 IF ~
ODD(S
.VAL(INTEGER, f
.blk
.tag
)) THEN wouldFinalize
:= TRUE
END;
1181 WHILE f
# NIL DO IF ~
ODD(S
.VAL(INTEGER, f
.blk
.tag
)) THEN wouldFinalize
:= TRUE
END;
1187 PROCEDURE CheckFinalizers
;
1188 VAR f
, g
, h
, k
: FList
;
1190 f
:= finalizers
; g
:= NIL;
1191 IF hotFinalizers
= NIL THEN k
:= NIL
1194 WHILE k
.next
# NIL DO k
:= k
.next
END
1197 h
:= f
; f
:= f
.next
;
1198 IF ~
ODD(S
.VAL(INTEGER, h
.blk
.tag
)) THEN
1199 IF g
= NIL THEN finalizers
:= f
ELSE g
.next
:= f
END;
1200 IF k
= NIL THEN hotFinalizers
:= h
ELSE k
.next
:= h
END;
1201 k
:= h
; h
.next
:= NIL
1206 WHILE h
# NIL DO Mark(h
.blk
); h
:= h
.next
END
1207 END CheckFinalizers
;
1209 PROCEDURE ExecFinalizer (a
, b
, c
: INTEGER);
1210 VAR f
: FList
; fin
: PROCEDURE(this
: ANYPTR
);
1212 f
:= S
.VAL(FList
, a
);
1213 S
.GET(S
.VAL(INTEGER, f
.blk
.tag
) - 4, fin
); (* method 0 *)
1214 IF (fin
# NIL) & (f
.blk
.tag
.mod
.refcnt
>= 0) THEN fin(S
.VAL(ANYPTR
, S
.ADR(f
.blk
.last
))) END;
1217 PROCEDURE^ Try
* (h
: TryHandler
; a
, b
, c
: INTEGER); (* COMPILER DEPENDENT *)
1219 PROCEDURE CallFinalizers
;
1222 WHILE hotFinalizers
# NIL DO
1223 f
:= hotFinalizers
; hotFinalizers
:= hotFinalizers
.next
;
1224 Try(ExecFinalizer
, S
.VAL(INTEGER, f
), 0, 0)
1226 wouldFinalize
:= FALSE
1229 PROCEDURE Insert (blk
: FreeBlock
; size
: INTEGER); (* insert block in free list *)
1232 blk
.size
:= size
- 4; blk
.tag
:= S
.VAL(Type
, S
.ADR(blk
.size
));
1233 i
:= MIN(N
- 1, (blk
.size
DIV 16));
1234 blk
.next
:= free
[i
]; free
[i
] := blk
1237 PROCEDURE Sweep (dealloc
: BOOLEAN);
1238 VAR cluster
, last
, c
: Cluster
; blk
, next
: Block
; fblk
, b
, t
: FreeBlock
; end
, i
: INTEGER;
1240 cluster
:= root
; last
:= NIL; allocated
:= 0;
1242 REPEAT DEC(i
); free
[i
] := sentinel
UNTIL i
= 0;
1243 WHILE cluster
# NIL DO
1244 blk
:= S
.VAL(Block
, S
.VAL(INTEGER, cluster
) + 12);
1245 end
:= S
.VAL(INTEGER, blk
) + (cluster
.size
- 12) DIV 16 * 16;
1247 WHILE S
.VAL(INTEGER, blk
) < end
DO
1249 IF ODD(S
.VAL(INTEGER, blk
.tag
)) THEN
1251 Insert(fblk
, S
.VAL(INTEGER, blk
) - S
.VAL(INTEGER, fblk
));
1254 DEC(S
.VAL(INTEGER, blk
.tag
)); (* unmark *)
1255 INC(allocated
, S
.VAL(INTEGER, next
) - S
.VAL(INTEGER, blk
))
1256 ELSIF fblk
= NIL THEN
1257 fblk
:= S
.VAL(FreeBlock
, blk
)
1261 IF dealloc
& (S
.VAL(INTEGER, fblk
) = S
.VAL(INTEGER, cluster
) + 12) THEN (* deallocate cluster *)
1262 c
:= cluster
; cluster
:= cluster
.next
;
1263 IF last
= NIL THEN root
:= cluster
ELSE last
.next
:= cluster
END;
1266 IF fblk
# NIL THEN Insert(fblk
, end
- S
.VAL(INTEGER, fblk
)) END;
1267 last
:= cluster
; cluster
:= cluster
.next
1270 (* reverse free list *)
1274 b
:= free
[i
]; fblk
:= sentinel
;
1275 WHILE b
# sentinel
DO t
:= b
; b
:= t
.next
; t
.next
:= fblk
; fblk
:= t
END;
1283 CallFinalizers
; (* trap cleanup *)
1292 PROCEDURE FastCollect
*;
1302 PROCEDURE WouldFinalize
* (): BOOLEAN;
1304 RETURN wouldFinalize
1307 (* --------------------- memory allocation (portable) -------------------- *)
1309 PROCEDURE OldBlock (size
: INTEGER): FreeBlock
; (* size MOD 16 = 0 *)
1310 VAR b
, l
: FreeBlock
; s
, i
: INTEGER;
1313 i
:= MIN(N
- 1, s
DIV 16);
1314 WHILE (i
# N
- 1) & (free
[i
] = sentinel
) DO INC(i
) END;
1315 b
:= free
[i
]; l
:= NIL;
1316 WHILE b
.size
< s
DO l
:= b
; b
:= b
.next
END;
1317 IF b
# sentinel
THEN
1318 IF l
= NIL THEN free
[i
] := b
.next
ELSE l
.next
:= b
.next
END
1324 PROCEDURE LastBlock (limit
: INTEGER): FreeBlock
; (* size MOD 16 = 0 *)
1325 VAR b
, l
: FreeBlock
; s
, i
: INTEGER;
1330 b
:= free
[i
]; l
:= NIL;
1331 WHILE (b
# sentinel
) & (S
.VAL(INTEGER, b
) + b
.size
# s
) DO l
:= b
; b
:= b
.next
END;
1332 IF b
# sentinel
THEN
1333 IF l
= NIL THEN free
[i
] := b
.next
ELSE l
.next
:= b
.next
END
1337 UNTIL (b
# NIL) OR (i
= N
);
1341 PROCEDURE NewBlock (size
: INTEGER): Block
;
1342 VAR tsize
, a
, s
: INTEGER; b
: FreeBlock
; new
, c
: Cluster
; r
: Reducer
;
1344 ASSERT(size
>= 0, 20);
1345 IF size
> MAX(INTEGER) - 19 THEN RETURN NIL END;
1346 tsize
:= (size
+ 19) DIV 16 * 16;
1347 b
:= OldBlock(tsize
); (* 1) search for free block *)
1349 FastCollect
; b
:= OldBlock(tsize
); (* 2) collect *)
1351 Collect
; b
:= OldBlock(tsize
); (* 2a) fully collect *)
1354 AllocHeapMem(tsize
+ 12, new
); (* 3) allocate new cluster *)
1356 IF (root
= NIL) OR (S
.VAL(INTEGER, new
) < S
.VAL(INTEGER, root
)) THEN
1357 new
.next
:= root
; root
:= new
1360 WHILE (c
.next
# NIL) & (S
.VAL(INTEGER, new
) > S
.VAL(INTEGER, c
.next
)) DO c
:= c
.next
END;
1361 new
.next
:= c
.next
; c
.next
:= new
1363 b
:= S
.VAL(FreeBlock
, S
.VAL(INTEGER, new
) + 12);
1364 b
.size
:= (new
.size
- 12) DIV 16 * 16 - 4
1366 RETURN NIL (* 4) give up *)
1371 a
:= b
.size
+ 4 - tsize
;
1372 IF a
> 0 THEN Insert(S
.VAL(FreeBlock
, S
.VAL(INTEGER, b
) + tsize
), a
) END;
1373 IF size
> 0 THEN Erase(S
.ADR(b
.size
), (size
+ 3) DIV 4) END;
1374 INC(allocated
, tsize
);
1375 RETURN S
.VAL(Block
, b
)
1378 PROCEDURE Allocated
* (): INTEGER;
1383 PROCEDURE Used
* (): INTEGER;
1388 PROCEDURE Root
* (): INTEGER;
1390 RETURN S
.VAL(INTEGER, root
)
1393 (* -------------------- Trap Handling --------------------- *)
1395 PROCEDURE Start
* (code
: Command
);
1396 VAR res
: setjmp
.int
;
1399 S
.GETREG(SP
, baseStack
);
1400 res
:= setjmp
.sigsetjmp(startEnv
, 1);
1404 PROCEDURE Quit
* (exitCode
: INTEGER);
1405 VAR m
: Module
; term
: Command
; t
: BOOLEAN;
1407 trapViewer
:= NIL; trapChecker
:= NIL; restart
:= NIL;
1408 t
:= terminating
; terminating
:= TRUE
; m
:= modList
;
1409 WHILE m
# NIL DO (* call terminators *)
1410 IF ~static
OR ~t
THEN
1411 term
:= m
.term
; m
.term
:= NIL;
1412 IF term
# NIL THEN term() END
1417 hotFinalizers
:= finalizers
; finalizers
:= NIL;
1419 stdlib
.exit(exitCode
)
1422 PROCEDURE FatalError
* (id
: INTEGER; str
: ARRAY OF CHAR);
1423 VAR res
: stdio
.int
; title
: ARRAY 16 OF CHAR; text
: ARRAY 256 OF SHORTCHAR
;
1425 title
:= "Error xy";
1426 title
[6] := CHR(id
DIV 10 + ORD("0"));
1427 title
[7] := CHR(id
MOD 10 + ORD("0"));
1428 res
:= unistd
.write(2, S
.ADR(title
), 8);
1432 PROCEDURE DefaultTrapViewer
;
1433 VAR out
: ARRAY 2048 OF SHORTCHAR
; a
, b
, c
, len
, ref
, end
: INTEGER; mod
: Module
;
1434 modName
, name
: Name
; n
: Utf8Name
; res
: unistd
.int
;
1436 PROCEDURE WriteString (IN s
: ARRAY OF SHORTCHAR
);
1440 WHILE (len
< LEN(out
) - 1) & (s
[i
] # 0X
) DO out
[len
] := s
[i
]; INC(i
); INC(len
) END
1443 PROCEDURE WriteHex (x
, n
: INTEGER);
1446 IF len
+ n
< LEN(out
) THEN
1449 y
:= x
MOD 16; x
:= x
DIV 16;
1450 IF y
> 9 THEN y
:= y
+ (ORD("A") - ORD("0") - 10) END;
1451 out
[i
] := SHORT(CHR(y
+ ORD("0"))); DEC(i
)
1459 IF len
< LEN(out
) - 1 THEN out
[len
] := 0AX
; INC(len
) END
1464 WriteString("====== ");
1465 IF err
= 129 THEN WriteString("invalid with")
1466 ELSIF err
= 130 THEN WriteString("invalid case")
1467 ELSIF err
= 131 THEN WriteString("function without return")
1468 ELSIF err
= 132 THEN WriteString("type guard")
1469 ELSIF err
= 133 THEN WriteString("implied type guard")
1470 ELSIF err
= 134 THEN WriteString("value out of range")
1471 ELSIF err
= 135 THEN WriteString("index out of range")
1472 ELSIF err
= 136 THEN WriteString("string too long")
1473 ELSIF err
= 137 THEN WriteString("stack overflow")
1474 ELSIF err
= 138 THEN WriteString("integer overflow")
1475 ELSIF err
= 139 THEN WriteString("division by zero")
1476 ELSIF err
= 140 THEN WriteString("infinite real result")
1477 ELSIF err
= 141 THEN WriteString("real underflow")
1478 ELSIF err
= 142 THEN WriteString("real overflow")
1479 ELSIF err
= 143 THEN WriteString("undefined real result")
1480 ELSIF err
= 144 THEN WriteString("not a number")
1481 ELSIF err
= 200 THEN WriteString("keyboard interrupt")
1482 ELSIF err
= 201 THEN WriteString("NIL dereference")
1483 ELSIF err
= 202 THEN WriteString("illegal instruction: ");
1485 ELSIF err
= 203 THEN WriteString("illegal memory read [ad = ");
1486 WriteHex(val
, 8); WriteString("]")
1487 ELSIF err
= 204 THEN WriteString("illegal memory write [ad = ");
1488 WriteHex(val
, 8); WriteString("]")
1489 ELSIF err
= 205 THEN WriteString("illegal execution [ad = ");
1490 WriteHex(val
, 8); WriteString("]")
1491 ELSIF err
= 257 THEN WriteString("out of memory")
1492 ELSIF err
= 10001H
THEN WriteString("bus error")
1493 ELSIF err
= 10002H
THEN WriteString("address error")
1494 ELSIF err
= 10007H
THEN WriteString("fpu error")
1495 ELSIF err
< 0 THEN WriteString("exception #"); WriteHex(-err
, 2)
1496 ELSE err
:= err
DIV 100 * 256 + err
DIV 10 MOD 10 * 16 + err
MOD 10;
1497 WriteString("trap #"); WriteHex(err
, 3)
1499 WriteString(" ======");
1500 a
:= pc
; b
:= fp
; c
:= 12;
1502 WriteLn
; WriteString("- ");
1504 WHILE (mod
# NIL) & ((a
< mod
.code
) OR (a
>= mod
.code
+ mod
.csize
)) DO mod
:= mod
.next
END;
1507 IF mod
.refcnt
>= 0 THEN
1508 GetModName(mod
, modName
); WriteString(SHORT(modName
)); ref
:= mod
.refs
;
1509 REPEAT GetRefProc(ref
, end
, n
) UNTIL (end
= 0) OR (a
< end
);
1511 Utf8ToString(n
, name
, res
); WriteString("."); WriteString(SHORT(name
))
1514 GetModName(mod
, modName
); WriteString("("); WriteString(SHORT(modName
)); WriteString(")")
1518 WriteString("(pc="); WriteHex(a
, 8);
1519 WriteString(", fp="); WriteHex(b
, 8); WriteString(")");
1520 IF (b
>= sp
) & (b
< stack
) THEN
1521 S
.GET(b
+4, a
); (* stacked pc *)
1522 S
.GET(b
, b
); (* dynamic link *)
1528 res
:= unistd
.write(2, S
.ADR(out
), len
)
1529 END DefaultTrapViewer
;
1531 PROCEDURE TrapCleanup
;
1534 WHILE trapStack
# NIL DO
1535 t
:= trapStack
; trapStack
:= trapStack
.next
; t
.Cleanup
1537 IF (trapChecker
# NIL) & (err
# 128) THEN trapChecker
END
1540 PROCEDURE SetTrapGuard
* (on
: BOOLEAN);
1545 PROCEDURE Try
* (h
: TryHandler
; a
, b
, c
: INTEGER);
1546 VAR oldIsTry
: BOOLEAN; oldTryEnv
: setjmp
.jmp_buf
; res
: setjmp
.int
;
1548 oldIsTry
:= isTry
; oldTryEnv
:= tryEnv
;
1550 res
:= setjmp
._setjmp(tryEnv
);
1551 IF res
= 0 THEN h(a
, b
, c
) END;
1552 isTry
:= oldIsTry
; tryEnv
:= oldTryEnv
1555 PROCEDURE Trap
* (n
: INTEGER);
1559 IF ~secondTrap
THEN trapped
:= FALSE
; secondTrap
:= TRUE
END
1561 IF n
>= 0 THEN err
:= n
1562 ELSE err
:= -n
+ 128
1564 pc
:= 0; sp
:= 0; fp
:= 0; stack
:= 0; val
:= 0;
1569 setjmp
._longjmp(tryEnv
, 1)
1571 IF (err
= 128) OR (err
= 200) & ~intTrap
THEN (* do nothing *)
1572 ELSIF (trapViewer
# NIL) & (restart
# NIL) & ~trapped
& ~guarded
THEN
1573 trapped
:= TRUE
; trapViewer()
1574 ELSE DefaultTrapViewer
1576 trapped
:= FALSE
; secondTrap
:= FALSE
;
1577 IF restart
# NIL THEN
1578 setjmp
.siglongjmp(startEnv
, 1)
1583 PROCEDURE [ccall
] TrapHandler (signo
: signal
.int
; IN info
: signal
.siginfo_t
; context
: ADDRESS
);
1584 VAR res
: signal
.int
;
1588 IF ~secondTrap
THEN trapped
:= FALSE
; secondTrap
:= TRUE
END
1590 err
:= -signo
; pc
:= 0; sp
:= 0; fp
:= 0; stack
:= baseStack
; val
:= 0;
1593 val
:= info
.si_code
;
1594 pc
:= info
.info
.sigfpe
.si_addr
;
1595 CASE info
.si_code
OF
1596 | signal
.FPE_INTDIV
: err
:= 139 (* division by zero *)
1597 | signal
.FPE_INTOVF
: err
:= 138 (* integer overflow *)
1598 | signal
.FPE_FLTDIV
: err
:= 140 (* fpu: division by zero *)
1599 | signal
.FPE_FLTOVF
: err
:= 142 (* fpu: overflow *)
1600 | signal
.FPE_FLTUND
: err
:= 141 (* fpu: underflow *)
1601 (* !!! | signal.FPE_FLTRES: err := ??? (* fpu: *) *)
1602 | signal
.FPE_FLTINV
: err
:= 143 (* val := opcode *) (* fpu: invalid op *)
1603 (* !!! | signal.FPE_FLTSUB: err := ??? (* fpu: *) *)
1607 val
:= info
.si_code
;
1608 err
:= 200 (* keyboard interrupt *)
1610 val
:= info
.info
.sigsegv
.si_addr
;
1611 err
:= 203 (* illigal read *)
1613 val
:= info
.info
.sigbus
.si_addr
;
1614 err
:= 10001H (* bus error *)
1616 pc
:= info
.info
.sigill
.si_addr
;
1617 err
:= 202; (* illigal instruction *)
1618 IF IsReadable(pc
, pc
+ 4) THEN
1620 (* !!! err := halt code *)
1628 setjmp
._longjmp(tryEnv
, 1)
1630 IF (err
= 128) OR (err
= 200) & ~intTrap
THEN (* do nothing *)
1631 ELSIF (trapViewer
# NIL) & (restart
# NIL) & ~trapped
& ~guarded
THEN
1632 trapped
:= TRUE
; trapViewer()
1633 ELSE DefaultTrapViewer
1635 trapped
:= FALSE
; secondTrap
:= FALSE
;
1636 IF restart
# NIL THEN
1637 setjmp
.siglongjmp(startEnv
, 1)
1642 (* -------------------- Initialization --------------------- *)
1644 PROCEDURE InstallTrap (signo
: signal
.int
);
1645 VAR act
: signal
.struct_sigaction
; res
: signal
.int
;
1647 act
.handler
.sa_handler
:= NIL;
1648 res
:= signal
.sigemptyset(act
.sa_mask
);
1649 act
.sa_flags
:= signal
.SA_NODEFER
+ signal
.SA_SIGINFO
;
1650 act
.handler
.sa_sigaction
:= TrapHandler
;
1651 res
:= signal
.sigaction(signo
, act
, NIL);
1654 PROCEDURE InstallTrapVectors
;
1656 InstallTrap(signal
.SIGFPE
);
1657 InstallTrap(signal
.SIGINT
);
1658 InstallTrap(signal
.SIGSEGV
);
1659 InstallTrap(signal
.SIGBUS
);
1660 InstallTrap(signal
.SIGILL
)
1661 END InstallTrapVectors
;
1663 PROCEDURE RemoveTrapVectors
;
1664 END RemoveTrapVectors
;
1670 pagesize
:= unistd
.sysconf(unistd
._SC_PAGESIZE
);
1673 allocated
:= 0; total
:= 0; used
:= 0;
1674 sentinelBlock
.size
:= MAX(INTEGER);
1675 sentinel
:= S
.ADR(sentinelBlock
);
1677 REPEAT DEC(i
); free
[i
] := sentinel
UNTIL i
= 0;
1685 InitModule(modList
);
1686 IF ~inDll
THEN Quit(1) END
1691 IF modList
= NIL THEN (* only once *)
1692 S
.GETREG(SP
, baseStack
);
1693 S
.GET(baseStack
+ 16, argc
);
1694 argv
:= S
.VAL(ArrStrPtr
, baseStack
+ 20);
1695 S
.GETREG(ML
, modList
); (* linker loads module list to BX *)
1696 static
:= init
IN modList
.opts
;
1697 inDll
:= dll
IN modList
.opts
;
1701 IF ~terminating
THEN
1702 terminating
:= TRUE
;