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 } // namespace 161 162 QueryRef QueryParser::completeMatcherExpression() { 163 std::vector<MatcherCompletion> Comps = Parser::completeExpression( 164 StringRef(Begin, End - Begin), CompletionPos - Begin, nullptr, 165 &QS.NamedValues); 166 for (std::vector<MatcherCompletion>::iterator I = Comps.begin(), 167 E = Comps.end(); 168 I != E; ++I) { 169 Completions.push_back(LineEditor::Completion(I->TypedText, I->MatcherDecl)); 170 } 171 return QueryRef(); 172 } 173 174 QueryRef QueryParser::doParse() { 175 StringRef CommandStr; 176 ParsedQueryKind QKind = lexOrCompleteWord<ParsedQueryKind>(CommandStr) 177 .Case("", PQK_NoOp) 178 .Case("help", PQK_Help) 179 .Case("m", PQK_Match, /*IsCompletion=*/false) 180 .Case("let", PQK_Let) 181 .Case("match", PQK_Match) 182 .Case("set", PQK_Set) 183 .Case("unlet", PQK_Unlet) 184 .Default(PQK_Invalid); 185 186 switch (QKind) { 187 case PQK_NoOp: 188 return new NoOpQuery; 189 190 case PQK_Help: 191 return endQuery(new HelpQuery); 192 193 case PQK_Let: { 194 StringRef Name = lexWord(); 195 196 if (Name.empty()) 197 return new InvalidQuery("expected variable name"); 198 199 if (CompletionPos) 200 return completeMatcherExpression(); 201 202 Diagnostics Diag; 203 ast_matchers::dynamic::VariantValue Value; 204 if (!Parser::parseExpression(StringRef(Begin, End - Begin), nullptr, 205 &QS.NamedValues, &Value, &Diag)) { 206 return makeInvalidQueryFromDiagnostics(Diag); 207 } 208 209 return new LetQuery(Name, Value); 210 } 211 212 case PQK_Match: { 213 if (CompletionPos) 214 return completeMatcherExpression(); 215 216 Diagnostics Diag; 217 Optional<DynTypedMatcher> Matcher = Parser::parseMatcherExpression( 218 StringRef(Begin, End - Begin), nullptr, &QS.NamedValues, &Diag); 219 if (!Matcher) { 220 return makeInvalidQueryFromDiagnostics(Diag); 221 } 222 return new MatchQuery(*Matcher); 223 } 224 225 case PQK_Set: { 226 StringRef VarStr; 227 ParsedQueryVariable Var = lexOrCompleteWord<ParsedQueryVariable>(VarStr) 228 .Case("output", PQV_Output) 229 .Case("bind-root", PQV_BindRoot) 230 .Default(PQV_Invalid); 231 if (VarStr.empty()) 232 return new InvalidQuery("expected variable name"); 233 if (Var == PQV_Invalid) 234 return new InvalidQuery("unknown variable: '" + VarStr + "'"); 235 236 QueryRef Q; 237 switch (Var) { 238 case PQV_Output: 239 Q = parseSetOutputKind(); 240 break; 241 case PQV_BindRoot: 242 Q = parseSetBool(&QuerySession::BindRoot); 243 break; 244 case PQV_Invalid: 245 llvm_unreachable("Invalid query kind"); 246 } 247 248 return endQuery(Q); 249 } 250 251 case PQK_Unlet: { 252 StringRef Name = lexWord(); 253 254 if (Name.empty()) 255 return new InvalidQuery("expected variable name"); 256 257 return endQuery(new LetQuery(Name, VariantValue())); 258 } 259 260 case PQK_Invalid: 261 return new InvalidQuery("unknown command: " + CommandStr); 262 } 263 264 llvm_unreachable("Invalid query kind"); 265 } 266 267 QueryRef QueryParser::parse(StringRef Line, const QuerySession &QS) { 268 return QueryParser(Line, QS).doParse(); 269 } 270 271 std::vector<LineEditor::Completion> 272 QueryParser::complete(StringRef Line, size_t Pos, const QuerySession &QS) { 273 QueryParser P(Line, QS); 274 P.CompletionPos = Line.data() + Pos; 275 276 P.doParse(); 277 return P.Completions; 278 } 279 280 } // namespace query 281 } // namespace clang 282