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"
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/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)))
44 void ArgList::append(Arg *A) {
48 void ArgList::eraseArg(OptSpecifier Id) {
49 for (iterator it = begin(), ie = end(); it != ie; ) {
50 if ((*it)->getOption().matches(Id)) {
59 Arg *ArgList::getLastArgNoClaim(OptSpecifier Id) const {
60 // FIXME: Make search efficient?
61 for (const_reverse_iterator it = rbegin(), ie = rend(); it != ie; ++it)
62 if ((*it)->getOption().matches(Id))
67 Arg *ArgList::getLastArg(OptSpecifier Id) const {
69 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
70 if ((*it)->getOption().matches(Id)) {
79 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1) const {
81 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
82 if ((*it)->getOption().matches(Id0) ||
83 (*it)->getOption().matches(Id1)) {
93 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
94 OptSpecifier Id2) const {
96 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
97 if ((*it)->getOption().matches(Id0) ||
98 (*it)->getOption().matches(Id1) ||
99 (*it)->getOption().matches(Id2)) {
108 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
109 OptSpecifier Id2, OptSpecifier Id3) const {
111 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
112 if ((*it)->getOption().matches(Id0) ||
113 (*it)->getOption().matches(Id1) ||
114 (*it)->getOption().matches(Id2) ||
115 (*it)->getOption().matches(Id3)) {
124 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
125 OptSpecifier Id2, OptSpecifier Id3,
126 OptSpecifier Id4) 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) ||
133 (*it)->getOption().matches(Id4)) {
142 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
143 OptSpecifier Id2, OptSpecifier Id3,
144 OptSpecifier Id4, OptSpecifier Id5) const {
146 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
147 if ((*it)->getOption().matches(Id0) ||
148 (*it)->getOption().matches(Id1) ||
149 (*it)->getOption().matches(Id2) ||
150 (*it)->getOption().matches(Id3) ||
151 (*it)->getOption().matches(Id4) ||
152 (*it)->getOption().matches(Id5)) {
161 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
162 OptSpecifier Id2, OptSpecifier Id3,
163 OptSpecifier Id4, OptSpecifier Id5,
164 OptSpecifier Id6) const {
166 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
167 if ((*it)->getOption().matches(Id0) ||
168 (*it)->getOption().matches(Id1) ||
169 (*it)->getOption().matches(Id2) ||
170 (*it)->getOption().matches(Id3) ||
171 (*it)->getOption().matches(Id4) ||
172 (*it)->getOption().matches(Id5) ||
173 (*it)->getOption().matches(Id6)) {
182 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
183 OptSpecifier Id2, OptSpecifier Id3,
184 OptSpecifier Id4, OptSpecifier Id5,
185 OptSpecifier Id6, OptSpecifier Id7) const {
187 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
188 if ((*it)->getOption().matches(Id0) ||
189 (*it)->getOption().matches(Id1) ||
190 (*it)->getOption().matches(Id2) ||
191 (*it)->getOption().matches(Id3) ||
192 (*it)->getOption().matches(Id4) ||
193 (*it)->getOption().matches(Id5) ||
194 (*it)->getOption().matches(Id6) ||
195 (*it)->getOption().matches(Id7)) {
204 bool ArgList::hasFlag(OptSpecifier Pos, OptSpecifier Neg, bool Default) const {
205 if (Arg *A = getLastArg(Pos, Neg))
206 return A->getOption().matches(Pos);
210 StringRef ArgList::getLastArgValue(OptSpecifier Id,
211 StringRef Default) const {
212 if (Arg *A = getLastArg(Id))
213 return A->getValue();
217 std::vector<std::string> ArgList::getAllArgValues(OptSpecifier Id) const {
218 SmallVector<const char *, 16> Values;
219 AddAllArgValues(Values, Id);
220 return std::vector<std::string>(Values.begin(), Values.end());
223 void ArgList::AddLastArg(ArgStringList &Output, OptSpecifier Id) const {
224 if (Arg *A = getLastArg(Id)) {
226 A->render(*this, Output);
230 void ArgList::AddAllArgs(ArgStringList &Output, OptSpecifier Id0,
231 OptSpecifier Id1, OptSpecifier Id2) const {
232 for (arg_iterator it = filtered_begin(Id0, Id1, Id2),
233 ie = filtered_end(); it != ie; ++it) {
235 (*it)->render(*this, Output);
239 void ArgList::AddAllArgValues(ArgStringList &Output, OptSpecifier Id0,
240 OptSpecifier Id1, OptSpecifier Id2) const {
241 for (arg_iterator it = filtered_begin(Id0, Id1, Id2),
242 ie = filtered_end(); it != ie; ++it) {
244 for (unsigned i = 0, e = (*it)->getNumValues(); i != e; ++i)
245 Output.push_back((*it)->getValue(i));
249 void ArgList::AddAllArgsTranslated(ArgStringList &Output, OptSpecifier Id0,
250 const char *Translation,
252 for (arg_iterator it = filtered_begin(Id0),
253 ie = filtered_end(); it != ie; ++it) {
257 Output.push_back(MakeArgString(StringRef(Translation) +
258 (*it)->getValue(0)));
260 Output.push_back(Translation);
261 Output.push_back((*it)->getValue(0));
266 void ArgList::ClaimAllArgs(OptSpecifier Id0) const {
267 for (arg_iterator it = filtered_begin(Id0),
268 ie = filtered_end(); it != ie; ++it)
272 void ArgList::ClaimAllArgs() const {
273 for (const_iterator it = begin(), ie = end(); it != ie; ++it)
274 if (!(*it)->isClaimed())
278 const char *ArgList::MakeArgString(const Twine &T) const {
279 SmallString<256> Str;
281 return MakeArgString(Str.str());
284 const char *ArgList::GetOrMakeJoinedArgString(unsigned Index,
286 StringRef RHS) const {
287 StringRef Cur = getArgString(Index);
288 if (Cur.size() == LHS.size() + RHS.size() &&
289 Cur.startswith(LHS) && Cur.endswith(RHS))
292 return MakeArgString(LHS + RHS);
297 InputArgList::InputArgList(const char* const *ArgBegin,
298 const char* const *ArgEnd)
299 : NumInputArgStrings(ArgEnd - ArgBegin) {
300 ArgStrings.append(ArgBegin, ArgEnd);
303 InputArgList::~InputArgList() {
304 // An InputArgList always owns its arguments.
305 for (iterator it = begin(), ie = end(); it != ie; ++it)
309 unsigned InputArgList::MakeIndex(StringRef String0) const {
310 unsigned Index = ArgStrings.size();
312 // Tuck away so we have a reliable const char *.
313 SynthesizedStrings.push_back(String0);
314 ArgStrings.push_back(SynthesizedStrings.back().c_str());
319 unsigned InputArgList::MakeIndex(StringRef String0,
320 StringRef String1) const {
321 unsigned Index0 = MakeIndex(String0);
322 unsigned Index1 = MakeIndex(String1);
323 assert(Index0 + 1 == Index1 && "Unexpected non-consecutive indices!");
328 const char *InputArgList::MakeArgString(StringRef Str) const {
329 return getArgString(MakeIndex(Str));
334 DerivedArgList::DerivedArgList(const InputArgList &_BaseArgs)
335 : BaseArgs(_BaseArgs) {
338 DerivedArgList::~DerivedArgList() {
339 // We only own the arguments we explicitly synthesized.
340 for (iterator it = SynthesizedArgs.begin(), ie = SynthesizedArgs.end();
345 const char *DerivedArgList::MakeArgString(StringRef Str) const {
346 return BaseArgs.MakeArgString(Str);
349 Arg *DerivedArgList::MakeFlagArg(const Arg *BaseArg, const Option Opt) const {
350 Arg *A = new Arg(Opt, ArgList::MakeArgString(Twine(Opt.getPrefix()) +
351 Twine(Opt.getName())),
352 BaseArgs.MakeIndex(Opt.getName()), BaseArg);
353 SynthesizedArgs.push_back(A);
357 Arg *DerivedArgList::MakePositionalArg(const Arg *BaseArg, const Option Opt,
358 StringRef Value) const {
359 unsigned Index = BaseArgs.MakeIndex(Value);
360 Arg *A = new Arg(Opt, ArgList::MakeArgString(Twine(Opt.getPrefix()) +
361 Twine(Opt.getName())),
362 Index, BaseArgs.getArgString(Index), BaseArg);
363 SynthesizedArgs.push_back(A);
367 Arg *DerivedArgList::MakeSeparateArg(const Arg *BaseArg, const Option Opt,
368 StringRef Value) const {
369 unsigned Index = BaseArgs.MakeIndex(Opt.getName(), Value);
370 Arg *A = new Arg(Opt, ArgList::MakeArgString(Twine(Opt.getPrefix()) +
371 Twine(Opt.getName())),
372 Index, BaseArgs.getArgString(Index + 1), BaseArg);
373 SynthesizedArgs.push_back(A);
377 Arg *DerivedArgList::MakeJoinedArg(const Arg *BaseArg, const Option Opt,
378 StringRef Value) const {
379 unsigned Index = BaseArgs.MakeIndex(Opt.getName().str() + Value.str());
380 Arg *A = new Arg(Opt, ArgList::MakeArgString(Twine(Opt.getPrefix()) +
381 Twine(Opt.getName())), Index,
382 BaseArgs.getArgString(Index) + Opt.getName().size(),
384 SynthesizedArgs.push_back(A);