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/SmallString.h"
12 #include "llvm/ADT/STLExtras.h"
13 #include "llvm/ADT/Twine.h"
14 #include "llvm/Option/Arg.h"
15 #include "llvm/Option/Option.h"
16 #include "llvm/Support/raw_ostream.h"
19 using namespace llvm::opt;
21 void arg_iterator::SkipToNextArg() {
22 for (; Current != Args.end(); ++Current) {
23 // Done if there are no filters.
27 // Otherwise require a match.
28 const Option &O = (*Current)->getOption();
30 (Id1.isValid() && O.matches(Id1)) ||
31 (Id2.isValid() && O.matches(Id2)))
39 void ArgList::append(Arg *A) {
43 void ArgList::eraseArg(OptSpecifier Id) {
44 for (iterator it = begin(), ie = end(); it != ie; ) {
45 if ((*it)->getOption().matches(Id)) {
54 Arg *ArgList::getLastArgNoClaim(OptSpecifier Id) const {
55 // FIXME: Make search efficient?
56 for (const_reverse_iterator it = rbegin(), ie = rend(); it != ie; ++it)
57 if ((*it)->getOption().matches(Id))
62 Arg *ArgList::getLastArg(OptSpecifier Id) const {
64 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
65 if ((*it)->getOption().matches(Id)) {
74 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1) const {
76 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
77 if ((*it)->getOption().matches(Id0) ||
78 (*it)->getOption().matches(Id1)) {
88 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
89 OptSpecifier Id2) const {
91 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
92 if ((*it)->getOption().matches(Id0) ||
93 (*it)->getOption().matches(Id1) ||
94 (*it)->getOption().matches(Id2)) {
103 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
104 OptSpecifier Id2, OptSpecifier Id3) const {
106 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
107 if ((*it)->getOption().matches(Id0) ||
108 (*it)->getOption().matches(Id1) ||
109 (*it)->getOption().matches(Id2) ||
110 (*it)->getOption().matches(Id3)) {
119 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
120 OptSpecifier Id2, OptSpecifier Id3,
121 OptSpecifier Id4) const {
123 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
124 if ((*it)->getOption().matches(Id0) ||
125 (*it)->getOption().matches(Id1) ||
126 (*it)->getOption().matches(Id2) ||
127 (*it)->getOption().matches(Id3) ||
128 (*it)->getOption().matches(Id4)) {
137 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
138 OptSpecifier Id2, OptSpecifier Id3,
139 OptSpecifier Id4, OptSpecifier Id5) const {
141 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
142 if ((*it)->getOption().matches(Id0) ||
143 (*it)->getOption().matches(Id1) ||
144 (*it)->getOption().matches(Id2) ||
145 (*it)->getOption().matches(Id3) ||
146 (*it)->getOption().matches(Id4) ||
147 (*it)->getOption().matches(Id5)) {
156 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
157 OptSpecifier Id2, OptSpecifier Id3,
158 OptSpecifier Id4, OptSpecifier Id5,
159 OptSpecifier Id6) const {
161 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
162 if ((*it)->getOption().matches(Id0) ||
163 (*it)->getOption().matches(Id1) ||
164 (*it)->getOption().matches(Id2) ||
165 (*it)->getOption().matches(Id3) ||
166 (*it)->getOption().matches(Id4) ||
167 (*it)->getOption().matches(Id5) ||
168 (*it)->getOption().matches(Id6)) {
177 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
178 OptSpecifier Id2, OptSpecifier Id3,
179 OptSpecifier Id4, OptSpecifier Id5,
180 OptSpecifier Id6, OptSpecifier Id7) const {
182 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
183 if ((*it)->getOption().matches(Id0) ||
184 (*it)->getOption().matches(Id1) ||
185 (*it)->getOption().matches(Id2) ||
186 (*it)->getOption().matches(Id3) ||
187 (*it)->getOption().matches(Id4) ||
188 (*it)->getOption().matches(Id5) ||
189 (*it)->getOption().matches(Id6) ||
190 (*it)->getOption().matches(Id7)) {
199 bool ArgList::hasFlag(OptSpecifier Pos, OptSpecifier Neg, bool Default) const {
200 if (Arg *A = getLastArg(Pos, Neg))
201 return A->getOption().matches(Pos);
205 bool ArgList::hasFlag(OptSpecifier Pos, OptSpecifier PosAlias, OptSpecifier Neg,
206 bool Default) const {
207 if (Arg *A = getLastArg(Pos, PosAlias, Neg))
208 return A->getOption().matches(Pos) || A->getOption().matches(PosAlias);
212 StringRef ArgList::getLastArgValue(OptSpecifier Id,
213 StringRef Default) const {
214 if (Arg *A = getLastArg(Id))
215 return A->getValue();
219 std::vector<std::string> ArgList::getAllArgValues(OptSpecifier Id) const {
220 SmallVector<const char *, 16> Values;
221 AddAllArgValues(Values, Id);
222 return std::vector<std::string>(Values.begin(), Values.end());
225 void ArgList::AddLastArg(ArgStringList &Output, OptSpecifier Id) const {
226 if (Arg *A = getLastArg(Id)) {
228 A->render(*this, Output);
232 void ArgList::AddLastArg(ArgStringList &Output, OptSpecifier Id0,
233 OptSpecifier Id1) const {
234 if (Arg *A = getLastArg(Id0, Id1)) {
236 A->render(*this, Output);
240 void ArgList::AddAllArgs(ArgStringList &Output, OptSpecifier Id0,
241 OptSpecifier Id1, OptSpecifier Id2) const {
242 for (arg_iterator it = filtered_begin(Id0, Id1, Id2),
243 ie = filtered_end(); it != ie; ++it) {
245 (*it)->render(*this, Output);
249 void ArgList::AddAllArgValues(ArgStringList &Output, OptSpecifier Id0,
250 OptSpecifier Id1, OptSpecifier Id2) const {
251 for (arg_iterator it = filtered_begin(Id0, Id1, Id2),
252 ie = filtered_end(); it != ie; ++it) {
254 for (unsigned i = 0, e = (*it)->getNumValues(); i != e; ++i)
255 Output.push_back((*it)->getValue(i));
259 void ArgList::AddAllArgsTranslated(ArgStringList &Output, OptSpecifier Id0,
260 const char *Translation,
262 for (arg_iterator it = filtered_begin(Id0),
263 ie = filtered_end(); it != ie; ++it) {
267 Output.push_back(MakeArgString(StringRef(Translation) +
268 (*it)->getValue(0)));
270 Output.push_back(Translation);
271 Output.push_back((*it)->getValue(0));
276 void ArgList::ClaimAllArgs(OptSpecifier Id0) const {
277 for (arg_iterator it = filtered_begin(Id0),
278 ie = filtered_end(); it != ie; ++it)
282 void ArgList::ClaimAllArgs() const {
283 for (const_iterator it = begin(), ie = end(); it != ie; ++it)
284 if (!(*it)->isClaimed())
288 const char *ArgList::MakeArgString(const Twine &T) const {
289 SmallString<256> Str;
290 return MakeArgString(T.toStringRef(Str));
293 const char *ArgList::GetOrMakeJoinedArgString(unsigned Index,
295 StringRef RHS) const {
296 StringRef Cur = getArgString(Index);
297 if (Cur.size() == LHS.size() + RHS.size() &&
298 Cur.startswith(LHS) && Cur.endswith(RHS))
301 return MakeArgString(LHS + RHS);
306 InputArgList::InputArgList(const char* const *ArgBegin,
307 const char* const *ArgEnd)
308 : NumInputArgStrings(ArgEnd - ArgBegin) {
309 ArgStrings.append(ArgBegin, ArgEnd);
312 InputArgList::~InputArgList() {
313 // An InputArgList always owns its arguments.
314 for (iterator it = begin(), ie = end(); it != ie; ++it)
318 unsigned InputArgList::MakeIndex(StringRef String0) const {
319 unsigned Index = ArgStrings.size();
321 // Tuck away so we have a reliable const char *.
322 SynthesizedStrings.push_back(String0);
323 ArgStrings.push_back(SynthesizedStrings.back().c_str());
328 unsigned InputArgList::MakeIndex(StringRef String0,
329 StringRef String1) const {
330 unsigned Index0 = MakeIndex(String0);
331 unsigned Index1 = MakeIndex(String1);
332 assert(Index0 + 1 == Index1 && "Unexpected non-consecutive indices!");
337 const char *InputArgList::MakeArgString(StringRef Str) const {
338 return getArgString(MakeIndex(Str));
343 DerivedArgList::DerivedArgList(const InputArgList &_BaseArgs)
344 : BaseArgs(_BaseArgs) {
347 DerivedArgList::~DerivedArgList() {}
349 const char *DerivedArgList::MakeArgString(StringRef Str) const {
350 return BaseArgs.MakeArgString(Str);
353 void DerivedArgList::AddSynthesizedArg(Arg *A) {
354 SynthesizedArgs.push_back(std::unique_ptr<Arg>(A));
357 Arg *DerivedArgList::MakeFlagArg(const Arg *BaseArg, const Option Opt) const {
358 SynthesizedArgs.push_back(make_unique<Arg>(
360 ArgList::MakeArgString(Twine(Opt.getPrefix()) + Twine(Opt.getName())),
361 BaseArgs.MakeIndex(Opt.getName()), BaseArg));
362 return SynthesizedArgs.back().get();
365 Arg *DerivedArgList::MakePositionalArg(const Arg *BaseArg, const Option Opt,
366 StringRef Value) const {
367 unsigned Index = BaseArgs.MakeIndex(Value);
368 SynthesizedArgs.push_back(make_unique<Arg>(
370 ArgList::MakeArgString(Twine(Opt.getPrefix()) + Twine(Opt.getName())),
371 Index, BaseArgs.getArgString(Index), BaseArg));
372 return SynthesizedArgs.back().get();
375 Arg *DerivedArgList::MakeSeparateArg(const Arg *BaseArg, const Option Opt,
376 StringRef Value) const {
377 unsigned Index = BaseArgs.MakeIndex(Opt.getName(), Value);
378 SynthesizedArgs.push_back(make_unique<Arg>(
380 ArgList::MakeArgString(Twine(Opt.getPrefix()) + Twine(Opt.getName())),
381 Index, BaseArgs.getArgString(Index + 1), BaseArg));
382 return SynthesizedArgs.back().get();
385 Arg *DerivedArgList::MakeJoinedArg(const Arg *BaseArg, const Option Opt,
386 StringRef Value) const {
387 unsigned Index = BaseArgs.MakeIndex(Opt.getName().str() + Value.str());
388 SynthesizedArgs.push_back(make_unique<Arg>(
390 ArgList::MakeArgString(Twine(Opt.getPrefix()) + Twine(Opt.getName())),
391 Index, BaseArgs.getArgString(Index) + Opt.getName().size(), BaseArg));
392 return SynthesizedArgs.back().get();