🚀 go-pugleaf

In article <18336@cornell.UUCP> blandy@marduk (Jim Blandy) writes:
>
>Uh, I may be wrong, but are the bitmaps GUARANTEED to be stored
>one after the other in memory???  If you're lucky in allocation, they
>might be.   The BitMap structure contains an array of pointers to the
>tops of the bitplanes; if b is a BitMap, b.Planes[0] points to the
>first bitplane, b.Planes[1] to the second, etc.  I think you'd be
>better off using that...
>
>Or am I wrong?

You're right.  There is absolutely no guarantee that bitplanes are
right after each other in memory.

You MUST use each plane's bitmap.Planes[] pointer as the base address
of each bitplane.  You can not extrapolate the address of plnae[n]
with a calculation off plane[0].

-- 
==========================================================================
  Carolyn Scheppner -- CATS  Commodore Amiga Technical Support
  PHONE 215-431-9180   UUCP  ...{uunet,allegra,rutgers}!cbmvax!carolyn 

 Signed characters are xenophobic.  
==========================================================================