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
|
/**************************************************************************/
/* */
/* Copyright (c) 2001, 2011 NoMachine (http://www.nomachine.com) */
/* Copyright (c) 2008-2017 Oleksandr Shneyder <o.shneyder@phoca-gmbh.de> */
/* Copyright (c) 2014-2022 Ulrich Sibiller <uli42@gmx.de> */
/* Copyright (c) 2014-2019 Mihai Moldovan <ionic@ionic.de> */
/* Copyright (c) 2011-2022 Mike Gabriel <mike.gabriel@das-netzwerkteam.de>*/
/* Copyright (c) 2015-2016 Qindel Group (http://www.qindel.com) */
/* */
/* NXCOMP, NX protocol compression and NX extensions to this software */
/* are copyright of the aforementioned persons and companies. */
/* */
/* Redistribution and use of the present software is allowed according */
/* to terms specified in the file LICENSE.nxcomp which comes in the */
/* source distribution. */
/* */
/* All rights reserved. */
/* */
/* NOTE: This software has received contributions from various other */
/* contributors, only the core maintainers and supporters are listed as */
/* copyright holders. Please contact us, if you feel you should be listed */
/* as copyright holder, as well. */
/* */
/**************************************************************************/
#ifndef IntCache_H
#define IntCache_H
class IntCache
{
public:
IntCache(unsigned int size);
~IntCache()
{
delete [] buffer_;
}
unsigned int getSize() const
{
return length_;
}
int lookup(unsigned int &value, unsigned int &index,
unsigned int mask, unsigned int &sameDiff);
//
// This can be inlined as it is only
// called by decodeCachedValue().
//
unsigned int get(unsigned int index)
{
unsigned int result = buffer_[index];
if (index != 0)
{
//
// Using a memmove() appears to be slower.
//
// unsigned int target = index >> 1;
//
// memmove((char *) &buffer_[target + 1], (char *) &buffer_[target],
// sizeof(unsigned int) * (index - target));
//
// buffer_[target] = result;
//
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 insert(unsigned int &value, unsigned int mask);
void push(unsigned int &value, unsigned int mask);
void dump();
unsigned int getLastDiff(unsigned int mask) const
{
return lastDiff_;
}
unsigned int getBlockSize(unsigned int bits) const
{
if (bits > 0)
{
return (predictedBlockSize_ < bits ? predictedBlockSize_ : bits);
}
return predictedBlockSize_;
}
private:
unsigned int size_;
unsigned int length_;
unsigned int *buffer_;
unsigned int lastDiff_;
unsigned int lastValueInserted_;
unsigned int predictedBlockSize_;
};
#endif /* IntCache_H */
|
