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
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
|
/* Checking of messages in PO files.
Copyright (C) 1995-1998, 2000-2008, 2010-2012 Free Software Foundation, Inc.
Written by Ulrich Drepper <drepper@gnu.ai.mit.edu>, April 1995.
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 3 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, see <http://www.gnu.org/licenses/>. */
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
/* Specification. */
#include "msgl-check.h"
#include <limits.h>
#include <setjmp.h>
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdarg.h>
#include "c-ctype.h"
#include "xalloc.h"
#include "xvasprintf.h"
#include "po-xerror.h"
#include "format.h"
#include "plural-exp.h"
#include "plural-eval.h"
#include "plural-table.h"
#include "c-strstr.h"
#include "message.h"
#include "gettext.h"
#define _(str) gettext (str)
#define SIZEOF(a) (sizeof(a) / sizeof(a[0]))
/* Evaluates the plural formula for min <= n <= max
and returns the estimated number of times the value j was assumed. */
static unsigned int
plural_expression_histogram (const struct plural_distribution *self,
int min, int max, unsigned long j)
{
if (min < 0)
min = 0;
/* Limit the number of evaluations. Nothing interesting happens beyond
1000. */
if (max - min > 1000)
max = min + 1000;
if (min <= max)
{
const struct expression *expr = self->expr;
unsigned long n;
unsigned int count;
/* Protect against arithmetic exceptions. */
install_sigfpe_handler ();
count = 0;
for (n = min; n <= max; n++)
{
unsigned long val = plural_eval (expr, n);
if (val == j)
count++;
}
/* End of protection against arithmetic exceptions. */
uninstall_sigfpe_handler ();
return count;
}
else
return 0;
}
/* Check the values returned by plural_eval.
Signals the errors through po_xerror.
Return the number of errors that were seen.
If no errors, returns in *DISTRIBUTION information about the plural_eval
values distribution. */
int
check_plural_eval (const struct expression *plural_expr,
unsigned long nplurals_value,
const message_ty *header,
struct plural_distribution *distribution)
{
/* Do as if the plural formula assumes a value N infinitely often if it
assumes it at least 5 times. */
#define OFTEN 5
unsigned char * volatile array;
/* Allocate a distribution array. */
if (nplurals_value <= 100)
array = XCALLOC (nplurals_value, unsigned char);
else
/* nplurals_value is nonsense. Don't risk an out-of-memory. */
array = NULL;
if (sigsetjmp (sigfpe_exit, 1) == 0)
{
unsigned long n;
/* Protect against arithmetic exceptions. */
install_sigfpe_handler ();
for (n = 0; n <= 1000; n++)
{
unsigned long val = plural_eval (plural_expr, n);
if ((long) val < 0)
{
/* End of protection against arithmetic exceptions. */
uninstall_sigfpe_handler ();
po_xerror (PO_SEVERITY_ERROR, header, NULL, 0, 0, false,
_("plural expression can produce negative values"));
free (array);
return 1;
}
else if (val >= nplurals_value)
{
char *msg;
/* End of protection against arithmetic exceptions. */
uninstall_sigfpe_handler ();
msg = xasprintf (_("nplurals = %lu but plural expression can produce values as large as %lu"),
nplurals_value, val);
po_xerror (PO_SEVERITY_ERROR, header, NULL, 0, 0, false, msg);
free (msg);
free (array);
return 1;
}
if (array != NULL && array[val] < OFTEN)
array[val]++;
}
/* End of protection against arithmetic exceptions. */
uninstall_sigfpe_handler ();
/* Normalize the array[val] statistics. */
if (array != NULL)
{
unsigned long val;
for (val = 0; val < nplurals_value; val++)
array[val] = (array[val] == OFTEN ? 1 : 0);
}
distribution->expr = plural_expr;
distribution->often = array;
distribution->often_length = (array != NULL ? nplurals_value : 0);
distribution->histogram = plural_expression_histogram;
return 0;
}
else
{
/* Caught an arithmetic exception. */
const char *msg;
/* End of protection against arithmetic exceptions. */
uninstall_sigfpe_handler ();
#if USE_SIGINFO
switch (sigfpe_code)
#endif
{
#if USE_SIGINFO
# ifdef FPE_INTDIV
case FPE_INTDIV:
msg = _("plural expression can produce division by zero");
break;
# endif
# ifdef FPE_INTOVF
case FPE_INTOVF:
msg = _("plural expression can produce integer overflow");
break;
# endif
default:
#endif
msg = _("plural expression can produce arithmetic exceptions, possibly division by zero");
}
po_xerror (PO_SEVERITY_ERROR, header, NULL, 0, 0, false, msg);
free (array);
return 1;
}
#undef OFTEN
}
/* Try to help the translator by looking up the right plural formula for her.
Return a freshly allocated multiline help string, or NULL. */
static char *
plural_help (const char *nullentry)
{
struct plural_table_entry *ptentry = NULL;
{
const char *language;
language = c_strstr (nullentry, "Language: ");
if (language != NULL)
{
size_t len;
language += 10;
len = strcspn (language, " \t\n");
if (len > 0)
{
size_t j;
for (j = 0; j < plural_table_size; j++)
if (len == strlen (plural_table[j].lang)
&& strncmp (language, plural_table[j].lang, len) == 0)
{
ptentry = &plural_table[j];
break;
}
}
}
}
if (ptentry == NULL)
{
const char *language;
language = c_strstr (nullentry, "Language-Team: ");
if (language != NULL)
{
size_t j;
language += 15;
for (j = 0; j < plural_table_size; j++)
if (strncmp (language,
plural_table[j].language,
strlen (plural_table[j].language)) == 0)
{
ptentry = &plural_table[j];
break;
}
}
}
if (ptentry != NULL)
{
char *helpline1 =
xasprintf (_("Try using the following, valid for %s:"),
ptentry->language);
char *help =
xasprintf ("%s\n\"Plural-Forms: %s\\n\"\n",
helpline1, ptentry->value);
free (helpline1);
return help;
}
return NULL;
}
/* Perform plural expression checking.
Return the number of errors that were seen.
If no errors, returns in *DISTRIBUTION information about the plural_eval
values distribution. */
static int
check_plural (message_list_ty *mlp,
int ignore_untranslated_messages,
int ignore_fuzzy_messages,
struct plural_distribution *distributionp)
{
int seen_errors = 0;
const message_ty *has_plural;
unsigned long min_nplurals;
const message_ty *min_pos;
unsigned long max_nplurals;
const message_ty *max_pos;
struct plural_distribution distribution;
size_t j;
message_ty *header;
/* Determine whether mlp has plural entries. */
has_plural = NULL;
min_nplurals = ULONG_MAX;
min_pos = NULL;
max_nplurals = 0;
max_pos = NULL;
distribution.expr = NULL;
distribution.often = NULL;
distribution.often_length = 0;
distribution.histogram = NULL;
for (j = 0; j < mlp->nitems; j++)
{
message_ty *mp = mlp->item[j];
if (!mp->obsolete
&& !(ignore_untranslated_messages && mp->msgstr[0] == '\0')
&& !(ignore_fuzzy_messages && (mp->is_fuzzy && !is_header (mp)))
&& mp->msgid_plural != NULL)
{
const char *p;
const char *p_end;
unsigned long n;
if (has_plural == NULL)
has_plural = mp;
n = 0;
for (p = mp->msgstr, p_end = p + mp->msgstr_len;
p < p_end;
p += strlen (p) + 1)
n++;
if (min_nplurals > n)
{
min_nplurals = n;
min_pos = mp;
}
if (max_nplurals < n)
{
max_nplurals = n;
max_pos = mp;
}
}
}
/* Look at the plural entry for this domain.
Cf, function extract_plural_expression. */
header = message_list_search (mlp, NULL, "");
if (header != NULL && !header->obsolete)
{
const char *nullentry;
const char *plural;
const char *nplurals;
nullentry = header->msgstr;
plural = c_strstr (nullentry, "plural=");
nplurals = c_strstr (nullentry, "nplurals=");
if (plural == NULL && has_plural != NULL)
{
const char *msg1 =
_("message catalog has plural form translations");
const char *msg2 =
_("but header entry lacks a \"plural=EXPRESSION\" attribute");
char *help = plural_help (nullentry);
if (help != NULL)
{
char *msg2ext = xasprintf ("%s\n%s", msg2, help);
po_xerror2 (PO_SEVERITY_ERROR,
has_plural, NULL, 0, 0, false, msg1,
header, NULL, 0, 0, true, msg2ext);
free (msg2ext);
free (help);
}
else
po_xerror2 (PO_SEVERITY_ERROR,
has_plural, NULL, 0, 0, false, msg1,
header, NULL, 0, 0, false, msg2);
seen_errors++;
}
if (nplurals == NULL && has_plural != NULL)
{
const char *msg1 =
_("message catalog has plural form translations");
const char *msg2 =
_("but header entry lacks a \"nplurals=INTEGER\" attribute");
char *help = plural_help (nullentry);
if (help != NULL)
{
char *msg2ext = xasprintf ("%s\n%s", msg2, help);
po_xerror2 (PO_SEVERITY_ERROR,
has_plural, NULL, 0, 0, false, msg1,
header, NULL, 0, 0, true, msg2ext);
free (msg2ext);
free (help);
}
else
po_xerror2 (PO_SEVERITY_ERROR,
has_plural, NULL, 0, 0, false, msg1,
header, NULL, 0, 0, false, msg2);
seen_errors++;
}
if (plural != NULL && nplurals != NULL)
{
const char *endp;
unsigned long int nplurals_value;
struct parse_args args;
const struct expression *plural_expr;
/* First check the number. */
nplurals += 9;
while (*nplurals != '\0' && c_isspace ((unsigned char) *nplurals))
++nplurals;
endp = nplurals;
nplurals_value = 0;
if (*nplurals >= '0' && *nplurals <= '9')
nplurals_value = strtoul (nplurals, (char **) &endp, 10);
if (nplurals == endp)
{
const char *msg = _("invalid nplurals value");
char *help = plural_help (nullentry);
if (help != NULL)
{
char *msgext = xasprintf ("%s\n%s", msg, help);
po_xerror (PO_SEVERITY_ERROR, header, NULL, 0, 0, true,
msgext);
free (msgext);
free (help);
}
else
po_xerror (PO_SEVERITY_ERROR, header, NULL, 0, 0, false, msg);
seen_errors++;
}
/* Then check the expression. */
plural += 7;
args.cp = plural;
if (parse_plural_expression (&args) != 0)
{
const char *msg = _("invalid plural expression");
char *help = plural_help (nullentry);
if (help != NULL)
{
char *msgext = xasprintf ("%s\n%s", msg, help);
po_xerror (PO_SEVERITY_ERROR, header, NULL, 0, 0, true,
msgext);
free (msgext);
free (help);
}
else
po_xerror (PO_SEVERITY_ERROR, header, NULL, 0, 0, false, msg);
seen_errors++;
}
plural_expr = args.res;
/* See whether nplurals and plural fit together. */
if (!seen_errors)
seen_errors =
check_plural_eval (plural_expr, nplurals_value, header,
&distribution);
/* Check the number of plurals of the translations. */
if (!seen_errors)
{
if (min_nplurals < nplurals_value)
{
char *msg1 =
xasprintf (_("nplurals = %lu"), nplurals_value);
char *msg2 =
xasprintf (ngettext ("but some messages have only one plural form",
"but some messages have only %lu plural forms",
min_nplurals),
min_nplurals);
po_xerror2 (PO_SEVERITY_ERROR,
header, NULL, 0, 0, false, msg1,
min_pos, NULL, 0, 0, false, msg2);
free (msg2);
free (msg1);
seen_errors++;
}
else if (max_nplurals > nplurals_value)
{
char *msg1 =
xasprintf (_("nplurals = %lu"), nplurals_value);
char *msg2 =
xasprintf (ngettext ("but some messages have one plural form",
"but some messages have %lu plural forms",
max_nplurals),
max_nplurals);
po_xerror2 (PO_SEVERITY_ERROR,
header, NULL, 0, 0, false, msg1,
max_pos, NULL, 0, 0, false, msg2);
free (msg2);
free (msg1);
seen_errors++;
}
/* The only valid case is max_nplurals <= n <= min_nplurals,
which means either has_plural == NULL or
max_nplurals = n = min_nplurals. */
}
}
else
goto no_plural;
}
else
{
if (has_plural != NULL)
{
po_xerror (PO_SEVERITY_ERROR, has_plural, NULL, 0, 0, false,
_("message catalog has plural form translations, but lacks a header entry with \"Plural-Forms: nplurals=INTEGER; plural=EXPRESSION;\""));
seen_errors++;
}
no_plural:
/* By default, the Germanic formula (n != 1) is used. */
distribution.expr = &germanic_plural;
{
unsigned char *array = XCALLOC (2, unsigned char);
array[1] = 1;
distribution.often = array;
}
distribution.often_length = 2;
distribution.histogram = plural_expression_histogram;
}
/* distribution is not needed if we report errors.
Also, if there was an error due to max_nplurals > nplurals_value,
we must not use distribution because we would be doing out-of-bounds
array accesses. */
if (seen_errors > 0)
free ((unsigned char *) distribution.often);
else
*distributionp = distribution;
return seen_errors;
}
/* Signal an error when checking format strings. */
static const message_ty *curr_mp;
static lex_pos_ty curr_msgid_pos;
static void
formatstring_error_logger (const char *format, ...)
#if defined __GNUC__ && ((__GNUC__ == 2 && __GNUC_MINOR__ >= 7) || __GNUC__ > 2)
__attribute__ ((__format__ (__printf__, 1, 2)))
#endif
;
static void
formatstring_error_logger (const char *format, ...)
{
va_list args;
char *msg;
va_start (args, format);
if (vasprintf (&msg, format, args) < 0)
error (EXIT_FAILURE, 0, _("memory exhausted"));
va_end (args);
po_xerror (PO_SEVERITY_ERROR,
curr_mp, curr_msgid_pos.file_name, curr_msgid_pos.line_number,
(size_t)(-1), false, msg);
free (msg);
}
/* Perform miscellaneous checks on a message.
PLURAL_DISTRIBUTION is either NULL or an array of nplurals elements,
PLURAL_DISTRIBUTION[j] being true if the value j appears to be assumed
infinitely often by the plural formula.
PLURAL_DISTRIBUTION_LENGTH is the length of the PLURAL_DISTRIBUTION
array. */
static int
check_pair (const message_ty *mp,
const char *msgid,
const lex_pos_ty *msgid_pos,
const char *msgid_plural,
const char *msgstr, size_t msgstr_len,
const enum is_format is_format[NFORMATS],
int check_newlines,
int check_format_strings,
const struct plural_distribution *distribution,
int check_compatibility,
int check_accelerators, char accelerator_char)
{
int seen_errors;
int has_newline;
unsigned int j;
/* If the msgid string is empty we have the special entry reserved for
information about the translation. */
if (msgid[0] == '\0')
return 0;
seen_errors = 0;
if (check_newlines)
{
/* Test 1: check whether all or none of the strings begin with a '\n'. */
has_newline = (msgid[0] == '\n');
#define TEST_NEWLINE(p) (p[0] == '\n')
if (msgid_plural != NULL)
{
const char *p;
if (TEST_NEWLINE(msgid_plural) != has_newline)
{
po_xerror (PO_SEVERITY_ERROR,
mp, msgid_pos->file_name, msgid_pos->line_number,
(size_t)(-1), false, _("\
'msgid' and 'msgid_plural' entries do not both begin with '\\n'"));
seen_errors++;
}
for (p = msgstr, j = 0; p < msgstr + msgstr_len; p += strlen (p) + 1, j++)
if (TEST_NEWLINE(p) != has_newline)
{
char *msg =
xasprintf (_("\
'msgid' and 'msgstr[%u]' entries do not both begin with '\\n'"), j);
po_xerror (PO_SEVERITY_ERROR,
mp, msgid_pos->file_name, msgid_pos->line_number,
(size_t)(-1), false, msg);
free (msg);
seen_errors++;
}
}
else
{
if (TEST_NEWLINE(msgstr) != has_newline)
{
po_xerror (PO_SEVERITY_ERROR,
mp, msgid_pos->file_name, msgid_pos->line_number,
(size_t)(-1), false, _("\
'msgid' and 'msgstr' entries do not both begin with '\\n'"));
seen_errors++;
}
}
#undef TEST_NEWLINE
/* Test 2: check whether all or none of the strings end with a '\n'. */
has_newline = (msgid[strlen (msgid) - 1] == '\n');
#define TEST_NEWLINE(p) (p[0] != '\0' && p[strlen (p) - 1] == '\n')
if (msgid_plural != NULL)
{
const char *p;
if (TEST_NEWLINE(msgid_plural) != has_newline)
{
po_xerror (PO_SEVERITY_ERROR,
mp, msgid_pos->file_name, msgid_pos->line_number,
(size_t)(-1), false, _("\
'msgid' and 'msgid_plural' entries do not both end with '\\n'"));
seen_errors++;
}
for (p = msgstr, j = 0; p < msgstr + msgstr_len; p += strlen (p) + 1, j++)
if (TEST_NEWLINE(p) != has_newline)
{
char *msg =
xasprintf (_("\
'msgid' and 'msgstr[%u]' entries do not both end with '\\n'"), j);
po_xerror (PO_SEVERITY_ERROR,
mp, msgid_pos->file_name, msgid_pos->line_number,
(size_t)(-1), false, msg);
free (msg);
seen_errors++;
}
}
else
{
if (TEST_NEWLINE(msgstr) != has_newline)
{
po_xerror (PO_SEVERITY_ERROR,
mp, msgid_pos->file_name, msgid_pos->line_number,
(size_t)(-1), false, _("\
'msgid' and 'msgstr' entries do not both end with '\\n'"));
seen_errors++;
}
}
#undef TEST_NEWLINE
}
if (check_compatibility && msgid_plural != NULL)
{
po_xerror (PO_SEVERITY_ERROR,
mp, msgid_pos->file_name, msgid_pos->line_number,
(size_t)(-1), false, _("\
plural handling is a GNU gettext extension"));
seen_errors++;
}
if (check_format_strings)
/* Test 3: Check whether both formats strings contain the same number
of format specifications. */
{
curr_mp = mp;
curr_msgid_pos = *msgid_pos;
seen_errors +=
check_msgid_msgstr_format (msgid, msgid_plural, msgstr, msgstr_len,
is_format, mp->range, distribution,
formatstring_error_logger);
}
if (check_accelerators && msgid_plural == NULL)
/* Test 4: Check that if msgid is a menu item with a keyboard accelerator,
the msgstr has an accelerator as well. A keyboard accelerator is
designated by an immediately preceding '&'. We cannot check whether
two accelerators collide, only whether the translator has bothered
thinking about them. */
{
const char *p;
/* We are only interested in msgids that contain exactly one '&'. */
p = strchr (msgid, accelerator_char);
if (p != NULL && strchr (p + 1, accelerator_char) == NULL)
{
/* Count the number of '&' in msgstr, but ignore '&&'. */
unsigned int count = 0;
for (p = msgstr; (p = strchr (p, accelerator_char)) != NULL; p++)
if (p[1] == accelerator_char)
p++;
else
count++;
if (count == 0)
{
char *msg =
xasprintf (_("msgstr lacks the keyboard accelerator mark '%c'"),
accelerator_char);
po_xerror (PO_SEVERITY_ERROR,
mp, msgid_pos->file_name, msgid_pos->line_number,
(size_t)(-1), false, msg);
free (msg);
seen_errors++;
}
else if (count > 1)
{
char *msg =
xasprintf (_("msgstr has too many keyboard accelerator marks '%c'"),
accelerator_char);
po_xerror (PO_SEVERITY_ERROR,
mp, msgid_pos->file_name, msgid_pos->line_number,
(size_t)(-1), false, msg);
free (msg);
seen_errors++;
}
}
}
return seen_errors;
}
/* Perform miscellaneous checks on a header entry. */
static int
check_header_entry (const message_ty *mp, const char *msgstr_string)
{
static const char *required_fields[] =
{
"Project-Id-Version", "PO-Revision-Date", "Last-Translator",
"Language-Team", "MIME-Version", "Content-Type",
"Content-Transfer-Encoding",
/* These are recommended but not yet required. */
"Language"
};
static const char *default_values[] =
{
"PACKAGE VERSION", "YEAR-MO-DA HO:MI+ZONE", "FULL NAME <EMAIL@ADDRESS>", "LANGUAGE <LL@li.org>", NULL,
"text/plain; charset=CHARSET", "ENCODING",
""
};
const size_t nfields = SIZEOF (required_fields);
/* FIXME: We could check if a required header field is missing and
report it as error. However, it's could be too rigorous and
break backward compatibility. */
#if 0
const size_t nrequiredfields = nfields - 1;
#endif
int seen_errors = 0;
int cnt;
for (cnt = 0; cnt < nfields; ++cnt)
{
#if 0
int severity =
(cnt < nrequiredfields ? PO_SEVERITY_ERROR : PO_SEVERITY_WARNING);
#else
int severity =
PO_SEVERITY_WARNING;
#endif
const char *field = required_fields[cnt];
size_t len = strlen (field);
const char *line;
for (line = msgstr_string; *line != '\0'; )
{
if (strncmp (line, field, len) == 0 && line[len] == ':')
{
const char *p = line + len + 1;
/* Test whether the field's value, starting at p, is the default
value. */
if (*p == ' ')
p++;
if (default_values[cnt] != NULL
&& strncmp (p, default_values[cnt],
strlen (default_values[cnt])) == 0)
{
p += strlen (default_values[cnt]);
if (*p == '\0' || *p == '\n')
{
char *msg =
xasprintf (_("header field '%s' still has the initial default value\n"),
field);
po_xerror (severity, mp, NULL, 0, 0, true, msg);
free (msg);
if (severity == PO_SEVERITY_ERROR)
seen_errors++;
}
}
break;
}
line = strchrnul (line, '\n');
if (*line == '\n')
line++;
}
if (*line == '\0')
{
char *msg =
xasprintf (_("header field '%s' missing in header\n"),
field);
po_xerror (severity, mp, NULL, 0, 0, true, msg);
free (msg);
if (severity == PO_SEVERITY_ERROR)
seen_errors++;
}
}
return seen_errors;
}
/* Perform all checks on a non-obsolete message.
Return the number of errors that were seen. */
int
check_message (const message_ty *mp,
const lex_pos_ty *msgid_pos,
int check_newlines,
int check_format_strings,
const struct plural_distribution *distribution,
int check_header,
int check_compatibility,
int check_accelerators, char accelerator_char)
{
int seen_errors = 0;
if (check_header && is_header (mp))
seen_errors += check_header_entry (mp, mp->msgstr);
seen_errors += check_pair (mp,
mp->msgid, msgid_pos, mp->msgid_plural,
mp->msgstr, mp->msgstr_len,
mp->is_format,
check_newlines,
check_format_strings,
distribution,
check_compatibility,
check_accelerators, accelerator_char);
return seen_errors;
}
/* Perform all checks on a message list.
Return the number of errors that were seen. */
int
check_message_list (message_list_ty *mlp,
int ignore_untranslated_messages,
int ignore_fuzzy_messages,
int check_newlines,
int check_format_strings,
int check_header,
int check_compatibility,
int check_accelerators, char accelerator_char)
{
int seen_errors = 0;
struct plural_distribution distribution;
size_t j;
distribution.expr = NULL;
distribution.often = NULL;
distribution.often_length = 0;
distribution.histogram = NULL;
if (check_header)
seen_errors += check_plural (mlp, ignore_untranslated_messages,
ignore_fuzzy_messages, &distribution);
for (j = 0; j < mlp->nitems; j++)
{
message_ty *mp = mlp->item[j];
if (!mp->obsolete
&& !(ignore_untranslated_messages && mp->msgstr[0] == '\0')
&& !(ignore_fuzzy_messages && (mp->is_fuzzy && !is_header (mp))))
seen_errors += check_message (mp, &mp->pos,
check_newlines,
check_format_strings,
&distribution,
check_header, check_compatibility,
check_accelerators, accelerator_char);
}
return seen_errors;
}
|