]>
Commit | Line | Data |
---|---|---|
b75a7d8f A |
1 | /* |
2 | ********************************************************************** | |
73c04bcf | 3 | * Copyright (C) 2003-2006, International Business Machines |
b75a7d8f A |
4 | * Corporation and others. All Rights Reserved. |
5 | ********************************************************************** | |
6 | */ | |
7 | ||
8 | #include "layout/LETypes.h" | |
9 | ||
73c04bcf | 10 | #include "letest.h" |
b75a7d8f A |
11 | #include "FontTableCache.h" |
12 | ||
13 | #define TABLE_CACHE_INIT 5 | |
14 | #define TABLE_CACHE_GROW 5 | |
15 | ||
16 | struct FontTableCacheEntry | |
17 | { | |
18 | LETag tag; | |
19 | const void *table; | |
20 | }; | |
21 | ||
22 | FontTableCache::FontTableCache() | |
23 | : fTableCacheCurr(0), fTableCacheSize(TABLE_CACHE_INIT) | |
24 | { | |
73c04bcf | 25 | fTableCache = NEW_ARRAY(FontTableCacheEntry, fTableCacheSize); |
b75a7d8f A |
26 | |
27 | if (fTableCache == NULL) { | |
28 | fTableCacheSize = 0; | |
29 | return; | |
30 | } | |
31 | ||
32 | for (int i = 0; i < fTableCacheSize; i += 1) { | |
33 | fTableCache[i].tag = 0; | |
34 | fTableCache[i].table = NULL; | |
35 | } | |
36 | } | |
37 | ||
38 | FontTableCache::~FontTableCache() | |
39 | { | |
40 | for (int i = fTableCacheCurr - 1; i >= 0; i -= 1) { | |
73c04bcf | 41 | DELETE_ARRAY(fTableCache[i].table); |
b75a7d8f A |
42 | |
43 | fTableCache[i].tag = 0; | |
44 | fTableCache[i].table = NULL; | |
45 | } | |
46 | ||
47 | fTableCacheCurr = 0; | |
73c04bcf A |
48 | |
49 | DELETE_ARRAY(fTableCache); | |
b75a7d8f A |
50 | } |
51 | ||
52 | const void *FontTableCache::find(LETag tableTag) const | |
53 | { | |
54 | for (int i = 0; i < fTableCacheCurr; i += 1) { | |
55 | if (fTableCache[i].tag == tableTag) { | |
56 | return fTableCache[i].table; | |
57 | } | |
58 | } | |
59 | ||
60 | const void *table = readFontTable(tableTag); | |
61 | ||
62 | ((FontTableCache *) this)->add(tableTag, table); | |
63 | ||
64 | return table; | |
65 | } | |
66 | ||
67 | void FontTableCache::add(LETag tableTag, const void *table) | |
68 | { | |
69 | if (fTableCacheCurr >= fTableCacheSize) { | |
70 | le_int32 newSize = fTableCacheSize + TABLE_CACHE_GROW; | |
71 | ||
73c04bcf | 72 | fTableCache = (FontTableCacheEntry *) GROW_ARRAY(fTableCache, newSize); |
b75a7d8f A |
73 | |
74 | for (le_int32 i = fTableCacheSize; i < newSize; i += 1) { | |
75 | fTableCache[i].tag = 0; | |
76 | fTableCache[i].table = NULL; | |
77 | } | |
78 | ||
79 | fTableCacheSize = newSize; | |
80 | } | |
81 | ||
82 | fTableCache[fTableCacheCurr].tag = tableTag; | |
83 | fTableCache[fTableCacheCurr].table = table; | |
84 | ||
85 | fTableCacheCurr += 1; | |
86 | } |