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/Twine.h"
13 #include "llvm/Option/Arg.h"
14 #include "llvm/Option/Option.h"
15 #include "llvm/Support/raw_ostream.h"
18 using namespace llvm::opt;
20 void arg_iterator::SkipToNextArg() {
21 for (; Current != Args.end(); ++Current) {
22 // Done if there are no filters.
26 // Otherwise require a match.
27 const Option &O = (*Current)->getOption();
29 (Id1.isValid() && O.matches(Id1)) ||
30 (Id2.isValid() && O.matches(Id2)))
43 void ArgList::append(Arg *A) {
47 void ArgList::eraseArg(OptSpecifier Id) {
48 for (iterator it = begin(), ie = end(); it != ie; ) {
49 if ((*it)->getOption().matches(Id)) {
58 Arg *ArgList::getLastArgNoClaim(OptSpecifier Id) const {
59 // FIXME: Make search efficient?
60 for (const_reverse_iterator it = rbegin(), ie = rend(); it != ie; ++it)
61 if ((*it)->getOption().matches(Id))
66 Arg *ArgList::getLastArg(OptSpecifier Id) const {
68 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
69 if ((*it)->getOption().matches(Id)) {
78 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1) const {
80 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
81 if ((*it)->getOption().matches(Id0) ||
82 (*it)->getOption().matches(Id1)) {
92 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
93 OptSpecifier Id2) const {
95 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
96 if ((*it)->getOption().matches(Id0) ||
97 (*it)->getOption().matches(Id1) ||
98 (*it)->getOption().matches(Id2)) {
107 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
108 OptSpecifier Id2, OptSpecifier Id3) const {
110 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
111 if ((*it)->getOption().matches(Id0) ||
112 (*it)->getOption().matches(Id1) ||
113 (*it)->getOption().matches(Id2) ||
114 (*it)->getOption().matches(Id3)) {
123 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
124 OptSpecifier Id2, OptSpecifier Id3,
125 OptSpecifier Id4) const {
127 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
128 if ((*it)->getOption().matches(Id0) ||
129 (*it)->getOption().matches(Id1) ||
130 (*it)->getOption().matches(Id2) ||
131 (*it)->getOption().matches(Id3) ||
132 (*it)->getOption().matches(Id4)) {
141 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
142 OptSpecifier Id2, OptSpecifier Id3,
143 OptSpecifier Id4, OptSpecifier Id5) 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) ||
151 (*it)->getOption().matches(Id5)) {
160 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
161 OptSpecifier Id2, OptSpecifier Id3,
162 OptSpecifier Id4, OptSpecifier Id5,
163 OptSpecifier Id6) const {
165 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
166 if ((*it)->getOption().matches(Id0) ||
167 (*it)->getOption().matches(Id1) ||
168 (*it)->getOption().matches(Id2) ||
169 (*it)->getOption().matches(Id3) ||
170 (*it)->getOption().matches(Id4) ||
171 (*it)->getOption().matches(Id5) ||
172 (*it)->getOption().matches(Id6)) {
181 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
182 OptSpecifier Id2, OptSpecifier Id3,
183 OptSpecifier Id4, OptSpecifier Id5,
184 OptSpecifier Id6, OptSpecifier Id7) const {
186 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
187 if ((*it)->getOption().matches(Id0) ||
188 (*it)->getOption().matches(Id1) ||
189 (*it)->getOption().matches(Id2) ||
190 (*it)->getOption().matches(Id3) ||
191 (*it)->getOption().matches(Id4) ||
192 (*it)->getOption().matches(Id5) ||
193 (*it)->getOption().matches(Id6) ||
194 (*it)->getOption().matches(Id7)) {
203 bool ArgList::hasFlag(OptSpecifier Pos, OptSpecifier Neg, bool Default) const {
204 if (Arg *A = getLastArg(Pos, Neg))
205 return A->getOption().matches(Pos);
209 bool ArgList::hasFlag(OptSpecifier Pos, OptSpecifier PosAlias, OptSpecifier Neg,
210 bool Default) const {
211 if (Arg *A = getLastArg(Pos, PosAlias, Neg))
212 return A->getOption().matches(Pos) || A->getOption().matches(PosAlias);
216 StringRef ArgList::getLastArgValue(OptSpecifier Id,
217 StringRef Default) const {
218 if (Arg *A = getLastArg(Id))
219 return A->getValue();
223 std::vector<std::string> ArgList::getAllArgValues(OptSpecifier Id) const {
224 SmallVector<const char *, 16> Values;
225 AddAllArgValues(Values, Id);
226 return std::vector<std::string>(Values.begin(), Values.end());
229 void ArgList::AddLastArg(ArgStringList &Output, OptSpecifier Id) const {
230 if (Arg *A = getLastArg(Id)) {
232 A->render(*this, Output);
236 void ArgList::AddLastArg(ArgStringList &Output, OptSpecifier Id0,
237 OptSpecifier Id1) const {
238 if (Arg *A = getLastArg(Id0, Id1)) {
240 A->render(*this, Output);
244 void ArgList::AddAllArgs(ArgStringList &Output, OptSpecifier Id0,
245 OptSpecifier Id1, OptSpecifier Id2) const {
246 for (arg_iterator it = filtered_begin(Id0, Id1, Id2),
247 ie = filtered_end(); it != ie; ++it) {
249 (*it)->render(*this, Output);
253 void ArgList::AddAllArgValues(ArgStringList &Output, OptSpecifier Id0,
254 OptSpecifier Id1, OptSpecifier Id2) const {
255 for (arg_iterator it = filtered_begin(Id0, Id1, Id2),
256 ie = filtered_end(); it != ie; ++it) {
258 for (unsigned i = 0, e = (*it)->getNumValues(); i != e; ++i)
259 Output.push_back((*it)->getValue(i));
263 void ArgList::AddAllArgsTranslated(ArgStringList &Output, OptSpecifier Id0,
264 const char *Translation,
266 for (arg_iterator it = filtered_begin(Id0),
267 ie = filtered_end(); it != ie; ++it) {
271 Output.push_back(MakeArgString(StringRef(Translation) +
272 (*it)->getValue(0)));
274 Output.push_back(Translation);
275 Output.push_back((*it)->getValue(0));
280 void ArgList::ClaimAllArgs(OptSpecifier Id0) const {
281 for (arg_iterator it = filtered_begin(Id0),
282 ie = filtered_end(); it != ie; ++it)
286 void ArgList::ClaimAllArgs() const {
287 for (const_iterator it = begin(), ie = end(); it != ie; ++it)
288 if (!(*it)->isClaimed())
292 const char *ArgList::MakeArgString(const Twine &T) const {
293 SmallString<256> Str;
294 return MakeArgString(T.toStringRef(Str));
297 const char *ArgList::GetOrMakeJoinedArgString(unsigned Index,
299 StringRef RHS) const {
300 StringRef Cur = getArgString(Index);
301 if (Cur.size() == LHS.size() + RHS.size() &&
302 Cur.startswith(LHS) && Cur.endswith(RHS))
305 return MakeArgString(LHS + RHS);
310 InputArgList::InputArgList(const char* const *ArgBegin,
311 const char* const *ArgEnd)
312 : NumInputArgStrings(ArgEnd - ArgBegin) {
313 ArgStrings.append(ArgBegin, ArgEnd);
316 InputArgList::~InputArgList() {
317 // An InputArgList always owns its arguments.
318 for (iterator it = begin(), ie = end(); it != ie; ++it)
322 unsigned InputArgList::MakeIndex(StringRef String0) const {
323 unsigned Index = ArgStrings.size();
325 // Tuck away so we have a reliable const char *.
326 SynthesizedStrings.push_back(String0);
327 ArgStrings.push_back(SynthesizedStrings.back().c_str());
332 unsigned InputArgList::MakeIndex(StringRef String0,
333 StringRef String1) const {
334 unsigned Index0 = MakeIndex(String0);
335 unsigned Index1 = MakeIndex(String1);
336 assert(Index0 + 1 == Index1 && "Unexpected non-consecutive indices!");
341 const char *InputArgList::MakeArgString(StringRef Str) const {
342 return getArgString(MakeIndex(Str));
347 DerivedArgList::DerivedArgList(const InputArgList &_BaseArgs)
348 : BaseArgs(_BaseArgs) {
351 DerivedArgList::~DerivedArgList() {
352 // We only own the arguments we explicitly synthesized.
353 for (iterator it = SynthesizedArgs.begin(), ie = SynthesizedArgs.end();
358 const char *DerivedArgList::MakeArgString(StringRef Str) const {
359 return BaseArgs.MakeArgString(Str);
362 Arg *DerivedArgList::MakeFlagArg(const Arg *BaseArg, const Option Opt) const {
363 Arg *A = new Arg(Opt, ArgList::MakeArgString(Twine(Opt.getPrefix()) +
364 Twine(Opt.getName())),
365 BaseArgs.MakeIndex(Opt.getName()), BaseArg);
366 SynthesizedArgs.push_back(A);
370 Arg *DerivedArgList::MakePositionalArg(const Arg *BaseArg, const Option Opt,
371 StringRef Value) const {
372 unsigned Index = BaseArgs.MakeIndex(Value);
373 Arg *A = new Arg(Opt, ArgList::MakeArgString(Twine(Opt.getPrefix()) +
374 Twine(Opt.getName())),
375 Index, BaseArgs.getArgString(Index), BaseArg);
376 SynthesizedArgs.push_back(A);
380 Arg *DerivedArgList::MakeSeparateArg(const Arg *BaseArg, const Option Opt,
381 StringRef Value) const {
382 unsigned Index = BaseArgs.MakeIndex(Opt.getName(), Value);
383 Arg *A = new Arg(Opt, ArgList::MakeArgString(Twine(Opt.getPrefix()) +
384 Twine(Opt.getName())),
385 Index, BaseArgs.getArgString(Index + 1), BaseArg);
386 SynthesizedArgs.push_back(A);
390 Arg *DerivedArgList::MakeJoinedArg(const Arg *BaseArg, const Option Opt,
391 StringRef Value) const {
392 unsigned Index = BaseArgs.MakeIndex(Opt.getName().str() + Value.str());
393 Arg *A = new Arg(Opt, ArgList::MakeArgString(Twine(Opt.getPrefix()) +
394 Twine(Opt.getName())), Index,
395 BaseArgs.getArgString(Index) + Opt.getName().size(),
397 SynthesizedArgs.push_back(A);