| /* A Bison parser, made by GNU Bison 3.0.2. */ |
| |
| /* Bison implementation for Yacc-like parsers in C |
| |
| Copyright (C) 1984, 1989-1990, 2000-2013 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 3 of the License, 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, see <http://www.gnu.org/licenses/>. */ |
| |
| /* As a special exception, you may create a larger work that contains |
| part or all of the Bison parser skeleton and distribute that work |
| under terms of your choice, so long as that work isn't itself a |
| parser generator using the skeleton or a modified version thereof |
| as a parser skeleton. Alternatively, if you modify or redistribute |
| the parser skeleton itself, you may (at your option) remove this |
| special exception, which will cause the skeleton and the resulting |
| Bison output files to be licensed under the GNU General Public |
| License without this special exception. |
| |
| This special exception was added by the Free Software Foundation in |
| version 2.2 of Bison. */ |
| |
| /* C LALR(1) parser skeleton 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 "3.0.2" |
| |
| /* Skeleton name. */ |
| #define YYSKELETON_NAME "yacc.c" |
| |
| /* Pure parsers. */ |
| #define YYPURE 0 |
| |
| /* Push parsers. */ |
| #define YYPUSH 0 |
| |
| /* Pull parsers. */ |
| #define YYPULL 1 |
| |
| |
| |
| |
| /* Copy the first part of user declarations. */ |
| |
| |
| #include <stdio.h> |
| #include <inttypes.h> |
| #include <stdlib.h> |
| #include <string.h> |
| //#define YYDEBUG 1 |
| int yylex (void); |
| void yyerror (char const *); |
| |
| struct field { |
| char *name; |
| unsigned int width; |
| unsigned int value; |
| struct field *next; |
| }; |
| |
| extern struct field *sym_table; |
| struct field *putsym (char const *, unsigned int); |
| struct field *getsym (char const *); |
| |
| struct field *sym_table; |
| struct field *sym_table_tail; |
| |
| FILE* fp; |
| |
| /* Bit array intermediary representation */ |
| struct blob { |
| unsigned int bloblen; |
| unsigned char *blb; |
| unsigned short checksum; |
| unsigned char *actualblob; |
| unsigned int lenactualblob; |
| }; |
| |
| #define VALID_BIT 0x80 |
| #define MAX_WIDTH 32 |
| #define CHECKSUM_SIZE 16 |
| |
| struct blob *binary; |
| |
| static void check_pointer (void *ptr) |
| { |
| if (ptr == NULL) { |
| printf("Error: Out of memory\n"); |
| exit(1); |
| } |
| } |
| |
| static unsigned char* value_to_bits (unsigned int v, unsigned int w) |
| { |
| unsigned int i; |
| unsigned char* bitarr; |
| |
| if (w > MAX_WIDTH) w = MAX_WIDTH; |
| bitarr = (unsigned char *) malloc (w * sizeof (unsigned char)); |
| check_pointer(bitarr); |
| memset (bitarr, 0, w); |
| |
| for (i = 0; i < w; i++) { |
| bitarr[i] = VALID_BIT | ((v & (1 << i)) >> i); |
| } |
| return bitarr; |
| } |
| |
| /* Store each bit of a bitfield in a new byte sequentially 0x80 or 0x81 */ |
| static void append_field_to_blob (unsigned char b[], unsigned int w) |
| { |
| unsigned int i, j; |
| binary->blb = (unsigned char *) realloc (binary->blb, binary->bloblen + w); |
| check_pointer(binary->blb); |
| for (j = 0, i = binary->bloblen; i < binary->bloblen + w; i++, j++) { |
| binary->blb[i] = VALID_BIT | (b[j] & 1); |
| //fprintf (stderr, "blob[%d] = %d\n", i, binary->blb[i] & 1); |
| } |
| binary->bloblen += w; |
| } |
| |
| static void set_bitfield(char *name, unsigned int value) |
| { |
| unsigned long long i; |
| struct field *bf = getsym (name); |
| if (bf) { |
| bf->value = value & 0xffffffff; |
| i = (1 << bf->width) - 1; |
| if (bf->width > 8 * sizeof (unsigned int)) { |
| fprintf(stderr, "Overflow in bitfield, truncating bits to fit\n"); |
| bf->value = value & i; |
| } |
| //fprintf(stderr, "Setting `%s` = %d\n", bf->name, bf->value); |
| } else { |
| fprintf(stderr, "Can't find bitfield `%s` in spec\n", name); |
| } |
| } |
| |
| static void set_bitfield_array(char *name, unsigned int n, unsigned int value) |
| { |
| unsigned int i; |
| unsigned long len = strlen (name); |
| char *namen = (char *) malloc ((len + 9) * sizeof (char)); |
| check_pointer(namen); |
| for (i = 0; i < n; i++) { |
| snprintf (namen, len + 8, "%s%x", name, i); |
| set_bitfield (namen, value); |
| } |
| free(namen); |
| } |
| |
| static void create_new_bitfield(char *name, unsigned int width) |
| { |
| struct field *bf; |
| |
| if (!(bf = putsym (name, width))) return; |
| //fprintf(stderr, "Added bitfield `%s` : %d\n", bf->name, width); |
| } |
| |
| static void create_new_bitfields(char *name, unsigned int n, unsigned int width) |
| { |
| unsigned int i; |
| unsigned long len = strlen (name); |
| char *namen = (char *) malloc ((len + 9) * sizeof (char)); |
| check_pointer(namen); |
| for (i = 0; i < n; i++) { |
| snprintf (namen, len + 8, "%s%x", name, i); |
| create_new_bitfield (namen, width); |
| } |
| free(namen); |
| } |
| |
| struct field *putsym (char const *sym_name, unsigned int w) |
| { |
| if (getsym(sym_name)) { |
| fprintf(stderr, "Cannot add duplicate named bitfield `%s`\n", sym_name); |
| return 0; |
| } |
| struct field *ptr = (struct field *) malloc (sizeof (struct field)); |
| check_pointer(ptr); |
| ptr->name = (char *) malloc (strlen (sym_name) + 1); |
| check_pointer(ptr->name); |
| strcpy (ptr->name, sym_name); |
| ptr->width = w; |
| ptr->value = 0; |
| ptr->next = (struct field *)0; |
| if (sym_table_tail) { |
| sym_table_tail->next = ptr; |
| } else { |
| sym_table = ptr; |
| } |
| sym_table_tail = ptr; |
| return ptr; |
| } |
| |
| struct field *getsym (char const *sym_name) |
| { |
| struct field *ptr; |
| for (ptr = sym_table; ptr != (struct field *) 0; |
| ptr = (struct field *)ptr->next) { |
| if (strcmp (ptr->name, sym_name) == 0) |
| return ptr; |
| } |
| return 0; |
| } |
| |
| static void dump_all_values (void) |
| { |
| struct field *ptr; |
| for (ptr = sym_table; ptr != (struct field *) 0; |
| ptr = (struct field *)ptr->next) { |
| fprintf(stderr, "%s = %d (%d bits)\n", |
| ptr->name, |
| ptr->value, |
| ptr->width); |
| } |
| } |
| |
| static void empty_field_table(void) |
| { |
| struct field *ptr; |
| struct field *ptrnext; |
| |
| for (ptr = sym_table; ptr != (struct field *) 0; ptr = ptrnext) { |
| if (ptr) { |
| ptrnext = ptr->next; |
| free(ptr); |
| } else { |
| ptrnext = (struct field *) 0; |
| } |
| } |
| sym_table = 0; |
| sym_table_tail = 0; |
| } |
| |
| static void create_binary_blob (void) |
| { |
| if (binary && binary->blb) { |
| free(binary->blb); |
| free(binary); |
| } |
| binary = (struct blob *) malloc (sizeof (struct blob)); |
| check_pointer(binary); |
| binary->blb = (unsigned char *) malloc (sizeof (unsigned char)); |
| check_pointer(binary->blb); |
| binary->bloblen = 0; |
| binary->blb[0] = VALID_BIT; |
| } |
| |
| static void interpret_next_blob_value (struct field *f) |
| { |
| unsigned int i; |
| unsigned int v = 0; |
| |
| if (binary->bloblen >= binary->lenactualblob * 8) { |
| f->value = 0; |
| return; |
| } |
| |
| for (i = 0; i < f->width; i++) { |
| v |= (binary->blb[binary->bloblen++] & 1) << i; |
| } |
| |
| f->value = v; |
| } |
| |
| /* {}%BIN -> {} */ |
| static void generate_setter_bitfields(unsigned char *bin) |
| { |
| unsigned int i; |
| struct field *ptr; |
| |
| /* Convert bytes to bit array */ |
| for (i = 0; i < binary->lenactualblob; i++) { |
| append_field_to_blob (value_to_bits(bin[i], 8), 8); |
| } |
| |
| /* Reset blob position to zero */ |
| binary->bloblen = 0; |
| |
| fprintf (fp, "# AUTOGENERATED SETTER BY BINCFG\n{\n"); |
| |
| /* Traverse spec and output bitfield setters based on blob values */ |
| for (ptr = sym_table; ptr != (struct field *) 0; ptr = ptr->next) { |
| |
| interpret_next_blob_value(ptr); |
| fprintf (fp, "\t\"%s\" = 0x%x,\n", ptr->name, ptr->value); |
| } |
| fseek(fp, -2, SEEK_CUR); |
| fprintf (fp, "\n}\n"); |
| } |
| |
| static void generate_binary_with_gbe_checksum(void) |
| { |
| int i; |
| unsigned short checksum; |
| |
| /* traverse spec, push to blob and add up for checksum */ |
| struct field *ptr; |
| unsigned int uptochksum = 0; |
| for (ptr = sym_table; ptr != (struct field *) 0; ptr = ptr->next) { |
| if (strcmp (ptr->name, "checksum_gbe") == 0) { |
| /* Stop traversing because we hit checksum */ |
| ptr = ptr->next; |
| break; |
| } |
| append_field_to_blob ( |
| value_to_bits(ptr->value, ptr->width), |
| ptr->width); |
| uptochksum += ptr->width; |
| } |
| |
| /* deserialize bits of blob up to checksum */ |
| for (i = 0; i < uptochksum; i += 8) { |
| unsigned char byte = (((binary->blb[i+0] & 1) << 0) |
| | ((binary->blb[i+1] & 1) << 1) |
| | ((binary->blb[i+2] & 1) << 2) |
| | ((binary->blb[i+3] & 1) << 3) |
| | ((binary->blb[i+4] & 1) << 4) |
| | ((binary->blb[i+5] & 1) << 5) |
| | ((binary->blb[i+6] & 1) << 6) |
| | ((binary->blb[i+7] & 1) << 7) |
| ); |
| fprintf(fp, "%c", byte); |
| |
| /* incremental 16 bit checksum */ |
| if ((i % 16) < 8) { |
| binary->checksum += byte; |
| } else { |
| binary->checksum += byte << 8; |
| } |
| } |
| |
| checksum = (0xbaba - binary->checksum) & 0xffff; |
| |
| /* Now write checksum */ |
| set_bitfield ("checksum_gbe", checksum); |
| |
| fprintf(fp, "%c", checksum & 0xff); |
| fprintf(fp, "%c", (checksum & 0xff00) >> 8); |
| |
| append_field_to_blob (value_to_bits(checksum, 16), 16); |
| |
| for (; ptr != (struct field *) 0; ptr = ptr->next) { |
| append_field_to_blob ( |
| value_to_bits(ptr->value, ptr->width), ptr->width); |
| } |
| |
| /* deserialize rest of blob past checksum */ |
| for (i = uptochksum + CHECKSUM_SIZE; i < binary->bloblen; i += 8) { |
| unsigned char byte = (((binary->blb[i+0] & 1) << 0) |
| | ((binary->blb[i+1] & 1) << 1) |
| | ((binary->blb[i+2] & 1) << 2) |
| | ((binary->blb[i+3] & 1) << 3) |
| | ((binary->blb[i+4] & 1) << 4) |
| | ((binary->blb[i+5] & 1) << 5) |
| | ((binary->blb[i+6] & 1) << 6) |
| | ((binary->blb[i+7] & 1) << 7) |
| ); |
| fprintf(fp, "%c", byte); |
| } |
| } |
| |
| /* {}{} -> BIN */ |
| static void generate_binary(void) |
| { |
| unsigned int i; |
| struct field *ptr; |
| |
| if (binary->bloblen % 8) { |
| fprintf (stderr, "ERROR: Spec must be multiple of 8 bits wide\n"); |
| exit (1); |
| } |
| |
| if (getsym ("checksum_gbe")) { |
| generate_binary_with_gbe_checksum(); |
| return; |
| } |
| |
| /* traverse spec, push to blob */ |
| for (ptr = sym_table; ptr != (struct field *) 0; ptr = ptr->next) { |
| append_field_to_blob ( |
| value_to_bits(ptr->value, ptr->width), |
| ptr->width); |
| } |
| |
| /* deserialize bits of blob */ |
| for (i = 0; i < binary->bloblen; i += 8) { |
| unsigned char byte = (((binary->blb[i+0] & 1) << 0) |
| | ((binary->blb[i+1] & 1) << 1) |
| | ((binary->blb[i+2] & 1) << 2) |
| | ((binary->blb[i+3] & 1) << 3) |
| | ((binary->blb[i+4] & 1) << 4) |
| | ((binary->blb[i+5] & 1) << 5) |
| | ((binary->blb[i+6] & 1) << 6) |
| | ((binary->blb[i+7] & 1) << 7) |
| ); |
| fprintf(fp, "%c", byte); |
| } |
| } |
| |
| |
| |
| |
| # ifndef YY_NULLPTR |
| # if defined __cplusplus && 201103L <= __cplusplus |
| # define YY_NULLPTR nullptr |
| # else |
| # define YY_NULLPTR 0 |
| # endif |
| # endif |
| |
| /* Enabling verbose error messages. */ |
| #ifdef YYERROR_VERBOSE |
| # undef YYERROR_VERBOSE |
| # define YYERROR_VERBOSE 1 |
| #else |
| # define YYERROR_VERBOSE 0 |
| #endif |
| |
| /* In a future release of Bison, this section will be replaced |
| by #include "bincfg.tab.h_shipped". */ |
| #ifndef YY_YY_COREBOOT_UTIL_BINCFG_BINCFG_TAB_H_SHIPPED_INCLUDED |
| # define YY_YY_COREBOOT_UTIL_BINCFG_BINCFG_TAB_H_SHIPPED_INCLUDED |
| /* Debug traces. */ |
| #ifndef YYDEBUG |
| # define YYDEBUG 0 |
| #endif |
| #if YYDEBUG |
| extern int yydebug; |
| #endif |
| |
| /* Token type. */ |
| #ifndef YYTOKENTYPE |
| # define YYTOKENTYPE |
| enum yytokentype |
| { |
| name = 258, |
| val = 259, |
| vals = 260, |
| hexbyte = 261, |
| binblob = 262, |
| eof = 263 |
| }; |
| #endif |
| |
| /* Value type. */ |
| #if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED |
| typedef union YYSTYPE YYSTYPE; |
| union YYSTYPE |
| { |
| |
| |
| char *str; |
| unsigned int u32; |
| unsigned int *u32array; |
| unsigned char u8; |
| unsigned char *u8array; |
| |
| |
| }; |
| # define YYSTYPE_IS_TRIVIAL 1 |
| # define YYSTYPE_IS_DECLARED 1 |
| #endif |
| |
| |
| extern YYSTYPE yylval; |
| |
| int yyparse (void); |
| |
| #endif /* !YY_YY_COREBOOT_UTIL_BINCFG_BINCFG_TAB_H_SHIPPED_INCLUDED */ |
| |
| /* Copy the second part of user declarations. */ |
| |
| |
| |
| #ifdef short |
| # undef short |
| #endif |
| |
| #ifdef YYTYPE_UINT8 |
| typedef YYTYPE_UINT8 yytype_uint8; |
| #else |
| typedef unsigned char yytype_uint8; |
| #endif |
| |
| #ifdef YYTYPE_INT8 |
| typedef YYTYPE_INT8 yytype_int8; |
| #else |
| typedef signed char yytype_int8; |
| #endif |
| |
| #ifdef YYTYPE_UINT16 |
| typedef YYTYPE_UINT16 yytype_uint16; |
| #else |
| typedef unsigned short int yytype_uint16; |
| #endif |
| |
| #ifdef YYTYPE_INT16 |
| typedef YYTYPE_INT16 yytype_int16; |
| #else |
| typedef short int yytype_int16; |
| #endif |
| |
| #ifndef YYSIZE_T |
| # ifdef __SIZE_TYPE__ |
| # define YYSIZE_T __SIZE_TYPE__ |
| # elif defined size_t |
| # define YYSIZE_T size_t |
| # elif ! defined YYSIZE_T |
| # include <stddef.h> /* INFRINGES ON USER NAME SPACE */ |
| # define YYSIZE_T size_t |
| # else |
| # define YYSIZE_T unsigned int |
| # endif |
| #endif |
| |
| #define YYSIZE_MAXIMUM ((YYSIZE_T) -1) |
| |
| #ifndef YY_ |
| # if defined YYENABLE_NLS && 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 |
| |
| #ifndef YY_ATTRIBUTE |
| # if (defined __GNUC__ \ |
| && (2 < __GNUC__ || (__GNUC__ == 2 && 96 <= __GNUC_MINOR__))) \ |
| || defined __SUNPRO_C && 0x5110 <= __SUNPRO_C |
| # define YY_ATTRIBUTE(Spec) __attribute__(Spec) |
| # else |
| # define YY_ATTRIBUTE(Spec) /* empty */ |
| # endif |
| #endif |
| |
| #ifndef YY_ATTRIBUTE_PURE |
| # define YY_ATTRIBUTE_PURE YY_ATTRIBUTE ((__pure__)) |
| #endif |
| |
| #ifndef YY_ATTRIBUTE_UNUSED |
| # define YY_ATTRIBUTE_UNUSED YY_ATTRIBUTE ((__unused__)) |
| #endif |
| |
| #if !defined _Noreturn \ |
| && (!defined __STDC_VERSION__ || __STDC_VERSION__ < 201112) |
| # if defined _MSC_VER && 1200 <= _MSC_VER |
| # define _Noreturn __declspec (noreturn) |
| # else |
| # define _Noreturn YY_ATTRIBUTE ((__noreturn__)) |
| # endif |
| #endif |
| |
| /* Suppress unused-variable warnings by "using" E. */ |
| #if ! defined lint || defined __GNUC__ |
| # define YYUSE(E) ((void) (E)) |
| #else |
| # define YYUSE(E) /* empty */ |
| #endif |
| |
| #if defined __GNUC__ && 407 <= __GNUC__ * 100 + __GNUC_MINOR__ |
| /* Suppress an incorrect diagnostic about yylval being uninitialized. */ |
| # define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \ |
| _Pragma ("GCC diagnostic push") \ |
| _Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")\ |
| _Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"") |
| # define YY_IGNORE_MAYBE_UNINITIALIZED_END \ |
| _Pragma ("GCC diagnostic pop") |
| #else |
| # define YY_INITIAL_VALUE(Value) Value |
| #endif |
| #ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN |
| # define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN |
| # define YY_IGNORE_MAYBE_UNINITIALIZED_END |
| #endif |
| #ifndef YY_INITIAL_VALUE |
| # define YY_INITIAL_VALUE(Value) /* Nothing. */ |
| #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 |
| # elif defined __BUILTIN_VA_ARG_INCR |
| # include <alloca.h> /* INFRINGES ON USER NAME SPACE */ |
| # elif defined _AIX |
| # define YYSTACK_ALLOC __alloca |
| # elif defined _MSC_VER |
| # include <malloc.h> /* INFRINGES ON USER NAME SPACE */ |
| # define alloca _alloca |
| # else |
| # define YYSTACK_ALLOC alloca |
| # if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS |
| # include <stdlib.h> /* INFRINGES ON USER NAME SPACE */ |
| /* Use EXIT_SUCCESS as a witness for stdlib.h. */ |
| # ifndef EXIT_SUCCESS |
| # define EXIT_SUCCESS 0 |
| # endif |
| # 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 2006 */ |
| # endif |
| # else |
| # define YYSTACK_ALLOC YYMALLOC |
| # define YYSTACK_FREE YYFREE |
| # ifndef YYSTACK_ALLOC_MAXIMUM |
| # define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM |
| # endif |
| # if (defined __cplusplus && ! defined EXIT_SUCCESS \ |
| && ! ((defined YYMALLOC || defined malloc) \ |
| && (defined YYFREE || defined free))) |
| # include <stdlib.h> /* INFRINGES ON USER NAME SPACE */ |
| # ifndef EXIT_SUCCESS |
| # define EXIT_SUCCESS 0 |
| # endif |
| # endif |
| # ifndef YYMALLOC |
| # define YYMALLOC malloc |
| # if ! defined malloc && ! defined EXIT_SUCCESS |
| void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */ |
| # endif |
| # endif |
| # ifndef YYFREE |
| # define YYFREE free |
| # if ! defined free && ! defined EXIT_SUCCESS |
| void free (void *); /* INFRINGES ON USER NAME SPACE */ |
| # endif |
| # 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 |
| { |
| yytype_int16 yyss_alloc; |
| YYSTYPE yyvs_alloc; |
| }; |
| |
| /* 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 (yytype_int16) + sizeof (YYSTYPE)) \ |
| + YYSTACK_GAP_MAXIMUM) |
| |
| # define YYCOPY_NEEDED 1 |
| |
| /* 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_alloc, Stack) \ |
| do \ |
| { \ |
| YYSIZE_T yynewbytes; \ |
| YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \ |
| Stack = &yyptr->Stack_alloc; \ |
| yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ |
| yyptr += yynewbytes / sizeof (*yyptr); \ |
| } \ |
| while (0) |
| |
| #endif |
| |
| #if defined YYCOPY_NEEDED && YYCOPY_NEEDED |
| /* Copy COUNT objects from SRC to DST. The source and destination do |
| not overlap. */ |
| # ifndef YYCOPY |
| # if defined __GNUC__ && 1 < __GNUC__ |
| # define YYCOPY(Dst, Src, Count) \ |
| __builtin_memcpy (Dst, Src, (Count) * sizeof (*(Src))) |
| # else |
| # define YYCOPY(Dst, Src, Count) \ |
| do \ |
| { \ |
| YYSIZE_T yyi; \ |
| for (yyi = 0; yyi < (Count); yyi++) \ |
| (Dst)[yyi] = (Src)[yyi]; \ |
| } \ |
| while (0) |
| # endif |
| # endif |
| #endif /* !YYCOPY_NEEDED */ |
| |
| /* YYFINAL -- State number of the termination state. */ |
| #define YYFINAL 2 |
| /* YYLAST -- Last index in YYTABLE. */ |
| #define YYLAST 32 |
| |
| /* YYNTOKENS -- Number of terminals. */ |
| #define YYNTOKENS 17 |
| /* YYNNTS -- Number of nonterminals. */ |
| #define YYNNTS 9 |
| /* YYNRULES -- Number of rules. */ |
| #define YYNRULES 17 |
| /* YYNSTATES -- Number of states. */ |
| #define YYNSTATES 39 |
| |
| /* YYTRANSLATE[YYX] -- Symbol number corresponding to YYX as returned |
| by yylex, with out-of-bounds checking. */ |
| #define YYUNDEFTOK 2 |
| #define YYMAXUTOK 263 |
| |
| #define YYTRANSLATE(YYX) \ |
| ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) |
| |
| /* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM |
| as returned by yylex, without out-of-bounds checking. */ |
| static const yytype_uint8 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, 9, 2, 2, |
| 2, 2, 2, 2, 12, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 13, 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, 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, 10, 2, 11, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 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 |
| }; |
| |
| #if YYDEBUG |
| /* YYRLINE[YYN] -- Source line where rule number YYN was defined. */ |
| static const yytype_uint16 yyrline[] = |
| { |
| 0, 399, 399, 401, 402, 407, 411, 412, 417, 418, |
| 422, 423, 427, 428, 433, 434, 438, 439 |
| }; |
| #endif |
| |
| #if YYDEBUG || YYERROR_VERBOSE || 0 |
| /* 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", "name", "val", "vals", "hexbyte", |
| "binblob", "eof", "'%'", "'{'", "'}'", "','", "':'", "'='", "'['", "']'", |
| "$accept", "input", "blob", "spec", "specmembers", "specpair", "setter", |
| "valuemembers", "setpair", YY_NULLPTR |
| }; |
| #endif |
| |
| # ifdef YYPRINT |
| /* YYTOKNUM[NUM] -- (External) token number corresponding to the |
| (internal) symbol number NUM (which must be that of a token). */ |
| static const yytype_uint16 yytoknum[] = |
| { |
| 0, 256, 257, 258, 259, 260, 261, 262, 263, 37, |
| 123, 125, 44, 58, 61, 91, 93 |
| }; |
| # endif |
| |
| #define YYPACT_NINF -11 |
| |
| #define yypact_value_is_default(Yystate) \ |
| (!!((Yystate) == (-11))) |
| |
| #define YYTABLE_NINF -1 |
| |
| #define yytable_value_is_error(Yytable_value) \ |
| 0 |
| |
| /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing |
| STATE-NUM. */ |
| static const yytype_int8 yypact[] = |
| { |
| -11, 0, -11, -2, -3, -10, -11, -9, -4, 3, |
| 1, -11, 7, 12, 13, -11, 15, -11, -1, -11, |
| 8, 9, -11, -11, 4, -11, 18, 19, -11, 21, |
| 14, -11, 10, -11, 24, 11, -11, 25, -11 |
| }; |
| |
| /* YYDEFACT[STATE-NUM] -- Default reduction number in state STATE-NUM. |
| Performed when YYTABLE does not specify something else to do. Zero |
| means the default is an error. */ |
| static const yytype_uint8 yydefact[] = |
| { |
| 2, 0, 1, 0, 0, 0, 6, 0, 8, 0, |
| 0, 4, 0, 0, 0, 7, 0, 5, 0, 12, |
| 0, 14, 3, 10, 0, 9, 0, 0, 13, 0, |
| 0, 16, 0, 15, 0, 0, 11, 0, 17 |
| }; |
| |
| /* YYPGOTO[NTERM-NUM]. */ |
| static const yytype_int8 yypgoto[] = |
| { |
| -11, -11, -11, -11, 16, -11, -11, 2, -11 |
| }; |
| |
| /* YYDEFGOTO[NTERM-NUM]. */ |
| static const yytype_int8 yydefgoto[] = |
| { |
| -1, 1, 11, 4, 7, 8, 12, 20, 21 |
| }; |
| |
| /* YYTABLE[YYPACT[STATE-NUM]] -- What to do in state STATE-NUM. If |
| positive, shift that token. If negative, reduce the rule whose |
| number is the opposite. If YYTABLE_NINF, syntax error. */ |
| static const yytype_uint8 yytable[] = |
| { |
| 2, 5, 15, 13, 18, 14, 9, 10, 16, 6, |
| 3, 17, 19, 26, 27, 22, 23, 24, 5, 28, |
| 30, 29, 31, 32, 18, 37, 35, 34, 36, 38, |
| 0, 33, 25 |
| }; |
| |
| static const yytype_int8 yycheck[] = |
| { |
| 0, 3, 11, 13, 3, 15, 9, 10, 12, 11, |
| 10, 8, 11, 14, 15, 8, 4, 4, 3, 11, |
| 16, 12, 4, 4, 3, 14, 16, 13, 4, 4, |
| -1, 29, 16 |
| }; |
| |
| /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing |
| symbol of state STATE-NUM. */ |
| static const yytype_uint8 yystos[] = |
| { |
| 0, 18, 0, 10, 20, 3, 11, 21, 22, 9, |
| 10, 19, 23, 13, 15, 11, 12, 8, 3, 11, |
| 24, 25, 8, 4, 4, 21, 14, 15, 11, 12, |
| 16, 4, 4, 24, 13, 16, 4, 14, 4 |
| }; |
| |
| /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ |
| static const yytype_uint8 yyr1[] = |
| { |
| 0, 17, 18, 18, 18, 19, 20, 20, 21, 21, |
| 22, 22, 23, 23, 24, 24, 25, 25 |
| }; |
| |
| /* YYR2[YYN] -- Number of symbols on the right hand side of rule YYN. */ |
| static const yytype_uint8 yyr2[] = |
| { |
| 0, 2, 0, 4, 3, 2, 2, 3, 1, 3, |
| 3, 6, 2, 3, 1, 3, 3, 6 |
| }; |
| |
| |
| #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 |
| |
| |
| #define YYRECOVERING() (!!yyerrstatus) |
| |
| #define YYBACKUP(Token, Value) \ |
| do \ |
| if (yychar == YYEMPTY) \ |
| { \ |
| yychar = (Token); \ |
| yylval = (Value); \ |
| YYPOPSTACK (yylen); \ |
| yystate = *yyssp; \ |
| goto yybackup; \ |
| } \ |
| else \ |
| { \ |
| yyerror (YY_("syntax error: cannot back up")); \ |
| YYERROR; \ |
| } \ |
| while (0) |
| |
| /* Error token number */ |
| #define YYTERROR 1 |
| #define YYERRCODE 256 |
| |
| |
| |
| /* 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) |
| |
| /* This macro is provided for backward compatibility. */ |
| #ifndef YY_LOCATION_PRINT |
| # define YY_LOCATION_PRINT(File, Loc) ((void) 0) |
| #endif |
| |
| |
| # define YY_SYMBOL_PRINT(Title, Type, Value, Location) \ |
| do { \ |
| if (yydebug) \ |
| { \ |
| YYFPRINTF (stderr, "%s ", Title); \ |
| yy_symbol_print (stderr, \ |
| Type, Value); \ |
| YYFPRINTF (stderr, "\n"); \ |
| } \ |
| } while (0) |
| |
| |
| /*----------------------------------------. |
| | Print this symbol's value on YYOUTPUT. | |
| `----------------------------------------*/ |
| |
| static void |
| yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep) |
| { |
| FILE *yyo = yyoutput; |
| YYUSE (yyo); |
| if (!yyvaluep) |
| return; |
| # ifdef YYPRINT |
| if (yytype < YYNTOKENS) |
| YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); |
| # endif |
| YYUSE (yytype); |
| } |
| |
| |
| /*--------------------------------. |
| | Print this symbol on YYOUTPUT. | |
| `--------------------------------*/ |
| |
| static void |
| yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep) |
| { |
| YYFPRINTF (yyoutput, "%s %s (", |
| yytype < YYNTOKENS ? "token" : "nterm", yytname[yytype]); |
| |
| yy_symbol_value_print (yyoutput, yytype, yyvaluep); |
| YYFPRINTF (yyoutput, ")"); |
| } |
| |
| /*------------------------------------------------------------------. |
| | yy_stack_print -- Print the state stack from its BOTTOM up to its | |
| | TOP (included). | |
| `------------------------------------------------------------------*/ |
| |
| static void |
| yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop) |
| { |
| YYFPRINTF (stderr, "Stack now"); |
| for (; yybottom <= yytop; yybottom++) |
| { |
| int yybot = *yybottom; |
| YYFPRINTF (stderr, " %d", yybot); |
| } |
| 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. | |
| `------------------------------------------------*/ |
| |
| static void |
| yy_reduce_print (yytype_int16 *yyssp, YYSTYPE *yyvsp, int yyrule) |
| { |
| unsigned long int yylno = yyrline[yyrule]; |
| int yynrhs = yyr2[yyrule]; |
| int yyi; |
| YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n", |
| yyrule - 1, yylno); |
| /* The symbols being reduced. */ |
| for (yyi = 0; yyi < yynrhs; yyi++) |
| { |
| YYFPRINTF (stderr, " $%d = ", yyi + 1); |
| yy_symbol_print (stderr, |
| yystos[yyssp[yyi + 1 - yynrhs]], |
| &(yyvsp[(yyi + 1) - (yynrhs)]) |
| ); |
| YYFPRINTF (stderr, "\n"); |
| } |
| } |
| |
| # define YY_REDUCE_PRINT(Rule) \ |
| do { \ |
| if (yydebug) \ |
| yy_reduce_print (yyssp, yyvsp, 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 |
| yystrlen (const char *yystr) |
| { |
| YYSIZE_T yylen; |
| for (yylen = 0; yystr[yylen]; yylen++) |
| continue; |
| return yylen; |
| } |
| # 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 * |
| yystpcpy (char *yydest, const char *yysrc) |
| { |
| 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 == '"') |
| { |
| YYSIZE_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 |
| |
| /* Copy into *YYMSG, which is of size *YYMSG_ALLOC, an error message |
| about the unexpected token YYTOKEN for the state stack whose top is |
| YYSSP. |
| |
| Return 0 if *YYMSG was successfully written. Return 1 if *YYMSG is |
| not large enough to hold the message. In that case, also set |
| *YYMSG_ALLOC to the required number of bytes. Return 2 if the |
| required number of bytes is too large to store. */ |
| static int |
| yysyntax_error (YYSIZE_T *yymsg_alloc, char **yymsg, |
| yytype_int16 *yyssp, int yytoken) |
| { |
| YYSIZE_T yysize0 = yytnamerr (YY_NULLPTR, yytname[yytoken]); |
| YYSIZE_T yysize = yysize0; |
| enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 }; |
| /* Internationalized format string. */ |
| const char *yyformat = YY_NULLPTR; |
| /* Arguments of yyformat. */ |
| char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; |
| /* Number of reported tokens (one for the "unexpected", one per |
| "expected"). */ |
| int yycount = 0; |
| |
| /* There are many possibilities here to consider: |
| - If this state is a consistent state with a default action, then |
| the only way this function was invoked is if the default action |
| is an error action. In that case, don't check for expected |
| tokens because there are none. |
| - The only way there can be no lookahead present (in yychar) is if |
| this state is a consistent state with a default action. Thus, |
| detecting the absence of a lookahead is sufficient to determine |
| that there is no unexpected or expected token to report. In that |
| case, just report a simple "syntax error". |
| - Don't assume there isn't a lookahead just because this state is a |
| consistent state with a default action. There might have been a |
| previous inconsistent state, consistent state with a non-default |
| action, or user semantic action that manipulated yychar. |
| - Of course, the expected token list depends on states to have |
| correct lookahead information, and it depends on the parser not |
| to perform extra reductions after fetching a lookahead from the |
| scanner and before detecting a syntax error. Thus, state merging |
| (from LALR or IELR) and default reductions corrupt the expected |
| token list. However, the list is correct for canonical LR with |
| one exception: it will still contain any token that will not be |
| accepted due to an error action in a later state. |
| */ |
| if (yytoken != YYEMPTY) |
| { |
| int yyn = yypact[*yyssp]; |
| yyarg[yycount++] = yytname[yytoken]; |
| if (!yypact_value_is_default (yyn)) |
| { |
| /* Start YYX at -YYN if negative to avoid negative indexes in |
| YYCHECK. In other words, skip the first -YYN actions for |
| this state because they are default actions. */ |
| int yyxbegin = yyn < 0 ? -yyn : 0; |
| /* Stay within bounds of both yycheck and yytname. */ |
| int yychecklim = YYLAST - yyn + 1; |
| int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS; |
| int yyx; |
| |
| for (yyx = yyxbegin; yyx < yyxend; ++yyx) |
| if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR |
| && !yytable_value_is_error (yytable[yyx + yyn])) |
| { |
| if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) |
| { |
| yycount = 1; |
| yysize = yysize0; |
| break; |
| } |
| yyarg[yycount++] = yytname[yyx]; |
| { |
| YYSIZE_T yysize1 = yysize + yytnamerr (YY_NULLPTR, yytname[yyx]); |
| if (! (yysize <= yysize1 |
| && yysize1 <= YYSTACK_ALLOC_MAXIMUM)) |
| return 2; |
| yysize = yysize1; |
| } |
| } |
| } |
| } |
| |
| switch (yycount) |
| { |
| # define YYCASE_(N, S) \ |
| case N: \ |
| yyformat = S; \ |
| break |
| YYCASE_(0, YY_("syntax error")); |
| YYCASE_(1, YY_("syntax error, unexpected %s")); |
| YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s")); |
| YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s")); |
| YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s")); |
| YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s")); |
| # undef YYCASE_ |
| } |
| |
| { |
| YYSIZE_T yysize1 = yysize + yystrlen (yyformat); |
| if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM)) |
| return 2; |
| yysize = yysize1; |
| } |
| |
| if (*yymsg_alloc < yysize) |
| { |
| *yymsg_alloc = 2 * yysize; |
| if (! (yysize <= *yymsg_alloc |
| && *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM)) |
| *yymsg_alloc = YYSTACK_ALLOC_MAXIMUM; |
| return 1; |
| } |
| |
| /* 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 = *yyformat) != '\0') |
| if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount) |
| { |
| yyp += yytnamerr (yyp, yyarg[yyi++]); |
| yyformat += 2; |
| } |
| else |
| { |
| yyp++; |
| yyformat++; |
| } |
| } |
| return 0; |
| } |
| #endif /* YYERROR_VERBOSE */ |
| |
| /*-----------------------------------------------. |
| | Release the memory associated to this symbol. | |
| `-----------------------------------------------*/ |
| |
| static void |
| yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep) |
| { |
| YYUSE (yyvaluep); |
| if (!yymsg) |
| yymsg = "Deleting"; |
| YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp); |
| |
| YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN |
| YYUSE (yytype); |
| YY_IGNORE_MAYBE_UNINITIALIZED_END |
| } |
| |
| |
| |
| |
| /* The lookahead symbol. */ |
| int yychar; |
| |
| /* The semantic value of the lookahead symbol. */ |
| YYSTYPE yylval; |
| /* Number of syntax errors so far. */ |
| int yynerrs; |
| |
| |
| /*----------. |
| | yyparse. | |
| `----------*/ |
| |
| int |
| yyparse (void) |
| { |
| int yystate; |
| /* Number of tokens to shift before error messages enabled. */ |
| int yyerrstatus; |
| |
| /* The stacks and their tools: |
| 'yyss': related to states. |
| 'yyvs': related to semantic values. |
| |
| Refer to the stacks through separate pointers, to allow yyoverflow |
| to reallocate them elsewhere. */ |
| |
| /* The state stack. */ |
| yytype_int16 yyssa[YYINITDEPTH]; |
| yytype_int16 *yyss; |
| yytype_int16 *yyssp; |
| |
| /* The semantic value stack. */ |
| YYSTYPE yyvsa[YYINITDEPTH]; |
| YYSTYPE *yyvs; |
| YYSTYPE *yyvsp; |
| |
| YYSIZE_T yystacksize; |
| |
| int yyn; |
| int yyresult; |
| /* Lookahead token as an internal (translated) token number. */ |
| int yytoken = 0; |
| /* The variables used to return semantic value and location from the |
| action routines. */ |
| YYSTYPE yyval; |
| |
| #if YYERROR_VERBOSE |
| /* Buffer for error messages, and its allocated size. */ |
| char yymsgbuf[128]; |
| char *yymsg = yymsgbuf; |
| YYSIZE_T yymsg_alloc = sizeof yymsgbuf; |
| #endif |
| |
| #define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N)) |
| |
| /* The number of symbols on the RHS of the reduced rule. |
| Keep to zero when no symbol should be popped. */ |
| int yylen = 0; |
| |
| yyssp = yyss = yyssa; |
| yyvsp = yyvs = yyvsa; |
| yystacksize = YYINITDEPTH; |
| |
| YYDPRINTF ((stderr, "Starting parse\n")); |
| |
| yystate = 0; |
| yyerrstatus = 0; |
| yynerrs = 0; |
| yychar = YYEMPTY; /* Cause a token to be read. */ |
| 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; |
| yytype_int16 *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; |
| |
| { |
| yytype_int16 *yyss1 = yyss; |
| union yyalloc *yyptr = |
| (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); |
| if (! yyptr) |
| goto yyexhaustedlab; |
| YYSTACK_RELOCATE (yyss_alloc, yyss); |
| YYSTACK_RELOCATE (yyvs_alloc, 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)); |
| |
| if (yystate == YYFINAL) |
| YYACCEPT; |
| |
| 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. */ |
| |
| /* First try to decide what to do without reference to lookahead token. */ |
| yyn = yypact[yystate]; |
| if (yypact_value_is_default (yyn)) |
| 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); |
| 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 (yytable_value_is_error (yyn)) |
| goto yyerrlab; |
| yyn = -yyn; |
| goto yyreduce; |
| } |
| |
| /* Count tokens shifted since error; after three, turn off error |
| status. */ |
| if (yyerrstatus) |
| yyerrstatus--; |
| |
| /* Shift the lookahead token. */ |
| YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc); |
| |
| /* Discard the shifted token. */ |
| yychar = YYEMPTY; |
| |
| yystate = yyn; |
| YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN |
| *++yyvsp = yylval; |
| YY_IGNORE_MAYBE_UNINITIALIZED_END |
| |
| 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 3: |
| |
| { empty_field_table(); YYACCEPT;} |
| |
| break; |
| |
| case 4: |
| |
| { fprintf (stderr, "Parsed all bytes\n"); |
| empty_field_table(); YYACCEPT;} |
| |
| break; |
| |
| case 5: |
| |
| { generate_setter_bitfields(binary->actualblob); } |
| |
| break; |
| |
| case 6: |
| |
| { fprintf (stderr, "No spec\n"); } |
| |
| break; |
| |
| case 7: |
| |
| { fprintf (stderr, "Parsed all spec\n"); |
| create_binary_blob(); } |
| |
| break; |
| |
| case 10: |
| |
| { create_new_bitfield((yyvsp[-2].str), (yyvsp[0].u32)); } |
| |
| break; |
| |
| case 11: |
| |
| { create_new_bitfields((yyvsp[-5].str), (yyvsp[-3].u32), (yyvsp[0].u32)); } |
| |
| break; |
| |
| case 12: |
| |
| { fprintf (stderr, "No values\n"); } |
| |
| break; |
| |
| case 13: |
| |
| { fprintf (stderr, "Parsed all values\n"); |
| generate_binary(); } |
| |
| break; |
| |
| case 16: |
| |
| { set_bitfield((yyvsp[-2].str), (yyvsp[0].u32)); } |
| |
| break; |
| |
| case 17: |
| |
| { set_bitfield_array((yyvsp[-5].str), (yyvsp[-3].u32), (yyvsp[0].u32)); } |
| |
| break; |
| |
| |
| |
| default: break; |
| } |
| /* User semantic actions sometimes alter yychar, and that requires |
| that yytoken be updated with the new translation. We take the |
| approach of translating immediately before every use of yytoken. |
| One alternative is translating here after every semantic action, |
| but that translation would be missed if the semantic action invokes |
| YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or |
| if it invokes YYBACKUP. In the case of YYABORT or YYACCEPT, an |
| incorrect destructor might then be invoked immediately. In the |
| case of YYERROR or YYBACKUP, subsequent parser actions might lead |
| to an incorrect destructor call or verbose syntax error message |
| before the lookahead is translated. */ |
| YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc); |
| |
| YYPOPSTACK (yylen); |
| yylen = 0; |
| 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: |
| /* Make sure we have latest lookahead translation. See comments at |
| user semantic actions for why this is necessary. */ |
| yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar); |
| |
| /* If not already recovering from an error, report this error. */ |
| if (!yyerrstatus) |
| { |
| ++yynerrs; |
| #if ! YYERROR_VERBOSE |
| yyerror (YY_("syntax error")); |
| #else |
| # define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \ |
| yyssp, yytoken) |
| { |
| char const *yymsgp = YY_("syntax error"); |
| int yysyntax_error_status; |
| yysyntax_error_status = YYSYNTAX_ERROR; |
| if (yysyntax_error_status == 0) |
| yymsgp = yymsg; |
| else if (yysyntax_error_status == 1) |
| { |
| if (yymsg != yymsgbuf) |
| YYSTACK_FREE (yymsg); |
| yymsg = (char *) YYSTACK_ALLOC (yymsg_alloc); |
| if (!yymsg) |
| { |
| yymsg = yymsgbuf; |
| yymsg_alloc = sizeof yymsgbuf; |
| yysyntax_error_status = 2; |
| } |
| else |
| { |
| yysyntax_error_status = YYSYNTAX_ERROR; |
| yymsgp = yymsg; |
| } |
| } |
| yyerror (yymsgp); |
| if (yysyntax_error_status == 2) |
| goto yyexhaustedlab; |
| } |
| # undef YYSYNTAX_ERROR |
| #endif |
| } |
| |
| |
| |
| if (yyerrstatus == 3) |
| { |
| /* If just tried and failed to reuse lookahead 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 lookahead 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 (/*CONSTCOND*/ 0) |
| goto yyerrorlab; |
| |
| /* Do not reclaim the symbols of the rule whose action triggered |
| this YYERROR. */ |
| YYPOPSTACK (yylen); |
| yylen = 0; |
| YY_STACK_PRINT (yyss, yyssp); |
| 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 (!yypact_value_is_default (yyn)) |
| { |
| 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 (1); |
| yystate = *yyssp; |
| YY_STACK_PRINT (yyss, yyssp); |
| } |
| |
| YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN |
| *++yyvsp = yylval; |
| YY_IGNORE_MAYBE_UNINITIALIZED_END |
| |
| |
| /* 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; |
| |
| #if !defined yyoverflow || YYERROR_VERBOSE |
| /*-------------------------------------------------. |
| | yyexhaustedlab -- memory exhaustion comes here. | |
| `-------------------------------------------------*/ |
| yyexhaustedlab: |
| yyerror (YY_("memory exhausted")); |
| yyresult = 2; |
| /* Fall through. */ |
| #endif |
| |
| yyreturn: |
| if (yychar != YYEMPTY) |
| { |
| /* Make sure we have latest lookahead translation. See comments at |
| user semantic actions for why this is necessary. */ |
| yytoken = YYTRANSLATE (yychar); |
| yydestruct ("Cleanup: discarding lookahead", |
| yytoken, &yylval); |
| } |
| /* Do not reclaim the symbols of the rule whose action triggered |
| this YYABORT or YYACCEPT. */ |
| YYPOPSTACK (yylen); |
| YY_STACK_PRINT (yyss, yyssp); |
| while (yyssp != yyss) |
| { |
| yydestruct ("Cleanup: popping", |
| yystos[*yyssp], yyvsp); |
| YYPOPSTACK (1); |
| } |
| #ifndef yyoverflow |
| if (yyss != yyssa) |
| YYSTACK_FREE (yyss); |
| #endif |
| #if YYERROR_VERBOSE |
| if (yymsg != yymsgbuf) |
| YYSTACK_FREE (yymsg); |
| #endif |
| return yyresult; |
| } |
| |
| |
| |
| /* Called by yyparse on error. */ |
| void yyerror (char const *s) |
| { |
| fprintf (stderr, "yyerror: %s\n", s); |
| } |
| |
| /* Declarations */ |
| void set_input_string(char* in); |
| |
| /* This function parses a string */ |
| static int parse_string(unsigned char* in) { |
| set_input_string ((char *)in); |
| return yyparse (); |
| } |
| |
| static unsigned int loadfile (char *file, char *filetype, |
| unsigned char **parsestring, unsigned int lenstr) |
| { |
| unsigned int lenfile; |
| |
| if ((fp = fopen(file, "r")) == NULL) { |
| printf("Error: Could not open %s file: %s\n",filetype,file); |
| exit(1); |
| } |
| fseek(fp, 0, SEEK_END); |
| lenfile = ftell(fp); |
| fseek(fp, 0, SEEK_SET); |
| |
| if (lenstr == 0) |
| *parsestring = (unsigned char *) malloc (lenfile + 2); |
| else |
| *parsestring = (unsigned char *) realloc (*parsestring, |
| lenfile + lenstr); |
| |
| check_pointer(*parsestring); |
| fread(*parsestring + lenstr, 1, lenfile, fp); |
| fclose(fp); |
| return lenfile; |
| } |
| |
| int main (int argc, char *argv[]) |
| { |
| unsigned int lenspec; |
| unsigned char *parsestring; |
| unsigned char c; |
| unsigned int pos = 0; |
| int ret = 0; |
| |
| #if YYDEBUG == 1 |
| yydebug = 1; |
| #endif |
| create_binary_blob(); |
| binary->lenactualblob = 0; |
| |
| if (argc == 4 && strcmp(argv[1], "-d") != 0) { |
| /* Compile mode */ |
| |
| /* Load Spec */ |
| lenspec = loadfile(argv[1], "spec", &parsestring, 0); |
| loadfile(argv[2], "setter", &parsestring, lenspec); |
| |
| /* Open output and parse string - output to fp */ |
| if ((fp = fopen(argv[3], "wb")) == NULL) { |
| printf("Error: Could not open output file: %s\n",argv[3]); |
| exit(1); |
| } |
| ret = parse_string(parsestring); |
| free(parsestring); |
| } else if (argc == 5 && strcmp (argv[1], "-d") == 0) { |
| /* Decompile mode */ |
| |
| /* Load Spec */ |
| lenspec = loadfile(argv[2], "spec", &parsestring, 0); |
| |
| parsestring[lenspec] = '%'; |
| parsestring[lenspec + 1] = '\0'; |
| |
| /* Load Actual Binary */ |
| if ((fp = fopen(argv[3], "rb")) == NULL) { |
| printf("Error: Could not open binary file: %s\n",argv[3]); |
| exit(1); |
| } |
| fseek(fp, 0, SEEK_END); |
| binary->lenactualblob = ftell(fp); |
| fseek(fp, 0, SEEK_SET); |
| binary->actualblob = (unsigned char *) malloc (binary->lenactualblob); |
| check_pointer(binary->actualblob); |
| fread(binary->actualblob, 1, binary->lenactualblob, fp); |
| fclose(fp); |
| |
| /* Open output and parse - output to fp */ |
| if ((fp = fopen(argv[4], "w")) == NULL) { |
| printf("Error: Could not open output file: %s\n",argv[4]); |
| exit(1); |
| } |
| ret = parse_string(parsestring); |
| free(parsestring); |
| free(binary->actualblob); |
| fclose(fp); |
| } else { |
| printf("Usage: Compile mode\n\n"); |
| printf(" bincfg spec setter binaryoutput\n"); |
| printf(" (file) (file) (file)\n"); |
| printf(" OR : Decompile mode\n\n"); |
| printf(" bincfg -d spec binary setteroutput\n"); |
| } |
| return ret; |
| } |
