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 bool ArgList::hasFlag(OptSpecifier Pos, OptSpecifier Neg, bool Default) const {
144 if (Arg *A = getLastArg(Pos, Neg))
145 return A->getOption().matches(Pos);
149 StringRef ArgList::getLastArgValue(OptSpecifier Id,
150 StringRef Default) const {
151 if (Arg *A = getLastArg(Id))
152 return A->getValue(*this);
156 int ArgList::getLastArgIntValue(OptSpecifier Id, int Default,
157 clang::DiagnosticsEngine *Diags) const {
160 if (Arg *A = getLastArg(Id)) {
161 if (StringRef(A->getValue(*this)).getAsInteger(10, Res)) {
163 Diags->Report(diag::err_drv_invalid_int_value)
164 << A->getAsString(*this) << A->getValue(*this);
171 std::vector<std::string> ArgList::getAllArgValues(OptSpecifier Id) const {
172 SmallVector<const char *, 16> Values;
173 AddAllArgValues(Values, Id);
174 return std::vector<std::string>(Values.begin(), Values.end());
177 void ArgList::AddLastArg(ArgStringList &Output, OptSpecifier Id) const {
178 if (Arg *A = getLastArg(Id)) {
180 A->render(*this, Output);
184 void ArgList::AddAllArgs(ArgStringList &Output, OptSpecifier Id0,
185 OptSpecifier Id1, OptSpecifier Id2) const {
186 for (arg_iterator it = filtered_begin(Id0, Id1, Id2),
187 ie = filtered_end(); it != ie; ++it) {
189 (*it)->render(*this, Output);
193 void ArgList::AddAllArgValues(ArgStringList &Output, OptSpecifier Id0,
194 OptSpecifier Id1, OptSpecifier Id2) const {
195 for (arg_iterator it = filtered_begin(Id0, Id1, Id2),
196 ie = filtered_end(); it != ie; ++it) {
198 for (unsigned i = 0, e = (*it)->getNumValues(); i != e; ++i)
199 Output.push_back((*it)->getValue(*this, i));
203 void ArgList::AddAllArgsTranslated(ArgStringList &Output, OptSpecifier Id0,
204 const char *Translation,
206 for (arg_iterator it = filtered_begin(Id0),
207 ie = filtered_end(); it != ie; ++it) {
211 Output.push_back(MakeArgString(StringRef(Translation) +
212 (*it)->getValue(*this, 0)));
214 Output.push_back(Translation);
215 Output.push_back((*it)->getValue(*this, 0));
220 void ArgList::ClaimAllArgs(OptSpecifier Id0) const {
221 for (arg_iterator it = filtered_begin(Id0),
222 ie = filtered_end(); it != ie; ++it)
226 void ArgList::ClaimAllArgs() const {
227 for (const_iterator it = begin(), ie = end(); it != ie; ++it)
228 if (!(*it)->isClaimed())
232 const char *ArgList::MakeArgString(const Twine &T) const {
233 SmallString<256> Str;
235 return MakeArgString(Str.str());
238 const char *ArgList::GetOrMakeJoinedArgString(unsigned Index,
240 StringRef RHS) const {
241 StringRef Cur = getArgString(Index);
242 if (Cur.size() == LHS.size() + RHS.size() &&
243 Cur.startswith(LHS) && Cur.endswith(RHS))
246 return MakeArgString(LHS + RHS);
251 InputArgList::InputArgList(const char* const *ArgBegin,
252 const char* const *ArgEnd)
253 : NumInputArgStrings(ArgEnd - ArgBegin) {
254 ArgStrings.append(ArgBegin, ArgEnd);
257 InputArgList::~InputArgList() {
258 // An InputArgList always owns its arguments.
259 for (iterator it = begin(), ie = end(); it != ie; ++it)
263 unsigned InputArgList::MakeIndex(StringRef String0) const {
264 unsigned Index = ArgStrings.size();
266 // Tuck away so we have a reliable const char *.
267 SynthesizedStrings.push_back(String0);
268 ArgStrings.push_back(SynthesizedStrings.back().c_str());
273 unsigned InputArgList::MakeIndex(StringRef String0,
274 StringRef String1) const {
275 unsigned Index0 = MakeIndex(String0);
276 unsigned Index1 = MakeIndex(String1);
277 assert(Index0 + 1 == Index1 && "Unexpected non-consecutive indices!");
282 const char *InputArgList::MakeArgString(StringRef Str) const {
283 return getArgString(MakeIndex(Str));
288 DerivedArgList::DerivedArgList(const InputArgList &_BaseArgs)
289 : BaseArgs(_BaseArgs) {
292 DerivedArgList::~DerivedArgList() {
293 // We only own the arguments we explicitly synthesized.
294 for (iterator it = SynthesizedArgs.begin(), ie = SynthesizedArgs.end();
299 const char *DerivedArgList::MakeArgString(StringRef Str) const {
300 return BaseArgs.MakeArgString(Str);
303 Arg *DerivedArgList::MakeFlagArg(const Arg *BaseArg, const Option *Opt) const {
304 Arg *A = new Arg(Opt, BaseArgs.MakeIndex(Opt->getName()), BaseArg);
305 SynthesizedArgs.push_back(A);
309 Arg *DerivedArgList::MakePositionalArg(const Arg *BaseArg, const Option *Opt,
310 StringRef Value) const {
311 unsigned Index = BaseArgs.MakeIndex(Value);
312 Arg *A = new Arg(Opt, Index, BaseArgs.getArgString(Index), BaseArg);
313 SynthesizedArgs.push_back(A);
317 Arg *DerivedArgList::MakeSeparateArg(const Arg *BaseArg, const Option *Opt,
318 StringRef Value) const {
319 unsigned Index = BaseArgs.MakeIndex(Opt->getName(), Value);
320 Arg *A = new Arg(Opt, Index, BaseArgs.getArgString(Index + 1), BaseArg);
321 SynthesizedArgs.push_back(A);
325 Arg *DerivedArgList::MakeJoinedArg(const Arg *BaseArg, const Option *Opt,
326 StringRef Value) const {
327 unsigned Index = BaseArgs.MakeIndex(Opt->getName().str() + Value.str());
328 Arg *A = new Arg(Opt, Index,
329 BaseArgs.getArgString(Index) + Opt->getName().size(),
331 SynthesizedArgs.push_back(A);