/* 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 . */
/* 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. */
#line 52 "go-exp.y" /* yacc.c:339 */
#include "defs.h"
#include
#include "expression.h"
#include "value.h"
#include "parser-defs.h"
#include "language.h"
#include "c-lang.h"
#include "go-lang.h"
#include "bfd.h" /* Required by objfiles.h. */
#include "symfile.h" /* Required by objfiles.h. */
#include "objfiles.h" /* For have_full_symbols and have_partial_symbols */
#include "charset.h"
#include "block.h"
#define parse_type(ps) builtin_type (parse_gdbarch (ps))
/* Remap normal yacc parser interface names (yyparse, yylex, yyerror, etc),
as well as gratuitiously global symbol names, so we can have multiple
yacc generated parsers in gdb. Note that these are only the variables
produced by yacc. If other parser generators (bison, byacc, etc) produce
additional global names that conflict at link time, then those parser
generators need to be fixed instead of adding those names to this list. */
#define yymaxdepth go_maxdepth
#define yyparse go_parse_internal
#define yylex go_lex
#define yyerror go_error
#define yylval go_lval
#define yychar go_char
#define yydebug go_debug
#define yypact go_pact
#define yyr1 go_r1
#define yyr2 go_r2
#define yydef go_def
#define yychk go_chk
#define yypgo go_pgo
#define yyact go_act
#define yyexca go_exca
#define yyerrflag go_errflag
#define yynerrs go_nerrs
#define yyps go_ps
#define yypv go_pv
#define yys go_s
#define yy_yys go_yys
#define yystate go_state
#define yytmp go_tmp
#define yyv go_v
#define yy_yyv go_yyv
#define yyval go_val
#define yylloc go_lloc
#define yyreds go_reds /* With YYDEBUG defined */
#define yytoks go_toks /* With YYDEBUG defined */
#define yyname go_name /* With YYDEBUG defined */
#define yyrule go_rule /* With YYDEBUG defined */
#define yylhs go_yylhs
#define yylen go_yylen
#define yydefred go_yydefred
#define yydgoto go_yydgoto
#define yysindex go_yysindex
#define yyrindex go_yyrindex
#define yygindex go_yygindex
#define yytable go_yytable
#define yycheck go_yycheck
#ifndef YYDEBUG
#define YYDEBUG 1 /* Default to yydebug support */
#endif
#define YYFPRINTF parser_fprintf
/* The state of the parser, used internally when we are parsing the
expression. */
static struct parser_state *pstate = NULL;
int yyparse (void);
static int yylex (void);
void yyerror (char *);
#line 151 "go-exp.c" /* yacc.c:339 */
# 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
/* Debug traces. */
#ifndef YYDEBUG
# define YYDEBUG 0
#endif
#if YYDEBUG
extern int yydebug;
#endif
/* Token type. */
#ifndef YYTOKENTYPE
# define YYTOKENTYPE
enum yytokentype
{
INT = 258,
FLOAT = 259,
RAW_STRING = 260,
STRING = 261,
CHAR = 262,
NAME = 263,
TYPENAME = 264,
COMPLETE = 265,
NAME_OR_INT = 266,
TRUE_KEYWORD = 267,
FALSE_KEYWORD = 268,
STRUCT_KEYWORD = 269,
INTERFACE_KEYWORD = 270,
TYPE_KEYWORD = 271,
CHAN_KEYWORD = 272,
SIZEOF_KEYWORD = 273,
LEN_KEYWORD = 274,
CAP_KEYWORD = 275,
NEW_KEYWORD = 276,
IOTA_KEYWORD = 277,
NIL_KEYWORD = 278,
CONST_KEYWORD = 279,
DOTDOTDOT = 280,
ENTRY = 281,
ERROR = 282,
BYTE_KEYWORD = 283,
DOLLAR_VARIABLE = 284,
ASSIGN_MODIFY = 285,
ABOVE_COMMA = 286,
OROR = 287,
ANDAND = 288,
ANDNOT = 289,
EQUAL = 290,
NOTEQUAL = 291,
LEQ = 292,
GEQ = 293,
LSH = 294,
RSH = 295,
UNARY = 296,
INCREMENT = 297,
DECREMENT = 298,
LEFT_ARROW = 299
};
#endif
/* Tokens. */
#define INT 258
#define FLOAT 259
#define RAW_STRING 260
#define STRING 261
#define CHAR 262
#define NAME 263
#define TYPENAME 264
#define COMPLETE 265
#define NAME_OR_INT 266
#define TRUE_KEYWORD 267
#define FALSE_KEYWORD 268
#define STRUCT_KEYWORD 269
#define INTERFACE_KEYWORD 270
#define TYPE_KEYWORD 271
#define CHAN_KEYWORD 272
#define SIZEOF_KEYWORD 273
#define LEN_KEYWORD 274
#define CAP_KEYWORD 275
#define NEW_KEYWORD 276
#define IOTA_KEYWORD 277
#define NIL_KEYWORD 278
#define CONST_KEYWORD 279
#define DOTDOTDOT 280
#define ENTRY 281
#define ERROR 282
#define BYTE_KEYWORD 283
#define DOLLAR_VARIABLE 284
#define ASSIGN_MODIFY 285
#define ABOVE_COMMA 286
#define OROR 287
#define ANDAND 288
#define ANDNOT 289
#define EQUAL 290
#define NOTEQUAL 291
#define LEQ 292
#define GEQ 293
#define LSH 294
#define RSH 295
#define UNARY 296
#define INCREMENT 297
#define DECREMENT 298
#define LEFT_ARROW 299
/* Value type. */
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
typedef union YYSTYPE YYSTYPE;
union YYSTYPE
{
#line 142 "go-exp.y" /* yacc.c:355 */
LONGEST lval;
struct {
LONGEST val;
struct type *type;
} typed_val_int;
struct {
DOUBLEST dval;
struct type *type;
} typed_val_float;
struct stoken sval;
struct symtoken ssym;
struct type *tval;
struct typed_stoken tsval;
struct ttype tsym;
int voidval;
enum exp_opcode opcode;
struct internalvar *ivar;
struct stoken_vector svec;
#line 298 "go-exp.c" /* yacc.c:355 */
};
# define YYSTYPE_IS_TRIVIAL 1
# define YYSTYPE_IS_DECLARED 1
#endif
extern YYSTYPE yylval;
int yyparse (void);
/* Copy the second part of user declarations. */
#line 163 "go-exp.y" /* yacc.c:358 */
/* YYSTYPE gets defined by %union. */
static int parse_number (struct parser_state *,
const char *, int, int, YYSTYPE *);
static int parse_go_float (struct gdbarch *gdbarch, const char *p, int len,
DOUBLEST *d, struct type **t);
#line 320 "go-exp.c" /* yacc.c:358 */
#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 /* 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 /* 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 xmalloc; 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 /* INFRINGES ON USER NAME SPACE */
# elif defined _AIX
# define YYSTACK_ALLOC __alloca
# elif defined _MSC_VER
# define alloca _alloca
# else
# define YYSTACK_ALLOC alloca
# if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS
# include /* 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 xmalloc) \
&& (defined YYFREE || defined xfree)))
# include /* INFRINGES ON USER NAME SPACE */
# ifndef EXIT_SUCCESS
# define EXIT_SUCCESS 0
# endif
# endif
# ifndef YYMALLOC
# define YYMALLOC xmalloc
# if ! defined xmalloc && ! defined EXIT_SUCCESS
void *xmalloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# ifndef YYFREE
# define YYFREE xfree
# if ! defined xfree && ! defined EXIT_SUCCESS
void xfree (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 40
/* YYLAST -- Last index in YYTABLE. */
#define YYLAST 451
/* YYNTOKENS -- Number of terminals. */
#define YYNTOKENS 68
/* YYNNTS -- Number of nonterminals. */
#define YYNNTS 13
/* YYNRULES -- Number of rules. */
#define YYNRULES 69
/* YYNSTATES -- Number of states. */
#define YYNSTATES 122
/* YYTRANSLATE[YYX] -- Symbol number corresponding to YYX as returned
by yylex, with out-of-bounds checking. */
#define YYUNDEFTOK 2
#define YYMAXUTOK 299
#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, 62, 2, 2, 2, 54, 39, 2,
61, 64, 52, 50, 31, 51, 59, 53, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 67, 2,
43, 33, 44, 34, 49, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 60, 2, 63, 38, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 65, 37, 66, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 1, 2, 3, 4,
5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
15, 16, 17, 18, 19, 20, 21, 22, 23, 24,
25, 26, 27, 28, 29, 30, 32, 35, 36, 40,
41, 42, 45, 46, 47, 48, 55, 56, 57, 58
};
#if YYDEBUG
/* YYRLINE[YYN] -- Source line where rule number YYN was defined. */
static const yytype_uint16 yyrline[] =
{
0, 242, 242, 243, 246, 253, 254, 259, 263, 267,
271, 275, 279, 283, 287, 293, 299, 306, 316, 323,
320, 331, 335, 338, 342, 346, 350, 356, 362, 368,
372, 376, 380, 384, 388, 392, 396, 400, 404, 408,
412, 416, 420, 424, 428, 432, 436, 440, 444, 448,
452, 458, 465, 474, 487, 494, 497, 503, 518, 525,
542, 560, 572, 578, 584, 600, 655, 657, 664, 677
};
#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", "INT", "FLOAT", "RAW_STRING", "STRING",
"CHAR", "NAME", "TYPENAME", "COMPLETE", "NAME_OR_INT", "TRUE_KEYWORD",
"FALSE_KEYWORD", "STRUCT_KEYWORD", "INTERFACE_KEYWORD", "TYPE_KEYWORD",
"CHAN_KEYWORD", "SIZEOF_KEYWORD", "LEN_KEYWORD", "CAP_KEYWORD",
"NEW_KEYWORD", "IOTA_KEYWORD", "NIL_KEYWORD", "CONST_KEYWORD",
"DOTDOTDOT", "ENTRY", "ERROR", "BYTE_KEYWORD", "DOLLAR_VARIABLE",
"ASSIGN_MODIFY", "','", "ABOVE_COMMA", "'='", "'?'", "OROR", "ANDAND",
"'|'", "'^'", "'&'", "ANDNOT", "EQUAL", "NOTEQUAL", "'<'", "'>'", "LEQ",
"GEQ", "LSH", "RSH", "'@'", "'+'", "'-'", "'*'", "'/'", "'%'", "UNARY",
"INCREMENT", "DECREMENT", "LEFT_ARROW", "'.'", "'['", "'('", "'!'",
"']'", "')'", "'{'", "'}'", "':'", "$accept", "start", "type_exp",
"exp1", "exp", "$@1", "lcurly", "arglist", "rcurly", "string_exp",
"variable", "type", "name_not_typename", 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, 264,
265, 266, 267, 268, 269, 270, 271, 272, 273, 274,
275, 276, 277, 278, 279, 280, 281, 282, 283, 284,
285, 44, 286, 61, 63, 287, 288, 124, 94, 38,
289, 290, 291, 60, 62, 292, 293, 294, 295, 64,
43, 45, 42, 47, 37, 296, 297, 298, 299, 46,
91, 40, 33, 93, 41, 123, 125, 58
};
# endif
#define YYPACT_NINF -42
#define yypact_value_is_default(Yystate) \
(!!((Yystate) == (-42)))
#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_int16 yypact[] =
{
49, -42, -42, -42, -42, -42, -42, -42, -42, -42,
-38, -42, -42, 49, 49, 49, 49, 49, 49, 49,
-42, 27, -42, 34, 187, 45, 16, -42, 11, 53,
49, -35, 11, -35, -35, -35, -35, 11, 38, -35,
-42, 49, 49, 49, 49, 49, 49, 49, 49, 49,
49, 49, 49, 49, 49, 49, 49, 49, 49, 49,
49, 49, 49, 49, -42, -42, -3, 49, -42, 45,
9, 74, 49, -42, 123, 10, -42, 187, 187, 187,
88, 241, 266, 290, 313, 334, 353, 353, 368, 368,
368, 368, -41, -41, 380, 390, 390, -35, -35, -35,
-42, 72, 33, 49, -42, -42, 49, -42, 155, -42,
-42, 49, -42, -42, 187, 39, -35, -42, 215, 49,
-42, 187
};
/* 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[] =
{
0, 51, 54, 59, 52, 69, 67, 53, 62, 63,
0, 68, 56, 0, 0, 0, 0, 0, 0, 0,
21, 0, 3, 2, 5, 0, 61, 55, 4, 65,
0, 12, 0, 8, 10, 9, 7, 66, 0, 11,
1, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 13, 14, 0, 0, 19, 0,
0, 0, 0, 64, 0, 0, 28, 6, 50, 49,
0, 47, 46, 45, 44, 43, 37, 38, 41, 42,
39, 40, 35, 36, 29, 33, 34, 30, 31, 32,
17, 15, 0, 22, 66, 25, 0, 60, 0, 58,
57, 0, 16, 18, 23, 0, 26, 27, 48, 0,
20, 24
};
/* YYPGOTO[NTERM-NUM]. */
static const yytype_int8 yypgoto[] =
{
-42, -42, -42, -4, -13, -42, -42, -42, -42, -42,
-42, 51, 17
};
/* YYDEFGOTO[NTERM-NUM]. */
static const yytype_int8 yydefgoto[] =
{
-1, 21, 22, 23, 24, 103, 25, 115, 106, 26,
27, 32, 29
};
/* 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[] =
{
31, 33, 34, 35, 36, 5, 39, 100, 58, 59,
60, 61, 62, 63, 38, 64, 65, 74, 66, 67,
68, 64, 65, 30, 66, 67, 68, 40, 77, 78,
79, 80, 81, 82, 83, 84, 85, 86, 87, 88,
89, 90, 91, 92, 93, 94, 95, 96, 97, 98,
99, 28, 1, 2, 6, 3, 4, 5, 6, 108,
7, 8, 9, 102, 41, 41, 71, 10, 37, 41,
119, 72, 72, 11, 110, 105, 70, 11, 12, 73,
107, 75, 112, 101, 0, 0, 0, 13, 14, 0,
114, 0, 0, 116, 0, 0, 113, 69, 118, 15,
16, 17, 76, 120, 0, 0, 121, 0, 0, 0,
18, 19, 0, 0, 20, 0, 0, 0, 42, 0,
104, 43, 44, 45, 46, 47, 48, 49, 0, 50,
51, 52, 53, 54, 55, 56, 57, 58, 59, 60,
61, 62, 63, 0, 64, 65, 0, 66, 67, 68,
0, 0, 0, 42, 0, 111, 43, 44, 45, 46,
47, 48, 49, 0, 50, 51, 52, 53, 54, 55,
56, 57, 58, 59, 60, 61, 62, 63, 0, 64,
65, 0, 66, 67, 68, 42, 0, 109, 43, 44,
45, 46, 47, 48, 49, 0, 50, 51, 52, 53,
54, 55, 56, 57, 58, 59, 60, 61, 62, 63,
0, 64, 65, 0, 66, 67, 68, 42, 0, 117,
43, 44, 45, 46, 47, 48, 49, 0, 50, 51,
52, 53, 54, 55, 56, 57, 58, 59, 60, 61,
62, 63, 0, 64, 65, 0, 66, 67, 68, 44,
45, 46, 47, 48, 49, 0, 50, 51, 52, 53,
54, 55, 56, 57, 58, 59, 60, 61, 62, 63,
0, 64, 65, 0, 66, 67, 68, 46, 47, 48,
49, 0, 50, 51, 52, 53, 54, 55, 56, 57,
58, 59, 60, 61, 62, 63, 0, 64, 65, 0,
66, 67, 68, 47, 48, 49, 0, 50, 51, 52,
53, 54, 55, 56, 57, 58, 59, 60, 61, 62,
63, 0, 64, 65, 0, 66, 67, 68, 48, 49,
0, 50, 51, 52, 53, 54, 55, 56, 57, 58,
59, 60, 61, 62, 63, 0, 64, 65, 0, 66,
67, 68, 49, 0, 50, 51, 52, 53, 54, 55,
56, 57, 58, 59, 60, 61, 62, 63, 0, 64,
65, 0, 66, 67, 68, 50, 51, 52, 53, 54,
55, 56, 57, 58, 59, 60, 61, 62, 63, 0,
64, 65, 0, 66, 67, 68, 52, 53, 54, 55,
56, 57, 58, 59, 60, 61, 62, 63, 0, 64,
65, 0, 66, 67, 68, 56, 57, 58, 59, 60,
61, 62, 63, 0, 64, 65, 0, 66, 67, 68,
59, 60, 61, 62, 63, 0, 64, 65, 0, 66,
67, 68, 61, 62, 63, 0, 64, 65, 0, 66,
67, 68
};
static const yytype_int8 yycheck[] =
{
13, 14, 15, 16, 17, 8, 19, 10, 49, 50,
51, 52, 53, 54, 18, 56, 57, 30, 59, 60,
61, 56, 57, 61, 59, 60, 61, 0, 41, 42,
43, 44, 45, 46, 47, 48, 49, 50, 51, 52,
53, 54, 55, 56, 57, 58, 59, 60, 61, 62,
63, 0, 3, 4, 9, 6, 7, 8, 9, 72,
11, 12, 13, 67, 31, 31, 50, 18, 17, 31,
31, 61, 61, 28, 64, 66, 25, 28, 29, 26,
6, 30, 10, 66, -1, -1, -1, 38, 39, -1,
103, -1, -1, 106, -1, -1, 63, 52, 111, 50,
51, 52, 64, 64, -1, -1, 119, -1, -1, -1,
61, 62, -1, -1, 65, -1, -1, -1, 30, -1,
69, 33, 34, 35, 36, 37, 38, 39, -1, 41,
42, 43, 44, 45, 46, 47, 48, 49, 50, 51,
52, 53, 54, -1, 56, 57, -1, 59, 60, 61,
-1, -1, -1, 30, -1, 67, 33, 34, 35, 36,
37, 38, 39, -1, 41, 42, 43, 44, 45, 46,
47, 48, 49, 50, 51, 52, 53, 54, -1, 56,
57, -1, 59, 60, 61, 30, -1, 64, 33, 34,
35, 36, 37, 38, 39, -1, 41, 42, 43, 44,
45, 46, 47, 48, 49, 50, 51, 52, 53, 54,
-1, 56, 57, -1, 59, 60, 61, 30, -1, 64,
33, 34, 35, 36, 37, 38, 39, -1, 41, 42,
43, 44, 45, 46, 47, 48, 49, 50, 51, 52,
53, 54, -1, 56, 57, -1, 59, 60, 61, 34,
35, 36, 37, 38, 39, -1, 41, 42, 43, 44,
45, 46, 47, 48, 49, 50, 51, 52, 53, 54,
-1, 56, 57, -1, 59, 60, 61, 36, 37, 38,
39, -1, 41, 42, 43, 44, 45, 46, 47, 48,
49, 50, 51, 52, 53, 54, -1, 56, 57, -1,
59, 60, 61, 37, 38, 39, -1, 41, 42, 43,
44, 45, 46, 47, 48, 49, 50, 51, 52, 53,
54, -1, 56, 57, -1, 59, 60, 61, 38, 39,
-1, 41, 42, 43, 44, 45, 46, 47, 48, 49,
50, 51, 52, 53, 54, -1, 56, 57, -1, 59,
60, 61, 39, -1, 41, 42, 43, 44, 45, 46,
47, 48, 49, 50, 51, 52, 53, 54, -1, 56,
57, -1, 59, 60, 61, 41, 42, 43, 44, 45,
46, 47, 48, 49, 50, 51, 52, 53, 54, -1,
56, 57, -1, 59, 60, 61, 43, 44, 45, 46,
47, 48, 49, 50, 51, 52, 53, 54, -1, 56,
57, -1, 59, 60, 61, 47, 48, 49, 50, 51,
52, 53, 54, -1, 56, 57, -1, 59, 60, 61,
50, 51, 52, 53, 54, -1, 56, 57, -1, 59,
60, 61, 52, 53, 54, -1, 56, 57, -1, 59,
60, 61
};
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
symbol of state STATE-NUM. */
static const yytype_uint8 yystos[] =
{
0, 3, 4, 6, 7, 8, 9, 11, 12, 13,
18, 28, 29, 38, 39, 50, 51, 52, 61, 62,
65, 69, 70, 71, 72, 74, 77, 78, 79, 80,
61, 72, 79, 72, 72, 72, 72, 79, 71, 72,
0, 31, 30, 33, 34, 35, 36, 37, 38, 39,
41, 42, 43, 44, 45, 46, 47, 48, 49, 50,
51, 52, 53, 54, 56, 57, 59, 60, 61, 52,
79, 50, 61, 26, 72, 79, 64, 72, 72, 72,
72, 72, 72, 72, 72, 72, 72, 72, 72, 72,
72, 72, 72, 72, 72, 72, 72, 72, 72, 72,
10, 80, 71, 73, 79, 66, 76, 6, 72, 64,
64, 67, 10, 63, 72, 75, 72, 64, 72, 31,
64, 72
};
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
static const yytype_uint8 yyr1[] =
{
0, 68, 69, 69, 70, 71, 71, 72, 72, 72,
72, 72, 72, 72, 72, 72, 72, 72, 72, 73,
72, 74, 75, 75, 75, 76, 72, 72, 72, 72,
72, 72, 72, 72, 72, 72, 72, 72, 72, 72,
72, 72, 72, 72, 72, 72, 72, 72, 72, 72,
72, 72, 72, 72, 72, 72, 72, 72, 72, 77,
77, 72, 72, 72, 78, 78, 79, 79, 79, 80
};
/* YYR2[YYN] -- Number of symbols on the right hand side of rule YYN. */
static const yytype_uint8 yyr2[] =
{
0, 2, 1, 1, 1, 1, 3, 2, 2, 2,
2, 2, 2, 2, 2, 3, 4, 3, 4, 0,
5, 1, 0, 1, 3, 1, 4, 4, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 5, 3,
3, 1, 1, 1, 1, 1, 1, 4, 4, 1,
3, 1, 1, 1, 2, 1, 2, 1, 1, 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 YYDEBUG
# ifndef YYFPRINTF
# include /* 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 xreallocate 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 xreallocate 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 4:
#line 247 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, OP_TYPE);
write_exp_elt_type (pstate, (yyvsp[0].tval));
write_exp_elt_opcode (pstate, OP_TYPE); }
#line 1554 "go-exp.c" /* yacc.c:1646 */
break;
case 6:
#line 255 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, BINOP_COMMA); }
#line 1560 "go-exp.c" /* yacc.c:1646 */
break;
case 7:
#line 260 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, UNOP_IND); }
#line 1566 "go-exp.c" /* yacc.c:1646 */
break;
case 8:
#line 264 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, UNOP_ADDR); }
#line 1572 "go-exp.c" /* yacc.c:1646 */
break;
case 9:
#line 268 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, UNOP_NEG); }
#line 1578 "go-exp.c" /* yacc.c:1646 */
break;
case 10:
#line 272 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, UNOP_PLUS); }
#line 1584 "go-exp.c" /* yacc.c:1646 */
break;
case 11:
#line 276 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, UNOP_LOGICAL_NOT); }
#line 1590 "go-exp.c" /* yacc.c:1646 */
break;
case 12:
#line 280 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, UNOP_COMPLEMENT); }
#line 1596 "go-exp.c" /* yacc.c:1646 */
break;
case 13:
#line 284 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, UNOP_POSTINCREMENT); }
#line 1602 "go-exp.c" /* yacc.c:1646 */
break;
case 14:
#line 288 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, UNOP_POSTDECREMENT); }
#line 1608 "go-exp.c" /* yacc.c:1646 */
break;
case 15:
#line 294 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
write_exp_string (pstate, (yyvsp[0].ssym).stoken);
write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
#line 1616 "go-exp.c" /* yacc.c:1646 */
break;
case 16:
#line 300 "go-exp.y" /* yacc.c:1646 */
{ mark_struct_expression (pstate);
write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
write_exp_string (pstate, (yyvsp[-1].ssym).stoken);
write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
#line 1625 "go-exp.c" /* yacc.c:1646 */
break;
case 17:
#line 307 "go-exp.y" /* yacc.c:1646 */
{ struct stoken s;
mark_struct_expression (pstate);
write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
s.ptr = "";
s.length = 0;
write_exp_string (pstate, s);
write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
#line 1637 "go-exp.c" /* yacc.c:1646 */
break;
case 18:
#line 317 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, BINOP_SUBSCRIPT); }
#line 1643 "go-exp.c" /* yacc.c:1646 */
break;
case 19:
#line 323 "go-exp.y" /* yacc.c:1646 */
{ start_arglist (); }
#line 1649 "go-exp.c" /* yacc.c:1646 */
break;
case 20:
#line 325 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, OP_FUNCALL);
write_exp_elt_longcst (pstate,
(LONGEST) end_arglist ());
write_exp_elt_opcode (pstate, OP_FUNCALL); }
#line 1658 "go-exp.c" /* yacc.c:1646 */
break;
case 21:
#line 332 "go-exp.y" /* yacc.c:1646 */
{ start_arglist (); }
#line 1664 "go-exp.c" /* yacc.c:1646 */
break;
case 23:
#line 339 "go-exp.y" /* yacc.c:1646 */
{ arglist_len = 1; }
#line 1670 "go-exp.c" /* yacc.c:1646 */
break;
case 24:
#line 343 "go-exp.y" /* yacc.c:1646 */
{ arglist_len++; }
#line 1676 "go-exp.c" /* yacc.c:1646 */
break;
case 25:
#line 347 "go-exp.y" /* yacc.c:1646 */
{ (yyval.lval) = end_arglist () - 1; }
#line 1682 "go-exp.c" /* yacc.c:1646 */
break;
case 26:
#line 351 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, UNOP_MEMVAL);
write_exp_elt_type (pstate, (yyvsp[-2].tval));
write_exp_elt_opcode (pstate, UNOP_MEMVAL); }
#line 1690 "go-exp.c" /* yacc.c:1646 */
break;
case 27:
#line 357 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, UNOP_CAST);
write_exp_elt_type (pstate, (yyvsp[-3].tval));
write_exp_elt_opcode (pstate, UNOP_CAST); }
#line 1698 "go-exp.c" /* yacc.c:1646 */
break;
case 28:
#line 363 "go-exp.y" /* yacc.c:1646 */
{ }
#line 1704 "go-exp.c" /* yacc.c:1646 */
break;
case 29:
#line 369 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, BINOP_REPEAT); }
#line 1710 "go-exp.c" /* yacc.c:1646 */
break;
case 30:
#line 373 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, BINOP_MUL); }
#line 1716 "go-exp.c" /* yacc.c:1646 */
break;
case 31:
#line 377 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, BINOP_DIV); }
#line 1722 "go-exp.c" /* yacc.c:1646 */
break;
case 32:
#line 381 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, BINOP_REM); }
#line 1728 "go-exp.c" /* yacc.c:1646 */
break;
case 33:
#line 385 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, BINOP_ADD); }
#line 1734 "go-exp.c" /* yacc.c:1646 */
break;
case 34:
#line 389 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, BINOP_SUB); }
#line 1740 "go-exp.c" /* yacc.c:1646 */
break;
case 35:
#line 393 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, BINOP_LSH); }
#line 1746 "go-exp.c" /* yacc.c:1646 */
break;
case 36:
#line 397 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, BINOP_RSH); }
#line 1752 "go-exp.c" /* yacc.c:1646 */
break;
case 37:
#line 401 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, BINOP_EQUAL); }
#line 1758 "go-exp.c" /* yacc.c:1646 */
break;
case 38:
#line 405 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, BINOP_NOTEQUAL); }
#line 1764 "go-exp.c" /* yacc.c:1646 */
break;
case 39:
#line 409 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, BINOP_LEQ); }
#line 1770 "go-exp.c" /* yacc.c:1646 */
break;
case 40:
#line 413 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, BINOP_GEQ); }
#line 1776 "go-exp.c" /* yacc.c:1646 */
break;
case 41:
#line 417 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, BINOP_LESS); }
#line 1782 "go-exp.c" /* yacc.c:1646 */
break;
case 42:
#line 421 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, BINOP_GTR); }
#line 1788 "go-exp.c" /* yacc.c:1646 */
break;
case 43:
#line 425 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, BINOP_BITWISE_AND); }
#line 1794 "go-exp.c" /* yacc.c:1646 */
break;
case 44:
#line 429 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, BINOP_BITWISE_XOR); }
#line 1800 "go-exp.c" /* yacc.c:1646 */
break;
case 45:
#line 433 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, BINOP_BITWISE_IOR); }
#line 1806 "go-exp.c" /* yacc.c:1646 */
break;
case 46:
#line 437 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, BINOP_LOGICAL_AND); }
#line 1812 "go-exp.c" /* yacc.c:1646 */
break;
case 47:
#line 441 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, BINOP_LOGICAL_OR); }
#line 1818 "go-exp.c" /* yacc.c:1646 */
break;
case 48:
#line 445 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, TERNOP_COND); }
#line 1824 "go-exp.c" /* yacc.c:1646 */
break;
case 49:
#line 449 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, BINOP_ASSIGN); }
#line 1830 "go-exp.c" /* yacc.c:1646 */
break;
case 50:
#line 453 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, BINOP_ASSIGN_MODIFY);
write_exp_elt_opcode (pstate, (yyvsp[-1].opcode));
write_exp_elt_opcode (pstate, BINOP_ASSIGN_MODIFY); }
#line 1838 "go-exp.c" /* yacc.c:1646 */
break;
case 51:
#line 459 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, OP_LONG);
write_exp_elt_type (pstate, (yyvsp[0].typed_val_int).type);
write_exp_elt_longcst (pstate, (LONGEST)((yyvsp[0].typed_val_int).val));
write_exp_elt_opcode (pstate, OP_LONG); }
#line 1847 "go-exp.c" /* yacc.c:1646 */
break;
case 52:
#line 466 "go-exp.y" /* yacc.c:1646 */
{
struct stoken_vector vec;
vec.len = 1;
vec.tokens = &(yyvsp[0].tsval);
write_exp_string_vector (pstate, (yyvsp[0].tsval).type, &vec);
}
#line 1858 "go-exp.c" /* yacc.c:1646 */
break;
case 53:
#line 475 "go-exp.y" /* yacc.c:1646 */
{ YYSTYPE val;
parse_number (pstate, (yyvsp[0].ssym).stoken.ptr,
(yyvsp[0].ssym).stoken.length, 0, &val);
write_exp_elt_opcode (pstate, OP_LONG);
write_exp_elt_type (pstate, val.typed_val_int.type);
write_exp_elt_longcst (pstate, (LONGEST)
val.typed_val_int.val);
write_exp_elt_opcode (pstate, OP_LONG);
}
#line 1872 "go-exp.c" /* yacc.c:1646 */
break;
case 54:
#line 488 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, OP_DOUBLE);
write_exp_elt_type (pstate, (yyvsp[0].typed_val_float).type);
write_exp_elt_dblcst (pstate, (yyvsp[0].typed_val_float).dval);
write_exp_elt_opcode (pstate, OP_DOUBLE); }
#line 1881 "go-exp.c" /* yacc.c:1646 */
break;
case 56:
#line 498 "go-exp.y" /* yacc.c:1646 */
{
write_dollar_variable (pstate, (yyvsp[0].sval));
}
#line 1889 "go-exp.c" /* yacc.c:1646 */
break;
case 57:
#line 504 "go-exp.y" /* yacc.c:1646 */
{
/* TODO(dje): Go objects in structs. */
write_exp_elt_opcode (pstate, OP_LONG);
/* TODO(dje): What's the right type here? */
write_exp_elt_type
(pstate,
parse_type (pstate)->builtin_unsigned_int);
CHECK_TYPEDEF ((yyvsp[-1].tval));
write_exp_elt_longcst (pstate,
(LONGEST) TYPE_LENGTH ((yyvsp[-1].tval)));
write_exp_elt_opcode (pstate, OP_LONG);
}
#line 1906 "go-exp.c" /* yacc.c:1646 */
break;
case 58:
#line 519 "go-exp.y" /* yacc.c:1646 */
{
/* TODO(dje): Go objects in structs. */
write_exp_elt_opcode (pstate, UNOP_SIZEOF);
}
#line 1915 "go-exp.c" /* yacc.c:1646 */
break;
case 59:
#line 526 "go-exp.y" /* yacc.c:1646 */
{
/* We copy the string here, and not in the
lexer, to guarantee that we do not leak a
string. */
/* Note that we NUL-terminate here, but just
for convenience. */
struct typed_stoken *vec = XNEW (struct typed_stoken);
(yyval.svec).len = 1;
(yyval.svec).tokens = vec;
vec->type = (yyvsp[0].tsval).type;
vec->length = (yyvsp[0].tsval).length;
vec->ptr = xmalloc ((yyvsp[0].tsval).length + 1);
memcpy (vec->ptr, (yyvsp[0].tsval).ptr, (yyvsp[0].tsval).length + 1);
}
#line 1935 "go-exp.c" /* yacc.c:1646 */
break;
case 60:
#line 543 "go-exp.y" /* yacc.c:1646 */
{
/* Note that we NUL-terminate here, but just
for convenience. */
char *p;
++(yyval.svec).len;
(yyval.svec).tokens = xrealloc ((yyval.svec).tokens,
(yyval.svec).len * sizeof (struct typed_stoken));
p = xmalloc ((yyvsp[0].tsval).length + 1);
memcpy (p, (yyvsp[0].tsval).ptr, (yyvsp[0].tsval).length + 1);
(yyval.svec).tokens[(yyval.svec).len - 1].type = (yyvsp[0].tsval).type;
(yyval.svec).tokens[(yyval.svec).len - 1].length = (yyvsp[0].tsval).length;
(yyval.svec).tokens[(yyval.svec).len - 1].ptr = p;
}
#line 1955 "go-exp.c" /* yacc.c:1646 */
break;
case 61:
#line 561 "go-exp.y" /* yacc.c:1646 */
{
int i;
write_exp_string_vector (pstate, 0 /*always utf8*/,
&(yyvsp[0].svec));
for (i = 0; i < (yyvsp[0].svec).len; ++i)
xfree ((yyvsp[0].svec).tokens[i].ptr);
xfree ((yyvsp[0].svec).tokens);
}
#line 1969 "go-exp.c" /* yacc.c:1646 */
break;
case 62:
#line 573 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, OP_BOOL);
write_exp_elt_longcst (pstate, (LONGEST) (yyvsp[0].lval));
write_exp_elt_opcode (pstate, OP_BOOL); }
#line 1977 "go-exp.c" /* yacc.c:1646 */
break;
case 63:
#line 579 "go-exp.y" /* yacc.c:1646 */
{ write_exp_elt_opcode (pstate, OP_BOOL);
write_exp_elt_longcst (pstate, (LONGEST) (yyvsp[0].lval));
write_exp_elt_opcode (pstate, OP_BOOL); }
#line 1985 "go-exp.c" /* yacc.c:1646 */
break;
case 64:
#line 585 "go-exp.y" /* yacc.c:1646 */
{ struct symbol *sym = (yyvsp[-1].ssym).sym;
if (sym == NULL
|| !SYMBOL_IS_ARGUMENT (sym)
|| !symbol_read_needs_frame (sym))
error (_("@entry can be used only for function "
"parameters, not for \"%s\""),
copy_name ((yyvsp[-1].ssym).stoken));
write_exp_elt_opcode (pstate, OP_VAR_ENTRY_VALUE);
write_exp_elt_sym (pstate, sym);
write_exp_elt_opcode (pstate, OP_VAR_ENTRY_VALUE);
}
#line 2003 "go-exp.c" /* yacc.c:1646 */
break;
case 65:
#line 601 "go-exp.y" /* yacc.c:1646 */
{ struct symbol *sym = (yyvsp[0].ssym).sym;
if (sym)
{
if (symbol_read_needs_frame (sym))
{
if (innermost_block == 0
|| contained_in (block_found,
innermost_block))
innermost_block = block_found;
}
write_exp_elt_opcode (pstate, OP_VAR_VALUE);
/* We want to use the selected frame, not
another more inner frame which happens to
be in the same block. */
write_exp_elt_block (pstate, NULL);
write_exp_elt_sym (pstate, sym);
write_exp_elt_opcode (pstate, OP_VAR_VALUE);
}
else if ((yyvsp[0].ssym).is_a_field_of_this)
{
/* TODO(dje): Can we get here?
E.g., via a mix of c++ and go? */
gdb_assert_not_reached ("go with `this' field");
}
else
{
struct bound_minimal_symbol msymbol;
char *arg = copy_name ((yyvsp[0].ssym).stoken);
msymbol =
lookup_bound_minimal_symbol (arg);
if (msymbol.minsym != NULL)
write_exp_msymbol (pstate, msymbol);
else if (!have_full_symbols ()
&& !have_partial_symbols ())
error (_("No symbol table is loaded. "
"Use the \"file\" command."));
else
error (_("No symbol \"%s\" in current context."),
copy_name ((yyvsp[0].ssym).stoken));
}
}
#line 2052 "go-exp.c" /* yacc.c:1646 */
break;
case 66:
#line 656 "go-exp.y" /* yacc.c:1646 */
{ (yyval.tval) = lookup_pointer_type ((yyvsp[0].tval)); }
#line 2058 "go-exp.c" /* yacc.c:1646 */
break;
case 67:
#line 658 "go-exp.y" /* yacc.c:1646 */
{ (yyval.tval) = (yyvsp[0].tsym).type; }
#line 2064 "go-exp.c" /* yacc.c:1646 */
break;
case 68:
#line 665 "go-exp.y" /* yacc.c:1646 */
{ (yyval.tval) = builtin_go_type (parse_gdbarch (pstate))
->builtin_uint8; }
#line 2071 "go-exp.c" /* yacc.c:1646 */
break;
#line 2075 "go-exp.c" /* yacc.c:1646 */
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;
}
#line 687 "go-exp.y" /* yacc.c:1906 */
/* Wrapper on parse_c_float to get the type right for Go. */
static int
parse_go_float (struct gdbarch *gdbarch, const char *p, int len,
DOUBLEST *d, struct type **t)
{
int result = parse_c_float (gdbarch, p, len, d, t);
const struct builtin_type *builtin_types = builtin_type (gdbarch);
const struct builtin_go_type *builtin_go_types = builtin_go_type (gdbarch);
if (*t == builtin_types->builtin_float)
*t = builtin_go_types->builtin_float32;
else if (*t == builtin_types->builtin_double)
*t = builtin_go_types->builtin_float64;
return result;
}
/* Take care of parsing a number (anything that starts with a digit).
Set yylval and return the token type; update lexptr.
LEN is the number of characters in it. */
/* FIXME: Needs some error checking for the float case. */
/* FIXME(dje): IWBN to use c-exp.y's parse_number if we could.
That will require moving the guts into a function that we both call
as our YYSTYPE is different than c-exp.y's */
static int
parse_number (struct parser_state *par_state,
const char *p, int len, int parsed_float, YYSTYPE *putithere)
{
/* FIXME: Shouldn't these be unsigned? We don't deal with negative values
here, and we do kind of silly things like cast to unsigned. */
LONGEST n = 0;
LONGEST prevn = 0;
ULONGEST un;
int i = 0;
int c;
int base = input_radix;
int unsigned_p = 0;
/* Number of "L" suffixes encountered. */
int long_p = 0;
/* We have found a "L" or "U" suffix. */
int found_suffix = 0;
ULONGEST high_bit;
struct type *signed_type;
struct type *unsigned_type;
if (parsed_float)
{
if (! parse_go_float (parse_gdbarch (par_state), p, len,
&putithere->typed_val_float.dval,
&putithere->typed_val_float.type))
return ERROR;
return FLOAT;
}
/* Handle base-switching prefixes 0x, 0t, 0d, 0. */
if (p[0] == '0')
switch (p[1])
{
case 'x':
case 'X':
if (len >= 3)
{
p += 2;
base = 16;
len -= 2;
}
break;
case 'b':
case 'B':
if (len >= 3)
{
p += 2;
base = 2;
len -= 2;
}
break;
case 't':
case 'T':
case 'd':
case 'D':
if (len >= 3)
{
p += 2;
base = 10;
len -= 2;
}
break;
default:
base = 8;
break;
}
while (len-- > 0)
{
c = *p++;
if (c >= 'A' && c <= 'Z')
c += 'a' - 'A';
if (c != 'l' && c != 'u')
n *= base;
if (c >= '0' && c <= '9')
{
if (found_suffix)
return ERROR;
n += i = c - '0';
}
else
{
if (base > 10 && c >= 'a' && c <= 'f')
{
if (found_suffix)
return ERROR;
n += i = c - 'a' + 10;
}
else if (c == 'l')
{
++long_p;
found_suffix = 1;
}
else if (c == 'u')
{
unsigned_p = 1;
found_suffix = 1;
}
else
return ERROR; /* Char not a digit */
}
if (i >= base)
return ERROR; /* Invalid digit in this base. */
/* Portably test for overflow (only works for nonzero values, so make
a second check for zero). FIXME: Can't we just make n and prevn
unsigned and avoid this? */
if (c != 'l' && c != 'u' && (prevn >= n) && n != 0)
unsigned_p = 1; /* Try something unsigned. */
/* Portably test for unsigned overflow.
FIXME: This check is wrong; for example it doesn't find overflow
on 0x123456789 when LONGEST is 32 bits. */
if (c != 'l' && c != 'u' && n != 0)
{
if ((unsigned_p && (ULONGEST) prevn >= (ULONGEST) n))
error (_("Numeric constant too large."));
}
prevn = n;
}
/* An integer constant is an int, a long, or a long long. An L
suffix forces it to be long; an LL suffix forces it to be long
long. If not forced to a larger size, it gets the first type of
the above that it fits in. To figure out whether it fits, we
shift it right and see whether anything remains. Note that we
can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one
operation, because many compilers will warn about such a shift
(which always produces a zero result). Sometimes gdbarch_int_bit
or gdbarch_long_bit will be that big, sometimes not. To deal with
the case where it is we just always shift the value more than
once, with fewer bits each time. */
un = (ULONGEST)n >> 2;
if (long_p == 0
&& (un >> (gdbarch_int_bit (parse_gdbarch (par_state)) - 2)) == 0)
{
high_bit
= ((ULONGEST)1) << (gdbarch_int_bit (parse_gdbarch (par_state)) - 1);
/* A large decimal (not hex or octal) constant (between INT_MAX
and UINT_MAX) is a long or unsigned long, according to ANSI,
never an unsigned int, but this code treats it as unsigned
int. This probably should be fixed. GCC gives a warning on
such constants. */
unsigned_type = parse_type (par_state)->builtin_unsigned_int;
signed_type = parse_type (par_state)->builtin_int;
}
else if (long_p <= 1
&& (un >> (gdbarch_long_bit (parse_gdbarch (par_state)) - 2)) == 0)
{
high_bit
= ((ULONGEST)1) << (gdbarch_long_bit (parse_gdbarch (par_state)) - 1);
unsigned_type = parse_type (par_state)->builtin_unsigned_long;
signed_type = parse_type (par_state)->builtin_long;
}
else
{
int shift;
if (sizeof (ULONGEST) * HOST_CHAR_BIT
< gdbarch_long_long_bit (parse_gdbarch (par_state)))
/* A long long does not fit in a LONGEST. */
shift = (sizeof (ULONGEST) * HOST_CHAR_BIT - 1);
else
shift = (gdbarch_long_long_bit (parse_gdbarch (par_state)) - 1);
high_bit = (ULONGEST) 1 << shift;
unsigned_type = parse_type (par_state)->builtin_unsigned_long_long;
signed_type = parse_type (par_state)->builtin_long_long;
}
putithere->typed_val_int.val = n;
/* If the high bit of the worked out type is set then this number
has to be unsigned. */
if (unsigned_p || (n & high_bit))
{
putithere->typed_val_int.type = unsigned_type;
}
else
{
putithere->typed_val_int.type = signed_type;
}
return INT;
}
/* Temporary obstack used for holding strings. */
static struct obstack tempbuf;
static int tempbuf_init;
/* Parse a string or character literal from TOKPTR. The string or
character may be wide or unicode. *OUTPTR is set to just after the
end of the literal in the input string. The resulting token is
stored in VALUE. This returns a token value, either STRING or
CHAR, depending on what was parsed. *HOST_CHARS is set to the
number of host characters in the literal. */
static int
parse_string_or_char (const char *tokptr, const char **outptr,
struct typed_stoken *value, int *host_chars)
{
int quote;
/* Build the gdb internal form of the input string in tempbuf. Note
that the buffer is null byte terminated *only* for the
convenience of debugging gdb itself and printing the buffer
contents when the buffer contains no embedded nulls. Gdb does
not depend upon the buffer being null byte terminated, it uses
the length string instead. This allows gdb to handle C strings
(as well as strings in other languages) with embedded null
bytes */
if (!tempbuf_init)
tempbuf_init = 1;
else
obstack_free (&tempbuf, NULL);
obstack_init (&tempbuf);
/* Skip the quote. */
quote = *tokptr;
++tokptr;
*host_chars = 0;
while (*tokptr)
{
char c = *tokptr;
if (c == '\\')
{
++tokptr;
*host_chars += c_parse_escape (&tokptr, &tempbuf);
}
else if (c == quote)
break;
else
{
obstack_1grow (&tempbuf, c);
++tokptr;
/* FIXME: this does the wrong thing with multi-byte host
characters. We could use mbrlen here, but that would
make "set host-charset" a bit less useful. */
++*host_chars;
}
}
if (*tokptr != quote)
{
if (quote == '"')
error (_("Unterminated string in expression."));
else
error (_("Unmatched single quote."));
}
++tokptr;
value->type = C_STRING | (quote == '\'' ? C_CHAR : 0); /*FIXME*/
value->ptr = obstack_base (&tempbuf);
value->length = obstack_object_size (&tempbuf);
*outptr = tokptr;
return quote == '\'' ? CHAR : STRING;
}
struct token
{
char *oper;
int token;
enum exp_opcode opcode;
};
static const struct token tokentab3[] =
{
{">>=", ASSIGN_MODIFY, BINOP_RSH},
{"<<=", ASSIGN_MODIFY, BINOP_LSH},
/*{"&^=", ASSIGN_MODIFY, BINOP_BITWISE_ANDNOT}, TODO */
{"...", DOTDOTDOT, OP_NULL},
};
static const struct token tokentab2[] =
{
{"+=", ASSIGN_MODIFY, BINOP_ADD},
{"-=", ASSIGN_MODIFY, BINOP_SUB},
{"*=", ASSIGN_MODIFY, BINOP_MUL},
{"/=", ASSIGN_MODIFY, BINOP_DIV},
{"%=", ASSIGN_MODIFY, BINOP_REM},
{"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR},
{"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND},
{"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR},
{"++", INCREMENT, BINOP_END},
{"--", DECREMENT, BINOP_END},
/*{"->", RIGHT_ARROW, BINOP_END}, Doesn't exist in Go. */
{"<-", LEFT_ARROW, BINOP_END},
{"&&", ANDAND, BINOP_END},
{"||", OROR, BINOP_END},
{"<<", LSH, BINOP_END},
{">>", RSH, BINOP_END},
{"==", EQUAL, BINOP_END},
{"!=", NOTEQUAL, BINOP_END},
{"<=", LEQ, BINOP_END},
{">=", GEQ, BINOP_END},
/*{"&^", ANDNOT, BINOP_END}, TODO */
};
/* Identifier-like tokens. */
static const struct token ident_tokens[] =
{
{"true", TRUE_KEYWORD, OP_NULL},
{"false", FALSE_KEYWORD, OP_NULL},
{"nil", NIL_KEYWORD, OP_NULL},
{"const", CONST_KEYWORD, OP_NULL},
{"struct", STRUCT_KEYWORD, OP_NULL},
{"type", TYPE_KEYWORD, OP_NULL},
{"interface", INTERFACE_KEYWORD, OP_NULL},
{"chan", CHAN_KEYWORD, OP_NULL},
{"byte", BYTE_KEYWORD, OP_NULL}, /* An alias of uint8. */
{"len", LEN_KEYWORD, OP_NULL},
{"cap", CAP_KEYWORD, OP_NULL},
{"new", NEW_KEYWORD, OP_NULL},
{"iota", IOTA_KEYWORD, OP_NULL},
};
/* This is set if a NAME token appeared at the very end of the input
string, with no whitespace separating the name from the EOF. This
is used only when parsing to do field name completion. */
static int saw_name_at_eof;
/* This is set if the previously-returned token was a structure
operator -- either '.' or ARROW. This is used only when parsing to
do field name completion. */
static int last_was_structop;
/* Read one token, getting characters through lexptr. */
static int
lex_one_token (struct parser_state *par_state)
{
int c;
int namelen;
unsigned int i;
const char *tokstart;
int saw_structop = last_was_structop;
char *copy;
last_was_structop = 0;
retry:
prev_lexptr = lexptr;
tokstart = lexptr;
/* See if it is a special token of length 3. */
for (i = 0; i < sizeof (tokentab3) / sizeof (tokentab3[0]); i++)
if (strncmp (tokstart, tokentab3[i].oper, 3) == 0)
{
lexptr += 3;
yylval.opcode = tokentab3[i].opcode;
return tokentab3[i].token;
}
/* See if it is a special token of length 2. */
for (i = 0; i < sizeof (tokentab2) / sizeof (tokentab2[0]); i++)
if (strncmp (tokstart, tokentab2[i].oper, 2) == 0)
{
lexptr += 2;
yylval.opcode = tokentab2[i].opcode;
/* NOTE: -> doesn't exist in Go, so we don't need to watch for
setting last_was_structop here. */
return tokentab2[i].token;
}
switch (c = *tokstart)
{
case 0:
if (saw_name_at_eof)
{
saw_name_at_eof = 0;
return COMPLETE;
}
else if (saw_structop)
return COMPLETE;
else
return 0;
case ' ':
case '\t':
case '\n':
lexptr++;
goto retry;
case '[':
case '(':
paren_depth++;
lexptr++;
return c;
case ']':
case ')':
if (paren_depth == 0)
return 0;
paren_depth--;
lexptr++;
return c;
case ',':
if (comma_terminates
&& paren_depth == 0)
return 0;
lexptr++;
return c;
case '.':
/* Might be a floating point number. */
if (lexptr[1] < '0' || lexptr[1] > '9')
{
if (parse_completion)
last_was_structop = 1;
goto symbol; /* Nope, must be a symbol. */
}
/* FALL THRU into number case. */
case '0':
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9':
{
/* It's a number. */
int got_dot = 0, got_e = 0, toktype;
const char *p = tokstart;
int hex = input_radix > 10;
if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
{
p += 2;
hex = 1;
}
for (;; ++p)
{
/* This test includes !hex because 'e' is a valid hex digit
and thus does not indicate a floating point number when
the radix is hex. */
if (!hex && !got_e && (*p == 'e' || *p == 'E'))
got_dot = got_e = 1;
/* This test does not include !hex, because a '.' always indicates
a decimal floating point number regardless of the radix. */
else if (!got_dot && *p == '.')
got_dot = 1;
else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
&& (*p == '-' || *p == '+'))
/* This is the sign of the exponent, not the end of the
number. */
continue;
/* We will take any letters or digits. parse_number will
complain if past the radix, or if L or U are not final. */
else if ((*p < '0' || *p > '9')
&& ((*p < 'a' || *p > 'z')
&& (*p < 'A' || *p > 'Z')))
break;
}
toktype = parse_number (par_state, tokstart, p - tokstart,
got_dot|got_e, &yylval);
if (toktype == ERROR)
{
char *err_copy = (char *) alloca (p - tokstart + 1);
memcpy (err_copy, tokstart, p - tokstart);
err_copy[p - tokstart] = 0;
error (_("Invalid number \"%s\"."), err_copy);
}
lexptr = p;
return toktype;
}
case '@':
{
const char *p = &tokstart[1];
size_t len = strlen ("entry");
while (isspace (*p))
p++;
if (strncmp (p, "entry", len) == 0 && !isalnum (p[len])
&& p[len] != '_')
{
lexptr = &p[len];
return ENTRY;
}
}
/* FALLTHRU */
case '+':
case '-':
case '*':
case '/':
case '%':
case '|':
case '&':
case '^':
case '~':
case '!':
case '<':
case '>':
case '?':
case ':':
case '=':
case '{':
case '}':
symbol:
lexptr++;
return c;
case '\'':
case '"':
case '`':
{
int host_len;
int result = parse_string_or_char (tokstart, &lexptr, &yylval.tsval,
&host_len);
if (result == CHAR)
{
if (host_len == 0)
error (_("Empty character constant."));
else if (host_len > 2 && c == '\'')
{
++tokstart;
namelen = lexptr - tokstart - 1;
goto tryname;
}
else if (host_len > 1)
error (_("Invalid character constant."));
}
return result;
}
}
if (!(c == '_' || c == '$'
|| (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
/* We must have come across a bad character (e.g. ';'). */
error (_("Invalid character '%c' in expression."), c);
/* It's a name. See how long it is. */
namelen = 0;
for (c = tokstart[namelen];
(c == '_' || c == '$' || (c >= '0' && c <= '9')
|| (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'));)
{
c = tokstart[++namelen];
}
/* The token "if" terminates the expression and is NOT removed from
the input stream. It doesn't count if it appears in the
expansion of a macro. */
if (namelen == 2
&& tokstart[0] == 'i'
&& tokstart[1] == 'f')
{
return 0;
}
/* For the same reason (breakpoint conditions), "thread N"
terminates the expression. "thread" could be an identifier, but
an identifier is never followed by a number without intervening
punctuation.
Handle abbreviations of these, similarly to
breakpoint.c:find_condition_and_thread.
TODO: Watch for "goroutine" here? */
if (namelen >= 1
&& strncmp (tokstart, "thread", namelen) == 0
&& (tokstart[namelen] == ' ' || tokstart[namelen] == '\t'))
{
const char *p = tokstart + namelen + 1;
while (*p == ' ' || *p == '\t')
p++;
if (*p >= '0' && *p <= '9')
return 0;
}
lexptr += namelen;
tryname:
yylval.sval.ptr = tokstart;
yylval.sval.length = namelen;
/* Catch specific keywords. */
copy = copy_name (yylval.sval);
for (i = 0; i < sizeof (ident_tokens) / sizeof (ident_tokens[0]); i++)
if (strcmp (copy, ident_tokens[i].oper) == 0)
{
/* It is ok to always set this, even though we don't always
strictly need to. */
yylval.opcode = ident_tokens[i].opcode;
return ident_tokens[i].token;
}
if (*tokstart == '$')
return DOLLAR_VARIABLE;
if (parse_completion && *lexptr == '\0')
saw_name_at_eof = 1;
return NAME;
}
/* An object of this type is pushed on a FIFO by the "outer" lexer. */
typedef struct
{
int token;
YYSTYPE value;
} token_and_value;
DEF_VEC_O (token_and_value);
/* A FIFO of tokens that have been read but not yet returned to the
parser. */
static VEC (token_and_value) *token_fifo;
/* Non-zero if the lexer should return tokens from the FIFO. */
static int popping;
/* Temporary storage for yylex; this holds symbol names as they are
built up. */
static struct obstack name_obstack;
/* Build "package.name" in name_obstack.
For convenience of the caller, the name is NUL-terminated,
but the NUL is not included in the recorded length. */
static struct stoken
build_packaged_name (const char *package, int package_len,
const char *name, int name_len)
{
struct stoken result;
obstack_free (&name_obstack, obstack_base (&name_obstack));
obstack_grow (&name_obstack, package, package_len);
obstack_grow_str (&name_obstack, ".");
obstack_grow (&name_obstack, name, name_len);
obstack_grow (&name_obstack, "", 1);
result.ptr = obstack_base (&name_obstack);
result.length = obstack_object_size (&name_obstack) - 1;
return result;
}
/* Return non-zero if NAME is a package name.
BLOCK is the scope in which to interpret NAME; this can be NULL
to mean the global scope. */
static int
package_name_p (const char *name, const struct block *block)
{
struct symbol *sym;
struct field_of_this_result is_a_field_of_this;
sym = lookup_symbol (name, block, STRUCT_DOMAIN, &is_a_field_of_this);
if (sym
&& SYMBOL_CLASS (sym) == LOC_TYPEDEF
&& TYPE_CODE (SYMBOL_TYPE (sym)) == TYPE_CODE_MODULE)
return 1;
return 0;
}
/* Classify a (potential) function in the "unsafe" package.
We fold these into "keywords" to keep things simple, at least until
something more complex is warranted. */
static int
classify_unsafe_function (struct stoken function_name)
{
char *copy = copy_name (function_name);
if (strcmp (copy, "Sizeof") == 0)
{
yylval.sval = function_name;
return SIZEOF_KEYWORD;
}
error (_("Unknown function in `unsafe' package: %s"), copy);
}
/* Classify token(s) "name1.name2" where name1 is known to be a package.
The contents of the token are in `yylval'.
Updates yylval and returns the new token type.
The result is one of NAME, NAME_OR_INT, or TYPENAME. */
static int
classify_packaged_name (const struct block *block)
{
char *copy;
struct symbol *sym;
struct field_of_this_result is_a_field_of_this;
copy = copy_name (yylval.sval);
sym = lookup_symbol (copy, block, VAR_DOMAIN, &is_a_field_of_this);
if (sym)
{
yylval.ssym.sym = sym;
yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
}
return NAME;
}
/* Classify a NAME token.
The contents of the token are in `yylval'.
Updates yylval and returns the new token type.
BLOCK is the block in which lookups start; this can be NULL
to mean the global scope.
The result is one of NAME, NAME_OR_INT, or TYPENAME. */
static int
classify_name (struct parser_state *par_state, const struct block *block)
{
struct type *type;
struct symbol *sym;
char *copy;
struct field_of_this_result is_a_field_of_this;
copy = copy_name (yylval.sval);
/* Try primitive types first so they win over bad/weird debug info. */
type = language_lookup_primitive_type (parse_language (par_state),
parse_gdbarch (par_state),
copy);
if (type != NULL)
{
/* NOTE: We take advantage of the fact that yylval coming in was a
NAME, and that struct ttype is a compatible extension of struct
stoken, so yylval.tsym.stoken is already filled in. */
yylval.tsym.type = type;
return TYPENAME;
}
/* TODO: What about other types? */
sym = lookup_symbol (copy, block, VAR_DOMAIN, &is_a_field_of_this);
if (sym)
{
yylval.ssym.sym = sym;
yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
return NAME;
}
/* If we didn't find a symbol, look again in the current package.
This is to, e.g., make "p global_var" work without having to specify
the package name. We intentionally only looks for objects in the
current package. */
{
char *current_package_name = go_block_package_name (block);
if (current_package_name != NULL)
{
struct stoken sval =
build_packaged_name (current_package_name,
strlen (current_package_name),
copy, strlen (copy));
xfree (current_package_name);
sym = lookup_symbol (sval.ptr, block, VAR_DOMAIN,
&is_a_field_of_this);
if (sym)
{
yylval.ssym.stoken = sval;
yylval.ssym.sym = sym;
yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
return NAME;
}
}
}
/* Input names that aren't symbols but ARE valid hex numbers, when
the input radix permits them, can be names or numbers depending
on the parse. Note we support radixes > 16 here. */
if ((copy[0] >= 'a' && copy[0] < 'a' + input_radix - 10)
|| (copy[0] >= 'A' && copy[0] < 'A' + input_radix - 10))
{
YYSTYPE newlval; /* Its value is ignored. */
int hextype = parse_number (par_state, copy, yylval.sval.length,
0, &newlval);
if (hextype == INT)
{
yylval.ssym.sym = NULL;
yylval.ssym.is_a_field_of_this = 0;
return NAME_OR_INT;
}
}
yylval.ssym.sym = NULL;
yylval.ssym.is_a_field_of_this = 0;
return NAME;
}
/* This is taken from c-exp.y mostly to get something working.
The basic structure has been kept because we may yet need some of it. */
static int
yylex (void)
{
token_and_value current, next;
if (popping && !VEC_empty (token_and_value, token_fifo))
{
token_and_value tv = *VEC_index (token_and_value, token_fifo, 0);
VEC_ordered_remove (token_and_value, token_fifo, 0);
yylval = tv.value;
/* There's no need to fall through to handle package.name
as that can never happen here. In theory. */
return tv.token;
}
popping = 0;
current.token = lex_one_token (pstate);
/* TODO: Need a way to force specifying name1 as a package.
.name1.name2 ? */
if (current.token != NAME)
return current.token;
/* See if we have "name1 . name2". */
current.value = yylval;
next.token = lex_one_token (pstate);
next.value = yylval;
if (next.token == '.')
{
token_and_value name2;
name2.token = lex_one_token (pstate);
name2.value = yylval;
if (name2.token == NAME)
{
/* Ok, we have "name1 . name2". */
char *copy;
copy = copy_name (current.value.sval);
if (strcmp (copy, "unsafe") == 0)
{
popping = 1;
return classify_unsafe_function (name2.value.sval);
}
if (package_name_p (copy, expression_context_block))
{
popping = 1;
yylval.sval = build_packaged_name (current.value.sval.ptr,
current.value.sval.length,
name2.value.sval.ptr,
name2.value.sval.length);
return classify_packaged_name (expression_context_block);
}
}
VEC_safe_push (token_and_value, token_fifo, &next);
VEC_safe_push (token_and_value, token_fifo, &name2);
}
else
{
VEC_safe_push (token_and_value, token_fifo, &next);
}
/* If we arrive here we don't have a package-qualified name. */
popping = 1;
yylval = current.value;
return classify_name (pstate, expression_context_block);
}
int
go_parse (struct parser_state *par_state)
{
int result;
struct cleanup *back_to;
/* Setting up the parser state. */
gdb_assert (par_state != NULL);
pstate = par_state;
back_to = make_cleanup (null_cleanup, NULL);
make_cleanup_restore_integer (&yydebug);
make_cleanup_clear_parser_state (&pstate);
yydebug = parser_debug;
/* Initialize some state used by the lexer. */
last_was_structop = 0;
saw_name_at_eof = 0;
VEC_free (token_and_value, token_fifo);
popping = 0;
obstack_init (&name_obstack);
make_cleanup_obstack_free (&name_obstack);
result = yyparse ();
do_cleanups (back_to);
return result;
}
void
yyerror (char *msg)
{
if (prev_lexptr)
lexptr = prev_lexptr;
error (_("A %s in expression, near `%s'."), (msg ? msg : "error"), lexptr);
}