| /* A Bison parser, made by GNU Bison 2.1. */ | |
| /* Skeleton parser for Yacc-like parsing with Bison, | |
| Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005 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., 51 Franklin Street, Fifth Floor, | |
| Boston, MA 02110-1301, 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 | |
| /* Bison version. */ | |
| #define YYBISON_VERSION "2.1" | |
| /* Skeleton name. */ | |
| #define YYSKELETON_NAME "yacc.c" | |
| /* Pure parsers. */ | |
| #define YYPURE 0 | |
| /* Using locations. */ | |
| #define YYLSP_NEEDED 0 | |
| /* Tokens. */ | |
| #ifndef YYTOKENTYPE | |
| # define YYTOKENTYPE | |
| /* Put the tokens into the symbol table, so that GDB and other debuggers | |
| know about them. */ | |
| enum yytokentype { | |
| DREG = 258, | |
| CREG = 259, | |
| GREG = 260, | |
| IMMED = 261, | |
| ADDR = 262, | |
| INSN = 263, | |
| NUM = 264, | |
| ID = 265, | |
| NL = 266, | |
| PNUM = 267 | |
| }; | |
| #endif | |
| /* Tokens. */ | |
| #define DREG 258 | |
| #define CREG 259 | |
| #define GREG 260 | |
| #define IMMED 261 | |
| #define ADDR 262 | |
| #define INSN 263 | |
| #define NUM 264 | |
| #define ID 265 | |
| #define NL 266 | |
| #define PNUM 267 | |
| /* Copy the first part of user declarations. */ | |
| #line 21 "itbl-parse.y" | |
| /* | |
| Yacc grammar for instruction table entries. | |
| ======================================================================= | |
| Original Instruction table specification document: | |
| MIPS Coprocessor Table Specification | |
| ==================================== | |
| This document describes the format of the MIPS coprocessor table. The | |
| table specifies a list of valid functions, data registers and control | |
| registers that can be used in coprocessor instructions. This list, | |
| together with the coprocessor instruction classes listed below, | |
| specifies the complete list of coprocessor instructions that will | |
| be recognized and assembled by the GNU assembler. In effect, | |
| this makes the GNU assembler table-driven, where the table is | |
| specified by the programmer. | |
| The table is an ordinary text file that the GNU assembler reads when | |
| it starts. Using the information in the table, the assembler | |
| generates an internal list of valid coprocessor registers and | |
| functions. The assembler uses this internal list in addition to the | |
| standard MIPS registers and instructions which are built-in to the | |
| assembler during code generation. | |
| To specify the coprocessor table when invoking the GNU assembler, use | |
| the command line option "--itbl file", where file is the | |
| complete name of the table, including path and extension. | |
| Examples: | |
| gas -t cop.tbl test.s -o test.o | |
| gas -t /usr/local/lib/cop.tbl test.s -o test.o | |
| gas --itbl d:\gnu\data\cop.tbl test.s -o test.o | |
| Only one table may be supplied during a single invocation of | |
| the assembler. | |
| Instruction classes | |
| =================== | |
| Below is a list of the valid coprocessor instruction classes for | |
| any given coprocessor "z". These instructions are already recognized | |
| by the assembler, and are listed here only for reference. | |
| Class format instructions | |
| ------------------------------------------------- | |
| Class1: | |
| op base rt offset | |
| LWCz rt,offset (base) | |
| SWCz rt,offset (base) | |
| Class2: | |
| COPz sub rt rd 0 | |
| MTCz rt,rd | |
| MFCz rt,rd | |
| CTCz rt,rd | |
| CFCz rt,rd | |
| Class3: | |
| COPz CO cofun | |
| COPz cofun | |
| Class4: | |
| COPz BC br offset | |
| BCzT offset | |
| BCzF offset | |
| Class5: | |
| COPz sub rt rd 0 | |
| DMFCz rt,rd | |
| DMTCz rt,rd | |
| Class6: | |
| op base rt offset | |
| LDCz rt,offset (base) | |
| SDCz rt,offset (base) | |
| Class7: | |
| COPz BC br offset | |
| BCzTL offset | |
| BCzFL offset | |
| The coprocessor table defines coprocessor-specific registers that can | |
| be used with all of the above classes of instructions, where | |
| appropriate. It also defines additional coprocessor-specific | |
| functions for Class3 (COPz cofun) instructions, Thus, the table allows | |
| the programmer to use convenient mnemonics and operands for these | |
| functions, instead of the COPz mmenmonic and cofun operand. | |
| The names of the MIPS general registers and their aliases are defined | |
| by the assembler and will be recognized as valid register names by the | |
| assembler when used (where allowed) in coprocessor instructions. | |
| However, the names and values of all coprocessor data and control | |
| register mnemonics must be specified in the coprocessor table. | |
| Table Grammar | |
| ============= | |
| Here is the grammar for the coprocessor table: | |
| table -> entry* | |
| entry -> [z entrydef] [comment] '\n' | |
| entrydef -> type name val | |
| entrydef -> 'insn' name val funcdef ; type of entry (instruction) | |
| z -> 'p'['0'..'3'] ; processor number | |
| type -> ['dreg' | 'creg' | 'greg' ] ; type of entry (register) | |
| ; 'dreg', 'creg' or 'greg' specifies a data, control, or general | |
| ; register mnemonic, respectively | |
| name -> [ltr|dec]* ; mnemonic of register/function | |
| val -> [dec|hex] ; register/function number (integer constant) | |
| funcdef -> frange flags fields | |
| ; bitfield range for opcode | |
| ; list of fields' formats | |
| fields -> field* | |
| field -> [','] ftype frange flags | |
| flags -> ['*' flagexpr] | |
| flagexpr -> '[' flagexpr ']' | |
| flagexpr -> val '|' flagexpr | |
| ftype -> [ type | 'immed' | 'addr' ] | |
| ; 'immed' specifies an immediate value; see grammar for "val" above | |
| ; 'addr' specifies a C identifier; name of symbol to be resolved at | |
| ; link time | |
| frange -> ':' val '-' val ; starting to ending bit positions, where | |
| ; where 0 is least significant bit | |
| frange -> (null) ; default range of 31-0 will be assumed | |
| comment -> [';'|'#'] [char]* | |
| char -> any printable character | |
| ltr -> ['a'..'z'|'A'..'Z'] | |
| dec -> ['0'..'9']* ; value in decimal | |
| hex -> '0x'['0'..'9' | 'a'..'f' | 'A'..'F']* ; value in hexadecimal | |
| Examples | |
| ======== | |
| Example 1: | |
| The table: | |
| p1 dreg d1 1 ; data register "d1" for COP1 has value 1 | |
| p1 creg c3 3 ; ctrl register "c3" for COP1 has value 3 | |
| p3 func fill 0x1f:24-20 ; function "fill" for COP3 has value 31 and | |
| ; no fields | |
| will allow the assembler to accept the following coprocessor instructions: | |
| LWC1 d1,0x100 ($2) | |
| fill | |
| Here, the general purpose register "$2", and instruction "LWC1", are standard | |
| mnemonics built-in to the MIPS assembler. | |
| Example 2: | |
| The table: | |
| p3 dreg d3 3 ; data register "d3" for COP3 has value 3 | |
| p3 creg c2 22 ; control register "c2" for COP3 has value 22 | |
| p3 func fee 0x1f:24-20 dreg:17-13 creg:12-8 immed:7-0 | |
| ; function "fee" for COP3 has value 31, and 3 fields | |
| ; consisting of a data register, a control register, | |
| ; and an immediate value. | |
| will allow the assembler to accept the following coprocessor instruction: | |
| fee d3,c2,0x1 | |
| and will emit the object code: | |
| 31-26 25 24-20 19-18 17-13 12-8 7-0 | |
| COPz CO fun dreg creg immed | |
| 010011 1 11111 00 00011 10110 00000001 | |
| 0x4ff07601 | |
| Example 3: | |
| The table: | |
| p3 dreg d3 3 ; data register "d3" for COP3 has value 3 | |
| p3 creg c2 22 ; control register "c2" for COP3 has value 22 | |
| p3 func fuu 0x01f00001 dreg:17-13 creg:12-8 | |
| will allow the assembler to accept the following coprocessor | |
| instruction: | |
| fuu d3,c2 | |
| and will emit the object code: | |
| 31-26 25 24-20 19-18 17-13 12-8 7-0 | |
| COPz CO fun dreg creg | |
| 010011 1 11111 00 00011 10110 00000001 | |
| 0x4ff07601 | |
| In this way, the programmer can force arbitrary bits of an instruction | |
| to have predefined values. | |
| ======================================================================= | |
| Additional notes: | |
| Encoding of ranges: | |
| To handle more than one bit position range within an instruction, | |
| use 0s to mask out the ranges which don't apply. | |
| May decide to modify the syntax to allow commas separate multiple | |
| ranges within an instruction (range','range). | |
| Changes in grammar: | |
| The number of parms argument to the function entry | |
| was deleted from the original format such that we now count the fields. | |
| ---- | |
| FIXME! should really change lexical analyzer | |
| to recognize 'dreg' etc. in context sensitive way. | |
| Currently function names or mnemonics may be incorrectly parsed as keywords | |
| FIXME! hex is ambiguous with any digit | |
| */ | |
| #include "as.h" | |
| #include "itbl-lex.h" | |
| #include "itbl-ops.h" | |
| /* #define DEBUG */ | |
| #ifdef DEBUG | |
| #ifndef DBG_LVL | |
| #define DBG_LVL 1 | |
| #endif | |
| #else | |
| #define DBG_LVL 0 | |
| #endif | |
| #if DBG_LVL >= 1 | |
| #define DBG(x) printf x | |
| #else | |
| #define DBG(x) | |
| #endif | |
| #if DBG_LVL >= 2 | |
| #define DBGL2(x) printf x | |
| #else | |
| #define DBGL2(x) | |
| #endif | |
| static int sbit, ebit; | |
| static struct itbl_entry *insn=0; | |
| static int yyerror (const char *); | |
| /* 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 | |
| /* Enabling the token table. */ | |
| #ifndef YYTOKEN_TABLE | |
| # define YYTOKEN_TABLE 0 | |
| #endif | |
| #if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED) | |
| #line 282 "itbl-parse.y" | |
| typedef union YYSTYPE { | |
| char *str; | |
| int num; | |
| int processor; | |
| unsigned long val; | |
| } YYSTYPE; | |
| /* Line 196 of yacc.c. */ | |
| #line 376 "itbl-parse.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 219 of yacc.c. */ | |
| #line 388 "itbl-parse.c" | |
| #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) && (defined (__STDC__) || defined (__cplusplus)) | |
| # include <stddef.h> /* INFRINGES ON USER NAME SPACE */ | |
| # define YYSIZE_T size_t | |
| #endif | |
| #if ! defined (YYSIZE_T) | |
| # define YYSIZE_T unsigned int | |
| #endif | |
| #ifndef YY_ | |
| # if YYENABLE_NLS | |
| # if ENABLE_NLS | |
| # include <libintl.h> /* INFRINGES ON USER NAME SPACE */ | |
| # define YY_(msgid) dgettext ("bison-runtime", msgid) | |
| # endif | |
| # endif | |
| # ifndef YY_ | |
| # define YY_(msgid) msgid | |
| # endif | |
| #endif | |
| #if ! defined (yyoverflow) || YYERROR_VERBOSE | |
| /* The parser invokes alloca or malloc; define the necessary symbols. */ | |
| # ifdef YYSTACK_USE_ALLOCA | |
| # if YYSTACK_USE_ALLOCA | |
| # ifdef __GNUC__ | |
| # define YYSTACK_ALLOC __builtin_alloca | |
| # else | |
| # define YYSTACK_ALLOC alloca | |
| # if defined (__STDC__) || defined (__cplusplus) | |
| # include <stdlib.h> /* INFRINGES ON USER NAME SPACE */ | |
| # define YYINCLUDED_STDLIB_H | |
| # endif | |
| # endif | |
| # endif | |
| # endif | |
| # ifdef YYSTACK_ALLOC | |
| /* Pacify GCC's `empty if-body' warning. */ | |
| # define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) | |
| # ifndef YYSTACK_ALLOC_MAXIMUM | |
| /* The OS might guarantee only one guard page at the bottom of the stack, | |
| and a page size can be as small as 4096 bytes. So we cannot safely | |
| invoke alloca (N) if N exceeds 4096. Use a slightly smaller number | |
| to allow for a few compiler-allocated temporary stack slots. */ | |
| # define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2005 */ | |
| # endif | |
| # else | |
| # define YYSTACK_ALLOC YYMALLOC | |
| # define YYSTACK_FREE YYFREE | |
| # ifndef YYSTACK_ALLOC_MAXIMUM | |
| # define YYSTACK_ALLOC_MAXIMUM ((YYSIZE_T) -1) | |
| # endif | |
| # ifdef __cplusplus | |
| extern "C" { | |
| # endif | |
| # ifndef YYMALLOC | |
| # define YYMALLOC malloc | |
| # if (! defined (malloc) && ! defined (YYINCLUDED_STDLIB_H) \ | |
| && (defined (__STDC__) || defined (__cplusplus))) | |
| void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */ | |
| # endif | |
| # endif | |
| # ifndef YYFREE | |
| # define YYFREE free | |
| # if (! defined (free) && ! defined (YYINCLUDED_STDLIB_H) \ | |
| && (defined (__STDC__) || defined (__cplusplus))) | |
| void free (void *); /* INFRINGES ON USER NAME SPACE */ | |
| # endif | |
| # endif | |
| # ifdef __cplusplus | |
| } | |
| # endif | |
| # endif | |
| #endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */ | |
| #if (! defined (yyoverflow) \ | |
| && (! defined (__cplusplus) \ | |
| || (defined (YYSTYPE_IS_TRIVIAL) && YYSTYPE_IS_TRIVIAL))) | |
| /* A type that is properly aligned for any stack member. */ | |
| union yyalloc | |
| { | |
| short int 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 int) + sizeof (YYSTYPE)) \ | |
| + YYSTACK_GAP_MAXIMUM) | |
| /* Copy COUNT objects from FROM to TO. The source and destination do | |
| not overlap. */ | |
| # ifndef YYCOPY | |
| # if defined (__GNUC__) && 1 < __GNUC__ | |
| # define YYCOPY(To, From, Count) \ | |
| __builtin_memcpy (To, From, (Count) * sizeof (*(From))) | |
| # else | |
| # define YYCOPY(To, From, Count) \ | |
| do \ | |
| { \ | |
| 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 int yysigned_char; | |
| #endif | |
| /* YYFINAL -- State number of the termination state. */ | |
| #define YYFINAL 9 | |
| /* YYLAST -- Last index in YYTABLE. */ | |
| #define YYLAST 46 | |
| /* YYNTOKENS -- Number of terminals. */ | |
| #define YYNTOKENS 20 | |
| /* YYNNTS -- Number of nonterminals. */ | |
| #define YYNNTS 15 | |
| /* YYNRULES -- Number of rules. */ | |
| #define YYNRULES 29 | |
| /* YYNRULES -- Number of states. */ | |
| #define YYNSTATES 51 | |
| /* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ | |
| #define YYUNDEFTOK 2 | |
| #define YYMAXUTOK 267 | |
| #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, | |
| 2, 2, 17, 2, 13, 19, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 18, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 15, 2, 16, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 14, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | |
| 2, 2, 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 | |
| }; | |
| #if YYDEBUG | |
| /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in | |
| YYRHS. */ | |
| static const unsigned char yyprhs[] = | |
| { | |
| 0, 0, 3, 5, 8, 9, 15, 16, 26, 28, | |
| 31, 35, 38, 39, 41, 43, 45, 49, 53, 57, | |
| 59, 62, 63, 68, 69, 71, 73, 75, 77, 79 | |
| }; | |
| /* YYRHS -- A `-1'-separated list of the rules' RHS. */ | |
| static const yysigned_char yyrhs[] = | |
| { | |
| 21, 0, -1, 22, -1, 23, 22, -1, -1, 31, | |
| 32, 33, 34, 11, -1, -1, 31, 8, 33, 34, | |
| 30, 29, 24, 25, 11, -1, 11, -1, 1, 11, | |
| -1, 13, 27, 25, -1, 27, 25, -1, -1, 32, | |
| -1, 7, -1, 6, -1, 26, 30, 29, -1, 9, | |
| 14, 28, -1, 15, 28, 16, -1, 9, -1, 17, | |
| 28, -1, -1, 18, 9, 19, 9, -1, -1, 12, | |
| -1, 3, -1, 4, -1, 5, -1, 10, -1, 9, | |
| -1 | |
| }; | |
| /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ | |
| static const unsigned short int yyrline[] = | |
| { | |
| 0, 299, 299, 303, 304, 308, 315, 314, 323, 324, | |
| 328, 329, 330, 334, 339, 344, 352, 361, 365, 369, | |
| 376, 382, 388, 395, 402, 410, 415, 420, 428, 444 | |
| }; | |
| #endif | |
| #if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE | |
| /* YYTNAME[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", "DREG", "CREG", "GREG", "IMMED", "ADDR", | |
| "INSN", "NUM", "ID", "NL", "PNUM", "','", "'|'", "'['", "']'", "'*'", | |
| "':'", "'-'", "$accept", "insntbl", "entrys", "entry", "@1", | |
| "fieldspecs", "ftype", "fieldspec", "flagexpr", "flags", "range", "pnum", | |
| "regtype", "name", "value", 0 | |
| }; | |
| #endif | |
| # ifdef YYPRINT | |
| /* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to | |
| token YYLEX-NUM. */ | |
| static const unsigned short int yytoknum[] = | |
| { | |
| 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, | |
| 265, 266, 267, 44, 124, 91, 93, 42, 58, 45 | |
| }; | |
| # endif | |
| /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ | |
| static const unsigned char yyr1[] = | |
| { | |
| 0, 20, 21, 22, 22, 23, 24, 23, 23, 23, | |
| 25, 25, 25, 26, 26, 26, 27, 28, 28, 28, | |
| 29, 29, 30, 30, 31, 32, 32, 32, 33, 34 | |
| }; | |
| /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ | |
| static const unsigned char yyr2[] = | |
| { | |
| 0, 2, 1, 2, 0, 5, 0, 9, 1, 2, | |
| 3, 2, 0, 1, 1, 1, 3, 3, 3, 1, | |
| 2, 0, 4, 0, 1, 1, 1, 1, 1, 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, 0, 8, 24, 0, 2, 0, 0, 9, 1, | |
| 3, 25, 26, 27, 0, 0, 28, 0, 0, 29, | |
| 23, 0, 0, 21, 5, 0, 0, 6, 0, 19, | |
| 0, 20, 12, 22, 0, 0, 15, 14, 0, 0, | |
| 23, 12, 13, 17, 18, 12, 7, 21, 11, 10, | |
| 16 | |
| }; | |
| /* YYDEFGOTO[NTERM-NUM]. */ | |
| static const yysigned_char yydefgoto[] = | |
| { | |
| -1, 4, 5, 6, 32, 39, 40, 41, 31, 27, | |
| 23, 7, 42, 17, 20 | |
| }; | |
| /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing | |
| STATE-NUM. */ | |
| #define YYPACT_NINF -16 | |
| static const yysigned_char yypact[] = | |
| { | |
| 0, -9, -16, -16, 10, -16, 0, 12, -16, -16, | |
| -16, -16, -16, -16, 3, 3, -16, 9, 9, -16, | |
| 11, 8, 19, 15, -16, 14, -6, -16, 25, 21, | |
| -6, -16, 1, -16, -6, 20, -16, -16, 18, 26, | |
| 11, 1, -16, -16, -16, 1, -16, 15, -16, -16, | |
| -16 | |
| }; | |
| /* YYPGOTO[NTERM-NUM]. */ | |
| static const yysigned_char yypgoto[] = | |
| { | |
| -16, -16, 32, -16, -16, -15, -16, 2, -3, -8, | |
| 4, -16, 34, 27, 28 | |
| }; | |
| /* 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 -5 | |
| static const yysigned_char yytable[] = | |
| { | |
| -4, 1, 8, 29, 11, 12, 13, 36, 37, 30, | |
| 9, 2, 3, 16, 38, 11, 12, 13, 19, 24, | |
| 14, 11, 12, 13, 36, 37, 48, 35, 25, 22, | |
| 49, 43, 26, 28, 33, 34, 44, 46, 10, 50, | |
| 45, 15, 18, 0, 47, 0, 21 | |
| }; | |
| static const yysigned_char yycheck[] = | |
| { | |
| 0, 1, 11, 9, 3, 4, 5, 6, 7, 15, | |
| 0, 11, 12, 10, 13, 3, 4, 5, 9, 11, | |
| 8, 3, 4, 5, 6, 7, 41, 30, 9, 18, | |
| 45, 34, 17, 19, 9, 14, 16, 11, 6, 47, | |
| 38, 7, 15, -1, 40, -1, 18 | |
| }; | |
| /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing | |
| symbol of state STATE-NUM. */ | |
| static const unsigned char yystos[] = | |
| { | |
| 0, 1, 11, 12, 21, 22, 23, 31, 11, 0, | |
| 22, 3, 4, 5, 8, 32, 10, 33, 33, 9, | |
| 34, 34, 18, 30, 11, 9, 17, 29, 19, 9, | |
| 15, 28, 24, 9, 14, 28, 6, 7, 13, 25, | |
| 26, 27, 32, 28, 16, 27, 11, 30, 25, 25, | |
| 29 | |
| }; | |
| #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 yyerrorlab | |
| /* 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 (YY_("syntax error: cannot back up")); \ | |
| YYERROR; \ | |
| } \ | |
| while (0) | |
| #define YYTERROR 1 | |
| #define YYERRCODE 256 | |
| /* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N]. | |
| If N is 0, then set CURRENT to the empty location which ends | |
| the previous symbol: RHS[0] (always defined). */ | |
| #define YYRHSLOC(Rhs, K) ((Rhs)[K]) | |
| #ifndef YYLLOC_DEFAULT | |
| # define YYLLOC_DEFAULT(Current, Rhs, N) \ | |
| do \ | |
| if (N) \ | |
| { \ | |
| (Current).first_line = YYRHSLOC (Rhs, 1).first_line; \ | |
| (Current).first_column = YYRHSLOC (Rhs, 1).first_column; \ | |
| (Current).last_line = YYRHSLOC (Rhs, N).last_line; \ | |
| (Current).last_column = YYRHSLOC (Rhs, N).last_column; \ | |
| } \ | |
| else \ | |
| { \ | |
| (Current).first_line = (Current).last_line = \ | |
| YYRHSLOC (Rhs, 0).last_line; \ | |
| (Current).first_column = (Current).last_column = \ | |
| YYRHSLOC (Rhs, 0).last_column; \ | |
| } \ | |
| while (0) | |
| #endif | |
| /* YY_LOCATION_PRINT -- Print the location on the stream. | |
| This macro was not mandated originally: define only if we know | |
| we won't break user code: when these are the locations we know. */ | |
| #ifndef YY_LOCATION_PRINT | |
| # if YYLTYPE_IS_TRIVIAL | |
| # define YY_LOCATION_PRINT(File, Loc) \ | |
| fprintf (File, "%d.%d-%d.%d", \ | |
| (Loc).first_line, (Loc).first_column, \ | |
| (Loc).last_line, (Loc).last_column) | |
| # else | |
| # define YY_LOCATION_PRINT(File, Loc) ((void) 0) | |
| # endif | |
| #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 <stdio.h> /* INFRINGES ON USER NAME SPACE */ | |
| # define YYFPRINTF fprintf | |
| # endif | |
| # define YYDPRINTF(Args) \ | |
| do { \ | |
| if (yydebug) \ | |
| YYFPRINTF Args; \ | |
| } while (0) | |
| # define YY_SYMBOL_PRINT(Title, Type, Value, Location) \ | |
| do { \ | |
| if (yydebug) \ | |
| { \ | |
| YYFPRINTF (stderr, "%s ", Title); \ | |
| yysymprint (stderr, \ | |
| Type, Value); \ | |
| YYFPRINTF (stderr, "\n"); \ | |
| } \ | |
| } while (0) | |
| /*------------------------------------------------------------------. | |
| | yy_stack_print -- Print the state stack from its BOTTOM up to its | | |
| | TOP (included). | | |
| `------------------------------------------------------------------*/ | |
| #if defined (__STDC__) || defined (__cplusplus) | |
| static void | |
| yy_stack_print (short int *bottom, short int *top) | |
| #else | |
| static void | |
| yy_stack_print (bottom, top) | |
| short int *bottom; | |
| short int *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 long int yylno = yyrline[yyrule]; | |
| YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu), ", | |
| yyrule - 1, yylno); | |
| /* 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 YY_SYMBOL_PRINT(Title, Type, 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 | |
| YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH) | |
| evaluated with infinite-precision integer arithmetic. */ | |
| #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 | |
| { | |
| 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 | |
| { | |
| char *yyd = yydest; | |
| const char *yys = yysrc; | |
| while ((*yyd++ = *yys++) != '\0') | |
| continue; | |
| return yyd - 1; | |
| } | |
| # endif | |
| # endif | |
| # ifndef yytnamerr | |
| /* Copy to YYRES the contents of YYSTR after stripping away unnecessary | |
| quotes and backslashes, so that it's suitable for yyerror. The | |
| heuristic is that double-quoting is unnecessary unless the string | |
| contains an apostrophe, a comma, or backslash (other than | |
| backslash-backslash). YYSTR is taken from yytname. If YYRES is | |
| null, do not copy; instead, return the length of what the result | |
| would have been. */ | |
| static YYSIZE_T | |
| yytnamerr (char *yyres, const char *yystr) | |
| { | |
| if (*yystr == '"') | |
| { | |
| size_t yyn = 0; | |
| char const *yyp = yystr; | |
| for (;;) | |
| switch (*++yyp) | |
| { | |
| case '\'': | |
| case ',': | |
| goto do_not_strip_quotes; | |
| case '\\': | |
| if (*++yyp != '\\') | |
| goto do_not_strip_quotes; | |
| /* Fall through. */ | |
| default: | |
| if (yyres) | |
| yyres[yyn] = *yyp; | |
| yyn++; | |
| break; | |
| case '"': | |
| if (yyres) | |
| yyres[yyn] = '\0'; | |
| return yyn; | |
| } | |
| do_not_strip_quotes: ; | |
| } | |
| if (! yyres) | |
| return yystrlen (yystr); | |
| return yystpcpy (yyres, yystr) - yyres; | |
| } | |
| # 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]); | |
| else | |
| YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]); | |
| # ifdef YYPRINT | |
| if (yytype < YYNTOKENS) | |
| YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); | |
| # endif | |
| switch (yytype) | |
| { | |
| default: | |
| break; | |
| } | |
| YYFPRINTF (yyoutput, ")"); | |
| } | |
| #endif /* ! YYDEBUG */ | |
| /*-----------------------------------------------. | |
| | Release the memory associated to this symbol. | | |
| `-----------------------------------------------*/ | |
| #if defined (__STDC__) || defined (__cplusplus) | |
| static void | |
| yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep) | |
| #else | |
| static void | |
| yydestruct (yymsg, yytype, yyvaluep) | |
| const char *yymsg; | |
| int yytype; | |
| YYSTYPE *yyvaluep; | |
| #endif | |
| { | |
| /* Pacify ``unused variable'' warnings. */ | |
| (void) yyvaluep; | |
| if (!yymsg) | |
| yymsg = "Deleting"; | |
| YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp); | |
| 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 look-ahead symbol. */ | |
| int yychar; | |
| /* The semantic value of the look-ahead 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 | |
| { | |
| int yystate; | |
| int yyn; | |
| int yyresult; | |
| /* Number of tokens to shift before error messages enabled. */ | |
| int yyerrstatus; | |
| /* Look-ahead 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 int yyssa[YYINITDEPTH]; | |
| short int *yyss = yyssa; | |
| short int *yyssp; | |
| /* The semantic value stack. */ | |
| YYSTYPE yyvsa[YYINITDEPTH]; | |
| YYSTYPE *yyvs = yyvsa; | |
| 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 int *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 (YY_("memory exhausted"), | |
| &yyss1, yysize * sizeof (*yyssp), | |
| &yyvs1, yysize * sizeof (*yyvsp), | |
| &yystacksize); | |
| yyss = yyss1; | |
| yyvs = yyvs1; | |
| } | |
| #else /* no yyoverflow */ | |
| # ifndef YYSTACK_RELOCATE | |
| goto yyexhaustedlab; | |
| # else | |
| /* Extend the stack our own way. */ | |
| if (YYMAXDEPTH <= yystacksize) | |
| goto yyexhaustedlab; | |
| yystacksize *= 2; | |
| if (YYMAXDEPTH < yystacksize) | |
| yystacksize = YYMAXDEPTH; | |
| { | |
| short int *yyss1 = yyss; | |
| union yyalloc *yyptr = | |
| (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); | |
| if (! yyptr) | |
| goto yyexhaustedlab; | |
| 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 look-ahead token if we need one and don't already have one. */ | |
| /* yyresume: */ | |
| /* First try to decide what to do without reference to look-ahead token. */ | |
| yyn = yypact[yystate]; | |
| if (yyn == YYPACT_NINF) | |
| goto yydefault; | |
| /* Not known => get a look-ahead token if don't already have one. */ | |
| /* YYCHAR is either YYEMPTY or YYEOF or a valid look-ahead 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); | |
| YY_SYMBOL_PRINT ("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 look-ahead token. */ | |
| YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc); | |
| /* 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 5: | |
| #line 309 "itbl-parse.y" | |
| { | |
| DBG (("line %d: entry pnum=%d type=%d name=%s value=x%x\n", | |
| insntbl_line, (yyvsp[-4].num), (yyvsp[-3].num), (yyvsp[-2].str), (yyvsp[-1].val))); | |
| itbl_add_reg ((yyvsp[-4].num), (yyvsp[-3].num), (yyvsp[-2].str), (yyvsp[-1].val)); | |
| } | |
| break; | |
| case 6: | |
| #line 315 "itbl-parse.y" | |
| { | |
| DBG (("line %d: entry pnum=%d type=INSN name=%s value=x%x", | |
| insntbl_line, (yyvsp[-5].num), (yyvsp[-3].str), (yyvsp[-2].val))); | |
| DBG ((" sbit=%d ebit=%d flags=0x%x\n", sbit, ebit, (yyvsp[0].val))); | |
| insn=itbl_add_insn ((yyvsp[-5].num), (yyvsp[-3].str), (yyvsp[-2].val), sbit, ebit, (yyvsp[0].val)); | |
| } | |
| break; | |
| case 7: | |
| #line 322 "itbl-parse.y" | |
| {} | |
| break; | |
| case 13: | |
| #line 335 "itbl-parse.y" | |
| { | |
| DBGL2 (("ftype\n")); | |
| (yyval.num) = (yyvsp[0].num); | |
| } | |
| break; | |
| case 14: | |
| #line 340 "itbl-parse.y" | |
| { | |
| DBGL2 (("addr\n")); | |
| (yyval.num) = ADDR; | |
| } | |
| break; | |
| case 15: | |
| #line 345 "itbl-parse.y" | |
| { | |
| DBGL2 (("immed\n")); | |
| (yyval.num) = IMMED; | |
| } | |
| break; | |
| case 16: | |
| #line 353 "itbl-parse.y" | |
| { | |
| DBG (("line %d: field type=%d sbit=%d ebit=%d, flags=0x%x\n", | |
| insntbl_line, (yyvsp[-2].num), sbit, ebit, (yyvsp[0].val))); | |
| itbl_add_operand (insn, (yyvsp[-2].num), sbit, ebit, (yyvsp[0].val)); | |
| } | |
| break; | |
| case 17: | |
| #line 362 "itbl-parse.y" | |
| { | |
| (yyval.val) = (yyvsp[-2].num) | (yyvsp[0].val); | |
| } | |
| break; | |
| case 18: | |
| #line 366 "itbl-parse.y" | |
| { | |
| (yyval.val) = (yyvsp[-1].val); | |
| } | |
| break; | |
| case 19: | |
| #line 370 "itbl-parse.y" | |
| { | |
| (yyval.val) = (yyvsp[0].num); | |
| } | |
| break; | |
| case 20: | |
| #line 377 "itbl-parse.y" | |
| { | |
| DBGL2 (("flags=%d\n", (yyvsp[0].val))); | |
| (yyval.val) = (yyvsp[0].val); | |
| } | |
| break; | |
| case 21: | |
| #line 382 "itbl-parse.y" | |
| { | |
| (yyval.val) = 0; | |
| } | |
| break; | |
| case 22: | |
| #line 389 "itbl-parse.y" | |
| { | |
| DBGL2 (("range %d %d\n", (yyvsp[-2].num), (yyvsp[0].num))); | |
| sbit = (yyvsp[-2].num); | |
| ebit = (yyvsp[0].num); | |
| } | |
| break; | |
| case 23: | |
| #line 395 "itbl-parse.y" | |
| { | |
| sbit = 31; | |
| ebit = 0; | |
| } | |
| break; | |
| case 24: | |
| #line 403 "itbl-parse.y" | |
| { | |
| DBGL2 (("pnum=%d\n",(yyvsp[0].num))); | |
| (yyval.num) = (yyvsp[0].num); | |
| } | |
| break; | |
| case 25: | |
| #line 411 "itbl-parse.y" | |
| { | |
| DBGL2 (("dreg\n")); | |
| (yyval.num) = DREG; | |
| } | |
| break; | |
| case 26: | |
| #line 416 "itbl-parse.y" | |
| { | |
| DBGL2 (("creg\n")); | |
| (yyval.num) = CREG; | |
| } | |
| break; | |
| case 27: | |
| #line 421 "itbl-parse.y" | |
| { | |
| DBGL2 (("greg\n")); | |
| (yyval.num) = GREG; | |
| } | |
| break; | |
| case 28: | |
| #line 429 "itbl-parse.y" | |
| { | |
| DBGL2 (("name=%s\n",(yyvsp[0].str))); | |
| (yyval.str) = (yyvsp[0].str); | |
| } | |
| break; | |
| case 29: | |
| #line 445 "itbl-parse.y" | |
| { | |
| DBGL2 (("val=x%x\n",(yyvsp[0].num))); | |
| (yyval.val) = (yyvsp[0].num); | |
| } | |
| break; | |
| default: break; | |
| } | |
| /* Line 1126 of yacc.c. */ | |
| #line 1565 "itbl-parse.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) | |
| { | |
| int yytype = YYTRANSLATE (yychar); | |
| YYSIZE_T yysize0 = yytnamerr (0, yytname[yytype]); | |
| YYSIZE_T yysize = yysize0; | |
| YYSIZE_T yysize1; | |
| int yysize_overflow = 0; | |
| char *yymsg = 0; | |
| # define YYERROR_VERBOSE_ARGS_MAXIMUM 5 | |
| char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; | |
| int yyx; | |
| #if 0 | |
| /* This is so xgettext sees the translatable formats that are | |
| constructed on the fly. */ | |
| YY_("syntax error, unexpected %s"); | |
| YY_("syntax error, unexpected %s, expecting %s"); | |
| YY_("syntax error, unexpected %s, expecting %s or %s"); | |
| YY_("syntax error, unexpected %s, expecting %s or %s or %s"); | |
| YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"); | |
| #endif | |
| char *yyfmt; | |
| char const *yyf; | |
| static char const yyunexpected[] = "syntax error, unexpected %s"; | |
| static char const yyexpecting[] = ", expecting %s"; | |
| static char const yyor[] = " or %s"; | |
| char yyformat[sizeof yyunexpected | |
| + sizeof yyexpecting - 1 | |
| + ((YYERROR_VERBOSE_ARGS_MAXIMUM - 2) | |
| * (sizeof yyor - 1))]; | |
| char const *yyprefix = yyexpecting; | |
| /* Start YYX at -YYN if negative to avoid negative indexes in | |
| YYCHECK. */ | |
| int yyxbegin = yyn < 0 ? -yyn : 0; | |
| /* Stay within bounds of both yycheck and yytname. */ | |
| int yychecklim = YYLAST - yyn; | |
| int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS; | |
| int yycount = 1; | |
| yyarg[0] = yytname[yytype]; | |
| yyfmt = yystpcpy (yyformat, yyunexpected); | |
| for (yyx = yyxbegin; yyx < yyxend; ++yyx) | |
| if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) | |
| { | |
| if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) | |
| { | |
| yycount = 1; | |
| yysize = yysize0; | |
| yyformat[sizeof yyunexpected - 1] = '\0'; | |
| break; | |
| } | |
| yyarg[yycount++] = yytname[yyx]; | |
| yysize1 = yysize + yytnamerr (0, yytname[yyx]); | |
| yysize_overflow |= yysize1 < yysize; | |
| yysize = yysize1; | |
| yyfmt = yystpcpy (yyfmt, yyprefix); | |
| yyprefix = yyor; | |
| } | |
| yyf = YY_(yyformat); | |
| yysize1 = yysize + yystrlen (yyf); | |
| yysize_overflow |= yysize1 < yysize; | |
| yysize = yysize1; | |
| if (!yysize_overflow && yysize <= YYSTACK_ALLOC_MAXIMUM) | |
| yymsg = (char *) YYSTACK_ALLOC (yysize); | |
| if (yymsg) | |
| { | |
| /* Avoid sprintf, as that infringes on the user's name space. | |
| Don't have undefined behavior even if the translation | |
| produced a string with the wrong number of "%s"s. */ | |
| char *yyp = yymsg; | |
| int yyi = 0; | |
| while ((*yyp = *yyf)) | |
| { | |
| if (*yyp == '%' && yyf[1] == 's' && yyi < yycount) | |
| { | |
| yyp += yytnamerr (yyp, yyarg[yyi++]); | |
| yyf += 2; | |
| } | |
| else | |
| { | |
| yyp++; | |
| yyf++; | |
| } | |
| } | |
| yyerror (yymsg); | |
| YYSTACK_FREE (yymsg); | |
| } | |
| else | |
| { | |
| yyerror (YY_("syntax error")); | |
| goto yyexhaustedlab; | |
| } | |
| } | |
| else | |
| #endif /* YYERROR_VERBOSE */ | |
| yyerror (YY_("syntax error")); | |
| } | |
| if (yyerrstatus == 3) | |
| { | |
| /* If just tried and failed to reuse look-ahead token after an | |
| error, discard it. */ | |
| if (yychar <= YYEOF) | |
| { | |
| /* Return failure if at end of input. */ | |
| if (yychar == YYEOF) | |
| YYABORT; | |
| } | |
| else | |
| { | |
| yydestruct ("Error: discarding", yytoken, &yylval); | |
| yychar = YYEMPTY; | |
| } | |
| } | |
| /* Else will try to reuse look-ahead token after shifting the error | |
| token. */ | |
| goto yyerrlab1; | |
| /*---------------------------------------------------. | |
| | yyerrorlab -- error raised explicitly by YYERROR. | | |
| `---------------------------------------------------*/ | |
| yyerrorlab: | |
| /* Pacify compilers like GCC when the user code never invokes | |
| YYERROR and the label yyerrorlab therefore never appears in user | |
| code. */ | |
| if (0) | |
| goto yyerrorlab; | |
| yyvsp -= yylen; | |
| yyssp -= yylen; | |
| yystate = *yyssp; | |
| goto yyerrlab1; | |
| /*-------------------------------------------------------------. | |
| | yyerrlab1 -- common code for both syntax error and YYERROR. | | |
| `-------------------------------------------------------------*/ | |
| 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; | |
| yydestruct ("Error: popping", yystos[yystate], yyvsp); | |
| YYPOPSTACK; | |
| yystate = *yyssp; | |
| YY_STACK_PRINT (yyss, yyssp); | |
| } | |
| if (yyn == YYFINAL) | |
| YYACCEPT; | |
| *++yyvsp = yylval; | |
| /* Shift the error token. */ | |
| YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp); | |
| yystate = yyn; | |
| goto yynewstate; | |
| /*-------------------------------------. | |
| | yyacceptlab -- YYACCEPT comes here. | | |
| `-------------------------------------*/ | |
| yyacceptlab: | |
| yyresult = 0; | |
| goto yyreturn; | |
| /*-----------------------------------. | |
| | yyabortlab -- YYABORT comes here. | | |
| `-----------------------------------*/ | |
| yyabortlab: | |
| yyresult = 1; | |
| goto yyreturn; | |
| #ifndef yyoverflow | |
| /*-------------------------------------------------. | |
| | yyexhaustedlab -- memory exhaustion comes here. | | |
| `-------------------------------------------------*/ | |
| yyexhaustedlab: | |
| yyerror (YY_("memory exhausted")); | |
| yyresult = 2; | |
| /* Fall through. */ | |
| #endif | |
| yyreturn: | |
| if (yychar != YYEOF && yychar != YYEMPTY) | |
| yydestruct ("Cleanup: discarding lookahead", | |
| yytoken, &yylval); | |
| while (yyssp != yyss) | |
| { | |
| yydestruct ("Cleanup: popping", | |
| yystos[*yyssp], yyvsp); | |
| YYPOPSTACK; | |
| } | |
| #ifndef yyoverflow | |
| if (yyss != yyssa) | |
| YYSTACK_FREE (yyss); | |
| #endif | |
| return yyresult; | |
| } | |
| #line 450 "itbl-parse.y" | |
| static int | |
| yyerror (msg) | |
| const char *msg; | |
| { | |
| printf ("line %d: %s\n", insntbl_line, msg); | |
| return 0; | |
| } | |