cache: use outline-bitmap hierarchy to slim down bitmap hash key

The bitmap hash key duplicated a lot of information the glyph hash
key already saves. The subclassing introduced recently complicates
this even more. Modify the hash key to utilize a pointer to the glyph
hash value instead, which is faster and more flexible. Make sure to
always empty the bitmap cache when the glyph cache is emptied.

1 files changed, 1 insertions, 0 deletions

diff --git a/libass/ass_render.h b/libass/ass_render.h
index de2377a..80ec394 100644
--- a/libass/ass_render.h
+++ b/libass/ass_render.h
@@ -121,6 +121,7 @@ typedef struct {
     double shadow_y;
     double frx, fry, frz;       // rotation
     double fax, fay;            // text shearing
+    unsigned italic;
 
     BitmapHashKey hash_key;
 } GlyphInfo;