1 //===--- ArgList.cpp - Argument List Management ---------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 #include "llvm/Option/ArgList.h"
11 #include "llvm/ADT/STLExtras.h"
12 #include "llvm/ADT/SmallString.h"
13 #include "llvm/ADT/Twine.h"
14 #include "llvm/Option/Arg.h"
15 #include "llvm/Option/Option.h"
16 #include "llvm/Support/Debug.h"
17 #include "llvm/Support/raw_ostream.h"
20 using namespace llvm::opt;
22 void arg_iterator::SkipToNextArg() {
23 for (; Current != Args.end(); ++Current) {
24 // Done if there are no filters.
28 // Otherwise require a match.
29 const Option &O = (*Current)->getOption();
31 (Id1.isValid() && O.matches(Id1)) ||
32 (Id2.isValid() && O.matches(Id2)))
37 void ArgList::append(Arg *A) {
41 void ArgList::eraseArg(OptSpecifier Id) {
43 remove_if(*this, [=](Arg *A) { return A->getOption().matches(Id); }),
47 Arg *ArgList::getLastArgNoClaim(OptSpecifier Id) const {
48 // FIXME: Make search efficient?
49 for (const_reverse_iterator it = rbegin(), ie = rend(); it != ie; ++it)
50 if ((*it)->getOption().matches(Id))
55 Arg *ArgList::getLastArgNoClaim(OptSpecifier Id0, OptSpecifier Id1) const {
56 // FIXME: Make search efficient?
57 for (const_reverse_iterator it = rbegin(), ie = rend(); it != ie; ++it)
58 if ((*it)->getOption().matches(Id0) ||
59 (*it)->getOption().matches(Id1))
64 Arg *ArgList::getLastArgNoClaim(OptSpecifier Id0, OptSpecifier Id1,
65 OptSpecifier Id2) const {
66 // FIXME: Make search efficient?
67 for (const_reverse_iterator it = rbegin(), ie = rend(); it != ie; ++it)
68 if ((*it)->getOption().matches(Id0) || (*it)->getOption().matches(Id1) ||
69 (*it)->getOption().matches(Id2))
74 Arg *ArgList::getLastArgNoClaim(OptSpecifier Id0, OptSpecifier Id1,
75 OptSpecifier Id2, OptSpecifier Id3) const {
76 // FIXME: Make search efficient?
77 for (const_reverse_iterator it = rbegin(), ie = rend(); it != ie; ++it)
78 if ((*it)->getOption().matches(Id0) || (*it)->getOption().matches(Id1) ||
79 (*it)->getOption().matches(Id2) || (*it)->getOption().matches(Id3))
84 Arg *ArgList::getLastArg(OptSpecifier Id) const {
86 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
87 if ((*it)->getOption().matches(Id)) {
96 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1) const {
98 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
99 if ((*it)->getOption().matches(Id0) ||
100 (*it)->getOption().matches(Id1)) {
110 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
111 OptSpecifier Id2) const {
113 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
114 if ((*it)->getOption().matches(Id0) ||
115 (*it)->getOption().matches(Id1) ||
116 (*it)->getOption().matches(Id2)) {
125 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
126 OptSpecifier Id2, OptSpecifier Id3) const {
128 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
129 if ((*it)->getOption().matches(Id0) ||
130 (*it)->getOption().matches(Id1) ||
131 (*it)->getOption().matches(Id2) ||
132 (*it)->getOption().matches(Id3)) {
141 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
142 OptSpecifier Id2, OptSpecifier Id3,
143 OptSpecifier Id4) const {
145 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
146 if ((*it)->getOption().matches(Id0) ||
147 (*it)->getOption().matches(Id1) ||
148 (*it)->getOption().matches(Id2) ||
149 (*it)->getOption().matches(Id3) ||
150 (*it)->getOption().matches(Id4)) {
159 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
160 OptSpecifier Id2, OptSpecifier Id3,
161 OptSpecifier Id4, OptSpecifier Id5) const {
163 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
164 if ((*it)->getOption().matches(Id0) ||
165 (*it)->getOption().matches(Id1) ||
166 (*it)->getOption().matches(Id2) ||
167 (*it)->getOption().matches(Id3) ||
168 (*it)->getOption().matches(Id4) ||
169 (*it)->getOption().matches(Id5)) {
178 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
179 OptSpecifier Id2, OptSpecifier Id3,
180 OptSpecifier Id4, OptSpecifier Id5,
181 OptSpecifier Id6) const {
183 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
184 if ((*it)->getOption().matches(Id0) ||
185 (*it)->getOption().matches(Id1) ||
186 (*it)->getOption().matches(Id2) ||
187 (*it)->getOption().matches(Id3) ||
188 (*it)->getOption().matches(Id4) ||
189 (*it)->getOption().matches(Id5) ||
190 (*it)->getOption().matches(Id6)) {
199 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
200 OptSpecifier Id2, OptSpecifier Id3,
201 OptSpecifier Id4, OptSpecifier Id5,
202 OptSpecifier Id6, OptSpecifier Id7) const {
204 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
205 if ((*it)->getOption().matches(Id0) ||
206 (*it)->getOption().matches(Id1) ||
207 (*it)->getOption().matches(Id2) ||
208 (*it)->getOption().matches(Id3) ||
209 (*it)->getOption().matches(Id4) ||
210 (*it)->getOption().matches(Id5) ||
211 (*it)->getOption().matches(Id6) ||
212 (*it)->getOption().matches(Id7)) {
221 bool ArgList::hasFlag(OptSpecifier Pos, OptSpecifier Neg, bool Default) const {
222 if (Arg *A = getLastArg(Pos, Neg))
223 return A->getOption().matches(Pos);
227 bool ArgList::hasFlag(OptSpecifier Pos, OptSpecifier PosAlias, OptSpecifier Neg,
228 bool Default) const {
229 if (Arg *A = getLastArg(Pos, PosAlias, Neg))
230 return A->getOption().matches(Pos) || A->getOption().matches(PosAlias);
234 StringRef ArgList::getLastArgValue(OptSpecifier Id,
235 StringRef Default) const {
236 if (Arg *A = getLastArg(Id))
237 return A->getValue();
241 std::vector<std::string> ArgList::getAllArgValues(OptSpecifier Id) const {
242 SmallVector<const char *, 16> Values;
243 AddAllArgValues(Values, Id);
244 return std::vector<std::string>(Values.begin(), Values.end());
247 void ArgList::AddLastArg(ArgStringList &Output, OptSpecifier Id) const {
248 if (Arg *A = getLastArg(Id)) {
250 A->render(*this, Output);
254 void ArgList::AddLastArg(ArgStringList &Output, OptSpecifier Id0,
255 OptSpecifier Id1) const {
256 if (Arg *A = getLastArg(Id0, Id1)) {
258 A->render(*this, Output);
262 void ArgList::AddAllArgsExcept(ArgStringList &Output,
263 ArrayRef<OptSpecifier> Ids,
264 ArrayRef<OptSpecifier> ExcludeIds) const {
265 for (const Arg *Arg : Args) {
266 bool Excluded = false;
267 for (OptSpecifier Id : ExcludeIds) {
268 if (Arg->getOption().matches(Id)) {
274 for (OptSpecifier Id : Ids) {
275 if (Arg->getOption().matches(Id)) {
277 Arg->render(*this, Output);
285 /// This is a nicer interface when you don't have a list of Ids to exclude.
286 void ArgList::AddAllArgs(ArgStringList &Output,
287 ArrayRef<OptSpecifier> Ids) const {
288 ArrayRef<OptSpecifier> Exclude = None;
289 AddAllArgsExcept(Output, Ids, Exclude);
292 /// This 3-opt variant of AddAllArgs could be eliminated in favor of one
293 /// that accepts a single specifier, given the above which accepts any number.
294 void ArgList::AddAllArgs(ArgStringList &Output, OptSpecifier Id0,
295 OptSpecifier Id1, OptSpecifier Id2) const {
296 for (auto Arg: filtered(Id0, Id1, Id2)) {
298 Arg->render(*this, Output);
302 void ArgList::AddAllArgValues(ArgStringList &Output, OptSpecifier Id0,
303 OptSpecifier Id1, OptSpecifier Id2) const {
304 for (auto Arg : filtered(Id0, Id1, Id2)) {
306 const auto &Values = Arg->getValues();
307 Output.append(Values.begin(), Values.end());
311 void ArgList::AddAllArgsTranslated(ArgStringList &Output, OptSpecifier Id0,
312 const char *Translation,
314 for (auto Arg: filtered(Id0)) {
318 Output.push_back(MakeArgString(StringRef(Translation) +
321 Output.push_back(Translation);
322 Output.push_back(Arg->getValue(0));
327 void ArgList::ClaimAllArgs(OptSpecifier Id0) const {
328 for (auto Arg : filtered(Id0))
332 void ArgList::ClaimAllArgs() const {
333 for (const_iterator it = begin(), ie = end(); it != ie; ++it)
334 if (!(*it)->isClaimed())
338 const char *ArgList::GetOrMakeJoinedArgString(unsigned Index,
340 StringRef RHS) const {
341 StringRef Cur = getArgString(Index);
342 if (Cur.size() == LHS.size() + RHS.size() &&
343 Cur.startswith(LHS) && Cur.endswith(RHS))
346 return MakeArgString(LHS + RHS);
349 void ArgList::print(raw_ostream &O) const {
350 for (Arg *A : *this) {
356 LLVM_DUMP_METHOD void ArgList::dump() const { print(dbgs()); }
360 void InputArgList::releaseMemory() {
361 // An InputArgList always owns its arguments.
366 InputArgList::InputArgList(const char* const *ArgBegin,
367 const char* const *ArgEnd)
368 : NumInputArgStrings(ArgEnd - ArgBegin) {
369 ArgStrings.append(ArgBegin, ArgEnd);
372 unsigned InputArgList::MakeIndex(StringRef String0) const {
373 unsigned Index = ArgStrings.size();
375 // Tuck away so we have a reliable const char *.
376 SynthesizedStrings.push_back(String0);
377 ArgStrings.push_back(SynthesizedStrings.back().c_str());
382 unsigned InputArgList::MakeIndex(StringRef String0,
383 StringRef String1) const {
384 unsigned Index0 = MakeIndex(String0);
385 unsigned Index1 = MakeIndex(String1);
386 assert(Index0 + 1 == Index1 && "Unexpected non-consecutive indices!");
391 const char *InputArgList::MakeArgStringRef(StringRef Str) const {
392 return getArgString(MakeIndex(Str));
397 DerivedArgList::DerivedArgList(const InputArgList &BaseArgs)
398 : BaseArgs(BaseArgs) {}
400 const char *DerivedArgList::MakeArgStringRef(StringRef Str) const {
401 return BaseArgs.MakeArgString(Str);
404 void DerivedArgList::AddSynthesizedArg(Arg *A) {
405 SynthesizedArgs.push_back(std::unique_ptr<Arg>(A));
408 Arg *DerivedArgList::MakeFlagArg(const Arg *BaseArg, const Option Opt) const {
409 SynthesizedArgs.push_back(
410 make_unique<Arg>(Opt, MakeArgString(Opt.getPrefix() + Opt.getName()),
411 BaseArgs.MakeIndex(Opt.getName()), BaseArg));
412 return SynthesizedArgs.back().get();
415 Arg *DerivedArgList::MakePositionalArg(const Arg *BaseArg, const Option Opt,
416 StringRef Value) const {
417 unsigned Index = BaseArgs.MakeIndex(Value);
418 SynthesizedArgs.push_back(
419 make_unique<Arg>(Opt, MakeArgString(Opt.getPrefix() + Opt.getName()),
420 Index, BaseArgs.getArgString(Index), BaseArg));
421 return SynthesizedArgs.back().get();
424 Arg *DerivedArgList::MakeSeparateArg(const Arg *BaseArg, const Option Opt,
425 StringRef Value) const {
426 unsigned Index = BaseArgs.MakeIndex(Opt.getName(), Value);
427 SynthesizedArgs.push_back(
428 make_unique<Arg>(Opt, MakeArgString(Opt.getPrefix() + Opt.getName()),
429 Index, BaseArgs.getArgString(Index + 1), BaseArg));
430 return SynthesizedArgs.back().get();
433 Arg *DerivedArgList::MakeJoinedArg(const Arg *BaseArg, const Option Opt,
434 StringRef Value) const {
435 unsigned Index = BaseArgs.MakeIndex((Opt.getName() + Value).str());
436 SynthesizedArgs.push_back(make_unique<Arg>(
437 Opt, MakeArgString(Opt.getPrefix() + Opt.getName()), Index,
438 BaseArgs.getArgString(Index) + Opt.getName().size(), BaseArg));
439 return SynthesizedArgs.back().get();