1 //===-- MCAsmParser.cpp - Abstract Asm Parser Interface -------------------===// 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/MC/MCParser/MCAsmParser.h" 11 #include "llvm/ADT/Twine.h" 12 #include "llvm/MC/MCParser/MCAsmLexer.h" 13 #include "llvm/MC/MCParser/MCParsedAsmOperand.h" 14 #include "llvm/MC/MCParser/MCTargetAsmParser.h" 15 #include "llvm/Support/Debug.h" 16 #include "llvm/Support/SourceMgr.h" 17 #include "llvm/Support/raw_ostream.h" 18 using namespace llvm; 19 20 MCAsmParser::MCAsmParser() 21 : TargetParser(nullptr), ShowParsedOperands(0), HadError(false), 22 PendingErrors() {} 23 24 MCAsmParser::~MCAsmParser() { 25 } 26 27 void MCAsmParser::setTargetParser(MCTargetAsmParser &P) { 28 assert(!TargetParser && "Target parser is already initialized!"); 29 TargetParser = &P; 30 TargetParser->Initialize(*this); 31 } 32 33 const AsmToken &MCAsmParser::getTok() const { 34 return getLexer().getTok(); 35 } 36 37 bool MCAsmParser::parseTokenLoc(SMLoc &Loc) { 38 Loc = getTok().getLoc(); 39 return false; 40 } 41 42 bool MCAsmParser::parseEOL(const Twine &Msg) { 43 if (getTok().getKind() == AsmToken::Hash) { 44 StringRef CommentStr = parseStringToEndOfStatement(); 45 getLexer().Lex(); 46 getLexer().UnLex(AsmToken(AsmToken::EndOfStatement, CommentStr)); 47 } 48 if (getTok().getKind() != AsmToken::EndOfStatement) 49 return Error(getTok().getLoc(), Msg); 50 Lex(); 51 return false; 52 } 53 54 bool MCAsmParser::parseToken(AsmToken::TokenKind T, const Twine &Msg) { 55 if (T == AsmToken::EndOfStatement) 56 return parseEOL(Msg); 57 if (getTok().getKind() != T) 58 return Error(getTok().getLoc(), Msg); 59 Lex(); 60 return false; 61 } 62 63 bool MCAsmParser::parseIntToken(int64_t &V, const Twine &Msg) { 64 if (getTok().getKind() != AsmToken::Integer) 65 return TokError(Msg); 66 V = getTok().getIntVal(); 67 Lex(); 68 return false; 69 } 70 71 bool MCAsmParser::parseOptionalToken(AsmToken::TokenKind T) { 72 bool Present = (getTok().getKind() == T); 73 // if token is EOL and current token is # this is an EOL comment. 74 if (getTok().getKind() == AsmToken::Hash && T == AsmToken::EndOfStatement) 75 Present = true; 76 if (Present) 77 parseToken(T); 78 return Present; 79 } 80 81 bool MCAsmParser::check(bool P, const Twine &Msg) { 82 return check(P, getTok().getLoc(), Msg); 83 } 84 85 bool MCAsmParser::check(bool P, SMLoc Loc, const Twine &Msg) { 86 if (P) 87 return Error(Loc, Msg); 88 return false; 89 } 90 91 bool MCAsmParser::TokError(const Twine &Msg, SMRange Range) { 92 return Error(getLexer().getLoc(), Msg, Range); 93 } 94 95 bool MCAsmParser::Error(SMLoc L, const Twine &Msg, SMRange Range) { 96 HadError = true; 97 98 MCPendingError PErr; 99 PErr.Loc = L; 100 Msg.toVector(PErr.Msg); 101 PErr.Range = Range; 102 PendingErrors.push_back(PErr); 103 104 // If we threw this parsing error after a lexing error, this should 105 // supercede the lexing error and so we remove it from the Lexer 106 // before it can propagate 107 if (getTok().is(AsmToken::Error)) 108 getLexer().Lex(); 109 return true; 110 } 111 112 bool MCAsmParser::addErrorSuffix(const Twine &Suffix) { 113 // Make sure lexing errors have propagated to the parser. 114 if (getTok().is(AsmToken::Error)) 115 Lex(); 116 for (auto &PErr : PendingErrors) 117 Suffix.toVector(PErr.Msg); 118 return true; 119 } 120 121 bool MCAsmParser::parseMany(std::function<bool()> parseOne, bool hasComma) { 122 if (parseOptionalToken(AsmToken::EndOfStatement)) 123 return false; 124 while (1) { 125 if (parseOne()) 126 return true; 127 if (parseOptionalToken(AsmToken::EndOfStatement)) 128 return false; 129 if (hasComma && parseToken(AsmToken::Comma)) 130 return true; 131 } 132 return false; 133 } 134 135 bool MCAsmParser::parseExpression(const MCExpr *&Res) { 136 SMLoc L; 137 return parseExpression(Res, L); 138 } 139 140 LLVM_DUMP_METHOD void MCParsedAsmOperand::dump() const { 141 dbgs() << " " << *this; 142 } 143