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 Arg *ArgList::getLastArgNoClaim(OptSpecifier Id) const {
50 // FIXME: Make search efficient?
51 for (const_reverse_iterator it = rbegin(), ie = rend(); it != ie; ++it)
52 if ((*it)->getOption().matches(Id))
57 Arg *ArgList::getLastArg(OptSpecifier Id) const {
58 Arg *A = getLastArgNoClaim(Id);
64 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1) const {
66 for (const_reverse_iterator it = rbegin(), ie = rend(); it != ie; ++it) {
67 if ((*it)->getOption().matches(Id0) ||
68 (*it)->getOption().matches(Id1)) {
80 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
81 OptSpecifier Id2) const {
83 for (const_reverse_iterator it = rbegin(), ie = rend(); it != ie; ++it) {
84 if ((*it)->getOption().matches(Id0) ||
85 (*it)->getOption().matches(Id1) ||
86 (*it)->getOption().matches(Id2)) {
98 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1,
99 OptSpecifier Id2, OptSpecifier Id3) const {
101 for (const_reverse_iterator it = rbegin(), ie = rend(); it != ie; ++it) {
102 if ((*it)->getOption().matches(Id0) ||
103 (*it)->getOption().matches(Id1) ||
104 (*it)->getOption().matches(Id2) ||
105 (*it)->getOption().matches(Id3)) {
117 bool ArgList::hasFlag(OptSpecifier Pos, OptSpecifier Neg, bool Default) const {
118 if (Arg *A = getLastArg(Pos, Neg))
119 return A->getOption().matches(Pos);
123 llvm::StringRef ArgList::getLastArgValue(OptSpecifier Id,
124 llvm::StringRef Default) const {
125 if (Arg *A = getLastArg(Id))
126 return A->getValue(*this);
130 int ArgList::getLastArgIntValue(OptSpecifier Id, int Default,
131 clang::Diagnostic &Diags) const {
134 if (Arg *A = getLastArg(Id)) {
135 if (llvm::StringRef(A->getValue(*this)).getAsInteger(10, Res))
136 Diags.Report(diag::err_drv_invalid_int_value)
137 << A->getAsString(*this) << A->getValue(*this);
143 std::vector<std::string> ArgList::getAllArgValues(OptSpecifier Id) const {
144 llvm::SmallVector<const char *, 16> Values;
145 AddAllArgValues(Values, Id);
146 return std::vector<std::string>(Values.begin(), Values.end());
149 void ArgList::AddLastArg(ArgStringList &Output, OptSpecifier Id) const {
150 if (Arg *A = getLastArg(Id)) {
152 A->render(*this, Output);
156 void ArgList::AddAllArgs(ArgStringList &Output, OptSpecifier Id0,
157 OptSpecifier Id1, OptSpecifier Id2) const {
158 for (arg_iterator it = filtered_begin(Id0, Id1, Id2),
159 ie = filtered_end(); it != ie; ++it) {
161 (*it)->render(*this, Output);
165 void ArgList::AddAllArgValues(ArgStringList &Output, OptSpecifier Id0,
166 OptSpecifier Id1, OptSpecifier Id2) const {
167 for (arg_iterator it = filtered_begin(Id0, Id1, Id2),
168 ie = filtered_end(); it != ie; ++it) {
170 for (unsigned i = 0, e = (*it)->getNumValues(); i != e; ++i)
171 Output.push_back((*it)->getValue(*this, i));
175 void ArgList::AddAllArgsTranslated(ArgStringList &Output, OptSpecifier Id0,
176 const char *Translation,
178 for (arg_iterator it = filtered_begin(Id0),
179 ie = filtered_end(); it != ie; ++it) {
183 Output.push_back(MakeArgString(llvm::StringRef(Translation) +
184 (*it)->getValue(*this, 0)));
186 Output.push_back(Translation);
187 Output.push_back((*it)->getValue(*this, 0));
192 void ArgList::ClaimAllArgs(OptSpecifier Id0) const {
193 for (arg_iterator it = filtered_begin(Id0),
194 ie = filtered_end(); it != ie; ++it)
198 const char *ArgList::MakeArgString(const llvm::Twine &T) const {
199 llvm::SmallString<256> Str;
201 return MakeArgString(Str.str());
204 const char *ArgList::GetOrMakeJoinedArgString(unsigned Index,
206 llvm::StringRef RHS) const {
207 llvm::StringRef Cur = getArgString(Index);
208 if (Cur.size() == LHS.size() + RHS.size() &&
209 Cur.startswith(LHS) && Cur.endswith(RHS))
212 return MakeArgString(LHS + RHS);
217 InputArgList::InputArgList(const char **ArgBegin, const char **ArgEnd)
218 : NumInputArgStrings(ArgEnd - ArgBegin) {
219 ArgStrings.append(ArgBegin, ArgEnd);
222 InputArgList::~InputArgList() {
223 // An InputArgList always owns its arguments.
224 for (iterator it = begin(), ie = end(); it != ie; ++it)
228 unsigned InputArgList::MakeIndex(llvm::StringRef String0) const {
229 unsigned Index = ArgStrings.size();
231 // Tuck away so we have a reliable const char *.
232 SynthesizedStrings.push_back(String0);
233 ArgStrings.push_back(SynthesizedStrings.back().c_str());
238 unsigned InputArgList::MakeIndex(llvm::StringRef String0,
239 llvm::StringRef String1) const {
240 unsigned Index0 = MakeIndex(String0);
241 unsigned Index1 = MakeIndex(String1);
242 assert(Index0 + 1 == Index1 && "Unexpected non-consecutive indices!");
247 const char *InputArgList::MakeArgString(llvm::StringRef Str) const {
248 return getArgString(MakeIndex(Str));
253 DerivedArgList::DerivedArgList(const InputArgList &_BaseArgs)
254 : BaseArgs(_BaseArgs) {
257 DerivedArgList::~DerivedArgList() {
258 // We only own the arguments we explicitly synthesized.
259 for (iterator it = SynthesizedArgs.begin(), ie = SynthesizedArgs.end();
264 const char *DerivedArgList::MakeArgString(llvm::StringRef Str) const {
265 return BaseArgs.MakeArgString(Str);
268 Arg *DerivedArgList::MakeFlagArg(const Arg *BaseArg, const Option *Opt) const {
269 Arg *A = new Arg(Opt, BaseArgs.MakeIndex(Opt->getName()), BaseArg);
270 SynthesizedArgs.push_back(A);
274 Arg *DerivedArgList::MakePositionalArg(const Arg *BaseArg, const Option *Opt,
275 llvm::StringRef Value) const {
276 unsigned Index = BaseArgs.MakeIndex(Value);
277 Arg *A = new Arg(Opt, Index, BaseArgs.getArgString(Index), BaseArg);
278 SynthesizedArgs.push_back(A);
282 Arg *DerivedArgList::MakeSeparateArg(const Arg *BaseArg, const Option *Opt,
283 llvm::StringRef Value) const {
284 unsigned Index = BaseArgs.MakeIndex(Opt->getName(), Value);
285 Arg *A = new Arg(Opt, Index, BaseArgs.getArgString(Index + 1), BaseArg);
286 SynthesizedArgs.push_back(A);
290 Arg *DerivedArgList::MakeJoinedArg(const Arg *BaseArg, const Option *Opt,
291 llvm::StringRef Value) const {
292 unsigned Index = BaseArgs.MakeIndex(Opt->getName() + Value.str());
293 Arg *A = new Arg(Opt, Index,
294 BaseArgs.getArgString(Index) + strlen(Opt->getName()),
296 SynthesizedArgs.push_back(A);