1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
|
/*-
* Copyright (c) 2003-2008 Tim Kientzle
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/*
* Command line parser for bsdunzip.
*/
#include "bsdunzip_platform.h"
__FBSDID("$FreeBSD$");
#ifdef HAVE_ERRNO_H
#include <errno.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif
#ifdef HAVE_STRING_H
#include <string.h>
#endif
#include "bsdunzip.h"
#include "err.h"
extern int bsdunzip_optind;
/*
* Short options for bsdunzip. Please keep this sorted.
*/
static const char *short_options
= "aCcd:fI:jLlnO:opP:qtuvx:yZ:";
/*
* Long options for bsdunzip. Please keep this list sorted.
*
* The symbolic names for options that lack a short equivalent are
* defined in bsdunzip.h. Also note that so far I've found no need
* to support optional arguments to long options. That would be
* a small change to the code below.
*/
static const struct bsdunzip_option {
const char *name;
int required; /* 1 if this option requires an argument. */
int equivalent; /* Equivalent short option. */
} bsdunzip_longopts[] = {
{ "version", 0, OPTION_VERSION },
{ NULL, 0, 0 }
};
/*
* This getopt implementation has two key features that common
* getopt_long() implementations lack. Apart from those, it's a
* straightforward option parser, considerably simplified by not
* needing to support the wealth of exotic getopt_long() features. It
* has, of course, been shamelessly tailored for bsdunzip. (If you're
* looking for a generic getopt_long() implementation for your
* project, I recommend Gregory Pietsch's public domain getopt_long()
* implementation.) The two additional features are:
*/
int
bsdunzip_getopt(struct bsdunzip *bsdunzip)
{
enum { state_start = 0, state_next_word, state_short, state_long };
const struct bsdunzip_option *popt, *match = NULL, *match2 = NULL;
const char *p, *long_prefix = "--";
size_t optlength;
int opt = OPTION_NONE;
int required = 0;
bsdunzip->argument = NULL;
/* First time through, initialize everything. */
if (bsdunzip->getopt_state == state_start) {
/* Skip program name. */
++bsdunzip->argv;
--bsdunzip->argc;
if (*bsdunzip->argv == NULL)
return (-1);
bsdunzip->getopt_state = state_next_word;
}
/*
* We're ready to look at the next word in argv.
*/
if (bsdunzip->getopt_state == state_next_word) {
/* No more arguments, so no more options. */
if (bsdunzip->argv[0] == NULL)
return (-1);
/* Doesn't start with '-', so no more options. */
if (bsdunzip->argv[0][0] != '-')
return (-1);
/* "--" marks end of options; consume it and return. */
if (strcmp(bsdunzip->argv[0], "--") == 0) {
++bsdunzip->argv;
--bsdunzip->argc;
return (-1);
}
/* Get next word for parsing. */
bsdunzip->getopt_word = *bsdunzip->argv++;
--bsdunzip->argc;
bsdunzip_optind++;
if (bsdunzip->getopt_word[1] == '-') {
/* Set up long option parser. */
bsdunzip->getopt_state = state_long;
bsdunzip->getopt_word += 2; /* Skip leading '--' */
} else {
/* Set up short option parser. */
bsdunzip->getopt_state = state_short;
++bsdunzip->getopt_word; /* Skip leading '-' */
}
}
/*
* We're parsing a group of POSIX-style single-character options.
*/
if (bsdunzip->getopt_state == state_short) {
/* Peel next option off of a group of short options. */
opt = *bsdunzip->getopt_word++;
if (opt == '\0') {
/* End of this group; recurse to get next option. */
bsdunzip->getopt_state = state_next_word;
return bsdunzip_getopt(bsdunzip);
}
/* Does this option take an argument? */
p = strchr(short_options, opt);
if (p == NULL)
return ('?');
if (p[1] == ':')
required = 1;
/* If it takes an argument, parse that. */
if (required) {
/* If arg is run-in, bsdunzip->getopt_word already points to it. */
if (bsdunzip->getopt_word[0] == '\0') {
/* Otherwise, pick up the next word. */
bsdunzip->getopt_word = *bsdunzip->argv;
if (bsdunzip->getopt_word == NULL) {
lafe_warnc(0,
"Option -%c requires an argument",
opt);
return ('?');
}
++bsdunzip->argv;
--bsdunzip->argc;
bsdunzip_optind++;
}
bsdunzip->getopt_state = state_next_word;
bsdunzip->argument = bsdunzip->getopt_word;
}
}
/* We're reading a long option */
if (bsdunzip->getopt_state == state_long) {
/* After this long option, we'll be starting a new word. */
bsdunzip->getopt_state = state_next_word;
/* Option name ends at '=' if there is one. */
p = strchr(bsdunzip->getopt_word, '=');
if (p != NULL) {
optlength = (size_t)(p - bsdunzip->getopt_word);
bsdunzip->argument = (char *)(uintptr_t)(p + 1);
} else {
optlength = strlen(bsdunzip->getopt_word);
}
/* Search the table for an unambiguous match. */
for (popt = bsdunzip_longopts; popt->name != NULL; popt++) {
/* Short-circuit if first chars don't match. */
if (popt->name[0] != bsdunzip->getopt_word[0])
continue;
/* If option is a prefix of name in table, record it.*/
if (strncmp(bsdunzip->getopt_word, popt->name, optlength) == 0) {
match2 = match; /* Record up to two matches. */
match = popt;
/* If it's an exact match, we're done. */
if (strlen(popt->name) == optlength) {
match2 = NULL; /* Forget the others. */
break;
}
}
}
/* Fail if there wasn't a unique match. */
if (match == NULL) {
lafe_warnc(0,
"Option %s%s is not supported",
long_prefix, bsdunzip->getopt_word);
return ('?');
}
if (match2 != NULL) {
lafe_warnc(0,
"Ambiguous option %s%s (matches --%s and --%s)",
long_prefix, bsdunzip->getopt_word, match->name, match2->name);
return ('?');
}
/* We've found a unique match; does it need an argument? */
if (match->required) {
/* Argument required: get next word if necessary. */
if (bsdunzip->argument == NULL) {
bsdunzip->argument = *bsdunzip->argv;
if (bsdunzip->argument == NULL) {
lafe_warnc(0,
"Option %s%s requires an argument",
long_prefix, match->name);
return ('?');
}
++bsdunzip->argv;
--bsdunzip->argc;
bsdunzip_optind++;
}
} else {
/* Argument forbidden: fail if there is one. */
if (bsdunzip->argument != NULL) {
lafe_warnc(0,
"Option %s%s does not allow an argument",
long_prefix, match->name);
return ('?');
}
}
return (match->equivalent);
}
return (opt);
}
|
