Optimize draw_pixels with consecutive pixel caching#46
Draft
stuartparmenter wants to merge 1 commit into
Draft
Conversation
50c6132 to
8113fdf
Compare
Add per-instance cache for raw pixel values and pre-computed bit patterns. For consecutive identical pixels, skips: - extract_rgb888_from_format() call - 3 LUT lookups - bit_depth × pattern computation iterations Implementation: - Pack raw source bytes into uint32_t for single-comparison cache check - Cache pre-computed upper/lower patterns for all bit planes - Class members persist across draw_pixels() calls (benefits single-pixel APIs) Works on top of existing optimizations (identity fast path, branchless bit extraction, pointer arithmetic).
8113fdf to
364d6b3
Compare
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
When consecutive pixels have the same RGB values, skip redundant LUT
lookups and bit pattern computation by caching the pre-computed upper
and lower patterns. This avoids 3 LUT lookups and bit_depth×6 conditional
branches per duplicate pixel.
Particularly beneficial for images with solid color regions, UI elements
with flat backgrounds, and anti-aliased text with identical background pixels.