1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/os/textandloc/fontservices/textshaperplugin/source/FontTableCache.cpp Fri Jun 15 03:10:57 2012 +0200
1.3 @@ -0,0 +1,93 @@
1.4 +/*
1.5 + **********************************************************************
1.6 + * Copyright (C) 2003, International Business Machines
1.7 + * Corporation and others. All Rights Reserved.
1.8 + **********************************************************************
1.9 + */
1.10 +
1.11 +#include "layout/LETypes.h"
1.12 +
1.13 +#include "FontTableCache.h"
1.14 +
1.15 +#define TABLE_CACHE_INIT 5
1.16 +#define TABLE_CACHE_GROW 5
1.17 +
1.18 +struct FontTableCacheEntry
1.19 +{
1.20 + LETag tag;
1.21 + const void *table;
1.22 +};
1.23 +
1.24 +FontTableCache::FontTableCache()
1.25 + : fTableCacheCurr(0), fTableCacheSize(TABLE_CACHE_INIT)
1.26 +{
1.27 + fTableCache = LE_NEW_ARRAY(FontTableCacheEntry, fTableCacheSize);
1.28 +
1.29 + if (fTableCache == NULL) {
1.30 + fTableCacheSize = 0;
1.31 + return;
1.32 + }
1.33 +
1.34 + for (int i = 0; i < fTableCacheSize; i += 1) {
1.35 + fTableCache[i].tag = 0;
1.36 + fTableCache[i].table = NULL;
1.37 + }
1.38 +}
1.39 +
1.40 +FontTableCache::~FontTableCache()
1.41 +{
1.42 + for (int i = fTableCacheCurr - 1; i >= 0; i -= 1) {
1.43 + LE_DELETE_ARRAY(fTableCache[i].table);
1.44 +
1.45 + fTableCache[i].tag = 0;
1.46 + fTableCache[i].table = NULL;
1.47 + }
1.48 +
1.49 + fTableCacheCurr = 0;
1.50 + /* Nokia defect fix for memory leak - Jas: 23/06/2005 */
1.51 + LE_DELETE_ARRAY(fTableCache);
1.52 +}
1.53 +
1.54 +const void *FontTableCache::find(LETag tableTag) const
1.55 +{
1.56 + for (int i = 0; i < fTableCacheCurr; i += 1) {
1.57 + if (fTableCache[i].tag == tableTag) {
1.58 + return fTableCache[i].table;
1.59 + }
1.60 + }
1.61 +
1.62 + const void *table = readFontTable(tableTag);
1.63 +
1.64 + if (table) {
1.65 + ((FontTableCache *) this)->add(tableTag, table);
1.66 + }
1.67 +
1.68 + return table;
1.69 +}
1.70 +
1.71 +void FontTableCache::add(LETag tableTag, const void *table)
1.72 +{
1.73 + if (fTableCacheCurr >= fTableCacheSize) {
1.74 + le_int32 newSize = fTableCacheSize + TABLE_CACHE_GROW;
1.75 +
1.76 + FontTableCacheEntry *newTableCache =
1.77 + (FontTableCacheEntry *) LE_GROW_ARRAY(fTableCache, newSize);
1.78 + if (!newTableCache) {
1.79 + // could not grow the cache, so we won't cache the table.
1.80 + return;
1.81 + }
1.82 + fTableCache = newTableCache;
1.83 +
1.84 + for (le_int32 i = fTableCacheSize; i < newSize; i += 1) {
1.85 + fTableCache[i].tag = 0;
1.86 + fTableCache[i].table = NULL;
1.87 + }
1.88 +
1.89 + fTableCacheSize = newSize;
1.90 + }
1.91 +
1.92 + fTableCache[fTableCacheCurr].tag = tableTag;
1.93 + fTableCache[fTableCacheCurr].table = table;
1.94 +
1.95 + fTableCacheCurr += 1;
1.96 +}