Archived

This topic is now archived and is closed to further replies.

Is this even feasible for a fast transparent blt?

This topic is 6364 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

Most of you know about compiled bitmaps. Pieces of ASM code that modify a block of memory. Fast but hard to clip. What about this: Say you have a surface destination bitmap (dest) and a source bitmap with transparent parts. A reverse compiled bitmap would know the exact location of all the transparent blocks so it would copy the pixels from the dest to the src, overwritting whereever the transparent pixels are at. Once that is done, the src can be copied back to the dest in one copy, or row by row if clipping occurs. I''m no ASM programmer and only slightly understand it. Just wondering if it were a feasible idea that brought about a fast transparent bitblt. Thank you Dino M. Gambone Dino M. Gambone
Good judgement is gained through experience. Experience, however, is gained through bad judgement.

Share this post


Link to post
Share on other sites