1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
|
(* RTint.mod provides users of the COROUTINES library with the.
Copyright (C) 2009-2025 Free Software Foundation, Inc.
Contributed by Gaius Mulley <gaius.mulley@southwales.ac.uk>.
This file is part of GNU Modula-2.
GNU Modula-2 is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3, or (at your option)
any later version.
GNU Modula-2 is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
Under Section 7 of GPL version 3, you are granted additional
permissions described in the GCC Runtime Library Exception, version
3.1, as published by the Free Software Foundation.
You should have received a copy of the GNU General Public License and
a copy of the GCC Runtime Library Exception along with this program;
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
<http://www.gnu.org/licenses/>. *)
IMPLEMENTATION MODULE RTint ;
FROM M2RTS IMPORT Halt ;
FROM Storage IMPORT ALLOCATE, DEALLOCATE ;
FROM RTco IMPORT select, initSemaphore, wait, signal ;
FROM COROUTINES IMPORT PROTECTION ;
FROM libc IMPORT printf, perror ;
FROM Assertion IMPORT Assert ;
FROM Selective IMPORT InitSet, FdSet, Timeval, InitTime, KillTime, KillSet,
SetOfFd, FdIsSet, GetTime, FdZero, GetTimeOfDay, SetTime,
FdClr;
CONST
Microseconds = 1000000 ;
DebugTime = 0 ;
Debugging = FALSE ;
TYPE
VectorType = (input, output, time) ;
Vector = POINTER TO RECORD
type : VectorType ;
priority: CARDINAL ;
arg : ADDRESS ;
pending,
exists : Vector ;
no : CARDINAL ;
File : INTEGER ;
rel,
abs : Timeval ;
queued : BOOLEAN ;
END ;
VAR
VecNo : CARDINAL ;
Exists : Vector ;
Pending : ARRAY [MIN(PROTECTION)..MAX(PROTECTION)] OF Vector ;
lock : INTEGER ;
initialized: BOOLEAN ;
(*
Max - returns the maximum: i or j.
*)
PROCEDURE Max (i, j: INTEGER) : INTEGER ;
BEGIN
IF i>j
THEN
RETURN i
ELSE
RETURN j
END
END Max ;
(*
Max - returns the minimum: i or j.
*)
PROCEDURE Min (i, j: INTEGER) : INTEGER ;
BEGIN
IF i<j
THEN
RETURN i
ELSE
RETURN j
END
END Min ;
(*
FindVector - searches the exists list for a vector of type
which is associated with file descriptor, fd.
*)
PROCEDURE FindVector (fd: INTEGER; type: VectorType) : Vector ;
VAR
vec: Vector ;
BEGIN
vec := Exists ;
WHILE vec#NIL DO
IF (vec^.type=type) AND (vec^.File=fd)
THEN
RETURN vec
END ;
vec := vec^.exists
END ;
RETURN NIL
END FindVector ;
(*
InitInputVector - returns an interrupt vector which is associated
with the file descriptor, fd.
*)
PROCEDURE InitInputVector (fd: INTEGER; pri: CARDINAL) : CARDINAL ;
VAR
vptr: Vector ;
BEGIN
IF Debugging
THEN
printf("InitInputVector fd = %d priority = %d\n", fd, pri)
END ;
wait (lock) ;
vptr := FindVector(fd, input) ;
IF vptr = NIL
THEN
NEW (vptr) ;
INC (VecNo) ;
WITH vptr^ DO
type := input ;
priority := pri ;
arg := NIL ;
pending := NIL ;
exists := Exists ;
no := VecNo ;
File := fd
END ;
Exists := vptr ;
signal (lock) ;
RETURN VecNo
ELSE
signal (lock) ;
RETURN vptr^.no
END
END InitInputVector ;
(*
InitOutputVector - returns an interrupt vector which is associated
with the file descriptor, fd.
*)
PROCEDURE InitOutputVector (fd: INTEGER; pri: CARDINAL) : CARDINAL ;
VAR
vptr: Vector ;
BEGIN
wait (lock) ;
vptr := FindVector (fd, output) ;
IF vptr = NIL
THEN
NEW (vptr) ;
IF vptr = NIL
THEN
HALT
ELSE
INC (VecNo) ;
WITH vptr^ DO
type := output ;
priority := pri ;
arg := NIL ;
pending := NIL ;
exists := Exists ;
no := VecNo ;
File := fd
END ;
Exists := vptr ;
signal (lock) ;
RETURN VecNo
END
ELSE
signal (lock) ;
RETURN vptr^.no
END
END InitOutputVector ;
(*
InitTimeVector - returns an interrupt vector associated with
the relative time.
*)
PROCEDURE InitTimeVector (micro, secs: CARDINAL; pri: CARDINAL) : CARDINAL ;
VAR
vptr: Vector ;
BEGIN
wait (lock) ;
NEW (vptr) ;
IF vptr = NIL
THEN
HALT
ELSE
INC (VecNo) ;
Assert (micro<Microseconds) ;
WITH vptr^ DO
type := time ;
priority := pri ;
arg := NIL ;
pending := NIL ;
exists := Exists ;
no := VecNo ;
rel := InitTime (secs+DebugTime, micro) ;
abs := InitTime (0, 0) ;
queued := FALSE
END ;
Exists := vptr
END ;
signal (lock) ;
RETURN VecNo
END InitTimeVector ;
(*
FindVectorNo - searches the Exists list for vector vec.
*)
PROCEDURE FindVectorNo (vec: CARDINAL) : Vector ;
VAR
vptr: Vector ;
BEGIN
vptr := Exists ;
WHILE (vptr#NIL) AND (vptr^.no#vec) DO
vptr := vptr^.exists
END ;
RETURN vptr
END FindVectorNo ;
(*
FindPendingVector - searches the pending list for vector, vec.
*)
PROCEDURE FindPendingVector (vec: CARDINAL) : Vector ;
VAR
pri : CARDINAL ;
vptr: Vector ;
BEGIN
FOR pri := MIN(PROTECTION) TO MAX(PROTECTION) DO
vptr := Pending[pri] ;
WHILE (vptr#NIL) AND (vptr^.no#vec) DO
vptr := vptr^.pending
END ;
IF (vptr#NIL) AND (vptr^.no=vec)
THEN
RETURN vptr
END
END ;
RETURN NIL
END FindPendingVector ;
(*
ReArmTimeVector - reprimes the vector, vec, to deliver an interrupt
at the new relative time.
*)
PROCEDURE ReArmTimeVector (vec: CARDINAL;
micro, secs: CARDINAL) ;
VAR
vptr: Vector ;
BEGIN
Assert (micro<Microseconds) ;
wait (lock) ;
vptr := FindVectorNo (vec) ;
IF vptr = NIL
THEN
Halt ('cannot find vector supplied',
__FILE__, __FUNCTION__, __LINE__)
ELSE
WITH vptr^ DO
SetTime (rel, secs + DebugTime, micro)
END
END ;
signal (lock)
END ReArmTimeVector ;
(*
GetTimeVector - assigns, micro, and, secs, with the remaining
time before this interrupt will expire.
This value is only updated when a Listen
occurs.
*)
PROCEDURE GetTimeVector (vec: CARDINAL; VAR micro, secs: CARDINAL) ;
VAR
vptr: Vector ;
BEGIN
wait (lock) ;
vptr := FindVectorNo (vec) ;
IF vptr=NIL
THEN
Halt ('cannot find vector supplied',
__FILE__, __FUNCTION__, __LINE__)
ELSE
WITH vptr^ DO
GetTime (rel, secs, micro) ;
Assert (micro < Microseconds)
END
END ;
signal (lock)
END GetTimeVector ;
(*
AttachVector - adds the pointer ptr to be associated with the interrupt
vector. It returns the previous value attached to this
vector.
*)
PROCEDURE AttachVector (vec: CARDINAL; ptr: ADDRESS) : ADDRESS ;
VAR
vptr : Vector ;
prevArg: ADDRESS ;
BEGIN
wait (lock) ;
vptr := FindVectorNo (vec) ;
IF vptr = NIL
THEN
Halt ( 'cannot find vector supplied',
__FILE__, __FUNCTION__, __LINE__)
ELSE
prevArg := vptr^.arg ;
vptr^.arg := ptr ;
IF Debugging
THEN
printf ("AttachVector %d with %p\n", vec, ptr);
DumpPendingQueue ;
END ;
signal (lock) ;
RETURN prevArg
END
END AttachVector ;
(*
IncludeVector - includes, vec, into the dispatcher list of
possible interrupt causes.
*)
PROCEDURE IncludeVector (vec: CARDINAL) ;
VAR
vptr : Vector ;
micro, sec: CARDINAL ;
result : INTEGER ;
BEGIN
wait (lock) ;
vptr := FindPendingVector (vec) ;
IF vptr = NIL
THEN
vptr := FindVectorNo (vec) ;
IF vptr = NIL
THEN
Halt ('cannot find vector supplied',
__FILE__, __FUNCTION__, __LINE__)
ELSE
(* printf('including vector %d (fd = %d)\n', vec, v^.File) ; *)
vptr^.pending := Pending[vptr^.priority] ;
Pending[vptr^.priority] := vptr ;
IF (vptr^.type = time) AND (NOT vptr^.queued)
THEN
vptr^.queued := TRUE ;
result := GetTimeOfDay (vptr^.abs) ;
Assert (result=0) ;
GetTime (vptr^.abs, sec, micro) ;
Assert (micro<Microseconds) ;
AddTime (vptr^.abs, vptr^.rel) ;
GetTime (vptr^.abs, sec, micro) ;
Assert (micro<Microseconds)
END
END
ELSE
IF Debugging
THEN
printf ('odd vector (%d) type (%d) arg (%p) is already attached to the pending queue\n',
vec, vptr^.type, vptr^.arg)
END
END ;
signal (lock)
END IncludeVector ;
(*
ExcludeVector - excludes, vec, from the dispatcher list of
possible interrupt causes.
*)
PROCEDURE ExcludeVector (vec: CARDINAL) ;
VAR
vptr, uptr: Vector ;
BEGIN
wait (lock) ;
vptr := FindPendingVector (vec) ;
IF vptr = NIL
THEN
Halt ('cannot find pending vector supplied',
__FILE__, __FUNCTION__, __LINE__)
ELSE
(* printf('excluding vector %d\n', vec) ; *)
IF Pending[vptr^.priority] = vptr
THEN
Pending[vptr^.priority] := Pending[vptr^.priority]^.pending
ELSE
uptr := Pending[vptr^.priority] ;
WHILE uptr^.pending#vptr DO
uptr := uptr^.pending
END ;
uptr^.pending := vptr^.pending
END ;
IF vptr^.type=time
THEN
vptr^.queued := FALSE
END
END ;
signal (lock)
END ExcludeVector ;
(*
AddFd - adds the file descriptor fd to set updating max.
*)
PROCEDURE AddFd (VAR set: SetOfFd; VAR max: INTEGER; fd: INTEGER) ;
BEGIN
IF (fd<0)
THEN
RETURN
END ;
max := Max (fd, max) ;
IF set = NIL
THEN
set := InitSet () ;
FdZero (set)
END ;
FdSet (fd, set)
(* printf('%d, ', fd) *)
END AddFd ;
(*
DumpPendingQueue - displays the pending queue.
*)
PROCEDURE DumpPendingQueue ;
VAR
pri : PROTECTION ;
vptr : Vector ;
sec,
micro: CARDINAL ;
BEGIN
printf ("Pending queue\n");
FOR pri := MIN (PROTECTION) TO MAX (PROTECTION) DO
printf ("[%d] ", pri);
vptr := Pending[pri] ;
WHILE vptr # NIL DO
IF (vptr^.type=input) OR (vptr^.type=output)
THEN
printf ("(fd=%d) (vec=%d)", vptr^.File, vptr^.no)
ELSIF vptr^.type=time
THEN
GetTime (vptr^.rel, sec, micro) ;
Assert (micro < Microseconds) ;
printf ("time (%u.%06u secs) (arg = %p)\n",
sec, micro, vptr^.arg)
END ;
vptr := vptr^.pending
END ;
printf (" \n")
END
END DumpPendingQueue ;
(*
AddTime - t1 := t1 + t2
*)
PROCEDURE AddTime (t1, t2: Timeval) ;
VAR
a, b, s, m: CARDINAL ;
BEGIN
GetTime (t1, s, m) ;
Assert (m < Microseconds) ;
GetTime (t2, a, b) ;
Assert (b < Microseconds) ;
INC (a, s) ;
INC (b, m) ;
IF b >= Microseconds
THEN
DEC (b, Microseconds) ;
INC (a)
END ;
SetTime (t1, a, b)
END AddTime ;
(*
IsGreaterEqual - returns TRUE if, a>=b
*)
PROCEDURE IsGreaterEqual (a, b: Timeval) : BOOLEAN ;
VAR
as, am, bs, bm: CARDINAL ;
BEGIN
GetTime (a, as, am) ;
Assert (am < Microseconds) ;
GetTime (b, bs, bm) ;
Assert (bm < Microseconds) ;
RETURN (as > bs) OR ((as = bs) AND (am >= bm))
END IsGreaterEqual ;
(*
SubTime - assigns, s and m, to a - b.
*)
PROCEDURE SubTime (VAR s, m: CARDINAL; a, b: Timeval) ;
VAR
as, am,
bs, bm: CARDINAL ;
BEGIN
GetTime (a, as, am) ;
Assert (am < Microseconds) ;
GetTime (b, bs, bm) ;
Assert (bm < Microseconds) ;
IF IsGreaterEqual (a, b)
THEN
s := as - bs ;
IF am >= bm
THEN
m := am - bm ;
Assert (m < Microseconds) ;
ELSE
Assert (s > 0) ;
DEC (s) ;
m := (Microseconds + am) - bm ;
Assert (m < Microseconds)
END
ELSE
s := 0 ;
m := 0
END
END SubTime ;
(*
activatePending - activates the first interrupt pending and clears it.
*)
PROCEDURE activatePending (untilInterrupt: BOOLEAN; call: DispatchVector; pri: CARDINAL;
maxFd: INTEGER; VAR inSet, outSet: SetOfFd; VAR timeval: Timeval; b4, after: Timeval) : BOOLEAN ;
VAR
result: INTEGER ;
p : CARDINAL ;
vec : Vector ;
b4s,
b4m,
afs,
afm,
sec,
micro : CARDINAL ;
BEGIN
wait (lock) ;
p := MAX (PROTECTION) ;
WHILE p > pri DO
vec := Pending[p] ;
WHILE vec # NIL DO
WITH vec^ DO
CASE type OF
input : IF (File < maxFd) AND (inSet # NIL) AND FdIsSet (File, inSet)
THEN
IF Debugging
THEN
printf ('read (fd=%d) is ready (vec=%d)\n', File, no) ;
DumpPendingQueue
END ;
FdClr (File, inSet) ; (* so we dont activate this again from our select. *)
signal (lock) ;
call (no, priority, arg) ;
RETURN TRUE
END |
output: IF (File < maxFd) AND (outSet#NIL) AND FdIsSet (File, outSet)
THEN
IF Debugging
THEN
printf ('write (fd=%d) is ready (vec=%d)\n', File, no) ;
DumpPendingQueue
END ;
FdClr (File, outSet) ; (* so we dont activate this again from our select. *)
signal (lock) ;
call (no, priority, arg) ;
RETURN TRUE
END |
time : IF untilInterrupt AND (timeval # NIL)
THEN
result := GetTimeOfDay (after) ;
Assert (result=0) ;
IF Debugging
THEN
GetTime (timeval, sec, micro) ;
Assert (micro < Microseconds) ;
GetTime (after, afs, afm) ;
Assert (afm < Microseconds) ;
GetTime (b4, b4s, b4m) ;
Assert (b4m < Microseconds) ;
printf ("waited %u.%06u + %u.%06u now is %u.%06u\n",
sec, micro, b4s, b4m, afs, afm) ;
END ;
IF IsGreaterEqual (after, abs)
THEN
IF Debugging
THEN
DumpPendingQueue ;
printf ("time has expired calling dispatcher\n")
END ;
timeval := KillTime (timeval) ; (* so we dont activate this again from our select. *)
signal (lock) ;
IF Debugging
THEN
printf ("call (%d, %d, 0x%x)\n", no, priority, arg)
END ;
call (no, priority, arg) ;
RETURN TRUE
ELSIF Debugging
THEN
printf ("must wait longer as time has not expired\n")
END
END
END
END ;
vec := vec^.pending
END ;
DEC (p)
END ;
signal (lock) ;
RETURN FALSE
END activatePending ;
(*
Listen - will either block indefinitely (until an interrupt)
or alteratively will test to see whether any interrupts
are pending.
If a pending interrupt was found then, call, is called
and then this procedure returns.
It only listens for interrupts > pri.
*)
PROCEDURE Listen (untilInterrupt: BOOLEAN;
call: DispatchVector;
pri: CARDINAL) ;
VAR
found : BOOLEAN ;
result : INTEGER ;
zero,
after,
b4,
timeval: Timeval ;
vec : Vector ;
inSet,
outSet : SetOfFd ;
sec,
micro : CARDINAL ;
maxFd : INTEGER ;
p : CARDINAL ;
BEGIN
wait (lock) ;
IF pri < MAX (PROTECTION)
THEN
IF Debugging
THEN
DumpPendingQueue
END ;
maxFd := -1 ;
timeval := NIL ;
inSet := NIL ;
outSet := NIL ;
timeval := InitTime (MAX (INTEGER), 0) ;
p := MAX (PROTECTION) ;
found := FALSE ;
WHILE p>pri DO
vec := Pending[p] ;
WHILE vec#NIL DO
WITH vec^ DO
CASE type OF
input : AddFd (inSet, maxFd, File) |
output: AddFd (outSet, maxFd, File) |
time : IF IsGreaterEqual (timeval, abs)
THEN
GetTime (abs, sec, micro) ;
Assert (micro < Microseconds) ;
IF Debugging
THEN
printf ("shortest delay is %u.%06u\n", sec, micro)
END ;
SetTime (timeval, sec, micro) ;
found := TRUE
END
END
END ;
vec := vec^.pending
END ;
DEC (p)
END ;
IF NOT untilInterrupt
THEN
SetTime (timeval, 0, 0)
END ;
IF untilInterrupt AND (((inSet=NIL) AND (outSet=NIL)) OR (maxFd=-1)) AND (NOT found)
THEN
Halt ('deadlock found, no more processes to run and no interrupts active',
__FILE__, __FUNCTION__, __LINE__)
END ;
(* printf('timeval = 0x%x\n', timeval) ; *)
(* printf('}\n') ; *)
IF (NOT found) AND (maxFd=-1)
THEN
(* no file descriptors to be selected upon. *)
timeval := KillTime (timeval) ;
signal (lock) ;
RETURN
ELSE
GetTime (timeval, sec, micro) ;
Assert (micro < Microseconds) ;
zero := InitTime (0, 0) ;
b4 := InitTime (0, 0) ;
after := InitTime (0, 0) ;
result := GetTimeOfDay (b4) ;
Assert (result=0) ;
SubTime (sec, micro, timeval, b4) ;
SetTime (timeval, sec, micro) ;
IF Debugging
THEN
printf ("select waiting for %u.%06u seconds\n", sec, micro)
END ;
signal (lock) ;
REPEAT
IF Debugging
THEN
printf ("select (.., .., .., %u.%06u)\n", sec, micro)
END ;
IF maxFd<0
THEN
result := select (0, NIL, NIL, NIL, timeval)
ELSE
result := select (maxFd+1, inSet, outSet, NIL, timeval)
END ;
IF result=-1
THEN
IF Debugging
THEN
perror ("select failed : ") ;
END ;
result := select (maxFd+1, inSet, outSet, NIL, zero) ;
IF result#-1
THEN
GetTime (timeval, sec, micro) ;
IF Debugging
THEN
printf ("(nfds : %d timeval: %u.%06u) : \n", maxFd, sec, micro) ;
END ;
perror ("select timeout argument was faulty : ")
ELSE
result := select (maxFd+1, inSet, NIL, NIL, timeval) ;
IF result#-1
THEN
perror ("select output fd argument was faulty : ")
ELSE
result := select (maxFd+1, NIL, outSet, NIL, timeval) ;
IF result#-1
THEN
perror ("select input fd argument was faulty : ")
ELSE
IF maxFd=-1
THEN
result := select (0, NIL, NIL, NIL, timeval) ;
IF result=-1
THEN
IF Debugging
THEN
perror ("select does not accept nfds == 0 ") ;
END ;
result := 0
END
ELSE
perror ("select maxFD+1 argument was faulty : ") ;
END
END
END
END
END
UNTIL result#-1
END ;
WHILE activatePending (untilInterrupt, call, pri,
maxFd+1, inSet, outSet, timeval, b4, after) DO
END ;
IF timeval#NIL
THEN
timeval := KillTime (timeval)
END ;
IF zero#NIL
THEN
zero := KillTime (zero)
END ;
IF after#NIL
THEN
after := KillTime (after)
END ;
IF b4#NIL
THEN
b4 := KillTime (b4)
END ;
IF inSet#NIL
THEN
inSet := KillSet (inSet)
END ;
IF outSet#NIL
THEN
outSet := KillSet (outSet)
END
END ;
signal (lock)
END Listen ;
(*
init -
*)
PROCEDURE init ;
VAR
p: PROTECTION ;
BEGIN
lock := initSemaphore (1) ;
wait (lock) ;
Exists := NIL ;
FOR p := MIN(PROTECTION) TO MAX(PROTECTION) DO
Pending[p] := NIL
END ;
initialized := TRUE ;
signal (lock)
END init ;
(*
Init -
*)
PROCEDURE Init ;
BEGIN
IF NOT initialized
THEN
init
END
END Init ;
BEGIN
Init
END RTint.
|