1 //===---- QueryParser.cpp - clang-query command parser --------------------===// 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 "QueryParser.h" 11 #include "Query.h" 12 #include "QuerySession.h" 13 #include "clang/ASTMatchers/Dynamic/Parser.h" 14 #include "clang/Basic/CharInfo.h" 15 #include "llvm/ADT/StringRef.h" 16 #include "llvm/ADT/StringSwitch.h" 17 #include <set> 18 19 using namespace llvm; 20 using namespace clang::ast_matchers::dynamic; 21 22 namespace clang { 23 namespace query { 24 25 // Lex any amount of whitespace followed by a "word" (any sequence of 26 // non-whitespace characters) from the start of region [Begin,End). If no word 27 // is found before End, return StringRef(). Begin is adjusted to exclude the 28 // lexed region. 29 StringRef QueryParser::lexWord() { 30 while (true) { 31 if (Begin == End) 32 return StringRef(Begin, 0); 33 34 if (!isWhitespace(*Begin)) 35 break; 36 37 ++Begin; 38 } 39 40 const char *WordBegin = Begin; 41 42 while (true) { 43 ++Begin; 44 45 if (Begin == End || isWhitespace(*Begin)) 46 return StringRef(WordBegin, Begin - WordBegin); 47 } 48 } 49 50 // This is the StringSwitch-alike used by lexOrCompleteWord below. See that 51 // function for details. 52 template <typename T> struct QueryParser::LexOrCompleteWord { 53 StringSwitch<T> Switch; 54 55 QueryParser *P; 56 StringRef Word; 57 // Set to the completion point offset in Word, or StringRef::npos if 58 // completion point not in Word. 59 size_t WordCompletionPos; 60 61 LexOrCompleteWord(QueryParser *P, StringRef Word, size_t WCP) 62 : Switch(Word), P(P), Word(Word), WordCompletionPos(WCP) {} 63 64 template <unsigned N> 65 LexOrCompleteWord &Case(const char (&S)[N], const T &Value, 66 bool IsCompletion = true) { 67 StringRef CaseStr(S, N - 1); 68 69 if (WordCompletionPos == StringRef::npos) 70 Switch.Case(S, Value); 71 else if (N != 1 && IsCompletion && WordCompletionPos <= CaseStr.size() && 72 CaseStr.substr(0, WordCompletionPos) == 73 Word.substr(0, WordCompletionPos)) 74 P->Completions.push_back(LineEditor::Completion( 75 (CaseStr.substr(WordCompletionPos) + " ").str(), CaseStr)); 76 return *this; 77 } 78 79 T Default(const T& Value) const { 80 return Switch.Default(Value); 81 } 82 }; 83 84 // Lexes a word and stores it in Word. Returns a LexOrCompleteWord<T> object 85 // that can be used like a llvm::StringSwitch<T>, but adds cases as possible 86 // completions if the lexed word contains the completion point. 87 template <typename T> 88 QueryParser::LexOrCompleteWord<T> 89 QueryParser::lexOrCompleteWord(StringRef &Word) { 90 Word = lexWord(); 91 size_t WordCompletionPos = StringRef::npos; 92 if (CompletionPos && CompletionPos <= Word.data() + Word.size()) { 93 if (CompletionPos < Word.data()) 94 WordCompletionPos = 0; 95 else 96 WordCompletionPos = CompletionPos - Word.data(); 97 } 98 return LexOrCompleteWord<T>(this, Word, WordCompletionPos); 99 } 100 101 QueryRef QueryParser::parseSetBool(bool QuerySession::*Var) { 102 StringRef ValStr; 103 unsigned Value = lexOrCompleteWord<unsigned>(ValStr) 104 .Case("false", 0) 105 .Case("true", 1) 106 .Default(~0u); 107 if (Value == ~0u) { 108 return new InvalidQuery("expected 'true' or 'false', got '" + ValStr + "'"); 109 } 110 return new SetQuery<bool>(Var, Value); 111 } 112 113 QueryRef QueryParser::parseSetOutputKind() { 114 StringRef ValStr; 115 unsigned OutKind = lexOrCompleteWord<unsigned>(ValStr) 116 .Case("diag", OK_Diag) 117 .Case("print", OK_Print) 118 .Case("dump", OK_Dump) 119 .Default(~0u); 120 if (OutKind == ~0u) { 121 return new InvalidQuery("expected 'diag', 'print' or 'dump', got '" + 122 ValStr + "'"); 123 } 124 return new SetQuery<OutputKind>(&QuerySession::OutKind, OutputKind(OutKind)); 125 } 126 127 QueryRef QueryParser::endQuery(QueryRef Q) { 128 const char *Extra = Begin; 129 if (!lexWord().empty()) 130 return new InvalidQuery("unexpected extra input: '" + 131 StringRef(Extra, End - Extra) + "'"); 132 return Q; 133 } 134 135 namespace { 136 137 enum ParsedQueryKind { 138 PQK_Invalid, 139 PQK_NoOp, 140 PQK_Help, 141 PQK_Let, 142 PQK_Match, 143 PQK_Set, 144 PQK_Unlet, 145 }; 146 147 enum ParsedQueryVariable { 148 PQV_Invalid, 149 PQV_Output, 150 PQV_BindRoot 151 }; 152 153 QueryRef makeInvalidQueryFromDiagnostics(const Diagnostics &Diag) { 154 std::string ErrStr; 155 llvm::raw_string_ostream OS(ErrStr); 156 Diag.printToStreamFull(OS); 157 return new InvalidQuery(OS.str()); 158 } 159 160 class QuerySessionSema : public Parser::RegistrySema { 161 public: 162 QuerySessionSema(const QuerySession &QS) : QS(QS) {} 163 164 ast_matchers::dynamic::VariantValue getNamedValue(StringRef Name) override { 165 return QS.NamedValues.lookup(Name); 166 } 167 168 private: 169 const QuerySession &QS; 170 }; 171 172 } // namespace 173 174 QueryRef QueryParser::completeMatcherExpression() { 175 std::vector<MatcherCompletion> Comps = Parser::completeExpression( 176 StringRef(Begin, End - Begin), CompletionPos - Begin); 177 for (std::vector<MatcherCompletion>::iterator I = Comps.begin(), 178 E = Comps.end(); 179 I != E; ++I) { 180 Completions.push_back(LineEditor::Completion(I->TypedText, I->MatcherDecl)); 181 } 182 return QueryRef(); 183 } 184 185 QueryRef QueryParser::doParse() { 186 StringRef CommandStr; 187 ParsedQueryKind QKind = lexOrCompleteWord<ParsedQueryKind>(CommandStr) 188 .Case("", PQK_NoOp) 189 .Case("help", PQK_Help) 190 .Case("m", PQK_Match, /*IsCompletion=*/false) 191 .Case("let", PQK_Let) 192 .Case("match", PQK_Match) 193 .Case("set", PQK_Set) 194 .Case("unlet", PQK_Unlet) 195 .Default(PQK_Invalid); 196 197 QuerySessionSema S(QS); 198 199 switch (QKind) { 200 case PQK_NoOp: 201 return new NoOpQuery; 202 203 case PQK_Help: 204 return endQuery(new HelpQuery); 205 206 case PQK_Let: { 207 StringRef Name = lexWord(); 208 209 if (Name.empty()) 210 return new InvalidQuery("expected variable name"); 211 212 if (CompletionPos) 213 return completeMatcherExpression(); 214 215 Diagnostics Diag; 216 ast_matchers::dynamic::VariantValue Value; 217 if (!Parser::parseExpression(StringRef(Begin, End - Begin), &S, &Value, 218 &Diag)) { 219 return makeInvalidQueryFromDiagnostics(Diag); 220 } 221 222 return new LetQuery(Name, Value); 223 } 224 225 case PQK_Match: { 226 if (CompletionPos) 227 return completeMatcherExpression(); 228 229 Diagnostics Diag; 230 Optional<DynTypedMatcher> Matcher = Parser::parseMatcherExpression( 231 StringRef(Begin, End - Begin), &S, &Diag); 232 if (!Matcher) { 233 return makeInvalidQueryFromDiagnostics(Diag); 234 } 235 return new MatchQuery(*Matcher); 236 } 237 238 case PQK_Set: { 239 StringRef VarStr; 240 ParsedQueryVariable Var = lexOrCompleteWord<ParsedQueryVariable>(VarStr) 241 .Case("output", PQV_Output) 242 .Case("bind-root", PQV_BindRoot) 243 .Default(PQV_Invalid); 244 if (VarStr.empty()) 245 return new InvalidQuery("expected variable name"); 246 if (Var == PQV_Invalid) 247 return new InvalidQuery("unknown variable: '" + VarStr + "'"); 248 249 QueryRef Q; 250 switch (Var) { 251 case PQV_Output: 252 Q = parseSetOutputKind(); 253 break; 254 case PQV_BindRoot: 255 Q = parseSetBool(&QuerySession::BindRoot); 256 break; 257 case PQV_Invalid: 258 llvm_unreachable("Invalid query kind"); 259 } 260 261 return endQuery(Q); 262 } 263 264 case PQK_Unlet: { 265 StringRef Name = lexWord(); 266 267 if (Name.empty()) 268 return new InvalidQuery("expected variable name"); 269 270 return endQuery(new LetQuery(Name, VariantValue())); 271 } 272 273 case PQK_Invalid: 274 return new InvalidQuery("unknown command: " + CommandStr); 275 } 276 277 llvm_unreachable("Invalid query kind"); 278 } 279 280 QueryRef QueryParser::parse(StringRef Line, const QuerySession &QS) { 281 return QueryParser(Line, QS).doParse(); 282 } 283 284 std::vector<LineEditor::Completion> 285 QueryParser::complete(StringRef Line, size_t Pos, const QuerySession &QS) { 286 QueryParser P(Line, QS); 287 P.CompletionPos = Line.data() + Pos; 288 289 P.doParse(); 290 return P.Completions; 291 } 292 293 } // namespace query 294 } // namespace clang 295