🚀 go-pugleaf

In article <8708271750.AA03034@cayuga.cs.rochester.edu> ken@CS.ROCHESTER.EDU (Ken Yap) writes:

>A good question though is: what do people use bit shifting for in
>C and how would one write the equivalent in M-2? I know I use bit
>shifting to (1) make bitmasks, which M-2 can do with BITSETs and
>(2) (not so much now) multiply and divide, which shouldn't be
>a BITSET operation anyhow. So what can BITSETs not do?

The main use that I've found for bit twiddling, shifting, etc. is a
devilish contraption known as a device regester.  This refers especially
to UARTs, DMA chips, etc, although CPU status regesters have the same
problems.  For their own good (:-) reasons, hardware designers tend to
put the fields you're interested in someplace other than the beginning
of a word.  For single bit values, this is no problem - bitsets are just
great.  However, for multibit numeric values, this gets grubby.  In
assembly language, you just mask off the part you're interested in and
shift it over into the least significant position, where your compare
instructions can handle it sensibly.  In Pascal, you declare your
register as a PACKED RECORD of however you want things handled.  This
should compile into a mask-and-shift just like the assembly version.
(I'm an optomist :-)

I really don't see a clean way of doing a mask, shift, and compare in
M2.  The mask is done easily enough with a bitset, but then how do you
do a sensible compare?  How do you tell that (say) {10, 12} > {10, 11}
without doing a type transfer onto a CARDINAL?  Note that a program full
of type transfers is prime ammunition for the anti-strong typing crowd.
-- 
                           __
 -- Steve          /      /  \      /         "Truth is stranger than
S. G. Smith      I \ O    |  _    O \ I        fiction because fiction
smith@cos.com      /      \__/      /          has to make sense."