forked from mia/Aegisub
385 lines
10 KiB
C
385 lines
10 KiB
C
/*
|
|
* Copyright (C) 2006 Evgeniy Stepanov <eugeni.stepanov@gmail.com>
|
|
*
|
|
* This file is part of libass.
|
|
*
|
|
* Permission to use, copy, modify, and distribute this software for any
|
|
* purpose with or without fee is hereby granted, provided that the above
|
|
* copyright notice and this permission notice appear in all copies.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
|
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
|
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
|
|
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
|
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
|
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
|
|
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
|
*/
|
|
|
|
#include "config.h"
|
|
|
|
#include <inttypes.h>
|
|
#include <ft2build.h>
|
|
#include FT_FREETYPE_H
|
|
#include FT_GLYPH_H
|
|
|
|
#include <assert.h>
|
|
|
|
#include "ass_utils.h"
|
|
#include "ass.h"
|
|
#include "ass_fontconfig.h"
|
|
#include "ass_font.h"
|
|
#include "ass_bitmap.h"
|
|
#include "ass_cache.h"
|
|
|
|
static unsigned hashmap_hash(void *buf, size_t len)
|
|
{
|
|
return fnv_32a_buf(buf, len, FNV1_32A_INIT);
|
|
}
|
|
|
|
static int hashmap_key_compare(void *a, void *b, size_t size)
|
|
{
|
|
return memcmp(a, b, size) == 0;
|
|
}
|
|
|
|
static void hashmap_item_dtor(void *key, size_t key_size, void *value,
|
|
size_t value_size)
|
|
{
|
|
free(key);
|
|
free(value);
|
|
}
|
|
|
|
Hashmap *hashmap_init(ASS_Library *library, size_t key_size,
|
|
size_t value_size, int nbuckets,
|
|
HashmapItemDtor item_dtor,
|
|
HashmapKeyCompare key_compare,
|
|
HashmapHash hash)
|
|
{
|
|
Hashmap *map = calloc(1, sizeof(Hashmap));
|
|
map->library = library;
|
|
map->nbuckets = nbuckets;
|
|
map->key_size = key_size;
|
|
map->value_size = value_size;
|
|
map->root = calloc(nbuckets, sizeof(hashmap_item_p));
|
|
map->item_dtor = item_dtor ? item_dtor : hashmap_item_dtor;
|
|
map->key_compare = key_compare ? key_compare : hashmap_key_compare;
|
|
map->hash = hash ? hash : hashmap_hash;
|
|
return map;
|
|
}
|
|
|
|
void hashmap_done(Hashmap *map)
|
|
{
|
|
int i;
|
|
// print stats
|
|
if (map->count > 0 || map->hit_count + map->miss_count > 0)
|
|
ass_msg(map->library, MSGL_V,
|
|
"cache statistics: \n total accesses: %d\n hits: %d\n "
|
|
"misses: %d\n object count: %d",
|
|
map->hit_count + map->miss_count, map->hit_count,
|
|
map->miss_count, map->count);
|
|
|
|
for (i = 0; i < map->nbuckets; ++i) {
|
|
HashmapItem *item = map->root[i];
|
|
while (item) {
|
|
HashmapItem *next = item->next;
|
|
map->item_dtor(item->key, map->key_size, item->value,
|
|
map->value_size);
|
|
free(item);
|
|
item = next;
|
|
}
|
|
}
|
|
free(map->root);
|
|
free(map);
|
|
}
|
|
|
|
// does nothing if key already exists
|
|
void *hashmap_insert(Hashmap *map, void *key, void *value)
|
|
{
|
|
unsigned hash = map->hash(key, map->key_size);
|
|
HashmapItem **next = map->root + (hash % map->nbuckets);
|
|
while (*next) {
|
|
if (map->key_compare(key, (*next)->key, map->key_size))
|
|
return (*next)->value;
|
|
next = &((*next)->next);
|
|
assert(next);
|
|
}
|
|
(*next) = malloc(sizeof(HashmapItem));
|
|
(*next)->key = malloc(map->key_size);
|
|
(*next)->value = malloc(map->value_size);
|
|
memcpy((*next)->key, key, map->key_size);
|
|
memcpy((*next)->value, value, map->value_size);
|
|
(*next)->next = 0;
|
|
|
|
map->count++;
|
|
return (*next)->value;
|
|
}
|
|
|
|
void *hashmap_find(Hashmap *map, void *key)
|
|
{
|
|
unsigned hash = map->hash(key, map->key_size);
|
|
HashmapItem *item = map->root[hash % map->nbuckets];
|
|
while (item) {
|
|
if (map->key_compare(key, item->key, map->key_size)) {
|
|
map->hit_count++;
|
|
return item->value;
|
|
}
|
|
item = item->next;
|
|
}
|
|
map->miss_count++;
|
|
return 0;
|
|
}
|
|
|
|
//---------------------------------
|
|
// font cache
|
|
|
|
static unsigned font_desc_hash(void *buf, size_t len)
|
|
{
|
|
ASS_FontDesc *desc = buf;
|
|
unsigned hval;
|
|
hval = fnv_32a_str(desc->family, FNV1_32A_INIT);
|
|
hval = fnv_32a_buf(&desc->bold, sizeof(desc->bold), hval);
|
|
hval = fnv_32a_buf(&desc->italic, sizeof(desc->italic), hval);
|
|
return hval;
|
|
}
|
|
|
|
static int font_compare(void *key1, void *key2, size_t key_size)
|
|
{
|
|
ASS_FontDesc *a = key1;
|
|
ASS_FontDesc *b = key2;
|
|
if (strcmp(a->family, b->family) != 0)
|
|
return 0;
|
|
if (a->bold != b->bold)
|
|
return 0;
|
|
if (a->italic != b->italic)
|
|
return 0;
|
|
if (a->treat_family_as_pattern != b->treat_family_as_pattern)
|
|
return 0;
|
|
if (a->vertical != b->vertical)
|
|
return 0;
|
|
return 1;
|
|
}
|
|
|
|
static void font_hash_dtor(void *key, size_t key_size, void *value,
|
|
size_t value_size)
|
|
{
|
|
ass_font_free(value);
|
|
free(key);
|
|
}
|
|
|
|
ASS_Font *ass_font_cache_find(Hashmap *font_cache,
|
|
ASS_FontDesc *desc)
|
|
{
|
|
return hashmap_find(font_cache, desc);
|
|
}
|
|
|
|
/**
|
|
* \brief Add a face struct to cache.
|
|
* \param font font struct
|
|
*/
|
|
void *ass_font_cache_add(Hashmap *font_cache, ASS_Font *font)
|
|
{
|
|
return hashmap_insert(font_cache, &(font->desc), font);
|
|
}
|
|
|
|
Hashmap *ass_font_cache_init(ASS_Library *library)
|
|
{
|
|
Hashmap *font_cache;
|
|
font_cache = hashmap_init(library, sizeof(ASS_FontDesc),
|
|
sizeof(ASS_Font),
|
|
1000,
|
|
font_hash_dtor, font_compare, font_desc_hash);
|
|
return font_cache;
|
|
}
|
|
|
|
void ass_font_cache_done(Hashmap *font_cache)
|
|
{
|
|
hashmap_done(font_cache);
|
|
}
|
|
|
|
|
|
// Create hash/compare functions for bitmap and glyph
|
|
#define CREATE_HASH_FUNCTIONS
|
|
#include "ass_cache_template.h"
|
|
#define CREATE_COMPARISON_FUNCTIONS
|
|
#include "ass_cache_template.h"
|
|
|
|
//---------------------------------
|
|
// bitmap cache
|
|
|
|
static void bitmap_hash_dtor(void *key, size_t key_size, void *value,
|
|
size_t value_size)
|
|
{
|
|
BitmapHashValue *v = value;
|
|
if (v->bm)
|
|
ass_free_bitmap(v->bm);
|
|
if (v->bm_o)
|
|
ass_free_bitmap(v->bm_o);
|
|
if (v->bm_s)
|
|
ass_free_bitmap(v->bm_s);
|
|
free(key);
|
|
free(value);
|
|
}
|
|
|
|
void *cache_add_bitmap(Hashmap *bitmap_cache, BitmapHashKey *key,
|
|
BitmapHashValue *val)
|
|
{
|
|
// Note: this is only an approximation
|
|
if (val->bm_o)
|
|
bitmap_cache->cache_size += val->bm_o->w * val->bm_o->h * 3;
|
|
else if (val->bm)
|
|
bitmap_cache->cache_size += val->bm->w * val->bm->h * 3;
|
|
|
|
return hashmap_insert(bitmap_cache, key, val);
|
|
}
|
|
|
|
/**
|
|
* \brief Get a bitmap from bitmap cache.
|
|
* \param key hash key
|
|
* \return requested hash val or 0 if not found
|
|
*/
|
|
BitmapHashValue *cache_find_bitmap(Hashmap *bitmap_cache,
|
|
BitmapHashKey *key)
|
|
{
|
|
return hashmap_find(bitmap_cache, key);
|
|
}
|
|
|
|
Hashmap *ass_bitmap_cache_init(ASS_Library *library)
|
|
{
|
|
Hashmap *bitmap_cache;
|
|
bitmap_cache = hashmap_init(library,
|
|
sizeof(BitmapHashKey),
|
|
sizeof(BitmapHashValue),
|
|
0xFFFF + 13,
|
|
bitmap_hash_dtor, bitmap_compare,
|
|
bitmap_hash);
|
|
return bitmap_cache;
|
|
}
|
|
|
|
void ass_bitmap_cache_done(Hashmap *bitmap_cache)
|
|
{
|
|
hashmap_done(bitmap_cache);
|
|
}
|
|
|
|
Hashmap *ass_bitmap_cache_reset(Hashmap *bitmap_cache)
|
|
{
|
|
ASS_Library *lib = bitmap_cache->library;
|
|
|
|
ass_bitmap_cache_done(bitmap_cache);
|
|
return ass_bitmap_cache_init(lib);
|
|
}
|
|
|
|
//---------------------------------
|
|
// glyph cache
|
|
|
|
static void glyph_hash_dtor(void *key, size_t key_size, void *value,
|
|
size_t value_size)
|
|
{
|
|
GlyphHashValue *v = value;
|
|
if (v->glyph)
|
|
FT_Done_Glyph(v->glyph);
|
|
if (v->outline_glyph)
|
|
FT_Done_Glyph(v->outline_glyph);
|
|
free(key);
|
|
free(value);
|
|
}
|
|
|
|
void *cache_add_glyph(Hashmap *glyph_cache, GlyphHashKey *key,
|
|
GlyphHashValue *val)
|
|
{
|
|
if (val->glyph && val->glyph->format == FT_GLYPH_FORMAT_BITMAP) {
|
|
FT_Bitmap *bitmap = &((FT_BitmapGlyph) val->glyph)->bitmap;
|
|
glyph_cache->cache_size += bitmap->rows * bitmap->pitch;
|
|
}
|
|
|
|
return hashmap_insert(glyph_cache, key, val);
|
|
}
|
|
|
|
/**
|
|
* \brief Get a glyph from glyph cache.
|
|
* \param key hash key
|
|
* \return requested hash val or 0 if not found
|
|
*/
|
|
GlyphHashValue *cache_find_glyph(Hashmap *glyph_cache,
|
|
GlyphHashKey *key)
|
|
{
|
|
return hashmap_find(glyph_cache, key);
|
|
}
|
|
|
|
Hashmap *ass_glyph_cache_init(ASS_Library *library)
|
|
{
|
|
Hashmap *glyph_cache;
|
|
glyph_cache = hashmap_init(library, sizeof(GlyphHashKey),
|
|
sizeof(GlyphHashValue),
|
|
0xFFFF + 13,
|
|
glyph_hash_dtor, glyph_compare, glyph_hash);
|
|
return glyph_cache;
|
|
}
|
|
|
|
void ass_glyph_cache_done(Hashmap *glyph_cache)
|
|
{
|
|
hashmap_done(glyph_cache);
|
|
}
|
|
|
|
Hashmap *ass_glyph_cache_reset(Hashmap *glyph_cache)
|
|
{
|
|
ASS_Library *lib = glyph_cache->library;
|
|
|
|
ass_glyph_cache_done(glyph_cache);
|
|
return ass_glyph_cache_init(lib);
|
|
}
|
|
|
|
|
|
//---------------------------------
|
|
// composite cache
|
|
|
|
static void composite_hash_dtor(void *key, size_t key_size, void *value,
|
|
size_t value_size)
|
|
{
|
|
CompositeHashValue *v = value;
|
|
free(v->a);
|
|
free(v->b);
|
|
free(key);
|
|
free(value);
|
|
}
|
|
|
|
void *cache_add_composite(Hashmap *composite_cache,
|
|
CompositeHashKey *key,
|
|
CompositeHashValue *val)
|
|
{
|
|
return hashmap_insert(composite_cache, key, val);
|
|
}
|
|
|
|
/**
|
|
* \brief Get a composite bitmap from composite cache.
|
|
* \param key hash key
|
|
* \return requested hash val or 0 if not found
|
|
*/
|
|
CompositeHashValue *cache_find_composite(Hashmap *composite_cache,
|
|
CompositeHashKey *key)
|
|
{
|
|
return hashmap_find(composite_cache, key);
|
|
}
|
|
|
|
Hashmap *ass_composite_cache_init(ASS_Library *library)
|
|
{
|
|
Hashmap *composite_cache;
|
|
composite_cache = hashmap_init(library, sizeof(CompositeHashKey),
|
|
sizeof(CompositeHashValue),
|
|
0xFFFF + 13,
|
|
composite_hash_dtor, composite_compare,
|
|
composite_hash);
|
|
return composite_cache;
|
|
}
|
|
|
|
void ass_composite_cache_done(Hashmap *composite_cache)
|
|
{
|
|
hashmap_done(composite_cache);
|
|
}
|
|
|
|
Hashmap *ass_composite_cache_reset(Hashmap *composite_cache)
|
|
{
|
|
ASS_Library *lib = composite_cache->library;
|
|
|
|
ass_composite_cache_done(composite_cache);
|
|
return ass_composite_cache_init(lib);
|
|
}
|