April 9, 2026
8:54 p.m.
On Thu Apr 9 15:53:50 2026 +0000, Esme Povirk wrote:
Suppose our region looks like this: ``` - Intersect[A] - Intersect[B] - Rectangle[C] # graphics bounds - Rectangle[D] # graphics clipping region - Path[E] # what we're drawing ``` `combine_regions_to_spans` when called for [B] will use the optimized path to return a span array for the intersection of [C] and [D]. But, `combine_regions_to_spans` when called for [A] will have span lists for [B] and [E], which it must combine using a loop, even though it's easy to prove that [B] is a rectangle. I see what you mean. I've made it recurse.
-- https://gitlab.winehq.org/wine/wine/-/merge_requests/10359#note_135763