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
|
#include <iostream.h>
#include "BlockCacheSet.H"
BlockCacheSet::BlockCacheSet(unsigned int numCaches):
caches_(new BlockCache *[numCaches]), size_(numCaches),
length_(0)
{
for (unsigned int i = 0; i < numCaches; i++)
caches_[i] = new BlockCache();
}
BlockCacheSet::~BlockCacheSet()
{
for (unsigned int i = 0; i < size_; i++)
delete caches_[i];
delete[]caches_;
}
int
BlockCacheSet::lookup(unsigned int dataLength, const unsigned char *data,
unsigned int &index)
{
unsigned int checksum = BlockCache::checksum(dataLength, data);
for (unsigned int i = 0; i < length_; i++)
if ((caches_[i]->getChecksum() == checksum) &&
(caches_[i]->compare(dataLength, data, 0)))
{
// match
index = i;
if (i)
{
BlockCache *save = caches_[i];
unsigned int target = (i >> 1);
do
{
caches_[i] = caches_[i - 1];
i--;
}
while (i > target);
caches_[target] = save;
}
return 1;
}
// no match
unsigned int insertionPoint = (length_ >> 1);
unsigned int start;
if (length_ >= size_)
start = size_ - 1;
else
{
start = length_;
length_++;
}
BlockCache *save = caches_[start];
for (unsigned int k = start; k > insertionPoint; k--)
caches_[k] = caches_[k - 1];
caches_[insertionPoint] = save;
save->set(dataLength, data);
return 0;
}
void
BlockCacheSet::get(unsigned index, unsigned int &size,
const unsigned char *&data)
{
size = caches_[index]->getLength();
data = caches_[index]->getData();
if (index)
{
BlockCache *save = caches_[index];
unsigned int target = (index >> 1);
do
{
caches_[index] = caches_[index - 1];
index--;
}
while (index > target);
caches_[target] = save;
}
}
void
BlockCacheSet::set(unsigned int dataLength, const unsigned char *data)
{
unsigned int insertionPoint = (length_ >> 1);
unsigned int start;
if (length_ >= size_)
start = size_ - 1;
else
{
start = length_;
length_++;
}
BlockCache *save = caches_[start];
for (unsigned int k = start; k > insertionPoint; k--)
caches_[k] = caches_[k - 1];
caches_[insertionPoint] = save;
save->set(dataLength, data);
}
|
