-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathm2sets.mod
294 lines (252 loc) · 6.45 KB
/
m2sets.mod
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
(*$Segment 'M2Sets'*)
(*$RangeCheck+*)
(*$OverflowCheck+*)
IMPLEMENTATION MODULE M2Sets;
(*
This module provides a number of routines to allow the Modula-2 compiler to
implement bit sets with 17 or more elements.
The compiler hooks into this module whenever it needs to carry out an
operation on a set that is longer than 4 bytes. Sets of 4 bytes or less can
be manipulated using the normal operations available through the registers.
Set Constant operations are handled by procedures beginning with SC. Those
procedures simply manipulate a fake set that is actually an array of up to
16 BITSETS with special consideration to sets that are actually an odd number
of bytes in length.
Set operations on variables are handled by procedures beginning with SV.
Those procedures generate inline code where possible that will manipulate
bitsets in memory.
In theory, when modifying the compiler for another machine, it should be
possible to simply re-write the SV procedures to re-implement the large
sets.
*)
FROM InOut IMPORT Write, WriteCard, WriteHex, WriteString, WriteLn;
FROM M2Lib IMPORT HighWORD, LoWORD;
FROM SYSTEM IMPORT ADR, BYTE;
(* ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** *)
(* Data Structures for Fake Sets *)
(* ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** *)
(* ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** *)
(* Set Constant Operations *)
(* ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** *)
PROCEDURE SCDisplaySet(VAR x: aFakeSet; name: CHAR); FORWARD;
PROCEDURE SCClearSet(VAR x: aFakeSet);
(*
OPERATION:
Clears the set to an empty set;
*)
VAR
setNo: CARDINAL;
BEGIN
WITH x DO
FOR setNo := 0 TO HIGH(set) DO
set[setNo] := {};
END;
END;
END SCClearSet;
PROCEDURE SCComplementSet(VAR x: aFakeSet);
(*
OPERATION:
Reverses the state of each bit of the set.
*)
VAR
setNo: CARDINAL;
BEGIN
WITH x DO
setNo := 0;
REPEAT
set[setNo] := VAL(BITSET, (0FFFFH - VAL(CARDINAL, set[setNo])));
INC(setNo);
UNTIL setNo > ((setSize - 1) DIV 2);
END;
END SCComplementSet;
PROCEDURE SCDisplaySet(VAR x: aFakeSet; name: CHAR);
(*
OPERATION:
For debugging purposes, use this procedure to display the contents of a
set.
*)
VAR
setNo: CARDINAL;
Done: BOOLEAN;
BEGIN
WITH x DO
WriteString('ADR(');
Write(name);
WriteString(')=');
WriteHex(HighWORD(VAL(LONGINT, ADR(x))), 2);
WriteHex(LoWORD(VAL(LONGINT, ADR(x))), 4);
WriteString(', Length = ');
WriteCard(setSize, 3);
WriteString(' bytes.');
WriteLn;
Done := FALSE;
setNo := ((setSize - 1) DIV 2);
WriteString('Set value = <');
IF ODD(setSize) THEN
WriteHex(VAL(CARDINAL, set[setNo]), 2);
IF setNo = 0 THEN
Done := TRUE;
ELSE
DEC(setNo);
END;
END;
WHILE NOT Done DO
WriteHex(VAL(CARDINAL, set[setNo]), 4);
IF setNo = 0 THEN
Done := TRUE;
ELSE
DEC(setNo);
END;
END;
WriteString('>');
WriteLn;
END;
END SCDisplaySet;
PROCEDURE SCEqual(x, y: aFakeSet): BOOLEAN;
(*
OPERATION:
Returns TRUE if the set defined by "x" is the same as that of "y".
*)
VAR
setNo: CARDINAL;
equal: BOOLEAN;
BEGIN
WITH x DO
equal := TRUE;
setNo := 0;
WHILE equal AND (setNo <= ((setSize - 1) DIV 2)) DO
equal := set[setNo] = y.set[setNo];
INC(setNo);
END;
END;
RETURN equal;
END SCEqual;
PROCEDURE SCIn(bit: CARDINAL; x: aFakeSet): BOOLEAN;
(*
OPERATION:
Returns TRUE if the bit specified by "bit" is set in the fakeset "x".
*)
BEGIN
WITH x DO
IF bit < (setSize * 8) THEN
RETURN (bit MOD 16) IN set[bit DIV 16];
END;
END;
END SCIn;
PROCEDURE SCLessEqual(x, y: aFakeSet): BOOLEAN;
(*
OPERATION:
Returns TRUE if the set defined by "x" is less than or equal to that of "y".
*)
VAR
setNo: CARDINAL;
lessAndEqual: BOOLEAN;
BEGIN
WITH x DO
lessAndEqual := TRUE;
setNo := 0;
WHILE lessAndEqual AND (setNo <= ((setSize - 1) DIV 2)) DO
lessAndEqual := set[setNo] <= y.set[setNo];
INC(setNo);
END;
END;
RETURN lessAndEqual;
END SCLessEqual;
PROCEDURE SCMinus(VAR x: aFakeSet; y: aFakeSet);
(*
OPERATION:
This procedure carries out the standard M2 set operation for the "-"
symbol, which is x = AND(x, COM(y)) .
*)
VAR
setNo: CARDINAL;
BEGIN
WITH x DO
setNo := 0;
REPEAT
set[setNo] := set[setNo] - y.set[setNo];
INC(setNo);
UNTIL setNo > ((setSize - 1) DIV 2);
END;
END SCMinus;
PROCEDURE SCPlus(VAR x: aFakeSet; y: aFakeSet);
(*
OPERATION:
This procedure carries out the standard M2 set operation for the "+"
symbol, which is OR.
It ORs the two sets represented by 'x' and 'y', placing the result in 'x'.
*)
VAR
setNo: CARDINAL;
BEGIN
WITH x DO
setNo := 0;
REPEAT
set[setNo] := set[setNo] + y.set[setNo];
INC(setNo);
UNTIL setNo > ((setSize - 1) DIV 2);
END;
END SCPlus;
PROCEDURE SCSetBit(VAR x: aFakeSet; bit: CARDINAL);
(*
OPERATION:
Sets the specified bit in the set.
*)
BEGIN
WITH x DO
IF bit < (setSize * 8) THEN
INCL(set[bit DIV 16], bit MOD 16);
END;
END;
END SCSetBit;
PROCEDURE SCSetBitRange(VAR x: aFakeSet; lo, hi: CARDINAL);
(*
OPERATION:
Sets the specified range of bits in the set.
*)
VAR
bit: CARDINAL;
BEGIN
WITH x DO
FOR bit := lo TO hi DO
SCSetBit(x, bit);
END;
END;
END SCSetBitRange;
PROCEDURE SCSlash(VAR x: aFakeSet; y: aFakeSet);
(*
OPERATION:
This procedure carries out the standard M2 set operation for the "/"
symbol, which is EOR.
It EORs the two sets represented by 'x' and 'y', placing the result in 'x'.
*)
VAR
setNo: CARDINAL;
BEGIN
WITH x DO
setNo := 0;
REPEAT
set[setNo] := set[setNo] / y.set[setNo];
INC(setNo);
UNTIL setNo > ((setSize - 1) DIV 2);
END;
END SCSlash;
PROCEDURE SCTimes(VAR x: aFakeSet; y: aFakeSet);
(*
OPERATION:
This procedure carries out the standard M2 set operation for the "*"
symbol, which is AND.
It ANDs the two sets represented by 'x' and 'y', placing the result in 'x'.
*)
VAR
setNo: CARDINAL;
BEGIN
WITH x DO
setNo := 0;
REPEAT
set[setNo] := set[setNo] * y.set[setNo];
INC(setNo);
UNTIL setNo > ((setSize - 1) DIV 2);
END;
END SCTimes;
END M2Sets.