2001-07-24 01:17:47 +08:00
|
|
|
//===-- CommandLine.cpp - Command line parser implementation --------------===//
|
2005-04-22 06:55:34 +08:00
|
|
|
//
|
2003-10-21 03:43:21 +08:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-30 04:36:04 +08:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-22 06:55:34 +08:00
|
|
|
//
|
2003-10-21 03:43:21 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
2001-07-24 01:17:47 +08: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 07:04:07 +08: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-24 01:17:47 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2004-09-02 06:55:40 +08:00
|
|
|
#include "llvm/Support/CommandLine.h"
|
2014-10-17 06:47:52 +08:00
|
|
|
#include "llvm-c/Support.h"
|
2013-07-19 00:52:05 +08:00
|
|
|
#include "llvm/ADT/ArrayRef.h"
|
2016-06-30 05:48:26 +08:00
|
|
|
#include "llvm/ADT/DenseMap.h"
|
2016-07-25 01:19:59 +08:00
|
|
|
#include "llvm/ADT/Optional.h"
|
2015-03-14 08:20:13 +08:00
|
|
|
#include "llvm/ADT/STLExtras.h"
|
2009-09-20 13:12:14 +08:00
|
|
|
#include "llvm/ADT/SmallPtrSet.h"
|
2009-09-20 07:59:02 +08:00
|
|
|
#include "llvm/ADT/SmallString.h"
|
2017-06-23 20:55:02 +08:00
|
|
|
#include "llvm/ADT/StringExtras.h"
|
2009-09-20 13:12:14 +08:00
|
|
|
#include "llvm/ADT/StringMap.h"
|
2009-09-20 02:55:05 +08:00
|
|
|
#include "llvm/ADT/Twine.h"
|
2009-08-24 02:09:02 +08:00
|
|
|
#include "llvm/Config/config.h"
|
2013-07-19 00:52:05 +08:00
|
|
|
#include "llvm/Support/ConvertUTF.h"
|
2012-12-04 00:50:05 +08:00
|
|
|
#include "llvm/Support/Debug.h"
|
|
|
|
#include "llvm/Support/ErrorHandling.h"
|
2016-11-20 14:25:07 +08:00
|
|
|
#include "llvm/Support/FileSystem.h"
|
2012-12-04 00:50:05 +08:00
|
|
|
#include "llvm/Support/Host.h"
|
|
|
|
#include "llvm/Support/ManagedStatic.h"
|
|
|
|
#include "llvm/Support/MemoryBuffer.h"
|
|
|
|
#include "llvm/Support/Path.h"
|
2016-07-25 01:19:59 +08:00
|
|
|
#include "llvm/Support/Process.h"
|
2015-06-13 20:49:52 +08:00
|
|
|
#include "llvm/Support/StringSaver.h"
|
2012-12-04 00:50:05 +08:00
|
|
|
#include "llvm/Support/raw_ostream.h"
|
2009-08-24 02:09:02 +08:00
|
|
|
#include <cstdlib>
|
2013-05-07 05:56:23 +08:00
|
|
|
#include <map>
|
2003-12-15 05:35:53 +08:00
|
|
|
using namespace llvm;
|
2001-07-24 01:17:47 +08:00
|
|
|
using namespace cl;
|
|
|
|
|
2014-04-22 06:55:11 +08:00
|
|
|
#define DEBUG_TYPE "commandline"
|
|
|
|
|
2006-08-27 20:45:47 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Template instantiations and anchors.
|
|
|
|
//
|
2015-01-14 03:14:20 +08:00
|
|
|
namespace llvm {
|
|
|
|
namespace cl {
|
2015-07-14 01:21:31 +08:00
|
|
|
template class basic_parser<bool>;
|
|
|
|
template class basic_parser<boolOrDefault>;
|
|
|
|
template class basic_parser<int>;
|
|
|
|
template class basic_parser<unsigned>;
|
|
|
|
template class basic_parser<unsigned long long>;
|
|
|
|
template class basic_parser<double>;
|
|
|
|
template class basic_parser<float>;
|
|
|
|
template class basic_parser<std::string>;
|
|
|
|
template class basic_parser<char>;
|
2006-08-27 20:45:47 +08:00
|
|
|
|
2015-07-14 01:21:31 +08:00
|
|
|
template class opt<unsigned>;
|
|
|
|
template class opt<int>;
|
|
|
|
template class opt<std::string>;
|
|
|
|
template class opt<char>;
|
|
|
|
template class opt<bool>;
|
2015-06-23 17:49:53 +08:00
|
|
|
}
|
|
|
|
} // end namespace llvm::cl
|
2006-08-27 20:45:47 +08:00
|
|
|
|
2013-11-19 08:57:56 +08:00
|
|
|
// Pin the vtables to this file.
|
|
|
|
void GenericOptionValue::anchor() {}
|
2011-12-01 16:00:17 +08:00
|
|
|
void OptionValue<boolOrDefault>::anchor() {}
|
|
|
|
void OptionValue<std::string>::anchor() {}
|
2006-08-27 20:45:47 +08:00
|
|
|
void Option::anchor() {}
|
|
|
|
void basic_parser_impl::anchor() {}
|
|
|
|
void parser<bool>::anchor() {}
|
2007-05-23 01:14:46 +08:00
|
|
|
void parser<boolOrDefault>::anchor() {}
|
2006-08-27 20:45:47 +08:00
|
|
|
void parser<int>::anchor() {}
|
|
|
|
void parser<unsigned>::anchor() {}
|
2011-09-16 05:17:37 +08:00
|
|
|
void parser<unsigned long long>::anchor() {}
|
2006-08-27 20:45:47 +08:00
|
|
|
void parser<double>::anchor() {}
|
|
|
|
void parser<float>::anchor() {}
|
|
|
|
void parser<std::string>::anchor() {}
|
2009-04-30 07:26:16 +08:00
|
|
|
void parser<char>::anchor() {}
|
2006-08-27 20:45:47 +08:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2015-02-07 01:51:54 +08:00
|
|
|
namespace {
|
|
|
|
|
2015-01-29 03:00:25 +08:00
|
|
|
class CommandLineParser {
|
|
|
|
public:
|
|
|
|
// Globals for name and overview of program. Program name is not a string to
|
|
|
|
// avoid static ctor/dtor issues.
|
2015-01-29 06:25:00 +08:00
|
|
|
std::string ProgramName;
|
2016-10-01 11:43:20 +08:00
|
|
|
StringRef ProgramOverview;
|
2004-09-01 12:41:28 +08:00
|
|
|
|
2015-01-29 03:00:25 +08:00
|
|
|
// This collects additional help to be printed.
|
2016-10-01 11:43:20 +08:00
|
|
|
std::vector<StringRef> MoreHelp;
|
2004-11-20 01:08:15 +08:00
|
|
|
|
2016-06-29 06:20:17 +08:00
|
|
|
// This collects the different option categories that have been registered.
|
|
|
|
SmallPtrSet<OptionCategory *, 16> RegisteredOptionCategories;
|
2016-06-29 04:09:47 +08:00
|
|
|
|
2016-06-30 05:48:26 +08:00
|
|
|
// This collects the different subcommands that have been registered.
|
|
|
|
SmallPtrSet<SubCommand *, 4> RegisteredSubCommands;
|
2016-06-29 04:09:47 +08:00
|
|
|
|
2016-10-01 11:43:20 +08:00
|
|
|
CommandLineParser() : ActiveSubCommand(nullptr) {
|
2016-06-30 05:48:26 +08:00
|
|
|
registerSubCommand(&*TopLevelSubCommand);
|
|
|
|
registerSubCommand(&*AllSubCommands);
|
|
|
|
}
|
2007-04-07 05:06:55 +08:00
|
|
|
|
2016-06-30 05:48:26 +08:00
|
|
|
void ResetAllOptionOccurrences();
|
|
|
|
|
|
|
|
bool ParseCommandLineOptions(int argc, const char *const *argv,
|
2017-03-15 16:41:00 +08:00
|
|
|
StringRef Overview, raw_ostream *Errs = nullptr);
|
2016-06-30 05:48:26 +08:00
|
|
|
|
2016-10-01 11:43:20 +08:00
|
|
|
void addLiteralOption(Option &Opt, SubCommand *SC, StringRef Name) {
|
2016-06-30 05:48:26 +08:00
|
|
|
if (Opt.hasArgStr())
|
|
|
|
return;
|
|
|
|
if (!SC->OptionsMap.insert(std::make_pair(Name, &Opt)).second) {
|
|
|
|
errs() << ProgramName << ": CommandLine Error: Option '" << Name
|
|
|
|
<< "' registered more than once!\n";
|
|
|
|
report_fatal_error("inconsistency in registered CommandLine options");
|
|
|
|
}
|
|
|
|
|
|
|
|
// If we're adding this to all sub-commands, add it to the ones that have
|
|
|
|
// already been registered.
|
|
|
|
if (SC == &*AllSubCommands) {
|
|
|
|
for (const auto &Sub : RegisteredSubCommands) {
|
|
|
|
if (SC == Sub)
|
|
|
|
continue;
|
|
|
|
addLiteralOption(Opt, Sub, Name);
|
2016-06-29 06:20:17 +08:00
|
|
|
}
|
2016-06-29 04:09:47 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-10-01 11:43:20 +08:00
|
|
|
void addLiteralOption(Option &Opt, StringRef Name) {
|
2016-06-30 05:48:26 +08:00
|
|
|
if (Opt.Subs.empty())
|
|
|
|
addLiteralOption(Opt, &*TopLevelSubCommand, Name);
|
|
|
|
else {
|
|
|
|
for (auto SC : Opt.Subs)
|
|
|
|
addLiteralOption(Opt, SC, Name);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void addOption(Option *O, SubCommand *SC) {
|
2015-01-29 03:00:25 +08:00
|
|
|
bool HadErrors = false;
|
2015-11-18 03:00:52 +08:00
|
|
|
if (O->hasArgStr()) {
|
2015-01-29 03:00:25 +08:00
|
|
|
// Add argument to the argument map!
|
2016-06-30 05:48:26 +08:00
|
|
|
if (!SC->OptionsMap.insert(std::make_pair(O->ArgStr, O)).second) {
|
2015-01-29 03:00:25 +08:00
|
|
|
errs() << ProgramName << ": CommandLine Error: Option '" << O->ArgStr
|
|
|
|
<< "' registered more than once!\n";
|
|
|
|
HadErrors = true;
|
|
|
|
}
|
|
|
|
}
|
2008-04-29 00:44:25 +08:00
|
|
|
|
2015-01-29 03:00:25 +08:00
|
|
|
// Remember information about positional options.
|
|
|
|
if (O->getFormattingFlag() == cl::Positional)
|
2016-06-30 05:48:26 +08:00
|
|
|
SC->PositionalOpts.push_back(O);
|
2015-01-29 03:00:25 +08:00
|
|
|
else if (O->getMiscFlags() & cl::Sink) // Remember sink options
|
2016-06-30 05:48:26 +08:00
|
|
|
SC->SinkOpts.push_back(O);
|
2015-01-29 03:00:25 +08:00
|
|
|
else if (O->getNumOccurrencesFlag() == cl::ConsumeAfter) {
|
2016-06-30 05:48:26 +08:00
|
|
|
if (SC->ConsumeAfterOpt) {
|
2015-01-29 03:00:25 +08:00
|
|
|
O->error("Cannot specify more than one option with cl::ConsumeAfter!");
|
|
|
|
HadErrors = true;
|
|
|
|
}
|
2016-06-30 05:48:26 +08:00
|
|
|
SC->ConsumeAfterOpt = O;
|
2015-01-29 03:00:25 +08:00
|
|
|
}
|
2007-04-07 05:06:55 +08:00
|
|
|
|
2015-01-29 03:00:25 +08:00
|
|
|
// Fail hard if there were errors. These are strictly unrecoverable and
|
|
|
|
// indicate serious issues such as conflicting option names or an
|
|
|
|
// incorrectly
|
|
|
|
// linked LLVM distribution.
|
|
|
|
if (HadErrors)
|
|
|
|
report_fatal_error("inconsistency in registered CommandLine options");
|
2016-06-30 05:48:26 +08:00
|
|
|
|
|
|
|
// If we're adding this to all sub-commands, add it to the ones that have
|
|
|
|
// already been registered.
|
|
|
|
if (SC == &*AllSubCommands) {
|
|
|
|
for (const auto &Sub : RegisteredSubCommands) {
|
|
|
|
if (SC == Sub)
|
|
|
|
continue;
|
|
|
|
addOption(O, Sub);
|
|
|
|
}
|
|
|
|
}
|
2014-10-16 05:54:35 +08:00
|
|
|
}
|
2015-01-29 03:00:25 +08:00
|
|
|
|
2016-06-30 05:48:26 +08:00
|
|
|
void addOption(Option *O) {
|
|
|
|
if (O->Subs.empty()) {
|
|
|
|
addOption(O, &*TopLevelSubCommand);
|
|
|
|
} else {
|
|
|
|
for (auto SC : O->Subs)
|
|
|
|
addOption(O, SC);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void removeOption(Option *O, SubCommand *SC) {
|
2015-11-18 03:00:52 +08:00
|
|
|
SmallVector<StringRef, 16> OptionNames;
|
2015-01-29 03:00:25 +08:00
|
|
|
O->getExtraOptionNames(OptionNames);
|
2015-11-18 03:00:52 +08:00
|
|
|
if (O->hasArgStr())
|
2015-01-29 03:00:25 +08:00
|
|
|
OptionNames.push_back(O->ArgStr);
|
2016-06-30 05:48:26 +08:00
|
|
|
|
|
|
|
SubCommand &Sub = *SC;
|
2015-01-29 03:00:25 +08:00
|
|
|
for (auto Name : OptionNames)
|
2016-06-30 05:48:26 +08:00
|
|
|
Sub.OptionsMap.erase(Name);
|
2015-01-29 03:00:25 +08:00
|
|
|
|
|
|
|
if (O->getFormattingFlag() == cl::Positional)
|
2016-06-30 05:48:26 +08:00
|
|
|
for (auto Opt = Sub.PositionalOpts.begin();
|
|
|
|
Opt != Sub.PositionalOpts.end(); ++Opt) {
|
2015-01-29 03:00:25 +08:00
|
|
|
if (*Opt == O) {
|
2016-06-30 05:48:26 +08:00
|
|
|
Sub.PositionalOpts.erase(Opt);
|
2015-01-29 03:00:25 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if (O->getMiscFlags() & cl::Sink)
|
2016-06-30 05:48:26 +08:00
|
|
|
for (auto Opt = Sub.SinkOpts.begin(); Opt != Sub.SinkOpts.end(); ++Opt) {
|
2015-01-29 03:00:25 +08:00
|
|
|
if (*Opt == O) {
|
2016-06-30 05:48:26 +08:00
|
|
|
Sub.SinkOpts.erase(Opt);
|
2015-01-29 03:00:25 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2016-06-30 05:48:26 +08:00
|
|
|
else if (O == Sub.ConsumeAfterOpt)
|
|
|
|
Sub.ConsumeAfterOpt = nullptr;
|
2015-01-29 03:00:25 +08:00
|
|
|
}
|
|
|
|
|
2016-06-30 05:48:26 +08:00
|
|
|
void removeOption(Option *O) {
|
|
|
|
if (O->Subs.empty())
|
|
|
|
removeOption(O, &*TopLevelSubCommand);
|
|
|
|
else {
|
|
|
|
if (O->isInAllSubCommands()) {
|
|
|
|
for (auto SC : RegisteredSubCommands)
|
|
|
|
removeOption(O, SC);
|
|
|
|
} else {
|
|
|
|
for (auto SC : O->Subs)
|
|
|
|
removeOption(O, SC);
|
|
|
|
}
|
|
|
|
}
|
2016-06-29 04:09:47 +08:00
|
|
|
}
|
|
|
|
|
2016-06-30 05:48:26 +08:00
|
|
|
bool hasOptions(const SubCommand &Sub) const {
|
|
|
|
return (!Sub.OptionsMap.empty() || !Sub.PositionalOpts.empty() ||
|
|
|
|
nullptr != Sub.ConsumeAfterOpt);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool hasOptions() const {
|
|
|
|
for (const auto &S : RegisteredSubCommands) {
|
|
|
|
if (hasOptions(*S))
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
SubCommand *getActiveSubCommand() { return ActiveSubCommand; }
|
|
|
|
|
|
|
|
void updateArgStr(Option *O, StringRef NewName, SubCommand *SC) {
|
|
|
|
SubCommand &Sub = *SC;
|
|
|
|
if (!Sub.OptionsMap.insert(std::make_pair(NewName, O)).second) {
|
2015-01-29 03:00:25 +08:00
|
|
|
errs() << ProgramName << ": CommandLine Error: Option '" << O->ArgStr
|
|
|
|
<< "' registered more than once!\n";
|
|
|
|
report_fatal_error("inconsistency in registered CommandLine options");
|
|
|
|
}
|
2016-06-30 05:48:26 +08:00
|
|
|
Sub.OptionsMap.erase(O->ArgStr);
|
|
|
|
}
|
|
|
|
|
|
|
|
void updateArgStr(Option *O, StringRef NewName) {
|
|
|
|
if (O->Subs.empty())
|
|
|
|
updateArgStr(O, NewName, &*TopLevelSubCommand);
|
|
|
|
else {
|
|
|
|
for (auto SC : O->Subs)
|
|
|
|
updateArgStr(O, NewName, SC);
|
|
|
|
}
|
2015-01-29 03:00:25 +08:00
|
|
|
}
|
2015-01-31 06:16:01 +08:00
|
|
|
|
|
|
|
void printOptionValues();
|
2015-02-14 06:54:27 +08:00
|
|
|
|
2015-02-14 06:54:32 +08:00
|
|
|
void registerCategory(OptionCategory *cat) {
|
2016-06-11 05:18:39 +08:00
|
|
|
assert(count_if(RegisteredOptionCategories,
|
|
|
|
[cat](const OptionCategory *Category) {
|
|
|
|
return cat->getName() == Category->getName();
|
|
|
|
}) == 0 &&
|
2015-02-14 06:54:32 +08:00
|
|
|
"Duplicate option categories");
|
|
|
|
|
|
|
|
RegisteredOptionCategories.insert(cat);
|
|
|
|
}
|
|
|
|
|
2016-06-30 05:48:26 +08:00
|
|
|
void registerSubCommand(SubCommand *sub) {
|
|
|
|
assert(count_if(RegisteredSubCommands,
|
|
|
|
[sub](const SubCommand *Sub) {
|
2016-10-01 11:43:20 +08:00
|
|
|
return (!sub->getName().empty()) &&
|
2016-06-30 05:48:26 +08:00
|
|
|
(Sub->getName() == sub->getName());
|
|
|
|
}) == 0 &&
|
|
|
|
"Duplicate subcommands");
|
|
|
|
RegisteredSubCommands.insert(sub);
|
|
|
|
|
|
|
|
// For all options that have been registered for all subcommands, add the
|
|
|
|
// option to this subcommand now.
|
|
|
|
if (sub != &*AllSubCommands) {
|
|
|
|
for (auto &E : AllSubCommands->OptionsMap) {
|
|
|
|
Option *O = E.second;
|
|
|
|
if ((O->isPositional() || O->isSink() || O->isConsumeAfter()) ||
|
|
|
|
O->hasArgStr())
|
|
|
|
addOption(O, sub);
|
|
|
|
else
|
2016-10-01 11:43:20 +08:00
|
|
|
addLiteralOption(*O, sub, E.first());
|
2016-06-30 05:48:26 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void unregisterSubCommand(SubCommand *sub) {
|
|
|
|
RegisteredSubCommands.erase(sub);
|
|
|
|
}
|
|
|
|
|
2016-10-05 13:20:08 +08:00
|
|
|
iterator_range<typename SmallPtrSet<SubCommand *, 4>::iterator>
|
|
|
|
getRegisteredSubcommands() {
|
|
|
|
return make_range(RegisteredSubCommands.begin(),
|
|
|
|
RegisteredSubCommands.end());
|
|
|
|
}
|
|
|
|
|
2016-06-30 05:48:26 +08:00
|
|
|
void reset() {
|
|
|
|
ActiveSubCommand = nullptr;
|
|
|
|
ProgramName.clear();
|
2016-10-01 11:43:20 +08:00
|
|
|
ProgramOverview = StringRef();
|
2016-06-30 05:48:26 +08:00
|
|
|
|
|
|
|
MoreHelp.clear();
|
|
|
|
RegisteredOptionCategories.clear();
|
|
|
|
|
|
|
|
ResetAllOptionOccurrences();
|
|
|
|
RegisteredSubCommands.clear();
|
|
|
|
|
|
|
|
TopLevelSubCommand->reset();
|
|
|
|
AllSubCommands->reset();
|
|
|
|
registerSubCommand(&*TopLevelSubCommand);
|
|
|
|
registerSubCommand(&*AllSubCommands);
|
|
|
|
}
|
|
|
|
|
2015-02-14 06:54:27 +08:00
|
|
|
private:
|
2016-06-30 05:48:26 +08:00
|
|
|
SubCommand *ActiveSubCommand;
|
|
|
|
|
|
|
|
Option *LookupOption(SubCommand &Sub, StringRef &Arg, StringRef &Value);
|
2016-10-01 11:43:20 +08:00
|
|
|
SubCommand *LookupSubCommand(StringRef Name);
|
2015-01-29 03:00:25 +08:00
|
|
|
};
|
|
|
|
|
2015-02-07 01:51:54 +08:00
|
|
|
} // namespace
|
|
|
|
|
2015-01-29 03:00:25 +08:00
|
|
|
static ManagedStatic<CommandLineParser> GlobalParser;
|
|
|
|
|
2016-10-01 11:43:20 +08:00
|
|
|
void cl::AddLiteralOption(Option &O, StringRef Name) {
|
2015-01-29 03:00:25 +08:00
|
|
|
GlobalParser->addLiteralOption(O, Name);
|
|
|
|
}
|
|
|
|
|
2016-10-01 11:43:20 +08:00
|
|
|
extrahelp::extrahelp(StringRef Help) : morehelp(Help) {
|
2015-01-29 03:00:25 +08:00
|
|
|
GlobalParser->MoreHelp.push_back(Help);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Option::addArgument() {
|
|
|
|
GlobalParser->addOption(this);
|
|
|
|
FullyInitialized = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Option::removeArgument() { GlobalParser->removeOption(this); }
|
|
|
|
|
2015-11-18 03:00:52 +08:00
|
|
|
void Option::setArgStr(StringRef S) {
|
2015-01-29 03:00:25 +08:00
|
|
|
if (FullyInitialized)
|
|
|
|
GlobalParser->updateArgStr(this, S);
|
2017-01-09 06:30:43 +08:00
|
|
|
assert((S.empty() || S[0] != '-') && "Option can't start with '-");
|
2015-01-29 03:00:25 +08:00
|
|
|
ArgStr = S;
|
2014-01-30 02:54:17 +08:00
|
|
|
}
|
|
|
|
|
2013-05-07 05:56:23 +08:00
|
|
|
// Initialise the general option category.
|
|
|
|
OptionCategory llvm::cl::GeneralCategory("General options");
|
|
|
|
|
2014-03-01 19:47:00 +08:00
|
|
|
void OptionCategory::registerCategory() {
|
2015-02-14 06:54:32 +08:00
|
|
|
GlobalParser->registerCategory(this);
|
2013-05-07 05:56:23 +08:00
|
|
|
}
|
2007-04-12 08:36:29 +08:00
|
|
|
|
2016-06-30 05:48:26 +08:00
|
|
|
// A special subcommand representing no subcommand
|
|
|
|
ManagedStatic<SubCommand> llvm::cl::TopLevelSubCommand;
|
|
|
|
|
|
|
|
// A special subcommand that can be used to put an option into all subcommands.
|
|
|
|
ManagedStatic<SubCommand> llvm::cl::AllSubCommands;
|
|
|
|
|
|
|
|
void SubCommand::registerSubCommand() {
|
|
|
|
GlobalParser->registerSubCommand(this);
|
|
|
|
}
|
|
|
|
|
|
|
|
void SubCommand::unregisterSubCommand() {
|
|
|
|
GlobalParser->unregisterSubCommand(this);
|
|
|
|
}
|
|
|
|
|
|
|
|
void SubCommand::reset() {
|
|
|
|
PositionalOpts.clear();
|
|
|
|
SinkOpts.clear();
|
|
|
|
OptionsMap.clear();
|
|
|
|
|
|
|
|
ConsumeAfterOpt = nullptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
SubCommand::operator bool() const {
|
|
|
|
return (GlobalParser->getActiveSubCommand() == this);
|
|
|
|
}
|
|
|
|
|
2002-07-22 10:07:59 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
2006-08-27 20:45:47 +08:00
|
|
|
// Basic, shared command line option processing machinery.
|
2002-07-22 10:07:59 +08:00
|
|
|
//
|
|
|
|
|
2007-04-06 05:58:17 +08: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
|
2009-09-20 13:03:30 +08:00
|
|
|
/// that as well. This assumes that leading dashes have already been stripped.
|
2016-06-30 05:48:26 +08:00
|
|
|
Option *CommandLineParser::LookupOption(SubCommand &Sub, StringRef &Arg,
|
|
|
|
StringRef &Value) {
|
2009-09-20 10:02:24 +08:00
|
|
|
// Reject all dashes.
|
2015-01-14 03:14:20 +08:00
|
|
|
if (Arg.empty())
|
|
|
|
return nullptr;
|
2016-06-30 05:48:26 +08:00
|
|
|
assert(&Sub != &*AllSubCommands);
|
2009-11-20 01:29:36 +08:00
|
|
|
|
2009-09-20 10:02:24 +08:00
|
|
|
size_t EqualPos = Arg.find('=');
|
2009-11-20 01:29:36 +08:00
|
|
|
|
2009-09-20 09:53:12 +08:00
|
|
|
// If we have an equals sign, remember the value.
|
2009-09-20 13:03:30 +08:00
|
|
|
if (EqualPos == StringRef::npos) {
|
|
|
|
// Look up the option.
|
2016-06-30 05:48:26 +08:00
|
|
|
auto I = Sub.OptionsMap.find(Arg);
|
|
|
|
if (I == Sub.OptionsMap.end())
|
|
|
|
return nullptr;
|
|
|
|
|
|
|
|
return I != Sub.OptionsMap.end() ? I->second : nullptr;
|
2009-09-20 10:02:24 +08:00
|
|
|
}
|
2008-04-29 00:44:25 +08:00
|
|
|
|
2009-09-20 13:03:30 +08:00
|
|
|
// If the argument before the = is a valid option name, we match. If not,
|
|
|
|
// return Arg unmolested.
|
2016-06-30 05:48:26 +08:00
|
|
|
auto I = Sub.OptionsMap.find(Arg.substr(0, EqualPos));
|
|
|
|
if (I == Sub.OptionsMap.end())
|
2015-01-14 03:14:20 +08:00
|
|
|
return nullptr;
|
2009-11-20 01:29:36 +08:00
|
|
|
|
2015-01-14 03:14:20 +08:00
|
|
|
Value = Arg.substr(EqualPos + 1);
|
2009-09-20 13:03:30 +08:00
|
|
|
Arg = Arg.substr(0, EqualPos);
|
|
|
|
return I->second;
|
2001-07-24 01:17:47 +08:00
|
|
|
}
|
|
|
|
|
2016-10-01 11:43:20 +08:00
|
|
|
SubCommand *CommandLineParser::LookupSubCommand(StringRef Name) {
|
|
|
|
if (Name.empty())
|
2016-06-30 05:48:26 +08:00
|
|
|
return &*TopLevelSubCommand;
|
|
|
|
for (auto S : RegisteredSubCommands) {
|
|
|
|
if (S == &*AllSubCommands)
|
|
|
|
continue;
|
2016-10-01 11:43:20 +08:00
|
|
|
if (S->getName().empty())
|
2016-06-30 05:48:26 +08:00
|
|
|
continue;
|
|
|
|
|
|
|
|
if (StringRef(S->getName()) == StringRef(Name))
|
|
|
|
return S;
|
|
|
|
}
|
|
|
|
return &*TopLevelSubCommand;
|
|
|
|
}
|
|
|
|
|
2011-01-18 09:59:24 +08:00
|
|
|
/// LookupNearestOption - Lookup the closest match to 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. This assumes that leading dashes
|
|
|
|
/// have already been stripped.
|
|
|
|
static Option *LookupNearestOption(StringRef Arg,
|
2015-01-14 03:14:20 +08:00
|
|
|
const StringMap<Option *> &OptionsMap,
|
2011-05-02 13:24:47 +08:00
|
|
|
std::string &NearestString) {
|
2011-01-18 09:59:24 +08:00
|
|
|
// Reject all dashes.
|
2015-01-14 03:14:20 +08:00
|
|
|
if (Arg.empty())
|
|
|
|
return nullptr;
|
2011-01-18 09:59:24 +08:00
|
|
|
|
|
|
|
// Split on any equal sign.
|
2011-05-02 13:24:47 +08:00
|
|
|
std::pair<StringRef, StringRef> SplitArg = Arg.split('=');
|
2015-01-14 03:14:20 +08:00
|
|
|
StringRef &LHS = SplitArg.first; // LHS == Arg when no '=' is present.
|
2011-05-02 13:24:47 +08:00
|
|
|
StringRef &RHS = SplitArg.second;
|
2011-01-18 09:59:24 +08:00
|
|
|
|
|
|
|
// Find the closest match.
|
2014-04-07 12:17:22 +08:00
|
|
|
Option *Best = nullptr;
|
2011-01-18 09:59:24 +08:00
|
|
|
unsigned BestDistance = 0;
|
2015-01-14 03:14:20 +08:00
|
|
|
for (StringMap<Option *>::const_iterator it = OptionsMap.begin(),
|
|
|
|
ie = OptionsMap.end();
|
|
|
|
it != ie; ++it) {
|
2011-01-25 01:27:17 +08:00
|
|
|
Option *O = it->second;
|
2015-11-18 03:00:52 +08:00
|
|
|
SmallVector<StringRef, 16> OptionNames;
|
2011-01-25 01:27:17 +08:00
|
|
|
O->getExtraOptionNames(OptionNames);
|
2015-11-18 03:00:52 +08:00
|
|
|
if (O->hasArgStr())
|
2011-01-25 01:27:17 +08:00
|
|
|
OptionNames.push_back(O->ArgStr);
|
|
|
|
|
2011-05-02 13:24:47 +08:00
|
|
|
bool PermitValue = O->getValueExpectedFlag() != cl::ValueDisallowed;
|
|
|
|
StringRef Flag = PermitValue ? LHS : Arg;
|
2015-11-18 03:00:52 +08:00
|
|
|
for (auto Name : OptionNames) {
|
2011-01-25 01:27:17 +08:00
|
|
|
unsigned Distance = StringRef(Name).edit_distance(
|
2015-01-14 03:14:20 +08:00
|
|
|
Flag, /*AllowReplacements=*/true, /*MaxEditDistance=*/BestDistance);
|
2011-01-25 01:27:17 +08:00
|
|
|
if (!Best || Distance < BestDistance) {
|
|
|
|
Best = O;
|
|
|
|
BestDistance = Distance;
|
2012-07-19 08:15:11 +08:00
|
|
|
if (RHS.empty() || !PermitValue)
|
2015-11-18 03:00:52 +08:00
|
|
|
NearestString = Name;
|
2012-07-19 08:15:11 +08:00
|
|
|
else
|
2015-11-18 03:00:52 +08:00
|
|
|
NearestString = (Twine(Name) + "=" + RHS).str();
|
2011-01-25 01:27:17 +08:00
|
|
|
}
|
2011-01-18 09:59:24 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return Best;
|
|
|
|
}
|
|
|
|
|
2014-01-25 01:20:08 +08:00
|
|
|
/// CommaSeparateAndAddOccurrence - A wrapper around Handler->addOccurrence()
|
|
|
|
/// that does special handling of cl::CommaSeparated options.
|
|
|
|
static bool CommaSeparateAndAddOccurrence(Option *Handler, unsigned pos,
|
|
|
|
StringRef ArgName, StringRef Value,
|
|
|
|
bool MultiArg = false) {
|
2009-11-21 01:23:17 +08: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.
|
|
|
|
if (Handler->getMiscFlags() & CommaSeparated) {
|
|
|
|
StringRef Val(Value);
|
|
|
|
StringRef::size_type Pos = Val.find(',');
|
|
|
|
|
|
|
|
while (Pos != StringRef::npos) {
|
|
|
|
// Process the portion before the comma.
|
|
|
|
if (Handler->addOccurrence(pos, ArgName, Val.substr(0, Pos), MultiArg))
|
|
|
|
return true;
|
|
|
|
// Erase the portion before the comma, AND the comma.
|
2015-01-14 03:14:20 +08:00
|
|
|
Val = Val.substr(Pos + 1);
|
2009-11-21 01:23:17 +08:00
|
|
|
// Check for another comma.
|
|
|
|
Pos = Val.find(',');
|
|
|
|
}
|
|
|
|
|
|
|
|
Value = Val;
|
|
|
|
}
|
2009-09-20 13:03:30 +08:00
|
|
|
|
2015-12-28 23:46:15 +08:00
|
|
|
return Handler->addOccurrence(pos, ArgName, Value, MultiArg);
|
2009-11-21 01:23:17 +08:00
|
|
|
}
|
2009-09-20 13:03:30 +08:00
|
|
|
|
2009-09-20 09:49:31 +08:00
|
|
|
/// ProvideOption - For Value, this differentiates between an empty value ("")
|
|
|
|
/// and a null value (StringRef()). The later is accepted for arguments that
|
|
|
|
/// don't allow a value (-foo) the former is rejected (-foo=).
|
2009-09-20 08:40:49 +08:00
|
|
|
static inline bool ProvideOption(Option *Handler, StringRef ArgName,
|
2012-02-08 03:36:01 +08:00
|
|
|
StringRef Value, int argc,
|
|
|
|
const char *const *argv, int &i) {
|
2009-01-17 06:54:19 +08:00
|
|
|
// Is this a multi-argument option?
|
|
|
|
unsigned NumAdditionalVals = Handler->getNumAdditionalVals();
|
|
|
|
|
2001-10-27 13:54:17 +08:00
|
|
|
// Enforce value requirements
|
|
|
|
switch (Handler->getValueExpectedFlag()) {
|
|
|
|
case ValueRequired:
|
2014-04-09 12:20:00 +08:00
|
|
|
if (!Value.data()) { // No value specified?
|
2015-01-14 03:14:20 +08:00
|
|
|
if (i + 1 >= argc)
|
2009-08-02 20:13:02 +08:00
|
|
|
return Handler->error("requires a value!");
|
2009-09-20 08:07:40 +08:00
|
|
|
// Steal the next argument, like for '-o filename'
|
2014-12-12 03:46:38 +08:00
|
|
|
assert(argv && "null check");
|
2016-10-01 11:43:20 +08:00
|
|
|
Value = StringRef(argv[++i]);
|
2001-10-27 13:54:17 +08:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
case ValueDisallowed:
|
2009-01-17 06:54:19 +08:00
|
|
|
if (NumAdditionalVals > 0)
|
2009-08-02 20:13:02 +08:00
|
|
|
return Handler->error("multi-valued option specified"
|
2009-09-20 08:07:40 +08:00
|
|
|
" with ValueDisallowed modifier!");
|
2009-01-17 06:54:19 +08:00
|
|
|
|
2009-09-20 09:49:31 +08:00
|
|
|
if (Value.data())
|
2015-01-14 03:14:20 +08:00
|
|
|
return Handler->error("does not allow a value! '" + Twine(Value) +
|
|
|
|
"' specified.");
|
2001-10-27 13:54:17 +08:00
|
|
|
break;
|
2005-04-22 06:55:34 +08:00
|
|
|
case ValueOptional:
|
2004-09-01 12:41:28 +08:00
|
|
|
break;
|
2001-10-27 13:54:17 +08:00
|
|
|
}
|
|
|
|
|
2009-01-17 06:54:19 +08:00
|
|
|
// If this isn't a multi-arg option, just run the handler.
|
2009-09-20 02:55:05 +08:00
|
|
|
if (NumAdditionalVals == 0)
|
2014-01-25 01:20:08 +08:00
|
|
|
return CommaSeparateAndAddOccurrence(Handler, i, ArgName, Value);
|
2009-09-20 02:55:05 +08:00
|
|
|
|
2009-01-17 06:54:19 +08:00
|
|
|
// If it is, run the handle several times.
|
2009-09-20 02:55:05 +08:00
|
|
|
bool MultiArg = false;
|
2009-01-17 06:54:19 +08:00
|
|
|
|
2009-09-20 09:49:31 +08:00
|
|
|
if (Value.data()) {
|
2014-01-25 01:20:08 +08:00
|
|
|
if (CommaSeparateAndAddOccurrence(Handler, i, ArgName, Value, MultiArg))
|
2009-09-20 02:55:05 +08:00
|
|
|
return true;
|
|
|
|
--NumAdditionalVals;
|
|
|
|
MultiArg = true;
|
|
|
|
}
|
2009-01-17 06:54:19 +08:00
|
|
|
|
2009-09-20 02:55:05 +08:00
|
|
|
while (NumAdditionalVals > 0) {
|
2015-01-14 03:14:20 +08:00
|
|
|
if (i + 1 >= argc)
|
2009-09-20 02:55:05 +08:00
|
|
|
return Handler->error("not enough values!");
|
2014-12-12 03:46:38 +08:00
|
|
|
assert(argv && "null check");
|
2016-10-01 11:43:20 +08:00
|
|
|
Value = StringRef(argv[++i]);
|
2009-11-20 01:29:36 +08:00
|
|
|
|
2014-01-25 01:20:08 +08:00
|
|
|
if (CommaSeparateAndAddOccurrence(Handler, i, ArgName, Value, MultiArg))
|
2009-09-20 02:55:05 +08:00
|
|
|
return true;
|
|
|
|
MultiArg = true;
|
|
|
|
--NumAdditionalVals;
|
2009-01-17 06:54:19 +08:00
|
|
|
}
|
2009-09-20 02:55:05 +08:00
|
|
|
return false;
|
2001-10-27 13:54:17 +08:00
|
|
|
}
|
|
|
|
|
2009-09-20 08:07:40 +08:00
|
|
|
static bool ProvidePositionalOption(Option *Handler, StringRef Arg, int i) {
|
2004-08-14 03:47:30 +08:00
|
|
|
int Dummy = i;
|
2014-04-07 12:17:22 +08:00
|
|
|
return ProvideOption(Handler, Handler->ArgStr, Arg, 0, nullptr, Dummy);
|
2002-07-22 10:07:59 +08: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-27 02:58:34 +08:00
|
|
|
//
|
2009-09-20 08:40:49 +08:00
|
|
|
static Option *getOptionPred(StringRef Name, size_t &Length,
|
2015-01-14 03:14:20 +08:00
|
|
|
bool (*Pred)(const Option *),
|
|
|
|
const StringMap<Option *> &OptionsMap) {
|
2005-04-22 06:55:34 +08:00
|
|
|
|
2015-01-14 03:14:20 +08:00
|
|
|
StringMap<Option *>::const_iterator OMI = OptionsMap.find(Name);
|
2001-11-27 02:58:34 +08:00
|
|
|
|
2009-09-20 13:03:30 +08: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.
|
|
|
|
while (OMI == OptionsMap.end() && Name.size() > 1) {
|
2015-01-14 03:14:20 +08:00
|
|
|
Name = Name.substr(0, Name.size() - 1); // Chop off the last character.
|
2007-04-07 05:06:55 +08:00
|
|
|
OMI = OptionsMap.find(Name);
|
2009-09-20 13:03:30 +08:00
|
|
|
}
|
2002-07-22 10:07:59 +08:00
|
|
|
|
2007-04-07 05:06:55 +08:00
|
|
|
if (OMI != OptionsMap.end() && Pred(OMI->second)) {
|
2009-09-20 08:40:49 +08:00
|
|
|
Length = Name.size();
|
2015-01-14 03:14:20 +08:00
|
|
|
return OMI->second; // Found one!
|
2001-11-27 02:58:34 +08:00
|
|
|
}
|
2015-01-14 03:14:20 +08:00
|
|
|
return nullptr; // No option found!
|
2002-07-22 10:07:59 +08:00
|
|
|
}
|
2001-11-27 02:58:34 +08:00
|
|
|
|
2009-09-20 13:03:30 +08:00
|
|
|
/// HandlePrefixedOrGroupedOption - The specified argument string (which started
|
|
|
|
/// with at least one '-') does not fully match an available option. Check to
|
|
|
|
/// see if this is a prefix or grouped option. If so, split arg into output an
|
|
|
|
/// Arg/Value pair and return the Option to parse it with.
|
2015-01-14 03:14:20 +08:00
|
|
|
static Option *
|
|
|
|
HandlePrefixedOrGroupedOption(StringRef &Arg, StringRef &Value,
|
|
|
|
bool &ErrorParsing,
|
|
|
|
const StringMap<Option *> &OptionsMap) {
|
|
|
|
if (Arg.size() == 1)
|
|
|
|
return nullptr;
|
2009-09-20 13:03:30 +08:00
|
|
|
|
|
|
|
// Do the lookup!
|
|
|
|
size_t Length = 0;
|
|
|
|
Option *PGOpt = getOptionPred(Arg, Length, isPrefixedOrGrouping, OptionsMap);
|
2015-01-14 03:14:20 +08:00
|
|
|
if (!PGOpt)
|
|
|
|
return nullptr;
|
2009-11-20 01:29:36 +08:00
|
|
|
|
2009-09-20 13:03:30 +08: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->getFormattingFlag() == cl::Prefix) {
|
|
|
|
Value = Arg.substr(Length);
|
|
|
|
Arg = Arg.substr(0, Length);
|
|
|
|
assert(OptionsMap.count(Arg) && OptionsMap.find(Arg)->second == PGOpt);
|
|
|
|
return PGOpt;
|
|
|
|
}
|
2009-11-20 01:29:36 +08:00
|
|
|
|
2009-09-20 13:03:30 +08:00
|
|
|
// This must be a grouped option... handle them now. Grouping options can't
|
|
|
|
// have values.
|
|
|
|
assert(isGrouping(PGOpt) && "Broken getOptionPred!");
|
2009-11-20 01:29:36 +08:00
|
|
|
|
2009-09-20 13:03:30 +08:00
|
|
|
do {
|
|
|
|
// Move current arg name out of Arg into OneArgName.
|
|
|
|
StringRef OneArgName = Arg.substr(0, Length);
|
|
|
|
Arg = Arg.substr(Length);
|
2009-11-20 01:29:36 +08:00
|
|
|
|
2009-09-20 13:03:30 +08:00
|
|
|
// Because ValueRequired is an invalid flag for grouped arguments,
|
|
|
|
// we don't need to pass argc/argv in.
|
|
|
|
assert(PGOpt->getValueExpectedFlag() != cl::ValueRequired &&
|
|
|
|
"Option can not be cl::Grouping AND cl::ValueRequired!");
|
2010-01-09 16:30:33 +08:00
|
|
|
int Dummy = 0;
|
2015-01-14 03:14:20 +08:00
|
|
|
ErrorParsing |=
|
|
|
|
ProvideOption(PGOpt, OneArgName, StringRef(), 0, nullptr, Dummy);
|
2009-11-20 01:29:36 +08:00
|
|
|
|
2009-09-20 13:03:30 +08:00
|
|
|
// Get the next grouping option.
|
|
|
|
PGOpt = getOptionPred(Arg, Length, isGrouping, OptionsMap);
|
|
|
|
} while (PGOpt && Length != Arg.size());
|
2009-11-20 01:29:36 +08:00
|
|
|
|
2009-09-20 13:03:30 +08:00
|
|
|
// Return the last option with Arg cut down to just the last one.
|
|
|
|
return PGOpt;
|
|
|
|
}
|
|
|
|
|
2002-07-22 10:07:59 +08:00
|
|
|
static bool RequiresValue(const Option *O) {
|
2003-07-11 00:49:51 +08:00
|
|
|
return O->getNumOccurrencesFlag() == cl::Required ||
|
|
|
|
O->getNumOccurrencesFlag() == cl::OneOrMore;
|
2002-07-22 10:07:59 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static bool EatsUnboundedNumberOfValues(const Option *O) {
|
2003-07-11 00:49:51 +08:00
|
|
|
return O->getNumOccurrencesFlag() == cl::ZeroOrMore ||
|
|
|
|
O->getNumOccurrencesFlag() == cl::OneOrMore;
|
2001-11-27 02:58:34 +08:00
|
|
|
}
|
2001-10-27 13:54:17 +08:00
|
|
|
|
2015-01-14 03:14:20 +08:00
|
|
|
static bool isWhitespace(char C) { return strchr(" \t\n\r\f\v", C); }
|
2013-07-19 00:52:05 +08:00
|
|
|
|
2015-01-14 03:14:20 +08:00
|
|
|
static bool isQuote(char C) { return C == '\"' || C == '\''; }
|
2013-07-19 00:52:05 +08:00
|
|
|
|
|
|
|
void cl::TokenizeGNUCommandLine(StringRef Src, StringSaver &Saver,
|
2014-08-23 03:29:17 +08:00
|
|
|
SmallVectorImpl<const char *> &NewArgv,
|
|
|
|
bool MarkEOLs) {
|
2013-07-19 00:52:05 +08:00
|
|
|
SmallString<128> Token;
|
|
|
|
for (size_t I = 0, E = Src.size(); I != E; ++I) {
|
|
|
|
// Consume runs of whitespace.
|
|
|
|
if (Token.empty()) {
|
2014-08-23 03:29:17 +08:00
|
|
|
while (I != E && isWhitespace(Src[I])) {
|
|
|
|
// Mark the end of lines in response files
|
|
|
|
if (MarkEOLs && Src[I] == '\n')
|
|
|
|
NewArgv.push_back(nullptr);
|
2013-07-19 00:52:05 +08:00
|
|
|
++I;
|
2014-08-23 03:29:17 +08:00
|
|
|
}
|
2015-01-14 03:14:20 +08:00
|
|
|
if (I == E)
|
|
|
|
break;
|
2013-07-19 00:52:05 +08:00
|
|
|
}
|
|
|
|
|
2016-04-26 21:53:56 +08:00
|
|
|
// Backslash escapes the next character.
|
|
|
|
if (I + 1 < E && Src[I] == '\\') {
|
2015-01-14 03:14:20 +08:00
|
|
|
++I; // Skip the escape.
|
2013-07-19 00:52:05 +08:00
|
|
|
Token.push_back(Src[I]);
|
2009-09-24 13:38:36 +08:00
|
|
|
continue;
|
2003-08-15 06:00:59 +08:00
|
|
|
}
|
2009-11-20 01:29:36 +08:00
|
|
|
|
2013-07-19 00:52:05 +08:00
|
|
|
// Consume a quoted string.
|
|
|
|
if (isQuote(Src[I])) {
|
|
|
|
char Quote = Src[I++];
|
|
|
|
while (I != E && Src[I] != Quote) {
|
2016-04-26 21:53:56 +08:00
|
|
|
// Backslash escapes the next character.
|
|
|
|
if (Src[I] == '\\' && I + 1 != E)
|
2013-07-19 00:52:05 +08:00
|
|
|
++I;
|
|
|
|
Token.push_back(Src[I]);
|
|
|
|
++I;
|
|
|
|
}
|
2015-01-14 03:14:20 +08:00
|
|
|
if (I == E)
|
|
|
|
break;
|
2013-07-19 00:52:05 +08:00
|
|
|
continue;
|
|
|
|
}
|
2009-11-20 01:29:36 +08:00
|
|
|
|
2013-07-19 00:52:05 +08:00
|
|
|
// End the token if this is whitespace.
|
|
|
|
if (isWhitespace(Src[I])) {
|
|
|
|
if (!Token.empty())
|
2016-10-05 09:32:41 +08:00
|
|
|
NewArgv.push_back(Saver.save(StringRef(Token)).data());
|
2013-07-19 00:52:05 +08:00
|
|
|
Token.clear();
|
|
|
|
continue;
|
|
|
|
}
|
2009-11-20 01:29:36 +08:00
|
|
|
|
2013-07-19 00:52:05 +08:00
|
|
|
// This is a normal character. Append it.
|
|
|
|
Token.push_back(Src[I]);
|
2003-08-15 06:00:59 +08:00
|
|
|
}
|
2013-07-19 00:52:05 +08:00
|
|
|
|
|
|
|
// Append the last token after hitting EOF with no whitespace.
|
|
|
|
if (!Token.empty())
|
2016-10-05 09:32:41 +08:00
|
|
|
NewArgv.push_back(Saver.save(StringRef(Token)).data());
|
2014-08-23 03:29:17 +08:00
|
|
|
// Mark the end of response files
|
|
|
|
if (MarkEOLs)
|
|
|
|
NewArgv.push_back(nullptr);
|
2013-07-19 00:52:05 +08:00
|
|
|
}
|
|
|
|
|
2013-07-31 03:03:20 +08:00
|
|
|
/// Backslashes are interpreted in a rather complicated way in the Windows-style
|
|
|
|
/// command line, because backslashes are used both to separate path and to
|
|
|
|
/// escape double quote. This method consumes runs of backslashes as well as the
|
|
|
|
/// following double quote if it's escaped.
|
|
|
|
///
|
|
|
|
/// * If an even number of backslashes is followed by a double quote, one
|
|
|
|
/// backslash is output for every pair of backslashes, and the last double
|
|
|
|
/// quote remains unconsumed. The double quote will later be interpreted as
|
|
|
|
/// the start or end of a quoted string in the main loop outside of this
|
|
|
|
/// function.
|
|
|
|
///
|
|
|
|
/// * If an odd number of backslashes is followed by a double quote, one
|
|
|
|
/// backslash is output for every pair of backslashes, and a double quote is
|
|
|
|
/// output for the last pair of backslash-double quote. The double quote is
|
|
|
|
/// consumed in this case.
|
|
|
|
///
|
|
|
|
/// * Otherwise, backslashes are interpreted literally.
|
|
|
|
static size_t parseBackslash(StringRef Src, size_t I, SmallString<128> &Token) {
|
|
|
|
size_t E = Src.size();
|
|
|
|
int BackslashCount = 0;
|
|
|
|
// Skip the backslashes.
|
|
|
|
do {
|
|
|
|
++I;
|
|
|
|
++BackslashCount;
|
|
|
|
} while (I != E && Src[I] == '\\');
|
|
|
|
|
|
|
|
bool FollowedByDoubleQuote = (I != E && Src[I] == '"');
|
|
|
|
if (FollowedByDoubleQuote) {
|
|
|
|
Token.append(BackslashCount / 2, '\\');
|
|
|
|
if (BackslashCount % 2 == 0)
|
|
|
|
return I - 1;
|
|
|
|
Token.push_back('"');
|
|
|
|
return I;
|
|
|
|
}
|
|
|
|
Token.append(BackslashCount, '\\');
|
|
|
|
return I - 1;
|
|
|
|
}
|
|
|
|
|
2013-07-19 00:52:05 +08:00
|
|
|
void cl::TokenizeWindowsCommandLine(StringRef Src, StringSaver &Saver,
|
2014-08-23 03:29:17 +08:00
|
|
|
SmallVectorImpl<const char *> &NewArgv,
|
|
|
|
bool MarkEOLs) {
|
2013-07-31 03:03:20 +08:00
|
|
|
SmallString<128> Token;
|
|
|
|
|
|
|
|
// This is a small state machine to consume characters until it reaches the
|
|
|
|
// end of the source string.
|
|
|
|
enum { INIT, UNQUOTED, QUOTED } State = INIT;
|
|
|
|
for (size_t I = 0, E = Src.size(); I != E; ++I) {
|
|
|
|
// INIT state indicates that the current input index is at the start of
|
|
|
|
// the string or between tokens.
|
|
|
|
if (State == INIT) {
|
2014-08-23 03:29:17 +08:00
|
|
|
if (isWhitespace(Src[I])) {
|
|
|
|
// Mark the end of lines in response files
|
|
|
|
if (MarkEOLs && Src[I] == '\n')
|
|
|
|
NewArgv.push_back(nullptr);
|
2013-07-31 03:03:20 +08:00
|
|
|
continue;
|
2014-08-23 03:29:17 +08:00
|
|
|
}
|
2013-07-31 03:03:20 +08:00
|
|
|
if (Src[I] == '"') {
|
|
|
|
State = QUOTED;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (Src[I] == '\\') {
|
|
|
|
I = parseBackslash(Src, I, Token);
|
|
|
|
State = UNQUOTED;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
Token.push_back(Src[I]);
|
|
|
|
State = UNQUOTED;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// UNQUOTED state means that it's reading a token not quoted by double
|
|
|
|
// quotes.
|
|
|
|
if (State == UNQUOTED) {
|
|
|
|
// Whitespace means the end of the token.
|
|
|
|
if (isWhitespace(Src[I])) {
|
2016-10-05 09:32:41 +08:00
|
|
|
NewArgv.push_back(Saver.save(StringRef(Token)).data());
|
2013-07-31 03:03:20 +08:00
|
|
|
Token.clear();
|
|
|
|
State = INIT;
|
2014-08-23 03:29:17 +08:00
|
|
|
// Mark the end of lines in response files
|
|
|
|
if (MarkEOLs && Src[I] == '\n')
|
|
|
|
NewArgv.push_back(nullptr);
|
2013-07-31 03:03:20 +08:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (Src[I] == '"') {
|
|
|
|
State = QUOTED;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (Src[I] == '\\') {
|
|
|
|
I = parseBackslash(Src, I, Token);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
Token.push_back(Src[I]);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// QUOTED state means that it's reading a token quoted by double quotes.
|
|
|
|
if (State == QUOTED) {
|
|
|
|
if (Src[I] == '"') {
|
|
|
|
State = UNQUOTED;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (Src[I] == '\\') {
|
|
|
|
I = parseBackslash(Src, I, Token);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
Token.push_back(Src[I]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
// Append the last token after hitting EOF with no whitespace.
|
|
|
|
if (!Token.empty())
|
2016-10-05 09:32:41 +08:00
|
|
|
NewArgv.push_back(Saver.save(StringRef(Token)).data());
|
2014-08-23 03:29:17 +08:00
|
|
|
// Mark the end of response files
|
|
|
|
if (MarkEOLs)
|
|
|
|
NewArgv.push_back(nullptr);
|
2013-07-19 00:52:05 +08:00
|
|
|
}
|
|
|
|
|
2015-01-24 12:23:08 +08:00
|
|
|
// It is called byte order marker but the UTF-8 BOM is actually not affected
|
|
|
|
// by the host system's endianness.
|
|
|
|
static bool hasUTF8ByteOrderMark(ArrayRef<char> S) {
|
2015-02-14 06:54:29 +08:00
|
|
|
return (S.size() >= 3 && S[0] == '\xef' && S[1] == '\xbb' && S[2] == '\xbf');
|
2015-01-24 12:23:08 +08:00
|
|
|
}
|
|
|
|
|
2016-11-01 14:53:29 +08:00
|
|
|
static bool ExpandResponseFile(StringRef FName, StringSaver &Saver,
|
2013-07-19 00:52:05 +08:00
|
|
|
TokenizerCallback Tokenizer,
|
2014-08-23 03:29:17 +08:00
|
|
|
SmallVectorImpl<const char *> &NewArgv,
|
2016-11-01 14:53:29 +08:00
|
|
|
bool MarkEOLs, bool RelativeNames) {
|
2014-07-07 01:43:13 +08:00
|
|
|
ErrorOr<std::unique_ptr<MemoryBuffer>> MemBufOrErr =
|
|
|
|
MemoryBuffer::getFile(FName);
|
|
|
|
if (!MemBufOrErr)
|
2013-07-19 00:52:05 +08:00
|
|
|
return false;
|
2014-08-01 22:31:55 +08:00
|
|
|
MemoryBuffer &MemBuf = *MemBufOrErr.get();
|
|
|
|
StringRef Str(MemBuf.getBufferStart(), MemBuf.getBufferSize());
|
2013-07-19 00:52:05 +08:00
|
|
|
|
|
|
|
// If we have a UTF-16 byte order mark, convert to UTF-8 for parsing.
|
2014-08-01 22:31:55 +08:00
|
|
|
ArrayRef<char> BufRef(MemBuf.getBufferStart(), MemBuf.getBufferEnd());
|
2013-07-19 00:52:05 +08:00
|
|
|
std::string UTF8Buf;
|
|
|
|
if (hasUTF16ByteOrderMark(BufRef)) {
|
|
|
|
if (!convertUTF16ToUTF8String(BufRef, UTF8Buf))
|
|
|
|
return false;
|
|
|
|
Str = StringRef(UTF8Buf);
|
|
|
|
}
|
2015-01-24 12:23:08 +08:00
|
|
|
// If we see UTF-8 BOM sequence at the beginning of a file, we shall remove
|
|
|
|
// these bytes before parsing.
|
|
|
|
// Reference: http://en.wikipedia.org/wiki/UTF-8#Byte_order_mark
|
|
|
|
else if (hasUTF8ByteOrderMark(BufRef))
|
|
|
|
Str = StringRef(BufRef.data() + 3, BufRef.size() - 3);
|
2013-07-19 00:52:05 +08:00
|
|
|
|
|
|
|
// Tokenize the contents into NewArgv.
|
2014-08-23 03:29:17 +08:00
|
|
|
Tokenizer(Str, Saver, NewArgv, MarkEOLs);
|
2013-07-19 00:52:05 +08:00
|
|
|
|
2016-11-01 14:53:29 +08:00
|
|
|
// If names of nested response files should be resolved relative to including
|
|
|
|
// file, replace the included response file names with their full paths
|
|
|
|
// obtained by required resolution.
|
|
|
|
if (RelativeNames)
|
|
|
|
for (unsigned I = 0; I < NewArgv.size(); ++I)
|
|
|
|
if (NewArgv[I]) {
|
|
|
|
StringRef Arg = NewArgv[I];
|
|
|
|
if (Arg.front() == '@') {
|
|
|
|
StringRef FileName = Arg.drop_front();
|
|
|
|
if (llvm::sys::path::is_relative(FileName)) {
|
|
|
|
SmallString<128> ResponseFile;
|
|
|
|
ResponseFile.append(1, '@');
|
2016-11-20 14:25:07 +08:00
|
|
|
if (llvm::sys::path::is_relative(FName)) {
|
|
|
|
SmallString<128> curr_dir;
|
|
|
|
llvm::sys::fs::current_path(curr_dir);
|
|
|
|
ResponseFile.append(curr_dir.str());
|
|
|
|
}
|
2016-11-01 14:53:29 +08:00
|
|
|
llvm::sys::path::append(
|
|
|
|
ResponseFile, llvm::sys::path::parent_path(FName), FileName);
|
|
|
|
NewArgv[I] = Saver.save(ResponseFile.c_str()).data();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-07-19 00:52:05 +08:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// \brief Expand response files on a command line recursively using the given
|
|
|
|
/// StringSaver and tokenization strategy.
|
|
|
|
bool cl::ExpandResponseFiles(StringSaver &Saver, TokenizerCallback Tokenizer,
|
2014-08-23 03:29:17 +08:00
|
|
|
SmallVectorImpl<const char *> &Argv,
|
2016-11-01 14:53:29 +08:00
|
|
|
bool MarkEOLs, bool RelativeNames) {
|
2013-07-19 00:52:05 +08:00
|
|
|
unsigned RspFiles = 0;
|
2013-12-04 03:13:18 +08:00
|
|
|
bool AllExpanded = true;
|
2013-07-19 00:52:05 +08:00
|
|
|
|
|
|
|
// Don't cache Argv.size() because it can change.
|
2015-01-14 03:14:20 +08:00
|
|
|
for (unsigned I = 0; I != Argv.size();) {
|
2013-07-19 00:52:05 +08:00
|
|
|
const char *Arg = Argv[I];
|
2014-08-23 03:29:17 +08:00
|
|
|
// Check if it is an EOL marker
|
|
|
|
if (Arg == nullptr) {
|
|
|
|
++I;
|
|
|
|
continue;
|
|
|
|
}
|
2013-07-19 00:52:05 +08:00
|
|
|
if (Arg[0] != '@') {
|
|
|
|
++I;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// If we have too many response files, leave some unexpanded. This avoids
|
|
|
|
// crashing on self-referential response files.
|
|
|
|
if (RspFiles++ > 20)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Replace this response file argument with the tokenization of its
|
|
|
|
// contents. Nested response files are expanded in subsequent iterations.
|
|
|
|
SmallVector<const char *, 0> ExpandedArgv;
|
2014-08-23 03:29:17 +08:00
|
|
|
if (!ExpandResponseFile(Arg + 1, Saver, Tokenizer, ExpandedArgv,
|
2016-11-01 14:53:29 +08:00
|
|
|
MarkEOLs, RelativeNames)) {
|
2013-12-07 06:56:19 +08:00
|
|
|
// We couldn't read this file, so we leave it in the argument stream and
|
|
|
|
// move on.
|
2013-07-19 00:52:05 +08:00
|
|
|
AllExpanded = false;
|
2013-12-07 06:56:19 +08:00
|
|
|
++I;
|
2013-07-19 00:52:05 +08:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
Argv.erase(Argv.begin() + I);
|
|
|
|
Argv.insert(Argv.begin() + I, ExpandedArgv.begin(), ExpandedArgv.end());
|
|
|
|
}
|
|
|
|
return AllExpanded;
|
|
|
|
}
|
|
|
|
|
2003-08-15 06:00:59 +08: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 06:04:31 +08:00
|
|
|
void cl::ParseEnvironmentOptions(const char *progName, const char *envVar,
|
2012-10-10 03:52:10 +08:00
|
|
|
const char *Overview) {
|
2003-08-16 05:05:57 +08:00
|
|
|
// Check args.
|
2004-05-07 06:04:31 +08:00
|
|
|
assert(progName && "Program name not specified");
|
|
|
|
assert(envVar && "Environment variable name missing");
|
2005-04-22 06:55:34 +08:00
|
|
|
|
2003-08-15 06:00:59 +08:00
|
|
|
// Get the environment variable they want us to parse options out of.
|
2016-10-01 11:43:20 +08:00
|
|
|
llvm::Optional<std::string> envValue = sys::Process::GetEnv(StringRef(envVar));
|
2003-08-16 05:05:57 +08:00
|
|
|
if (!envValue)
|
2003-08-15 06:00:59 +08:00
|
|
|
return;
|
2003-08-16 05:05:57 +08:00
|
|
|
|
|
|
|
// Get program's "name", which we wouldn't know without the caller
|
|
|
|
// telling us.
|
2013-07-19 00:52:05 +08:00
|
|
|
SmallVector<const char *, 20> newArgv;
|
2015-06-13 20:49:52 +08:00
|
|
|
BumpPtrAllocator A;
|
2015-08-13 09:07:02 +08:00
|
|
|
StringSaver Saver(A);
|
2016-10-05 09:32:41 +08:00
|
|
|
newArgv.push_back(Saver.save(progName).data());
|
2003-08-15 06:00:59 +08:00
|
|
|
|
|
|
|
// Parse the value of the environment variable into a "command line"
|
|
|
|
// and hand it off to ParseCommandLineOptions().
|
2016-07-25 01:19:59 +08:00
|
|
|
TokenizeGNUCommandLine(*envValue, Saver, newArgv);
|
2008-05-06 02:30:58 +08:00
|
|
|
int newArgc = static_cast<int>(newArgv.size());
|
2016-10-01 11:43:20 +08:00
|
|
|
ParseCommandLineOptions(newArgc, &newArgv[0], StringRef(Overview));
|
2008-04-29 00:44:25 +08:00
|
|
|
}
|
|
|
|
|
2016-06-30 05:48:26 +08:00
|
|
|
bool cl::ParseCommandLineOptions(int argc, const char *const *argv,
|
2017-03-15 16:41:00 +08:00
|
|
|
StringRef Overview, raw_ostream *Errs) {
|
2016-06-30 05:48:26 +08:00
|
|
|
return GlobalParser->ParseCommandLineOptions(argc, argv, Overview,
|
2017-03-15 16:41:00 +08:00
|
|
|
Errs);
|
2016-06-30 05:48:26 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void CommandLineParser::ResetAllOptionOccurrences() {
|
|
|
|
// So that we can parse different command lines multiple times in succession
|
|
|
|
// we reset all option values to look like they have never been seen before.
|
|
|
|
for (auto SC : RegisteredSubCommands) {
|
|
|
|
for (auto &O : SC->OptionsMap)
|
|
|
|
O.second->reset();
|
|
|
|
}
|
2015-01-29 03:00:25 +08:00
|
|
|
}
|
2008-04-29 00:44:25 +08:00
|
|
|
|
2016-06-30 05:48:26 +08:00
|
|
|
bool CommandLineParser::ParseCommandLineOptions(int argc,
|
2015-01-29 03:00:25 +08:00
|
|
|
const char *const *argv,
|
2016-10-01 11:43:20 +08:00
|
|
|
StringRef Overview,
|
2017-03-15 16:41:00 +08:00
|
|
|
raw_ostream *Errs) {
|
2015-01-29 03:00:25 +08:00
|
|
|
assert(hasOptions() && "No options specified!");
|
2008-04-29 00:44:25 +08:00
|
|
|
|
|
|
|
// Expand response files.
|
2015-02-17 23:29:18 +08:00
|
|
|
SmallVector<const char *, 20> newArgv(argv, argv + argc);
|
2015-06-13 20:49:52 +08:00
|
|
|
BumpPtrAllocator A;
|
2015-08-13 09:07:02 +08:00
|
|
|
StringSaver Saver(A);
|
2013-07-19 00:52:05 +08:00
|
|
|
ExpandResponseFiles(Saver, TokenizeGNUCommandLine, newArgv);
|
2012-10-10 03:52:10 +08:00
|
|
|
argv = &newArgv[0];
|
|
|
|
argc = static_cast<int>(newArgv.size());
|
2008-04-29 00:44:25 +08:00
|
|
|
|
2006-10-13 08:06:24 +08:00
|
|
|
// Copy the program name into ProgName, making sure not to overflow it.
|
2016-10-01 11:43:20 +08:00
|
|
|
ProgramName = sys::path::filename(StringRef(argv[0]));
|
2008-04-29 00:44:25 +08:00
|
|
|
|
2001-07-24 01:17:47 +08:00
|
|
|
ProgramOverview = Overview;
|
2017-03-15 16:41:00 +08:00
|
|
|
bool IgnoreErrors = Errs;
|
|
|
|
if (!Errs)
|
|
|
|
Errs = &errs();
|
2001-07-24 01:17:47 +08:00
|
|
|
bool ErrorParsing = false;
|
|
|
|
|
2002-07-22 10:07:59 +08:00
|
|
|
// Check out the positional arguments to collect information about them.
|
|
|
|
unsigned NumPositionalRequired = 0;
|
2008-04-29 00:44:25 +08:00
|
|
|
|
2005-08-09 01:25:38 +08:00
|
|
|
// Determine whether or not there are an unlimited number of positionals
|
|
|
|
bool HasUnlimitedPositionals = false;
|
2008-04-29 00:44:25 +08:00
|
|
|
|
2016-06-30 05:48:26 +08:00
|
|
|
int FirstArg = 1;
|
|
|
|
SubCommand *ChosenSubCommand = &*TopLevelSubCommand;
|
|
|
|
if (argc >= 2 && argv[FirstArg][0] != '-') {
|
|
|
|
// If the first argument specifies a valid subcommand, start processing
|
|
|
|
// options from the second argument.
|
2016-10-01 11:43:20 +08:00
|
|
|
ChosenSubCommand = LookupSubCommand(StringRef(argv[FirstArg]));
|
2016-06-30 05:48:26 +08:00
|
|
|
if (ChosenSubCommand != &*TopLevelSubCommand)
|
|
|
|
FirstArg = 2;
|
|
|
|
}
|
|
|
|
GlobalParser->ActiveSubCommand = ChosenSubCommand;
|
|
|
|
|
|
|
|
assert(ChosenSubCommand);
|
|
|
|
auto &ConsumeAfterOpt = ChosenSubCommand->ConsumeAfterOpt;
|
|
|
|
auto &PositionalOpts = ChosenSubCommand->PositionalOpts;
|
|
|
|
auto &SinkOpts = ChosenSubCommand->SinkOpts;
|
|
|
|
auto &OptionsMap = ChosenSubCommand->OptionsMap;
|
|
|
|
|
2015-01-29 03:00:25 +08:00
|
|
|
if (ConsumeAfterOpt) {
|
|
|
|
assert(PositionalOpts.size() > 0 &&
|
|
|
|
"Cannot specify cl::ConsumeAfter without a positional argument!");
|
|
|
|
}
|
2002-07-22 10:07:59 +08:00
|
|
|
if (!PositionalOpts.empty()) {
|
|
|
|
|
|
|
|
// Calculate how many positional values are _required_.
|
|
|
|
bool UnboundedFound = false;
|
2015-01-29 03:00:25 +08:00
|
|
|
for (size_t i = 0, e = PositionalOpts.size(); i != e; ++i) {
|
2002-07-22 10:07:59 +08:00
|
|
|
Option *Opt = PositionalOpts[i];
|
|
|
|
if (RequiresValue(Opt))
|
|
|
|
++NumPositionalRequired;
|
|
|
|
else if (ConsumeAfterOpt) {
|
|
|
|
// ConsumeAfter cannot be combined with "optional" positional options
|
2002-07-22 10:21:57 +08:00
|
|
|
// unless there is only one positional argument...
|
2016-06-30 05:48:26 +08:00
|
|
|
if (PositionalOpts.size() > 1) {
|
|
|
|
if (!IgnoreErrors)
|
|
|
|
Opt->error("error - this positional option will never be matched, "
|
|
|
|
"because it does not Require a value, and a "
|
|
|
|
"cl::ConsumeAfter option is active!");
|
|
|
|
ErrorParsing = true;
|
|
|
|
}
|
2015-11-18 03:00:52 +08:00
|
|
|
} else if (UnboundedFound && !Opt->hasArgStr()) {
|
2003-07-31 01:34:02 +08:00
|
|
|
// 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 10:07:59 +08:00
|
|
|
//
|
2017-03-15 16:41:00 +08:00
|
|
|
if (!IgnoreErrors)
|
2016-06-30 05:48:26 +08:00
|
|
|
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!");
|
2017-03-15 16:41:00 +08:00
|
|
|
*Errs << ProgramName << ": CommandLine Error: Option '" << Opt->ArgStr
|
|
|
|
<< "' is all messed up!\n";
|
|
|
|
*Errs << PositionalOpts.size();
|
2016-06-30 05:48:26 +08:00
|
|
|
ErrorParsing = true;
|
2002-07-22 10:07:59 +08:00
|
|
|
}
|
|
|
|
UnboundedFound |= EatsUnboundedNumberOfValues(Opt);
|
|
|
|
}
|
2005-08-09 05:57:27 +08:00
|
|
|
HasUnlimitedPositionals = UnboundedFound || ConsumeAfterOpt;
|
2002-07-22 10:07:59 +08:00
|
|
|
}
|
|
|
|
|
2004-08-14 03:47:30 +08:00
|
|
|
// PositionalVals - A vector of "positional" arguments we accumulate into
|
2009-09-20 08:07:40 +08:00
|
|
|
// the process at the end.
|
2002-07-22 10:07:59 +08:00
|
|
|
//
|
2015-01-14 03:14:20 +08:00
|
|
|
SmallVector<std::pair<StringRef, unsigned>, 4> PositionalVals;
|
2002-07-22 10:07:59 +08:00
|
|
|
|
2003-07-31 01:34:02 +08: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...
|
2014-04-07 12:17:22 +08:00
|
|
|
Option *ActivePositionalArg = nullptr;
|
2003-07-31 01:34:02 +08:00
|
|
|
|
2001-07-24 01:17:47 +08:00
|
|
|
// Loop over all of the arguments... processing them.
|
2015-01-14 03:14:20 +08:00
|
|
|
bool DashDashFound = false; // Have we read '--'?
|
2016-06-30 05:48:26 +08:00
|
|
|
for (int i = FirstArg; i < argc; ++i) {
|
2014-04-07 12:17:22 +08:00
|
|
|
Option *Handler = nullptr;
|
|
|
|
Option *NearestHandler = nullptr;
|
2011-05-02 13:24:47 +08:00
|
|
|
std::string NearestHandlerString;
|
2009-09-20 09:53:12 +08:00
|
|
|
StringRef Value;
|
2009-09-20 10:02:24 +08:00
|
|
|
StringRef ArgName = "";
|
2002-07-22 10:07:59 +08: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-11 05:38:28 +08:00
|
|
|
// itself, or if we have seen "--" already.
|
2002-07-22 10:07:59 +08:00
|
|
|
//
|
|
|
|
if (argv[i][0] != '-' || argv[i][1] == 0 || DashDashFound) {
|
|
|
|
// Positional argument!
|
2003-07-31 01:34:02 +08:00
|
|
|
if (ActivePositionalArg) {
|
2016-10-01 11:43:20 +08:00
|
|
|
ProvidePositionalOption(ActivePositionalArg, StringRef(argv[i]), i);
|
2015-01-14 03:14:20 +08:00
|
|
|
continue; // We are done!
|
2009-09-20 08:40:49 +08:00
|
|
|
}
|
2009-11-20 01:29:36 +08:00
|
|
|
|
2009-09-20 08:40:49 +08:00
|
|
|
if (!PositionalOpts.empty()) {
|
2016-10-01 11:43:20 +08:00
|
|
|
PositionalVals.push_back(std::make_pair(StringRef(argv[i]), i));
|
2002-07-22 10:07:59 +08:00
|
|
|
|
|
|
|
// All of the positional arguments have been fulfulled, give the rest to
|
|
|
|
// the consume after option... if it's specified...
|
|
|
|
//
|
2014-04-09 12:20:00 +08:00
|
|
|
if (PositionalVals.size() >= NumPositionalRequired && ConsumeAfterOpt) {
|
2002-07-22 10:07:59 +08:00
|
|
|
for (++i; i < argc; ++i)
|
2016-10-01 11:43:20 +08:00
|
|
|
PositionalVals.push_back(std::make_pair(StringRef(argv[i]), i));
|
2015-01-14 03:14:20 +08:00
|
|
|
break; // Handle outside of the argument processing loop...
|
2002-07-22 10:07:59 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Delay processing positional arguments until the end...
|
|
|
|
continue;
|
|
|
|
}
|
2004-05-07 06:04:31 +08:00
|
|
|
} else if (argv[i][0] == '-' && argv[i][1] == '-' && argv[i][2] == 0 &&
|
|
|
|
!DashDashFound) {
|
2015-01-14 03:14:20 +08:00
|
|
|
DashDashFound = true; // This is the mythical "--"?
|
|
|
|
continue; // Don't try to process it as an argument itself.
|
2004-05-07 06:04:31 +08:00
|
|
|
} 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.
|
2016-10-01 11:43:20 +08:00
|
|
|
ArgName = StringRef(argv[i] + 1);
|
2009-09-20 13:03:30 +08:00
|
|
|
// Eat leading dashes.
|
|
|
|
while (!ArgName.empty() && ArgName[0] == '-')
|
|
|
|
ArgName = ArgName.substr(1);
|
2009-11-20 01:29:36 +08:00
|
|
|
|
2016-06-30 05:48:26 +08:00
|
|
|
Handler = LookupOption(*ChosenSubCommand, ArgName, Value);
|
2004-05-07 06:04:31 +08:00
|
|
|
if (!Handler || Handler->getFormattingFlag() != cl::Positional) {
|
2016-10-01 11:43:20 +08:00
|
|
|
ProvidePositionalOption(ActivePositionalArg, StringRef(argv[i]), i);
|
2015-01-14 03:14:20 +08:00
|
|
|
continue; // We are done!
|
2002-07-22 10:07:59 +08:00
|
|
|
}
|
|
|
|
|
2015-01-14 03:14:20 +08:00
|
|
|
} else { // We start with a '-', must be an argument.
|
2016-10-01 11:43:20 +08:00
|
|
|
ArgName = StringRef(argv[i] + 1);
|
2009-09-20 13:03:30 +08:00
|
|
|
// Eat leading dashes.
|
|
|
|
while (!ArgName.empty() && ArgName[0] == '-')
|
|
|
|
ArgName = ArgName.substr(1);
|
2009-11-20 01:29:36 +08:00
|
|
|
|
2016-06-30 05:48:26 +08:00
|
|
|
Handler = LookupOption(*ChosenSubCommand, ArgName, Value);
|
2002-07-22 10:07:59 +08:00
|
|
|
|
2004-05-07 06:04:31 +08:00
|
|
|
// Check to see if this "option" is really a prefixed or grouped argument.
|
2014-04-09 12:20:00 +08:00
|
|
|
if (!Handler)
|
2015-01-29 03:00:25 +08:00
|
|
|
Handler = HandlePrefixedOrGroupedOption(ArgName, Value, ErrorParsing,
|
|
|
|
OptionsMap);
|
2011-01-18 09:59:24 +08:00
|
|
|
|
|
|
|
// Otherwise, look for the closest available option to report to the user
|
|
|
|
// in the upcoming error.
|
2014-04-09 12:20:00 +08:00
|
|
|
if (!Handler && SinkOpts.empty())
|
2015-01-14 03:14:20 +08:00
|
|
|
NearestHandler =
|
2015-01-29 03:00:25 +08:00
|
|
|
LookupNearestOption(ArgName, OptionsMap, NearestHandlerString);
|
2001-07-24 01:17:47 +08:00
|
|
|
}
|
|
|
|
|
2014-04-09 12:20:00 +08:00
|
|
|
if (!Handler) {
|
2008-02-20 20:38:07 +08:00
|
|
|
if (SinkOpts.empty()) {
|
2017-03-15 16:41:00 +08:00
|
|
|
*Errs << ProgramName << ": Unknown command line argument '" << argv[i]
|
|
|
|
<< "'. Try: '" << argv[0] << " -help'\n";
|
|
|
|
|
|
|
|
if (NearestHandler) {
|
|
|
|
// If we know a near match, report it as well.
|
|
|
|
*Errs << ProgramName << ": Did you mean '-" << NearestHandlerString
|
|
|
|
<< "'?\n";
|
2011-01-25 01:27:17 +08:00
|
|
|
}
|
2011-01-18 09:59:24 +08:00
|
|
|
|
2008-02-20 20:38:07 +08:00
|
|
|
ErrorParsing = true;
|
|
|
|
} else {
|
2015-01-14 03:14:20 +08:00
|
|
|
for (SmallVectorImpl<Option *>::iterator I = SinkOpts.begin(),
|
|
|
|
E = SinkOpts.end();
|
|
|
|
I != E; ++I)
|
2016-10-01 11:43:20 +08:00
|
|
|
(*I)->addOccurrence(i, "", StringRef(argv[i]));
|
2008-02-20 20:38:07 +08:00
|
|
|
}
|
2001-07-24 01:17:47 +08:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2003-07-31 01:34:02 +08:00
|
|
|
// If this is a named positional argument, just remember that it is the
|
|
|
|
// active one...
|
|
|
|
if (Handler->getFormattingFlag() == cl::Positional)
|
|
|
|
ActivePositionalArg = Handler;
|
2009-09-20 09:49:31 +08:00
|
|
|
else
|
2009-09-20 09:53:12 +08:00
|
|
|
ErrorParsing |= ProvideOption(Handler, ArgName, Value, argc, argv, i);
|
2002-07-22 10:07:59 +08:00
|
|
|
}
|
2001-07-24 01:17:47 +08:00
|
|
|
|
2002-07-22 10:07:59 +08:00
|
|
|
// Check and handle positional arguments now...
|
|
|
|
if (NumPositionalRequired > PositionalVals.size()) {
|
2017-03-15 16:41:00 +08:00
|
|
|
*Errs << ProgramName
|
2016-06-30 05:48:26 +08:00
|
|
|
<< ": Not enough positional command line arguments specified!\n"
|
|
|
|
<< "Must specify at least " << NumPositionalRequired
|
2016-07-22 18:52:21 +08:00
|
|
|
<< " positional argument" << (NumPositionalRequired > 1 ? "s" : "")
|
2017-07-12 09:15:46 +08:00
|
|
|
<< ": See: " << argv[0] << " -help\n";
|
2008-04-29 00:44:25 +08:00
|
|
|
|
2002-07-22 10:07:59 +08:00
|
|
|
ErrorParsing = true;
|
2010-03-25 03:38:02 +08:00
|
|
|
} else if (!HasUnlimitedPositionals &&
|
|
|
|
PositionalVals.size() > PositionalOpts.size()) {
|
2017-03-15 16:41:00 +08:00
|
|
|
*Errs << ProgramName << ": Too many positional arguments specified!\n"
|
|
|
|
<< "Can specify at most " << PositionalOpts.size()
|
|
|
|
<< " positional arguments: See: " << argv[0] << " -help\n";
|
2005-08-09 01:25:38 +08:00
|
|
|
ErrorParsing = true;
|
2002-07-22 10:07:59 +08:00
|
|
|
|
2014-04-09 12:20:00 +08:00
|
|
|
} else if (!ConsumeAfterOpt) {
|
2009-09-20 13:03:30 +08:00
|
|
|
// Positional args have already been handled if ConsumeAfter is specified.
|
2008-05-06 02:30:58 +08:00
|
|
|
unsigned ValNo = 0, NumVals = static_cast<unsigned>(PositionalVals.size());
|
|
|
|
for (size_t i = 0, e = PositionalOpts.size(); i != e; ++i) {
|
2002-07-22 10:07:59 +08:00
|
|
|
if (RequiresValue(PositionalOpts[i])) {
|
2005-04-22 06:55:34 +08:00
|
|
|
ProvidePositionalOption(PositionalOpts[i], PositionalVals[ValNo].first,
|
2004-08-14 03:47:30 +08:00
|
|
|
PositionalVals[ValNo].second);
|
|
|
|
ValNo++;
|
2015-01-14 03:14:20 +08:00
|
|
|
--NumPositionalRequired; // We fulfilled our duty...
|
2002-07-22 10:07:59 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// 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-11 00:49:51 +08:00
|
|
|
bool Done = PositionalOpts[i]->getNumOccurrencesFlag() == cl::Required;
|
2015-01-14 03:14:20 +08:00
|
|
|
while (NumVals - ValNo > NumPositionalRequired && !Done) {
|
2003-07-11 00:49:51 +08:00
|
|
|
switch (PositionalOpts[i]->getNumOccurrencesFlag()) {
|
2002-07-22 10:07:59 +08:00
|
|
|
case cl::Optional:
|
2015-01-14 03:14:20 +08:00
|
|
|
Done = true; // Optional arguments want _at most_ one value
|
2016-08-18 04:30:52 +08:00
|
|
|
LLVM_FALLTHROUGH;
|
2015-01-14 03:14:20 +08:00
|
|
|
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-14 03:47:30 +08:00
|
|
|
ProvidePositionalOption(PositionalOpts[i],
|
|
|
|
PositionalVals[ValNo].first,
|
|
|
|
PositionalVals[ValNo].second);
|
|
|
|
ValNo++;
|
2002-07-22 10:07:59 +08:00
|
|
|
break;
|
|
|
|
default:
|
2009-07-15 00:55:14 +08:00
|
|
|
llvm_unreachable("Internal error, unexpected NumOccurrences flag in "
|
2015-01-14 03:14:20 +08:00
|
|
|
"positional argument processing!");
|
2002-07-22 10:07:59 +08:00
|
|
|
}
|
|
|
|
}
|
2001-10-27 13:54:17 +08:00
|
|
|
}
|
2002-07-22 10:07:59 +08:00
|
|
|
} else {
|
|
|
|
assert(ConsumeAfterOpt && NumPositionalRequired <= PositionalVals.size());
|
|
|
|
unsigned ValNo = 0;
|
2008-05-06 02:30:58 +08:00
|
|
|
for (size_t j = 1, e = PositionalOpts.size(); j != e; ++j)
|
2004-08-14 03:47:30 +08:00
|
|
|
if (RequiresValue(PositionalOpts[j])) {
|
2002-07-25 04:15:13 +08:00
|
|
|
ErrorParsing |= ProvidePositionalOption(PositionalOpts[j],
|
2004-08-14 03:47:30 +08:00
|
|
|
PositionalVals[ValNo].first,
|
|
|
|
PositionalVals[ValNo].second);
|
|
|
|
ValNo++;
|
|
|
|
}
|
2002-07-25 04:15:13 +08: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.
|
|
|
|
//
|
2015-01-29 03:00:25 +08:00
|
|
|
if (PositionalOpts.size() == 1 && ValNo == 0 && !PositionalVals.empty()) {
|
|
|
|
ErrorParsing |= ProvidePositionalOption(PositionalOpts[0],
|
2004-08-14 03:47:30 +08:00
|
|
|
PositionalVals[ValNo].first,
|
|
|
|
PositionalVals[ValNo].second);
|
|
|
|
ValNo++;
|
|
|
|
}
|
2005-04-22 06:55:34 +08:00
|
|
|
|
2002-07-22 10:07:59 +08:00
|
|
|
// Handle over all of the rest of the arguments to the
|
|
|
|
// cl::ConsumeAfter command line option...
|
|
|
|
for (; ValNo != PositionalVals.size(); ++ValNo)
|
2015-01-14 03:14:20 +08:00
|
|
|
ErrorParsing |=
|
|
|
|
ProvidePositionalOption(ConsumeAfterOpt, PositionalVals[ValNo].first,
|
|
|
|
PositionalVals[ValNo].second);
|
2001-07-24 01:17:47 +08:00
|
|
|
}
|
|
|
|
|
2001-07-24 07:02:45 +08:00
|
|
|
// Loop over args and make sure all required args are specified!
|
2015-01-29 03:00:25 +08:00
|
|
|
for (const auto &Opt : OptionsMap) {
|
2014-07-15 03:24:13 +08:00
|
|
|
switch (Opt.second->getNumOccurrencesFlag()) {
|
2001-07-24 07:02:45 +08:00
|
|
|
case Required:
|
|
|
|
case OneOrMore:
|
2014-07-15 03:24:13 +08:00
|
|
|
if (Opt.second->getNumOccurrences() == 0) {
|
|
|
|
Opt.second->error("must be specified at least once!");
|
2001-10-24 14:21:56 +08:00
|
|
|
ErrorParsing = true;
|
|
|
|
}
|
2016-08-18 04:30:52 +08:00
|
|
|
LLVM_FALLTHROUGH;
|
2001-07-24 07:02:45 +08:00
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2001-07-24 01:17:47 +08:00
|
|
|
|
2010-11-20 05:14:29 +08:00
|
|
|
// Now that we know if -debug is specified, we can use it.
|
|
|
|
// Note that if ReadResponseFiles == true, this must be done before the
|
|
|
|
// memory allocated for the expanded command line is free()d below.
|
|
|
|
DEBUG(dbgs() << "Args: ";
|
2015-01-14 03:14:20 +08:00
|
|
|
for (int i = 0; i < argc; ++i) dbgs() << argv[i] << ' ';
|
|
|
|
dbgs() << '\n';);
|
2010-11-20 05:14:29 +08:00
|
|
|
|
2002-07-22 10:07:59 +08:00
|
|
|
// Free all of the memory allocated to the map. Command line options may only
|
|
|
|
// be processed once!
|
2015-01-29 03:00:25 +08:00
|
|
|
MoreHelp.clear();
|
2001-07-24 01:17:47 +08:00
|
|
|
|
|
|
|
// If we had an error processing our arguments, don't let the program execute
|
2016-06-30 05:48:26 +08:00
|
|
|
if (ErrorParsing) {
|
|
|
|
if (!IgnoreErrors)
|
|
|
|
exit(1);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
2001-07-24 01:17:47 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Option Base class implementation
|
|
|
|
//
|
|
|
|
|
2009-09-20 08:40:49 +08:00
|
|
|
bool Option::error(const Twine &Message, StringRef ArgName) {
|
2015-01-14 03:14:20 +08:00
|
|
|
if (!ArgName.data())
|
|
|
|
ArgName = ArgStr;
|
2009-09-20 08:40:49 +08:00
|
|
|
if (ArgName.empty())
|
2015-01-14 03:14:20 +08:00
|
|
|
errs() << HelpStr; // Be nice for positional arguments
|
2002-07-22 10:07:59 +08:00
|
|
|
else
|
2015-01-29 03:00:25 +08:00
|
|
|
errs() << GlobalParser->ProgramName << ": for the -" << ArgName;
|
2008-04-29 00:44:25 +08:00
|
|
|
|
2009-08-23 18:01:13 +08:00
|
|
|
errs() << " option: " << Message << "\n";
|
2001-07-24 01:17:47 +08:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2015-01-14 03:14:20 +08:00
|
|
|
bool Option::addOccurrence(unsigned pos, StringRef ArgName, StringRef Value,
|
|
|
|
bool MultiArg) {
|
2009-01-17 06:54:19 +08:00
|
|
|
if (!MultiArg)
|
2015-01-14 03:14:20 +08:00
|
|
|
NumOccurrences++; // Increment the number of times we have been seen
|
2001-07-24 01:17:47 +08:00
|
|
|
|
2003-07-11 00:49:51 +08:00
|
|
|
switch (getNumOccurrencesFlag()) {
|
2001-07-24 01:17:47 +08:00
|
|
|
case Optional:
|
2003-07-11 00:49:51 +08:00
|
|
|
if (NumOccurrences > 1)
|
2009-08-02 20:13:02 +08:00
|
|
|
return error("may only occur zero or one times!", ArgName);
|
2001-07-24 01:17:47 +08:00
|
|
|
break;
|
|
|
|
case Required:
|
2003-07-11 00:49:51 +08:00
|
|
|
if (NumOccurrences > 1)
|
2009-08-02 20:13:02 +08:00
|
|
|
return error("must occur exactly one time!", ArgName);
|
2016-08-18 04:30:52 +08:00
|
|
|
LLVM_FALLTHROUGH;
|
2001-07-24 01:17:47 +08:00
|
|
|
case OneOrMore:
|
2001-10-27 13:54:17 +08:00
|
|
|
case ZeroOrMore:
|
2015-01-14 03:14:20 +08:00
|
|
|
case ConsumeAfter:
|
|
|
|
break;
|
2001-07-24 01:17:47 +08:00
|
|
|
}
|
|
|
|
|
2004-08-14 03:47:30 +08:00
|
|
|
return handleOccurrence(pos, ArgName, Value);
|
2001-07-24 01:17:47 +08:00
|
|
|
}
|
|
|
|
|
2002-07-22 10:07:59 +08:00
|
|
|
// getValueStr - Get the value description string, using "DefaultMsg" if nothing
|
|
|
|
// has been specified yet.
|
|
|
|
//
|
2015-11-18 03:00:52 +08:00
|
|
|
static StringRef getValueStr(const Option &O, StringRef DefaultMsg) {
|
|
|
|
if (O.ValueStr.empty())
|
2015-01-14 03:14:20 +08:00
|
|
|
return DefaultMsg;
|
2002-07-22 10:07:59 +08:00
|
|
|
return O.ValueStr;
|
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// cl::alias class implementation
|
|
|
|
//
|
|
|
|
|
2001-07-24 01:17:47 +08:00
|
|
|
// Return the width of the option tag for printing...
|
2015-11-18 03:00:52 +08:00
|
|
|
size_t alias::getOptionWidth() const { return ArgStr.size() + 6; }
|
2001-07-24 01:17:47 +08:00
|
|
|
|
Add initial support for debug counting
Summary:
We have support for bisection, and bugpoint can reduce testcases
often to a single pass. But that doesn't help reduce it to a single
transform by a single pass. Which debug counting lets us do.
Debug counting lets you instrument a pass so that it only executes a
certain thing (rwhatever you want) after skipping it a certain time of
times, and then only does a certain number of executions before saying
"skip" again.
To make it concrete, for predicateinfo, if i instrument use renaming,
i can make it so it skips renaming the first N uses, renames the next
N, and then skips the rest.
This lets you narrow down a miscompilation to, often, a single
transformation, and then also debug it (by using the same command line
parameters).
Reviewers: chandlerc, davide, mehdi_amini
Subscribers: mgorny, llvm-commits
Differential Revision: https://reviews.llvm.org/D29998
llvm-svn: 295593
2017-02-19 12:28:56 +08:00
|
|
|
void Option::printHelpStr(StringRef HelpStr, size_t Indent,
|
|
|
|
size_t FirstLineIndentedBy) {
|
2013-05-11 01:15:51 +08:00
|
|
|
std::pair<StringRef, StringRef> Split = HelpStr.split('\n');
|
|
|
|
outs().indent(Indent - FirstLineIndentedBy) << " - " << Split.first << "\n";
|
|
|
|
while (!Split.second.empty()) {
|
|
|
|
Split = Split.second.split('\n');
|
|
|
|
outs().indent(Indent) << Split.first << "\n";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-04-28 13:36:25 +08:00
|
|
|
// Print out the option for the alias.
|
2008-05-06 02:30:58 +08:00
|
|
|
void alias::printOptionInfo(size_t GlobalWidth) const {
|
2011-06-14 04:45:54 +08:00
|
|
|
outs() << " -" << ArgStr;
|
2015-11-18 03:00:52 +08:00
|
|
|
printHelpStr(HelpStr, GlobalWidth, ArgStr.size() + 6);
|
2001-07-24 01:17:47 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
2002-07-22 10:07:59 +08:00
|
|
|
// Parser Implementation code...
|
2001-07-24 01:17:47 +08:00
|
|
|
//
|
|
|
|
|
2002-08-08 02:36:37 +08:00
|
|
|
// basic_parser implementation
|
|
|
|
//
|
|
|
|
|
|
|
|
// Return the width of the option tag for printing...
|
2008-05-06 02:30:58 +08:00
|
|
|
size_t basic_parser_impl::getOptionWidth(const Option &O) const {
|
2015-11-18 03:00:52 +08:00
|
|
|
size_t Len = O.ArgStr.size();
|
2016-10-01 11:43:20 +08:00
|
|
|
auto ValName = getValueName();
|
|
|
|
if (!ValName.empty())
|
2015-11-18 03:00:52 +08:00
|
|
|
Len += getValueStr(O, ValName).size() + 3;
|
2002-08-08 02:36:37 +08:00
|
|
|
|
|
|
|
return Len + 6;
|
|
|
|
}
|
|
|
|
|
2005-04-22 06:55:34 +08:00
|
|
|
// printOptionInfo - Print out information about this option. The
|
2002-08-08 02:36:37 +08:00
|
|
|
// to-be-maintained width is specified.
|
|
|
|
//
|
|
|
|
void basic_parser_impl::printOptionInfo(const Option &O,
|
2008-05-06 02:30:58 +08:00
|
|
|
size_t GlobalWidth) const {
|
2009-08-23 16:43:55 +08:00
|
|
|
outs() << " -" << O.ArgStr;
|
2002-08-08 02:36:37 +08:00
|
|
|
|
2016-10-01 11:43:20 +08:00
|
|
|
auto ValName = getValueName();
|
|
|
|
if (!ValName.empty())
|
2009-08-23 16:43:55 +08:00
|
|
|
outs() << "=<" << getValueStr(O, ValName) << '>';
|
2002-08-08 02:36:37 +08:00
|
|
|
|
Add initial support for debug counting
Summary:
We have support for bisection, and bugpoint can reduce testcases
often to a single pass. But that doesn't help reduce it to a single
transform by a single pass. Which debug counting lets us do.
Debug counting lets you instrument a pass so that it only executes a
certain thing (rwhatever you want) after skipping it a certain time of
times, and then only does a certain number of executions before saying
"skip" again.
To make it concrete, for predicateinfo, if i instrument use renaming,
i can make it so it skips renaming the first N uses, renames the next
N, and then skips the rest.
This lets you narrow down a miscompilation to, often, a single
transformation, and then also debug it (by using the same command line
parameters).
Reviewers: chandlerc, davide, mehdi_amini
Subscribers: mgorny, llvm-commits
Differential Revision: https://reviews.llvm.org/D29998
llvm-svn: 295593
2017-02-19 12:28:56 +08:00
|
|
|
Option::printHelpStr(O.HelpStr, GlobalWidth, getOptionWidth(O));
|
2002-08-08 02:36:37 +08:00
|
|
|
}
|
|
|
|
|
2011-04-06 02:54:36 +08:00
|
|
|
void basic_parser_impl::printOptionName(const Option &O,
|
|
|
|
size_t GlobalWidth) const {
|
|
|
|
outs() << " -" << O.ArgStr;
|
2015-11-18 03:00:52 +08:00
|
|
|
outs().indent(GlobalWidth - O.ArgStr.size());
|
2011-04-06 02:54:36 +08:00
|
|
|
}
|
2002-08-08 02:36:37 +08:00
|
|
|
|
2002-07-22 10:07:59 +08:00
|
|
|
// parser<bool> implementation
|
|
|
|
//
|
2015-01-14 03:14:20 +08:00
|
|
|
bool parser<bool>::parse(Option &O, StringRef ArgName, StringRef Arg,
|
|
|
|
bool &Value) {
|
2005-04-22 06:55:34 +08:00
|
|
|
if (Arg == "" || Arg == "true" || Arg == "TRUE" || Arg == "True" ||
|
2001-07-24 01:17:47 +08:00
|
|
|
Arg == "1") {
|
|
|
|
Value = true;
|
2009-09-20 02:55:05 +08:00
|
|
|
return false;
|
|
|
|
}
|
2009-11-20 01:29:36 +08:00
|
|
|
|
2009-09-20 02:55:05 +08:00
|
|
|
if (Arg == "false" || Arg == "FALSE" || Arg == "False" || Arg == "0") {
|
2001-07-24 01:17:47 +08:00
|
|
|
Value = false;
|
2009-09-20 02:55:05 +08:00
|
|
|
return false;
|
2001-07-24 01:17:47 +08:00
|
|
|
}
|
2009-09-20 02:55:05 +08:00
|
|
|
return O.error("'" + Arg +
|
|
|
|
"' is invalid value for boolean argument! Try 0 or 1");
|
2001-07-24 01:17:47 +08:00
|
|
|
}
|
|
|
|
|
2007-05-23 01:14:46 +08:00
|
|
|
// parser<boolOrDefault> implementation
|
|
|
|
//
|
2015-01-14 03:14:20 +08:00
|
|
|
bool parser<boolOrDefault>::parse(Option &O, StringRef ArgName, StringRef Arg,
|
|
|
|
boolOrDefault &Value) {
|
2007-05-23 01:14:46 +08:00
|
|
|
if (Arg == "" || Arg == "true" || Arg == "TRUE" || Arg == "True" ||
|
|
|
|
Arg == "1") {
|
|
|
|
Value = BOU_TRUE;
|
2009-09-20 02:55:05 +08:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
if (Arg == "false" || Arg == "FALSE" || Arg == "False" || Arg == "0") {
|
2007-05-23 01:14:46 +08:00
|
|
|
Value = BOU_FALSE;
|
2009-09-20 02:55:05 +08:00
|
|
|
return false;
|
2007-05-23 01:14:46 +08:00
|
|
|
}
|
2009-11-20 01:29:36 +08:00
|
|
|
|
2009-09-20 02:55:05 +08:00
|
|
|
return O.error("'" + Arg +
|
|
|
|
"' is invalid value for boolean argument! Try 0 or 1");
|
2007-05-23 01:14:46 +08:00
|
|
|
}
|
|
|
|
|
2002-07-22 10:07:59 +08:00
|
|
|
// parser<int> implementation
|
2001-07-24 01:17:47 +08:00
|
|
|
//
|
2015-01-14 03:14:20 +08:00
|
|
|
bool parser<int>::parse(Option &O, StringRef ArgName, StringRef Arg,
|
|
|
|
int &Value) {
|
2009-09-20 07:59:02 +08:00
|
|
|
if (Arg.getAsInteger(0, Value))
|
2009-08-02 20:13:02 +08:00
|
|
|
return O.error("'" + Arg + "' value invalid for integer argument!");
|
2002-07-22 10:07:59 +08:00
|
|
|
return false;
|
2001-07-24 01:17:47 +08:00
|
|
|
}
|
|
|
|
|
2003-06-28 23:47:20 +08:00
|
|
|
// parser<unsigned> implementation
|
|
|
|
//
|
2015-01-14 03:14:20 +08:00
|
|
|
bool parser<unsigned>::parse(Option &O, StringRef ArgName, StringRef Arg,
|
|
|
|
unsigned &Value) {
|
2009-09-20 07:59:02 +08:00
|
|
|
|
|
|
|
if (Arg.getAsInteger(0, Value))
|
2009-08-02 20:13:02 +08:00
|
|
|
return O.error("'" + Arg + "' value invalid for uint argument!");
|
2003-06-28 23:47:20 +08:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2011-09-16 05:17:37 +08:00
|
|
|
// parser<unsigned long long> implementation
|
|
|
|
//
|
|
|
|
bool parser<unsigned long long>::parse(Option &O, StringRef ArgName,
|
2015-01-14 03:14:20 +08:00
|
|
|
StringRef Arg,
|
|
|
|
unsigned long long &Value) {
|
2011-09-16 05:17:37 +08:00
|
|
|
|
|
|
|
if (Arg.getAsInteger(0, Value))
|
|
|
|
return O.error("'" + Arg + "' value invalid for uint argument!");
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2002-08-08 02:36:37 +08:00
|
|
|
// parser<double>/parser<float> implementation
|
2002-07-22 10:07:59 +08:00
|
|
|
//
|
2009-09-20 02:55:05 +08:00
|
|
|
static bool parseDouble(Option &O, StringRef Arg, double &Value) {
|
2017-06-23 20:55:02 +08:00
|
|
|
if (to_float(Arg, Value))
|
|
|
|
return false;
|
|
|
|
return O.error("'" + Arg + "' value invalid for floating point argument!");
|
2001-07-24 01:17:47 +08:00
|
|
|
}
|
|
|
|
|
2015-01-14 03:14:20 +08:00
|
|
|
bool parser<double>::parse(Option &O, StringRef ArgName, StringRef Arg,
|
|
|
|
double &Val) {
|
2002-08-08 02:36:37 +08:00
|
|
|
return parseDouble(O, Arg, Val);
|
2001-07-24 01:17:47 +08:00
|
|
|
}
|
|
|
|
|
2015-01-14 03:14:20 +08:00
|
|
|
bool parser<float>::parse(Option &O, StringRef ArgName, StringRef Arg,
|
|
|
|
float &Val) {
|
2002-08-08 02:36:37 +08:00
|
|
|
double dVal;
|
|
|
|
if (parseDouble(O, Arg, dVal))
|
|
|
|
return true;
|
|
|
|
Val = (float)dVal;
|
|
|
|
return false;
|
2001-07-24 01:17:47 +08:00
|
|
|
}
|
|
|
|
|
2002-07-22 10:07:59 +08:00
|
|
|
// generic_parser_base implementation
|
2001-07-24 01:17:47 +08:00
|
|
|
//
|
|
|
|
|
2002-07-24 01:15:12 +08:00
|
|
|
// findOption - Return the option number corresponding to the specified
|
|
|
|
// argument string. If the option is not found, getNumOptions() is returned.
|
|
|
|
//
|
2016-10-01 11:43:20 +08:00
|
|
|
unsigned generic_parser_base::findOption(StringRef Name) {
|
2009-09-19 18:01:45 +08:00
|
|
|
unsigned e = getNumOptions();
|
2002-07-24 01:15:12 +08:00
|
|
|
|
2009-09-19 18:01:45 +08:00
|
|
|
for (unsigned i = 0; i != e; ++i) {
|
2016-10-01 11:43:20 +08:00
|
|
|
if (getOption(i) == Name)
|
2002-07-24 01:15:12 +08:00
|
|
|
return i;
|
2009-09-19 18:01:45 +08:00
|
|
|
}
|
2002-07-24 01:15:12 +08:00
|
|
|
return e;
|
|
|
|
}
|
|
|
|
|
2001-07-24 01:17:47 +08:00
|
|
|
// Return the width of the option tag for printing...
|
2008-05-06 02:30:58 +08:00
|
|
|
size_t generic_parser_base::getOptionWidth(const Option &O) const {
|
2002-07-22 10:07:59 +08:00
|
|
|
if (O.hasArgStr()) {
|
2015-11-18 03:00:52 +08:00
|
|
|
size_t Size = O.ArgStr.size() + 6;
|
2002-07-22 10:07:59 +08:00
|
|
|
for (unsigned i = 0, e = getNumOptions(); i != e; ++i)
|
2016-10-01 11:43:20 +08:00
|
|
|
Size = std::max(Size, getOption(i).size() + 8);
|
2002-07-22 10:07:59 +08:00
|
|
|
return Size;
|
|
|
|
} else {
|
2008-05-06 02:30:58 +08:00
|
|
|
size_t BaseSize = 0;
|
2002-07-22 10:07:59 +08:00
|
|
|
for (unsigned i = 0, e = getNumOptions(); i != e; ++i)
|
2016-10-01 11:43:20 +08:00
|
|
|
BaseSize = std::max(BaseSize, getOption(i).size() + 8);
|
2002-07-22 10:07:59 +08:00
|
|
|
return BaseSize;
|
|
|
|
}
|
2001-07-24 01:17:47 +08:00
|
|
|
}
|
|
|
|
|
2005-04-22 06:55:34 +08:00
|
|
|
// printOptionInfo - Print out information about this option. The
|
2001-07-24 01:17:47 +08:00
|
|
|
// to-be-maintained width is specified.
|
|
|
|
//
|
2002-07-22 10:07:59 +08:00
|
|
|
void generic_parser_base::printOptionInfo(const Option &O,
|
2008-05-06 02:30:58 +08:00
|
|
|
size_t GlobalWidth) const {
|
2002-07-22 10:07:59 +08:00
|
|
|
if (O.hasArgStr()) {
|
2009-09-20 13:03:30 +08:00
|
|
|
outs() << " -" << O.ArgStr;
|
Add initial support for debug counting
Summary:
We have support for bisection, and bugpoint can reduce testcases
often to a single pass. But that doesn't help reduce it to a single
transform by a single pass. Which debug counting lets us do.
Debug counting lets you instrument a pass so that it only executes a
certain thing (rwhatever you want) after skipping it a certain time of
times, and then only does a certain number of executions before saying
"skip" again.
To make it concrete, for predicateinfo, if i instrument use renaming,
i can make it so it skips renaming the first N uses, renames the next
N, and then skips the rest.
This lets you narrow down a miscompilation to, often, a single
transformation, and then also debug it (by using the same command line
parameters).
Reviewers: chandlerc, davide, mehdi_amini
Subscribers: mgorny, llvm-commits
Differential Revision: https://reviews.llvm.org/D29998
llvm-svn: 295593
2017-02-19 12:28:56 +08:00
|
|
|
Option::printHelpStr(O.HelpStr, GlobalWidth, O.ArgStr.size() + 6);
|
2002-07-22 10:07:59 +08:00
|
|
|
|
|
|
|
for (unsigned i = 0, e = getNumOptions(); i != e; ++i) {
|
2016-10-01 11:43:20 +08:00
|
|
|
size_t NumSpaces = GlobalWidth - getOption(i).size() - 8;
|
2009-09-20 13:03:30 +08:00
|
|
|
outs() << " =" << getOption(i);
|
|
|
|
outs().indent(NumSpaces) << " - " << getDescription(i) << '\n';
|
2002-07-22 10:07:59 +08:00
|
|
|
}
|
|
|
|
} else {
|
2015-11-18 03:00:52 +08:00
|
|
|
if (!O.HelpStr.empty())
|
2009-09-20 13:03:30 +08:00
|
|
|
outs() << " " << O.HelpStr << '\n';
|
2002-07-22 10:07:59 +08:00
|
|
|
for (unsigned i = 0, e = getNumOptions(); i != e; ++i) {
|
2016-10-01 11:43:20 +08:00
|
|
|
auto Option = getOption(i);
|
2013-05-11 01:15:51 +08:00
|
|
|
outs() << " -" << Option;
|
Add initial support for debug counting
Summary:
We have support for bisection, and bugpoint can reduce testcases
often to a single pass. But that doesn't help reduce it to a single
transform by a single pass. Which debug counting lets us do.
Debug counting lets you instrument a pass so that it only executes a
certain thing (rwhatever you want) after skipping it a certain time of
times, and then only does a certain number of executions before saying
"skip" again.
To make it concrete, for predicateinfo, if i instrument use renaming,
i can make it so it skips renaming the first N uses, renames the next
N, and then skips the rest.
This lets you narrow down a miscompilation to, often, a single
transformation, and then also debug it (by using the same command line
parameters).
Reviewers: chandlerc, davide, mehdi_amini
Subscribers: mgorny, llvm-commits
Differential Revision: https://reviews.llvm.org/D29998
llvm-svn: 295593
2017-02-19 12:28:56 +08:00
|
|
|
Option::printHelpStr(getDescription(i), GlobalWidth, Option.size() + 8);
|
2002-07-22 10:07:59 +08:00
|
|
|
}
|
2001-07-24 01:17:47 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-04-06 02:54:36 +08:00
|
|
|
static const size_t MaxOptWidth = 8; // arbitrary spacing for printOptionDiff
|
|
|
|
|
|
|
|
// printGenericOptionDiff - Print the value of this option and it's default.
|
|
|
|
//
|
|
|
|
// "Generic" options have each value mapped to a name.
|
2015-01-14 03:14:20 +08:00
|
|
|
void generic_parser_base::printGenericOptionDiff(
|
|
|
|
const Option &O, const GenericOptionValue &Value,
|
|
|
|
const GenericOptionValue &Default, size_t GlobalWidth) const {
|
2011-04-06 02:54:36 +08:00
|
|
|
outs() << " -" << O.ArgStr;
|
2015-11-18 03:00:52 +08:00
|
|
|
outs().indent(GlobalWidth - O.ArgStr.size());
|
2011-04-06 02:54:36 +08:00
|
|
|
|
|
|
|
unsigned NumOpts = getNumOptions();
|
|
|
|
for (unsigned i = 0; i != NumOpts; ++i) {
|
|
|
|
if (Value.compare(getOptionValue(i)))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
outs() << "= " << getOption(i);
|
2016-10-01 11:43:20 +08:00
|
|
|
size_t L = getOption(i).size();
|
2011-04-06 02:54:36 +08:00
|
|
|
size_t NumSpaces = MaxOptWidth > L ? MaxOptWidth - L : 0;
|
|
|
|
outs().indent(NumSpaces) << " (default: ";
|
|
|
|
for (unsigned j = 0; j != NumOpts; ++j) {
|
|
|
|
if (Default.compare(getOptionValue(j)))
|
|
|
|
continue;
|
|
|
|
outs() << getOption(j);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
outs() << ")\n";
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
outs() << "= *unknown option value*\n";
|
|
|
|
}
|
|
|
|
|
|
|
|
// printOptionDiff - Specializations for printing basic value types.
|
|
|
|
//
|
2015-01-14 03:14:20 +08:00
|
|
|
#define PRINT_OPT_DIFF(T) \
|
|
|
|
void parser<T>::printOptionDiff(const Option &O, T V, OptionValue<T> D, \
|
|
|
|
size_t GlobalWidth) const { \
|
|
|
|
printOptionName(O, GlobalWidth); \
|
|
|
|
std::string Str; \
|
|
|
|
{ \
|
|
|
|
raw_string_ostream SS(Str); \
|
|
|
|
SS << V; \
|
|
|
|
} \
|
|
|
|
outs() << "= " << Str; \
|
|
|
|
size_t NumSpaces = \
|
|
|
|
MaxOptWidth > Str.size() ? MaxOptWidth - Str.size() : 0; \
|
|
|
|
outs().indent(NumSpaces) << " (default: "; \
|
|
|
|
if (D.hasValue()) \
|
|
|
|
outs() << D.getValue(); \
|
|
|
|
else \
|
|
|
|
outs() << "*no default*"; \
|
|
|
|
outs() << ")\n"; \
|
|
|
|
}
|
2011-04-06 02:54:36 +08:00
|
|
|
|
2011-04-06 20:29:56 +08:00
|
|
|
PRINT_OPT_DIFF(bool)
|
|
|
|
PRINT_OPT_DIFF(boolOrDefault)
|
|
|
|
PRINT_OPT_DIFF(int)
|
|
|
|
PRINT_OPT_DIFF(unsigned)
|
2011-09-16 05:17:37 +08:00
|
|
|
PRINT_OPT_DIFF(unsigned long long)
|
2011-04-06 20:29:56 +08:00
|
|
|
PRINT_OPT_DIFF(double)
|
|
|
|
PRINT_OPT_DIFF(float)
|
|
|
|
PRINT_OPT_DIFF(char)
|
2011-04-06 02:54:36 +08:00
|
|
|
|
2015-01-14 03:14:20 +08:00
|
|
|
void parser<std::string>::printOptionDiff(const Option &O, StringRef V,
|
2016-06-09 03:09:22 +08:00
|
|
|
const OptionValue<std::string> &D,
|
2015-01-14 03:14:20 +08:00
|
|
|
size_t GlobalWidth) const {
|
2011-04-06 02:54:36 +08:00
|
|
|
printOptionName(O, GlobalWidth);
|
|
|
|
outs() << "= " << V;
|
|
|
|
size_t NumSpaces = MaxOptWidth > V.size() ? MaxOptWidth - V.size() : 0;
|
|
|
|
outs().indent(NumSpaces) << " (default: ";
|
|
|
|
if (D.hasValue())
|
|
|
|
outs() << D.getValue();
|
|
|
|
else
|
|
|
|
outs() << "*no default*";
|
|
|
|
outs() << ")\n";
|
|
|
|
}
|
|
|
|
|
|
|
|
// Print a placeholder for options that don't yet support printOptionDiff().
|
2015-01-14 03:14:20 +08:00
|
|
|
void basic_parser_impl::printOptionNoValue(const Option &O,
|
|
|
|
size_t GlobalWidth) const {
|
2011-04-06 02:54:36 +08:00
|
|
|
printOptionName(O, GlobalWidth);
|
|
|
|
outs() << "= *cannot print option value*\n";
|
|
|
|
}
|
2001-07-24 01:17:47 +08:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
2010-02-18 22:08:13 +08:00
|
|
|
// -help and -help-hidden option implementation
|
2001-07-24 01:17:47 +08:00
|
|
|
//
|
2004-11-15 06:04:00 +08:00
|
|
|
|
2015-03-14 08:20:13 +08:00
|
|
|
static int OptNameCompare(const std::pair<const char *, Option *> *LHS,
|
|
|
|
const std::pair<const char *, Option *> *RHS) {
|
|
|
|
return strcmp(LHS->first, RHS->first);
|
2009-09-20 13:37:24 +08:00
|
|
|
}
|
|
|
|
|
2016-06-30 05:48:26 +08:00
|
|
|
static int SubNameCompare(const std::pair<const char *, SubCommand *> *LHS,
|
|
|
|
const std::pair<const char *, SubCommand *> *RHS) {
|
|
|
|
return strcmp(LHS->first, RHS->first);
|
|
|
|
}
|
|
|
|
|
2011-04-06 02:54:36 +08:00
|
|
|
// Copy Options into a vector so we can sort them as we like.
|
2015-01-14 03:14:20 +08:00
|
|
|
static void sortOpts(StringMap<Option *> &OptMap,
|
|
|
|
SmallVectorImpl<std::pair<const char *, Option *>> &Opts,
|
|
|
|
bool ShowHidden) {
|
2016-01-30 09:24:31 +08:00
|
|
|
SmallPtrSet<Option *, 32> OptionSet; // Duplicate option detection.
|
2011-04-06 02:54:36 +08:00
|
|
|
|
2015-01-14 03:14:20 +08:00
|
|
|
for (StringMap<Option *>::iterator I = OptMap.begin(), E = OptMap.end();
|
2011-04-06 02:54:36 +08:00
|
|
|
I != E; ++I) {
|
|
|
|
// Ignore really-hidden options.
|
|
|
|
if (I->second->getOptionHiddenFlag() == ReallyHidden)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
// Unless showhidden is set, ignore hidden flags.
|
|
|
|
if (I->second->getOptionHiddenFlag() == Hidden && !ShowHidden)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
// If we've already seen this option, don't add it to the list again.
|
2014-11-19 15:49:26 +08:00
|
|
|
if (!OptionSet.insert(I->second).second)
|
2011-04-06 02:54:36 +08:00
|
|
|
continue;
|
|
|
|
|
2015-01-14 03:14:20 +08:00
|
|
|
Opts.push_back(
|
|
|
|
std::pair<const char *, Option *>(I->getKey().data(), I->second));
|
2011-04-06 02:54:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Sort the options list alphabetically.
|
2015-03-14 08:20:13 +08:00
|
|
|
array_pod_sort(Opts.begin(), Opts.end(), OptNameCompare);
|
2011-04-06 02:54:36 +08:00
|
|
|
}
|
|
|
|
|
2016-06-30 05:48:26 +08:00
|
|
|
static void
|
|
|
|
sortSubCommands(const SmallPtrSetImpl<SubCommand *> &SubMap,
|
|
|
|
SmallVectorImpl<std::pair<const char *, SubCommand *>> &Subs) {
|
|
|
|
for (const auto &S : SubMap) {
|
2016-10-01 11:43:20 +08:00
|
|
|
if (S->getName().empty())
|
2016-06-30 05:48:26 +08:00
|
|
|
continue;
|
2016-10-01 11:43:20 +08:00
|
|
|
Subs.push_back(std::make_pair(S->getName().data(), S));
|
2016-06-30 05:48:26 +08:00
|
|
|
}
|
|
|
|
array_pod_sort(Subs.begin(), Subs.end(), SubNameCompare);
|
|
|
|
}
|
|
|
|
|
2001-07-24 01:17:47 +08:00
|
|
|
namespace {
|
|
|
|
|
2002-07-22 10:07:59 +08:00
|
|
|
class HelpPrinter {
|
2013-05-07 05:56:23 +08:00
|
|
|
protected:
|
2001-07-24 01:17:47 +08:00
|
|
|
const bool ShowHidden;
|
2015-01-14 03:14:20 +08:00
|
|
|
typedef SmallVector<std::pair<const char *, Option *>, 128>
|
|
|
|
StrOptionPairVector;
|
2016-06-30 05:48:26 +08:00
|
|
|
typedef SmallVector<std::pair<const char *, SubCommand *>, 128>
|
|
|
|
StrSubCommandPairVector;
|
2013-05-07 05:56:23 +08:00
|
|
|
// Print the options. Opts is assumed to be alphabetically sorted.
|
|
|
|
virtual void printOptions(StrOptionPairVector &Opts, size_t MaxArgLen) {
|
|
|
|
for (size_t i = 0, e = Opts.size(); i != e; ++i)
|
|
|
|
Opts[i].second->printOptionInfo(MaxArgLen);
|
|
|
|
}
|
2001-07-24 01:17:47 +08:00
|
|
|
|
2016-06-30 05:48:26 +08:00
|
|
|
void printSubCommands(StrSubCommandPairVector &Subs, size_t MaxSubLen) {
|
|
|
|
for (const auto &S : Subs) {
|
|
|
|
outs() << " " << S.first;
|
2016-10-01 11:43:20 +08:00
|
|
|
if (!S.second->getDescription().empty()) {
|
2016-06-30 05:48:26 +08:00
|
|
|
outs().indent(MaxSubLen - strlen(S.first));
|
|
|
|
outs() << " - " << S.second->getDescription();
|
|
|
|
}
|
|
|
|
outs() << "\n";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-07-22 10:07:59 +08:00
|
|
|
public:
|
2013-03-10 07:29:37 +08:00
|
|
|
explicit HelpPrinter(bool showHidden) : ShowHidden(showHidden) {}
|
2013-05-07 05:56:23 +08:00
|
|
|
virtual ~HelpPrinter() {}
|
2002-07-22 10:07:59 +08:00
|
|
|
|
2013-05-07 05:56:23 +08:00
|
|
|
// Invoke the printer.
|
2002-07-22 10:07:59 +08:00
|
|
|
void operator=(bool Value) {
|
2015-03-09 09:57:13 +08:00
|
|
|
if (!Value)
|
2015-01-14 03:14:20 +08:00
|
|
|
return;
|
2017-09-08 07:30:48 +08:00
|
|
|
printHelp();
|
2002-07-22 10:07:59 +08:00
|
|
|
|
2017-09-08 07:30:48 +08:00
|
|
|
// Halt the program since help information was printed
|
|
|
|
exit(0);
|
|
|
|
}
|
|
|
|
|
|
|
|
void printHelp() {
|
2016-06-30 05:48:26 +08:00
|
|
|
SubCommand *Sub = GlobalParser->getActiveSubCommand();
|
|
|
|
auto &OptionsMap = Sub->OptionsMap;
|
|
|
|
auto &PositionalOpts = Sub->PositionalOpts;
|
|
|
|
auto &ConsumeAfterOpt = Sub->ConsumeAfterOpt;
|
|
|
|
|
2013-05-07 05:56:23 +08:00
|
|
|
StrOptionPairVector Opts;
|
2016-06-30 05:48:26 +08:00
|
|
|
sortOpts(OptionsMap, Opts, ShowHidden);
|
|
|
|
|
|
|
|
StrSubCommandPairVector Subs;
|
|
|
|
sortSubCommands(GlobalParser->RegisteredSubCommands, Subs);
|
2001-07-24 01:17:47 +08:00
|
|
|
|
2016-10-01 11:43:20 +08:00
|
|
|
if (!GlobalParser->ProgramOverview.empty())
|
2015-01-29 03:00:25 +08:00
|
|
|
outs() << "OVERVIEW: " << GlobalParser->ProgramOverview << "\n";
|
2002-07-22 10:07:59 +08:00
|
|
|
|
2016-10-11 23:58:48 +08:00
|
|
|
if (Sub == &*TopLevelSubCommand) {
|
|
|
|
outs() << "USAGE: " << GlobalParser->ProgramName;
|
|
|
|
if (Subs.size() > 2)
|
|
|
|
outs() << " [subcommand]";
|
|
|
|
outs() << " [options]";
|
|
|
|
} else {
|
2016-10-01 11:43:20 +08:00
|
|
|
if (!Sub->getDescription().empty()) {
|
2016-06-30 05:48:26 +08:00
|
|
|
outs() << "SUBCOMMAND '" << Sub->getName()
|
|
|
|
<< "': " << Sub->getDescription() << "\n\n";
|
|
|
|
}
|
|
|
|
outs() << "USAGE: " << GlobalParser->ProgramName << " " << Sub->getName()
|
|
|
|
<< " [options]";
|
|
|
|
}
|
2007-04-07 05:06:55 +08:00
|
|
|
|
2016-06-30 05:48:26 +08:00
|
|
|
for (auto Opt : PositionalOpts) {
|
2015-11-18 03:00:52 +08:00
|
|
|
if (Opt->hasArgStr())
|
2015-01-29 03:00:25 +08:00
|
|
|
outs() << " --" << Opt->ArgStr;
|
|
|
|
outs() << " " << Opt->HelpStr;
|
2003-07-31 01:34:02 +08:00
|
|
|
}
|
2002-07-22 10:07:59 +08:00
|
|
|
|
|
|
|
// Print the consume after option info if it exists...
|
2016-06-30 05:48:26 +08:00
|
|
|
if (ConsumeAfterOpt)
|
|
|
|
outs() << " " << ConsumeAfterOpt->HelpStr;
|
|
|
|
|
2016-10-12 18:04:35 +08:00
|
|
|
if (Sub == &*TopLevelSubCommand && !Subs.empty()) {
|
2016-06-30 05:48:26 +08:00
|
|
|
// Compute the maximum subcommand length...
|
|
|
|
size_t MaxSubLen = 0;
|
|
|
|
for (size_t i = 0, e = Subs.size(); i != e; ++i)
|
|
|
|
MaxSubLen = std::max(MaxSubLen, strlen(Subs[i].first));
|
|
|
|
|
|
|
|
outs() << "\n\n";
|
|
|
|
outs() << "SUBCOMMANDS:\n\n";
|
|
|
|
printSubCommands(Subs, MaxSubLen);
|
|
|
|
outs() << "\n";
|
|
|
|
outs() << " Type \"" << GlobalParser->ProgramName
|
|
|
|
<< " <subcommand> -help\" to get more help on a specific "
|
|
|
|
"subcommand";
|
|
|
|
}
|
2002-07-22 10:07:59 +08:00
|
|
|
|
2009-08-23 16:43:55 +08:00
|
|
|
outs() << "\n\n";
|
2001-07-24 01:17:47 +08:00
|
|
|
|
|
|
|
// Compute the maximum argument length...
|
2013-03-10 07:29:37 +08:00
|
|
|
size_t MaxArgLen = 0;
|
2008-05-06 02:30:58 +08:00
|
|
|
for (size_t i = 0, e = Opts.size(); i != e; ++i)
|
2009-09-20 13:37:24 +08:00
|
|
|
MaxArgLen = std::max(MaxArgLen, Opts[i].second->getOptionWidth());
|
2001-07-24 01:17:47 +08:00
|
|
|
|
2009-08-23 16:43:55 +08:00
|
|
|
outs() << "OPTIONS:\n";
|
2013-05-07 05:56:23 +08:00
|
|
|
printOptions(Opts, MaxArgLen);
|
2001-07-24 01:17:47 +08:00
|
|
|
|
2004-11-20 01:08:15 +08:00
|
|
|
// Print any extra help the user has declared.
|
2015-01-29 03:00:25 +08:00
|
|
|
for (auto I : GlobalParser->MoreHelp)
|
|
|
|
outs() << I;
|
|
|
|
GlobalParser->MoreHelp.clear();
|
2001-07-24 01:17:47 +08:00
|
|
|
}
|
2002-07-22 10:07:59 +08:00
|
|
|
};
|
2013-05-07 05:56:23 +08:00
|
|
|
|
|
|
|
class CategorizedHelpPrinter : public HelpPrinter {
|
|
|
|
public:
|
|
|
|
explicit CategorizedHelpPrinter(bool showHidden) : HelpPrinter(showHidden) {}
|
|
|
|
|
|
|
|
// Helper function for printOptions().
|
2015-03-14 08:20:13 +08:00
|
|
|
// It shall return a negative value if A's name should be lexicographically
|
2017-03-27 21:43:24 +08:00
|
|
|
// ordered before B's name. It returns a value greater than zero if B's name
|
|
|
|
// should be ordered before A's name, and it returns 0 otherwise.
|
2015-03-14 08:20:13 +08:00
|
|
|
static int OptionCategoryCompare(OptionCategory *const *A,
|
|
|
|
OptionCategory *const *B) {
|
2017-03-27 21:43:24 +08:00
|
|
|
return (*A)->getName().compare((*B)->getName());
|
2013-05-07 05:56:23 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Make sure we inherit our base class's operator=()
|
2015-01-14 03:14:20 +08:00
|
|
|
using HelpPrinter::operator=;
|
2013-05-07 05:56:23 +08:00
|
|
|
|
|
|
|
protected:
|
2014-03-04 14:24:11 +08:00
|
|
|
void printOptions(StrOptionPairVector &Opts, size_t MaxArgLen) override {
|
2013-05-07 05:56:23 +08:00
|
|
|
std::vector<OptionCategory *> SortedCategories;
|
2015-01-14 03:14:20 +08:00
|
|
|
std::map<OptionCategory *, std::vector<Option *>> CategorizedOptions;
|
2013-05-07 05:56:23 +08:00
|
|
|
|
2014-01-25 01:20:08 +08:00
|
|
|
// Collect registered option categories into vector in preparation for
|
2013-05-07 05:56:23 +08:00
|
|
|
// sorting.
|
2015-02-14 06:54:32 +08:00
|
|
|
for (auto I = GlobalParser->RegisteredOptionCategories.begin(),
|
|
|
|
E = GlobalParser->RegisteredOptionCategories.end();
|
2014-02-08 01:42:30 +08:00
|
|
|
I != E; ++I) {
|
2013-05-07 05:56:23 +08:00
|
|
|
SortedCategories.push_back(*I);
|
2014-02-08 01:42:30 +08:00
|
|
|
}
|
2013-05-07 05:56:23 +08:00
|
|
|
|
|
|
|
// Sort the different option categories alphabetically.
|
|
|
|
assert(SortedCategories.size() > 0 && "No option categories registered!");
|
2015-03-14 08:20:13 +08:00
|
|
|
array_pod_sort(SortedCategories.begin(), SortedCategories.end(),
|
|
|
|
OptionCategoryCompare);
|
2013-05-07 05:56:23 +08:00
|
|
|
|
|
|
|
// Create map to empty vectors.
|
|
|
|
for (std::vector<OptionCategory *>::const_iterator
|
|
|
|
I = SortedCategories.begin(),
|
|
|
|
E = SortedCategories.end();
|
|
|
|
I != E; ++I)
|
|
|
|
CategorizedOptions[*I] = std::vector<Option *>();
|
|
|
|
|
|
|
|
// Walk through pre-sorted options and assign into categories.
|
|
|
|
// Because the options are already alphabetically sorted the
|
|
|
|
// options within categories will also be alphabetically sorted.
|
|
|
|
for (size_t I = 0, E = Opts.size(); I != E; ++I) {
|
|
|
|
Option *Opt = Opts[I].second;
|
|
|
|
assert(CategorizedOptions.count(Opt->Category) > 0 &&
|
|
|
|
"Option has an unregistered category");
|
|
|
|
CategorizedOptions[Opt->Category].push_back(Opt);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Now do printing.
|
|
|
|
for (std::vector<OptionCategory *>::const_iterator
|
|
|
|
Category = SortedCategories.begin(),
|
|
|
|
E = SortedCategories.end();
|
|
|
|
Category != E; ++Category) {
|
|
|
|
// Hide empty categories for -help, but show for -help-hidden.
|
2016-06-18 02:59:41 +08:00
|
|
|
const auto &CategoryOptions = CategorizedOptions[*Category];
|
|
|
|
bool IsEmptyCategory = CategoryOptions.empty();
|
2013-05-07 05:56:23 +08:00
|
|
|
if (!ShowHidden && IsEmptyCategory)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
// Print category information.
|
|
|
|
outs() << "\n";
|
|
|
|
outs() << (*Category)->getName() << ":\n";
|
|
|
|
|
|
|
|
// Check if description is set.
|
2016-10-01 11:43:20 +08:00
|
|
|
if (!(*Category)->getDescription().empty())
|
2013-05-07 05:56:23 +08:00
|
|
|
outs() << (*Category)->getDescription() << "\n\n";
|
|
|
|
else
|
|
|
|
outs() << "\n";
|
|
|
|
|
|
|
|
// When using -help-hidden explicitly state if the category has no
|
|
|
|
// options associated with it.
|
|
|
|
if (IsEmptyCategory) {
|
|
|
|
outs() << " This option category has no options.\n";
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
// Loop over the options in the category and print.
|
2016-06-18 02:59:41 +08:00
|
|
|
for (const Option *Opt : CategoryOptions)
|
|
|
|
Opt->printOptionInfo(MaxArgLen);
|
2013-05-07 05:56:23 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
// This wraps the Uncategorizing and Categorizing printers and decides
|
|
|
|
// at run time which should be invoked.
|
|
|
|
class HelpPrinterWrapper {
|
|
|
|
private:
|
|
|
|
HelpPrinter &UncategorizedPrinter;
|
|
|
|
CategorizedHelpPrinter &CategorizedPrinter;
|
|
|
|
|
|
|
|
public:
|
|
|
|
explicit HelpPrinterWrapper(HelpPrinter &UncategorizedPrinter,
|
2015-01-14 03:14:20 +08:00
|
|
|
CategorizedHelpPrinter &CategorizedPrinter)
|
|
|
|
: UncategorizedPrinter(UncategorizedPrinter),
|
|
|
|
CategorizedPrinter(CategorizedPrinter) {}
|
2013-05-07 05:56:23 +08:00
|
|
|
|
|
|
|
// Invoke the printer.
|
|
|
|
void operator=(bool Value);
|
|
|
|
};
|
|
|
|
|
2006-10-13 06:09:17 +08:00
|
|
|
} // End anonymous namespace
|
2001-07-24 01:17:47 +08:00
|
|
|
|
2013-05-07 05:56:23 +08:00
|
|
|
// Declare the four HelpPrinter instances that are used to print out help, or
|
|
|
|
// help-hidden as an uncategorized list or in categories.
|
|
|
|
static HelpPrinter UncategorizedNormalPrinter(false);
|
|
|
|
static HelpPrinter UncategorizedHiddenPrinter(true);
|
|
|
|
static CategorizedHelpPrinter CategorizedNormalPrinter(false);
|
|
|
|
static CategorizedHelpPrinter CategorizedHiddenPrinter(true);
|
|
|
|
|
|
|
|
// Declare HelpPrinter wrappers that will decide whether or not to invoke
|
|
|
|
// a categorizing help printer
|
|
|
|
static HelpPrinterWrapper WrappedNormalPrinter(UncategorizedNormalPrinter,
|
|
|
|
CategorizedNormalPrinter);
|
|
|
|
static HelpPrinterWrapper WrappedHiddenPrinter(UncategorizedHiddenPrinter,
|
|
|
|
CategorizedHiddenPrinter);
|
|
|
|
|
2015-01-27 00:56:00 +08:00
|
|
|
// Define a category for generic options that all tools should have.
|
|
|
|
static cl::OptionCategory GenericCategory("Generic Options");
|
|
|
|
|
2013-05-07 05:56:23 +08:00
|
|
|
// Define uncategorized help printers.
|
|
|
|
// -help-list is hidden by default because if Option categories are being used
|
|
|
|
// then -help behaves the same as -help-list.
|
2015-01-14 03:14:20 +08:00
|
|
|
static cl::opt<HelpPrinter, true, parser<bool>> HLOp(
|
|
|
|
"help-list",
|
|
|
|
cl::desc("Display list of available options (-help-list-hidden for more)"),
|
2015-01-27 00:56:00 +08:00
|
|
|
cl::location(UncategorizedNormalPrinter), cl::Hidden, cl::ValueDisallowed,
|
2016-06-30 05:48:26 +08:00
|
|
|
cl::cat(GenericCategory), cl::sub(*AllSubCommands));
|
2001-07-24 01:17:47 +08:00
|
|
|
|
2015-01-14 03:14:20 +08:00
|
|
|
static cl::opt<HelpPrinter, true, parser<bool>>
|
|
|
|
HLHOp("help-list-hidden", cl::desc("Display list of all available options"),
|
|
|
|
cl::location(UncategorizedHiddenPrinter), cl::Hidden,
|
2016-06-30 05:48:26 +08:00
|
|
|
cl::ValueDisallowed, cl::cat(GenericCategory),
|
|
|
|
cl::sub(*AllSubCommands));
|
2013-05-07 05:56:23 +08:00
|
|
|
|
|
|
|
// Define uncategorized/categorized help printers. These printers change their
|
|
|
|
// behaviour at runtime depending on whether one or more Option categories have
|
|
|
|
// been declared.
|
2015-01-14 03:14:20 +08:00
|
|
|
static cl::opt<HelpPrinterWrapper, true, parser<bool>>
|
|
|
|
HOp("help", cl::desc("Display available options (-help-hidden for more)"),
|
2015-01-27 00:56:00 +08:00
|
|
|
cl::location(WrappedNormalPrinter), cl::ValueDisallowed,
|
2016-06-30 05:48:26 +08:00
|
|
|
cl::cat(GenericCategory), cl::sub(*AllSubCommands));
|
2013-05-07 05:56:23 +08:00
|
|
|
|
2015-01-14 03:14:20 +08:00
|
|
|
static cl::opt<HelpPrinterWrapper, true, parser<bool>>
|
|
|
|
HHOp("help-hidden", cl::desc("Display all available options"),
|
2015-01-27 00:56:00 +08:00
|
|
|
cl::location(WrappedHiddenPrinter), cl::Hidden, cl::ValueDisallowed,
|
2016-06-30 05:48:26 +08:00
|
|
|
cl::cat(GenericCategory), cl::sub(*AllSubCommands));
|
2013-05-07 05:56:23 +08:00
|
|
|
|
2015-01-14 03:14:20 +08:00
|
|
|
static cl::opt<bool> PrintOptions(
|
|
|
|
"print-options",
|
|
|
|
cl::desc("Print non-default options after command line parsing"),
|
2016-06-30 05:48:26 +08:00
|
|
|
cl::Hidden, cl::init(false), cl::cat(GenericCategory),
|
|
|
|
cl::sub(*AllSubCommands));
|
2001-07-24 01:17:47 +08:00
|
|
|
|
2015-01-14 03:14:20 +08:00
|
|
|
static cl::opt<bool> PrintAllOptions(
|
|
|
|
"print-all-options",
|
|
|
|
cl::desc("Print all option values after command line parsing"), cl::Hidden,
|
2016-06-30 05:48:26 +08:00
|
|
|
cl::init(false), cl::cat(GenericCategory), cl::sub(*AllSubCommands));
|
2011-04-06 02:54:36 +08:00
|
|
|
|
2013-05-07 05:56:23 +08:00
|
|
|
void HelpPrinterWrapper::operator=(bool Value) {
|
2015-03-09 09:57:13 +08:00
|
|
|
if (!Value)
|
2013-05-07 05:56:23 +08:00
|
|
|
return;
|
|
|
|
|
|
|
|
// Decide which printer to invoke. If more than one option category is
|
|
|
|
// registered then it is useful to show the categorized help instead of
|
|
|
|
// uncategorized help.
|
2015-02-14 06:54:32 +08:00
|
|
|
if (GlobalParser->RegisteredOptionCategories.size() > 1) {
|
2013-05-07 05:56:23 +08:00
|
|
|
// unhide -help-list option so user can have uncategorized output if they
|
|
|
|
// want it.
|
|
|
|
HLOp.setHiddenFlag(NotHidden);
|
|
|
|
|
|
|
|
CategorizedPrinter = true; // Invoke categorized printer
|
2015-01-14 03:14:20 +08:00
|
|
|
} else
|
2013-05-07 05:56:23 +08:00
|
|
|
UncategorizedPrinter = true; // Invoke uncategorized printer
|
|
|
|
}
|
|
|
|
|
2011-04-06 02:54:36 +08:00
|
|
|
// Print the value of each option.
|
2015-01-31 06:16:01 +08:00
|
|
|
void cl::PrintOptionValues() { GlobalParser->printOptionValues(); }
|
|
|
|
|
|
|
|
void CommandLineParser::printOptionValues() {
|
2015-01-14 03:14:20 +08:00
|
|
|
if (!PrintOptions && !PrintAllOptions)
|
|
|
|
return;
|
2011-04-06 02:54:36 +08:00
|
|
|
|
2015-01-14 03:14:20 +08:00
|
|
|
SmallVector<std::pair<const char *, Option *>, 128> Opts;
|
2016-06-30 05:48:26 +08:00
|
|
|
sortOpts(ActiveSubCommand->OptionsMap, Opts, /*ShowHidden*/ true);
|
2011-04-06 02:54:36 +08:00
|
|
|
|
|
|
|
// Compute the maximum argument length...
|
|
|
|
size_t MaxArgLen = 0;
|
|
|
|
for (size_t i = 0, e = Opts.size(); i != e; ++i)
|
|
|
|
MaxArgLen = std::max(MaxArgLen, Opts[i].second->getOptionWidth());
|
|
|
|
|
|
|
|
for (size_t i = 0, e = Opts.size(); i != e; ++i)
|
|
|
|
Opts[i].second->printOptionValue(MaxArgLen, PrintAllOptions);
|
|
|
|
}
|
|
|
|
|
2017-06-07 05:54:04 +08:00
|
|
|
static VersionPrinterTy OverrideVersionPrinter = nullptr;
|
2006-06-06 00:22:56 +08:00
|
|
|
|
2017-06-07 05:54:04 +08:00
|
|
|
static std::vector<VersionPrinterTy> *ExtraVersionPrinters = nullptr;
|
2011-07-22 15:50:40 +08:00
|
|
|
|
2006-10-13 06:09:17 +08:00
|
|
|
namespace {
|
2006-06-06 00:22:56 +08:00
|
|
|
class VersionPrinter {
|
|
|
|
public:
|
2007-02-01 09:43:37 +08:00
|
|
|
void print() {
|
2009-09-20 14:18:38 +08:00
|
|
|
raw_ostream &OS = outs();
|
2016-03-16 02:07:46 +08:00
|
|
|
#ifdef PACKAGE_VENDOR
|
|
|
|
OS << PACKAGE_VENDOR << " ";
|
|
|
|
#else
|
|
|
|
OS << "LLVM (http://llvm.org/):\n ";
|
|
|
|
#endif
|
|
|
|
OS << PACKAGE_NAME << " version " << PACKAGE_VERSION;
|
2006-07-07 02:33:03 +08:00
|
|
|
#ifdef LLVM_VERSION_INFO
|
2014-06-17 14:52:41 +08:00
|
|
|
OS << " " << LLVM_VERSION_INFO;
|
2006-07-07 02:33:03 +08:00
|
|
|
#endif
|
2009-09-20 14:18:38 +08:00
|
|
|
OS << "\n ";
|
2006-07-07 02:33:03 +08:00
|
|
|
#ifndef __OPTIMIZE__
|
2009-09-20 14:18:38 +08:00
|
|
|
OS << "DEBUG build";
|
2006-06-06 00:22:56 +08:00
|
|
|
#else
|
2009-09-20 14:18:38 +08:00
|
|
|
OS << "Optimized build";
|
2006-07-07 02:33:03 +08:00
|
|
|
#endif
|
|
|
|
#ifndef NDEBUG
|
2009-09-20 14:18:38 +08:00
|
|
|
OS << " with assertions";
|
2006-06-06 00:22:56 +08:00
|
|
|
#endif
|
2017-04-19 08:03:36 +08:00
|
|
|
#if LLVM_VERSION_PRINTER_SHOW_HOST_TARGET_INFO
|
2009-11-15 05:36:07 +08:00
|
|
|
std::string CPU = sys::getHostCPUName();
|
2015-01-14 03:14:20 +08:00
|
|
|
if (CPU == "generic")
|
|
|
|
CPU = "(unknown)";
|
2009-09-20 14:18:38 +08:00
|
|
|
OS << ".\n"
|
2011-11-02 05:32:20 +08:00
|
|
|
<< " Default target: " << sys::getDefaultTargetTriple() << '\n'
|
2017-04-19 08:03:36 +08:00
|
|
|
<< " Host CPU: " << CPU;
|
|
|
|
#endif
|
|
|
|
OS << '\n';
|
2007-02-01 09:43:37 +08:00
|
|
|
}
|
|
|
|
void operator=(bool OptionWasSpecified) {
|
2015-01-14 03:14:20 +08:00
|
|
|
if (!OptionWasSpecified)
|
|
|
|
return;
|
2009-11-20 01:29:36 +08:00
|
|
|
|
2014-04-07 12:17:22 +08:00
|
|
|
if (OverrideVersionPrinter != nullptr) {
|
2017-06-07 05:54:04 +08:00
|
|
|
OverrideVersionPrinter(outs());
|
2014-03-01 03:08:01 +08:00
|
|
|
exit(0);
|
2006-06-06 00:22:56 +08:00
|
|
|
}
|
2011-07-22 15:50:40 +08:00
|
|
|
print();
|
|
|
|
|
|
|
|
// Iterate over any registered extra printers and call them to add further
|
|
|
|
// information.
|
2014-04-07 12:17:22 +08:00
|
|
|
if (ExtraVersionPrinters != nullptr) {
|
2011-07-22 15:50:48 +08:00
|
|
|
outs() << '\n';
|
2017-06-07 05:54:04 +08:00
|
|
|
for (auto I : *ExtraVersionPrinters)
|
|
|
|
I(outs());
|
2011-07-22 15:50:40 +08:00
|
|
|
}
|
|
|
|
|
2014-03-01 03:08:01 +08:00
|
|
|
exit(0);
|
2006-06-06 00:22:56 +08:00
|
|
|
}
|
|
|
|
};
|
2006-10-13 06:09:17 +08:00
|
|
|
} // End anonymous namespace
|
2006-06-06 00:22:56 +08:00
|
|
|
|
2004-08-04 08:36:06 +08:00
|
|
|
// Define the --version option that prints out the LLVM version for the tool
|
2006-10-13 06:09:17 +08:00
|
|
|
static VersionPrinter VersionPrinterInstance;
|
|
|
|
|
2015-01-14 03:14:20 +08:00
|
|
|
static cl::opt<VersionPrinter, true, parser<bool>>
|
|
|
|
VersOp("version", cl::desc("Display the version of this program"),
|
2015-01-27 00:56:00 +08:00
|
|
|
cl::location(VersionPrinterInstance), cl::ValueDisallowed,
|
|
|
|
cl::cat(GenericCategory));
|
2004-08-04 08:36:06 +08:00
|
|
|
|
2004-11-16 14:11:52 +08:00
|
|
|
// Utility function for printing the help message.
|
2013-05-07 05:56:23 +08:00
|
|
|
void cl::PrintHelpMessage(bool Hidden, bool Categorized) {
|
|
|
|
if (!Hidden && !Categorized)
|
2017-09-08 07:30:48 +08:00
|
|
|
UncategorizedNormalPrinter.printHelp();
|
2013-05-07 05:56:23 +08:00
|
|
|
else if (!Hidden && Categorized)
|
2017-09-08 07:30:48 +08:00
|
|
|
CategorizedNormalPrinter.printHelp();
|
2013-05-07 05:56:23 +08:00
|
|
|
else if (Hidden && !Categorized)
|
2017-09-08 07:30:48 +08:00
|
|
|
UncategorizedHiddenPrinter.printHelp();
|
2013-05-07 05:56:23 +08:00
|
|
|
else
|
2017-09-08 07:30:48 +08:00
|
|
|
CategorizedHiddenPrinter.printHelp();
|
2004-11-16 14:11:52 +08:00
|
|
|
}
|
2006-06-06 00:22:56 +08:00
|
|
|
|
2007-02-01 09:43:37 +08:00
|
|
|
/// Utility function for printing version number.
|
2015-01-14 03:14:20 +08:00
|
|
|
void cl::PrintVersionMessage() { VersionPrinterInstance.print(); }
|
2007-02-01 09:43:37 +08:00
|
|
|
|
2017-06-07 05:54:04 +08:00
|
|
|
void cl::SetVersionPrinter(VersionPrinterTy func) { OverrideVersionPrinter = func; }
|
2011-07-22 15:50:40 +08:00
|
|
|
|
2017-06-07 05:54:04 +08:00
|
|
|
void cl::AddExtraVersionPrinter(VersionPrinterTy func) {
|
2014-04-09 12:20:00 +08:00
|
|
|
if (!ExtraVersionPrinters)
|
2017-06-07 05:54:04 +08:00
|
|
|
ExtraVersionPrinters = new std::vector<VersionPrinterTy>;
|
2011-07-22 15:50:40 +08:00
|
|
|
|
|
|
|
ExtraVersionPrinters->push_back(func);
|
|
|
|
}
|
2013-05-07 05:56:35 +08:00
|
|
|
|
2016-06-30 05:48:26 +08:00
|
|
|
StringMap<Option *> &cl::getRegisteredOptions(SubCommand &Sub) {
|
|
|
|
auto &Subs = GlobalParser->RegisteredSubCommands;
|
|
|
|
(void)Subs;
|
2016-08-12 06:21:41 +08:00
|
|
|
assert(is_contained(Subs, &Sub));
|
2016-06-30 05:48:26 +08:00
|
|
|
return Sub.OptionsMap;
|
2013-05-07 05:56:35 +08:00
|
|
|
}
|
2014-10-17 06:47:52 +08:00
|
|
|
|
2016-10-05 13:20:08 +08:00
|
|
|
iterator_range<typename SmallPtrSet<SubCommand *, 4>::iterator>
|
|
|
|
cl::getRegisteredSubcommands() {
|
|
|
|
return GlobalParser->getRegisteredSubcommands();
|
|
|
|
}
|
|
|
|
|
2016-06-30 05:48:26 +08:00
|
|
|
void cl::HideUnrelatedOptions(cl::OptionCategory &Category, SubCommand &Sub) {
|
|
|
|
for (auto &I : Sub.OptionsMap) {
|
2015-01-27 00:56:00 +08:00
|
|
|
if (I.second->Category != &Category &&
|
|
|
|
I.second->Category != &GenericCategory)
|
2015-01-22 06:45:52 +08:00
|
|
|
I.second->setHiddenFlag(cl::ReallyHidden);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-06-30 05:48:26 +08:00
|
|
|
void cl::HideUnrelatedOptions(ArrayRef<const cl::OptionCategory *> Categories,
|
|
|
|
SubCommand &Sub) {
|
2015-01-27 05:57:29 +08:00
|
|
|
auto CategoriesBegin = Categories.begin();
|
|
|
|
auto CategoriesEnd = Categories.end();
|
2016-06-30 05:48:26 +08:00
|
|
|
for (auto &I : Sub.OptionsMap) {
|
2015-01-27 05:57:29 +08:00
|
|
|
if (std::find(CategoriesBegin, CategoriesEnd, I.second->Category) ==
|
|
|
|
CategoriesEnd &&
|
|
|
|
I.second->Category != &GenericCategory)
|
|
|
|
I.second->setHiddenFlag(cl::ReallyHidden);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-06-30 05:48:26 +08:00
|
|
|
void cl::ResetCommandLineParser() { GlobalParser->reset(); }
|
|
|
|
void cl::ResetAllOptionOccurrences() {
|
|
|
|
GlobalParser->ResetAllOptionOccurrences();
|
|
|
|
}
|
|
|
|
|
2014-10-17 06:47:52 +08:00
|
|
|
void LLVMParseCommandLineOptions(int argc, const char *const *argv,
|
|
|
|
const char *Overview) {
|
2017-03-15 16:41:00 +08:00
|
|
|
llvm::cl::ParseCommandLineOptions(argc, argv, StringRef(Overview),
|
|
|
|
&llvm::nulls());
|
2014-10-17 06:47:52 +08:00
|
|
|
}
|