Files
harfbuzz/src/graph
Behdad Esfahbod edca03eadb [bit-vector] Use bounded bitvectors in GDEF and the repacker (#6630)
Use hb_bit_vector_t and hb_min_max_t as Coverage sinks for the GDEF
mark-set cache. Preserve the exact-cache span limit and fall back to
the digest and table when allocation fails. Pack the repacker's
Dijkstra visited flags into one bit per vertex.

Fix singleton ranges and compute bit masks relative to the vector's
minimum. Avoid overflow when sizing inclusive ranges, expose allocation
failure, and add the Coverage sink methods needed by GDEF.

Add regression tests for biased ranges, singleton and allocation
boundaries, failing allocation, moves, and GDEF cache/table parity.

Testing: full meson test suite (303 passed, 1 skipped); bitvector tests
with AddressSanitizer and UndefinedBehaviorSanitizer; HB_TINY
amalgamation syntax check.

Assisted-by: OpenAI Codex
2026-11-10 17:12:12 -06:00
..