Macintosh-Tools/Retro68
1
0
Fork 0
mirror of https://github.com/autc04/Retro68.git synced 2024-12-02 18:53:22 +00:00
Code Issues Projects Releases Wiki Activity
7309f84f1a
Retro68/binutils/ld/deffilep.c
Wolfgang Thaller 1cc92c1e99 update to binutils 2.31.1
2018-12-28 16:25:28 +01:00

3460 lines
93 KiB
C
Raw Blame History

/* A Bison parser, made by GNU Bison 3.0.4. */
/* Bison implementation for Yacc-like parsers in C
Copyright (C) 1984, 1989-1990, 2000-2015 Free Software Foundation, Inc.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
/* As a special exception, you may create a larger work that contains
part or all of the Bison parser skeleton and distribute that work
under terms of your choice, so long as that work isn't itself a
parser generator using the skeleton or a modified version thereof
as a parser skeleton. Alternatively, if you modify or redistribute
the parser skeleton itself, you may (at your option) remove this
special exception, which will cause the skeleton and the resulting
Bison output files to be licensed under the GNU General Public
License without this special exception.
This special exception was added by the Free Software Foundation in
version 2.2 of Bison. */
/* C LALR(1) parser skeleton written by Richard Stallman, by
simplifying the original so-called "semantic" parser. */
/* All symbols defined below should begin with yy or YY, to avoid
infringing on user name space. This should be done even for local
variables, as they might otherwise be expanded by user macros.
There are some unavoidable exceptions within include files to
define necessary library symbols; they are noted "INFRINGES ON
USER NAME SPACE" below. */
/* Identify Bison output. */
#define YYBISON 1
/* Bison version. */
#define YYBISON_VERSION "3.0.4"
/* 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 1 "deffilep.y" /* yacc.c:339 */
/* deffilep.y - parser for .def files */
/* Copyright (C) 1995-2018 Free Software Foundation, Inc.
This file is part of GNU Binutils.
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, write to the Free Software
Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
MA 02110-1301, USA. */
#include "sysdep.h"
#include "libiberty.h"
#include "safe-ctype.h"
#include "bfd.h"
#include "ld.h"
#include "ldmisc.h"
#include "deffile.h"
#define TRACE 0
#define ROUND_UP(a, b) (((a)+((b)-1))&~((b)-1))
/* 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 ld. 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 def_maxdepth
#define yyparse def_parse
#define yylex def_lex
#define yyerror def_error
#define yylval def_lval
#define yychar def_char
#define yydebug def_debug
#define yypact def_pact
#define yyr1 def_r1
#define yyr2 def_r2
#define yydef def_def
#define yychk def_chk
#define yypgo def_pgo
#define yyact def_act
#define yyexca def_exca
#define yyerrflag def_errflag
#define yynerrs def_nerrs
#define yyps def_ps
#define yypv def_pv
#define yys def_s
#define yy_yys def_yys
#define yystate def_state
#define yytmp def_tmp
#define yyv def_v
#define yy_yyv def_yyv
#define yyval def_val
#define yylloc def_lloc
#define yyreds def_reds /* With YYDEBUG defined. */
#define yytoks def_toks /* With YYDEBUG defined. */
#define yylhs def_yylhs
#define yylen def_yylen
#define yydefred def_yydefred
#define yydgoto def_yydgoto
#define yysindex def_yysindex
#define yyrindex def_yyrindex
#define yygindex def_yygindex
#define yytable def_yytable
#define yycheck def_yycheck
typedef struct def_pool_str {
struct def_pool_str *next;
char data[1];
} def_pool_str;
static def_pool_str *pool_strs = NULL;
static char *def_pool_alloc (size_t sz);
static char *def_pool_strdup (const char *str);
static void def_pool_free (void);
static void def_description (const char *);
static void def_exports (const char *, const char *, int, int, const char *);
static void def_heapsize (int, int);
static void def_import (const char *, const char *, const char *, const char *,
int, const char *);
static void def_image_name (const char *, bfd_vma, int);
static void def_section (const char *, int);
static void def_section_alt (const char *, const char *);
static void def_stacksize (int, int);
static void def_version (int, int);
static void def_directive (char *);
static void def_aligncomm (char *str, int align);
static int def_parse (void);
static int def_error (const char *);
static int def_lex (void);
static int lex_forced_token = 0;
static const char *lex_parse_string = 0;
static const char *lex_parse_string_end = 0;
#line 178 "deffilep.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
/* In a future release of Bison, this section will be replaced
by #include "y.tab.h". */
#ifndef YY_YY_DEFFILEP_H_INCLUDED
# define YY_YY_DEFFILEP_H_INCLUDED
/* Debug traces. */
#ifndef YYDEBUG
# define YYDEBUG 0
#endif
#if YYDEBUG
extern int yydebug;
#endif
/* Token type. */
#ifndef YYTOKENTYPE
# define YYTOKENTYPE
enum yytokentype
{
NAME = 258,
LIBRARY = 259,
DESCRIPTION = 260,
STACKSIZE_K = 261,
HEAPSIZE = 262,
CODE = 263,
DATAU = 264,
DATAL = 265,
SECTIONS = 266,
EXPORTS = 267,
IMPORTS = 268,
VERSIONK = 269,
BASE = 270,
CONSTANTU = 271,
CONSTANTL = 272,
PRIVATEU = 273,
PRIVATEL = 274,
ALIGNCOMM = 275,
READ = 276,
WRITE = 277,
EXECUTE = 278,
SHARED = 279,
NONAMEU = 280,
NONAMEL = 281,
DIRECTIVE = 282,
EQUAL = 283,
ID = 284,
DIGITS = 285
};
#endif
/* Tokens. */
#define NAME 258
#define LIBRARY 259
#define DESCRIPTION 260
#define STACKSIZE_K 261
#define HEAPSIZE 262
#define CODE 263
#define DATAU 264
#define DATAL 265
#define SECTIONS 266
#define EXPORTS 267
#define IMPORTS 268
#define VERSIONK 269
#define BASE 270
#define CONSTANTU 271
#define CONSTANTL 272
#define PRIVATEU 273
#define PRIVATEL 274
#define ALIGNCOMM 275
#define READ 276
#define WRITE 277
#define EXECUTE 278
#define SHARED 279
#define NONAMEU 280
#define NONAMEL 281
#define DIRECTIVE 282
#define EQUAL 283
#define ID 284
#define DIGITS 285
/* Value type. */
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
union YYSTYPE
{
#line 113 "deffilep.y" /* yacc.c:355 */
char *id;
const char *id_const;
int number;
bfd_vma vma;
char *digits;
#line 286 "deffilep.c" /* yacc.c:355 */
};
typedef union YYSTYPE YYSTYPE;
# define YYSTYPE_IS_TRIVIAL 1
# define YYSTYPE_IS_DECLARED 1
#endif
extern YYSTYPE yylval;
int yyparse (void);
#endif /* !YY_YY_DEFFILEP_H_INCLUDED */
/* Copy the second part of user declarations. */
#line 303 "deffilep.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 <stddef.h> /* INFRINGES ON USER NAME SPACE */
# define YYSIZE_T size_t
# else
# define YYSIZE_T unsigned int
# endif
#endif
#define YYSIZE_MAXIMUM ((YYSIZE_T) -1)
#ifndef YY_
# if defined YYENABLE_NLS && YYENABLE_NLS
# if ENABLE_NLS
# include <libintl.h> /* INFRINGES ON USER NAME SPACE */
# define YY_(Msgid) dgettext ("bison-runtime", Msgid)
# endif
# endif
# ifndef YY_
# define YY_(Msgid) Msgid
# endif
#endif
#ifndef YY_ATTRIBUTE
# if (defined __GNUC__ \
&& (2 < __GNUC__ || (__GNUC__ == 2 && 96 <= __GNUC_MINOR__))) \
|| defined __SUNPRO_C && 0x5110 <= __SUNPRO_C
# define YY_ATTRIBUTE(Spec) __attribute__(Spec)
# else
# define YY_ATTRIBUTE(Spec) /* empty */
# endif
#endif
#ifndef YY_ATTRIBUTE_PURE
# define YY_ATTRIBUTE_PURE YY_ATTRIBUTE ((__pure__))
#endif
#ifndef YY_ATTRIBUTE_UNUSED
# define YY_ATTRIBUTE_UNUSED YY_ATTRIBUTE ((__unused__))
#endif
#if !defined _Noreturn \
&& (!defined __STDC_VERSION__ || __STDC_VERSION__ < 201112)
# if defined _MSC_VER && 1200 <= _MSC_VER
# define _Noreturn __declspec (noreturn)
# else
# define _Noreturn YY_ATTRIBUTE ((__noreturn__))
# endif
#endif
/* Suppress unused-variable warnings by "using" E. */
#if ! defined lint || defined __GNUC__
# define YYUSE(E) ((void) (E))
#else
# define YYUSE(E) /* empty */
#endif
#if defined __GNUC__ && 407 <= __GNUC__ * 100 + __GNUC_MINOR__
/* Suppress an incorrect diagnostic about yylval being uninitialized. */
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
_Pragma ("GCC diagnostic push") \
_Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")\
_Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"")
# define YY_IGNORE_MAYBE_UNINITIALIZED_END \
_Pragma ("GCC diagnostic pop")
#else
# define YY_INITIAL_VALUE(Value) Value
#endif
#ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
# define YY_IGNORE_MAYBE_UNINITIALIZED_END
#endif
#ifndef YY_INITIAL_VALUE
# define YY_INITIAL_VALUE(Value) /* Nothing. */
#endif
#if ! defined yyoverflow || YYERROR_VERBOSE
/* The parser invokes alloca or malloc; define the necessary symbols. */
# ifdef YYSTACK_USE_ALLOCA
# if YYSTACK_USE_ALLOCA
# ifdef __GNUC__
# define YYSTACK_ALLOC __builtin_alloca
# elif defined __BUILTIN_VA_ARG_INCR
# include <alloca.h> /* INFRINGES ON USER NAME SPACE */
# elif defined _AIX
# define YYSTACK_ALLOC __alloca
# elif defined _MSC_VER
# include <malloc.h> /* INFRINGES ON USER NAME SPACE */
# define alloca _alloca
# else
# define YYSTACK_ALLOC alloca
# if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
/* Use EXIT_SUCCESS as a witness for stdlib.h. */
# ifndef EXIT_SUCCESS
# define EXIT_SUCCESS 0
# endif
# endif
# endif
# endif
# endif
# ifdef YYSTACK_ALLOC
/* Pacify GCC's 'empty if-body' warning. */
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
# ifndef YYSTACK_ALLOC_MAXIMUM
/* The OS might guarantee only one guard page at the bottom of the stack,
and a page size can be as small as 4096 bytes. So we cannot safely
invoke alloca (N) if N exceeds 4096. Use a slightly smaller number
to allow for a few compiler-allocated temporary stack slots. */
# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
# endif
# else
# define YYSTACK_ALLOC YYMALLOC
# define YYSTACK_FREE YYFREE
# ifndef YYSTACK_ALLOC_MAXIMUM
# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
# endif
# if (defined __cplusplus && ! defined EXIT_SUCCESS \
&& ! ((defined YYMALLOC || defined malloc) \
&& (defined YYFREE || defined free)))
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
# ifndef EXIT_SUCCESS
# define EXIT_SUCCESS 0
# endif
# endif
# ifndef YYMALLOC
# define YYMALLOC malloc
# if ! defined malloc && ! defined EXIT_SUCCESS
void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# ifndef YYFREE
# define YYFREE free
# if ! defined free && ! defined EXIT_SUCCESS
void free (void *); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# endif
#endif /* ! defined yyoverflow || YYERROR_VERBOSE */
#if (! defined yyoverflow \
&& (! defined __cplusplus \
|| (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
/* A type that is properly aligned for any stack member. */
union yyalloc
{
yytype_int16 yyss_alloc;
YYSTYPE yyvs_alloc;
};
/* The size of the maximum gap between one aligned stack and the next. */
# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
/* The size of an array large to enough to hold all stacks, each with
N elements. */
# define YYSTACK_BYTES(N) \
((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \
+ YYSTACK_GAP_MAXIMUM)
# define YYCOPY_NEEDED 1
/* Relocate STACK from its old location to the new one. The
local variables YYSIZE and YYSTACKSIZE give the old and new number of
elements in the stack, and YYPTR gives the new location of the
stack. Advance YYPTR to a properly aligned location for the next
stack. */
# define YYSTACK_RELOCATE(Stack_alloc, Stack) \
do \
{ \
YYSIZE_T yynewbytes; \
YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \
Stack = &yyptr->Stack_alloc; \
yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
yyptr += yynewbytes / sizeof (*yyptr); \
} \
while (0)
#endif
#if defined YYCOPY_NEEDED && YYCOPY_NEEDED
/* Copy COUNT objects from SRC to DST. The source and destination do
not overlap. */
# ifndef YYCOPY
# if defined __GNUC__ && 1 < __GNUC__
# define YYCOPY(Dst, Src, Count) \
__builtin_memcpy (Dst, Src, (Count) * sizeof (*(Src)))
# else
# define YYCOPY(Dst, Src, Count) \
do \
{ \
YYSIZE_T yyi; \
for (yyi = 0; yyi < (Count); yyi++) \
(Dst)[yyi] = (Src)[yyi]; \
} \
while (0)
# endif
# endif
#endif /* !YYCOPY_NEEDED */
/* YYFINAL -- State number of the termination state. */
#define YYFINAL 69
/* YYLAST -- Last index in YYTABLE. */
#define YYLAST 149
/* YYNTOKENS -- Number of terminals. */
#define YYNTOKENS 35
/* YYNNTS -- Number of nonterminals. */
#define YYNNTS 27
/* YYNRULES -- Number of rules. */
#define YYNRULES 99
/* YYNSTATES -- Number of states. */
#define YYNSTATES 146
/* YYTRANSLATE[YYX] -- Symbol number corresponding to YYX as returned
by yylex, with out-of-bounds checking. */
#define YYUNDEFTOK 2
#define YYMAXUTOK 285
#define YYTRANSLATE(YYX) \
((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
/* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM
as returned by yylex, without out-of-bounds checking. */
static const yytype_uint8 yytranslate[] =
{
0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 32, 2, 31, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 33, 2, 2, 34, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 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
};
#if YYDEBUG
/* YYRLINE[YYN] -- Source line where rule number YYN was defined. */
static const yytype_uint16 yyrline[] =
{
0, 138, 138, 139, 143, 144, 145, 146, 147, 148,
149, 150, 151, 152, 153, 154, 155, 156, 160, 162,
163, 170, 177, 178, 181, 182, 183, 184, 185, 186,
187, 188, 191, 192, 196, 198, 200, 202, 204, 206,
211, 212, 216, 217, 221, 222, 226, 227, 229, 230,
234, 235, 236, 237, 241, 242, 243, 244, 245, 246,
247, 248, 249, 250, 251, 252, 259, 260, 261, 262,
263, 264, 265, 266, 267, 268, 271, 272, 278, 284,
290, 298, 299, 302, 303, 307, 308, 312, 313, 316,
317, 320, 321, 327, 335, 336, 339, 340, 343, 345
};
#endif
#if YYDEBUG || YYERROR_VERBOSE || 0
/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
First, the terminals, then, starting at YYNTOKENS, nonterminals. */
static const char *const yytname[] =
{
"$end", "error", "$undefined", "NAME", "LIBRARY", "DESCRIPTION",
"STACKSIZE_K", "HEAPSIZE", "CODE", "DATAU", "DATAL", "SECTIONS",
"EXPORTS", "IMPORTS", "VERSIONK", "BASE", "CONSTANTU", "CONSTANTL",
"PRIVATEU", "PRIVATEL", "ALIGNCOMM", "READ", "WRITE", "EXECUTE",
"SHARED", "NONAMEU", "NONAMEL", "DIRECTIVE", "EQUAL", "ID", "DIGITS",
"'.'", "','", "'='", "'@'", "$accept", "start", "command", "explist",
"expline", "exp_opt_list", "exp_opt", "implist", "impline", "seclist",
"secline", "attr_list", "opt_comma", "opt_number", "attr",
"keyword_as_name", "opt_name2", "opt_name", "opt_equalequal_name",
"opt_ordinal", "opt_equal_name", "opt_base", "anylang_id", "opt_digits",
"opt_id", "NUMBER", "VMA", 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, 46, 44, 61, 64
};
# endif
#define YYPACT_NINF -82
#define yypact_value_is_default(Yystate) \
(!!((Yystate) == (-82)))
#define YYTABLE_NINF -48
#define yytable_value_is_error(Yytable_value) \
0
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
STATE-NUM. */
static const yytype_int8 yypact[] =
{
122, 11, 11, -25, 9, 9, 53, 53, -17, 11,
14, 9, -18, 20, 95, -82, -82, -82, -82, -82,
-82, -82, -82, -82, -82, -82, -82, -82, -82, -82,
-82, -82, -82, -82, -82, -82, -82, -82, 29, 11,
47, -82, 67, 67, -82, -82, 54, 54, -82, -82,
-82, -82, 48, -82, 48, -14, -17, -82, 11, -82,
58, 50, 14, -82, 61, -82, 64, 33, -82, -82,
-82, 11, 47, -82, 11, 63, -82, -82, 9, -82,
-82, -82, 53, -82, 48, -82, -82, 11, 60, 76,
81, -82, 9, -82, 83, 9, -82, -82, 84, -82,
-82, -82, 9, 79, -26, 85, -82, -82, 88, -82,
-82, -82, -82, 36, 89, 90, -82, 55, -82, -82,
-82, -82, -82, -82, -82, -82, -82, -82, 79, 79,
-82, 92, 13, 92, 92, 36, -82, 59, -82, -82,
-82, -82, 92, 92, -82, -82
};
/* 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, 82, 82, 0, 0, 0, 0, 0, 0, 18,
0, 0, 0, 0, 0, 3, 66, 60, 73, 64,
55, 58, 59, 63, 65, 74, 54, 56, 57, 69,
70, 71, 75, 62, 72, 67, 68, 61, 76, 0,
0, 81, 90, 90, 6, 98, 49, 49, 50, 51,
52, 53, 9, 45, 10, 0, 11, 41, 12, 19,
88, 0, 13, 33, 14, 91, 0, 0, 16, 1,
2, 0, 77, 78, 0, 0, 4, 5, 0, 7,
8, 46, 0, 43, 42, 40, 20, 0, 86, 0,
0, 32, 0, 92, 95, 0, 80, 79, 0, 48,
44, 87, 0, 47, 84, 0, 15, 94, 97, 17,
99, 89, 85, 23, 0, 0, 39, 0, 96, 93,
28, 29, 26, 27, 30, 31, 24, 25, 47, 47,
83, 84, 84, 84, 84, 23, 38, 0, 36, 37,
21, 22, 84, 84, 34, 35
};
/* YYPGOTO[NTERM-NUM]. */
static const yytype_int16 yypgoto[] =
{
-82, -82, 107, -82, 65, -11, -82, -82, 75, -82,
82, -4, -81, 93, 57, 102, -8, 141, -75, -82,
-82, 101, -82, -82, -82, -5, -82
};
/* YYDEFGOTO[NTERM-NUM]. */
static const yytype_int16 yydefgoto[] =
{
-1, 14, 15, 58, 59, 128, 129, 62, 63, 56,
57, 52, 82, 79, 53, 40, 41, 42, 116, 103,
88, 76, 67, 108, 119, 46, 111
};
/* 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_int16 yytable[] =
{
47, 60, 114, 54, 44, 115, 64, 48, 49, 50,
51, 65, 55, 66, 16, 83, 17, 18, 19, 20,
21, 22, 113, 23, 24, 25, 26, 27, 28, 29,
30, 73, 31, 32, 33, 34, 35, 36, 37, 45,
38, 114, 39, 61, 137, 120, 121, 134, 135, 68,
60, 84, 122, 123, 124, 125, 136, 138, 139, 140,
71, 126, 127, 96, 94, 95, 97, 144, 145, -47,
-47, -47, -47, 99, 48, 49, 50, 51, 74, 101,
81, 89, 75, 90, 132, 45, 78, 106, 142, 45,
109, 87, 92, 93, 102, 69, 98, 112, 1, 2,
3, 4, 5, 6, 7, 104, 8, 9, 10, 11,
105, 81, 133, 107, 110, 12, 117, 118, 130, 131,
114, 70, 13, 86, 141, 1, 2, 3, 4, 5,
6, 7, 143, 8, 9, 10, 11, 91, 85, 100,
80, 72, 12, 43, 77, 0, 0, 0, 0, 13
};
static const yytype_int16 yycheck[] =
{
5, 9, 28, 7, 29, 31, 11, 21, 22, 23,
24, 29, 29, 31, 3, 29, 5, 6, 7, 8,
9, 10, 103, 12, 13, 14, 15, 16, 17, 18,
19, 39, 21, 22, 23, 24, 25, 26, 27, 30,
29, 28, 31, 29, 31, 9, 10, 128, 129, 29,
58, 55, 16, 17, 18, 19, 131, 132, 133, 134,
31, 25, 26, 71, 31, 32, 74, 142, 143, 21,
22, 23, 24, 78, 21, 22, 23, 24, 31, 87,
32, 31, 15, 33, 29, 30, 32, 92, 29, 30,
95, 33, 31, 29, 34, 0, 33, 102, 3, 4,
5, 6, 7, 8, 9, 29, 11, 12, 13, 14,
29, 32, 117, 30, 30, 20, 31, 29, 29, 29,
28, 14, 27, 58, 135, 3, 4, 5, 6, 7,
8, 9, 137, 11, 12, 13, 14, 62, 56, 82,
47, 39, 20, 2, 43, -1, -1, -1, -1, 27
};
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
symbol of state STATE-NUM. */
static const yytype_uint8 yystos[] =
{
0, 3, 4, 5, 6, 7, 8, 9, 11, 12,
13, 14, 20, 27, 36, 37, 3, 5, 6, 7,
8, 9, 10, 12, 13, 14, 15, 16, 17, 18,
19, 21, 22, 23, 24, 25, 26, 27, 29, 31,
50, 51, 52, 52, 29, 30, 60, 60, 21, 22,
23, 24, 46, 49, 46, 29, 44, 45, 38, 39,
51, 29, 42, 43, 60, 29, 31, 57, 29, 0,
37, 31, 50, 51, 31, 15, 56, 56, 32, 48,
48, 32, 47, 29, 46, 45, 39, 33, 55, 31,
33, 43, 31, 29, 31, 32, 51, 51, 33, 60,
49, 51, 34, 54, 29, 29, 60, 30, 58, 60,
30, 61, 60, 47, 28, 31, 53, 31, 29, 59,
9, 10, 16, 17, 18, 19, 25, 26, 40, 41,
29, 29, 29, 60, 47, 47, 53, 31, 53, 53,
53, 40, 29, 60, 53, 53
};
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
static const yytype_uint8 yyr1[] =
{
0, 35, 36, 36, 37, 37, 37, 37, 37, 37,
37, 37, 37, 37, 37, 37, 37, 37, 38, 38,
38, 39, 40, 40, 41, 41, 41, 41, 41, 41,
41, 41, 42, 42, 43, 43, 43, 43, 43, 43,
44, 44, 45, 45, 46, 46, 47, 47, 48, 48,
49, 49, 49, 49, 50, 50, 50, 50, 50, 50,
50, 50, 50, 50, 50, 50, 50, 50, 50, 50,
50, 50, 50, 50, 50, 50, 51, 51, 51, 51,
51, 52, 52, 53, 53, 54, 54, 55, 55, 56,
56, 57, 57, 57, 58, 58, 59, 59, 60, 61
};
/* YYR2[YYN] -- Number of symbols on the right hand side of rule YYN. */
static const yytype_uint8 yyr2[] =
{
0, 2, 2, 1, 3, 3, 2, 3, 3, 2,
2, 2, 2, 2, 2, 4, 2, 4, 0, 1,
2, 7, 3, 0, 1, 1, 1, 1, 1, 1,
1, 1, 2, 1, 8, 8, 6, 6, 6, 4,
2, 1, 2, 2, 3, 1, 1, 0, 2, 0,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 2, 2, 3,
3, 1, 0, 2, 0, 2, 0, 2, 0, 3,
0, 1, 2, 4, 1, 0, 1, 0, 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 <stdio.h> /* INFRINGES ON USER NAME SPACE */
# define YYFPRINTF fprintf
# endif
# define YYDPRINTF(Args) \
do { \
if (yydebug) \
YYFPRINTF Args; \
} while (0)
/* This macro is provided for backward compatibility. */
#ifndef YY_LOCATION_PRINT
# define YY_LOCATION_PRINT(File, Loc) ((void) 0)
#endif
# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \
do { \
if (yydebug) \
{ \
YYFPRINTF (stderr, "%s ", Title); \
yy_symbol_print (stderr, \
Type, Value); \
YYFPRINTF (stderr, "\n"); \
} \
} while (0)
/*----------------------------------------.
| Print this symbol's value on YYOUTPUT. |
`----------------------------------------*/
static void
yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
{
FILE *yyo = yyoutput;
YYUSE (yyo);
if (!yyvaluep)
return;
# ifdef YYPRINT
if (yytype < YYNTOKENS)
YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
# endif
YYUSE (yytype);
}
/*--------------------------------.
| Print this symbol on YYOUTPUT. |
`--------------------------------*/
static void
yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
{
YYFPRINTF (yyoutput, "%s %s (",
yytype < YYNTOKENS ? "token" : "nterm", yytname[yytype]);
yy_symbol_value_print (yyoutput, yytype, yyvaluep);
YYFPRINTF (yyoutput, ")");
}
/*------------------------------------------------------------------.
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
| TOP (included). |
`------------------------------------------------------------------*/
static void
yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop)
{
YYFPRINTF (stderr, "Stack now");
for (; yybottom <= yytop; yybottom++)
{
int yybot = *yybottom;
YYFPRINTF (stderr, " %d", yybot);
}
YYFPRINTF (stderr, "\n");
}
# define YY_STACK_PRINT(Bottom, Top) \
do { \
if (yydebug) \
yy_stack_print ((Bottom), (Top)); \
} while (0)
/*------------------------------------------------.
| Report that the YYRULE is going to be reduced. |
`------------------------------------------------*/
static void
yy_reduce_print (yytype_int16 *yyssp, YYSTYPE *yyvsp, int yyrule)
{
unsigned long int yylno = yyrline[yyrule];
int yynrhs = yyr2[yyrule];
int yyi;
YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
yyrule - 1, yylno);
/* The symbols being reduced. */
for (yyi = 0; yyi < yynrhs; yyi++)
{
YYFPRINTF (stderr, " $%d = ", yyi + 1);
yy_symbol_print (stderr,
yystos[yyssp[yyi + 1 - yynrhs]],
&(yyvsp[(yyi + 1) - (yynrhs)])
);
YYFPRINTF (stderr, "\n");
}
}
# define YY_REDUCE_PRINT(Rule) \
do { \
if (yydebug) \
yy_reduce_print (yyssp, yyvsp, Rule); \
} while (0)
/* Nonzero means print parse trace. It is left uninitialized so that
multiple parsers can coexist. */
int yydebug;
#else /* !YYDEBUG */
# define YYDPRINTF(Args)
# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
# define YY_STACK_PRINT(Bottom, Top)
# define YY_REDUCE_PRINT(Rule)
#endif /* !YYDEBUG */
/* YYINITDEPTH -- initial size of the parser's stacks. */
#ifndef YYINITDEPTH
# define YYINITDEPTH 200
#endif
/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
if the built-in stack extension method is used).
Do not make this value too large; the results are undefined if
YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
evaluated with infinite-precision integer arithmetic. */
#ifndef YYMAXDEPTH
# define YYMAXDEPTH 10000
#endif
#if YYERROR_VERBOSE
# ifndef yystrlen
# if defined __GLIBC__ && defined _STRING_H
# define yystrlen strlen
# else
/* Return the length of YYSTR. */
static YYSIZE_T
yystrlen (const char *yystr)
{
YYSIZE_T yylen;
for (yylen = 0; yystr[yylen]; yylen++)
continue;
return yylen;
}
# endif
# endif
# ifndef yystpcpy
# if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE
# define yystpcpy stpcpy
# else
/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
YYDEST. */
static char *
yystpcpy (char *yydest, const char *yysrc)
{
char *yyd = yydest;
const char *yys = yysrc;
while ((*yyd++ = *yys++) != '\0')
continue;
return yyd - 1;
}
# endif
# endif
# ifndef yytnamerr
/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
quotes and backslashes, so that it's suitable for yyerror. The
heuristic is that double-quoting is unnecessary unless the string
contains an apostrophe, a comma, or backslash (other than
backslash-backslash). YYSTR is taken from yytname. If YYRES is
null, do not copy; instead, return the length of what the result
would have been. */
static YYSIZE_T
yytnamerr (char *yyres, const char *yystr)
{
if (*yystr == '"')
{
YYSIZE_T yyn = 0;
char const *yyp = yystr;
for (;;)
switch (*++yyp)
{
case '\'':
case ',':
goto do_not_strip_quotes;
case '\\':
if (*++yyp != '\\')
goto do_not_strip_quotes;
/* Fall through. */
default:
if (yyres)
yyres[yyn] = *yyp;
yyn++;
break;
case '"':
if (yyres)
yyres[yyn] = '\0';
return yyn;
}
do_not_strip_quotes: ;
}
if (! yyres)
return yystrlen (yystr);
return yystpcpy (yyres, yystr) - yyres;
}
# endif
/* Copy into *YYMSG, which is of size *YYMSG_ALLOC, an error message
about the unexpected token YYTOKEN for the state stack whose top is
YYSSP.
Return 0 if *YYMSG was successfully written. Return 1 if *YYMSG is
not large enough to hold the message. In that case, also set
*YYMSG_ALLOC to the required number of bytes. Return 2 if the
required number of bytes is too large to store. */
static int
yysyntax_error (YYSIZE_T *yymsg_alloc, char **yymsg,
yytype_int16 *yyssp, int yytoken)
{
YYSIZE_T yysize0 = yytnamerr (YY_NULLPTR, yytname[yytoken]);
YYSIZE_T yysize = yysize0;
enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
/* Internationalized format string. */
const char *yyformat = YY_NULLPTR;
/* Arguments of yyformat. */
char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
/* Number of reported tokens (one for the "unexpected", one per
"expected"). */
int yycount = 0;
/* There are many possibilities here to consider:
- If this state is a consistent state with a default action, then
the only way this function was invoked is if the default action
is an error action. In that case, don't check for expected
tokens because there are none.
- The only way there can be no lookahead present (in yychar) is if
this state is a consistent state with a default action. Thus,
detecting the absence of a lookahead is sufficient to determine
that there is no unexpected or expected token to report. In that
case, just report a simple "syntax error".
- Don't assume there isn't a lookahead just because this state is a
consistent state with a default action. There might have been a
previous inconsistent state, consistent state with a non-default
action, or user semantic action that manipulated yychar.
- Of course, the expected token list depends on states to have
correct lookahead information, and it depends on the parser not
to perform extra reductions after fetching a lookahead from the
scanner and before detecting a syntax error. Thus, state merging
(from LALR or IELR) and default reductions corrupt the expected
token list. However, the list is correct for canonical LR with
one exception: it will still contain any token that will not be
accepted due to an error action in a later state.
*/
if (yytoken != YYEMPTY)
{
int yyn = yypact[*yyssp];
yyarg[yycount++] = yytname[yytoken];
if (!yypact_value_is_default (yyn))
{
/* Start YYX at -YYN if negative to avoid negative indexes in
YYCHECK. In other words, skip the first -YYN actions for
this state because they are default actions. */
int yyxbegin = yyn < 0 ? -yyn : 0;
/* Stay within bounds of both yycheck and yytname. */
int yychecklim = YYLAST - yyn + 1;
int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
int yyx;
for (yyx = yyxbegin; yyx < yyxend; ++yyx)
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR
&& !yytable_value_is_error (yytable[yyx + yyn]))
{
if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
{
yycount = 1;
yysize = yysize0;
break;
}
yyarg[yycount++] = yytname[yyx];
{
YYSIZE_T yysize1 = yysize + yytnamerr (YY_NULLPTR, yytname[yyx]);
if (! (yysize <= yysize1
&& yysize1 <= YYSTACK_ALLOC_MAXIMUM))
return 2;
yysize = yysize1;
}
}
}
}
switch (yycount)
{
# define YYCASE_(N, S) \
case N: \
yyformat = S; \
break
YYCASE_(0, YY_("syntax error"));
YYCASE_(1, YY_("syntax error, unexpected %s"));
YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s"));
YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s"));
YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s"));
YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"));
# undef YYCASE_
}
{
YYSIZE_T yysize1 = yysize + yystrlen (yyformat);
if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM))
return 2;
yysize = yysize1;
}
if (*yymsg_alloc < yysize)
{
*yymsg_alloc = 2 * yysize;
if (! (yysize <= *yymsg_alloc
&& *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM))
*yymsg_alloc = YYSTACK_ALLOC_MAXIMUM;
return 1;
}
/* Avoid sprintf, as that infringes on the user's name space.
Don't have undefined behavior even if the translation
produced a string with the wrong number of "%s"s. */
{
char *yyp = *yymsg;
int yyi = 0;
while ((*yyp = *yyformat) != '\0')
if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount)
{
yyp += yytnamerr (yyp, yyarg[yyi++]);
yyformat += 2;
}
else
{
yyp++;
yyformat++;
}
}
return 0;
}
#endif /* YYERROR_VERBOSE */
/*-----------------------------------------------.
| Release the memory associated to this symbol. |
`-----------------------------------------------*/
static void
yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep)
{
YYUSE (yyvaluep);
if (!yymsg)
yymsg = "Deleting";
YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
YYUSE (yytype);
YY_IGNORE_MAYBE_UNINITIALIZED_END
}
/* The lookahead symbol. */
int yychar;
/* The semantic value of the lookahead symbol. */
YYSTYPE yylval;
/* Number of syntax errors so far. */
int yynerrs;
/*----------.
| yyparse. |
`----------*/
int
yyparse (void)
{
int yystate;
/* Number of tokens to shift before error messages enabled. */
int yyerrstatus;
/* The stacks and their tools:
'yyss': related to states.
'yyvs': related to semantic values.
Refer to the stacks through separate pointers, to allow yyoverflow
to reallocate them elsewhere. */
/* The state stack. */
yytype_int16 yyssa[YYINITDEPTH];
yytype_int16 *yyss;
yytype_int16 *yyssp;
/* The semantic value stack. */
YYSTYPE yyvsa[YYINITDEPTH];
YYSTYPE *yyvs;
YYSTYPE *yyvsp;
YYSIZE_T yystacksize;
int yyn;
int yyresult;
/* Lookahead token as an internal (translated) token number. */
int yytoken = 0;
/* The variables used to return semantic value and location from the
action routines. */
YYSTYPE yyval;
#if YYERROR_VERBOSE
/* Buffer for error messages, and its allocated size. */
char yymsgbuf[128];
char *yymsg = yymsgbuf;
YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
#endif
#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N))
/* The number of symbols on the RHS of the reduced rule.
Keep to zero when no symbol should be popped. */
int yylen = 0;
yyssp = yyss = yyssa;
yyvsp = yyvs = yyvsa;
yystacksize = YYINITDEPTH;
YYDPRINTF ((stderr, "Starting parse\n"));
yystate = 0;
yyerrstatus = 0;
yynerrs = 0;
yychar = YYEMPTY; /* Cause a token to be read. */
goto yysetstate;
/*------------------------------------------------------------.
| yynewstate -- Push a new state, which is found in yystate. |
`------------------------------------------------------------*/
yynewstate:
/* In all cases, when you get here, the value and location stacks
have just been pushed. So pushing a state here evens the stacks. */
yyssp++;
yysetstate:
*yyssp = yystate;
if (yyss + yystacksize - 1 <= yyssp)
{
/* Get the current used size of the three stacks, in elements. */
YYSIZE_T yysize = yyssp - yyss + 1;
#ifdef yyoverflow
{
/* Give user a chance to reallocate the stack. Use copies of
these so that the &'s don't force the real ones into
memory. */
YYSTYPE *yyvs1 = yyvs;
yytype_int16 *yyss1 = yyss;
/* Each stack pointer address is followed by the size of the
data in use in that stack, in bytes. This used to be a
conditional around just the two extra args, but that might
be undefined if yyoverflow is a macro. */
yyoverflow (YY_("memory exhausted"),
&yyss1, yysize * sizeof (*yyssp),
&yyvs1, yysize * sizeof (*yyvsp),
&yystacksize);
yyss = yyss1;
yyvs = yyvs1;
}
#else /* no yyoverflow */
# ifndef YYSTACK_RELOCATE
goto yyexhaustedlab;
# else
/* Extend the stack our own way. */
if (YYMAXDEPTH <= yystacksize)
goto yyexhaustedlab;
yystacksize *= 2;
if (YYMAXDEPTH < yystacksize)
yystacksize = YYMAXDEPTH;
{
yytype_int16 *yyss1 = yyss;
union yyalloc *yyptr =
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
if (! yyptr)
goto yyexhaustedlab;
YYSTACK_RELOCATE (yyss_alloc, yyss);
YYSTACK_RELOCATE (yyvs_alloc, yyvs);
# undef YYSTACK_RELOCATE
if (yyss1 != yyssa)
YYSTACK_FREE (yyss1);
}
# endif
#endif /* no yyoverflow */
yyssp = yyss + yysize - 1;
yyvsp = yyvs + yysize - 1;
YYDPRINTF ((stderr, "Stack size increased to %lu\n",
(unsigned long int) yystacksize));
if (yyss + yystacksize - 1 <= yyssp)
YYABORT;
}
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
if (yystate == YYFINAL)
YYACCEPT;
goto yybackup;
/*-----------.
| yybackup. |
`-----------*/
yybackup:
/* Do appropriate processing given the current state. Read a
lookahead token if we need one and don't already have one. */
/* First try to decide what to do without reference to lookahead token. */
yyn = yypact[yystate];
if (yypact_value_is_default (yyn))
goto yydefault;
/* Not known => get a lookahead token if don't already have one. */
/* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */
if (yychar == YYEMPTY)
{
YYDPRINTF ((stderr, "Reading a token: "));
yychar = yylex ();
}
if (yychar <= YYEOF)
{
yychar = yytoken = YYEOF;
YYDPRINTF ((stderr, "Now at end of input.\n"));
}
else
{
yytoken = YYTRANSLATE (yychar);
YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
}
/* If the proper action on seeing token YYTOKEN is to reduce or to
detect an error, take that action. */
yyn += yytoken;
if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
goto yydefault;
yyn = yytable[yyn];
if (yyn <= 0)
{
if (yytable_value_is_error (yyn))
goto yyerrlab;
yyn = -yyn;
goto yyreduce;
}
/* Count tokens shifted since error; after three, turn off error
status. */
if (yyerrstatus)
yyerrstatus--;
/* Shift the lookahead token. */
YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
/* Discard the shifted token. */
yychar = YYEMPTY;
yystate = yyn;
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
*++yyvsp = yylval;
YY_IGNORE_MAYBE_UNINITIALIZED_END
goto yynewstate;
/*-----------------------------------------------------------.
| yydefault -- do the default action for the current state. |
`-----------------------------------------------------------*/
yydefault:
yyn = yydefact[yystate];
if (yyn == 0)
goto yyerrlab;
goto yyreduce;
/*-----------------------------.
| yyreduce -- Do a reduction. |
`-----------------------------*/
yyreduce:
/* yyn is the number of a rule to reduce with. */
yylen = yyr2[yyn];
/* If YYLEN is nonzero, implement the default value of the action:
'$$ = $1'.
Otherwise, the following line sets YYVAL to garbage.
This behavior is undocumented and Bison
users should not rely upon it. Assigning to YYVAL
unconditionally makes the parser a bit smaller, and it avoids a
GCC warning that YYVAL may be used uninitialized. */
yyval = yyvsp[1-yylen];
YY_REDUCE_PRINT (yyn);
switch (yyn)
{
case 4:
#line 143 "deffilep.y" /* yacc.c:1646 */
{ def_image_name ((yyvsp[-1].id), (yyvsp[0].vma), 0); }
#line 1484 "deffilep.c" /* yacc.c:1646 */
break;
case 5:
#line 144 "deffilep.y" /* yacc.c:1646 */
{ def_image_name ((yyvsp[-1].id), (yyvsp[0].vma), 1); }
#line 1490 "deffilep.c" /* yacc.c:1646 */
break;
case 6:
#line 145 "deffilep.y" /* yacc.c:1646 */
{ def_description ((yyvsp[0].id));}
#line 1496 "deffilep.c" /* yacc.c:1646 */
break;
case 7:
#line 146 "deffilep.y" /* yacc.c:1646 */
{ def_stacksize ((yyvsp[-1].number), (yyvsp[0].number));}
#line 1502 "deffilep.c" /* yacc.c:1646 */
break;
case 8:
#line 147 "deffilep.y" /* yacc.c:1646 */
{ def_heapsize ((yyvsp[-1].number), (yyvsp[0].number));}
#line 1508 "deffilep.c" /* yacc.c:1646 */
break;
case 9:
#line 148 "deffilep.y" /* yacc.c:1646 */
{ def_section ("CODE", (yyvsp[0].number));}
#line 1514 "deffilep.c" /* yacc.c:1646 */
break;
case 10:
#line 149 "deffilep.y" /* yacc.c:1646 */
{ def_section ("DATA", (yyvsp[0].number));}
#line 1520 "deffilep.c" /* yacc.c:1646 */
break;
case 14:
#line 153 "deffilep.y" /* yacc.c:1646 */
{ def_version ((yyvsp[0].number), 0);}
#line 1526 "deffilep.c" /* yacc.c:1646 */
break;
case 15:
#line 154 "deffilep.y" /* yacc.c:1646 */
{ def_version ((yyvsp[-2].number), (yyvsp[0].number));}
#line 1532 "deffilep.c" /* yacc.c:1646 */
break;
case 16:
#line 155 "deffilep.y" /* yacc.c:1646 */
{ def_directive ((yyvsp[0].id));}
#line 1538 "deffilep.c" /* yacc.c:1646 */
break;
case 17:
#line 156 "deffilep.y" /* yacc.c:1646 */
{ def_aligncomm ((yyvsp[-2].id), (yyvsp[0].number));}
#line 1544 "deffilep.c" /* yacc.c:1646 */
break;
case 21:
#line 171 "deffilep.y" /* yacc.c:1646 */
{ def_exports ((yyvsp[-6].id), (yyvsp[-5].id), (yyvsp[-4].number), (yyvsp[-2].number), (yyvsp[0].id)); }
#line 1550 "deffilep.c" /* yacc.c:1646 */
break;
case 22:
#line 177 "deffilep.y" /* yacc.c:1646 */
{ (yyval.number) = (yyvsp[-2].number) | (yyvsp[0].number); }
#line 1556 "deffilep.c" /* yacc.c:1646 */
break;
case 23:
#line 178 "deffilep.y" /* yacc.c:1646 */
{ (yyval.number) = 0; }
#line 1562 "deffilep.c" /* yacc.c:1646 */
break;
case 24:
#line 181 "deffilep.y" /* yacc.c:1646 */
{ (yyval.number) = 1; }
#line 1568 "deffilep.c" /* yacc.c:1646 */
break;
case 25:
#line 182 "deffilep.y" /* yacc.c:1646 */
{ (yyval.number) = 1; }
#line 1574 "deffilep.c" /* yacc.c:1646 */
break;
case 26:
#line 183 "deffilep.y" /* yacc.c:1646 */
{ (yyval.number) = 2; }
#line 1580 "deffilep.c" /* yacc.c:1646 */
break;
case 27:
#line 184 "deffilep.y" /* yacc.c:1646 */
{ (yyval.number) = 2; }
#line 1586 "deffilep.c" /* yacc.c:1646 */
break;
case 28:
#line 185 "deffilep.y" /* yacc.c:1646 */
{ (yyval.number) = 4; }
#line 1592 "deffilep.c" /* yacc.c:1646 */
break;
case 29:
#line 186 "deffilep.y" /* yacc.c:1646 */
{ (yyval.number) = 4; }
#line 1598 "deffilep.c" /* yacc.c:1646 */
break;
case 30:
#line 187 "deffilep.y" /* yacc.c:1646 */
{ (yyval.number) = 8; }
#line 1604 "deffilep.c" /* yacc.c:1646 */
break;
case 31:
#line 188 "deffilep.y" /* yacc.c:1646 */
{ (yyval.number) = 8; }
#line 1610 "deffilep.c" /* yacc.c:1646 */
break;
case 34:
#line 197 "deffilep.y" /* yacc.c:1646 */
{ def_import ((yyvsp[-7].id), (yyvsp[-5].id), (yyvsp[-3].id), (yyvsp[-1].id), -1, (yyvsp[0].id)); }
#line 1616 "deffilep.c" /* yacc.c:1646 */
break;
case 35:
#line 199 "deffilep.y" /* yacc.c:1646 */
{ def_import ((yyvsp[-7].id), (yyvsp[-5].id), (yyvsp[-3].id), 0, (yyvsp[-1].number), (yyvsp[0].id)); }
#line 1622 "deffilep.c" /* yacc.c:1646 */
break;
case 36:
#line 201 "deffilep.y" /* yacc.c:1646 */
{ def_import ((yyvsp[-5].id), (yyvsp[-3].id), 0, (yyvsp[-1].id), -1, (yyvsp[0].id)); }
#line 1628 "deffilep.c" /* yacc.c:1646 */
break;
case 37:
#line 203 "deffilep.y" /* yacc.c:1646 */
{ def_import ((yyvsp[-5].id), (yyvsp[-3].id), 0, 0, (yyvsp[-1].number), (yyvsp[0].id)); }
#line 1634 "deffilep.c" /* yacc.c:1646 */
break;
case 38:
#line 205 "deffilep.y" /* yacc.c:1646 */
{ def_import( 0, (yyvsp[-5].id), (yyvsp[-3].id), (yyvsp[-1].id), -1, (yyvsp[0].id)); }
#line 1640 "deffilep.c" /* yacc.c:1646 */
break;
case 39:
#line 207 "deffilep.y" /* yacc.c:1646 */
{ def_import ( 0, (yyvsp[-3].id), 0, (yyvsp[-1].id), -1, (yyvsp[0].id)); }
#line 1646 "deffilep.c" /* yacc.c:1646 */
break;
case 42:
#line 216 "deffilep.y" /* yacc.c:1646 */
{ def_section ((yyvsp[-1].id), (yyvsp[0].number));}
#line 1652 "deffilep.c" /* yacc.c:1646 */
break;
case 43:
#line 217 "deffilep.y" /* yacc.c:1646 */
{ def_section_alt ((yyvsp[-1].id), (yyvsp[0].id));}
#line 1658 "deffilep.c" /* yacc.c:1646 */
break;
case 44:
#line 221 "deffilep.y" /* yacc.c:1646 */
{ (yyval.number) = (yyvsp[-2].number) | (yyvsp[0].number); }
#line 1664 "deffilep.c" /* yacc.c:1646 */
break;
case 45:
#line 222 "deffilep.y" /* yacc.c:1646 */
{ (yyval.number) = (yyvsp[0].number); }
#line 1670 "deffilep.c" /* yacc.c:1646 */
break;
case 48:
#line 229 "deffilep.y" /* yacc.c:1646 */
{ (yyval.number)=(yyvsp[0].number);}
#line 1676 "deffilep.c" /* yacc.c:1646 */
break;
case 49:
#line 230 "deffilep.y" /* yacc.c:1646 */
{ (yyval.number)=-1;}
#line 1682 "deffilep.c" /* yacc.c:1646 */
break;
case 50:
#line 234 "deffilep.y" /* yacc.c:1646 */
{ (yyval.number) = 1;}
#line 1688 "deffilep.c" /* yacc.c:1646 */
break;
case 51:
#line 235 "deffilep.y" /* yacc.c:1646 */
{ (yyval.number) = 2;}
#line 1694 "deffilep.c" /* yacc.c:1646 */
break;
case 52:
#line 236 "deffilep.y" /* yacc.c:1646 */
{ (yyval.number)=4;}
#line 1700 "deffilep.c" /* yacc.c:1646 */
break;
case 53:
#line 237 "deffilep.y" /* yacc.c:1646 */
{ (yyval.number)=8;}
#line 1706 "deffilep.c" /* yacc.c:1646 */
break;
case 54:
#line 241 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id_const) = "BASE"; }
#line 1712 "deffilep.c" /* yacc.c:1646 */
break;
case 55:
#line 242 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id_const) = "CODE"; }
#line 1718 "deffilep.c" /* yacc.c:1646 */
break;
case 56:
#line 243 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id_const) = "CONSTANT"; }
#line 1724 "deffilep.c" /* yacc.c:1646 */
break;
case 57:
#line 244 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id_const) = "constant"; }
#line 1730 "deffilep.c" /* yacc.c:1646 */
break;
case 58:
#line 245 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id_const) = "DATA"; }
#line 1736 "deffilep.c" /* yacc.c:1646 */
break;
case 59:
#line 246 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id_const) = "data"; }
#line 1742 "deffilep.c" /* yacc.c:1646 */
break;
case 60:
#line 247 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id_const) = "DESCRIPTION"; }
#line 1748 "deffilep.c" /* yacc.c:1646 */
break;
case 61:
#line 248 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id_const) = "DIRECTIVE"; }
#line 1754 "deffilep.c" /* yacc.c:1646 */
break;
case 62:
#line 249 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id_const) = "EXECUTE"; }
#line 1760 "deffilep.c" /* yacc.c:1646 */
break;
case 63:
#line 250 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id_const) = "EXPORTS"; }
#line 1766 "deffilep.c" /* yacc.c:1646 */
break;
case 64:
#line 251 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id_const) = "HEAPSIZE"; }
#line 1772 "deffilep.c" /* yacc.c:1646 */
break;
case 65:
#line 252 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id_const) = "IMPORTS"; }
#line 1778 "deffilep.c" /* yacc.c:1646 */
break;
case 66:
#line 259 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id_const) = "NAME"; }
#line 1784 "deffilep.c" /* yacc.c:1646 */
break;
case 67:
#line 260 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id_const) = "NONAME"; }
#line 1790 "deffilep.c" /* yacc.c:1646 */
break;
case 68:
#line 261 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id_const) = "noname"; }
#line 1796 "deffilep.c" /* yacc.c:1646 */
break;
case 69:
#line 262 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id_const) = "PRIVATE"; }
#line 1802 "deffilep.c" /* yacc.c:1646 */
break;
case 70:
#line 263 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id_const) = "private"; }
#line 1808 "deffilep.c" /* yacc.c:1646 */
break;
case 71:
#line 264 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id_const) = "READ"; }
#line 1814 "deffilep.c" /* yacc.c:1646 */
break;
case 72:
#line 265 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id_const) = "SHARED"; }
#line 1820 "deffilep.c" /* yacc.c:1646 */
break;
case 73:
#line 266 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id_const) = "STACKSIZE"; }
#line 1826 "deffilep.c" /* yacc.c:1646 */
break;
case 74:
#line 267 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id_const) = "VERSION"; }
#line 1832 "deffilep.c" /* yacc.c:1646 */
break;
case 75:
#line 268 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id_const) = "WRITE"; }
#line 1838 "deffilep.c" /* yacc.c:1646 */
break;
case 76:
#line 271 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id) = (yyvsp[0].id); }
#line 1844 "deffilep.c" /* yacc.c:1646 */
break;
case 77:
#line 273 "deffilep.y" /* yacc.c:1646 */
{
char *name = xmalloc (strlen ((yyvsp[0].id_const)) + 2);
sprintf (name, ".%s", (yyvsp[0].id_const));
(yyval.id) = name;
}
#line 1854 "deffilep.c" /* yacc.c:1646 */
break;
case 78:
#line 279 "deffilep.y" /* yacc.c:1646 */
{
char *name = def_pool_alloc (strlen ((yyvsp[0].id)) + 2);
sprintf (name, ".%s", (yyvsp[0].id));
(yyval.id) = name;
}
#line 1864 "deffilep.c" /* yacc.c:1646 */
break;
case 79:
#line 285 "deffilep.y" /* yacc.c:1646 */
{
char *name = def_pool_alloc (strlen ((yyvsp[-2].id_const)) + 1 + strlen ((yyvsp[0].id)) + 1);
sprintf (name, "%s.%s", (yyvsp[-2].id_const), (yyvsp[0].id));
(yyval.id) = name;
}
#line 1874 "deffilep.c" /* yacc.c:1646 */
break;
case 80:
#line 291 "deffilep.y" /* yacc.c:1646 */
{
char *name = def_pool_alloc (strlen ((yyvsp[-2].id)) + 1 + strlen ((yyvsp[0].id)) + 1);
sprintf (name, "%s.%s", (yyvsp[-2].id), (yyvsp[0].id));
(yyval.id) = name;
}
#line 1884 "deffilep.c" /* yacc.c:1646 */
break;
case 81:
#line 298 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id) = (yyvsp[0].id); }
#line 1890 "deffilep.c" /* yacc.c:1646 */
break;
case 82:
#line 299 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id) = ""; }
#line 1896 "deffilep.c" /* yacc.c:1646 */
break;
case 83:
#line 302 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id) = (yyvsp[0].id); }
#line 1902 "deffilep.c" /* yacc.c:1646 */
break;
case 84:
#line 303 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id) = 0; }
#line 1908 "deffilep.c" /* yacc.c:1646 */
break;
case 85:
#line 307 "deffilep.y" /* yacc.c:1646 */
{ (yyval.number) = (yyvsp[0].number);}
#line 1914 "deffilep.c" /* yacc.c:1646 */
break;
case 86:
#line 308 "deffilep.y" /* yacc.c:1646 */
{ (yyval.number) = -1;}
#line 1920 "deffilep.c" /* yacc.c:1646 */
break;
case 87:
#line 312 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id) = (yyvsp[0].id); }
#line 1926 "deffilep.c" /* yacc.c:1646 */
break;
case 88:
#line 313 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id) = 0; }
#line 1932 "deffilep.c" /* yacc.c:1646 */
break;
case 89:
#line 316 "deffilep.y" /* yacc.c:1646 */
{ (yyval.vma) = (yyvsp[0].vma);}
#line 1938 "deffilep.c" /* yacc.c:1646 */
break;
case 90:
#line 317 "deffilep.y" /* yacc.c:1646 */
{ (yyval.vma) = (bfd_vma) -1;}
#line 1944 "deffilep.c" /* yacc.c:1646 */
break;
case 91:
#line 320 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id) = (yyvsp[0].id); }
#line 1950 "deffilep.c" /* yacc.c:1646 */
break;
case 92:
#line 322 "deffilep.y" /* yacc.c:1646 */
{
char *id = def_pool_alloc (strlen ((yyvsp[0].id)) + 2);
sprintf (id, ".%s", (yyvsp[0].id));
(yyval.id) = id;
}
#line 1960 "deffilep.c" /* yacc.c:1646 */
break;
case 93:
#line 328 "deffilep.y" /* yacc.c:1646 */
{
char *id = def_pool_alloc (strlen ((yyvsp[-3].id)) + 1 + strlen ((yyvsp[-1].digits)) + strlen ((yyvsp[0].id)) + 1);
sprintf (id, "%s.%s%s", (yyvsp[-3].id), (yyvsp[-1].digits), (yyvsp[0].id));
(yyval.id) = id;
}
#line 1970 "deffilep.c" /* yacc.c:1646 */
break;
case 94:
#line 335 "deffilep.y" /* yacc.c:1646 */
{ (yyval.digits) = (yyvsp[0].digits); }
#line 1976 "deffilep.c" /* yacc.c:1646 */
break;
case 95:
#line 336 "deffilep.y" /* yacc.c:1646 */
{ (yyval.digits) = ""; }
#line 1982 "deffilep.c" /* yacc.c:1646 */
break;
case 96:
#line 339 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id) = (yyvsp[0].id); }
#line 1988 "deffilep.c" /* yacc.c:1646 */
break;
case 97:
#line 340 "deffilep.y" /* yacc.c:1646 */
{ (yyval.id) = ""; }
#line 1994 "deffilep.c" /* yacc.c:1646 */
break;
case 98:
#line 343 "deffilep.y" /* yacc.c:1646 */
{ (yyval.number) = strtoul ((yyvsp[0].digits), 0, 0); }
#line 2000 "deffilep.c" /* yacc.c:1646 */
break;
case 99:
#line 345 "deffilep.y" /* yacc.c:1646 */
{ (yyval.vma) = (bfd_vma) strtoull ((yyvsp[0].digits), 0, 0); }
#line 2006 "deffilep.c" /* yacc.c:1646 */
break;
#line 2010 "deffilep.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 347 "deffilep.y" /* yacc.c:1906 */
/*****************************************************************************
API
*****************************************************************************/
static FILE *the_file;
static const char *def_filename;
static int linenumber;
static def_file *def;
static int saw_newline;
struct directive
{
struct directive *next;
char *name;
int len;
};
static struct directive *directives = 0;
def_file *
def_file_empty (void)
{
def_file *rv = xmalloc (sizeof (def_file));
memset (rv, 0, sizeof (def_file));
rv->is_dll = -1;
rv->base_address = (bfd_vma) -1;
rv->stack_reserve = rv->stack_commit = -1;
rv->heap_reserve = rv->heap_commit = -1;
rv->version_major = rv->version_minor = -1;
return rv;
}
def_file *
def_file_parse (const char *filename, def_file *add_to)
{
struct directive *d;
the_file = fopen (filename, "r");
def_filename = filename;
linenumber = 1;
if (!the_file)
{
perror (filename);
return 0;
}
if (add_to)
{
def = add_to;
}
else
{
def = def_file_empty ();
}
saw_newline = 1;
if (def_parse ())
{
def_file_free (def);
fclose (the_file);
def_pool_free ();
return 0;
}
fclose (the_file);
while ((d = directives) != NULL)
{
#if TRACE
printf ("Adding directive %08x `%s'\n", d->name, d->name);
#endif
def_file_add_directive (def, d->name, d->len);
directives = d->next;
free (d->name);
free (d);
}
def_pool_free ();
return def;
}
void
def_file_free (def_file *fdef)
{
int i;
if (!fdef)
return;
if (fdef->name)
free (fdef->name);
if (fdef->description)
free (fdef->description);
if (fdef->section_defs)
{
for (i = 0; i < fdef->num_section_defs; i++)
{
if (fdef->section_defs[i].name)
free (fdef->section_defs[i].name);
if (fdef->section_defs[i].class)
free (fdef->section_defs[i].class);
}
free (fdef->section_defs);
}
if (fdef->exports)
{
for (i = 0; i < fdef->num_exports; i++)
{
if (fdef->exports[i].internal_name
&& fdef->exports[i].internal_name != fdef->exports[i].name)
free (fdef->exports[i].internal_name);
if (fdef->exports[i].name)
free (fdef->exports[i].name);
if (fdef->exports[i].its_name)
free (fdef->exports[i].its_name);
}
free (fdef->exports);
}
if (fdef->imports)
{
for (i = 0; i < fdef->num_imports; i++)
{
if (fdef->imports[i].internal_name
&& fdef->imports[i].internal_name != fdef->imports[i].name)
free (fdef->imports[i].internal_name);
if (fdef->imports[i].name)
free (fdef->imports[i].name);
if (fdef->imports[i].its_name)
free (fdef->imports[i].its_name);
}
free (fdef->imports);
}
while (fdef->modules)
{
def_file_module *m = fdef->modules;
fdef->modules = fdef->modules->next;
free (m);
}
while (fdef->aligncomms)
{
def_file_aligncomm *c = fdef->aligncomms;
fdef->aligncomms = fdef->aligncomms->next;
free (c->symbol_name);
free (c);
}
free (fdef);
}
#ifdef DEF_FILE_PRINT
void
def_file_print (FILE *file, def_file *fdef)
{
int i;
fprintf (file, ">>>> def_file at 0x%08x\n", fdef);
if (fdef->name)
fprintf (file, " name: %s\n", fdef->name ? fdef->name : "(unspecified)");
if (fdef->is_dll != -1)
fprintf (file, " is dll: %s\n", fdef->is_dll ? "yes" : "no");
if (fdef->base_address != (bfd_vma) -1)
{
fprintf (file, " base address: 0x");
fprintf_vma (file, fdef->base_address);
fprintf (file, "\n");
}
if (fdef->description)
fprintf (file, " description: `%s'\n", fdef->description);
if (fdef->stack_reserve != -1)
fprintf (file, " stack reserve: 0x%08x\n", fdef->stack_reserve);
if (fdef->stack_commit != -1)
fprintf (file, " stack commit: 0x%08x\n", fdef->stack_commit);
if (fdef->heap_reserve != -1)
fprintf (file, " heap reserve: 0x%08x\n", fdef->heap_reserve);
if (fdef->heap_commit != -1)
fprintf (file, " heap commit: 0x%08x\n", fdef->heap_commit);
if (fdef->num_section_defs > 0)
{
fprintf (file, " section defs:\n");
for (i = 0; i < fdef->num_section_defs; i++)
{
fprintf (file, " name: `%s', class: `%s', flags:",
fdef->section_defs[i].name, fdef->section_defs[i].class);
if (fdef->section_defs[i].flag_read)
fprintf (file, " R");
if (fdef->section_defs[i].flag_write)
fprintf (file, " W");
if (fdef->section_defs[i].flag_execute)
fprintf (file, " X");
if (fdef->section_defs[i].flag_shared)
fprintf (file, " S");
fprintf (file, "\n");
}
}
if (fdef->num_exports > 0)
{
fprintf (file, " exports:\n");
for (i = 0; i < fdef->num_exports; i++)
{
fprintf (file, " name: `%s', int: `%s', ordinal: %d, flags:",
fdef->exports[i].name, fdef->exports[i].internal_name,
fdef->exports[i].ordinal);
if (fdef->exports[i].flag_private)
fprintf (file, " P");
if (fdef->exports[i].flag_constant)
fprintf (file, " C");
if (fdef->exports[i].flag_noname)
fprintf (file, " N");
if (fdef->exports[i].flag_data)
fprintf (file, " D");
fprintf (file, "\n");
}
}
if (fdef->num_imports > 0)
{
fprintf (file, " imports:\n");
for (i = 0; i < fdef->num_imports; i++)
{
fprintf (file, " int: %s, from: `%s', name: `%s', ordinal: %d\n",
fdef->imports[i].internal_name,
fdef->imports[i].module,
fdef->imports[i].name,
fdef->imports[i].ordinal);
}
}
if (fdef->version_major != -1)
fprintf (file, " version: %d.%d\n", fdef->version_major, fdef->version_minor);
fprintf (file, "<<<< def_file at 0x%08x\n", fdef);
}
#endif
/* Helper routine to check for identity of string pointers,
which might be NULL. */
static int
are_names_equal (const char *s1, const char *s2)
{
if (!s1 && !s2)
return 0;
if (!s1 || !s2)
return (!s1 ? -1 : 1);
return strcmp (s1, s2);
}
static int
cmp_export_elem (const def_file_export *e, const char *ex_name,
const char *in_name, const char *its_name,
int ord)
{
int r;
if ((r = are_names_equal (ex_name, e->name)) != 0)
return r;
if ((r = are_names_equal (in_name, e->internal_name)) != 0)
return r;
if ((r = are_names_equal (its_name, e->its_name)) != 0)
return r;
return (ord - e->ordinal);
}
/* Search the position of the identical element, or returns the position
of the next higher element. If last valid element is smaller, then MAX
is returned. */
static int
find_export_in_list (def_file_export *b, int max,
const char *ex_name, const char *in_name,
const char *its_name, int ord, int *is_ident)
{
int e, l, r, p;
*is_ident = 0;
if (!max)
return 0;
if ((e = cmp_export_elem (b, ex_name, in_name, its_name, ord)) <= 0)
{
if (!e)
*is_ident = 1;
return 0;
}
if (max == 1)
return 1;
if ((e = cmp_export_elem (b + (max - 1), ex_name, in_name, its_name, ord)) > 0)
return max;
else if (!e || max == 2)
{
if (!e)
*is_ident = 1;
return max - 1;
}
l = 0; r = max - 1;
while (l < r)
{
p = (l + r) / 2;
e = cmp_export_elem (b + p, ex_name, in_name, its_name, ord);
if (!e)
{
*is_ident = 1;
return p;
}
else if (e < 0)
r = p - 1;
else if (e > 0)
l = p + 1;
}
if ((e = cmp_export_elem (b + l, ex_name, in_name, its_name, ord)) > 0)
++l;
else if (!e)
*is_ident = 1;
return l;
}
def_file_export *
def_file_add_export (def_file *fdef,
const char *external_name,
const char *internal_name,
int ordinal,
const char *its_name,
int *is_dup)
{
def_file_export *e;
int pos;
int max_exports = ROUND_UP(fdef->num_exports, 32);
if (internal_name && !external_name)
external_name = internal_name;
if (external_name && !internal_name)
internal_name = external_name;
/* We need to avoid duplicates. */
*is_dup = 0;
pos = find_export_in_list (fdef->exports, fdef->num_exports,
external_name, internal_name,
its_name, ordinal, is_dup);
if (*is_dup != 0)
return (fdef->exports + pos);
if (fdef->num_exports >= max_exports)
{
max_exports = ROUND_UP(fdef->num_exports + 1, 32);
if (fdef->exports)
fdef->exports = xrealloc (fdef->exports,
max_exports * sizeof (def_file_export));
else
fdef->exports = xmalloc (max_exports * sizeof (def_file_export));
}
e = fdef->exports + pos;
if (pos != fdef->num_exports)
memmove (&e[1], e, (sizeof (def_file_export) * (fdef->num_exports - pos)));
memset (e, 0, sizeof (def_file_export));
e->name = xstrdup (external_name);
e->internal_name = xstrdup (internal_name);
e->its_name = (its_name ? xstrdup (its_name) : NULL);
e->ordinal = ordinal;
fdef->num_exports++;
return e;
}
def_file_module *
def_get_module (def_file *fdef, const char *name)
{
def_file_module *s;
for (s = fdef->modules; s; s = s->next)
if (strcmp (s->name, name) == 0)
return s;
return NULL;
}
static def_file_module *
def_stash_module (def_file *fdef, const char *name)
{
def_file_module *s;
if ((s = def_get_module (fdef, name)) != NULL)
return s;
s = xmalloc (sizeof (def_file_module) + strlen (name));
s->next = fdef->modules;
fdef->modules = s;
s->user_data = 0;
strcpy (s->name, name);
return s;
}
static int
cmp_import_elem (const def_file_import *e, const char *ex_name,
const char *in_name, const char *module,
int ord)
{
int r;
if ((r = are_names_equal (module, (e->module ? e->module->name : NULL))))
return r;
if ((r = are_names_equal (ex_name, e->name)) != 0)
return r;
if ((r = are_names_equal (in_name, e->internal_name)) != 0)
return r;
if (ord != e->ordinal)
return (ord < e->ordinal ? -1 : 1);
return 0;
}
/* Search the position of the identical element, or returns the position
of the next higher element. If last valid element is smaller, then MAX
is returned. */
static int
find_import_in_list (def_file_import *b, int max,
const char *ex_name, const char *in_name,
const char *module, int ord, int *is_ident)
{
int e, l, r, p;
*is_ident = 0;
if (!max)
return 0;
if ((e = cmp_import_elem (b, ex_name, in_name, module, ord)) <= 0)
{
if (!e)
*is_ident = 1;
return 0;
}
if (max == 1)
return 1;
if ((e = cmp_import_elem (b + (max - 1), ex_name, in_name, module, ord)) > 0)
return max;
else if (!e || max == 2)
{
if (!e)
*is_ident = 1;
return max - 1;
}
l = 0; r = max - 1;
while (l < r)
{
p = (l + r) / 2;
e = cmp_import_elem (b + p, ex_name, in_name, module, ord);
if (!e)
{
*is_ident = 1;
return p;
}
else if (e < 0)
r = p - 1;
else if (e > 0)
l = p + 1;
}
if ((e = cmp_import_elem (b + l, ex_name, in_name, module, ord)) > 0)
++l;
else if (!e)
*is_ident = 1;
return l;
}
static void
fill_in_import (def_file_import *i,
const char *name,
def_file_module *module,
int ordinal,
const char *internal_name,
const char *its_name)
{
memset (i, 0, sizeof (def_file_import));
if (name)
i->name = xstrdup (name);
i->module = module;
i->ordinal = ordinal;
if (internal_name)
i->internal_name = xstrdup (internal_name);
else
i->internal_name = i->name;
i->its_name = (its_name ? xstrdup (its_name) : NULL);
}
def_file_import *
def_file_add_import (def_file *fdef,
const char *name,
const char *module,
int ordinal,
const char *internal_name,
const char *its_name,
int *is_dup)
{
def_file_import *i;
int pos;
int max_imports = ROUND_UP (fdef->num_imports, 16);
/* We need to avoid here duplicates. */
*is_dup = 0;
pos = find_import_in_list (fdef->imports, fdef->num_imports,
name,
(!internal_name ? name : internal_name),
module, ordinal, is_dup);
if (*is_dup != 0)
return fdef->imports + pos;
if (fdef->num_imports >= max_imports)
{
max_imports = ROUND_UP (fdef->num_imports+1, 16);
if (fdef->imports)
fdef->imports = xrealloc (fdef->imports,
max_imports * sizeof (def_file_import));
else
fdef->imports = xmalloc (max_imports * sizeof (def_file_import));
}
i = fdef->imports + pos;
if (pos != fdef->num_imports)
memmove (i + 1, i, sizeof (def_file_import) * (fdef->num_imports - pos));
fill_in_import (i, name, def_stash_module (fdef, module), ordinal,
internal_name, its_name);
fdef->num_imports++;
return i;
}
int
def_file_add_import_from (def_file *fdef,
int num_imports,
const char *name,
const char *module,
int ordinal,
const char *internal_name,
const char *its_name ATTRIBUTE_UNUSED)
{
def_file_import *i;
int is_dup;
int pos;
int max_imports = ROUND_UP (fdef->num_imports, 16);
/* We need to avoid here duplicates. */
is_dup = 0;
pos = find_import_in_list (fdef->imports, fdef->num_imports,
name, internal_name ? internal_name : name,
module, ordinal, &is_dup);
if (is_dup != 0)
return -1;
if (fdef->imports && pos != fdef->num_imports)
{
i = fdef->imports + pos;
if (i->module && strcmp (i->module->name, module) == 0)
return -1;
}
if (fdef->num_imports + num_imports - 1 >= max_imports)
{
max_imports = ROUND_UP (fdef->num_imports + num_imports, 16);
if (fdef->imports)
fdef->imports = xrealloc (fdef->imports,
max_imports * sizeof (def_file_import));
else
fdef->imports = xmalloc (max_imports * sizeof (def_file_import));
}
i = fdef->imports + pos;
if (pos != fdef->num_imports)
memmove (i + num_imports, i,
sizeof (def_file_import) * (fdef->num_imports - pos));
return pos;
}
def_file_import *
def_file_add_import_at (def_file *fdef,
int pos,
const char *name,
const char *module,
int ordinal,
const char *internal_name,
const char *its_name)
{
def_file_import *i = fdef->imports + pos;
fill_in_import (i, name, def_stash_module (fdef, module), ordinal,
internal_name, its_name);
fdef->num_imports++;
return i;
}
struct
{
char *param;
int token;
}
diropts[] =
{
{ "-heap", HEAPSIZE },
{ "-stack", STACKSIZE_K },
{ "-attr", SECTIONS },
{ "-export", EXPORTS },
{ "-aligncomm", ALIGNCOMM },
{ 0, 0 }
};
void
def_file_add_directive (def_file *my_def, const char *param, int len)
{
def_file *save_def = def;
const char *pend = param + len;
char * tend = (char *) param;
int i;
def = my_def;
while (param < pend)
{
while (param < pend
&& (ISSPACE (*param) || *param == '\n' || *param == 0))
param++;
if (param == pend)
break;
/* Scan forward until we encounter any of:
- the end of the buffer
- the start of a new option
- a newline separating options
- a NUL separating options. */
for (tend = (char *) (param + 1);
(tend < pend
&& !(ISSPACE (tend[-1]) && *tend == '-')
&& *tend != '\n' && *tend != 0);
tend++)
;
for (i = 0; diropts[i].param; i++)
{
len = strlen (diropts[i].param);
if (tend - param >= len
&& strncmp (param, diropts[i].param, len) == 0
&& (param[len] == ':' || param[len] == ' '))
{
lex_parse_string_end = tend;
lex_parse_string = param + len + 1;
lex_forced_token = diropts[i].token;
saw_newline = 0;
if (def_parse ())
continue;
break;
}
}
if (!diropts[i].param)
{
if (tend < pend)
{
char saved;
saved = * tend;
* tend = 0;
/* xgettext:c-format */
einfo (_("Warning: .drectve `%s' unrecognized\n"), param);
* tend = saved;
}
else
{
einfo (_("Warning: corrupt .drectve at end of def file\n"));
}
}
lex_parse_string = 0;
param = tend;
}
def = save_def;
def_pool_free ();
}
/* Parser Callbacks. */
static void
def_image_name (const char *name, bfd_vma base, int is_dll)
{
/* If a LIBRARY or NAME statement is specified without a name, there is nothing
to do here. We retain the output filename specified on command line. */
if (*name)
{
const char* image_name = lbasename (name);
if (image_name != name)
einfo ("%s:%d: Warning: path components stripped from %s, '%s'\n",
def_filename, linenumber, is_dll ? "LIBRARY" : "NAME",
name);
if (def->name)
free (def->name);
/* Append the default suffix, if none specified. */
if (strchr (image_name, '.') == 0)
{
const char * suffix = is_dll ? ".dll" : ".exe";
def->name = xmalloc (strlen (image_name) + strlen (suffix) + 1);
sprintf (def->name, "%s%s", image_name, suffix);
}
else
def->name = xstrdup (image_name);
}
/* Honor a BASE address statement, even if LIBRARY string is empty. */
def->base_address = base;
def->is_dll = is_dll;
}
static void
def_description (const char *text)
{
int len = def->description ? strlen (def->description) : 0;
len += strlen (text) + 1;
if (def->description)
{
def->description = xrealloc (def->description, len);
strcat (def->description, text);
}
else
{
def->description = xmalloc (len);
strcpy (def->description, text);
}
}
static void
def_stacksize (int reserve, int commit)
{
def->stack_reserve = reserve;
def->stack_commit = commit;
}
static void
def_heapsize (int reserve, int commit)
{
def->heap_reserve = reserve;
def->heap_commit = commit;
}
static void
def_section (const char *name, int attr)
{
def_file_section *s;
int max_sections = ROUND_UP (def->num_section_defs, 4);
if (def->num_section_defs >= max_sections)
{
max_sections = ROUND_UP (def->num_section_defs+1, 4);
if (def->section_defs)
def->section_defs = xrealloc (def->section_defs,
max_sections * sizeof (def_file_import));
else
def->section_defs = xmalloc (max_sections * sizeof (def_file_import));
}
s = def->section_defs + def->num_section_defs;
memset (s, 0, sizeof (def_file_section));
s->name = xstrdup (name);
if (attr & 1)
s->flag_read = 1;
if (attr & 2)
s->flag_write = 1;
if (attr & 4)
s->flag_execute = 1;
if (attr & 8)
s->flag_shared = 1;
def->num_section_defs++;
}
static void
def_section_alt (const char *name, const char *attr)
{
int aval = 0;
for (; *attr; attr++)
{
switch (*attr)
{
case 'R':
case 'r':
aval |= 1;
break;
case 'W':
case 'w':
aval |= 2;
break;
case 'X':
case 'x':
aval |= 4;
break;
case 'S':
case 's':
aval |= 8;
break;
}
}
def_section (name, aval);
}
static void
def_exports (const char *external_name,
const char *internal_name,
int ordinal,
int flags,
const char *its_name)
{
def_file_export *dfe;
int is_dup = 0;
if (!internal_name && external_name)
internal_name = external_name;
#if TRACE
printf ("def_exports, ext=%s int=%s\n", external_name, internal_name);
#endif
dfe = def_file_add_export (def, external_name, internal_name, ordinal,
its_name, &is_dup);
/* We might check here for flag redefinition and warn. For now we
ignore duplicates silently. */
if (is_dup)
return;
if (flags & 1)
dfe->flag_noname = 1;
if (flags & 2)
dfe->flag_constant = 1;
if (flags & 4)
dfe->flag_data = 1;
if (flags & 8)
dfe->flag_private = 1;
}
static void
def_import (const char *internal_name,
const char *module,
const char *dllext,
const char *name,
int ordinal,
const char *its_name)
{
char *buf = 0;
const char *ext = dllext ? dllext : "dll";
int is_dup = 0;
buf = xmalloc (strlen (module) + strlen (ext) + 2);
sprintf (buf, "%s.%s", module, ext);
module = buf;
def_file_add_import (def, name, module, ordinal, internal_name, its_name,
&is_dup);
free (buf);
}
static void
def_version (int major, int minor)
{
def->version_major = major;
def->version_minor = minor;
}
static void
def_directive (char *str)
{
struct directive *d = xmalloc (sizeof (struct directive));
d->next = directives;
directives = d;
d->name = xstrdup (str);
d->len = strlen (str);
}
static void
def_aligncomm (char *str, int align)
{
def_file_aligncomm *c, *p;
p = NULL;
c = def->aligncomms;
while (c != NULL)
{
int e = strcmp (c->symbol_name, str);
if (!e)
{
/* Not sure if we want to allow here duplicates with
different alignments, but for now we keep them. */
e = (int) c->alignment - align;
if (!e)
return;
}
if (e > 0)
break;
c = (p = c)->next;
}
c = xmalloc (sizeof (def_file_aligncomm));
c->symbol_name = xstrdup (str);
c->alignment = (unsigned int) align;
if (!p)
{
c->next = def->aligncomms;
def->aligncomms = c;
}
else
{
c->next = p->next;
p->next = c;
}
}
static int
def_error (const char *err)
{
einfo ("%P: %s:%d: %s\n",
def_filename ? def_filename : "<unknown-file>", linenumber, err);
return 0;
}
/* Lexical Scanner. */
#undef TRACE
#define TRACE 0
/* Never freed, but always reused as needed, so no real leak. */
static char *buffer = 0;
static int buflen = 0;
static int bufptr = 0;
static void
put_buf (char c)
{
if (bufptr == buflen)
{
buflen += 50; /* overly reasonable, eh? */
if (buffer)
buffer = xrealloc (buffer, buflen + 1);
else
buffer = xmalloc (buflen + 1);
}
buffer[bufptr++] = c;
buffer[bufptr] = 0; /* not optimal, but very convenient. */
}
static struct
{
char *name;
int token;
}
tokens[] =
{
{ "BASE", BASE },
{ "CODE", CODE },
{ "CONSTANT", CONSTANTU },
{ "constant", CONSTANTL },
{ "DATA", DATAU },
{ "data", DATAL },
{ "DESCRIPTION", DESCRIPTION },
{ "DIRECTIVE", DIRECTIVE },
{ "EXECUTE", EXECUTE },
{ "EXPORTS", EXPORTS },
{ "HEAPSIZE", HEAPSIZE },
{ "IMPORTS", IMPORTS },
{ "LIBRARY", LIBRARY },
{ "NAME", NAME },
{ "NONAME", NONAMEU },
{ "noname", NONAMEL },
{ "PRIVATE", PRIVATEU },
{ "private", PRIVATEL },
{ "READ", READ },
{ "SECTIONS", SECTIONS },
{ "SEGMENTS", SECTIONS },
{ "SHARED", SHARED },
{ "STACKSIZE", STACKSIZE_K },
{ "VERSION", VERSIONK },
{ "WRITE", WRITE },
{ 0, 0 }
};
static int
def_getc (void)
{
int rv;
if (lex_parse_string)
{
if (lex_parse_string >= lex_parse_string_end)
rv = EOF;
else
rv = *lex_parse_string++;
}
else
{
rv = fgetc (the_file);
}
if (rv == '\n')
saw_newline = 1;
return rv;
}
static int
def_ungetc (int c)
{
if (lex_parse_string)
{
lex_parse_string--;
return c;
}
else
return ungetc (c, the_file);
}
static int
def_lex (void)
{
int c, i, q;
if (lex_forced_token)
{
i = lex_forced_token;
lex_forced_token = 0;
#if TRACE
printf ("lex: forcing token %d\n", i);
#endif
return i;
}
c = def_getc ();
/* Trim leading whitespace. */
while (c != EOF && (c == ' ' || c == '\t') && saw_newline)
c = def_getc ();
if (c == EOF)
{
#if TRACE
printf ("lex: EOF\n");
#endif
return 0;
}
if (saw_newline && c == ';')
{
do
{
c = def_getc ();
}
while (c != EOF && c != '\n');
if (c == '\n')
return def_lex ();
return 0;
}
/* Must be something else. */
saw_newline = 0;
if (ISDIGIT (c))
{
bufptr = 0;
while (c != EOF && (ISXDIGIT (c) || (c == 'x')))
{
put_buf (c);
c = def_getc ();
}
if (c != EOF)
def_ungetc (c);
yylval.digits = def_pool_strdup (buffer);
#if TRACE
printf ("lex: `%s' returns DIGITS\n", buffer);
#endif
return DIGITS;
}
if (ISALPHA (c) || strchr ("$:-_?@", c))
{
bufptr = 0;
q = c;
put_buf (c);
c = def_getc ();
if (q == '@')
{
if (ISBLANK (c) ) /* '@' followed by whitespace. */
return (q);
else if (ISDIGIT (c)) /* '@' followed by digit. */
{
def_ungetc (c);
return (q);
}
#if TRACE
printf ("lex: @ returns itself\n");
#endif
}
while (c != EOF && (ISALNUM (c) || strchr ("$:-_?/@<>", c)))
{
put_buf (c);
c = def_getc ();
}
if (c != EOF)
def_ungetc (c);
if (ISALPHA (q)) /* Check for tokens. */
{
for (i = 0; tokens[i].name; i++)
if (strcmp (tokens[i].name, buffer) == 0)
{
#if TRACE
printf ("lex: `%s' is a string token\n", buffer);
#endif
return tokens[i].token;
}
}
#if TRACE
printf ("lex: `%s' returns ID\n", buffer);
#endif
yylval.id = def_pool_strdup (buffer);
return ID;
}
if (c == '\'' || c == '"')
{
q = c;
c = def_getc ();
bufptr = 0;
while (c != EOF && c != q)
{
put_buf (c);
c = def_getc ();
}
yylval.id = def_pool_strdup (buffer);
#if TRACE
printf ("lex: `%s' returns ID\n", buffer);
#endif
return ID;
}
if ( c == '=')
{
c = def_getc ();
if (c == '=')
{
#if TRACE
printf ("lex: `==' returns EQUAL\n");
#endif
return EQUAL;
}
def_ungetc (c);
#if TRACE
printf ("lex: `=' returns itself\n");
#endif
return '=';
}
if (c == '.' || c == ',')
{
#if TRACE
printf ("lex: `%c' returns itself\n", c);
#endif
return c;
}
if (c == '\n')
{
linenumber++;
saw_newline = 1;
}
/*printf ("lex: 0x%02x ignored\n", c); */
return def_lex ();
}
static char *
def_pool_alloc (size_t sz)
{
def_pool_str *e;
e = (def_pool_str *) xmalloc (sizeof (def_pool_str) + sz);
e->next = pool_strs;
pool_strs = e;
return e->data;
}
static char *
def_pool_strdup (const char *str)
{
char *s;
size_t len;
if (!str)
return NULL;
len = strlen (str) + 1;
s = def_pool_alloc (len);
memcpy (s, str, len);
return s;
}
static void
def_pool_free (void)
{
def_pool_str *p;
while ((p = pool_strs) != NULL)
{
pool_strs = p->next;
free (p);
}
}
Reference in New Issue View Git Blame Copy Permalink