2006-10-01 17:09:04 +00:00
|
|
|
// -*- c-basic-offset: 8; indent-tabs-mode: t -*-
|
|
|
|
// vim:ts=8:sw=8:noet:ai:
|
|
|
|
/*
|
|
|
|
Copyright (C) 2006 Evgeniy Stepanov <eugeni.stepanov@gmail.com>
|
|
|
|
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
the Free Software Foundation; either version 2 of the License, or
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with this program; if not, write to the Free Software
|
|
|
|
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
*/
|
|
|
|
|
2006-07-07 18:26:51 +00:00
|
|
|
#include "config.h"
|
|
|
|
|
|
|
|
#include <ft2build.h>
|
|
|
|
#include FT_FREETYPE_H
|
2006-09-16 13:08:17 +00:00
|
|
|
#include FT_GLYPH_H
|
2006-07-07 18:26:51 +00:00
|
|
|
|
|
|
|
#include <assert.h>
|
|
|
|
|
|
|
|
#include "mp_msg.h"
|
|
|
|
#include "ass_fontconfig.h"
|
2006-09-16 13:08:17 +00:00
|
|
|
#include "ass_bitmap.h"
|
2006-07-07 18:26:51 +00:00
|
|
|
#include "ass_cache.h"
|
|
|
|
|
|
|
|
|
|
|
|
typedef struct face_cache_item_s {
|
|
|
|
face_desc_t desc;
|
|
|
|
char* path;
|
|
|
|
int index;
|
|
|
|
FT_Face face;
|
|
|
|
} face_cache_item_t;
|
|
|
|
|
|
|
|
#define MAX_FACE_CACHE_SIZE 100
|
|
|
|
|
|
|
|
static face_cache_item_t* face_cache;
|
|
|
|
static int face_cache_size;
|
|
|
|
|
|
|
|
extern int no_more_font_messages;
|
|
|
|
|
|
|
|
static int font_compare(face_desc_t* a, face_desc_t* b) {
|
|
|
|
if (strcmp(a->family, b->family) != 0)
|
|
|
|
return 0;
|
|
|
|
if (a->bold != b->bold)
|
|
|
|
return 0;
|
|
|
|
if (a->italic != b->italic)
|
|
|
|
return 0;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2006-11-03 23:11:00 +00:00
|
|
|
/**
|
|
|
|
* Select Microfost Unicode CharMap, if the font has one.
|
|
|
|
* Otherwise, let FreeType decide.
|
|
|
|
*/
|
|
|
|
static void charmap_magic(FT_Face face)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
for (i = 0; i < face->num_charmaps; ++i) {
|
|
|
|
FT_CharMap cmap = face->charmaps[i];
|
|
|
|
unsigned pid = cmap->platform_id;
|
|
|
|
unsigned eid = cmap->encoding_id;
|
|
|
|
if (pid == 3 /*microsoft*/ && (eid == 1 /*unicode bmp*/ || eid == 10 /*full unicode*/)) {
|
|
|
|
FT_Set_Charmap(face, cmap);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-07-07 18:26:51 +00:00
|
|
|
/**
|
|
|
|
* \brief Get a face object, either from cache or created through FreeType+FontConfig.
|
|
|
|
* \param library FreeType library object
|
|
|
|
* \param fontconfig_priv fontconfig private data
|
|
|
|
* \param desc required face description
|
|
|
|
* \param face out: the face object
|
|
|
|
*/
|
|
|
|
int ass_new_face(FT_Library library, void* fontconfig_priv, face_desc_t* desc, /*out*/ FT_Face* face)
|
|
|
|
{
|
|
|
|
FT_Error error;
|
|
|
|
int i;
|
|
|
|
char* path;
|
|
|
|
int index;
|
|
|
|
face_cache_item_t* item;
|
|
|
|
|
|
|
|
for (i=0; i<face_cache_size; ++i)
|
|
|
|
if (font_compare(desc, &(face_cache[i].desc))) {
|
|
|
|
*face = face_cache[i].face;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (face_cache_size == MAX_FACE_CACHE_SIZE) {
|
2006-11-03 18:15:33 +00:00
|
|
|
mp_msg(MSGT_ASS, MSGL_FATAL, "Too many fonts\n");
|
2006-07-07 18:26:51 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
path = fontconfig_select(fontconfig_priv, desc->family, desc->bold, desc->italic, &index);
|
|
|
|
|
|
|
|
error = FT_New_Face(library, path, index, face);
|
|
|
|
if (error) {
|
|
|
|
if (!no_more_font_messages)
|
2006-11-03 18:15:33 +00:00
|
|
|
mp_msg(MSGT_ASS, MSGL_WARN, "Error opening font: %s, %d\n", path, index);
|
2006-07-07 18:26:51 +00:00
|
|
|
no_more_font_messages = 1;
|
|
|
|
return 1;
|
|
|
|
}
|
2006-11-03 23:11:00 +00:00
|
|
|
|
|
|
|
charmap_magic(*face);
|
2006-07-07 18:26:51 +00:00
|
|
|
|
|
|
|
item = face_cache + face_cache_size;
|
|
|
|
item->path = strdup(path);
|
|
|
|
item->index = index;
|
|
|
|
item->face = *face;
|
|
|
|
memcpy(&(item->desc), desc, sizeof(face_desc_t));
|
|
|
|
face_cache_size++;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void ass_face_cache_init(void)
|
|
|
|
{
|
|
|
|
face_cache = calloc(MAX_FACE_CACHE_SIZE, sizeof(face_cache_item_t));
|
|
|
|
face_cache_size = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void ass_face_cache_done(void)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
for (i = 0; i < face_cache_size; ++i) {
|
|
|
|
face_cache_item_t* item = face_cache + i;
|
|
|
|
if (item->face) FT_Done_Face(item->face);
|
|
|
|
if (item->path) free(item->path);
|
|
|
|
// FIXME: free desc ?
|
|
|
|
}
|
|
|
|
free(face_cache);
|
|
|
|
face_cache_size = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------
|
|
|
|
// glyph cache
|
|
|
|
|
|
|
|
#define GLYPH_HASH_SIZE (0xFFFF + 13)
|
|
|
|
|
|
|
|
typedef struct glyph_hash_item_s {
|
|
|
|
glyph_hash_key_t key;
|
|
|
|
glyph_hash_val_t val;
|
|
|
|
struct glyph_hash_item_s* next;
|
|
|
|
} glyph_hash_item_t;
|
|
|
|
|
|
|
|
typedef glyph_hash_item_t* glyph_hash_item_p;
|
|
|
|
|
|
|
|
static glyph_hash_item_p* glyph_hash_root;
|
|
|
|
static int glyph_hash_size;
|
|
|
|
|
|
|
|
static int glyph_compare(glyph_hash_key_t* a, glyph_hash_key_t* b) {
|
|
|
|
if (memcmp(a, b, sizeof(glyph_hash_key_t)) == 0)
|
|
|
|
return 1;
|
|
|
|
else
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static unsigned glyph_hash(glyph_hash_key_t* key) {
|
|
|
|
unsigned val = 0;
|
|
|
|
unsigned i;
|
|
|
|
for (i = 0; i < sizeof(key->face); ++i)
|
|
|
|
val += *(unsigned char *)(&(key->face) + i);
|
|
|
|
val <<= 21;
|
|
|
|
|
|
|
|
if (key->bitmap) val &= 0x80000000;
|
2006-09-16 13:32:46 +00:00
|
|
|
if (key->be) val &= 0x40000000;
|
2006-07-07 18:26:51 +00:00
|
|
|
val += key->index;
|
|
|
|
val += key->size << 8;
|
|
|
|
val += key->outline << 3;
|
|
|
|
val += key->advance.x << 10;
|
|
|
|
val += key->advance.y << 16;
|
|
|
|
val += key->bold << 1;
|
|
|
|
val += key->italic << 20;
|
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* \brief Add a glyph to glyph cache.
|
|
|
|
* \param key hash key
|
|
|
|
* \param val hash val: 2 bitmap glyphs + some additional info
|
|
|
|
*/
|
|
|
|
void cache_add_glyph(glyph_hash_key_t* key, glyph_hash_val_t* val)
|
|
|
|
{
|
|
|
|
unsigned hash = glyph_hash(key);
|
|
|
|
glyph_hash_item_t** next = glyph_hash_root + (hash % GLYPH_HASH_SIZE);
|
|
|
|
while (*next) {
|
|
|
|
if (glyph_compare(key, &((*next)->key)))
|
|
|
|
return;
|
|
|
|
next = &((*next)->next);
|
|
|
|
assert(next);
|
|
|
|
}
|
|
|
|
(*next) = malloc(sizeof(glyph_hash_item_t));
|
|
|
|
// (*next)->desc = glyph_key_copy(key, &((*next)->key));
|
|
|
|
memcpy(&((*next)->key), key, sizeof(glyph_hash_key_t));
|
|
|
|
memcpy(&((*next)->val), val, sizeof(glyph_hash_val_t));
|
|
|
|
(*next)->next = 0;
|
|
|
|
|
|
|
|
glyph_hash_size ++;
|
|
|
|
/* if (glyph_hash_size && (glyph_hash_size % 25 == 0)) {
|
|
|
|
printf("\nGlyph cache: %d entries, %d bytes\n", glyph_hash_size, glyph_hash_size * sizeof(glyph_hash_item_t));
|
|
|
|
} */
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* \brief Get a glyph from glyph cache.
|
|
|
|
* \param key hash key
|
|
|
|
* \return requested hash val or 0 if not found
|
|
|
|
*/
|
|
|
|
glyph_hash_val_t* cache_find_glyph(glyph_hash_key_t* key)
|
|
|
|
{
|
|
|
|
unsigned hash = glyph_hash(key);
|
|
|
|
glyph_hash_item_t* item = glyph_hash_root[hash % GLYPH_HASH_SIZE];
|
|
|
|
while (item) {
|
|
|
|
if (glyph_compare(key, &(item->key))) {
|
|
|
|
return &(item->val);
|
|
|
|
}
|
|
|
|
item = item->next;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void ass_glyph_cache_init(void)
|
|
|
|
{
|
|
|
|
glyph_hash_root = calloc(GLYPH_HASH_SIZE, sizeof(glyph_hash_item_p));
|
|
|
|
glyph_hash_size = 0;
|
|
|
|
}
|
|
|
|
|
2006-08-26 20:09:54 +00:00
|
|
|
void ass_glyph_cache_done(void)
|
2006-07-07 18:26:51 +00:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
for (i = 0; i < GLYPH_HASH_SIZE; ++i) {
|
|
|
|
glyph_hash_item_t* item = glyph_hash_root[i];
|
|
|
|
while (item) {
|
|
|
|
glyph_hash_item_t* next = item->next;
|
2006-09-16 13:08:17 +00:00
|
|
|
if (item->val.bm) ass_free_bitmap(item->val.bm);
|
|
|
|
if (item->val.bm_o) ass_free_bitmap(item->val.bm_o);
|
2006-09-24 16:04:37 +00:00
|
|
|
if (item->val.bm_s) ass_free_bitmap(item->val.bm_s);
|
2006-07-07 18:26:51 +00:00
|
|
|
free(item);
|
|
|
|
item = next;
|
|
|
|
}
|
|
|
|
}
|
2006-08-26 20:09:54 +00:00
|
|
|
free(glyph_hash_root);
|
2006-07-07 18:26:51 +00:00
|
|
|
glyph_hash_size = 0;
|
|
|
|
}
|
|
|
|
|
2006-08-26 20:09:54 +00:00
|
|
|
void ass_glyph_cache_reset(void)
|
2006-08-26 19:00:21 +00:00
|
|
|
{
|
2006-08-26 20:09:54 +00:00
|
|
|
ass_glyph_cache_done();
|
|
|
|
ass_glyph_cache_init();
|
2006-08-26 19:00:21 +00:00
|
|
|
}
|
|
|
|
|