head 1.1; branch 1.1.1; access; symbols netbsd-11-0-RC4:1.1.1.4 netbsd-11-0-RC3:1.1.1.4 netbsd-11-0-RC2:1.1.1.4 netbsd-11-0-RC1:1.1.1.4 perseant-exfatfs-base-20250801:1.1.1.4 netbsd-11:1.1.1.4.0.10 netbsd-11-base:1.1.1.4 netbsd-10-1-RELEASE:1.1.1.4 perseant-exfatfs-base-20240630:1.1.1.4 perseant-exfatfs:1.1.1.4.0.8 perseant-exfatfs-base:1.1.1.4 netbsd-8-3-RELEASE:1.1.1.3 netbsd-9-4-RELEASE:1.1.1.3 netbsd-10-0-RELEASE:1.1.1.4 netbsd-10-0-RC6:1.1.1.4 netbsd-10-0-RC5:1.1.1.4 netbsd-10-0-RC4:1.1.1.4 netbsd-10-0-RC3:1.1.1.4 netbsd-10-0-RC2:1.1.1.4 netbsd-10-0-RC1:1.1.1.4 netbsd-10:1.1.1.4.0.6 netbsd-10-base:1.1.1.4 netbsd-9-3-RELEASE:1.1.1.3 cjep_sun2x:1.1.1.4.0.4 cjep_sun2x-base:1.1.1.4 cjep_staticlib_x-base1:1.1.1.4 netbsd-9-2-RELEASE:1.1.1.3 cjep_staticlib_x:1.1.1.4.0.2 cjep_staticlib_x-base:1.1.1.4 netbsd-9-1-RELEASE:1.1.1.3 phil-wifi-20200421:1.1.1.4 phil-wifi-20200411:1.1.1.4 phil-wifi-20200406:1.1.1.4 netbsd-8-2-RELEASE:1.1.1.3 netbsd-9-0-RELEASE:1.1.1.3 netbsd-9-0-RC2:1.1.1.3 netbsd-9-0-RC1:1.1.1.3 netbsd-9:1.1.1.3.0.16 netbsd-9-base:1.1.1.3 phil-wifi-20190609:1.1.1.3 netbsd-8-1-RELEASE:1.1.1.3 netbsd-8-1-RC1:1.1.1.3 pgoyette-compat-merge-20190127:1.1.1.3 pgoyette-compat-20190127:1.1.1.3 pgoyette-compat-20190118:1.1.1.3 pgoyette-compat-1226:1.1.1.3 pgoyette-compat-1126:1.1.1.3 pgoyette-compat-1020:1.1.1.3 pgoyette-compat-0930:1.1.1.3 pgoyette-compat-0906:1.1.1.3 netbsd-7-2-RELEASE:1.1.1.2 pgoyette-compat-0728:1.1.1.3 clang-337282:1.1.1.3 netbsd-8-0-RELEASE:1.1.1.3 phil-wifi:1.1.1.3.0.14 phil-wifi-base:1.1.1.3 pgoyette-compat-0625:1.1.1.3 netbsd-8-0-RC2:1.1.1.3 pgoyette-compat-0521:1.1.1.3 pgoyette-compat-0502:1.1.1.3 pgoyette-compat-0422:1.1.1.3 netbsd-8-0-RC1:1.1.1.3 pgoyette-compat-0415:1.1.1.3 pgoyette-compat-0407:1.1.1.3 pgoyette-compat-0330:1.1.1.3 pgoyette-compat-0322:1.1.1.3 pgoyette-compat-0315:1.1.1.3 netbsd-7-1-2-RELEASE:1.1.1.2 pgoyette-compat:1.1.1.3.0.12 pgoyette-compat-base:1.1.1.3 netbsd-7-1-1-RELEASE:1.1.1.2 clang-319952:1.1.1.3 matt-nb8-mediatek:1.1.1.3.0.10 matt-nb8-mediatek-base:1.1.1.3 clang-309604:1.1.1.3 perseant-stdc-iso10646:1.1.1.3.0.8 perseant-stdc-iso10646-base:1.1.1.3 netbsd-8:1.1.1.3.0.6 netbsd-8-base:1.1.1.3 prg-localcount2-base3:1.1.1.3 prg-localcount2-base2:1.1.1.3 prg-localcount2-base1:1.1.1.3 prg-localcount2:1.1.1.3.0.4 prg-localcount2-base:1.1.1.3 pgoyette-localcount-20170426:1.1.1.3 bouyer-socketcan-base1:1.1.1.3 pgoyette-localcount-20170320:1.1.1.3 netbsd-7-1:1.1.1.2.0.12 netbsd-7-1-RELEASE:1.1.1.2 netbsd-7-1-RC2:1.1.1.2 clang-294123:1.1.1.3 netbsd-7-nhusb-base-20170116:1.1.1.2 bouyer-socketcan:1.1.1.3.0.2 bouyer-socketcan-base:1.1.1.3 clang-291444:1.1.1.3 pgoyette-localcount-20170107:1.1.1.2 netbsd-7-1-RC1:1.1.1.2 pgoyette-localcount-20161104:1.1.1.2 netbsd-7-0-2-RELEASE:1.1.1.2 localcount-20160914:1.1.1.2 netbsd-7-nhusb:1.1.1.2.0.10 netbsd-7-nhusb-base:1.1.1.2 clang-280599:1.1.1.2 pgoyette-localcount-20160806:1.1.1.2 pgoyette-localcount-20160726:1.1.1.2 pgoyette-localcount:1.1.1.2.0.8 pgoyette-localcount-base:1.1.1.2 netbsd-7-0-1-RELEASE:1.1.1.2 clang-261930:1.1.1.2 netbsd-7-0:1.1.1.2.0.6 netbsd-7-0-RELEASE:1.1.1.2 netbsd-7-0-RC3:1.1.1.2 netbsd-7-0-RC2:1.1.1.2 netbsd-7-0-RC1:1.1.1.2 clang-237755:1.1.1.2 clang-232565:1.1.1.2 clang-227398:1.1.1.2 tls-maxphys-base:1.1.1.2 tls-maxphys:1.1.1.2.0.4 netbsd-7:1.1.1.2.0.2 netbsd-7-base:1.1.1.2 clang-215315:1.1.1.2 clang-209886:1.1.1.2 yamt-pagecache:1.1.1.1.0.4 yamt-pagecache-base9:1.1.1.1 tls-earlyentropy:1.1.1.1.0.2 tls-earlyentropy-base:1.1.1.2 riastradh-xf86-video-intel-2-7-1-pre-2-21-15:1.1.1.1 riastradh-drm2-base3:1.1.1.1 clang-202566:1.1.1.1 clang-201163:1.1.1.1 clang-199312:1.1.1.1 clang-198450:1.1.1.1 clang-196603:1.1.1.1 clang-195771:1.1.1.1 LLVM:1.1.1; locks; strict; comment @// @; 1.1 date 2013.11.28.14.14.48; author joerg; state Exp; branches 1.1.1.1; next ; commitid ow8OybrawrB1f3fx; 1.1.1.1 date 2013.11.28.14.14.48; author joerg; state Exp; branches 1.1.1.1.2.1 1.1.1.1.4.1; next 1.1.1.2; commitid ow8OybrawrB1f3fx; 1.1.1.2 date 2014.05.30.18.14.50; author joerg; state Exp; branches 1.1.1.2.4.1 1.1.1.2.8.1; next 1.1.1.3; commitid 8q0kdlBlCn09GACx; 1.1.1.3 date 2017.01.11.10.33.11; author joerg; state Exp; branches 1.1.1.3.14.1; next 1.1.1.4; commitid CNnUNfII1jgNmxBz; 1.1.1.4 date 2019.11.13.22.23.13; author joerg; state dead; branches; next ; commitid QD8YATxuNG34YJKB; 1.1.1.1.2.1 date 2014.08.10.07.08.26; author tls; state Exp; branches; next ; commitid t01A1TLTYxkpGMLx; 1.1.1.1.4.1 date 2013.11.28.14.14.48; author yamt; state dead; branches; next 1.1.1.1.4.2; commitid WSrDtL5nYAUyiyBx; 1.1.1.1.4.2 date 2014.05.22.16.19.50; author yamt; state Exp; branches; next ; commitid WSrDtL5nYAUyiyBx; 1.1.1.2.4.1 date 2014.05.30.18.14.50; author tls; state dead; branches; next 1.1.1.2.4.2; commitid jTnpym9Qu0o4R1Nx; 1.1.1.2.4.2 date 2014.08.19.23.49.29; author tls; state Exp; branches; next ; commitid jTnpym9Qu0o4R1Nx; 1.1.1.2.8.1 date 2017.03.20.06.53.40; author pgoyette; state Exp; branches; next ; commitid jjw7cAwgyKq7RfKz; 1.1.1.3.14.1 date 2020.04.13.07.50.41; author martin; state dead; branches; next ; commitid X01YhRUPVUDaec4C; desc @@ 1.1 log @Initial revision @ text @//=== ClangASTNodesEmitter.cpp - Generate Clang AST node tables -*- C++ -*-===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // These tablegen backends emit Clang AST node tables // //===----------------------------------------------------------------------===// #include "llvm/TableGen/Record.h" #include "llvm/TableGen/TableGenBackend.h" #include #include #include #include using namespace llvm; /// ClangASTNodesEmitter - The top-level class emits .inc files containing /// declarations of Clang statements. /// namespace { class ClangASTNodesEmitter { // A map from a node to each of its derived nodes. typedef std::multimap ChildMap; typedef ChildMap::const_iterator ChildIterator; RecordKeeper &Records; Record Root; const std::string &BaseSuffix; // Create a macro-ized version of a name static std::string macroName(std::string S) { for (unsigned i = 0; i < S.size(); ++i) S[i] = std::toupper(S[i]); return S; } // Return the name to be printed in the base field. Normally this is // the record's name plus the base suffix, but if it is the root node and // the suffix is non-empty, it's just the suffix. std::string baseName(Record &R) { if (&R == &Root && !BaseSuffix.empty()) return BaseSuffix; return R.getName() + BaseSuffix; } std::pair EmitNode (const ChildMap &Tree, raw_ostream& OS, Record *Base); public: explicit ClangASTNodesEmitter(RecordKeeper &R, const std::string &N, const std::string &S) : Records(R), Root(N, SMLoc(), R), BaseSuffix(S) {} // run - Output the .inc file contents void run(raw_ostream &OS); }; } // end anonymous namespace //===----------------------------------------------------------------------===// // Statement Node Tables (.inc file) generation. //===----------------------------------------------------------------------===// // Returns the first and last non-abstract subrecords // Called recursively to ensure that nodes remain contiguous std::pair ClangASTNodesEmitter::EmitNode( const ChildMap &Tree, raw_ostream &OS, Record *Base) { std::string BaseName = macroName(Base->getName()); ChildIterator i = Tree.lower_bound(Base), e = Tree.upper_bound(Base); Record *First = 0, *Last = 0; // This might be the pseudo-node for Stmt; don't assume it has an Abstract // bit if (Base->getValue("Abstract") && !Base->getValueAsBit("Abstract")) First = Last = Base; for (; i != e; ++i) { Record *R = i->second; bool Abstract = R->getValueAsBit("Abstract"); std::string NodeName = macroName(R->getName()); OS << "#ifndef " << NodeName << "\n"; OS << "# define " << NodeName << "(Type, Base) " << BaseName << "(Type, Base)\n"; OS << "#endif\n"; if (Abstract) OS << "ABSTRACT_" << macroName(Root.getName()) << "(" << NodeName << "(" << R->getName() << ", " << baseName(*Base) << "))\n"; else OS << NodeName << "(" << R->getName() << ", " << baseName(*Base) << ")\n"; if (Tree.find(R) != Tree.end()) { const std::pair &Result = EmitNode(Tree, OS, R); if (!First && Result.first) First = Result.first; if (Result.second) Last = Result.second; } else { if (!Abstract) { Last = R; if (!First) First = R; } } OS << "#undef " << NodeName << "\n\n"; } if (First) { assert (Last && "Got a first node but not a last node for a range!"); if (Base == &Root) OS << "LAST_" << macroName(Root.getName()) << "_RANGE("; else OS << macroName(Root.getName()) << "_RANGE("; OS << Base->getName() << ", " << First->getName() << ", " << Last->getName() << ")\n\n"; } return std::make_pair(First, Last); } void ClangASTNodesEmitter::run(raw_ostream &OS) { emitSourceFileHeader("List of AST nodes of a particular kind", OS); // Write the preamble OS << "#ifndef ABSTRACT_" << macroName(Root.getName()) << "\n"; OS << "# define ABSTRACT_" << macroName(Root.getName()) << "(Type) Type\n"; OS << "#endif\n"; OS << "#ifndef " << macroName(Root.getName()) << "_RANGE\n"; OS << "# define " << macroName(Root.getName()) << "_RANGE(Base, First, Last)\n"; OS << "#endif\n\n"; OS << "#ifndef LAST_" << macroName(Root.getName()) << "_RANGE\n"; OS << "# define LAST_" << macroName(Root.getName()) << "_RANGE(Base, First, Last) " << macroName(Root.getName()) << "_RANGE(Base, First, Last)\n"; OS << "#endif\n\n"; // Emit statements const std::vector Stmts = Records.getAllDerivedDefinitions(Root.getName()); ChildMap Tree; for (unsigned i = 0, e = Stmts.size(); i != e; ++i) { Record *R = Stmts[i]; if (R->getValue("Base")) Tree.insert(std::make_pair(R->getValueAsDef("Base"), R)); else Tree.insert(std::make_pair(&Root, R)); } EmitNode(Tree, OS, &Root); OS << "#undef " << macroName(Root.getName()) << "\n"; OS << "#undef " << macroName(Root.getName()) << "_RANGE\n"; OS << "#undef LAST_" << macroName(Root.getName()) << "_RANGE\n"; OS << "#undef ABSTRACT_" << macroName(Root.getName()) << "\n"; } namespace clang { void EmitClangASTNodes(RecordKeeper &RK, raw_ostream &OS, const std::string &N, const std::string &S) { ClangASTNodesEmitter(RK, N, S).run(OS); } // Emits and addendum to a .inc file to enumerate the clang declaration // contexts. void EmitClangDeclContext(RecordKeeper &Records, raw_ostream &OS) { // FIXME: Find a .td file format to allow for this to be represented better. emitSourceFileHeader("List of AST Decl nodes", OS); OS << "#ifndef DECL_CONTEXT\n"; OS << "# define DECL_CONTEXT(DECL)\n"; OS << "#endif\n"; OS << "#ifndef DECL_CONTEXT_BASE\n"; OS << "# define DECL_CONTEXT_BASE(DECL) DECL_CONTEXT(DECL)\n"; OS << "#endif\n"; typedef std::set RecordSet; typedef std::vector RecordVector; RecordVector DeclContextsVector = Records.getAllDerivedDefinitions("DeclContext"); RecordVector Decls = Records.getAllDerivedDefinitions("Decl"); RecordSet DeclContexts (DeclContextsVector.begin(), DeclContextsVector.end()); for (RecordVector::iterator i = Decls.begin(), e = Decls.end(); i != e; ++i) { Record *R = *i; if (R->getValue("Base")) { Record *B = R->getValueAsDef("Base"); if (DeclContexts.find(B) != DeclContexts.end()) { OS << "DECL_CONTEXT_BASE(" << B->getName() << ")\n"; DeclContexts.erase(B); } } } // To keep identical order, RecordVector may be used // instead of RecordSet. for (RecordVector::iterator i = DeclContextsVector.begin(), e = DeclContextsVector.end(); i != e; ++i) if (DeclContexts.find(*i) != DeclContexts.end()) OS << "DECL_CONTEXT(" << (*i)->getName() << ")\n"; OS << "#undef DECL_CONTEXT\n"; OS << "#undef DECL_CONTEXT_BASE\n"; } } // end namespace clang @ 1.1.1.1 log @Import Clang 3.4rc1 r195771. @ text @@ 1.1.1.1.2.1 log @Rebase. @ text @d80 1 a80 1 Record *First = nullptr, *Last = nullptr; @ 1.1.1.2 log @Import Clang 3.5svn r209886. @ text @d80 1 a80 1 Record *First = nullptr, *Last = nullptr; @ 1.1.1.2.8.1 log @Sync with HEAD @ text @d50 1 a50 1 return R.getName().str() + BaseSuffix; @ 1.1.1.3 log @Import Clang pre-4.0.0 r291444. @ text @d50 1 a50 1 return R.getName().str() + BaseSuffix; @ 1.1.1.3.14.1 log @Mostly merge changes from HEAD upto 20200411 @ text @@ 1.1.1.4 log @Mark old LLVM instance as dead. @ text @@ 1.1.1.2.4.1 log @file ClangASTNodesEmitter.cpp was added on branch tls-maxphys on 2014-08-19 23:49:29 +0000 @ text @d1 229 @ 1.1.1.2.4.2 log @Rebase to HEAD as of a few days ago. @ text @a0 229 //=== ClangASTNodesEmitter.cpp - Generate Clang AST node tables -*- C++ -*-===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // These tablegen backends emit Clang AST node tables // //===----------------------------------------------------------------------===// #include "llvm/TableGen/Record.h" #include "llvm/TableGen/TableGenBackend.h" #include #include #include #include using namespace llvm; /// ClangASTNodesEmitter - The top-level class emits .inc files containing /// declarations of Clang statements. /// namespace { class ClangASTNodesEmitter { // A map from a node to each of its derived nodes. typedef std::multimap ChildMap; typedef ChildMap::const_iterator ChildIterator; RecordKeeper &Records; Record Root; const std::string &BaseSuffix; // Create a macro-ized version of a name static std::string macroName(std::string S) { for (unsigned i = 0; i < S.size(); ++i) S[i] = std::toupper(S[i]); return S; } // Return the name to be printed in the base field. Normally this is // the record's name plus the base suffix, but if it is the root node and // the suffix is non-empty, it's just the suffix. std::string baseName(Record &R) { if (&R == &Root && !BaseSuffix.empty()) return BaseSuffix; return R.getName() + BaseSuffix; } std::pair EmitNode (const ChildMap &Tree, raw_ostream& OS, Record *Base); public: explicit ClangASTNodesEmitter(RecordKeeper &R, const std::string &N, const std::string &S) : Records(R), Root(N, SMLoc(), R), BaseSuffix(S) {} // run - Output the .inc file contents void run(raw_ostream &OS); }; } // end anonymous namespace //===----------------------------------------------------------------------===// // Statement Node Tables (.inc file) generation. //===----------------------------------------------------------------------===// // Returns the first and last non-abstract subrecords // Called recursively to ensure that nodes remain contiguous std::pair ClangASTNodesEmitter::EmitNode( const ChildMap &Tree, raw_ostream &OS, Record *Base) { std::string BaseName = macroName(Base->getName()); ChildIterator i = Tree.lower_bound(Base), e = Tree.upper_bound(Base); Record *First = nullptr, *Last = nullptr; // This might be the pseudo-node for Stmt; don't assume it has an Abstract // bit if (Base->getValue("Abstract") && !Base->getValueAsBit("Abstract")) First = Last = Base; for (; i != e; ++i) { Record *R = i->second; bool Abstract = R->getValueAsBit("Abstract"); std::string NodeName = macroName(R->getName()); OS << "#ifndef " << NodeName << "\n"; OS << "# define " << NodeName << "(Type, Base) " << BaseName << "(Type, Base)\n"; OS << "#endif\n"; if (Abstract) OS << "ABSTRACT_" << macroName(Root.getName()) << "(" << NodeName << "(" << R->getName() << ", " << baseName(*Base) << "))\n"; else OS << NodeName << "(" << R->getName() << ", " << baseName(*Base) << ")\n"; if (Tree.find(R) != Tree.end()) { const std::pair &Result = EmitNode(Tree, OS, R); if (!First && Result.first) First = Result.first; if (Result.second) Last = Result.second; } else { if (!Abstract) { Last = R; if (!First) First = R; } } OS << "#undef " << NodeName << "\n\n"; } if (First) { assert (Last && "Got a first node but not a last node for a range!"); if (Base == &Root) OS << "LAST_" << macroName(Root.getName()) << "_RANGE("; else OS << macroName(Root.getName()) << "_RANGE("; OS << Base->getName() << ", " << First->getName() << ", " << Last->getName() << ")\n\n"; } return std::make_pair(First, Last); } void ClangASTNodesEmitter::run(raw_ostream &OS) { emitSourceFileHeader("List of AST nodes of a particular kind", OS); // Write the preamble OS << "#ifndef ABSTRACT_" << macroName(Root.getName()) << "\n"; OS << "# define ABSTRACT_" << macroName(Root.getName()) << "(Type) Type\n"; OS << "#endif\n"; OS << "#ifndef " << macroName(Root.getName()) << "_RANGE\n"; OS << "# define " << macroName(Root.getName()) << "_RANGE(Base, First, Last)\n"; OS << "#endif\n\n"; OS << "#ifndef LAST_" << macroName(Root.getName()) << "_RANGE\n"; OS << "# define LAST_" << macroName(Root.getName()) << "_RANGE(Base, First, Last) " << macroName(Root.getName()) << "_RANGE(Base, First, Last)\n"; OS << "#endif\n\n"; // Emit statements const std::vector Stmts = Records.getAllDerivedDefinitions(Root.getName()); ChildMap Tree; for (unsigned i = 0, e = Stmts.size(); i != e; ++i) { Record *R = Stmts[i]; if (R->getValue("Base")) Tree.insert(std::make_pair(R->getValueAsDef("Base"), R)); else Tree.insert(std::make_pair(&Root, R)); } EmitNode(Tree, OS, &Root); OS << "#undef " << macroName(Root.getName()) << "\n"; OS << "#undef " << macroName(Root.getName()) << "_RANGE\n"; OS << "#undef LAST_" << macroName(Root.getName()) << "_RANGE\n"; OS << "#undef ABSTRACT_" << macroName(Root.getName()) << "\n"; } namespace clang { void EmitClangASTNodes(RecordKeeper &RK, raw_ostream &OS, const std::string &N, const std::string &S) { ClangASTNodesEmitter(RK, N, S).run(OS); } // Emits and addendum to a .inc file to enumerate the clang declaration // contexts. void EmitClangDeclContext(RecordKeeper &Records, raw_ostream &OS) { // FIXME: Find a .td file format to allow for this to be represented better. emitSourceFileHeader("List of AST Decl nodes", OS); OS << "#ifndef DECL_CONTEXT\n"; OS << "# define DECL_CONTEXT(DECL)\n"; OS << "#endif\n"; OS << "#ifndef DECL_CONTEXT_BASE\n"; OS << "# define DECL_CONTEXT_BASE(DECL) DECL_CONTEXT(DECL)\n"; OS << "#endif\n"; typedef std::set RecordSet; typedef std::vector RecordVector; RecordVector DeclContextsVector = Records.getAllDerivedDefinitions("DeclContext"); RecordVector Decls = Records.getAllDerivedDefinitions("Decl"); RecordSet DeclContexts (DeclContextsVector.begin(), DeclContextsVector.end()); for (RecordVector::iterator i = Decls.begin(), e = Decls.end(); i != e; ++i) { Record *R = *i; if (R->getValue("Base")) { Record *B = R->getValueAsDef("Base"); if (DeclContexts.find(B) != DeclContexts.end()) { OS << "DECL_CONTEXT_BASE(" << B->getName() << ")\n"; DeclContexts.erase(B); } } } // To keep identical order, RecordVector may be used // instead of RecordSet. for (RecordVector::iterator i = DeclContextsVector.begin(), e = DeclContextsVector.end(); i != e; ++i) if (DeclContexts.find(*i) != DeclContexts.end()) OS << "DECL_CONTEXT(" << (*i)->getName() << ")\n"; OS << "#undef DECL_CONTEXT\n"; OS << "#undef DECL_CONTEXT_BASE\n"; } } // end namespace clang @ 1.1.1.1.4.1 log @file ClangASTNodesEmitter.cpp was added on branch yamt-pagecache on 2014-05-22 16:19:50 +0000 @ text @d1 229 @ 1.1.1.1.4.2 log @sync with head. for a reference, the tree before this commit was tagged as yamt-pagecache-tag8. this commit was splitted into small chunks to avoid a limitation of cvs. ("Protocol error: too many arguments") @ text @a0 229 //=== ClangASTNodesEmitter.cpp - Generate Clang AST node tables -*- C++ -*-===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // These tablegen backends emit Clang AST node tables // //===----------------------------------------------------------------------===// #include "llvm/TableGen/Record.h" #include "llvm/TableGen/TableGenBackend.h" #include #include #include #include using namespace llvm; /// ClangASTNodesEmitter - The top-level class emits .inc files containing /// declarations of Clang statements. /// namespace { class ClangASTNodesEmitter { // A map from a node to each of its derived nodes. typedef std::multimap ChildMap; typedef ChildMap::const_iterator ChildIterator; RecordKeeper &Records; Record Root; const std::string &BaseSuffix; // Create a macro-ized version of a name static std::string macroName(std::string S) { for (unsigned i = 0; i < S.size(); ++i) S[i] = std::toupper(S[i]); return S; } // Return the name to be printed in the base field. Normally this is // the record's name plus the base suffix, but if it is the root node and // the suffix is non-empty, it's just the suffix. std::string baseName(Record &R) { if (&R == &Root && !BaseSuffix.empty()) return BaseSuffix; return R.getName() + BaseSuffix; } std::pair EmitNode (const ChildMap &Tree, raw_ostream& OS, Record *Base); public: explicit ClangASTNodesEmitter(RecordKeeper &R, const std::string &N, const std::string &S) : Records(R), Root(N, SMLoc(), R), BaseSuffix(S) {} // run - Output the .inc file contents void run(raw_ostream &OS); }; } // end anonymous namespace //===----------------------------------------------------------------------===// // Statement Node Tables (.inc file) generation. //===----------------------------------------------------------------------===// // Returns the first and last non-abstract subrecords // Called recursively to ensure that nodes remain contiguous std::pair ClangASTNodesEmitter::EmitNode( const ChildMap &Tree, raw_ostream &OS, Record *Base) { std::string BaseName = macroName(Base->getName()); ChildIterator i = Tree.lower_bound(Base), e = Tree.upper_bound(Base); Record *First = 0, *Last = 0; // This might be the pseudo-node for Stmt; don't assume it has an Abstract // bit if (Base->getValue("Abstract") && !Base->getValueAsBit("Abstract")) First = Last = Base; for (; i != e; ++i) { Record *R = i->second; bool Abstract = R->getValueAsBit("Abstract"); std::string NodeName = macroName(R->getName()); OS << "#ifndef " << NodeName << "\n"; OS << "# define " << NodeName << "(Type, Base) " << BaseName << "(Type, Base)\n"; OS << "#endif\n"; if (Abstract) OS << "ABSTRACT_" << macroName(Root.getName()) << "(" << NodeName << "(" << R->getName() << ", " << baseName(*Base) << "))\n"; else OS << NodeName << "(" << R->getName() << ", " << baseName(*Base) << ")\n"; if (Tree.find(R) != Tree.end()) { const std::pair &Result = EmitNode(Tree, OS, R); if (!First && Result.first) First = Result.first; if (Result.second) Last = Result.second; } else { if (!Abstract) { Last = R; if (!First) First = R; } } OS << "#undef " << NodeName << "\n\n"; } if (First) { assert (Last && "Got a first node but not a last node for a range!"); if (Base == &Root) OS << "LAST_" << macroName(Root.getName()) << "_RANGE("; else OS << macroName(Root.getName()) << "_RANGE("; OS << Base->getName() << ", " << First->getName() << ", " << Last->getName() << ")\n\n"; } return std::make_pair(First, Last); } void ClangASTNodesEmitter::run(raw_ostream &OS) { emitSourceFileHeader("List of AST nodes of a particular kind", OS); // Write the preamble OS << "#ifndef ABSTRACT_" << macroName(Root.getName()) << "\n"; OS << "# define ABSTRACT_" << macroName(Root.getName()) << "(Type) Type\n"; OS << "#endif\n"; OS << "#ifndef " << macroName(Root.getName()) << "_RANGE\n"; OS << "# define " << macroName(Root.getName()) << "_RANGE(Base, First, Last)\n"; OS << "#endif\n\n"; OS << "#ifndef LAST_" << macroName(Root.getName()) << "_RANGE\n"; OS << "# define LAST_" << macroName(Root.getName()) << "_RANGE(Base, First, Last) " << macroName(Root.getName()) << "_RANGE(Base, First, Last)\n"; OS << "#endif\n\n"; // Emit statements const std::vector Stmts = Records.getAllDerivedDefinitions(Root.getName()); ChildMap Tree; for (unsigned i = 0, e = Stmts.size(); i != e; ++i) { Record *R = Stmts[i]; if (R->getValue("Base")) Tree.insert(std::make_pair(R->getValueAsDef("Base"), R)); else Tree.insert(std::make_pair(&Root, R)); } EmitNode(Tree, OS, &Root); OS << "#undef " << macroName(Root.getName()) << "\n"; OS << "#undef " << macroName(Root.getName()) << "_RANGE\n"; OS << "#undef LAST_" << macroName(Root.getName()) << "_RANGE\n"; OS << "#undef ABSTRACT_" << macroName(Root.getName()) << "\n"; } namespace clang { void EmitClangASTNodes(RecordKeeper &RK, raw_ostream &OS, const std::string &N, const std::string &S) { ClangASTNodesEmitter(RK, N, S).run(OS); } // Emits and addendum to a .inc file to enumerate the clang declaration // contexts. void EmitClangDeclContext(RecordKeeper &Records, raw_ostream &OS) { // FIXME: Find a .td file format to allow for this to be represented better. emitSourceFileHeader("List of AST Decl nodes", OS); OS << "#ifndef DECL_CONTEXT\n"; OS << "# define DECL_CONTEXT(DECL)\n"; OS << "#endif\n"; OS << "#ifndef DECL_CONTEXT_BASE\n"; OS << "# define DECL_CONTEXT_BASE(DECL) DECL_CONTEXT(DECL)\n"; OS << "#endif\n"; typedef std::set RecordSet; typedef std::vector RecordVector; RecordVector DeclContextsVector = Records.getAllDerivedDefinitions("DeclContext"); RecordVector Decls = Records.getAllDerivedDefinitions("Decl"); RecordSet DeclContexts (DeclContextsVector.begin(), DeclContextsVector.end()); for (RecordVector::iterator i = Decls.begin(), e = Decls.end(); i != e; ++i) { Record *R = *i; if (R->getValue("Base")) { Record *B = R->getValueAsDef("Base"); if (DeclContexts.find(B) != DeclContexts.end()) { OS << "DECL_CONTEXT_BASE(" << B->getName() << ")\n"; DeclContexts.erase(B); } } } // To keep identical order, RecordVector may be used // instead of RecordSet. for (RecordVector::iterator i = DeclContextsVector.begin(), e = DeclContextsVector.end(); i != e; ++i) if (DeclContexts.find(*i) != DeclContexts.end()) OS << "DECL_CONTEXT(" << (*i)->getName() << ")\n"; OS << "#undef DECL_CONTEXT\n"; OS << "#undef DECL_CONTEXT_BASE\n"; } } // end namespace clang @