home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.sys.amiga.programmer
- Path: sparky!uunet!math.fu-berlin.de!mailgzrz.TU-Berlin.DE!news.netmbx.de!Germany.EU.net!mpifr-bonn.mpg.de!speckled.mpifr-bonn.mpg.de!mlelstv
- From: mlelstv@speckled.mpifr-bonn.mpg.de (Michael van Elst)
- Subject: Re: Chunky Pixels vs. Bitplanes (was: Chunky Chip Set...)
- Message-ID: <1992Dec29.114206.2227@mpifr-bonn.mpg.de>
- Sender: news@mpifr-bonn.mpg.de
- Nntp-Posting-Host: speckled
- Organization: Max-Planck-Institut f"ur Radioastronomie
- References: <1992Dec28.000531.26783@mpifr-bonn.mpg.de> <doiron.0k4a@starpt.UUCP> <1992Dec29.010853.12840@mpifr-bonn.mpg.de> <C00nKw.Lx7@unix.portal.com>
- Date: Tue, 29 Dec 1992 11:42:06 GMT
- Lines: 24
-
- In <C00nKw.Lx7@unix.portal.com> danb@shell.portal.com (Dan E Babcock) writes:
- >mask, dest, and dest) per word transferred. On a TI graphics chip it requires
- >only 2 accesses, source and dest, because it can avoid disturbing the destination
- >byte if the source byte is 0 (transparent). It's inherently twice as fast.
-
- >Dan
-
- You meant, the TI chip performs the operation twice as fast as our blitter.
- True (besides that it is even faster because of a higher clock).
-
- With planes you could read a word of each plane (at that time OR them together
- in a register) read the destination if the generated mask is nonzero and
- different from all-one (AND it at that time with the mask) and write it back
- (just if the mask was nonzero).
-
- This generates extra reads of the destination for the boundaries of the
- object compared to chunky pixel.
-
- Regards,
- --
- Michael van Elst
- UUCP: universe!local-cluster!milky-way!sol!earth!uunet!unido!mpirbn!p554mve
- Internet: p554mve@mpirbn.mpifr-bonn.mpg.de
- "A potential Snark may lurk in every tree."
-