2001-07-23 19:17:47 +02:00
|
|
|
//===-- CommandLine.cpp - Command line parser implementation --------------===//
|
2005-04-22 00:55:34 +02:00
|
|
|
//
|
2003-10-20 21:43:21 +02:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file was developed by the LLVM research group and is distributed under
|
|
|
|
// the University of Illinois Open Source License. See LICENSE.TXT for details.
|
2005-04-22 00:55:34 +02:00
|
|
|
//
|
2003-10-20 21:43:21 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
2001-07-23 19:17:47 +02:00
|
|
|
//
|
|
|
|
// 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-24 01:04:07 +02: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 19:17:47 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2004-09-02 00:55:40 +02:00
|
|
|
#include "llvm/Config/config.h"
|
|
|
|
#include "llvm/Support/CommandLine.h"
|
2006-10-04 23:52:35 +02:00
|
|
|
#include "llvm/Support/ManagedStatic.h"
|
2006-11-26 11:52:51 +01:00
|
|
|
#include "llvm/Support/Streams.h"
|
2006-08-23 09:10:06 +02:00
|
|
|
#include "llvm/System/Path.h"
|
2001-07-23 19:17:47 +02:00
|
|
|
#include <algorithm>
|
2005-12-26 05:56:16 +01:00
|
|
|
#include <functional>
|
2001-07-23 19:17:47 +02:00
|
|
|
#include <map>
|
2006-12-08 00:41:45 +01:00
|
|
|
#include <ostream>
|
2001-07-23 19:17:47 +02:00
|
|
|
#include <set>
|
2003-10-10 19:01:36 +02:00
|
|
|
#include <cstdlib>
|
|
|
|
#include <cerrno>
|
2004-07-03 03:21:05 +02:00
|
|
|
#include <cstring>
|
2003-12-14 22:35:53 +01:00
|
|
|
using namespace llvm;
|
2001-07-23 19:17:47 +02:00
|
|
|
using namespace cl;
|
|
|
|
|
2006-08-27 14:45:47 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Template instantiations and anchors.
|
|
|
|
//
|
|
|
|
TEMPLATE_INSTANTIATION(class basic_parser<bool>);
|
|
|
|
TEMPLATE_INSTANTIATION(class basic_parser<int>);
|
|
|
|
TEMPLATE_INSTANTIATION(class basic_parser<unsigned>);
|
|
|
|
TEMPLATE_INSTANTIATION(class basic_parser<double>);
|
|
|
|
TEMPLATE_INSTANTIATION(class basic_parser<float>);
|
|
|
|
TEMPLATE_INSTANTIATION(class basic_parser<std::string>);
|
|
|
|
|
|
|
|
TEMPLATE_INSTANTIATION(class opt<unsigned>);
|
|
|
|
TEMPLATE_INSTANTIATION(class opt<int>);
|
|
|
|
TEMPLATE_INSTANTIATION(class opt<std::string>);
|
|
|
|
TEMPLATE_INSTANTIATION(class opt<bool>);
|
|
|
|
|
|
|
|
void Option::anchor() {}
|
|
|
|
void basic_parser_impl::anchor() {}
|
|
|
|
void parser<bool>::anchor() {}
|
|
|
|
void parser<int>::anchor() {}
|
|
|
|
void parser<unsigned>::anchor() {}
|
|
|
|
void parser<double>::anchor() {}
|
|
|
|
void parser<float>::anchor() {}
|
|
|
|
void parser<std::string>::anchor() {}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2006-10-13 02:06:24 +02:00
|
|
|
// Globals for name and overview of program. Program name is not a string to
|
|
|
|
// avoid static ctor/dtor issues.
|
|
|
|
static char ProgramName[80] = "<premain>";
|
2004-09-01 06:41:28 +02:00
|
|
|
static const char *ProgramOverview = 0;
|
|
|
|
|
2004-11-19 18:08:15 +01:00
|
|
|
// This collects additional help to be printed.
|
2006-10-04 23:52:35 +02:00
|
|
|
static ManagedStatic<std::vector<const char*> > MoreHelp;
|
2004-11-19 18:08:15 +01:00
|
|
|
|
2006-10-04 23:52:35 +02:00
|
|
|
extrahelp::extrahelp(const char *Help)
|
2004-11-19 18:08:15 +01:00
|
|
|
: morehelp(Help) {
|
2006-10-04 23:52:35 +02:00
|
|
|
MoreHelp->push_back(Help);
|
2004-11-19 18:08:15 +01:00
|
|
|
}
|
|
|
|
|
2002-07-22 04:07:59 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
2006-08-27 14:45:47 +02:00
|
|
|
// Basic, shared command line option processing machinery.
|
2002-07-22 04:07:59 +02:00
|
|
|
//
|
|
|
|
|
2006-10-04 23:52:35 +02:00
|
|
|
static ManagedStatic<std::map<std::string, Option*> > Options;
|
|
|
|
static ManagedStatic<std::vector<Option*> > PositionalOptions;
|
2002-07-29 22:58:42 +02:00
|
|
|
|
2003-05-22 22:06:43 +02:00
|
|
|
static Option *getOption(const std::string &Str) {
|
2006-10-04 23:52:35 +02:00
|
|
|
std::map<std::string,Option*>::iterator I = Options->find(Str);
|
|
|
|
return I != Options->end() ? I->second : 0;
|
2002-07-22 04:07:59 +02:00
|
|
|
}
|
|
|
|
|
2002-07-29 22:58:42 +02:00
|
|
|
static void AddArgument(const char *ArgName, Option *Opt) {
|
|
|
|
if (getOption(ArgName)) {
|
2006-12-07 02:30:32 +01:00
|
|
|
cerr << ProgramName << ": CommandLine Error: Argument '"
|
|
|
|
<< ArgName << "' defined more than once!\n";
|
2001-07-23 19:17:47 +02:00
|
|
|
} else {
|
2001-11-26 19:58:34 +01:00
|
|
|
// Add argument to the argument map!
|
2006-10-04 23:52:35 +02:00
|
|
|
(*Options)[ArgName] = Opt;
|
2002-07-29 22:58:42 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// 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!
|
2005-04-22 00:55:34 +02:00
|
|
|
//
|
2002-07-29 22:58:42 +02:00
|
|
|
static void RemoveArgument(const char *ArgName, Option *Opt) {
|
2006-10-04 23:52:35 +02:00
|
|
|
if (Options->empty()) return;
|
2004-11-21 00:35:20 +01:00
|
|
|
|
2004-07-18 23:56:20 +02:00
|
|
|
#ifndef NDEBUG
|
|
|
|
// This disgusting HACK is brought to you courtesy of GCC 3.3.2, which ICE's
|
|
|
|
// If we pass ArgName directly into getOption here.
|
|
|
|
std::string Tmp = ArgName;
|
|
|
|
assert(getOption(Tmp) == Opt && "Arg not in map!");
|
|
|
|
#endif
|
2006-10-04 23:52:35 +02:00
|
|
|
Options->erase(ArgName);
|
2001-07-23 19:17:47 +02:00
|
|
|
}
|
|
|
|
|
2001-10-27 07:54:17 +02: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:
|
2005-05-11 01:20:17 +02:00
|
|
|
if (Value == 0) { // No value specified?
|
2001-10-27 07:54:17 +02:00
|
|
|
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:
|
2005-05-11 01:20:17 +02:00
|
|
|
if (Value)
|
2005-04-22 00:55:34 +02:00
|
|
|
return Handler->error(" does not allow a value! '" +
|
2003-05-22 22:06:43 +02:00
|
|
|
std::string(Value) + "' specified.");
|
2001-10-27 07:54:17 +02:00
|
|
|
break;
|
2005-04-22 00:55:34 +02:00
|
|
|
case ValueOptional:
|
2004-09-01 06:41:28 +02:00
|
|
|
break;
|
2005-04-22 00:55:34 +02:00
|
|
|
default:
|
2006-12-07 02:30:32 +01:00
|
|
|
cerr << ProgramName
|
|
|
|
<< ": Bad ValueMask flag! CommandLine usage error:"
|
|
|
|
<< Handler->getValueExpectedFlag() << "\n";
|
2004-09-01 06:41:28 +02:00
|
|
|
abort();
|
|
|
|
break;
|
2001-10-27 07:54:17 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// Run the handler now!
|
2005-05-11 01:20:17 +02:00
|
|
|
return Handler->addOccurrence(i, ArgName, Value ? Value : "");
|
2001-10-27 07:54:17 +02:00
|
|
|
}
|
|
|
|
|
2005-04-22 00:55:34 +02:00
|
|
|
static bool ProvidePositionalOption(Option *Handler, const std::string &Arg,
|
2004-08-13 21:47:30 +02:00
|
|
|
int i) {
|
|
|
|
int Dummy = i;
|
2003-07-30 19:34:02 +02:00
|
|
|
return ProvideOption(Handler, Handler->ArgStr, Arg.c_str(), 0, 0, Dummy);
|
2002-07-22 04:07:59 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// 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 19:58:34 +01:00
|
|
|
//
|
2002-07-22 04:07:59 +02:00
|
|
|
static Option *getOptionPred(std::string Name, unsigned &Length,
|
|
|
|
bool (*Pred)(const Option*)) {
|
2005-04-22 00:55:34 +02:00
|
|
|
|
2002-07-29 22:58:42 +02:00
|
|
|
Option *Op = getOption(Name);
|
|
|
|
if (Op && Pred(Op)) {
|
2002-07-22 04:07:59 +02:00
|
|
|
Length = Name.length();
|
2002-07-29 22:58:42 +02:00
|
|
|
return Op;
|
2002-07-22 04:07:59 +02:00
|
|
|
}
|
2001-11-26 19:58:34 +01:00
|
|
|
|
2002-07-22 04:07:59 +02:00
|
|
|
if (Name.size() == 1) return 0;
|
|
|
|
do {
|
|
|
|
Name.erase(Name.end()-1, Name.end()); // Chop off the last character...
|
2002-07-29 22:58:42 +02:00
|
|
|
Op = getOption(Name);
|
2002-07-22 04:07:59 +02: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 22:58:42 +02:00
|
|
|
} while ((Op == 0 || !Pred(Op)) && Name.size() > 1);
|
2002-07-22 04:07:59 +02:00
|
|
|
|
2002-07-29 22:58:42 +02:00
|
|
|
if (Op && Pred(Op)) {
|
2002-07-22 04:07:59 +02:00
|
|
|
Length = Name.length();
|
2002-07-29 22:58:42 +02:00
|
|
|
return Op; // Found one!
|
2001-11-26 19:58:34 +01:00
|
|
|
}
|
2002-07-22 04:07:59 +02:00
|
|
|
return 0; // No option found!
|
|
|
|
}
|
2001-11-26 19:58:34 +01:00
|
|
|
|
2002-07-22 04:07:59 +02:00
|
|
|
static bool RequiresValue(const Option *O) {
|
2003-07-10 18:49:51 +02:00
|
|
|
return O->getNumOccurrencesFlag() == cl::Required ||
|
|
|
|
O->getNumOccurrencesFlag() == cl::OneOrMore;
|
2002-07-22 04:07:59 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
static bool EatsUnboundedNumberOfValues(const Option *O) {
|
2003-07-10 18:49:51 +02:00
|
|
|
return O->getNumOccurrencesFlag() == cl::ZeroOrMore ||
|
|
|
|
O->getNumOccurrencesFlag() == cl::OneOrMore;
|
2001-11-26 19:58:34 +01:00
|
|
|
}
|
2001-10-27 07:54:17 +02:00
|
|
|
|
2003-08-15 23:05:57 +02:00
|
|
|
/// ParseCStringVector - Break INPUT up wherever one or more
|
|
|
|
/// whitespace characters are found, and store the resulting tokens in
|
|
|
|
/// OUTPUT. The tokens stored in OUTPUT are dynamically allocated
|
|
|
|
/// using strdup (), so it is the caller's responsibility to free ()
|
|
|
|
/// them later.
|
2003-08-15 00:00:59 +02:00
|
|
|
///
|
2006-08-28 00:10:29 +02:00
|
|
|
static void ParseCStringVector(std::vector<char *> &output,
|
|
|
|
const char *input) {
|
2003-08-15 23:05:57 +02:00
|
|
|
// Characters which will be treated as token separators:
|
|
|
|
static const char *delims = " \v\f\t\r\n";
|
|
|
|
|
2003-08-15 00:00:59 +02:00
|
|
|
std::string work (input);
|
2003-08-15 23:05:57 +02:00
|
|
|
// Skip past any delims at head of input string.
|
|
|
|
size_t pos = work.find_first_not_of (delims);
|
|
|
|
// If the string consists entirely of delims, then exit early.
|
|
|
|
if (pos == std::string::npos) return;
|
|
|
|
// Otherwise, jump forward to beginning of first word.
|
2003-08-15 00:00:59 +02:00
|
|
|
work = work.substr (pos);
|
2003-08-15 23:05:57 +02:00
|
|
|
// Find position of first delimiter.
|
2003-08-15 00:00:59 +02:00
|
|
|
pos = work.find_first_of (delims);
|
2003-08-15 23:05:57 +02:00
|
|
|
|
|
|
|
while (!work.empty() && pos != std::string::npos) {
|
|
|
|
// Everything from 0 to POS is the next word to copy.
|
|
|
|
output.push_back (strdup (work.substr (0,pos).c_str ()));
|
|
|
|
// Is there another word in the string?
|
|
|
|
size_t nextpos = work.find_first_not_of (delims, pos + 1);
|
|
|
|
if (nextpos != std::string::npos) {
|
|
|
|
// Yes? Then remove delims from beginning ...
|
2003-08-15 00:00:59 +02:00
|
|
|
work = work.substr (work.find_first_not_of (delims, pos + 1));
|
2003-08-15 23:05:57 +02:00
|
|
|
// and find the end of the word.
|
2003-08-15 00:00:59 +02:00
|
|
|
pos = work.find_first_of (delims);
|
|
|
|
} else {
|
2003-08-15 23:05:57 +02:00
|
|
|
// No? (Remainder of string is delims.) End the loop.
|
2003-08-15 00:00:59 +02:00
|
|
|
work = "";
|
2003-08-15 23:05:57 +02:00
|
|
|
pos = std::string::npos;
|
2003-08-15 00:00:59 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2003-08-15 23:05:57 +02:00
|
|
|
// If `input' ended with non-delim char, then we'll get here with
|
|
|
|
// the last word of `input' in `work'; copy it now.
|
|
|
|
if (!work.empty ()) {
|
|
|
|
output.push_back (strdup (work.c_str ()));
|
2003-08-15 00:00:59 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// ParseEnvironmentOptions - An alternative entry point to the
|
|
|
|
/// CommandLine library, which allows you to read the program's name
|
|
|
|
/// from the caller (as PROGNAME) and its command-line arguments from
|
|
|
|
/// an environment variable (whose name is given in ENVVAR).
|
|
|
|
///
|
2004-05-07 00:04:31 +02:00
|
|
|
void cl::ParseEnvironmentOptions(const char *progName, const char *envVar,
|
|
|
|
const char *Overview) {
|
2003-08-15 23:05:57 +02:00
|
|
|
// Check args.
|
2004-05-07 00:04:31 +02:00
|
|
|
assert(progName && "Program name not specified");
|
|
|
|
assert(envVar && "Environment variable name missing");
|
2005-04-22 00:55:34 +02:00
|
|
|
|
2003-08-15 00:00:59 +02:00
|
|
|
// Get the environment variable they want us to parse options out of.
|
2006-08-28 00:10:29 +02:00
|
|
|
const char *envValue = getenv(envVar);
|
2003-08-15 23:05:57 +02:00
|
|
|
if (!envValue)
|
2003-08-15 00:00:59 +02:00
|
|
|
return;
|
2003-08-15 23:05:57 +02:00
|
|
|
|
|
|
|
// Get program's "name", which we wouldn't know without the caller
|
|
|
|
// telling us.
|
2006-08-28 00:10:29 +02:00
|
|
|
std::vector<char*> newArgv;
|
|
|
|
newArgv.push_back(strdup(progName));
|
2003-08-15 00:00:59 +02:00
|
|
|
|
|
|
|
// Parse the value of the environment variable into a "command line"
|
|
|
|
// and hand it off to ParseCommandLineOptions().
|
2006-08-28 00:10:29 +02:00
|
|
|
ParseCStringVector(newArgv, envValue);
|
|
|
|
int newArgc = newArgv.size();
|
|
|
|
ParseCommandLineOptions(newArgc, &newArgv[0], Overview);
|
2003-08-15 23:05:57 +02:00
|
|
|
|
|
|
|
// Free all the strdup()ed strings.
|
2006-08-28 00:10:29 +02:00
|
|
|
for (std::vector<char*>::iterator i = newArgv.begin(), e = newArgv.end();
|
|
|
|
i != e; ++i)
|
2003-08-15 23:05:57 +02:00
|
|
|
free (*i);
|
2003-08-15 00:00:59 +02:00
|
|
|
}
|
|
|
|
|
2004-05-07 00:04:31 +02:00
|
|
|
/// LookupOption - Lookup the option specified by the specified option on the
|
|
|
|
/// command line. If there is a value specified (after an equal sign) return
|
|
|
|
/// that as well.
|
|
|
|
static Option *LookupOption(const char *&Arg, const char *&Value) {
|
|
|
|
while (*Arg == '-') ++Arg; // Eat leading dashes
|
2005-04-22 00:55:34 +02:00
|
|
|
|
2004-05-07 00:04:31 +02:00
|
|
|
const char *ArgEnd = Arg;
|
|
|
|
while (*ArgEnd && *ArgEnd != '=')
|
2005-05-11 01:20:17 +02:00
|
|
|
++ArgEnd; // Scan till end of argument name.
|
|
|
|
|
|
|
|
if (*ArgEnd == '=') // If we have an equals sign...
|
|
|
|
Value = ArgEnd+1; // Get the value, not the equals
|
2004-05-07 00:04:31 +02:00
|
|
|
|
2005-04-22 00:55:34 +02:00
|
|
|
|
2004-05-07 00:04:31 +02:00
|
|
|
if (*Arg == 0) return 0;
|
|
|
|
|
|
|
|
// Look up the option.
|
2006-10-04 23:52:35 +02:00
|
|
|
std::map<std::string, Option*> &Opts = *Options;
|
2004-05-07 00:04:31 +02:00
|
|
|
std::map<std::string, Option*>::iterator I =
|
|
|
|
Opts.find(std::string(Arg, ArgEnd));
|
|
|
|
return (I != Opts.end()) ? I->second : 0;
|
|
|
|
}
|
|
|
|
|
2001-07-23 19:17:47 +02:00
|
|
|
void cl::ParseCommandLineOptions(int &argc, char **argv,
|
2002-07-25 08:17:51 +02:00
|
|
|
const char *Overview) {
|
2006-10-04 23:52:35 +02:00
|
|
|
assert((!Options->empty() || !PositionalOptions->empty()) &&
|
2002-07-22 04:07:59 +02:00
|
|
|
"No options specified, or ParseCommandLineOptions called more"
|
|
|
|
" than once!");
|
2006-08-23 09:10:06 +02:00
|
|
|
sys::Path progname(argv[0]);
|
2006-10-13 02:06:24 +02:00
|
|
|
|
|
|
|
// Copy the program name into ProgName, making sure not to overflow it.
|
|
|
|
std::string ProgName = sys::Path(argv[0]).getLast();
|
|
|
|
if (ProgName.size() > 79) ProgName.resize(79);
|
|
|
|
strcpy(ProgramName, ProgName.c_str());
|
|
|
|
|
2001-07-23 19:17:47 +02:00
|
|
|
ProgramOverview = Overview;
|
|
|
|
bool ErrorParsing = false;
|
|
|
|
|
2006-10-04 23:52:35 +02:00
|
|
|
std::map<std::string, Option*> &Opts = *Options;
|
|
|
|
std::vector<Option*> &PositionalOpts = *PositionalOptions;
|
2002-07-22 04:07:59 +02:00
|
|
|
|
|
|
|
// Check out the positional arguments to collect information about them.
|
|
|
|
unsigned NumPositionalRequired = 0;
|
2005-08-08 19:25:38 +02:00
|
|
|
|
|
|
|
// Determine whether or not there are an unlimited number of positionals
|
|
|
|
bool HasUnlimitedPositionals = false;
|
|
|
|
|
2002-07-22 04:07:59 +02:00
|
|
|
Option *ConsumeAfterOpt = 0;
|
|
|
|
if (!PositionalOpts.empty()) {
|
2003-07-10 18:49:51 +02:00
|
|
|
if (PositionalOpts[0]->getNumOccurrencesFlag() == cl::ConsumeAfter) {
|
2002-07-22 04:07:59 +02:00
|
|
|
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 04:21:57 +02: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!");
|
2003-07-30 19:34:02 +02:00
|
|
|
} else if (UnboundedFound && !Opt->ArgStr[0]) {
|
|
|
|
// 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!
|
2002-07-22 04:07:59 +02:00
|
|
|
//
|
|
|
|
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);
|
|
|
|
}
|
2005-08-08 23:57:27 +02:00
|
|
|
HasUnlimitedPositionals = UnboundedFound || ConsumeAfterOpt;
|
2002-07-22 04:07:59 +02:00
|
|
|
}
|
|
|
|
|
2004-08-13 21:47:30 +02:00
|
|
|
// PositionalVals - A vector of "positional" arguments we accumulate into
|
|
|
|
// the process at the end...
|
2002-07-22 04:07:59 +02:00
|
|
|
//
|
2004-08-13 21:47:30 +02:00
|
|
|
std::vector<std::pair<std::string,unsigned> > PositionalVals;
|
2002-07-22 04:07:59 +02:00
|
|
|
|
2003-07-30 19:34:02 +02:00
|
|
|
// If the program has named positional arguments, and the name has been run
|
|
|
|
// across, keep track of which positional argument was named. Otherwise put
|
|
|
|
// the positional args into the PositionalVals list...
|
|
|
|
Option *ActivePositionalArg = 0;
|
|
|
|
|
2001-07-23 19:17:47 +02:00
|
|
|
// Loop over all of the arguments... processing them.
|
2002-07-22 04:07:59 +02:00
|
|
|
bool DashDashFound = false; // Have we read '--'?
|
2001-07-23 19:17:47 +02:00
|
|
|
for (int i = 1; i < argc; ++i) {
|
|
|
|
Option *Handler = 0;
|
2005-05-11 01:20:17 +02:00
|
|
|
const char *Value = 0;
|
2001-07-23 19:17:47 +02:00
|
|
|
const char *ArgName = "";
|
2002-07-22 04:07:59 +02: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 "-"
|
2003-07-10 23:38:28 +02:00
|
|
|
// itself, or if we have seen "--" already.
|
2002-07-22 04:07:59 +02:00
|
|
|
//
|
|
|
|
if (argv[i][0] != '-' || argv[i][1] == 0 || DashDashFound) {
|
|
|
|
// Positional argument!
|
2003-07-30 19:34:02 +02:00
|
|
|
if (ActivePositionalArg) {
|
2004-08-13 21:47:30 +02:00
|
|
|
ProvidePositionalOption(ActivePositionalArg, argv[i], i);
|
2003-07-30 19:34:02 +02:00
|
|
|
continue; // We are done!
|
|
|
|
} else if (!PositionalOpts.empty()) {
|
2004-08-13 21:47:30 +02:00
|
|
|
PositionalVals.push_back(std::make_pair(argv[i],i));
|
2002-07-22 04:07:59 +02:00
|
|
|
|
|
|
|
// All of the positional arguments have been fulfulled, give the rest to
|
|
|
|
// the consume after option... if it's specified...
|
|
|
|
//
|
2005-04-22 00:55:34 +02:00
|
|
|
if (PositionalVals.size() >= NumPositionalRequired &&
|
2002-07-22 04:07:59 +02:00
|
|
|
ConsumeAfterOpt != 0) {
|
|
|
|
for (++i; i < argc; ++i)
|
2004-08-13 21:47:30 +02:00
|
|
|
PositionalVals.push_back(std::make_pair(argv[i],i));
|
2002-07-22 04:07:59 +02:00
|
|
|
break; // Handle outside of the argument processing loop...
|
|
|
|
}
|
|
|
|
|
|
|
|
// Delay processing positional arguments until the end...
|
|
|
|
continue;
|
|
|
|
}
|
2004-05-07 00:04:31 +02:00
|
|
|
} else if (argv[i][0] == '-' && argv[i][1] == '-' && argv[i][2] == 0 &&
|
|
|
|
!DashDashFound) {
|
|
|
|
DashDashFound = true; // This is the mythical "--"?
|
|
|
|
continue; // Don't try to process it as an argument itself.
|
|
|
|
} else if (ActivePositionalArg &&
|
|
|
|
(ActivePositionalArg->getMiscFlags() & PositionalEatsArgs)) {
|
|
|
|
// If there is a positional argument eating options, check to see if this
|
|
|
|
// option is another positional argument. If so, treat it as an argument,
|
|
|
|
// otherwise feed it to the eating positional.
|
2001-07-23 19:17:47 +02:00
|
|
|
ArgName = argv[i]+1;
|
2004-05-07 00:04:31 +02:00
|
|
|
Handler = LookupOption(ArgName, Value);
|
|
|
|
if (!Handler || Handler->getFormattingFlag() != cl::Positional) {
|
2004-08-13 21:47:30 +02:00
|
|
|
ProvidePositionalOption(ActivePositionalArg, argv[i], i);
|
2004-05-07 00:04:31 +02:00
|
|
|
continue; // We are done!
|
2002-07-22 04:07:59 +02:00
|
|
|
}
|
|
|
|
|
2004-05-07 00:04:31 +02:00
|
|
|
} else { // We start with a '-', must be an argument...
|
|
|
|
ArgName = argv[i]+1;
|
|
|
|
Handler = LookupOption(ArgName, Value);
|
2002-07-22 04:07:59 +02:00
|
|
|
|
2004-05-07 00:04:31 +02:00
|
|
|
// Check to see if this "option" is really a prefixed or grouped argument.
|
2004-11-24 07:13:42 +01:00
|
|
|
if (Handler == 0) {
|
2004-05-07 00:04:31 +02:00
|
|
|
std::string RealName(ArgName);
|
|
|
|
if (RealName.size() > 1) {
|
2002-07-22 04:07:59 +02:00
|
|
|
unsigned Length = 0;
|
|
|
|
Option *PGOpt = getOptionPred(RealName, Length, isPrefixedOrGrouping);
|
2005-04-22 00:55:34 +02:00
|
|
|
|
2002-07-22 04:07:59 +02:00
|
|
|
// 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) {
|
2004-05-07 00:04:31 +02:00
|
|
|
Value = ArgName+Length;
|
|
|
|
assert(Opts.find(std::string(ArgName, Value)) != Opts.end() &&
|
|
|
|
Opts.find(std::string(ArgName, Value))->second == PGOpt);
|
|
|
|
Handler = PGOpt;
|
2002-07-22 04:07:59 +02:00
|
|
|
} else if (PGOpt) {
|
2004-05-07 00:04:31 +02:00
|
|
|
// This must be a grouped option... handle them now.
|
2002-07-22 04:07:59 +02:00
|
|
|
assert(isGrouping(PGOpt) && "Broken getOptionPred!");
|
2005-04-22 00:55:34 +02:00
|
|
|
|
2002-07-22 04:07:59 +02:00
|
|
|
do {
|
|
|
|
// Move current arg name out of RealName into RealArgName...
|
2004-05-07 00:04:31 +02:00
|
|
|
std::string RealArgName(RealName.begin(),
|
|
|
|
RealName.begin() + Length);
|
|
|
|
RealName.erase(RealName.begin(), RealName.begin() + Length);
|
2005-04-22 00:55:34 +02:00
|
|
|
|
2003-07-10 19:05:26 +02:00
|
|
|
// Because ValueRequired is an invalid flag for grouped arguments,
|
|
|
|
// we don't need to pass argc/argv in...
|
|
|
|
//
|
2002-07-22 04:07:59 +02:00
|
|
|
assert(PGOpt->getValueExpectedFlag() != cl::ValueRequired &&
|
|
|
|
"Option can not be cl::Grouping AND cl::ValueRequired!");
|
|
|
|
int Dummy;
|
2004-05-07 00:04:31 +02:00
|
|
|
ErrorParsing |= ProvideOption(PGOpt, RealArgName.c_str(),
|
2005-05-11 01:20:17 +02:00
|
|
|
0, 0, 0, Dummy);
|
2005-04-22 00:55:34 +02:00
|
|
|
|
2002-07-22 04:07:59 +02:00
|
|
|
// Get the next grouping option...
|
2004-05-07 00:04:31 +02:00
|
|
|
PGOpt = getOptionPred(RealName, Length, isGrouping);
|
|
|
|
} while (PGOpt && Length != RealName.size());
|
2005-04-22 00:55:34 +02:00
|
|
|
|
2004-05-07 00:04:31 +02:00
|
|
|
Handler = PGOpt; // Ate all of the options.
|
2002-07-22 04:07:59 +02:00
|
|
|
}
|
2003-07-10 19:05:26 +02:00
|
|
|
}
|
2001-07-23 19:17:47 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (Handler == 0) {
|
2006-12-07 02:30:32 +01:00
|
|
|
cerr << ProgramName << ": Unknown command line argument '"
|
|
|
|
<< argv[i] << "'. Try: '" << argv[0] << " --help'\n";
|
2001-07-23 19:17:47 +02:00
|
|
|
ErrorParsing = true;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2003-05-22 22:26:17 +02:00
|
|
|
// Check to see if this option accepts a comma separated list of values. If
|
|
|
|
// it does, we have to split up the value into multiple values...
|
2005-05-11 01:20:17 +02:00
|
|
|
if (Value && Handler->getMiscFlags() & CommaSeparated) {
|
2003-05-22 22:26:17 +02:00
|
|
|
std::string Val(Value);
|
|
|
|
std::string::size_type Pos = Val.find(',');
|
|
|
|
|
|
|
|
while (Pos != std::string::npos) {
|
|
|
|
// Process the portion before the comma...
|
|
|
|
ErrorParsing |= ProvideOption(Handler, ArgName,
|
|
|
|
std::string(Val.begin(),
|
|
|
|
Val.begin()+Pos).c_str(),
|
|
|
|
argc, argv, i);
|
|
|
|
// Erase the portion before the comma, AND the comma...
|
|
|
|
Val.erase(Val.begin(), Val.begin()+Pos+1);
|
|
|
|
Value += Pos+1; // Increment the original value pointer as well...
|
|
|
|
|
|
|
|
// Check for another comma...
|
|
|
|
Pos = Val.find(',');
|
|
|
|
}
|
|
|
|
}
|
2003-07-30 19:34:02 +02:00
|
|
|
|
|
|
|
// If this is a named positional argument, just remember that it is the
|
|
|
|
// active one...
|
|
|
|
if (Handler->getFormattingFlag() == cl::Positional)
|
|
|
|
ActivePositionalArg = Handler;
|
2005-04-22 00:55:34 +02:00
|
|
|
else
|
2003-07-30 19:34:02 +02:00
|
|
|
ErrorParsing |= ProvideOption(Handler, ArgName, Value, argc, argv, i);
|
2002-07-22 04:07:59 +02:00
|
|
|
}
|
2001-07-23 19:17:47 +02:00
|
|
|
|
2002-07-22 04:07:59 +02:00
|
|
|
// Check and handle positional arguments now...
|
|
|
|
if (NumPositionalRequired > PositionalVals.size()) {
|
2006-12-07 02:30:32 +01:00
|
|
|
cerr << ProgramName
|
|
|
|
<< ": Not enough positional command line arguments specified!\n"
|
|
|
|
<< "Must specify at least " << NumPositionalRequired
|
|
|
|
<< " positional arguments: See: " << argv[0] << " --help\n";
|
2006-01-17 01:32:28 +01:00
|
|
|
|
2002-07-22 04:07:59 +02:00
|
|
|
ErrorParsing = true;
|
2005-08-08 19:25:38 +02:00
|
|
|
} else if (!HasUnlimitedPositionals
|
|
|
|
&& PositionalVals.size() > PositionalOpts.size()) {
|
2006-12-07 02:30:32 +01:00
|
|
|
cerr << ProgramName
|
|
|
|
<< ": Too many positional arguments specified!\n"
|
|
|
|
<< "Can specify at most " << PositionalOpts.size()
|
|
|
|
<< " positional arguments: See: " << argv[0] << " --help\n";
|
2005-08-08 19:25:38 +02:00
|
|
|
ErrorParsing = true;
|
2002-07-22 04:07:59 +02:00
|
|
|
|
|
|
|
} 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])) {
|
2005-04-22 00:55:34 +02:00
|
|
|
ProvidePositionalOption(PositionalOpts[i], PositionalVals[ValNo].first,
|
2004-08-13 21:47:30 +02:00
|
|
|
PositionalVals[ValNo].second);
|
|
|
|
ValNo++;
|
2002-07-22 04:07:59 +02:00
|
|
|
--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.
|
|
|
|
//
|
2003-07-10 18:49:51 +02:00
|
|
|
bool Done = PositionalOpts[i]->getNumOccurrencesFlag() == cl::Required;
|
2002-07-22 04:07:59 +02:00
|
|
|
while (NumVals-ValNo > NumPositionalRequired && !Done) {
|
2003-07-10 18:49:51 +02:00
|
|
|
switch (PositionalOpts[i]->getNumOccurrencesFlag()) {
|
2002-07-22 04:07:59 +02:00
|
|
|
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...
|
2004-08-13 21:47:30 +02:00
|
|
|
ProvidePositionalOption(PositionalOpts[i],
|
|
|
|
PositionalVals[ValNo].first,
|
|
|
|
PositionalVals[ValNo].second);
|
|
|
|
ValNo++;
|
2002-07-22 04:07:59 +02:00
|
|
|
break;
|
|
|
|
default:
|
2003-07-10 18:49:51 +02:00
|
|
|
assert(0 && "Internal error, unexpected NumOccurrences flag in "
|
2002-07-22 04:07:59 +02:00
|
|
|
"positional argument processing!");
|
|
|
|
}
|
|
|
|
}
|
2001-10-27 07:54:17 +02:00
|
|
|
}
|
2002-07-22 04:07:59 +02:00
|
|
|
} else {
|
|
|
|
assert(ConsumeAfterOpt && NumPositionalRequired <= PositionalVals.size());
|
|
|
|
unsigned ValNo = 0;
|
|
|
|
for (unsigned j = 1, e = PositionalOpts.size(); j != e; ++j)
|
2004-08-13 21:47:30 +02:00
|
|
|
if (RequiresValue(PositionalOpts[j])) {
|
2002-07-24 22:15:13 +02:00
|
|
|
ErrorParsing |= ProvidePositionalOption(PositionalOpts[j],
|
2004-08-13 21:47:30 +02:00
|
|
|
PositionalVals[ValNo].first,
|
|
|
|
PositionalVals[ValNo].second);
|
|
|
|
ValNo++;
|
|
|
|
}
|
2002-07-24 22:15:13 +02:00
|
|
|
|
|
|
|
// 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.
|
|
|
|
//
|
2004-08-13 21:47:30 +02:00
|
|
|
if (PositionalOpts.size() == 2 && ValNo == 0 && !PositionalVals.empty()) {
|
2002-07-24 22:15:13 +02:00
|
|
|
ErrorParsing |= ProvidePositionalOption(PositionalOpts[1],
|
2004-08-13 21:47:30 +02:00
|
|
|
PositionalVals[ValNo].first,
|
|
|
|
PositionalVals[ValNo].second);
|
|
|
|
ValNo++;
|
|
|
|
}
|
2005-04-22 00:55:34 +02:00
|
|
|
|
2002-07-22 04:07:59 +02: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,
|
2004-08-13 21:47:30 +02:00
|
|
|
PositionalVals[ValNo].first,
|
|
|
|
PositionalVals[ValNo].second);
|
2001-07-23 19:17:47 +02:00
|
|
|
}
|
|
|
|
|
2001-07-24 01:02:45 +02:00
|
|
|
// Loop over args and make sure all required args are specified!
|
2005-04-22 00:55:34 +02:00
|
|
|
for (std::map<std::string, Option*>::iterator I = Opts.begin(),
|
2003-07-10 19:05:26 +02:00
|
|
|
E = Opts.end(); I != E; ++I) {
|
2003-07-10 18:49:51 +02:00
|
|
|
switch (I->second->getNumOccurrencesFlag()) {
|
2001-07-24 01:02:45 +02:00
|
|
|
case Required:
|
|
|
|
case OneOrMore:
|
2003-07-10 18:49:51 +02:00
|
|
|
if (I->second->getNumOccurrences() == 0) {
|
2003-07-10 19:05:26 +02:00
|
|
|
I->second->error(" must be specified at least once!");
|
2001-10-24 08:21:56 +02:00
|
|
|
ErrorParsing = true;
|
|
|
|
}
|
2001-07-24 01:02:45 +02:00
|
|
|
// Fall through
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2001-07-23 19:17:47 +02:00
|
|
|
|
2002-07-22 04:07:59 +02:00
|
|
|
// Free all of the memory allocated to the map. Command line options may only
|
|
|
|
// be processed once!
|
2006-10-04 23:52:35 +02:00
|
|
|
Opts.clear();
|
2002-07-22 04:07:59 +02:00
|
|
|
PositionalOpts.clear();
|
2006-10-04 23:52:35 +02:00
|
|
|
MoreHelp->clear();
|
2001-07-23 19:17:47 +02:00
|
|
|
|
|
|
|
// If we had an error processing our arguments, don't let the program execute
|
|
|
|
if (ErrorParsing) exit(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Option Base class implementation
|
|
|
|
//
|
|
|
|
|
2003-05-22 22:06:43 +02:00
|
|
|
bool Option::error(std::string Message, const char *ArgName) {
|
2001-07-23 19:17:47 +02:00
|
|
|
if (ArgName == 0) ArgName = ArgStr;
|
2002-07-22 04:07:59 +02:00
|
|
|
if (ArgName[0] == 0)
|
2006-12-07 02:30:32 +01:00
|
|
|
cerr << HelpStr; // Be nice for positional arguments
|
2002-07-22 04:07:59 +02:00
|
|
|
else
|
2006-12-07 02:30:32 +01:00
|
|
|
cerr << ProgramName << ": for the -" << ArgName;
|
2006-08-02 22:15:56 +02:00
|
|
|
|
2006-12-07 02:30:32 +01:00
|
|
|
cerr << " option: " << Message << "\n";
|
2001-07-23 19:17:47 +02:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2005-05-11 01:20:17 +02:00
|
|
|
bool Option::addOccurrence(unsigned pos, const char *ArgName,
|
|
|
|
const std::string &Value) {
|
2003-07-10 18:49:51 +02:00
|
|
|
NumOccurrences++; // Increment the number of times we have been seen
|
2001-07-23 19:17:47 +02:00
|
|
|
|
2003-07-10 18:49:51 +02:00
|
|
|
switch (getNumOccurrencesFlag()) {
|
2001-07-23 19:17:47 +02:00
|
|
|
case Optional:
|
2003-07-10 18:49:51 +02:00
|
|
|
if (NumOccurrences > 1)
|
2001-07-23 19:17:47 +02:00
|
|
|
return error(": may only occur zero or one times!", ArgName);
|
|
|
|
break;
|
|
|
|
case Required:
|
2003-07-10 18:49:51 +02:00
|
|
|
if (NumOccurrences > 1)
|
2001-07-23 19:17:47 +02:00
|
|
|
return error(": must occur exactly one time!", ArgName);
|
|
|
|
// Fall through
|
|
|
|
case OneOrMore:
|
2001-10-27 07:54:17 +02:00
|
|
|
case ZeroOrMore:
|
|
|
|
case ConsumeAfter: break;
|
2003-07-10 19:05:26 +02:00
|
|
|
default: return error(": bad num occurrences flag value!");
|
2001-07-23 19:17:47 +02:00
|
|
|
}
|
|
|
|
|
2004-08-13 21:47:30 +02:00
|
|
|
return handleOccurrence(pos, ArgName, Value);
|
2001-07-23 19:17:47 +02:00
|
|
|
}
|
|
|
|
|
2002-07-22 04:07:59 +02:00
|
|
|
// addArgument - Tell the system that this Option subclass will handle all
|
2003-07-10 19:05:26 +02:00
|
|
|
// occurrences of -ArgStr on the command line.
|
2002-07-22 04:07:59 +02:00
|
|
|
//
|
|
|
|
void Option::addArgument(const char *ArgStr) {
|
|
|
|
if (ArgStr[0])
|
|
|
|
AddArgument(ArgStr, this);
|
2003-07-30 19:34:02 +02:00
|
|
|
|
|
|
|
if (getFormattingFlag() == Positional)
|
2006-10-04 23:52:35 +02:00
|
|
|
PositionalOptions->push_back(this);
|
2003-07-10 18:49:51 +02:00
|
|
|
else if (getNumOccurrencesFlag() == ConsumeAfter) {
|
2006-10-04 23:52:35 +02:00
|
|
|
if (!PositionalOptions->empty() &&
|
|
|
|
PositionalOptions->front()->getNumOccurrencesFlag() == ConsumeAfter)
|
2003-07-30 19:34:02 +02:00
|
|
|
error("Cannot specify more than one option with cl::ConsumeAfter!");
|
2006-10-04 23:52:35 +02:00
|
|
|
PositionalOptions->insert(PositionalOptions->begin(), this);
|
2002-07-22 04:07:59 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-07-23 19:15:12 +02:00
|
|
|
void Option::removeArgument(const char *ArgStr) {
|
2003-07-30 19:34:02 +02:00
|
|
|
if (ArgStr[0])
|
2002-07-29 22:58:42 +02:00
|
|
|
RemoveArgument(ArgStr, this);
|
2003-07-30 19:34:02 +02:00
|
|
|
|
|
|
|
if (getFormattingFlag() == Positional) {
|
2003-05-22 22:06:43 +02:00
|
|
|
std::vector<Option*>::iterator I =
|
2006-10-04 23:52:35 +02:00
|
|
|
std::find(PositionalOptions->begin(), PositionalOptions->end(), this);
|
|
|
|
assert(I != PositionalOptions->end() && "Arg not registered!");
|
|
|
|
PositionalOptions->erase(I);
|
2003-07-10 18:49:51 +02:00
|
|
|
} else if (getNumOccurrencesFlag() == ConsumeAfter) {
|
2006-10-04 23:52:35 +02:00
|
|
|
assert(!PositionalOptions->empty() && (*PositionalOptions)[0] == this &&
|
2002-07-23 19:15:12 +02:00
|
|
|
"Arg not registered correctly!");
|
2006-10-04 23:52:35 +02:00
|
|
|
PositionalOptions->erase(PositionalOptions->begin());
|
2002-07-23 19:15:12 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-07-22 04:07:59 +02: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 19:17:47 +02:00
|
|
|
// Return the width of the option tag for printing...
|
2002-07-22 04:07:59 +02:00
|
|
|
unsigned alias::getOptionWidth() const {
|
2001-07-23 19:17:47 +02:00
|
|
|
return std::strlen(ArgStr)+6;
|
|
|
|
}
|
|
|
|
|
2006-04-28 07:36:25 +02:00
|
|
|
// Print out the option for the alias.
|
2002-07-22 04:07:59 +02:00
|
|
|
void alias::printOptionInfo(unsigned GlobalWidth) const {
|
2001-07-23 19:17:47 +02:00
|
|
|
unsigned L = std::strlen(ArgStr);
|
2006-12-07 02:30:32 +01:00
|
|
|
cout << " -" << ArgStr << std::string(GlobalWidth-L-6, ' ') << " - "
|
|
|
|
<< HelpStr << "\n";
|
2001-07-23 19:17:47 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-07-22 04:07:59 +02:00
|
|
|
|
2001-07-23 19:17:47 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
2002-07-22 04:07:59 +02:00
|
|
|
// Parser Implementation code...
|
2001-07-23 19:17:47 +02:00
|
|
|
//
|
|
|
|
|
2002-08-07 20:36:37 +02: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;
|
|
|
|
}
|
|
|
|
|
2005-04-22 00:55:34 +02:00
|
|
|
// printOptionInfo - Print out information about this option. The
|
2002-08-07 20:36:37 +02:00
|
|
|
// to-be-maintained width is specified.
|
|
|
|
//
|
|
|
|
void basic_parser_impl::printOptionInfo(const Option &O,
|
|
|
|
unsigned GlobalWidth) const {
|
2006-12-07 02:30:32 +01:00
|
|
|
cout << " -" << O.ArgStr;
|
2002-08-07 20:36:37 +02:00
|
|
|
|
|
|
|
if (const char *ValName = getValueName())
|
2006-12-07 02:30:32 +01:00
|
|
|
cout << "=<" << getValueStr(O, ValName) << ">";
|
2002-08-07 20:36:37 +02:00
|
|
|
|
2006-12-07 02:30:32 +01:00
|
|
|
cout << std::string(GlobalWidth-getOptionWidth(O), ' ') << " - "
|
|
|
|
<< O.HelpStr << "\n";
|
2002-08-07 20:36:37 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2002-07-22 04:07:59 +02:00
|
|
|
// parser<bool> implementation
|
|
|
|
//
|
2002-08-07 20:36:37 +02:00
|
|
|
bool parser<bool>::parse(Option &O, const char *ArgName,
|
2003-05-22 22:06:43 +02:00
|
|
|
const std::string &Arg, bool &Value) {
|
2005-04-22 00:55:34 +02:00
|
|
|
if (Arg == "" || Arg == "true" || Arg == "TRUE" || Arg == "True" ||
|
2001-07-23 19:17:47 +02:00
|
|
|
Arg == "1") {
|
|
|
|
Value = true;
|
|
|
|
} else if (Arg == "false" || Arg == "FALSE" || Arg == "False" || Arg == "0") {
|
|
|
|
Value = false;
|
|
|
|
} else {
|
2002-07-22 04:07:59 +02:00
|
|
|
return O.error(": '" + Arg +
|
|
|
|
"' is invalid value for boolean argument! Try 0 or 1");
|
2001-07-23 19:17:47 +02:00
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2002-07-22 04:07:59 +02:00
|
|
|
// parser<int> implementation
|
2001-07-23 19:17:47 +02:00
|
|
|
//
|
2002-08-07 20:36:37 +02:00
|
|
|
bool parser<int>::parse(Option &O, const char *ArgName,
|
2003-05-22 22:06:43 +02:00
|
|
|
const std::string &Arg, int &Value) {
|
2002-07-22 04:07:59 +02:00
|
|
|
char *End;
|
2003-06-28 17:47:20 +02:00
|
|
|
Value = (int)strtol(Arg.c_str(), &End, 0);
|
2005-04-22 00:55:34 +02:00
|
|
|
if (*End != 0)
|
2002-07-22 04:07:59 +02:00
|
|
|
return O.error(": '" + Arg + "' value invalid for integer argument!");
|
|
|
|
return false;
|
2001-07-23 19:17:47 +02:00
|
|
|
}
|
|
|
|
|
2003-06-28 17:47:20 +02:00
|
|
|
// parser<unsigned> implementation
|
|
|
|
//
|
|
|
|
bool parser<unsigned>::parse(Option &O, const char *ArgName,
|
|
|
|
const std::string &Arg, unsigned &Value) {
|
|
|
|
char *End;
|
2003-10-10 19:01:36 +02:00
|
|
|
errno = 0;
|
|
|
|
unsigned long V = strtoul(Arg.c_str(), &End, 0);
|
2003-06-28 17:47:20 +02:00
|
|
|
Value = (unsigned)V;
|
2003-10-10 19:01:36 +02:00
|
|
|
if (((V == ULONG_MAX) && (errno == ERANGE))
|
|
|
|
|| (*End != 0)
|
|
|
|
|| (Value != V))
|
2003-06-28 17:47:20 +02:00
|
|
|
return O.error(": '" + Arg + "' value invalid for uint argument!");
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2002-08-07 20:36:37 +02:00
|
|
|
// parser<double>/parser<float> implementation
|
2002-07-22 04:07:59 +02:00
|
|
|
//
|
2003-05-22 22:06:43 +02:00
|
|
|
static bool parseDouble(Option &O, const std::string &Arg, double &Value) {
|
2002-07-22 04:07:59 +02:00
|
|
|
const char *ArgStart = Arg.c_str();
|
|
|
|
char *End;
|
|
|
|
Value = strtod(ArgStart, &End);
|
2005-04-22 00:55:34 +02:00
|
|
|
if (*End != 0)
|
2002-07-22 04:07:59 +02:00
|
|
|
return O.error(": '" +Arg+ "' value invalid for floating point argument!");
|
2001-07-23 19:17:47 +02:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2002-08-07 20:36:37 +02:00
|
|
|
bool parser<double>::parse(Option &O, const char *AN,
|
|
|
|
const std::string &Arg, double &Val) {
|
|
|
|
return parseDouble(O, Arg, Val);
|
2001-07-23 19:17:47 +02:00
|
|
|
}
|
|
|
|
|
2002-08-07 20:36:37 +02: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 19:17:47 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2002-07-22 04:07:59 +02:00
|
|
|
// generic_parser_base implementation
|
2001-07-23 19:17:47 +02:00
|
|
|
//
|
|
|
|
|
2002-07-23 19:15:12 +02: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();
|
2003-05-22 22:06:43 +02:00
|
|
|
std::string N(Name);
|
2002-07-23 19:15:12 +02:00
|
|
|
|
|
|
|
while (i != e)
|
|
|
|
if (getOption(i) == N)
|
|
|
|
return i;
|
|
|
|
else
|
|
|
|
++i;
|
|
|
|
return e;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-07-23 19:17:47 +02:00
|
|
|
// Return the width of the option tag for printing...
|
2002-07-22 04:07:59 +02: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 19:17:47 +02:00
|
|
|
}
|
|
|
|
|
2005-04-22 00:55:34 +02:00
|
|
|
// printOptionInfo - Print out information about this option. The
|
2001-07-23 19:17:47 +02:00
|
|
|
// to-be-maintained width is specified.
|
|
|
|
//
|
2002-07-22 04:07:59 +02:00
|
|
|
void generic_parser_base::printOptionInfo(const Option &O,
|
|
|
|
unsigned GlobalWidth) const {
|
|
|
|
if (O.hasArgStr()) {
|
|
|
|
unsigned L = std::strlen(O.ArgStr);
|
2006-12-07 02:30:32 +01:00
|
|
|
cout << " -" << O.ArgStr << std::string(GlobalWidth-L-6, ' ')
|
|
|
|
<< " - " << O.HelpStr << "\n";
|
2002-07-22 04:07:59 +02:00
|
|
|
|
|
|
|
for (unsigned i = 0, e = getNumOptions(); i != e; ++i) {
|
|
|
|
unsigned NumSpaces = GlobalWidth-strlen(getOption(i))-8;
|
2006-12-07 02:30:32 +01:00
|
|
|
cout << " =" << getOption(i) << std::string(NumSpaces, ' ')
|
|
|
|
<< " - " << getDescription(i) << "\n";
|
2002-07-22 04:07:59 +02:00
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (O.HelpStr[0])
|
2006-12-07 02:30:32 +01:00
|
|
|
cout << " " << O.HelpStr << "\n";
|
2002-07-22 04:07:59 +02:00
|
|
|
for (unsigned i = 0, e = getNumOptions(); i != e; ++i) {
|
|
|
|
unsigned L = std::strlen(getOption(i));
|
2006-12-07 02:30:32 +01:00
|
|
|
cout << " -" << getOption(i) << std::string(GlobalWidth-L-8, ' ')
|
|
|
|
<< " - " << getDescription(i) << "\n";
|
2002-07-22 04:07:59 +02:00
|
|
|
}
|
2001-07-23 19:17:47 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
2002-07-22 04:07:59 +02:00
|
|
|
// --help and --help-hidden option implementation
|
2001-07-23 19:17:47 +02:00
|
|
|
//
|
2004-11-14 23:04:00 +01:00
|
|
|
|
2001-07-23 19:17:47 +02:00
|
|
|
namespace {
|
|
|
|
|
2002-07-22 04:07:59 +02:00
|
|
|
class HelpPrinter {
|
2001-07-23 19:17:47 +02:00
|
|
|
unsigned MaxArgLen;
|
|
|
|
const Option *EmptyArg;
|
|
|
|
const bool ShowHidden;
|
|
|
|
|
2002-07-22 04:07:59 +02:00
|
|
|
// isHidden/isReallyHidden - Predicates to be used to filter down arg lists.
|
2003-05-22 22:06:43 +02:00
|
|
|
inline static bool isHidden(std::pair<std::string, Option *> &OptPair) {
|
2002-07-22 04:07:59 +02:00
|
|
|
return OptPair.second->getOptionHiddenFlag() >= Hidden;
|
|
|
|
}
|
2003-05-22 22:06:43 +02:00
|
|
|
inline static bool isReallyHidden(std::pair<std::string, Option *> &OptPair) {
|
2002-07-22 04:07:59 +02:00
|
|
|
return OptPair.second->getOptionHiddenFlag() == ReallyHidden;
|
|
|
|
}
|
|
|
|
|
|
|
|
public:
|
|
|
|
HelpPrinter(bool showHidden) : ShowHidden(showHidden) {
|
|
|
|
EmptyArg = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void operator=(bool Value) {
|
|
|
|
if (Value == false) return;
|
|
|
|
|
2001-07-23 19:17:47 +02:00
|
|
|
// Copy Options into a vector so we can sort them as we like...
|
2006-10-04 23:52:35 +02:00
|
|
|
std::vector<std::pair<std::string, Option*> > Opts;
|
|
|
|
copy(Options->begin(), Options->end(), std::back_inserter(Opts));
|
2001-07-23 19:17:47 +02:00
|
|
|
|
|
|
|
// Eliminate Hidden or ReallyHidden arguments, depending on ShowHidden
|
2006-10-04 23:52:35 +02:00
|
|
|
Opts.erase(std::remove_if(Opts.begin(), Opts.end(),
|
|
|
|
std::ptr_fun(ShowHidden ? isReallyHidden : isHidden)),
|
|
|
|
Opts.end());
|
2001-07-23 19:17:47 +02:00
|
|
|
|
|
|
|
// Eliminate duplicate entries in table (from enum flags options, f.e.)
|
2002-07-22 04:07:59 +02:00
|
|
|
{ // Give OptionSet a scope
|
|
|
|
std::set<Option*> OptionSet;
|
2006-10-04 23:52:35 +02:00
|
|
|
for (unsigned i = 0; i != Opts.size(); ++i)
|
|
|
|
if (OptionSet.count(Opts[i].second) == 0)
|
|
|
|
OptionSet.insert(Opts[i].second); // Add new entry to set
|
2002-07-22 04:07:59 +02:00
|
|
|
else
|
2006-10-04 23:52:35 +02:00
|
|
|
Opts.erase(Opts.begin()+i--); // Erase duplicate
|
2002-07-22 04:07:59 +02:00
|
|
|
}
|
2001-07-23 19:17:47 +02:00
|
|
|
|
|
|
|
if (ProgramOverview)
|
2006-12-07 02:30:32 +01:00
|
|
|
cout << "OVERVIEW:" << ProgramOverview << "\n";
|
2001-07-23 19:17:47 +02:00
|
|
|
|
2006-12-07 02:30:32 +01:00
|
|
|
cout << "USAGE: " << ProgramName << " [options]";
|
2002-07-22 04:07:59 +02:00
|
|
|
|
2006-10-04 23:52:35 +02:00
|
|
|
// Print out the positional options.
|
|
|
|
std::vector<Option*> &PosOpts = *PositionalOptions;
|
2002-07-22 04:07:59 +02:00
|
|
|
Option *CAOpt = 0; // The cl::ConsumeAfter option, if it exists...
|
2003-07-10 18:49:51 +02:00
|
|
|
if (!PosOpts.empty() && PosOpts[0]->getNumOccurrencesFlag() == ConsumeAfter)
|
2002-07-22 04:07:59 +02:00
|
|
|
CAOpt = PosOpts[0];
|
|
|
|
|
2003-07-30 19:34:02 +02:00
|
|
|
for (unsigned i = CAOpt != 0, e = PosOpts.size(); i != e; ++i) {
|
|
|
|
if (PosOpts[i]->ArgStr[0])
|
2006-12-07 02:30:32 +01:00
|
|
|
cout << " --" << PosOpts[i]->ArgStr;
|
|
|
|
cout << " " << PosOpts[i]->HelpStr;
|
2003-07-30 19:34:02 +02:00
|
|
|
}
|
2002-07-22 04:07:59 +02:00
|
|
|
|
|
|
|
// Print the consume after option info if it exists...
|
2006-12-07 02:30:32 +01:00
|
|
|
if (CAOpt) cout << " " << CAOpt->HelpStr;
|
2002-07-22 04:07:59 +02:00
|
|
|
|
2006-12-07 02:30:32 +01:00
|
|
|
cout << "\n\n";
|
2001-07-23 19:17:47 +02:00
|
|
|
|
|
|
|
// Compute the maximum argument length...
|
|
|
|
MaxArgLen = 0;
|
2006-10-04 23:52:35 +02:00
|
|
|
for (unsigned i = 0, e = Opts.size(); i != e; ++i)
|
|
|
|
MaxArgLen = std::max(MaxArgLen, Opts[i].second->getOptionWidth());
|
2001-07-23 19:17:47 +02:00
|
|
|
|
2006-12-07 02:30:32 +01:00
|
|
|
cout << "OPTIONS:\n";
|
2006-10-04 23:52:35 +02:00
|
|
|
for (unsigned i = 0, e = Opts.size(); i != e; ++i)
|
|
|
|
Opts[i].second->printOptionInfo(MaxArgLen);
|
2001-07-23 19:17:47 +02:00
|
|
|
|
2004-11-19 18:08:15 +01:00
|
|
|
// Print any extra help the user has declared.
|
2006-10-04 23:52:35 +02:00
|
|
|
for (std::vector<const char *>::iterator I = MoreHelp->begin(),
|
|
|
|
E = MoreHelp->end(); I != E; ++I)
|
2006-12-07 02:30:32 +01:00
|
|
|
cout << *I;
|
2006-10-04 23:52:35 +02:00
|
|
|
MoreHelp->clear();
|
2004-11-14 23:04:00 +01:00
|
|
|
|
2004-11-16 07:11:52 +01:00
|
|
|
// Halt the program since help information was printed
|
2006-10-04 23:52:35 +02:00
|
|
|
Options->clear(); // Don't bother making option dtors remove from map.
|
2002-07-22 04:07:59 +02:00
|
|
|
exit(1);
|
2001-07-23 19:17:47 +02:00
|
|
|
}
|
2002-07-22 04:07:59 +02:00
|
|
|
};
|
2006-10-13 00:09:17 +02:00
|
|
|
} // End anonymous namespace
|
2001-07-23 19:17:47 +02:00
|
|
|
|
2002-07-22 04:07:59 +02:00
|
|
|
// Define the two HelpPrinter instances that are used to print out help, or
|
|
|
|
// help-hidden...
|
|
|
|
//
|
2006-10-13 00:09:17 +02:00
|
|
|
static HelpPrinter NormalPrinter(false);
|
|
|
|
static HelpPrinter HiddenPrinter(true);
|
2002-07-22 04:07:59 +02:00
|
|
|
|
2006-10-13 00:09:17 +02:00
|
|
|
static cl::opt<HelpPrinter, true, parser<bool> >
|
2005-05-13 21:49:09 +02:00
|
|
|
HOp("help", cl::desc("Display available options (--help-hidden for more)"),
|
2002-08-07 20:36:37 +02:00
|
|
|
cl::location(NormalPrinter), cl::ValueDisallowed);
|
2001-07-23 19:17:47 +02:00
|
|
|
|
2006-10-13 00:09:17 +02:00
|
|
|
static cl::opt<HelpPrinter, true, parser<bool> >
|
2005-05-13 21:49:09 +02:00
|
|
|
HHOp("help-hidden", cl::desc("Display all available options"),
|
2002-08-07 20:36:37 +02:00
|
|
|
cl::location(HiddenPrinter), cl::Hidden, cl::ValueDisallowed);
|
2001-07-23 19:17:47 +02:00
|
|
|
|
2006-10-13 00:09:17 +02:00
|
|
|
static void (*OverrideVersionPrinter)() = 0;
|
2006-06-05 18:22:56 +02:00
|
|
|
|
2006-10-13 00:09:17 +02:00
|
|
|
namespace {
|
2006-06-05 18:22:56 +02:00
|
|
|
class VersionPrinter {
|
|
|
|
public:
|
2007-02-01 02:43:37 +01:00
|
|
|
void print() {
|
2006-12-07 02:30:32 +01:00
|
|
|
cout << "Low Level Virtual Machine (http://llvm.org/):\n";
|
|
|
|
cout << " " << PACKAGE_NAME << " version " << PACKAGE_VERSION;
|
2006-07-06 20:33:03 +02:00
|
|
|
#ifdef LLVM_VERSION_INFO
|
2006-12-07 02:30:32 +01:00
|
|
|
cout << LLVM_VERSION_INFO;
|
2006-07-06 20:33:03 +02:00
|
|
|
#endif
|
2006-12-07 02:30:32 +01:00
|
|
|
cout << "\n ";
|
2006-07-06 20:33:03 +02:00
|
|
|
#ifndef __OPTIMIZE__
|
2006-12-07 02:30:32 +01:00
|
|
|
cout << "DEBUG build";
|
2006-06-05 18:22:56 +02:00
|
|
|
#else
|
2006-12-07 02:30:32 +01:00
|
|
|
cout << "Optimized build";
|
2006-07-06 20:33:03 +02:00
|
|
|
#endif
|
|
|
|
#ifndef NDEBUG
|
2006-12-07 02:30:32 +01:00
|
|
|
cout << " with assertions";
|
2006-06-05 18:22:56 +02:00
|
|
|
#endif
|
2006-12-07 02:30:32 +01:00
|
|
|
cout << ".\n";
|
2007-02-01 02:43:37 +01:00
|
|
|
}
|
|
|
|
void operator=(bool OptionWasSpecified) {
|
|
|
|
if (OptionWasSpecified) {
|
|
|
|
if (OverrideVersionPrinter == 0) {
|
|
|
|
print();
|
2006-10-04 23:52:35 +02:00
|
|
|
Options->clear(); // Don't bother making option dtors remove from map.
|
2006-06-05 18:22:56 +02:00
|
|
|
exit(1);
|
|
|
|
} else {
|
|
|
|
(*OverrideVersionPrinter)();
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
2006-10-13 00:09:17 +02:00
|
|
|
} // End anonymous namespace
|
2006-06-05 18:22:56 +02:00
|
|
|
|
|
|
|
|
2004-08-04 02:36:06 +02:00
|
|
|
// Define the --version option that prints out the LLVM version for the tool
|
2006-10-13 00:09:17 +02:00
|
|
|
static VersionPrinter VersionPrinterInstance;
|
|
|
|
|
|
|
|
static cl::opt<VersionPrinter, true, parser<bool> >
|
2005-05-13 21:49:09 +02:00
|
|
|
VersOp("version", cl::desc("Display the version of this program"),
|
2004-08-04 02:36:06 +02:00
|
|
|
cl::location(VersionPrinterInstance), cl::ValueDisallowed);
|
|
|
|
|
2004-11-16 07:11:52 +01:00
|
|
|
// Utility function for printing the help message.
|
|
|
|
void cl::PrintHelpMessage() {
|
2005-04-22 00:55:34 +02:00
|
|
|
// This looks weird, but it actually prints the help message. The
|
2004-11-16 07:50:36 +01:00
|
|
|
// NormalPrinter variable is a HelpPrinter and the help gets printed when
|
|
|
|
// its operator= is invoked. That's because the "normal" usages of the
|
2005-04-22 00:55:34 +02:00
|
|
|
// help printer is to be assigned true/false depending on whether the
|
2004-11-16 07:50:36 +01:00
|
|
|
// --help option was given or not. Since we're circumventing that we have
|
|
|
|
// to make it look like --help was given, so we assign true.
|
2004-11-16 07:11:52 +01:00
|
|
|
NormalPrinter = true;
|
|
|
|
}
|
2006-06-05 18:22:56 +02:00
|
|
|
|
2007-02-01 02:43:37 +01:00
|
|
|
/// Utility function for printing version number.
|
|
|
|
void cl::PrintVersionMessage() {
|
|
|
|
VersionPrinterInstance.print();
|
|
|
|
}
|
|
|
|
|
2006-06-05 18:22:56 +02:00
|
|
|
void cl::SetVersionPrinter(void (*func)()) {
|
|
|
|
OverrideVersionPrinter = func;
|
|
|
|
}
|