yetangitu/ghidra
1
0
Fork 0
mirror of https://github.com/NationalSecurityAgency/ghidra.git synced 2025-10-04 02:09:44 +02:00
Code Issues Releases Wiki Activity
ghidra/Ghidra/Features/Decompiler/src/decompile/cpp/grammar.cc
caheckman a7ad4aef26 GP-3961 Error messages for setFields
2024-02-07 19:57:11 +00:00

3328 lines
94 KiB
C++
Raw Blame History

/* ###
* IP: GHIDRA
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/* A Bison parser, made by GNU Bison 3.5.1. */
/* Bison implementation for Yacc-like parsers in C
Copyright (C) 1984, 1989-1990, 2000-2015, 2018-2020 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. */
/* Undocumented macros, especially those whose name start with YY_,
are private implementation details. Do not rely on them. */
/* Identify Bison output. */
#define YYBISON 1
/* Bison version. */
#define YYBISON_VERSION "3.5.1"
/* Skeleton name. */
#define YYSKELETON_NAME "yacc.c"
/* Pure parsers. */
#define YYPURE 0
/* Push parsers. */
#define YYPUSH 0
/* Pull parsers. */
#define YYPULL 1
/* Substitute the type names. */
#define YYSTYPE GRAMMARSTYPE
/* Substitute the variable and function names. */
#define yyparse grammarparse
#define yylex grammarlex
#define yyerror grammarerror
#define yydebug grammardebug
#define yynerrs grammarnerrs
#define yylval grammarlval
#define yychar grammarchar
/* First part of user prologue. */
#include "grammar.hh"
namespace ghidra {
extern int grammarlex(void);
extern int grammarerror(const char *str);
static CParse *parse;
# ifndef YY_CAST
# ifdef __cplusplus
# define YY_CAST(Type, Val) static_cast<Type> (Val)
# define YY_REINTERPRET_CAST(Type, Val) reinterpret_cast<Type> (Val)
# else
# define YY_CAST(Type, Val) ((Type) (Val))
# define YY_REINTERPRET_CAST(Type, Val) ((Type) (Val))
# endif
# endif
# ifndef YY_NULLPTR
# if defined __cplusplus
# if 201103L <= __cplusplus
# define YY_NULLPTR nullptr
# else
# define YY_NULLPTR 0
# endif
# else
# define YY_NULLPTR ((void*)0)
# endif
# endif
/* Enabling verbose error messages. */
#ifdef YYERROR_VERBOSE
# undef YYERROR_VERBOSE
# define YYERROR_VERBOSE 1
#else
# define YYERROR_VERBOSE 0
#endif
/* Debug traces. */
#ifndef GRAMMARDEBUG
# if defined YYDEBUG
#if YYDEBUG
# define GRAMMARDEBUG 1
# else
# define GRAMMARDEBUG 0
# endif
# else /* ! defined YYDEBUG */
# define GRAMMARDEBUG 0
# endif /* ! defined YYDEBUG */
#endif /* ! defined GRAMMARDEBUG */
#if GRAMMARDEBUG
extern int grammardebug;
#endif
/* Token type. */
#ifndef GRAMMARTOKENTYPE
# define GRAMMARTOKENTYPE
enum grammartokentype
{
DOTDOTDOT = 258,
BADTOKEN = 259,
STRUCT = 260,
UNION = 261,
ENUM = 262,
DECLARATION_RESULT = 263,
PARAM_RESULT = 264,
NUMBER = 265,
IDENTIFIER = 266,
STORAGE_CLASS_SPECIFIER = 267,
TYPE_QUALIFIER = 268,
FUNCTION_SPECIFIER = 269,
TYPE_NAME = 270
};
#endif
/* Value type. */
#if ! defined GRAMMARSTYPE && ! defined GRAMMARSTYPE_IS_DECLARED
union GRAMMARSTYPE
{
uint4 flags;
TypeDeclarator *dec;
vector<TypeDeclarator *> *declist;
TypeSpecifiers *spec;
vector<uint4> *ptrspec;
Datatype *type;
Enumerator *enumer;
vector<Enumerator *> *vecenum;
string *str;
uintb *i;
};
typedef union GRAMMARSTYPE GRAMMARSTYPE;
# define GRAMMARSTYPE_IS_TRIVIAL 1
# define GRAMMARSTYPE_IS_DECLARED 1
#endif
extern GRAMMARSTYPE grammarlval;
int grammarparse (void);
#ifdef short
# undef short
#endif
/* On compilers that do not define __PTRDIFF_MAX__ etc., make sure
<limits.h> and (if available) <stdint.h> are included
so that the code can choose integer types of a good width. */
#ifndef __PTRDIFF_MAX__
# include <limits.h> /* INFRINGES ON USER NAME SPACE */
# if defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
# include <stdint.h> /* INFRINGES ON USER NAME SPACE */
# define YY_STDINT_H
# endif
#endif
/* Narrow types that promote to a signed type and that can represent a
signed or unsigned integer of at least N bits. In tables they can
save space and decrease cache pressure. Promoting to a signed type
helps avoid bugs in integer arithmetic. */
#ifdef __INT_LEAST8_MAX__
typedef __INT_LEAST8_TYPE__ yytype_int8;
#elif defined YY_STDINT_H
typedef int_least8_t yytype_int8;
#else
typedef signed char yytype_int8;
#endif
#ifdef __INT_LEAST16_MAX__
typedef __INT_LEAST16_TYPE__ yytype_int16;
#elif defined YY_STDINT_H
typedef int_least16_t yytype_int16;
#else
typedef short yytype_int16;
#endif
#if defined __UINT_LEAST8_MAX__ && __UINT_LEAST8_MAX__ <= __INT_MAX__
typedef __UINT_LEAST8_TYPE__ yytype_uint8;
#elif (!defined __UINT_LEAST8_MAX__ && defined YY_STDINT_H \
&& UINT_LEAST8_MAX <= INT_MAX)
typedef uint_least8_t yytype_uint8;
#elif !defined __UINT_LEAST8_MAX__ && UCHAR_MAX <= INT_MAX
typedef unsigned char yytype_uint8;
#else
typedef short yytype_uint8;
#endif
#if defined __UINT_LEAST16_MAX__ && __UINT_LEAST16_MAX__ <= __INT_MAX__
typedef __UINT_LEAST16_TYPE__ yytype_uint16;
#elif (!defined __UINT_LEAST16_MAX__ && defined YY_STDINT_H \
&& UINT_LEAST16_MAX <= INT_MAX)
typedef uint_least16_t yytype_uint16;
#elif !defined __UINT_LEAST16_MAX__ && USHRT_MAX <= INT_MAX
typedef unsigned short yytype_uint16;
#else
typedef int yytype_uint16;
#endif
#ifndef YYPTRDIFF_T
# if defined __PTRDIFF_TYPE__ && defined __PTRDIFF_MAX__
# define YYPTRDIFF_T __PTRDIFF_TYPE__
# define YYPTRDIFF_MAXIMUM __PTRDIFF_MAX__
# elif defined PTRDIFF_MAX
# ifndef ptrdiff_t
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
# endif
# define YYPTRDIFF_T ptrdiff_t
# define YYPTRDIFF_MAXIMUM PTRDIFF_MAX
# else
# define YYPTRDIFF_T long
# define YYPTRDIFF_MAXIMUM LONG_MAX
# endif
#endif
#ifndef YYSIZE_T
# ifdef __SIZE_TYPE__
# define YYSIZE_T __SIZE_TYPE__
# elif defined size_t
# define YYSIZE_T size_t
# elif defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
# define YYSIZE_T size_t
# else
# define YYSIZE_T unsigned
# endif
#endif
#define YYSIZE_MAXIMUM \
YY_CAST (YYPTRDIFF_T, \
(YYPTRDIFF_MAXIMUM < YY_CAST (YYSIZE_T, -1) \
? YYPTRDIFF_MAXIMUM \
: YY_CAST (YYSIZE_T, -1)))
#define YYSIZEOF(X) YY_CAST (YYPTRDIFF_T, sizeof (X))
/* Stored state numbers (used for stacks). */
typedef yytype_int8 yy_state_t;
/* State numbers in computations. */
typedef int yy_state_fast_t;
#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_PURE
# if defined __GNUC__ && 2 < __GNUC__ + (96 <= __GNUC_MINOR__)
# define YY_ATTRIBUTE_PURE __attribute__ ((__pure__))
# else
# define YY_ATTRIBUTE_PURE
# endif
#endif
#ifndef YY_ATTRIBUTE_UNUSED
# if defined __GNUC__ && 2 < __GNUC__ + (7 <= __GNUC_MINOR__)
# define YY_ATTRIBUTE_UNUSED __attribute__ ((__unused__))
# else
# define YY_ATTRIBUTE_UNUSED
# 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__ && ! defined __ICC && 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 __cplusplus && defined __GNUC__ && ! defined __ICC && 6 <= __GNUC__
# define YY_IGNORE_USELESS_CAST_BEGIN \
_Pragma ("GCC diagnostic push") \
_Pragma ("GCC diagnostic ignored \"-Wuseless-cast\"")
# define YY_IGNORE_USELESS_CAST_END \
_Pragma ("GCC diagnostic pop")
#endif
#ifndef YY_IGNORE_USELESS_CAST_BEGIN
# define YY_IGNORE_USELESS_CAST_BEGIN
# define YY_IGNORE_USELESS_CAST_END
#endif
#define YY_ASSERT(E) ((void) (0 && (E)))
#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 GRAMMARSTYPE_IS_TRIVIAL && GRAMMARSTYPE_IS_TRIVIAL)))
/* A type that is properly aligned for any stack member. */
union yyalloc
{
yy_state_t yyss_alloc;
YYSTYPE yyvs_alloc;
};
/* The size of the maximum gap between one aligned stack and the next. */
# define YYSTACK_GAP_MAXIMUM (YYSIZEOF (union yyalloc) - 1)
/* The size of an array large to enough to hold all stacks, each with
N elements. */
# define YYSTACK_BYTES(N) \
((N) * (YYSIZEOF (yy_state_t) + YYSIZEOF (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 \
{ \
YYPTRDIFF_T yynewbytes; \
YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \
Stack = &yyptr->Stack_alloc; \
yynewbytes = yystacksize * YYSIZEOF (*Stack) + YYSTACK_GAP_MAXIMUM; \
yyptr += yynewbytes / YYSIZEOF (*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, YY_CAST (YYSIZE_T, (Count)) * sizeof (*(Src)))
# else
# define YYCOPY(Dst, Src, Count) \
do \
{ \
YYPTRDIFF_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 18
/* YYLAST -- Last index in YYTABLE. */
#define YYLAST 155
/* YYNTOKENS -- Number of terminals. */
#define YYNTOKENS 26
/* YYNNTS -- Number of nonterminals. */
#define YYNNTS 26
/* YYNRULES -- Number of rules. */
#define YYNRULES 71
/* YYNSTATES -- Number of states. */
#define YYNSTATES 115
#define YYUNDEFTOK 2
#define YYMAXUTOK 270
/* YYTRANSLATE(TOKEN-NUM) -- Symbol number corresponding to TOKEN-NUM
as returned by yylex, with out-of-bounds checking. */
#define YYTRANSLATE(YYX) \
(0 <= (YYX) && (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
/* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM
as returned by yylex. */
static const yytype_int8 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,
21, 22, 25, 2, 17, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 16,
2, 20, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 23, 2, 24, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 18, 2, 19, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 1, 2, 3, 4,
5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
15
};
#if GRAMMARDEBUG
/* YYRLINE[YYN] -- Source line where rule number YYN was defined. */
static const yytype_uint8 yyrline[] =
{
0, 62, 62, 63, 67, 68, 72, 73, 74, 75,
76, 77, 78, 79, 83, 84, 88, 93, 94, 95,
99, 100, 101, 102, 103, 104, 108, 109, 113, 117,
118, 119, 120, 124, 125, 129, 134, 135, 136, 137,
138, 142, 143, 147, 148, 152, 153, 157, 158, 159,
160, 162, 167, 168, 169, 170, 174, 175, 179, 180,
184, 185, 189, 190, 191, 195, 196, 197, 201, 203,
205, 209
};
#endif
#if GRAMMARDEBUG || 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", "DOTDOTDOT", "BADTOKEN", "STRUCT",
"UNION", "ENUM", "DECLARATION_RESULT", "PARAM_RESULT", "NUMBER",
"IDENTIFIER", "STORAGE_CLASS_SPECIFIER", "TYPE_QUALIFIER",
"FUNCTION_SPECIFIER", "TYPE_NAME", "';'", "','", "'{'", "'}'", "'='",
"'('", "')'", "'['", "']'", "'*'", "$accept", "document", "declaration",
"declaration_specifiers", "init_declarator_list", "init_declarator",
"type_specifier", "struct_or_union_specifier", "struct_declaration_list",
"struct_declaration", "specifier_qualifier_list",
"struct_declarator_list", "struct_declarator", "enum_specifier",
"enumerator_list", "enumerator", "declarator", "direct_declarator",
"pointer", "type_qualifier_list", "parameter_type_list",
"parameter_list", "parameter_declaration", "abstract_declarator",
"direct_abstract_declarator", "assignment_expression", 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_int16 yytoknum[] =
{
0, 256, 257, 258, 259, 260, 261, 262, 263, 264,
265, 266, 267, 268, 269, 270, 59, 44, 123, 125,
61, 40, 41, 91, 93, 42
};
# endif
#define YYPACT_NINF (-71)
#define yypact_value_is_default(Yyn) \
((Yyn) == YYPACT_NINF)
#define YYTABLE_NINF (-1)
#define yytable_value_is_error(Yyn) \
0
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
STATE-NUM. */
static const yytype_int16 yypact[] =
{
114, 102, 102, 16, 41, 59, 108, 102, 102, 102,
-71, -71, 62, 102, -71, -71, 9, -71, -71, 31,
105, 46, 105, 54, 68, -71, -71, -71, -71, -71,
12, 2, 116, -71, -71, 104, 70, -71, 9, -71,
71, -71, 107, 105, 105, 105, 35, -71, 12, 105,
38, 68, 65, 39, -71, 91, -71, -71, 11, -71,
12, 102, 8, 104, 117, 107, 102, 128, 56, -71,
-71, -71, -71, 118, -71, -71, 61, -71, 112, 130,
3, -71, -71, -71, -71, -71, 119, 76, -71, -71,
111, 120, -71, 121, 122, -71, -71, 12, -71, 36,
-71, -71, -71, -71, -71, 83, 123, -71, -71, -71,
-71, -71, -71, -71, -71
};
/* 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_int8 yydefact[] =
{
0, 0, 0, 0, 0, 0, 0, 6, 8, 9,
17, 2, 0, 7, 18, 19, 63, 3, 1, 22,
0, 25, 0, 40, 0, 10, 12, 13, 47, 4,
0, 52, 0, 14, 16, 45, 0, 11, 0, 62,
65, 64, 66, 0, 31, 29, 0, 26, 0, 0,
0, 0, 43, 0, 41, 0, 56, 54, 53, 5,
0, 0, 0, 46, 0, 67, 0, 0, 0, 32,
30, 20, 27, 0, 33, 35, 0, 23, 0, 0,
0, 37, 48, 57, 55, 15, 0, 58, 60, 71,
0, 0, 68, 0, 0, 21, 28, 0, 24, 0,
36, 44, 39, 42, 51, 0, 0, 50, 70, 69,
34, 38, 59, 61, 49
};
/* YYPGOTO[NTERM-NUM]. */
static const yytype_int8 yypgoto[] =
{
-71, -71, -71, 93, -71, 82, -1, -71, -11, -37,
92, -71, 48, -71, 97, -70, -13, 63, -12, 87,
84, -71, 0, 113, 115, -62
};
/* YYDEFGOTO[NTERM-NUM]. */
static const yytype_int8 yydefgoto[] =
{
-1, 3, 11, 16, 32, 33, 45, 14, 46, 47,
48, 73, 74, 15, 53, 54, 34, 35, 36, 58,
86, 87, 88, 41, 42, 91
};
/* 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_int8 yytable[] =
{
13, 13, 17, 39, 40, 94, 13, 13, 13, 72,
103, 50, 13, 72, 52, 56, 18, 55, 89, 57,
28, 56, 102, 28, 83, 55, 40, 31, 106, 103,
38, 72, 68, 30, 31, 75, 31, 31, 76, 72,
4, 5, 6, 4, 5, 6, 84, 52, 44, 43,
10, 44, 19, 10, 71, 111, 80, 77, 81, 20,
13, 4, 5, 6, 49, 13, 4, 5, 6, 44,
21, 10, 51, 28, 44, 95, 10, 22, 29, 52,
98, 28, 28, 30, 75, 79, 112, 31, 4, 5,
6, 30, 38, 105, 12, 7, 8, 9, 10, 63,
25, 26, 27, 63, 13, 113, 37, 4, 5, 6,
4, 5, 6, 82, 7, 8, 9, 10, 44, 23,
10, 89, 1, 2, 83, 61, 24, 62, 66, 99,
67, 100, 59, 60, 96, 97, 69, 70, 89, 92,
101, 104, 85, 108, 107, 110, 109, 114, 78, 90,
93, 64, 0, 0, 0, 65
};
static const yytype_int8 yycheck[] =
{
1, 2, 2, 16, 16, 67, 7, 8, 9, 46,
80, 22, 13, 50, 11, 13, 0, 30, 10, 31,
11, 13, 19, 11, 13, 38, 38, 25, 90, 99,
21, 68, 43, 21, 25, 48, 25, 25, 49, 76,
5, 6, 7, 5, 6, 7, 58, 11, 13, 18,
15, 13, 11, 15, 19, 19, 17, 19, 19, 18,
61, 5, 6, 7, 18, 66, 5, 6, 7, 13,
11, 15, 18, 11, 13, 19, 15, 18, 16, 11,
19, 11, 11, 21, 97, 20, 3, 25, 5, 6,
7, 21, 21, 17, 1, 12, 13, 14, 15, 36,
7, 8, 9, 40, 105, 105, 13, 5, 6, 7,
5, 6, 7, 22, 12, 13, 14, 15, 13, 11,
15, 10, 8, 9, 13, 21, 18, 23, 21, 17,
23, 19, 16, 17, 16, 17, 44, 45, 10, 22,
10, 22, 60, 22, 24, 97, 24, 24, 51, 62,
66, 38, -1, -1, -1, 40
};
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
symbol of state STATE-NUM. */
static const yytype_int8 yystos[] =
{
0, 8, 9, 27, 5, 6, 7, 12, 13, 14,
15, 28, 29, 32, 33, 39, 29, 48, 0, 11,
18, 11, 18, 11, 18, 29, 29, 29, 11, 16,
21, 25, 30, 31, 42, 43, 44, 29, 21, 42,
44, 49, 50, 18, 13, 32, 34, 35, 36, 18,
34, 18, 11, 40, 41, 42, 13, 44, 45, 16,
17, 21, 23, 43, 49, 50, 21, 23, 34, 36,
36, 19, 35, 37, 38, 42, 34, 19, 40, 20,
17, 19, 22, 13, 44, 31, 46, 47, 48, 10,
45, 51, 22, 46, 51, 19, 16, 17, 19, 17,
19, 10, 19, 41, 22, 17, 51, 24, 22, 24,
38, 19, 3, 48, 24
};
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
static const yytype_int8 yyr1[] =
{
0, 26, 27, 27, 28, 28, 29, 29, 29, 29,
29, 29, 29, 29, 30, 30, 31, 32, 32, 32,
33, 33, 33, 33, 33, 33, 34, 34, 35, 36,
36, 36, 36, 37, 37, 38, 39, 39, 39, 39,
39, 40, 40, 41, 41, 42, 42, 43, 43, 43,
43, 43, 44, 44, 44, 44, 45, 45, 46, 46,
47, 47, 48, 48, 48, 49, 49, 49, 50, 50,
50, 51
};
/* YYR2[YYN] -- Number of symbols on the right hand side of rule YYN. */
static const yytype_int8 yyr2[] =
{
0, 2, 2, 2, 2, 3, 1, 1, 1, 1,
2, 2, 2, 2, 1, 3, 1, 1, 1, 1,
4, 5, 2, 4, 5, 2, 1, 2, 3, 1,
2, 1, 2, 1, 3, 1, 5, 4, 6, 5,
2, 1, 3, 1, 3, 1, 2, 1, 3, 5,
4, 4, 1, 2, 2, 3, 1, 2, 1, 3,
1, 3, 2, 1, 2, 1, 1, 2, 3, 4,
4, 1
};
#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 GRAMMARDEBUG
# 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 YYO. |
`-----------------------------------*/
static void
yy_symbol_value_print (FILE *yyo, int yytype, YYSTYPE const * const yyvaluep)
{
FILE *yyoutput = yyo;
YYUSE (yyoutput);
if (!yyvaluep)
return;
# ifdef YYPRINT
if (yytype < YYNTOKENS)
YYPRINT (yyo, yytoknum[yytype], *yyvaluep);
# endif
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
YYUSE (yytype);
YY_IGNORE_MAYBE_UNINITIALIZED_END
}
/*---------------------------.
| Print this symbol on YYO. |
`---------------------------*/
static void
yy_symbol_print (FILE *yyo, int yytype, YYSTYPE const * const yyvaluep)
{
YYFPRINTF (yyo, "%s %s (",
yytype < YYNTOKENS ? "token" : "nterm", yytname[yytype]);
yy_symbol_value_print (yyo, yytype, yyvaluep);
YYFPRINTF (yyo, ")");
}
/*------------------------------------------------------------------.
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
| TOP (included). |
`------------------------------------------------------------------*/
static void
yy_stack_print (yy_state_t *yybottom, yy_state_t *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 (yy_state_t *yyssp, YYSTYPE *yyvsp, int yyrule)
{
int yylno = yyrline[yyrule];
int yynrhs = yyr2[yyrule];
int yyi;
YYFPRINTF (stderr, "Reducing stack by rule %d (line %d):\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 /* !GRAMMARDEBUG */
# define YYDPRINTF(Args)
# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
# define YY_STACK_PRINT(Bottom, Top)
# define YY_REDUCE_PRINT(Rule)
#endif /* !GRAMMARDEBUG */
/* 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(S) (YY_CAST (YYPTRDIFF_T, strlen (S)))
# else
/* Return the length of YYSTR. */
static YYPTRDIFF_T
yystrlen (const char *yystr)
{
YYPTRDIFF_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 YYPTRDIFF_T
yytnamerr (char *yyres, const char *yystr)
{
if (*yystr == '"')
{
YYPTRDIFF_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;
else
goto append;
append:
default:
if (yyres)
yyres[yyn] = *yyp;
yyn++;
break;
case '"':
if (yyres)
yyres[yyn] = '\0';
return yyn;
}
do_not_strip_quotes: ;
}
if (yyres)
return yystpcpy (yyres, yystr) - yyres;
else
return yystrlen (yystr);
}
# 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 (YYPTRDIFF_T *yymsg_alloc, char **yymsg,
yy_state_t *yyssp, int yytoken)
{
enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
/* Internationalized format string. */
const char *yyformat = YY_NULLPTR;
/* Arguments of yyformat: reported tokens (one for the "unexpected",
one per "expected"). */
char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
/* Actual size of YYARG. */
int yycount = 0;
/* Cumulated lengths of YYARG. */
YYPTRDIFF_T yysize = 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];
YYPTRDIFF_T yysize0 = yytnamerr (YY_NULLPTR, yytname[yytoken]);
yysize = yysize0;
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];
{
YYPTRDIFF_T yysize1
= yysize + yytnamerr (YY_NULLPTR, yytname[yyx]);
if (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM)
yysize = yysize1;
else
return 2;
}
}
}
}
switch (yycount)
{
# define YYCASE_(N, S) \
case N: \
yyformat = S; \
break
default: /* Avoid compiler warnings. */
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_
}
{
/* Don't count the "%s"s in the final size, but reserve room for
the terminator. */
YYPTRDIFF_T yysize1 = yysize + (yystrlen (yyformat) - 2 * yycount) + 1;
if (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM)
yysize = yysize1;
else
return 2;
}
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)
{
yy_state_fast_t 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. */
yy_state_t yyssa[YYINITDEPTH];
yy_state_t *yyss;
yy_state_t *yyssp;
/* The semantic value stack. */
YYSTYPE yyvsa[YYINITDEPTH];
YYSTYPE *yyvs;
YYSTYPE *yyvsp;
YYPTRDIFF_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;
YYPTRDIFF_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 -- set current state (the top of the stack) to yystate. |
`--------------------------------------------------------------------*/
yysetstate:
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
YY_ASSERT (0 <= yystate && yystate < YYNSTATES);
YY_IGNORE_USELESS_CAST_BEGIN
*yyssp = YY_CAST (yy_state_t, yystate);
YY_IGNORE_USELESS_CAST_END
if (yyss + yystacksize - 1 <= yyssp)
#if !defined yyoverflow && !defined YYSTACK_RELOCATE
goto yyexhaustedlab;
#else
{
/* Get the current used size of the three stacks, in elements. */
YYPTRDIFF_T yysize = yyssp - yyss + 1;
# if defined 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. */
yy_state_t *yyss1 = yyss;
YYSTYPE *yyvs1 = yyvs;
/* 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 * YYSIZEOF (*yyssp),
&yyvs1, yysize * YYSIZEOF (*yyvsp),
&yystacksize);
yyss = yyss1;
yyvs = yyvs1;
}
# else /* defined YYSTACK_RELOCATE */
/* Extend the stack our own way. */
if (YYMAXDEPTH <= yystacksize)
goto yyexhaustedlab;
yystacksize *= 2;
if (YYMAXDEPTH < yystacksize)
yystacksize = YYMAXDEPTH;
{
yy_state_t *yyss1 = yyss;
union yyalloc *yyptr =
YY_CAST (union yyalloc *,
YYSTACK_ALLOC (YY_CAST (YYSIZE_T, 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
yyssp = yyss + yysize - 1;
yyvsp = yyvs + yysize - 1;
YY_IGNORE_USELESS_CAST_BEGIN
YYDPRINTF ((stderr, "Stack size increased to %ld\n",
YY_CAST (long, yystacksize)));
YY_IGNORE_USELESS_CAST_END
if (yyss + yystacksize - 1 <= yyssp)
YYABORT;
}
#endif /* !defined yyoverflow && !defined YYSTACK_RELOCATE */
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);
yystate = yyn;
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
*++yyvsp = yylval;
YY_IGNORE_MAYBE_UNINITIALIZED_END
/* Discard the shifted token. */
yychar = YYEMPTY;
goto yynewstate;
/*-----------------------------------------------------------.
| yydefault -- do the default action for the current state. |
`-----------------------------------------------------------*/
yydefault:
yyn = yydefact[yystate];
if (yyn == 0)
goto yyerrlab;
goto yyreduce;
/*-----------------------------.
| yyreduce -- do a reduction. |
`-----------------------------*/
yyreduce:
/* yyn is the number of a rule to reduce with. */
yylen = yyr2[yyn];
/* If YYLEN is nonzero, implement the default value of the action:
'$$ = $1'.
Otherwise, the following line sets YYVAL to garbage.
This behavior is undocumented and Bison
users should not rely upon it. Assigning to YYVAL
unconditionally makes the parser a bit smaller, and it avoids a
GCC warning that YYVAL may be used uninitialized. */
yyval = yyvsp[1-yylen];
YY_REDUCE_PRINT (yyn);
switch (yyn)
{
case 2:
{ parse->setResultDeclarations((yyvsp[0].declist)); }
break;
case 3:
{ vector<TypeDeclarator *> *res = parse->newVecDeclarator(); res->push_back((yyvsp[0].dec)); parse->setResultDeclarations(res); }
break;
case 4:
{ (yyval.declist) = parse->mergeSpecDecVec((yyvsp[-1].spec)); }
break;
case 5:
{ (yyval.declist) = parse->mergeSpecDecVec((yyvsp[-2].spec),(yyvsp[-1].declist)); }
break;
case 6:
{ (yyval.spec) = parse->newSpecifier(); parse->addSpecifier((yyval.spec),(yyvsp[0].str)); }
break;
case 7:
{ (yyval.spec) = parse->newSpecifier(); parse->addTypeSpecifier((yyval.spec),(yyvsp[0].type)); }
break;
case 8:
{ (yyval.spec) = parse->newSpecifier(); parse->addSpecifier((yyval.spec),(yyvsp[0].str)); }
break;
case 9:
{ (yyval.spec) = parse->newSpecifier(); parse->addFuncSpecifier((yyval.spec),(yyvsp[0].str)); }
break;
case 10:
{ (yyval.spec) = parse->addSpecifier((yyvsp[0].spec),(yyvsp[-1].str)); }
break;
case 11:
{ (yyval.spec) = parse->addTypeSpecifier((yyvsp[0].spec),(yyvsp[-1].type)); }
break;
case 12:
{ (yyval.spec) = parse->addSpecifier((yyvsp[0].spec),(yyvsp[-1].str)); }
break;
case 13:
{ (yyval.spec) = parse->addFuncSpecifier((yyvsp[0].spec),(yyvsp[-1].str)); }
break;
case 14:
{ (yyval.declist) = parse->newVecDeclarator(); (yyval.declist)->push_back((yyvsp[0].dec)); }
break;
case 15:
{ (yyval.declist) = (yyvsp[-2].declist); (yyval.declist)->push_back((yyvsp[0].dec)); }
break;
case 16:
{ (yyval.dec) = (yyvsp[0].dec); }
break;
case 17:
{ (yyval.type) = (yyvsp[0].type); }
break;
case 18:
{ (yyval.type) = (yyvsp[0].type); }
break;
case 19:
{ (yyval.type) = (yyvsp[0].type); }
break;
case 20:
{ (yyval.type) = parse->newStruct("",(yyvsp[-1].declist)); }
break;
case 21:
{ (yyval.type) = parse->newStruct(*(yyvsp[-3].str),(yyvsp[-1].declist)); }
break;
case 22:
{ (yyval.type) = parse->oldStruct(*(yyvsp[0].str)); }
break;
case 23:
{ (yyval.type) = parse->newUnion("",(yyvsp[-1].declist)); }
break;
case 24:
{ (yyval.type) = parse->newUnion(*(yyvsp[-3].str),(yyvsp[-1].declist)); }
break;
case 25:
{ (yyval.type) = parse->oldUnion(*(yyvsp[0].str)); }
break;
case 26:
{ (yyval.declist) = (yyvsp[0].declist); }
break;
case 27:
{ (yyval.declist) = (yyvsp[-1].declist); (yyval.declist)->insert((yyval.declist)->end(),(yyvsp[0].declist)->begin(),(yyvsp[0].declist)->end()); }
break;
case 28:
{ (yyval.declist) = parse->mergeSpecDecVec((yyvsp[-2].spec),(yyvsp[-1].declist)); }
break;
case 29:
{ (yyval.spec) = parse->newSpecifier(); parse->addTypeSpecifier((yyval.spec),(yyvsp[0].type)); }
break;
case 30:
{ (yyval.spec) = parse->addTypeSpecifier((yyvsp[0].spec),(yyvsp[-1].type)); }
break;
case 31:
{ (yyval.spec) = parse->newSpecifier(); parse->addSpecifier((yyval.spec),(yyvsp[0].str)); }
break;
case 32:
{ (yyval.spec) = parse->addSpecifier((yyvsp[0].spec),(yyvsp[-1].str)); }
break;
case 33:
{ (yyval.declist) = parse->newVecDeclarator(); (yyval.declist)->push_back((yyvsp[0].dec)); }
break;
case 34:
{ (yyval.declist) = (yyvsp[-2].declist); (yyval.declist)->push_back((yyvsp[0].dec)); }
break;
case 35:
{ (yyval.dec) = (yyvsp[0].dec); }
break;
case 36:
{ (yyval.type) = parse->newEnum(*(yyvsp[-3].str),(yyvsp[-1].vecenum)); }
break;
case 37:
{ (yyval.type) = parse->newEnum("",(yyvsp[-1].vecenum)); }
break;
case 38:
{ (yyval.type) = parse->newEnum(*(yyvsp[-4].str),(yyvsp[-2].vecenum)); }
break;
case 39:
{ (yyval.type) = parse->newEnum("",(yyvsp[-2].vecenum)); }
break;
case 40:
{ (yyval.type) = parse->oldEnum(*(yyvsp[0].str)); }
break;
case 41:
{ (yyval.vecenum) = parse->newVecEnumerator(); (yyval.vecenum)->push_back((yyvsp[0].enumer)); }
break;
case 42:
{ (yyval.vecenum) = (yyvsp[-2].vecenum); (yyval.vecenum)->push_back((yyvsp[0].enumer)); }
break;
case 43:
{ (yyval.enumer) = parse->newEnumerator(*(yyvsp[0].str)); }
break;
case 44:
{ (yyval.enumer) = parse->newEnumerator(*(yyvsp[-2].str),*(yyvsp[0].i)); }
break;
case 45:
{ (yyval.dec) = (yyvsp[0].dec); }
break;
case 46:
{ (yyval.dec) = parse->mergePointer((yyvsp[-1].ptrspec),(yyvsp[0].dec)); }
break;
case 47:
{ (yyval.dec) = parse->newDeclarator((yyvsp[0].str)); }
break;
case 48:
{ (yyval.dec) = (yyvsp[-1].dec); }
break;
case 49:
{ (yyval.dec) = parse->newArray((yyvsp[-4].dec),(yyvsp[-2].flags),(yyvsp[-1].i)); }
break;
case 50:
{ (yyval.dec) = parse->newArray((yyvsp[-3].dec),0,(yyvsp[-1].i)); }
break;
case 51:
{ (yyval.dec) = parse->newFunc((yyvsp[-3].dec),(yyvsp[-1].declist)); }
break;
case 52:
{ (yyval.ptrspec) = parse->newPointer(); (yyval.ptrspec)->push_back(0); }
break;
case 53:
{ (yyval.ptrspec) = parse->newPointer(); (yyval.ptrspec)->push_back((yyvsp[0].flags)); }
break;
case 54:
{ (yyval.ptrspec) = (yyvsp[0].ptrspec); (yyval.ptrspec)->push_back(0); }
break;
case 55:
{ (yyval.ptrspec) = (yyvsp[0].ptrspec); (yyval.ptrspec)->push_back((yyvsp[-1].flags)); }
break;
case 56:
{ (yyval.flags) = parse->convertFlag((yyvsp[0].str)); }
break;
case 57:
{ (yyval.flags) = (yyvsp[-1].flags); (yyval.flags) |= parse->convertFlag((yyvsp[0].str)); }
break;
case 58:
{ (yyval.declist) = (yyvsp[0].declist); }
break;
case 59:
{ (yyval.declist) = (yyvsp[-2].declist); (yyval.declist)->push_back((TypeDeclarator *)0); }
break;
case 60:
{ (yyval.declist) = parse->newVecDeclarator(); (yyval.declist)->push_back((yyvsp[0].dec)); }
break;
case 61:
{ (yyval.declist) = (yyvsp[-2].declist); (yyval.declist)->push_back((yyvsp[0].dec)); }
break;
case 62:
{ (yyval.dec) = parse->mergeSpecDec((yyvsp[-1].spec),(yyvsp[0].dec)); }
break;
case 63:
{ (yyval.dec) = parse->mergeSpecDec((yyvsp[0].spec)); }
break;
case 64:
{ (yyval.dec) = parse->mergeSpecDec((yyvsp[-1].spec),(yyvsp[0].dec)); }
break;
case 65:
{ (yyval.dec) = parse->newDeclarator(); parse->mergePointer((yyvsp[0].ptrspec),(yyval.dec)); }
break;
case 66:
{ (yyval.dec) = (yyvsp[0].dec); }
break;
case 67:
{ (yyval.dec) = parse->mergePointer((yyvsp[-1].ptrspec),(yyvsp[0].dec)); }
break;
case 68:
{ (yyval.dec) = (yyvsp[-1].dec); }
break;
case 69:
{ (yyval.dec) = parse->newArray((yyvsp[-3].dec),0,(yyvsp[-1].i)); }
break;
case 70:
{ (yyval.dec) = parse->newFunc((yyvsp[-3].dec),(yyvsp[-1].declist)); }
break;
case 71:
{ (yyval.i) = (yyvsp[0].i); }
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. */
{
const int yylhs = yyr1[yyn] - YYNTOKENS;
const int yyi = yypgoto[yylhs] + *yyssp;
yystate = (0 <= yyi && yyi <= YYLAST && yycheck[yyi] == *yyssp
? yytable[yyi]
: yydefgoto[yylhs]);
}
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 = YY_CAST (char *, YYSTACK_ALLOC (YY_CAST (YYSIZE_T, 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 when the user code never invokes YYERROR and the
label yyerrorlab therefore never appears in user code. */
if (0)
YYERROR;
/* 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 -- parsing is finished, return the result. |
`-----------------------------------------------------*/
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;
}
void GrammarToken::set(uint4 tp)
{
type = tp;
}
void GrammarToken::set(uint4 tp,char *ptr,int4 len)
{
type = tp;
switch(tp) {
case integer:
{
string charstring(ptr,len);
istringstream s(charstring);
s.unsetf(ios::dec | ios::hex | ios::oct);
intb val;
s >> val;
value.integer = (uintb)val;
}
break;
case identifier:
case stringval:
value.stringval = new string(ptr,len);
break;
case charconstant:
if (len==1)
value.integer = (uintb)*ptr;
else { // Backslash
switch(ptr[1]) {
case 'n':
value.integer = 10;
break;
case '0':
value.integer = 0;
break;
case 'a':
value.integer = 7;
break;
case 'b':
value.integer = 8;
break;
case 't':
value.integer = 9;
break;
case 'v':
value.integer = 11;
break;
case 'f':
value.integer = 12;
break;
case 'r':
value.integer = 13;
break;
default:
value.integer = (uintb)ptr[1];
break;
}
}
break;
default:
throw LowlevelError("Bad internal grammar token set");
}
}
GrammarToken::GrammarToken(void)
{
type = 0;
value.integer = 0;
lineno = -1;
colno = -1;
filenum = -1;
}
GrammarLexer::GrammarLexer(int4 maxbuffer)
{
buffersize = maxbuffer;
buffer = new char[ maxbuffer ];
bufstart = 0;
bufend = 0;
curlineno = 0;
state = start;
in = (istream *)0;
endoffile = true;
}
GrammarLexer::~GrammarLexer(void)
{
delete [] buffer;
}
void GrammarLexer::bumpLine(void)
{ // Keep track of a newline
curlineno += 1;
bufstart = 0;
bufend = 0;
}
uint4 GrammarLexer::moveState(char lookahead)
{ // Change finite state machine based on lookahead
uint4 res;
bool newline = false;
if (lookahead<32) {
if ((lookahead == 9)||(lookahead==11)||(lookahead==12)||
(lookahead==13))
lookahead = ' ';
else if (lookahead == '\n') {
newline = true;
lookahead = ' ';
}
else {
setError("Illegal character");
return GrammarToken::badtoken;
}
}
else if (lookahead >= 127) {
setError("Illegal character");
return GrammarToken::badtoken;
}
res = 0;
bool syntaxerror = false;
switch(state) {
case start:
switch(lookahead) {
case '/':
state = slash;
break;
case '.':
state = dot1;
break;
case '*':
case ',':
case '(':
case ')':
case '[':
case ']':
case '{':
case '}':
case ';':
case '=':
state = punctuation;
bufstart = bufend-1;
break;
case '-':
case '0':
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9':
state = number;
bufstart = bufend-1;
break;
case ' ':
break; // Ignore since we are already open
case '\"':
state = doublequote;
bufstart = bufend-1;
break;
case '\'':
state = singlequote;
break;
case 'a':
case 'b':
case 'c':
case 'd':
case 'e':
case 'f':
case 'g':
case 'h':
case 'i':
case 'j':
case 'k':
case 'l':
case 'm':
case 'n':
case 'o':
case 'p':
case 'q':
case 'r':
case 's':
case 't':
case 'u':
case 'v':
case 'w':
case 'x':
case 'y':
case 'z':
case 'A':
case 'B':
case 'C':
case 'D':
case 'E':
case 'F':
case 'G':
case 'H':
case 'I':
case 'J':
case 'K':
case 'L':
case 'M':
case 'N':
case 'O':
case 'P':
case 'Q':
case 'R':
case 'S':
case 'T':
case 'U':
case 'V':
case 'W':
case 'X':
case 'Y':
case 'Z':
case '_':
state = identifier;
bufstart = bufend-1;
break;
default:
setError("Illegal character");
return GrammarToken::badtoken;
}
break;
case slash:
if (lookahead=='*')
state = c_comment;
else if (lookahead == '/')
state = endofline_comment;
else
syntaxerror = true;
break;
case dot1:
if (lookahead=='.')
state = dot2;
else
syntaxerror = true;
break;
case dot2:
if (lookahead=='.')
state = dot3;
else
syntaxerror = true;
break;
case dot3:
state = start;
res = GrammarToken::dotdotdot;
break;
case punctuation:
state = start;
res = (uint4)buffer[bufstart];
break;
case endofline_comment:
if (newline)
state = start;
break; // Anything else is part of comment
case c_comment:
if (lookahead == '/') {
if ((bufend >1)&&(buffer[bufend-2]=='*'))
state = start;
}
break; // Anything else is part of comment
case doublequote:
if (lookahead == '\"')
state = doublequoteend;
break; // Anything else is part of string
case doublequoteend:
state = start;
res = GrammarToken::stringval;
break;
case singlequote:
if (lookahead == '\\')
state = singlebackslash;
else if (lookahead == '\'')
state = singlequoteend;
break; // Anything else is part of string
case singlequoteend:
state = start;
res = GrammarToken::charconstant;
break;
case singlebackslash: // Seen backslash in a single quoted string
state = singlequote;
break;
case number:
if (lookahead=='x') {
if (((bufend-bufstart)!=2)||(buffer[bufstart]!='0'))
syntaxerror = true; // x only allowed as 0x hex indicator
}
else if ((lookahead>='0')&&(lookahead<='9')) {
}
else if ((lookahead>='A')&&(lookahead<='Z')) {
}
else if ((lookahead>='a')&&(lookahead<='z')) {
}
else if (lookahead == '_') {
}
else {
state = start;
res = GrammarToken::integer;
}
break;
case identifier:
if ((lookahead>='0')&&(lookahead<='9')) {
}
else if ((lookahead>='A')&&(lookahead<='Z')) {
}
else if ((lookahead>='a')&&(lookahead<='z')) {
}
else if (lookahead == '_' || lookahead == ':') {
}
else {
state = start;
res = GrammarToken::identifier;
}
break;
}
if (syntaxerror) {
setError("Syntax error");
return GrammarToken::badtoken;
}
if (newline) bumpLine();
return res;
}
void GrammarLexer::establishToken(GrammarToken &token,uint4 val)
{
if (val < GrammarToken::integer)
token.set(val);
else {
token.set(val,buffer+bufstart,(bufend-bufstart)-1);
}
token.setPosition(filestack.back(),curlineno,bufstart);
}
void GrammarLexer::clear(void)
{ // Clear lexer for a brand new parse
filenamemap.clear();
streammap.clear();
filestack.clear();
bufstart = 0;
bufend = 0;
curlineno = 0;
state = start;
in = (istream *)0;
endoffile = true;
error.clear();
}
void GrammarLexer::writeLocation(ostream &s,int4 line,int4 filenum)
{
s << " at line " << dec << line;
s << " in " << filenamemap[filenum];
}
void GrammarLexer::writeTokenLocation(ostream &s,int4 line,int4 colno)
{
if (line!=curlineno) return; // Does line match current line in buffer
for(int4 i=0;i<bufend;++i)
s << buffer[i];
s << '\n';
for(int4 i=0;i<colno;++i)
s << ' ';
s << "^--\n";
}
void GrammarLexer::pushFile(const string &filename,istream *i)
{
int4 filenum = filenamemap.size();
filenamemap[filenum] = filename;
streammap[filenum] = i;
filestack.push_back(filenum);
in = i;
endoffile = false;
}
void GrammarLexer::popFile(void)
{
filestack.pop_back();
if (filestack.empty()) {
endoffile = true;
return;
}
int4 filenum = filestack.back();
in = streammap[filenum]; // Get previous stream
}
void GrammarLexer::getNextToken(GrammarToken &token)
{ // Read next token, return true if end of stream
char nextchar;
uint4 tok = GrammarToken::badtoken;
bool firsttimethru = true;
if (endoffile) {
token.set(GrammarToken::endoffile);
return;
}
do {
if ((!firsttimethru)||(bufend==0)) {
if (bufend >= buffersize) {
setError("Line too long");
tok = GrammarToken::badtoken;
break;
}
in->get(nextchar);
if (!(*in)) {
endoffile = true;
break;
}
buffer[bufend++] = nextchar;
}
else
nextchar = buffer[bufend-1]; // Get old lookahead token
tok = moveState(nextchar);
firsttimethru = false;
} while(tok == 0);
if (endoffile) {
buffer[bufend++] = ' '; // Simulate a space
tok = moveState(' '); // to let the final token resolve
if ((tok==0)&&(state != start)&&(state != endofline_comment)) {
setError("Incomplete token");
tok = GrammarToken::badtoken;
}
}
establishToken(token,tok);
}
Datatype *PointerModifier::modType(Datatype *base,const TypeDeclarator *decl,Architecture *glb) const
{
int4 addrsize = glb->getDefaultDataSpace()->getAddrSize();
Datatype *restype;
restype = glb->types->getTypePointer(addrsize,base,glb->getDefaultDataSpace()->getWordSize());
return restype;
}
Datatype *ArrayModifier::modType(Datatype *base,const TypeDeclarator *decl,Architecture *glb) const
{
Datatype *restype = glb->types->getTypeArray(arraysize,base);
return restype;
}
FunctionModifier::FunctionModifier(const vector<TypeDeclarator *> *p,bool dtdtdt)
{
paramlist = *p;
if (paramlist.size()==1) {
TypeDeclarator *decl = paramlist[0];
if (decl->numModifiers()==0) { // Check for void as an inputtype
Datatype *ct = decl->getBaseType();
if ((ct != (Datatype *)0)&&(ct->getMetatype()==TYPE_VOID))
paramlist.clear();
}
}
dotdotdot = dtdtdt;
}
void FunctionModifier::getInTypes(vector<Datatype *> &intypes,Architecture *glb) const
{
for(uint4 i=0;i<paramlist.size();++i) {
Datatype *ct = paramlist[i]->buildType(glb);
intypes.push_back( ct );
}
}
void FunctionModifier::getInNames(vector<string> &innames) const
{
for(uint4 i=0;i<paramlist.size();++i)
innames.push_back(paramlist[i]->getIdentifier());
}
bool FunctionModifier::isValid(void) const
{
for(uint4 i=0;i<paramlist.size();++i) {
TypeDeclarator *decl = paramlist[i];
if (!decl->isValid()) return false;
if (decl->numModifiers()==0) {
Datatype *ct = decl->getBaseType();
if ((ct != (Datatype *)0)&&(ct->getMetatype()==TYPE_VOID))
return false; // Extra void type
}
}
return true;
}
Datatype *FunctionModifier::modType(Datatype *base,const TypeDeclarator *decl,Architecture *glb) const
{
PrototypePieces proto;
if (base == (Datatype *)0)
proto.outtype = glb->types->getTypeVoid();
else
proto.outtype = base;
// Varargs is encoded as extra null pointer in paramlist
proto.firstVarArgSlot = -1;
if ((!paramlist.empty())&&(paramlist.back() == (TypeDeclarator *)0)) {
proto.firstVarArgSlot = paramlist.size() - 1;
}
getInTypes(proto.intypes,glb);
proto.model = decl->getModel(glb);
return glb->types->getTypeCode(proto);
}
TypeDeclarator::~TypeDeclarator(void)
{
for(uint4 i=0;i<mods.size();++i)
delete mods[i];
}
Datatype *TypeDeclarator::buildType(Architecture *glb) const
{ // Apply modifications to the basetype, (in reverse order of binding)
Datatype *restype = basetype;
vector<TypeModifier *>::const_iterator iter;
iter = mods.end();
while(iter != mods.begin()) {
--iter;
restype = (*iter)->modType(restype,this,glb);
}
return restype;
}
ProtoModel *TypeDeclarator::getModel(Architecture *glb) const
{
// Get prototype model
ProtoModel *protomodel = (ProtoModel *)0;
if (model.size()!=0)
protomodel = glb->getModel(model);
if (protomodel == (ProtoModel *)0)
protomodel = glb->defaultfp;
return protomodel;
}
bool TypeDeclarator::getPrototype(PrototypePieces &pieces,Architecture *glb) const
{
TypeModifier *mod = (TypeModifier *)0;
if (mods.size() > 0)
mod = mods[0];
if ((mod == (TypeModifier *)0)||(mod->getType()!=TypeModifier::function_mod))
return false;
FunctionModifier *fmod = (FunctionModifier *)mod;
pieces.model = getModel(glb);
pieces.name = ident;
pieces.intypes.clear();
fmod->getInTypes(pieces.intypes,glb);
pieces.innames.clear();
fmod->getInNames(pieces.innames);
pieces.firstVarArgSlot = fmod->isDotdotdot() ? pieces.intypes.size() : -1;
// Construct the output type
pieces.outtype = basetype;
vector<TypeModifier *>::const_iterator iter;
iter = mods.end();
--iter; // At least one modification
while(iter != mods.begin()) { // Do not apply function modifier
pieces.outtype = (*iter)->modType(pieces.outtype,this,glb);
--iter;
}
return true;
}
bool TypeDeclarator::isValid(void) const
{
if (basetype == (Datatype *)0)
return false; // No basetype
int4 count=0;
if ((flags & CParse::f_typedef)!=0)
count += 1;
if ((flags & CParse::f_extern)!=0)
count += 1;
if ((flags & CParse::f_static)!=0)
count += 1;
if ((flags & CParse::f_auto)!=0)
count += 1;
if ((flags & CParse::f_register)!=0)
count += 1;
if (count > 1)
throw ParseError("Multiple storage specifiers");
count = 0;
if ((flags & CParse::f_const)!=0)
count += 1;
if ((flags & CParse::f_restrict)!=0)
count += 1;
if ((flags & CParse::f_volatile)!=0)
count += 1;
if (count > 1)
throw ParseError("Multiple type qualifiers");
for(uint4 i=0;i<mods.size();++i) {
if (!mods[i]->isValid())
return false;
}
return true;
}
CParse::CParse(Architecture *g,int4 maxbuf)
: lexer(maxbuf)
{
glb = g;
firsttoken = -1;
lineno = -1;
colno = -1;
filenum = -1;
lastdecls = (vector<TypeDeclarator *> *)0;
keywords["typedef"] = f_typedef;
keywords["extern"] = f_extern;
keywords["static"] = f_static;
keywords["auto"] = f_auto;
keywords["register"] = f_register;
keywords["const"] = f_const;
keywords["restrict"] = f_restrict;
keywords["volatile"] = f_volatile;
keywords["inline"] = f_inline;
keywords["struct"] = f_struct;
keywords["union"] = f_union;
keywords["enum"] = f_enum;
}
CParse::~CParse(void)
{
clearAllocation();
}
void CParse::clear(void)
{
clearAllocation();
lasterror.clear();
lastdecls = (vector<TypeDeclarator *> *)0;
lexer.clear();
firsttoken = -1;
}
TypeDeclarator *CParse::mergeSpecDec(TypeSpecifiers *spec,TypeDeclarator *dec)
{
dec->basetype = spec->type_specifier;
dec->model = spec->function_specifier;
dec->flags |= spec->flags;
return dec;
}
TypeDeclarator *CParse::mergeSpecDec(TypeSpecifiers *spec)
{
TypeDeclarator *dec = new TypeDeclarator();
typedec_alloc.push_back(dec);
return mergeSpecDec(spec,dec);
}
vector<TypeDeclarator *> *CParse::mergeSpecDecVec(TypeSpecifiers *spec,vector<TypeDeclarator *> *declist)
{
for(uint4 i=0;i<declist->size();++i)
mergeSpecDec(spec,(*declist)[i]);
return declist;
}
vector<TypeDeclarator *> *CParse::mergeSpecDecVec(TypeSpecifiers *spec)
{
vector<TypeDeclarator *> *declist;
declist = new vector<TypeDeclarator *>();
vecdec_alloc.push_back(declist);
TypeDeclarator *dec = new TypeDeclarator();
typedec_alloc.push_back(dec);
declist->push_back( dec );
return mergeSpecDecVec(spec,declist);
}
uint4 CParse::convertFlag(string *str)
{
map<string,uint4>::const_iterator iter;
iter = keywords.find(*str);
if (iter != keywords.end())
return (*iter).second;
setError("Unknown qualifier");
return 0;
}
TypeSpecifiers *CParse::addSpecifier(TypeSpecifiers *spec,string *str)
{
uint4 flag = convertFlag(str);
spec->flags |= flag;
return spec;
}
TypeSpecifiers *CParse::addTypeSpecifier(TypeSpecifiers *spec,Datatype *tp)
{
if (spec->type_specifier!=(Datatype *)0)
setError("Multiple type specifiers");
spec->type_specifier = tp;
return spec;
}
TypeSpecifiers *CParse::addFuncSpecifier(TypeSpecifiers *spec,string *str)
{
map<string,uint4>::const_iterator iter;
iter = keywords.find(*str);
if (iter != keywords.end())
spec->flags |= (*iter).second; // A reserved specifier
else {
if (spec->function_specifier.size()!=0)
setError("Multiple parameter models");
spec->function_specifier = *str;
}
return spec;
}
TypeDeclarator *CParse::mergePointer(vector<uint4> *ptr,TypeDeclarator *dec)
{
for(uint4 i=0;i<ptr->size();++i) {
PointerModifier *newmod = new PointerModifier((*ptr)[i]);
dec->mods.push_back(newmod);
}
return dec;
}
TypeDeclarator *CParse::newDeclarator(string *str)
{
TypeDeclarator *res = new TypeDeclarator(*str);
typedec_alloc.push_back(res);
return res;
}
TypeDeclarator *CParse::newDeclarator(void)
{
TypeDeclarator *res = new TypeDeclarator();
typedec_alloc.push_back(res);
return res;
}
TypeSpecifiers *CParse::newSpecifier(void)
{
TypeSpecifiers *spec = new TypeSpecifiers();
typespec_alloc.push_back(spec);
return spec;
}
vector<TypeDeclarator *> *CParse::newVecDeclarator(void)
{
vector<TypeDeclarator *> *res = new vector<TypeDeclarator *>();
vecdec_alloc.push_back(res);
return res;
}
vector<uint4> *CParse::newPointer(void)
{
vector<uint4> *res = new vector<uint4>();
vecuint4_alloc.push_back(res);
return res;
}
TypeDeclarator *CParse::newArray(TypeDeclarator *dec,uint4 flags,uintb *num)
{
ArrayModifier *newmod = new ArrayModifier(flags,(int4)*num);
dec->mods.push_back(newmod);
return dec;
}
TypeDeclarator *CParse::newFunc(TypeDeclarator *dec,vector<TypeDeclarator *> *declist)
{
bool dotdotdot = false;
if (!declist->empty()) {
if (declist->back() == (TypeDeclarator *)0) {
dotdotdot = true;
declist->pop_back();
}
}
FunctionModifier *newmod = new FunctionModifier(declist,dotdotdot);
dec->mods.push_back(newmod);
return dec;
}
Datatype *CParse::newStruct(const string &ident,vector<TypeDeclarator *> *declist)
{ // Build a new structure
TypeStruct *res = glb->types->getTypeStruct(ident); // Create stub (for recursion)
vector<TypeField> sublist;
for(uint4 i=0;i<declist->size();++i) {
TypeDeclarator *decl = (*declist)[i];
if (!decl->isValid()) {
setError("Invalid structure declarator");
glb->types->destroyType(res);
return (Datatype *)0;
}
sublist.emplace_back(0,-1,decl->getIdentifier(),decl->buildType(glb));
}
TypeStruct::assignFieldOffsets(sublist);
try {
glb->types->setFields(sublist,res,-1,-1,0);
}
catch (LowlevelError &err) {
setError(err.explain);
glb->types->destroyType(res);
return (Datatype *)0;
}
return res;
}
Datatype *CParse::oldStruct(const string &ident)
{
Datatype *res = glb->types->findByName(ident);
if ((res==(Datatype *)0)||(res->getMetatype() != TYPE_STRUCT))
setError("Identifier does not represent a struct as required");
return res;
}
Datatype *CParse::newUnion(const string &ident,vector<TypeDeclarator *> *declist)
{
TypeUnion *res = glb->types->getTypeUnion(ident); // Create stub (for recursion)
vector<TypeField> sublist;
for(uint4 i=0;i<declist->size();++i) {
TypeDeclarator *decl = (*declist)[i];
if (!decl->isValid()) {
setError("Invalid union declarator");
glb->types->destroyType(res);
return (Datatype *)0;
}
sublist.emplace_back(i,0,decl->getIdentifier(),decl->buildType(glb));
}
try {
glb->types->setFields(sublist,res,-1,-1,0);
}
catch (LowlevelError &err) {
setError(err.explain);
glb->types->destroyType(res);
return (Datatype *)0;
}
return res;
}
Datatype *CParse::oldUnion(const string &ident)
{
Datatype *res = glb->types->findByName(ident);
if ((res==(Datatype *)0)||(res->getMetatype() != TYPE_UNION))
setError("Identifier does not represent a union as required");
return res;
}
Enumerator *CParse::newEnumerator(const string &ident)
{
Enumerator *res = new Enumerator(ident);
enum_alloc.push_back(res);
return res;
}
Enumerator *CParse::newEnumerator(const string &ident,uintb val)
{
Enumerator *res = new Enumerator(ident,val);
enum_alloc.push_back(res);
return res;
}
vector<Enumerator *> *CParse::newVecEnumerator(void)
{
vector<Enumerator *> *res = new vector<Enumerator *>();
vecenum_alloc.push_back(res);
return res;
}
Datatype *CParse::newEnum(const string &ident,vector<Enumerator *> *vecenum)
{
TypeEnum *res = glb->types->getTypeEnum(ident);
vector<string> namelist;
vector<uintb> vallist;
vector<bool> assignlist;
for(uint4 i=0;i<vecenum->size();++i) {
Enumerator *enumer = (*vecenum)[i];
namelist.push_back(enumer->enumconstant);
vallist.push_back(enumer->value);
assignlist.push_back(enumer->constantassigned);
}
if (!glb->types->setEnumValues(namelist,vallist,assignlist,res)) {
setError("Bad enumeration values");
glb->types->destroyType(res);
return (Datatype *)0;
}
return res;
}
Datatype *CParse::oldEnum(const string &ident)
{
Datatype *res = glb->types->findByName(ident);
if ((res==(Datatype *)0)||(!res->isEnumType()))
setError("Identifier does not represent an enum as required");
return res;
}
void CParse::clearAllocation(void)
{
list<TypeDeclarator *>::iterator iter1;
for(iter1=typedec_alloc.begin();iter1!=typedec_alloc.end();++iter1)
delete *iter1;
typedec_alloc.clear();
list<TypeSpecifiers *>::iterator iter2;
for(iter2=typespec_alloc.begin();iter2!=typespec_alloc.end();++iter2)
delete *iter2;
typespec_alloc.clear();
list<vector<uint4> *>::iterator iter3;
for(iter3=vecuint4_alloc.begin();iter3!=vecuint4_alloc.end();++iter3)
delete *iter3;
vecuint4_alloc.clear();
list<vector<TypeDeclarator *> *>::iterator iter4;
for(iter4=vecdec_alloc.begin();iter4!=vecdec_alloc.end();++iter4)
delete *iter4;
vecdec_alloc.clear();
list<string *>::iterator iter5;
for(iter5=string_alloc.begin();iter5!=string_alloc.end();++iter5)
delete *iter5;
string_alloc.clear();
list<uintb *>::iterator iter6;
for(iter6=num_alloc.begin();iter6!=num_alloc.end();++iter6)
delete *iter6;
num_alloc.clear();
list<Enumerator *>::iterator iter7;
for(iter7=enum_alloc.begin();iter7!=enum_alloc.end();++iter7)
delete *iter7;
enum_alloc.clear();
list<vector<Enumerator *> *>::iterator iter8;
for(iter8=vecenum_alloc.begin();iter8!=vecenum_alloc.end();++iter8)
delete *iter8;
vecenum_alloc.clear();
}
int4 CParse::lookupIdentifier(const string &nm)
{
map<string,uint4>::const_iterator iter = keywords.find(nm);
if (iter != keywords.end()) {
switch( (*iter).second ) {
case f_typedef:
case f_extern:
case f_static:
case f_auto:
case f_register:
return STORAGE_CLASS_SPECIFIER;
case f_const:
case f_restrict:
case f_volatile:
return TYPE_QUALIFIER;
case f_inline:
return FUNCTION_SPECIFIER;
case f_struct:
return STRUCT;
case f_union:
return UNION;
case f_enum:
return ENUM;
default:
break;
}
}
Datatype *tp = glb->types->findByName(nm);
if (tp != (Datatype *)0) {
yylval.type = tp;
return TYPE_NAME;
}
if (glb->hasModel(nm))
return FUNCTION_SPECIFIER;
return IDENTIFIER; // Unknown identifier
}
int4 CParse::lex(void)
{
GrammarToken tok;
if (firsttoken != -1) {
int4 retval = firsttoken;
firsttoken = -1;
return retval;
}
if (lasterror.size()!=0)
return BADTOKEN;
lexer.getNextToken(tok);
lineno = tok.getLineNo();
colno = tok.getColNo();
filenum = tok.getFileNum();
switch(tok.getType()) {
case GrammarToken::integer:
case GrammarToken::charconstant:
yylval.i = new uintb(tok.getInteger());
num_alloc.push_back(yylval.i);
return NUMBER;
case GrammarToken::identifier:
yylval.str = tok.getString();
string_alloc.push_back(yylval.str);
return lookupIdentifier(*yylval.str);
case GrammarToken::stringval:
delete tok.getString();
setError("Illegal string constant");
return BADTOKEN;
case GrammarToken::dotdotdot:
return DOTDOTDOT;
case GrammarToken::badtoken:
setError(lexer.getError()); // Error from lexer
return BADTOKEN;
case GrammarToken::endoffile:
return -1; // No more tokens
default:
return (int4)tok.getType();
}
}
void CParse::setError(const string &msg)
{
ostringstream s;
s << msg;
lexer.writeLocation(s,lineno,filenum);
s << '\n';
lexer.writeTokenLocation(s,lineno,colno);
lasterror = s.str();
}
bool CParse::runParse(uint4 doctype)
{ // Assuming the stream has been setup, parse it
switch(doctype) {
case doc_declaration:
firsttoken = DECLARATION_RESULT;
break;
case doc_parameter_declaration:
firsttoken = PARAM_RESULT;
break;
default:
throw LowlevelError("Bad document type");
}
parse = this; // Setup global object for yyparse
int4 res = yyparse();
if (res != 0) {
if (lasterror.size()==0)
setError("Syntax error");
return false;
}
return true;
}
bool CParse::parseFile(const string &nm,uint4 doctype)
{ // Run the parser on a file, return true if no parse errors
clear(); // Clear out any old parsing
ifstream s(nm.c_str()); // open file
if (!s)
throw LowlevelError("Unable to open file for parsing: "+nm);
lexer.pushFile(nm,&s); // Inform lexer of filename and stream
bool res = runParse(doctype);
s.close();
return res;
}
bool CParse::parseStream(istream &s,uint4 doctype)
{
clear();
lexer.pushFile("stream",&s);
return runParse(doctype);
}
int grammarlex(void)
{
return parse->lex();
}
int grammarerror(const char *str)
{
return 0;
}
Datatype *parse_type(istream &s,string &name,Architecture *glb)
{
CParse parser(glb,1000);
if (!parser.parseStream(s,CParse::doc_parameter_declaration))
throw ParseError(parser.getError());
vector<TypeDeclarator *> *decls = parser.getResultDeclarations();
if ((decls == (vector<TypeDeclarator *> *)0)||(decls->size()==0))
throw ParseError("Did not parse a datatype");
if (decls->size() > 1)
throw ParseError("Parsed multiple declarations");
TypeDeclarator *decl = (*decls)[0];
if (!decl->isValid())
throw ParseError("Parsed type is invalid");
name = decl->getIdentifier();
return decl->buildType(glb);
}
void parse_protopieces(PrototypePieces &pieces,
istream &s,Architecture *glb)
{
CParse parser(glb,1000);
if (!parser.parseStream(s,CParse::doc_declaration))
throw ParseError(parser.getError());
vector<TypeDeclarator *> *decls = parser.getResultDeclarations();
if ((decls == (vector<TypeDeclarator *> *)0)||(decls->size()==0))
throw ParseError("Did not parse a datatype");
if (decls->size() > 1)
throw ParseError("Parsed multiple declarations");
TypeDeclarator *decl = (*decls)[0];
if (!decl->isValid())
throw ParseError("Parsed type is invalid");
if (!decl->getPrototype(pieces,glb))
throw ParseError("Did not parse a prototype");
}
void parse_C(Architecture *glb,istream &s)
{ // Load type data straight into datastructures
CParse parser(glb,1000);
if (!parser.parseStream(s,CParse::doc_declaration))
throw ParseError(parser.getError());
vector<TypeDeclarator *> *decls = parser.getResultDeclarations();
if ((decls == (vector<TypeDeclarator *> *)0)||(decls->size()==0))
throw ParseError("Did not parse a datatype");
if (decls->size() > 1)
throw ParseError("Parsed multiple declarations");
TypeDeclarator *decl = (*decls)[0];
if (!decl->isValid())
throw ParseError("Parsed type is invalid");
if (decl->hasProperty(CParse::f_extern)) {
PrototypePieces pieces;
if (!decl->getPrototype(pieces,glb))
throw ParseError("Did not parse prototype as expected");
glb->setPrototype(pieces);
}
else if (decl->hasProperty(CParse::f_typedef)) {
Datatype *ct = decl->buildType(glb);
if (decl->getIdentifier().size() == 0)
throw ParseError("Missing identifier for typedef");
if (ct->getMetatype() == TYPE_STRUCT) {
glb->types->setName(ct,decl->getIdentifier());
}
else {
glb->types->getTypedef(ct,decl->getIdentifier(),0,0);
}
}
else if (decl->getBaseType()->getMetatype()==TYPE_STRUCT) {
// We parsed a struct, treat as a typedef
}
else if (decl->getBaseType()->getMetatype()==TYPE_UNION) {
// We parsed a union, treat as a typedef
}
else if (decl->getBaseType()->isEnumType()) {
// We parsed an enum, treat as a typedef
}
else
throw LowlevelError("Not sure what to do with this type");
}
void parse_toseparator(istream &s,string &name)
{ // parse to next (C) separator
char tok;
name.erase();
s >> ws;
tok = s.peek();
while((isalnum(tok))||(tok=='_')) {
s >> tok;
name += tok;
tok = s.peek();
}
}
Address parse_varnode(istream &s,int4 &size,Address &pc,uintm &uq,const TypeFactory &typegrp)
{ // Scan for a specific varnode
char tok;
int4 discard;
Address loc(parse_machaddr(s,size,typegrp));
s >> ws >> tok;
if (tok != '(')
throw ParseError("Missing '('");
s >> ws;
tok = s.peek();
pc = Address(); // pc starts out as invalid
if (tok == 'i')
s >> tok;
else if (s.peek() != ':') {
s.unsetf(ios::dec | ios::hex | ios::oct); // Let user specify base
pc = parse_machaddr(s,discard,typegrp,true);
}
s >> ws;
if (s.peek() == ':') { // Scan uniq
s >> tok >> ws >> hex >> uq; // Assume uniq is in hex
}
else
uq = ~((uintm)0);
s >> ws >> tok;
if (tok != ')')
throw ParseError("Missing ')'");
return loc;
}
Address parse_op(istream &s,uintm &uq,const TypeFactory &typegrp)
{
int4 size;
char tok;
Address loc(parse_machaddr(s,size,typegrp,true));
s >> ws >> tok;
if (tok != ':')
throw ParseError("Missing ':'");
s >> ws >> hex >> uq; // Assume uniq is in hex
return loc;
}
Address parse_machaddr(istream &s,int4 &defaultsize,const TypeFactory &typegrp,bool ignorecolon)
{ // Read Address from ASCII stream
string token;
AddrSpace *b;
int4 size = -1;
int4 oversize;
char tok;
const AddrSpaceManager *manage = typegrp.getArch();
s >> ws;
tok = s.peek();
if (tok == '[') {
s >> tok;
parse_toseparator(s,token); // scan base address token
b = manage->getSpaceByName(token);
if (b == (AddrSpace *)0)
throw ParseError("Bad address base");
s >> ws >> tok;
if (tok != ',')
throw ParseError("Missing ',' in address");
parse_toseparator(s,token); // Get the offset portion of the address
s >> ws >> tok;
if (tok == ',') { // Optional size specifier
s.unsetf(ios::dec | ios::hex | ios::oct);
s >> size;
s >> ws >> tok;
}
if (tok != ']')
throw ParseError("Missing ']' in address");
}
else if (tok == '{') {
b = manage->getJoinSpace();
s >> tok;
s >> tok;
while(tok != '}') // Scan to the matching curly brace
token += tok;
}
else {
if (tok == '0') {
b = manage->getDefaultCodeSpace();
}
else {
b = manage->getSpaceByShortcut(tok);
s >> tok;
}
if (b==(AddrSpace *)0) {
s >> token;
string errmsg = "Bad address: ";
errmsg += tok;
errmsg += token;
throw ParseError(errmsg);
}
token.erase();
s >> ws;
tok = s.peek();
if (ignorecolon) {
while((isalnum(tok))||(tok=='_')||(tok=='+')) {
token += tok;
s >> tok;
tok = s.peek();
}
}
else {
while((isalnum(tok))||(tok=='_')||(tok=='+')||(tok==':')) {
token += tok;
s >> tok;
tok = s.peek();
}
}
}
Address res(b,0);
oversize = res.read(token); // Read the address of this particular type
// oversize is "standard size"
if (oversize == -1)
throw ParseError("Bad machine address");
defaultsize = (size==-1) ? oversize : size; // If not overriden use standard
return res;
}
} // End namespace ghidra
Reference in a new issue View git blame Copy permalink