aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorPaul Eggert1997-04-18 00:48:01 +0000
committerPaul Eggert1997-04-18 00:48:01 +0000
commit49fb57991204be1a13b4579bdb4b0a9cf85cf885 (patch)
tree8e25ee3e496d302ff4e2397e2a87deed84f22b5b
parentea39159ea2d6848263f4ec853c1b959745094bc8 (diff)
downloademacs-49fb57991204be1a13b4579bdb4b0a9cf85cf885.tar.gz
emacs-49fb57991204be1a13b4579bdb4b0a9cf85cf885.zip
automatically generated from GPLed version
-rw-r--r--lib-src/getopt.c1055
-rw-r--r--src/strftime.c1055
2 files changed, 2110 insertions, 0 deletions
diff --git a/lib-src/getopt.c b/lib-src/getopt.c
new file mode 100644
index 00000000000..19f3f056592
--- /dev/null
+++ b/lib-src/getopt.c
@@ -0,0 +1,1055 @@
1/* Getopt for GNU.
2 NOTE: getopt is now part of the C library, so if you don't know what
3 "Keep this file name-space clean" means, talk to roland@gnu.ai.mit.edu
4 before changing it!
5
6 Copyright (C) 1987, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97
7 Free Software Foundation, Inc.
8
9 the C library, however. The master source lives in /gd/gnu/lib.
10
11NOTE: The canonical source of this file is maintained with the GNU C Library.
12Bugs can be reported to bug-glibc@prep.ai.mit.edu.
13
14This program is free software; you can redistribute it and/or modify it
15under the terms of the GNU General Public License as published by the
16Free Software Foundation; either version 2, or (at your option) any
17later version.
18
19This program is distributed in the hope that it will be useful,
20but WITHOUT ANY WARRANTY; without even the implied warranty of
21MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22GNU General Public License for more details.
23
24You should have received a copy of the GNU General Public License
25along with this program; if not, write to the Free Software
26Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
27USA. */
28
29/* This tells Alpha OSF/1 not to define a getopt prototype in <stdio.h>.
30 Ditto for AIX 3.2 and <stdlib.h>. */
31#ifndef _NO_PROTO
32#define _NO_PROTO
33#endif
34
35#ifdef HAVE_CONFIG_H
36#include <config.h>
37#endif
38
39#if !defined (__STDC__) || !__STDC__
40/* This is a separate conditional since some stdc systems
41 reject `defined (const)'. */
42#ifndef const
43#define const
44#endif
45#endif
46
47#include <stdio.h>
48
49/* Comment out all this code if we are using the GNU C Library, and are not
50 actually compiling the library itself. This code is part of the GNU C
51 Library, but also included in many other GNU distributions. Compiling
52 and linking in this code is a waste when using the GNU C library
53 (especially if it is a shared library). Rather than having every GNU
54 program understand `configure --with-gnu-libc' and omit the object files,
55 it is simpler to just do this in the source for each such file. */
56
57#define GETOPT_INTERFACE_VERSION 2
58#if !defined (_LIBC) && defined (__GLIBC__) && __GLIBC__ >= 2
59#include <gnu-versions.h>
60#if _GNU_GETOPT_INTERFACE_VERSION == GETOPT_INTERFACE_VERSION
61#define ELIDE_CODE
62#endif
63#endif
64
65#ifndef ELIDE_CODE
66
67
68/* This needs to come after some library #include
69 to get __GNU_LIBRARY__ defined. */
70#ifdef __GNU_LIBRARY__
71/* Don't include stdlib.h for non-GNU C libraries because some of them
72 contain conflicting prototypes for getopt. */
73#include <stdlib.h>
74#include <unistd.h>
75#endif /* GNU C library. */
76
77#ifdef VMS
78#include <unixlib.h>
79#if HAVE_STRING_H - 0
80#include <string.h>
81#endif
82#endif
83
84#if defined (WIN32) && !defined (__CYGWIN32__)
85/* It's not Unix, really. See? Capital letters. */
86#include <windows.h>
87#define getpid() GetCurrentProcessId()
88#endif
89
90#ifndef _
91/* This is for other GNU distributions with internationalized messages.
92 When compiling libc, the _ macro is predefined. */
93#ifdef HAVE_LIBINTL_H
94# include <libintl.h>
95# define _(msgid) gettext (msgid)
96#else
97# define _(msgid) (msgid)
98#endif
99#endif
100
101/* This version of `getopt' appears to the caller like standard Unix `getopt'
102 but it behaves differently for the user, since it allows the user
103 to intersperse the options with the other arguments.
104
105 As `getopt' works, it permutes the elements of ARGV so that,
106 when it is done, all the options precede everything else. Thus
107 all application programs are extended to handle flexible argument order.
108
109 Setting the environment variable POSIXLY_CORRECT disables permutation.
110 Then the behavior is completely standard.
111
112 GNU application programs can use a third alternative mode in which
113 they can distinguish the relative order of options and other arguments. */
114
115#include "getopt.h"
116
117/* For communication from `getopt' to the caller.
118 When `getopt' finds an option that takes an argument,
119 the argument value is returned here.
120 Also, when `ordering' is RETURN_IN_ORDER,
121 each non-option ARGV-element is returned here. */
122
123char *optarg = NULL;
124
125/* Index in ARGV of the next element to be scanned.
126 This is used for communication to and from the caller
127 and for communication between successive calls to `getopt'.
128
129 On entry to `getopt', zero means this is the first call; initialize.
130
131 When `getopt' returns -1, this is the index of the first of the
132 non-option elements that the caller should itself scan.
133
134 Otherwise, `optind' communicates from one call to the next
135 how much of ARGV has been scanned so far. */
136
137/* 1003.2 says this must be 1 before any call. */
138int optind = 1;
139
140/* Formerly, initialization of getopt depended on optind==0, which
141 causes problems with re-calling getopt as programs generally don't
142 know that. */
143
144int __getopt_initialized = 0;
145
146/* The next char to be scanned in the option-element
147 in which the last option character we returned was found.
148 This allows us to pick up the scan where we left off.
149
150 If this is zero, or a null string, it means resume the scan
151 by advancing to the next ARGV-element. */
152
153static char *nextchar;
154
155/* Callers store zero here to inhibit the error message
156 for unrecognized options. */
157
158int opterr = 1;
159
160/* Set to an option character which was unrecognized.
161 This must be initialized on some systems to avoid linking in the
162 system's own getopt implementation. */
163
164int optopt = '?';
165
166/* Describe how to deal with options that follow non-option ARGV-elements.
167
168 If the caller did not specify anything,
169 the default is REQUIRE_ORDER if the environment variable
170 POSIXLY_CORRECT is defined, PERMUTE otherwise.
171
172 REQUIRE_ORDER means don't recognize them as options;
173 stop option processing when the first non-option is seen.
174 This is what Unix does.
175 This mode of operation is selected by either setting the environment
176 variable POSIXLY_CORRECT, or using `+' as the first character
177 of the list of option characters.
178
179 PERMUTE is the default. We permute the contents of ARGV as we scan,
180 so that eventually all the non-options are at the end. This allows options
181 to be given in any order, even with programs that were not written to
182 expect this.
183
184 RETURN_IN_ORDER is an option available to programs that were written
185 to expect options and other ARGV-elements in any order and that care about
186 the ordering of the two. We describe each non-option ARGV-element
187 as if it were the argument of an option with character code 1.
188 Using `-' as the first character of the list of option characters
189 selects this mode of operation.
190
191 The special argument `--' forces an end of option-scanning regardless
192 of the value of `ordering'. In the case of RETURN_IN_ORDER, only
193 `--' can cause `getopt' to return -1 with `optind' != ARGC. */
194
195static enum
196{
197 REQUIRE_ORDER, PERMUTE, RETURN_IN_ORDER
198} ordering;
199
200/* Value of POSIXLY_CORRECT environment variable. */
201static char *posixly_correct;
202
203#ifdef __GNU_LIBRARY__
204/* We want to avoid inclusion of string.h with non-GNU libraries
205 because there are many ways it can cause trouble.
206 On some systems, it contains special magic macros that don't work
207 in GCC. */
208#include <string.h>
209#define my_index strchr
210#else
211
212/* Avoid depending on library functions or files
213 whose names are inconsistent. */
214
215char *getenv ();
216
217static char *
218my_index (str, chr)
219 const char *str;
220 int chr;
221{
222 while (*str)
223 {
224 if (*str == chr)
225 return (char *) str;
226 str++;
227 }
228 return 0;
229}
230
231/* If using GCC, we can safely declare strlen this way.
232 If not using GCC, it is ok not to declare it. */
233#ifdef __GNUC__
234/* Note that Motorola Delta 68k R3V7 comes with GCC but not stddef.h.
235 That was relevant to code that was here before. */
236#if !defined (__STDC__) || !__STDC__
237/* gcc with -traditional declares the built-in strlen to return int,
238 and has done so at least since version 2.4.5. -- rms. */
239extern int strlen (const char *);
240#endif /* not __STDC__ */
241#endif /* __GNUC__ */
242
243#endif /* not __GNU_LIBRARY__ */
244
245/* Handle permutation of arguments. */
246
247/* Describe the part of ARGV that contains non-options that have
248 been skipped. `first_nonopt' is the index in ARGV of the first of them;
249 `last_nonopt' is the index after the last of them. */
250
251static int first_nonopt;
252static int last_nonopt;
253
254#ifdef _LIBC
255/* Bash 2.0 gives us an environment variable containing flags
256 indicating ARGV elements that should not be considered arguments. */
257
258/* Defined in getopt_init.c */
259extern char *__getopt_nonoption_flags;
260
261static int nonoption_flags_max_len;
262static int nonoption_flags_len;
263
264static int original_argc;
265static char *const *original_argv;
266
267extern pid_t __libc_pid;
268
269/* Make sure the environment variable bash 2.0 puts in the environment
270 is valid for the getopt call we must make sure that the ARGV passed
271 to getopt is that one passed to the process. */
272static void
273__attribute__ ((unused))
274store_args_and_env (int argc, char *const *argv)
275{
276 /* XXX This is no good solution. We should rather copy the args so
277 that we can compare them later. But we must not use malloc(3). */
278 original_argc = argc;
279 original_argv = argv;
280}
281text_set_element (__libc_subinit, store_args_and_env);
282
283# define SWAP_FLAGS(ch1, ch2) \
284 if (nonoption_flags_len > 0) \
285 { \
286 char __tmp = __getopt_nonoption_flags[ch1]; \
287 __getopt_nonoption_flags[ch1] = __getopt_nonoption_flags[ch2]; \
288 __getopt_nonoption_flags[ch2] = __tmp; \
289 }
290#else /* !_LIBC */
291# define SWAP_FLAGS(ch1, ch2)
292#endif /* _LIBC */
293
294/* Exchange two adjacent subsequences of ARGV.
295 One subsequence is elements [first_nonopt,last_nonopt)
296 which contains all the non-options that have been skipped so far.
297 The other is elements [last_nonopt,optind), which contains all
298 the options processed since those non-options were skipped.
299
300 `first_nonopt' and `last_nonopt' are relocated so that they describe
301 the new indices of the non-options in ARGV after they are moved. */
302
303#if defined (__STDC__) && __STDC__
304static void exchange (char **);
305#endif
306
307static void
308exchange (argv)
309 char **argv;
310{
311 int bottom = first_nonopt;
312 int middle = last_nonopt;
313 int top = optind;
314 char *tem;
315
316 /* Exchange the shorter segment with the far end of the longer segment.
317 That puts the shorter segment into the right place.
318 It leaves the longer segment in the right place overall,
319 but it consists of two parts that need to be swapped next. */
320
321#ifdef _LIBC
322 /* First make sure the handling of the `__getopt_nonoption_flags'
323 string can work normally. Our top argument must be in the range
324 of the string. */
325 if (nonoption_flags_len > 0 && top >= nonoption_flags_max_len)
326 {
327 /* We must extend the array. The user plays games with us and
328 presents new arguments. */
329 char *new_str = malloc (top + 1);
330 if (new_str == NULL)
331 nonoption_flags_len = nonoption_flags_max_len = 0;
332 else
333 {
334 memcpy (new_str, __getopt_nonoption_flags, nonoption_flags_max_len);
335 memset (&new_str[nonoption_flags_max_len], '\0',
336 top + 1 - nonoption_flags_max_len);
337 nonoption_flags_max_len = top + 1;
338 __getopt_nonoption_flags = new_str;
339 }
340 }
341#endif
342
343 while (top > middle && middle > bottom)
344 {
345 if (top - middle > middle - bottom)
346 {
347 /* Bottom segment is the short one. */
348 int len = middle - bottom;
349 register int i;
350
351 /* Swap it with the top part of the top segment. */
352 for (i = 0; i < len; i++)
353 {
354 tem = argv[bottom + i];
355 argv[bottom + i] = argv[top - (middle - bottom) + i];
356 argv[top - (middle - bottom) + i] = tem;
357 SWAP_FLAGS (bottom + i, top - (middle - bottom) + i);
358 }
359 /* Exclude the moved bottom segment from further swapping. */
360 top -= len;
361 }
362 else
363 {
364 /* Top segment is the short one. */
365 int len = top - middle;
366 register int i;
367
368 /* Swap it with the bottom part of the bottom segment. */
369 for (i = 0; i < len; i++)
370 {
371 tem = argv[bottom + i];
372 argv[bottom + i] = argv[middle + i];
373 argv[middle + i] = tem;
374 SWAP_FLAGS (bottom + i, middle + i);
375 }
376 /* Exclude the moved top segment from further swapping. */
377 bottom += len;
378 }
379 }
380
381 /* Update records for the slots the non-options now occupy. */
382
383 first_nonopt += (optind - last_nonopt);
384 last_nonopt = optind;
385}
386
387/* Initialize the internal data when the first call is made. */
388
389#if defined (__STDC__) && __STDC__
390static const char *_getopt_initialize (int, char *const *, const char *);
391#endif
392static const char *
393_getopt_initialize (argc, argv, optstring)
394 int argc;
395 char *const *argv;
396 const char *optstring;
397{
398 /* Start processing options with ARGV-element 1 (since ARGV-element 0
399 is the program name); the sequence of previously skipped
400 non-option ARGV-elements is empty. */
401
402 first_nonopt = last_nonopt = optind;
403
404 nextchar = NULL;
405
406 posixly_correct = getenv ("POSIXLY_CORRECT");
407
408 /* Determine how to handle the ordering of options and nonoptions. */
409
410 if (optstring[0] == '-')
411 {
412 ordering = RETURN_IN_ORDER;
413 ++optstring;
414 }
415 else if (optstring[0] == '+')
416 {
417 ordering = REQUIRE_ORDER;
418 ++optstring;
419 }
420 else if (posixly_correct != NULL)
421 ordering = REQUIRE_ORDER;
422 else
423 ordering = PERMUTE;
424
425#ifdef _LIBC
426 if (posixly_correct == NULL
427 && argc == original_argc && argv == original_argv)
428 {
429 if (nonoption_flags_max_len == 0)
430 {
431 if (__getopt_nonoption_flags == NULL
432 || __getopt_nonoption_flags[0] == '\0')
433 nonoption_flags_max_len = -1;
434 else
435 {
436 const char *orig_str = __getopt_nonoption_flags;
437 int len = nonoption_flags_max_len = strlen (orig_str);
438 if (nonoption_flags_max_len < argc)
439 nonoption_flags_max_len = argc;
440 __getopt_nonoption_flags =
441 (char *) malloc (nonoption_flags_max_len);
442 if (__getopt_nonoption_flags == NULL)
443 nonoption_flags_max_len = -1;
444 else
445 {
446 memcpy (__getopt_nonoption_flags, orig_str, len);
447 memset (&__getopt_nonoption_flags[len], '\0',
448 nonoption_flags_max_len - len);
449 }
450 }
451 }
452 nonoption_flags_len = nonoption_flags_max_len;
453 }
454 else
455 nonoption_flags_len = 0;
456#endif
457
458 return optstring;
459}
460
461/* Scan elements of ARGV (whose length is ARGC) for option characters
462 given in OPTSTRING.
463
464 If an element of ARGV starts with '-', and is not exactly "-" or "--",
465 then it is an option element. The characters of this element
466 (aside from the initial '-') are option characters. If `getopt'
467 is called repeatedly, it returns successively each of the option characters
468 from each of the option elements.
469
470 If `getopt' finds another option character, it returns that character,
471 updating `optind' and `nextchar' so that the next call to `getopt' can
472 resume the scan with the following option character or ARGV-element.
473
474 If there are no more option characters, `getopt' returns -1.
475 Then `optind' is the index in ARGV of the first ARGV-element
476 that is not an option. (The ARGV-elements have been permuted
477 so that those that are not options now come last.)
478
479 OPTSTRING is a string containing the legitimate option characters.
480 If an option character is seen that is not listed in OPTSTRING,
481 return '?' after printing an error message. If you set `opterr' to
482 zero, the error message is suppressed but we still return '?'.
483
484 If a char in OPTSTRING is followed by a colon, that means it wants an arg,
485 so the following text in the same ARGV-element, or the text of the following
486 ARGV-element, is returned in `optarg'. Two colons mean an option that
487 wants an optional arg; if there is text in the current ARGV-element,
488 it is returned in `optarg', otherwise `optarg' is set to zero.
489
490 If OPTSTRING starts with `-' or `+', it requests different methods of
491 handling the non-option ARGV-elements.
492 See the comments about RETURN_IN_ORDER and REQUIRE_ORDER, above.
493
494 Long-named options begin with `--' instead of `-'.
495 Their names may be abbreviated as long as the abbreviation is unique
496 or is an exact match for some defined option. If they have an
497 argument, it follows the option name in the same ARGV-element, separated
498 from the option name by a `=', or else the in next ARGV-element.
499 When `getopt' finds a long-named option, it returns 0 if that option's
500 `flag' field is nonzero, the value of the option's `val' field
501 if the `flag' field is zero.
502
503 The elements of ARGV aren't really const, because we permute them.
504 But we pretend they're const in the prototype to be compatible
505 with other systems.
506
507 LONGOPTS is a vector of `struct option' terminated by an
508 element containing a name which is zero.
509
510 LONGIND returns the index in LONGOPT of the long-named option found.
511 It is only valid when a long-named option has been found by the most
512 recent call.
513
514 If LONG_ONLY is nonzero, '-' as well as '--' can introduce
515 long-named options. */
516
517int
518_getopt_internal (argc, argv, optstring, longopts, longind, long_only)
519 int argc;
520 char *const *argv;
521 const char *optstring;
522 const struct option *longopts;
523 int *longind;
524 int long_only;
525{
526 optarg = NULL;
527
528 if (optind == 0 || !__getopt_initialized)
529 {
530 if (optind == 0)
531 optind = 1; /* Don't scan ARGV[0], the program name. */
532 optstring = _getopt_initialize (argc, argv, optstring);
533 __getopt_initialized = 1;
534 }
535
536 /* Test whether ARGV[optind] points to a non-option argument.
537 Either it does not have option syntax, or there is an environment flag
538 from the shell indicating it is not an option. The later information
539 is only used when the used in the GNU libc. */
540#ifdef _LIBC
541#define NONOPTION_P (argv[optind][0] != '-' || argv[optind][1] == '\0' \
542 || (optind < nonoption_flags_len \
543 && __getopt_nonoption_flags[optind] == '1'))
544#else
545#define NONOPTION_P (argv[optind][0] != '-' || argv[optind][1] == '\0')
546#endif
547
548 if (nextchar == NULL || *nextchar == '\0')
549 {
550 /* Advance to the next ARGV-element. */
551
552 /* Give FIRST_NONOPT & LAST_NONOPT rational values if OPTIND has been
553 moved back by the user (who may also have changed the arguments). */
554 if (last_nonopt > optind)
555 last_nonopt = optind;
556 if (first_nonopt > optind)
557 first_nonopt = optind;
558
559 if (ordering == PERMUTE)
560 {
561 /* If we have just processed some options following some non-options,
562 exchange them so that the options come first. */
563
564 if (first_nonopt != last_nonopt && last_nonopt != optind)
565 exchange ((char **) argv);
566 else if (last_nonopt != optind)
567 first_nonopt = optind;
568
569 /* Skip any additional non-options
570 and extend the range of non-options previously skipped. */
571
572 while (optind < argc && NONOPTION_P)
573 optind++;
574 last_nonopt = optind;
575 }
576
577 /* The special ARGV-element `--' means premature end of options.
578 Skip it like a null option,
579 then exchange with previous non-options as if it were an option,
580 then skip everything else like a non-option. */
581
582 if (optind != argc && !strcmp (argv[optind], "--"))
583 {
584 optind++;
585
586 if (first_nonopt != last_nonopt && last_nonopt != optind)
587 exchange ((char **) argv);
588 else if (first_nonopt == last_nonopt)
589 first_nonopt = optind;
590 last_nonopt = argc;
591
592 optind = argc;
593 }
594
595 /* If we have done all the ARGV-elements, stop the scan
596 and back over any non-options that we skipped and permuted. */
597
598 if (optind == argc)
599 {
600 /* Set the next-arg-index to point at the non-options
601 that we previously skipped, so the caller will digest them. */
602 if (first_nonopt != last_nonopt)
603 optind = first_nonopt;
604 return -1;
605 }
606
607 /* If we have come to a non-option and did not permute it,
608 either stop the scan or describe it to the caller and pass it by. */
609
610 if (NONOPTION_P)
611 {
612 if (ordering == REQUIRE_ORDER)
613 return -1;
614 optarg = argv[optind++];
615 return 1;
616 }
617
618 /* We have found another option-ARGV-element.
619 Skip the initial punctuation. */
620
621 nextchar = (argv[optind] + 1
622 + (longopts != NULL && argv[optind][1] == '-'));
623 }
624
625 /* Decode the current option-ARGV-element. */
626
627 /* Check whether the ARGV-element is a long option.
628
629 If long_only and the ARGV-element has the form "-f", where f is
630 a valid short option, don't consider it an abbreviated form of
631 a long option that starts with f. Otherwise there would be no
632 way to give the -f short option.
633
634 On the other hand, if there's a long option "fubar" and
635 the ARGV-element is "-fu", do consider that an abbreviation of
636 the long option, just like "--fu", and not "-f" with arg "u".
637
638 This distinction seems to be the most useful approach. */
639
640 if (longopts != NULL
641 && (argv[optind][1] == '-'
642 || (long_only && (argv[optind][2] || !my_index (optstring, argv[optind][1])))))
643 {
644 char *nameend;
645 const struct option *p;
646 const struct option *pfound = NULL;
647 int exact = 0;
648 int ambig = 0;
649 int indfound = -1;
650 int option_index;
651
652 for (nameend = nextchar; *nameend && *nameend != '='; nameend++)
653 /* Do nothing. */ ;
654
655 /* Test all long options for either exact match
656 or abbreviated matches. */
657 for (p = longopts, option_index = 0; p->name; p++, option_index++)
658 if (!strncmp (p->name, nextchar, nameend - nextchar))
659 {
660 if ((unsigned int) (nameend - nextchar)
661 == (unsigned int) strlen (p->name))
662 {
663 /* Exact match found. */
664 pfound = p;
665 indfound = option_index;
666 exact = 1;
667 break;
668 }
669 else if (pfound == NULL)
670 {
671 /* First nonexact match found. */
672 pfound = p;
673 indfound = option_index;
674 }
675 else
676 /* Second or later nonexact match found. */
677 ambig = 1;
678 }
679
680 if (ambig && !exact)
681 {
682 if (opterr)
683 fprintf (stderr, _("%s: option `%s' is ambiguous\n"),
684 argv[0], argv[optind]);
685 nextchar += strlen (nextchar);
686 optind++;
687 optopt = 0;
688 return '?';
689 }
690
691 if (pfound != NULL)
692 {
693 option_index = indfound;
694 optind++;
695 if (*nameend)
696 {
697 /* Don't test has_arg with >, because some C compilers don't
698 allow it to be used on enums. */
699 if (pfound->has_arg)
700 optarg = nameend + 1;
701 else
702 {
703 if (opterr)
704 if (argv[optind - 1][1] == '-')
705 /* --option */
706 fprintf (stderr,
707 _("%s: option `--%s' doesn't allow an argument\n"),
708 argv[0], pfound->name);
709 else
710 /* +option or -option */
711 fprintf (stderr,
712 _("%s: option `%c%s' doesn't allow an argument\n"),
713 argv[0], argv[optind - 1][0], pfound->name);
714
715 nextchar += strlen (nextchar);
716
717 optopt = pfound->val;
718 return '?';
719 }
720 }
721 else if (pfound->has_arg == 1)
722 {
723 if (optind < argc)
724 optarg = argv[optind++];
725 else
726 {
727 if (opterr)
728 fprintf (stderr,
729 _("%s: option `%s' requires an argument\n"),
730 argv[0], argv[optind - 1]);
731 nextchar += strlen (nextchar);
732 optopt = pfound->val;
733 return optstring[0] == ':' ? ':' : '?';
734 }
735 }
736 nextchar += strlen (nextchar);
737 if (longind != NULL)
738 *longind = option_index;
739 if (pfound->flag)
740 {
741 *(pfound->flag) = pfound->val;
742 return 0;
743 }
744 return pfound->val;
745 }
746
747 /* Can't find it as a long option. If this is not getopt_long_only,
748 or the option starts with '--' or is not a valid short
749 option, then it's an error.
750 Otherwise interpret it as a short option. */
751 if (!long_only || argv[optind][1] == '-'
752 || my_index (optstring, *nextchar) == NULL)
753 {
754 if (opterr)
755 {
756 if (argv[optind][1] == '-')
757 /* --option */
758 fprintf (stderr, _("%s: unrecognized option `--%s'\n"),
759 argv[0], nextchar);
760 else
761 /* +option or -option */
762 fprintf (stderr, _("%s: unrecognized option `%c%s'\n"),
763 argv[0], argv[optind][0], nextchar);
764 }
765 nextchar = (char *) "";
766 optind++;
767 optopt = 0;
768 return '?';
769 }
770 }
771
772 /* Look at and handle the next short option-character. */
773
774 {
775 char c = *nextchar++;
776 char *temp = my_index (optstring, c);
777
778 /* Increment `optind' when we start to process its last character. */
779 if (*nextchar == '\0')
780 ++optind;
781
782 if (temp == NULL || c == ':')
783 {
784 if (opterr)
785 {
786 if (posixly_correct)
787 /* 1003.2 specifies the format of this message. */
788 fprintf (stderr, _("%s: illegal option -- %c\n"),
789 argv[0], c);
790 else
791 fprintf (stderr, _("%s: invalid option -- %c\n"),
792 argv[0], c);
793 }
794 optopt = c;
795 return '?';
796 }
797 /* Convenience. Treat POSIX -W foo same as long option --foo */
798 if (temp[0] == 'W' && temp[1] == ';')
799 {
800 char *nameend;
801 const struct option *p;
802 const struct option *pfound = NULL;
803 int exact = 0;
804 int ambig = 0;
805 int indfound = 0;
806 int option_index;
807
808 /* This is an option that requires an argument. */
809 if (*nextchar != '\0')
810 {
811 optarg = nextchar;
812 /* If we end this ARGV-element by taking the rest as an arg,
813 we must advance to the next element now. */
814 optind++;
815 }
816 else if (optind == argc)
817 {
818 if (opterr)
819 {
820 /* 1003.2 specifies the format of this message. */
821 fprintf (stderr, _("%s: option requires an argument -- %c\n"),
822 argv[0], c);
823 }
824 optopt = c;
825 if (optstring[0] == ':')
826 c = ':';
827 else
828 c = '?';
829 return c;
830 }
831 else
832 /* We already incremented `optind' once;
833 increment it again when taking next ARGV-elt as argument. */
834 optarg = argv[optind++];
835
836 /* optarg is now the argument, see if it's in the
837 table of longopts. */
838
839 for (nextchar = nameend = optarg; *nameend && *nameend != '='; nameend++)
840 /* Do nothing. */ ;
841
842 /* Test all long options for either exact match
843 or abbreviated matches. */
844 for (p = longopts, option_index = 0; p->name; p++, option_index++)
845 if (!strncmp (p->name, nextchar, nameend - nextchar))
846 {
847 if ((unsigned int) (nameend - nextchar) == strlen (p->name))
848 {
849 /* Exact match found. */
850 pfound = p;
851 indfound = option_index;
852 exact = 1;
853 break;
854 }
855 else if (pfound == NULL)
856 {
857 /* First nonexact match found. */
858 pfound = p;
859 indfound = option_index;
860 }
861 else
862 /* Second or later nonexact match found. */
863 ambig = 1;
864 }
865 if (ambig && !exact)
866 {
867 if (opterr)
868 fprintf (stderr, _("%s: option `-W %s' is ambiguous\n"),
869 argv[0], argv[optind]);
870 nextchar += strlen (nextchar);
871 optind++;
872 return '?';
873 }
874 if (pfound != NULL)
875 {
876 option_index = indfound;
877 if (*nameend)
878 {
879 /* Don't test has_arg with >, because some C compilers don't
880 allow it to be used on enums. */
881 if (pfound->has_arg)
882 optarg = nameend + 1;
883 else
884 {
885 if (opterr)
886 fprintf (stderr, _("\
887%s: option `-W %s' doesn't allow an argument\n"),
888 argv[0], pfound->name);
889
890 nextchar += strlen (nextchar);
891 return '?';
892 }
893 }
894 else if (pfound->has_arg == 1)
895 {
896 if (optind < argc)
897 optarg = argv[optind++];
898 else
899 {
900 if (opterr)
901 fprintf (stderr,
902 _("%s: option `%s' requires an argument\n"),
903 argv[0], argv[optind - 1]);
904 nextchar += strlen (nextchar);
905 return optstring[0] == ':' ? ':' : '?';
906 }
907 }
908 nextchar += strlen (nextchar);
909 if (longind != NULL)
910 *longind = option_index;
911 if (pfound->flag)
912 {
913 *(pfound->flag) = pfound->val;
914 return 0;
915 }
916 return pfound->val;
917 }
918 nextchar = NULL;
919 return 'W'; /* Let the application handle it. */
920 }
921 if (temp[1] == ':')
922 {
923 if (temp[2] == ':')
924 {
925 /* This is an option that accepts an argument optionally. */
926 if (*nextchar != '\0')
927 {
928 optarg = nextchar;
929 optind++;
930 }
931 else
932 optarg = NULL;
933 nextchar = NULL;
934 }
935 else
936 {
937 /* This is an option that requires an argument. */
938 if (*nextchar != '\0')
939 {
940 optarg = nextchar;
941 /* If we end this ARGV-element by taking the rest as an arg,
942 we must advance to the next element now. */
943 optind++;
944 }
945 else if (optind == argc)
946 {
947 if (opterr)
948 {
949 /* 1003.2 specifies the format of this message. */
950 fprintf (stderr,
951 _("%s: option requires an argument -- %c\n"),
952 argv[0], c);
953 }
954 optopt = c;
955 if (optstring[0] == ':')
956 c = ':';
957 else
958 c = '?';
959 }
960 else
961 /* We already incremented `optind' once;
962 increment it again when taking next ARGV-elt as argument. */
963 optarg = argv[optind++];
964 nextchar = NULL;
965 }
966 }
967 return c;
968 }
969}
970
971int
972getopt (argc, argv, optstring)
973 int argc;
974 char *const *argv;
975 const char *optstring;
976{
977 return _getopt_internal (argc, argv, optstring,
978 (const struct option *) 0,
979 (int *) 0,
980 0);
981}
982
983#endif /* Not ELIDE_CODE. */
984
985#ifdef TEST
986
987/* Compile with -DTEST to make an executable for use in testing
988 the above definition of `getopt'. */
989
990int
991main (argc, argv)
992 int argc;
993 char **argv;
994{
995 int c;
996 int digit_optind = 0;
997
998 while (1)
999 {
1000 int this_option_optind = optind ? optind : 1;
1001
1002 c = getopt (argc, argv, "abc:d:0123456789");
1003 if (c == -1)
1004 break;
1005
1006 switch (c)
1007 {
1008 case '0':
1009 case '1':
1010 case '2':
1011 case '3':
1012 case '4':
1013 case '5':
1014 case '6':
1015 case '7':
1016 case '8':
1017 case '9':
1018 if (digit_optind != 0 && digit_optind != this_option_optind)
1019 printf ("digits occur in two different argv-elements.\n");
1020 digit_optind = this_option_optind;
1021 printf ("option %c\n", c);
1022 break;
1023
1024 case 'a':
1025 printf ("option a\n");
1026 break;
1027
1028 case 'b':
1029 printf ("option b\n");
1030 break;
1031
1032 case 'c':
1033 printf ("option c with value `%s'\n", optarg);
1034 break;
1035
1036 case '?':
1037 break;
1038
1039 default:
1040 printf ("?? getopt returned character code 0%o ??\n", c);
1041 }
1042 }
1043
1044 if (optind < argc)
1045 {
1046 printf ("non-option ARGV-elements: ");
1047 while (optind < argc)
1048 printf ("%s ", argv[optind++]);
1049 printf ("\n");
1050 }
1051
1052 exit (0);
1053}
1054
1055#endif /* TEST */
diff --git a/src/strftime.c b/src/strftime.c
new file mode 100644
index 00000000000..c0cc077b072
--- /dev/null
+++ b/src/strftime.c
@@ -0,0 +1,1055 @@
1/* Copyright (C) 1991, 92, 93, 94, 95, 96, 97 Free Software Foundation, Inc.
2
3NOTE: The canonical source of this file is maintained with the GNU C Library.
4Bugs can be reported to bug-glibc@prep.ai.mit.edu.
5
6This program is free software; you can redistribute it and/or modify it
7under the terms of the GNU General Public License as published by the
8Free Software Foundation; either version 2, or (at your option) any
9later version.
10
11This program is distributed in the hope that it will be useful,
12but WITHOUT ANY WARRANTY; without even the implied warranty of
13MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14GNU General Public License for more details.
15
16You should have received a copy of the GNU General Public License
17along with this program; if not, write to the Free Software
18Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
19USA. */
20
21#ifdef HAVE_CONFIG_H
22# include <config.h>
23#endif
24
25#ifdef _LIBC
26# define HAVE_LIMITS_H 1
27# define HAVE_MBLEN 1
28# define HAVE_MBRLEN 1
29# define HAVE_STRUCT_ERA_ENTRY 1
30# define HAVE_TM_GMTOFF 1
31# define HAVE_TM_ZONE 1
32# define HAVE_TZNAME 1
33# define HAVE_TZSET 1
34# define MULTIBYTE_IS_FORMAT_SAFE 1
35# define STDC_HEADERS 1
36# include <ansidecl.h>
37# include "../locale/localeinfo.h"
38#endif
39
40#include <ctype.h>
41#include <sys/types.h> /* Some systems define `time_t' here. */
42
43#ifdef TIME_WITH_SYS_TIME
44# include <sys/time.h>
45# include <time.h>
46#else
47# ifdef HAVE_SYS_TIME_H
48# include <sys/time.h>
49# else
50# include <time.h>
51# endif
52#endif
53#if HAVE_TZNAME
54extern char *tzname[];
55#endif
56
57/* Do multibyte processing if multibytes are supported, unless
58 multibyte sequences are safe in formats. Multibyte sequences are
59 safe if they cannot contain byte sequences that look like format
60 conversion specifications. The GNU C Library uses UTF8 multibyte
61 encoding, which is safe for formats, but strftime.c can be used
62 with other C libraries that use unsafe encodings. */
63#define DO_MULTIBYTE (HAVE_MBLEN && ! MULTIBYTE_IS_FORMAT_SAFE)
64
65#if DO_MULTIBYTE
66# if HAVE_MBRLEN
67# include <wchar.h>
68# else
69 /* Simulate mbrlen with mblen as best we can. */
70# define mbstate_t int
71# define mbrlen(s, n, ps) mblen (s, n)
72# define mbsinit(ps) (*(ps) == 0)
73# endif
74 static const mbstate_t mbstate_zero;
75#endif
76
77#if HAVE_LIMITS_H
78# include <limits.h>
79#endif
80
81#if STDC_HEADERS
82# include <stddef.h>
83# include <stdlib.h>
84# include <string.h>
85#else
86# define memcpy(d, s, n) bcopy ((s), (d), (n))
87#endif
88
89#ifndef __P
90# if defined (__GNUC__) || (defined (__STDC__) && __STDC__)
91# define __P(args) args
92# else
93# define __P(args) ()
94# endif /* GCC. */
95#endif /* Not __P. */
96
97#ifndef PTR
98# ifdef __STDC__
99# define PTR void *
100# else
101# define PTR char *
102# endif
103#endif
104
105#ifndef CHAR_BIT
106# define CHAR_BIT 8
107#endif
108
109#ifndef NULL
110# define NULL 0
111#endif
112
113#define TYPE_SIGNED(t) ((t) -1 < 0)
114
115/* Bound on length of the string representing an integer value of type t.
116 Subtract one for the sign bit if t is signed;
117 302 / 1000 is log10 (2) rounded up;
118 add one for integer division truncation;
119 add one more for a minus sign if t is signed. */
120#define INT_STRLEN_BOUND(t) \
121 ((sizeof (t) * CHAR_BIT - TYPE_SIGNED (t)) * 302 / 100 + 1 + TYPE_SIGNED (t))
122
123#define TM_YEAR_BASE 1900
124
125#ifndef __isleap
126/* Nonzero if YEAR is a leap year (every 4 years,
127 except every 100th isn't, and every 400th is). */
128# define __isleap(year) \
129 ((year) % 4 == 0 && ((year) % 100 != 0 || (year) % 400 == 0))
130#endif
131
132
133#ifdef _LIBC
134# define gmtime_r __gmtime_r
135# define localtime_r __localtime_r
136extern int __tz_compute __P ((time_t timer, const struct tm *tm));
137# define tzname __tzname
138# define tzset __tzset
139#else
140# if ! HAVE_LOCALTIME_R
141# if ! HAVE_TM_GMTOFF
142/* Approximate gmtime_r as best we can in its absence. */
143# define gmtime_r my_gmtime_r
144static struct tm *gmtime_r __P ((const time_t *, struct tm *));
145static struct tm *
146gmtime_r (t, tp)
147 const time_t *t;
148 struct tm *tp;
149{
150 struct tm *l = gmtime (t);
151 if (! l)
152 return 0;
153 *tp = *l;
154 return tp;
155}
156# endif /* ! HAVE_TM_GMTOFF */
157
158/* Approximate localtime_r as best we can in its absence. */
159# define localtime_r my_localtime_r
160static struct tm *localtime_r __P ((const time_t *, struct tm *));
161static struct tm *
162localtime_r (t, tp)
163 const time_t *t;
164 struct tm *tp;
165{
166 struct tm *l = localtime (t);
167 if (! l)
168 return 0;
169 *tp = *l;
170 return tp;
171}
172# endif /* ! HAVE_LOCALTIME_R */
173#endif /* ! defined (_LIBC) */
174
175
176#if !defined (memset) && !defined (HAVE_MEMSET) && !defined (_LIBC)
177/* Some systems lack the `memset' function and we don't want to
178 introduce additional dependencies. */
179static const char spaces[16] = " ";
180
181# define memset_space(P, Len) \
182 do { \
183 int _len = (Len); \
184 \
185 do \
186 { \
187 int _this = _len > 16 ? 16 : _len; \
188 memcpy ((P), spaces, _this); \
189 (P) += _this; \
190 _len -= _this; \
191 } \
192 while (_len > 0); \
193 } while (0)
194#else
195# define memset_space(P, Len) (memset ((P), ' ', (Len)), (P) += (Len))
196#endif
197
198#define add(n, f) \
199 do \
200 { \
201 int _n = (n); \
202 int _delta = width - _n; \
203 int _incr = _n + (_delta > 0 ? _delta : 0); \
204 if (i + _incr >= maxsize) \
205 return 0; \
206 if (p) \
207 { \
208 if (_delta > 0) \
209 memset_space (p, _delta); \
210 f; \
211 p += _n; \
212 } \
213 i += _incr; \
214 } while (0)
215
216#define cpy(n, s) \
217 add ((n), \
218 if (to_lowcase) \
219 memcpy_lowcase (p, (s), _n); \
220 else if (to_uppcase) \
221 memcpy_uppcase (p, (s), _n); \
222 else \
223 memcpy ((PTR) p, (PTR) (s), _n))
224
225
226
227#ifdef _LIBC
228# define TOUPPER(Ch) toupper (Ch)
229# define TOLOWER(Ch) tolower (Ch)
230#else
231# define TOUPPER(Ch) (islower (Ch) ? toupper (Ch) : (Ch))
232# define TOLOWER(Ch) (isupper (Ch) ? tolower (Ch) : (Ch))
233#endif
234/* We don't use `isdigit' here since the locale dependent
235 interpretation is not what we want here. We only need to accept
236 the arabic digits in the ASCII range. One day there is perhaps a
237 more reliable way to accept other sets of digits. */
238#define ISDIGIT(Ch) ((unsigned int) (Ch) - '0' <= 9)
239
240static char *memcpy_lowcase __P ((char *dest, const char *src, size_t len));
241
242static char *
243memcpy_lowcase (dest, src, len)
244 char *dest;
245 const char *src;
246 size_t len;
247{
248 while (len-- > 0)
249 dest[len] = TOLOWER (src[len]);
250 return dest;
251}
252
253static char *memcpy_uppcase __P ((char *dest, const char *src, size_t len));
254
255static char *
256memcpy_uppcase (dest, src, len)
257 char *dest;
258 const char *src;
259 size_t len;
260{
261 while (len-- > 0)
262 dest[len] = TOUPPER (src[len]);
263 return dest;
264}
265
266#if ! HAVE_TM_GMTOFF
267/* Yield the difference between *A and *B,
268 measured in seconds, ignoring leap seconds. */
269static int tm_diff __P ((const struct tm *, const struct tm *));
270static int
271tm_diff (a, b)
272 const struct tm *a;
273 const struct tm *b;
274{
275 /* Compute intervening leap days correctly even if year is negative.
276 Take care to avoid int overflow in leap day calculations,
277 but it's OK to assume that A and B are close to each other. */
278 int a4 = (a->tm_year >> 2) + (TM_YEAR_BASE >> 2) - ! (a->tm_year & 3);
279 int b4 = (b->tm_year >> 2) + (TM_YEAR_BASE >> 2) - ! (b->tm_year & 3);
280 int a100 = a4 / 25 - (a4 % 25 < 0);
281 int b100 = b4 / 25 - (b4 % 25 < 0);
282 int a400 = a100 >> 2;
283 int b400 = b100 >> 2;
284 int intervening_leap_days = (a4 - b4) - (a100 - b100) + (a400 - b400);
285 int years = a->tm_year - b->tm_year;
286 int days = (365 * years + intervening_leap_days
287 + (a->tm_yday - b->tm_yday));
288 return (60 * (60 * (24 * days + (a->tm_hour - b->tm_hour))
289 + (a->tm_min - b->tm_min))
290 + (a->tm_sec - b->tm_sec));
291}
292#endif /* ! HAVE_TM_GMTOFF */
293
294
295
296/* The number of days from the first day of the first ISO week of this
297 year to the year day YDAY with week day WDAY. ISO weeks start on
298 Monday; the first ISO week has the year's first Thursday. YDAY may
299 be as small as YDAY_MINIMUM. */
300#define ISO_WEEK_START_WDAY 1 /* Monday */
301#define ISO_WEEK1_WDAY 4 /* Thursday */
302#define YDAY_MINIMUM (-366)
303static int iso_week_days __P ((int, int));
304#ifdef __GNUC__
305inline
306#endif
307static int
308iso_week_days (yday, wday)
309 int yday;
310 int wday;
311{
312 /* Add enough to the first operand of % to make it nonnegative. */
313 int big_enough_multiple_of_7 = (-YDAY_MINIMUM / 7 + 2) * 7;
314 return (yday
315 - (yday - wday + ISO_WEEK1_WDAY + big_enough_multiple_of_7) % 7
316 + ISO_WEEK1_WDAY - ISO_WEEK_START_WDAY);
317}
318
319
320#ifndef _NL_CURRENT
321static char const weekday_name[][10] =
322 {
323 "Sunday", "Monday", "Tuesday", "Wednesday",
324 "Thursday", "Friday", "Saturday"
325 };
326static char const month_name[][10] =
327 {
328 "January", "February", "March", "April", "May", "June",
329 "July", "August", "September", "October", "November", "December"
330 };
331#endif
332
333
334#if !defined _LIBC && HAVE_TZNAME && HAVE_TZSET
335 /* Solaris 2.5 tzset sometimes modifies the storage returned by localtime.
336 Work around this bug by copying *tp before it might be munged. */
337 size_t _strftime_copytm __P ((char *, size_t, const char *,
338 const struct tm *));
339 size_t
340 strftime (s, maxsize, format, tp)
341 char *s;
342 size_t maxsize;
343 const char *format;
344 const struct tm *tp;
345 {
346 struct tm tmcopy;
347 tmcopy = *tp;
348 return _strftime_copytm (s, maxsize, format, &tmcopy);
349 }
350# ifdef strftime
351# undef strftime
352# endif
353# define strftime(S, Maxsize, Format, Tp) \
354 _strftime_copytm (S, Maxsize, Format, Tp)
355#endif
356
357
358/* Write information from TP into S according to the format
359 string FORMAT, writing no more that MAXSIZE characters
360 (including the terminating '\0') and returning number of
361 characters written. If S is NULL, nothing will be written
362 anywhere, so to determine how many characters would be
363 written, use NULL for S and (size_t) UINT_MAX for MAXSIZE. */
364size_t
365strftime (s, maxsize, format, tp)
366 char *s;
367 size_t maxsize;
368 const char *format;
369 const struct tm *tp;
370{
371 int hour12 = tp->tm_hour;
372#ifdef _NL_CURRENT
373 const char *const a_wkday = _NL_CURRENT (LC_TIME, ABDAY_1 + tp->tm_wday);
374 const char *const f_wkday = _NL_CURRENT (LC_TIME, DAY_1 + tp->tm_wday);
375 const char *const a_month = _NL_CURRENT (LC_TIME, ABMON_1 + tp->tm_mon);
376 const char *const f_month = _NL_CURRENT (LC_TIME, MON_1 + tp->tm_mon);
377 const char *const ampm = _NL_CURRENT (LC_TIME,
378 hour12 > 11 ? PM_STR : AM_STR);
379 size_t aw_len = strlen (a_wkday);
380 size_t am_len = strlen (a_month);
381 size_t ap_len = strlen (ampm);
382#else
383 const char *const f_wkday = weekday_name[tp->tm_wday];
384 const char *const f_month = month_name[tp->tm_mon];
385 const char *const a_wkday = f_wkday;
386 const char *const a_month = f_month;
387 const char *const ampm = "AMPM" + 2 * (hour12 > 11);
388 size_t aw_len = 3;
389 size_t am_len = 3;
390 size_t ap_len = 2;
391#endif
392 size_t wkday_len = strlen (f_wkday);
393 size_t month_len = strlen (f_month);
394 const char *zone;
395 size_t zonelen;
396 size_t i = 0;
397 char *p = s;
398 const char *f;
399
400 zone = NULL;
401#if !defined _LIBC && HAVE_TM_ZONE
402 /* XXX We have some problems here. First, the string pointed to by
403 tm_zone is dynamically allocated while loading the zone data. But
404 when another zone is loaded since the information in TP were
405 computed this would be a stale pointer.
406 The second problem is the POSIX test suite which assumes setting
407 the environment variable TZ to a new value before calling strftime()
408 will influence the result (the %Z format) even if the information in
409 TP is computed with a totally different time zone. --drepper@gnu */
410 zone = (const char *) tp->tm_zone;
411#endif
412#if HAVE_TZNAME
413 /* POSIX.1 8.1.1 requires that whenever strftime() is called, the
414 time zone names contained in the external variable `tzname' shall
415 be set as if the tzset() function had been called. */
416# if HAVE_TZSET
417 tzset ();
418# endif
419
420 if (!(zone && *zone) && tp->tm_isdst >= 0)
421 zone = tzname[tp->tm_isdst];
422#endif
423 if (! zone)
424 zone = ""; /* POSIX.2 requires the empty string here. */
425
426 zonelen = strlen (zone);
427
428 if (hour12 > 12)
429 hour12 -= 12;
430 else
431 if (hour12 == 0) hour12 = 12;
432
433 for (f = format; *f != '\0'; ++f)
434 {
435 int pad; /* Padding for number ('-', '_', or 0). */
436 int modifier; /* Field modifier ('E', 'O', or 0). */
437 int digits; /* Max digits for numeric format. */
438 int number_value; /* Numeric value to be printed. */
439 int negative_number; /* 1 if the number is negative. */
440 const char *subfmt;
441 char *bufp;
442 char buf[1 + (sizeof (int) < sizeof (time_t)
443 ? INT_STRLEN_BOUND (time_t)
444 : INT_STRLEN_BOUND (int))];
445 int width = -1;
446 int to_lowcase = 0;
447 int to_uppcase = 0;
448
449#if DO_MULTIBYTE
450
451 switch (*f)
452 {
453 case '%':
454 break;
455
456 case '\a': case '\b': case '\t': case '\n':
457 case '\v': case '\f': case '\r':
458 case ' ': case '!': case '"': case '#': case '&': case'\'':
459 case '(': case ')': case '*': case '+': case ',': case '-':
460 case '.': case '/': case '0': case '1': case '2': case '3':
461 case '4': case '5': case '6': case '7': case '8': case '9':
462 case ':': case ';': case '<': case '=': case '>': case '?':
463 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
464 case 'G': case 'H': case 'I': case 'J': case 'K': case 'L':
465 case 'M': case 'N': case 'O': case 'P': case 'Q': case 'R':
466 case 'S': case 'T': case 'U': case 'V': case 'W': case 'X':
467 case 'Y': case 'Z': case '[': case'\\': case ']': case '^':
468 case '_': case 'a': case 'b': case 'c': case 'd': case 'e':
469 case 'f': case 'g': case 'h': case 'i': case 'j': case 'k':
470 case 'l': case 'm': case 'n': case 'o': case 'p': case 'q':
471 case 'r': case 's': case 't': case 'u': case 'v': case 'w':
472 case 'x': case 'y': case 'z': case '{': case '|': case '}':
473 case '~':
474 /* The C Standard requires these 98 characters (plus '%') to
475 be in the basic execution character set. None of these
476 characters can start a multibyte sequence, so they need
477 not be analyzed further. */
478 add (1, *p = *f);
479 continue;
480
481 default:
482 /* Copy this multibyte sequence until we reach its end, find
483 an error, or come back to the initial shift state. */
484 {
485 mbstate_t mbstate = mbstate_zero;
486 size_t len = 0;
487
488 do
489 {
490 size_t bytes = mbrlen (f + len, (size_t) -1, &mbstate);
491
492 if (bytes == 0)
493 break;
494
495 if (bytes == (size_t) -2 || bytes == (size_t) -1)
496 {
497 len++;
498 break;
499 }
500
501 len += bytes;
502 }
503 while (! mbsinit (&mbstate));
504
505 cpy (len, f);
506 continue;
507 }
508 }
509
510#else /* ! DO_MULTIBYTE */
511
512 /* Either multibyte encodings are not supported, or they are
513 safe for formats, so any non-'%' byte can be copied through. */
514 if (*f != '%')
515 {
516 add (1, *p = *f);
517 continue;
518 }
519
520#endif /* ! DO_MULTIBYTE */
521
522 /* Check for flags that can modify a format. */
523 pad = 0;
524 while (1)
525 {
526 switch (*++f)
527 {
528 /* This influences the number formats. */
529 case '_':
530 case '-':
531 case '0':
532 pad = *f;
533 continue;
534
535 /* This changes textual output. */
536 case '^':
537 to_uppcase = 1;
538 continue;
539
540 default:
541 break;
542 }
543 break;
544 }
545
546 /* As a GNU extension we allow to specify the field width. */
547 if (ISDIGIT (*f))
548 {
549 width = 0;
550 do
551 {
552 width *= 10;
553 width += *f - '0';
554 ++f;
555 }
556 while (ISDIGIT (*f));
557 }
558
559 /* Check for modifiers. */
560 switch (*f)
561 {
562 case 'E':
563 case 'O':
564 modifier = *f++;
565 break;
566
567 default:
568 modifier = 0;
569 break;
570 }
571
572 /* Now do the specified format. */
573 switch (*f)
574 {
575#define DO_NUMBER(d, v) \
576 digits = d; number_value = v; goto do_number
577#define DO_NUMBER_SPACEPAD(d, v) \
578 digits = d; number_value = v; goto do_number_spacepad
579
580 case '%':
581 if (modifier != 0)
582 goto bad_format;
583 add (1, *p = *f);
584 break;
585
586 case 'a':
587 if (modifier != 0)
588 goto bad_format;
589 cpy (aw_len, a_wkday);
590 break;
591
592 case 'A':
593 if (modifier != 0)
594 goto bad_format;
595 cpy (wkday_len, f_wkday);
596 break;
597
598 case 'b':
599 case 'h': /* POSIX.2 extension. */
600 if (modifier != 0)
601 goto bad_format;
602 cpy (am_len, a_month);
603 break;
604
605 case 'B':
606 if (modifier != 0)
607 goto bad_format;
608 cpy (month_len, f_month);
609 break;
610
611 case 'c':
612 if (modifier == 'O')
613 goto bad_format;
614#ifdef _NL_CURRENT
615 if (! (modifier == 'E'
616 && *(subfmt = _NL_CURRENT (LC_TIME, ERA_D_T_FMT)) != '\0'))
617 subfmt = _NL_CURRENT (LC_TIME, D_T_FMT);
618#else
619 subfmt = "%a %b %e %H:%M:%S %Y";
620#endif
621
622 subformat:
623 {
624 char *old_start = p;
625 size_t len = strftime (NULL, maxsize - i, subfmt, tp);
626 if (len == 0 && *subfmt)
627 return 0;
628 add (len, strftime (p, maxsize - i, subfmt, tp));
629
630 if (to_uppcase)
631 while (old_start < p)
632 {
633 *old_start = TOUPPER (*old_start);
634 ++old_start;
635 }
636 }
637 break;
638
639 case 'C': /* POSIX.2 extension. */
640 if (modifier == 'O')
641 goto bad_format;
642#if HAVE_STRUCT_ERA_ENTRY
643 if (modifier == 'E')
644 {
645 struct era_entry *era = _nl_get_era_entry (tp);
646 if (era)
647 {
648 size_t len = strlen (era->name_fmt);
649 cpy (len, era->name_fmt);
650 break;
651 }
652 }
653#endif
654 {
655 int year = tp->tm_year + TM_YEAR_BASE;
656 DO_NUMBER (1, year / 100 - (year % 100 < 0));
657 }
658
659 case 'x':
660 if (modifier == 'O')
661 goto bad_format;
662#ifdef _NL_CURRENT
663 if (! (modifier == 'E'
664 && *(subfmt = _NL_CURRENT (LC_TIME, ERA_D_FMT)) != '\0'))
665 subfmt = _NL_CURRENT (LC_TIME, D_FMT);
666 goto subformat;
667#endif
668 /* Fall through. */
669 case 'D': /* POSIX.2 extension. */
670 if (modifier != 0)
671 goto bad_format;
672 subfmt = "%m/%d/%y";
673 goto subformat;
674
675 case 'd':
676 if (modifier == 'E')
677 goto bad_format;
678
679 DO_NUMBER (2, tp->tm_mday);
680
681 case 'e': /* POSIX.2 extension. */
682 if (modifier == 'E')
683 goto bad_format;
684
685 DO_NUMBER_SPACEPAD (2, tp->tm_mday);
686
687 /* All numeric formats set DIGITS and NUMBER_VALUE and then
688 jump to one of these two labels. */
689
690 do_number_spacepad:
691 /* Force `_' flag unless overwritten by `0' flag. */
692 if (pad != '0')
693 pad = '_';
694
695 do_number:
696 /* Format the number according to the MODIFIER flag. */
697
698#ifdef _NL_CURRENT
699 if (modifier == 'O' && 0 <= number_value)
700 {
701 /* Get the locale specific alternate representation of
702 the number NUMBER_VALUE. If none exist NULL is returned. */
703 const char *cp = _nl_get_alt_digit (number_value);
704
705 if (cp != NULL)
706 {
707 size_t digitlen = strlen (cp);
708 if (digitlen != 0)
709 {
710 cpy (digitlen, cp);
711 break;
712 }
713 }
714 }
715#endif
716 {
717 unsigned int u = number_value;
718
719 bufp = buf + sizeof (buf);
720 negative_number = number_value < 0;
721
722 if (negative_number)
723 u = -u;
724
725 do
726 *--bufp = u % 10 + '0';
727 while ((u /= 10) != 0);
728 }
729
730 do_number_sign_and_padding:
731 if (negative_number)
732 *--bufp = '-';
733
734 if (pad != '-')
735 {
736 int padding = digits - (buf + sizeof (buf) - bufp);
737
738 if (pad == '_')
739 {
740 while (0 < padding--)
741 *--bufp = ' ';
742 }
743 else
744 {
745 bufp += negative_number;
746 while (0 < padding--)
747 *--bufp = '0';
748 if (negative_number)
749 *--bufp = '-';
750 }
751 }
752
753 cpy (buf + sizeof (buf) - bufp, bufp);
754 break;
755
756
757 case 'H':
758 if (modifier == 'E')
759 goto bad_format;
760
761 DO_NUMBER (2, tp->tm_hour);
762
763 case 'I':
764 if (modifier == 'E')
765 goto bad_format;
766
767 DO_NUMBER (2, hour12);
768
769 case 'k': /* GNU extension. */
770 if (modifier == 'E')
771 goto bad_format;
772
773 DO_NUMBER_SPACEPAD (2, tp->tm_hour);
774
775 case 'l': /* GNU extension. */
776 if (modifier == 'E')
777 goto bad_format;
778
779 DO_NUMBER_SPACEPAD (2, hour12);
780
781 case 'j':
782 if (modifier == 'E')
783 goto bad_format;
784
785 DO_NUMBER (3, 1 + tp->tm_yday);
786
787 case 'M':
788 if (modifier == 'E')
789 goto bad_format;
790
791 DO_NUMBER (2, tp->tm_min);
792
793 case 'm':
794 if (modifier == 'E')
795 goto bad_format;
796
797 DO_NUMBER (2, tp->tm_mon + 1);
798
799 case 'n': /* POSIX.2 extension. */
800 add (1, *p = '\n');
801 break;
802
803 case 'P':
804 to_lowcase = 1;
805 /* FALLTHROUGH */
806
807 case 'p':
808 cpy (ap_len, ampm);
809 break;
810
811 case 'R': /* GNU extension. */
812 subfmt = "%H:%M";
813 goto subformat;
814
815 case 'r': /* POSIX.2 extension. */
816#ifdef _NL_CURRENT
817 if (*(subfmt = _NL_CURRENT (LC_TIME, T_FMT_AMPM)) == '\0')
818#endif
819 subfmt = "%I:%M:%S %p";
820 goto subformat;
821
822 case 'S':
823 if (modifier == 'E')
824 goto bad_format;
825
826 DO_NUMBER (2, tp->tm_sec);
827
828 case 's': /* GNU extension. */
829 {
830 struct tm ltm;
831 time_t t;
832
833 ltm = *tp;
834 t = mktime (&ltm);
835
836 /* Generate string value for T using time_t arithmetic;
837 this works even if sizeof (long) < sizeof (time_t). */
838
839 bufp = buf + sizeof (buf);
840 negative_number = t < 0;
841
842 do
843 {
844 int d = t % 10;
845 t /= 10;
846
847 if (negative_number)
848 {
849 d = -d;
850
851 /* Adjust if division truncates to minus infinity. */
852 if (0 < -1 % 10 && d < 0)
853 {
854 t++;
855 d += 10;
856 }
857 }
858
859 *--bufp = d + '0';
860 }
861 while (t != 0);
862
863 digits = 1;
864 goto do_number_sign_and_padding;
865 }
866
867 case 'X':
868 if (modifier == 'O')
869 goto bad_format;
870#ifdef _NL_CURRENT
871 if (! (modifier == 'E'
872 && *(subfmt = _NL_CURRENT (LC_TIME, ERA_T_FMT)) != '\0'))
873 subfmt = _NL_CURRENT (LC_TIME, T_FMT);
874 goto subformat;
875#endif
876 /* Fall through. */
877 case 'T': /* POSIX.2 extension. */
878 subfmt = "%H:%M:%S";
879 goto subformat;
880
881 case 't': /* POSIX.2 extension. */
882 add (1, *p = '\t');
883 break;
884
885 case 'u': /* POSIX.2 extension. */
886 DO_NUMBER (1, (tp->tm_wday - 1 + 7) % 7 + 1);
887
888 case 'U':
889 if (modifier == 'E')
890 goto bad_format;
891
892 DO_NUMBER (2, (tp->tm_yday - tp->tm_wday + 7) / 7);
893
894 case 'V':
895 case 'g': /* GNU extension. */
896 case 'G': /* GNU extension. */
897 if (modifier == 'E')
898 goto bad_format;
899 {
900 int year = tp->tm_year + TM_YEAR_BASE;
901 int days = iso_week_days (tp->tm_yday, tp->tm_wday);
902
903 if (days < 0)
904 {
905 /* This ISO week belongs to the previous year. */
906 year--;
907 days = iso_week_days (tp->tm_yday + (365 + __isleap (year)),
908 tp->tm_wday);
909 }
910 else
911 {
912 int d = iso_week_days (tp->tm_yday - (365 + __isleap (year)),
913 tp->tm_wday);
914 if (0 <= d)
915 {
916 /* This ISO week belongs to the next year. */
917 year++;
918 days = d;
919 }
920 }
921
922 switch (*f)
923 {
924 case 'g':
925 DO_NUMBER (2, (year % 100 + 100) % 100);
926
927 case 'G':
928 DO_NUMBER (1, year);
929
930 default:
931 DO_NUMBER (2, days / 7 + 1);
932 }
933 }
934
935 case 'W':
936 if (modifier == 'E')
937 goto bad_format;
938
939 DO_NUMBER (2, (tp->tm_yday - (tp->tm_wday - 1 + 7) % 7 + 7) / 7);
940
941 case 'w':
942 if (modifier == 'E')
943 goto bad_format;
944
945 DO_NUMBER (1, tp->tm_wday);
946
947 case 'Y':
948#if HAVE_STRUCT_ERA_ENTRY
949 if (modifier == 'E')
950 {
951 struct era_entry *era = _nl_get_era_entry (tp);
952 if (era)
953 {
954 subfmt = strchr (era->name_fmt, '\0') + 1;
955 goto subformat;
956 }
957 }
958#endif
959 if (modifier == 'O')
960 goto bad_format;
961 else
962 DO_NUMBER (1, tp->tm_year + TM_YEAR_BASE);
963
964 case 'y':
965#if HAVE_STRUCT_ERA_ENTRY
966 if (modifier == 'E')
967 {
968 struct era_entry *era = _nl_get_era_entry (tp);
969 if (era)
970 {
971 int delta = tp->tm_year - era->start_date[0];
972 DO_NUMBER (1, (era->offset
973 + (era->direction == '-' ? -delta : delta)));
974 }
975 }
976#endif
977 DO_NUMBER (2, (tp->tm_year % 100 + 100) % 100);
978
979 case 'Z':
980 cpy (zonelen, zone);
981 break;
982
983 case 'z': /* GNU extension. */
984 if (tp->tm_isdst < 0)
985 break;
986
987 {
988 int diff;
989#if HAVE_TM_GMTOFF
990 diff = tp->tm_gmtoff;
991#else
992 struct tm gtm;
993 struct tm ltm;
994 time_t lt;
995
996 ltm = *tp;
997 lt = mktime (&ltm);
998
999 if (lt == (time_t) -1)
1000 {
1001 /* mktime returns -1 for errors, but -1 is also a
1002 valid time_t value. Check whether an error really
1003 occurred. */
1004 struct tm tm;
1005 localtime_r (&lt, &tm);
1006
1007 if ((ltm.tm_sec ^ tm.tm_sec)
1008 | (ltm.tm_min ^ tm.tm_min)
1009 | (ltm.tm_hour ^ tm.tm_hour)
1010 | (ltm.tm_mday ^ tm.tm_mday)
1011 | (ltm.tm_mon ^ tm.tm_mon)
1012 | (ltm.tm_year ^ tm.tm_year))
1013 break;
1014 }
1015
1016 if (! gmtime_r (&lt, &gtm))
1017 break;
1018
1019 diff = tm_diff (&ltm, &gtm);
1020#endif
1021
1022 if (diff < 0)
1023 {
1024 add (1, *p = '-');
1025 diff = -diff;
1026 }
1027 else
1028 add (1, *p = '+');
1029
1030 diff /= 60;
1031 DO_NUMBER (4, (diff / 60) * 100 + diff % 60);
1032 }
1033
1034 case '\0': /* GNU extension: % at end of format. */
1035 --f;
1036 /* Fall through. */
1037 default:
1038 /* Unknown format; output the format, including the '%',
1039 since this is most likely the right thing to do if a
1040 multibyte string has been misparsed. */
1041 bad_format:
1042 {
1043 int flen;
1044 for (flen = 1; f[1 - flen] != '%'; flen++)
1045 continue;
1046 cpy (flen, &f[1 - flen]);
1047 }
1048 break;
1049 }
1050 }
1051
1052 if (p)
1053 *p = '\0';
1054 return i;
1055}