summaryrefslogtreecommitdiff
path: root/utils/TableGen
diff options
context:
space:
mode:
authorChris Lattner <sabre@nondot.org>2007-11-22 20:49:04 +0000
committerChris Lattner <sabre@nondot.org>2007-11-22 20:49:04 +0000
commitf460165a4c1bf4bc762f9b3f12b9ed284b89cc99 (patch)
tree682aa3de3d166b50c3025180826f14903bbd5e1e /utils/TableGen
parented4a2f168873527e1737deaa7a0c6c045a2cff7d (diff)
downloadllvm-f460165a4c1bf4bc762f9b3f12b9ed284b89cc99.tar.gz
llvm-f460165a4c1bf4bc762f9b3f12b9ed284b89cc99.tar.bz2
llvm-f460165a4c1bf4bc762f9b3f12b9ed284b89cc99.tar.xz
Rewrite the tblgen parser in a recursive descent style, eliminating the bison parser.
This makes the parser much easier to understand, eliminates a ton of global variables, and gives tblgen nice caret diagnostics. It is also faster, but tblgen probably doesn't care about performance. There are a couple of FIXMEs which I will take care of next. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@44274 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'utils/TableGen')
-rw-r--r--utils/TableGen/FileParser.cpp.cvs2106
-rw-r--r--utils/TableGen/FileParser.h.cvs40
-rw-r--r--utils/TableGen/FileParser.y806
-rw-r--r--utils/TableGen/FileParser.y.cvs806
-rw-r--r--utils/TableGen/Makefile12
-rw-r--r--utils/TableGen/TGLexer.cpp226
-rw-r--r--utils/TableGen/TGLexer.h79
-rw-r--r--utils/TableGen/TGParser.cpp1372
-rw-r--r--utils/TableGen/TGParser.h109
-rw-r--r--utils/TableGen/TableGen.cpp33
10 files changed, 1661 insertions, 3928 deletions
diff --git a/utils/TableGen/FileParser.cpp.cvs b/utils/TableGen/FileParser.cpp.cvs
deleted file mode 100644
index a49846ffa0..0000000000
--- a/utils/TableGen/FileParser.cpp.cvs
+++ /dev/null
@@ -1,2106 +0,0 @@
-
-/* A Bison parser, made from /Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y
- by GNU Bison version 1.28 */
-
-#define YYBISON 1 /* Identify Bison output. */
-
-#define yyparse Fileparse
-#define yylex Filelex
-#define yyerror Fileerror
-#define yylval Filelval
-#define yychar Filechar
-#define yydebug Filedebug
-#define yynerrs Filenerrs
-#define INT 257
-#define BIT 258
-#define STRING 259
-#define BITS 260
-#define LIST 261
-#define CODE 262
-#define DAG 263
-#define CLASS 264
-#define DEF 265
-#define MULTICLASS 266
-#define DEFM 267
-#define FIELD 268
-#define LET 269
-#define IN 270
-#define CONCATTOK 271
-#define SHLTOK 272
-#define SRATOK 273
-#define SRLTOK 274
-#define STRCONCATTOK 275
-#define INTVAL 276
-#define ID 277
-#define VARNAME 278
-#define STRVAL 279
-#define CODEFRAGMENT 280
-
-#line 14 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-
-#include "Record.h"
-#include "llvm/ADT/StringExtras.h"
-#include "llvm/Support/Streams.h"
-#include <algorithm>
-#include <cstdio>
-#define YYERROR_VERBOSE 1
-
-int yyerror(const char *ErrorMsg);
-int yylex();
-
-namespace llvm {
- struct MultiClass {
- Record Rec; // Placeholder for template args and Name.
- std::vector<Record*> DefPrototypes;
-
- MultiClass(const std::string &Name) : Rec(Name) {}
- };
-
-
-static std::map<std::string, MultiClass*> MultiClasses;
-
-extern int Filelineno;
-static MultiClass *CurMultiClass = 0; // Set while parsing a multiclass.
-static std::string *CurDefmPrefix = 0; // Set while parsing defm.
-static Record *CurRec = 0;
-static bool ParsingTemplateArgs = false;
-
-typedef std::pair<Record*, std::vector<Init*>*> SubClassRefTy;
-
-struct LetRecord {
- std::string Name;
- std::vector<unsigned> Bits;
- Init *Value;
- bool HasBits;
- LetRecord(const std::string &N, std::vector<unsigned> *B, Init *V)
- : Name(N), Value(V), HasBits(B != 0) {
- if (HasBits) Bits = *B;
- }
-};
-
-static std::vector<std::vector<LetRecord> > LetStack;
-
-
-extern std::ostream &err();
-
-/// getActiveRec - If inside a def/class definition, return the def/class.
-/// Otherwise, if within a multidef, return it.
-static Record *getActiveRec() {
- return CurRec ? CurRec : &CurMultiClass->Rec;
-}
-
-static void addValue(const RecordVal &RV) {
- Record *TheRec = getActiveRec();
-
- if (RecordVal *ERV = TheRec->getValue(RV.getName())) {
- // The value already exists in the class, treat this as a set...
- if (ERV->setValue(RV.getValue())) {
- err() << "New definition of '" << RV.getName() << "' of type '"
- << *RV.getType() << "' is incompatible with previous "
- << "definition of type '" << *ERV->getType() << "'!\n";
- exit(1);
- }
- } else {
- TheRec->addValue(RV);
- }
-}
-
-static void addSuperClass(Record *SC) {
- if (CurRec->isSubClassOf(SC)) {
- err() << "Already subclass of '" << SC->getName() << "'!\n";
- exit(1);
- }
- CurRec->addSuperClass(SC);
-}
-
-static void setValue(const std::string &ValName,
- std::vector<unsigned> *BitList, Init *V) {
- if (!V) return;
-
- Record *TheRec = getActiveRec();
- RecordVal *RV = TheRec->getValue(ValName);
- if (RV == 0) {
- err() << "Value '" << ValName << "' unknown!\n";
- exit(1);
- }
-
- // Do not allow assignments like 'X = X'. This will just cause infinite loops
- // in the resolution machinery.
- if (!BitList)
- if (VarInit *VI = dynamic_cast<VarInit*>(V))
- if (VI->getName() == ValName)
- return;
-
- // If we are assigning to a subset of the bits in the value... then we must be
- // assigning to a field of BitsRecTy, which must have a BitsInit
- // initializer...
- //
- if (BitList) {
- BitsInit *CurVal = dynamic_cast<BitsInit*>(RV->getValue());
- if (CurVal == 0) {
- err() << "Value '" << ValName << "' is not a bits type!\n";
- exit(1);
- }
-
- // Convert the incoming value to a bits type of the appropriate size...
- Init *BI = V->convertInitializerTo(new BitsRecTy(BitList->size()));
- if (BI == 0) {
- V->convertInitializerTo(new BitsRecTy(BitList->size()));
- err() << "Initializer '" << *V << "' not compatible with bit range!\n";
- exit(1);
- }
-
- // We should have a BitsInit type now...
- assert(dynamic_cast<BitsInit*>(BI) != 0 || (cerr << *BI).stream() == 0);
- BitsInit *BInit = (BitsInit*)BI;
-
- BitsInit *NewVal = new BitsInit(CurVal->getNumBits());
-
- // Loop over bits, assigning values as appropriate...
- for (unsigned i = 0, e = BitList->size(); i != e; ++i) {
- unsigned Bit = (*BitList)[i];
- if (NewVal->getBit(Bit)) {
- err() << "Cannot set bit #" << Bit << " of value '" << ValName
- << "' more than once!\n";
- exit(1);
- }
- NewVal->setBit(Bit, BInit->getBit(i));
- }
-
- for (unsigned i = 0, e = CurVal->getNumBits(); i != e; ++i)
- if (NewVal->getBit(i) == 0)
- NewVal->setBit(i, CurVal->getBit(i));
-
- V = NewVal;
- }
-
- if (RV->setValue(V)) {
- err() << "Value '" << ValName << "' of type '" << *RV->getType()
- << "' is incompatible with initializer '" << *V << "'!\n";
- exit(1);
- }
-}
-
-// addSubClass - Add SC as a subclass to CurRec, resolving TemplateArgs as SC's
-// template arguments.
-static void addSubClass(Record *SC, const std::vector<Init*> &TemplateArgs) {
- // Add all of the values in the subclass into the current class...
- const std::vector<RecordVal> &Vals = SC->getValues();
- for (unsigned i = 0, e = Vals.size(); i != e; ++i)
- addValue(Vals[i]);
-
- const std::vector<std::string> &TArgs = SC->getTemplateArgs();
-
- // Ensure that an appropriate number of template arguments are specified...
- if (TArgs.size() < TemplateArgs.size()) {
- err() << "ERROR: More template args specified than expected!\n";
- exit(1);
- }
-
- // Loop over all of the template arguments, setting them to the specified
- // value or leaving them as the default if necessary.
- for (unsigned i = 0, e = TArgs.size(); i != e; ++i) {
- if (i < TemplateArgs.size()) { // A value is specified for this temp-arg?
- // Set it now.
- setValue(TArgs[i], 0, TemplateArgs[i]);
-
- // Resolve it next.
- CurRec->resolveReferencesTo(CurRec->getValue(TArgs[i]));
-
-
- // Now remove it.
- CurRec->removeValue(TArgs[i]);
-
- } else if (!CurRec->getValue(TArgs[i])->getValue()->isComplete()) {
- err() << "ERROR: Value not specified for template argument #"
- << i << " (" << TArgs[i] << ") of subclass '" << SC->getName()
- << "'!\n";
- exit(1);
- }
- }
-
- // Since everything went well, we can now set the "superclass" list for the
- // current record.
- const std::vector<Record*> &SCs = SC->getSuperClasses();
- for (unsigned i = 0, e = SCs.size(); i != e; ++i)
- addSuperClass(SCs[i]);
- addSuperClass(SC);
-}
-
-} // End llvm namespace
-
-using namespace llvm;
-
-
-#line 210 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-typedef union {
- std::string* StrVal;
- int IntVal;
- llvm::RecTy* Ty;
- llvm::Init* Initializer;
- std::vector<llvm::Init*>* FieldList;
- std::vector<unsigned>* BitList;
- llvm::Record* Rec;
- std::vector<llvm::Record*>* RecList;
- SubClassRefTy* SubClassRef;
- std::vector<SubClassRefTy>* SubClassList;
- std::vector<std::pair<llvm::Init*, std::string> >* DagValueList;
-} YYSTYPE;
-#include <stdio.h>
-
-#ifndef __cplusplus
-#ifndef __STDC__
-#define const
-#endif
-#endif
-
-
-
-#define YYFINAL 194
-#define YYFLAG -32768
-#define YYNTBASE 42
-
-#define YYTRANSLATE(x) ((unsigned)(x) <= 280 ? yytranslate[x] : 91)
-
-static const char yytranslate[] = { 0,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 36,
- 37, 2, 2, 38, 40, 35, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 39, 41, 27,
- 29, 28, 30, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 33, 2, 34, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 31, 2, 32, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 1, 3, 4, 5, 6,
- 7, 8, 9, 10, 11, 12, 13, 14, 15, 16,
- 17, 18, 19, 20, 21, 22, 23, 24, 25, 26
-};
-
-#if YYDEBUG != 0
-static const short yyprhs[] = { 0,
- 0, 2, 4, 6, 11, 13, 18, 20, 22, 24,
- 25, 27, 28, 31, 33, 35, 37, 39, 41, 43,
- 47, 52, 57, 61, 65, 70, 75, 82, 89, 96,
- 103, 110, 111, 114, 117, 122, 123, 125, 127, 131,
- 134, 138, 144, 149, 151, 152, 156, 157, 159, 161,
- 165, 170, 173, 180, 181, 184, 186, 190, 192, 197,
- 199, 203, 204, 207, 209, 213, 217, 218, 220, 222,
- 223, 225, 227, 229, 230, 234, 235, 236, 243, 247,
- 249, 251, 254, 256, 257, 258, 267, 268, 275, 277,
- 279, 281, 283, 288, 290, 294, 295, 300, 305, 308,
- 310, 313
-};
-
-static const short yyrhs[] = { 23,
- 0, 5, 0, 4, 0, 6, 27, 22, 28, 0,
- 3, 0, 7, 27, 43, 28, 0, 8, 0, 9,
- 0, 42, 0, 0, 14, 0, 0, 29, 47, 0,
- 23, 0, 46, 0, 22, 0, 25, 0, 26, 0,
- 30, 0, 31, 54, 32, 0, 23, 27, 55, 28,
- 0, 47, 31, 52, 32, 0, 33, 54, 34, 0,
- 47, 35, 23, 0, 36, 46, 50, 37, 0, 47,
- 33, 52, 34, 0, 17, 36, 47, 38, 47, 37,
- 0, 18, 36, 47, 38, 47, 37, 0, 19, 36,
- 47, 38, 47, 37, 0, 20, 36, 47, 38, 47,
- 37, 0, 21, 36, 47, 38, 47, 37, 0, 0,
- 39, 24, 0, 47, 48, 0, 49, 38, 47, 48,
- 0, 0, 49, 0, 22, 0, 22, 40, 22, 0,
- 22, 22, 0, 51, 38, 22, 0, 51, 38, 22,
- 40, 22, 0, 51, 38, 22, 22, 0, 51, 0,
- 0, 31, 52, 32, 0, 0, 55, 0, 47, 0,
- 55, 38, 47, 0, 44, 43, 23, 45, 0, 56,
- 41, 0, 15, 23, 53, 29, 47, 41, 0, 0,
- 58, 57, 0, 41, 0, 31, 58, 32, 0, 42,
- 0, 42, 27, 55, 28, 0, 60, 0, 61, 38,
- 60, 0, 0, 39, 61, 0, 56, 0, 63, 38,
- 56, 0, 27, 63, 28, 0, 0, 64, 0, 23,
- 0, 0, 66, 0, 67, 0, 67, 0, 0, 62,
- 71, 59, 0, 0, 0, 10, 68, 73, 65, 74,
- 70, 0, 11, 69, 70, 0, 75, 0, 76, 0,
- 77, 76, 0, 23, 0, 0, 0, 12, 78, 80,
- 65, 81, 31, 77, 32, 0, 0, 13, 23, 83,
- 39, 60, 41, 0, 72, 0, 75, 0, 79, 0,
- 82, 0, 23, 53, 29, 47, 0, 85, 0, 86,
- 38, 85, 0, 0, 15, 88, 86, 16, 0, 87,
- 31, 89, 32, 0, 87, 84, 0, 84, 0, 89,
- 84, 0, 89, 0
-};
-
-#endif
-
-#if YYDEBUG != 0
-static const short yyrline[] = { 0,
- 246, 268, 270, 272, 274, 276, 278, 280, 282, 286,
- 286, 288, 288, 290, 313, 315, 317, 320, 323, 325,
- 338, 366, 373, 376, 383, 386, 394, 396, 398, 400,
- 402, 406, 409, 413, 418, 424, 427, 430, 433, 446,
- 460, 462, 475, 491, 493, 493, 497, 499, 503, 506,
- 510, 527, 529, 535, 535, 536, 536, 538, 540, 544,
- 549, 554, 557, 561, 564, 569, 570, 570, 572, 572,
- 574, 581, 599, 624, 638, 643, 645, 647, 651, 661,
- 675, 678, 682, 693, 695, 697, 702, 702, 776, 776,
- 777, 777, 779, 784, 784, 787, 787, 790, 793, 797,
- 797, 799
-};
-#endif
-
-
-#if YYDEBUG != 0 || defined (YYERROR_VERBOSE)
-
-static const char * const yytname[] = { "$","error","$undefined.","INT","BIT",
-"STRING","BITS","LIST","CODE","DAG","CLASS","DEF","MULTICLASS","DEFM","FIELD",
-"LET","IN","CONCATTOK","SHLTOK","SRATOK","SRLTOK","STRCONCATTOK","INTVAL","ID",
-"VARNAME","STRVAL","CODEFRAGMENT","'<'","'>'","'='","'?'","'{'","'}'","'['",
-"']'","'.'","'('","')'","','","':'","'-'","';'","ClassID","Type","OptPrefix",
-"OptValue","IDValue","Value","OptVarName","DagArgListNE","DagArgList","RBitList",
-"BitList","OptBitList","ValueList","ValueListNE","Declaration","BodyItem","BodyList",
-"Body","SubClassRef","ClassListNE","ClassList","DeclListNE","TemplateArgList",
-"OptTemplateArgList","OptID","ObjectName","ClassName","DefName","ObjectBody",
-"@1","ClassInst","@2","@3","DefInst","MultiClassDef","MultiClassBody","MultiClassName",
-"MultiClassInst","@4","@5","DefMInst","@6","Object","LETItem","LETList","LETCommand",
-"@7","ObjectList","File", NULL
-};
-#endif
-
-static const short yyr1[] = { 0,
- 42, 43, 43, 43, 43, 43, 43, 43, 43, 44,
- 44, 45, 45, 46, 47, 47, 47, 47, 47, 47,
- 47, 47, 47, 47, 47, 47, 47, 47, 47, 47,
- 47, 48, 48, 49, 49, 50, 50, 51, 51, 51,
- 51, 51, 51, 52, 53, 53, 54, 54, 55, 55,
- 56, 57, 57, 58, 58, 59, 59, 60, 60, 61,
- 61, 62, 62, 63, 63, 64, 65, 65, 66, 66,
- 67, 68, 69, 71, 70, 73, 74, 72, 75, 76,
- 77, 77, 78, 80, 81, 79, 83, 82, 84, 84,
- 84, 84, 85, 86, 86, 88, 87, 84, 84, 89,
- 89, 90
-};
-
-static const short yyr2[] = { 0,
- 1, 1, 1, 4, 1, 4, 1, 1, 1, 0,
- 1, 0, 2, 1, 1, 1, 1, 1, 1, 3,
- 4, 4, 3, 3, 4, 4, 6, 6, 6, 6,
- 6, 0, 2, 2, 4, 0, 1, 1, 3, 2,
- 3, 5, 4, 1, 0, 3, 0, 1, 1, 3,
- 4, 2, 6, 0, 2, 1, 3, 1, 4, 1,
- 3, 0, 2, 1, 3, 3, 0, 1, 1, 0,
- 1, 1, 1, 0, 3, 0, 0, 6, 3, 1,
- 1, 2, 1, 0, 0, 8, 0, 6, 1, 1,
- 1, 1, 4, 1, 3, 0, 4, 4, 2, 1,
- 2, 1
-};
-
-static const short yydefact[] = { 0,
- 70, 70, 0, 0, 96, 89, 90, 91, 92, 100,
- 0, 102, 69, 71, 72, 76, 73, 62, 83, 84,
- 87, 0, 0, 99, 101, 67, 0, 74, 79, 67,
- 0, 45, 94, 0, 0, 10, 68, 77, 1, 58,
- 60, 63, 0, 85, 0, 0, 0, 97, 0, 98,
- 11, 0, 64, 0, 62, 0, 0, 54, 56, 75,
- 0, 0, 38, 44, 0, 0, 95, 5, 3, 2,
- 0, 0, 7, 8, 9, 0, 66, 10, 78, 0,
- 0, 0, 0, 0, 16, 14, 17, 18, 19, 47,
- 47, 0, 15, 49, 0, 61, 10, 0, 88, 40,
- 0, 0, 46, 93, 0, 0, 12, 65, 0, 0,
- 0, 0, 0, 0, 0, 48, 0, 14, 36, 0,
- 0, 0, 59, 0, 0, 57, 0, 55, 80, 81,
- 0, 39, 41, 0, 0, 0, 51, 0, 0, 0,
- 0, 0, 0, 20, 23, 32, 37, 0, 0, 0,
- 24, 50, 45, 52, 86, 82, 43, 0, 4, 6,
- 13, 0, 0, 0, 0, 0, 21, 0, 34, 0,
- 25, 22, 26, 0, 42, 0, 0, 0, 0, 0,
- 33, 32, 0, 27, 28, 29, 30, 31, 35, 0,
- 53, 0, 0, 0
-};
-
-static const short yydefgoto[] = { 40,
- 76, 52, 137, 93, 94, 169, 147, 148, 64, 65,
- 47, 115, 116, 53, 128, 97, 60, 41, 42, 28,
- 54, 37, 38, 14, 15, 16, 18, 29, 43, 6,
- 26, 55, 7, 130, 131, 20, 8, 30, 61, 9,
- 31, 10, 33, 34, 11, 22, 12, 192
-};
-
-static const short yypact[] = { 147,
- -17, -17, 8, 12,-32768,-32768,-32768,-32768,-32768,-32768,
- 3, 147,-32768,-32768,-32768,-32768,-32768, -13,-32768,-32768,
--32768, 17, 147,-32768,-32768, 21, 58,-32768,-32768, 21,
- 45, 55,-32768, -5, -3, 77,-32768,-32768,-32768, 68,
--32768, 64, -4,-32768, 58, 84, 81,-32768, 17,-32768,
--32768, 16,-32768, 13, -13, 43, 58,-32768,-32768,-32768,
- 88, 74, 10, 83, 93, 43,-32768,-32768,-32768,-32768,
- 100, 104,-32768,-32768,-32768, 110,-32768, 77,-32768, 117,
- 125, 127, 128, 129,-32768, 139,-32768,-32768,-32768, 43,
- 43, 132,-32768, 59, 14,-32768, 40, 156,-32768,-32768,
- 146, 148,-32768, 59, 149, 16, 140,-32768, 43, 43,
- 43, 43, 43, 43, 141, 134, 142,-32768, 43, 84,
- 84, 151,-32768, 43, 152,-32768, 136,-32768,-32768,-32768,
- 6,-32768, 35, 150, 153, 43,-32768, 70, 76, 85,
- 91, 97, 39,-32768,-32768, 54, 144, 143, 154, 145,
--32768, 59, 55,-32768,-32768,-32768,-32768, 161,-32768,-32768,
- 59, 43, 43, 43, 43, 43,-32768, 160,-32768, 43,
--32768,-32768,-32768, 158,-32768, 103, 106, 111, 114, 119,
--32768, 54, 43,-32768,-32768,-32768,-32768,-32768,-32768, 47,
--32768, 185, 188,-32768
-};
-
-static const short yypgoto[] = { -50,
- 86,-32768,-32768, 98, -66, 7,-32768,-32768,-32768, -8,
- 38, 102, -55, -48,-32768,-32768,-32768, 26,-32768,-32768,
--32768,-32768, 164,-32768, 193,-32768,-32768, 155,-32768,-32768,
--32768,-32768, -95, 65,-32768,-32768,-32768,-32768,-32768,-32768,
--32768, -7, 157,-32768,-32768,-32768, 174,-32768
-};
-
-
-#define YYLAST 210
-
-
-static const short yytable[] = { 104,
- 95, 75, 129, 24, 25, 13, 1, 2, 3, 4,
- 48, 5, 1, 2, 3, 4, 2, 5, 68, 69,
- 70, 71, 72, 73, 74, 27, 58, 25, 50, 108,
- 19, 100, 49, 23, 21, 129, 59, 155, 39, 32,
- 77, 123, 138, 139, 140, 141, 142, 36, 127, 101,
- 78, 124, 146, 51, 125, 75, 157, 152, 143, 80,
- 81, 82, 83, 84, 85, 86, 167, 87, 88, 161,
- 62, 126, 89, 90, 158, 91, 124, 120, 92, 121,
- 39, 122, 96, 45, 120, 46, 121, 191, 122, 120,
- 51, 121, 168, 122, 56, 176, 177, 178, 179, 180,
- 120, 57, 121, 182, 122, 63, 120, 162, 121, 66,
- 122, 149, 150, 163, 99, 120, 190, 121, 98, 122,
- 102, 120, 164, 121, 103, 122, 105, 120, 165, 121,
- 106, 122, 107, 120, 166, 121, 120, 122, 121, 184,
- 122, 120, 185, 121, 120, 122, 121, 186, 122, 120,
- 187, 121, 109, 122, 118, 188, 1, 2, 3, 4,
- 110, 5, 111, 112, 113, 114, 2, 132, 136, 133,
- 134, 124, 144, 151, 153, 145, 154, 159, 173, 171,
- 160, 170, 175, 181, 193, 172, 183, 194, 189, 119,
- 174, 135, 117, 44, 17, 156, 35, 0, 0, 0,
- 0, 0, 0, 0, 0, 67, 0, 0, 0, 79
-};
-
-static const short yycheck[] = { 66,
- 56, 52, 98, 11, 12, 23, 10, 11, 12, 13,
- 16, 15, 10, 11, 12, 13, 11, 15, 3, 4,
- 5, 6, 7, 8, 9, 39, 31, 35, 32, 78,
- 23, 22, 38, 31, 23, 131, 41, 32, 23, 23,
- 28, 28, 109, 110, 111, 112, 113, 27, 97, 40,
- 38, 38, 119, 14, 15, 106, 22, 124, 114, 17,
- 18, 19, 20, 21, 22, 23, 28, 25, 26, 136,
- 45, 32, 30, 31, 40, 33, 38, 31, 36, 33,
- 23, 35, 57, 39, 31, 31, 33, 41, 35, 31,
- 14, 33, 39, 35, 27, 162, 163, 164, 165, 166,
- 31, 38, 33, 170, 35, 22, 31, 38, 33, 29,
- 35, 120, 121, 38, 41, 31, 183, 33, 31, 35,
- 38, 31, 38, 33, 32, 35, 27, 31, 38, 33,
- 27, 35, 23, 31, 38, 33, 31, 35, 33, 37,
- 35, 31, 37, 33, 31, 35, 33, 37, 35, 31,
- 37, 33, 36, 35, 23, 37, 10, 11, 12, 13,
- 36, 15, 36, 36, 36, 27, 11, 22, 29, 22,
- 22, 38, 32, 23, 23, 34, 41, 28, 34, 37,
- 28, 38, 22, 24, 0, 32, 29, 0, 182, 92,
- 153, 106, 91, 30, 2, 131, 23, -1, -1, -1,
- -1, -1, -1, -1, -1, 49, -1, -1, -1, 55
-};
-/* -*-C-*- Note some compilers choke on comments on `#line' lines. */
-#line 3 "/usr/share/bison.simple"
-/* This file comes from bison-1.28. */
-
-/* Skeleton output parser for bison,
- Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc.
-
- This program is free software; you can redistribute it and/or modify
- it under the terms of the GNU General Public License as published by
- the Free Software Foundation; either version 2, or (at your option)
- any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
-
- You should have received a copy of the GNU General Public License
- along with this program; if not, write to the Free Software
- Foundation, Inc., 59 Temple Place - Suite 330,
- Boston, MA 02111-1307, USA. */
-
-/* As a special exception, when this file is copied by Bison into a
- Bison output file, you may use that output file without restriction.
- This special exception was added by the Free Software Foundation
- in version 1.24 of Bison. */
-
-/* This is the parser code that is written into each bison parser
- when the %semantic_parser declaration is not specified in the grammar.
- It was written by Richard Stallman by simplifying the hairy parser
- used when %semantic_parser is specified. */
-
-#ifndef YYSTACK_USE_ALLOCA
-#ifdef alloca
-#define YYSTACK_USE_ALLOCA
-#else /* alloca not defined */
-#ifdef __GNUC__
-#define YYSTACK_USE_ALLOCA
-#define alloca __builtin_alloca
-#else /* not GNU C. */
-#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386))
-#define YYSTACK_USE_ALLOCA
-#include <alloca.h>
-#else /* not sparc */
-/* We think this test detects Watcom and Microsoft C. */
-/* This used to test MSDOS, but that is a bad idea
- since that symbol is in the user namespace. */
-#if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__)
-#if 0 /* No need for malloc.h, which pollutes the namespace;
- instead, just don't use alloca. */
-#include <malloc.h>
-#endif
-#else /* not MSDOS, or __TURBOC__ */
-#if defined(_AIX)
-/* I don't know what this was needed for, but it pollutes the namespace.
- So I turned it off. rms, 2 May 1997. */
-/* #include <malloc.h> */
- #pragma alloca
-#define YYSTACK_USE_ALLOCA
-#else /* not MSDOS, or __TURBOC__, or _AIX */
-#if 0
-#ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up,
- and on HPUX 10. Eventually we can turn this on. */
-#define YYSTACK_USE_ALLOCA
-#define alloca __builtin_alloca
-#endif /* __hpux */
-#endif
-#endif /* not _AIX */
-#endif /* not MSDOS, or __TURBOC__ */
-#endif /* not sparc */
-#endif /* not GNU C */
-#endif /* alloca not defined */
-#endif /* YYSTACK_USE_ALLOCA not defined */
-
-#ifdef YYSTACK_USE_ALLOCA
-#define YYSTACK_ALLOC alloca
-#else
-#define YYSTACK_ALLOC malloc
-#endif
-
-/* Note: there must be only one dollar sign in this file.
- It is replaced by the list of actions, each action
- as one case of the switch. */
-
-#define yyerrok (yyerrstatus = 0)
-#define yyclearin (yychar = YYEMPTY)
-#define YYEMPTY -2
-#define YYEOF 0
-#define YYACCEPT goto yyacceptlab
-#define YYABORT goto yyabortlab
-#define YYERROR goto yyerrlab1
-/* Like YYERROR except do call yyerror.
- This remains here temporarily to ease the
- transition to the new meaning of YYERROR, for GCC.
- Once GCC version 2 has supplanted version 1, this can go. */
-#define YYFAIL goto yyerrlab
-#define YYRECOVERING() (!!yyerrstatus)
-#define YYBACKUP(token, value) \
-do \
- if (yychar == YYEMPTY && yylen == 1) \
- { yychar = (token), yylval = (value); \
- yychar1 = YYTRANSLATE (yychar); \
- YYPOPSTACK; \
- goto yybackup; \
- } \
- else \
- { yyerror ("syntax error: cannot back up"); YYERROR; } \
-while (0)
-
-#define YYTERROR 1
-#define YYERRCODE 256
-
-#ifndef YYPURE
-#define YYLEX yylex()
-#endif
-
-#ifdef YYPURE
-#ifdef YYLSP_NEEDED
-#ifdef YYLEX_PARAM
-#define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM)
-#else
-#define YYLEX yylex(&yylval, &yylloc)
-#endif
-#else /* not YYLSP_NEEDED */
-#ifdef YYLEX_PARAM
-#define YYLEX yylex(&yylval, YYLEX_PARAM)
-#else
-#define YYLEX yylex(&yylval)
-#endif
-#endif /* not YYLSP_NEEDED */
-#endif
-
-/* If nonreentrant, generate the variables here */
-
-#ifndef YYPURE
-
-int yychar; /* the lookahead symbol */
-YYSTYPE yylval; /* the semantic value of the */
- /* lookahead symbol */
-
-#ifdef YYLSP_NEEDED
-YYLTYPE yylloc; /* location data for the lookahead */
- /* symbol */
-#endif
-
-int yynerrs; /* number of parse errors so far */
-#endif /* not YYPURE */
-
-#if YYDEBUG != 0
-int yydebug; /* nonzero means print parse trace */
-/* Since this is uninitialized, it does not stop multiple parsers
- from coexisting. */
-#endif
-
-/* YYINITDEPTH indicates the initial size of the parser's stacks */
-
-#ifndef YYINITDEPTH
-#define YYINITDEPTH 200
-#endif
-
-/* YYMAXDEPTH is the maximum size the stacks can grow to
- (effective only if the built-in stack extension method is used). */
-
-#if YYMAXDEPTH == 0
-#undef YYMAXDEPTH
-#endif
-
-#ifndef YYMAXDEPTH
-#define YYMAXDEPTH 10000
-#endif
-
-/* Define __yy_memcpy. Note that the size argument
- should be passed with type unsigned int, because that is what the non-GCC
- definitions require. With GCC, __builtin_memcpy takes an arg
- of type size_t, but it can handle unsigned int. */
-
-#if __GNUC__ > 1 /* GNU C and GNU C++ define this. */
-#define __yy_memcpy(TO,FROM,COUNT) __builtin_memcpy(TO,FROM,COUNT)
-#else /* not GNU C or C++ */
-#ifndef __cplusplus
-
-/* This is the most reliable way to avoid incompatibilities
- in available built-in functions on various systems. */
-static void
-__yy_memcpy (to, from, count)
- char *to;
- char *from;
- unsigned int count;
-{
- register char *f = from;
- register char *t = to;
- register int i = count;
-
- while (i-- > 0)
- *t++ = *f++;
-}
-
-#else /* __cplusplus */
-
-/* This is the most reliable way to avoid incompatibilities
- in available built-in functions on various systems. */
-static void
-__yy_memcpy (char *to, char *from, unsigned int count)
-{
- register char *t = to;
- register char *f = from;
- register int i = count;
-
- while (i-- > 0)
- *t++ = *f++;
-}
-
-#endif
-#endif
-
-#line 217 "/usr/share/bison.simple"
-
-/* The user can define YYPARSE_PARAM as the name of an argument to be passed
- into yyparse. The argument should have type void *.
- It should actually point to an object.
- Grammar actions can access the variable by casting it
- to the proper pointer type. */
-
-#ifdef YYPARSE_PARAM
-#ifdef __cplusplus
-#define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
-#define YYPARSE_PARAM_DECL
-#else /* not __cplusplus */
-#define YYPARSE_PARAM_ARG YYPARSE_PARAM
-#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
-#endif /* not __cplusplus */
-#else /* not YYPARSE_PARAM */
-#define YYPARSE_PARAM_ARG
-#define YYPARSE_PARAM_DECL
-#endif /* not YYPARSE_PARAM */
-
-/* Prevent warning if -Wstrict-prototypes. */
-#ifdef __GNUC__
-#ifdef YYPARSE_PARAM
-int yyparse (void *);
-#else
-int yyparse (void);
-#endif
-#endif
-
-int
-yyparse(YYPARSE_PARAM_ARG)
- YYPARSE_PARAM_DECL
-{
- register int yystate;
- register int yyn;
- register short *yyssp;
- register YYSTYPE *yyvsp;
- int yyerrstatus; /* number of tokens to shift before error messages enabled */
- int yychar1 = 0; /* lookahead token as an internal (translated) token number */
-
- short yyssa[YYINITDEPTH]; /* the state stack */
- YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */
-
- short *yyss = yyssa; /* refer to the stacks thru separate pointers */
- YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */
-
-#ifdef YYLSP_NEEDED
- YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */
- YYLTYPE *yyls = yylsa;
- YYLTYPE *yylsp;
-
-#define YYPOPSTACK (yyvsp--, yyssp--, yylsp--)
-#else
-#define YYPOPSTACK (yyvsp--, yyssp--)
-#endif
-
- int yystacksize = YYINITDEPTH;
- int yyfree_stacks = 0;
-
-#ifdef YYPURE
- int yychar;
- YYSTYPE yylval;
- int yynerrs;
-#ifdef YYLSP_NEEDED
- YYLTYPE yylloc;
-#endif
-#endif
-
- YYSTYPE yyval; /* the variable used to return */
- /* semantic values from the action */
- /* routines */
-
- int yylen;
-
-#if YYDEBUG != 0
- if (yydebug)
- fprintf(stderr, "Starting parse\n");
-#endif
-
- yystate = 0;
- yyerrstatus = 0;
- yynerrs = 0;
- yychar = YYEMPTY; /* Cause a token to be read. */
-
- /* Initialize stack pointers.
- Waste one element of value and location stack
- so that they stay on the same level as the state stack.
- The wasted elements are never initialized. */
-
- yyssp = yyss - 1;
- yyvsp = yyvs;
-#ifdef YYLSP_NEEDED
- yylsp = yyls;
-#endif
-
-/* Push a new state, which is found in yystate . */
-/* In all cases, when you get here, the value and location stacks
- have just been pushed. so pushing a state here evens the stacks. */
-yynewstate:
-
- *++yyssp = yystate;
-
- if (yyssp >= yyss + yystacksize - 1)
- {
- /* Give user a chance to reallocate the stack */
- /* Use copies of these so that the &'s don't force the real ones into memory. */
- YYSTYPE *yyvs1 = yyvs;
- short *yyss1 = yyss;
-#ifdef YYLSP_NEEDED
- YYLTYPE *yyls1 = yyls;
-#endif
-
- /* Get the current used size of the three stacks, in elements. */
- int size = yyssp - yyss + 1;
-
-#ifdef yyoverflow
- /* Each stack pointer address is followed by the size of
- the data in use in that stack, in bytes. */
-#ifdef YYLSP_NEEDED
- /* This used to be a conditional around just the two extra args,
- but that might be undefined if yyoverflow is a macro. */
- yyoverflow("parser stack overflow",
- &yyss1, size * sizeof (*yyssp),
- &yyvs1, size * sizeof (*yyvsp),
- &yyls1, size * sizeof (*yylsp),
- &yystacksize);
-#else
- yyoverflow("parser stack overflow",
- &yyss1, size * sizeof (*yyssp),
- &yyvs1, size * sizeof (*yyvsp),
- &yystacksize);
-#endif
-
- yyss = yyss1; yyvs = yyvs1;
-#ifdef YYLSP_NEEDED
- yyls = yyls1;
-#endif
-#else /* no yyoverflow */
- /* Extend the stack our own way. */
- if (yystacksize >= YYMAXDEPTH)
- {
- yyerror("parser stack overflow");
- if (yyfree_stacks)
- {
- free (yyss);
- free (yyvs);
-#ifdef YYLSP_NEEDED
- free (yyls);
-#endif
- }
- return 2;
- }
- yystacksize *= 2;
- if (yystacksize > YYMAXDEPTH)
- yystacksize = YYMAXDEPTH;
-#ifndef YYSTACK_USE_ALLOCA
- yyfree_stacks = 1;
-#endif
- yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp));
- __yy_memcpy ((char *)yyss, (char *)yyss1,
- size * (unsigned int) sizeof (*yyssp));
- yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp));
- __yy_memcpy ((char *)yyvs, (char *)yyvs1,
- size * (unsigned int) sizeof (*yyvsp));
-#ifdef YYLSP_NEEDED
- yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp));
- __yy_memcpy ((char *)yyls, (char *)yyls1,
- size * (unsigned int) sizeof (*yylsp));
-#endif
-#endif /* no yyoverflow */
-
- yyssp = yyss + size - 1;
- yyvsp = yyvs + size - 1;
-#ifdef YYLSP_NEEDED
- yylsp = yyls + size - 1;
-#endif
-
-#if YYDEBUG != 0
- if (yydebug)
- fprintf(stderr, "Stack size increased to %d\n", yystacksize);
-#endif
-
- if (yyssp >= yyss + yystacksize - 1)
- YYABORT;
- }
-
-#if YYDEBUG != 0
- if (yydebug)
- fprintf(stderr, "Entering state %d\n", yystate);
-#endif
-
- goto yybackup;
- yybackup:
-
-/* Do appropriate processing given the current state. */
-/* Read a lookahead token if we need one and don't already have one. */
-/* yyresume: */
-
- /* First try to decide what to do without reference to lookahead token. */
-
- yyn = yypact[yystate];
- if (yyn == YYFLAG)
- goto yydefault;
-
- /* Not known => get a lookahead token if don't already have one. */
-
- /* yychar is either YYEMPTY or YYEOF
- or a valid token in external form. */
-
- if (yychar == YYEMPTY)
- {
-#if YYDEBUG != 0
- if (yydebug)
- fprintf(stderr, "Reading a token: ");
-#endif
- yychar = YYLEX;
- }
-
- /* Convert token to internal form (in yychar1) for indexing tables with */
-
- if (yychar <= 0) /* This means end of input. */
- {
- yychar1 = 0;
- yychar = YYEOF; /* Don't call YYLEX any more */
-
-#if YYDEBUG != 0
- if (yydebug)
- fprintf(stderr, "Now at end of input.\n");
-#endif
- }
- else
- {
- yychar1 = YYTRANSLATE(yychar);
-
-#if YYDEBUG != 0
- if (yydebug)
- {
- fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);
- /* Give the individual parser a way to print the precise meaning
- of a token, for further debugging info. */
-#ifdef YYPRINT
- YYPRINT (stderr, yychar, yylval);
-#endif
- fprintf (stderr, ")\n");
- }
-#endif
- }
-
- yyn += yychar1;
- if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
- goto yydefault;
-
- yyn = yytable[yyn];
-
- /* yyn is what to do for this token type in this state.
- Negative => reduce, -yyn is rule number.
- Positive => shift, yyn is new state.
- New state is final state => don't bother to shift,
- just return success.
- 0, or most negative number => error. */
-
- if (yyn < 0)
- {
- if (yyn == YYFLAG)
- goto yyerrlab;
- yyn = -yyn;
- goto yyreduce;
- }
- else if (yyn == 0)
- goto yyerrlab;
-
- if (yyn == YYFINAL)
- YYACCEPT;
-
- /* Shift the lookahead token. */
-
-#if YYDEBUG != 0
- if (yydebug)
- fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
-#endif
-
- /* Discard the token being shifted unless it is eof. */
- if (yychar != YYEOF)
- yychar = YYEMPTY;
-
- *++yyvsp = yylval;
-#ifdef YYLSP_NEEDED
- *++yylsp = yylloc;
-#endif
-
- /* count tokens shifted since error; after three, turn off error status. */
- if (yyerrstatus) yyerrstatus--;
-
- yystate = yyn;
- goto yynewstate;
-
-/* Do the default action for the current state. */
-yydefault:
-
- yyn = yydefact[yystate];
- if (yyn == 0)
- goto yyerrlab;
-
-/* Do a reduction. yyn is the number of a rule to reduce with. */
-yyreduce:
- yylen = yyr2[yyn];
- if (yylen > 0)
- yyval = yyvsp[1-yylen]; /* implement default value of the action */
-
-#if YYDEBUG != 0
- if (yydebug)
- {
- int i;
-
- fprintf (stderr, "Reducing via rule %d (line %d), ",
- yyn, yyrline[yyn]);
-
- /* Print the symbols being reduced, and their result. */
- for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
- fprintf (stderr, "%s ", yytname[yyrhs[i]]);
- fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
- }
-#endif
-
-
- switch (yyn) {
-
-case 1:
-#line 246 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- if (CurDefmPrefix) {
- // If CurDefmPrefix is set, we're parsing a defm, which means that this is
- // actually the name of a multiclass.
- MultiClass *MC = MultiClasses[*yyvsp[0].StrVal];
- if (MC == 0) {
- err() << "Couldn't find class '" << *yyvsp[0].StrVal << "'!\n";
- exit(1);
- }
- yyval.Rec = &MC->Rec;
- } else {
- yyval.Rec = Records.getClass(*yyvsp[0].StrVal);
- }
- if (yyval.Rec == 0) {
- err() << "Couldn't find class '" << *yyvsp[0].StrVal << "'!\n";
- exit(1);
- }
- delete yyvsp[0].StrVal;
- ;
- break;}
-case 2:
-#line 268 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{ // string type
- yyval.Ty = new StringRecTy();
- ;
- break;}
-case 3:
-#line 270 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{ // bit type
- yyval.Ty = new BitRecTy();
- ;
- break;}
-case 4:
-#line 272 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{ // bits<x> type
- yyval.Ty = new BitsRecTy(yyvsp[-1].IntVal);
- ;
- break;}
-case 5:
-#line 274 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{ // int type
- yyval.Ty = new IntRecTy();
- ;
- break;}
-case 6:
-#line 276 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{ // list<x> type
- yyval.Ty = new ListRecTy(yyvsp[-1].Ty);
- ;
- break;}
-case 7:
-#line 278 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{ // code type
- yyval.Ty = new CodeRecTy();
- ;
- break;}
-case 8:
-#line 280 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{ // dag type
- yyval.Ty = new DagRecTy();
- ;
- break;}
-case 9:
-#line 282 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{ // Record Type
- yyval.Ty = new RecordRecTy(yyvsp[0].Rec);
- ;
- break;}
-case 10:
-#line 286 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{ yyval.IntVal = 0; ;
- break;}
-case 11:
-#line 286 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{ yyval.IntVal = 1; ;
- break;}
-case 12:
-#line 288 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{ yyval.Initializer = 0; ;
- break;}
-case 13:
-#line 288 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{ yyval.Initializer = yyvsp[0].Initializer; ;
- break;}
-case 14:
-#line 290 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- if (const RecordVal *RV = (CurRec ? CurRec->getValue(*yyvsp[0].StrVal) : 0)) {
- yyval.Initializer = new VarInit(*yyvsp[0].StrVal, RV->getType());
- } else if (CurRec && CurRec->isTemplateArg(CurRec->getName()+":"+*yyvsp[0].StrVal)) {
- const RecordVal *RV = CurRec->getValue(CurRec->getName()+":"+*yyvsp[0].StrVal);
- assert(RV && "Template arg doesn't exist??");
- yyval.Initializer = new VarInit(CurRec->getName()+":"+*yyvsp[0].StrVal, RV->getType());
- } else if (CurMultiClass &&
- CurMultiClass->Rec.isTemplateArg(CurMultiClass->Rec.getName()+"::"+*yyvsp[0].StrVal)) {
- std::string Name = CurMultiClass->Rec.getName()+"::"+*yyvsp[0].StrVal;
- const RecordVal *RV = CurMultiClass->Rec.getValue(Name);
- assert(RV && "Template arg doesn't exist??");
- yyval.Initializer = new VarInit(Name, RV->getType());
- } else if (Record *D = Records.getDef(*yyvsp[0].StrVal)) {
- yyval.Initializer = new DefInit(D);
- } else {
- err() << "Variable not defined: '" << *yyvsp[0].StrVal << "'!\n";
- exit(1);
- }
-
- delete yyvsp[0].StrVal;
-;
- break;}
-case 15:
-#line 313 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.Initializer = yyvsp[0].Initializer;
- ;
- break;}
-case 16:
-#line 315 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.Initializer = new IntInit(yyvsp[0].IntVal);
- ;
- break;}
-case 17:
-#line 317 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.Initializer = new StringInit(*yyvsp[0].StrVal);
- delete yyvsp[0].StrVal;
- ;
- break;}
-case 18:
-#line 320 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.Initializer = new CodeInit(*yyvsp[0].StrVal);
- delete yyvsp[0].StrVal;
- ;
- break;}
-case 19:
-#line 323 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.Initializer = new UnsetInit();
- ;
- break;}
-case 20:
-#line 325 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- BitsInit *Init = new BitsInit(yyvsp[-1].FieldList->size());
- for (unsigned i = 0, e = yyvsp[-1].FieldList->size(); i != e; ++i) {
- struct Init *Bit = (*yyvsp[-1].FieldList)[i]->convertInitializerTo(new BitRecTy());
- if (Bit == 0) {
- err() << "Element #" << i << " (" << *(*yyvsp[-1].FieldList)[i]
- << ") is not convertable to a bit!\n";
- exit(1);
- }
- Init->setBit(yyvsp[-1].FieldList->size()-i-1, Bit);
- }
- yyval.Initializer = Init;
- delete yyvsp[-1].FieldList;
- ;
- break;}
-case 21:
-#line 338 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- // This is a CLASS<initvalslist> expression. This is supposed to synthesize
- // a new anonymous definition, deriving from CLASS<initvalslist> with no
- // body.
- Record *Class = Records.getClass(*yyvsp[-3].StrVal);
- if (!Class) {
- err() << "Expected a class, got '" << *yyvsp[-3].StrVal << "'!\n";
- exit(1);
- }
- delete yyvsp[-3].StrVal;
-
- static unsigned AnonCounter = 0;
- Record *OldRec = CurRec; // Save CurRec.
-
- // Create the new record, set it as CurRec temporarily.
- CurRec = new Record("anonymous.val."+utostr(AnonCounter++));
- addSubClass(Class, *yyvsp[-1].FieldList); // Add info about the subclass to CurRec.
- delete yyvsp[-1].FieldList; // Free up the template args.
-
- CurRec->resolveReferences();
-
- Records.addDef(CurRec);
-
- // The result of the expression is a reference to the new record.
- yyval.Initializer = new DefInit(CurRec);
-
- // Restore the old CurRec
- CurRec = OldRec;
- ;
- break;}
-case 22:
-#line 366 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.Initializer = yyvsp[-3].Initializer->convertInitializerBitRange(*yyvsp[-1].BitList);
- if (yyval.Initializer == 0) {
- err() << "Invalid bit range for value '" << *yyvsp[-3].Initializer << "'!\n";
- exit(1);
- }
- delete yyvsp[-1].BitList;
- ;
- break;}
-case 23:
-#line 373 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.Initializer = new ListInit(*yyvsp[-1].FieldList);
- delete yyvsp[-1].FieldList;
- ;
- break;}
-case 24:
-#line 376 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- if (!yyvsp[-2].Initializer->getFieldType(*yyvsp[0].StrVal)) {
- err() << "Cannot access field '" << *yyvsp[0].StrVal << "' of value '" << *yyvsp[-2].Initializer << "!\n";
- exit(1);
- }
- yyval.Initializer = new FieldInit(yyvsp[-2].Initializer, *yyvsp[0].StrVal);
- delete yyvsp[0].StrVal;
- ;
- break;}
-case 25:
-#line 383 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.Initializer = new DagInit(yyvsp[-2].Initializer, *yyvsp[-1].DagValueList);
- delete yyvsp[-1].DagValueList;
- ;
- break;}
-case 26:
-#line 386 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- std::reverse(yyvsp[-1].BitList->begin(), yyvsp[-1].BitList->end());
- yyval.Initializer = yyvsp[-3].Initializer->convertInitListSlice(*yyvsp[-1].BitList);
- if (yyval.Initializer == 0) {
- err() << "Invalid list slice for value '" << *yyvsp[-3].Initializer << "'!\n";
- exit(1);
- }
- delete yyvsp[-1].BitList;
- ;
- break;}
-case 27:
-#line 394 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.Initializer = (new BinOpInit(BinOpInit::CONCAT, yyvsp[-3].Initializer, yyvsp[-1].Initializer))->Fold();
- ;
- break;}
-case 28:
-#line 396 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.Initializer = (new BinOpInit(BinOpInit::SHL, yyvsp[-3].Initializer, yyvsp[-1].Initializer))->Fold();
- ;
- break;}
-case 29:
-#line 398 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.Initializer = (new BinOpInit(BinOpInit::SRA, yyvsp[-3].Initializer, yyvsp[-1].Initializer))->Fold();
- ;
- break;}
-case 30:
-#line 400 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.Initializer = (new BinOpInit(BinOpInit::SRL, yyvsp[-3].Initializer, yyvsp[-1].Initializer))->Fold();
- ;
- break;}
-case 31:
-#line 402 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.Initializer = (new BinOpInit(BinOpInit::STRCONCAT, yyvsp[-3].Initializer, yyvsp[-1].Initializer))->Fold();
- ;
- break;}
-case 32:
-#line 406 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.StrVal = new std::string();
- ;
- break;}
-case 33:
-#line 409 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.StrVal = yyvsp[0].StrVal;
- ;
- break;}
-case 34:
-#line 413 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.DagValueList = new std::vector<std::pair<Init*, std::string> >();
- yyval.DagValueList->push_back(std::make_pair(yyvsp[-1].Initializer, *yyvsp[0].StrVal));
- delete yyvsp[0].StrVal;
- ;
- break;}
-case 35:
-#line 418 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyvsp[-3].DagValueList->push_back(std::make_pair(yyvsp[-1].Initializer, *yyvsp[0].StrVal));
- delete yyvsp[0].StrVal;
- yyval.DagValueList = yyvsp[-3].DagValueList;
- ;
- break;}
-case 36:
-#line 424 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.DagValueList = new std::vector<std::pair<Init*, std::string> >();
- ;
- break;}
-case 37:
-#line 427 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{ yyval.DagValueList = yyvsp[0].DagValueList; ;
- break;}
-case 38:
-#line 430 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.BitList = new std::vector<unsigned>();
- yyval.BitList->push_back(yyvsp[0].IntVal);
- ;
- break;}
-case 39:
-#line 433 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- if (yyvsp[-2].IntVal < 0 || yyvsp[0].IntVal < 0) {
- err() << "Invalid range: " << yyvsp[-2].IntVal << "-" << yyvsp[0].IntVal << "!\n";
- exit(1);
- }
- yyval.BitList = new std::vector<unsigned>();
- if (yyvsp[-2].IntVal < yyvsp[0].IntVal) {
- for (int i = yyvsp[-2].IntVal; i <= yyvsp[0].IntVal; ++i)
- yyval.BitList->push_back(i);
- } else {
- for (int i = yyvsp[-2].IntVal; i >= yyvsp[0].IntVal; --i)
- yyval.BitList->push_back(i);
- }
- ;
- break;}
-case 40:
-#line 446 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyvsp[0].IntVal = -yyvsp[0].IntVal;
- if (yyvsp[-1].IntVal < 0 || yyvsp[0].IntVal < 0) {
- err() << "Invalid range: " << yyvsp[-1].IntVal << "-" << yyvsp[0].IntVal << "!\n";
- exit(1);
- }
- yyval.BitList = new std::vector<unsigned>();
- if (yyvsp[-1].IntVal < yyvsp[0].IntVal) {
- for (int i = yyvsp[-1].IntVal; i <= yyvsp[0].IntVal; ++i)
- yyval.BitList->push_back(i);
- } else {
- for (int i = yyvsp[-1].IntVal; i >= yyvsp[0].IntVal; --i)
- yyval.BitList->push_back(i);
- }
- ;
- break;}
-case 41:
-#line 460 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- (yyval.BitList=yyvsp[-2].BitList)->push_back(yyvsp[0].IntVal);
- ;
- break;}
-case 42:
-#line 462 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- if (yyvsp[-2].IntVal < 0 || yyvsp[0].IntVal < 0) {
- err() << "Invalid range: " << yyvsp[-2].IntVal << "-" << yyvsp[0].IntVal << "!\n";
- exit(1);
- }
- yyval.BitList = yyvsp[-4].BitList;
- if (yyvsp[-2].IntVal < yyvsp[0].IntVal) {
- for (int i = yyvsp[-2].IntVal; i <= yyvsp[0].IntVal; ++i)
- yyval.BitList->push_back(i);
- } else {
- for (int i = yyvsp[-2].IntVal; i >= yyvsp[0].IntVal; --i)
- yyval.BitList->push_back(i);
- }
- ;
- break;}
-case 43:
-#line 475 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyvsp[0].IntVal = -yyvsp[0].IntVal;
- if (yyvsp[-1].IntVal < 0 || yyvsp[0].IntVal < 0) {
- err() << "Invalid range: " << yyvsp[-1].IntVal << "-" << yyvsp[0].IntVal << "!\n";
- exit(1);
- }
- yyval.BitList = yyvsp[-3].BitList;
- if (yyvsp[-1].IntVal < yyvsp[0].IntVal) {
- for (int i = yyvsp[-1].IntVal; i <= yyvsp[0].IntVal; ++i)
- yyval.BitList->push_back(i);
- } else {
- for (int i = yyvsp[-1].IntVal; i >= yyvsp[0].IntVal; --i)
- yyval.BitList->push_back(i);
- }
- ;
- break;}
-case 44:
-#line 491 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{ yyval.BitList = yyvsp[0].BitList; std::reverse(yyvsp[0].BitList->begin(), yyvsp[0].BitList->end()); ;
- break;}
-case 45:
-#line 493 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{ yyval.BitList = 0; ;
- break;}
-case 46:
-#line 493 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{ yyval.BitList = yyvsp[-1].BitList; ;
- break;}
-case 47:
-#line 497 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.FieldList = new std::vector<Init*>();
- ;
- break;}
-case 48:
-#line 499 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.FieldList = yyvsp[0].FieldList;
- ;
- break;}
-case 49:
-#line 503 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.FieldList = new std::vector<Init*>();
- yyval.FieldList->push_back(yyvsp[0].Initializer);
- ;
- break;}
-case 50:
-#line 506 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- (yyval.FieldList = yyvsp[-2].FieldList)->push_back(yyvsp[0].Initializer);
- ;
- break;}
-case 51:
-#line 510 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- std::string DecName = *yyvsp[-1].StrVal;
- if (ParsingTemplateArgs) {
- if (CurRec) {
- DecName = CurRec->getName() + ":" + DecName;
- } else {
- assert(CurMultiClass);
- }
- if (CurMultiClass)
- DecName = CurMultiClass->Rec.getName() + "::" + DecName;
- }
-
- addValue(RecordVal(DecName, yyvsp[-2].Ty, yyvsp[-3].IntVal));
- setValue(DecName, 0, yyvsp[0].Initializer);
- yyval.StrVal = new std::string(DecName);
-;
- break;}
-case 52:
-#line 527 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- delete yyvsp[-1].StrVal;
-;
- break;}
-case 53:
-#line 529 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- setValue(*yyvsp[-4].StrVal, yyvsp[-3].BitList, yyvsp[-1].Initializer);
- delete yyvsp[-4].StrVal;
- delete yyvsp[-3].BitList;
-;
- break;}
-case 58:
-#line 538 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.SubClassRef = new SubClassRefTy(yyvsp[0].Rec, new std::vector<Init*>());
- ;
- break;}
-case 59:
-#line 540 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.SubClassRef = new SubClassRefTy(yyvsp[-3].Rec, yyvsp[-1].FieldList);
- ;
- break;}
-case 60:
-#line 544 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.SubClassList = new std::vector<SubClassRefTy>();
- yyval.SubClassList->push_back(*yyvsp[0].SubClassRef);
- delete yyvsp[0].SubClassRef;
- ;
- break;}
-case 61:
-#line 549 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- (yyval.SubClassList=yyvsp[-2].SubClassList)->push_back(*yyvsp[0].SubClassRef);
- delete yyvsp[0].SubClassRef;
- ;
- break;}
-case 62:
-#line 554 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.SubClassList = new std::vector<SubClassRefTy>();
- ;
- break;}
-case 63:
-#line 557 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.SubClassList = yyvsp[0].SubClassList;
- ;
- break;}
-case 64:
-#line 561 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- getActiveRec()->addTemplateArg(*yyvsp[0].StrVal);
- delete yyvsp[0].StrVal;
-;
- break;}
-case 65:
-#line 564 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- getActiveRec()->addTemplateArg(*yyvsp[0].StrVal);
- delete yyvsp[0].StrVal;
-;
- break;}
-case 66:
-#line 569 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{;
- break;}
-case 69:
-#line 572 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{ yyval.StrVal = yyvsp[0].StrVal; ;
- break;}
-case 70:
-#line 572 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{ yyval.StrVal = new std::string(); ;
- break;}
-case 71:
-#line 574 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- static unsigned AnonCounter = 0;
- if (yyvsp[0].StrVal->empty())
- *yyvsp[0].StrVal = "anonymous."+utostr(AnonCounter++);
- yyval.StrVal = yyvsp[0].StrVal;
-;
- break;}
-case 72:
-#line 581 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- // If a class of this name already exists, it must be a forward ref.
- if ((CurRec = Records.getClass(*yyvsp[0].StrVal))) {
- // If the body was previously defined, this is an error.
- if (!CurRec->getValues().empty() ||
- !CurRec->getSuperClasses().empty() ||
- !CurRec->getTemplateArgs().empty()) {
- err() << "Class '" << CurRec->getName() << "' already defined!\n";
- exit(1);
- }
- } else {
- // If this is the first reference to this class, create and add it.
- CurRec = new Record(*yyvsp[0].StrVal);
- Records.addClass(CurRec);
- }
- delete yyvsp[0].StrVal;
-;
- break;}
-case 73:
-#line 599 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- CurRec = new Record(*yyvsp[0].StrVal);
- delete yyvsp[0].StrVal;
-
- if (!CurMultiClass) {
- // Top-level def definition.
-
- // Ensure redefinition doesn't happen.
- if (Records.getDef(CurRec->getName())) {
- err() << "def '" << CurRec->getName() << "' already defined!\n";
- exit(1);
- }
- Records.addDef(CurRec);
- } else {
- // Otherwise, a def inside a multiclass, add it to the multiclass.
- for (unsigned i = 0, e = CurMultiClass->DefPrototypes.size(); i != e; ++i)
- if (CurMultiClass->DefPrototypes[i]->getName() == CurRec->getName()) {
- err() << "def '" << CurRec->getName()
- << "' already defined in this multiclass!\n";
- exit(1);
- }
- CurMultiClass->DefPrototypes.push_back(CurRec);
- }
-;
- break;}
-case 74:
-#line 624 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- for (unsigned i = 0, e = yyvsp[0].SubClassList->size(); i != e; ++i) {
- addSubClass((*yyvsp[0].SubClassList)[i].first, *(*yyvsp[0].SubClassList)[i].second);
- // Delete the template arg values for the class
- delete (*yyvsp[0].SubClassList)[i].second;
- }
- delete yyvsp[0].SubClassList; // Delete the class list.
-
- // Process any variables on the let stack.
- for (unsigned i = 0, e = LetStack.size(); i != e; ++i)
- for (unsigned j = 0, e = LetStack[i].size(); j != e; ++j)
- setValue(LetStack[i][j].Name,
- LetStack[i][j].HasBits ? &LetStack[i][j].Bits : 0,
- LetStack[i][j].Value);
- ;
- break;}
-case 75:
-#line 638 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.Rec = CurRec;
- CurRec = 0;
- ;
- break;}
-case 76:
-#line 643 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- ParsingTemplateArgs = true;
- ;
- break;}
-case 77:
-#line 645 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- ParsingTemplateArgs = false;
- ;
- break;}
-case 78:
-#line 647 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.Rec = yyvsp[0].Rec;
- ;
- break;}
-case 79:
-#line 651 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- if (CurMultiClass == 0) // Def's in multiclasses aren't really defs.
- yyvsp[0].Rec->resolveReferences();
-
- // If ObjectBody has template arguments, it's an error.
- assert(yyvsp[0].Rec->getTemplateArgs().empty() && "How'd this get template args?");
- yyval.Rec = yyvsp[0].Rec;
-;
- break;}
-case 80:
-#line 661 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.Rec = yyvsp[0].Rec;
- // Copy the template arguments for the multiclass into the def.
- const std::vector<std::string> &TArgs = CurMultiClass->Rec.getTemplateArgs();
-
- for (unsigned i = 0, e = TArgs.size(); i != e; ++i) {
- const RecordVal *RV = CurMultiClass->Rec.getValue(TArgs[i]);
- assert(RV && "Template arg doesn't exist?");
- yyval.Rec->addValue(*RV);
- }
-;
- break;}
-case 81:
-#line 675 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.RecList = new std::vector<Record*>();
- yyval.RecList->push_back(yyvsp[0].Rec);
-;
- break;}
-case 82:
-#line 678 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- yyval.RecList->push_back(yyvsp[0].Rec);
-;
- break;}
-case 83:
-#line 682 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- MultiClass *&MCE = MultiClasses[*yyvsp[0].StrVal];
- if (MCE) {
- err() << "multiclass '" << *yyvsp[0].StrVal << "' already defined!\n";
- exit(1);
- }
- MCE = CurMultiClass = new MultiClass(*yyvsp[0].StrVal);
- delete yyvsp[0].StrVal;
-;
- break;}
-case 84:
-#line 693 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- ParsingTemplateArgs = true;
- ;
- break;}
-case 85:
-#line 695 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- ParsingTemplateArgs = false;
- ;
- break;}
-case 86:
-#line 697 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- CurMultiClass = 0;
-;
- break;}
-case 87:
-#line 702 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{ CurDefmPrefix = yyvsp[0].StrVal; ;
- break;}
-case 88:
-#line 702 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- // To instantiate a multiclass, we need to first get the multiclass, then
- // instantiate each def contained in the multiclass with the SubClassRef
- // template parameters.
- MultiClass *MC = MultiClasses[yyvsp[-1].SubClassRef->first->getName()];
- assert(MC && "Didn't lookup multiclass correctly?");
- std::vector<Init*> &TemplateVals = *yyvsp[-1].SubClassRef->second;
- delete yyvsp[-1].SubClassRef;
-
- // Verify that the correct number of template arguments were specified.
- const std::vector<std::string> &TArgs = MC->Rec.getTemplateArgs();
- if (TArgs.size() < TemplateVals.size()) {
- err() << "ERROR: More template args specified than multiclass expects!\n";
- exit(1);
- }
-
- // Loop over all the def's in the multiclass, instantiating each one.
- for (unsigned i = 0, e = MC->DefPrototypes.size(); i != e; ++i) {
- Record *DefProto = MC->DefPrototypes[i];
-
- // Add the suffix to the defm name to get the new name.
- assert(CurRec == 0 && "A def is current?");
- CurRec = new Record(*yyvsp[-4].StrVal + DefProto->getName());
-
- addSubClass(DefProto, std::vector<Init*>());
-
- // Loop over all of the template arguments, setting them to the specified
- // value or leaving them as the default if necessary.
- for (unsigned i = 0, e = TArgs.size(); i != e; ++i) {
- if (i < TemplateVals.size()) { // A value is specified for this temp-arg?
- // Set it now.
- setValue(TArgs[i], 0, TemplateVals[i]);
-
- // Resolve it next.
- CurRec->resolveReferencesTo(CurRec->getValue(TArgs[i]));
-
- // Now remove it.
- CurRec->removeValue(TArgs[i]);
-
- } else if (!CurRec->getValue(TArgs[i])->getValue()->isComplete()) {
- err() << "ERROR: Value not specified for template argument #"
- << i << " (" << TArgs[i] << ") of multiclassclass '"
- << MC->Rec.getName() << "'!\n";
- exit(1);
- }
- }
-
- // If the mdef is inside a 'let' expression, add to each def.
- for (unsigned i = 0, e = LetStack.size(); i != e; ++i)
- for (unsigned j = 0, e = LetStack[i].size(); j != e; ++j)
- setValue(LetStack[i][j].Name,
- LetStack[i][j].HasBits ? &LetStack[i][j].Bits : 0,
- LetStack[i][j].Value);
-
-
- // Ensure redefinition doesn't happen.
- if (Records.getDef(CurRec->getName())) {
- err() << "def '" << CurRec->getName() << "' already defined, "
- << "instantiating defm '" << *yyvsp[-4].StrVal << "' with subdef '"
- << DefProto->getName() << "'!\n";
- exit(1);
- }
- Records.addDef(CurRec);
-
- CurRec->resolveReferences();
-
- CurRec = 0;
- }
-
- delete &TemplateVals;
- delete yyvsp[-4].StrVal;
- CurDefmPrefix = 0;
-;
- break;}
-case 89:
-#line 776 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{;
- break;}
-case 90:
-#line 776 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{;
- break;}
-case 93:
-#line 779 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- LetStack.back().push_back(LetRecord(*yyvsp[-3].StrVal, yyvsp[-2].BitList, yyvsp[0].Initializer));
- delete yyvsp[-3].StrVal; delete yyvsp[-2].BitList;
-;
- break;}
-case 96:
-#line 787 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{ LetStack.push_back(std::vector<LetRecord>()); ;
- break;}
-case 98:
-#line 790 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- LetStack.pop_back();
- ;
- break;}
-case 99:
-#line 793 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{
- LetStack.pop_back();
- ;
- break;}
-case 100:
-#line 797 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{;
- break;}
-case 101:
-#line 797 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-{;
- break;}
-}
- /* the action file gets copied in in place of this dollarsign */
-#line 543 "/usr/share/bison.simple"
-
- yyvsp -= yylen;
- yyssp -= yylen;
-#ifdef YYLSP_NEEDED
- yylsp -= yylen;
-#endif
-
-#if YYDEBUG != 0
- if (yydebug)
- {
- short *ssp1 = yyss - 1;
- fprintf (stderr, "state stack now");
- while (ssp1 != yyssp)
- fprintf (stderr, " %d", *++ssp1);
- fprintf (stderr, "\n");
- }
-#endif
-
- *++yyvsp = yyval;
-
-#ifdef YYLSP_NEEDED
- yylsp++;
- if (yylen == 0)
- {
- yylsp->first_line = yylloc.first_line;
- yylsp->first_column = yylloc.first_column;
- yylsp->last_line = (yylsp-1)->last_line;
- yylsp->last_column = (yylsp-1)->last_column;
- yylsp->text = 0;
- }
- else
- {
- yylsp->last_line = (yylsp+yylen-1)->last_line;
- yylsp->last_column = (yylsp+yylen-1)->last_column;
- }
-#endif
-
- /* Now "shift" the result of the reduction.
- Determine what state that goes to,
- based on the state we popped back to
- and the rule number reduced by. */
-
- yyn = yyr1[yyn];
-
- yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
- if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
- yystate = yytable[yystate];
- else
- yystate = yydefgoto[yyn - YYNTBASE];
-
- goto yynewstate;
-
-yyerrlab: /* here on detecting error */
-
- if (! yyerrstatus)
- /* If not already recovering from an error, report this error. */
- {
- ++yynerrs;
-
-#ifdef YYERROR_VERBOSE
- yyn = yypact[yystate];
-
- if (yyn > YYFLAG && yyn < YYLAST)
- {
- int size = 0;
- char *msg;
- int x, count;
-
- count = 0;
- /* Start X at -yyn if nec to avoid negative indexes in yycheck. */
- for (x = (yyn < 0 ? -yyn : 0);
- x < (sizeof(yytname) / sizeof(char *)); x++)
- if (yycheck[x + yyn] == x)
- size += strlen(yytname[x]) + 15, count++;
- msg = (char *) malloc(size + 15);
- if (msg != 0)
- {
- strcpy(msg, "parse error");
-
- if (count < 5)
- {
- count = 0;
- for (x = (yyn < 0 ? -yyn : 0);
- x < (sizeof(yytname) / sizeof(char *)); x++)
- if (yycheck[x + yyn] == x)
- {
- strcat(msg, count == 0 ? ", expecting `" : " or `");
- strcat(msg, yytname[x]);
- strcat(msg, "'");
- count++;
- }
- }
- yyerror(msg);
- free(msg);
- }
- else
- yyerror ("parse error; also virtual memory exceeded");
- }
- else
-#endif /* YYERROR_VERBOSE */
- yyerror("parse error");
- }
-
- goto yyerrlab1;
-yyerrlab1: /* here on error raised explicitly by an action */
-
- if (yyerrstatus == 3)
- {
- /* if just tried and failed to reuse lookahead token after an error, discard it. */
-
- /* return failure if at end of input */
- if (yychar == YYEOF)
- YYABORT;
-
-#if YYDEBUG != 0
- if (yydebug)
- fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
-#endif
-
- yychar = YYEMPTY;
- }
-
- /* Else will try to reuse lookahead token
- after shifting the error token. */
-
- yyerrstatus = 3; /* Each real token shifted decrements this */
-
- goto yyerrhandle;
-
-yyerrdefault: /* current state does not do anything special for the error token. */
-
-#if 0
- /* This is wrong; only states that explicitly want error tokens
- should shift them. */
- yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/
- if (yyn) goto yydefault;
-#endif
-
-yyerrpop: /* pop the current state because it cannot handle the error token */
-
- if (yyssp == yyss) YYABORT;
- yyvsp--;
- yystate = *--yyssp;
-#ifdef YYLSP_NEEDED
- yylsp--;
-#endif
-
-#if YYDEBUG != 0
- if (yydebug)
- {
- short *ssp1 = yyss - 1;
- fprintf (stderr, "Error: state stack now");
- while (ssp1 != yyssp)
- fprintf (stderr, " %d", *++ssp1);
- fprintf (stderr, "\n");
- }
-#endif
-
-yyerrhandle:
-
- yyn = yypact[yystate];
- if (yyn == YYFLAG)
- goto yyerrdefault;
-
- yyn += YYTERROR;
- if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
- goto yyerrdefault;
-
- yyn = yytable[yyn];
- if (yyn < 0)
- {
- if (yyn == YYFLAG)
- goto yyerrpop;
- yyn = -yyn;
- goto yyreduce;
- }
- else if (yyn == 0)
- goto yyerrpop;
-
- if (yyn == YYFINAL)
- YYACCEPT;
-
-#if YYDEBUG != 0
- if (yydebug)
- fprintf(stderr, "Shifting error token, ");
-#endif
-
- *++yyvsp = yylval;
-#ifdef YYLSP_NEEDED
- *++yylsp = yylloc;
-#endif
-
- yystate = yyn;
- goto yynewstate;
-
- yyacceptlab:
- /* YYACCEPT comes here. */
- if (yyfree_stacks)
- {
- free (yyss);
- free (yyvs);
-#ifdef YYLSP_NEEDED
- free (yyls);
-#endif
- }
- return 0;
-
- yyabortlab:
- /* YYABORT comes here. */
- if (yyfree_stacks)
- {
- free (yyss);
- free (yyvs);
-#ifdef YYLSP_NEEDED
- free (yyls);
-#endif
- }
- return 1;
-}
-#line 801 "/Volumes/ProjectsDisk/cvs/llvm/utils/TableGen/FileParser.y"
-
-
-int yyerror(const char *ErrorMsg) {
- err() << "Error parsing: " << ErrorMsg << "\n";
- exit(1);
-}
diff --git a/utils/TableGen/FileParser.h.cvs b/utils/TableGen/FileParser.h.cvs
deleted file mode 100644
index 9f070fbd12..0000000000
--- a/utils/TableGen/FileParser.h.cvs
+++ /dev/null
@@ -1,40 +0,0 @@
-typedef union {
- std::string* StrVal;
- int IntVal;
- llvm::RecTy* Ty;
- llvm::Init* Initializer;
- std::vector<llvm::Init*>* FieldList;
- std::vector<unsigned>* BitList;
- llvm::Record* Rec;
- std::vector<llvm::Record*>* RecList;
- SubClassRefTy* SubClassRef;
- std::vector<SubClassRefTy>* SubClassList;
- std::vector<std::pair<llvm::Init*, std::string> >* DagValueList;
-} YYSTYPE;
-#define INT 257
-#define BIT 258
-#define STRING 259
-#define BITS 260
-#define LIST 261
-#define CODE 262
-#define DAG 263
-#define CLASS 264
-#define DEF 265
-#define MULTICLASS 266
-#define DEFM 267
-#define FIELD 268
-#define LET 269
-#define IN 270
-#define CONCATTOK 271
-#define SHLTOK 272
-#define SRATOK 273
-#define SRLTOK 274
-#define STRCONCATTOK 275
-#define INTVAL 276
-#define ID 277
-#define VARNAME 278
-#define STRVAL 279
-#define CODEFRAGMENT 280
-
-
-extern YYSTYPE Filelval;
diff --git a/utils/TableGen/FileParser.y b/utils/TableGen/FileParser.y
deleted file mode 100644
index 0612f56ca0..0000000000
--- a/utils/TableGen/FileParser.y
+++ /dev/null
@@ -1,806 +0,0 @@
-//===-- FileParser.y - Parser for TableGen files ----------------*- C++ -*-===//
-//
-// The LLVM Compiler Infrastructure
-//
-// This file was developed by the LLVM research group and is distributed under
-// the University of Illinois Open Source License. See LICENSE.TXT for details.
-//
-//===----------------------------------------------------------------------===//
-//
-// This file implements the bison parser for Table Generator files...
-//
-//===----------------------------------------------------------------------===//
-
-%{
-#include "Record.h"
-#include "llvm/ADT/StringExtras.h"
-#include "llvm/Support/Streams.h"
-#include <algorithm>
-#include <cstdio>
-#define YYERROR_VERBOSE 1
-
-int yyerror(const char *ErrorMsg);
-int yylex();
-
-namespace llvm {
- struct MultiClass {
- Record Rec; // Placeholder for template args and Name.
- std::vector<Record*> DefPrototypes;
-
- MultiClass(const std::string &Name) : Rec(Name) {}
- };
-
-
-static std::map<std::string, MultiClass*> MultiClasses;
-
-extern int Filelineno;
-static MultiClass *CurMultiClass = 0; // Set while parsing a multiclass.
-static std::string *CurDefmPrefix = 0; // Set while parsing defm.
-static Record *CurRec = 0;
-static bool ParsingTemplateArgs = false;
-
-typedef std::pair<Record*, std::vector<Init*>*> SubClassRefTy;
-
-struct LetRecord {
- std::string Name;
- std::vector<unsigned> Bits;
- Init *Value;
- bool HasBits;
- LetRecord(const std::string &N, std::vector<unsigned> *B, Init *V)
- : Name(N), Value(V), HasBits(B != 0) {
- if (HasBits) Bits = *B;
- }
-};
-
-static std::vector<std::vector<LetRecord> > LetStack;
-
-
-extern std::ostream &err();
-
-/// getActiveRec - If inside a def/class definition, return the def/class.
-/// Otherwise, if within a multidef, return it.
-static Record *getActiveRec() {
- return CurRec ? CurRec : &CurMultiClass->Rec;
-}
-
-static void addValue(const RecordVal &RV) {
- Record *TheRec = getActiveRec();
-
- if (RecordVal *ERV = TheRec->getValue(RV.getName())) {
- // The value already exists in the class, treat this as a set...
- if (ERV->setValue(RV.getValue())) {
- err() << "New definition of '" << RV.getName() << "' of type '"
- << *RV.getType() << "' is incompatible with previous "
- << "definition of type '" << *ERV->getType() << "'!\n";
- exit(1);
- }
- } else {
- TheRec->addValue(RV);
- }
-}
-
-static void addSuperClass(Record *SC) {
- if (CurRec->isSubClassOf(SC)) {
- err() << "Already subclass of '" << SC->getName() << "'!\n";
- exit(1);
- }
- CurRec->addSuperClass(SC);
-}
-
-static void setValue(const std::string &ValName,
- std::vector<unsigned> *BitList, Init *V) {
- if (!V) return;
-
- Record *TheRec = getActiveRec();
- RecordVal *RV = TheRec->getValue(ValName);
- if (RV == 0) {
- err() << "Value '" << ValName << "' unknown!\n";
- exit(1);
- }
-
- // Do not allow assignments like 'X = X'. This will just cause infinite loops
- // in the resolution machinery.
- if (!BitList)
- if (VarInit *VI = dynamic_cast<VarInit*>(V))
- if (VI->getName() == ValName)
- return;
-
- // If we are assigning to a subset of the bits in the value... then we must be
- // assigning to a field of BitsRecTy, which must have a BitsInit
- // initializer...
- //
- if (BitList) {
- BitsInit *CurVal = dynamic_cast<BitsInit*>(RV->getValue());
- if (CurVal == 0) {
- err() << "Value '" << ValName << "' is not a bits type!\n";
- exit(1);
- }
-
- // Convert the incoming value to a bits type of the appropriate size...
- Init *BI = V->convertInitializerTo(new BitsRecTy(BitList->size()));
- if (BI == 0) {
- V->convertInitializerTo(new BitsRecTy(BitList->size()));
- err() << "Initializer '" << *V << "' not compatible with bit range!\n";
- exit(1);
- }
-
- // We should have a BitsInit type now...
- assert(dynamic_cast<BitsInit*>(BI) != 0 || (cerr << *BI).stream() == 0);
- BitsInit *BInit = (BitsInit*)BI;
-
- BitsInit *NewVal = new BitsInit(CurVal->getNumBits());
-
- // Loop over bits, assigning values as appropriate...
- for (unsigned i = 0, e = BitList->size(); i != e; ++i) {
- unsigned Bit = (*BitList)[i];
- if (NewVal->getBit(Bit)) {
- err() << "Cannot set bit #" << Bit << " of value '" << ValName
- << "' more than once!\n";
- exit(1);
- }
- NewVal->setBit(Bit, BInit->getBit(i));
- }
-
- for (unsigned i = 0, e = CurVal->getNumBits(); i != e; ++i)
- if (NewVal->getBit(i) == 0)
- NewVal->setBit(i, CurVal->getBit(i));
-
- V = NewVal;
- }
-
- if (RV->setValue(V)) {
- err() << "Value '" << ValName << "' of type '" << *RV->getType()
- << "' is incompatible with initializer '" << *V << "'!\n";
- exit(1);
- }
-}
-
-// addSubClass - Add SC as a subclass to CurRec, resolving TemplateArgs as SC's
-// template arguments.
-static void addSubClass(Record *SC, const std::vector<Init*> &TemplateArgs) {
- // Add all of the values in the subclass into the current class...
- const std::vector<RecordVal> &Vals = SC->getValues();
- for (unsigned i = 0, e = Vals.size(); i != e; ++i)
- addValue(Vals[i]);
-
- const std::vector<std::string> &TArgs = SC->getTemplateArgs();
-
- // Ensure that an appropriate number of template arguments are specified...
- if (TArgs.size() < TemplateArgs.size()) {
- err() << "ERROR: More template args specified than expected!\n";
- exit(1);
- }
-
- // Loop over all of the template arguments, setting them to the specified
- // value or leaving them as the default if necessary.
- for (unsigned i = 0, e = TArgs.size(); i != e; ++i) {
- if (i < TemplateArgs.size()) { // A value is specified for this temp-arg?
- // Set it now.
- setValue(TArgs[i], 0, TemplateArgs[i]);
-
- // Resolve it next.
- CurRec->resolveReferencesTo(CurRec->getValue(TArgs[i]));
-
-
- // Now remove it.
- CurRec->removeValue(TArgs[i]);
-
- } else if (!CurRec->getValue(TArgs[i])->getValue()->isComplete()) {
- err() << "ERROR: Value not specified for template argument #"
- << i << " (" << TArgs[i] << ") of subclass '" << SC->getName()
- << "'!\n";
- exit(1);
- }
- }
-
- // Since everything went well, we can now set the "superclass" list for the
- // current record.
- const std::vector<Record*> &SCs = SC->getSuperClasses();
- for (unsigned i = 0, e = SCs.size(); i != e; ++i)
- addSuperClass(SCs[i]);
- addSuperClass(SC);
-}
-
-} // End llvm namespace
-
-using namespace llvm;
-
-%}
-
-%union {
- std::string* StrVal;
- int IntVal;
- llvm::RecTy* Ty;
- llvm::Init* Initializer;
- std::vector<llvm::Init*>* FieldList;
- std::vector<unsigned>* BitList;
- llvm::Record* Rec;
- std::vector<llvm::Record*>* RecList;
- SubClassRefTy* SubClassRef;
- std::vector<SubClassRefTy>* SubClassList;
- std::vector<std::pair<llvm::Init*, std::string> >* DagValueList;
-};
-
-%token INT BIT STRING BITS LIST CODE DAG CLASS DEF MULTICLASS DEFM FIELD LET IN
-%token CONCATTOK SHLTOK SRATOK SRLTOK STRCONCATTOK
-%token <IntVal> INTVAL
-%token <StrVal> ID VARNAME STRVAL CODEFRAGMENT
-
-%type <Ty> Type
-%type <Rec> ClassInst DefInst MultiClassDef ObjectBody ClassID
-%type <RecList> MultiClassBody
-
-%type <SubClassRef> SubClassRef
-%type <SubClassList> ClassList ClassListNE
-%type <IntVal> OptPrefix
-%type <Initializer> Value OptValue IDValue
-%type <DagValueList> DagArgList DagArgListNE
-%type <FieldList> ValueList ValueListNE
-%type <BitList> BitList OptBitList RBitList
-%type <StrVal> Declaration OptID OptVarName ObjectName
-
-%start File
-
-%%
-
-ClassID : ID {
- if (CurDefmPrefix) {
- // If CurDefmPrefix is set, we're parsing a defm, which means that this is
- // actually the name of a multiclass.
- MultiClass *MC = MultiClasses[*$1];
- if (MC == 0) {
- err() << "Couldn't find class '" << *$1 << "'!\n";
- exit(1);
- }
- $$ = &MC->Rec;
- } else {
- $$ = Records.getClass(*$1);
- }
- if ($$ == 0) {
- err() << "Couldn't find class '" << *$1 << "'!\n";
- exit(1);
- }
- delete $1;
- };
-
-
-// TableGen types...
-Type : STRING { // string type
- $$ = new StringRecTy();
- } | BIT { // bit type
- $$ = new BitRecTy();
- } | BITS '<' INTVAL '>' { // bits<x> type
- $$ = new BitsRecTy($3);
- } | INT { // int type
- $$ = new IntRecTy();
- } | LIST '<' Type '>' { // list<x> type
- $$ = new ListRecTy($3);
- } | CODE { // code type
- $$ = new CodeRecTy();
- } | DAG { // dag type
- $$ = new DagRecTy();
- } | ClassID { // Record Type
- $$ = new RecordRecTy($1);
- };
-
-OptPrefix : /*empty*/ { $$ = 0; } | FIELD { $$ = 1; };
-
-OptValue : /*empty*/ { $$ = 0; } | '=' Value { $$ = $2; };
-
-IDValue : ID {
- if (const RecordVal *RV = (CurRec ? CurRec->getValue(*$1) : 0)) {
- $$ = new VarInit(*$1, RV->getType());
- } else if (CurRec && CurRec->isTemplateArg(CurRec->getName()+":"+*$1)) {
- const RecordVal *RV = CurRec->getValue(CurRec->getName()+":"+*$1);
- assert(RV && "Template arg doesn't exist??");
- $$ = new VarInit(CurRec->getName()+":"+*$1, RV->getType());
- } else if (CurMultiClass &&
- CurMultiClass->Rec.isTemplateArg(CurMultiClass->Rec.getName()+"::"+*$1)) {
- std::string Name = CurMultiClass->Rec.getName()+"::"+*$1;
- const RecordVal *RV = CurMultiClass->Rec.getValue(Name);
- assert(RV && "Template arg doesn't exist??");
- $$ = new VarInit(Name, RV->getType());
- } else if (Record *D = Records.getDef(*$1)) {
- $$ = new DefInit(D);
- } else {
- err() << "Variable not defined: '" << *$1 << "'!\n";
- exit(1);
- }
-
- delete $1;
-};
-
-Value : IDValue {
- $$ = $1;
- } | INTVAL {
- $$ = new IntInit($1);
- } | STRVAL {
- $$ = new StringInit(*$1);
- delete $1;
- } | CODEFRAGMENT {
- $$ = new CodeInit(*$1);
- delete $1;
- } | '?' {
- $$ = new UnsetInit();
- } | '{' ValueList '}' {
- BitsInit *Init = new BitsInit($2->size());
- for (unsigned i = 0, e = $2->size(); i != e; ++i) {
- struct Init *Bit = (*$2)[i]->convertInitializerTo(new BitRecTy());
- if (Bit == 0) {
- err() << "Element #" << i << " (" << *(*$2)[i]
- << ") is not convertable to a bit!\n";
- exit(1);
- }
- Init->setBit($2->size()-i-1, Bit);
- }
- $$ = Init;
- delete $2;
- } | ID '<' ValueListNE '>' {
- // This is a CLASS<initvalslist> expression. This is supposed to synthesize
- // a new anonymous definition, deriving from CLASS<initvalslist> with no
- // body.
- Record *Class = Records.getClass(*$1);
- if (!Class) {
- err() << "Expected a class, got '" << *$1 << "'!\n";
- exit(1);
- }
- delete $1;
-
- static unsigned AnonCounter = 0;
- Record *OldRec = CurRec; // Save CurRec.
-
- // Create the new record, set it as CurRec temporarily.
- CurRec = new Record("anonymous.val."+utostr(AnonCounter++));
- addSubClass(Class, *$3); // Add info about the subclass to CurRec.
- delete $3; // Free up the template args.
-
- CurRec->resolveReferences();
-
- Records.addDef(CurRec);
-
- // The result of the expression is a reference to the new record.
- $$ = new DefInit(CurRec);
-
- // Restore the old CurRec
- CurRec = OldRec;
- } | Value '{' BitList '}' {
- $$ = $1->convertInitializerBitRange(*$3);
- if ($$ == 0) {
- err() << "Invalid bit range for value '" << *$1 << "'!\n";
- exit(1);
- }
- delete $3;
- } | '[' ValueList ']' {
- $$ = new ListInit(*$2);
- delete $2;
- } | Value '.' ID {
- if (!$1->getFieldType(*$3)) {
- err() << "Cannot access field '" << *$3 << "' of value '" << *$1 << "!\n";
- exit(1);
- }
- $$ = new FieldInit($1, *$3);
- delete $3;
- } | '(' IDValue DagArgList ')' {
- $$ = new DagInit($2, *$3);
- delete $3;
- } | Value '[' BitList ']' {
- std::reverse($3->begin(), $3->end());
- $$ = $1->convertInitListSlice(*$3);
- if ($$ == 0) {
- err() << "Invalid list slice for value '" << *$1 << "'!\n";
- exit(1);
- }
- delete $3;
- } | CONCATTOK '(' Value ',' Value ')' {
- $$ = (new BinOpInit(BinOpInit::CONCAT, $3, $5))->Fold();
- } | SHLTOK '(' Value ',' Value ')' {
- $$ = (new BinOpInit(BinOpInit::SHL, $3, $5))->Fold();
- } | SRATOK '(' Value ',' Value ')' {
- $$ = (new BinOpInit(BinOpInit::SRA, $3, $5))->Fold();
- } | SRLTOK '(' Value ',' Value ')' {
- $$ = (new BinOpInit(BinOpInit::SRL, $3, $5))->Fold();
- } | STRCONCATTOK '(' Value ',' Value ')' {
- $$ = (new BinOpInit(BinOpInit::STRCONCAT, $3, $5))->Fold();
- };
-
-OptVarName : /* empty */ {
- $$ = new std::string();
- }
- | ':' VARNAME {
- $$ = $2;
- };
-
-DagArgListNE : Value OptVarName {
- $$ = new std::vector<std::pair<Init*, std::string> >();
- $$->push_back(std::make_pair($1, *$2));
- delete $2;
- }
- | DagArgListNE ',' Value OptVarName {
- $1->push_back(std::make_pair($3, *$4));
- delete $4;
- $$ = $1;
- };
-
-DagArgList : /*empty*/ {
- $$ = new std::vector<std::pair<Init*, std::string> >();
- }
- | DagArgListNE { $$ = $1; };
-
-
-RBitList : INTVAL {
- $$ = new std::vector<unsigned>();
- $$->push_back($1);
- } | INTVAL '-' INTVAL {
- if ($1 < 0 || $3 < 0) {
- err() << "Invalid range: " << $1 << "-" << $3 << "!\n";
- exit(1);
- }
- $$ = new std::vector<unsigned>();
- if ($1 < $3) {
- for (int i = $1; i <= $3; ++i)
- $$->push_back(i);
- } else {
- for (int i = $1; i >= $3; --i)
- $$->push_back(i);
- }
- } | INTVAL INTVAL {
- $2 = -$2;
- if ($1 < 0 || $2 < 0) {
- err() << "Invalid range: " << $1 << "-" << $2 << "!\n";
- exit(1);
- }
- $$ = new std::vector<unsigned>();
- if ($1 < $2) {
- for (int i = $1; i <= $2; ++i)
- $$->push_back(i);
- } else {
- for (int i = $1; i >= $2; --i)
- $$->push_back(i);
- }
- } | RBitList ',' INTVAL {
- ($$=$1)->push_back($3);
- } | RBitList ',' INTVAL '-' INTVAL {
- if ($3 < 0 || $5 < 0) {
- err() << "Invalid range: " << $3 << "-" << $5 << "!\n";
- exit(1);
- }
- $$ = $1;
- if ($3 < $5) {
- for (int i = $3; i <= $5; ++i)
- $$->push_back(i);
- } else {
- for (int i = $3; i >= $5; --i)
- $$->push_back(i);
- }
- } | RBitList ',' INTVAL INTVAL {
- $4 = -$4;
- if ($3 < 0 || $4 < 0) {
- err() << "Invalid range: " << $3 << "-" << $4 << "!\n";
- exit(1);
- }
- $$ = $1;
- if ($3 < $4) {
- for (int i = $3; i <= $4; ++i)
- $$->push_back(i);
- } else {
- for (int i = $3; i >= $4; --i)
- $$->push_back(i);
- }
- };
-
-BitList : RBitList { $$ = $1; std::reverse($1->begin(), $1->end()); };
-
-OptBitList : /*empty*/ { $$ = 0; } | '{' BitList '}' { $$ = $2; };
-
-
-
-ValueList : /*empty*/ {
- $$ = new std::vector<Init*>();
- } | ValueListNE {
- $$ = $1;
- };
-
-ValueListNE : Value {
- $$ = new std::vector<Init*>();
- $$->push_back($1);
- } | ValueListNE ',' Value {
- ($$ = $1)->push_back($3);
- };
-
-Declaration : OptPrefix Type ID OptValue {
- std::string DecName = *$3;
- if (ParsingTemplateArgs) {
- if (CurRec) {
- DecName = CurRec->getName() + ":" + DecName;
- } else {
- assert(CurMultiClass);
- }
- if (CurMultiClass)
- DecName = CurMultiClass->Rec.getName() + "::" + DecName;
- }
-
- addValue(RecordVal(DecName, $2, $1));
- setValue(DecName, 0, $4);
- $$ = new std::string(DecName);
-};
-
-BodyItem : Declaration ';' {
- delete $1;
-} | LET ID OptBitList '=' Value ';' {
- setValue(*$2, $3, $5);
- delete $2;
- delete $3;
-};
-
-BodyList : /*empty*/ | BodyList BodyItem;
-Body : ';' | '{' BodyList '}';
-
-SubClassRef : ClassID {
- $$ = new SubClassRefTy($1, new std::vector<Init*>());
- } | ClassID '<' ValueListNE '>' {
- $$ = new SubClassRefTy($1, $3);
- };
-
-ClassListNE : SubClassRef {
- $$ = new std::vector<SubClassRefTy>();
- $$->push_back(*$1);
- delete $1;
- }
- | ClassListNE ',' SubClassRef {
- ($$=$1)->push_back(*$3);
- delete $3;
- };
-
-ClassList : /*empty */ {
- $$ = new std::vector<SubClassRefTy>();
- }
- | ':' ClassListNE {
- $$ = $2;
- };
-
-DeclListNE : Declaration {
- getActiveRec()->addTemplateArg(*$1);
- delete $1;
-} | DeclListNE ',' Declaration {
- getActiveRec()->addTemplateArg(*$3);
- delete $3;
-};
-
-TemplateArgList : '<' DeclListNE '>' {};
-OptTemplateArgList : /*empty*/ | TemplateArgList;
-
-OptID : ID { $$ = $1; } | /*empty*/ { $$ = new std::string(); };
-
-ObjectName : OptID {
- static unsigned AnonCounter = 0;
- if ($1->empty())
- *$1 = "anonymous."+utostr(AnonCounter++);
- $$ = $1;
-};
-
-ClassName : ObjectName {
- // If a class of this name already exists, it must be a forward ref.
- if ((CurRec = Records.getClass(*$1))) {
- // If the body was previously defined, this is an error.
- if (!CurRec->getValues().empty() ||
- !CurRec->getSuperClasses().empty() ||
- !CurRec->getTemplateArgs().empty()) {
- err() << "Class '" << CurRec->getName() << "' already defined!\n";
- exit(1);
- }
- } else {
- // If this is the first reference to this class, create and add it.
- CurRec = new Record(*$1);
- Records.addClass(CurRec);
- }
- delete $1;
-};
-
-DefName : ObjectName {
- CurRec = new Record(*$1);
- delete $1;
-
- if (!CurMultiClass) {
- // Top-level def definition.
-
- // Ensure redefinition doesn't happen.
- if (Records.getDef(CurRec->getName())) {
- err() << "def '" << CurRec->getName() << "' already defined!\n";
- exit(1);
- }
- Records.addDef(CurRec);
- } else {
- // Otherwise, a def inside a multiclass, add it to the multiclass.
- for (unsigned i = 0, e = CurMultiClass->DefPrototypes.size(); i != e; ++i)
- if (CurMultiClass->DefPrototypes[i]->getName() == CurRec->getName()) {
- err() << "def '" << CurRec->getName()
- << "' already defined in this multiclass!\n";
- exit(1);
- }
- CurMultiClass->DefPrototypes.push_back(CurRec);
- }
-};
-
-ObjectBody : ClassList {
- for (unsigned i = 0, e = $1->size(); i != e; ++i) {
- addSubClass((*$1)[i].first, *(*$1)[i].second);
- // Delete the template arg values for the class
- delete (*$1)[i].second;
- }
- delete $1; // Delete the class list.
-
- // Process any variables on the let stack.
- for (unsigned i = 0, e = LetStack.size(); i != e; ++i)
- for (unsigned j = 0, e = LetStack[i].size(); j != e; ++j)
- setValue(LetStack[i][j].Name,
- LetStack[i][j].HasBits ? &LetStack[i][j].Bits : 0,
- LetStack[i][j].Value);
- } Body {
- $$ = CurRec;
- CurRec = 0;
- };
-
-ClassInst : CLASS ClassName {
- ParsingTemplateArgs = true;
- } OptTemplateArgList {
- ParsingTemplateArgs = false;
- } ObjectBody {
- $$ = $6;
- };
-
-DefInst : DEF DefName ObjectBody {
- if (CurMultiClass == 0) // Def's in multiclasses aren't really defs.
- $3->resolveReferences();
-
- // If ObjectBody has template arguments, it's an error.
- assert($3->getTemplateArgs().empty() && "How'd this get template args?");
- $$ = $3;
-};
-
-// MultiClassDef - A def instance specified inside a multiclass.
-MultiClassDef : DefInst {
- $$ = $1;
- // Copy the template arguments for the multiclass into the def.
- const std::vector<std::string> &TArgs = CurMultiClass->Rec.getTemplateArgs();
-
- for (unsigned i = 0, e = TArgs.size(); i != e; ++i) {
- const RecordVal *RV = CurMultiClass->Rec.getValue(TArgs[i]);
- assert(RV && "Template arg doesn't exist?");
- $$->addValue(*RV);
- }
-};
-
-// MultiClassBody - Sequence of def's that are instantiated when a multiclass is
-// used.
-MultiClassBody : MultiClassDef {
- $$ = new std::vector<Record*>();
- $$->push_back($1);
-} | MultiClassBody MultiClassDef {
- $$->push_back($2);
-};
-
-MultiClassName : ID {
- MultiClass *&MCE = MultiClasses[*$1];
- if (MCE) {
- err() << "multiclass '" << *$1 << "' already defined!\n";
- exit(1);
- }
- MCE = CurMultiClass = new MultiClass(*$1);
- delete $1;
-};
-
-// MultiClass - Multiple definitions.
-MultiClassInst : MULTICLASS MultiClassName {
- ParsingTemplateArgs = true;
- } OptTemplateArgList {
- ParsingTemplateArgs = false;
- }'{' MultiClassBody '}' {
- CurMultiClass = 0;
-};
-
-// DefMInst - Instantiate a multiclass.
-DefMInst : DEFM ID { CurDefmPrefix = $2; } ':' SubClassRef ';' {
- // To instantiate a multiclass, we need to first get the multiclass, then
- // instantiate each def contained in the multiclass with the SubClassRef
- // template parameters.
- MultiClass *MC = MultiClasses[$5->first->getName()];
- assert(MC && "Didn't lookup multiclass correctly?");
- std::vector<Init*> &TemplateVals = *$5->second;
- delete $5;
-
- // Verify that the correct number of template arguments were specified.
- const std::vector<std::string> &TArgs = MC->Rec.getTemplateArgs();
- if (TArgs.size() < TemplateVals.size()) {
- err() << "ERROR: More template args specified than multiclass expects!\n";
- exit(1);
- }
-
- // Loop over all the def's in the multiclass, instantiating each one.
- for (unsigned i = 0, e = MC->DefPrototypes.size(); i != e; ++i) {
- Record *DefProto = MC->DefPrototypes[i];
-
- // Add the suffix to the defm name to get the new name.
- assert(CurRec == 0 && "A def is current?");
- CurRec = new Record(*$2 + DefProto->getName());
-
- addSubClass(DefProto, std::vector<Init*>());
-
- // Loop over all of the template arguments, setting them to the specified
- // value or leaving them as the default if necessary.
- for (unsigned i = 0, e = TArgs.size(); i != e; ++i) {
- if (i < TemplateVals.size()) { // A value is specified for this temp-arg?
- // Set it now.
- setValue(TArgs[i], 0, TemplateVals[i]);
-
- // Resolve it next.
- CurRec->resolveReferencesTo(CurRec->getValue(TArgs[i]));
-
- // Now remove it.
- CurRec->removeValue(TArgs[i]);
-
- } else if (!CurRec->getValue(TArgs[i])->getValue()->isComplete()) {
- err() << "ERROR: Value not specified for template argument #"
- << i << " (" << TArgs[i] << ") of multiclassclass '"
- << MC->Rec.getName() << "'!\n";
- exit(1);
- }
- }
-
- // If the mdef is inside a 'let' expression, add to each def.
- for (unsigned i = 0, e = LetStack.size(); i != e; ++i)
- for (unsigned j = 0, e = LetStack[i].size(); j != e; ++j)
- setValue(LetStack[i][j].Name,
- LetStack[i][j].HasBits ? &LetStack[i][j].Bits : 0,
- LetStack[i][j].Value);
-
-
- // Ensure redefinition doesn't happen.
- if (Records.getDef(CurRec->getName())) {
- err() << "def '" << CurRec->getName() << "' already defined, "
- << "instantiating defm '" << *$2 << "' with subdef '"
- << DefProto->getName() << "'!\n";
- exit(1);
- }
- Records.addDef(CurRec);
-
- CurRec->resolveReferences();
-
- CurRec = 0;
- }
-
- delete &TemplateVals;
- delete $2;
- CurDefmPrefix = 0;
-};
-
-Object : ClassInst {} | DefInst {};
-Object : MultiClassInst | DefMInst;
-
-LETItem : ID OptBitList '=' Value {
- LetStack.back().push_back(LetRecord(*$1, $2, $4));
- delete $1; delete $2;
-};
-
-LETList : LETItem | LETList ',' LETItem;
-
-// LETCommand - A 'LET' statement start...
-LETCommand : LET { LetStack.push_back(std::vector<LetRecord>()); } LETList IN;
-
-// Support Set commands wrapping objects... both with and without braces.
-Object : LETCommand '{' ObjectList '}' {
- LetStack.pop_back();
- }
- | LETCommand Object {
- LetStack.pop_back();
- };
-
-ObjectList : Object {} | ObjectList Object {};
-
-File : ObjectList;
-
-%%
-
-int yyerror(const char *ErrorMsg) {
- err() << "Error parsing: " << ErrorMsg << "\n";
- exit(1);
-}
diff --git a/utils/TableGen/FileParser.y.cvs b/utils/TableGen/FileParser.y.cvs
deleted file mode 100644
index 0612f56ca0..0000000000
--- a/utils/TableGen/FileParser.y.cvs
+++ /dev/null
@@ -1,806 +0,0 @@
-//===-- FileParser.y - Parser for TableGen files ----------------*- C++ -*-===//
-//
-// The LLVM Compiler Infrastructure
-//
-// This file was developed by the LLVM research group and is distributed under
-// the University of Illinois Open Source License. See LICENSE.TXT for details.
-//
-//===----------------------------------------------------------------------===//
-//
-// This file implements the bison parser for Table Generator files...
-//
-//===----------------------------------------------------------------------===//
-
-%{
-#include "Record.h"
-#include "llvm/ADT/StringExtras.h"
-#include "llvm/Support/Streams.h"
-#include <algorithm>
-#include <cstdio>
-#define YYERROR_VERBOSE 1
-
-int yyerror(const char *ErrorMsg);
-int yylex();
-
-namespace llvm {
- struct MultiClass {
- Record Rec; // Placeholder for template args and Name.
- std::vector<Record*> DefPrototypes;
-
- MultiClass(const std::string &Name) : Rec(Name) {}
- };
-
-
-static std::map<std::string, MultiClass*> MultiClasses;
-
-extern int Filelineno;
-static MultiClass *CurMultiClass = 0; // Set while parsing a multiclass.
-static std::string *CurDefmPrefix = 0; // Set while parsing defm.
-static Record *CurRec = 0;
-static bool ParsingTemplateArgs = false;
-
-typedef std::pair<Record*, std::vector<Init*>*> SubClassRefTy;
-
-struct LetRecord {
- std::string Name;
- std::vector<unsigned> Bits;
- Init *Value;
- bool HasBits;
- LetRecord(const std::string &N, std::vector<unsigned> *B, Init *V)
- : Name(N), Value(V), HasBits(B != 0) {
- if (HasBits) Bits = *B;
- }
-};
-
-static std::vector<std::vector<LetRecord> > LetStack;
-
-
-extern std::ostream &err();
-
-/// getActiveRec - If inside a def/class definition, return the def/class.
-/// Otherwise, if within a multidef, return it.
-static Record *getActiveRec() {
- return CurRec ? CurRec : &CurMultiClass->Rec;
-}
-
-static void addValue(const RecordVal &RV) {
- Record *TheRec = getActiveRec();
-
- if (RecordVal *ERV = TheRec->getValue(RV.getName())) {
- // The value already exists in the class, treat this as a set...
- if (ERV->setValue(RV.getValue())) {
- err() << "New definition of '" << RV.getName() << "' of type '"
- << *RV.getType() << "' is incompatible with previous "
- << "definition of type '" << *ERV->getType() << "'!\n";
- exit(1);
- }
- } else {
- TheRec->addValue(RV);
- }
-}
-
-static void addSuperClass(Record *SC) {
- if (CurRec->isSubClassOf(SC)) {
- err() << "Already subclass of '" << SC->getName() << "'!\n";
- exit(1);
- }
- CurRec->addSuperClass(SC);
-}
-
-static void setValue(const std::string &ValName,
- std::vector<unsigned> *BitList, Init *V) {
- if (!V) return;
-
- Record *TheRec = getActiveRec();
- RecordVal *RV = TheRec->getValue(ValName);
- if (RV == 0) {
- err() << "Value '" << ValName << "' unknown!\n";
- exit(1);
- }
-
- // Do not allow assignments like 'X = X'. This will just cause infinite loops
- // in the resolution machinery.
- if (!BitList)
- if (VarInit *VI = dynamic_cast<VarInit*>(V))
- if (VI->getName() == ValName)
- return;
-
- // If we are assigning to a subset of the bits in the value... then we must be
- // assigning to a field of BitsRecTy, which must have a BitsInit
- // initializer...
- //
- if (BitList) {
- BitsInit *CurVal = dynamic_cast<BitsInit*>(RV->getValue());
- if (CurVal == 0) {
- err() << "Value '" << ValName << "' is not a bits type!\n";
- exit(1);
- }
-
- // Convert the incoming value to a bits type of the appropriate size...
- Init *BI = V->convertInitializerTo(new BitsRecTy(BitList->size()));
- if (BI == 0) {
- V->convertInitializerTo(new BitsRecTy(BitList->size()));
- err() << "Initializer '" << *V << "' not compatible with bit range!\n";
- exit(1);
- }
-
- // We should have a BitsInit type now...
- assert(dynamic_cast<BitsInit*>(BI) != 0 || (cerr << *BI).stream() == 0);
- BitsInit *BInit = (BitsInit*)BI;
-
- BitsInit *NewVal = new BitsInit(CurVal->getNumBits());
-
- // Loop over bits, assigning values as appropriate...
- for (unsigned i = 0, e = BitList->size(); i != e; ++i) {
- unsigned Bit = (*BitList)[i];
- if (NewVal->getBit(Bit)) {
- err() << "Cannot set bit #" << Bit << " of value '" << ValName
- << "' more than once!\n";
- exit(1);
- }
- NewVal->setBit(Bit, BInit->getBit(i));
- }
-
- for (unsigned i = 0, e = CurVal->getNumBits(); i != e; ++i)
- if (NewVal->getBit(i) == 0)
- NewVal->setBit(i, CurVal->getBit(i));
-
- V = NewVal;
- }
-
- if (RV->setValue(V)) {
- err() << "Value '" << ValName << "' of type '" << *RV->getType()
- << "' is incompatible with initializer '" << *V << "'!\n";
- exit(1);
- }
-}
-
-// addSubClass - Add SC as a subclass to CurRec, resolving TemplateArgs as SC's
-// template arguments.
-static void addSubClass(Record *SC, const std::vector<Init*> &TemplateArgs) {
- // Add all of the values in the subclass into the current class...
- const std::vector<RecordVal> &Vals = SC->getValues();
- for (unsigned i = 0, e = Vals.size(); i != e; ++i)
- addValue(Vals[i]);
-
- const std::vector<std::string> &TArgs = SC->getTemplateArgs();
-
- // Ensure that an appropriate number of template arguments are specified...
- if (TArgs.size() < TemplateArgs.size()) {
- err() << "ERROR: More template args specified than expected!\n";
- exit(1);
- }
-
- // Loop over all of the template arguments, setting them to the specified
- // value or leaving them as the default if necessary.
- for (unsigned i = 0, e = TArgs.size(); i != e; ++i) {
- if (i < TemplateArgs.size()) { // A value is specified for this temp-arg?
- // Set it now.
- setValue(TArgs[i], 0, TemplateArgs[i]);
-
- // Resolve it next.
- CurRec->resolveReferencesTo(CurRec->getValue(TArgs[i]));
-
-
- // Now remove it.
- CurRec->removeValue(TArgs[i]);
-
- } else if (!CurRec->getValue(TArgs[i])->getValue()->isComplete()) {
- err() << "ERROR: Value not specified for template argument #"
- << i << " (" << TArgs[i] << ") of subclass '" << SC->getName()
- << "'!\n";
- exit(1);
- }
- }
-
- // Since everything went well, we can now set the "superclass" list for the
- // current record.
- const std::vector<Record*> &SCs = SC->getSuperClasses();
- for (unsigned i = 0, e = SCs.size(); i != e; ++i)
- addSuperClass(SCs[i]);
- addSuperClass(SC);
-}
-
-} // End llvm namespace
-
-using namespace llvm;
-
-%}
-
-%union {
- std::string* StrVal;
- int IntVal;
- llvm::RecTy* Ty;
- llvm::Init* Initializer;
- std::vector<llvm::Init*>* FieldList;
- std::vector<unsigned>* BitList;
- llvm::Record* Rec;
- std::vector<llvm::Record*>* RecList;
- SubClassRefTy* SubClassRef;
- std::vector<SubClassRefTy>* SubClassList;
- std::vector<std::pair<llvm::Init*, std::string> >* DagValueList;
-};
-
-%token INT BIT STRING BITS LIST CODE DAG CLASS DEF MULTICLASS DEFM FIELD LET IN
-%token CONCATTOK SHLTOK SRATOK SRLTOK STRCONCATTOK
-%token <IntVal> INTVAL
-%token <StrVal> ID VARNAME STRVAL CODEFRAGMENT
-
-%type <Ty> Type
-%type <Rec> ClassInst DefInst MultiClassDef ObjectBody ClassID
-%type <RecList> MultiClassBody
-
-%type <SubClassRef> SubClassRef
-%type <SubClassList> ClassList ClassListNE
-%type <IntVal> OptPrefix
-%type <Initializer> Value OptValue IDValue
-%type <DagValueList> DagArgList DagArgListNE
-%type <FieldList> ValueList ValueListNE
-%type <BitList> BitList OptBitList RBitList
-%type <StrVal> Declaration OptID OptVarName ObjectName
-
-%start File
-
-%%
-
-ClassID : ID {
- if (CurDefmPrefix) {
- // If CurDefmPrefix is set, we're parsing a defm, which means that this is
- // actually the name of a multiclass.
- MultiClass *MC = MultiClasses[*$1];
- if (MC == 0) {
- err() << "Couldn't find class '" << *$1 << "'!\n";
- exit(1);
- }
- $$ = &MC->Rec;
- } else {
- $$ = Records.getClass(*$1);
- }
- if ($$ == 0) {
- err() << "Couldn't find class '" << *$1 << "'!\n";
- exit(1);
- }
- delete $1;
- };
-
-
-// TableGen types...
-Type : STRING { // string type
- $$ = new StringRecTy();
- } | BIT { // bit type
- $$ = new BitRecTy();
- } | BITS '<' INTVAL '>' { // bits<x> type
- $$ = new BitsRecTy($3);
- } | INT { // int type
- $$ = new IntRecTy();
- } | LIST '<' Type '>' { // list<x> type
- $$ = new ListRecTy($3);
- } | CODE { // code type
- $$ = new CodeRecTy();
- } | DAG { // dag type
- $$ = new DagRecTy();
- } | ClassID { // Record Type
- $$ = new RecordRecTy($1);
- };
-
-OptPrefix : /*empty*/ { $$ = 0; } | FIELD { $$ = 1; };
-
-OptValue : /*empty*/ { $$ = 0; } | '=' Value { $$ = $2; };
-
-IDValue : ID {
- if (const RecordVal *RV = (CurRec ? CurRec->getValue(*$1) : 0)) {
- $$ = new VarInit(*$1, RV->getType());
- } else if (CurRec && CurRec->isTemplateArg(CurRec->getName()+":"+*$1)) {
- const RecordVal *RV = CurRec->getValue(CurRec->getName()+":"+*$1);
- assert(RV && "Template arg doesn't exist??");
- $$ = new VarInit(CurRec->getName()+":"+*$1, RV->getType());
- } else if (CurMultiClass &&
- CurMultiClass->Rec.isTemplateArg(CurMultiClass->Rec.getName()+"::"+*$1)) {
- std::string Name = CurMultiClass->Rec.getName()+"::"+*$1;
- const RecordVal *RV = CurMultiClass->Rec.getValue(Name);
- assert(RV && "Template arg doesn't exist??");
- $$ = new VarInit(Name, RV->getType());
- } else if (Record *D = Records.getDef(*$1)) {
- $$ = new DefInit(D);
- } else {
- err() << "Variable not defined: '" << *$1 << "'!\n";
- exit(1);
- }
-
- delete $1;
-};
-
-Value : IDValue {
- $$ = $1;
- } | INTVAL {
- $$ = new IntInit($1);
- } | STRVAL {
- $$ = new StringInit(*$1);
- delete $1;
- } | CODEFRAGMENT {
- $$ = new CodeInit(*$1);
- delete $1;
- } | '?' {
- $$ = new UnsetInit();
- } | '{' ValueList '}' {
- BitsInit *Init = new BitsInit($2->size());
- for (unsigned i = 0, e = $2->size(); i != e; ++i) {
- struct Init *Bit = (*$2)[i]->convertInitializerTo(new BitRecTy());
- if (Bit == 0) {
- err() << "Element #" << i << " (" << *(*$2)[i]
- << ") is not convertable to a bit!\n";
- exit(1);
- }
- Init->setBit($2->size()-i-1, Bit);
- }
- $$ = Init;
- delete $2;
- } | ID '<' ValueListNE '>' {
- // This is a CLASS<initvalslist> expression. This is supposed to synthesize
- // a new anonymous definition, deriving from CLASS<initvalslist> with no
- // body.
- Record *Class = Records.getClass(*$1);
- if (!Class) {
- err() << "Expected a class, got '" << *$1 << "'!\n";
- exit(1);
- }
- delete $1;
-
- static unsigned AnonCounter = 0;
- Record *OldRec = CurRec; // Save CurRec.
-
- // Create the new record, set it as CurRec temporarily.
- CurRec = new Record("anonymous.val."+utostr(AnonCounter++));
- addSubClass(Class, *$3); // Add info about the subclass to CurRec.
- delete $3; // Free up the template args.
-
- CurRec->resolveReferences();
-
- Records.addDef(CurRec);
-
- // The result of the expression is a reference to the new record.
- $$ = new DefInit(CurRec);
-
- // Restore the old CurRec
- CurRec = OldRec;
- } | Value '{' BitList '}' {
- $$ = $1->convertInitializerBitRange(*$3);
- if ($$ == 0) {
- err() << "Invalid bit range for value '" << *$1 << "'!\n";
- exit(1);
- }
- delete $3;
- } | '[' ValueList ']' {
- $$ = new ListInit(*$2);
- delete $2;
- } | Value '.' ID {
- if (!$1->getFieldType(*$3)) {
- err() << "Cannot access field '" << *$3 << "' of value '" << *$1 << "!\n";
- exit(1);
- }
- $$ = new FieldInit($1, *$3);
- delete $3;
- } | '(' IDValue DagArgList ')' {
- $$ = new DagInit($2, *$3);
- delete $3;
- } | Value '[' BitList ']' {
- std::reverse($3->begin(), $3->end());
- $$ = $1->convertInitListSlice(*$3);
- if ($$ == 0) {
- err() << "Invalid list slice for value '" << *$1 << "'!\n";
- exit(1);
- }
- delete $3;
- } | CONCATTOK '(' Value ',' Value ')' {
- $$ = (new BinOpInit(BinOpInit::CONCAT, $3, $5))->Fold();
- } | SHLTOK '(' Value ',' Value ')' {
- $$ = (new BinOpInit(BinOpInit::SHL, $3, $5))->Fold();
- } | SRATOK '(' Value ',' Value ')' {
- $$ = (new BinOpInit(BinOpInit::SRA, $3, $5))->Fold();
- } | SRLTOK '(' Value ',' Value ')' {
- $$ = (new BinOpInit(BinOpInit::SRL, $3, $5))->Fold();
- } | STRCONCATTOK '(' Value ',' Value ')' {
- $$ = (new BinOpInit(BinOpInit::STRCONCAT, $3, $5))->Fold();
- };
-
-OptVarName : /* empty */ {
- $$ = new std::string();
- }
- | ':' VARNAME {
- $$ = $2;
- };
-
-DagArgListNE : Value OptVarName {
- $$ = new std::vector<std::pair<Init*, std::string> >();
- $$->push_back(std::make_pair($1, *$2));
- delete $2;
- }
- | DagArgListNE ',' Value OptVarName {
- $1->push_back(std::make_pair($3, *$4));
- delete $4;
- $$ = $1;
- };
-
-DagArgList : /*empty*/ {
- $$ = new std::vector<std::pair<Init*, std::string> >();
- }
- | DagArgListNE { $$ = $1; };
-
-
-RBitList : INTVAL {
- $$ = new std::vector<unsigned>();
- $$->push_back($1);
- } | INTVAL '-' INTVAL {
- if ($1 < 0 || $3 < 0) {
- err() << "Invalid range: " << $1 << "-" << $3 << "!\n";
- exit(1);
- }
- $$ = new std::vector<unsigned>();
- if ($1 < $3) {
- for (int i = $1; i <= $3; ++i)
- $$->push_back(i);
- } else {
- for (int i = $1; i >= $3; --i)
- $$->push_back(i);
- }
- } | INTVAL INTVAL {
- $2 = -$2;
- if ($1 < 0 || $2 < 0) {
- err() << "Invalid range: " << $1 << "-" << $2 << "!\n";
- exit(1);
- }
- $$ = new std::vector<unsigned>();
- if ($1 < $2) {
- for (int i = $1; i <= $2; ++i)
- $$->push_back(i);
- } else {
- for (int i = $1; i >= $2; --i)
- $$->push_back(i);
- }
- } | RBitList ',' INTVAL {
- ($$=$1)->push_back($3);
- } | RBitList ',' INTVAL '-' INTVAL {
- if ($3 < 0 || $5 < 0) {
- err() << "Invalid range: " << $3 << "-" << $5 << "!\n";
- exit(1);
- }
- $$ = $1;
- if ($3 < $5) {
- for (int i = $3; i <= $5; ++i)
- $$->push_back(i);
- } else {
- for (int i = $3; i >= $5; --i)
- $$->push_back(i);
- }
- } | RBitList ',' INTVAL INTVAL {
- $4 = -$4;
- if ($3 < 0 || $4 < 0) {
- err() << "Invalid range: " << $3 << "-" << $4 << "!\n";
- exit(1);
- }
- $$ = $1;
- if ($3 < $4) {
- for (int i = $3; i <= $4; ++i)
- $$->push_back(i);
- } else {
- for (int i = $3; i >= $4; --i)
- $$->push_back(i);
- }
- };
-
-BitList : RBitList { $$ = $1; std::reverse($1->begin(), $1->end()); };
-
-OptBitList : /*empty*/ { $$ = 0; } | '{' BitList '}' { $$ = $2; };
-
-
-
-ValueList : /*empty*/ {
- $$ = new std::vector<Init*>();
- } | ValueListNE {
- $$ = $1;
- };
-
-ValueListNE : Value {
- $$ = new std::vector<Init*>();
- $$->push_back($1);
- } | ValueListNE ',' Value {
- ($$ = $1)->push_back($3);
- };
-
-Declaration : OptPrefix Type ID OptValue {
- std::string DecName = *$3;
- if (ParsingTemplateArgs) {
- if (CurRec) {
- DecName = CurRec->getName() + ":" + DecName;
- } else {
- assert(CurMultiClass);
- }
- if (CurMultiClass)
- DecName = CurMultiClass->Rec.getName() + "::" + DecName;
- }
-
- addValue(RecordVal(DecName, $2, $1));
- setValue(DecName, 0, $4);
- $$ = new std::string(DecName);
-};
-
-BodyItem : Declaration ';' {
- delete $1;
-} | LET ID OptBitList '=' Value ';' {
- setValue(*$2, $3, $5);
- delete $2;
- delete $3;
-};
-
-BodyList : /*empty*/ | BodyList BodyItem;
-Body : ';' | '{' BodyList '}';
-
-SubClassRef : ClassID {
- $$ = new SubClassRefTy($1, new std::vector<Init*>());
- } | ClassID '<' ValueListNE '>' {
- $$ = new SubClassRefTy($1, $3);
- };
-
-ClassListNE : SubClassRef {
- $$ = new std::vector<SubClassRefTy>();
- $$->push_back(*$1);
- delete $1;
- }
- | ClassListNE ',' SubClassRef {
- ($$=$1)->push_back(*$3);
- delete $3;
- };
-
-ClassList : /*empty */ {
- $$ = new std::vector<SubClassRefTy>();
- }
- | ':' ClassListNE {
- $$ = $2;
- };
-
-DeclListNE : Declaration {
- getActiveRec()->addTemplateArg(*$1);
- delete $1;
-} | DeclListNE ',' Declaration {
- getActiveRec()->addTemplateArg(*$3);
- delete $3;
-};
-
-TemplateArgList : '<' DeclListNE '>' {};
-OptTemplateArgList : /*empty*/ | TemplateArgList;
-
-OptID : ID { $$ = $1; } | /*empty*/ { $$ = new std::string(); };
-
-ObjectName : OptID {
- static unsigned AnonCounter = 0;
- if ($1->empty())
- *$1 = "anonymous."+utostr(AnonCounter++);
- $$ = $1;
-};
-
-ClassName : ObjectName {
- // If a class of this name already exists, it must be a forward ref.
- if ((CurRec = Records.getClass(*$1))) {
- // If the body was previously defined, this is an error.
- if (!CurRec->getValues().empty() ||
- !CurRec->getSuperClasses().empty() ||
- !CurRec->getTemplateArgs().empty()) {
- err() << "Class '" << CurRec->getName() << "' already defined!\n";
- exit(1);
- }
- } else {
- // If this is the first reference to this class, create and add it.
- CurRec = new Record(*$1);
- Records.addClass(CurRec);
- }
- delete $1;
-};
-
-DefName : ObjectName {
- CurRec = new Record(*$1);
- delete $1;
-
- if (!CurMultiClass) {
- // Top-level def definition.
-
- // Ensure redefinition doesn't happen.
- if (Records.getDef(CurRec->getName())) {
- err() << "def '" << CurRec->getName() << "' already defined!\n";
- exit(1);
- }
- Records.addDef(CurRec);
- } else {
- // Otherwise, a def inside a multiclass, add it to the multiclass.
- for (unsigned i = 0, e = CurMultiClass->DefPrototypes.size(); i != e; ++i)
- if (CurMultiClass->DefPrototypes[i]->getName() == CurRec->getName()) {
- err() << "def '" << CurRec->getName()
- << "' already defined in this multiclass!\n";
- exit(1);
- }
- CurMultiClass->DefPrototypes.push_back(CurRec);
- }
-};
-
-ObjectBody : ClassList {
- for (unsigned i = 0, e = $1->size(); i != e; ++i) {
- addSubClass((*$1)[i].first, *(*$1)[i].second);
- // Delete the template arg values for the class
- delete (*$1)[i].second;
- }
- delete $1; // Delete the class list.
-
- // Process any variables on the let stack.
- for (unsigned i = 0, e = LetStack.size(); i != e; ++i)
- for (unsigned j = 0, e = LetStack[i].size(); j != e; ++j)
- setValue(LetStack[i][j].Name,
- LetStack[i][j].HasBits ? &LetStack[i][j].Bits : 0,
- LetStack[i][j].Value);
- } Body {
- $$ = CurRec;
- CurRec = 0;
- };
-
-ClassInst : CLASS ClassName {
- ParsingTemplateArgs = true;
- } OptTemplateArgList {
- ParsingTemplateArgs = false;
- } ObjectBody {
- $$ = $6;
- };
-
-DefInst : DEF DefName ObjectBody {
- if (CurMultiClass == 0) // Def's in multiclasses aren't really defs.
- $3->resolveReferences();
-
- // If ObjectBody has template arguments, it's an error.
- assert($3->getTemplateArgs().empty() && "How'd this get template args?");
- $$ = $3;
-};
-
-// MultiClassDef - A def instance specified inside a multiclass.
-MultiClassDef : DefInst {
- $$ = $1;
- // Copy the template arguments for the multiclass into the def.
- const std::vector<std::string> &TArgs = CurMultiClass->Rec.getTemplateArgs();
-
- for (unsigned i = 0, e = TArgs.size(); i != e; ++i) {
- const RecordVal *RV = CurMultiClass->Rec.getValue(TArgs[i]);
- assert(RV && "Template arg doesn't exist?");
- $$->addValue(*RV);
- }
-};
-
-// MultiClassBody - Sequence of def's that are instantiated when a multiclass is
-// used.
-MultiClassBody : MultiClassDef {
- $$ = new std::vector<Record*>();
- $$->push_back($1);
-} | MultiClassBody MultiClassDef {
- $$->push_back($2);
-};
-
-MultiClassName : ID {
- MultiClass *&MCE = MultiClasses[*$1];
- if (MCE) {
- err() << "multiclass '" << *$1 << "' already defined!\n";
- exit(1);
- }
- MCE = CurMultiClass = new MultiClass(*$1);
- delete $1;
-};
-
-// MultiClass - Multiple definitions.
-MultiClassInst : MULTICLASS MultiClassName {
- ParsingTemplateArgs = true;
- } OptTemplateArgList {
- ParsingTemplateArgs = false;
- }'{' MultiClassBody '}' {
- CurMultiClass = 0;
-};
-
-// DefMInst - Instantiate a multiclass.
-DefMInst : DEFM ID { CurDefmPrefix = $2; } ':' SubClassRef ';' {
- // To instantiate a multiclass, we need to first get the multiclass, then
- // instantiate each def contained in the multiclass with the SubClassRef
- // template parameters.
- MultiClass *MC = MultiClasses[$5->first->getName()];
- assert(MC && "Didn't lookup multiclass correctly?");
- std::vector<Init*> &TemplateVals = *$5->second;
- delete $5;
-
- // Verify that the correct number of template arguments were specified.
- const std::vector<std::string> &TArgs = MC->Rec.getTemplateArgs();
- if (TArgs.size() < TemplateVals.size()) {
- err() << "ERROR: More template args specified than multiclass expects!\n";
- exit(1);
- }
-
- // Loop over all the def's in the multiclass, instantiating each one.
- for (unsigned i = 0, e = MC->DefPrototypes.size(); i != e; ++i) {
- Record *DefProto = MC->DefPrototypes[i];
-
- // Add the suffix to the defm name to get the new name.
- assert(CurRec == 0 && "A def is current?");
- CurRec = new Record(*$2 + DefProto->getName());
-
- addSubClass(DefProto, std::vector<Init*>());
-
- // Loop over all of the template arguments, setting them to the specified
- // value or leaving them as the default if necessary.
- for (unsigned i = 0, e = TArgs.size(); i != e; ++i) {
- if (i < TemplateVals.size()) { // A value is specified for this temp-arg?
- // Set it now.
- setValue(TArgs[i], 0, TemplateVals[i]);
-
- // Resolve it next.
- CurRec->resolveReferencesTo(CurRec->getValue(TArgs[i]));
-
- // Now remove it.
- CurRec->removeValue(TArgs[i]);
-
- } else if (!CurRec->getValue(TArgs[i])->getValue()->isComplete()) {
- err() << "ERROR: Value not specified for template argument #"
- << i << " (" << TArgs[i] << ") of multiclassclass '"
- << MC->Rec.getName() << "'!\n";
- exit(1);
- }
- }
-
- // If the mdef is inside a 'let' expression, add to each def.
- for (unsigned i = 0, e = LetStack.size(); i != e; ++i)
- for (unsigned j = 0, e = LetStack[i].size(); j != e; ++j)
- setValue(LetStack[i][j].Name,
- LetStack[i][j].HasBits ? &LetStack[i][j].Bits : 0,
- LetStack[i][j].Value);
-
-
- // Ensure redefinition doesn't happen.
- if (Records.getDef(CurRec->getName())) {
- err() << "def '" << CurRec->getName() << "' already defined, "
- << "instantiating defm '" << *$2 << "' with subdef '"
- << DefProto->getName() << "'!\n";
- exit(1);
- }
- Records.addDef(CurRec);
-
- CurRec->resolveReferences();
-
- CurRec = 0;
- }
-
- delete &TemplateVals;
- delete $2;
- CurDefmPrefix = 0;
-};
-
-Object : ClassInst {} | DefInst {};
-Object : MultiClassInst | DefMInst;
-
-LETItem : ID OptBitList '=' Value {
- LetStack.back().push_back(LetRecord(*$1, $2, $4));
- delete $1; delete $2;
-};
-
-LETList : LETItem | LETList ',' LETItem;
-
-// LETCommand - A 'LET' statement start...
-LETCommand : LET { LetStack.push_back(std::vector<LetRecord>()); } LETList IN;
-
-// Support Set commands wrapping objects... both with and without braces.
-Object : LETCommand '{' ObjectList '}' {
- LetStack.pop_back();
- }
- | LETCommand Object {
- LetStack.pop_back();
- };
-
-ObjectList : Object {} | ObjectList Object {};
-
-File : ObjectList;
-
-%%
-
-int yyerror(const char *ErrorMsg) {
- err() << "Error parsing: " << ErrorMsg << "\n";
- exit(1);
-}
diff --git a/utils/TableGen/Makefile b/utils/TableGen/Makefile
index 128b2cdd0d..739a5b72e8 100644
--- a/utils/TableGen/Makefile
+++ b/utils/TableGen/Makefile
@@ -11,20 +11,8 @@ LEVEL = ../..
TOOLNAME = tblgen
NO_INSTALL = 1;
USEDLIBS = LLVMSupport.a LLVMSystem.a
-EXTRA_DIST = FileParser.cpp.cvs FileParser.h.cvs FileParser.y.cvs
REQUIRES_EH := 1
REQUIRES_RTTI := 1
include $(LEVEL)/Makefile.common
-# Disable -pedantic for tblgen
-CompileCommonOpts := $(filter-out -pedantic,$(CompileCommonOpts))
-CompileCommonOpts := $(filter-out -Wno-long-long,$(CompileCommonOpts))
-
-#
-# Make the source file depend on the header file. In this way, dependencies
-# (which depend on the source file) won't get generated until bison is done
-# generating the C source and header files for the parser.
-#
-$(ObjDir)/TGLexer.o : $(PROJ_SRC_DIR)/FileParser.h
-
diff --git a/utils/TableGen/TGLexer.cpp b/utils/TableGen/TGLexer.cpp
index 9efb4d4ffd..fae7ca48a9 100644
--- a/utils/TableGen/TGLexer.cpp
+++ b/utils/TableGen/TGLexer.cpp
@@ -12,20 +12,13 @@
//===----------------------------------------------------------------------===//
#include "TGLexer.h"
-#include "Record.h"
#include "llvm/Support/Streams.h"
-#include "Record.h"
#include "llvm/Support/MemoryBuffer.h"
-typedef std::pair<llvm::Record*, std::vector<llvm::Init*>*> SubClassRefTy;
-#include "FileParser.h"
+#include <ostream>
#include "llvm/Config/config.h"
#include <cctype>
using namespace llvm;
-// FIXME: REMOVE THIS.
-#define YYEOF 0
-#define YYERROR -2
-
TGLexer::TGLexer(MemoryBuffer *StartBuf) : CurLineNo(1), CurBuf(StartBuf) {
CurPtr = CurBuf->getBufferStart();
TokStart = 0;
@@ -40,18 +33,12 @@ TGLexer::~TGLexer() {
}
/// ReturnError - Set the error to the specified string at the specified
-/// location. This is defined to always return YYERROR.
-int TGLexer::ReturnError(const char *Loc, const std::string &Msg) {
+/// location. This is defined to always return tgtok::Error.
+tgtok::TokKind TGLexer::ReturnError(const char *Loc, const std::string &Msg) {
PrintError(Loc, Msg);
- return YYERROR;
-}
-
-std::ostream &TGLexer::err() const {
- PrintIncludeStack(*cerr.stream());
- return *cerr.stream();
+ return tgtok::Error;
}
-
void TGLexer::PrintIncludeStack(std::ostream &OS) const {
for (unsigned i = 0, e = IncludeStack.size(); i != e; ++i)
OS << "Included from " << IncludeStack[i].Buffer->getBufferIdentifier()
@@ -62,7 +49,8 @@ void TGLexer::PrintIncludeStack(std::ostream &OS) const {
/// PrintError - Print the error at the specified location.
void TGLexer::PrintError(const char *ErrorLoc, const std::string &Msg) const {
- err() << Msg << "\n";
+ PrintIncludeStack(*cerr.stream());
+ cerr << Msg << "\n";
assert(ErrorLoc && "Location not specified!");
// Scan backward to find the start of the line.
@@ -122,7 +110,7 @@ int TGLexer::getNextChar() {
}
}
-int TGLexer::LexToken() {
+tgtok::TokKind TGLexer::LexToken() {
TokStart = CurPtr;
// This always consumes at least one character.
int CurChar = getNextChar();
@@ -133,9 +121,23 @@ int TGLexer::LexToken() {
if (isalpha(CurChar) || CurChar == '_')
return LexIdentifier();
- // Unknown character, return the char itself.
- return (unsigned char)CurChar;
- case EOF: return YYEOF;
+ // Unknown character, emit an error.
+ return ReturnError(TokStart, "Unexpected character");
+ case EOF: return tgtok::Eof;
+ case ':': return tgtok::colon;
+ case ';': return tgtok::semi;
+ case '.': return tgtok::period;
+ case ',': return tgtok::comma;
+ case '<': return tgtok::less;
+ case '>': return tgtok::greater;
+ case ']': return tgtok::r_square;
+ case '{': return tgtok::l_brace;
+ case '}': return tgtok::r_brace;
+ case '(': return tgtok::l_paren;
+ case ')': return tgtok::r_paren;
+ case '=': return tgtok::equal;
+ case '?': return tgtok::question;
+
case 0:
case ' ':
case '\t':
@@ -150,9 +152,9 @@ int TGLexer::LexToken() {
SkipBCPLComment();
else if (*CurPtr == '*') {
if (SkipCComment())
- return YYERROR;
- } else // Otherwise, return this / as a token.
- return CurChar;
+ return tgtok::Error;
+ } else // Otherwise, this is an error.
+ return ReturnError(TokStart, "Unexpected character");
return LexToken();
case '-': case '+':
case '0': case '1': case '2': case '3': case '4': case '5': case '6':
@@ -166,7 +168,7 @@ int TGLexer::LexToken() {
}
/// LexString - Lex "[^"]*"
-int TGLexer::LexString() {
+tgtok::TokKind TGLexer::LexString() {
const char *StrStart = CurPtr;
while (*CurPtr != '"') {
@@ -180,14 +182,14 @@ int TGLexer::LexString() {
++CurPtr;
}
- Filelval.StrVal = new std::string(StrStart, CurPtr);
+ CurStrVal.assign(StrStart, CurPtr);
++CurPtr;
- return STRVAL;
+ return tgtok::StrVal;
}
-int TGLexer::LexVarName() {
+tgtok::TokKind TGLexer::LexVarName() {
if (!isalpha(CurPtr[0]) && CurPtr[0] != '_')
- return '$'; // Invalid varname.
+ return ReturnError(TokStart, "Invalid variable name");
// Otherwise, we're ok, consume the rest of the characters.
const char *VarNameStart = CurPtr++;
@@ -195,14 +197,14 @@ int TGLexer::LexVarName() {
while (isalpha(*CurPtr) || isdigit(*CurPtr) || *CurPtr == '_')
++CurPtr;
- Filelval.StrVal = new std::string(VarNameStart, CurPtr);
- return VARNAME;
+ CurStrVal.assign(VarNameStart, CurPtr);
+ return tgtok::VarName;
}
-int TGLexer::LexIdentifier() {
+tgtok::TokKind TGLexer::LexIdentifier() {
// The first letter is [a-zA-Z_].
- const char *IdentStart = CurPtr-1;
+ const char *IdentStart = TokStart;
// Match the rest of the identifier regex: [0-9a-zA-Z_]*
while (isalpha(*CurPtr) || isdigit(*CurPtr) || *CurPtr == '_')
@@ -211,45 +213,45 @@ int TGLexer::LexIdentifier() {
// Check to see if this identifier is a keyword.
unsigned Len = CurPtr-IdentStart;
- if (Len == 3 && !memcmp(IdentStart, "int", 3)) return INT;
- if (Len == 3 && !memcmp(IdentStart, "bit", 3)) return BIT;
- if (Len == 4 && !memcmp(IdentStart, "bits", 4)) return BITS;
- if (Len == 6 && !memcmp(IdentStart, "string", 6)) return STRING;
- if (Len == 4 && !memcmp(IdentStart, "list", 4)) return LIST;
- if (Len == 4 && !memcmp(IdentStart, "code", 4)) return CODE;
- if (Len == 3 && !memcmp(IdentStart, "dag", 3)) return DAG;
+ if (Len == 3 && !memcmp(IdentStart, "int", 3)) return tgtok::Int;
+ if (Len == 3 && !memcmp(IdentStart, "bit", 3)) return tgtok::Bit;
+ if (Len == 4 && !memcmp(IdentStart, "bits", 4)) return tgtok::Bits;
+ if (Len == 6 && !memcmp(IdentStart, "string", 6)) return tgtok::String;
+ if (Len == 4 && !memcmp(IdentStart, "list", 4)) return tgtok::List;
+ if (Len == 4 && !memcmp(IdentStart, "code", 4)) return tgtok::Code;
+ if (Len == 3 && !memcmp(IdentStart, "dag", 3)) return tgtok::Dag;
- if (Len == 5 && !memcmp(IdentStart, "class", 5)) return CLASS;
- if (Len == 3 && !memcmp(IdentStart, "def", 3)) return DEF;
- if (Len == 4 && !memcmp(IdentStart, "defm", 4)) return DEFM;
- if (Len == 10 && !memcmp(IdentStart, "multiclass", 10)) return MULTICLASS;
- if (Len == 5 && !memcmp(IdentStart, "field", 5)) return FIELD;
- if (Len == 3 && !memcmp(IdentStart, "let", 3)) return LET;
- if (Len == 2 && !memcmp(IdentStart, "in", 2)) return IN;
+ if (Len == 5 && !memcmp(IdentStart, "class", 5)) return tgtok::Class;
+ if (Len == 3 && !memcmp(IdentStart, "def", 3)) return tgtok::Def;
+ if (Len == 4 && !memcmp(IdentStart, "defm", 4)) return tgtok::Defm;
+ if (Len == 10 && !memcmp(IdentStart, "multiclass", 10))
+ return tgtok::MultiClass;
+ if (Len == 5 && !memcmp(IdentStart, "field", 5)) return tgtok::Field;
+ if (Len == 3 && !memcmp(IdentStart, "let", 3)) return tgtok::Let;
+ if (Len == 2 && !memcmp(IdentStart, "in", 2)) return tgtok::In;
if (Len == 7 && !memcmp(IdentStart, "include", 7)) {
- if (LexInclude()) return YYERROR;
- return LexToken();
+ if (LexInclude()) return tgtok::Error;
+ return Lex();
}
- Filelval.StrVal = new std::string(IdentStart, CurPtr);
- return ID;
+ CurStrVal.assign(IdentStart, CurPtr);
+ return tgtok::Id;
}
/// LexInclude - We just read the "include" token. Get the string token that
/// comes next and enter the include.
bool TGLexer::LexInclude() {
// The token after the include must be a string.
- int Tok = LexToken();
- if (Tok == YYERROR) return true;
- if (Tok != STRVAL) {
- PrintError(getTokenStart(), "Expected filename after include");
+ tgtok::TokKind Tok = LexToken();
+ if (Tok == tgtok::Error) return true;
+ if (Tok != tgtok::StrVal) {
+ PrintError(getLoc(), "Expected filename after include");
return true;
}
// Get the string.
- std::string Filename = *Filelval.StrVal;
- delete Filelval.StrVal;
+ std::string Filename = CurStrVal;
// Try to find the file.
MemoryBuffer *NewBuf = MemoryBuffer::getFile(&Filename[0], Filename.size());
@@ -261,8 +263,7 @@ bool TGLexer::LexInclude() {
}
if (NewBuf == 0) {
- PrintError(getTokenStart(),
- "Could not find include file '" + Filename + "'");
+ PrintError(getLoc(), "Could not find include file '" + Filename + "'");
return true;
}
@@ -296,7 +297,6 @@ void TGLexer::SkipBCPLComment() {
/// SkipCComment - This skips C-style /**/ comments. The only difference from C
/// is that we allow nesting.
bool TGLexer::SkipCComment() {
- const char *CommentStart = CurPtr-1;
++CurPtr; // skip the star.
unsigned CommentDepth = 1;
@@ -304,7 +304,7 @@ bool TGLexer::SkipCComment() {
int CurChar = getNextChar();
switch (CurChar) {
case EOF:
- PrintError(CommentStart, "Unterminated comment!");
+ PrintError(TokStart, "Unterminated comment!");
return true;
case '*':
// End of the comment?
@@ -328,13 +328,11 @@ bool TGLexer::SkipCComment() {
/// [-+]?[0-9]+
/// 0x[0-9a-fA-F]+
/// 0b[01]+
-int TGLexer::LexNumber() {
- const char *NumStart = CurPtr-1;
-
+tgtok::TokKind TGLexer::LexNumber() {
if (CurPtr[-1] == '0') {
if (CurPtr[0] == 'x') {
++CurPtr;
- NumStart = CurPtr;
+ const char *NumStart = CurPtr;
while (isxdigit(CurPtr[0]))
++CurPtr;
@@ -342,42 +340,41 @@ int TGLexer::LexNumber() {
if (CurPtr == NumStart)
return ReturnError(CurPtr-2, "Invalid hexadecimal number");
- Filelval.IntVal = strtoll(NumStart, 0, 16);
-
- return INTVAL;
+ CurIntVal = strtoll(NumStart, 0, 16);
+ return tgtok::IntVal;
} else if (CurPtr[0] == 'b') {
++CurPtr;
- NumStart = CurPtr;
+ const char *NumStart = CurPtr;
while (CurPtr[0] == '0' || CurPtr[0] == '1')
++CurPtr;
// Requires at least one binary digit.
if (CurPtr == NumStart)
return ReturnError(CurPtr-2, "Invalid binary number");
-
- Filelval.IntVal = strtoll(NumStart, 0, 2);
- return INTVAL;
+ CurIntVal = strtoll(NumStart, 0, 2);
+ return tgtok::IntVal;
}
}
// Check for a sign without a digit.
- if (CurPtr[-1] == '-' || CurPtr[-1] == '+') {
- if (!isdigit(CurPtr[0]))
- return CurPtr[-1];
+ if (!isdigit(CurPtr[0])) {
+ if (CurPtr[-1] == '-')
+ return tgtok::minus;
+ else if (CurPtr[-1] == '+')
+ return tgtok::plus;
}
while (isdigit(CurPtr[0]))
++CurPtr;
-
- Filelval.IntVal = strtoll(NumStart, 0, 10);
- return INTVAL;
+ CurIntVal = strtoll(TokStart, 0, 10);
+ return tgtok::IntVal;
}
/// LexBracket - We just read '['. If this is a code block, return it,
/// otherwise return the bracket. Match: '[' and '[{ ( [^}]+ | }[^]] )* }]'
-int TGLexer::LexBracket() {
+tgtok::TokKind TGLexer::LexBracket() {
if (CurPtr[0] != '{')
- return '[';
+ return tgtok::l_square;
++CurPtr;
const char *CodeStart = CurPtr;
while (1) {
@@ -389,8 +386,8 @@ int TGLexer::LexBracket() {
Char = getNextChar();
if (Char == EOF) break;
if (Char == ']') {
- Filelval.StrVal = new std::string(CodeStart, CurPtr-2);
- return CODEFRAGMENT;
+ CurStrVal.assign(CodeStart, CurPtr-2);
+ return tgtok::CodeFragment;
}
}
@@ -398,9 +395,9 @@ int TGLexer::LexBracket() {
}
/// LexExclaim - Lex '!' and '![a-zA-Z]+'.
-int TGLexer::LexExclaim() {
+tgtok::TokKind TGLexer::LexExclaim() {
if (!isalpha(*CurPtr))
- return '!';
+ return ReturnError(CurPtr-1, "Invalid \"!operator\"");
const char *Start = CurPtr++;
while (isalpha(*CurPtr))
@@ -409,61 +406,12 @@ int TGLexer::LexExclaim() {
// Check to see which operator this is.
unsigned Len = CurPtr-Start;
- if (Len == 3 && !memcmp(Start, "con", 3)) return CONCATTOK;
- if (Len == 3 && !memcmp(Start, "sra", 3)) return SRATOK;
- if (Len == 3 && !memcmp(Start, "srl", 3)) return SRLTOK;
- if (Len == 3 && !memcmp(Start, "shl", 3)) return SHLTOK;
- if (Len == 9 && !memcmp(Start, "strconcat", 9)) return STRCONCATTOK;
+ if (Len == 3 && !memcmp(Start, "con", 3)) return tgtok::XConcat;
+ if (Len == 3 && !memcmp(Start, "sra", 3)) return tgtok::XSRA;
+ if (Len == 3 && !memcmp(Start, "srl", 3)) return tgtok::XSRL;
+ if (Len == 3 && !memcmp(Start, "shl", 3)) return tgtok::XSHL;
+ if (Len == 9 && !memcmp(Start, "strconcat", 9)) return tgtok::XStrConcat;
return ReturnError(Start-1, "Unknown operator");
}
-//===----------------------------------------------------------------------===//
-// Interfaces used by the Bison parser.
-//===----------------------------------------------------------------------===//
-
-int Fileparse();
-static TGLexer *TheLexer;
-
-namespace llvm {
-
-std::ostream &err() {
- return TheLexer->err();
-}
-
-/// ParseFile - this function begins the parsing of the specified tablegen
-/// file.
-///
-void ParseFile(const std::string &Filename,
- const std::vector<std::string> &IncludeDirs) {
- std::string ErrorStr;
- MemoryBuffer *F = MemoryBuffer::getFileOrSTDIN(&Filename[0], Filename.size(),
- &ErrorStr);
- if (F == 0) {
- cerr << "Could not open input file '" + Filename + "': " << ErrorStr <<"\n";
- exit(1);
- }
-
- assert(!TheLexer && "Lexer isn't reentrant yet!");
- TheLexer = new TGLexer(F);
-
- // Record the location of the include directory so that the lexer can find
- // it later.
- TheLexer->setIncludeDirs(IncludeDirs);
-
- Fileparse();
-
- // Cleanup
- delete TheLexer;
- TheLexer = 0;
-}
-} // End llvm namespace
-
-
-int Filelex() {
- assert(TheLexer && "No lexer setup yet!");
- int Tok = TheLexer->LexToken();
- if (Tok == YYERROR)
- exit(1);
- return Tok;
-}
diff --git a/utils/TableGen/TGLexer.h b/utils/TableGen/TGLexer.h
index ef786b6f28..9f1b535cd4 100644
--- a/utils/TableGen/TGLexer.h
+++ b/utils/TableGen/TGLexer.h
@@ -20,12 +20,49 @@
namespace llvm {
class MemoryBuffer;
+
+namespace tgtok {
+ enum TokKind {
+ // Markers
+ Eof, Error,
+
+ // Tokens with no info.
+ minus, plus, // - +
+ l_square, r_square, // [ ]
+ l_brace, r_brace, // { }
+ l_paren, r_paren, // ( )
+ less, greater, // < >
+ colon, semi, // ; :
+ comma, period, // , .
+ equal, question, // = ?
+
+ // Keywords.
+ Bit, Bits, Class, Code, Dag, Def, Defm, Field, In, Int, Let, List,
+ MultiClass, String,
+
+ // !keywords.
+ XConcat, XSRA, XSRL, XSHL, XStrConcat,
+
+ // Integer value.
+ IntVal,
+
+ // String valued tokens.
+ Id, StrVal, VarName, CodeFragment
+ };
+}
+/// TGLexer - TableGen Lexer class.
class TGLexer {
const char *CurPtr;
unsigned CurLineNo;
MemoryBuffer *CurBuf;
+ // Information about the current token.
+ const char *TokStart;
+ tgtok::TokKind CurCode;
+ std::string CurStrVal; // This is valid for ID, STRVAL, VARNAME, CODEFRAGMENT
+ int CurIntVal; // This is valid for INTVAL.
+
/// IncludeRec / IncludeStack - This captures the current set of include
/// directives we are nested within.
struct IncludeRec {
@@ -40,7 +77,6 @@ class TGLexer {
// IncludeDirectories - This is the list of directories we should search for
// include files in.
std::vector<std::string> IncludeDirectories;
- const char *TokStart;
public:
TGLexer(MemoryBuffer *StartBuf);
~TGLexer();
@@ -49,29 +85,46 @@ public:
IncludeDirectories = Dirs;
}
- int LexToken();
+ tgtok::TokKind Lex() {
+ return CurCode = LexToken();
+ }
+
+ tgtok::TokKind getCode() const { return CurCode; }
- typedef const char* LocationTy;
- LocationTy getTokenStart() const { return TokStart; }
+ const std::string &getCurStrVal() const {
+ assert((CurCode == tgtok::Id || CurCode == tgtok::StrVal ||
+ CurCode == tgtok::VarName || CurCode == tgtok::CodeFragment) &&
+ "This token doesn't have a string value");
+ return CurStrVal;
+ }
+ int getCurIntVal() const {
+ assert(CurCode == tgtok::IntVal && "This token isn't an integer");
+ return CurIntVal;
+ }
- void PrintError(LocationTy Loc, const std::string &Msg) const;
+ typedef const char* LocTy;
+ LocTy getLoc() const { return TokStart; }
+
+ void PrintError(LocTy Loc, const std::string &Msg) const;
- std::ostream &err() const;
void PrintIncludeStack(std::ostream &OS) const;
private:
- int ReturnError(const char *Loc, const std::string &Msg);
+ /// LexToken - Read the next token and return its code.
+ tgtok::TokKind LexToken();
+
+ tgtok::TokKind ReturnError(const char *Loc, const std::string &Msg);
int getNextChar();
void SkipBCPLComment();
bool SkipCComment();
- int LexIdentifier();
+ tgtok::TokKind LexIdentifier();
bool LexInclude();
- int LexString();
- int LexVarName();
- int LexNumber();
- int LexBracket();
- int LexExclaim();
+ tgtok::TokKind LexString();
+ tgtok::TokKind LexVarName();
+ tgtok::TokKind LexNumber();
+ tgtok::TokKind LexBracket();
+ tgtok::TokKind LexExclaim();
};
} // end namespace llvm
diff --git a/utils/TableGen/TGParser.cpp b/utils/TableGen/TGParser.cpp
new file mode 100644
index 0000000000..d6515e8b38
--- /dev/null
+++ b/utils/TableGen/TGParser.cpp
@@ -0,0 +1,1372 @@
+//===- TGParser.cpp - Parser for TableGen Files ---------------------------===//
+//
+// The LLVM Compiler Infrastructure
+//
+// This file was developed by Chris Lattner and is distributed under
+// the University of Illinois Open Source License. See LICENSE.TXT for details.
+//
+//===----------------------------------------------------------------------===//
+//
+// Implement the Parser for TableGen.
+//
+//===----------------------------------------------------------------------===//
+
+#include "TGParser.h"
+#include "Record.h"
+#include "llvm/ADT/StringExtras.h"
+using namespace llvm;
+
+//===----------------------------------------------------------------------===//
+// Support Code for the Semantic Actions.
+//===----------------------------------------------------------------------===//
+
+namespace llvm {
+struct MultiClass {
+ Record Rec; // Placeholder for template args and Name.
+ std::vector<Record*> DefPrototypes;
+
+ MultiClass(const std::string &Name) : Rec(Name) {}
+};
+
+struct SubClassReference {
+ TGParser::LocTy RefLoc;
+ Record *Rec;
+ std::vector<Init*> TemplateArgs;
+ SubClassReference() : RefLoc(0), Rec(0) {}
+
+ bool isInvalid() const { return Rec == 0; }
+};
+
+} // end namespace llvm
+
+bool TGParser::AddValue(Record *CurRec, LocTy Loc, const RecordVal &RV) {
+ if (CurRec == 0)
+ CurRec = &CurMultiClass->Rec;
+
+ if (RecordVal *ERV = CurRec->getValue(RV.getName())) {
+ // The value already exists in the class, treat this as a set.
+ if (ERV->setValue(RV.getValue()))
+ return Error(Loc, "New definition of '" + RV.getName() + "' of type '" +
+ RV.getType()->getAsString() + "' is incompatible with " +
+ "previous definition of type '" +
+ ERV->getType()->getAsString() + "'");
+ } else {
+ CurRec->addValue(RV);
+ }
+ return false;
+}
+
+/// SetValue -
+/// Return true on error, false on success.
+bool TGParser::SetValue(Record *CurRec, LocTy Loc, const std::string &ValName,
+ const std::vector<unsigned> &BitList, Init *V) {
+ if (!V) return false;
+
+ if (CurRec == 0) CurRec = &CurMultiClass->Rec;
+
+ RecordVal *RV = CurRec->getValue(ValName);
+ if (RV == 0)
+ return Error(Loc, "Value '" + ValName + "' unknown!");
+
+ // Do not allow assignments like 'X = X'. This will just cause infinite loops
+ // in the resolution machinery.
+ if (BitList.empty())
+ if (VarInit *VI = dynamic_cast<VarInit*>(V))
+ if (VI->getName() == ValName)
+ return false;
+
+ // If we are assigning to a subset of the bits in the value... then we must be
+ // assigning to a field of BitsRecTy, which must have a BitsInit
+ // initializer.
+ //
+ if (!BitList.empty()) {
+ BitsInit *CurVal = dynamic_cast<BitsInit*>(RV->getValue());
+ if (CurVal == 0)
+ return Error(Loc, "Value '" + ValName + "' is not a bits type");
+
+ // Convert the incoming value to a bits type of the appropriate size...
+ Init *BI = V->convertInitializerTo(new BitsRecTy(BitList.size()));
+ if (BI == 0) {
+ V->convertInitializerTo(new BitsRecTy(BitList.size()));
+ return Error(Loc, "Initializer is not compatible with bit range");
+ }
+
+ // We should have a BitsInit type now.
+ BitsInit *BInit = dynamic_cast<BitsInit*>(BI);
+ assert(BInit != 0);
+
+ BitsInit *NewVal = new BitsInit(CurVal->getNumBits());
+
+ // Loop over bits, assigning values as appropriate.
+ for (unsigned i = 0, e = BitList.size(); i != e; ++i) {
+ unsigned Bit = BitList[i];
+ if (NewVal->getBit(Bit))
+ return Error(Loc, "Cannot set bit #" + utostr(Bit) + " of value '" +
+ ValName + "' more than once");
+ NewVal->setBit(Bit, BInit->getBit(i));
+ }
+
+ for (unsigned i = 0, e = CurVal->getNumBits(); i != e; ++i)
+ if (NewVal->getBit(i) == 0)
+ NewVal->setBit(i, CurVal->getBit(i));
+
+ V = NewVal;
+ }
+
+ if (RV->setValue(V))
+ return Error(Loc, "Value '" + ValName + "' of type '" +
+ RV->getType()->getAsString() +
+ "' is incompatible with initializer ''"); // FIXME: Add init!
+ return false;
+}
+
+/// AddSubClass - Add SubClass as a subclass to CurRec, resolving its template
+/// args as SubClass's template arguments.
+bool TGParser::AddSubClass(Record *CurRec, class SubClassReference &SubClass) {
+ Record *SC = SubClass.Rec;
+ // Add all of the values in the subclass into the current class.
+ const std::vector<RecordVal> &Vals = SC->getValues();
+ for (unsigned i = 0, e = Vals.size(); i != e; ++i)
+ if (AddValue(CurRec, SubClass.RefLoc, Vals[i]))
+ return true;
+
+ const std::vector<std::string> &TArgs = SC->getTemplateArgs();
+
+ // Ensure that an appropriate number of template arguments are specified.
+ if (TArgs.size() < SubClass.TemplateArgs.size())
+ return Error(SubClass.RefLoc, "More template args specified than expected");
+
+ // Loop over all of the template arguments, setting them to the specified
+ // value or leaving them as the default if necessary.
+ for (unsigned i = 0, e = TArgs.size(); i != e; ++i) {
+ if (i < SubClass.TemplateArgs.size()) {
+ // If a value is specified for this template arg, set it now.
+ if (SetValue(CurRec, SubClass.RefLoc, TArgs[i], std::vector<unsigned>(),
+ SubClass.TemplateArgs[i]))
+ return true;
+
+ // Resolve it next.
+ CurRec->resolveReferencesTo(CurRec->getValue(TArgs[i]));
+
+ // Now remove it.
+ CurRec->removeValue(TArgs[i]);
+
+ } else if (!CurRec->getValue(TArgs[i])->getValue()->isComplete()) {
+ return Error(SubClass.RefLoc,"Value not specified for template argument #"
+ + utostr(i) + " (" + TArgs[i] + ") of subclass '" +
+ SC->getName() + "'!");
+ }
+ }
+
+ // Since everything went well, we can now set the "superclass" list for the
+ // current record.
+ const std::vector<Record*> &SCs = SC->getSuperClasses();
+ for (unsigned i = 0, e = SCs.size(); i != e; ++i) {
+ if (CurRec->isSubClassOf(SCs[i]))
+ return Error(SubClass.RefLoc,
+ "Already subclass of '" + SCs[i]->getName() + "'!\n");
+ CurRec->addSuperClass(SCs[i]);
+ }
+
+ if (CurRec->isSubClassOf(SC))
+ return Error(SubClass.RefLoc,
+ "Already subclass of '" + SC->getName() + "'!\n");
+ CurRec->addSuperClass(SC);
+ return false;
+}
+
+//===----------------------------------------------------------------------===//
+// Parser Code
+//===----------------------------------------------------------------------===//
+
+/// isObjectStart - Return true if this is a valid first token for an Object.
+static bool isObjectStart(tgtok::TokKind K) {
+ return K == tgtok::Class || K == tgtok::Def ||
+ K == tgtok::Defm || K == tgtok::Let || K == tgtok::MultiClass;
+}
+
+/// ParseObjectName - If an object name is specified, return it. Otherwise,
+/// return an anonymous name.
+/// ObjectName ::= ID
+/// ObjectName ::= /*empty*/
+///
+std::string TGParser::ParseObjectName() {
+ if (Lex.getCode() == tgtok::Id) {
+ std::string Ret = Lex.getCurStrVal();
+ Lex.Lex();
+ return Ret;
+ }
+
+ static unsigned AnonCounter = 0;
+ return "anonymous."+utostr(AnonCounter++);
+}
+
+
+/// ParseClassID - Parse and resolve a reference to a class name. This returns
+/// null on error.
+///
+/// ClassID ::= ID
+///
+Record *TGParser::ParseClassID() {
+ if (Lex.getCode() != tgtok::Id) {
+ TokError("expected name for ClassID");
+ return 0;
+ }
+
+ Record *Result = Records.getClass(Lex.getCurStrVal());
+ if (Result == 0)
+ TokError("Couldn't find class '" + Lex.getCurStrVal() + "'");
+
+ Lex.Lex();
+ return Result;
+}
+
+Record *TGParser::ParseDefmID() {
+ if (Lex.getCode() != tgtok::Id) {
+ TokError("expected multiclass name");
+ return 0;
+ }
+
+ MultiClass *MC = MultiClasses[Lex.getCurStrVal()];
+ if (MC == 0) {
+ TokError("Couldn't find multiclass '" + Lex.getCurStrVal() + "'");
+ return 0;
+ }
+
+ Lex.Lex();
+ return &MC->Rec;
+}
+
+
+
+/// ParseSubClassReference - Parse a reference to a subclass or to a templated
+/// subclass. This returns a SubClassRefTy with a null Record* on error.
+///
+/// SubClassRef ::= ClassID
+/// SubClassRef ::= ClassID '<' ValueList '>'
+///
+SubClassReference TGParser::
+ParseSubClassReference(Record *CurRec, bool isDefm) {
+ SubClassReference Result;
+ Result.RefLoc = Lex.getLoc();
+
+ if (isDefm)
+ Result.Rec = ParseDefmID();
+ else
+ Result.Rec = ParseClassID();
+ if (Result.Rec == 0) return Result;
+
+ // If there is no template arg list, we're done.
+ if (Lex.getCode() != tgtok::less)
+ return Result;
+ Lex.Lex(); // Eat the '<'
+
+ if (Lex.getCode() == tgtok::greater) {
+ TokError("subclass reference requires a non-empty list of template values");
+ Result.Rec = 0;
+ return Result;
+ }
+
+ Result.TemplateArgs = ParseValueList(CurRec);
+ if (Result.TemplateArgs.empty()) {
+ Result.Rec = 0; // Error parsing value list.
+ return Result;
+ }
+
+ if (Lex.getCode() != tgtok::greater) {
+ TokError("expected '>' in template value list");
+ Result.Rec = 0;
+ return Result;
+ }
+ Lex.Lex();
+
+ return Result;
+}
+
+/// ParseRangePiece - Parse a bit/value range.
+/// RangePiece ::= INTVAL
+/// RangePiece ::= INTVAL '-' INTVAL
+/// RangePiece ::= INTVAL INTVAL
+bool TGParser::ParseRangePiece(std::vector<unsigned> &Ranges) {
+ assert(Lex.getCode() == tgtok::IntVal && "Invalid range");
+ int Start = Lex.getCurIntVal();
+ int End;
+
+ if (Start < 0)
+ return TokError("invalid range, cannot be negative");
+
+ switch (Lex.Lex()) { // eat first character.
+ default:
+ Ranges.push_back(Start);
+ return false;
+ case tgtok::minus:
+ if (Lex.Lex() != tgtok::IntVal) {
+ TokError("expected integer value as end of range");
+ return true;
+ }
+ End = Lex.getCurIntVal();
+ break;
+ case tgtok::IntVal:
+ End = -Lex.getCurIntVal();
+ break;
+ }
+ if (End < 0)
+ return TokError("invalid range, cannot be negative");
+ Lex.Lex();
+
+ // Add to the range.
+ if (Start < End) {
+ for (; Start <= End; ++Start)
+ Ranges.push_back(Start);
+ } else {
+ for (; Start >= End; --Start)
+ Ranges.push_back(Start);
+ }
+ return false;
+}
+
+/// ParseRangeList - Parse a list of scalars and ranges into scalar values.
+///
+/// RangeList ::= RangePiece (',' RangePiece)*
+///
+std::vector<unsigned> TGParser::ParseRangeList() {
+ std::vector<unsigned> Result;
+
+ // Parse the first piece.
+ if (ParseRangePiece(Result))
+ return std::vector<unsigned>();
+ while (Lex.getCode() == tgtok::comma) {
+ Lex.Lex(); // Eat the comma.
+
+ // Parse the next range piece.
+ if (ParseRangePiece(Result))
+ return std::vector<unsigned>();
+ }
+ return Result;
+}
+
+/// ParseOptionalRangeList - Parse either a range list in <>'s or nothing.
+/// OptionalRangeList ::= '<' RangeList '>'
+/// OptionalRangeList ::= /*empty*/
+bool TGParser::ParseOptionalRangeList(std::vector<unsigned> &Ranges) {
+ if (Lex.getCode() != tgtok::less)
+ return false;
+
+ LocTy StartLoc = Lex.getLoc();
+ Lex.Lex(); // eat the '<'
+
+ // Parse the range list.
+ Ranges = ParseRangeList();
+ if (Ranges.empty()) return true;
+
+ if (Lex.getCode() != tgtok::greater) {
+ TokError("expected '>' at end of range list");
+ return Error(StartLoc, "to match this '<'");
+ }
+ Lex.Lex(); // eat the '>'.
+ return false;
+}
+
+/// ParseOptionalBitList - Parse either a bit list in {}'s or nothing.
+/// OptionalBitList ::= '{' RangeList '}'
+/// OptionalBitList ::= /*empty*/
+bool TGParser::ParseOptionalBitList(std::vector<unsigned> &Ranges) {
+ if (Lex.getCode() != tgtok::l_brace)
+ return false;
+
+ LocTy StartLoc = Lex.getLoc();
+ Lex.Lex(); // eat the '{'
+
+ // Parse the range list.
+ Ranges = ParseRangeList();
+ if (Ranges.empty()) return true;
+
+ if (Lex.getCode() != tgtok::r_brace) {
+ TokError("expected '}' at end of bit list");
+ return Error(StartLoc, "to match this '{'");
+ }
+ Lex.Lex(); // eat the '}'.
+ return false;
+}
+
+
+/// ParseType - Parse and return a tblgen type. This returns null on error.
+///
+/// Type ::= STRING // string type
+/// Type ::= BIT // bit type
+/// Type ::= BITS '<' INTVAL '>' // bits<x> type
+/// Type ::= INT // int type
+/// Type ::= LIST '<' Type '>' // list<x> type
+/// Type ::= CODE // code type
+/// Type ::= DAG // dag type
+/// Type ::= ClassID // Record Type
+///
+RecTy *TGParser::ParseType() {
+ switch (Lex.getCode()) {
+ default: TokError("Unknown token when expecting a type"); return 0;
+ case tgtok::String: Lex.Lex(); return new StringRecTy();
+ case tgtok::Bit: Lex.Lex(); return new BitRecTy();
+ case tgtok::Int: Lex.Lex(); return new IntRecTy();
+ case tgtok::Code: Lex.Lex(); return new CodeRecTy();
+ case tgtok::Dag: Lex.Lex(); return new DagRecTy();
+ case tgtok::Id:
+ if (Record *R = ParseClassID()) return new RecordRecTy(R);
+ return 0;
+ case tgtok::Bits: {
+ if (Lex.Lex() != tgtok::less) { // Eat 'bits'
+ TokError("expected '<' after bits type");
+ return 0;
+ }
+ if (Lex.Lex() != tgtok::IntVal) { // Eat '<'
+ TokError("expected integer in bits<n> type");
+ return 0;
+ }
+ unsigned Val = Lex.getCurIntVal();
+ if (Lex.Lex() != tgtok::greater) { // Eat count.
+ TokError("expected '>' at end of bits<n> type");
+ return 0;
+ }
+ Lex.Lex(); // Eat '>'
+ return new BitsRecTy(Val);
+ }
+ case tgtok::List: {
+ if (Lex.Lex() != tgtok::less) { // Eat 'bits'
+ TokError("expected '<' after list type");
+ return 0;
+ }
+ Lex.Lex(); // Eat '<'
+ RecTy *SubType = ParseType();
+ if (SubType == 0) return 0;
+
+ if (Lex.getCode() != tgtok::greater) {
+ TokError("expected '>' at end of list<ty> type");
+ return 0;
+ }
+ Lex.Lex(); // Eat '>'
+ return new ListRecTy(SubType);
+ }
+ }
+}
+
+/// ParseIDValue - Parse an ID as a value and decode what it means.
+///
+/// IDValue ::= ID [def local value]
+/// IDValue ::= ID [def template arg]
+/// IDValue ::= ID [multiclass local value]
+/// IDValue ::= ID [multiclass template argument]
+/// IDValue ::= ID [def name]
+///
+Init *TGParser::ParseIDValue(Record *CurRec) {
+ assert(Lex.getCode() == tgtok::Id && "Expected ID in ParseIDValue");
+ std::string Name = Lex.getCurStrVal();
+ LocTy Loc = Lex.getLoc();
+ Lex.Lex();
+ return ParseIDValue(CurRec, Name, Loc);
+}
+
+/// ParseIDValue - This is just like ParseIDValue above, but it assumes the ID
+/// has already been read.
+Init *TGParser::ParseIDValue(Record *CurRec,
+ const std::string &Name, LocTy NameLoc) {
+ if (CurRec) {
+ if (const RecordVal *RV = CurRec->getValue(Name))
+ return new VarInit(Name, RV->getType());
+
+ std::string TemplateArgName = CurRec->getName()+":"+Name;
+ if (CurRec->isTemplateArg(TemplateArgName)) {
+ const RecordVal *RV = CurRec->getValue(TemplateArgName);
+ assert(RV && "Template arg doesn't exist??");
+ return new VarInit(TemplateArgName, RV->getType());
+ }
+ }
+
+ if (CurMultiClass) {
+ std::string MCName = CurMultiClass->Rec.getName()+"::"+Name;
+ if (CurMultiClass->Rec.isTemplateArg(MCName)) {
+ const RecordVal *RV = CurMultiClass->Rec.getValue(MCName);
+ assert(RV && "Template arg doesn't exist??");
+ return new VarInit(MCName, RV->getType());
+ }
+ }
+
+ if (Record *D = Records.getDef(Name))
+ return new DefInit(D);
+
+ Error(NameLoc, "Variable not defined: '" + Name + "'");
+ return 0;
+}
+
+/// ParseSimpleValue - Parse a tblgen value. This returns null on error.
+///
+/// SimpleValue ::= IDValue
+/// SimpleValue ::= INTVAL
+/// SimpleValue ::= STRVAL
+/// SimpleValue ::= CODEFRAGMENT
+/// SimpleValue ::= '?'
+/// SimpleValue ::= '{' ValueList '}'
+/// SimpleValue ::= ID '<' ValueListNE '>'
+/// SimpleValue ::= '[' ValueList ']'
+/// SimpleValue ::= '(' IDValue DagArgList ')'
+/// SimpleValue ::= CONCATTOK '(' Value ',' Value ')'
+/// SimpleValue ::= SHLTOK '(' Value ',' Value ')'
+/// SimpleValue ::= SRATOK '(' Value ',' Value ')'
+/// SimpleValue ::= SRLTOK '(' Value ',' Value ')'
+/// SimpleValue ::= STRCONCATTOK '(' Value ',' Value ')'
+///
+Init *TGParser::ParseSimpleValue(Record *CurRec) {
+ Init *R = 0;
+ switch (Lex.getCode()) {
+ default: TokError("Unknown token when parsing a value"); break;
+ case tgtok::IntVal: R = new IntInit(Lex.getCurIntVal()); Lex.Lex(); break;
+ case tgtok::StrVal: R = new StringInit(Lex.getCurStrVal()); Lex.Lex(); break;
+ case tgtok::CodeFragment:
+ R = new CodeInit(Lex.getCurStrVal()); Lex.Lex(); break;
+ case tgtok::question: R = new UnsetInit(); Lex.Lex(); break;
+ case tgtok::Id: {
+ LocTy NameLoc = Lex.getLoc();
+ std::string Name = Lex.getCurStrVal();
+ if (Lex.Lex() != tgtok::less) // consume the Id.
+ return ParseIDValue(CurRec, Name, NameLoc); // Value ::= IDValue
+
+ // Value ::= ID '<' ValueListNE '>'
+ if (Lex.Lex() == tgtok::greater) {
+ TokError("expected non-empty value list");
+ return 0;
+ }
+ std::vector<Init*> ValueList = ParseValueList(CurRec);
+ if (ValueList.empty()) return 0;
+
+ if (Lex.getCode() != tgtok::greater) {
+ TokError("expected '>' at end of value list");
+ return 0;
+ }
+ Lex.Lex(); // eat the '>'
+
+ // This is a CLASS<initvalslist> expression. This is supposed to synthesize
+ // a new anonymous definition, deriving from CLASS<initvalslist> with no
+ // body.
+ Record *Class = Records.getClass(Name);
+ if (!Class) {
+ Error(NameLoc, "Expected a class name, got '" + Name + "'");
+ return 0;
+ }
+
+ // Create the new record, set it as CurRec temporarily.
+ static unsigned AnonCounter = 0;
+ Record *NewRec = new Record("anonymous.val."+utostr(AnonCounter++));
+ SubClassReference SCRef;
+ SCRef.RefLoc = NameLoc;
+ SCRef.Rec = Class;
+ SCRef.TemplateArgs = ValueList;
+ // Add info about the subclass to NewRec.
+ if (AddSubClass(NewRec, SCRef))
+ return 0;
+ NewRec->resolveReferences();
+ Records.addDef(NewRec);
+
+ // The result of the expression is a reference to the new record.
+ return new DefInit(NewRec);
+ }
+ case tgtok::l_brace: { // Value ::= '{' ValueList '}'
+ LocTy BraceLoc = Lex.getLoc();
+ Lex.Lex(); // eat the '{'
+ std::vector<Init*> Vals;
+
+ if (Lex.getCode() != tgtok::r_brace) {
+ Vals = ParseValueList(CurRec);
+ if (Vals.empty()) return 0;
+ }
+ if (Lex.getCode() != tgtok::r_brace) {
+ TokError("expected '}' at end of bit list value");
+ return 0;
+ }
+ Lex.Lex(); // eat the '}'
+
+ BitsInit *Result = new BitsInit(Vals.size());
+ for (unsigned i = 0, e = Vals.size(); i != e; ++i) {
+ Init *Bit = Vals[i]->convertInitializerTo(new BitRecTy());
+ if (Bit == 0) {
+ // FIXME: Include value in error.
+ Error(BraceLoc, "Element #" + utostr(i) + " ("/* << *Vals[i]
+ <<*/ ") is not convertable to a bit");
+ return 0;
+ }
+ Result->setBit(Vals.size()-i-1, Bit);
+ }
+ return Result;
+ }
+ case tgtok::l_square: { // Value ::= '[' ValueList ']'
+ Lex.Lex(); // eat the '['
+ std::vector<Init*> Vals;
+
+ if (Lex.getCode() != tgtok::r_square) {
+ Vals = ParseValueList(CurRec);
+ if (Vals.empty()) return 0;
+ }
+ if (Lex.getCode() != tgtok::r_square) {
+ TokError("expected ']' at end of list value");
+ return 0;
+ }
+ Lex.Lex(); // eat the ']'
+ return new ListInit(Vals);
+ }
+ case tgtok::l_paren: { // Value ::= '(' IDValue DagArgList ')'
+ Lex.Lex(); // eat the '('
+ Init *Operator = ParseIDValue(CurRec);
+ if (Operator == 0) return 0;
+
+ std::vector<std::pair<llvm::Init*, std::string> > DagArgs;
+ if (Lex.getCode() != tgtok::r_paren) {
+ DagArgs = ParseDagArgList(CurRec);
+ if (DagArgs.empty()) return 0;
+ }
+
+ if (Lex.getCode() != tgtok::r_paren) {
+ TokError("expected ')' in dag init");
+ return 0;
+ }
+ Lex.Lex(); // eat the ')'
+
+ return new DagInit(Operator, DagArgs);
+ }
+ case tgtok::XConcat:
+ case tgtok::XSRA:
+ case tgtok::XSRL:
+ case tgtok::XSHL:
+ case tgtok::XStrConcat: { // Value ::= !binop '(' Value ',' Value ')'
+ BinOpInit::BinaryOp Code;
+ switch (Lex.getCode()) {
+ default: assert(0 && "Unhandled code!");
+ case tgtok::XConcat: Code = BinOpInit::CONCAT; break;
+ case tgtok::XSRA: Code = BinOpInit::SRA; break;
+ case tgtok::XSRL: Code = BinOpInit::SRL; break;
+ case tgtok::XSHL: Code = BinOpInit::SHL; break;
+ case tgtok::XStrConcat: Code = BinOpInit::STRCONCAT; break;
+ }
+ Lex.Lex(); // eat the operation
+ if (Lex.getCode() != tgtok::l_paren) {
+ TokError("expected '(' after binary operator");
+ return 0;
+ }
+ Lex.Lex(); // eat the '('
+
+ Init *LHS = ParseValue(CurRec);
+ if (LHS == 0) return 0;
+
+ if (Lex.getCode() != tgtok::comma) {
+ TokError("expected ',' in binary operator");
+ return 0;
+ }
+ Lex.Lex(); // eat the ','
+
+ Init *RHS = ParseValue(CurRec);
+ if (RHS == 0) return 0;
+
+ if (Lex.getCode() != tgtok::r_paren) {
+ TokError("expected ')' in binary operator");
+ return 0;
+ }
+ Lex.Lex(); // eat the ')'
+ return (new BinOpInit(Code, LHS, RHS))->Fold();
+ }
+ }
+
+ return R;
+}
+
+/// ParseValue - Parse a tblgen value. This returns null on error.
+///
+/// Value ::= SimpleValue ValueSuffix*
+/// ValueSuffix ::= '{' BitList '}'
+/// ValueSuffix ::= '[' BitList ']'
+/// ValueSuffix ::= '.' ID
+///
+Init *TGParser::ParseValue(Record *CurRec) {
+ Init *Result = ParseSimpleValue(CurRec);
+ if (Result == 0) return 0;
+
+ // Parse the suffixes now if present.
+ while (1) {
+ switch (Lex.getCode()) {
+ default: return Result;
+ case tgtok::l_brace: {
+ LocTy CurlyLoc = Lex.getLoc();
+ Lex.Lex(); // eat the '{'
+ std::vector<unsigned> Ranges = ParseRangeList();
+ if (Ranges.empty()) return 0;
+
+ // Reverse the bitlist.
+ std::reverse(Ranges.begin(), Ranges.end());
+ Result = Result->convertInitializerBitRange(Ranges);
+ if (Result == 0) {
+ Error(CurlyLoc, "Invalid bit range for value");
+ return 0;
+ }
+
+ // Eat the '}'.
+ if (Lex.getCode() != tgtok::r_brace) {
+ TokError("expected '}' at end of bit range list");
+ return 0;
+ }
+ Lex.Lex();
+ break;
+ }
+ case tgtok::l_square: {
+ LocTy SquareLoc = Lex.getLoc();
+ Lex.Lex(); // eat the '['
+ std::vector<unsigned> Ranges = ParseRangeList();
+ if (Ranges.empty()) return 0;
+
+ Result = Result->convertInitListSlice(Ranges);
+ if (Result == 0) {
+ Error(SquareLoc, "Invalid range for list slice");
+ return 0;
+ }
+
+ // Eat the ']'.
+ if (Lex.getCode() != tgtok::r_square) {
+ TokError("expected ']' at end of list slice");
+ return 0;
+ }
+ Lex.Lex();
+ break;
+ }
+ case tgtok::period:
+ if (Lex.Lex() != tgtok::Id) { // eat the .
+ TokError("expected field identifier after '.'");
+ return 0;
+ }
+ if (!Result->getFieldType(Lex.getCurStrVal())) {
+ // FIXME INCLUDE VALUE IN ERROR.
+ TokError("Cannot access field '" + Lex.getCurStrVal() + "' of value '" +
+ /*<< *$1 <<*/ "'");
+ return 0;
+ }
+ Result = new FieldInit(Result, Lex.getCurStrVal());
+ Lex.Lex(); // eat field name
+ break;
+ }
+ }
+}
+
+/// ParseDagArgList - Parse the argument list for a dag literal expression.
+///
+/// ParseDagArgList ::= Value (':' VARNAME)?
+/// ParseDagArgList ::= ParseDagArgList ',' Value (':' VARNAME)?
+std::vector<std::pair<llvm::Init*, std::string> >
+TGParser::ParseDagArgList(Record *CurRec) {
+ std::vector<std::pair<llvm::Init*, std::string> > Result;
+
+ while (1) {
+ Init *Val = ParseValue(CurRec);
+ if (Val == 0) return std::vector<std::pair<llvm::Init*, std::string> >();
+
+ // If the variable name is present, add it.
+ std::string VarName;
+ if (Lex.getCode() == tgtok::colon) {
+ if (Lex.Lex() != tgtok::VarName) { // eat the ':'
+ TokError("expected variable name in dag literal");
+ return std::vector<std::pair<llvm::Init*, std::string> >();
+ }
+ VarName = Lex.getCurStrVal();
+ Lex.Lex(); // eat the VarName.
+ }
+
+ Result.push_back(std::make_pair(Val, VarName));
+
+ if (Lex.getCode() != tgtok::comma) break;
+ Lex.Lex(); // eat the ','
+ }
+
+ return Result;
+}
+
+
+/// ParseValueList - Parse a comma separated list of values, returning them as a
+/// vector. Note that this always expects to be able to parse at least one
+/// value. It returns an empty list if this is not possible.
+///
+/// ValueList ::= Value (',' Value)
+///
+std::vector<Init*> TGParser::ParseValueList(Record *CurRec) {
+ std::vector<Init*> Result;
+ Result.push_back(ParseValue(CurRec));
+ if (Result.back() == 0) return std::vector<Init*>();
+
+ while (Lex.getCode() == tgtok::comma) {
+ Lex.Lex(); // Eat the comma
+
+ Result.push_back(ParseValue(CurRec));
+ if (Result.back() == 0) return std::vector<Init*>();
+ }
+
+ return Result;
+}
+
+
+
+/// ParseDeclaration - Read a declaration, returning the name of field ID, or an
+/// empty string on error. This can happen in a number of different context's,
+/// including within a def or in the template args for a def (which which case
+/// CurRec will be non-null) and within the template args for a multiclass (in
+/// which case CurRec will be null, but CurMultiClass will be set). This can
+/// also happen within a def that is within a multiclass, which will set both
+/// CurRec and CurMultiClass.
+///
+/// Declaration ::= FIELD? Type ID ('=' Value)?
+///
+std::string TGParser::ParseDeclaration(Record *CurRec,
+ bool ParsingTemplateArgs) {
+ // Read the field prefix if present.
+ bool HasField = Lex.getCode() == tgtok::Field;
+ if (HasField) Lex.Lex();
+
+ RecTy *Type = ParseType();
+ if (Type == 0) return "";
+
+ if (Lex.getCode() != tgtok::Id) {
+ TokError("Expected identifier in declaration");
+ return "";
+ }
+
+ LocTy IdLoc = Lex.getLoc();
+ std::string DeclName = Lex.getCurStrVal();
+ Lex.Lex();
+
+ if (ParsingTemplateArgs) {
+ if (CurRec) {
+ DeclName = CurRec->getName() + ":" + DeclName;
+ } else {
+ assert(CurMultiClass);
+ }
+ if (CurMultiClass)
+ DeclName = CurMultiClass->Rec.getName() + "::" + DeclName;
+ }
+
+ // Add the value.
+ if (AddValue(CurRec, IdLoc, RecordVal(DeclName, Type, HasField)))
+ return "";
+
+ // If a value is present, parse it.
+ if (Lex.getCode() == tgtok::equal) {
+ Lex.Lex();
+ LocTy ValLoc = Lex.getLoc();
+ Init *Val = ParseValue(CurRec);
+ if (Val == 0 ||
+ SetValue(CurRec, ValLoc, DeclName, std::vector<unsigned>(), Val))
+ return "";
+ }
+
+ return DeclName;
+}
+
+/// ParseTemplateArgList - Read a template argument list, which is a non-empty
+/// sequence of template-declarations in <>'s. If CurRec is non-null, these are
+/// template args for a def, which may or may not be in a multiclass. If null,
+/// these are the template args for a multiclass.
+///
+/// TemplateArgList ::= '<' Declaration (',' Declaration)* '>'
+///
+bool TGParser::ParseTemplateArgList(Record *CurRec) {
+ assert(Lex.getCode() == tgtok::less && "Not a template arg list!");
+ Lex.Lex(); // eat the '<'
+
+ Record *TheRecToAddTo = CurRec ? CurRec : &CurMultiClass->Rec;
+
+ // Read the first declaration.
+ std::string TemplArg = ParseDeclaration(CurRec, true/*templateargs*/);
+ if (TemplArg.empty())
+ return true;
+
+ TheRecToAddTo->addTemplateArg(TemplArg);
+
+ while (Lex.getCode() == tgtok::comma) {
+ Lex.Lex(); // eat the ','
+
+ // Read the following declarations.
+ TemplArg = ParseDeclaration(CurRec, true/*templateargs*/);
+ if (TemplArg.empty())
+ return true;
+ TheRecToAddTo->addTemplateArg(TemplArg);
+ }
+
+ if (Lex.getCode() != tgtok::greater)
+ return TokError("expected '>' at end of template argument list");
+ Lex.Lex(); // eat the '>'.
+ return false;
+}
+
+
+/// ParseBodyItem - Parse a single item at within the body of a def or class.
+///
+/// BodyItem ::= Declaration ';'
+/// BodyItem ::= LET ID OptionalBitList '=' Value ';'
+bool TGParser::ParseBodyItem(Record *CurRec) {
+ if (Lex.getCode() != tgtok::Let) {
+ if (ParseDeclaration(CurRec, false).empty())
+ return true;
+
+ if (Lex.getCode() != tgtok::semi)
+ return TokError("expected ';' after declaration");
+ Lex.Lex();
+ return false;
+ }
+
+ // LET ID OptionalRangeList '=' Value ';'
+ if (Lex.Lex() != tgtok::Id)
+ return TokError("expected field identifier after let");
+
+ LocTy IdLoc = Lex.getLoc();
+ std::string FieldName = Lex.getCurStrVal();
+ Lex.Lex(); // eat the field name.
+
+ std::vector<unsigned> BitList;
+ if (ParseOptionalBitList(BitList))
+ return true;
+ std::reverse(BitList.begin(), BitList.end());
+
+ if (Lex.getCode() != tgtok::equal)
+ return TokError("expected '=' in let expression");
+ Lex.Lex(); // eat the '='.
+
+ Init *Val = ParseValue(CurRec);
+ if (Val == 0) return true;
+
+ if (Lex.getCode() != tgtok::semi)
+ return TokError("expected ';' after let expression");
+ Lex.Lex();
+
+ return SetValue(CurRec, IdLoc, FieldName, BitList, Val);
+}
+
+/// ParseBody - Read the body of a class or def. Return true on error, false on
+/// success.
+///
+/// Body ::= ';'
+/// Body ::= '{' BodyList '}'
+/// BodyList BodyItem*
+///
+bool TGParser::ParseBody(Record *CurRec) {
+ // If this is a null definition, just eat the semi and return.
+ if (Lex.getCode() == tgtok::semi) {
+ Lex.Lex();
+ return false;
+ }
+
+ if (Lex.getCode() != tgtok::l_brace)
+ return TokError("Expected ';' or '{' to start body");
+ // Eat the '{'.
+ Lex.Lex();
+
+ while (Lex.getCode() != tgtok::r_brace)
+ if (ParseBodyItem(CurRec))
+ return true;
+
+ // Eat the '}'.
+ Lex.Lex();
+ return false;
+}
+
+/// ParseObjectBody - Parse the body of a def or class. This consists of an
+/// optional ClassList followed by a Body. CurRec is the current def or class
+/// that is being parsed.
+///
+/// ObjectBody ::= BaseClassList Body
+/// BaseClassList ::= /*empty*/
+/// BaseClassList ::= ':' BaseClassListNE
+/// BaseClassListNE ::= SubClassRef (',' SubClassRef)*
+///
+bool TGParser::ParseObjectBody(Record *CurRec) {
+ // If there is a baseclass list, read it.
+ if (Lex.getCode() == tgtok::colon) {
+ Lex.Lex();
+
+ // Read all of the subclasses.
+ SubClassReference SubClass = ParseSubClassReference(CurRec, false);
+ while (1) {
+ // Check for error.
+ if (SubClass.Rec == 0) return true;
+
+ // Add it.
+ if (AddSubClass(CurRec, SubClass))
+ return true;
+
+ if (Lex.getCode() != tgtok::comma) break;
+ Lex.Lex(); // eat ','.
+ SubClass = ParseSubClassReference(CurRec, false);
+ }
+ }
+
+ // Process any variables on the let stack.
+ for (unsigned i = 0, e = LetStack.size(); i != e; ++i)
+ for (unsigned j = 0, e = LetStack[i].size(); j != e; ++j)
+ if (SetValue(CurRec, LetStack[i][j].Loc, LetStack[i][j].Name,
+ LetStack[i][j].Bits, LetStack[i][j].Value))
+ return true;
+
+ return ParseBody(CurRec);
+}
+
+
+/// ParseDef - Parse and return a top level or multiclass def, return the record
+/// corresponding to it. This returns null on error.
+///
+/// DefInst ::= DEF ObjectName ObjectBody
+///
+llvm::Record *TGParser::ParseDef(MultiClass *CurMultiClass) {
+ LocTy DefLoc = Lex.getLoc();
+ assert(Lex.getCode() == tgtok::Def && "Unknown tok");
+ Lex.Lex(); // Eat the 'def' token.
+
+ // Parse ObjectName and make a record for it.
+ Record *CurRec = new Record(ParseObjectName());
+
+ if (!CurMultiClass) {
+ // Top-level def definition.
+
+ // Ensure redefinition doesn't happen.
+ if (Records.getDef(CurRec->getName())) {
+ Error(DefLoc, "def '" + CurRec->getName() + "' already defined");
+ return 0;
+ }
+ Records.addDef(CurRec);
+ } else {
+ // Otherwise, a def inside a multiclass, add it to the multiclass.
+ for (unsigned i = 0, e = CurMultiClass->DefPrototypes.size(); i != e; ++i)
+ if (CurMultiClass->DefPrototypes[i]->getName() == CurRec->getName()) {
+ Error(DefLoc, "def '" + CurRec->getName() +
+ "' already defined in this multiclass!");
+ return 0;
+ }
+ CurMultiClass->DefPrototypes.push_back(CurRec);
+ }
+
+ if (ParseObjectBody(CurRec))
+ return 0;
+
+ if (CurMultiClass == 0) // Def's in multiclasses aren't really defs.
+ CurRec->resolveReferences();
+
+ // If ObjectBody has template arguments, it's an error.
+ assert(CurRec->getTemplateArgs().empty() && "How'd this get template args?");
+ return CurRec;
+}
+
+
+/// ParseClass - Parse a tblgen class definition.
+///
+/// ClassInst ::= CLASS ID TemplateArgList? ObjectBody
+///
+bool TGParser::ParseClass() {
+ assert(Lex.getCode() == tgtok::Class && "Unexpected token!");
+ Lex.Lex();
+
+ if (Lex.getCode() != tgtok::Id)
+ return TokError("expected class name after 'class' keyword");
+
+ Record *CurRec = Records.getClass(Lex.getCurStrVal());
+ if (CurRec) {
+ // If the body was previously defined, this is an error.
+ if (!CurRec->getValues().empty() ||
+ !CurRec->getSuperClasses().empty() ||
+ !CurRec->getTemplateArgs().empty())
+ return TokError("Class '" + CurRec->getName() + "' already defined");
+ } else {
+ // If this is the first reference to this class, create and add it.
+ CurRec = new Record(Lex.getCurStrVal());
+ Records.addClass(CurRec);
+ }
+ Lex.Lex(); // eat the name.
+
+ // If there are template args, parse them.
+ if (Lex.getCode() == tgtok::less)
+ if (ParseTemplateArgList(CurRec))
+ return true;
+
+ // Finally, parse the object body.
+ return ParseObjectBody(CurRec);
+}
+
+/// ParseLetList - Parse a non-empty list of assignment expressions into a list
+/// of LetRecords.
+///
+/// LetList ::= LetItem (',' LetItem)*
+/// LetItem ::= ID OptionalRangeList '=' Value
+///
+std::vector<LetRecord> TGParser::ParseLetList() {
+ std::vector<LetRecord> Result;
+
+ while (1) {
+ if (Lex.getCode() != tgtok::Id) {
+ TokError("expected identifier in let definition");
+ return std::vector<LetRecord>();
+ }
+ std::string Name = Lex.getCurStrVal();
+ LocTy NameLoc = Lex.getLoc();
+ Lex.Lex(); // Eat the identifier.
+
+ // Check for an optional RangeList.
+ std::vector<unsigned> Bits;
+ if (ParseOptionalRangeList(Bits))
+ return std::vector<LetRecord>();
+ std::reverse(Bits.begin(), Bits.end());
+
+ if (Lex.getCode() != tgtok::equal) {
+ TokError("expected '=' in let expression");
+ return std::vector<LetRecord>();
+ }
+ Lex.Lex(); // eat the '='.
+
+ Init *Val = ParseValue(0);
+ if (Val == 0) return std::vector<LetRecord>();
+
+ // Now that we have everything, add the record.
+ Result.push_back(LetRecord(Name, Bits, Val, NameLoc));
+
+ if (Lex.getCode() != tgtok::comma)
+ return Result;
+ Lex.Lex(); // eat the comma.
+ }
+}
+
+/// ParseTopLevelLet - Parse a 'let' at top level. This can be a couple of
+/// different related productions.
+///
+/// Object ::= LET LetList IN '{' ObjectList '}'
+/// Object ::= LET LetList IN Object
+///
+bool TGParser::ParseTopLevelLet() {
+ assert(Lex.getCode() == tgtok::Let && "Unexpected token");
+ Lex.Lex();
+
+ // Add this entry to the let stack.
+ std::vector<LetRecord> LetInfo = ParseLetList();
+ if (LetInfo.empty()) return true;
+ LetStack.push_back(LetInfo);
+
+ if (Lex.getCode() != tgtok::In)
+ return TokError("expected 'in' at end of top-level 'let'");
+ Lex.Lex();
+
+ // If this is a scalar let, just handle it now
+ if (Lex.getCode() != tgtok::l_brace) {
+ // LET LetList IN Object
+ if (ParseObject())
+ return true;
+ } else { // Object ::= LETCommand '{' ObjectList '}'
+ LocTy BraceLoc = Lex.getLoc();
+ // Otherwise, this is a group let.
+ Lex.Lex(); // eat the '{'.
+
+ // Parse the object list.
+ if (ParseObjectList())
+ return true;
+
+ if (Lex.getCode() != tgtok::r_brace) {
+ TokError("expected '}' at end of top level let command");
+ return Error(BraceLoc, "to match this '{'");
+ }
+ Lex.Lex();
+ }
+
+ // Outside this let scope, this let block is not active.
+ LetStack.pop_back();
+ return false;
+}
+
+/// ParseMultiClassDef - Parse a def in a multiclass context.
+///
+/// MultiClassDef ::= DefInst
+///
+bool TGParser::ParseMultiClassDef(MultiClass *CurMC) {
+ if (Lex.getCode() != tgtok::Def)
+ return TokError("expected 'def' in multiclass body");
+
+ Record *D = ParseDef(CurMC);
+ if (D == 0) return true;
+
+ // Copy the template arguments for the multiclass into the def.
+ const std::vector<std::string> &TArgs = CurMC->Rec.getTemplateArgs();
+
+ for (unsigned i = 0, e = TArgs.size(); i != e; ++i) {
+ const RecordVal *RV = CurMC->Rec.getValue(TArgs[i]);
+ assert(RV && "Template arg doesn't exist?");
+ D->addValue(*RV);
+ }
+
+ return false;
+}
+
+/// ParseMultiClass - Parse a multiclass definition.
+///
+/// MultiClassInst ::= MULTICLASS ID TemplateArgList? '{' MultiClassDef+ '}'
+///
+bool TGParser::ParseMultiClass() {
+ assert(Lex.getCode() == tgtok::MultiClass && "Unexpected token");
+ Lex.Lex(); // Eat the multiclass token.
+
+ if (Lex.getCode() != tgtok::Id)
+ return TokError("expected identifier after multiclass for name");
+ std::string Name = Lex.getCurStrVal();
+
+ if (MultiClasses.count(Name))
+ return TokError("multiclass '" + Name + "' already defined");
+
+ CurMultiClass = MultiClasses[Name] = new MultiClass(Name);
+ Lex.Lex(); // Eat the identifier.
+
+ // If there are template args, parse them.
+ if (Lex.getCode() == tgtok::less)
+ if (ParseTemplateArgList(0))
+ return true;
+
+ if (Lex.getCode() != tgtok::l_brace)
+ return TokError("expected '{' in multiclass definition");
+
+ if (Lex.Lex() == tgtok::r_brace) // eat the '{'.
+ return TokError("multiclass must contain at least one def");
+
+ while (Lex.getCode() != tgtok::r_brace)
+ if (ParseMultiClassDef(CurMultiClass))
+ return true;
+
+ Lex.Lex(); // eat the '}'.
+
+ CurMultiClass = 0;
+ return false;
+}
+
+/// ParseDefm - Parse the instantiation of a multiclass.
+///
+/// DefMInst ::= DEFM ID ':' DefmSubClassRef ';'
+///
+bool TGParser::ParseDefm() {
+ assert(Lex.getCode() == tgtok::Defm && "Unexpected token!");
+ if (Lex.Lex() != tgtok::Id) // eat the defm.
+ return TokError("expected identifier after defm");
+
+ LocTy DefmPrefixLoc = Lex.getLoc();
+ std::string DefmPrefix = Lex.getCurStrVal();
+ if (Lex.Lex() != tgtok::colon)
+ return TokError("expected ':' after defm identifier");
+
+ // eat the colon.
+ Lex.Lex();
+
+ LocTy SubClassLoc = Lex.getLoc();
+ SubClassReference Ref = ParseSubClassReference(0, true);
+ if (Ref.Rec == 0) return true;
+
+ if (Lex.getCode() != tgtok::semi)
+ return TokError("expected ';' at end of defm");
+ Lex.Lex();
+
+ // To instantiate a multiclass, we need to first get the multiclass, then
+ // instantiate each def contained in the multiclass with the SubClassRef
+ // template parameters.
+ MultiClass *MC = MultiClasses[Ref.Rec->getName()];
+ assert(MC && "Didn't lookup multiclass correctly?");
+ std::vector<Init*> &TemplateVals = Ref.TemplateArgs;
+
+ // Verify that the correct number of template arguments were specified.
+ const std::vector<std::string> &TArgs = MC->Rec.getTemplateArgs();
+ if (TArgs.size() < TemplateVals.size())
+ return Error(SubClassLoc,
+ "more template args specified than multiclass expects");
+
+ // Loop over all the def's in the multiclass, instantiating each one.
+ for (unsigned i = 0, e = MC->DefPrototypes.size(); i != e; ++i) {
+ Record *DefProto = MC->DefPrototypes[i];
+
+ // Add the suffix to the defm name to get the new name.
+ Record *CurRec = new Record(DefmPrefix + DefProto->getName());
+
+ SubClassReference Ref;
+ Ref.RefLoc = DefmPrefixLoc;
+ Ref.Rec = DefProto;
+ AddSubClass(CurRec, Ref);
+
+ // Loop over all of the template arguments, setting them to the specified
+ // value or leaving them as the default if necessary.
+ for (unsigned i = 0, e = TArgs.size(); i != e; ++i) {
+ if (i < TemplateVals.size()) { // A value is specified for this temp-arg?
+ // Set it now.
+ if (SetValue(CurRec, DefmPrefixLoc, TArgs[i], std::vector<unsigned>(),
+ TemplateVals[i]))
+ return true;
+
+ // Resolve it next.
+ CurRec->resolveReferencesTo(CurRec->getValue(TArgs[i]));
+
+ // Now remove it.
+ CurRec->removeValue(TArgs[i]);
+
+ } else if (!CurRec->getValue(TArgs[i])->getValue()->isComplete()) {
+ return Error(SubClassLoc, "value not specified for template argument #"+
+ utostr(i) + " (" + TArgs[i] + ") of multiclassclass '" +
+ MC->Rec.getName() + "'");
+ }
+ }
+
+ // If the mdef is inside a 'let' expression, add to each def.
+ for (unsigned i = 0, e = LetStack.size(); i != e; ++i)
+ for (unsigned j = 0, e = LetStack[i].size(); j != e; ++j)
+ if (SetValue(CurRec, LetStack[i][j].Loc, LetStack[i][j].Name,
+ LetStack[i][j].Bits, LetStack[i][j].Value)) {
+ Error(DefmPrefixLoc, "when instantiating this defm");
+ return true;
+ }
+
+
+ // Ensure redefinition doesn't happen.
+ if (Records.getDef(CurRec->getName()))
+ return Error(DefmPrefixLoc, "def '" + CurRec->getName() +
+ "' already defined, instantiating defm with subdef '" +
+ DefProto->getName() + "'");
+ Records.addDef(CurRec);
+ CurRec->resolveReferences();
+ }
+
+ return false;
+}
+
+/// ParseObject
+/// Object ::= ClassInst
+/// Object ::= DefInst
+/// Object ::= MultiClassInst
+/// Object ::= DefMInst
+/// Object ::= LETCommand '{' ObjectList '}'
+/// Object ::= LETCommand Object
+bool TGParser::ParseObject() {
+ switch (Lex.getCode()) {
+ default: assert(0 && "This is not an object");
+ case tgtok::Let: return ParseTopLevelLet();
+ case tgtok::Def: return ParseDef(0) == 0;
+ case tgtok::Defm: return ParseDefm();
+ case tgtok::Class: return ParseClass();
+ case tgtok::MultiClass: return ParseMultiClass();
+ }
+}
+
+/// ParseObjectList
+/// ObjectList :== Object*
+bool TGParser::ParseObjectList() {
+ while (isObjectStart(Lex.getCode())) {
+ if (ParseObject())
+ return true;
+ }
+ return false;
+}
+
+
+bool TGParser::ParseFile() {
+ Lex.Lex(); // Prime the lexer.
+ if (ParseObjectList()) return true;
+
+ // If we have unread input at the end of the file, report it.
+ if (Lex.getCode() == tgtok::Eof)
+ return false;
+
+ return TokError("Unexpected input at top level");
+}
+
diff --git a/utils/TableGen/TGParser.h b/utils/TableGen/TGParser.h
new file mode 100644
index 0000000000..6ec0415a57
--- /dev/null
+++ b/utils/TableGen/TGParser.h
@@ -0,0 +1,109 @@
+//===- TGParser.h - Parser for TableGen Files -------------------*- C++ -*-===//
+//
+// The LLVM Compiler Infrastructure
+//
+// This file was developed by Chris Lattner and is distributed under
+// the University of Illinois Open Source License. See LICENSE.TXT for details.
+//
+//===----------------------------------------------------------------------===//
+//
+// This class represents the Parser for tablegen files.
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef TGPARSER_H
+#define TGPARSER_H
+
+#include "TGLexer.h"
+#include <map>
+
+namespace llvm {
+ class Record;
+ class RecordVal;
+ class RecTy;
+ class Init;
+ struct MultiClass;
+ struct SubClassReference;
+
+ struct LetRecord {
+ std::string Name;
+ std::vector<unsigned> Bits;
+ Init *Value;
+ TGLexer::LocTy Loc;
+ LetRecord(const std::string &N, const std::vector<unsigned> &B, Init *V,
+ TGLexer::LocTy L)
+ : Name(N), Bits(B), Value(V), Loc(L) {
+ }
+ };
+
+class TGParser {
+ TGLexer Lex;
+ std::vector<std::vector<LetRecord> > LetStack;
+ std::map<std::string, MultiClass*> MultiClasses;
+
+ /// CurMultiClass - If we are parsing a 'multiclass' definition, this is the
+ /// current value.
+ MultiClass *CurMultiClass;
+public:
+ typedef TGLexer::LocTy LocTy;
+
+ TGParser(MemoryBuffer *StartBuf) : Lex(StartBuf), CurMultiClass(0) {}
+
+ void setIncludeDirs(const std::vector<std::string> &D){Lex.setIncludeDirs(D);}
+
+ /// ParseFile - Main entrypoint for parsing a tblgen file. These parser
+ /// routines return true on error, or false on success.
+ bool ParseFile();
+
+ bool Error(LocTy L, const std::string &Msg) const {
+ Lex.PrintError(L, Msg);
+ return true;
+ }
+ bool TokError(const std::string &Msg) const {
+ return Error(Lex.getLoc(), Msg);
+ }
+private: // Semantic analysis methods.
+ bool AddValue(Record *TheRec, LocTy Loc, const RecordVal &RV);
+ bool SetValue(Record *TheRec, LocTy Loc, const std::string &ValName,
+ const std::vector<unsigned> &BitList, Init *V);
+ bool AddSubClass(Record *Rec, class SubClassReference &SubClass);
+
+private: // Parser methods.
+ bool ParseObjectList();
+ bool ParseObject();
+ bool ParseClass();
+ bool ParseMultiClass();
+ bool ParseMultiClassDef(MultiClass *CurMC);
+ bool ParseDefm();
+ bool ParseTopLevelLet();
+ std::vector<LetRecord> ParseLetList();
+
+ Record *ParseDef(MultiClass *CurMultiClass);
+ bool ParseObjectBody(Record *CurRec);
+ bool ParseBody(Record *CurRec);
+ bool ParseBodyItem(Record *CurRec);
+
+ bool ParseTemplateArgList(Record *CurRec);
+ std::string ParseDeclaration(Record *CurRec, bool ParsingTemplateArgs);
+
+ SubClassReference ParseSubClassReference(Record *CurRec, bool isDefm);
+
+ Init *ParseIDValue(Record *CurRec);
+ Init *ParseIDValue(Record *CurRec, const std::string &Name, LocTy NameLoc);
+ Init *ParseSimpleValue(Record *CurRec);
+ Init *ParseValue(Record *CurRec);
+ std::vector<Init*> ParseValueList(Record *CurRec);
+ std::vector<std::pair<llvm::Init*, std::string> > ParseDagArgList(Record *);
+ bool ParseOptionalRangeList(std::vector<unsigned> &Ranges);
+ bool ParseOptionalBitList(std::vector<unsigned> &Ranges);
+ std::vector<unsigned> ParseRangeList();
+ bool ParseRangePiece(std::vector<unsigned> &Ranges);
+ RecTy *ParseType();
+ std::string ParseObjectName();
+ Record *ParseClassID();
+ Record *ParseDefmID();
+};
+
+} // end namespace llvm
+
+#endif
diff --git a/utils/TableGen/TableGen.cpp b/utils/TableGen/TableGen.cpp
index d3d241e6c7..f4ece12897 100644
--- a/utils/TableGen/TableGen.cpp
+++ b/utils/TableGen/TableGen.cpp
@@ -16,10 +16,12 @@
//===----------------------------------------------------------------------===//
#include "Record.h"
+#include "TGParser.h"
#include "llvm/Support/CommandLine.h"
#include "llvm/Support/Streams.h"
#include "llvm/System/Signals.h"
#include "llvm/Support/FileUtilities.h"
+#include "llvm/Support/MemoryBuffer.h"
#include "CallingConvEmitter.h"
#include "CodeEmitterGen.h"
#include "RegisterInfoEmitter.h"
@@ -93,16 +95,35 @@ namespace {
cl::value_desc("directory"), cl::Prefix);
}
-namespace llvm {
- void ParseFile(const std::string &Filename,
- const std::vector<std::string> &IncludeDirs);
-}
-
RecordKeeper llvm::Records;
+/// ParseFile - this function begins the parsing of the specified tablegen
+/// file.
+static bool ParseFile(const std::string &Filename,
+ const std::vector<std::string> &IncludeDirs) {
+ std::string ErrorStr;
+ MemoryBuffer *F = MemoryBuffer::getFileOrSTDIN(&Filename[0], Filename.size(),
+ &ErrorStr);
+ if (F == 0) {
+ cerr << "Could not open input file '" + Filename + "': " << ErrorStr <<"\n";
+ return true;
+ }
+
+ TGParser Parser(F);
+
+ // Record the location of the include directory so that the lexer can find
+ // it later.
+ Parser.setIncludeDirs(IncludeDirs);
+
+ return Parser.ParseFile();
+}
+
int main(int argc, char **argv) {
cl::ParseCommandLineOptions(argc, argv);
- ParseFile(InputFilename, IncludeDirs);
+
+ // Parse the input file.
+ if (ParseFile(InputFilename, IncludeDirs))
+ return 1;
std::ostream *Out = cout.stream();
if (OutputFilename != "-") {
generated by cgit v1.2.3 (git 2.25.1) at 2024-06-11 10:50:19 +0000