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
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
|
/***********************************************************
Copyright 1990, by Alfalfa Software Incorporated, Cambridge, Massachusetts.
All Rights Reserved
Permission to use, copy, modify, and distribute this software and its
documentation for any purpose and without fee is hereby granted,
provided that the above copyright notice appear in all copies and that
both that copyright notice and this permission notice appear in
supporting documentation, and that Alfalfa's name not be used in
advertising or publicity pertaining to distribution of the software
without specific, written prior permission.
ALPHALPHA DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING
ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL
ALPHALPHA BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR
ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
SOFTWARE.
If you make any modifications, bugfixes or other changes to this software
we'd appreciate it if you could send a copy to us so we can keep things
up-to-date. Many thanks.
Kee Hinckley
Alfalfa Software, Inc.
267 Allston St., #3
Cambridge, MA 02139 USA
nazgul@alfalfa.com
******************************************************************/
#include <sys/cdefs.h>
__FBSDID("$FreeBSD$");
/*
* We need a better way of handling errors than printing text. I need
* to add an error handling routine.
*/
#include "namespace.h"
#include <sys/types.h>
#include <sys/stat.h>
#include <sys/syslimits.h>
#include <errno.h>
#include <fcntl.h>
#include <locale.h>
#include <nl_types.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include "un-namespace.h"
#include "msgcat.h"
#include "../locale/setlocale.h" /* for ENCODING_LEN */
#define _DEFAULT_NLS_PATH "/usr/share/nls/%L/%N.cat:/usr/share/nls/%N/%L:/usr/local/share/nls/%L/%N.cat:/usr/local/share/nls/%N/%L"
#define TRUE 1
#define FALSE 0
#define NLERR ((nl_catd) -1)
#define NLRETERR(errc) { errno = errc; return (NLERR); }
static nl_catd loadCat();
static int loadSet();
static void __nls_free_resources();
nl_catd
catopen(name, type)
__const char *name;
int type;
{
int spcleft, saverr;
char path[PATH_MAX];
char *nlspath, *lang, *base, *cptr, *pathP, *tmpptr;
char *cptr1, *plang, *pter, *pcode;
struct stat sbuf;
if (name == NULL || *name == '\0')
NLRETERR(EINVAL);
/* is it absolute path ? if yes, load immediately */
if (strchr(name, '/') != NULL)
return (loadCat(name));
if (type == NL_CAT_LOCALE)
lang = setlocale(LC_MESSAGES, NULL);
else
lang = getenv("LANG");
if (lang == NULL || *lang == '\0' || strlen(lang) > ENCODING_LEN ||
(lang[0] == '.' &&
(lang[1] == '\0' || (lang[1] == '.' && lang[2] == '\0'))) ||
strchr(lang, '/') != NULL)
lang = "C";
if ((plang = cptr1 = strdup(lang)) == NULL)
return (NLERR);
if ((cptr = strchr(cptr1, '@')) != NULL)
*cptr = '\0';
pter = pcode = "";
if ((cptr = strchr(cptr1, '_')) != NULL) {
*cptr++ = '\0';
pter = cptr1 = cptr;
}
if ((cptr = strchr(cptr1, '.')) != NULL) {
*cptr++ = '\0';
pcode = cptr;
}
if ((nlspath = getenv("NLSPATH")) == NULL
#ifndef __NETBSD_SYSCALLS
|| issetugid()
#endif
)
nlspath = _DEFAULT_NLS_PATH;
if ((base = cptr = strdup(nlspath)) == NULL) {
saverr = errno;
free(plang);
errno = saverr;
return (NLERR);
}
while ((nlspath = strsep(&cptr, ":")) != NULL) {
pathP = path;
if (*nlspath) {
for (; *nlspath; ++nlspath) {
if (*nlspath == '%') {
switch (*(nlspath + 1)) {
case 'l':
tmpptr = plang;
break;
case 't':
tmpptr = pter;
break;
case 'c':
tmpptr = pcode;
break;
case 'L':
tmpptr = lang;
break;
case 'N':
tmpptr = (char *)name;
break;
case '%':
++nlspath;
/* fallthrough */
default:
if (pathP - path >=
sizeof(path) - 1)
goto too_long;
*(pathP++) = *nlspath;
continue;
}
++nlspath;
put_tmpptr:
spcleft = sizeof(path) -
(pathP - path) - 1;
if (strlcpy(pathP, tmpptr, spcleft) >=
spcleft) {
too_long:
free(plang);
free(base);
NLRETERR(ENAMETOOLONG);
}
pathP += strlen(tmpptr);
} else {
if (pathP - path >= sizeof(path) - 1)
goto too_long;
*(pathP++) = *nlspath;
}
}
*pathP = '\0';
if (stat(path, &sbuf) == 0) {
free(plang);
free(base);
return (loadCat(path));
}
} else {
tmpptr = (char *)name;
--nlspath;
goto put_tmpptr;
}
}
free(plang);
free(base);
NLRETERR(ENOENT);
}
/*
* We've got an odd situation here. The odds are real good that the
* number we are looking for is almost the same as the index. We could
* use the index, check the difference and do something intelligent, but
* I haven't quite figured out what's intelligent.
*
* Here's a start.
* Take an id N. If there are > N items in the list, then N cannot
* be more than N items from the start, since otherwise there would
* have to be duplicate items. So we can safely set the top to N+1
* (after taking into account that ids start at 1, and arrays at 0)
*
* Let's say we are at position P, and we are looking for N, but have
* V. If N > V, then the furthest away that N could be is
* P + (N-V). So we can safely set hi to P+(N-V)+1. For example:
* We are looking for 10, but have 8
* 8 ? ? ? ?
* >=9 >=10 >=11
*
*/
#define LOOKUP(PARENT, CHILD, ID, NUM, SET) { \
lo = 0; \
if (ID - 1 < PARENT->NUM) { \
cur = ID - 1; \
hi = ID; \
} else { \
hi = PARENT->NUM; \
cur = (hi - lo) / 2; \
} \
while (TRUE) { \
CHILD = PARENT->SET + cur; \
if (CHILD->ID == ID) \
break; \
if (CHILD->ID < ID) { \
lo = cur + 1; \
if (hi > cur + (ID - CHILD->ID) + 1) \
hi = cur + (ID - CHILD->ID) + 1; \
dir = 1; \
} else { \
hi = cur; \
dir = -1; \
} \
if (lo >= hi) \
return (NULL); \
if (hi - lo == 1) \
cur += dir; \
else \
cur += ((hi - lo) / 2) * dir; \
} \
}
static MCSetT *
MCGetSet(cat, setId)
MCCatT *cat;
int setId;
{
MCSetT *set;
long lo, hi, cur, dir;
if (cat == NULL || setId <= 0)
return (NULL);
LOOKUP(cat, set, setId, numSets, sets);
if (set->invalid && loadSet(cat, set) <= 0)
return (NULL);
return (set);
}
static MCMsgT *
MCGetMsg(set, msgId)
MCSetT *set;
int msgId;
{
MCMsgT *msg;
long lo, hi, cur, dir;
if (set == NULL || set->invalid || msgId <= 0)
return (NULL);
LOOKUP(set, msg, msgId, numMsgs, u.msgs);
return (msg);
}
char *
catgets(catd, setId, msgId, dflt)
nl_catd catd;
int setId;
int msgId;
__const char *dflt;
{
MCMsgT *msg;
MCCatT *cat = (MCCatT *)catd;
__const char *cptr;
if (catd == NULL || catd == NLERR)
return ((char *)dflt);
msg = MCGetMsg(MCGetSet(cat, setId), msgId);
if (msg != NULL)
cptr = msg->msg.str;
else
cptr = dflt;
return ((char *)cptr);
}
int
catclose(catd)
nl_catd catd;
{
MCCatT *cat = (MCCatT *)catd;
if (catd == NULL || catd == NLERR) {
errno = EBADF;
return (-1);
}
#if 0
if (cat->loadType != MCLoadAll)
#endif
(void)fclose(cat->fp);
__nls_free_resources(cat, cat->numSets);
free(cat);
return (0);
}
/*
* Internal routines
*/
/* Note that only malloc failures are allowed to return an error */
static char *_errowner = "Message Catalog System";
#define CORRUPT() { \
(void)fprintf(stderr, "%s: corrupt file.", _errowner); \
free(cat); \
NLRETERR(EFTYPE); \
}
#define NOSPACE() { \
saverr = errno; \
(void)fprintf(stderr, "%s: no more memory.", _errowner); \
free(cat); \
errno = saverr; \
return (NLERR); \
}
static void
__nls_free_resources(cat, i)
MCCatT *cat;
int i;
{
MCSetT *set;
int j;
for (j = 0; j < i; j++) {
set = cat->sets + j;
if (!set->invalid) {
free(set->data.str);
free(set->u.msgs);
}
}
free(cat->sets);
}
static nl_catd
loadCat(catpath)
__const char *catpath;
{
MCHeaderT header;
MCCatT *cat;
MCSetT *set;
long i;
off_t nextSet;
int saverr;
if ((cat = (MCCatT *)malloc(sizeof(MCCatT))) == NULL)
return (NLERR);
cat->loadType = MCLoadBySet;
if ((cat->fp = fopen(catpath, "r")) == NULL) {
saverr = errno;
free(cat);
errno = saverr;
return (NLERR);
}
(void)_fcntl(fileno(cat->fp), F_SETFD, FD_CLOEXEC);
if (fread(&header, sizeof(header), 1, cat->fp) != 1 ||
strncmp(header.magic, MCMagic, MCMagicLen) != 0)
CORRUPT();
if (header.majorVer != MCMajorVer) {
free(cat);
(void)fprintf(stderr, "%s: %s is version %ld, we need %ld.\n",
_errowner, catpath, header.majorVer, MCMajorVer);
NLRETERR(EFTYPE);
}
if (header.numSets <= 0) {
free(cat);
(void)fprintf(stderr, "%s: %s has %ld sets!\n",
_errowner, catpath, header.numSets);
NLRETERR(EFTYPE);
}
cat->numSets = header.numSets;
if ((cat->sets = (MCSetT *)malloc(sizeof(MCSetT) * header.numSets)) ==
NULL)
NOSPACE();
nextSet = header.firstSet;
for (i = 0; i < cat->numSets; ++i) {
if (fseeko(cat->fp, nextSet, SEEK_SET) == -1) {
__nls_free_resources(cat, i);
CORRUPT();
}
/* read in the set header */
set = cat->sets + i;
if (fread(set, sizeof(*set), 1, cat->fp) != 1) {
__nls_free_resources(cat, i);
CORRUPT();
}
/* if it's invalid, skip over it (and backup 'i') */
if (set->invalid) {
--i;
nextSet = set->nextSet;
continue;
}
#if 0
if (cat->loadType == MCLoadAll) {
int res;
if ((res = loadSet(cat, set)) <= 0) {
__nls_free_resources(cat, i);
if (res < 0)
NOSPACE();
CORRUPT();
}
} else
#endif
set->invalid = TRUE;
nextSet = set->nextSet;
}
#if 0
if (cat->loadType == MCLoadAll) {
(void)fclose(cat->fp);
cat->fp = NULL;
}
#endif
return ((nl_catd) cat);
}
static int
loadSet(cat, set)
MCCatT *cat;
MCSetT *set;
{
MCMsgT *msg;
int i;
int saverr;
/* Get the data */
if (fseeko(cat->fp, set->data.off, SEEK_SET) == -1)
return (0);
if ((set->data.str = malloc(set->dataLen)) == NULL)
return (-1);
if (fread(set->data.str, set->dataLen, 1, cat->fp) != 1) {
saverr = errno;
free(set->data.str);
errno = saverr;
return (0);
}
/* Get the messages */
if (fseeko(cat->fp, set->u.firstMsg, SEEK_SET) == -1) {
saverr = errno;
free(set->data.str);
errno = saverr;
return (0);
}
if ((set->u.msgs = (MCMsgT *)malloc(sizeof(MCMsgT) * set->numMsgs)) ==
NULL) {
saverr = errno;
free(set->data.str);
errno = saverr;
return (-1);
}
for (i = 0; i < set->numMsgs; ++i) {
msg = set->u.msgs + i;
if (fread(msg, sizeof(*msg), 1, cat->fp) != 1) {
saverr = errno;
free(set->u.msgs);
free(set->data.str);
errno = saverr;
return (0);
}
if (msg->invalid) {
--i;
continue;
}
msg->msg.str = (char *)(set->data.str + msg->msg.off);
}
set->invalid = FALSE;
return (1);
}
|