1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
|
//========================================================================
//
// PopplerCache.h
//
// This file is licensed under the GPLv2 or later
//
// Copyright (C) 2009 Koji Otani <sho@bbr.jp>
// Copyright (C) 2009, 2010 Albert Astals Cid <aacid@kde.org>
// Copyright (C) 2010 Carlos Garcia Campos <carlosgc@gnome.org>
//
//========================================================================
#include "PopplerCache.h"
#include "XRef.h"
PopplerCacheKey::~PopplerCacheKey()
{
}
PopplerCacheItem::~PopplerCacheItem()
{
}
PopplerCache::PopplerCache(int cacheSizeA)
{
cacheSize = cacheSizeA;
keys = new PopplerCacheKey*[cacheSize];
items = new PopplerCacheItem*[cacheSize];
lastValidCacheIndex = -1;
}
PopplerCache::~PopplerCache()
{
for (int i = 0; i <= lastValidCacheIndex; ++i) {
delete keys[i];
delete items[i];
}
delete[] keys;
delete[] items;
}
PopplerCacheItem *PopplerCache::lookup(const PopplerCacheKey &key)
{
if (lastValidCacheIndex < 0)
return 0;
if (*keys[0] == key) {
return items[0];
}
for (int i = 1; i <= lastValidCacheIndex; i++) {
if (*keys[i] == key) {
PopplerCacheKey *keyHit = keys[i];
PopplerCacheItem *itemHit = items[i];
for (int j = i; j > 0; j--) {
keys[j] = keys[j - 1];
items[j] = items[j - 1];
}
keys[0] = keyHit;
items[0] = itemHit;
return itemHit;
}
}
return 0;
}
void PopplerCache::put(PopplerCacheKey *key, PopplerCacheItem *item)
{
int movingStartIndex = lastValidCacheIndex + 1;
if (lastValidCacheIndex == cacheSize - 1) {
delete keys[lastValidCacheIndex];
delete items[lastValidCacheIndex];
movingStartIndex = cacheSize - 1;
} else {
lastValidCacheIndex++;
}
for (int i = movingStartIndex; i > 0; i--) {
keys[i] = keys[i - 1];
items[i] = items[i - 1];
}
keys[0] = key;
items[0] = item;
}
int PopplerCache::size()
{
return cacheSize;
}
int PopplerCache::numberOfItems()
{
return lastValidCacheIndex + 1;
}
PopplerCacheItem *PopplerCache::item(int index)
{
return items[index];
}
PopplerCacheKey *PopplerCache::key(int index)
{
return keys[index];
}
class ObjectKey : public PopplerCacheKey {
public:
ObjectKey(int numA, int genA) : num(numA), gen(genA)
{
}
bool operator==(const PopplerCacheKey &key) const
{
const ObjectKey *k = static_cast<const ObjectKey*>(&key);
return k->num == num && k->gen == gen;
}
int num, gen;
};
class ObjectItem : public PopplerCacheItem {
public:
ObjectItem(Object *obj)
{
obj->copy(&item);
}
~ObjectItem()
{
item.free();
}
Object item;
};
PopplerObjectCache::PopplerObjectCache(int cacheSize, XRef *xrefA) {
cache = new PopplerCache (cacheSize);
xref = xrefA;
}
PopplerObjectCache::~PopplerObjectCache() {
delete cache;
}
Object *PopplerObjectCache::put(const Ref &ref) {
Object obj;
xref->fetch(ref.num, ref.gen, &obj);
ObjectKey *key = new ObjectKey(ref.num, ref.gen);
ObjectItem *item = new ObjectItem(&obj);
cache->put(key, item);
obj.free();
return &item->item;
}
Object *PopplerObjectCache::lookup(const Ref &ref, Object *obj) {
ObjectKey key(ref.num, ref.gen);
ObjectItem *item = static_cast<ObjectItem *>(cache->lookup(key));
return item ? item->item.copy(obj) : obj->initNull();
}
|
