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
|
(* BitBlockOps.mod provides a Logitech compatible module.
Copyright (C) 2007-2023 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 BitBlockOps ;
FROM SYSTEM IMPORT BITSPERBYTE, SHIFT, BYTE, BITSET8, TSIZE ;
FROM Builtins IMPORT memmove, memset ;
TYPE
ptrToByte = POINTER TO BITSET8 ;
ptrToBitset = POINTER TO BITSET ;
(*
BlockAnd - performs a bitwise AND on blocks
[dest..dest+size-1] := [dest..dest+size-1] AND
[src..src+size-1]
*)
PROCEDURE BlockAnd (dest, src: ADDRESS; size: CARDINAL) ;
VAR
bitsetDest, bitsetSrc: ptrToBitset ;
byteDest, byteSrc : ptrToByte ;
BEGIN
bitsetDest := dest ;
bitsetSrc := src ;
WHILE size > TSIZE (BITSET) DO
bitsetDest^ := bitsetDest^ * bitsetSrc^ ;
INC (bitsetDest, TSIZE (BITSET)) ;
INC (bitsetSrc, TSIZE (BITSET)) ;
DEC (size, TSIZE (BITSET))
END ;
byteDest := VAL (ptrToByte, bitsetDest) ;
byteSrc := VAL (ptrToByte, bitsetSrc) ;
WHILE size > 0 DO
byteDest^ := byteDest^ * byteSrc^ ;
INC(byteDest) ;
INC(byteSrc) ;
DEC(size)
END
END BlockAnd ;
(*
BlockOr - performs a bitwise OR on blocks
[dest..dest+size-1] := [dest..dest+size-1] OR
[src..src+size-1]
*)
PROCEDURE BlockOr (dest, src: ADDRESS; size: CARDINAL) ;
VAR
bitsetDest, bitsetSrc: ptrToBitset ;
byteDest, byteSrc : ptrToByte ;
BEGIN
bitsetDest := dest ;
bitsetSrc := src ;
WHILE size > TSIZE (BITSET) DO
bitsetDest^ := bitsetDest^ + bitsetSrc^ ;
INC (bitsetDest, TSIZE (BITSET)) ;
INC (bitsetSrc, TSIZE (BITSET)) ;
DEC (size, TSIZE (BITSET))
END ;
byteDest := VAL (ptrToByte, bitsetDest) ;
byteSrc := VAL (ptrToByte, bitsetSrc) ;
WHILE size > 0 DO
byteDest^ := byteDest^ + byteSrc^ ;
INC (byteDest) ;
INC (byteSrc) ;
DEC (size)
END
END BlockOr ;
(*
BlockXor - performs a bitwise XOR on blocks
[dest..dest+size-1] := [dest..dest+size-1] XOR
[src..src+size-1]
*)
PROCEDURE BlockXor (dest, src: ADDRESS; size: CARDINAL) ;
VAR
bitsetDest, bitsetSrc: ptrToBitset ;
byteDest, byteSrc : ptrToByte ;
BEGIN
bitsetDest := dest ;
bitsetSrc := src ;
WHILE size>TSIZE(BITSET) DO
bitsetDest^ := bitsetDest^ - bitsetSrc^ ;
INC(bitsetDest, TSIZE(BITSET)) ;
INC(bitsetSrc, TSIZE(BITSET)) ;
DEC(size, TSIZE(BITSET))
END ;
byteDest := VAL(ptrToByte, bitsetDest) ;
byteSrc := VAL(ptrToByte, bitsetSrc) ;
WHILE size>0 DO
byteDest^ := byteDest^ - byteSrc^ ;
INC(byteDest) ;
INC(byteSrc) ;
DEC(size)
END
END BlockXor ;
(*
BlockNot - performs a bitsize NOT on the block as defined
by: [dest..dest+size-1]
*)
PROCEDURE BlockNot (dest: ADDRESS; size: CARDINAL) ;
VAR
bitsetDest: ptrToBitset ;
byteDest : ptrToByte ;
BEGIN
bitsetDest := dest ;
WHILE size>TSIZE(BITSET) DO
bitsetDest^ := -bitsetDest^ ;
INC(bitsetDest, TSIZE(BITSET)) ;
DEC(size, TSIZE(BITSET))
END ;
byteDest := VAL(ptrToByte, bitsetDest) ;
WHILE size>0 DO
byteDest^ := - byteDest^ ;
INC (byteDest) ;
DEC (size)
END
END BlockNot ;
(*
BlockShr - performs a block shift right of, count, bits.
Where the block is defined as:
[dest..dest+size-1].
The block is considered to be an ARRAY OF BYTEs
which is shifted, bit at a time over each byte in
turn. The left most byte is considered the byte
located at the lowest address.
If you require an endianness SHIFT use
the SYSTEM.SHIFT procedure and declare the
block as a POINTER TO set type.
*)
PROCEDURE BlockShr (dest: ADDRESS; size, count: CARDINAL) ;
VAR
p : ptrToByte ;
carry,
hi, lo : BITSET8 ;
byteOffset,
bitOffset : CARDINAL ;
BEGIN
byteOffset := count DIV BITSPERBYTE ;
IF byteOffset >= size
THEN
(* shifted all data out, nothing left *)
p := dest ;
dest := memset (p, 0, size)
ELSE
bitOffset := count MOD BITSPERBYTE ;
IF byteOffset > 0
THEN
(* move whole bytes using memmove *)
p := dest ;
dest := memmove (dest, dest+VAL(ADDRESS, byteOffset), size-byteOffset) ;
(* zero leading bytes *)
dest := memset (p, 0, byteOffset)
END ;
IF bitOffset > 0
THEN
(* some real shifting is necessary *)
p := dest + VAL (ADDRESS, byteOffset) ;
hi := BITSET8 {} ;
WHILE size>byteOffset DO
lo := SHIFT (p^, -bitOffset) ;
carry := SHIFT (p^, BITSPERBYTE - bitOffset) ;
p^ := lo + hi ;
INC (p) ;
hi := carry ;
DEC (size)
END
END
END
END BlockShr ;
(*
BlockShl - performs a block shift left of, count, bits.
Where the block is defined as:
[dest..dest+size-1].
The block is considered to be an ARRAY OF BYTEs
which is shifted, bit at a time over each byte in
turn. The left most byte is considered the byte
located at the lowest address.
If you require an endianness SHIFT use
the SYSTEM.SHIFT procedure and declare the
block as a POINTER TO set type.
*)
PROCEDURE BlockShl (dest: ADDRESS; size, count: CARDINAL) ;
VAR
p : ptrToByte ;
carry,
hi, lo : BITSET8 ;
byteOffset,
bitOffset : CARDINAL ;
BEGIN
byteOffset := count DIV BITSPERBYTE ;
IF byteOffset>=size
THEN
(* shifted all data out, nothing left *)
p := dest ;
dest := memset(p, 0, size)
ELSE
bitOffset := count MOD BITSPERBYTE ;
IF byteOffset>0
THEN
(* move whole bytes using memmove *)
p := dest ;
dest := memmove (dest, dest + VAL (ADDRESS, byteOffset), size - byteOffset) ;
(* zero leading bytes *)
dest := memset (p, 0, byteOffset)
END ;
IF bitOffset>0
THEN
(* some real shifting is necessary *)
p := dest + VAL (ADDRESS, byteOffset) ;
hi := BITSET8 {} ;
WHILE size > byteOffset DO
lo := SHIFT (p^, -bitOffset) ;
carry := SHIFT (p^, (BITSPERBYTE - bitOffset)) ;
p^ := lo + hi ;
INC (p) ;
hi := carry ;
DEC (size)
END
END
END
END BlockShl ;
(*
BlockRor - performs a block rotate right of, count, bits.
Where the block is defined as:
[dest..dest+size-1].
The block is considered to be an ARRAY OF BYTEs
which is shifted, bit at a time over each byte in
turn. The left most byte is considered the byte
located at the lowest address.
If you require an endianness ROTATE use
the SYSTEM.ROTATE procedure and declare the
block as a POINTER TO set type.
*)
PROCEDURE BlockRor (dest: ADDRESS; size, count: CARDINAL) ;
BEGIN
(* not yet implemented *)
HALT
END BlockRor ;
(*
BlockRol - performs a block rotate left of, count, bits.
Where the block is defined as:
[dest..dest+size-1].
The block is considered to be an ARRAY OF BYTEs
which is shifted, bit at a time over each byte in
turn. The left most byte is considered the byte
located at the lowest address.
If you require an endianness ROTATE use
the SYSTEM.ROTATE procedure and declare the
block as a POINTER TO set type.
*)
PROCEDURE BlockRol (dest: ADDRESS; size, count: CARDINAL) ;
BEGIN
(* not yet implemented *)
HALT
END BlockRol ;
END BitBlockOps.
|
