Mercurial > mplayer.hg
view libass/ass_cache.h @ 31987:e91e0249e2fd
Remove useless ifdef.
author | reimar |
---|---|
date | Wed, 08 Sep 2010 17:47:26 +0000 |
parents | 48d020c5ceca |
children | 88eebbbbd6a0 |
line wrap: on
line source
/* * Copyright (C) 2006 Evgeniy Stepanov <eugeni.stepanov@gmail.com> * * This file is part of libass. * * libass 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. * * libass 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 libass; if not, write to the Free Software Foundation, Inc., * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. */ #ifndef LIBASS_CACHE_H #define LIBASS_CACHE_H #include "ass.h" #include "ass_font.h" #include "ass_bitmap.h" typedef void (*HashmapItemDtor) (void *key, size_t key_size, void *value, size_t value_size); typedef int (*HashmapKeyCompare) (void *key1, void *key2, size_t key_size); typedef unsigned (*HashmapHash) (void *key, size_t key_size); typedef struct hashmap_item { void *key; void *value; struct hashmap_item *next; } HashmapItem; typedef HashmapItem *hashmap_item_p; typedef struct { int nbuckets; size_t key_size, value_size; hashmap_item_p *root; HashmapItemDtor item_dtor; // a destructor for hashmap key/value pairs HashmapKeyCompare key_compare; HashmapHash hash; size_t cache_size; // stats int hit_count; int miss_count; int count; ASS_Library *library; } Hashmap; Hashmap *hashmap_init(ASS_Library *library, size_t key_size, size_t value_size, int nbuckets, HashmapItemDtor item_dtor, HashmapKeyCompare key_compare, HashmapHash hash); void hashmap_done(Hashmap *map); void *hashmap_insert(Hashmap *map, void *key, void *value); void *hashmap_find(Hashmap *map, void *key); Hashmap *ass_font_cache_init(ASS_Library *library); ASS_Font *ass_font_cache_find(Hashmap *, ASS_FontDesc *desc); void *ass_font_cache_add(Hashmap *, ASS_Font *font); void ass_font_cache_done(Hashmap *); // Create definitions for bitmap_hash_key and glyph_hash_key #define CREATE_STRUCT_DEFINITIONS #include "ass_cache_template.h" typedef struct { Bitmap *bm; // the actual bitmaps Bitmap *bm_o; Bitmap *bm_s; } BitmapHashValue; Hashmap *ass_bitmap_cache_init(ASS_Library *library); void *cache_add_bitmap(Hashmap *, BitmapHashKey *key, BitmapHashValue *val); BitmapHashValue *cache_find_bitmap(Hashmap *bitmap_cache, BitmapHashKey *key); Hashmap *ass_bitmap_cache_reset(Hashmap *bitmap_cache); void ass_bitmap_cache_done(Hashmap *bitmap_cache); typedef struct { unsigned char *a; unsigned char *b; } CompositeHashValue; Hashmap *ass_composite_cache_init(ASS_Library *library); void *cache_add_composite(Hashmap *, CompositeHashKey *key, CompositeHashValue *val); CompositeHashValue *cache_find_composite(Hashmap *composite_cache, CompositeHashKey *key); Hashmap *ass_composite_cache_reset(Hashmap *composite_cache); void ass_composite_cache_done(Hashmap *composite_cache); typedef struct { FT_Glyph glyph; FT_Glyph outline_glyph; FT_BBox bbox_scaled; // bbox after scaling, but before rotation FT_Vector advance; // 26.6, advance distance to the next bitmap in line int asc, desc; // ascender/descender of a drawing } GlyphHashValue; Hashmap *ass_glyph_cache_init(ASS_Library *library); void *cache_add_glyph(Hashmap *, GlyphHashKey *key, GlyphHashValue *val); GlyphHashValue *cache_find_glyph(Hashmap *glyph_cache, GlyphHashKey *key); Hashmap *ass_glyph_cache_reset(Hashmap *glyph_cache); void ass_glyph_cache_done(Hashmap *glyph_cache); #endif /* LIBASS_CACHE_H */