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
|
/* Copyright (C) 2000-2005 Constantin Kaplinsky. All Rights Reserved.
*
* This is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This software is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this software; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
* USA.
*/
//
// TightPalette class implementation.
//
#include <rfb/TightPalette.h>
using namespace rfb;
TightPalette::TightPalette(int maxColors)
{
setMaxColors(maxColors);
reset();
}
void TightPalette::reset()
{
m_numColors = 0;
memset(m_hash, 0, 256 * sizeof(TightColorList *));
}
void TightPalette::setMaxColors(int maxColors)
{
m_maxColors = maxColors;
if (m_maxColors < 0) {
m_maxColors = 0;
} else if (m_maxColors > 254) {
m_maxColors = 254;
}
}
int TightPalette::insert(rdr::U32 rgb, int numPixels)
{
TightColorList *pnode;
TightColorList *prev_pnode = NULL;
int hash_key, idx, new_idx, count;
hash_key = hashFunc(rgb);
pnode = m_hash[hash_key];
while (pnode != NULL) {
if (pnode->rgb == rgb) {
// Such palette entry already exists.
new_idx = idx = pnode->idx;
count = m_entry[idx].numPixels + numPixels;
if (new_idx && m_entry[new_idx-1].numPixels < count) {
do {
m_entry[new_idx] = m_entry[new_idx-1];
m_entry[new_idx].listNode->idx = new_idx;
new_idx--;
}
while (new_idx && m_entry[new_idx-1].numPixels < count);
m_entry[new_idx].listNode = pnode;
pnode->idx = new_idx;
}
m_entry[new_idx].numPixels = count;
return m_numColors;
}
prev_pnode = pnode;
pnode = pnode->next;
}
// Check if the palette is full.
if (m_numColors == 256 || m_numColors == m_maxColors) {
m_numColors = 0;
return 0;
}
// Move palette entries with lesser pixel counts.
for ( idx = m_numColors;
idx > 0 && m_entry[idx-1].numPixels < numPixels;
idx-- ) {
m_entry[idx] = m_entry[idx-1];
m_entry[idx].listNode->idx = idx;
}
// Add new palette entry into the freed slot.
pnode = &m_list[m_numColors];
if (prev_pnode != NULL) {
prev_pnode->next = pnode;
} else {
m_hash[hash_key] = pnode;
}
pnode->next = NULL;
pnode->idx = idx;
pnode->rgb = rgb;
m_entry[idx].listNode = pnode;
m_entry[idx].numPixels = numPixels;
return ++m_numColors;
}
|
