From: Chris Lattner Date: Wed, 15 Feb 2006 07:24:01 +0000 (+0000) Subject: Check the new form for bison output into CVS X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=bdd3c1604e43aca5f5ddae18b4c9f45709b08c29;p=oota-llvm.git Check the new form for bison output into CVS git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@26208 91177308-0d34-0410-b5e6-96231b3b80d8 --- diff --git a/utils/TableGen/FileParser.cpp b/utils/TableGen/FileParser.cpp deleted file mode 100644 index 9ed36d0615b..00000000000 --- a/utils/TableGen/FileParser.cpp +++ /dev/null @@ -1,2257 +0,0 @@ -/* A Bison parser, made by GNU Bison 1.875. */ - -/* Skeleton parser for Yacc-like parsing with Bison, - Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 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. */ - -/* Written by Richard Stallman by simplifying the original so called - ``semantic'' parser. */ - -/* All symbols defined below should begin with yy or YY, to avoid - infringing on user name space. This should be done even for local - variables, as they might otherwise be expanded by user macros. - There are some unavoidable exceptions within include files to - define necessary library symbols; they are noted "INFRINGES ON - USER NAME SPACE" below. */ - -/* Identify Bison output. */ -#define YYBISON 1 - -/* Skeleton name. */ -#define YYSKELETON_NAME "yacc.c" - -/* Pure parsers. */ -#define YYPURE 0 - -/* Using locations. */ -#define YYLSP_NEEDED 0 - -/* If NAME_PREFIX is specified substitute the variables and functions - names. */ -#define yyparse Fileparse -#define yylex Filelex -#define yyerror Fileerror -#define yylval Filelval -#define yychar Filechar -#define yydebug Filedebug -#define yynerrs Filenerrs - - -/* Tokens. */ -#ifndef YYTOKENTYPE -# define YYTOKENTYPE - /* Put the tokens into the symbol table, so that GDB and other debuggers - know about them. */ - enum yytokentype { - INT = 258, - BIT = 259, - STRING = 260, - BITS = 261, - LIST = 262, - CODE = 263, - DAG = 264, - CLASS = 265, - DEF = 266, - FIELD = 267, - LET = 268, - IN = 269, - SHLTOK = 270, - SRATOK = 271, - SRLTOK = 272, - INTVAL = 273, - ID = 274, - VARNAME = 275, - STRVAL = 276, - CODEFRAGMENT = 277 - }; -#endif -#define INT 258 -#define BIT 259 -#define STRING 260 -#define BITS 261 -#define LIST 262 -#define CODE 263 -#define DAG 264 -#define CLASS 265 -#define DEF 266 -#define FIELD 267 -#define LET 268 -#define IN 269 -#define SHLTOK 270 -#define SRATOK 271 -#define SRLTOK 272 -#define INTVAL 273 -#define ID 274 -#define VARNAME 275 -#define STRVAL 276 -#define CODEFRAGMENT 277 - - - - -/* Copy the first part of user declarations. */ -#line 14 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - -#include "Record.h" -#include "llvm/ADT/StringExtras.h" -#include -#include -#define YYERROR_VERBOSE 1 - -int yyerror(const char *ErrorMsg); -int yylex(); - -namespace llvm { - -extern int Filelineno; -static Record *CurRec = 0; -static bool ParsingTemplateArgs = false; - -typedef std::pair*> SubClassRefTy; - -struct LetRecord { - std::string Name; - std::vector Bits; - Init *Value; - bool HasBits; - LetRecord(const std::string &N, std::vector *B, Init *V) - : Name(N), Value(V), HasBits(B != 0) { - if (HasBits) Bits = *B; - } -}; - -static std::vector > LetStack; - - -extern std::ostream &err(); - -static void addValue(const RecordVal &RV) { - if (RecordVal *ERV = CurRec->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 { - CurRec->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 *BitList, Init *V) { - if (!V) return; - - RecordVal *RV = CurRec->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(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(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(BI) != 0 || &(std::cerr << *BI) == 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 &TemplateArgs) { - // Add all of the values in the subclass into the current class... - const std::vector &Vals = SC->getValues(); - for (unsigned i = 0, e = Vals.size(); i != e; ++i) - addValue(Vals[i]); - - const std::vector &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); - } else { // This class expects template arguments... - // 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 &SCs = SC->getSuperClasses(); - for (unsigned i = 0, e = SCs.size(); i != e; ++i) - addSuperClass(SCs[i]); - addSuperClass(SC); -} - -} // End llvm namespace - -using namespace llvm; - - - -/* Enabling traces. */ -#ifndef YYDEBUG -# define YYDEBUG 0 -#endif - -/* Enabling verbose error messages. */ -#ifdef YYERROR_VERBOSE -# undef YYERROR_VERBOSE -# define YYERROR_VERBOSE 1 -#else -# define YYERROR_VERBOSE 0 -#endif - -#if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED) -#line 189 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" -typedef union YYSTYPE { - std::string* StrVal; - int IntVal; - llvm::RecTy* Ty; - llvm::Init* Initializer; - std::vector* FieldList; - std::vector* BitList; - llvm::Record* Rec; - SubClassRefTy* SubClassRef; - std::vector* SubClassList; - std::vector >* DagValueList; -} YYSTYPE; -/* Line 191 of yacc.c. */ -#line 316 "FileParser.tab.c" -# define yystype YYSTYPE /* obsolescent; will be withdrawn */ -# define YYSTYPE_IS_DECLARED 1 -# define YYSTYPE_IS_TRIVIAL 1 -#endif - - - -/* Copy the second part of user declarations. */ - - -/* Line 214 of yacc.c. */ -#line 328 "FileParser.tab.c" - -#if ! defined (yyoverflow) || YYERROR_VERBOSE - -/* The parser invokes alloca or malloc; define the necessary symbols. */ - -# if YYSTACK_USE_ALLOCA -# define YYSTACK_ALLOC alloca -# else -# ifndef YYSTACK_USE_ALLOCA -# if defined (alloca) || defined (_ALLOCA_H) -# define YYSTACK_ALLOC alloca -# else -# ifdef __GNUC__ -# define YYSTACK_ALLOC __builtin_alloca -# endif -# endif -# endif -# endif - -# ifdef YYSTACK_ALLOC - /* Pacify GCC's `empty if-body' warning. */ -# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) -# else -# if defined (__STDC__) || defined (__cplusplus) -# include /* INFRINGES ON USER NAME SPACE */ -# define YYSIZE_T size_t -# endif -# define YYSTACK_ALLOC malloc -# define YYSTACK_FREE free -# endif -#endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */ - - -#if (! defined (yyoverflow) \ - && (! defined (__cplusplus) \ - || (YYSTYPE_IS_TRIVIAL))) - -/* A type that is properly aligned for any stack member. */ -union yyalloc -{ - short yyss; - YYSTYPE yyvs; - }; - -/* The size of the maximum gap between one aligned stack and the next. */ -# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1) - -/* The size of an array large to enough to hold all stacks, each with - N elements. */ -# define YYSTACK_BYTES(N) \ - ((N) * (sizeof (short) + sizeof (YYSTYPE)) \ - + YYSTACK_GAP_MAXIMUM) - -/* Copy COUNT objects from FROM to TO. The source and destination do - not overlap. */ -# ifndef YYCOPY -# if 1 < __GNUC__ -# define YYCOPY(To, From, Count) \ - __builtin_memcpy (To, From, (Count) * sizeof (*(From))) -# else -# define YYCOPY(To, From, Count) \ - do \ - { \ - register YYSIZE_T yyi; \ - for (yyi = 0; yyi < (Count); yyi++) \ - (To)[yyi] = (From)[yyi]; \ - } \ - while (0) -# endif -# endif - -/* Relocate STACK from its old location to the new one. The - local variables YYSIZE and YYSTACKSIZE give the old and new number of - elements in the stack, and YYPTR gives the new location of the - stack. Advance YYPTR to a properly aligned location for the next - stack. */ -# define YYSTACK_RELOCATE(Stack) \ - do \ - { \ - YYSIZE_T yynewbytes; \ - YYCOPY (&yyptr->Stack, Stack, yysize); \ - Stack = &yyptr->Stack; \ - yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ - yyptr += yynewbytes / sizeof (*yyptr); \ - } \ - while (0) - -#endif - -#if defined (__STDC__) || defined (__cplusplus) - typedef signed char yysigned_char; -#else - typedef short yysigned_char; -#endif - -/* YYFINAL -- State number of the termination state. */ -#define YYFINAL 20 -/* YYLAST -- Last index in YYTABLE. */ -#define YYLAST 163 - -/* YYNTOKENS -- Number of terminals. */ -#define YYNTOKENS 38 -/* YYNNTS -- Number of nonterminals. */ -#define YYNNTS 41 -/* YYNRULES -- Number of rules. */ -#define YYNRULES 89 -/* YYNRULES -- Number of states. */ -#define YYNSTATES 160 - -/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ -#define YYUNDEFTOK 2 -#define YYMAXUTOK 277 - -#define YYTRANSLATE(YYX) \ - ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) - -/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */ -static const unsigned 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, - 32, 33, 2, 2, 34, 36, 31, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 35, 37, - 23, 25, 24, 26, 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, 29, 2, 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, 2, 2, 27, 2, 28, 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, 2, 3, 4, - 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, - 15, 16, 17, 18, 19, 20, 21, 22 -}; - -#if YYDEBUG -/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in - YYRHS. */ -static const unsigned short yyprhs[] = -{ - 0, 0, 3, 5, 7, 9, 14, 16, 21, 23, - 25, 27, 28, 30, 31, 34, 36, 38, 40, 42, - 46, 51, 53, 58, 62, 66, 71, 76, 83, 90, - 97, 98, 101, 104, 109, 110, 112, 114, 118, 121, - 125, 131, 136, 138, 139, 143, 144, 146, 148, 152, - 157, 160, 167, 168, 171, 173, 177, 179, 184, 186, - 190, 191, 194, 196, 200, 204, 205, 207, 209, 210, - 212, 214, 216, 217, 221, 222, 223, 230, 234, 236, - 238, 243, 245, 249, 250, 255, 260, 263, 265, 268 -}; - -/* YYRHS -- A `-1'-separated list of the rules' RHS. */ -static const yysigned_char yyrhs[] = -{ - 78, 0, -1, 19, -1, 5, -1, 4, -1, 6, - 23, 18, 24, -1, 3, -1, 7, 23, 40, 24, - -1, 8, -1, 9, -1, 39, -1, -1, 12, -1, - -1, 25, 43, -1, 18, -1, 21, -1, 22, -1, - 26, -1, 27, 50, 28, -1, 19, 23, 51, 24, - -1, 19, -1, 43, 27, 48, 28, -1, 29, 50, - 30, -1, 43, 31, 19, -1, 32, 19, 46, 33, - -1, 43, 29, 48, 30, -1, 15, 32, 43, 34, - 43, 33, -1, 16, 32, 43, 34, 43, 33, -1, - 17, 32, 43, 34, 43, 33, -1, -1, 35, 20, - -1, 43, 44, -1, 45, 34, 43, 44, -1, -1, - 45, -1, 18, -1, 18, 36, 18, -1, 18, 18, - -1, 47, 34, 18, -1, 47, 34, 18, 36, 18, - -1, 47, 34, 18, 18, -1, 47, -1, -1, 27, - 48, 28, -1, -1, 51, -1, 43, -1, 51, 34, - 43, -1, 41, 40, 19, 42, -1, 52, 37, -1, - 13, 19, 49, 25, 43, 37, -1, -1, 54, 53, - -1, 37, -1, 27, 54, 28, -1, 39, -1, 39, - 23, 51, 24, -1, 56, -1, 57, 34, 56, -1, - -1, 35, 57, -1, 52, -1, 59, 34, 52, -1, - 23, 59, 24, -1, -1, 60, -1, 19, -1, -1, - 62, -1, 63, -1, 63, -1, -1, 58, 67, 55, - -1, -1, -1, 10, 64, 69, 61, 70, 66, -1, - 11, 65, 66, -1, 68, -1, 71, -1, 19, 49, - 25, 43, -1, 73, -1, 74, 34, 73, -1, -1, - 13, 76, 74, 14, -1, 75, 27, 77, 28, -1, - 75, 72, -1, 72, -1, 77, 72, -1, 77, -1 -}; - -/* YYRLINE[YYN] -- source line where rule number YYN was defined. */ -static const unsigned short yyrline[] = -{ - 0, 223, 223, 234, 236, 238, 240, 242, 244, 246, - 248, 252, 252, 254, 254, 256, 258, 261, 264, 266, - 279, 307, 322, 329, 332, 339, 347, 355, 361, 367, - 375, 378, 382, 387, 393, 396, 399, 402, 415, 429, - 431, 444, 460, 462, 462, 466, 468, 472, 475, 479, - 489, 491, 497, 497, 498, 498, 500, 502, 506, 511, - 516, 519, 523, 526, 531, 532, 532, 534, 534, 536, - 543, 561, 573, 573, 592, 594, 592, 600, 609, 609, - 611, 616, 616, 619, 619, 622, 625, 629, 629, 631 -}; -#endif - -#if YYDEBUG || YYERROR_VERBOSE -/* YYTNME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. - First, the terminals, then, starting at YYNTOKENS, nonterminals. */ -static const char *const yytname[] = -{ - "$end", "error", "$undefined", "INT", "BIT", "STRING", "BITS", "LIST", - "CODE", "DAG", "CLASS", "DEF", "FIELD", "LET", "IN", "SHLTOK", "SRATOK", - "SRLTOK", "INTVAL", "ID", "VARNAME", "STRVAL", "CODEFRAGMENT", "'<'", - "'>'", "'='", "'?'", "'{'", "'}'", "'['", "']'", "'.'", "'('", "')'", - "','", "':'", "'-'", "';'", "$accept", "ClassID", "Type", "OptPrefix", - "OptValue", "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", "Object", - "LETItem", "LETList", "LETCommand", "@4", "ObjectList", "File", 0 -}; -#endif - -# ifdef YYPRINT -/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to - token YYLEX-NUM. */ -static const unsigned short yytoknum[] = -{ - 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, - 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, - 275, 276, 277, 60, 62, 61, 63, 123, 125, 91, - 93, 46, 40, 41, 44, 58, 45, 59 -}; -# endif - -/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ -static const unsigned char yyr1[] = -{ - 0, 38, 39, 40, 40, 40, 40, 40, 40, 40, - 40, 41, 41, 42, 42, 43, 43, 43, 43, 43, - 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, - 44, 44, 45, 45, 46, 46, 47, 47, 47, 47, - 47, 47, 48, 49, 49, 50, 50, 51, 51, 52, - 53, 53, 54, 54, 55, 55, 56, 56, 57, 57, - 58, 58, 59, 59, 60, 61, 61, 62, 62, 63, - 64, 65, 67, 66, 69, 70, 68, 71, 72, 72, - 73, 74, 74, 76, 75, 72, 72, 77, 77, 78 -}; - -/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ -static const unsigned char yyr2[] = -{ - 0, 2, 1, 1, 1, 4, 1, 4, 1, 1, - 1, 0, 1, 0, 2, 1, 1, 1, 1, 3, - 4, 1, 4, 3, 3, 4, 4, 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, - 4, 1, 3, 0, 4, 4, 2, 1, 2, 1 -}; - -/* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state - STATE-NUM when YYTABLE doesn't specify something else to do. Zero - means the default is an error. */ -static const unsigned char yydefact[] = -{ - 0, 68, 68, 83, 78, 79, 87, 0, 89, 0, - 67, 69, 70, 74, 71, 60, 0, 0, 86, 88, - 1, 65, 0, 72, 77, 43, 81, 0, 0, 11, - 66, 75, 2, 56, 58, 61, 0, 0, 0, 84, - 0, 85, 12, 0, 62, 0, 60, 0, 0, 52, - 54, 73, 36, 42, 0, 0, 82, 6, 4, 3, - 0, 0, 8, 9, 10, 0, 64, 11, 76, 0, - 0, 0, 15, 21, 16, 17, 18, 45, 45, 0, - 47, 0, 59, 11, 38, 0, 0, 44, 80, 0, - 0, 13, 63, 0, 0, 0, 0, 0, 46, 0, - 34, 0, 0, 0, 57, 0, 0, 55, 0, 53, - 37, 39, 0, 0, 0, 49, 0, 0, 0, 0, - 19, 23, 30, 35, 0, 0, 0, 24, 48, 43, - 50, 41, 0, 5, 7, 14, 0, 0, 0, 20, - 0, 32, 0, 25, 22, 26, 0, 40, 0, 0, - 0, 31, 30, 0, 27, 28, 29, 33, 0, 51 -}; - -/* YYDEFGOTO[NTERM-NUM]. */ -static const short yydefgoto[] = -{ - -1, 33, 65, 43, 115, 80, 141, 123, 124, 53, - 54, 38, 97, 98, 44, 109, 83, 51, 34, 35, - 23, 45, 30, 31, 11, 12, 13, 15, 24, 36, - 4, 21, 46, 5, 6, 26, 27, 7, 16, 8, - 9 -}; - -/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing - STATE-NUM. */ -#define YYPACT_NINF -82 -static const yysigned_char yypact[] = -{ - 114, -12, -12, -82, -82, -82, -82, 4, 114, 16, - -82, -82, -82, -82, -82, -3, 10, 114, -82, -82, - -82, 12, 17, -82, -82, 14, -82, -9, -2, 35, - -82, -82, -82, 26, -82, 28, -14, 46, 42, -82, - 10, -82, -82, 69, -82, 3, -3, 39, 17, -82, - -82, -82, -8, 36, 41, 39, -82, -82, -82, -82, - 56, 57, -82, -82, -82, 66, -82, 35, -82, 52, - 54, 58, -82, 72, -82, -82, -82, 39, 39, 87, - 91, 9, -82, 6, -82, 108, 110, -82, 91, 111, - 69, 105, -82, 39, 39, 39, 39, 103, 98, 104, - 39, 46, 46, 116, -82, 39, 117, -82, 96, -82, - -82, -6, 113, 115, 39, -82, 65, 73, 74, 29, - -82, -82, 62, 106, 109, 118, 119, -82, 91, 14, - -82, -82, 120, -82, -82, 91, 39, 39, 39, -82, - 121, -82, 39, -82, -82, -82, 122, -82, 82, 83, - 90, -82, 62, 39, -82, -82, -82, -82, 15, -82 -}; - -/* YYPGOTO[NTERM-NUM]. */ -static const short yypgoto[] = -{ - -82, -42, 53, -82, -82, -55, -7, -82, -82, -82, - -81, 19, 75, -45, -61, -82, -82, -82, 102, -82, - -82, -82, -82, -82, -82, 142, -82, -82, 112, -82, - -82, -82, -82, -82, -4, 123, -82, -82, -82, 134, - -82 -}; - -/* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If - positive, shift that token. If negative, reduce the rule which - number is the opposite. If zero, do what YYDEFACT says. - If YYTABLE_NINF, syntax error. */ -#define YYTABLE_NINF -1 -static const unsigned char yytable[] = -{ - 88, 64, 81, 18, 19, 39, 92, 10, 1, 2, - 84, 3, 131, 49, 1, 2, 20, 3, 42, 106, - 125, 126, 108, 50, 19, 40, 41, 66, 85, 25, - 132, 17, 22, 104, 107, 29, 32, 67, 116, 117, - 118, 37, 101, 105, 102, 122, 103, 42, 64, 47, - 128, 119, 159, 139, 69, 70, 71, 72, 73, 135, - 74, 75, 48, 105, 52, 76, 77, 55, 78, 87, - 86, 79, 57, 58, 59, 60, 61, 62, 63, 89, - 90, 148, 149, 150, 93, 91, 94, 152, 32, 101, - 95, 102, 101, 103, 102, 96, 103, 140, 158, 136, - 101, 101, 102, 102, 103, 103, 100, 137, 138, 101, - 101, 102, 102, 103, 103, 154, 155, 101, 101, 102, - 102, 103, 103, 156, 1, 2, 110, 3, 111, 112, - 114, 120, 105, 130, 121, 127, 129, 133, 147, 134, - 142, 151, 143, 113, 14, 157, 144, 153, 146, 145, - 82, 28, 0, 99, 0, 0, 0, 0, 68, 0, - 0, 0, 0, 56 -}; - -static const short yycheck[] = -{ - 55, 43, 47, 7, 8, 14, 67, 19, 10, 11, - 18, 13, 18, 27, 10, 11, 0, 13, 12, 13, - 101, 102, 83, 37, 28, 34, 28, 24, 36, 19, - 36, 27, 35, 24, 28, 23, 19, 34, 93, 94, - 95, 27, 27, 34, 29, 100, 31, 12, 90, 23, - 105, 96, 37, 24, 15, 16, 17, 18, 19, 114, - 21, 22, 34, 34, 18, 26, 27, 25, 29, 28, - 34, 32, 3, 4, 5, 6, 7, 8, 9, 23, - 23, 136, 137, 138, 32, 19, 32, 142, 19, 27, - 32, 29, 27, 31, 29, 23, 31, 35, 153, 34, - 27, 27, 29, 29, 31, 31, 19, 34, 34, 27, - 27, 29, 29, 31, 31, 33, 33, 27, 27, 29, - 29, 31, 31, 33, 10, 11, 18, 13, 18, 18, - 25, 28, 34, 37, 30, 19, 19, 24, 18, 24, - 34, 20, 33, 90, 2, 152, 28, 25, 129, 30, - 48, 17, -1, 78, -1, -1, -1, -1, 46, -1, - -1, -1, -1, 40 -}; - -/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing - symbol of state STATE-NUM. */ -static const unsigned char yystos[] = -{ - 0, 10, 11, 13, 68, 71, 72, 75, 77, 78, - 19, 62, 63, 64, 63, 65, 76, 27, 72, 72, - 0, 69, 35, 58, 66, 19, 73, 74, 77, 23, - 60, 61, 19, 39, 56, 57, 67, 27, 49, 14, - 34, 28, 12, 41, 52, 59, 70, 23, 34, 27, - 37, 55, 18, 47, 48, 25, 73, 3, 4, 5, - 6, 7, 8, 9, 39, 40, 24, 34, 66, 15, - 16, 17, 18, 19, 21, 22, 26, 27, 29, 32, - 43, 51, 56, 54, 18, 36, 34, 28, 43, 23, - 23, 19, 52, 32, 32, 32, 23, 50, 51, 50, - 19, 27, 29, 31, 24, 34, 13, 28, 52, 53, - 18, 18, 18, 40, 25, 42, 43, 43, 43, 51, - 28, 30, 43, 45, 46, 48, 48, 19, 43, 19, - 37, 18, 36, 24, 24, 43, 34, 34, 34, 24, - 35, 44, 34, 33, 28, 30, 49, 18, 43, 43, - 43, 20, 43, 25, 33, 33, 33, 44, 43, 37 -}; - -#if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__) -# define YYSIZE_T __SIZE_TYPE__ -#endif -#if ! defined (YYSIZE_T) && defined (size_t) -# define YYSIZE_T size_t -#endif -#if ! defined (YYSIZE_T) -# if defined (__STDC__) || defined (__cplusplus) -# include /* INFRINGES ON USER NAME SPACE */ -# define YYSIZE_T size_t -# endif -#endif -#if ! defined (YYSIZE_T) -# define YYSIZE_T unsigned int -#endif - -#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); \ - yytoken = YYTRANSLATE (yychar); \ - YYPOPSTACK; \ - goto yybackup; \ - } \ - else \ - { \ - yyerror ("syntax error: cannot back up");\ - YYERROR; \ - } \ -while (0) - -#define YYTERROR 1 -#define YYERRCODE 256 - -/* YYLLOC_DEFAULT -- Compute the default location (before the actions - are run). */ - -#ifndef YYLLOC_DEFAULT -# define YYLLOC_DEFAULT(Current, Rhs, N) \ - Current.first_line = Rhs[1].first_line; \ - Current.first_column = Rhs[1].first_column; \ - Current.last_line = Rhs[N].last_line; \ - Current.last_column = Rhs[N].last_column; -#endif - -/* YYLEX -- calling `yylex' with the right arguments. */ - -#ifdef YYLEX_PARAM -# define YYLEX yylex (YYLEX_PARAM) -#else -# define YYLEX yylex () -#endif - -/* Enable debugging if requested. */ -#if YYDEBUG - -# ifndef YYFPRINTF -# include /* INFRINGES ON USER NAME SPACE */ -# define YYFPRINTF fprintf -# endif - -# define YYDPRINTF(Args) \ -do { \ - if (yydebug) \ - YYFPRINTF Args; \ -} while (0) - -# define YYDSYMPRINT(Args) \ -do { \ - if (yydebug) \ - yysymprint Args; \ -} while (0) - -# define YYDSYMPRINTF(Title, Token, Value, Location) \ -do { \ - if (yydebug) \ - { \ - YYFPRINTF (stderr, "%s ", Title); \ - yysymprint (stderr, \ - Token, Value); \ - YYFPRINTF (stderr, "\n"); \ - } \ -} while (0) - -/*------------------------------------------------------------------. -| yy_stack_print -- Print the state stack from its BOTTOM up to its | -| TOP (cinluded). | -`------------------------------------------------------------------*/ - -#if defined (__STDC__) || defined (__cplusplus) -static void -yy_stack_print (short *bottom, short *top) -#else -static void -yy_stack_print (bottom, top) - short *bottom; - short *top; -#endif -{ - YYFPRINTF (stderr, "Stack now"); - for (/* Nothing. */; bottom <= top; ++bottom) - YYFPRINTF (stderr, " %d", *bottom); - YYFPRINTF (stderr, "\n"); -} - -# define YY_STACK_PRINT(Bottom, Top) \ -do { \ - if (yydebug) \ - yy_stack_print ((Bottom), (Top)); \ -} while (0) - - -/*------------------------------------------------. -| Report that the YYRULE is going to be reduced. | -`------------------------------------------------*/ - -#if defined (__STDC__) || defined (__cplusplus) -static void -yy_reduce_print (int yyrule) -#else -static void -yy_reduce_print (yyrule) - int yyrule; -#endif -{ - int yyi; - unsigned int yylineno = yyrline[yyrule]; - YYFPRINTF (stderr, "Reducing stack by rule %d (line %u), ", - yyrule - 1, yylineno); - /* Print the symbols being reduced, and their result. */ - for (yyi = yyprhs[yyrule]; 0 <= yyrhs[yyi]; yyi++) - YYFPRINTF (stderr, "%s ", yytname [yyrhs[yyi]]); - YYFPRINTF (stderr, "-> %s\n", yytname [yyr1[yyrule]]); -} - -# define YY_REDUCE_PRINT(Rule) \ -do { \ - if (yydebug) \ - yy_reduce_print (Rule); \ -} while (0) - -/* Nonzero means print parse trace. It is left uninitialized so that - multiple parsers can coexist. */ -int yydebug; -#else /* !YYDEBUG */ -# define YYDPRINTF(Args) -# define YYDSYMPRINT(Args) -# define YYDSYMPRINTF(Title, Token, Value, Location) -# define YY_STACK_PRINT(Bottom, Top) -# define YY_REDUCE_PRINT(Rule) -#endif /* !YYDEBUG */ - - -/* YYINITDEPTH -- initial size of the parser's stacks. */ -#ifndef YYINITDEPTH -# define YYINITDEPTH 200 -#endif - -/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only - if the built-in stack extension method is used). - - Do not make this value too large; the results are undefined if - SIZE_MAX < YYSTACK_BYTES (YYMAXDEPTH) - evaluated with infinite-precision integer arithmetic. */ - -#if YYMAXDEPTH == 0 -# undef YYMAXDEPTH -#endif - -#ifndef YYMAXDEPTH -# define YYMAXDEPTH 10000 -#endif - - - -#if YYERROR_VERBOSE - -# ifndef yystrlen -# if defined (__GLIBC__) && defined (_STRING_H) -# define yystrlen strlen -# else -/* Return the length of YYSTR. */ -static YYSIZE_T -# if defined (__STDC__) || defined (__cplusplus) -yystrlen (const char *yystr) -# else -yystrlen (yystr) - const char *yystr; -# endif -{ - register const char *yys = yystr; - - while (*yys++ != '\0') - continue; - - return yys - yystr - 1; -} -# endif -# endif - -# ifndef yystpcpy -# if defined (__GLIBC__) && defined (_STRING_H) && defined (_GNU_SOURCE) -# define yystpcpy stpcpy -# else -/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in - YYDEST. */ -static char * -# if defined (__STDC__) || defined (__cplusplus) -yystpcpy (char *yydest, const char *yysrc) -# else -yystpcpy (yydest, yysrc) - char *yydest; - const char *yysrc; -# endif -{ - register char *yyd = yydest; - register const char *yys = yysrc; - - while ((*yyd++ = *yys++) != '\0') - continue; - - return yyd - 1; -} -# endif -# endif - -#endif /* !YYERROR_VERBOSE */ - - - -#if YYDEBUG -/*--------------------------------. -| Print this symbol on YYOUTPUT. | -`--------------------------------*/ - -#if defined (__STDC__) || defined (__cplusplus) -static void -yysymprint (FILE *yyoutput, int yytype, YYSTYPE *yyvaluep) -#else -static void -yysymprint (yyoutput, yytype, yyvaluep) - FILE *yyoutput; - int yytype; - YYSTYPE *yyvaluep; -#endif -{ - /* Pacify ``unused variable'' warnings. */ - (void) yyvaluep; - - if (yytype < YYNTOKENS) - { - YYFPRINTF (yyoutput, "token %s (", yytname[yytype]); -# ifdef YYPRINT - YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); -# endif - } - else - YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]); - - switch (yytype) - { - default: - break; - } - YYFPRINTF (yyoutput, ")"); -} - -#endif /* ! YYDEBUG */ -/*-----------------------------------------------. -| Release the memory associated to this symbol. | -`-----------------------------------------------*/ - -#if defined (__STDC__) || defined (__cplusplus) -static void -yydestruct (int yytype, YYSTYPE *yyvaluep) -#else -static void -yydestruct (yytype, yyvaluep) - int yytype; - YYSTYPE *yyvaluep; -#endif -{ - /* Pacify ``unused variable'' warnings. */ - (void) yyvaluep; - - switch (yytype) - { - - default: - break; - } -} - - -/* Prevent warnings from -Wmissing-prototypes. */ - -#ifdef YYPARSE_PARAM -# if defined (__STDC__) || defined (__cplusplus) -int yyparse (void *YYPARSE_PARAM); -# else -int yyparse (); -# endif -#else /* ! YYPARSE_PARAM */ -#if defined (__STDC__) || defined (__cplusplus) -int yyparse (void); -#else -int yyparse (); -#endif -#endif /* ! YYPARSE_PARAM */ - - - -/* The lookahead symbol. */ -int yychar; - -/* The semantic value of the lookahead symbol. */ -YYSTYPE yylval; - -/* Number of syntax errors so far. */ -int yynerrs; - - - -/*----------. -| yyparse. | -`----------*/ - -#ifdef YYPARSE_PARAM -# if defined (__STDC__) || defined (__cplusplus) -int yyparse (void *YYPARSE_PARAM) -# else -int yyparse (YYPARSE_PARAM) - void *YYPARSE_PARAM; -# endif -#else /* ! YYPARSE_PARAM */ -#if defined (__STDC__) || defined (__cplusplus) -int -yyparse (void) -#else -int -yyparse () - -#endif -#endif -{ - - register int yystate; - register int yyn; - int yyresult; - /* Number of tokens to shift before error messages enabled. */ - int yyerrstatus; - /* Lookahead token as an internal (translated) token number. */ - int yytoken = 0; - - /* Three stacks and their tools: - `yyss': related to states, - `yyvs': related to semantic values, - `yyls': related to locations. - - Refer to the stacks thru separate pointers, to allow yyoverflow - to reallocate them elsewhere. */ - - /* The state stack. */ - short yyssa[YYINITDEPTH]; - short *yyss = yyssa; - register short *yyssp; - - /* The semantic value stack. */ - YYSTYPE yyvsa[YYINITDEPTH]; - YYSTYPE *yyvs = yyvsa; - register YYSTYPE *yyvsp; - - - -#define YYPOPSTACK (yyvsp--, yyssp--) - - YYSIZE_T yystacksize = YYINITDEPTH; - - /* The variables used to return semantic value and location from the - action routines. */ - YYSTYPE yyval; - - - /* When reducing, the number of symbols on the RHS of the reduced - rule. */ - int yylen; - - YYDPRINTF ((stderr, "Starting parse\n")); - - 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; - yyvsp = yyvs; - - goto yysetstate; - -/*------------------------------------------------------------. -| yynewstate -- Push a new state, which is found in yystate. | -`------------------------------------------------------------*/ - yynewstate: - /* In all cases, when you get here, the value and location stacks - have just been pushed. so pushing a state here evens the stacks. - */ - yyssp++; - - yysetstate: - *yyssp = yystate; - - if (yyss + yystacksize - 1 <= yyssp) - { - /* Get the current used size of the three stacks, in elements. */ - YYSIZE_T yysize = yyssp - yyss + 1; - -#ifdef yyoverflow - { - /* 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; - - - /* Each stack pointer address is followed by the size of the - data in use in that stack, in bytes. 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, yysize * sizeof (*yyssp), - &yyvs1, yysize * sizeof (*yyvsp), - - &yystacksize); - - yyss = yyss1; - yyvs = yyvs1; - } -#else /* no yyoverflow */ -# ifndef YYSTACK_RELOCATE - goto yyoverflowlab; -# else - /* Extend the stack our own way. */ - if (YYMAXDEPTH <= yystacksize) - goto yyoverflowlab; - yystacksize *= 2; - if (YYMAXDEPTH < yystacksize) - yystacksize = YYMAXDEPTH; - - { - short *yyss1 = yyss; - union yyalloc *yyptr = - (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); - if (! yyptr) - goto yyoverflowlab; - YYSTACK_RELOCATE (yyss); - YYSTACK_RELOCATE (yyvs); - -# undef YYSTACK_RELOCATE - if (yyss1 != yyssa) - YYSTACK_FREE (yyss1); - } -# endif -#endif /* no yyoverflow */ - - yyssp = yyss + yysize - 1; - yyvsp = yyvs + yysize - 1; - - - YYDPRINTF ((stderr, "Stack size increased to %lu\n", - (unsigned long int) yystacksize)); - - if (yyss + yystacksize - 1 <= yyssp) - YYABORT; - } - - YYDPRINTF ((stderr, "Entering state %d\n", yystate)); - - goto yybackup; - -/*-----------. -| 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 == YYPACT_NINF) - goto yydefault; - - /* Not known => get a lookahead token if don't already have one. */ - - /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */ - if (yychar == YYEMPTY) - { - YYDPRINTF ((stderr, "Reading a token: ")); - yychar = YYLEX; - } - - if (yychar <= YYEOF) - { - yychar = yytoken = YYEOF; - YYDPRINTF ((stderr, "Now at end of input.\n")); - } - else - { - yytoken = YYTRANSLATE (yychar); - YYDSYMPRINTF ("Next token is", yytoken, &yylval, &yylloc); - } - - /* If the proper action on seeing token YYTOKEN is to reduce or to - detect an error, take that action. */ - yyn += yytoken; - if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken) - goto yydefault; - yyn = yytable[yyn]; - if (yyn <= 0) - { - if (yyn == 0 || yyn == YYTABLE_NINF) - goto yyerrlab; - yyn = -yyn; - goto yyreduce; - } - - if (yyn == YYFINAL) - YYACCEPT; - - /* Shift the lookahead token. */ - YYDPRINTF ((stderr, "Shifting token %s, ", yytname[yytoken])); - - /* Discard the token being shifted unless it is eof. */ - if (yychar != YYEOF) - yychar = YYEMPTY; - - *++yyvsp = yylval; - - - /* Count tokens shifted since error; after three, turn off error - status. */ - if (yyerrstatus) - yyerrstatus--; - - yystate = yyn; - goto yynewstate; - - -/*-----------------------------------------------------------. -| yydefault -- do the default action for the current state. | -`-----------------------------------------------------------*/ -yydefault: - yyn = yydefact[yystate]; - if (yyn == 0) - goto yyerrlab; - goto yyreduce; - - -/*-----------------------------. -| yyreduce -- Do a reduction. | -`-----------------------------*/ -yyreduce: - /* yyn is the number of a rule to reduce with. */ - yylen = yyr2[yyn]; - - /* If YYLEN is nonzero, implement the default value of the action: - `$$ = $1'. - - Otherwise, the following line sets YYVAL to garbage. - This behavior is undocumented and Bison - users should not rely upon it. Assigning to YYVAL - unconditionally makes the parser a bit smaller, and it avoids a - GCC warning that YYVAL may be used uninitialized. */ - yyval = yyvsp[1-yylen]; - - - YY_REDUCE_PRINT (yyn); - switch (yyn) - { - case 2: -#line 223 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - 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 3: -#line 234 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { // string type - yyval.Ty = new StringRecTy(); - ;} - break; - - case 4: -#line 236 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { // bit type - yyval.Ty = new BitRecTy(); - ;} - break; - - case 5: -#line 238 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { // bits type - yyval.Ty = new BitsRecTy(yyvsp[-1].IntVal); - ;} - break; - - case 6: -#line 240 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { // int type - yyval.Ty = new IntRecTy(); - ;} - break; - - case 7: -#line 242 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { // list type - yyval.Ty = new ListRecTy(yyvsp[-1].Ty); - ;} - break; - - case 8: -#line 244 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { // code type - yyval.Ty = new CodeRecTy(); - ;} - break; - - case 9: -#line 246 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { // dag type - yyval.Ty = new DagRecTy(); - ;} - break; - - case 10: -#line 248 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { // Record Type - yyval.Ty = new RecordRecTy(yyvsp[0].Rec); - ;} - break; - - case 11: -#line 252 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { yyval.IntVal = 0; ;} - break; - - case 12: -#line 252 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { yyval.IntVal = 1; ;} - break; - - case 13: -#line 254 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { yyval.Initializer = 0; ;} - break; - - case 14: -#line 254 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { yyval.Initializer = yyvsp[0].Initializer; ;} - break; - - case 15: -#line 256 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - yyval.Initializer = new IntInit(yyvsp[0].IntVal); - ;} - break; - - case 16: -#line 258 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - yyval.Initializer = new StringInit(*yyvsp[0].StrVal); - delete yyvsp[0].StrVal; - ;} - break; - - case 17: -#line 261 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - yyval.Initializer = new CodeInit(*yyvsp[0].StrVal); - delete yyvsp[0].StrVal; - ;} - break; - - case 18: -#line 264 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - yyval.Initializer = new UnsetInit(); - ;} - break; - - case 19: -#line 266 "/home/vadve/criswell/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 20: -#line 279 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - // This is a CLASS expression. This is supposed to synthesize - // a new anonymous definition, deriving from CLASS 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 21: -#line 307 "/home/vadve/criswell/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 (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 22: -#line 322 "/home/vadve/criswell/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 329 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - yyval.Initializer = new ListInit(*yyvsp[-1].FieldList); - delete yyvsp[-1].FieldList; - ;} - break; - - case 24: -#line 332 "/home/vadve/criswell/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 339 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - Record *D = Records.getDef(*yyvsp[-2].StrVal); - if (D == 0) { - err() << "Invalid def '" << *yyvsp[-2].StrVal << "'!\n"; - exit(1); - } - yyval.Initializer = new DagInit(D, *yyvsp[-1].DagValueList); - delete yyvsp[-2].StrVal; delete yyvsp[-1].DagValueList; - ;} - break; - - case 26: -#line 347 "/home/vadve/criswell/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 355 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - yyval.Initializer = yyvsp[-3].Initializer->getBinaryOp(Init::SHL, yyvsp[-1].Initializer); - if (yyval.Initializer == 0) { - err() << "Cannot shift values '" << *yyvsp[-3].Initializer << "' and '" << *yyvsp[-1].Initializer << "'!\n"; - exit(1); - } - ;} - break; - - case 28: -#line 361 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - yyval.Initializer = yyvsp[-3].Initializer->getBinaryOp(Init::SRA, yyvsp[-1].Initializer); - if (yyval.Initializer == 0) { - err() << "Cannot shift values '" << *yyvsp[-3].Initializer << "' and '" << *yyvsp[-1].Initializer << "'!\n"; - exit(1); - } - ;} - break; - - case 29: -#line 367 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - yyval.Initializer = yyvsp[-3].Initializer->getBinaryOp(Init::SRL, yyvsp[-1].Initializer); - if (yyval.Initializer == 0) { - err() << "Cannot shift values '" << *yyvsp[-3].Initializer << "' and '" << *yyvsp[-1].Initializer << "'!\n"; - exit(1); - } - ;} - break; - - case 30: -#line 375 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - yyval.StrVal = new std::string(); - ;} - break; - - case 31: -#line 378 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - yyval.StrVal = yyvsp[0].StrVal; - ;} - break; - - case 32: -#line 382 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - yyval.DagValueList = new std::vector >(); - yyval.DagValueList->push_back(std::make_pair(yyvsp[-1].Initializer, *yyvsp[0].StrVal)); - delete yyvsp[0].StrVal; - ;} - break; - - case 33: -#line 387 "/home/vadve/criswell/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 34: -#line 393 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - yyval.DagValueList = new std::vector >(); - ;} - break; - - case 35: -#line 396 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { yyval.DagValueList = yyvsp[0].DagValueList; ;} - break; - - case 36: -#line 399 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - yyval.BitList = new std::vector(); - yyval.BitList->push_back(yyvsp[0].IntVal); - ;} - break; - - case 37: -#line 402 "/home/vadve/criswell/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(); - 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 38: -#line 415 "/home/vadve/criswell/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(); - 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 39: -#line 429 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - (yyval.BitList=yyvsp[-2].BitList)->push_back(yyvsp[0].IntVal); - ;} - break; - - case 40: -#line 431 "/home/vadve/criswell/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 41: -#line 444 "/home/vadve/criswell/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 42: -#line 460 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { yyval.BitList = yyvsp[0].BitList; std::reverse(yyvsp[0].BitList->begin(), yyvsp[0].BitList->end()); ;} - break; - - case 43: -#line 462 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { yyval.BitList = 0; ;} - break; - - case 44: -#line 462 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { yyval.BitList = yyvsp[-1].BitList; ;} - break; - - case 45: -#line 466 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - yyval.FieldList = new std::vector(); - ;} - break; - - case 46: -#line 468 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - yyval.FieldList = yyvsp[0].FieldList; - ;} - break; - - case 47: -#line 472 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - yyval.FieldList = new std::vector(); - yyval.FieldList->push_back(yyvsp[0].Initializer); - ;} - break; - - case 48: -#line 475 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - (yyval.FieldList = yyvsp[-2].FieldList)->push_back(yyvsp[0].Initializer); - ;} - break; - - case 49: -#line 479 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - std::string DecName = *yyvsp[-1].StrVal; - if (ParsingTemplateArgs) - DecName = CurRec->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 50: -#line 489 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - delete yyvsp[-1].StrVal; -;} - break; - - case 51: -#line 491 "/home/vadve/criswell/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 56: -#line 500 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - yyval.SubClassRef = new SubClassRefTy(yyvsp[0].Rec, new std::vector()); - ;} - break; - - case 57: -#line 502 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - yyval.SubClassRef = new SubClassRefTy(yyvsp[-3].Rec, yyvsp[-1].FieldList); - ;} - break; - - case 58: -#line 506 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - yyval.SubClassList = new std::vector(); - yyval.SubClassList->push_back(*yyvsp[0].SubClassRef); - delete yyvsp[0].SubClassRef; - ;} - break; - - case 59: -#line 511 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - (yyval.SubClassList=yyvsp[-2].SubClassList)->push_back(*yyvsp[0].SubClassRef); - delete yyvsp[0].SubClassRef; - ;} - break; - - case 60: -#line 516 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - yyval.SubClassList = new std::vector(); - ;} - break; - - case 61: -#line 519 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - yyval.SubClassList = yyvsp[0].SubClassList; - ;} - break; - - case 62: -#line 523 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - CurRec->addTemplateArg(*yyvsp[0].StrVal); - delete yyvsp[0].StrVal; -;} - break; - - case 63: -#line 526 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - CurRec->addTemplateArg(*yyvsp[0].StrVal); - delete yyvsp[0].StrVal; -;} - break; - - case 64: -#line 531 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - {;} - break; - - case 67: -#line 534 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { yyval.StrVal = yyvsp[0].StrVal; ;} - break; - - case 68: -#line 534 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { yyval.StrVal = new std::string(); ;} - break; - - case 69: -#line 536 "/home/vadve/criswell/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 70: -#line 543 "/home/vadve/criswell/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 71: -#line 561 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - CurRec = new Record(*yyvsp[0].StrVal); - delete yyvsp[0].StrVal; - - // Ensure redefinition doesn't happen. - if (Records.getDef(CurRec->getName())) { - err() << "Def '" << CurRec->getName() << "' already defined!\n"; - exit(1); - } - Records.addDef(CurRec); -;} - break; - - case 72: -#line 573 "/home/vadve/criswell/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 set 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 73: -#line 587 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - yyval.Rec = CurRec; - CurRec = 0; - ;} - break; - - case 74: -#line 592 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - ParsingTemplateArgs = true; - ;} - break; - - case 75: -#line 594 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - ParsingTemplateArgs = false; - ;} - break; - - case 76: -#line 596 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - yyval.Rec = yyvsp[0].Rec; - ;} - break; - - case 77: -#line 600 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - 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 611 "/home/vadve/criswell/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 83: -#line 619 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { LetStack.push_back(std::vector()); ;} - break; - - case 85: -#line 622 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - LetStack.pop_back(); - ;} - break; - - case 86: -#line 625 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - { - LetStack.pop_back(); - ;} - break; - - case 87: -#line 629 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - {;} - break; - - case 88: -#line 629 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - {;} - break; - - case 89: -#line 631 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - {;} - break; - - - } - -/* Line 999 of yacc.c. */ -#line 2056 "FileParser.tab.c" - - yyvsp -= yylen; - yyssp -= yylen; - - - YY_STACK_PRINT (yyss, yyssp); - - *++yyvsp = yyval; - - - /* 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 - YYNTOKENS] + *yyssp; - if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp) - yystate = yytable[yystate]; - else - yystate = yydefgoto[yyn - YYNTOKENS]; - - goto yynewstate; - - -/*------------------------------------. -| yyerrlab -- here on detecting error | -`------------------------------------*/ -yyerrlab: - /* If not already recovering from an error, report this error. */ - if (!yyerrstatus) - { - ++yynerrs; -#if YYERROR_VERBOSE - yyn = yypact[yystate]; - - if (YYPACT_NINF < yyn && yyn < YYLAST) - { - YYSIZE_T yysize = 0; - int yytype = YYTRANSLATE (yychar); - char *yymsg; - int yyx, yycount; - - yycount = 0; - /* Start YYX at -YYN if negative to avoid negative indexes in - YYCHECK. */ - for (yyx = yyn < 0 ? -yyn : 0; - yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) - if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) - yysize += yystrlen (yytname[yyx]) + 15, yycount++; - yysize += yystrlen ("syntax error, unexpected ") + 1; - yysize += yystrlen (yytname[yytype]); - yymsg = (char *) YYSTACK_ALLOC (yysize); - if (yymsg != 0) - { - char *yyp = yystpcpy (yymsg, "syntax error, unexpected "); - yyp = yystpcpy (yyp, yytname[yytype]); - - if (yycount < 5) - { - yycount = 0; - for (yyx = yyn < 0 ? -yyn : 0; - yyx < (int) (sizeof (yytname) / sizeof (char *)); - yyx++) - if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) - { - const char *yyq = ! yycount ? ", expecting " : " or "; - yyp = yystpcpy (yyp, yyq); - yyp = yystpcpy (yyp, yytname[yyx]); - yycount++; - } - } - yyerror (yymsg); - YYSTACK_FREE (yymsg); - } - else - yyerror ("syntax error; also virtual memory exhausted"); - } - else -#endif /* YYERROR_VERBOSE */ - yyerror ("syntax error"); - } - - - - 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) - { - /* Pop the error token. */ - YYPOPSTACK; - /* Pop the rest of the stack. */ - while (yyss < yyssp) - { - YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp); - yydestruct (yystos[*yyssp], yyvsp); - YYPOPSTACK; - } - YYABORT; - } - - YYDSYMPRINTF ("Error: discarding", yytoken, &yylval, &yylloc); - yydestruct (yytoken, &yylval); - yychar = YYEMPTY; - - } - - /* Else will try to reuse lookahead token after shifting the error - token. */ - goto yyerrlab1; - - -/*----------------------------------------------------. -| yyerrlab1 -- error raised explicitly by an action. | -`----------------------------------------------------*/ -yyerrlab1: - yyerrstatus = 3; /* Each real token shifted decrements this. */ - - for (;;) - { - yyn = yypact[yystate]; - if (yyn != YYPACT_NINF) - { - yyn += YYTERROR; - if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR) - { - yyn = yytable[yyn]; - if (0 < yyn) - break; - } - } - - /* Pop the current state because it cannot handle the error token. */ - if (yyssp == yyss) - YYABORT; - - YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp); - yydestruct (yystos[yystate], yyvsp); - yyvsp--; - yystate = *--yyssp; - - YY_STACK_PRINT (yyss, yyssp); - } - - if (yyn == YYFINAL) - YYACCEPT; - - YYDPRINTF ((stderr, "Shifting error token, ")); - - *++yyvsp = yylval; - - - yystate = yyn; - goto yynewstate; - - -/*-------------------------------------. -| yyacceptlab -- YYACCEPT comes here. | -`-------------------------------------*/ -yyacceptlab: - yyresult = 0; - goto yyreturn; - -/*-----------------------------------. -| yyabortlab -- YYABORT comes here. | -`-----------------------------------*/ -yyabortlab: - yyresult = 1; - goto yyreturn; - -#ifndef yyoverflow -/*----------------------------------------------. -| yyoverflowlab -- parser overflow comes here. | -`----------------------------------------------*/ -yyoverflowlab: - yyerror ("parser stack overflow"); - yyresult = 2; - /* Fall through. */ -#endif - -yyreturn: -#ifndef yyoverflow - if (yyss != yyssa) - YYSTACK_FREE (yyss); -#endif - return yyresult; -} - - -#line 633 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" - - -int yyerror(const char *ErrorMsg) { - err() << "Error parsing: " << ErrorMsg << "\n"; - exit(1); -} - diff --git a/utils/TableGen/FileParser.cpp.cvs b/utils/TableGen/FileParser.cpp.cvs new file mode 100644 index 00000000000..9ed36d0615b --- /dev/null +++ b/utils/TableGen/FileParser.cpp.cvs @@ -0,0 +1,2257 @@ +/* A Bison parser, made by GNU Bison 1.875. */ + +/* Skeleton parser for Yacc-like parsing with Bison, + Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 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. */ + +/* Written by Richard Stallman by simplifying the original so called + ``semantic'' parser. */ + +/* All symbols defined below should begin with yy or YY, to avoid + infringing on user name space. This should be done even for local + variables, as they might otherwise be expanded by user macros. + There are some unavoidable exceptions within include files to + define necessary library symbols; they are noted "INFRINGES ON + USER NAME SPACE" below. */ + +/* Identify Bison output. */ +#define YYBISON 1 + +/* Skeleton name. */ +#define YYSKELETON_NAME "yacc.c" + +/* Pure parsers. */ +#define YYPURE 0 + +/* Using locations. */ +#define YYLSP_NEEDED 0 + +/* If NAME_PREFIX is specified substitute the variables and functions + names. */ +#define yyparse Fileparse +#define yylex Filelex +#define yyerror Fileerror +#define yylval Filelval +#define yychar Filechar +#define yydebug Filedebug +#define yynerrs Filenerrs + + +/* Tokens. */ +#ifndef YYTOKENTYPE +# define YYTOKENTYPE + /* Put the tokens into the symbol table, so that GDB and other debuggers + know about them. */ + enum yytokentype { + INT = 258, + BIT = 259, + STRING = 260, + BITS = 261, + LIST = 262, + CODE = 263, + DAG = 264, + CLASS = 265, + DEF = 266, + FIELD = 267, + LET = 268, + IN = 269, + SHLTOK = 270, + SRATOK = 271, + SRLTOK = 272, + INTVAL = 273, + ID = 274, + VARNAME = 275, + STRVAL = 276, + CODEFRAGMENT = 277 + }; +#endif +#define INT 258 +#define BIT 259 +#define STRING 260 +#define BITS 261 +#define LIST 262 +#define CODE 263 +#define DAG 264 +#define CLASS 265 +#define DEF 266 +#define FIELD 267 +#define LET 268 +#define IN 269 +#define SHLTOK 270 +#define SRATOK 271 +#define SRLTOK 272 +#define INTVAL 273 +#define ID 274 +#define VARNAME 275 +#define STRVAL 276 +#define CODEFRAGMENT 277 + + + + +/* Copy the first part of user declarations. */ +#line 14 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + +#include "Record.h" +#include "llvm/ADT/StringExtras.h" +#include +#include +#define YYERROR_VERBOSE 1 + +int yyerror(const char *ErrorMsg); +int yylex(); + +namespace llvm { + +extern int Filelineno; +static Record *CurRec = 0; +static bool ParsingTemplateArgs = false; + +typedef std::pair*> SubClassRefTy; + +struct LetRecord { + std::string Name; + std::vector Bits; + Init *Value; + bool HasBits; + LetRecord(const std::string &N, std::vector *B, Init *V) + : Name(N), Value(V), HasBits(B != 0) { + if (HasBits) Bits = *B; + } +}; + +static std::vector > LetStack; + + +extern std::ostream &err(); + +static void addValue(const RecordVal &RV) { + if (RecordVal *ERV = CurRec->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 { + CurRec->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 *BitList, Init *V) { + if (!V) return; + + RecordVal *RV = CurRec->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(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(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(BI) != 0 || &(std::cerr << *BI) == 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 &TemplateArgs) { + // Add all of the values in the subclass into the current class... + const std::vector &Vals = SC->getValues(); + for (unsigned i = 0, e = Vals.size(); i != e; ++i) + addValue(Vals[i]); + + const std::vector &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); + } else { // This class expects template arguments... + // 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 &SCs = SC->getSuperClasses(); + for (unsigned i = 0, e = SCs.size(); i != e; ++i) + addSuperClass(SCs[i]); + addSuperClass(SC); +} + +} // End llvm namespace + +using namespace llvm; + + + +/* Enabling traces. */ +#ifndef YYDEBUG +# define YYDEBUG 0 +#endif + +/* Enabling verbose error messages. */ +#ifdef YYERROR_VERBOSE +# undef YYERROR_VERBOSE +# define YYERROR_VERBOSE 1 +#else +# define YYERROR_VERBOSE 0 +#endif + +#if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED) +#line 189 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" +typedef union YYSTYPE { + std::string* StrVal; + int IntVal; + llvm::RecTy* Ty; + llvm::Init* Initializer; + std::vector* FieldList; + std::vector* BitList; + llvm::Record* Rec; + SubClassRefTy* SubClassRef; + std::vector* SubClassList; + std::vector >* DagValueList; +} YYSTYPE; +/* Line 191 of yacc.c. */ +#line 316 "FileParser.tab.c" +# define yystype YYSTYPE /* obsolescent; will be withdrawn */ +# define YYSTYPE_IS_DECLARED 1 +# define YYSTYPE_IS_TRIVIAL 1 +#endif + + + +/* Copy the second part of user declarations. */ + + +/* Line 214 of yacc.c. */ +#line 328 "FileParser.tab.c" + +#if ! defined (yyoverflow) || YYERROR_VERBOSE + +/* The parser invokes alloca or malloc; define the necessary symbols. */ + +# if YYSTACK_USE_ALLOCA +# define YYSTACK_ALLOC alloca +# else +# ifndef YYSTACK_USE_ALLOCA +# if defined (alloca) || defined (_ALLOCA_H) +# define YYSTACK_ALLOC alloca +# else +# ifdef __GNUC__ +# define YYSTACK_ALLOC __builtin_alloca +# endif +# endif +# endif +# endif + +# ifdef YYSTACK_ALLOC + /* Pacify GCC's `empty if-body' warning. */ +# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) +# else +# if defined (__STDC__) || defined (__cplusplus) +# include /* INFRINGES ON USER NAME SPACE */ +# define YYSIZE_T size_t +# endif +# define YYSTACK_ALLOC malloc +# define YYSTACK_FREE free +# endif +#endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */ + + +#if (! defined (yyoverflow) \ + && (! defined (__cplusplus) \ + || (YYSTYPE_IS_TRIVIAL))) + +/* A type that is properly aligned for any stack member. */ +union yyalloc +{ + short yyss; + YYSTYPE yyvs; + }; + +/* The size of the maximum gap between one aligned stack and the next. */ +# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1) + +/* The size of an array large to enough to hold all stacks, each with + N elements. */ +# define YYSTACK_BYTES(N) \ + ((N) * (sizeof (short) + sizeof (YYSTYPE)) \ + + YYSTACK_GAP_MAXIMUM) + +/* Copy COUNT objects from FROM to TO. The source and destination do + not overlap. */ +# ifndef YYCOPY +# if 1 < __GNUC__ +# define YYCOPY(To, From, Count) \ + __builtin_memcpy (To, From, (Count) * sizeof (*(From))) +# else +# define YYCOPY(To, From, Count) \ + do \ + { \ + register YYSIZE_T yyi; \ + for (yyi = 0; yyi < (Count); yyi++) \ + (To)[yyi] = (From)[yyi]; \ + } \ + while (0) +# endif +# endif + +/* Relocate STACK from its old location to the new one. The + local variables YYSIZE and YYSTACKSIZE give the old and new number of + elements in the stack, and YYPTR gives the new location of the + stack. Advance YYPTR to a properly aligned location for the next + stack. */ +# define YYSTACK_RELOCATE(Stack) \ + do \ + { \ + YYSIZE_T yynewbytes; \ + YYCOPY (&yyptr->Stack, Stack, yysize); \ + Stack = &yyptr->Stack; \ + yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ + yyptr += yynewbytes / sizeof (*yyptr); \ + } \ + while (0) + +#endif + +#if defined (__STDC__) || defined (__cplusplus) + typedef signed char yysigned_char; +#else + typedef short yysigned_char; +#endif + +/* YYFINAL -- State number of the termination state. */ +#define YYFINAL 20 +/* YYLAST -- Last index in YYTABLE. */ +#define YYLAST 163 + +/* YYNTOKENS -- Number of terminals. */ +#define YYNTOKENS 38 +/* YYNNTS -- Number of nonterminals. */ +#define YYNNTS 41 +/* YYNRULES -- Number of rules. */ +#define YYNRULES 89 +/* YYNRULES -- Number of states. */ +#define YYNSTATES 160 + +/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ +#define YYUNDEFTOK 2 +#define YYMAXUTOK 277 + +#define YYTRANSLATE(YYX) \ + ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) + +/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */ +static const unsigned 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, + 32, 33, 2, 2, 34, 36, 31, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 35, 37, + 23, 25, 24, 26, 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, 29, 2, 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, 2, 2, 27, 2, 28, 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, 2, 3, 4, + 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, + 15, 16, 17, 18, 19, 20, 21, 22 +}; + +#if YYDEBUG +/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in + YYRHS. */ +static const unsigned short yyprhs[] = +{ + 0, 0, 3, 5, 7, 9, 14, 16, 21, 23, + 25, 27, 28, 30, 31, 34, 36, 38, 40, 42, + 46, 51, 53, 58, 62, 66, 71, 76, 83, 90, + 97, 98, 101, 104, 109, 110, 112, 114, 118, 121, + 125, 131, 136, 138, 139, 143, 144, 146, 148, 152, + 157, 160, 167, 168, 171, 173, 177, 179, 184, 186, + 190, 191, 194, 196, 200, 204, 205, 207, 209, 210, + 212, 214, 216, 217, 221, 222, 223, 230, 234, 236, + 238, 243, 245, 249, 250, 255, 260, 263, 265, 268 +}; + +/* YYRHS -- A `-1'-separated list of the rules' RHS. */ +static const yysigned_char yyrhs[] = +{ + 78, 0, -1, 19, -1, 5, -1, 4, -1, 6, + 23, 18, 24, -1, 3, -1, 7, 23, 40, 24, + -1, 8, -1, 9, -1, 39, -1, -1, 12, -1, + -1, 25, 43, -1, 18, -1, 21, -1, 22, -1, + 26, -1, 27, 50, 28, -1, 19, 23, 51, 24, + -1, 19, -1, 43, 27, 48, 28, -1, 29, 50, + 30, -1, 43, 31, 19, -1, 32, 19, 46, 33, + -1, 43, 29, 48, 30, -1, 15, 32, 43, 34, + 43, 33, -1, 16, 32, 43, 34, 43, 33, -1, + 17, 32, 43, 34, 43, 33, -1, -1, 35, 20, + -1, 43, 44, -1, 45, 34, 43, 44, -1, -1, + 45, -1, 18, -1, 18, 36, 18, -1, 18, 18, + -1, 47, 34, 18, -1, 47, 34, 18, 36, 18, + -1, 47, 34, 18, 18, -1, 47, -1, -1, 27, + 48, 28, -1, -1, 51, -1, 43, -1, 51, 34, + 43, -1, 41, 40, 19, 42, -1, 52, 37, -1, + 13, 19, 49, 25, 43, 37, -1, -1, 54, 53, + -1, 37, -1, 27, 54, 28, -1, 39, -1, 39, + 23, 51, 24, -1, 56, -1, 57, 34, 56, -1, + -1, 35, 57, -1, 52, -1, 59, 34, 52, -1, + 23, 59, 24, -1, -1, 60, -1, 19, -1, -1, + 62, -1, 63, -1, 63, -1, -1, 58, 67, 55, + -1, -1, -1, 10, 64, 69, 61, 70, 66, -1, + 11, 65, 66, -1, 68, -1, 71, -1, 19, 49, + 25, 43, -1, 73, -1, 74, 34, 73, -1, -1, + 13, 76, 74, 14, -1, 75, 27, 77, 28, -1, + 75, 72, -1, 72, -1, 77, 72, -1, 77, -1 +}; + +/* YYRLINE[YYN] -- source line where rule number YYN was defined. */ +static const unsigned short yyrline[] = +{ + 0, 223, 223, 234, 236, 238, 240, 242, 244, 246, + 248, 252, 252, 254, 254, 256, 258, 261, 264, 266, + 279, 307, 322, 329, 332, 339, 347, 355, 361, 367, + 375, 378, 382, 387, 393, 396, 399, 402, 415, 429, + 431, 444, 460, 462, 462, 466, 468, 472, 475, 479, + 489, 491, 497, 497, 498, 498, 500, 502, 506, 511, + 516, 519, 523, 526, 531, 532, 532, 534, 534, 536, + 543, 561, 573, 573, 592, 594, 592, 600, 609, 609, + 611, 616, 616, 619, 619, 622, 625, 629, 629, 631 +}; +#endif + +#if YYDEBUG || YYERROR_VERBOSE +/* YYTNME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. + First, the terminals, then, starting at YYNTOKENS, nonterminals. */ +static const char *const yytname[] = +{ + "$end", "error", "$undefined", "INT", "BIT", "STRING", "BITS", "LIST", + "CODE", "DAG", "CLASS", "DEF", "FIELD", "LET", "IN", "SHLTOK", "SRATOK", + "SRLTOK", "INTVAL", "ID", "VARNAME", "STRVAL", "CODEFRAGMENT", "'<'", + "'>'", "'='", "'?'", "'{'", "'}'", "'['", "']'", "'.'", "'('", "')'", + "','", "':'", "'-'", "';'", "$accept", "ClassID", "Type", "OptPrefix", + "OptValue", "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", "Object", + "LETItem", "LETList", "LETCommand", "@4", "ObjectList", "File", 0 +}; +#endif + +# ifdef YYPRINT +/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to + token YYLEX-NUM. */ +static const unsigned short yytoknum[] = +{ + 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, + 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, + 275, 276, 277, 60, 62, 61, 63, 123, 125, 91, + 93, 46, 40, 41, 44, 58, 45, 59 +}; +# endif + +/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ +static const unsigned char yyr1[] = +{ + 0, 38, 39, 40, 40, 40, 40, 40, 40, 40, + 40, 41, 41, 42, 42, 43, 43, 43, 43, 43, + 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, + 44, 44, 45, 45, 46, 46, 47, 47, 47, 47, + 47, 47, 48, 49, 49, 50, 50, 51, 51, 52, + 53, 53, 54, 54, 55, 55, 56, 56, 57, 57, + 58, 58, 59, 59, 60, 61, 61, 62, 62, 63, + 64, 65, 67, 66, 69, 70, 68, 71, 72, 72, + 73, 74, 74, 76, 75, 72, 72, 77, 77, 78 +}; + +/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ +static const unsigned char yyr2[] = +{ + 0, 2, 1, 1, 1, 4, 1, 4, 1, 1, + 1, 0, 1, 0, 2, 1, 1, 1, 1, 3, + 4, 1, 4, 3, 3, 4, 4, 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, + 4, 1, 3, 0, 4, 4, 2, 1, 2, 1 +}; + +/* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state + STATE-NUM when YYTABLE doesn't specify something else to do. Zero + means the default is an error. */ +static const unsigned char yydefact[] = +{ + 0, 68, 68, 83, 78, 79, 87, 0, 89, 0, + 67, 69, 70, 74, 71, 60, 0, 0, 86, 88, + 1, 65, 0, 72, 77, 43, 81, 0, 0, 11, + 66, 75, 2, 56, 58, 61, 0, 0, 0, 84, + 0, 85, 12, 0, 62, 0, 60, 0, 0, 52, + 54, 73, 36, 42, 0, 0, 82, 6, 4, 3, + 0, 0, 8, 9, 10, 0, 64, 11, 76, 0, + 0, 0, 15, 21, 16, 17, 18, 45, 45, 0, + 47, 0, 59, 11, 38, 0, 0, 44, 80, 0, + 0, 13, 63, 0, 0, 0, 0, 0, 46, 0, + 34, 0, 0, 0, 57, 0, 0, 55, 0, 53, + 37, 39, 0, 0, 0, 49, 0, 0, 0, 0, + 19, 23, 30, 35, 0, 0, 0, 24, 48, 43, + 50, 41, 0, 5, 7, 14, 0, 0, 0, 20, + 0, 32, 0, 25, 22, 26, 0, 40, 0, 0, + 0, 31, 30, 0, 27, 28, 29, 33, 0, 51 +}; + +/* YYDEFGOTO[NTERM-NUM]. */ +static const short yydefgoto[] = +{ + -1, 33, 65, 43, 115, 80, 141, 123, 124, 53, + 54, 38, 97, 98, 44, 109, 83, 51, 34, 35, + 23, 45, 30, 31, 11, 12, 13, 15, 24, 36, + 4, 21, 46, 5, 6, 26, 27, 7, 16, 8, + 9 +}; + +/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing + STATE-NUM. */ +#define YYPACT_NINF -82 +static const yysigned_char yypact[] = +{ + 114, -12, -12, -82, -82, -82, -82, 4, 114, 16, + -82, -82, -82, -82, -82, -3, 10, 114, -82, -82, + -82, 12, 17, -82, -82, 14, -82, -9, -2, 35, + -82, -82, -82, 26, -82, 28, -14, 46, 42, -82, + 10, -82, -82, 69, -82, 3, -3, 39, 17, -82, + -82, -82, -8, 36, 41, 39, -82, -82, -82, -82, + 56, 57, -82, -82, -82, 66, -82, 35, -82, 52, + 54, 58, -82, 72, -82, -82, -82, 39, 39, 87, + 91, 9, -82, 6, -82, 108, 110, -82, 91, 111, + 69, 105, -82, 39, 39, 39, 39, 103, 98, 104, + 39, 46, 46, 116, -82, 39, 117, -82, 96, -82, + -82, -6, 113, 115, 39, -82, 65, 73, 74, 29, + -82, -82, 62, 106, 109, 118, 119, -82, 91, 14, + -82, -82, 120, -82, -82, 91, 39, 39, 39, -82, + 121, -82, 39, -82, -82, -82, 122, -82, 82, 83, + 90, -82, 62, 39, -82, -82, -82, -82, 15, -82 +}; + +/* YYPGOTO[NTERM-NUM]. */ +static const short yypgoto[] = +{ + -82, -42, 53, -82, -82, -55, -7, -82, -82, -82, + -81, 19, 75, -45, -61, -82, -82, -82, 102, -82, + -82, -82, -82, -82, -82, 142, -82, -82, 112, -82, + -82, -82, -82, -82, -4, 123, -82, -82, -82, 134, + -82 +}; + +/* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If + positive, shift that token. If negative, reduce the rule which + number is the opposite. If zero, do what YYDEFACT says. + If YYTABLE_NINF, syntax error. */ +#define YYTABLE_NINF -1 +static const unsigned char yytable[] = +{ + 88, 64, 81, 18, 19, 39, 92, 10, 1, 2, + 84, 3, 131, 49, 1, 2, 20, 3, 42, 106, + 125, 126, 108, 50, 19, 40, 41, 66, 85, 25, + 132, 17, 22, 104, 107, 29, 32, 67, 116, 117, + 118, 37, 101, 105, 102, 122, 103, 42, 64, 47, + 128, 119, 159, 139, 69, 70, 71, 72, 73, 135, + 74, 75, 48, 105, 52, 76, 77, 55, 78, 87, + 86, 79, 57, 58, 59, 60, 61, 62, 63, 89, + 90, 148, 149, 150, 93, 91, 94, 152, 32, 101, + 95, 102, 101, 103, 102, 96, 103, 140, 158, 136, + 101, 101, 102, 102, 103, 103, 100, 137, 138, 101, + 101, 102, 102, 103, 103, 154, 155, 101, 101, 102, + 102, 103, 103, 156, 1, 2, 110, 3, 111, 112, + 114, 120, 105, 130, 121, 127, 129, 133, 147, 134, + 142, 151, 143, 113, 14, 157, 144, 153, 146, 145, + 82, 28, 0, 99, 0, 0, 0, 0, 68, 0, + 0, 0, 0, 56 +}; + +static const short yycheck[] = +{ + 55, 43, 47, 7, 8, 14, 67, 19, 10, 11, + 18, 13, 18, 27, 10, 11, 0, 13, 12, 13, + 101, 102, 83, 37, 28, 34, 28, 24, 36, 19, + 36, 27, 35, 24, 28, 23, 19, 34, 93, 94, + 95, 27, 27, 34, 29, 100, 31, 12, 90, 23, + 105, 96, 37, 24, 15, 16, 17, 18, 19, 114, + 21, 22, 34, 34, 18, 26, 27, 25, 29, 28, + 34, 32, 3, 4, 5, 6, 7, 8, 9, 23, + 23, 136, 137, 138, 32, 19, 32, 142, 19, 27, + 32, 29, 27, 31, 29, 23, 31, 35, 153, 34, + 27, 27, 29, 29, 31, 31, 19, 34, 34, 27, + 27, 29, 29, 31, 31, 33, 33, 27, 27, 29, + 29, 31, 31, 33, 10, 11, 18, 13, 18, 18, + 25, 28, 34, 37, 30, 19, 19, 24, 18, 24, + 34, 20, 33, 90, 2, 152, 28, 25, 129, 30, + 48, 17, -1, 78, -1, -1, -1, -1, 46, -1, + -1, -1, -1, 40 +}; + +/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing + symbol of state STATE-NUM. */ +static const unsigned char yystos[] = +{ + 0, 10, 11, 13, 68, 71, 72, 75, 77, 78, + 19, 62, 63, 64, 63, 65, 76, 27, 72, 72, + 0, 69, 35, 58, 66, 19, 73, 74, 77, 23, + 60, 61, 19, 39, 56, 57, 67, 27, 49, 14, + 34, 28, 12, 41, 52, 59, 70, 23, 34, 27, + 37, 55, 18, 47, 48, 25, 73, 3, 4, 5, + 6, 7, 8, 9, 39, 40, 24, 34, 66, 15, + 16, 17, 18, 19, 21, 22, 26, 27, 29, 32, + 43, 51, 56, 54, 18, 36, 34, 28, 43, 23, + 23, 19, 52, 32, 32, 32, 23, 50, 51, 50, + 19, 27, 29, 31, 24, 34, 13, 28, 52, 53, + 18, 18, 18, 40, 25, 42, 43, 43, 43, 51, + 28, 30, 43, 45, 46, 48, 48, 19, 43, 19, + 37, 18, 36, 24, 24, 43, 34, 34, 34, 24, + 35, 44, 34, 33, 28, 30, 49, 18, 43, 43, + 43, 20, 43, 25, 33, 33, 33, 44, 43, 37 +}; + +#if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__) +# define YYSIZE_T __SIZE_TYPE__ +#endif +#if ! defined (YYSIZE_T) && defined (size_t) +# define YYSIZE_T size_t +#endif +#if ! defined (YYSIZE_T) +# if defined (__STDC__) || defined (__cplusplus) +# include /* INFRINGES ON USER NAME SPACE */ +# define YYSIZE_T size_t +# endif +#endif +#if ! defined (YYSIZE_T) +# define YYSIZE_T unsigned int +#endif + +#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); \ + yytoken = YYTRANSLATE (yychar); \ + YYPOPSTACK; \ + goto yybackup; \ + } \ + else \ + { \ + yyerror ("syntax error: cannot back up");\ + YYERROR; \ + } \ +while (0) + +#define YYTERROR 1 +#define YYERRCODE 256 + +/* YYLLOC_DEFAULT -- Compute the default location (before the actions + are run). */ + +#ifndef YYLLOC_DEFAULT +# define YYLLOC_DEFAULT(Current, Rhs, N) \ + Current.first_line = Rhs[1].first_line; \ + Current.first_column = Rhs[1].first_column; \ + Current.last_line = Rhs[N].last_line; \ + Current.last_column = Rhs[N].last_column; +#endif + +/* YYLEX -- calling `yylex' with the right arguments. */ + +#ifdef YYLEX_PARAM +# define YYLEX yylex (YYLEX_PARAM) +#else +# define YYLEX yylex () +#endif + +/* Enable debugging if requested. */ +#if YYDEBUG + +# ifndef YYFPRINTF +# include /* INFRINGES ON USER NAME SPACE */ +# define YYFPRINTF fprintf +# endif + +# define YYDPRINTF(Args) \ +do { \ + if (yydebug) \ + YYFPRINTF Args; \ +} while (0) + +# define YYDSYMPRINT(Args) \ +do { \ + if (yydebug) \ + yysymprint Args; \ +} while (0) + +# define YYDSYMPRINTF(Title, Token, Value, Location) \ +do { \ + if (yydebug) \ + { \ + YYFPRINTF (stderr, "%s ", Title); \ + yysymprint (stderr, \ + Token, Value); \ + YYFPRINTF (stderr, "\n"); \ + } \ +} while (0) + +/*------------------------------------------------------------------. +| yy_stack_print -- Print the state stack from its BOTTOM up to its | +| TOP (cinluded). | +`------------------------------------------------------------------*/ + +#if defined (__STDC__) || defined (__cplusplus) +static void +yy_stack_print (short *bottom, short *top) +#else +static void +yy_stack_print (bottom, top) + short *bottom; + short *top; +#endif +{ + YYFPRINTF (stderr, "Stack now"); + for (/* Nothing. */; bottom <= top; ++bottom) + YYFPRINTF (stderr, " %d", *bottom); + YYFPRINTF (stderr, "\n"); +} + +# define YY_STACK_PRINT(Bottom, Top) \ +do { \ + if (yydebug) \ + yy_stack_print ((Bottom), (Top)); \ +} while (0) + + +/*------------------------------------------------. +| Report that the YYRULE is going to be reduced. | +`------------------------------------------------*/ + +#if defined (__STDC__) || defined (__cplusplus) +static void +yy_reduce_print (int yyrule) +#else +static void +yy_reduce_print (yyrule) + int yyrule; +#endif +{ + int yyi; + unsigned int yylineno = yyrline[yyrule]; + YYFPRINTF (stderr, "Reducing stack by rule %d (line %u), ", + yyrule - 1, yylineno); + /* Print the symbols being reduced, and their result. */ + for (yyi = yyprhs[yyrule]; 0 <= yyrhs[yyi]; yyi++) + YYFPRINTF (stderr, "%s ", yytname [yyrhs[yyi]]); + YYFPRINTF (stderr, "-> %s\n", yytname [yyr1[yyrule]]); +} + +# define YY_REDUCE_PRINT(Rule) \ +do { \ + if (yydebug) \ + yy_reduce_print (Rule); \ +} while (0) + +/* Nonzero means print parse trace. It is left uninitialized so that + multiple parsers can coexist. */ +int yydebug; +#else /* !YYDEBUG */ +# define YYDPRINTF(Args) +# define YYDSYMPRINT(Args) +# define YYDSYMPRINTF(Title, Token, Value, Location) +# define YY_STACK_PRINT(Bottom, Top) +# define YY_REDUCE_PRINT(Rule) +#endif /* !YYDEBUG */ + + +/* YYINITDEPTH -- initial size of the parser's stacks. */ +#ifndef YYINITDEPTH +# define YYINITDEPTH 200 +#endif + +/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only + if the built-in stack extension method is used). + + Do not make this value too large; the results are undefined if + SIZE_MAX < YYSTACK_BYTES (YYMAXDEPTH) + evaluated with infinite-precision integer arithmetic. */ + +#if YYMAXDEPTH == 0 +# undef YYMAXDEPTH +#endif + +#ifndef YYMAXDEPTH +# define YYMAXDEPTH 10000 +#endif + + + +#if YYERROR_VERBOSE + +# ifndef yystrlen +# if defined (__GLIBC__) && defined (_STRING_H) +# define yystrlen strlen +# else +/* Return the length of YYSTR. */ +static YYSIZE_T +# if defined (__STDC__) || defined (__cplusplus) +yystrlen (const char *yystr) +# else +yystrlen (yystr) + const char *yystr; +# endif +{ + register const char *yys = yystr; + + while (*yys++ != '\0') + continue; + + return yys - yystr - 1; +} +# endif +# endif + +# ifndef yystpcpy +# if defined (__GLIBC__) && defined (_STRING_H) && defined (_GNU_SOURCE) +# define yystpcpy stpcpy +# else +/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in + YYDEST. */ +static char * +# if defined (__STDC__) || defined (__cplusplus) +yystpcpy (char *yydest, const char *yysrc) +# else +yystpcpy (yydest, yysrc) + char *yydest; + const char *yysrc; +# endif +{ + register char *yyd = yydest; + register const char *yys = yysrc; + + while ((*yyd++ = *yys++) != '\0') + continue; + + return yyd - 1; +} +# endif +# endif + +#endif /* !YYERROR_VERBOSE */ + + + +#if YYDEBUG +/*--------------------------------. +| Print this symbol on YYOUTPUT. | +`--------------------------------*/ + +#if defined (__STDC__) || defined (__cplusplus) +static void +yysymprint (FILE *yyoutput, int yytype, YYSTYPE *yyvaluep) +#else +static void +yysymprint (yyoutput, yytype, yyvaluep) + FILE *yyoutput; + int yytype; + YYSTYPE *yyvaluep; +#endif +{ + /* Pacify ``unused variable'' warnings. */ + (void) yyvaluep; + + if (yytype < YYNTOKENS) + { + YYFPRINTF (yyoutput, "token %s (", yytname[yytype]); +# ifdef YYPRINT + YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); +# endif + } + else + YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]); + + switch (yytype) + { + default: + break; + } + YYFPRINTF (yyoutput, ")"); +} + +#endif /* ! YYDEBUG */ +/*-----------------------------------------------. +| Release the memory associated to this symbol. | +`-----------------------------------------------*/ + +#if defined (__STDC__) || defined (__cplusplus) +static void +yydestruct (int yytype, YYSTYPE *yyvaluep) +#else +static void +yydestruct (yytype, yyvaluep) + int yytype; + YYSTYPE *yyvaluep; +#endif +{ + /* Pacify ``unused variable'' warnings. */ + (void) yyvaluep; + + switch (yytype) + { + + default: + break; + } +} + + +/* Prevent warnings from -Wmissing-prototypes. */ + +#ifdef YYPARSE_PARAM +# if defined (__STDC__) || defined (__cplusplus) +int yyparse (void *YYPARSE_PARAM); +# else +int yyparse (); +# endif +#else /* ! YYPARSE_PARAM */ +#if defined (__STDC__) || defined (__cplusplus) +int yyparse (void); +#else +int yyparse (); +#endif +#endif /* ! YYPARSE_PARAM */ + + + +/* The lookahead symbol. */ +int yychar; + +/* The semantic value of the lookahead symbol. */ +YYSTYPE yylval; + +/* Number of syntax errors so far. */ +int yynerrs; + + + +/*----------. +| yyparse. | +`----------*/ + +#ifdef YYPARSE_PARAM +# if defined (__STDC__) || defined (__cplusplus) +int yyparse (void *YYPARSE_PARAM) +# else +int yyparse (YYPARSE_PARAM) + void *YYPARSE_PARAM; +# endif +#else /* ! YYPARSE_PARAM */ +#if defined (__STDC__) || defined (__cplusplus) +int +yyparse (void) +#else +int +yyparse () + +#endif +#endif +{ + + register int yystate; + register int yyn; + int yyresult; + /* Number of tokens to shift before error messages enabled. */ + int yyerrstatus; + /* Lookahead token as an internal (translated) token number. */ + int yytoken = 0; + + /* Three stacks and their tools: + `yyss': related to states, + `yyvs': related to semantic values, + `yyls': related to locations. + + Refer to the stacks thru separate pointers, to allow yyoverflow + to reallocate them elsewhere. */ + + /* The state stack. */ + short yyssa[YYINITDEPTH]; + short *yyss = yyssa; + register short *yyssp; + + /* The semantic value stack. */ + YYSTYPE yyvsa[YYINITDEPTH]; + YYSTYPE *yyvs = yyvsa; + register YYSTYPE *yyvsp; + + + +#define YYPOPSTACK (yyvsp--, yyssp--) + + YYSIZE_T yystacksize = YYINITDEPTH; + + /* The variables used to return semantic value and location from the + action routines. */ + YYSTYPE yyval; + + + /* When reducing, the number of symbols on the RHS of the reduced + rule. */ + int yylen; + + YYDPRINTF ((stderr, "Starting parse\n")); + + 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; + yyvsp = yyvs; + + goto yysetstate; + +/*------------------------------------------------------------. +| yynewstate -- Push a new state, which is found in yystate. | +`------------------------------------------------------------*/ + yynewstate: + /* In all cases, when you get here, the value and location stacks + have just been pushed. so pushing a state here evens the stacks. + */ + yyssp++; + + yysetstate: + *yyssp = yystate; + + if (yyss + yystacksize - 1 <= yyssp) + { + /* Get the current used size of the three stacks, in elements. */ + YYSIZE_T yysize = yyssp - yyss + 1; + +#ifdef yyoverflow + { + /* 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; + + + /* Each stack pointer address is followed by the size of the + data in use in that stack, in bytes. 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, yysize * sizeof (*yyssp), + &yyvs1, yysize * sizeof (*yyvsp), + + &yystacksize); + + yyss = yyss1; + yyvs = yyvs1; + } +#else /* no yyoverflow */ +# ifndef YYSTACK_RELOCATE + goto yyoverflowlab; +# else + /* Extend the stack our own way. */ + if (YYMAXDEPTH <= yystacksize) + goto yyoverflowlab; + yystacksize *= 2; + if (YYMAXDEPTH < yystacksize) + yystacksize = YYMAXDEPTH; + + { + short *yyss1 = yyss; + union yyalloc *yyptr = + (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); + if (! yyptr) + goto yyoverflowlab; + YYSTACK_RELOCATE (yyss); + YYSTACK_RELOCATE (yyvs); + +# undef YYSTACK_RELOCATE + if (yyss1 != yyssa) + YYSTACK_FREE (yyss1); + } +# endif +#endif /* no yyoverflow */ + + yyssp = yyss + yysize - 1; + yyvsp = yyvs + yysize - 1; + + + YYDPRINTF ((stderr, "Stack size increased to %lu\n", + (unsigned long int) yystacksize)); + + if (yyss + yystacksize - 1 <= yyssp) + YYABORT; + } + + YYDPRINTF ((stderr, "Entering state %d\n", yystate)); + + goto yybackup; + +/*-----------. +| 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 == YYPACT_NINF) + goto yydefault; + + /* Not known => get a lookahead token if don't already have one. */ + + /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */ + if (yychar == YYEMPTY) + { + YYDPRINTF ((stderr, "Reading a token: ")); + yychar = YYLEX; + } + + if (yychar <= YYEOF) + { + yychar = yytoken = YYEOF; + YYDPRINTF ((stderr, "Now at end of input.\n")); + } + else + { + yytoken = YYTRANSLATE (yychar); + YYDSYMPRINTF ("Next token is", yytoken, &yylval, &yylloc); + } + + /* If the proper action on seeing token YYTOKEN is to reduce or to + detect an error, take that action. */ + yyn += yytoken; + if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken) + goto yydefault; + yyn = yytable[yyn]; + if (yyn <= 0) + { + if (yyn == 0 || yyn == YYTABLE_NINF) + goto yyerrlab; + yyn = -yyn; + goto yyreduce; + } + + if (yyn == YYFINAL) + YYACCEPT; + + /* Shift the lookahead token. */ + YYDPRINTF ((stderr, "Shifting token %s, ", yytname[yytoken])); + + /* Discard the token being shifted unless it is eof. */ + if (yychar != YYEOF) + yychar = YYEMPTY; + + *++yyvsp = yylval; + + + /* Count tokens shifted since error; after three, turn off error + status. */ + if (yyerrstatus) + yyerrstatus--; + + yystate = yyn; + goto yynewstate; + + +/*-----------------------------------------------------------. +| yydefault -- do the default action for the current state. | +`-----------------------------------------------------------*/ +yydefault: + yyn = yydefact[yystate]; + if (yyn == 0) + goto yyerrlab; + goto yyreduce; + + +/*-----------------------------. +| yyreduce -- Do a reduction. | +`-----------------------------*/ +yyreduce: + /* yyn is the number of a rule to reduce with. */ + yylen = yyr2[yyn]; + + /* If YYLEN is nonzero, implement the default value of the action: + `$$ = $1'. + + Otherwise, the following line sets YYVAL to garbage. + This behavior is undocumented and Bison + users should not rely upon it. Assigning to YYVAL + unconditionally makes the parser a bit smaller, and it avoids a + GCC warning that YYVAL may be used uninitialized. */ + yyval = yyvsp[1-yylen]; + + + YY_REDUCE_PRINT (yyn); + switch (yyn) + { + case 2: +#line 223 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + 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 3: +#line 234 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { // string type + yyval.Ty = new StringRecTy(); + ;} + break; + + case 4: +#line 236 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { // bit type + yyval.Ty = new BitRecTy(); + ;} + break; + + case 5: +#line 238 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { // bits type + yyval.Ty = new BitsRecTy(yyvsp[-1].IntVal); + ;} + break; + + case 6: +#line 240 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { // int type + yyval.Ty = new IntRecTy(); + ;} + break; + + case 7: +#line 242 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { // list type + yyval.Ty = new ListRecTy(yyvsp[-1].Ty); + ;} + break; + + case 8: +#line 244 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { // code type + yyval.Ty = new CodeRecTy(); + ;} + break; + + case 9: +#line 246 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { // dag type + yyval.Ty = new DagRecTy(); + ;} + break; + + case 10: +#line 248 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { // Record Type + yyval.Ty = new RecordRecTy(yyvsp[0].Rec); + ;} + break; + + case 11: +#line 252 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { yyval.IntVal = 0; ;} + break; + + case 12: +#line 252 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { yyval.IntVal = 1; ;} + break; + + case 13: +#line 254 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { yyval.Initializer = 0; ;} + break; + + case 14: +#line 254 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { yyval.Initializer = yyvsp[0].Initializer; ;} + break; + + case 15: +#line 256 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + yyval.Initializer = new IntInit(yyvsp[0].IntVal); + ;} + break; + + case 16: +#line 258 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + yyval.Initializer = new StringInit(*yyvsp[0].StrVal); + delete yyvsp[0].StrVal; + ;} + break; + + case 17: +#line 261 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + yyval.Initializer = new CodeInit(*yyvsp[0].StrVal); + delete yyvsp[0].StrVal; + ;} + break; + + case 18: +#line 264 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + yyval.Initializer = new UnsetInit(); + ;} + break; + + case 19: +#line 266 "/home/vadve/criswell/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 20: +#line 279 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + // This is a CLASS expression. This is supposed to synthesize + // a new anonymous definition, deriving from CLASS 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 21: +#line 307 "/home/vadve/criswell/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 (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 22: +#line 322 "/home/vadve/criswell/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 329 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + yyval.Initializer = new ListInit(*yyvsp[-1].FieldList); + delete yyvsp[-1].FieldList; + ;} + break; + + case 24: +#line 332 "/home/vadve/criswell/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 339 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + Record *D = Records.getDef(*yyvsp[-2].StrVal); + if (D == 0) { + err() << "Invalid def '" << *yyvsp[-2].StrVal << "'!\n"; + exit(1); + } + yyval.Initializer = new DagInit(D, *yyvsp[-1].DagValueList); + delete yyvsp[-2].StrVal; delete yyvsp[-1].DagValueList; + ;} + break; + + case 26: +#line 347 "/home/vadve/criswell/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 355 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + yyval.Initializer = yyvsp[-3].Initializer->getBinaryOp(Init::SHL, yyvsp[-1].Initializer); + if (yyval.Initializer == 0) { + err() << "Cannot shift values '" << *yyvsp[-3].Initializer << "' and '" << *yyvsp[-1].Initializer << "'!\n"; + exit(1); + } + ;} + break; + + case 28: +#line 361 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + yyval.Initializer = yyvsp[-3].Initializer->getBinaryOp(Init::SRA, yyvsp[-1].Initializer); + if (yyval.Initializer == 0) { + err() << "Cannot shift values '" << *yyvsp[-3].Initializer << "' and '" << *yyvsp[-1].Initializer << "'!\n"; + exit(1); + } + ;} + break; + + case 29: +#line 367 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + yyval.Initializer = yyvsp[-3].Initializer->getBinaryOp(Init::SRL, yyvsp[-1].Initializer); + if (yyval.Initializer == 0) { + err() << "Cannot shift values '" << *yyvsp[-3].Initializer << "' and '" << *yyvsp[-1].Initializer << "'!\n"; + exit(1); + } + ;} + break; + + case 30: +#line 375 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + yyval.StrVal = new std::string(); + ;} + break; + + case 31: +#line 378 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + yyval.StrVal = yyvsp[0].StrVal; + ;} + break; + + case 32: +#line 382 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + yyval.DagValueList = new std::vector >(); + yyval.DagValueList->push_back(std::make_pair(yyvsp[-1].Initializer, *yyvsp[0].StrVal)); + delete yyvsp[0].StrVal; + ;} + break; + + case 33: +#line 387 "/home/vadve/criswell/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 34: +#line 393 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + yyval.DagValueList = new std::vector >(); + ;} + break; + + case 35: +#line 396 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { yyval.DagValueList = yyvsp[0].DagValueList; ;} + break; + + case 36: +#line 399 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + yyval.BitList = new std::vector(); + yyval.BitList->push_back(yyvsp[0].IntVal); + ;} + break; + + case 37: +#line 402 "/home/vadve/criswell/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(); + 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 38: +#line 415 "/home/vadve/criswell/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(); + 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 39: +#line 429 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + (yyval.BitList=yyvsp[-2].BitList)->push_back(yyvsp[0].IntVal); + ;} + break; + + case 40: +#line 431 "/home/vadve/criswell/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 41: +#line 444 "/home/vadve/criswell/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 42: +#line 460 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { yyval.BitList = yyvsp[0].BitList; std::reverse(yyvsp[0].BitList->begin(), yyvsp[0].BitList->end()); ;} + break; + + case 43: +#line 462 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { yyval.BitList = 0; ;} + break; + + case 44: +#line 462 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { yyval.BitList = yyvsp[-1].BitList; ;} + break; + + case 45: +#line 466 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + yyval.FieldList = new std::vector(); + ;} + break; + + case 46: +#line 468 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + yyval.FieldList = yyvsp[0].FieldList; + ;} + break; + + case 47: +#line 472 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + yyval.FieldList = new std::vector(); + yyval.FieldList->push_back(yyvsp[0].Initializer); + ;} + break; + + case 48: +#line 475 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + (yyval.FieldList = yyvsp[-2].FieldList)->push_back(yyvsp[0].Initializer); + ;} + break; + + case 49: +#line 479 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + std::string DecName = *yyvsp[-1].StrVal; + if (ParsingTemplateArgs) + DecName = CurRec->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 50: +#line 489 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + delete yyvsp[-1].StrVal; +;} + break; + + case 51: +#line 491 "/home/vadve/criswell/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 56: +#line 500 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + yyval.SubClassRef = new SubClassRefTy(yyvsp[0].Rec, new std::vector()); + ;} + break; + + case 57: +#line 502 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + yyval.SubClassRef = new SubClassRefTy(yyvsp[-3].Rec, yyvsp[-1].FieldList); + ;} + break; + + case 58: +#line 506 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + yyval.SubClassList = new std::vector(); + yyval.SubClassList->push_back(*yyvsp[0].SubClassRef); + delete yyvsp[0].SubClassRef; + ;} + break; + + case 59: +#line 511 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + (yyval.SubClassList=yyvsp[-2].SubClassList)->push_back(*yyvsp[0].SubClassRef); + delete yyvsp[0].SubClassRef; + ;} + break; + + case 60: +#line 516 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + yyval.SubClassList = new std::vector(); + ;} + break; + + case 61: +#line 519 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + yyval.SubClassList = yyvsp[0].SubClassList; + ;} + break; + + case 62: +#line 523 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + CurRec->addTemplateArg(*yyvsp[0].StrVal); + delete yyvsp[0].StrVal; +;} + break; + + case 63: +#line 526 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + CurRec->addTemplateArg(*yyvsp[0].StrVal); + delete yyvsp[0].StrVal; +;} + break; + + case 64: +#line 531 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + {;} + break; + + case 67: +#line 534 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { yyval.StrVal = yyvsp[0].StrVal; ;} + break; + + case 68: +#line 534 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { yyval.StrVal = new std::string(); ;} + break; + + case 69: +#line 536 "/home/vadve/criswell/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 70: +#line 543 "/home/vadve/criswell/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 71: +#line 561 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + CurRec = new Record(*yyvsp[0].StrVal); + delete yyvsp[0].StrVal; + + // Ensure redefinition doesn't happen. + if (Records.getDef(CurRec->getName())) { + err() << "Def '" << CurRec->getName() << "' already defined!\n"; + exit(1); + } + Records.addDef(CurRec); +;} + break; + + case 72: +#line 573 "/home/vadve/criswell/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 set 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 73: +#line 587 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + yyval.Rec = CurRec; + CurRec = 0; + ;} + break; + + case 74: +#line 592 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + ParsingTemplateArgs = true; + ;} + break; + + case 75: +#line 594 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + ParsingTemplateArgs = false; + ;} + break; + + case 76: +#line 596 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + yyval.Rec = yyvsp[0].Rec; + ;} + break; + + case 77: +#line 600 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + 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 611 "/home/vadve/criswell/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 83: +#line 619 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { LetStack.push_back(std::vector()); ;} + break; + + case 85: +#line 622 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + LetStack.pop_back(); + ;} + break; + + case 86: +#line 625 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + { + LetStack.pop_back(); + ;} + break; + + case 87: +#line 629 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + {;} + break; + + case 88: +#line 629 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + {;} + break; + + case 89: +#line 631 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + {;} + break; + + + } + +/* Line 999 of yacc.c. */ +#line 2056 "FileParser.tab.c" + + yyvsp -= yylen; + yyssp -= yylen; + + + YY_STACK_PRINT (yyss, yyssp); + + *++yyvsp = yyval; + + + /* 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 - YYNTOKENS] + *yyssp; + if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp) + yystate = yytable[yystate]; + else + yystate = yydefgoto[yyn - YYNTOKENS]; + + goto yynewstate; + + +/*------------------------------------. +| yyerrlab -- here on detecting error | +`------------------------------------*/ +yyerrlab: + /* If not already recovering from an error, report this error. */ + if (!yyerrstatus) + { + ++yynerrs; +#if YYERROR_VERBOSE + yyn = yypact[yystate]; + + if (YYPACT_NINF < yyn && yyn < YYLAST) + { + YYSIZE_T yysize = 0; + int yytype = YYTRANSLATE (yychar); + char *yymsg; + int yyx, yycount; + + yycount = 0; + /* Start YYX at -YYN if negative to avoid negative indexes in + YYCHECK. */ + for (yyx = yyn < 0 ? -yyn : 0; + yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) + if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) + yysize += yystrlen (yytname[yyx]) + 15, yycount++; + yysize += yystrlen ("syntax error, unexpected ") + 1; + yysize += yystrlen (yytname[yytype]); + yymsg = (char *) YYSTACK_ALLOC (yysize); + if (yymsg != 0) + { + char *yyp = yystpcpy (yymsg, "syntax error, unexpected "); + yyp = yystpcpy (yyp, yytname[yytype]); + + if (yycount < 5) + { + yycount = 0; + for (yyx = yyn < 0 ? -yyn : 0; + yyx < (int) (sizeof (yytname) / sizeof (char *)); + yyx++) + if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) + { + const char *yyq = ! yycount ? ", expecting " : " or "; + yyp = yystpcpy (yyp, yyq); + yyp = yystpcpy (yyp, yytname[yyx]); + yycount++; + } + } + yyerror (yymsg); + YYSTACK_FREE (yymsg); + } + else + yyerror ("syntax error; also virtual memory exhausted"); + } + else +#endif /* YYERROR_VERBOSE */ + yyerror ("syntax error"); + } + + + + 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) + { + /* Pop the error token. */ + YYPOPSTACK; + /* Pop the rest of the stack. */ + while (yyss < yyssp) + { + YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp); + yydestruct (yystos[*yyssp], yyvsp); + YYPOPSTACK; + } + YYABORT; + } + + YYDSYMPRINTF ("Error: discarding", yytoken, &yylval, &yylloc); + yydestruct (yytoken, &yylval); + yychar = YYEMPTY; + + } + + /* Else will try to reuse lookahead token after shifting the error + token. */ + goto yyerrlab1; + + +/*----------------------------------------------------. +| yyerrlab1 -- error raised explicitly by an action. | +`----------------------------------------------------*/ +yyerrlab1: + yyerrstatus = 3; /* Each real token shifted decrements this. */ + + for (;;) + { + yyn = yypact[yystate]; + if (yyn != YYPACT_NINF) + { + yyn += YYTERROR; + if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR) + { + yyn = yytable[yyn]; + if (0 < yyn) + break; + } + } + + /* Pop the current state because it cannot handle the error token. */ + if (yyssp == yyss) + YYABORT; + + YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp); + yydestruct (yystos[yystate], yyvsp); + yyvsp--; + yystate = *--yyssp; + + YY_STACK_PRINT (yyss, yyssp); + } + + if (yyn == YYFINAL) + YYACCEPT; + + YYDPRINTF ((stderr, "Shifting error token, ")); + + *++yyvsp = yylval; + + + yystate = yyn; + goto yynewstate; + + +/*-------------------------------------. +| yyacceptlab -- YYACCEPT comes here. | +`-------------------------------------*/ +yyacceptlab: + yyresult = 0; + goto yyreturn; + +/*-----------------------------------. +| yyabortlab -- YYABORT comes here. | +`-----------------------------------*/ +yyabortlab: + yyresult = 1; + goto yyreturn; + +#ifndef yyoverflow +/*----------------------------------------------. +| yyoverflowlab -- parser overflow comes here. | +`----------------------------------------------*/ +yyoverflowlab: + yyerror ("parser stack overflow"); + yyresult = 2; + /* Fall through. */ +#endif + +yyreturn: +#ifndef yyoverflow + if (yyss != yyssa) + YYSTACK_FREE (yyss); +#endif + return yyresult; +} + + +#line 633 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" + + +int yyerror(const char *ErrorMsg) { + err() << "Error parsing: " << ErrorMsg << "\n"; + exit(1); +} + diff --git a/utils/TableGen/FileParser.h b/utils/TableGen/FileParser.h deleted file mode 100644 index 89032f98746..00000000000 --- a/utils/TableGen/FileParser.h +++ /dev/null @@ -1,102 +0,0 @@ -/* A Bison parser, made by GNU Bison 1.875. */ - -/* Skeleton parser for Yacc-like parsing with Bison, - Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 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. */ - -/* Tokens. */ -#ifndef YYTOKENTYPE -# define YYTOKENTYPE - /* Put the tokens into the symbol table, so that GDB and other debuggers - know about them. */ - enum yytokentype { - INT = 258, - BIT = 259, - STRING = 260, - BITS = 261, - LIST = 262, - CODE = 263, - DAG = 264, - CLASS = 265, - DEF = 266, - FIELD = 267, - LET = 268, - IN = 269, - SHLTOK = 270, - SRATOK = 271, - SRLTOK = 272, - INTVAL = 273, - ID = 274, - VARNAME = 275, - STRVAL = 276, - CODEFRAGMENT = 277 - }; -#endif -#define INT 258 -#define BIT 259 -#define STRING 260 -#define BITS 261 -#define LIST 262 -#define CODE 263 -#define DAG 264 -#define CLASS 265 -#define DEF 266 -#define FIELD 267 -#define LET 268 -#define IN 269 -#define SHLTOK 270 -#define SRATOK 271 -#define SRLTOK 272 -#define INTVAL 273 -#define ID 274 -#define VARNAME 275 -#define STRVAL 276 -#define CODEFRAGMENT 277 - - - - -#if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED) -#line 189 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" -typedef union YYSTYPE { - std::string* StrVal; - int IntVal; - llvm::RecTy* Ty; - llvm::Init* Initializer; - std::vector* FieldList; - std::vector* BitList; - llvm::Record* Rec; - SubClassRefTy* SubClassRef; - std::vector* SubClassList; - std::vector >* DagValueList; -} YYSTYPE; -/* Line 1240 of yacc.c. */ -#line 93 "FileParser.tab.h" -# define yystype YYSTYPE /* obsolescent; will be withdrawn */ -# define YYSTYPE_IS_DECLARED 1 -# define YYSTYPE_IS_TRIVIAL 1 -#endif - -extern YYSTYPE Filelval; - - - diff --git a/utils/TableGen/FileParser.h.cvs b/utils/TableGen/FileParser.h.cvs new file mode 100644 index 00000000000..89032f98746 --- /dev/null +++ b/utils/TableGen/FileParser.h.cvs @@ -0,0 +1,102 @@ +/* A Bison parser, made by GNU Bison 1.875. */ + +/* Skeleton parser for Yacc-like parsing with Bison, + Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 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. */ + +/* Tokens. */ +#ifndef YYTOKENTYPE +# define YYTOKENTYPE + /* Put the tokens into the symbol table, so that GDB and other debuggers + know about them. */ + enum yytokentype { + INT = 258, + BIT = 259, + STRING = 260, + BITS = 261, + LIST = 262, + CODE = 263, + DAG = 264, + CLASS = 265, + DEF = 266, + FIELD = 267, + LET = 268, + IN = 269, + SHLTOK = 270, + SRATOK = 271, + SRLTOK = 272, + INTVAL = 273, + ID = 274, + VARNAME = 275, + STRVAL = 276, + CODEFRAGMENT = 277 + }; +#endif +#define INT 258 +#define BIT 259 +#define STRING 260 +#define BITS 261 +#define LIST 262 +#define CODE 263 +#define DAG 264 +#define CLASS 265 +#define DEF 266 +#define FIELD 267 +#define LET 268 +#define IN 269 +#define SHLTOK 270 +#define SRATOK 271 +#define SRLTOK 272 +#define INTVAL 273 +#define ID 274 +#define VARNAME 275 +#define STRVAL 276 +#define CODEFRAGMENT 277 + + + + +#if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED) +#line 189 "/home/vadve/criswell/llvm/utils/TableGen/FileParser.y" +typedef union YYSTYPE { + std::string* StrVal; + int IntVal; + llvm::RecTy* Ty; + llvm::Init* Initializer; + std::vector* FieldList; + std::vector* BitList; + llvm::Record* Rec; + SubClassRefTy* SubClassRef; + std::vector* SubClassList; + std::vector >* DagValueList; +} YYSTYPE; +/* Line 1240 of yacc.c. */ +#line 93 "FileParser.tab.h" +# define yystype YYSTYPE /* obsolescent; will be withdrawn */ +# define YYSTYPE_IS_DECLARED 1 +# define YYSTYPE_IS_TRIVIAL 1 +#endif + +extern YYSTYPE Filelval; + + + diff --git a/utils/TableGen/FileParser.y.cvs b/utils/TableGen/FileParser.y.cvs new file mode 100644 index 00000000000..28bb7b3f01f --- /dev/null +++ b/utils/TableGen/FileParser.y.cvs @@ -0,0 +1,638 @@ +//===-- 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 +#include +#define YYERROR_VERBOSE 1 + +int yyerror(const char *ErrorMsg); +int yylex(); + +namespace llvm { + +extern int Filelineno; +static Record *CurRec = 0; +static bool ParsingTemplateArgs = false; + +typedef std::pair*> SubClassRefTy; + +struct LetRecord { + std::string Name; + std::vector Bits; + Init *Value; + bool HasBits; + LetRecord(const std::string &N, std::vector *B, Init *V) + : Name(N), Value(V), HasBits(B != 0) { + if (HasBits) Bits = *B; + } +}; + +static std::vector > LetStack; + + +extern std::ostream &err(); + +static void addValue(const RecordVal &RV) { + if (RecordVal *ERV = CurRec->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 { + CurRec->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 *BitList, Init *V) { + if (!V) return; + + RecordVal *RV = CurRec->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(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(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(BI) != 0 || &(std::cerr << *BI) == 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 &TemplateArgs) { + // Add all of the values in the subclass into the current class... + const std::vector &Vals = SC->getValues(); + for (unsigned i = 0, e = Vals.size(); i != e; ++i) + addValue(Vals[i]); + + const std::vector &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); + } else { // This class expects template arguments... + // 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 &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* FieldList; + std::vector* BitList; + llvm::Record* Rec; + SubClassRefTy* SubClassRef; + std::vector* SubClassList; + std::vector >* DagValueList; +}; + +%token INT BIT STRING BITS LIST CODE DAG CLASS DEF FIELD LET IN +%token SHLTOK SRATOK SRLTOK +%token INTVAL +%token ID VARNAME STRVAL CODEFRAGMENT + +%type Type +%type ClassInst DefInst Object ObjectBody ClassID + +%type SubClassRef +%type ClassList ClassListNE +%type OptPrefix +%type Value OptValue +%type DagArgList DagArgListNE +%type ValueList ValueListNE +%type BitList OptBitList RBitList +%type Declaration OptID OptVarName ObjectName + +%start File + +%% + +ClassID : ID { + $$ = 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 type + $$ = new BitsRecTy($3); + } | INT { // int type + $$ = new IntRecTy(); + } | LIST '<' Type '>' { // list 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; }; + +Value : 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 expression. This is supposed to synthesize + // a new anonymous definition, deriving from CLASS 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; + } | 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 (Record *D = Records.getDef(*$1)) { + $$ = new DefInit(D); + } else { + err() << "Variable not defined: '" << *$1 << "'!\n"; + exit(1); + } + + delete $1; + } | 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; + } | '(' ID DagArgList ')' { + Record *D = Records.getDef(*$2); + if (D == 0) { + err() << "Invalid def '" << *$2 << "'!\n"; + exit(1); + } + $$ = new DagInit(D, *$3); + delete $2; 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; + } | SHLTOK '(' Value ',' Value ')' { + $$ = $3->getBinaryOp(Init::SHL, $5); + if ($$ == 0) { + err() << "Cannot shift values '" << *$3 << "' and '" << *$5 << "'!\n"; + exit(1); + } + } | SRATOK '(' Value ',' Value ')' { + $$ = $3->getBinaryOp(Init::SRA, $5); + if ($$ == 0) { + err() << "Cannot shift values '" << *$3 << "' and '" << *$5 << "'!\n"; + exit(1); + } + } | SRLTOK '(' Value ',' Value ')' { + $$ = $3->getBinaryOp(Init::SRL, $5); + if ($$ == 0) { + err() << "Cannot shift values '" << *$3 << "' and '" << *$5 << "'!\n"; + exit(1); + } + }; + +OptVarName : /* empty */ { + $$ = new std::string(); + } + | ':' VARNAME { + $$ = $2; + }; + +DagArgListNE : Value OptVarName { + $$ = new std::vector >(); + $$->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 >(); + } + | DagArgListNE { $$ = $1; }; + + +RBitList : INTVAL { + $$ = new std::vector(); + $$->push_back($1); + } | INTVAL '-' INTVAL { + if ($1 < 0 || $3 < 0) { + err() << "Invalid range: " << $1 << "-" << $3 << "!\n"; + exit(1); + } + $$ = new std::vector(); + 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(); + 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(); + } | ValueListNE { + $$ = $1; + }; + +ValueListNE : Value { + $$ = new std::vector(); + $$->push_back($1); + } | ValueListNE ',' Value { + ($$ = $1)->push_back($3); + }; + +Declaration : OptPrefix Type ID OptValue { + std::string DecName = *$3; + if (ParsingTemplateArgs) + DecName = CurRec->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()); + } | ClassID '<' ValueListNE '>' { + $$ = new SubClassRefTy($1, $3); + }; + +ClassListNE : SubClassRef { + $$ = new std::vector(); + $$->push_back(*$1); + delete $1; + } + | ClassListNE ',' SubClassRef { + ($$=$1)->push_back(*$3); + delete $3; + }; + +ClassList : /*empty */ { + $$ = new std::vector(); + } + | ':' ClassListNE { + $$ = $2; + }; + +DeclListNE : Declaration { + CurRec->addTemplateArg(*$1); + delete $1; +} | DeclListNE ',' Declaration { + CurRec->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; + + // Ensure redefinition doesn't happen. + if (Records.getDef(CurRec->getName())) { + err() << "Def '" << CurRec->getName() << "' already defined!\n"; + exit(1); + } + Records.addDef(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 set 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 { + $3->resolveReferences(); + + // If ObjectBody has template arguments, it's an error. + assert($3->getTemplateArgs().empty() && "How'd this get template args?"); + $$ = $3; +}; + + +Object : ClassInst | DefInst; + +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()); } 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); +}