blob: 66fcb708856c922a82b70a9eacf894c936cd8e06 [file] [log] [blame]
Daniel Dunbard77aac92009-03-04 17:10:42 +00001//===--- 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 "clang/Driver/ArgList.h"
11#include "clang/Driver/Arg.h"
Daniel Dunbar12d474a2009-03-04 22:40:08 +000012#include "clang/Driver/Option.h"
Daniel Dunbard77aac92009-03-04 17:10:42 +000013
14using namespace clang::driver;
15
16ArgList::ArgList(const char **ArgBegin, const char **ArgEnd) {
17 ArgStrings.append(ArgBegin, ArgEnd);
18}
19
20ArgList::~ArgList() {
21 for (iterator it = begin(), ie = end(); it != ie; ++ie)
22 delete *it;
23}
Daniel Dunbar12d474a2009-03-04 22:40:08 +000024
25void ArgList::append(Arg *A) {
26 if (A->getOption().isUnsupported()) {
27 assert(0 && "FIXME: unsupported unsupported.");
28 }
29
30 Args.push_back(A);
31}
Daniel Dunbarf01869c2009-03-12 01:36:44 +000032
Daniel Dunbare9c70fa2009-03-15 00:48:16 +000033Arg *ArgList::getLastArg(options::ID Id, bool Claim) const {
Daniel Dunbarf01869c2009-03-12 01:36:44 +000034 // FIXME: Make search efficient?
35
36 // FIXME: This needs to not require loading of the option.
Daniel Dunbare9c70fa2009-03-15 00:48:16 +000037 for (const_iterator it = begin(), ie = end(); it != ie; ++it) {
38 if ((*it)->getOption().matches(Id)) {
39 if (Claim) (*it)->claim();
Daniel Dunbar08a0ae42009-03-12 16:03:38 +000040 return *it;
Daniel Dunbare9c70fa2009-03-15 00:48:16 +000041 }
42 }
Daniel Dunbarf01869c2009-03-12 01:36:44 +000043
Daniel Dunbar08a0ae42009-03-12 16:03:38 +000044 return 0;
Daniel Dunbarf01869c2009-03-12 01:36:44 +000045}
Daniel Dunbar72cac202009-03-12 18:20:18 +000046
Daniel Dunbar019b2412009-03-17 17:51:18 +000047unsigned ArgList::MakeIndex(const char *String0) const {
Daniel Dunbar72cac202009-03-12 18:20:18 +000048 unsigned Index = ArgStrings.size();
49
50 // Tuck away so we have a reliable const char *.
51 SynthesizedStrings.push_back(String0);
52 ArgStrings.push_back(SynthesizedStrings.back().c_str());
53
54 return Index;
55}
56
Daniel Dunbar019b2412009-03-17 17:51:18 +000057unsigned ArgList::MakeIndex(const char *String0, const char *String1) const {
Daniel Dunbar72cac202009-03-12 18:20:18 +000058 unsigned Index0 = MakeIndex(String0);
59 unsigned Index1 = MakeIndex(String1);
Daniel Dunbar44925cc2009-03-13 17:25:24 +000060 assert(Index0 + 1 == Index1 && "Unexpected non-consecutive indices!");
Daniel Dunbar72cac202009-03-12 18:20:18 +000061 (void) Index1;
62 return Index0;
63}
64
Daniel Dunbar019b2412009-03-17 17:51:18 +000065const char *ArgList::MakeArgString(const char *Str) const {
66 return getArgString(MakeIndex(Str));
67}
68
69Arg *ArgList::MakeFlagArg(const Option *Opt) const {
Daniel Dunbar72cac202009-03-12 18:20:18 +000070 return new FlagArg(Opt, MakeIndex(Opt->getName()));
71}
72
Daniel Dunbar019b2412009-03-17 17:51:18 +000073Arg *ArgList::MakePositionalArg(const Option *Opt, const char *Value) const {
Daniel Dunbar72cac202009-03-12 18:20:18 +000074 return new PositionalArg(Opt, MakeIndex(Value));
75}
76
Daniel Dunbar019b2412009-03-17 17:51:18 +000077Arg *ArgList::MakeSeparateArg(const Option *Opt, const char *Value) const {
Daniel Dunbar72cac202009-03-12 18:20:18 +000078 return new SeparateArg(Opt, MakeIndex(Opt->getName(), Value), 1);
79}
80
Daniel Dunbar019b2412009-03-17 17:51:18 +000081Arg *ArgList::MakeJoinedArg(const Option *Opt, const char *Value) const {
Daniel Dunbar72cac202009-03-12 18:20:18 +000082 std::string Joined(Opt->getName());
83 Joined += Value;
84 return new JoinedArg(Opt, MakeIndex(Joined.c_str()));
85}