1 //===--- ArgList.cpp - Argument List Management ---------------------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is distributed under the University of Illinois Open Source 6 // License. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 10 #include "llvm/Option/ArgList.h" 11 #include "llvm/ADT/STLExtras.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" 17 18 using namespace llvm; 19 using namespace llvm::opt; 20 21 void arg_iterator::SkipToNextArg() { 22 for (; Current != Args.end(); ++Current) { 23 // Done if there are no filters. 24 if (!Id0.isValid()) 25 break; 26 27 // Otherwise require a match. 28 const Option &O = (*Current)->getOption(); 29 if (O.matches(Id0) || 30 (Id1.isValid() && O.matches(Id1)) || 31 (Id2.isValid() && O.matches(Id2))) 32 break; 33 } 34 } 35 36 ArgList::~ArgList() { 37 } 38 39 void ArgList::append(Arg *A) { 40 Args.push_back(A); 41 } 42 43 void ArgList::eraseArg(OptSpecifier Id) { 44 Args.erase(std::remove_if(begin(), end(), 45 [=](Arg *A) { return A->getOption().matches(Id); }), 46 end()); 47 } 48 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)) 53 return *it; 54 return nullptr; 55 } 56 57 Arg *ArgList::getLastArgNoClaim(OptSpecifier Id0, OptSpecifier Id1) const { 58 // FIXME: Make search efficient? 59 for (const_reverse_iterator it = rbegin(), ie = rend(); it != ie; ++it) 60 if ((*it)->getOption().matches(Id0) || 61 (*it)->getOption().matches(Id1)) 62 return *it; 63 return nullptr; 64 } 65 66 Arg *ArgList::getLastArg(OptSpecifier Id) const { 67 Arg *Res = nullptr; 68 for (const_iterator it = begin(), ie = end(); it != ie; ++it) { 69 if ((*it)->getOption().matches(Id)) { 70 Res = *it; 71 Res->claim(); 72 } 73 } 74 75 return Res; 76 } 77 78 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1) const { 79 Arg *Res = nullptr; 80 for (const_iterator it = begin(), ie = end(); it != ie; ++it) { 81 if ((*it)->getOption().matches(Id0) || 82 (*it)->getOption().matches(Id1)) { 83 Res = *it; 84 Res->claim(); 85 86 } 87 } 88 89 return Res; 90 } 91 92 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1, 93 OptSpecifier Id2) const { 94 Arg *Res = nullptr; 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)) { 99 Res = *it; 100 Res->claim(); 101 } 102 } 103 104 return Res; 105 } 106 107 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1, 108 OptSpecifier Id2, OptSpecifier Id3) const { 109 Arg *Res = nullptr; 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)) { 115 Res = *it; 116 Res->claim(); 117 } 118 } 119 120 return Res; 121 } 122 123 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1, 124 OptSpecifier Id2, OptSpecifier Id3, 125 OptSpecifier Id4) const { 126 Arg *Res = nullptr; 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)) { 133 Res = *it; 134 Res->claim(); 135 } 136 } 137 138 return Res; 139 } 140 141 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1, 142 OptSpecifier Id2, OptSpecifier Id3, 143 OptSpecifier Id4, OptSpecifier Id5) const { 144 Arg *Res = nullptr; 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)) { 152 Res = *it; 153 Res->claim(); 154 } 155 } 156 157 return Res; 158 } 159 160 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1, 161 OptSpecifier Id2, OptSpecifier Id3, 162 OptSpecifier Id4, OptSpecifier Id5, 163 OptSpecifier Id6) const { 164 Arg *Res = nullptr; 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)) { 173 Res = *it; 174 Res->claim(); 175 } 176 } 177 178 return Res; 179 } 180 181 Arg *ArgList::getLastArg(OptSpecifier Id0, OptSpecifier Id1, 182 OptSpecifier Id2, OptSpecifier Id3, 183 OptSpecifier Id4, OptSpecifier Id5, 184 OptSpecifier Id6, OptSpecifier Id7) const { 185 Arg *Res = nullptr; 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)) { 195 Res = *it; 196 Res->claim(); 197 } 198 } 199 200 return Res; 201 } 202 203 bool ArgList::hasFlag(OptSpecifier Pos, OptSpecifier Neg, bool Default) const { 204 if (Arg *A = getLastArg(Pos, Neg)) 205 return A->getOption().matches(Pos); 206 return Default; 207 } 208 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); 213 return Default; 214 } 215 216 StringRef ArgList::getLastArgValue(OptSpecifier Id, 217 StringRef Default) const { 218 if (Arg *A = getLastArg(Id)) 219 return A->getValue(); 220 return Default; 221 } 222 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()); 227 } 228 229 void ArgList::AddLastArg(ArgStringList &Output, OptSpecifier Id) const { 230 if (Arg *A = getLastArg(Id)) { 231 A->claim(); 232 A->render(*this, Output); 233 } 234 } 235 236 void ArgList::AddLastArg(ArgStringList &Output, OptSpecifier Id0, 237 OptSpecifier Id1) const { 238 if (Arg *A = getLastArg(Id0, Id1)) { 239 A->claim(); 240 A->render(*this, Output); 241 } 242 } 243 244 void ArgList::AddAllArgs(ArgStringList &Output, OptSpecifier Id0, 245 OptSpecifier Id1, OptSpecifier Id2) const { 246 for (auto Arg: filtered(Id0, Id1, Id2)) { 247 Arg->claim(); 248 Arg->render(*this, Output); 249 } 250 } 251 252 void ArgList::AddAllArgValues(ArgStringList &Output, OptSpecifier Id0, 253 OptSpecifier Id1, OptSpecifier Id2) const { 254 for (auto Arg : filtered(Id0, Id1, Id2)) { 255 Arg->claim(); 256 const auto &Values = Arg->getValues(); 257 Output.append(Values.begin(), Values.end()); 258 } 259 } 260 261 void ArgList::AddAllArgsTranslated(ArgStringList &Output, OptSpecifier Id0, 262 const char *Translation, 263 bool Joined) const { 264 for (auto Arg: filtered(Id0)) { 265 Arg->claim(); 266 267 if (Joined) { 268 Output.push_back(MakeArgString(StringRef(Translation) + 269 Arg->getValue(0))); 270 } else { 271 Output.push_back(Translation); 272 Output.push_back(Arg->getValue(0)); 273 } 274 } 275 } 276 277 void ArgList::ClaimAllArgs(OptSpecifier Id0) const { 278 for (auto Arg : filtered(Id0)) 279 Arg->claim(); 280 } 281 282 void ArgList::ClaimAllArgs() const { 283 for (const_iterator it = begin(), ie = end(); it != ie; ++it) 284 if (!(*it)->isClaimed()) 285 (*it)->claim(); 286 } 287 288 const char *ArgList::MakeArgString(const Twine &T) const { 289 SmallString<256> Str; 290 return MakeArgString(T.toStringRef(Str)); 291 } 292 293 const char *ArgList::GetOrMakeJoinedArgString(unsigned Index, 294 StringRef LHS, 295 StringRef RHS) const { 296 StringRef Cur = getArgString(Index); 297 if (Cur.size() == LHS.size() + RHS.size() && 298 Cur.startswith(LHS) && Cur.endswith(RHS)) 299 return Cur.data(); 300 301 return MakeArgString(LHS + RHS); 302 } 303 304 // 305 306 InputArgList::InputArgList(const char* const *ArgBegin, 307 const char* const *ArgEnd) 308 : NumInputArgStrings(ArgEnd - ArgBegin) { 309 ArgStrings.append(ArgBegin, ArgEnd); 310 } 311 312 InputArgList::~InputArgList() { 313 // An InputArgList always owns its arguments. 314 for (iterator it = begin(), ie = end(); it != ie; ++it) 315 delete *it; 316 } 317 318 unsigned InputArgList::MakeIndex(StringRef String0) const { 319 unsigned Index = ArgStrings.size(); 320 321 // Tuck away so we have a reliable const char *. 322 SynthesizedStrings.push_back(String0); 323 ArgStrings.push_back(SynthesizedStrings.back().c_str()); 324 325 return Index; 326 } 327 328 unsigned InputArgList::MakeIndex(StringRef String0, 329 StringRef String1) const { 330 unsigned Index0 = MakeIndex(String0); 331 unsigned Index1 = MakeIndex(String1); 332 assert(Index0 + 1 == Index1 && "Unexpected non-consecutive indices!"); 333 (void) Index1; 334 return Index0; 335 } 336 337 const char *InputArgList::MakeArgString(StringRef Str) const { 338 return getArgString(MakeIndex(Str)); 339 } 340 341 // 342 343 DerivedArgList::DerivedArgList(const InputArgList &_BaseArgs) 344 : BaseArgs(_BaseArgs) { 345 } 346 347 DerivedArgList::~DerivedArgList() {} 348 349 const char *DerivedArgList::MakeArgString(StringRef Str) const { 350 return BaseArgs.MakeArgString(Str); 351 } 352 353 void DerivedArgList::AddSynthesizedArg(Arg *A) { 354 SynthesizedArgs.push_back(std::unique_ptr<Arg>(A)); 355 } 356 357 Arg *DerivedArgList::MakeFlagArg(const Arg *BaseArg, const Option Opt) const { 358 SynthesizedArgs.push_back( 359 make_unique<Arg>(Opt, MakeArgString(Opt.getPrefix() + Opt.getName()), 360 BaseArgs.MakeIndex(Opt.getName()), BaseArg)); 361 return SynthesizedArgs.back().get(); 362 } 363 364 Arg *DerivedArgList::MakePositionalArg(const Arg *BaseArg, const Option Opt, 365 StringRef Value) const { 366 unsigned Index = BaseArgs.MakeIndex(Value); 367 SynthesizedArgs.push_back( 368 make_unique<Arg>(Opt, MakeArgString(Opt.getPrefix() + Opt.getName()), 369 Index, BaseArgs.getArgString(Index), BaseArg)); 370 return SynthesizedArgs.back().get(); 371 } 372 373 Arg *DerivedArgList::MakeSeparateArg(const Arg *BaseArg, const Option Opt, 374 StringRef Value) const { 375 unsigned Index = BaseArgs.MakeIndex(Opt.getName(), Value); 376 SynthesizedArgs.push_back( 377 make_unique<Arg>(Opt, MakeArgString(Opt.getPrefix() + Opt.getName()), 378 Index, BaseArgs.getArgString(Index + 1), BaseArg)); 379 return SynthesizedArgs.back().get(); 380 } 381 382 Arg *DerivedArgList::MakeJoinedArg(const Arg *BaseArg, const Option Opt, 383 StringRef Value) const { 384 unsigned Index = BaseArgs.MakeIndex(Opt.getName().str() + Value.str()); 385 SynthesizedArgs.push_back(make_unique<Arg>( 386 Opt, MakeArgString(Opt.getPrefix() + Opt.getName()), Index, 387 BaseArgs.getArgString(Index) + Opt.getName().size(), BaseArg)); 388 return SynthesizedArgs.back().get(); 389 } 390