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
|
#ifndef UTIL_LINUX_OPTUTILS_H
#define UTIL_LINUX_OPTUTILS_H
#include <assert.h>
#include "c.h"
#include "nls.h"
#include "cctype.h"
static inline const char *option_to_longopt(int c, const struct option *opts)
{
const struct option *o;
assert(!(opts == NULL));
for (o = opts; o->name; o++)
if (o->val == c)
return o->name;
return NULL;
}
#ifndef OPTUTILS_EXIT_CODE
# define OPTUTILS_EXIT_CODE EXIT_FAILURE
#endif
/*
* Check collisions between options.
*
* The conflicts between options are described in ul_excl_t array. The
* array contains groups of mutually exclusive options. For example
*
* static const ul_excl_t excl[] = {
* { 'Z','b','c' }, // first group
* { 'b','x' }, // second group
* { 0 }
* };
*
* int excl_st[ARRAY_SIZE(excl)] = UL_EXCL_STATUS_INIT;
*
* while ((c = getopt_long(argc, argv, "Zbcx", longopts, NULL)) != -1) {
*
* err_exclusive_options(c, longopts, excl, excl_st);
*
* switch (c) {
* case 'Z':
* ....
* }
* }
*
* The array excl[] defines two groups of the mutually exclusive options. The
* option '-b' is in the both groups.
*
* Note that the options in the group have to be in ASCII order (ABC..abc..) and
* groups have to be also in ASCII order.
*
* The maximal number of the options in the group is 15 (size of the array is
* 16, last is zero).
*
* The current status of options is stored in excl_st array. The size of the array
* must be the same as number of the groups in the ul_excl_t array.
*
* If you're unsure then see sys-utils/mount.c or misc-utils/findmnt.c.
*/
#define UL_EXCL_STATUS_INIT { 0 }
typedef int ul_excl_t[16];
static inline void err_exclusive_options(
int c,
const struct option *opts,
const ul_excl_t *excl,
int *status)
{
int e;
for (e = 0; excl[e][0] && excl[e][0] <= c; e++) {
const int *op = excl[e];
for (; *op && *op <= c; op++) {
if (*op != c)
continue;
if (status[e] == 0)
status[e] = c;
else if (status[e] != c) {
size_t ct = 0;
fprintf(stderr, _("%s: mutually exclusive "
"arguments:"),
program_invocation_short_name);
for (op = excl[e];
ct + 1 < ARRAY_SIZE(excl[0]) && *op;
op++, ct++) {
const char *n = option_to_longopt(*op, opts);
if (n)
fprintf(stderr, " --%s", n);
else if (c_isgraph(*op))
fprintf(stderr, " -%c", *op);
}
fputc('\n', stderr);
exit(OPTUTILS_EXIT_CODE);
}
break;
}
}
}
#endif
|
