]> git.ipfire.org Git - thirdparty/glibc.git/blob - argp/argp-help.c
Update.
[thirdparty/glibc.git] / argp / argp-help.c
1 /* Hierarchial argument parsing help output
2 Copyright (C) 1995-2000, 2001, 2002, 2003 Free Software Foundation, Inc.
3 This file is part of the GNU C Library.
4 Written by Miles Bader <miles@gnu.ai.mit.edu>.
5
6 The GNU C Library is free software; you can redistribute it and/or
7 modify it under the terms of the GNU Lesser General Public
8 License as published by the Free Software Foundation; either
9 version 2.1 of the License, or (at your option) any later version.
10
11 The GNU C Library is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 Lesser General Public License for more details.
15
16 You should have received a copy of the GNU Lesser General Public
17 License along with the GNU C Library; if not, write to the Free
18 Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
19 02111-1307 USA. */
20
21 #ifndef _GNU_SOURCE
22 # define _GNU_SOURCE 1
23 #endif
24
25 #ifdef HAVE_CONFIG_H
26 #include <config.h>
27 #endif
28
29 #ifndef alloca
30 # ifdef __GNUC__
31 # define alloca __builtin_alloca
32 # define HAVE_ALLOCA 1
33 # else
34 # if defined HAVE_ALLOCA_H || defined _LIBC
35 # include <alloca.h>
36 # else
37 # ifdef _AIX
38 #pragma alloca
39 # else
40 # ifndef alloca
41 char *alloca ();
42 # endif
43 # endif
44 # endif
45 # endif
46 #endif
47
48 #include <stddef.h>
49 #include <stdlib.h>
50 #include <string.h>
51 #include <assert.h>
52 #include <stdarg.h>
53 #include <malloc.h>
54 #include <ctype.h>
55 #ifdef USE_IN_LIBIO
56 # include <wchar.h>
57 #endif
58
59 #ifndef _
60 /* This is for other GNU distributions with internationalized messages. */
61 # if defined HAVE_LIBINTL_H || defined _LIBC
62 # include <libintl.h>
63 # ifdef _LIBC
64 # undef dgettext
65 # define dgettext(domain, msgid) \
66 INTUSE(__dcgettext) (domain, msgid, LC_MESSAGES)
67 # endif
68 # else
69 # define dgettext(domain, msgid) (msgid)
70 # endif
71 #endif
72
73 #include "argp.h"
74 #include "argp-fmtstream.h"
75 #include "argp-namefrob.h"
76 \f
77 /* User-selectable (using an environment variable) formatting parameters.
78
79 These may be specified in an environment variable called `ARGP_HELP_FMT',
80 with a contents like: VAR1=VAL1,VAR2=VAL2,BOOLVAR2,no-BOOLVAR2
81 Where VALn must be a positive integer. The list of variables is in the
82 UPARAM_NAMES vector, below. */
83
84 /* Default parameters. */
85 #define DUP_ARGS 0 /* True if option argument can be duplicated. */
86 #define DUP_ARGS_NOTE 1 /* True to print a note about duplicate args. */
87 #define SHORT_OPT_COL 2 /* column in which short options start */
88 #define LONG_OPT_COL 6 /* column in which long options start */
89 #define DOC_OPT_COL 2 /* column in which doc options start */
90 #define OPT_DOC_COL 29 /* column in which option text starts */
91 #define HEADER_COL 1 /* column in which group headers are printed */
92 #define USAGE_INDENT 12 /* indentation of wrapped usage lines */
93 #define RMARGIN 79 /* right margin used for wrapping */
94
95 /* User-selectable (using an environment variable) formatting parameters.
96 They must all be of type `int' for the parsing code to work. */
97 struct uparams
98 {
99 /* If true, arguments for an option are shown with both short and long
100 options, even when a given option has both, e.g. `-x ARG, --longx=ARG'.
101 If false, then if an option has both, the argument is only shown with
102 the long one, e.g., `-x, --longx=ARG', and a message indicating that
103 this really means both is printed below the options. */
104 int dup_args;
105
106 /* This is true if when DUP_ARGS is false, and some duplicate arguments have
107 been suppressed, an explanatory message should be printed. */
108 int dup_args_note;
109
110 /* Various output columns. */
111 int short_opt_col;
112 int long_opt_col;
113 int doc_opt_col;
114 int opt_doc_col;
115 int header_col;
116 int usage_indent;
117 int rmargin;
118
119 int valid; /* True when the values in here are valid. */
120 };
121
122 /* This is a global variable, as user options are only ever read once. */
123 static struct uparams uparams = {
124 DUP_ARGS, DUP_ARGS_NOTE,
125 SHORT_OPT_COL, LONG_OPT_COL, DOC_OPT_COL, OPT_DOC_COL, HEADER_COL,
126 USAGE_INDENT, RMARGIN,
127 0
128 };
129
130 /* A particular uparam, and what the user name is. */
131 struct uparam_name
132 {
133 const char *name; /* User name. */
134 int is_bool; /* Whether it's `boolean'. */
135 size_t uparams_offs; /* Location of the (int) field in UPARAMS. */
136 };
137
138 /* The name-field mappings we know about. */
139 static const struct uparam_name uparam_names[] =
140 {
141 { "dup-args", 1, offsetof (struct uparams, dup_args) },
142 { "dup-args-note", 1, offsetof (struct uparams, dup_args_note) },
143 { "short-opt-col", 0, offsetof (struct uparams, short_opt_col) },
144 { "long-opt-col", 0, offsetof (struct uparams, long_opt_col) },
145 { "doc-opt-col", 0, offsetof (struct uparams, doc_opt_col) },
146 { "opt-doc-col", 0, offsetof (struct uparams, opt_doc_col) },
147 { "header-col", 0, offsetof (struct uparams, header_col) },
148 { "usage-indent", 0, offsetof (struct uparams, usage_indent) },
149 { "rmargin", 0, offsetof (struct uparams, rmargin) },
150 { 0 }
151 };
152
153 /* Read user options from the environment, and fill in UPARAMS appropiately. */
154 static void
155 fill_in_uparams (const struct argp_state *state)
156 {
157 const char *var = getenv ("ARGP_HELP_FMT");
158
159 #define SKIPWS(p) do { while (isspace (*p)) p++; } while (0);
160
161 if (var)
162 /* Parse var. */
163 while (*var)
164 {
165 SKIPWS (var);
166
167 if (isalpha (*var))
168 {
169 size_t var_len;
170 const struct uparam_name *un;
171 int unspec = 0, val = 0;
172 const char *arg = var;
173
174 while (isalnum (*arg) || *arg == '-' || *arg == '_')
175 arg++;
176 var_len = arg - var;
177
178 SKIPWS (arg);
179
180 if (*arg == '\0' || *arg == ',')
181 unspec = 1;
182 else if (*arg == '=')
183 {
184 arg++;
185 SKIPWS (arg);
186 }
187
188 if (unspec)
189 {
190 if (var[0] == 'n' && var[1] == 'o' && var[2] == '-')
191 {
192 val = 0;
193 var += 3;
194 var_len -= 3;
195 }
196 else
197 val = 1;
198 }
199 else if (isdigit (*arg))
200 {
201 val = atoi (arg);
202 while (isdigit (*arg))
203 arg++;
204 SKIPWS (arg);
205 }
206
207 for (un = uparam_names; un->name; un++)
208 if (strlen (un->name) == var_len
209 && strncmp (var, un->name, var_len) == 0)
210 {
211 if (unspec && !un->is_bool)
212 __argp_failure (state, 0, 0,
213 dgettext (state->root_argp->argp_domain, "\
214 %.*s: ARGP_HELP_FMT parameter requires a value"),
215 (int) var_len, var);
216 else
217 *(int *)((char *)&uparams + un->uparams_offs) = val;
218 break;
219 }
220 if (! un->name)
221 __argp_failure (state, 0, 0,
222 dgettext (state->root_argp->argp_domain, "\
223 %.*s: Unknown ARGP_HELP_FMT parameter"),
224 (int) var_len, var);
225
226 var = arg;
227 if (*var == ',')
228 var++;
229 }
230 else if (*var)
231 {
232 __argp_failure (state, 0, 0,
233 dgettext (state->root_argp->argp_domain,
234 "Garbage in ARGP_HELP_FMT: %s"), var);
235 break;
236 }
237 }
238 }
239 \f
240 /* Returns true if OPT hasn't been marked invisible. Visibility only affects
241 whether OPT is displayed or used in sorting, not option shadowing. */
242 #define ovisible(opt) (! ((opt)->flags & OPTION_HIDDEN))
243
244 /* Returns true if OPT is an alias for an earlier option. */
245 #define oalias(opt) ((opt)->flags & OPTION_ALIAS)
246
247 /* Returns true if OPT is an documentation-only entry. */
248 #define odoc(opt) ((opt)->flags & OPTION_DOC)
249
250 /* Returns true if OPT is the end-of-list marker for a list of options. */
251 #define oend(opt) __option_is_end (opt)
252
253 /* Returns true if OPT has a short option. */
254 #define oshort(opt) __option_is_short (opt)
255 \f
256 /*
257 The help format for a particular option is like:
258
259 -xARG, -yARG, --long1=ARG, --long2=ARG Documentation...
260
261 Where ARG will be omitted if there's no argument, for this option, or
262 will be surrounded by "[" and "]" appropiately if the argument is
263 optional. The documentation string is word-wrapped appropiately, and if
264 the list of options is long enough, it will be started on a separate line.
265 If there are no short options for a given option, the first long option is
266 indented slighly in a way that's supposed to make most long options appear
267 to be in a separate column.
268
269 For example, the following output (from ps):
270
271 -p PID, --pid=PID List the process PID
272 --pgrp=PGRP List processes in the process group PGRP
273 -P, -x, --no-parent Include processes without parents
274 -Q, --all-fields Don't elide unusable fields (normally if there's
275 some reason ps can't print a field for any
276 process, it's removed from the output entirely)
277 -r, --reverse, --gratuitously-long-reverse-option
278 Reverse the order of any sort
279 --session[=SID] Add the processes from the session SID (which
280 defaults to the sid of the current process)
281
282 Here are some more options:
283 -f ZOT, --foonly=ZOT Glork a foonly
284 -z, --zaza Snit a zar
285
286 -?, --help Give this help list
287 --usage Give a short usage message
288 -V, --version Print program version
289
290 The struct argp_option array for the above could look like:
291
292 {
293 {"pid", 'p', "PID", 0, "List the process PID"},
294 {"pgrp", OPT_PGRP, "PGRP", 0, "List processes in the process group PGRP"},
295 {"no-parent", 'P', 0, 0, "Include processes without parents"},
296 {0, 'x', 0, OPTION_ALIAS},
297 {"all-fields",'Q', 0, 0, "Don't elide unusable fields (normally"
298 " if there's some reason ps can't"
299 " print a field for any process, it's"
300 " removed from the output entirely)" },
301 {"reverse", 'r', 0, 0, "Reverse the order of any sort"},
302 {"gratuitously-long-reverse-option", 0, 0, OPTION_ALIAS},
303 {"session", OPT_SESS, "SID", OPTION_ARG_OPTIONAL,
304 "Add the processes from the session"
305 " SID (which defaults to the sid of"
306 " the current process)" },
307
308 {0,0,0,0, "Here are some more options:"},
309 {"foonly", 'f', "ZOT", 0, "Glork a foonly"},
310 {"zaza", 'z', 0, 0, "Snit a zar"},
311
312 {0}
313 }
314
315 Note that the last three options are automatically supplied by argp_parse,
316 unless you tell it not to with ARGP_NO_HELP.
317
318 */
319 \f
320 /* Returns true if CH occurs between BEG and END. */
321 static int
322 find_char (char ch, char *beg, char *end)
323 {
324 while (beg < end)
325 if (*beg == ch)
326 return 1;
327 else
328 beg++;
329 return 0;
330 }
331 \f
332 struct hol_cluster; /* fwd decl */
333
334 struct hol_entry
335 {
336 /* First option. */
337 const struct argp_option *opt;
338 /* Number of options (including aliases). */
339 unsigned num;
340
341 /* A pointers into the HOL's short_options field, to the first short option
342 letter for this entry. The order of the characters following this point
343 corresponds to the order of options pointed to by OPT, and there are at
344 most NUM. A short option recorded in a option following OPT is only
345 valid if it occurs in the right place in SHORT_OPTIONS (otherwise it's
346 probably been shadowed by some other entry). */
347 char *short_options;
348
349 /* Entries are sorted by their group first, in the order:
350 1, 2, ..., n, 0, -m, ..., -2, -1
351 and then alphabetically within each group. The default is 0. */
352 int group;
353
354 /* The cluster of options this entry belongs to, or 0 if none. */
355 struct hol_cluster *cluster;
356
357 /* The argp from which this option came. */
358 const struct argp *argp;
359 };
360
361 /* A cluster of entries to reflect the argp tree structure. */
362 struct hol_cluster
363 {
364 /* A descriptive header printed before options in this cluster. */
365 const char *header;
366
367 /* Used to order clusters within the same group with the same parent,
368 according to the order in which they occurred in the parent argp's child
369 list. */
370 int index;
371
372 /* How to sort this cluster with respect to options and other clusters at the
373 same depth (clusters always follow options in the same group). */
374 int group;
375
376 /* The cluster to which this cluster belongs, or 0 if it's at the base
377 level. */
378 struct hol_cluster *parent;
379
380 /* The argp from which this cluster is (eventually) derived. */
381 const struct argp *argp;
382
383 /* The distance this cluster is from the root. */
384 int depth;
385
386 /* Clusters in a given hol are kept in a linked list, to make freeing them
387 possible. */
388 struct hol_cluster *next;
389 };
390
391 /* A list of options for help. */
392 struct hol
393 {
394 /* An array of hol_entry's. */
395 struct hol_entry *entries;
396 /* The number of entries in this hol. If this field is zero, the others
397 are undefined. */
398 unsigned num_entries;
399
400 /* A string containing all short options in this HOL. Each entry contains
401 pointers into this string, so the order can't be messed with blindly. */
402 char *short_options;
403
404 /* Clusters of entries in this hol. */
405 struct hol_cluster *clusters;
406 };
407 \f
408 /* Create a struct hol from the options in ARGP. CLUSTER is the
409 hol_cluster in which these entries occur, or 0, if at the root. */
410 static struct hol *
411 make_hol (const struct argp *argp, struct hol_cluster *cluster)
412 {
413 char *so;
414 const struct argp_option *o;
415 const struct argp_option *opts = argp->options;
416 struct hol_entry *entry;
417 unsigned num_short_options = 0;
418 struct hol *hol = malloc (sizeof (struct hol));
419
420 assert (hol);
421
422 hol->num_entries = 0;
423 hol->clusters = 0;
424
425 if (opts)
426 {
427 int cur_group = 0;
428
429 /* The first option must not be an alias. */
430 assert (! oalias (opts));
431
432 /* Calculate the space needed. */
433 for (o = opts; ! oend (o); o++)
434 {
435 if (! oalias (o))
436 hol->num_entries++;
437 if (oshort (o))
438 num_short_options++; /* This is an upper bound. */
439 }
440
441 hol->entries = malloc (sizeof (struct hol_entry) * hol->num_entries);
442 hol->short_options = malloc (num_short_options + 1);
443
444 assert (hol->entries && hol->short_options);
445
446 /* Fill in the entries. */
447 so = hol->short_options;
448 for (o = opts, entry = hol->entries; ! oend (o); entry++)
449 {
450 entry->opt = o;
451 entry->num = 0;
452 entry->short_options = so;
453 entry->group = cur_group =
454 o->group
455 ? o->group
456 : ((!o->name && !o->key)
457 ? cur_group + 1
458 : cur_group);
459 entry->cluster = cluster;
460 entry->argp = argp;
461
462 do
463 {
464 entry->num++;
465 if (oshort (o) && ! find_char (o->key, hol->short_options, so))
466 /* O has a valid short option which hasn't already been used.*/
467 *so++ = o->key;
468 o++;
469 }
470 while (! oend (o) && oalias (o));
471 }
472 *so = '\0'; /* null terminated so we can find the length */
473 }
474
475 return hol;
476 }
477 \f
478 /* Add a new cluster to HOL, with the given GROUP and HEADER (taken from the
479 associated argp child list entry), INDEX, and PARENT, and return a pointer
480 to it. ARGP is the argp that this cluster results from. */
481 static struct hol_cluster *
482 hol_add_cluster (struct hol *hol, int group, const char *header, int index,
483 struct hol_cluster *parent, const struct argp *argp)
484 {
485 struct hol_cluster *cl = malloc (sizeof (struct hol_cluster));
486 if (cl)
487 {
488 cl->group = group;
489 cl->header = header;
490
491 cl->index = index;
492 cl->parent = parent;
493 cl->argp = argp;
494 cl->depth = parent ? parent->depth + 1 : 0;
495
496 cl->next = hol->clusters;
497 hol->clusters = cl;
498 }
499 return cl;
500 }
501 \f
502 /* Free HOL and any resources it uses. */
503 static void
504 hol_free (struct hol *hol)
505 {
506 struct hol_cluster *cl = hol->clusters;
507
508 while (cl)
509 {
510 struct hol_cluster *next = cl->next;
511 free (cl);
512 cl = next;
513 }
514
515 if (hol->num_entries > 0)
516 {
517 free (hol->entries);
518 free (hol->short_options);
519 }
520
521 free (hol);
522 }
523 \f
524 static int
525 hol_entry_short_iterate (const struct hol_entry *entry,
526 int (*func)(const struct argp_option *opt,
527 const struct argp_option *real,
528 const char *domain, void *cookie),
529 const char *domain, void *cookie)
530 {
531 unsigned nopts;
532 int val = 0;
533 const struct argp_option *opt, *real = entry->opt;
534 char *so = entry->short_options;
535
536 for (opt = real, nopts = entry->num; nopts > 0 && !val; opt++, nopts--)
537 if (oshort (opt) && *so == opt->key)
538 {
539 if (!oalias (opt))
540 real = opt;
541 if (ovisible (opt))
542 val = (*func)(opt, real, domain, cookie);
543 so++;
544 }
545
546 return val;
547 }
548
549 static inline int
550 hol_entry_long_iterate (const struct hol_entry *entry,
551 int (*func)(const struct argp_option *opt,
552 const struct argp_option *real,
553 const char *domain, void *cookie),
554 const char *domain, void *cookie)
555 {
556 unsigned nopts;
557 int val = 0;
558 const struct argp_option *opt, *real = entry->opt;
559
560 for (opt = real, nopts = entry->num; nopts > 0 && !val; opt++, nopts--)
561 if (opt->name)
562 {
563 if (!oalias (opt))
564 real = opt;
565 if (ovisible (opt))
566 val = (*func)(opt, real, domain, cookie);
567 }
568
569 return val;
570 }
571 \f
572 /* Iterator that returns true for the first short option. */
573 static inline int
574 until_short (const struct argp_option *opt, const struct argp_option *real,
575 const char *domain, void *cookie)
576 {
577 return oshort (opt) ? opt->key : 0;
578 }
579
580 /* Returns the first valid short option in ENTRY, or 0 if there is none. */
581 static char
582 hol_entry_first_short (const struct hol_entry *entry)
583 {
584 return hol_entry_short_iterate (entry, until_short,
585 entry->argp->argp_domain, 0);
586 }
587
588 /* Returns the first valid long option in ENTRY, or 0 if there is none. */
589 static const char *
590 hol_entry_first_long (const struct hol_entry *entry)
591 {
592 const struct argp_option *opt;
593 unsigned num;
594 for (opt = entry->opt, num = entry->num; num > 0; opt++, num--)
595 if (opt->name && ovisible (opt))
596 return opt->name;
597 return 0;
598 }
599
600 /* Returns the entry in HOL with the long option name NAME, or 0 if there is
601 none. */
602 static struct hol_entry *
603 hol_find_entry (struct hol *hol, const char *name)
604 {
605 struct hol_entry *entry = hol->entries;
606 unsigned num_entries = hol->num_entries;
607
608 while (num_entries-- > 0)
609 {
610 const struct argp_option *opt = entry->opt;
611 unsigned num_opts = entry->num;
612
613 while (num_opts-- > 0)
614 if (opt->name && ovisible (opt) && strcmp (opt->name, name) == 0)
615 return entry;
616 else
617 opt++;
618
619 entry++;
620 }
621
622 return 0;
623 }
624 \f
625 /* If an entry with the long option NAME occurs in HOL, set it's special
626 sort position to GROUP. */
627 static void
628 hol_set_group (struct hol *hol, const char *name, int group)
629 {
630 struct hol_entry *entry = hol_find_entry (hol, name);
631 if (entry)
632 entry->group = group;
633 }
634 \f
635 /* Order by group: 0, 1, 2, ..., n, -m, ..., -2, -1.
636 EQ is what to return if GROUP1 and GROUP2 are the same. */
637 static int
638 group_cmp (int group1, int group2, int eq)
639 {
640 if (group1 == group2)
641 return eq;
642 else if ((group1 < 0 && group2 < 0) || (group1 >= 0 && group2 >= 0))
643 return group1 - group2;
644 else
645 return group2 - group1;
646 }
647
648 /* Compare clusters CL1 & CL2 by the order that they should appear in
649 output. */
650 static int
651 hol_cluster_cmp (const struct hol_cluster *cl1, const struct hol_cluster *cl2)
652 {
653 /* If one cluster is deeper than the other, use its ancestor at the same
654 level, so that finding the common ancestor is straightforward. */
655 while (cl1->depth < cl2->depth)
656 cl1 = cl1->parent;
657 while (cl2->depth < cl1->depth)
658 cl2 = cl2->parent;
659
660 /* Now reduce both clusters to their ancestors at the point where both have
661 a common parent; these can be directly compared. */
662 while (cl1->parent != cl2->parent)
663 cl1 = cl1->parent, cl2 = cl2->parent;
664
665 return group_cmp (cl1->group, cl2->group, cl2->index - cl1->index);
666 }
667
668 /* Return the ancestor of CL that's just below the root (i.e., has a parent
669 of 0). */
670 static struct hol_cluster *
671 hol_cluster_base (struct hol_cluster *cl)
672 {
673 while (cl->parent)
674 cl = cl->parent;
675 return cl;
676 }
677
678 /* Return true if CL1 is a child of CL2. */
679 static int
680 hol_cluster_is_child (const struct hol_cluster *cl1,
681 const struct hol_cluster *cl2)
682 {
683 while (cl1 && cl1 != cl2)
684 cl1 = cl1->parent;
685 return cl1 == cl2;
686 }
687 \f
688 /* Given the name of a OPTION_DOC option, modifies NAME to start at the tail
689 that should be used for comparisons, and returns true iff it should be
690 treated as a non-option. */
691 static int
692 canon_doc_option (const char **name)
693 {
694 int non_opt;
695 /* Skip initial whitespace. */
696 while (isspace (**name))
697 (*name)++;
698 /* Decide whether this looks like an option (leading `-') or not. */
699 non_opt = (**name != '-');
700 /* Skip until part of name used for sorting. */
701 while (**name && !isalnum (**name))
702 (*name)++;
703 return non_opt;
704 }
705
706 /* Order ENTRY1 & ENTRY2 by the order which they should appear in a help
707 listing. */
708 static int
709 hol_entry_cmp (const struct hol_entry *entry1,
710 const struct hol_entry *entry2)
711 {
712 /* The group numbers by which the entries should be ordered; if either is
713 in a cluster, then this is just the group within the cluster. */
714 int group1 = entry1->group, group2 = entry2->group;
715
716 if (entry1->cluster != entry2->cluster)
717 {
718 /* The entries are not within the same cluster, so we can't compare them
719 directly, we have to use the appropiate clustering level too. */
720 if (! entry1->cluster)
721 /* ENTRY1 is at the `base level', not in a cluster, so we have to
722 compare it's group number with that of the base cluster in which
723 ENTRY2 resides. Note that if they're in the same group, the
724 clustered option always comes laster. */
725 return group_cmp (group1, hol_cluster_base (entry2->cluster)->group, -1);
726 else if (! entry2->cluster)
727 /* Likewise, but ENTRY2's not in a cluster. */
728 return group_cmp (hol_cluster_base (entry1->cluster)->group, group2, 1);
729 else
730 /* Both entries are in clusters, we can just compare the clusters. */
731 return hol_cluster_cmp (entry1->cluster, entry2->cluster);
732 }
733 else if (group1 == group2)
734 /* The entries are both in the same cluster and group, so compare them
735 alphabetically. */
736 {
737 int short1 = hol_entry_first_short (entry1);
738 int short2 = hol_entry_first_short (entry2);
739 int doc1 = odoc (entry1->opt);
740 int doc2 = odoc (entry2->opt);
741 const char *long1 = hol_entry_first_long (entry1);
742 const char *long2 = hol_entry_first_long (entry2);
743
744 if (doc1)
745 doc1 = canon_doc_option (&long1);
746 if (doc2)
747 doc2 = canon_doc_option (&long2);
748
749 if (doc1 != doc2)
750 /* `documentation' options always follow normal options (or
751 documentation options that *look* like normal options). */
752 return doc1 - doc2;
753 else if (!short1 && !short2 && long1 && long2)
754 /* Only long options. */
755 return __strcasecmp (long1, long2);
756 else
757 /* Compare short/short, long/short, short/long, using the first
758 character of long options. Entries without *any* valid
759 options (such as options with OPTION_HIDDEN set) will be put
760 first, but as they're not displayed, it doesn't matter where
761 they are. */
762 {
763 char first1 = short1 ? short1 : long1 ? *long1 : 0;
764 char first2 = short2 ? short2 : long2 ? *long2 : 0;
765 #ifdef _tolower
766 int lower_cmp = _tolower (first1) - _tolower (first2);
767 #else
768 int lower_cmp = tolower (first1) - tolower (first2);
769 #endif
770 /* Compare ignoring case, except when the options are both the
771 same letter, in which case lower-case always comes first. */
772 return lower_cmp ? lower_cmp : first2 - first1;
773 }
774 }
775 else
776 /* Within the same cluster, but not the same group, so just compare
777 groups. */
778 return group_cmp (group1, group2, 0);
779 }
780
781 /* Version of hol_entry_cmp with correct signature for qsort. */
782 static int
783 hol_entry_qcmp (const void *entry1_v, const void *entry2_v)
784 {
785 return hol_entry_cmp (entry1_v, entry2_v);
786 }
787
788 /* Sort HOL by group and alphabetically by option name (with short options
789 taking precedence over long). Since the sorting is for display purposes
790 only, the shadowing of options isn't effected. */
791 static void
792 hol_sort (struct hol *hol)
793 {
794 if (hol->num_entries > 0)
795 qsort (hol->entries, hol->num_entries, sizeof (struct hol_entry),
796 hol_entry_qcmp);
797 }
798 \f
799 /* Append MORE to HOL, destroying MORE in the process. Options in HOL shadow
800 any in MORE with the same name. */
801 static void
802 hol_append (struct hol *hol, struct hol *more)
803 {
804 struct hol_cluster **cl_end = &hol->clusters;
805
806 /* Steal MORE's cluster list, and add it to the end of HOL's. */
807 while (*cl_end)
808 cl_end = &(*cl_end)->next;
809 *cl_end = more->clusters;
810 more->clusters = 0;
811
812 /* Merge entries. */
813 if (more->num_entries > 0)
814 {
815 if (hol->num_entries == 0)
816 {
817 hol->num_entries = more->num_entries;
818 hol->entries = more->entries;
819 hol->short_options = more->short_options;
820 more->num_entries = 0; /* Mark MORE's fields as invalid. */
821 }
822 else
823 /* Append the entries in MORE to those in HOL, taking care to only add
824 non-shadowed SHORT_OPTIONS values. */
825 {
826 unsigned left;
827 char *so, *more_so;
828 struct hol_entry *e;
829 unsigned num_entries = hol->num_entries + more->num_entries;
830 struct hol_entry *entries =
831 malloc (num_entries * sizeof (struct hol_entry));
832 unsigned hol_so_len = strlen (hol->short_options);
833 char *short_options =
834 malloc (hol_so_len + strlen (more->short_options) + 1);
835
836 __mempcpy (__mempcpy (entries, hol->entries,
837 hol->num_entries * sizeof (struct hol_entry)),
838 more->entries,
839 more->num_entries * sizeof (struct hol_entry));
840
841 __mempcpy (short_options, hol->short_options, hol_so_len);
842
843 /* Fix up the short options pointers from HOL. */
844 for (e = entries, left = hol->num_entries; left > 0; e++, left--)
845 e->short_options += (short_options - hol->short_options);
846
847 /* Now add the short options from MORE, fixing up its entries
848 too. */
849 so = short_options + hol_so_len;
850 more_so = more->short_options;
851 for (left = more->num_entries; left > 0; e++, left--)
852 {
853 int opts_left;
854 const struct argp_option *opt;
855
856 e->short_options = so;
857
858 for (opts_left = e->num, opt = e->opt; opts_left; opt++, opts_left--)
859 {
860 int ch = *more_so;
861 if (oshort (opt) && ch == opt->key)
862 /* The next short option in MORE_SO, CH, is from OPT. */
863 {
864 if (! find_char (ch, short_options,
865 short_options + hol_so_len))
866 /* The short option CH isn't shadowed by HOL's options,
867 so add it to the sum. */
868 *so++ = ch;
869 more_so++;
870 }
871 }
872 }
873
874 *so = '\0';
875
876 free (hol->entries);
877 free (hol->short_options);
878
879 hol->entries = entries;
880 hol->num_entries = num_entries;
881 hol->short_options = short_options;
882 }
883 }
884
885 hol_free (more);
886 }
887 \f
888 /* Inserts enough spaces to make sure STREAM is at column COL. */
889 static void
890 indent_to (argp_fmtstream_t stream, unsigned col)
891 {
892 int needed = col - __argp_fmtstream_point (stream);
893 while (needed-- > 0)
894 __argp_fmtstream_putc (stream, ' ');
895 }
896
897 /* Output to STREAM either a space, or a newline if there isn't room for at
898 least ENSURE characters before the right margin. */
899 static void
900 space (argp_fmtstream_t stream, size_t ensure)
901 {
902 if (__argp_fmtstream_point (stream) + ensure
903 >= __argp_fmtstream_rmargin (stream))
904 __argp_fmtstream_putc (stream, '\n');
905 else
906 __argp_fmtstream_putc (stream, ' ');
907 }
908
909 /* If the option REAL has an argument, we print it in using the printf
910 format REQ_FMT or OPT_FMT depending on whether it's a required or
911 optional argument. */
912 static void
913 arg (const struct argp_option *real, const char *req_fmt, const char *opt_fmt,
914 const char *domain, argp_fmtstream_t stream)
915 {
916 if (real->arg)
917 {
918 if (real->flags & OPTION_ARG_OPTIONAL)
919 __argp_fmtstream_printf (stream, opt_fmt,
920 dgettext (domain, real->arg));
921 else
922 __argp_fmtstream_printf (stream, req_fmt,
923 dgettext (domain, real->arg));
924 }
925 }
926 \f
927 /* Helper functions for hol_entry_help. */
928
929 /* State used during the execution of hol_help. */
930 struct hol_help_state
931 {
932 /* PREV_ENTRY should contain the previous entry printed, or 0. */
933 struct hol_entry *prev_entry;
934
935 /* If an entry is in a different group from the previous one, and SEP_GROUPS
936 is true, then a blank line will be printed before any output. */
937 int sep_groups;
938
939 /* True if a duplicate option argument was suppressed (only ever set if
940 UPARAMS.dup_args is false). */
941 int suppressed_dup_arg;
942 };
943
944 /* Some state used while printing a help entry (used to communicate with
945 helper functions). See the doc for hol_entry_help for more info, as most
946 of the fields are copied from its arguments. */
947 struct pentry_state
948 {
949 const struct hol_entry *entry;
950 argp_fmtstream_t stream;
951 struct hol_help_state *hhstate;
952
953 /* True if nothing's been printed so far. */
954 int first;
955
956 /* If non-zero, the state that was used to print this help. */
957 const struct argp_state *state;
958 };
959
960 /* If a user doc filter should be applied to DOC, do so. */
961 static const char *
962 filter_doc (const char *doc, int key, const struct argp *argp,
963 const struct argp_state *state)
964 {
965 if (argp->help_filter)
966 /* We must apply a user filter to this output. */
967 {
968 void *input = __argp_input (argp, state);
969 return (*argp->help_filter) (key, doc, input);
970 }
971 else
972 /* No filter. */
973 return doc;
974 }
975
976 /* Prints STR as a header line, with the margin lines set appropiately, and
977 notes the fact that groups should be separated with a blank line. ARGP is
978 the argp that should dictate any user doc filtering to take place. Note
979 that the previous wrap margin isn't restored, but the left margin is reset
980 to 0. */
981 static void
982 print_header (const char *str, const struct argp *argp,
983 struct pentry_state *pest)
984 {
985 const char *tstr = dgettext (argp->argp_domain, str);
986 const char *fstr = filter_doc (tstr, ARGP_KEY_HELP_HEADER, argp, pest->state);
987
988 if (fstr)
989 {
990 if (*fstr)
991 {
992 if (pest->hhstate->prev_entry)
993 /* Precede with a blank line. */
994 __argp_fmtstream_putc (pest->stream, '\n');
995 indent_to (pest->stream, uparams.header_col);
996 __argp_fmtstream_set_lmargin (pest->stream, uparams.header_col);
997 __argp_fmtstream_set_wmargin (pest->stream, uparams.header_col);
998 __argp_fmtstream_puts (pest->stream, fstr);
999 __argp_fmtstream_set_lmargin (pest->stream, 0);
1000 __argp_fmtstream_putc (pest->stream, '\n');
1001 }
1002
1003 pest->hhstate->sep_groups = 1; /* Separate subsequent groups. */
1004 }
1005
1006 if (fstr != tstr)
1007 free ((char *) fstr);
1008 }
1009
1010 /* Inserts a comma if this isn't the first item on the line, and then makes
1011 sure we're at least to column COL. If this *is* the first item on a line,
1012 prints any pending whitespace/headers that should precede this line. Also
1013 clears FIRST. */
1014 static void
1015 comma (unsigned col, struct pentry_state *pest)
1016 {
1017 if (pest->first)
1018 {
1019 const struct hol_entry *pe = pest->hhstate->prev_entry;
1020 const struct hol_cluster *cl = pest->entry->cluster;
1021
1022 if (pest->hhstate->sep_groups && pe && pest->entry->group != pe->group)
1023 __argp_fmtstream_putc (pest->stream, '\n');
1024
1025 if (cl && cl->header && *cl->header
1026 && (!pe
1027 || (pe->cluster != cl
1028 && !hol_cluster_is_child (pe->cluster, cl))))
1029 /* If we're changing clusters, then this must be the start of the
1030 ENTRY's cluster unless that is an ancestor of the previous one
1031 (in which case we had just popped into a sub-cluster for a bit).
1032 If so, then print the cluster's header line. */
1033 {
1034 int old_wm = __argp_fmtstream_wmargin (pest->stream);
1035 print_header (cl->header, cl->argp, pest);
1036 __argp_fmtstream_set_wmargin (pest->stream, old_wm);
1037 }
1038
1039 pest->first = 0;
1040 }
1041 else
1042 __argp_fmtstream_puts (pest->stream, ", ");
1043
1044 indent_to (pest->stream, col);
1045 }
1046 \f
1047 /* Print help for ENTRY to STREAM. */
1048 static void
1049 hol_entry_help (struct hol_entry *entry, const struct argp_state *state,
1050 argp_fmtstream_t stream, struct hol_help_state *hhstate)
1051 {
1052 unsigned num;
1053 const struct argp_option *real = entry->opt, *opt;
1054 char *so = entry->short_options;
1055 int have_long_opt = 0; /* We have any long options. */
1056 /* Saved margins. */
1057 int old_lm = __argp_fmtstream_set_lmargin (stream, 0);
1058 int old_wm = __argp_fmtstream_wmargin (stream);
1059 /* PEST is a state block holding some of our variables that we'd like to
1060 share with helper functions. */
1061 struct pentry_state pest = { entry, stream, hhstate, 1, state };
1062
1063 if (! odoc (real))
1064 for (opt = real, num = entry->num; num > 0; opt++, num--)
1065 if (opt->name && ovisible (opt))
1066 {
1067 have_long_opt = 1;
1068 break;
1069 }
1070
1071 /* First emit short options. */
1072 __argp_fmtstream_set_wmargin (stream, uparams.short_opt_col); /* For truly bizarre cases. */
1073 for (opt = real, num = entry->num; num > 0; opt++, num--)
1074 if (oshort (opt) && opt->key == *so)
1075 /* OPT has a valid (non shadowed) short option. */
1076 {
1077 if (ovisible (opt))
1078 {
1079 comma (uparams.short_opt_col, &pest);
1080 __argp_fmtstream_putc (stream, '-');
1081 __argp_fmtstream_putc (stream, *so);
1082 if (!have_long_opt || uparams.dup_args)
1083 arg (real, " %s", "[%s]", state->root_argp->argp_domain, stream);
1084 else if (real->arg)
1085 hhstate->suppressed_dup_arg = 1;
1086 }
1087 so++;
1088 }
1089
1090 /* Now, long options. */
1091 if (odoc (real))
1092 /* A `documentation' option. */
1093 {
1094 __argp_fmtstream_set_wmargin (stream, uparams.doc_opt_col);
1095 for (opt = real, num = entry->num; num > 0; opt++, num--)
1096 if (opt->name && ovisible (opt))
1097 {
1098 comma (uparams.doc_opt_col, &pest);
1099 /* Calling gettext here isn't quite right, since sorting will
1100 have been done on the original; but documentation options
1101 should be pretty rare anyway... */
1102 __argp_fmtstream_puts (stream,
1103 dgettext (state->root_argp->argp_domain,
1104 opt->name));
1105 }
1106 }
1107 else
1108 /* A real long option. */
1109 {
1110 int first_long_opt = 1;
1111
1112 __argp_fmtstream_set_wmargin (stream, uparams.long_opt_col);
1113 for (opt = real, num = entry->num; num > 0; opt++, num--)
1114 if (opt->name && ovisible (opt))
1115 {
1116 comma (uparams.long_opt_col, &pest);
1117 __argp_fmtstream_printf (stream, "--%s", opt->name);
1118 if (first_long_opt || uparams.dup_args)
1119 arg (real, "=%s", "[=%s]", state->root_argp->argp_domain,
1120 stream);
1121 else if (real->arg)
1122 hhstate->suppressed_dup_arg = 1;
1123 }
1124 }
1125
1126 /* Next, documentation strings. */
1127 __argp_fmtstream_set_lmargin (stream, 0);
1128
1129 if (pest.first)
1130 {
1131 /* Didn't print any switches, what's up? */
1132 if (!oshort (real) && !real->name)
1133 /* This is a group header, print it nicely. */
1134 print_header (real->doc, entry->argp, &pest);
1135 else
1136 /* Just a totally shadowed option or null header; print nothing. */
1137 goto cleanup; /* Just return, after cleaning up. */
1138 }
1139 else
1140 {
1141 const char *tstr = real->doc ? dgettext (state->root_argp->argp_domain,
1142 real->doc) : 0;
1143 const char *fstr = filter_doc (tstr, real->key, entry->argp, state);
1144 if (fstr && *fstr)
1145 {
1146 unsigned int col = __argp_fmtstream_point (stream);
1147
1148 __argp_fmtstream_set_lmargin (stream, uparams.opt_doc_col);
1149 __argp_fmtstream_set_wmargin (stream, uparams.opt_doc_col);
1150
1151 if (col > (unsigned int) (uparams.opt_doc_col + 3))
1152 __argp_fmtstream_putc (stream, '\n');
1153 else if (col >= (unsigned int) uparams.opt_doc_col)
1154 __argp_fmtstream_puts (stream, " ");
1155 else
1156 indent_to (stream, uparams.opt_doc_col);
1157
1158 __argp_fmtstream_puts (stream, fstr);
1159 }
1160 if (fstr && fstr != tstr)
1161 free ((char *) fstr);
1162
1163 /* Reset the left margin. */
1164 __argp_fmtstream_set_lmargin (stream, 0);
1165 __argp_fmtstream_putc (stream, '\n');
1166 }
1167
1168 hhstate->prev_entry = entry;
1169
1170 cleanup:
1171 __argp_fmtstream_set_lmargin (stream, old_lm);
1172 __argp_fmtstream_set_wmargin (stream, old_wm);
1173 }
1174 \f
1175 /* Output a long help message about the options in HOL to STREAM. */
1176 static void
1177 hol_help (struct hol *hol, const struct argp_state *state,
1178 argp_fmtstream_t stream)
1179 {
1180 unsigned num;
1181 struct hol_entry *entry;
1182 struct hol_help_state hhstate = { 0, 0, 0 };
1183
1184 for (entry = hol->entries, num = hol->num_entries; num > 0; entry++, num--)
1185 hol_entry_help (entry, state, stream, &hhstate);
1186
1187 if (hhstate.suppressed_dup_arg && uparams.dup_args_note)
1188 {
1189 const char *tstr = dgettext (state->root_argp->argp_domain, "\
1190 Mandatory or optional arguments to long options are also mandatory or \
1191 optional for any corresponding short options.");
1192 const char *fstr = filter_doc (tstr, ARGP_KEY_HELP_DUP_ARGS_NOTE,
1193 state ? state->root_argp : 0, state);
1194 if (fstr && *fstr)
1195 {
1196 __argp_fmtstream_putc (stream, '\n');
1197 __argp_fmtstream_puts (stream, fstr);
1198 __argp_fmtstream_putc (stream, '\n');
1199 }
1200 if (fstr && fstr != tstr)
1201 free ((char *) fstr);
1202 }
1203 }
1204 \f
1205 /* Helper functions for hol_usage. */
1206
1207 /* If OPT is a short option without an arg, append its key to the string
1208 pointer pointer to by COOKIE, and advance the pointer. */
1209 static int
1210 add_argless_short_opt (const struct argp_option *opt,
1211 const struct argp_option *real,
1212 const char *domain, void *cookie)
1213 {
1214 char **snao_end = cookie;
1215 if (!(opt->arg || real->arg)
1216 && !((opt->flags | real->flags) & OPTION_NO_USAGE))
1217 *(*snao_end)++ = opt->key;
1218 return 0;
1219 }
1220
1221 /* If OPT is a short option with an arg, output a usage entry for it to the
1222 stream pointed at by COOKIE. */
1223 static int
1224 usage_argful_short_opt (const struct argp_option *opt,
1225 const struct argp_option *real,
1226 const char *domain, void *cookie)
1227 {
1228 argp_fmtstream_t stream = cookie;
1229 const char *arg = opt->arg;
1230 int flags = opt->flags | real->flags;
1231
1232 if (! arg)
1233 arg = real->arg;
1234
1235 if (arg && !(flags & OPTION_NO_USAGE))
1236 {
1237 arg = dgettext (domain, arg);
1238
1239 if (flags & OPTION_ARG_OPTIONAL)
1240 __argp_fmtstream_printf (stream, " [-%c[%s]]", opt->key, arg);
1241 else
1242 {
1243 /* Manually do line wrapping so that it (probably) won't
1244 get wrapped at the embedded space. */
1245 space (stream, 6 + strlen (arg));
1246 __argp_fmtstream_printf (stream, "[-%c %s]", opt->key, arg);
1247 }
1248 }
1249
1250 return 0;
1251 }
1252
1253 /* Output a usage entry for the long option opt to the stream pointed at by
1254 COOKIE. */
1255 static int
1256 usage_long_opt (const struct argp_option *opt,
1257 const struct argp_option *real,
1258 const char *domain, void *cookie)
1259 {
1260 argp_fmtstream_t stream = cookie;
1261 const char *arg = opt->arg;
1262 int flags = opt->flags | real->flags;
1263
1264 if (! arg)
1265 arg = real->arg;
1266
1267 if (! (flags & OPTION_NO_USAGE))
1268 {
1269 if (arg)
1270 {
1271 arg = dgettext (domain, arg);
1272 if (flags & OPTION_ARG_OPTIONAL)
1273 __argp_fmtstream_printf (stream, " [--%s[=%s]]", opt->name, arg);
1274 else
1275 __argp_fmtstream_printf (stream, " [--%s=%s]", opt->name, arg);
1276 }
1277 else
1278 __argp_fmtstream_printf (stream, " [--%s]", opt->name);
1279 }
1280
1281 return 0;
1282 }
1283 \f
1284 /* Print a short usage description for the arguments in HOL to STREAM. */
1285 static void
1286 hol_usage (struct hol *hol, argp_fmtstream_t stream)
1287 {
1288 if (hol->num_entries > 0)
1289 {
1290 unsigned nentries;
1291 struct hol_entry *entry;
1292 char *short_no_arg_opts = alloca (strlen (hol->short_options) + 1);
1293 char *snao_end = short_no_arg_opts;
1294
1295 /* First we put a list of short options without arguments. */
1296 for (entry = hol->entries, nentries = hol->num_entries
1297 ; nentries > 0
1298 ; entry++, nentries--)
1299 hol_entry_short_iterate (entry, add_argless_short_opt,
1300 entry->argp->argp_domain, &snao_end);
1301 if (snao_end > short_no_arg_opts)
1302 {
1303 *snao_end++ = 0;
1304 __argp_fmtstream_printf (stream, " [-%s]", short_no_arg_opts);
1305 }
1306
1307 /* Now a list of short options *with* arguments. */
1308 for (entry = hol->entries, nentries = hol->num_entries
1309 ; nentries > 0
1310 ; entry++, nentries--)
1311 hol_entry_short_iterate (entry, usage_argful_short_opt,
1312 entry->argp->argp_domain, stream);
1313
1314 /* Finally, a list of long options (whew!). */
1315 for (entry = hol->entries, nentries = hol->num_entries
1316 ; nentries > 0
1317 ; entry++, nentries--)
1318 hol_entry_long_iterate (entry, usage_long_opt,
1319 entry->argp->argp_domain, stream);
1320 }
1321 }
1322 \f
1323 /* Make a HOL containing all levels of options in ARGP. CLUSTER is the
1324 cluster in which ARGP's entries should be clustered, or 0. */
1325 static struct hol *
1326 argp_hol (const struct argp *argp, struct hol_cluster *cluster)
1327 {
1328 const struct argp_child *child = argp->children;
1329 struct hol *hol = make_hol (argp, cluster);
1330 if (child)
1331 while (child->argp)
1332 {
1333 struct hol_cluster *child_cluster =
1334 ((child->group || child->header)
1335 /* Put CHILD->argp within its own cluster. */
1336 ? hol_add_cluster (hol, child->group, child->header,
1337 child - argp->children, cluster, argp)
1338 /* Just merge it into the parent's cluster. */
1339 : cluster);
1340 hol_append (hol, argp_hol (child->argp, child_cluster)) ;
1341 child++;
1342 }
1343 return hol;
1344 }
1345 \f
1346 /* Calculate how many different levels with alternative args strings exist in
1347 ARGP. */
1348 static size_t
1349 argp_args_levels (const struct argp *argp)
1350 {
1351 size_t levels = 0;
1352 const struct argp_child *child = argp->children;
1353
1354 if (argp->args_doc && strchr (argp->args_doc, '\n'))
1355 levels++;
1356
1357 if (child)
1358 while (child->argp)
1359 levels += argp_args_levels ((child++)->argp);
1360
1361 return levels;
1362 }
1363
1364 /* Print all the non-option args documented in ARGP to STREAM. Any output is
1365 preceded by a space. LEVELS is a pointer to a byte vector the length
1366 returned by argp_args_levels; it should be initialized to zero, and
1367 updated by this routine for the next call if ADVANCE is true. True is
1368 returned as long as there are more patterns to output. */
1369 static int
1370 argp_args_usage (const struct argp *argp, const struct argp_state *state,
1371 char **levels, int advance, argp_fmtstream_t stream)
1372 {
1373 char *our_level = *levels;
1374 int multiple = 0;
1375 const struct argp_child *child = argp->children;
1376 const char *tdoc = dgettext (argp->argp_domain, argp->args_doc), *nl = 0;
1377 const char *fdoc = filter_doc (tdoc, ARGP_KEY_HELP_ARGS_DOC, argp, state);
1378
1379 if (fdoc)
1380 {
1381 const char *cp = fdoc;
1382 nl = __strchrnul (cp, '\n');
1383 if (*nl != '\0')
1384 /* This is a `multi-level' args doc; advance to the correct position
1385 as determined by our state in LEVELS, and update LEVELS. */
1386 {
1387 int i;
1388 multiple = 1;
1389 for (i = 0; i < *our_level; i++)
1390 cp = nl + 1, nl = __strchrnul (cp, '\n');
1391 (*levels)++;
1392 }
1393
1394 /* Manually do line wrapping so that it (probably) won't get wrapped at
1395 any embedded spaces. */
1396 space (stream, 1 + nl - cp);
1397
1398 __argp_fmtstream_write (stream, cp, nl - cp);
1399 }
1400 if (fdoc && fdoc != tdoc)
1401 free ((char *)fdoc); /* Free user's modified doc string. */
1402
1403 if (child)
1404 while (child->argp)
1405 advance = !argp_args_usage ((child++)->argp, state, levels, advance, stream);
1406
1407 if (advance && multiple)
1408 {
1409 /* Need to increment our level. */
1410 if (*nl)
1411 /* There's more we can do here. */
1412 {
1413 (*our_level)++;
1414 advance = 0; /* Our parent shouldn't advance also. */
1415 }
1416 else if (*our_level > 0)
1417 /* We had multiple levels, but used them up; reset to zero. */
1418 *our_level = 0;
1419 }
1420
1421 return !advance;
1422 }
1423 \f
1424 /* Print the documentation for ARGP to STREAM; if POST is false, then
1425 everything preceeding a `\v' character in the documentation strings (or
1426 the whole string, for those with none) is printed, otherwise, everything
1427 following the `\v' character (nothing for strings without). Each separate
1428 bit of documentation is separated a blank line, and if PRE_BLANK is true,
1429 then the first is as well. If FIRST_ONLY is true, only the first
1430 occurrence is output. Returns true if anything was output. */
1431 static int
1432 argp_doc (const struct argp *argp, const struct argp_state *state,
1433 int post, int pre_blank, int first_only,
1434 argp_fmtstream_t stream)
1435 {
1436 const char *text;
1437 const char *inp_text;
1438 void *input = 0;
1439 int anything = 0;
1440 size_t inp_text_limit = 0;
1441 const char *doc = dgettext (argp->argp_domain, argp->doc);
1442 const struct argp_child *child = argp->children;
1443
1444 if (doc)
1445 {
1446 char *vt = strchr (doc, '\v');
1447 inp_text = post ? (vt ? vt + 1 : 0) : doc;
1448 inp_text_limit = (!post && vt) ? (vt - doc) : 0;
1449 }
1450 else
1451 inp_text = 0;
1452
1453 if (argp->help_filter)
1454 /* We have to filter the doc strings. */
1455 {
1456 if (inp_text_limit)
1457 /* Copy INP_TEXT so that it's nul-terminated. */
1458 inp_text = __strndup (inp_text, inp_text_limit);
1459 input = __argp_input (argp, state);
1460 text =
1461 (*argp->help_filter) (post
1462 ? ARGP_KEY_HELP_POST_DOC
1463 : ARGP_KEY_HELP_PRE_DOC,
1464 inp_text, input);
1465 }
1466 else
1467 text = (const char *) inp_text;
1468
1469 if (text)
1470 {
1471 if (pre_blank)
1472 __argp_fmtstream_putc (stream, '\n');
1473
1474 if (text == inp_text && inp_text_limit)
1475 __argp_fmtstream_write (stream, inp_text, inp_text_limit);
1476 else
1477 __argp_fmtstream_puts (stream, text);
1478
1479 if (__argp_fmtstream_point (stream) > __argp_fmtstream_lmargin (stream))
1480 __argp_fmtstream_putc (stream, '\n');
1481
1482 anything = 1;
1483 }
1484
1485 if (text && text != inp_text)
1486 free ((char *) text); /* Free TEXT returned from the help filter. */
1487 if (inp_text && inp_text_limit && argp->help_filter)
1488 free ((char *) inp_text); /* We copied INP_TEXT, so free it now. */
1489
1490 if (post && argp->help_filter)
1491 /* Now see if we have to output a ARGP_KEY_HELP_EXTRA text. */
1492 {
1493 text = (*argp->help_filter) (ARGP_KEY_HELP_EXTRA, 0, input);
1494 if (text)
1495 {
1496 if (anything || pre_blank)
1497 __argp_fmtstream_putc (stream, '\n');
1498 __argp_fmtstream_puts (stream, text);
1499 free ((char *) text);
1500 if (__argp_fmtstream_point (stream)
1501 > __argp_fmtstream_lmargin (stream))
1502 __argp_fmtstream_putc (stream, '\n');
1503 anything = 1;
1504 }
1505 }
1506
1507 if (child)
1508 while (child->argp && !(first_only && anything))
1509 anything |=
1510 argp_doc ((child++)->argp, state,
1511 post, anything || pre_blank, first_only,
1512 stream);
1513
1514 return anything;
1515 }
1516 \f
1517 /* Output a usage message for ARGP to STREAM. If called from
1518 argp_state_help, STATE is the relevent parsing state. FLAGS are from the
1519 set ARGP_HELP_*. NAME is what to use wherever a `program name' is
1520 needed. */
1521 static void
1522 _help (const struct argp *argp, const struct argp_state *state, FILE *stream,
1523 unsigned flags, char *name)
1524 {
1525 int anything = 0; /* Whether we've output anything. */
1526 struct hol *hol = 0;
1527 argp_fmtstream_t fs;
1528
1529 if (! stream)
1530 return;
1531
1532 __flockfile (stream);
1533
1534 if (! uparams.valid)
1535 fill_in_uparams (state);
1536
1537 fs = __argp_make_fmtstream (stream, 0, uparams.rmargin, 0);
1538 if (! fs)
1539 {
1540 __funlockfile (stream);
1541 return;
1542 }
1543
1544 if (flags & (ARGP_HELP_USAGE | ARGP_HELP_SHORT_USAGE | ARGP_HELP_LONG))
1545 {
1546 hol = argp_hol (argp, 0);
1547
1548 /* If present, these options always come last. */
1549 hol_set_group (hol, "help", -1);
1550 hol_set_group (hol, "version", -1);
1551
1552 hol_sort (hol);
1553 }
1554
1555 if (flags & (ARGP_HELP_USAGE | ARGP_HELP_SHORT_USAGE))
1556 /* Print a short `Usage:' message. */
1557 {
1558 int first_pattern = 1, more_patterns;
1559 size_t num_pattern_levels = argp_args_levels (argp);
1560 char *pattern_levels = alloca (num_pattern_levels);
1561
1562 memset (pattern_levels, 0, num_pattern_levels);
1563
1564 do
1565 {
1566 int old_lm;
1567 int old_wm = __argp_fmtstream_set_wmargin (fs, uparams.usage_indent);
1568 char *levels = pattern_levels;
1569
1570 if (first_pattern)
1571 __argp_fmtstream_printf (fs, "%s %s",
1572 dgettext (argp->argp_domain, "Usage:"),
1573 name);
1574 else
1575 __argp_fmtstream_printf (fs, "%s %s",
1576 dgettext (argp->argp_domain, " or: "),
1577 name);
1578
1579 /* We set the lmargin as well as the wmargin, because hol_usage
1580 manually wraps options with newline to avoid annoying breaks. */
1581 old_lm = __argp_fmtstream_set_lmargin (fs, uparams.usage_indent);
1582
1583 if (flags & ARGP_HELP_SHORT_USAGE)
1584 /* Just show where the options go. */
1585 {
1586 if (hol->num_entries > 0)
1587 __argp_fmtstream_puts (fs, dgettext (argp->argp_domain,
1588 " [OPTION...]"));
1589 }
1590 else
1591 /* Actually print the options. */
1592 {
1593 hol_usage (hol, fs);
1594 flags |= ARGP_HELP_SHORT_USAGE; /* But only do so once. */
1595 }
1596
1597 more_patterns = argp_args_usage (argp, state, &levels, 1, fs);
1598
1599 __argp_fmtstream_set_wmargin (fs, old_wm);
1600 __argp_fmtstream_set_lmargin (fs, old_lm);
1601
1602 __argp_fmtstream_putc (fs, '\n');
1603 anything = 1;
1604
1605 first_pattern = 0;
1606 }
1607 while (more_patterns);
1608 }
1609
1610 if (flags & ARGP_HELP_PRE_DOC)
1611 anything |= argp_doc (argp, state, 0, 0, 1, fs);
1612
1613 if (flags & ARGP_HELP_SEE)
1614 {
1615 __argp_fmtstream_printf (fs, dgettext (argp->argp_domain, "\
1616 Try `%s --help' or `%s --usage' for more information.\n"),
1617 name, name);
1618 anything = 1;
1619 }
1620
1621 if (flags & ARGP_HELP_LONG)
1622 /* Print a long, detailed help message. */
1623 {
1624 /* Print info about all the options. */
1625 if (hol->num_entries > 0)
1626 {
1627 if (anything)
1628 __argp_fmtstream_putc (fs, '\n');
1629 hol_help (hol, state, fs);
1630 anything = 1;
1631 }
1632 }
1633
1634 if (flags & ARGP_HELP_POST_DOC)
1635 /* Print any documentation strings at the end. */
1636 anything |= argp_doc (argp, state, 1, anything, 0, fs);
1637
1638 if ((flags & ARGP_HELP_BUG_ADDR) && argp_program_bug_address)
1639 {
1640 if (anything)
1641 __argp_fmtstream_putc (fs, '\n');
1642 __argp_fmtstream_printf (fs, dgettext (argp->argp_domain,
1643 "Report bugs to %s.\n"),
1644 argp_program_bug_address);
1645 anything = 1;
1646 }
1647
1648 __funlockfile (stream);
1649
1650 if (hol)
1651 hol_free (hol);
1652
1653 __argp_fmtstream_free (fs);
1654 }
1655 \f
1656 /* Output a usage message for ARGP to STREAM. FLAGS are from the set
1657 ARGP_HELP_*. NAME is what to use wherever a `program name' is needed. */
1658 void __argp_help (const struct argp *argp, FILE *stream,
1659 unsigned flags, char *name)
1660 {
1661 _help (argp, 0, stream, flags, name);
1662 }
1663 #ifdef weak_alias
1664 weak_alias (__argp_help, argp_help)
1665 #endif
1666
1667 /* Output, if appropriate, a usage message for STATE to STREAM. FLAGS are
1668 from the set ARGP_HELP_*. */
1669 void
1670 __argp_state_help (const struct argp_state *state, FILE *stream, unsigned flags)
1671 {
1672 if ((!state || ! (state->flags & ARGP_NO_ERRS)) && stream)
1673 {
1674 if (state && (state->flags & ARGP_LONG_ONLY))
1675 flags |= ARGP_HELP_LONG_ONLY;
1676
1677 _help (state ? state->root_argp : 0, state, stream, flags,
1678 state ? state->name : program_invocation_short_name);
1679
1680 if (!state || ! (state->flags & ARGP_NO_EXIT))
1681 {
1682 if (flags & ARGP_HELP_EXIT_ERR)
1683 exit (argp_err_exit_status);
1684 if (flags & ARGP_HELP_EXIT_OK)
1685 exit (0);
1686 }
1687 }
1688 }
1689 #ifdef weak_alias
1690 weak_alias (__argp_state_help, argp_state_help)
1691 #endif
1692 \f
1693 /* If appropriate, print the printf string FMT and following args, preceded
1694 by the program name and `:', to stderr, and followed by a `Try ... --help'
1695 message, then exit (1). */
1696 void
1697 __argp_error (const struct argp_state *state, const char *fmt, ...)
1698 {
1699 if (!state || !(state->flags & ARGP_NO_ERRS))
1700 {
1701 FILE *stream = state ? state->err_stream : stderr;
1702
1703 if (stream)
1704 {
1705 va_list ap;
1706
1707 __flockfile (stream);
1708
1709 va_start (ap, fmt);
1710
1711 #ifdef USE_IN_LIBIO
1712 if (_IO_fwide (stream, 0) > 0)
1713 {
1714 char *buf;
1715
1716 __asprintf (&buf, fmt, ap);
1717
1718 __fwprintf (stream, L"%s: %s\n",
1719 state ? state->name : program_invocation_short_name,
1720 buf);
1721
1722 free (buf);
1723 }
1724 else
1725 #endif
1726 {
1727 fputs_unlocked (state
1728 ? state->name : program_invocation_short_name,
1729 stream);
1730 putc_unlocked (':', stream);
1731 putc_unlocked (' ', stream);
1732
1733 vfprintf (stream, fmt, ap);
1734
1735 putc_unlocked ('\n', stream);
1736 }
1737
1738 __argp_state_help (state, stream, ARGP_HELP_STD_ERR);
1739
1740 va_end (ap);
1741
1742 __funlockfile (stream);
1743 }
1744 }
1745 }
1746 #ifdef weak_alias
1747 weak_alias (__argp_error, argp_error)
1748 #endif
1749 \f
1750 /* Similar to the standard gnu error-reporting function error(), but will
1751 respect the ARGP_NO_EXIT and ARGP_NO_ERRS flags in STATE, and will print
1752 to STATE->err_stream. This is useful for argument parsing code that is
1753 shared between program startup (when exiting is desired) and runtime
1754 option parsing (when typically an error code is returned instead). The
1755 difference between this function and argp_error is that the latter is for
1756 *parsing errors*, and the former is for other problems that occur during
1757 parsing but don't reflect a (syntactic) problem with the input. */
1758 void
1759 __argp_failure (const struct argp_state *state, int status, int errnum,
1760 const char *fmt, ...)
1761 {
1762 if (!state || !(state->flags & ARGP_NO_ERRS))
1763 {
1764 FILE *stream = state ? state->err_stream : stderr;
1765
1766 if (stream)
1767 {
1768 __flockfile (stream);
1769
1770 #ifdef USE_IN_LIBIO
1771 if (_IO_fwide (stream, 0) > 0)
1772 __fwprintf (stream, L"%s",
1773 state ? state->name : program_invocation_short_name);
1774 else
1775 #endif
1776 fputs_unlocked (state
1777 ? state->name : program_invocation_short_name,
1778 stream);
1779
1780 if (fmt)
1781 {
1782 va_list ap;
1783
1784 va_start (ap, fmt);
1785 #ifdef USE_IN_LIBIO
1786 if (_IO_fwide (stream, 0) > 0)
1787 {
1788 char *buf;
1789
1790 __asprintf (&buf, fmt, ap);
1791
1792 __fwprintf (stream, L": %s", buf);
1793
1794 free (buf);
1795 }
1796 else
1797 #endif
1798 {
1799 putc_unlocked (':', stream);
1800 putc_unlocked (' ', stream);
1801
1802 vfprintf (stream, fmt, ap);
1803 }
1804
1805 va_end (ap);
1806 }
1807
1808 if (errnum)
1809 {
1810 char buf[200];
1811
1812 #ifdef USE_IN_LIBIO
1813 if (_IO_fwide (stream, 0) > 0)
1814 __fwprintf (stream, L": %s",
1815 __strerror_r (errnum, buf, sizeof (buf)));
1816 else
1817 #endif
1818 {
1819 putc_unlocked (':', stream);
1820 putc_unlocked (' ', stream);
1821 fputs (__strerror_r (errnum, buf, sizeof (buf)), stream);
1822 }
1823 }
1824
1825 #ifdef USE_IN_LIBIO
1826 if (_IO_fwide (stream, 0) > 0)
1827 putwc_unlocked (L'\n', stream);
1828 else
1829 #endif
1830 putc_unlocked ('\n', stream);
1831
1832 __funlockfile (stream);
1833
1834 if (status && (!state || !(state->flags & ARGP_NO_EXIT)))
1835 exit (status);
1836 }
1837 }
1838 }
1839 #ifdef weak_alias
1840 weak_alias (__argp_failure, argp_failure)
1841 #endif