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 "clang/Driver/ArgList.h"
11 #include "clang/Driver/Arg.h"
12 #include "clang/Driver/DriverDiagnostic.h"
13 #include "clang/Driver/Option.h"
15 #include "llvm/ADT/SmallString.h"
16 #include "llvm/ADT/Twine.h"
17 #include "llvm/Support/raw_ostream.h"
19 using namespace clang;
20 using namespace clang::driver;
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)))
45 void ArgList::append(Arg *A) {
49 void ArgList::eraseArg(OptSpecifier Id) {
50 for (iterator it = begin(), ie = end(); it != ie; ) {
51 if ((*it)->getOption().matches(Id)) {
60 Arg *ArgList::getLastArgNoClaim(OptSpecifier Id) const {
61 // FIXME: Make search efficient?
62 for (const_reverse_iterator it = rbegin(), ie = rend(); it != ie; ++it)
63 if ((*it)->getOption().matches(Id))
68 Arg *ArgList::getLastArg(OptSpecifier Id) const {
70 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
71 if ((*it)->getOption().matches(Id)) {
80 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1) const {
82 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
83 if ((*it)->getOption().matches(Id0) ||
84 (*it)->getOption().matches(Id1)) {
94 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
95 OptSpecifier Id2) const {
97 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
98 if ((*it)->getOption().matches(Id0) ||
99 (*it)->getOption().matches(Id1) ||
100 (*it)->getOption().matches(Id2)) {
109 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
110 OptSpecifier Id2, OptSpecifier Id3) const {
112 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
113 if ((*it)->getOption().matches(Id0) ||
114 (*it)->getOption().matches(Id1) ||
115 (*it)->getOption().matches(Id2) ||
116 (*it)->getOption().matches(Id3)) {
125 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
126 OptSpecifier Id2, OptSpecifier Id3,
127 OptSpecifier Id4) const {
129 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
130 if ((*it)->getOption().matches(Id0) ||
131 (*it)->getOption().matches(Id1) ||
132 (*it)->getOption().matches(Id2) ||
133 (*it)->getOption().matches(Id3) ||
134 (*it)->getOption().matches(Id4)) {
143 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
144 OptSpecifier Id2, OptSpecifier Id3,
145 OptSpecifier Id4, OptSpecifier Id5) const {
147 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
148 if ((*it)->getOption().matches(Id0) ||
149 (*it)->getOption().matches(Id1) ||
150 (*it)->getOption().matches(Id2) ||
151 (*it)->getOption().matches(Id3) ||
152 (*it)->getOption().matches(Id4) ||
153 (*it)->getOption().matches(Id5)) {
162 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
163 OptSpecifier Id2, OptSpecifier Id3,
164 OptSpecifier Id4, OptSpecifier Id5,
165 OptSpecifier Id6) const {
167 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
168 if ((*it)->getOption().matches(Id0) ||
169 (*it)->getOption().matches(Id1) ||
170 (*it)->getOption().matches(Id2) ||
171 (*it)->getOption().matches(Id3) ||
172 (*it)->getOption().matches(Id4) ||
173 (*it)->getOption().matches(Id5) ||
174 (*it)->getOption().matches(Id6)) {
183 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
184 OptSpecifier Id2, OptSpecifier Id3,
185 OptSpecifier Id4, OptSpecifier Id5,
186 OptSpecifier Id6, OptSpecifier Id7) const {
188 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
189 if ((*it)->getOption().matches(Id0) ||
190 (*it)->getOption().matches(Id1) ||
191 (*it)->getOption().matches(Id2) ||
192 (*it)->getOption().matches(Id3) ||
193 (*it)->getOption().matches(Id4) ||
194 (*it)->getOption().matches(Id5) ||
195 (*it)->getOption().matches(Id6) ||
196 (*it)->getOption().matches(Id7)) {
205 bool ArgList::hasFlag(OptSpecifier Pos, OptSpecifier Neg, bool Default) const {
206 if (Arg *A = getLastArg(Pos, Neg))
207 return A->getOption().matches(Pos);
211 StringRef ArgList::getLastArgValue(OptSpecifier Id,
212 StringRef Default) const {
213 if (Arg *A = getLastArg(Id))
214 return A->getValue();
218 int ArgList::getLastArgIntValue(OptSpecifier Id, int Default,
219 clang::DiagnosticsEngine *Diags) const {
222 if (Arg *A = getLastArg(Id)) {
223 if (StringRef(A->getValue()).getAsInteger(10, Res)) {
225 Diags->Report(diag::err_drv_invalid_int_value)
226 << A->getAsString(*this) << A->getValue();
233 std::vector<std::string> ArgList::getAllArgValues(OptSpecifier Id) const {
234 SmallVector<const char *, 16> Values;
235 AddAllArgValues(Values, Id);
236 return std::vector<std::string>(Values.begin(), Values.end());
239 void ArgList::AddLastArg(ArgStringList &Output, OptSpecifier Id) const {
240 if (Arg *A = getLastArg(Id)) {
242 A->render(*this, Output);
246 void ArgList::AddAllArgs(ArgStringList &Output, OptSpecifier Id0,
247 OptSpecifier Id1, OptSpecifier Id2) const {
248 for (arg_iterator it = filtered_begin(Id0, Id1, Id2),
249 ie = filtered_end(); it != ie; ++it) {
251 (*it)->render(*this, Output);
255 void ArgList::AddAllArgValues(ArgStringList &Output, OptSpecifier Id0,
256 OptSpecifier Id1, OptSpecifier Id2) const {
257 for (arg_iterator it = filtered_begin(Id0, Id1, Id2),
258 ie = filtered_end(); it != ie; ++it) {
260 for (unsigned i = 0, e = (*it)->getNumValues(); i != e; ++i)
261 Output.push_back((*it)->getValue(i));
265 void ArgList::AddAllArgsTranslated(ArgStringList &Output, OptSpecifier Id0,
266 const char *Translation,
268 for (arg_iterator it = filtered_begin(Id0),
269 ie = filtered_end(); it != ie; ++it) {
273 Output.push_back(MakeArgString(StringRef(Translation) +
274 (*it)->getValue(0)));
276 Output.push_back(Translation);
277 Output.push_back((*it)->getValue(0));
282 void ArgList::ClaimAllArgs(OptSpecifier Id0) const {
283 for (arg_iterator it = filtered_begin(Id0),
284 ie = filtered_end(); it != ie; ++it)
288 void ArgList::ClaimAllArgs() const {
289 for (const_iterator it = begin(), ie = end(); it != ie; ++it)
290 if (!(*it)->isClaimed())
294 const char *ArgList::MakeArgString(const Twine &T) const {
295 SmallString<256> Str;
297 return MakeArgString(Str.str());
300 const char *ArgList::GetOrMakeJoinedArgString(unsigned Index,
302 StringRef RHS) const {
303 StringRef Cur = getArgString(Index);
304 if (Cur.size() == LHS.size() + RHS.size() &&
305 Cur.startswith(LHS) && Cur.endswith(RHS))
308 return MakeArgString(LHS + RHS);
313 InputArgList::InputArgList(const char* const *ArgBegin,
314 const char* const *ArgEnd)
315 : NumInputArgStrings(ArgEnd - ArgBegin) {
316 ArgStrings.append(ArgBegin, ArgEnd);
319 InputArgList::~InputArgList() {
320 // An InputArgList always owns its arguments.
321 for (iterator it = begin(), ie = end(); it != ie; ++it)
325 unsigned InputArgList::MakeIndex(StringRef String0) const {
326 unsigned Index = ArgStrings.size();
328 // Tuck away so we have a reliable const char *.
329 SynthesizedStrings.push_back(String0);
330 ArgStrings.push_back(SynthesizedStrings.back().c_str());
335 unsigned InputArgList::MakeIndex(StringRef String0,
336 StringRef String1) const {
337 unsigned Index0 = MakeIndex(String0);
338 unsigned Index1 = MakeIndex(String1);
339 assert(Index0 + 1 == Index1 && "Unexpected non-consecutive indices!");
344 const char *InputArgList::MakeArgString(StringRef Str) const {
345 return getArgString(MakeIndex(Str));
350 DerivedArgList::DerivedArgList(const InputArgList &_BaseArgs)
351 : BaseArgs(_BaseArgs) {
354 DerivedArgList::~DerivedArgList() {
355 // We only own the arguments we explicitly synthesized.
356 for (iterator it = SynthesizedArgs.begin(), ie = SynthesizedArgs.end();
361 const char *DerivedArgList::MakeArgString(StringRef Str) const {
362 return BaseArgs.MakeArgString(Str);
365 Arg *DerivedArgList::MakeFlagArg(const Arg *BaseArg, const Option Opt) const {
366 Arg *A = new Arg(Opt, ArgList::MakeArgString(Twine(Opt.getPrefix()) +
367 Twine(Opt.getName())),
368 BaseArgs.MakeIndex(Opt.getName()), BaseArg);
369 SynthesizedArgs.push_back(A);
373 Arg *DerivedArgList::MakePositionalArg(const Arg *BaseArg, const Option Opt,
374 StringRef Value) const {
375 unsigned Index = BaseArgs.MakeIndex(Value);
376 Arg *A = new Arg(Opt, ArgList::MakeArgString(Twine(Opt.getPrefix()) +
377 Twine(Opt.getName())),
378 Index, BaseArgs.getArgString(Index), BaseArg);
379 SynthesizedArgs.push_back(A);
383 Arg *DerivedArgList::MakeSeparateArg(const Arg *BaseArg, const Option Opt,
384 StringRef Value) const {
385 unsigned Index = BaseArgs.MakeIndex(Opt.getName(), Value);
386 Arg *A = new Arg(Opt, ArgList::MakeArgString(Twine(Opt.getPrefix()) +
387 Twine(Opt.getName())),
388 Index, BaseArgs.getArgString(Index + 1), BaseArg);
389 SynthesizedArgs.push_back(A);
393 Arg *DerivedArgList::MakeJoinedArg(const Arg *BaseArg, const Option Opt,
394 StringRef Value) const {
395 unsigned Index = BaseArgs.MakeIndex(Opt.getName().str() + Value.str());
396 Arg *A = new Arg(Opt, ArgList::MakeArgString(Twine(Opt.getPrefix()) +
397 Twine(Opt.getName())), Index,
398 BaseArgs.getArgString(Index) + Opt.getName().size(),
400 SynthesizedArgs.push_back(A);