2001-07-23 17:17:47 +00:00
|
|
|
//===-- CommandLine.cpp - Command line parser implementation --------------===//
|
|
|
|
//
|
|
|
|
// This class implements a command line argument processor that is useful when
|
|
|
|
// creating a tool. It provides a simple, minimalistic interface that is easily
|
|
|
|
// extensible and supports nonlocal (library) command line options.
|
|
|
|
//
|
2001-07-23 23:04:07 +00:00
|
|
|
// Note that rather than trying to figure out what this code does, you could try
|
|
|
|
// reading the library documentation located in docs/CommandLine.html
|
|
|
|
//
|
2001-07-23 17:17:47 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2001-11-27 00:03:19 +00:00
|
|
|
#include "Support/CommandLine.h"
|
2001-07-23 17:17:47 +00:00
|
|
|
#include <algorithm>
|
|
|
|
#include <map>
|
|
|
|
#include <set>
|
2002-01-20 22:54:45 +00:00
|
|
|
#include <iostream>
|
2002-02-24 23:02:12 +00:00
|
|
|
|
2001-07-23 17:17:47 +00:00
|
|
|
using namespace cl;
|
2002-01-20 22:54:45 +00:00
|
|
|
using std::map;
|
|
|
|
using std::pair;
|
|
|
|
using std::vector;
|
|
|
|
using std::string;
|
|
|
|
using std::cerr;
|
2001-07-23 17:17:47 +00:00
|
|
|
|
2002-07-22 02:07:59 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Basic, shared command line option processing machinery...
|
|
|
|
//
|
|
|
|
|
2001-07-23 17:17:47 +00:00
|
|
|
// Return the global command line option vector. Making it a function scoped
|
2001-11-26 18:58:34 +00:00
|
|
|
// static ensures that it will be initialized correctly before its first use.
|
2001-07-23 17:17:47 +00:00
|
|
|
//
|
2002-07-29 20:58:42 +00:00
|
|
|
static map<string,Option*> *CommandLineOptions = 0;
|
2001-07-23 17:17:47 +00:00
|
|
|
static map<string, Option*> &getOpts() {
|
2002-07-29 20:58:42 +00:00
|
|
|
if (CommandLineOptions == 0) CommandLineOptions = new map<string,Option*>();
|
|
|
|
return *CommandLineOptions;
|
|
|
|
}
|
|
|
|
|
|
|
|
static Option *getOption(const string &Str) {
|
|
|
|
if (CommandLineOptions == 0) return 0;
|
|
|
|
map<string,Option*>::iterator I = CommandLineOptions->find(Str);
|
|
|
|
return I != CommandLineOptions->end() ? I->second : 0;
|
2001-07-23 17:17:47 +00:00
|
|
|
}
|
|
|
|
|
2002-07-22 02:07:59 +00:00
|
|
|
static vector<Option*> &getPositionalOpts() {
|
|
|
|
static vector<Option*> Positional;
|
|
|
|
return Positional;
|
|
|
|
}
|
|
|
|
|
2002-07-29 20:58:42 +00:00
|
|
|
static void AddArgument(const char *ArgName, Option *Opt) {
|
|
|
|
if (getOption(ArgName)) {
|
2001-07-23 17:17:47 +00:00
|
|
|
cerr << "CommandLine Error: Argument '" << ArgName
|
2002-01-31 00:42:56 +00:00
|
|
|
<< "' defined more than once!\n";
|
2001-07-23 17:17:47 +00:00
|
|
|
} else {
|
2001-11-26 18:58:34 +00:00
|
|
|
// Add argument to the argument map!
|
2002-07-29 20:58:42 +00:00
|
|
|
getOpts()[ArgName] = Opt;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// RemoveArgument - It's possible that the argument is no longer in the map if
|
|
|
|
// options have already been processed and the map has been deleted!
|
|
|
|
//
|
|
|
|
static void RemoveArgument(const char *ArgName, Option *Opt) {
|
|
|
|
if (CommandLineOptions == 0) return;
|
|
|
|
assert(getOption(ArgName) == Opt && "Arg not in map!");
|
|
|
|
CommandLineOptions->erase(ArgName);
|
|
|
|
if (CommandLineOptions->empty()) {
|
|
|
|
delete CommandLineOptions;
|
|
|
|
CommandLineOptions = 0;
|
2001-07-23 17:17:47 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static const char *ProgramName = 0;
|
|
|
|
static const char *ProgramOverview = 0;
|
|
|
|
|
2001-10-27 05:54:17 +00:00
|
|
|
static inline bool ProvideOption(Option *Handler, const char *ArgName,
|
|
|
|
const char *Value, int argc, char **argv,
|
|
|
|
int &i) {
|
|
|
|
// Enforce value requirements
|
|
|
|
switch (Handler->getValueExpectedFlag()) {
|
|
|
|
case ValueRequired:
|
|
|
|
if (Value == 0 || *Value == 0) { // No value specified?
|
|
|
|
if (i+1 < argc) { // Steal the next argument, like for '-o filename'
|
|
|
|
Value = argv[++i];
|
|
|
|
} else {
|
|
|
|
return Handler->error(" requires a value!");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case ValueDisallowed:
|
|
|
|
if (*Value != 0)
|
|
|
|
return Handler->error(" does not allow a value! '" +
|
|
|
|
string(Value) + "' specified.");
|
|
|
|
break;
|
|
|
|
case ValueOptional: break;
|
|
|
|
default: cerr << "Bad ValueMask flag! CommandLine usage error:"
|
2002-01-20 22:54:45 +00:00
|
|
|
<< Handler->getValueExpectedFlag() << "\n"; abort();
|
2001-10-27 05:54:17 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Run the handler now!
|
|
|
|
return Handler->addOccurance(ArgName, Value);
|
|
|
|
}
|
|
|
|
|
2002-07-22 02:07:59 +00:00
|
|
|
static bool ProvidePositionalOption(Option *Handler, string &Arg) {
|
|
|
|
int Dummy;
|
|
|
|
return ProvideOption(Handler, "", Arg.c_str(), 0, 0, Dummy);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Option predicates...
|
|
|
|
static inline bool isGrouping(const Option *O) {
|
|
|
|
return O->getFormattingFlag() == cl::Grouping;
|
|
|
|
}
|
|
|
|
static inline bool isPrefixedOrGrouping(const Option *O) {
|
|
|
|
return isGrouping(O) || O->getFormattingFlag() == cl::Prefix;
|
|
|
|
}
|
|
|
|
|
|
|
|
// getOptionPred - Check to see if there are any options that satisfy the
|
|
|
|
// specified predicate with names that are the prefixes in Name. This is
|
|
|
|
// checked by progressively stripping characters off of the name, checking to
|
|
|
|
// see if there options that satisfy the predicate. If we find one, return it,
|
|
|
|
// otherwise return null.
|
2001-11-26 18:58:34 +00:00
|
|
|
//
|
2002-07-22 02:07:59 +00:00
|
|
|
static Option *getOptionPred(std::string Name, unsigned &Length,
|
|
|
|
bool (*Pred)(const Option*)) {
|
|
|
|
|
2002-07-29 20:58:42 +00:00
|
|
|
Option *Op = getOption(Name);
|
|
|
|
if (Op && Pred(Op)) {
|
2002-07-22 02:07:59 +00:00
|
|
|
Length = Name.length();
|
2002-07-29 20:58:42 +00:00
|
|
|
return Op;
|
2002-07-22 02:07:59 +00:00
|
|
|
}
|
2001-11-26 18:58:34 +00:00
|
|
|
|
2002-07-22 02:07:59 +00:00
|
|
|
if (Name.size() == 1) return 0;
|
|
|
|
do {
|
|
|
|
Name.erase(Name.end()-1, Name.end()); // Chop off the last character...
|
2002-07-29 20:58:42 +00:00
|
|
|
Op = getOption(Name);
|
2002-07-22 02:07:59 +00:00
|
|
|
|
|
|
|
// Loop while we haven't found an option and Name still has at least two
|
|
|
|
// characters in it (so that the next iteration will not be the empty
|
|
|
|
// string...
|
2002-07-29 20:58:42 +00:00
|
|
|
} while ((Op == 0 || !Pred(Op)) && Name.size() > 1);
|
2002-07-22 02:07:59 +00:00
|
|
|
|
2002-07-29 20:58:42 +00:00
|
|
|
if (Op && Pred(Op)) {
|
2002-07-22 02:07:59 +00:00
|
|
|
Length = Name.length();
|
2002-07-29 20:58:42 +00:00
|
|
|
return Op; // Found one!
|
2001-11-26 18:58:34 +00:00
|
|
|
}
|
2002-07-22 02:07:59 +00:00
|
|
|
return 0; // No option found!
|
|
|
|
}
|
2001-11-26 18:58:34 +00:00
|
|
|
|
2002-07-22 02:07:59 +00:00
|
|
|
static bool RequiresValue(const Option *O) {
|
|
|
|
return O->getNumOccurancesFlag() == cl::Required ||
|
|
|
|
O->getNumOccurancesFlag() == cl::OneOrMore;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool EatsUnboundedNumberOfValues(const Option *O) {
|
|
|
|
return O->getNumOccurancesFlag() == cl::ZeroOrMore ||
|
|
|
|
O->getNumOccurancesFlag() == cl::OneOrMore;
|
2001-11-26 18:58:34 +00:00
|
|
|
}
|
2001-10-27 05:54:17 +00:00
|
|
|
|
2001-07-23 17:17:47 +00:00
|
|
|
void cl::ParseCommandLineOptions(int &argc, char **argv,
|
2002-07-25 06:17:51 +00:00
|
|
|
const char *Overview) {
|
2002-07-22 02:07:59 +00:00
|
|
|
assert((!getOpts().empty() || !getPositionalOpts().empty()) &&
|
|
|
|
"No options specified, or ParseCommandLineOptions called more"
|
|
|
|
" than once!");
|
2001-07-23 17:17:47 +00:00
|
|
|
ProgramName = argv[0]; // Save this away safe and snug
|
|
|
|
ProgramOverview = Overview;
|
|
|
|
bool ErrorParsing = false;
|
|
|
|
|
2002-07-22 02:07:59 +00:00
|
|
|
map<string, Option*> &Opts = getOpts();
|
|
|
|
vector<Option*> &PositionalOpts = getPositionalOpts();
|
|
|
|
|
|
|
|
// Check out the positional arguments to collect information about them.
|
|
|
|
unsigned NumPositionalRequired = 0;
|
|
|
|
Option *ConsumeAfterOpt = 0;
|
|
|
|
if (!PositionalOpts.empty()) {
|
|
|
|
if (PositionalOpts[0]->getNumOccurancesFlag() == cl::ConsumeAfter) {
|
|
|
|
assert(PositionalOpts.size() > 1 &&
|
|
|
|
"Cannot specify cl::ConsumeAfter without a positional argument!");
|
|
|
|
ConsumeAfterOpt = PositionalOpts[0];
|
|
|
|
}
|
|
|
|
|
|
|
|
// Calculate how many positional values are _required_.
|
|
|
|
bool UnboundedFound = false;
|
|
|
|
for (unsigned i = ConsumeAfterOpt != 0, e = PositionalOpts.size();
|
|
|
|
i != e; ++i) {
|
|
|
|
Option *Opt = PositionalOpts[i];
|
|
|
|
if (RequiresValue(Opt))
|
|
|
|
++NumPositionalRequired;
|
|
|
|
else if (ConsumeAfterOpt) {
|
|
|
|
// ConsumeAfter cannot be combined with "optional" positional options
|
2002-07-22 02:21:57 +00:00
|
|
|
// unless there is only one positional argument...
|
|
|
|
if (PositionalOpts.size() > 2)
|
|
|
|
ErrorParsing |=
|
|
|
|
Opt->error(" error - this positional option will never be matched, "
|
|
|
|
"because it does not Require a value, and a "
|
|
|
|
"cl::ConsumeAfter option is active!");
|
2002-07-22 02:07:59 +00:00
|
|
|
} else if (UnboundedFound) { // This option does not "require" a value...
|
|
|
|
// Make sure this option is not specified after an option that eats all
|
|
|
|
// extra arguments, or this one will never get any!
|
|
|
|
//
|
|
|
|
ErrorParsing |= Opt->error(" error - option can never match, because "
|
|
|
|
"another positional argument will match an "
|
|
|
|
"unbounded number of values, and this option"
|
|
|
|
" does not require a value!");
|
|
|
|
}
|
|
|
|
UnboundedFound |= EatsUnboundedNumberOfValues(Opt);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// PositionalVals - A vector of "positional" arguments we accumulate into to
|
|
|
|
// processes at the end...
|
|
|
|
//
|
|
|
|
vector<string> PositionalVals;
|
|
|
|
|
2001-07-23 17:17:47 +00:00
|
|
|
// Loop over all of the arguments... processing them.
|
2002-07-22 02:07:59 +00:00
|
|
|
bool DashDashFound = false; // Have we read '--'?
|
2001-07-23 17:17:47 +00:00
|
|
|
for (int i = 1; i < argc; ++i) {
|
|
|
|
Option *Handler = 0;
|
|
|
|
const char *Value = "";
|
|
|
|
const char *ArgName = "";
|
2002-07-22 02:07:59 +00:00
|
|
|
|
|
|
|
// Check to see if this is a positional argument. This argument is
|
|
|
|
// considered to be positional if it doesn't start with '-', if it is "-"
|
|
|
|
// itself, or if we have see "--" already.
|
|
|
|
//
|
|
|
|
if (argv[i][0] != '-' || argv[i][1] == 0 || DashDashFound) {
|
|
|
|
// Positional argument!
|
|
|
|
if (!PositionalOpts.empty()) {
|
|
|
|
PositionalVals.push_back(argv[i]);
|
|
|
|
|
|
|
|
// All of the positional arguments have been fulfulled, give the rest to
|
|
|
|
// the consume after option... if it's specified...
|
|
|
|
//
|
2002-07-31 16:29:43 +00:00
|
|
|
if (PositionalVals.size() >= NumPositionalRequired &&
|
2002-07-22 02:07:59 +00:00
|
|
|
ConsumeAfterOpt != 0) {
|
|
|
|
for (++i; i < argc; ++i)
|
|
|
|
PositionalVals.push_back(argv[i]);
|
|
|
|
break; // Handle outside of the argument processing loop...
|
|
|
|
}
|
|
|
|
|
|
|
|
// Delay processing positional arguments until the end...
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
} else { // We start with a '-', must be an argument...
|
2001-07-23 17:17:47 +00:00
|
|
|
ArgName = argv[i]+1;
|
|
|
|
while (*ArgName == '-') ++ArgName; // Eat leading dashes
|
|
|
|
|
2002-07-22 02:07:59 +00:00
|
|
|
if (*ArgName == 0 && !DashDashFound) { // Is this the mythical "--"?
|
|
|
|
DashDashFound = true; // Yup, take note of that fact...
|
|
|
|
continue; // Don't try to process it as an argument iself.
|
|
|
|
}
|
|
|
|
|
2001-07-23 17:17:47 +00:00
|
|
|
const char *ArgNameEnd = ArgName;
|
2001-11-26 18:58:34 +00:00
|
|
|
while (*ArgNameEnd && *ArgNameEnd != '=')
|
|
|
|
++ArgNameEnd; // Scan till end of argument name...
|
2001-07-23 17:17:47 +00:00
|
|
|
|
|
|
|
Value = ArgNameEnd;
|
|
|
|
if (*Value) // If we have an equals sign...
|
|
|
|
++Value; // Advance to value...
|
|
|
|
|
|
|
|
if (*ArgName != 0) {
|
2001-11-26 18:58:34 +00:00
|
|
|
string RealName(ArgName, ArgNameEnd);
|
2001-07-25 18:40:49 +00:00
|
|
|
// Extract arg name part
|
2002-07-22 02:07:59 +00:00
|
|
|
map<string, Option*>::iterator I = Opts.find(RealName);
|
|
|
|
|
|
|
|
if (I == Opts.end() && !*Value && RealName.size() > 1) {
|
|
|
|
// Check to see if this "option" is really a prefixed or grouped
|
|
|
|
// argument...
|
|
|
|
//
|
|
|
|
unsigned Length = 0;
|
|
|
|
Option *PGOpt = getOptionPred(RealName, Length, isPrefixedOrGrouping);
|
|
|
|
|
|
|
|
// If the option is a prefixed option, then the value is simply the
|
|
|
|
// rest of the name... so fall through to later processing, by
|
|
|
|
// setting up the argument name flags and value fields.
|
|
|
|
//
|
|
|
|
if (PGOpt && PGOpt->getFormattingFlag() == cl::Prefix) {
|
|
|
|
ArgNameEnd = ArgName+Length;
|
|
|
|
Value = ArgNameEnd;
|
|
|
|
I = Opts.find(string(ArgName, ArgNameEnd));
|
|
|
|
assert(I->second == PGOpt);
|
|
|
|
} else if (PGOpt) {
|
|
|
|
// This must be a grouped option... handle all of them now...
|
|
|
|
assert(isGrouping(PGOpt) && "Broken getOptionPred!");
|
|
|
|
|
|
|
|
do {
|
|
|
|
// Move current arg name out of RealName into RealArgName...
|
|
|
|
string RealArgName(RealName.begin(), RealName.begin()+Length);
|
|
|
|
RealName.erase(RealName.begin(), RealName.begin()+Length);
|
2001-11-26 18:58:34 +00:00
|
|
|
|
|
|
|
// Because ValueRequired is an invalid flag for grouped arguments,
|
|
|
|
// we don't need to pass argc/argv in...
|
|
|
|
//
|
2002-07-22 02:07:59 +00:00
|
|
|
assert(PGOpt->getValueExpectedFlag() != cl::ValueRequired &&
|
|
|
|
"Option can not be cl::Grouping AND cl::ValueRequired!");
|
|
|
|
int Dummy;
|
|
|
|
ErrorParsing |= ProvideOption(PGOpt, RealArgName.c_str(), "",
|
|
|
|
0, 0, Dummy);
|
|
|
|
|
|
|
|
// Get the next grouping option...
|
|
|
|
if (!RealName.empty())
|
|
|
|
PGOpt = getOptionPred(RealName, Length, isGrouping);
|
|
|
|
} while (!RealName.empty() && PGOpt);
|
|
|
|
|
|
|
|
if (RealName.empty()) // Processed all of the options, move on
|
|
|
|
continue; // to the next argv[] value...
|
|
|
|
|
|
|
|
// If RealName is not empty, that means we did not match one of the
|
|
|
|
// options! This is an error.
|
|
|
|
//
|
|
|
|
I = Opts.end();
|
|
|
|
}
|
2001-11-26 18:58:34 +00:00
|
|
|
}
|
|
|
|
|
2002-07-22 02:07:59 +00:00
|
|
|
Handler = I != Opts.end() ? I->second : 0;
|
2001-07-23 17:17:47 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (Handler == 0) {
|
|
|
|
cerr << "Unknown command line argument '" << argv[i] << "'. Try: "
|
2001-10-24 06:21:56 +00:00
|
|
|
<< argv[0] << " --help'\n";
|
2001-07-23 17:17:47 +00:00
|
|
|
ErrorParsing = true;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2001-10-27 05:54:17 +00:00
|
|
|
ErrorParsing |= ProvideOption(Handler, ArgName, Value, argc, argv, i);
|
2002-07-22 02:07:59 +00:00
|
|
|
}
|
2001-07-23 17:17:47 +00:00
|
|
|
|
2002-07-22 02:07:59 +00:00
|
|
|
// Check and handle positional arguments now...
|
|
|
|
if (NumPositionalRequired > PositionalVals.size()) {
|
|
|
|
cerr << "Not enough positional command line arguments specified!\n";
|
|
|
|
cerr << "Must specify at least " << NumPositionalRequired
|
|
|
|
<< " positional arguments: See: " << argv[0] << " --help\n";
|
|
|
|
ErrorParsing = true;
|
|
|
|
|
|
|
|
|
|
|
|
} else if (ConsumeAfterOpt == 0) {
|
|
|
|
// Positional args have already been handled if ConsumeAfter is specified...
|
|
|
|
unsigned ValNo = 0, NumVals = PositionalVals.size();
|
|
|
|
for (unsigned i = 0, e = PositionalOpts.size(); i != e; ++i) {
|
|
|
|
if (RequiresValue(PositionalOpts[i])) {
|
|
|
|
ProvidePositionalOption(PositionalOpts[i], PositionalVals[ValNo++]);
|
|
|
|
--NumPositionalRequired; // We fulfilled our duty...
|
|
|
|
}
|
|
|
|
|
|
|
|
// If we _can_ give this option more arguments, do so now, as long as we
|
|
|
|
// do not give it values that others need. 'Done' controls whether the
|
|
|
|
// option even _WANTS_ any more.
|
|
|
|
//
|
|
|
|
bool Done = PositionalOpts[i]->getNumOccurancesFlag() == cl::Required;
|
|
|
|
while (NumVals-ValNo > NumPositionalRequired && !Done) {
|
|
|
|
switch (PositionalOpts[i]->getNumOccurancesFlag()) {
|
|
|
|
case cl::Optional:
|
|
|
|
Done = true; // Optional arguments want _at most_ one value
|
|
|
|
// FALL THROUGH
|
|
|
|
case cl::ZeroOrMore: // Zero or more will take all they can get...
|
|
|
|
case cl::OneOrMore: // One or more will take all they can get...
|
|
|
|
ProvidePositionalOption(PositionalOpts[i], PositionalVals[ValNo++]);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
assert(0 && "Internal error, unexpected NumOccurances flag in "
|
|
|
|
"positional argument processing!");
|
|
|
|
}
|
|
|
|
}
|
2001-10-27 05:54:17 +00:00
|
|
|
}
|
2002-07-22 02:07:59 +00:00
|
|
|
} else {
|
|
|
|
assert(ConsumeAfterOpt && NumPositionalRequired <= PositionalVals.size());
|
|
|
|
unsigned ValNo = 0;
|
|
|
|
for (unsigned j = 1, e = PositionalOpts.size(); j != e; ++j)
|
|
|
|
if (RequiresValue(PositionalOpts[j]))
|
2002-07-24 20:15:13 +00:00
|
|
|
ErrorParsing |= ProvidePositionalOption(PositionalOpts[j],
|
|
|
|
PositionalVals[ValNo++]);
|
|
|
|
|
|
|
|
// Handle the case where there is just one positional option, and it's
|
|
|
|
// optional. In this case, we want to give JUST THE FIRST option to the
|
|
|
|
// positional option and keep the rest for the consume after. The above
|
|
|
|
// loop would have assigned no values to positional options in this case.
|
|
|
|
//
|
2002-08-02 21:51:29 +00:00
|
|
|
if (PositionalOpts.size() == 2 && ValNo == 0 && !PositionalVals.empty())
|
2002-07-24 20:15:13 +00:00
|
|
|
ErrorParsing |= ProvidePositionalOption(PositionalOpts[1],
|
|
|
|
PositionalVals[ValNo++]);
|
2002-07-22 02:07:59 +00:00
|
|
|
|
|
|
|
// Handle over all of the rest of the arguments to the
|
|
|
|
// cl::ConsumeAfter command line option...
|
|
|
|
for (; ValNo != PositionalVals.size(); ++ValNo)
|
|
|
|
ErrorParsing |= ProvidePositionalOption(ConsumeAfterOpt,
|
|
|
|
PositionalVals[ValNo]);
|
2001-07-23 17:17:47 +00:00
|
|
|
}
|
|
|
|
|
2001-07-23 23:02:45 +00:00
|
|
|
// Loop over args and make sure all required args are specified!
|
2002-07-22 02:07:59 +00:00
|
|
|
for (map<string, Option*>::iterator I = Opts.begin(),
|
|
|
|
E = Opts.end(); I != E; ++I) {
|
2001-07-23 23:02:45 +00:00
|
|
|
switch (I->second->getNumOccurancesFlag()) {
|
|
|
|
case Required:
|
|
|
|
case OneOrMore:
|
2001-10-24 06:21:56 +00:00
|
|
|
if (I->second->getNumOccurances() == 0) {
|
2001-07-23 23:02:45 +00:00
|
|
|
I->second->error(" must be specified at least once!");
|
2001-10-24 06:21:56 +00:00
|
|
|
ErrorParsing = true;
|
|
|
|
}
|
2001-07-23 23:02:45 +00:00
|
|
|
// Fall through
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2001-07-23 17:17:47 +00:00
|
|
|
|
2002-07-22 02:07:59 +00:00
|
|
|
// Free all of the memory allocated to the map. Command line options may only
|
|
|
|
// be processed once!
|
2002-07-29 20:58:42 +00:00
|
|
|
delete CommandLineOptions;
|
|
|
|
CommandLineOptions = 0;
|
2002-07-22 02:07:59 +00:00
|
|
|
PositionalOpts.clear();
|
2001-07-23 17:17:47 +00:00
|
|
|
|
|
|
|
// If we had an error processing our arguments, don't let the program execute
|
|
|
|
if (ErrorParsing) exit(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Option Base class implementation
|
|
|
|
//
|
|
|
|
|
2002-07-25 06:17:51 +00:00
|
|
|
bool Option::error(string Message, const char *ArgName) {
|
2001-07-23 17:17:47 +00:00
|
|
|
if (ArgName == 0) ArgName = ArgStr;
|
2002-07-22 02:07:59 +00:00
|
|
|
if (ArgName[0] == 0)
|
|
|
|
cerr << HelpStr; // Be nice for positional arguments
|
|
|
|
else
|
|
|
|
cerr << "-" << ArgName;
|
|
|
|
cerr << " option" << Message << "\n";
|
2001-07-23 17:17:47 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool Option::addOccurance(const char *ArgName, const string &Value) {
|
|
|
|
NumOccurances++; // Increment the number of times we have been seen
|
|
|
|
|
2001-07-23 23:02:45 +00:00
|
|
|
switch (getNumOccurancesFlag()) {
|
2001-07-23 17:17:47 +00:00
|
|
|
case Optional:
|
|
|
|
if (NumOccurances > 1)
|
|
|
|
return error(": may only occur zero or one times!", ArgName);
|
|
|
|
break;
|
|
|
|
case Required:
|
|
|
|
if (NumOccurances > 1)
|
|
|
|
return error(": must occur exactly one time!", ArgName);
|
|
|
|
// Fall through
|
|
|
|
case OneOrMore:
|
2001-10-27 05:54:17 +00:00
|
|
|
case ZeroOrMore:
|
|
|
|
case ConsumeAfter: break;
|
2001-07-23 17:17:47 +00:00
|
|
|
default: return error(": bad num occurances flag value!");
|
|
|
|
}
|
|
|
|
|
|
|
|
return handleOccurance(ArgName, Value);
|
|
|
|
}
|
|
|
|
|
2002-07-22 02:07:59 +00:00
|
|
|
// addArgument - Tell the system that this Option subclass will handle all
|
|
|
|
// occurances of -ArgStr on the command line.
|
|
|
|
//
|
|
|
|
void Option::addArgument(const char *ArgStr) {
|
|
|
|
if (ArgStr[0])
|
|
|
|
AddArgument(ArgStr, this);
|
|
|
|
else if (getFormattingFlag() == Positional)
|
|
|
|
getPositionalOpts().push_back(this);
|
|
|
|
else if (getNumOccurancesFlag() == ConsumeAfter) {
|
|
|
|
assert((getPositionalOpts().empty() ||
|
|
|
|
getPositionalOpts().front()->getNumOccurancesFlag() != ConsumeAfter)
|
|
|
|
&& "Cannot specify more than one option with cl::ConsumeAfter "
|
|
|
|
"specified!");
|
|
|
|
getPositionalOpts().insert(getPositionalOpts().begin(), this);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-07-23 17:15:12 +00:00
|
|
|
void Option::removeArgument(const char *ArgStr) {
|
|
|
|
if (ArgStr[0]) {
|
2002-07-29 20:58:42 +00:00
|
|
|
RemoveArgument(ArgStr, this);
|
2002-07-23 17:15:12 +00:00
|
|
|
} else if (getFormattingFlag() == Positional) {
|
|
|
|
vector<Option*>::iterator I =
|
|
|
|
std::find(getPositionalOpts().begin(), getPositionalOpts().end(), this);
|
|
|
|
assert(I != getPositionalOpts().end() && "Arg not registered!");
|
|
|
|
getPositionalOpts().erase(I);
|
|
|
|
} else if (getNumOccurancesFlag() == ConsumeAfter) {
|
|
|
|
assert(!getPositionalOpts().empty() && getPositionalOpts()[0] == this &&
|
|
|
|
"Arg not registered correctly!");
|
|
|
|
getPositionalOpts().erase(getPositionalOpts().begin());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-07-22 02:07:59 +00:00
|
|
|
|
|
|
|
// getValueStr - Get the value description string, using "DefaultMsg" if nothing
|
|
|
|
// has been specified yet.
|
|
|
|
//
|
|
|
|
static const char *getValueStr(const Option &O, const char *DefaultMsg) {
|
|
|
|
if (O.ValueStr[0] == 0) return DefaultMsg;
|
|
|
|
return O.ValueStr;
|
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// cl::alias class implementation
|
|
|
|
//
|
|
|
|
|
2001-07-23 17:17:47 +00:00
|
|
|
// Return the width of the option tag for printing...
|
2002-07-22 02:07:59 +00:00
|
|
|
unsigned alias::getOptionWidth() const {
|
2001-07-23 17:17:47 +00:00
|
|
|
return std::strlen(ArgStr)+6;
|
|
|
|
}
|
|
|
|
|
2002-07-22 02:07:59 +00:00
|
|
|
// Print out the option for the alias...
|
|
|
|
void alias::printOptionInfo(unsigned GlobalWidth) const {
|
2001-07-23 17:17:47 +00:00
|
|
|
unsigned L = std::strlen(ArgStr);
|
|
|
|
cerr << " -" << ArgStr << string(GlobalWidth-L-6, ' ') << " - "
|
2002-01-20 22:54:45 +00:00
|
|
|
<< HelpStr << "\n";
|
2001-07-23 17:17:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-07-22 02:07:59 +00:00
|
|
|
|
2001-07-23 17:17:47 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2002-07-22 02:07:59 +00:00
|
|
|
// Parser Implementation code...
|
2001-07-23 17:17:47 +00:00
|
|
|
//
|
|
|
|
|
2002-08-07 18:36:37 +00:00
|
|
|
// basic_parser implementation
|
|
|
|
//
|
|
|
|
|
|
|
|
// Return the width of the option tag for printing...
|
|
|
|
unsigned basic_parser_impl::getOptionWidth(const Option &O) const {
|
|
|
|
unsigned Len = std::strlen(O.ArgStr);
|
|
|
|
if (const char *ValName = getValueName())
|
|
|
|
Len += std::strlen(getValueStr(O, ValName))+3;
|
|
|
|
|
|
|
|
return Len + 6;
|
|
|
|
}
|
|
|
|
|
|
|
|
// printOptionInfo - Print out information about this option. The
|
|
|
|
// to-be-maintained width is specified.
|
|
|
|
//
|
|
|
|
void basic_parser_impl::printOptionInfo(const Option &O,
|
|
|
|
unsigned GlobalWidth) const {
|
|
|
|
cerr << " -" << O.ArgStr;
|
|
|
|
|
|
|
|
if (const char *ValName = getValueName())
|
|
|
|
cerr << "=<" << getValueStr(O, ValName) << ">";
|
|
|
|
|
|
|
|
cerr << string(GlobalWidth-getOptionWidth(O), ' ') << " - "
|
|
|
|
<< O.HelpStr << "\n";
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2002-07-22 02:07:59 +00:00
|
|
|
// parser<bool> implementation
|
|
|
|
//
|
2002-08-07 18:36:37 +00:00
|
|
|
bool parser<bool>::parse(Option &O, const char *ArgName,
|
|
|
|
const string &Arg, bool &Value) {
|
2001-07-23 17:17:47 +00:00
|
|
|
if (Arg == "" || Arg == "true" || Arg == "TRUE" || Arg == "True" ||
|
|
|
|
Arg == "1") {
|
|
|
|
Value = true;
|
|
|
|
} else if (Arg == "false" || Arg == "FALSE" || Arg == "False" || Arg == "0") {
|
|
|
|
Value = false;
|
|
|
|
} else {
|
2002-07-22 02:07:59 +00:00
|
|
|
return O.error(": '" + Arg +
|
|
|
|
"' is invalid value for boolean argument! Try 0 or 1");
|
2001-07-23 17:17:47 +00:00
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2002-07-22 02:07:59 +00:00
|
|
|
// parser<int> implementation
|
2001-07-23 17:17:47 +00:00
|
|
|
//
|
2002-08-07 18:36:37 +00:00
|
|
|
bool parser<int>::parse(Option &O, const char *ArgName,
|
|
|
|
const string &Arg, int &Value) {
|
2002-07-22 02:07:59 +00:00
|
|
|
const char *ArgStart = Arg.c_str();
|
|
|
|
char *End;
|
|
|
|
Value = (int)strtol(ArgStart, &End, 0);
|
|
|
|
if (*End != 0)
|
|
|
|
return O.error(": '" + Arg + "' value invalid for integer argument!");
|
|
|
|
return false;
|
2001-07-23 17:17:47 +00:00
|
|
|
}
|
|
|
|
|
2002-08-07 18:36:37 +00:00
|
|
|
// parser<double>/parser<float> implementation
|
2002-07-22 02:07:59 +00:00
|
|
|
//
|
2002-08-07 18:36:37 +00:00
|
|
|
static bool parseDouble(Option &O, const string &Arg, double &Value) {
|
2002-07-22 02:07:59 +00:00
|
|
|
const char *ArgStart = Arg.c_str();
|
|
|
|
char *End;
|
|
|
|
Value = strtod(ArgStart, &End);
|
|
|
|
if (*End != 0)
|
|
|
|
return O.error(": '" +Arg+ "' value invalid for floating point argument!");
|
2001-07-23 17:17:47 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2002-08-07 18:36:37 +00:00
|
|
|
bool parser<double>::parse(Option &O, const char *AN,
|
|
|
|
const std::string &Arg, double &Val) {
|
|
|
|
return parseDouble(O, Arg, Val);
|
2001-07-23 17:17:47 +00:00
|
|
|
}
|
|
|
|
|
2002-08-07 18:36:37 +00:00
|
|
|
bool parser<float>::parse(Option &O, const char *AN,
|
|
|
|
const std::string &Arg, float &Val) {
|
|
|
|
double dVal;
|
|
|
|
if (parseDouble(O, Arg, dVal))
|
|
|
|
return true;
|
|
|
|
Val = (float)dVal;
|
|
|
|
return false;
|
2001-07-23 17:17:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2002-07-22 02:07:59 +00:00
|
|
|
// generic_parser_base implementation
|
2001-07-23 17:17:47 +00:00
|
|
|
//
|
|
|
|
|
2002-07-23 17:15:12 +00:00
|
|
|
// findOption - Return the option number corresponding to the specified
|
|
|
|
// argument string. If the option is not found, getNumOptions() is returned.
|
|
|
|
//
|
|
|
|
unsigned generic_parser_base::findOption(const char *Name) {
|
|
|
|
unsigned i = 0, e = getNumOptions();
|
|
|
|
string N(Name);
|
|
|
|
|
|
|
|
while (i != e)
|
|
|
|
if (getOption(i) == N)
|
|
|
|
return i;
|
|
|
|
else
|
|
|
|
++i;
|
|
|
|
return e;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-07-23 17:17:47 +00:00
|
|
|
// Return the width of the option tag for printing...
|
2002-07-22 02:07:59 +00:00
|
|
|
unsigned generic_parser_base::getOptionWidth(const Option &O) const {
|
|
|
|
if (O.hasArgStr()) {
|
|
|
|
unsigned Size = std::strlen(O.ArgStr)+6;
|
|
|
|
for (unsigned i = 0, e = getNumOptions(); i != e; ++i)
|
|
|
|
Size = std::max(Size, (unsigned)std::strlen(getOption(i))+8);
|
|
|
|
return Size;
|
|
|
|
} else {
|
|
|
|
unsigned BaseSize = 0;
|
|
|
|
for (unsigned i = 0, e = getNumOptions(); i != e; ++i)
|
|
|
|
BaseSize = std::max(BaseSize, (unsigned)std::strlen(getOption(i))+8);
|
|
|
|
return BaseSize;
|
|
|
|
}
|
2001-07-23 17:17:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// printOptionInfo - Print out information about this option. The
|
|
|
|
// to-be-maintained width is specified.
|
|
|
|
//
|
2002-07-22 02:07:59 +00:00
|
|
|
void generic_parser_base::printOptionInfo(const Option &O,
|
|
|
|
unsigned GlobalWidth) const {
|
|
|
|
if (O.hasArgStr()) {
|
|
|
|
unsigned L = std::strlen(O.ArgStr);
|
|
|
|
cerr << " -" << O.ArgStr << string(GlobalWidth-L-6, ' ')
|
|
|
|
<< " - " << O.HelpStr << "\n";
|
|
|
|
|
|
|
|
for (unsigned i = 0, e = getNumOptions(); i != e; ++i) {
|
|
|
|
unsigned NumSpaces = GlobalWidth-strlen(getOption(i))-8;
|
|
|
|
cerr << " =" << getOption(i) << string(NumSpaces, ' ') << " - "
|
|
|
|
<< getDescription(i) << "\n";
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (O.HelpStr[0])
|
|
|
|
cerr << " " << O.HelpStr << "\n";
|
|
|
|
for (unsigned i = 0, e = getNumOptions(); i != e; ++i) {
|
|
|
|
unsigned L = std::strlen(getOption(i));
|
|
|
|
cerr << " -" << getOption(i) << string(GlobalWidth-L-8, ' ') << " - "
|
|
|
|
<< getDescription(i) << "\n";
|
|
|
|
}
|
2001-07-23 17:17:47 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
2002-07-22 02:07:59 +00:00
|
|
|
// --help and --help-hidden option implementation
|
2001-07-23 17:17:47 +00:00
|
|
|
//
|
|
|
|
namespace {
|
|
|
|
|
2002-07-22 02:07:59 +00:00
|
|
|
class HelpPrinter {
|
2001-07-23 17:17:47 +00:00
|
|
|
unsigned MaxArgLen;
|
|
|
|
const Option *EmptyArg;
|
|
|
|
const bool ShowHidden;
|
|
|
|
|
2002-07-22 02:07:59 +00:00
|
|
|
// isHidden/isReallyHidden - Predicates to be used to filter down arg lists.
|
|
|
|
inline static bool isHidden(pair<string, Option *> &OptPair) {
|
|
|
|
return OptPair.second->getOptionHiddenFlag() >= Hidden;
|
|
|
|
}
|
|
|
|
inline static bool isReallyHidden(pair<string, Option *> &OptPair) {
|
|
|
|
return OptPair.second->getOptionHiddenFlag() == ReallyHidden;
|
|
|
|
}
|
|
|
|
|
|
|
|
public:
|
|
|
|
HelpPrinter(bool showHidden) : ShowHidden(showHidden) {
|
|
|
|
EmptyArg = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void operator=(bool Value) {
|
|
|
|
if (Value == false) return;
|
|
|
|
|
2001-07-23 17:17:47 +00:00
|
|
|
// Copy Options into a vector so we can sort them as we like...
|
|
|
|
vector<pair<string, Option*> > Options;
|
2002-01-20 22:54:45 +00:00
|
|
|
copy(getOpts().begin(), getOpts().end(), std::back_inserter(Options));
|
2001-07-23 17:17:47 +00:00
|
|
|
|
|
|
|
// Eliminate Hidden or ReallyHidden arguments, depending on ShowHidden
|
2002-07-22 02:07:59 +00:00
|
|
|
Options.erase(std::remove_if(Options.begin(), Options.end(),
|
|
|
|
std::ptr_fun(ShowHidden ? isReallyHidden : isHidden)),
|
2001-07-23 17:17:47 +00:00
|
|
|
Options.end());
|
|
|
|
|
|
|
|
// Eliminate duplicate entries in table (from enum flags options, f.e.)
|
2002-07-22 02:07:59 +00:00
|
|
|
{ // Give OptionSet a scope
|
|
|
|
std::set<Option*> OptionSet;
|
|
|
|
for (unsigned i = 0; i != Options.size(); ++i)
|
|
|
|
if (OptionSet.count(Options[i].second) == 0)
|
|
|
|
OptionSet.insert(Options[i].second); // Add new entry to set
|
|
|
|
else
|
|
|
|
Options.erase(Options.begin()+i--); // Erase duplicate
|
|
|
|
}
|
2001-07-23 17:17:47 +00:00
|
|
|
|
|
|
|
if (ProgramOverview)
|
2002-01-20 22:54:45 +00:00
|
|
|
cerr << "OVERVIEW:" << ProgramOverview << "\n";
|
2001-07-23 17:17:47 +00:00
|
|
|
|
2002-07-22 02:07:59 +00:00
|
|
|
cerr << "USAGE: " << ProgramName << " [options]";
|
|
|
|
|
|
|
|
// Print out the positional options...
|
|
|
|
vector<Option*> &PosOpts = getPositionalOpts();
|
|
|
|
Option *CAOpt = 0; // The cl::ConsumeAfter option, if it exists...
|
|
|
|
if (!PosOpts.empty() && PosOpts[0]->getNumOccurancesFlag() == ConsumeAfter)
|
|
|
|
CAOpt = PosOpts[0];
|
|
|
|
|
2002-08-07 18:36:37 +00:00
|
|
|
for (unsigned i = CAOpt != 0, e = PosOpts.size(); i != e; ++i)
|
2002-07-22 02:07:59 +00:00
|
|
|
cerr << " " << PosOpts[i]->HelpStr;
|
|
|
|
|
|
|
|
// Print the consume after option info if it exists...
|
|
|
|
if (CAOpt) cerr << " " << CAOpt->HelpStr;
|
|
|
|
|
|
|
|
cerr << "\n\n";
|
2001-07-23 17:17:47 +00:00
|
|
|
|
|
|
|
// Compute the maximum argument length...
|
|
|
|
MaxArgLen = 0;
|
2002-07-22 02:07:59 +00:00
|
|
|
for (unsigned i = 0, e = Options.size(); i != e; ++i)
|
|
|
|
MaxArgLen = std::max(MaxArgLen, Options[i].second->getOptionWidth());
|
2001-07-23 17:17:47 +00:00
|
|
|
|
|
|
|
cerr << "OPTIONS:\n";
|
2002-07-22 02:07:59 +00:00
|
|
|
for (unsigned i = 0, e = Options.size(); i != e; ++i)
|
|
|
|
Options[i].second->printOptionInfo(MaxArgLen);
|
2001-07-23 17:17:47 +00:00
|
|
|
|
2002-07-22 02:07:59 +00:00
|
|
|
// Halt the program if help information is printed
|
|
|
|
exit(1);
|
2001-07-23 17:17:47 +00:00
|
|
|
}
|
2002-07-22 02:07:59 +00:00
|
|
|
};
|
2001-07-23 17:17:47 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
2002-07-22 02:07:59 +00:00
|
|
|
// Define the two HelpPrinter instances that are used to print out help, or
|
|
|
|
// help-hidden...
|
|
|
|
//
|
|
|
|
HelpPrinter NormalPrinter(false);
|
|
|
|
HelpPrinter HiddenPrinter(true);
|
|
|
|
|
|
|
|
cl::opt<HelpPrinter, true, parser<bool> >
|
|
|
|
HOp("help", cl::desc("display available options (--help-hidden for more)"),
|
2002-08-07 18:36:37 +00:00
|
|
|
cl::location(NormalPrinter), cl::ValueDisallowed);
|
2001-07-23 17:17:47 +00:00
|
|
|
|
2002-07-22 02:07:59 +00:00
|
|
|
cl::opt<HelpPrinter, true, parser<bool> >
|
|
|
|
HHOp("help-hidden", cl::desc("display all available options"),
|
2002-08-07 18:36:37 +00:00
|
|
|
cl::location(HiddenPrinter), cl::Hidden, cl::ValueDisallowed);
|
2001-07-23 17:17:47 +00:00
|
|
|
|
|
|
|
} // End anonymous namespace
|