Bit blit routine, version 1
Brian Hurt
bhurt at spnz.org
Tue Feb 3 14:10:18 CET 2004
On 3 Feb 2004, Niels Möller wrote:
> If I understood the code correctly, the only operation so far is
> copying, but it could be generalized to n source operands and a
> selection of any of the 2^(2^n) possible boolean functions. The
> Amiga's blitter hardware used n = 3, and handled rectangular subsets
> of bitmaps.
You are correct- currently it's only copying. Modifying the code to do
various bitwise options, now that copy is working, is easy.
--
"Usenet is like a herd of performing elephants with diarrhea -- massive,
difficult to redirect, awe-inspiring, entertaining, and a source of
mind-boggling amounts of excrement when you least expect it."
- Gene Spafford
Brian
More information about the gmp-devel
mailing list