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
|
implement Fsmodule;
include "sys.m";
sys: Sys;
include "draw.m";
include "sh.m";
include "fslib.m";
fslib: Fslib;
Report, Value, type2s, quit: import fslib;
Fschan, Fsdata, Entrychan, Entry,
Gatechan, Gatequery, Nilentry, Option,
Next, Down, Skip, Quit: import Fslib;
types(): string
{
return "pppp*";
}
badmod(p: string)
{
sys->fprint(sys->fildes(2), "fs: size: cannot load %s: %r\n", p);
raise "fail:bad module";
}
init()
{
sys = load Sys Sys->PATH;
fslib = load Fslib Fslib->PATH;
if(fslib == nil)
badmod(Fslib->PATH);
}
run(nil: ref Draw->Context, nil: ref Report,
nil: list of Option, args: list of ref Value): ref Value
{
c := chan of Gatequery;
spawn andgate(c, args);
return ref Value.P(c);
}
andgate(c: Gatechan, args: list of ref Value)
{
sub: list of Gatechan;
for(; args != nil; args = tl args)
sub = (hd args).p().i :: sub;
sub = rev(sub);
myreply := chan of int;
while(((d, reply) := <-c).t0.t0 != nil){
for(l := sub; l != nil; l = tl l){
(hd l) <-= (d, myreply);
if(<-myreply == 0)
break;
}
reply <-= l == nil;
}
for(; sub != nil; sub = tl sub)
hd sub <-= (Nilentry, nil);
}
rev[T](x: list of T): list of T
{
l: list of T;
for(; x != nil; x = tl x)
l = hd x :: l;
return l;
}
|
