jroesch commented on a change in pull request #5932: URL: https://github.com/apache/incubator-tvm/pull/5932#discussion_r448250952
########## File path: src/parser/parser.cc ########## @@ -0,0 +1,1103 @@ +/* + * Licensed to the Apache Software Foundation (ASF) under one + * or more contributor license agreements. See the NOTICE file + * distributed with this work for additional information + * regarding copyright ownership. The ASF licenses this file + * to you under the Apache License, Version 2.0 (the + * "License"); you may not use this file except in compliance + * with the License. You may obtain a copy of the License at + * + * http://www.apache.org/licenses/LICENSE-2.0 + * + * Unless required by applicable law or agreed to in writing, + * software distributed under the License is distributed on an + * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY + * KIND, either express or implied. See the License for the + * specific language governing permissions and limitations + * under the License. + */ + +/*! + * \file parser.cc + * \brief A parser for TVM IR. + */ +#include <tvm/ir/module.h> +#include <tvm/relay/expr.h> +#include <tvm/relay/function.h> +#include <tvm/runtime/object.h> +#include <tvm/runtime/registry.h> +#include <tvm/node/reflection.h> + +#include <fstream> + +#include "./diagnostic.h" +#include "./op_table.h" +#include "./tokenizer.h" + +namespace tvm { +namespace parser { + +using namespace relay; +using Expr = relay::Expr; + +// adtConsDefnList: adtConsDefn (',' adtConsDefn)* ','? ; +// adtConsDefn: constructorName ('(' typeExpr (',' typeExpr)* ')')? ; +// matchClauseList: matchClause (',' matchClause)* ','? ; +// matchClause: pattern '=>' ('{' expr '}' | expr) ; +// // complete or incomplete match, respectively +// matchType : 'match' | 'match?' ; + +// patternList: '(' pattern (',' pattern)* ')'; +// pattern +// : '_' # wildcardPattern +// | localVar (':' typeExpr)? # varPattern +// | constructorName patternList? # constructorPattern +// | patternList # tuplePattern +// ; + +struct GlobalFunc { + GlobalVar global; + Function function; + GlobalFunc() : global(), function() {} + GlobalFunc(GlobalVar global, Function function) : global(global), function(function) {} + GlobalFunc(const GlobalFunc& gfunc) { + this->global = gfunc.global; + this->function = gfunc.function; + } +}; + +struct Definitions { + std::vector<GlobalFunc> funcs; + std::vector<TypeData> types; +}; + +struct SemVer { + int major; + int minor; + int patch; +}; + +class MetaRefExpr; +class MetaRefExprNode : public TempExprNode { + public: + std::string type_key; + uint64_t node_index; + + void VisitAttrs(tvm::AttrVisitor* v) {} + + Expr Realize() const final { return Expr(); } + + static constexpr const char* _type_key = "relay.MetaRefExpr"; + TVM_DECLARE_FINAL_OBJECT_INFO(MetaRefExprNode, TempExprNode); +}; + +class MetaRefExpr : public TempExpr { + public: + /*! + * \brief The constructor + * \param expr The original relay expression. + * \param kind The annotation kind. + */ + TVM_DLL MetaRefExpr(std::string type_key, uint64_t node_index); + + TVM_DEFINE_OBJECT_REF_METHODS(MetaRefExpr, TempExpr, MetaRefExprNode); +}; + +MetaRefExpr::MetaRefExpr(std::string type_key, uint64_t node_index) { + auto rnode = make_object<MetaRefExprNode>(); + rnode->type_key = type_key; + rnode->node_index = node_index; + data_ = std::move(rnode); +} + +template<typename T> +struct Scope { + std::unordered_map<std::string, T> name_map; + Scope() : name_map() {} +}; + +template<typename T> +struct ScopeStack { + std::vector<Scope<T>> scope_stack; + + void Add(const std::string& name, const T& value) { + if (!this->scope_stack.size()) { + LOG(FATAL) << "internal issue"; + } + this->scope_stack.back().name_map.insert({ name, value }); + } + + T Lookup(const std::string& name) { + for (auto scope = this->scope_stack.rbegin(); scope != this->scope_stack.rend(); scope++) { + auto it = scope->name_map.find(name); + if (it != scope->name_map.end()) { + return it->second; + } + } + return T(); + } + + void PushStack() { + this->scope_stack.push_back(Scope<T>()); + } + + void PopStack() { + this->scope_stack.pop_back(); + } +}; + +template<typename T> +struct InternTable { + std::unordered_map<std::string, T> table; + void Add(const std::string& name, const T& t) { + auto it = table.find(name); + if (it != table.end()) { + LOG(FATAL) << "duplicate name"; + } else { + table.insert({ name, t}); + } + } + + T Get(const std::string& name) { + auto it = table.find(name); + if (it != table.end()) { + return it->second; + } else { + return T(); + } + } +}; + +struct Parser { + /*! \brief The diagnostic context used for error reporting. */ + DiagnosticContext diag_ctx; + + /*! \brief The current position in the token stream. */ + int pos; + + /*! \brief The token stream for the parser. */ + std::vector<Token> tokens; + + /*! \brief The configured operator table. */ + OperatorTable op_table; + + /*! \brief Configure the whitespace mode, right now we ignore all whitespace. */ + bool ignore_whitespace; + + /*! \brief A global mapping for GlobalVar. */ + InternTable<GlobalVar> global_names; + + /*! \brief A global mapping for type definitions. */ + InternTable<GlobalTypeVar> type_names; + + /*! \brief A mapping from graph variable to expression, i.e., `%0 = expr`. */ + std::unordered_map<int, Expr> graph_ctx; + + /*! \brief The set of type scopes used for generics. */ + ScopeStack<TypeVar> type_scopes; + + /*! \brief The set of expression scopes used for lexical scope. */ + ScopeStack<Var> expr_scopes; + + Parser(std::vector<Token> tokens, OperatorTable op_table, Source source) + : diag_ctx(source), pos(0), tokens(tokens), op_table(op_table), ignore_whitespace(true) {} + + void DisplayNextN(int n) { + std::cout << "remaining tokens: " << std::endl; + auto bound = std::min(pos + n, (int)tokens.size()); + for (int i = 0; i < bound - pos; i++) { + std::cout << tokens[pos + i] << std::endl; + } + } + + Token Peek() { + // For now we ignore all whitespace tokens and comments. + // We can tweak this behavior later to enable white space sensitivity in the parser. + while (pos < tokens.size() && + ignore_whitespace && (tokens.at(pos)->token_type == TokenType::Whitespace || + tokens.at(pos)->token_type == TokenType::Newline || + tokens.at(pos)->token_type == TokenType::LineComment || + tokens.at(pos)->token_type == TokenType::Comment)) { + // std::cout << "pos: " << pos << std::endl; + // std::cout << "tokens: " << tokens.size() << std::endl; + pos++; + } + + if (pos < tokens.size()) { + return Token(this->tokens.at(pos)); + } else { + return Token::Null(); + } + } + + // Allow lookahead into the token stream. + Token Lookahead(int n) { + CHECK_LE(1, n) + << "lookahead by > 1 is invalid"; + + auto old_pos = pos; + for (int i = 0; i < n - 1; i++) { Review comment: This is confusingly correct, the goal is to run n - 1 times. The implementation was sort of a quick hack to add lookahead for the one case we need it in the parser. My general goal is to only do lookahead by 1 (which is Peek()). ---------------------------------------------------------------- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. For queries about this service, please contact Infrastructure at: [email protected]
