🚀 go-pugleaf

Allan, or anyone else that has seen the "real" blitter documentation
I would love to hear what it can do. Specifically, things like

How many bits at a time does it manipulate? 
What kind of operations can it do (OR, AND, XOR, CPL, ADD?, SUB? CMP?, etc)
Does it handle overlapping rectangles automatically? Or does one
have to break them up? 'frinstance blitting the rectangle from (a,b) to
the rectangle at (a1,b1).

(a,b)
  +---------------------+
  |        (a1,b1)      |
  |           +---------------------+
  |           |                     |
  +-----------|                     |
              |                     |
              +---------------------+

Does it do masked blits? 
How many sources can it address (terms in the logical equation) and does
the destination count as one term? 
How fast is it (pixels/sec) and does it completely steal the bus from the
68K or does it "cycle steal". 
Does it have any memory restrictions like the Amiga (lower 512K only)
and what is the largest bitmap that it can blit into?

Thanks for any answers to any of the above questions.

-- 
--Chuck McManis
uucp: {anywhere}!sun!cmcmanis   BIX: cmcmanis  ARPAnet: cmcmanis@sun.com
These opinions are my own and no one elses, but you knew that didn't you.