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
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
|
// Emacs style mode select -*- C++ -*-
//-----------------------------------------------------------------------------
//
// $Id: deh_text.c 160 2005-10-03 21:39:39Z fraggle $
//
// Copyright(C) 2005 Simon Howard
//
// 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., 59 Temple Place - Suite 330, Boston, MA
// 02111-1307, USA.
//
// $Log$
// Revision 1.3 2005/10/03 21:39:39 fraggle
// Dehacked text substitutions
//
// Revision 1.2 2005/10/03 11:08:16 fraggle
// Replace end of section functions with NULLs as they arent currently being
// used for anything.
//
// Revision 1.1 2005/10/02 23:49:01 fraggle
// The beginnings of dehacked support
//
//
//-----------------------------------------------------------------------------
//
// Parses Text substitution sections in dehacked files
//
//-----------------------------------------------------------------------------
#include "doomdef.h"
#include "doomtype.h"
#include "z_zone.h"
#include "deh_defs.h"
#include "deh_io.h"
typedef struct
{
char *from_text;
char *to_text;
} deh_substitution_t;
static deh_substitution_t **hash_table;
static int hash_table_entries;
static int hash_table_length;
// This is the algorithm used by glib
static unsigned int strhash(char *s)
{
char *p = s;
unsigned int h = *p;
if (h)
{
for (p += 1; *p; p++)
h = (h << 5) - h + *p;
}
return h;
}
// Look up a string to see if it has been replaced with something else
// This will be used throughout the program to substitute text
char *DEH_String(char *s)
{
int entry;
entry = strhash(s) % hash_table_length;
while (hash_table[entry] != NULL)
{
if (!strcmp(hash_table[entry]->from_text, s))
{
// substitution found!
return hash_table[entry]->to_text;
}
entry = (entry + 1) % hash_table_length;
}
// no substitution found
return s;
}
static void DEH_AddToHashtable(deh_substitution_t *sub);
static void IncreaseHashtable(void)
{
deh_substitution_t **old_table;
int old_table_length;
int i;
// save the old table
old_table = hash_table;
old_table_length = hash_table_length;
// double the size
hash_table_length *= 2;
hash_table = Z_Malloc(sizeof(deh_substitution_t *) * hash_table_length,
PU_STATIC, NULL);
memset(hash_table, 0, sizeof(deh_substitution_t *) * hash_table_length);
// go through the old table and insert all the old entries
for (i=0; i<old_table_length; ++i)
{
if (old_table[i] != NULL)
{
DEH_AddToHashtable(old_table[i]);
}
}
// free the old table
Z_Free(old_table);
}
static void DEH_AddToHashtable(deh_substitution_t *sub)
{
int entry;
// if the hash table is more than 60% full, increase its size
if ((hash_table_entries * 10) / hash_table_length > 6)
{
IncreaseHashtable();
}
// find where to insert it
entry = strhash(sub->from_text) % hash_table_length;
while (hash_table[entry] != NULL)
{
entry = (entry + 1) % hash_table_length;
}
hash_table[entry] = sub;
++hash_table_entries;
}
static void DEH_TextInit(void)
{
// init hash table
hash_table_entries = 0;
hash_table_length = 16;
hash_table = Z_Malloc(sizeof(deh_substitution_t *) * hash_table_length,
PU_STATIC, NULL);
memset(hash_table, 0, sizeof(deh_substitution_t *) * hash_table_length);
}
static void *DEH_TextStart(deh_context_t *context, char *line)
{
deh_substitution_t *sub;
int fromlen, tolen;
int i;
sscanf(line, "Text %i %i", &fromlen, &tolen);
sub = Z_Malloc(sizeof(deh_substitution_t), PU_STATIC, NULL);
sub->from_text = Z_Malloc(fromlen + 1, PU_STATIC, NULL);
sub->to_text = Z_Malloc(tolen + 1, PU_STATIC, NULL);
// read in the "from" text
for (i=0; i<fromlen; ++i)
{
int c;
c = DEH_GetChar(context);
sub->from_text[i] = c;
}
sub->from_text[fromlen] = '\0';
// read in the "to" text
for (i=0; i<tolen; ++i)
{
int c;
c = DEH_GetChar(context);
sub->to_text[i] = c;
}
sub->to_text[tolen] = '\0';
DEH_AddToHashtable(sub);
return NULL;
}
static void DEH_TextParseLine(deh_context_t *context, char *line, void *tag)
{
// not used
}
deh_section_t deh_section_text =
{
"Text",
DEH_TextInit,
DEH_TextStart,
DEH_TextParseLine,
NULL,
};
|
