SpritesMind.Net

Well, if you can combine it to work on multiple pixels at once, it might become worth doing. You suggest to use a bitmask + lookup table for allowing O/W. Why not computing a new bitmask + lookup table ? sprite_mask OR screen_mask + lookup table. This allow O/W too ! By writing front to back, you c...

when the cache is disabled, you can treat the ENTIRE cache as very fast memory. Nice. And performing DMA ? So, using this memory should be a fastest way to copy many bytes to framebuffer ? Compared to the 68K, SH-2 have a lot of registers. Is-it a good way to using two of them for storing a tile an...

Yes, I'm thinking about.
Else, is it possible to perform "blitting" by permorming data-block transfert, from RAM to FB, by using DMA ?
Is it efficient to using a part of the FB like a buffer ?

Thank you.

Yes, I forgot that I have to write pixel per pixel.

I have read again. (sorry for my english) May be, I think that it's possible to do it more faster by using a bit-mask for the screen. (9.8KB) I add sprites & tiles masks to it. Depending this "big mask", it may skip or write pixels to the frame buffer. By this way, you never expand & write hidden pi...

It's possible that I don't realy comes to identify the SH-2 power.
I explain a concept, not the way to program it.
All stufs are not good to take, but can help to go forward.
I'll have to do better.

I need to cold my brain. Another way for drawing all using bit-mask... Front to back ! Steps : 1- init the screen mask. 2- sprite mask AND screen mask, then draw sprite to the FB [...] 3- tile mask AND screen mask, then draw B-plane tile to the FB [...] 4- draw A-plane tile to the FB [...] Only uncl...

Overwrite is good if your transparency is all or nothing. Alpha effects are what really slow things down if they aren't in hardware. Yes. Fortunately, no alpha here. :) With bitmask, you may use some "entries" for doing the good task without any test. This stuf can be used for the "screen" too ... ...

Which is precisely why the bit mask is a good idea [...] Using a bit mask means you only need one look up to change from bits to the mask itself, which is fast. I'm sure that bitmask was a nice solution. I just doubt about the O/W. And I think it was more efficient to writting a part of both planes...

It IS actually very clever ! 1 byte per line, containing 8 bits, 1 bit per pixel, 0 = transparent, 1 = not transparent. Then a Lookup Table. Have you read again our previous emails about scrolling, dma, ... If fact, I'm not sure using O/W was the best way to speed up the display. I have more than 1...

And, you just have to load it for B-Plane.
Also, it allow a perfect collision detection.

EDIT:

Else, you can use 48bit :

8 : Transparency Mask
8 : Collision Mask
32 : Tile / Sprite

Very usefull too !

slowly but surely ...

Pleased to see the project move forward !

I trust you !

All right. Thank you very much !