home *** CD-ROM | disk | FTP | other *** search
- Path: oreig.uji.es!ii202
- From: ii202@rossegat.uji.es (Jorge Acereda Macia)
- Newsgroups: comp.sys.amiga.programmer
- Subject: Re: Bitfieldinsert?
- Date: 12 Feb 1996 14:01:40 GMT
- Organization: Universitat Jaume I. Castell≤ de la Plana. Spain
- Message-ID: <4fnh84$1m7@oreig.uji.es>
- References: <38232222@kone.fipnet.fi> <4f4qo2$i6o@oreig.uji.es> <38232329@kone.fipnet.fi>
- NNTP-Posting-Host: @rossegat.uji.es
- X-Newsreader: TIN [version 1.2 PL2]
-
- Jyrki Saarinen (jsaarinen@kone.fipnet.fi) wrote:
-
- > Well, a friend of my made a Gouraud polygon routine
- > a while ago that does 8 pixels on two instructions.
- > (all four planes in a long word; a little blitting or CPU
- > passes needed)
-
- > move.l (a0,d0.w*4),(a1)+
- > addx.l d1,d0
-
- Cool! Looks fast when working with big polys, but handling left and
- right bytes (edges) should slow down the thing...
-
- BTW... What's d0? rr...rrLLLLllllllllRRRR?
- R= integer part of right color, r=decimal part
- L= integer part of left color, l= "
-
- Greets,
- --
- ---------------------------- --------------------------------------------
- | Jorge Acereda | Dream the same thing everynight |
- | ii202@rossegat.uji.es | I see our freedom in my sight |
- | Intel Outside | No locked doors, no windows barred |
- | Amiga Rules | No things to make my brain seem scarred |
- ---------------------------- --------------------------------------------
-