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
|
#include "IntCache.H"
IntCache::IntCache(unsigned int size):
size_(size), length_(0), buffer_(new unsigned int[size]),
lastValueInserted_(0), lastDiff_(0), predictedBlockSize_(0)
{
}
int
IntCache::lookup(unsigned int &value, unsigned int &index, unsigned int mask,
unsigned int &sameDiff)
{
for (unsigned int i = 0; i < length_; i++)
if (value == buffer_[i])
{
index = i;
if (i)
{
unsigned int target = (i >> 1);
do
{
buffer_[i] = buffer_[i - 1];
i--;
}
while (i > target);
buffer_[target] = value;
}
return 1;
}
unsigned int insertionPoint;
if (2 >= length_)
insertionPoint = length_;
else
insertionPoint = 2;
unsigned int start;
if (length_ >= size_)
start = size_ - 1;
else
{
start = length_;
length_++;
}
for (unsigned int k = start; k > insertionPoint; k--)
buffer_[k] = buffer_[k - 1];
buffer_[insertionPoint] = value;
unsigned int diff = value - lastValueInserted_;
lastValueInserted_ = (value & mask);
value = (diff & mask);
sameDiff = (value == lastDiff_);
if (!sameDiff)
{
lastDiff_ = value;
unsigned int lastChangeIndex = 0;
unsigned int lastBitIsOne = (lastDiff_ & 0x1);
unsigned int j = 1;
for (unsigned int nextMask = 0x2; nextMask & mask; nextMask <<= 1)
{
unsigned int nextBitIsOne = (lastDiff_ & nextMask);
if (nextBitIsOne)
{
if (!lastBitIsOne)
{
lastChangeIndex = j;
lastBitIsOne = nextBitIsOne;
}
}
else
{
if (lastBitIsOne)
{
lastChangeIndex = j;
lastBitIsOne = nextBitIsOne;
}
}
j++;
}
predictedBlockSize_ = lastChangeIndex + 1;
if (predictedBlockSize_ < 2)
predictedBlockSize_ = 2;
}
return 0;
}
unsigned int
IntCache::get(unsigned int index)
{
unsigned int result = buffer_[index];
if (index != 0)
{
unsigned int i = index;
unsigned int target = (i >> 1);
do
{
buffer_[i] = buffer_[i - 1];
i--;
}
while (i > target);
buffer_[target] = result;
}
return result;
}
void
IntCache::insert(unsigned int &value, unsigned int mask)
{
unsigned int insertionPoint;
if (2 >= length_)
insertionPoint = length_;
else
insertionPoint = 2;
unsigned int start;
if (length_ >= size_)
start = size_ - 1;
else
{
start = length_;
length_++;
}
for (unsigned int k = start; k > insertionPoint; k--)
buffer_[k] = buffer_[k - 1];
if (lastDiff_ != value)
{
lastDiff_ = value;
unsigned int lastChangeIndex = 0;
unsigned int lastBitIsOne = (lastDiff_ & 0x1);
unsigned int j = 1;
for (unsigned int nextMask = 0x2; nextMask & mask; nextMask <<= 1)
{
unsigned int nextBitIsOne = (lastDiff_ & nextMask);
if (nextBitIsOne)
{
if (!lastBitIsOne)
{
lastChangeIndex = j;
lastBitIsOne = nextBitIsOne;
}
}
else
{
if (lastBitIsOne)
{
lastChangeIndex = j;
lastBitIsOne = nextBitIsOne;
}
}
j++;
}
predictedBlockSize_ = lastChangeIndex + 1;
if (predictedBlockSize_ < 2)
predictedBlockSize_ = 2;
}
lastValueInserted_ += value;
lastValueInserted_ &= mask;
buffer_[insertionPoint] = lastValueInserted_;
value = lastValueInserted_;
}
|
