tree 2e6fe51880f641c0a9e62c5f00fe9ab33f0e9b50
parent 68db8c49d8e4a49a260b8260e24a604c5fdc0458
author Behdad Esfahbod <behdad@behdad.org> 1367284575 -0400
committer Behdad Esfahbod <behdad@behdad.org> 1367523556 -0400

[OTLayout] Accelerate lookups by batching

If we need to apply many many lookups, we can fasten that up by applying
them in batches.  For each batch we keep the union of the coverage of
the lookups participating.  We can then skip glyph ranges that do NOT
participate in any lookup in the batch.  The batch partition is
determined optimally by a mathematical probability model on the glyphs
and a dynamic-program to optimize the partition.

The net effect is 30% speedup on Amiri.  the downside is more memory
consuption as each batch will keep an hb_set_t of its coverage.

I'm not yet convinced that the tradeoff is worth pursuing.  I'm trying
to find out ways to optimized this more, with less memory overhead.

This work also ignores the number of subtables per lookup.  That may
prove to be very important for the performance numbers from here on.