|
|
@@ -1,122 +1,874 @@
|
|
|
+/* Getopt for GNU.
|
|
|
+ NOTE: getopt is now part of the C library, so if you don't know what
|
|
|
+ "Keep this file name-space clean" means, talk to roland@gnu.ai.mit.edu
|
|
|
+ before changing it!
|
|
|
|
|
|
-/*
|
|
|
- * From: gwyn@brl-tgr.ARPA (Doug Gwyn <gwyn>) Newsgroups: net.sources
|
|
|
- * Subject: getopt library routine Date: 30 Mar 85 04:45:33 GMT
|
|
|
- */
|
|
|
-/*
|
|
|
- * getopt -- public domain version of standard System V routine
|
|
|
- *
|
|
|
- * Strictly enforces the System V Command Syntax Standard; provided by D A
|
|
|
- * Gwyn of BRL for generic ANSI C implementations
|
|
|
- *
|
|
|
- * #define STRICT to prevent acceptance of clustered options with arguments
|
|
|
- * and ommision of whitespace between option and arg.
|
|
|
- */
|
|
|
+ Copyright (C) 1987, 88, 89, 90, 91, 92, 93, 94
|
|
|
+ Free Software Foundation, Inc.
|
|
|
+
|
|
|
+ This program is free software; you can redistribute it and/or
|
|
|
+ modify it under the terms of the GNU Library General Public License
|
|
|
+ as published by the Free Software Foundation; either version 2, or
|
|
|
+ (at your option) any later version.
|
|
|
+
|
|
|
+ This program is distributed in the hope that it will be useful,
|
|
|
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
+ GNU Library General Public License for more details.
|
|
|
+
|
|
|
+ You should have received a copy of the GNU Library General Public License
|
|
|
+ along with this program; if not, write to the Free Software
|
|
|
+ Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
|
|
|
|
|
|
/*
|
|
|
- * Modified by Manuel Novoa III on 1/5/01 to use weak symbols.
|
|
|
- * Programs needing long options will link gnu_getopt instead.
|
|
|
+ * Modified for uClibc by Manuel Novoa III on 1/5/01.
|
|
|
*/
|
|
|
|
|
|
#include <stdio.h>
|
|
|
#include <string.h>
|
|
|
+#include <stdlib.h>
|
|
|
+
|
|
|
+/* This version of `getopt' appears to the caller like standard Unix `getopt'
|
|
|
+ but it behaves differently for the user, since it allows the user
|
|
|
+ to intersperse the options with the other arguments.
|
|
|
+
|
|
|
+ As `getopt' works, it permutes the elements of ARGV so that,
|
|
|
+ when it is done, all the options precede everything else. Thus
|
|
|
+ all application programs are extended to handle flexible argument order.
|
|
|
+
|
|
|
+ Setting the environment variable POSIXLY_CORRECT disables permutation.
|
|
|
+ Then the behavior is completely standard.
|
|
|
+
|
|
|
+ GNU application programs can use a third alternative mode in which
|
|
|
+ they can distinguish the relative order of options and other arguments. */
|
|
|
+
|
|
|
+#include <getopt.h>
|
|
|
+
|
|
|
+extern int _getopt_internal (int argc, char *const *argv,
|
|
|
+ const char *optstring,
|
|
|
+ const struct option *longopts,
|
|
|
+ int *longind, int long_only);
|
|
|
+
|
|
|
+
|
|
|
+#ifdef L__gnu_getopt_internal
|
|
|
+
|
|
|
+/* For communication from `getopt' to the caller.
|
|
|
+ When `getopt' finds an option that takes an argument,
|
|
|
+ the argument value is returned here.
|
|
|
+ Also, when `ordering' is RETURN_IN_ORDER,
|
|
|
+ each non-option ARGV-element is returned here. */
|
|
|
+
|
|
|
+char *optarg = NULL;
|
|
|
+
|
|
|
+/* Index in ARGV of the next element to be scanned.
|
|
|
+ This is used for communication to and from the caller
|
|
|
+ and for communication between successive calls to `getopt'.
|
|
|
+
|
|
|
+ On entry to `getopt', zero means this is the first call; initialize.
|
|
|
+
|
|
|
+ When `getopt' returns EOF, this is the index of the first of the
|
|
|
+ non-option elements that the caller should itself scan.
|
|
|
+
|
|
|
+ Otherwise, `optind' communicates from one call to the next
|
|
|
+ how much of ARGV has been scanned so far. */
|
|
|
+
|
|
|
+/* XXX 1003.2 says this must be 1 before any call. */
|
|
|
+int optind = 0;
|
|
|
+
|
|
|
|
|
|
-extern int opterr; /* error => print message */
|
|
|
-extern int optind; /* next argv[] index */
|
|
|
-extern int optopt; /* Set for unknown arguments */
|
|
|
-extern char *optarg; /* option parameter if any */
|
|
|
+/* Callers store zero here to inhibit the error message
|
|
|
+ for unrecognized options. */
|
|
|
|
|
|
-static int Err(name, mess, c) /* returns '?' */
|
|
|
-char *name; /* program name argv[0] */
|
|
|
-char *mess; /* specific message */
|
|
|
-int c; /* defective option letter */
|
|
|
+int opterr = 1;
|
|
|
+
|
|
|
+/* Set to an option character which was unrecognized.
|
|
|
+ This must be initialized on some systems to avoid linking in the
|
|
|
+ system's own getopt implementation. */
|
|
|
+
|
|
|
+int optopt = '?';
|
|
|
+
|
|
|
+/* The next char to be scanned in the option-element
|
|
|
+ in which the last option character we returned was found.
|
|
|
+ This allows us to pick up the scan where we left off.
|
|
|
+
|
|
|
+ If this is zero, or a null string, it means resume the scan
|
|
|
+ by advancing to the next ARGV-element. */
|
|
|
+
|
|
|
+static char *nextchar;
|
|
|
+
|
|
|
+/* Describe how to deal with options that follow non-option ARGV-elements.
|
|
|
+
|
|
|
+ If the caller did not specify anything,
|
|
|
+ the default is REQUIRE_ORDER if the environment variable
|
|
|
+ POSIXLY_CORRECT is defined, PERMUTE otherwise.
|
|
|
+
|
|
|
+ REQUIRE_ORDER means don't recognize them as options;
|
|
|
+ stop option processing when the first non-option is seen.
|
|
|
+ This is what Unix does.
|
|
|
+ This mode of operation is selected by either setting the environment
|
|
|
+ variable POSIXLY_CORRECT, or using `+' as the first character
|
|
|
+ of the list of option characters.
|
|
|
+
|
|
|
+ PERMUTE is the default. We permute the contents of ARGV as we scan,
|
|
|
+ so that eventually all the non-options are at the end. This allows options
|
|
|
+ to be given in any order, even with programs that were not written to
|
|
|
+ expect this.
|
|
|
+
|
|
|
+ RETURN_IN_ORDER is an option available to programs that were written
|
|
|
+ to expect options and other ARGV-elements in any order and that care about
|
|
|
+ the ordering of the two. We describe each non-option ARGV-element
|
|
|
+ as if it were the argument of an option with character code 1.
|
|
|
+ Using `-' as the first character of the list of option characters
|
|
|
+ selects this mode of operation.
|
|
|
+
|
|
|
+ The special argument `--' forces an end of option-scanning regardless
|
|
|
+ of the value of `ordering'. In the case of RETURN_IN_ORDER, only
|
|
|
+ `--' can cause `getopt' to return EOF with `optind' != ARGC. */
|
|
|
+
|
|
|
+static enum
|
|
|
{
|
|
|
- optopt = c;
|
|
|
- if (opterr) {
|
|
|
- (void) fprintf(stderr, "%s: %s -- %c\n", name, mess, c);
|
|
|
+ REQUIRE_ORDER, PERMUTE, RETURN_IN_ORDER
|
|
|
+} ordering;
|
|
|
+
|
|
|
+#include <string.h>
|
|
|
+#define my_index strchr
|
|
|
+
|
|
|
+/* Handle permutation of arguments. */
|
|
|
+
|
|
|
+/* Describe the part of ARGV that contains non-options that have
|
|
|
+ been skipped. `first_nonopt' is the index in ARGV of the first of them;
|
|
|
+ `last_nonopt' is the index after the last of them. */
|
|
|
+
|
|
|
+static int first_nonopt;
|
|
|
+static int last_nonopt;
|
|
|
+
|
|
|
+/* Exchange two adjacent subsequences of ARGV.
|
|
|
+ One subsequence is elements [first_nonopt,last_nonopt)
|
|
|
+ which contains all the non-options that have been skipped so far.
|
|
|
+ The other is elements [last_nonopt,optind), which contains all
|
|
|
+ the options processed since those non-options were skipped.
|
|
|
+
|
|
|
+ `first_nonopt' and `last_nonopt' are relocated so that they describe
|
|
|
+ the new indices of the non-options in ARGV after they are moved. */
|
|
|
+
|
|
|
+static void
|
|
|
+exchange (argv)
|
|
|
+ char **argv;
|
|
|
+{
|
|
|
+ int bottom = first_nonopt;
|
|
|
+ int middle = last_nonopt;
|
|
|
+ int top = optind;
|
|
|
+ char *tem;
|
|
|
+
|
|
|
+ /* Exchange the shorter segment with the far end of the longer segment.
|
|
|
+ That puts the shorter segment into the right place.
|
|
|
+ It leaves the longer segment in the right place overall,
|
|
|
+ but it consists of two parts that need to be swapped next. */
|
|
|
+
|
|
|
+ while (top > middle && middle > bottom)
|
|
|
+ {
|
|
|
+ if (top - middle > middle - bottom)
|
|
|
+ {
|
|
|
+ /* Bottom segment is the short one. */
|
|
|
+ int len = middle - bottom;
|
|
|
+ register int i;
|
|
|
+
|
|
|
+ /* Swap it with the top part of the top segment. */
|
|
|
+ for (i = 0; i < len; i++)
|
|
|
+ {
|
|
|
+ tem = argv[bottom + i];
|
|
|
+ argv[bottom + i] = argv[top - (middle - bottom) + i];
|
|
|
+ argv[top - (middle - bottom) + i] = tem;
|
|
|
+ }
|
|
|
+ /* Exclude the moved bottom segment from further swapping. */
|
|
|
+ top -= len;
|
|
|
}
|
|
|
+ else
|
|
|
+ {
|
|
|
+ /* Top segment is the short one. */
|
|
|
+ int len = top - middle;
|
|
|
+ register int i;
|
|
|
+
|
|
|
+ /* Swap it with the bottom part of the bottom segment. */
|
|
|
+ for (i = 0; i < len; i++)
|
|
|
+ {
|
|
|
+ tem = argv[bottom + i];
|
|
|
+ argv[bottom + i] = argv[middle + i];
|
|
|
+ argv[middle + i] = tem;
|
|
|
+ }
|
|
|
+ /* Exclude the moved top segment from further swapping. */
|
|
|
+ bottom += len;
|
|
|
+ }
|
|
|
+ }
|
|
|
+
|
|
|
+ /* Update records for the slots the non-options now occupy. */
|
|
|
|
|
|
- return '?'; /* erroneous-option marker */
|
|
|
+ first_nonopt += (optind - last_nonopt);
|
|
|
+ last_nonopt = optind;
|
|
|
}
|
|
|
|
|
|
-int __attribute__ ((__weak__)) getopt (int argc, char *const *argv, const char *optstring)
|
|
|
+/* Initialize the internal data when the first call is made. */
|
|
|
+
|
|
|
+static const char *
|
|
|
+_getopt_initialize (optstring)
|
|
|
+ const char *optstring;
|
|
|
{
|
|
|
- static int sp = 1; /* position within argument */
|
|
|
- register int osp; /* saved `sp' for param test */
|
|
|
+ /* Start processing options with ARGV-element 1 (since ARGV-element 0
|
|
|
+ is the program name); the sequence of previously skipped
|
|
|
+ non-option ARGV-elements is empty. */
|
|
|
+
|
|
|
+ first_nonopt = last_nonopt = optind = 1;
|
|
|
+
|
|
|
+ nextchar = NULL;
|
|
|
+
|
|
|
+ /* Determine how to handle the ordering of options and nonoptions. */
|
|
|
+
|
|
|
+ if (optstring[0] == '-')
|
|
|
+ {
|
|
|
+ ordering = RETURN_IN_ORDER;
|
|
|
+ ++optstring;
|
|
|
+ }
|
|
|
+ else if (optstring[0] == '+')
|
|
|
+ {
|
|
|
+ ordering = REQUIRE_ORDER;
|
|
|
+ ++optstring;
|
|
|
+ }
|
|
|
+ else if (getenv ("POSIXLY_CORRECT") != NULL)
|
|
|
+ ordering = REQUIRE_ORDER;
|
|
|
+ else
|
|
|
+ ordering = PERMUTE;
|
|
|
+
|
|
|
+ return optstring;
|
|
|
+}
|
|
|
+
|
|
|
+/* Scan elements of ARGV (whose length is ARGC) for option characters
|
|
|
+ given in OPTSTRING.
|
|
|
+
|
|
|
+ If an element of ARGV starts with '-', and is not exactly "-" or "--",
|
|
|
+ then it is an option element. The characters of this element
|
|
|
+ (aside from the initial '-') are option characters. If `getopt'
|
|
|
+ is called repeatedly, it returns successively each of the option characters
|
|
|
+ from each of the option elements.
|
|
|
+
|
|
|
+ If `getopt' finds another option character, it returns that character,
|
|
|
+ updating `optind' and `nextchar' so that the next call to `getopt' can
|
|
|
+ resume the scan with the following option character or ARGV-element.
|
|
|
+
|
|
|
+ If there are no more option characters, `getopt' returns `EOF'.
|
|
|
+ Then `optind' is the index in ARGV of the first ARGV-element
|
|
|
+ that is not an option. (The ARGV-elements have been permuted
|
|
|
+ so that those that are not options now come last.)
|
|
|
+
|
|
|
+ OPTSTRING is a string containing the legitimate option characters.
|
|
|
+ If an option character is seen that is not listed in OPTSTRING,
|
|
|
+ return '?' after printing an error message. If you set `opterr' to
|
|
|
+ zero, the error message is suppressed but we still return '?'.
|
|
|
+
|
|
|
+ If a char in OPTSTRING is followed by a colon, that means it wants an arg,
|
|
|
+ so the following text in the same ARGV-element, or the text of the following
|
|
|
+ ARGV-element, is returned in `optarg'. Two colons mean an option that
|
|
|
+ wants an optional arg; if there is text in the current ARGV-element,
|
|
|
+ it is returned in `optarg', otherwise `optarg' is set to zero.
|
|
|
+
|
|
|
+ If OPTSTRING starts with `-' or `+', it requests different methods of
|
|
|
+ handling the non-option ARGV-elements.
|
|
|
+ See the comments about RETURN_IN_ORDER and REQUIRE_ORDER, above.
|
|
|
+
|
|
|
+ Long-named options begin with `--' instead of `-'.
|
|
|
+ Their names may be abbreviated as long as the abbreviation is unique
|
|
|
+ or is an exact match for some defined option. If they have an
|
|
|
+ argument, it follows the option name in the same ARGV-element, separated
|
|
|
+ from the option name by a `=', or else the in next ARGV-element.
|
|
|
+ When `getopt' finds a long-named option, it returns 0 if that option's
|
|
|
+ `flag' field is nonzero, the value of the option's `val' field
|
|
|
+ if the `flag' field is zero.
|
|
|
+
|
|
|
+ The elements of ARGV aren't really const, because we permute them.
|
|
|
+ But we pretend they're const in the prototype to be compatible
|
|
|
+ with other systems.
|
|
|
+
|
|
|
+ LONGOPTS is a vector of `struct option' terminated by an
|
|
|
+ element containing a name which is zero.
|
|
|
|
|
|
-#ifndef STRICT
|
|
|
- register int oind; /* saved `optind' for param test */
|
|
|
+ LONGIND returns the index in LONGOPT of the long-named option found.
|
|
|
+ It is only valid when a long-named option has been found by the most
|
|
|
+ recent call.
|
|
|
+
|
|
|
+ If LONG_ONLY is nonzero, '-' as well as '--' can introduce
|
|
|
+ long-named options. */
|
|
|
+
|
|
|
+#if NLS
|
|
|
+#include "nl_types.h"
|
|
|
#endif
|
|
|
- register int c; /* option letter */
|
|
|
- register char *cp; /* -> option in `optstring' */
|
|
|
|
|
|
- optarg = NULL;
|
|
|
-
|
|
|
- /* initialise getopt vars */
|
|
|
- if (optind == 0)
|
|
|
- {
|
|
|
- optind = 1;
|
|
|
- opterr = 1;
|
|
|
- optopt = 1;
|
|
|
- optarg = NULL;
|
|
|
- }
|
|
|
-
|
|
|
- if (sp == 1) { /* fresh argument */
|
|
|
- if (optind >= argc /* no more arguments */
|
|
|
- || argv[optind][0] != '-' /* no more options */
|
|
|
- || argv[optind][1] == '\0' /* not option; stdin */
|
|
|
- )
|
|
|
- return EOF;
|
|
|
- else if (strcmp(argv[optind], "--") == 0) {
|
|
|
- ++optind; /* skip over "--" */
|
|
|
- return EOF; /* "--" marks end of options */
|
|
|
- }
|
|
|
+int
|
|
|
+_getopt_internal (argc, argv, optstring, longopts, longind, long_only)
|
|
|
+ int argc;
|
|
|
+ char *const *argv;
|
|
|
+ const char *optstring;
|
|
|
+ const struct option *longopts;
|
|
|
+ int *longind;
|
|
|
+ int long_only;
|
|
|
+{
|
|
|
+ optarg = NULL;
|
|
|
+
|
|
|
+#if NLS
|
|
|
+ libc_nls_init();
|
|
|
+#endif
|
|
|
+
|
|
|
+ if (optind == 0)
|
|
|
+ optstring = _getopt_initialize (optstring);
|
|
|
+
|
|
|
+ if (nextchar == NULL || *nextchar == '\0')
|
|
|
+ {
|
|
|
+ /* Advance to the next ARGV-element. */
|
|
|
+
|
|
|
+ if (ordering == PERMUTE)
|
|
|
+ {
|
|
|
+ /* If we have just processed some options following some non-options,
|
|
|
+ exchange them so that the options come first. */
|
|
|
+
|
|
|
+ if (first_nonopt != last_nonopt && last_nonopt != optind)
|
|
|
+ exchange ((char **) argv);
|
|
|
+ else if (last_nonopt != optind)
|
|
|
+ first_nonopt = optind;
|
|
|
+
|
|
|
+ /* Skip any additional non-options
|
|
|
+ and extend the range of non-options previously skipped. */
|
|
|
+
|
|
|
+ while (optind < argc
|
|
|
+ && (argv[optind][0] != '-' || argv[optind][1] == '\0'))
|
|
|
+ optind++;
|
|
|
+ last_nonopt = optind;
|
|
|
}
|
|
|
|
|
|
- c = argv[optind][sp]; /* option letter */
|
|
|
- osp = sp++; /* get ready for next letter */
|
|
|
+ /* The special ARGV-element `--' means premature end of options.
|
|
|
+ Skip it like a null option,
|
|
|
+ then exchange with previous non-options as if it were an option,
|
|
|
+ then skip everything else like a non-option. */
|
|
|
|
|
|
-#ifndef STRICT
|
|
|
- oind = optind; /* save optind for param test */
|
|
|
-#endif
|
|
|
- if (argv[optind][sp] == '\0') { /* end of argument */
|
|
|
- ++optind; /* get ready for next try */
|
|
|
- sp = 1; /* beginning of next argument */
|
|
|
+ if (optind != argc && !strcmp (argv[optind], "--"))
|
|
|
+ {
|
|
|
+ optind++;
|
|
|
+
|
|
|
+ if (first_nonopt != last_nonopt && last_nonopt != optind)
|
|
|
+ exchange ((char **) argv);
|
|
|
+ else if (first_nonopt == last_nonopt)
|
|
|
+ first_nonopt = optind;
|
|
|
+ last_nonopt = argc;
|
|
|
+
|
|
|
+ optind = argc;
|
|
|
}
|
|
|
|
|
|
- if (c == ':' || c == '?' /* optstring syntax conflict */
|
|
|
- || (cp = strchr(optstring, c)) == NULL /* not found */ ) {
|
|
|
- return Err(argv[0], "illegal option", c);
|
|
|
+ /* If we have done all the ARGV-elements, stop the scan
|
|
|
+ and back over any non-options that we skipped and permuted. */
|
|
|
+
|
|
|
+ if (optind == argc)
|
|
|
+ {
|
|
|
+ /* Set the next-arg-index to point at the non-options
|
|
|
+ that we previously skipped, so the caller will digest them. */
|
|
|
+ if (first_nonopt != last_nonopt)
|
|
|
+ optind = first_nonopt;
|
|
|
+ return EOF;
|
|
|
}
|
|
|
|
|
|
- if (cp[1] == ':') { /* option takes parameter */
|
|
|
-#ifdef STRICT
|
|
|
- if (osp != 1) {
|
|
|
- return Err(argv[0], "option must not be clustered", c);
|
|
|
- }
|
|
|
+ /* If we have come to a non-option and did not permute it,
|
|
|
+ either stop the scan or describe it to the caller and pass it by. */
|
|
|
+
|
|
|
+ if ((argv[optind][0] != '-' || argv[optind][1] == '\0'))
|
|
|
+ {
|
|
|
+ if (ordering == REQUIRE_ORDER)
|
|
|
+ return EOF;
|
|
|
+ optarg = argv[optind++];
|
|
|
+ return 1;
|
|
|
+ }
|
|
|
+
|
|
|
+ /* We have found another option-ARGV-element.
|
|
|
+ Skip the initial punctuation. */
|
|
|
|
|
|
- /* reset by end of argument */
|
|
|
- if (sp != 1) {
|
|
|
- return Err(argv[0], "option must be followed by white space",
|
|
|
- c);
|
|
|
+ nextchar = (argv[optind] + 1
|
|
|
+ + (longopts != NULL && argv[optind][1] == '-'));
|
|
|
+ }
|
|
|
+
|
|
|
+ /* Decode the current option-ARGV-element. */
|
|
|
+
|
|
|
+ /* Check whether the ARGV-element is a long option.
|
|
|
+
|
|
|
+ If long_only and the ARGV-element has the form "-f", where f is
|
|
|
+ a valid short option, don't consider it an abbreviated form of
|
|
|
+ a long option that starts with f. Otherwise there would be no
|
|
|
+ way to give the -f short option.
|
|
|
+
|
|
|
+ On the other hand, if there's a long option "fubar" and
|
|
|
+ the ARGV-element is "-fu", do consider that an abbreviation of
|
|
|
+ the long option, just like "--fu", and not "-f" with arg "u".
|
|
|
+
|
|
|
+ This distinction seems to be the most useful approach. */
|
|
|
+
|
|
|
+ if (longopts != NULL
|
|
|
+ && (argv[optind][1] == '-'
|
|
|
+ || (long_only && (argv[optind][2] || !my_index (optstring, argv[optind][1])))))
|
|
|
+ {
|
|
|
+ char *nameend;
|
|
|
+ const struct option *p;
|
|
|
+ const struct option *pfound = NULL;
|
|
|
+ int exact = 0;
|
|
|
+ int ambig = 0;
|
|
|
+ int indfound = 0;
|
|
|
+ int option_index;
|
|
|
+
|
|
|
+ for (nameend = nextchar; *nameend && *nameend != '='; nameend++)
|
|
|
+ /* Do nothing. */ ;
|
|
|
+
|
|
|
+ /* Test all long options for either exact match
|
|
|
+ or abbreviated matches. */
|
|
|
+ for (p = longopts, option_index = 0; p->name; p++, option_index++)
|
|
|
+ if (!strncmp (p->name, nextchar, nameend - nextchar))
|
|
|
+ {
|
|
|
+ if (nameend - nextchar == strlen (p->name))
|
|
|
+ {
|
|
|
+ /* Exact match found. */
|
|
|
+ pfound = p;
|
|
|
+ indfound = option_index;
|
|
|
+ exact = 1;
|
|
|
+ break;
|
|
|
+ }
|
|
|
+ else if (pfound == NULL)
|
|
|
+ {
|
|
|
+ /* First nonexact match found. */
|
|
|
+ pfound = p;
|
|
|
+ indfound = option_index;
|
|
|
+ }
|
|
|
+ else
|
|
|
+ /* Second or later nonexact match found. */
|
|
|
+ ambig = 1;
|
|
|
+ }
|
|
|
+
|
|
|
+ if (ambig && !exact)
|
|
|
+ {
|
|
|
+ if (opterr)
|
|
|
+#if NLS
|
|
|
+ fprintf (stderr,
|
|
|
+ catgets(_libc_cat, GetoptSet, GetoptAmbiguous,
|
|
|
+ "%s: option `%s' is ambiguous\n"),
|
|
|
+ argv[0], argv[optind]);
|
|
|
+#else
|
|
|
+ fprintf (stderr, "%s: option `%s' is ambiguous\n",
|
|
|
+ argv[0], argv[optind]);
|
|
|
+#endif
|
|
|
+ nextchar += strlen (nextchar);
|
|
|
+ optind++;
|
|
|
+ return '?';
|
|
|
+ }
|
|
|
+
|
|
|
+ if (pfound != NULL)
|
|
|
+ {
|
|
|
+ option_index = indfound;
|
|
|
+ optind++;
|
|
|
+ if (*nameend)
|
|
|
+ {
|
|
|
+ /* Don't test has_arg with >, because some C compilers don't
|
|
|
+ allow it to be used on enums. */
|
|
|
+ if (pfound->has_arg)
|
|
|
+ optarg = nameend + 1;
|
|
|
+ else
|
|
|
+ {
|
|
|
+ if (opterr)
|
|
|
+ {
|
|
|
+ if (argv[optind - 1][1] == '-')
|
|
|
+ /* --option */
|
|
|
+#if NLS
|
|
|
+ fprintf (stderr,
|
|
|
+ catgets(_libc_cat, GetoptSet, GetoptNoArgumentsAllowed1,
|
|
|
+ "%s: option `--%s' doesn't allow an argument\n"),
|
|
|
+ argv[0], pfound->name);
|
|
|
+#else
|
|
|
+ fprintf (stderr,
|
|
|
+ "%s: option `--%s' doesn't allow an argument\n",
|
|
|
+ argv[0], pfound->name);
|
|
|
+#endif
|
|
|
+ else
|
|
|
+ /* +option or -option */
|
|
|
+#if NLS
|
|
|
+ fprintf (stderr,
|
|
|
+ catgets(_libc_cat, GetoptSet, GetoptNoArgumentsAllowed2,
|
|
|
+ "%s: option `%c%s' doesn't allow an argument\n"),
|
|
|
+ argv[0], argv[optind - 1][0], pfound->name);
|
|
|
+#else
|
|
|
+ fprintf (stderr,
|
|
|
+ "%s: option `%c%s' doesn't allow an argument\n",
|
|
|
+ argv[0], argv[optind - 1][0], pfound->name);
|
|
|
+#endif
|
|
|
+ }
|
|
|
+ nextchar += strlen (nextchar);
|
|
|
+ return '?';
|
|
|
}
|
|
|
+ }
|
|
|
+ else if (pfound->has_arg == 1)
|
|
|
+ {
|
|
|
+ if (optind < argc)
|
|
|
+ optarg = argv[optind++];
|
|
|
+ else
|
|
|
+ {
|
|
|
+ if (opterr)
|
|
|
+#if NLS
|
|
|
+ fprintf (stderr,
|
|
|
+ catgets(_libc_cat, GetoptSet, GetoptRequiresArgument1,
|
|
|
+ "%s: option `%s' requires an argument\n"),
|
|
|
+ argv[0], argv[optind - 1]);
|
|
|
#else
|
|
|
- if (oind == optind) { /* argument w/o whitespace */
|
|
|
- optarg = &argv[optind][sp];
|
|
|
- sp = 1; /* beginning of next argument */
|
|
|
+ fprintf (stderr, "%s: option `%s' requires an argument\n",
|
|
|
+ argv[0], argv[optind - 1]);
|
|
|
+#endif
|
|
|
+ nextchar += strlen (nextchar);
|
|
|
+ return optstring[0] == ':' ? ':' : '?';
|
|
|
}
|
|
|
+ }
|
|
|
+ nextchar += strlen (nextchar);
|
|
|
+ if (longind != NULL)
|
|
|
+ *longind = option_index;
|
|
|
+ if (pfound->flag)
|
|
|
+ {
|
|
|
+ *(pfound->flag) = pfound->val;
|
|
|
+ return 0;
|
|
|
+ }
|
|
|
+ return pfound->val;
|
|
|
+ }
|
|
|
|
|
|
- else
|
|
|
+ /* Can't find it as a long option. If this is not getopt_long_only,
|
|
|
+ or the option starts with '--' or is not a valid short
|
|
|
+ option, then it's an error.
|
|
|
+ Otherwise interpret it as a short option. */
|
|
|
+ if (!long_only || argv[optind][1] == '-'
|
|
|
+ || my_index (optstring, *nextchar) == NULL)
|
|
|
+ {
|
|
|
+ if (opterr)
|
|
|
+ {
|
|
|
+ if (argv[optind][1] == '-')
|
|
|
+ /* --option */
|
|
|
+#if NLS
|
|
|
+ fprintf (stderr,
|
|
|
+ catgets(_libc_cat, GetoptSet, GetoptUnrecognized1,
|
|
|
+ "%s: unrecognized option `--%s'\n"),
|
|
|
+ argv[0], nextchar);
|
|
|
+#else
|
|
|
+ fprintf (stderr, "%s: unrecognized option `--%s'\n",
|
|
|
+ argv[0], nextchar);
|
|
|
#endif
|
|
|
- if (optind >= argc) {
|
|
|
- return Err(argv[0], "option requires an argument", c);
|
|
|
- }
|
|
|
+ else
|
|
|
+ /* +option or -option */
|
|
|
+#if NLS
|
|
|
+ fprintf (stderr,
|
|
|
+ catgets(_libc_cat, GetoptSet, GetoptUnrecognized2,
|
|
|
+ "%s: unrecognized option `%c%s'\n"),
|
|
|
+ argv[0], argv[optind][0], nextchar);
|
|
|
+#else
|
|
|
+ fprintf (stderr, "%s: unrecognized option `%c%s'\n",
|
|
|
+ argv[0], argv[optind][0], nextchar);
|
|
|
+#endif
|
|
|
+ }
|
|
|
+ nextchar = (char *) "";
|
|
|
+ optind++;
|
|
|
+ return '?';
|
|
|
+ }
|
|
|
+ }
|
|
|
+
|
|
|
+ /* Look at and handle the next short option-character. */
|
|
|
+
|
|
|
+ {
|
|
|
+ char c = *nextchar++;
|
|
|
+ char *temp = my_index (optstring, c);
|
|
|
|
|
|
- else /* argument w/ whitespace */
|
|
|
- optarg = argv[optind];
|
|
|
+ /* Increment `optind' when we start to process its last character. */
|
|
|
+ if (*nextchar == '\0')
|
|
|
+ ++optind;
|
|
|
+
|
|
|
+ if (temp == NULL || c == ':')
|
|
|
+ {
|
|
|
+ if (opterr)
|
|
|
+ {
|
|
|
+ /* 1003.2 specifies the format of this message. */
|
|
|
+#if NLS
|
|
|
+ fprintf (stderr,
|
|
|
+ catgets(_libc_cat, GetoptSet, GetoptIllegal,
|
|
|
+ "%s: illegal option -- %c\n"),
|
|
|
+ argv[0], c);
|
|
|
+#else
|
|
|
+ fprintf (stderr, "%s: illegal option -- %c\n", argv[0], c);
|
|
|
+#endif
|
|
|
+ }
|
|
|
+ optopt = c;
|
|
|
+ return '?';
|
|
|
+ }
|
|
|
+ if (temp[1] == ':')
|
|
|
+ {
|
|
|
+ if (temp[2] == ':')
|
|
|
+ {
|
|
|
+ /* This is an option that accepts an argument optionally. */
|
|
|
+ if (*nextchar != '\0')
|
|
|
+ {
|
|
|
+ optarg = nextchar;
|
|
|
+ optind++;
|
|
|
+ }
|
|
|
+ else
|
|
|
+ optarg = NULL;
|
|
|
+ nextchar = NULL;
|
|
|
+ }
|
|
|
+ else
|
|
|
+ {
|
|
|
+ /* This is an option that requires an argument. */
|
|
|
+ if (*nextchar != '\0')
|
|
|
+ {
|
|
|
+ optarg = nextchar;
|
|
|
+ /* If we end this ARGV-element by taking the rest as an arg,
|
|
|
+ we must advance to the next element now. */
|
|
|
+ optind++;
|
|
|
+ }
|
|
|
+ else if (optind == argc)
|
|
|
+ {
|
|
|
+ if (opterr)
|
|
|
+ {
|
|
|
+ /* 1003.2 specifies the format of this message. */
|
|
|
+#if NLS
|
|
|
+ fprintf (stderr,
|
|
|
+ catgets(_libc_cat, GetoptSet,
|
|
|
+ GetoptRequiresArgument2,
|
|
|
+ "%s: option requires an argument -- %c\n"),
|
|
|
+ argv[0], c);
|
|
|
+#else
|
|
|
+ fprintf (stderr, "%s: option requires an argument -- %c\n",
|
|
|
+ argv[0], c);
|
|
|
+#endif
|
|
|
+ }
|
|
|
+ optopt = c;
|
|
|
+ if (optstring[0] == ':')
|
|
|
+ c = ':';
|
|
|
+ else
|
|
|
+ c = '?';
|
|
|
+ }
|
|
|
+ else
|
|
|
+ /* We already incremented `optind' once;
|
|
|
+ increment it again when taking next ARGV-elt as argument. */
|
|
|
+ optarg = argv[optind++];
|
|
|
+ nextchar = NULL;
|
|
|
+ }
|
|
|
+ }
|
|
|
+ return c;
|
|
|
+ }
|
|
|
+}
|
|
|
|
|
|
- ++optind; /* skip over parameter */
|
|
|
+int
|
|
|
+getopt (argc, argv, optstring)
|
|
|
+ int argc;
|
|
|
+ char *const *argv;
|
|
|
+ const char *optstring;
|
|
|
+{
|
|
|
+ return _getopt_internal (argc, argv, optstring,
|
|
|
+ (const struct option *) 0,
|
|
|
+ (int *) 0,
|
|
|
+ 0);
|
|
|
+}
|
|
|
+
|
|
|
+#endif /* L__gnu_getopt_internal */
|
|
|
+
|
|
|
+#ifdef L_gnu_getopt_long
|
|
|
+
|
|
|
+int
|
|
|
+getopt_long (argc, argv, options, long_options, opt_index)
|
|
|
+ int argc;
|
|
|
+ char *const *argv;
|
|
|
+ const char *options;
|
|
|
+ const struct option *long_options;
|
|
|
+ int *opt_index;
|
|
|
+{
|
|
|
+ return _getopt_internal (argc, argv, options, long_options, opt_index, 0);
|
|
|
+}
|
|
|
+
|
|
|
+#endif /* L_gnu_getopt_long */
|
|
|
+
|
|
|
+#ifdef L_gnu_getopt_long_only
|
|
|
+
|
|
|
+/* Like getopt_long, but '-' as well as '--' can indicate a long option.
|
|
|
+ If an option that starts with '-' (not '--') doesn't match a long option,
|
|
|
+ but does match a short option, it is parsed as a short option
|
|
|
+ instead. */
|
|
|
+
|
|
|
+int
|
|
|
+getopt_long_only (argc, argv, options, long_options, opt_index)
|
|
|
+ int argc;
|
|
|
+ char *const *argv;
|
|
|
+ const char *options;
|
|
|
+ const struct option *long_options;
|
|
|
+ int *opt_index;
|
|
|
+{
|
|
|
+ return _getopt_internal (argc, argv, options, long_options, opt_index, 1);
|
|
|
+}
|
|
|
+
|
|
|
+#endif /* L_gnu_getopt_long_only */
|
|
|
+
|
|
|
+#ifdef TEST
|
|
|
+
|
|
|
+/* Compile with -DTEST to make an executable for use in testing
|
|
|
+ the above definition of `getopt'. */
|
|
|
+
|
|
|
+int
|
|
|
+main (argc, argv)
|
|
|
+ int argc;
|
|
|
+ char **argv;
|
|
|
+{
|
|
|
+ int c;
|
|
|
+ int digit_optind = 0;
|
|
|
+
|
|
|
+ while (1)
|
|
|
+ {
|
|
|
+ int this_option_optind = optind ? optind : 1;
|
|
|
+
|
|
|
+ c = getopt (argc, argv, "abc:d:0123456789");
|
|
|
+ if (c == EOF)
|
|
|
+ break;
|
|
|
+
|
|
|
+ switch (c)
|
|
|
+ {
|
|
|
+ case '0':
|
|
|
+ case '1':
|
|
|
+ case '2':
|
|
|
+ case '3':
|
|
|
+ case '4':
|
|
|
+ case '5':
|
|
|
+ case '6':
|
|
|
+ case '7':
|
|
|
+ case '8':
|
|
|
+ case '9':
|
|
|
+ if (digit_optind != 0 && digit_optind != this_option_optind)
|
|
|
+ printf ("digits occur in two different argv-elements.\n");
|
|
|
+ digit_optind = this_option_optind;
|
|
|
+ printf ("option %c\n", c);
|
|
|
+ break;
|
|
|
+
|
|
|
+ case 'a':
|
|
|
+ printf ("option a\n");
|
|
|
+ break;
|
|
|
+
|
|
|
+ case 'b':
|
|
|
+ printf ("option b\n");
|
|
|
+ break;
|
|
|
+
|
|
|
+ case 'c':
|
|
|
+ printf ("option c with value `%s'\n", optarg);
|
|
|
+ break;
|
|
|
+
|
|
|
+ case '?':
|
|
|
+ break;
|
|
|
+
|
|
|
+ default:
|
|
|
+ printf ("?? getopt returned character code 0%o ??\n", c);
|
|
|
+ }
|
|
|
+ }
|
|
|
+
|
|
|
+ if (optind < argc)
|
|
|
+ {
|
|
|
+ printf ("non-option ARGV-elements: ");
|
|
|
+ while (optind < argc)
|
|
|
+ printf ("%s ", argv[optind++]);
|
|
|
+ printf ("\n");
|
|
|
+ }
|
|
|
+ exit (0);
|
|
|
+}
|
|
|
+
|
|
|
+#endif /* TEST */
|
|
|
+
|
|
|
+ /* getopt_long testing */
|
|
|
+#ifdef TEST_LONG
|
|
|
+
|
|
|
+/* Compile with -DTEST_LONG to make an executable for use in testing
|
|
|
+ the above definition of `getopt'. */
|
|
|
+
|
|
|
+int
|
|
|
+main (argc, argv)
|
|
|
+ int argc;
|
|
|
+ char **argv;
|
|
|
+{
|
|
|
+ int c;
|
|
|
+ int digit_optind = 0;
|
|
|
+
|
|
|
+ while (1)
|
|
|
+ {
|
|
|
+ int this_option_optind = optind ? optind : 1;
|
|
|
+ int option_index = 0;
|
|
|
+ static struct option long_options[] =
|
|
|
+ {
|
|
|
+ {"add", 1, 0, 0},
|
|
|
+ {"append", 0, 0, 0},
|
|
|
+ {"delete", 1, 0, 0},
|
|
|
+ {"verbose", 0, 0, 0},
|
|
|
+ {"create", 0, 0, 0},
|
|
|
+ {"file", 1, 0, 0},
|
|
|
+ {0, 0, 0, 0}
|
|
|
+ };
|
|
|
+
|
|
|
+ c = getopt_long (argc, argv, "abc:d:0123456789",
|
|
|
+ long_options, &option_index);
|
|
|
+ if (c == EOF)
|
|
|
+ break;
|
|
|
+
|
|
|
+ switch (c)
|
|
|
+ {
|
|
|
+ case 0:
|
|
|
+ printf ("option %s", long_options[option_index].name);
|
|
|
+ if (optarg)
|
|
|
+ printf (" with arg %s", optarg);
|
|
|
+ printf ("\n");
|
|
|
+ break;
|
|
|
+
|
|
|
+ case '0':
|
|
|
+ case '1':
|
|
|
+ case '2':
|
|
|
+ case '3':
|
|
|
+ case '4':
|
|
|
+ case '5':
|
|
|
+ case '6':
|
|
|
+ case '7':
|
|
|
+ case '8':
|
|
|
+ case '9':
|
|
|
+ if (digit_optind != 0 && digit_optind != this_option_optind)
|
|
|
+ printf ("digits occur in two different argv-elements.\n");
|
|
|
+ digit_optind = this_option_optind;
|
|
|
+ printf ("option %c\n", c);
|
|
|
+ break;
|
|
|
+
|
|
|
+ case 'a':
|
|
|
+ printf ("option a\n");
|
|
|
+ break;
|
|
|
+
|
|
|
+ case 'b':
|
|
|
+ printf ("option b\n");
|
|
|
+ break;
|
|
|
+
|
|
|
+ case 'c':
|
|
|
+ printf ("option c with value `%s'\n", optarg);
|
|
|
+ break;
|
|
|
+
|
|
|
+ case 'd':
|
|
|
+ printf ("option d with value `%s'\n", optarg);
|
|
|
+ break;
|
|
|
+
|
|
|
+ case '?':
|
|
|
+ break;
|
|
|
+
|
|
|
+ default:
|
|
|
+ printf ("?? getopt returned character code 0%o ??\n", c);
|
|
|
}
|
|
|
+ }
|
|
|
|
|
|
- return c;
|
|
|
+ if (optind < argc)
|
|
|
+ {
|
|
|
+ printf ("non-option ARGV-elements: ");
|
|
|
+ while (optind < argc)
|
|
|
+ printf ("%s ", argv[optind++]);
|
|
|
+ printf ("\n");
|
|
|
+ }
|
|
|
+
|
|
|
+ exit (0);
|
|
|
}
|
|
|
+
|
|
|
+#endif /* TEST_LONG */
|
Eric Andersen