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
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
|
/* 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.
*
* This is a utility for create the translations.dat file from all the po files.
* The generated files is used by ScummVM to propose translation of its GUI.
*/
#include "create_translations.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <vector>
// HACK to allow building with the SDL backend on MinGW
// see bug #1800764 "TOOLS: MinGW tools building broken"
#ifdef main
#undef main
#endif // main
#include "po_parser.h"
#include "cp_parser.h"
#define TRANSLATIONS_DAT_VER 3 // 1 byte
// Portable implementation of stricmp / strcasecmp / strcmpi.
int scumm_stricmp(const char *s1, const char *s2) {
uint8 l1, l2;
do {
// Don't use ++ inside tolower, in case the macro uses its
// arguments more than once.
l1 = (uint8)*s1++;
l1 = tolower(l1);
l2 = (uint8)*s2++;
l2 = tolower(l2);
} while (l1 == l2 && l1 != 0);
return l1 - l2;
}
// Padding buffer (filled with 0) used if we want to aligned writes
// static uint8 padBuf[DATAALIGNMENT];
// Utility functions
// Some of the function are very simple but are factored out so that it would require
// minor modifications if we want for example to aligne writes on 4 bytes.
void writeByte(FILE *fp, uint8 b) {
fwrite(&b, 1, 1, fp);
}
void writeUint16BE(FILE *fp, uint16 value) {
writeByte(fp, (uint8)(value >> 8));
writeByte(fp, (uint8)(value & 0xFF));
}
void writeUint32BE(FILE *fp, uint32 value) {
writeByte(fp, (uint8)(value >> 24));
writeByte(fp, (uint8)(value >> 16));
writeByte(fp, (uint8)(value >> 8));
writeByte(fp, (uint8)(value & 0xFF));
}
int stringSize(const char *string) {
// Each string is preceded by its size coded on 2 bytes
if (string == NULL)
return 2;
int len = strlen(string) + 1;
return 2 + len;
// The two lines below are an example if we want to align string writes
// pad = DATAALIGNMENT - (len + 2) % DATAALIGNMENT;
// return 2 + len + pad;
}
void writeString(FILE *fp, const char *string) {
// Each string is preceded by its size coded on 2 bytes
if (string == NULL) {
writeUint16BE(fp, 0);
return;
}
int len = strlen(string) + 1;
writeUint16BE(fp, len);
fwrite(string, len, 1, fp);
// The commented lines below are an example if we want to align string writes
// It replaces the two lines above.
// int pad = DATAALIGNMENT - (len + 2) % DATAALIGNMENT;
// writeUint16BE(fp, len + pad);
// fwrite(string, len, 1, fp);
// fwrite(padBuf, pad, 1, fp);
}
// Main
int main(int argc, char *argv[]) {
std::vector<Codepage *> codepages;
// Add default codepages, we won't store them in the output later on
codepages.push_back(new Codepage("ascii", 0));
codepages.push_back(new Codepage("iso-8859-1", 0));
// Build the translation and codepage list
PoMessageList messageIds;
std::vector<PoMessageEntryList *> translations;
int numLangs = 0;
for (int i = 1; i < argc; ++i) {
// Check file extension
int len = strlen(argv[i]);
if (scumm_stricmp(argv[i] + len - 2, "po") == 0) {
PoMessageEntryList *po = parsePoFile(argv[i], messageIds);
if (po != NULL) {
translations.push_back(po);
++numLangs;
}
} else if (scumm_stricmp(argv[i] + len - 2, "cp") == 0) {
// Else try to parse an codepage
Codepage *co = parseCodepageMapping(argv[i]);
if (co)
codepages.push_back(co);
}
}
// Parse all charset mappings
for (int i = 0; i < numLangs; ++i) {
bool found = false;
for (size_t j = 0; j < codepages.size(); ++j) {
if (scumm_stricmp(codepages[j]->getName().c_str(), translations[i]->charset()) == 0) {
found = true;
break;
}
}
// In case the codepage was not found error out
if (!found) {
fprintf(stderr, "ERROR: No codepage mapping for codepage \"%s\" present!\n", translations[i]->charset());
for (size_t j = 0; j < translations.size(); ++j)
delete translations[j];
for (size_t j = 0; j < codepages.size(); ++j)
delete codepages[j];
return -1;
}
}
FILE *outFile;
int i, lang;
int len;
// Padding buffer initialization (filled with 0)
// used if we want to aligned writes
// for (i = 0; i < DATAALIGNMENT; i++)
// padBuf[i] = 0;
outFile = fopen("translations.dat", "wb");
// Write header
fwrite("TRANSLATIONS", 12, 1, outFile);
writeByte(outFile, TRANSLATIONS_DAT_VER);
// Write number of translations
writeUint16BE(outFile, numLangs);
// Write number of codepages, we don't save ascii and iso-8859-1
writeUint16BE(outFile, codepages.size() - 2);
// Write the length of each data block here.
// We could write it at the start of each block but that would mean that
// to go to block 4 we would have to go at the start of each preceding block,
// read its size and skip it until we arrive at the block we want.
// By having all the sizes at the start we just need to read the start of the
// file and can then skip to the block we want.
// Blocks are:
// 1. List of languages with the language name
// 2. List of codepages
// 3. Original messages (i.e. english)
// 4. First translation
// 5. Second translation
// ...
// n. First codepage (These don't have any data size, since they are all
// 256 * 4 bytes long)
// n+1. Second codepage
// ...
// Write length for translation description
len = 0;
for (lang = 0; lang < numLangs; lang++) {
len += stringSize(translations[lang]->language());
len += stringSize(translations[lang]->languageName());
}
writeUint16BE(outFile, len);
// Write length for the codepage names
len = 0;
for (size_t j = 2; j < codepages.size(); ++j)
len += stringSize(codepages[j]->getName().c_str());
writeUint16BE(outFile, len);
// Write size for the original language (english) block
// It starts with the number of strings coded on 2 bytes followed by each
// string (two bytes for the number of chars and the string itself).
len = 2;
for (i = 0; i < messageIds.size(); ++i)
len += stringSize(messageIds[i]);
writeUint16BE(outFile, len);
// Then comes the size of each translation block.
// It starts with the number of strings coded on 2 bytes, the charset and then the strings.
// For each string we have the string id (on two bytes) followed by
// the string size (two bytes for the number of chars and the string itself).
for (lang = 0; lang < numLangs; lang++) {
len = 2 + stringSize(translations[lang]->charset());
for (i = 0; i < translations[lang]->size(); ++i) {
len += 2 + stringSize(translations[lang]->entry(i)->msgstr);
len += stringSize(translations[lang]->entry(i)->msgctxt);
}
writeUint16BE(outFile, len);
}
// Write list of languages
for (lang = 0; lang < numLangs; lang++) {
writeString(outFile, translations[lang]->language());
writeString(outFile, translations[lang]->languageName());
}
// Write list of codepages
for (size_t j = 2; j < codepages.size(); ++j) {
writeString(outFile, codepages[j]->getName().c_str());
}
// Write original messages
writeUint16BE(outFile, messageIds.size());
for (i = 0; i < messageIds.size(); ++i) {
writeString(outFile, messageIds[i]);
}
// Write translations
for (lang = 0; lang < numLangs; lang++) {
writeUint16BE(outFile, translations[lang]->size());
writeString(outFile, translations[lang]->charset());
for (i = 0; i < translations[lang]->size(); ++i) {
writeUint16BE(outFile, messageIds.findIndex(translations[lang]->entry(i)->msgid));
writeString(outFile, translations[lang]->entry(i)->msgstr);
writeString(outFile, translations[lang]->entry(i)->msgctxt);
}
}
// Write codepages
for (size_t j = 2; j < codepages.size(); ++j) {
const Codepage *cp = codepages[j];
for (i = 0; i < 256; ++i)
writeUint32BE(outFile, cp->getMapping(i));
}
fclose(outFile);
// Clean the memory
for (i = 0; i < numLangs; ++i)
delete translations[i];
return 0;
}
|