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
164
165
166
167
168
169
170
171
172
173
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* This program 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 program 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 program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
* $URL$
* $Id$
*
*/
#include "sci/engine/intmap.h"
namespace Sci {
#define HASH(x) (x & 0xff)
IntMapper::IntMapper() {
base_value = 0;
memset(nodes, 0, sizeof(nodes));
holes = 0;
}
void IntMapper::free_node_recursive(Node *node) {
if (node) {
free_node_recursive(node->next);
node->next = 0;
free(node);
}
}
IntMapper::~IntMapper() {
clear();
// Trigger problems for people who forget to loose the reference
base_value = -42000;
}
void IntMapper::clear() {
for (int i = 0; i < DCS_INT_HASH_MAX; i++) {
free_node_recursive(nodes[i]);
nodes[i] = 0;
}
free_node_recursive(holes);
holes = 0;
}
int IntMapper::checkKey(int key, bool add, bool *was_added) {
Node **node = &(nodes[HASH(key)]);
while (*node && (key != (*node)->key))
node = &((*node)->next);
if (was_added)
*was_added = false;
if (*node)
return (*node)->idx;
// Not found
if (!add)
return -1;
if (was_added)
*was_added = true;
if (holes) { // Re-use old node
(*node) = holes;
holes = (*node)->next;
(*node)->next = NULL;
(*node)->key = key;
} else {
*node = (Node*)malloc(sizeof(Node));
(*node)->key = key;
(*node)->idx = base_value++;
(*node)->next = NULL;
}
return (*node)->idx;
}
int IntMapper::lookupKey(int key) const {
Node *const *node = &(nodes[HASH(key)]);
while (*node && (key != (*node)->key))
node = &((*node)->next);
if (*node)
return (*node)->idx;
return -1;
}
void IntMapper::saveLoadWithSerializer(Common::Serializer &s) {
s.syncAsSint32LE(base_value);
if (s.isLoading()) {
uint32 key, idx;
clear();
while (true) {
s.syncAsSint32LE(key);
if (key == 0xDEADBEEF)
break;
s.syncAsSint32LE(idx);
// Insert into the IntMapper
insert(key, idx);
}
} else {
// Just write out all mapped pairs
// We terminate by writing 4 times the value 0xFF
for (int i = 0; i < DCS_INT_HASH_MAX; ++i) {
Node *node = nodes[i];
while (node) {
s.syncAsSint32LE(node->key);
s.syncAsSint32LE(node->idx);
node = node->next;
}
}
uint32 tmp = 0xDEADBEEF;
s.syncAsSint32LE(tmp);
}
}
void IntMapper::insert(int key, int idx) {
Node **node = &(nodes[HASH(key)]);
while (*node && (key != (*node)->key))
node = &((*node)->next);
assert(0 == *node); // Error out if the key was already present.
*node = (Node*)malloc(sizeof(Node));
(*node)->key = key;
(*node)->idx = idx;
(*node)->next = NULL;
}
int IntMapper::removeKey(int key) {
Node **node = &(nodes[HASH(key)]);
while (*node && (key != (*node)->key))
node = &((*node)->next);
if (*node) {
Node *oldnode = *node;
*node = (*node)->next;
oldnode->next = holes; // Old node is now a 'hole'
holes = oldnode;
return oldnode->key;
} else
return -1; // Not found
}
} // End of namespace Sci
|
