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
|
/* Pedantic checking of DWARF files
Copyright (C) 2009,2010,2011 Red Hat, Inc.
This file is part of elfutils.
This file is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
elfutils 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#include "option.hh"
#include "dwarflint.hh"
#include "checkdescriptor.hh"
#include "check_registrar.hh"
#include <cassert>
#include <cstring>
#include <iostream>
argppp *argppp::instance = NULL;
option_i *
options::find_opt (int key) const
{
const_iterator it = find (key);
if (it == end ())
return NULL;
return it->second;
}
option_i const *
options::getopt (int key) const
{
return find_opt (key);
}
struct last_option
: public argp_option
{
last_option ()
{
std::memset (this, 0, sizeof (*this));
}
};
void
options::add (option_i *opt)
{
int key = opt->key ();
assert (getopt (key) == NULL);
(*this)[key] = opt;
}
/* Bug report address. */
const char *argp_program_bug_address = PACKAGE_BUGREPORT;
argp
options::build_argp (bool toplev) const
{
_m_opts.clear ();
for (const_iterator it = begin (); it != end (); ++it)
_m_opts.push_back (it->second->build_option ());
_m_opts.push_back (last_option ());
argp a = {
&_m_opts.front (),
NULL, // needs to be initialized later, in argppp
!toplev ? NULL : "FILE...",
!toplev ? NULL : "\
Pedantic checking of DWARF stored in ELF files.",
NULL, NULL, NULL
};
return a;
}
argppp::argppp (options const &global)
: _m_inited (false)
{
argp main = global.build_argp (true);
main.parser = &parse_opt;
_m_argp = main;
// Only one instance is allowed per program.
assert (instance == NULL);
instance = this;
}
argppp::argppp (options const &global,
std::vector<checkdescriptor const *> checkdescriptors)
: _m_inited (false)
{
argp main = global.build_argp (true);
typedef main_check_registrar::checkdescriptors_t checkdescriptors_t;
for (checkdescriptors_t::const_iterator it = checkdescriptors.begin ();
it != checkdescriptors.end (); ++it)
if (!(*it)->opts ().empty ())
{
_m_children_argps.push_back ((*it)->opts ().build_argp ());
_m_children_argps.back ().parser = &parse_opt;
_m_children_headers.push_back (std::string ("Options for ")
+ (*it)->name ()
+ ":");
_m_children_inputs.push_back (&(*it)->opts ());
}
unsigned pos = 0;
for (checkdescriptors_t::const_iterator it = checkdescriptors.begin ();
it != checkdescriptors.end (); ++it)
if (!(*it)->opts ().empty ())
{
argp_child child = {&_m_children_argps[pos], 0,
_m_children_headers[pos].c_str (), 0};
_m_children.push_back (child);
pos++;
}
assert (_m_children_argps.size () == _m_children.size ());
if (!_m_children.empty ())
{
_m_children.push_back ((argp_child){NULL, 0, NULL, 0});
main.children = &_m_children.front ();
}
main.parser = &parse_opt;
_m_argp = main;
// Only one instance is allowed per program.
assert (instance == NULL);
instance = this;
}
error_t
argppp::parse_opt (int key, char *arg, argp_state *state)
{
assert (instance != NULL);
if (key == ARGP_KEY_INIT && !instance->_m_inited)
{
instance->_m_inited = true;
unsigned i = 0;
for (std::vector<options const *>::const_iterator it
= instance->_m_children_inputs.begin ();
it != instance->_m_children_inputs.end (); ++it)
state->child_inputs[i++] = const_cast<options *> (*it);
return 0;
}
else
{
assert (state->input != NULL);
options const *opts = static_cast<options const *> (state->input);
option_i *o = opts->find_opt (key);
if (o == NULL)
return ARGP_ERR_UNKNOWN;
return o->parse_opt (arg, state);
}
}
void
argppp::parse (int argc, char **argv, unsigned flags, int *remaining)
{
assert (!_m_inited);
argp_parse (&_m_argp, argc, argv, flags, remaining, &global_opts ());
}
void
argppp::help (FILE *stream, unsigned flags, char *name)
{
argp_help (&_m_argp, stream, flags, name);
}
int option_i::_m_last_opt = 300;
int
option_i::get_short_option (char opt_short)
{
if (opt_short)
return opt_short;
return _m_last_opt++;
}
namespace
{
argp_option argp_option_ctor (char const *name, int key,
char const *arg, int flags,
char const *doc, int group)
{
assert (name != NULL);
assert (doc != NULL);
argp_option opt = {
name, key, arg, flags, doc, group
};
return opt;
}
}
option_common::option_common (char const *description,
char const *arg_description,
char const *opt_long, char opt_short,
int flags)
: _m_opt (argp_option_ctor (opt_long, get_short_option (opt_short),
arg_description, flags,
description, 0))
, _m_seen (false)
{}
// Trick to make sure the static options are always initialized
// before access (it is used from various global initializers.
options &
global_opts ()
{
static options inst;
return inst;
}
|
