Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!uwm.edu!gem.mps.ohio-state.edu!rpi!crdgw1!crdos1!davidsen
From: davidsen@crdos1.crd.ge.COM (Wm E Davidsen Jr)
Newsgroups: comp.os.cpm
Subject: Re: Z80 algorithms
Message-ID: <1239@crdos1.crd.ge.COM>
Date: 18 Oct 89 21:36:29 GMT
References: <1335@gmdzi.UUCP>
Reply-To: davidsen@crdos1.UUCP (bill davidsen)
Organization: GE Corp R&D Center
Lines: 15

In article <1335@gmdzi.UUCP>, wittig@gmdzi.UUCP (Georg Wittig) writes:

|  This way you can fill up to 4096 (256*16) bytes. If more bytes are to be
|  filled, build a loop around it. If the number of the bytes to be filled isn't a
|  multiple of 16, the bytes 1 to 15 can be filled straight forward with a
|  traditional algorithm.

  No, you and the count with 17(8) and then jump into the loop so you
only do the excess modulo 16 the first time. If the excess is non-zero
you have to loop one more time, though.
-- 
bill davidsen	(davidsen@crdos1.crd.GE.COM -or- uunet!crdgw1!crdos1!davidsen)
"The world is filled with fools. They blindly follow their so-called
'reason' in the face of the church and common sense. Any fool can see
that the world is flat!" - anon