2012-06-21 22:19:48 +02:00
|
|
|
/* A Bison parser, made by GNU Bison 2.5. */
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
/* Bison implementation for Yacc-like parsers in C
|
2010-05-05 13:19:50 +02:00
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
Copyright (C) 1984, 1989-1990, 2000-2011 Free Software Foundation, Inc.
|
2010-05-05 13:19:50 +02:00
|
|
|
|
2010-04-08 13:37:43 +02:00
|
|
|
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.
|
2010-05-05 13:19:50 +02:00
|
|
|
|
2010-04-08 13:37:43 +02:00
|
|
|
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.
|
2010-05-05 13:19:50 +02:00
|
|
|
|
2010-04-08 13:37:43 +02:00
|
|
|
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.
|
2010-05-05 13:19:50 +02:00
|
|
|
|
2010-04-08 13:37:43 +02:00
|
|
|
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. */
|
2012-06-21 22:19:48 +02:00
|
|
|
#define YYBISON_VERSION "2.5"
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
/* Skeleton name. */
|
|
|
|
#define YYSKELETON_NAME "yacc.c"
|
|
|
|
|
|
|
|
/* Pure parsers. */
|
|
|
|
#define YYPURE 0
|
|
|
|
|
|
|
|
/* Push parsers. */
|
|
|
|
#define YYPUSH 0
|
|
|
|
|
|
|
|
/* Pull parsers. */
|
|
|
|
#define YYPULL 1
|
|
|
|
|
|
|
|
/* Using locations. */
|
|
|
|
#define YYLSP_NEEDED 0
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Copy the first part of user declarations. */
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* sconfig, coreboot device tree compiler
|
|
|
|
*
|
|
|
|
* Copyright (C) 2010 coresystems GmbH
|
|
|
|
* written by Patrick Georgi <patrick.georgi@coresystems.de>
|
|
|
|
*
|
|
|
|
* 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; version 2 of the License.
|
|
|
|
*
|
|
|
|
* 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
|
Remove address from GPLv2 headers
As per discussion with lawyers[tm], it's not a good idea to
shorten the license header too much - not for legal reasons
but because there are tools that look for them, and giving
them a standard pattern simplifies things.
However, we got confirmation that we don't have to update
every file ever added to coreboot whenever the FSF gets a
new lease, but can drop the address instead.
util/kconfig is excluded because that's imported code that
we may want to synchronize every now and then.
$ find * -type f -exec sed -i "s:Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, *MA[, ]*02110-1301[, ]*USA:Foundation, Inc.:" {} +
$ find * -type f -exec sed -i "s:Foundation, Inc., 51 Franklin Street, Suite 500, Boston, MA 02110-1335, USA:Foundation, Inc.:" {} +
$ find * -type f -exec sed -i "s:Foundation, Inc., 59 Temple Place[-, ]*Suite 330, Boston, MA *02111-1307[, ]*USA:Foundation, Inc.:" {} +
$ find * -type f -exec sed -i "s:Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.:Foundation, Inc.:" {} +
$ find * -type f
-a \! -name \*.patch \
-a \! -name \*_shipped \
-a \! -name LICENSE_GPL \
-a \! -name LGPL.txt \
-a \! -name COPYING \
-a \! -name DISCLAIMER \
-exec sed -i "/Foundation, Inc./ N;s:Foundation, Inc.* USA\.* *:Foundation, Inc. :;s:Foundation, Inc. $:Foundation, Inc.:" {} +
Change-Id: Icc968a5a5f3a5df8d32b940f9cdb35350654bef9
Signed-off-by: Patrick Georgi <pgeorgi@chromium.org>
Reviewed-on: http://review.coreboot.org/9233
Tested-by: build bot (Jenkins)
Reviewed-by: Vladimir Serbinenko <phcoder@gmail.com>
2015-03-26 15:17:45 +01:00
|
|
|
* Foundation, Inc.
|
2010-04-08 13:37:43 +02:00
|
|
|
*/
|
|
|
|
|
2010-05-05 13:19:50 +02:00
|
|
|
#include "sconfig.h"
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2010-05-05 14:05:25 +02:00
|
|
|
static struct device *cur_parent, *cur_bus;
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Enabling traces. */
|
|
|
|
#ifndef YYDEBUG
|
|
|
|
# define YYDEBUG 0
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Enabling verbose error messages. */
|
|
|
|
#ifdef YYERROR_VERBOSE
|
|
|
|
# undef YYERROR_VERBOSE
|
|
|
|
# define YYERROR_VERBOSE 1
|
|
|
|
#else
|
|
|
|
# define YYERROR_VERBOSE 0
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Enabling the token table. */
|
|
|
|
#ifndef YYTOKEN_TABLE
|
|
|
|
# define YYTOKEN_TABLE 0
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
/* Tokens. */
|
|
|
|
#ifndef YYTOKENTYPE
|
|
|
|
# define YYTOKENTYPE
|
|
|
|
/* Put the tokens into the symbol table, so that GDB and other debuggers
|
|
|
|
know about them. */
|
|
|
|
enum yytokentype {
|
|
|
|
CHIP = 258,
|
|
|
|
DEVICE = 259,
|
|
|
|
REGISTER = 260,
|
|
|
|
BOOL = 261,
|
|
|
|
BUS = 262,
|
|
|
|
RESOURCE = 263,
|
|
|
|
END = 264,
|
|
|
|
EQUALS = 265,
|
|
|
|
HEX = 266,
|
|
|
|
STRING = 267,
|
|
|
|
PCI = 268,
|
|
|
|
PNP = 269,
|
|
|
|
I2C = 270,
|
|
|
|
APIC = 271,
|
2013-02-13 00:20:54 +01:00
|
|
|
CPU_CLUSTER = 272,
|
2014-09-03 19:40:15 +02:00
|
|
|
CPU = 273,
|
|
|
|
DOMAIN = 274,
|
|
|
|
IRQ = 275,
|
|
|
|
DRQ = 276,
|
|
|
|
IO = 277,
|
|
|
|
NUMBER = 278,
|
|
|
|
SUBSYSTEMID = 279,
|
|
|
|
INHERIT = 280,
|
|
|
|
IOAPIC_IRQ = 281,
|
|
|
|
IOAPIC = 282,
|
|
|
|
PCIINT = 283
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
|
|
|
|
typedef union YYSTYPE
|
|
|
|
{
|
|
|
|
|
|
|
|
|
|
|
|
struct device *device;
|
|
|
|
char *string;
|
|
|
|
int number;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
} YYSTYPE;
|
|
|
|
# define YYSTYPE_IS_TRIVIAL 1
|
|
|
|
# define yystype YYSTYPE /* obsolescent; will be withdrawn */
|
|
|
|
# define YYSTYPE_IS_DECLARED 1
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
/* Copy the second part of user declarations. */
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#ifdef short
|
|
|
|
# undef short
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef YYTYPE_UINT8
|
|
|
|
typedef YYTYPE_UINT8 yytype_uint8;
|
|
|
|
#else
|
|
|
|
typedef unsigned char yytype_uint8;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef YYTYPE_INT8
|
|
|
|
typedef YYTYPE_INT8 yytype_int8;
|
|
|
|
#elif (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
typedef signed char yytype_int8;
|
|
|
|
#else
|
|
|
|
typedef short int 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 && (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
# 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_
|
2012-06-21 22:19:48 +02:00
|
|
|
# if defined YYENABLE_NLS && YYENABLE_NLS
|
2010-04-08 13:37:43 +02:00
|
|
|
# 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
|
|
|
|
|
|
|
|
/* Suppress unused-variable warnings by "using" E. */
|
|
|
|
#if ! defined lint || defined __GNUC__
|
|
|
|
# define YYUSE(e) ((void) (e))
|
|
|
|
#else
|
|
|
|
# define YYUSE(e) /* empty */
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Identity function, used to suppress warnings about constant conditions. */
|
|
|
|
#ifndef lint
|
|
|
|
# define YYID(n) (n)
|
|
|
|
#else
|
|
|
|
#if (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
static int
|
|
|
|
YYID (int yyi)
|
|
|
|
#else
|
|
|
|
static int
|
|
|
|
YYID (yyi)
|
|
|
|
int yyi;
|
|
|
|
#endif
|
|
|
|
{
|
|
|
|
return yyi;
|
|
|
|
}
|
|
|
|
#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
|
2012-06-21 22:19:48 +02:00
|
|
|
# if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \
|
2010-04-08 13:37:43 +02:00
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
|
2012-06-21 22:19:48 +02:00
|
|
|
# ifndef EXIT_SUCCESS
|
|
|
|
# define EXIT_SUCCESS 0
|
2010-04-08 13:37:43 +02:00
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
|
|
|
|
# ifdef YYSTACK_ALLOC
|
|
|
|
/* Pacify GCC's `empty if-body' warning. */
|
|
|
|
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (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
|
2012-06-21 22:19:48 +02:00
|
|
|
# if (defined __cplusplus && ! defined EXIT_SUCCESS \
|
2010-04-08 13:37:43 +02:00
|
|
|
&& ! ((defined YYMALLOC || defined malloc) \
|
|
|
|
&& (defined YYFREE || defined free)))
|
|
|
|
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
|
2012-06-21 22:19:48 +02:00
|
|
|
# ifndef EXIT_SUCCESS
|
|
|
|
# define EXIT_SUCCESS 0
|
2010-04-08 13:37:43 +02:00
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
# ifndef YYMALLOC
|
|
|
|
# define YYMALLOC malloc
|
2012-06-21 22:19:48 +02:00
|
|
|
# if ! defined malloc && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \
|
2010-04-08 13:37:43 +02:00
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
# ifndef YYFREE
|
|
|
|
# define YYFREE free
|
2012-06-21 22:19:48 +02:00
|
|
|
# if ! defined free && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \
|
2010-04-08 13:37:43 +02:00
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
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)
|
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
# define YYCOPY_NEEDED 1
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
/* 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 (YYID (0))
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
#if defined YYCOPY_NEEDED && YYCOPY_NEEDED
|
|
|
|
/* Copy COUNT objects from FROM to TO. The source and destination do
|
|
|
|
not overlap. */
|
|
|
|
# ifndef YYCOPY
|
|
|
|
# if defined __GNUC__ && 1 < __GNUC__
|
|
|
|
# define YYCOPY(To, From, Count) \
|
|
|
|
__builtin_memcpy (To, From, (Count) * sizeof (*(From)))
|
|
|
|
# else
|
|
|
|
# define YYCOPY(To, From, Count) \
|
|
|
|
do \
|
|
|
|
{ \
|
|
|
|
YYSIZE_T yyi; \
|
|
|
|
for (yyi = 0; yyi < (Count); yyi++) \
|
|
|
|
(To)[yyi] = (From)[yyi]; \
|
|
|
|
} \
|
|
|
|
while (YYID (0))
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
#endif /* !YYCOPY_NEEDED */
|
|
|
|
|
2010-04-08 13:37:43 +02:00
|
|
|
/* YYFINAL -- State number of the termination state. */
|
2010-05-05 14:05:25 +02:00
|
|
|
#define YYFINAL 3
|
2010-04-08 13:37:43 +02:00
|
|
|
/* YYLAST -- Last index in YYTABLE. */
|
2014-09-03 19:40:15 +02:00
|
|
|
#define YYLAST 39
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
/* YYNTOKENS -- Number of terminals. */
|
2014-09-03 19:40:15 +02:00
|
|
|
#define YYNTOKENS 29
|
2010-04-08 13:37:43 +02:00
|
|
|
/* YYNNTS -- Number of nonterminals. */
|
2012-06-21 22:19:48 +02:00
|
|
|
#define YYNNTS 13
|
2010-04-08 13:37:43 +02:00
|
|
|
/* YYNRULES -- Number of rules. */
|
2012-06-21 22:19:48 +02:00
|
|
|
#define YYNRULES 22
|
2010-04-08 13:37:43 +02:00
|
|
|
/* YYNRULES -- Number of states. */
|
2012-06-21 22:19:48 +02:00
|
|
|
#define YYNSTATES 41
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */
|
|
|
|
#define YYUNDEFTOK 2
|
2014-09-03 19:40:15 +02:00
|
|
|
#define YYMAXUTOK 283
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
#define YYTRANSLATE(YYX) \
|
|
|
|
((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
|
|
|
|
|
|
|
|
/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */
|
|
|
|
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, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
2, 2, 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,
|
2012-06-21 22:19:48 +02:00
|
|
|
15, 16, 17, 18, 19, 20, 21, 22, 23, 24,
|
2014-09-03 19:40:15 +02:00
|
|
|
25, 26, 27, 28
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
#if YYDEBUG
|
|
|
|
/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
|
|
|
|
YYRHS. */
|
|
|
|
static const yytype_uint8 yyprhs[] =
|
|
|
|
{
|
2010-05-05 15:13:47 +02:00
|
|
|
0, 0, 3, 4, 7, 10, 13, 16, 17, 20,
|
2012-06-21 22:19:48 +02:00
|
|
|
23, 26, 29, 32, 33, 34, 40, 41, 49, 54,
|
|
|
|
59, 63, 68
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
/* YYRHS -- A `-1'-separated list of the rules' RHS. */
|
|
|
|
static const yytype_int8 yyrhs[] =
|
|
|
|
{
|
2014-09-03 19:40:15 +02:00
|
|
|
30, 0, -1, -1, 31, 34, -1, 32, 36, -1,
|
|
|
|
32, 34, -1, 32, 39, -1, -1, 33, 36, -1,
|
|
|
|
33, 34, -1, 33, 38, -1, 33, 40, -1, 33,
|
|
|
|
41, -1, -1, -1, 3, 12, 35, 32, 9, -1,
|
|
|
|
-1, 4, 7, 23, 6, 37, 33, 9, -1, 8,
|
|
|
|
23, 10, 23, -1, 5, 12, 10, 12, -1, 24,
|
|
|
|
23, 23, -1, 24, 23, 23, 25, -1, 26, 23,
|
|
|
|
28, 23, -1
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
|
2010-05-05 13:19:50 +02:00
|
|
|
static const yytype_uint8 yyrline[] =
|
2010-04-08 13:37:43 +02:00
|
|
|
{
|
2011-03-01 20:58:15 +01:00
|
|
|
0, 35, 35, 35, 37, 37, 37, 37, 39, 39,
|
2012-06-21 22:19:48 +02:00
|
|
|
39, 39, 39, 39, 41, 41, 51, 51, 63, 66,
|
|
|
|
69, 72, 75
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE
|
|
|
|
/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
|
|
|
|
First, the terminals, then, starting at YYNTOKENS, nonterminals. */
|
|
|
|
static const char *const yytname[] =
|
|
|
|
{
|
|
|
|
"$end", "error", "$undefined", "CHIP", "DEVICE", "REGISTER", "BOOL",
|
|
|
|
"BUS", "RESOURCE", "END", "EQUALS", "HEX", "STRING", "PCI", "PNP", "I2C",
|
2014-09-03 19:40:15 +02:00
|
|
|
"APIC", "CPU_CLUSTER", "CPU", "DOMAIN", "IRQ", "DRQ", "IO", "NUMBER",
|
2012-06-21 22:19:48 +02:00
|
|
|
"SUBSYSTEMID", "INHERIT", "IOAPIC_IRQ", "IOAPIC", "PCIINT", "$accept",
|
|
|
|
"devtree", "$@1", "chipchildren", "devicechildren", "chip", "@2",
|
|
|
|
"device", "@3", "resource", "registers", "subsystemid", "ioapic_irq", 0
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
|
|
|
# ifdef YYPRINT
|
|
|
|
/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
|
|
|
|
token YYLEX-NUM. */
|
|
|
|
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,
|
2014-09-03 19:40:15 +02:00
|
|
|
275, 276, 277, 278, 279, 280, 281, 282, 283
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
# endif
|
|
|
|
|
|
|
|
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
|
|
|
|
static const yytype_uint8 yyr1[] =
|
|
|
|
{
|
2014-09-03 19:40:15 +02:00
|
|
|
0, 29, 31, 30, 32, 32, 32, 32, 33, 33,
|
|
|
|
33, 33, 33, 33, 35, 34, 37, 36, 38, 39,
|
|
|
|
40, 40, 41
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
|
|
|
|
static const yytype_uint8 yyr2[] =
|
|
|
|
{
|
2010-05-05 15:13:47 +02:00
|
|
|
0, 2, 0, 2, 2, 2, 2, 0, 2, 2,
|
2012-06-21 22:19:48 +02:00
|
|
|
2, 2, 2, 0, 0, 5, 0, 7, 4, 4,
|
|
|
|
3, 4, 4
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
/* YYDEFACT[STATE-NAME] -- Default reduction number in state STATE-NUM.
|
|
|
|
Performed when YYTABLE doesn't specify something else to do. Zero
|
2010-04-08 13:37:43 +02:00
|
|
|
means the default is an error. */
|
|
|
|
static const yytype_uint8 yydefact[] =
|
|
|
|
{
|
2012-06-21 22:19:48 +02:00
|
|
|
2, 0, 0, 1, 0, 3, 14, 7, 0, 0,
|
|
|
|
0, 15, 5, 4, 6, 0, 0, 0, 0, 16,
|
|
|
|
19, 13, 0, 0, 17, 0, 0, 9, 8, 10,
|
|
|
|
11, 12, 0, 0, 0, 0, 20, 0, 18, 21,
|
|
|
|
22
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
/* YYDEFGOTO[NTERM-NUM]. */
|
|
|
|
static const yytype_int8 yydefgoto[] =
|
|
|
|
{
|
2012-06-21 22:19:48 +02:00
|
|
|
-1, 1, 2, 8, 22, 5, 7, 13, 21, 29,
|
|
|
|
14, 30, 31
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
|
|
|
|
STATE-NUM. */
|
2014-09-03 19:40:15 +02:00
|
|
|
#define YYPACT_NINF -10
|
2010-04-08 13:37:43 +02:00
|
|
|
static const yytype_int8 yypact[] =
|
|
|
|
{
|
2014-09-03 19:40:15 +02:00
|
|
|
-10, 3, 1, -10, -2, -10, -10, -10, 4, 5,
|
|
|
|
-1, -10, -10, -10, -10, -9, 7, 9, 6, -10,
|
|
|
|
-10, -10, -3, -4, -10, 2, 8, -10, -10, -10,
|
|
|
|
-10, -10, 10, 11, 0, 12, 13, 14, -10, -10,
|
|
|
|
-10
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
/* YYPGOTO[NTERM-NUM]. */
|
|
|
|
static const yytype_int8 yypgoto[] =
|
|
|
|
{
|
2014-09-03 19:40:15 +02:00
|
|
|
-10, -10, -10, -10, -10, -6, -10, 17, -10, -10,
|
|
|
|
-10, -10, -10
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
/* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If
|
|
|
|
positive, shift that token. If negative, reduce the rule which
|
2012-06-21 22:19:48 +02:00
|
|
|
number is the opposite. If YYTABLE_NINF, syntax error. */
|
2010-04-08 13:37:43 +02:00
|
|
|
#define YYTABLE_NINF -1
|
|
|
|
static const yytype_uint8 yytable[] =
|
|
|
|
{
|
2011-03-01 20:58:15 +01:00
|
|
|
4, 9, 12, 3, 4, 23, 24, 4, 9, 10,
|
2014-09-03 19:40:15 +02:00
|
|
|
6, 16, 15, 11, 17, 19, 27, 18, 20, 32,
|
|
|
|
35, 25, 0, 26, 0, 33, 0, 0, 37, 0,
|
|
|
|
0, 34, 0, 0, 36, 38, 0, 40, 39, 28
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
#define yypact_value_is_default(yystate) \
|
2014-09-03 19:40:15 +02:00
|
|
|
((yystate) == (-10))
|
2012-06-21 22:19:48 +02:00
|
|
|
|
|
|
|
#define yytable_value_is_error(yytable_value) \
|
|
|
|
YYID (0)
|
|
|
|
|
2010-05-05 15:13:47 +02:00
|
|
|
static const yytype_int8 yycheck[] =
|
2010-04-08 13:37:43 +02:00
|
|
|
{
|
2011-03-01 20:58:15 +01:00
|
|
|
3, 4, 8, 0, 3, 8, 9, 3, 4, 5,
|
2014-09-03 19:40:15 +02:00
|
|
|
12, 12, 7, 9, 23, 6, 22, 10, 12, 23,
|
|
|
|
10, 24, -1, 26, -1, 23, -1, -1, 28, -1,
|
|
|
|
-1, 23, -1, -1, 23, 23, -1, 23, 25, 22
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
|
|
|
|
symbol of state STATE-NUM. */
|
|
|
|
static const yytype_uint8 yystos[] =
|
|
|
|
{
|
2014-09-03 19:40:15 +02:00
|
|
|
0, 30, 31, 0, 3, 34, 12, 35, 32, 4,
|
|
|
|
5, 9, 34, 36, 39, 7, 12, 23, 10, 6,
|
|
|
|
12, 37, 33, 8, 9, 24, 26, 34, 36, 38,
|
|
|
|
40, 41, 23, 23, 23, 10, 23, 28, 23, 25,
|
|
|
|
23
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
#define yyerrok (yyerrstatus = 0)
|
|
|
|
#define yyclearin (yychar = YYEMPTY)
|
|
|
|
#define YYEMPTY (-2)
|
|
|
|
#define YYEOF 0
|
|
|
|
|
|
|
|
#define YYACCEPT goto yyacceptlab
|
|
|
|
#define YYABORT goto yyabortlab
|
|
|
|
#define YYERROR goto yyerrorlab
|
|
|
|
|
|
|
|
|
|
|
|
/* Like YYERROR except do call yyerror. This remains here temporarily
|
|
|
|
to ease the transition to the new meaning of YYERROR, for GCC.
|
2012-06-21 22:19:48 +02:00
|
|
|
Once GCC version 2 has supplanted version 1, this can go. However,
|
|
|
|
YYFAIL appears to be in use. Nevertheless, it is formally deprecated
|
|
|
|
in Bison 2.4.2's NEWS entry, where a plan to phase it out is
|
|
|
|
discussed. */
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
#define YYFAIL goto yyerrlab
|
2012-06-21 22:19:48 +02:00
|
|
|
#if defined YYFAIL
|
|
|
|
/* This is here to suppress warnings from the GCC cpp's
|
|
|
|
-Wunused-macros. Normally we don't worry about that warning, but
|
|
|
|
some users do, and we want to make it easy for users to remove
|
|
|
|
YYFAIL uses, which will produce warnings from Bison 2.5. */
|
|
|
|
#endif
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
#define YYRECOVERING() (!!yyerrstatus)
|
|
|
|
|
|
|
|
#define YYBACKUP(Token, Value) \
|
|
|
|
do \
|
|
|
|
if (yychar == YYEMPTY && yylen == 1) \
|
|
|
|
{ \
|
|
|
|
yychar = (Token); \
|
|
|
|
yylval = (Value); \
|
|
|
|
YYPOPSTACK (1); \
|
|
|
|
goto yybackup; \
|
|
|
|
} \
|
|
|
|
else \
|
|
|
|
{ \
|
|
|
|
yyerror (YY_("syntax error: cannot back up")); \
|
|
|
|
YYERROR; \
|
|
|
|
} \
|
|
|
|
while (YYID (0))
|
|
|
|
|
|
|
|
|
|
|
|
#define YYTERROR 1
|
|
|
|
#define YYERRCODE 256
|
|
|
|
|
|
|
|
|
|
|
|
/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N].
|
|
|
|
If N is 0, then set CURRENT to the empty location which ends
|
|
|
|
the previous symbol: RHS[0] (always defined). */
|
|
|
|
|
|
|
|
#define YYRHSLOC(Rhs, K) ((Rhs)[K])
|
|
|
|
#ifndef YYLLOC_DEFAULT
|
|
|
|
# define YYLLOC_DEFAULT(Current, Rhs, N) \
|
|
|
|
do \
|
|
|
|
if (YYID (N)) \
|
|
|
|
{ \
|
|
|
|
(Current).first_line = YYRHSLOC (Rhs, 1).first_line; \
|
|
|
|
(Current).first_column = YYRHSLOC (Rhs, 1).first_column; \
|
|
|
|
(Current).last_line = YYRHSLOC (Rhs, N).last_line; \
|
|
|
|
(Current).last_column = YYRHSLOC (Rhs, N).last_column; \
|
|
|
|
} \
|
|
|
|
else \
|
|
|
|
{ \
|
|
|
|
(Current).first_line = (Current).last_line = \
|
|
|
|
YYRHSLOC (Rhs, 0).last_line; \
|
|
|
|
(Current).first_column = (Current).last_column = \
|
|
|
|
YYRHSLOC (Rhs, 0).last_column; \
|
|
|
|
} \
|
|
|
|
while (YYID (0))
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
/* This macro is provided for backward compatibility. */
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
#ifndef YY_LOCATION_PRINT
|
2012-06-21 22:19:48 +02:00
|
|
|
# define YY_LOCATION_PRINT(File, Loc) ((void) 0)
|
2010-04-08 13:37:43 +02:00
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
/* YYLEX -- calling `yylex' with the right arguments. */
|
|
|
|
|
|
|
|
#ifdef YYLEX_PARAM
|
|
|
|
# define YYLEX yylex (YYLEX_PARAM)
|
|
|
|
#else
|
|
|
|
# define YYLEX yylex ()
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Enable debugging if requested. */
|
|
|
|
#if YYDEBUG
|
|
|
|
|
|
|
|
# ifndef YYFPRINTF
|
|
|
|
# include <stdio.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
# define YYFPRINTF fprintf
|
|
|
|
# endif
|
|
|
|
|
|
|
|
# define YYDPRINTF(Args) \
|
|
|
|
do { \
|
|
|
|
if (yydebug) \
|
|
|
|
YYFPRINTF Args; \
|
|
|
|
} while (YYID (0))
|
|
|
|
|
|
|
|
# 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 (YYID (0))
|
|
|
|
|
|
|
|
|
|
|
|
/*--------------------------------.
|
|
|
|
| Print this symbol on YYOUTPUT. |
|
|
|
|
`--------------------------------*/
|
|
|
|
|
|
|
|
/*ARGSUSED*/
|
|
|
|
#if (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
static void
|
|
|
|
yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
|
|
|
|
#else
|
|
|
|
static void
|
|
|
|
yy_symbol_value_print (yyoutput, yytype, yyvaluep)
|
|
|
|
FILE *yyoutput;
|
|
|
|
int yytype;
|
|
|
|
YYSTYPE const * const yyvaluep;
|
|
|
|
#endif
|
|
|
|
{
|
|
|
|
if (!yyvaluep)
|
|
|
|
return;
|
|
|
|
# ifdef YYPRINT
|
|
|
|
if (yytype < YYNTOKENS)
|
|
|
|
YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
|
|
|
|
# else
|
|
|
|
YYUSE (yyoutput);
|
|
|
|
# endif
|
|
|
|
switch (yytype)
|
|
|
|
{
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*--------------------------------.
|
|
|
|
| Print this symbol on YYOUTPUT. |
|
|
|
|
`--------------------------------*/
|
|
|
|
|
|
|
|
#if (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
static void
|
|
|
|
yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
|
|
|
|
#else
|
|
|
|
static void
|
|
|
|
yy_symbol_print (yyoutput, yytype, yyvaluep)
|
|
|
|
FILE *yyoutput;
|
|
|
|
int yytype;
|
|
|
|
YYSTYPE const * const yyvaluep;
|
|
|
|
#endif
|
|
|
|
{
|
|
|
|
if (yytype < YYNTOKENS)
|
|
|
|
YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
|
|
|
|
else
|
|
|
|
YYFPRINTF (yyoutput, "nterm %s (", 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). |
|
|
|
|
`------------------------------------------------------------------*/
|
|
|
|
|
|
|
|
#if (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
static void
|
|
|
|
yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop)
|
|
|
|
#else
|
|
|
|
static void
|
|
|
|
yy_stack_print (yybottom, yytop)
|
|
|
|
yytype_int16 *yybottom;
|
|
|
|
yytype_int16 *yytop;
|
|
|
|
#endif
|
|
|
|
{
|
|
|
|
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 (YYID (0))
|
|
|
|
|
|
|
|
|
|
|
|
/*------------------------------------------------.
|
|
|
|
| Report that the YYRULE is going to be reduced. |
|
|
|
|
`------------------------------------------------*/
|
|
|
|
|
|
|
|
#if (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
static void
|
|
|
|
yy_reduce_print (YYSTYPE *yyvsp, int yyrule)
|
|
|
|
#else
|
|
|
|
static void
|
|
|
|
yy_reduce_print (yyvsp, yyrule)
|
|
|
|
YYSTYPE *yyvsp;
|
|
|
|
int yyrule;
|
|
|
|
#endif
|
|
|
|
{
|
|
|
|
int yynrhs = yyr2[yyrule];
|
|
|
|
int yyi;
|
|
|
|
unsigned long int yylno = yyrline[yyrule];
|
|
|
|
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, yyrhs[yyprhs[yyrule] + yyi],
|
|
|
|
&(yyvsp[(yyi + 1) - (yynrhs)])
|
|
|
|
);
|
|
|
|
YYFPRINTF (stderr, "\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
# define YY_REDUCE_PRINT(Rule) \
|
|
|
|
do { \
|
|
|
|
if (yydebug) \
|
|
|
|
yy_reduce_print (yyvsp, Rule); \
|
|
|
|
} while (YYID (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. */
|
|
|
|
#if (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
static YYSIZE_T
|
|
|
|
yystrlen (const char *yystr)
|
|
|
|
#else
|
|
|
|
static YYSIZE_T
|
|
|
|
yystrlen (yystr)
|
|
|
|
const char *yystr;
|
|
|
|
#endif
|
|
|
|
{
|
|
|
|
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. */
|
|
|
|
#if (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
static char *
|
|
|
|
yystpcpy (char *yydest, const char *yysrc)
|
|
|
|
#else
|
|
|
|
static char *
|
|
|
|
yystpcpy (yydest, yysrc)
|
|
|
|
char *yydest;
|
|
|
|
const char *yysrc;
|
|
|
|
#endif
|
|
|
|
{
|
|
|
|
char *yyd = yydest;
|
|
|
|
const char *yys = yysrc;
|
|
|
|
|
|
|
|
while ((*yyd++ = *yys++) != '\0')
|
|
|
|
continue;
|
|
|
|
|
|
|
|
return yyd - 1;
|
|
|
|
}
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
|
|
|
|
# ifndef yytnamerr
|
|
|
|
/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
|
|
|
|
quotes and backslashes, so that it's suitable for yyerror. The
|
|
|
|
heuristic is that double-quoting is unnecessary unless the string
|
|
|
|
contains an apostrophe, a comma, or backslash (other than
|
|
|
|
backslash-backslash). YYSTR is taken from yytname. If YYRES is
|
|
|
|
null, do not copy; instead, return the length of what the result
|
|
|
|
would have been. */
|
|
|
|
static YYSIZE_T
|
|
|
|
yytnamerr (char *yyres, const char *yystr)
|
|
|
|
{
|
|
|
|
if (*yystr == '"')
|
|
|
|
{
|
|
|
|
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
|
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
/* 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.
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
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 (0, yytname[yytoken]);
|
|
|
|
YYSIZE_T yysize = yysize0;
|
|
|
|
YYSIZE_T yysize1;
|
|
|
|
enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
|
|
|
|
/* Internationalized format string. */
|
|
|
|
const char *yyformat = 0;
|
|
|
|
/* 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:
|
|
|
|
- Assume YYFAIL is not used. It's too flawed to consider. See
|
|
|
|
<http://lists.gnu.org/archive/html/bison-patches/2009-12/msg00024.html>
|
|
|
|
for details. YYERROR is fine as it does not invoke this
|
|
|
|
function.
|
|
|
|
- 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)
|
2010-04-08 13:37:43 +02:00
|
|
|
{
|
2012-06-21 22:19:48 +02:00
|
|
|
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];
|
|
|
|
yysize1 = yysize + yytnamerr (0, yytname[yyx]);
|
|
|
|
if (! (yysize <= yysize1
|
|
|
|
&& yysize1 <= YYSTACK_ALLOC_MAXIMUM))
|
|
|
|
return 2;
|
|
|
|
yysize = yysize1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
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_
|
|
|
|
}
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
yysize1 = yysize + yystrlen (yyformat);
|
|
|
|
if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM))
|
|
|
|
return 2;
|
|
|
|
yysize = yysize1;
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
if (*yymsg_alloc < yysize)
|
|
|
|
{
|
|
|
|
*yymsg_alloc = 2 * yysize;
|
|
|
|
if (! (yysize <= *yymsg_alloc
|
|
|
|
&& *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM))
|
|
|
|
*yymsg_alloc = YYSTACK_ALLOC_MAXIMUM;
|
|
|
|
return 1;
|
2010-04-08 13:37:43 +02:00
|
|
|
}
|
2012-06-21 22:19:48 +02:00
|
|
|
|
|
|
|
/* 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;
|
2010-04-08 13:37:43 +02:00
|
|
|
}
|
|
|
|
#endif /* YYERROR_VERBOSE */
|
|
|
|
|
|
|
|
/*-----------------------------------------------.
|
|
|
|
| Release the memory associated to this symbol. |
|
|
|
|
`-----------------------------------------------*/
|
|
|
|
|
|
|
|
/*ARGSUSED*/
|
|
|
|
#if (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
static void
|
|
|
|
yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep)
|
|
|
|
#else
|
|
|
|
static void
|
|
|
|
yydestruct (yymsg, yytype, yyvaluep)
|
|
|
|
const char *yymsg;
|
|
|
|
int yytype;
|
|
|
|
YYSTYPE *yyvaluep;
|
|
|
|
#endif
|
|
|
|
{
|
|
|
|
YYUSE (yyvaluep);
|
|
|
|
|
|
|
|
if (!yymsg)
|
|
|
|
yymsg = "Deleting";
|
|
|
|
YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
|
|
|
|
|
|
|
|
switch (yytype)
|
|
|
|
{
|
|
|
|
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
|
2010-04-08 13:37:43 +02:00
|
|
|
/* Prevent warnings from -Wmissing-prototypes. */
|
|
|
|
#ifdef YYPARSE_PARAM
|
|
|
|
#if defined __STDC__ || defined __cplusplus
|
|
|
|
int yyparse (void *YYPARSE_PARAM);
|
|
|
|
#else
|
|
|
|
int yyparse ();
|
|
|
|
#endif
|
|
|
|
#else /* ! YYPARSE_PARAM */
|
|
|
|
#if defined __STDC__ || defined __cplusplus
|
|
|
|
int yyparse (void);
|
|
|
|
#else
|
|
|
|
int yyparse ();
|
|
|
|
#endif
|
|
|
|
#endif /* ! YYPARSE_PARAM */
|
|
|
|
|
|
|
|
|
|
|
|
/* The lookahead symbol. */
|
|
|
|
int yychar;
|
|
|
|
|
|
|
|
/* The semantic value of the lookahead symbol. */
|
|
|
|
YYSTYPE yylval;
|
|
|
|
|
|
|
|
/* Number of syntax errors so far. */
|
|
|
|
int yynerrs;
|
|
|
|
|
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
/*----------.
|
|
|
|
| yyparse. |
|
|
|
|
`----------*/
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
#ifdef YYPARSE_PARAM
|
|
|
|
#if (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
int
|
|
|
|
yyparse (void *YYPARSE_PARAM)
|
|
|
|
#else
|
|
|
|
int
|
|
|
|
yyparse (YYPARSE_PARAM)
|
|
|
|
void *YYPARSE_PARAM;
|
|
|
|
#endif
|
|
|
|
#else /* ! YYPARSE_PARAM */
|
|
|
|
#if (defined __STDC__ || defined __C99__FUNC__ \
|
|
|
|
|| defined __cplusplus || defined _MSC_VER)
|
|
|
|
int
|
|
|
|
yyparse (void)
|
|
|
|
#else
|
|
|
|
int
|
|
|
|
yyparse ()
|
|
|
|
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
{
|
|
|
|
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 thru 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;
|
|
|
|
/* 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;
|
|
|
|
|
|
|
|
yytoken = 0;
|
|
|
|
yyss = yyssa;
|
|
|
|
yyvs = yyvsa;
|
|
|
|
yystacksize = YYINITDEPTH;
|
|
|
|
|
|
|
|
YYDPRINTF ((stderr, "Starting parse\n"));
|
|
|
|
|
|
|
|
yystate = 0;
|
|
|
|
yyerrstatus = 0;
|
|
|
|
yynerrs = 0;
|
|
|
|
yychar = YYEMPTY; /* Cause a token to be read. */
|
|
|
|
|
|
|
|
/* Initialize stack pointers.
|
|
|
|
Waste one element of value and location stack
|
|
|
|
so that they stay on the same level as the state stack.
|
|
|
|
The wasted elements are never initialized. */
|
|
|
|
yyssp = yyss;
|
|
|
|
yyvsp = yyvs;
|
|
|
|
|
|
|
|
goto yysetstate;
|
|
|
|
|
|
|
|
/*------------------------------------------------------------.
|
|
|
|
| yynewstate -- Push a new state, which is found in yystate. |
|
|
|
|
`------------------------------------------------------------*/
|
|
|
|
yynewstate:
|
|
|
|
/* In all cases, when you get here, the value and location stacks
|
|
|
|
have just been pushed. So pushing a state here evens the stacks. */
|
|
|
|
yyssp++;
|
|
|
|
|
|
|
|
yysetstate:
|
|
|
|
*yyssp = yystate;
|
|
|
|
|
|
|
|
if (yyss + yystacksize - 1 <= yyssp)
|
|
|
|
{
|
|
|
|
/* Get the current used size of the three stacks, in elements. */
|
|
|
|
YYSIZE_T yysize = yyssp - yyss + 1;
|
|
|
|
|
|
|
|
#ifdef yyoverflow
|
|
|
|
{
|
|
|
|
/* Give user a chance to reallocate the stack. Use copies of
|
|
|
|
these so that the &'s don't force the real ones into
|
|
|
|
memory. */
|
|
|
|
YYSTYPE *yyvs1 = yyvs;
|
|
|
|
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];
|
2012-06-21 22:19:48 +02:00
|
|
|
if (yypact_value_is_default (yyn))
|
2010-04-08 13:37:43 +02:00
|
|
|
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)
|
|
|
|
{
|
2012-06-21 22:19:48 +02:00
|
|
|
if (yytable_value_is_error (yyn))
|
|
|
|
goto yyerrlab;
|
2010-04-08 13:37:43 +02:00
|
|
|
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;
|
|
|
|
*++yyvsp = yylval;
|
|
|
|
|
|
|
|
goto yynewstate;
|
|
|
|
|
|
|
|
|
|
|
|
/*-----------------------------------------------------------.
|
|
|
|
| yydefault -- do the default action for the current state. |
|
|
|
|
`-----------------------------------------------------------*/
|
|
|
|
yydefault:
|
|
|
|
yyn = yydefact[yystate];
|
|
|
|
if (yyn == 0)
|
|
|
|
goto yyerrlab;
|
|
|
|
goto yyreduce;
|
|
|
|
|
|
|
|
|
|
|
|
/*-----------------------------.
|
|
|
|
| yyreduce -- Do a reduction. |
|
|
|
|
`-----------------------------*/
|
|
|
|
yyreduce:
|
|
|
|
/* yyn is the number of a rule to reduce with. */
|
|
|
|
yylen = yyr2[yyn];
|
|
|
|
|
|
|
|
/* If YYLEN is nonzero, implement the default value of the action:
|
|
|
|
`$$ = $1'.
|
|
|
|
|
|
|
|
Otherwise, the following line sets YYVAL to garbage.
|
|
|
|
This behavior is undocumented and Bison
|
|
|
|
users should not rely upon it. Assigning to YYVAL
|
|
|
|
unconditionally makes the parser a bit smaller, and it avoids a
|
|
|
|
GCC warning that YYVAL may be used uninitialized. */
|
|
|
|
yyval = yyvsp[1-yylen];
|
|
|
|
|
|
|
|
|
|
|
|
YY_REDUCE_PRINT (yyn);
|
|
|
|
switch (yyn)
|
|
|
|
{
|
|
|
|
case 2:
|
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
{ cur_parent = cur_bus = head; }
|
2010-05-05 14:05:25 +02:00
|
|
|
break;
|
|
|
|
|
|
|
|
case 3:
|
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
{ postprocess_devtree(); }
|
2010-04-08 13:37:43 +02:00
|
|
|
break;
|
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
case 14:
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
{
|
2010-05-05 14:05:25 +02:00
|
|
|
(yyval.device) = new_chip(cur_parent, cur_bus, (yyvsp[(2) - (2)].string));
|
2010-04-08 13:37:43 +02:00
|
|
|
cur_parent = (yyval.device);
|
2012-06-21 22:19:48 +02:00
|
|
|
}
|
2010-04-08 13:37:43 +02:00
|
|
|
break;
|
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
case 15:
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
{
|
|
|
|
cur_parent = (yyvsp[(3) - (5)].device)->parent;
|
|
|
|
fold_in((yyvsp[(3) - (5)].device));
|
2010-05-05 13:19:50 +02:00
|
|
|
add_header((yyvsp[(3) - (5)].device));
|
2012-06-21 22:19:48 +02:00
|
|
|
}
|
2010-04-08 13:37:43 +02:00
|
|
|
break;
|
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
case 16:
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
{
|
2010-05-05 14:05:25 +02:00
|
|
|
(yyval.device) = new_device(cur_parent, cur_bus, (yyvsp[(2) - (4)].number), (yyvsp[(3) - (4)].string), (yyvsp[(4) - (4)].number));
|
2010-04-08 13:37:43 +02:00
|
|
|
cur_parent = (yyval.device);
|
|
|
|
cur_bus = (yyval.device);
|
2012-06-21 22:19:48 +02:00
|
|
|
}
|
2010-04-08 13:37:43 +02:00
|
|
|
break;
|
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
case 17:
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
{
|
|
|
|
cur_parent = (yyvsp[(5) - (7)].device)->parent;
|
|
|
|
cur_bus = (yyvsp[(5) - (7)].device)->bus;
|
|
|
|
fold_in((yyvsp[(5) - (7)].device));
|
2010-05-05 13:19:50 +02:00
|
|
|
alias_siblings((yyvsp[(5) - (7)].device)->children);
|
2012-06-21 22:19:48 +02:00
|
|
|
}
|
2010-04-08 13:37:43 +02:00
|
|
|
break;
|
|
|
|
|
2011-03-01 20:58:15 +01:00
|
|
|
case 18:
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
{ add_resource(cur_parent, (yyvsp[(1) - (4)].number), strtol((yyvsp[(2) - (4)].string), NULL, 0), strtol((yyvsp[(4) - (4)].string), NULL, 0)); }
|
2010-04-08 13:37:43 +02:00
|
|
|
break;
|
|
|
|
|
2011-03-01 20:58:15 +01:00
|
|
|
case 19:
|
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
{ add_register(cur_parent, (yyvsp[(2) - (4)].string), (yyvsp[(4) - (4)].string)); }
|
2011-03-01 20:58:15 +01:00
|
|
|
break;
|
|
|
|
|
|
|
|
case 20:
|
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
{ add_pci_subsystem_ids(cur_parent, strtol((yyvsp[(2) - (3)].string), NULL, 16), strtol((yyvsp[(3) - (3)].string), NULL, 16), 0); }
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 21:
|
|
|
|
|
|
|
|
{ add_pci_subsystem_ids(cur_parent, strtol((yyvsp[(2) - (4)].string), NULL, 16), strtol((yyvsp[(3) - (4)].string), NULL, 16), 1); }
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 22:
|
|
|
|
|
|
|
|
{ add_ioapic_info(cur_parent, strtol((yyvsp[(2) - (4)].string), NULL, 16), (yyvsp[(3) - (4)].string), strtol((yyvsp[(4) - (4)].string), NULL, 16)); }
|
2011-03-01 20:58:15 +01:00
|
|
|
break;
|
|
|
|
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
|
|
|
|
default: break;
|
|
|
|
}
|
2012-06-21 22:19:48 +02:00
|
|
|
/* 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. */
|
2010-04-08 13:37:43 +02:00
|
|
|
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:
|
2012-06-21 22:19:48 +02:00
|
|
|
/* Make sure we have latest lookahead translation. See comments at
|
|
|
|
user semantic actions for why this is necessary. */
|
|
|
|
yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar);
|
|
|
|
|
2010-04-08 13:37:43 +02:00
|
|
|
/* If not already recovering from an error, report this error. */
|
|
|
|
if (!yyerrstatus)
|
|
|
|
{
|
|
|
|
++yynerrs;
|
|
|
|
#if ! YYERROR_VERBOSE
|
|
|
|
yyerror (YY_("syntax error"));
|
|
|
|
#else
|
2012-06-21 22:19:48 +02:00
|
|
|
# define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \
|
|
|
|
yyssp, yytoken)
|
2010-04-08 13:37:43 +02:00
|
|
|
{
|
2012-06-21 22:19:48 +02:00
|
|
|
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;
|
2010-04-08 13:37:43 +02:00
|
|
|
}
|
2012-06-21 22:19:48 +02:00
|
|
|
# undef YYSYNTAX_ERROR
|
2010-04-08 13:37:43 +02:00
|
|
|
#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 which 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];
|
2012-06-21 22:19:48 +02:00
|
|
|
if (!yypact_value_is_default (yyn))
|
2010-04-08 13:37:43 +02:00
|
|
|
{
|
|
|
|
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);
|
|
|
|
}
|
|
|
|
|
|
|
|
*++yyvsp = yylval;
|
|
|
|
|
|
|
|
|
|
|
|
/* Shift the error token. */
|
|
|
|
YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
|
|
|
|
|
|
|
|
yystate = yyn;
|
|
|
|
goto yynewstate;
|
|
|
|
|
|
|
|
|
|
|
|
/*-------------------------------------.
|
|
|
|
| yyacceptlab -- YYACCEPT comes here. |
|
|
|
|
`-------------------------------------*/
|
|
|
|
yyacceptlab:
|
|
|
|
yyresult = 0;
|
|
|
|
goto yyreturn;
|
|
|
|
|
|
|
|
/*-----------------------------------.
|
|
|
|
| yyabortlab -- YYABORT comes here. |
|
|
|
|
`-----------------------------------*/
|
|
|
|
yyabortlab:
|
|
|
|
yyresult = 1;
|
|
|
|
goto yyreturn;
|
|
|
|
|
|
|
|
#if !defined(yyoverflow) || YYERROR_VERBOSE
|
|
|
|
/*-------------------------------------------------.
|
|
|
|
| yyexhaustedlab -- memory exhaustion comes here. |
|
|
|
|
`-------------------------------------------------*/
|
|
|
|
yyexhaustedlab:
|
|
|
|
yyerror (YY_("memory exhausted"));
|
|
|
|
yyresult = 2;
|
|
|
|
/* Fall through. */
|
|
|
|
#endif
|
|
|
|
|
|
|
|
yyreturn:
|
|
|
|
if (yychar != YYEMPTY)
|
2012-06-21 22:19:48 +02:00
|
|
|
{
|
|
|
|
/* 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);
|
|
|
|
}
|
2010-04-08 13:37:43 +02:00
|
|
|
/* Do not reclaim the symbols of the rule which 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
|
|
|
|
/* Make sure YYID is used. */
|
|
|
|
return YYID (yyresult);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|