114 lines
3.3 KiB
Plaintext
114 lines
3.3 KiB
Plaintext
|
(*************************************************************)
|
|||
|
|
(* *)
|
|||
|
|
(* MODULA-2 / 86 (Library Module) *)
|
|||
|
|
(* *)
|
|||
|
|
(* *)
|
|||
|
|
(* Module: Processes *)
|
|||
|
|
(* Library module providing the facilities for *)
|
|||
|
|
(* multitasking at a high level of abstraction. *)
|
|||
|
|
(* This module corresponds to the standard as *)
|
|||
|
|
(* proposed in 'Programming in Modula-2' by Niklaus *)
|
|||
|
|
(* Wirth, Springer Verlag 1982. *)
|
|||
|
|
(* *)
|
|||
|
|
(* Version: *)
|
|||
|
|
(* 0.1 ; July 83 *)
|
|||
|
|
(* *)
|
|||
|
|
(* Copyright: *)
|
|||
|
|
(* LOGITECH SA. *)
|
|||
|
|
(* CH-1143 Apples (Switzerland) *)
|
|||
|
|
(* *)
|
|||
|
|
(*************************************************************)
|
|||
|
|
|
|||
|
|
IMPLEMENTATION MODULE Processes [1];
|
|||
|
|
FROM SYSTEM IMPORT ADDRESS, PROCESS, NEWPROCESS, TRANSFER, TSIZE;
|
|||
|
|
FROM Storage IMPORT ALLOCATE;
|
|||
|
|
|
|||
|
|
TYPE
|
|||
|
|
SIGNAL = POINTER TO ProcessDescriptor;
|
|||
|
|
|
|||
|
|
ProcessDescriptor = RECORD
|
|||
|
|
next : SIGNAL; (* ring *)
|
|||
|
|
queue: SIGNAL; (* queue of waiting processes *)
|
|||
|
|
cor : PROCESS;
|
|||
|
|
ready: BOOLEAN;
|
|||
|
|
END;
|
|||
|
|
|
|||
|
|
VAR
|
|||
|
|
cp: SIGNAL; (* current process *)
|
|||
|
|
|
|||
|
|
|
|||
|
|
PROCEDURE StartProcess (P: PROC; n: CARDINAL);
|
|||
|
|
VAR s0: SIGNAL; wsp: ADDRESS;
|
|||
|
|
BEGIN
|
|||
|
|
s0 := cp;
|
|||
|
|
ALLOCATE (wsp, n);
|
|||
|
|
ALLOCATE (cp, TSIZE(ProcessDescriptor));
|
|||
|
|
WITH cp^ DO
|
|||
|
|
next := s0^.next;
|
|||
|
|
s0^.next := cp;
|
|||
|
|
ready := TRUE;
|
|||
|
|
queue := NIL;
|
|||
|
|
END;
|
|||
|
|
NEWPROCESS (P, wsp, n DIV 16, cp^.cor);
|
|||
|
|
TRANSFER (s0^.cor, cp^.cor);
|
|||
|
|
END StartProcess;
|
|||
|
|
|
|||
|
|
|
|||
|
|
PROCEDURE SEND (VAR s: SIGNAL);
|
|||
|
|
VAR s0: SIGNAL;
|
|||
|
|
BEGIN
|
|||
|
|
IF s <> NIL THEN
|
|||
|
|
s0 := cp;
|
|||
|
|
cp := s;
|
|||
|
|
WITH cp^ DO
|
|||
|
|
s := queue;
|
|||
|
|
ready := TRUE;
|
|||
|
|
queue := NIL;
|
|||
|
|
END;
|
|||
|
|
TRANSFER (s0^.cor, cp^.cor);
|
|||
|
|
END;
|
|||
|
|
END SEND;
|
|||
|
|
|
|||
|
|
|
|||
|
|
PROCEDURE WAIT (VAR s: SIGNAL);
|
|||
|
|
VAR s0, s1: SIGNAL;
|
|||
|
|
BEGIN (* insert cp in queue s *)
|
|||
|
|
IF s = NIL THEN s:= cp;
|
|||
|
|
ELSE
|
|||
|
|
s0 := s;
|
|||
|
|
s1 := s0^.queue;
|
|||
|
|
WHILE s1 <> NIL DO
|
|||
|
|
s0 := s1;
|
|||
|
|
s1 := s0^.queue;
|
|||
|
|
END;
|
|||
|
|
s0^.queue := cp;
|
|||
|
|
END;
|
|||
|
|
s0 := cp;
|
|||
|
|
REPEAT cp := cp^.next UNTIL cp^.ready;
|
|||
|
|
IF cp = s0 THEN (* deadlock *) HALT END;
|
|||
|
|
s0^.ready := FALSE;
|
|||
|
|
TRANSFER (s0^.cor, cp^.cor);
|
|||
|
|
END WAIT;
|
|||
|
|
|
|||
|
|
|
|||
|
|
PROCEDURE Awaited (s: SIGNAL): BOOLEAN;
|
|||
|
|
BEGIN
|
|||
|
|
RETURN (s<>NIL);
|
|||
|
|
END Awaited;
|
|||
|
|
|
|||
|
|
|
|||
|
|
PROCEDURE Init (VAR s: SIGNAL);
|
|||
|
|
BEGIN
|
|||
|
|
s := NIL;
|
|||
|
|
END Init;
|
|||
|
|
|
|||
|
|
|
|||
|
|
BEGIN
|
|||
|
|
ALLOCATE (cp, TSIZE(ProcessDescriptor));
|
|||
|
|
WITH cp^ DO
|
|||
|
|
next := cp;
|
|||
|
|
ready := TRUE;
|
|||
|
|
queue := NIL;
|
|||
|
|
END;
|
|||
|
|
END Processes.
|
|||
|
|
|