2020-04-28 16:28:03 +02:00
|
|
|
/* A Bison parser, made by GNU Bison 3.5.4. */
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
/* Bison implementation for Yacc-like parsers in C
|
2016-05-07 10:11:14 +02:00
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
Copyright (C) 1984, 1989-1990, 2000-2015, 2018-2020 Free Software Foundation,
|
|
|
|
Inc.
|
2016-05-07 10:11:14 +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.
|
2016-05-07 10:11:14 +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.
|
2016-05-07 10:11:14 +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.
|
2016-05-07 10:11:14 +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. */
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
/* Undocumented macros, especially those whose name start with YY_,
|
|
|
|
are private implementation details. Do not rely on them. */
|
|
|
|
|
2010-04-08 13:37:43 +02:00
|
|
|
/* Identify Bison output. */
|
|
|
|
#define YYBISON 1
|
|
|
|
|
|
|
|
/* Bison version. */
|
2020-04-28 16:28:03 +02:00
|
|
|
#define YYBISON_VERSION "3.5.4"
|
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
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
/* First part of user prologue. */
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2020-05-08 19:28:13 +02:00
|
|
|
/* sconfig, coreboot device tree compiler */
|
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; 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.
|
|
|
|
*/
|
|
|
|
|
2010-05-05 13:19:50 +02:00
|
|
|
#include "sconfig.h"
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
int yylex();
|
|
|
|
void yyerror(const char *s);
|
|
|
|
|
2018-06-03 13:22:17 +02:00
|
|
|
static struct bus *cur_parent;
|
2018-05-31 19:33:16 +02:00
|
|
|
static struct chip_instance *cur_chip_instance;
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
# ifndef YY_CAST
|
|
|
|
# ifdef __cplusplus
|
|
|
|
# define YY_CAST(Type, Val) static_cast<Type> (Val)
|
|
|
|
# define YY_REINTERPRET_CAST(Type, Val) reinterpret_cast<Type> (Val)
|
|
|
|
# else
|
|
|
|
# define YY_CAST(Type, Val) ((Type) (Val))
|
|
|
|
# define YY_REINTERPRET_CAST(Type, Val) ((Type) (Val))
|
|
|
|
# endif
|
|
|
|
# endif
|
2016-05-07 10:11:14 +02:00
|
|
|
# ifndef YY_NULLPTR
|
2020-04-28 16:28:03 +02:00
|
|
|
# if defined __cplusplus
|
|
|
|
# if 201103L <= __cplusplus
|
|
|
|
# define YY_NULLPTR nullptr
|
|
|
|
# else
|
|
|
|
# define YY_NULLPTR 0
|
|
|
|
# endif
|
2016-05-07 10:11:14 +02:00
|
|
|
# else
|
2020-04-28 16:28:03 +02:00
|
|
|
# define YY_NULLPTR ((void*)0)
|
2016-05-07 10:11:14 +02:00
|
|
|
# endif
|
|
|
|
# endif
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
/* Enabling verbose error messages. */
|
|
|
|
#ifdef YYERROR_VERBOSE
|
|
|
|
# undef YYERROR_VERBOSE
|
|
|
|
# define YYERROR_VERBOSE 1
|
|
|
|
#else
|
|
|
|
# define YYERROR_VERBOSE 0
|
|
|
|
#endif
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
/* Use api.header.include to #include this header
|
|
|
|
instead of duplicating it here. */
|
|
|
|
#ifndef YY_YY_HOME_ME_REPOS_COREBOOTORG_COREBOOT_UTIL_SCONFIG_SCONFIG_TAB_H_SHIPPED_INCLUDED
|
|
|
|
# define YY_YY_HOME_ME_REPOS_COREBOOTORG_COREBOOT_UTIL_SCONFIG_SCONFIG_TAB_H_SHIPPED_INCLUDED
|
2016-05-07 10:11:14 +02:00
|
|
|
/* Debug traces. */
|
|
|
|
#ifndef YYDEBUG
|
|
|
|
# define YYDEBUG 0
|
|
|
|
#endif
|
|
|
|
#if YYDEBUG
|
|
|
|
extern int yydebug;
|
2010-04-08 13:37:43 +02:00
|
|
|
#endif
|
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
/* Token type. */
|
2010-04-08 13:37:43 +02:00
|
|
|
#ifndef YYTOKENTYPE
|
|
|
|
# define YYTOKENTYPE
|
2016-05-07 10:11:14 +02:00
|
|
|
enum yytokentype
|
|
|
|
{
|
|
|
|
CHIP = 258,
|
|
|
|
DEVICE = 259,
|
|
|
|
REGISTER = 260,
|
|
|
|
BOOL = 261,
|
Add configurable ramstage support for minimal PCI scanning
This CL has changes that allow us to enable a configurable
ramstage, and one change that allows us to minimize PCI
scanning. Minimal scanning is a frequently requested feature.
To enable it, we add two new variables to src/Kconfig
CONFIGURABLE_RAMSTAGE
is the overall variable controlling other options for minimizing the
ramstage.
MINIMAL_PCI_SCANNING is how we indicate we wish to enable minimal
PCI scanning.
Some devices must be scanned in all cases, such as 0:0.0.
To indicate which devices we must scan, we add a new mandatory
keyword to sconfig
It is used in place of on, off, or hidden, and indicates
a device is enabled and mandatory. Mandatory
devices are always scanned. When MINIMAL_PCI_SCANNING is enabled,
ONLY mandatory devices are scanned.
We further add support in src/device/pci_device.c to manage
both MINIMAL_PCI_SCANNING and mandatory devices.
Finally, to show how this works in practice, we add mandatory
keywords to 3 devices on the qemu-q35.
TEST=
1. This is tested and working on the qemu-q35 target.
2. On CML-Hatch
Before CL:
Total Boot time: ~685ms
After CL:
Total Boot time: ~615ms
Change-Id: I2073d9f8e9297c2b02530821ebb634ea2a5c758e
Signed-off-by: Ronald G. Minnich <rminnich@gmail.com>
Reviewed-on: https://review.coreboot.org/c/coreboot/+/36221
Tested-by: build bot (Jenkins) <no-reply@coreboot.org>
Reviewed-by: Jeremy Soller <jeremy@system76.com>
2019-10-22 04:02:24 +02:00
|
|
|
STATUS = 262,
|
|
|
|
MANDATORY = 263,
|
|
|
|
BUS = 264,
|
|
|
|
RESOURCE = 265,
|
|
|
|
END = 266,
|
|
|
|
EQUALS = 267,
|
|
|
|
HEX = 268,
|
|
|
|
STRING = 269,
|
|
|
|
PCI = 270,
|
|
|
|
PNP = 271,
|
|
|
|
I2C = 272,
|
|
|
|
APIC = 273,
|
|
|
|
CPU_CLUSTER = 274,
|
|
|
|
CPU = 275,
|
|
|
|
DOMAIN = 276,
|
|
|
|
IRQ = 277,
|
|
|
|
DRQ = 278,
|
|
|
|
SLOT_DESC = 279,
|
|
|
|
IO = 280,
|
|
|
|
NUMBER = 281,
|
|
|
|
SUBSYSTEMID = 282,
|
|
|
|
INHERIT = 283,
|
|
|
|
IOAPIC_IRQ = 284,
|
|
|
|
IOAPIC = 285,
|
|
|
|
PCIINT = 286,
|
|
|
|
GENERIC = 287,
|
|
|
|
SPI = 288,
|
|
|
|
USB = 289,
|
|
|
|
MMIO = 290
|
2016-05-07 10:11:14 +02:00
|
|
|
};
|
2010-04-08 13:37:43 +02:00
|
|
|
#endif
|
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
/* Value type. */
|
2010-04-08 13:37:43 +02:00
|
|
|
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
|
2016-05-07 10:11:14 +02:00
|
|
|
union YYSTYPE
|
2010-04-08 13:37:43 +02:00
|
|
|
{
|
|
|
|
|
2018-06-03 13:22:17 +02:00
|
|
|
struct device *dev;
|
2018-05-31 19:33:16 +02:00
|
|
|
struct chip_instance *chip_instance;
|
2010-04-08 13:37:43 +02:00
|
|
|
char *string;
|
|
|
|
int number;
|
|
|
|
|
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
};
|
|
|
|
typedef union YYSTYPE YYSTYPE;
|
2010-04-08 13:37:43 +02:00
|
|
|
# define YYSTYPE_IS_TRIVIAL 1
|
|
|
|
# define YYSTYPE_IS_DECLARED 1
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
extern YYSTYPE yylval;
|
|
|
|
|
|
|
|
int yyparse (void);
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
#endif /* !YY_YY_HOME_ME_REPOS_COREBOOTORG_COREBOOT_UTIL_SCONFIG_SCONFIG_TAB_H_SHIPPED_INCLUDED */
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#ifdef short
|
|
|
|
# undef short
|
|
|
|
#endif
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
/* On compilers that do not define __PTRDIFF_MAX__ etc., make sure
|
|
|
|
<limits.h> and (if available) <stdint.h> are included
|
|
|
|
so that the code can choose integer types of a good width. */
|
|
|
|
|
|
|
|
#ifndef __PTRDIFF_MAX__
|
|
|
|
# include <limits.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
# if defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
|
|
|
|
# include <stdint.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
# define YY_STDINT_H
|
|
|
|
# endif
|
2010-04-08 13:37:43 +02:00
|
|
|
#endif
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
/* Narrow types that promote to a signed type and that can represent a
|
|
|
|
signed or unsigned integer of at least N bits. In tables they can
|
|
|
|
save space and decrease cache pressure. Promoting to a signed type
|
|
|
|
helps avoid bugs in integer arithmetic. */
|
|
|
|
|
|
|
|
#ifdef __INT_LEAST8_MAX__
|
|
|
|
typedef __INT_LEAST8_TYPE__ yytype_int8;
|
|
|
|
#elif defined YY_STDINT_H
|
|
|
|
typedef int_least8_t yytype_int8;
|
2010-04-08 13:37:43 +02:00
|
|
|
#else
|
2016-05-07 10:11:14 +02:00
|
|
|
typedef signed char yytype_int8;
|
2010-04-08 13:37:43 +02:00
|
|
|
#endif
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
#ifdef __INT_LEAST16_MAX__
|
|
|
|
typedef __INT_LEAST16_TYPE__ yytype_int16;
|
|
|
|
#elif defined YY_STDINT_H
|
|
|
|
typedef int_least16_t yytype_int16;
|
2010-04-08 13:37:43 +02:00
|
|
|
#else
|
2020-04-28 16:28:03 +02:00
|
|
|
typedef short yytype_int16;
|
2010-04-08 13:37:43 +02:00
|
|
|
#endif
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
#if defined __UINT_LEAST8_MAX__ && __UINT_LEAST8_MAX__ <= __INT_MAX__
|
|
|
|
typedef __UINT_LEAST8_TYPE__ yytype_uint8;
|
|
|
|
#elif (!defined __UINT_LEAST8_MAX__ && defined YY_STDINT_H \
|
|
|
|
&& UINT_LEAST8_MAX <= INT_MAX)
|
|
|
|
typedef uint_least8_t yytype_uint8;
|
|
|
|
#elif !defined __UINT_LEAST8_MAX__ && UCHAR_MAX <= INT_MAX
|
|
|
|
typedef unsigned char yytype_uint8;
|
2010-04-08 13:37:43 +02:00
|
|
|
#else
|
2020-04-28 16:28:03 +02:00
|
|
|
typedef short yytype_uint8;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#if defined __UINT_LEAST16_MAX__ && __UINT_LEAST16_MAX__ <= __INT_MAX__
|
|
|
|
typedef __UINT_LEAST16_TYPE__ yytype_uint16;
|
|
|
|
#elif (!defined __UINT_LEAST16_MAX__ && defined YY_STDINT_H \
|
|
|
|
&& UINT_LEAST16_MAX <= INT_MAX)
|
|
|
|
typedef uint_least16_t yytype_uint16;
|
|
|
|
#elif !defined __UINT_LEAST16_MAX__ && USHRT_MAX <= INT_MAX
|
|
|
|
typedef unsigned short yytype_uint16;
|
|
|
|
#else
|
|
|
|
typedef int yytype_uint16;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifndef YYPTRDIFF_T
|
|
|
|
# if defined __PTRDIFF_TYPE__ && defined __PTRDIFF_MAX__
|
|
|
|
# define YYPTRDIFF_T __PTRDIFF_TYPE__
|
|
|
|
# define YYPTRDIFF_MAXIMUM __PTRDIFF_MAX__
|
|
|
|
# elif defined PTRDIFF_MAX
|
|
|
|
# ifndef ptrdiff_t
|
|
|
|
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
# endif
|
|
|
|
# define YYPTRDIFF_T ptrdiff_t
|
|
|
|
# define YYPTRDIFF_MAXIMUM PTRDIFF_MAX
|
|
|
|
# else
|
|
|
|
# define YYPTRDIFF_T long
|
|
|
|
# define YYPTRDIFF_MAXIMUM LONG_MAX
|
|
|
|
# endif
|
2010-04-08 13:37:43 +02:00
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifndef YYSIZE_T
|
|
|
|
# ifdef __SIZE_TYPE__
|
|
|
|
# define YYSIZE_T __SIZE_TYPE__
|
|
|
|
# elif defined size_t
|
|
|
|
# define YYSIZE_T size_t
|
2020-04-28 16:28:03 +02:00
|
|
|
# elif defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
|
2010-04-08 13:37:43 +02:00
|
|
|
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
# define YYSIZE_T size_t
|
|
|
|
# else
|
2020-04-28 16:28:03 +02:00
|
|
|
# define YYSIZE_T unsigned
|
2010-04-08 13:37:43 +02:00
|
|
|
# endif
|
|
|
|
#endif
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
#define YYSIZE_MAXIMUM \
|
|
|
|
YY_CAST (YYPTRDIFF_T, \
|
|
|
|
(YYPTRDIFF_MAXIMUM < YY_CAST (YYSIZE_T, -1) \
|
|
|
|
? YYPTRDIFF_MAXIMUM \
|
|
|
|
: YY_CAST (YYSIZE_T, -1)))
|
|
|
|
|
|
|
|
#define YYSIZEOF(X) YY_CAST (YYPTRDIFF_T, sizeof (X))
|
|
|
|
|
|
|
|
/* Stored state numbers (used for stacks). */
|
|
|
|
typedef yytype_int8 yy_state_t;
|
|
|
|
|
|
|
|
/* State numbers in computations. */
|
|
|
|
typedef int yy_state_fast_t;
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
#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 */
|
2016-05-07 10:11:14 +02:00
|
|
|
# define YY_(Msgid) dgettext ("bison-runtime", Msgid)
|
2010-04-08 13:37:43 +02:00
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
# ifndef YY_
|
2016-05-07 10:11:14 +02:00
|
|
|
# define YY_(Msgid) Msgid
|
|
|
|
# endif
|
|
|
|
#endif
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
#ifndef YY_ATTRIBUTE_PURE
|
|
|
|
# if defined __GNUC__ && 2 < __GNUC__ + (96 <= __GNUC_MINOR__)
|
|
|
|
# define YY_ATTRIBUTE_PURE __attribute__ ((__pure__))
|
2016-05-07 10:11:14 +02:00
|
|
|
# else
|
2020-04-28 16:28:03 +02:00
|
|
|
# define YY_ATTRIBUTE_PURE
|
2016-05-07 10:11:14 +02:00
|
|
|
# endif
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifndef YY_ATTRIBUTE_UNUSED
|
2020-04-28 16:28:03 +02:00
|
|
|
# if defined __GNUC__ && 2 < __GNUC__ + (7 <= __GNUC_MINOR__)
|
|
|
|
# define YY_ATTRIBUTE_UNUSED __attribute__ ((__unused__))
|
2016-05-07 10:11:14 +02:00
|
|
|
# else
|
2020-04-28 16:28:03 +02:00
|
|
|
# define YY_ATTRIBUTE_UNUSED
|
2010-04-08 13:37:43 +02:00
|
|
|
# endif
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Suppress unused-variable warnings by "using" E. */
|
|
|
|
#if ! defined lint || defined __GNUC__
|
2016-05-07 10:11:14 +02:00
|
|
|
# define YYUSE(E) ((void) (E))
|
2010-04-08 13:37:43 +02:00
|
|
|
#else
|
2016-05-07 10:11:14 +02:00
|
|
|
# define YYUSE(E) /* empty */
|
2010-04-08 13:37:43 +02:00
|
|
|
#endif
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
#if defined __GNUC__ && ! defined __ICC && 407 <= __GNUC__ * 100 + __GNUC_MINOR__
|
2016-05-07 10:11:14 +02:00
|
|
|
/* Suppress an incorrect diagnostic about yylval being uninitialized. */
|
2020-04-28 16:28:03 +02:00
|
|
|
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
|
|
|
|
_Pragma ("GCC diagnostic push") \
|
|
|
|
_Pragma ("GCC diagnostic ignored \"-Wuninitialized\"") \
|
2016-05-07 10:11:14 +02:00
|
|
|
_Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"")
|
2020-04-28 16:28:03 +02:00
|
|
|
# define YY_IGNORE_MAYBE_UNINITIALIZED_END \
|
2016-05-07 10:11:14 +02:00
|
|
|
_Pragma ("GCC diagnostic pop")
|
2010-04-08 13:37:43 +02:00
|
|
|
#else
|
2016-05-07 10:11:14 +02:00
|
|
|
# define YY_INITIAL_VALUE(Value) Value
|
2010-04-08 13:37:43 +02:00
|
|
|
#endif
|
2016-05-07 10:11:14 +02:00
|
|
|
#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. */
|
2010-04-08 13:37:43 +02:00
|
|
|
#endif
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
#if defined __cplusplus && defined __GNUC__ && ! defined __ICC && 6 <= __GNUC__
|
|
|
|
# define YY_IGNORE_USELESS_CAST_BEGIN \
|
|
|
|
_Pragma ("GCC diagnostic push") \
|
|
|
|
_Pragma ("GCC diagnostic ignored \"-Wuseless-cast\"")
|
|
|
|
# define YY_IGNORE_USELESS_CAST_END \
|
|
|
|
_Pragma ("GCC diagnostic pop")
|
|
|
|
#endif
|
|
|
|
#ifndef YY_IGNORE_USELESS_CAST_BEGIN
|
|
|
|
# define YY_IGNORE_USELESS_CAST_BEGIN
|
|
|
|
# define YY_IGNORE_USELESS_CAST_END
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
#define YY_ASSERT(E) ((void) (0 && (E)))
|
2016-05-07 10:11:14 +02:00
|
|
|
|
2010-04-08 13:37:43 +02:00
|
|
|
#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
|
2016-05-07 10:11:14 +02:00
|
|
|
# if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS
|
2010-04-08 13:37:43 +02:00
|
|
|
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
|
2016-05-07 10:11:14 +02:00
|
|
|
/* Use EXIT_SUCCESS as a witness for stdlib.h. */
|
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
|
2016-05-07 10:11:14 +02:00
|
|
|
/* Pacify GCC's 'empty if-body' warning. */
|
|
|
|
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
|
2010-04-08 13:37:43 +02:00
|
|
|
# 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) \
|
2016-05-07 10:11:14 +02:00
|
|
|
&& (defined YYFREE || defined free)))
|
2010-04-08 13:37:43 +02:00
|
|
|
# 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
|
2016-05-07 10:11:14 +02:00
|
|
|
# if ! defined malloc && ! defined EXIT_SUCCESS
|
2010-04-08 13:37:43 +02:00
|
|
|
void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
# ifndef YYFREE
|
|
|
|
# define YYFREE free
|
2016-05-07 10:11:14 +02:00
|
|
|
# if ! defined free && ! defined EXIT_SUCCESS
|
2010-04-08 13:37:43 +02:00
|
|
|
void free (void *); /* INFRINGES ON USER NAME SPACE */
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
# endif
|
|
|
|
#endif /* ! defined yyoverflow || YYERROR_VERBOSE */
|
|
|
|
|
|
|
|
|
|
|
|
#if (! defined yyoverflow \
|
|
|
|
&& (! defined __cplusplus \
|
2016-05-07 10:11:14 +02:00
|
|
|
|| (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
/* A type that is properly aligned for any stack member. */
|
|
|
|
union yyalloc
|
|
|
|
{
|
2020-04-28 16:28:03 +02:00
|
|
|
yy_state_t yyss_alloc;
|
2010-04-08 13:37:43 +02:00
|
|
|
YYSTYPE yyvs_alloc;
|
|
|
|
};
|
|
|
|
|
|
|
|
/* The size of the maximum gap between one aligned stack and the next. */
|
2020-04-28 16:28:03 +02:00
|
|
|
# define YYSTACK_GAP_MAXIMUM (YYSIZEOF (union yyalloc) - 1)
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
/* The size of an array large to enough to hold all stacks, each with
|
|
|
|
N elements. */
|
|
|
|
# define YYSTACK_BYTES(N) \
|
2020-04-28 16:28:03 +02:00
|
|
|
((N) * (YYSIZEOF (yy_state_t) + YYSIZEOF (YYSTYPE)) \
|
2010-04-08 13:37:43 +02:00
|
|
|
+ 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. */
|
2016-05-07 10:11:14 +02:00
|
|
|
# define YYSTACK_RELOCATE(Stack_alloc, Stack) \
|
|
|
|
do \
|
|
|
|
{ \
|
2020-04-28 16:28:03 +02:00
|
|
|
YYPTRDIFF_T yynewbytes; \
|
2016-05-07 10:11:14 +02:00
|
|
|
YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \
|
|
|
|
Stack = &yyptr->Stack_alloc; \
|
2020-04-28 16:28:03 +02:00
|
|
|
yynewbytes = yystacksize * YYSIZEOF (*Stack) + YYSTACK_GAP_MAXIMUM; \
|
|
|
|
yyptr += yynewbytes / YYSIZEOF (*yyptr); \
|
2016-05-07 10:11:14 +02:00
|
|
|
} \
|
|
|
|
while (0)
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
#endif
|
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
#if defined YYCOPY_NEEDED && YYCOPY_NEEDED
|
2016-05-07 10:11:14 +02:00
|
|
|
/* Copy COUNT objects from SRC to DST. The source and destination do
|
2012-06-21 22:19:48 +02:00
|
|
|
not overlap. */
|
|
|
|
# ifndef YYCOPY
|
|
|
|
# if defined __GNUC__ && 1 < __GNUC__
|
2016-05-07 10:11:14 +02:00
|
|
|
# define YYCOPY(Dst, Src, Count) \
|
2020-04-28 16:28:03 +02:00
|
|
|
__builtin_memcpy (Dst, Src, YY_CAST (YYSIZE_T, (Count)) * sizeof (*(Src)))
|
2012-06-21 22:19:48 +02:00
|
|
|
# else
|
2016-05-07 10:11:14 +02:00
|
|
|
# define YYCOPY(Dst, Src, Count) \
|
|
|
|
do \
|
|
|
|
{ \
|
2020-04-28 16:28:03 +02:00
|
|
|
YYPTRDIFF_T yyi; \
|
2016-05-07 10:11:14 +02:00
|
|
|
for (yyi = 0; yyi < (Count); yyi++) \
|
|
|
|
(Dst)[yyi] = (Src)[yyi]; \
|
|
|
|
} \
|
|
|
|
while (0)
|
2012-06-21 22:19:48 +02:00
|
|
|
# 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. */
|
2020-04-28 16:28:03 +02:00
|
|
|
#define YYLAST 45
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
/* YYNTOKENS -- Number of terminals. */
|
Add configurable ramstage support for minimal PCI scanning
This CL has changes that allow us to enable a configurable
ramstage, and one change that allows us to minimize PCI
scanning. Minimal scanning is a frequently requested feature.
To enable it, we add two new variables to src/Kconfig
CONFIGURABLE_RAMSTAGE
is the overall variable controlling other options for minimizing the
ramstage.
MINIMAL_PCI_SCANNING is how we indicate we wish to enable minimal
PCI scanning.
Some devices must be scanned in all cases, such as 0:0.0.
To indicate which devices we must scan, we add a new mandatory
keyword to sconfig
It is used in place of on, off, or hidden, and indicates
a device is enabled and mandatory. Mandatory
devices are always scanned. When MINIMAL_PCI_SCANNING is enabled,
ONLY mandatory devices are scanned.
We further add support in src/device/pci_device.c to manage
both MINIMAL_PCI_SCANNING and mandatory devices.
Finally, to show how this works in practice, we add mandatory
keywords to 3 devices on the qemu-q35.
TEST=
1. This is tested and working on the qemu-q35 target.
2. On CML-Hatch
Before CL:
Total Boot time: ~685ms
After CL:
Total Boot time: ~615ms
Change-Id: I2073d9f8e9297c2b02530821ebb634ea2a5c758e
Signed-off-by: Ronald G. Minnich <rminnich@gmail.com>
Reviewed-on: https://review.coreboot.org/c/coreboot/+/36221
Tested-by: build bot (Jenkins) <no-reply@coreboot.org>
Reviewed-by: Jeremy Soller <jeremy@system76.com>
2019-10-22 04:02:24 +02:00
|
|
|
#define YYNTOKENS 36
|
2010-04-08 13:37:43 +02:00
|
|
|
/* YYNNTS -- Number of nonterminals. */
|
2019-04-12 14:42:17 +02:00
|
|
|
#define YYNNTS 15
|
2010-04-08 13:37:43 +02:00
|
|
|
/* YYNRULES -- Number of rules. */
|
2020-04-28 16:28:03 +02:00
|
|
|
#define YYNRULES 29
|
2016-05-07 10:11:14 +02:00
|
|
|
/* YYNSTATES -- Number of states. */
|
2020-04-28 16:28:03 +02:00
|
|
|
#define YYNSTATES 50
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
#define YYUNDEFTOK 2
|
Add configurable ramstage support for minimal PCI scanning
This CL has changes that allow us to enable a configurable
ramstage, and one change that allows us to minimize PCI
scanning. Minimal scanning is a frequently requested feature.
To enable it, we add two new variables to src/Kconfig
CONFIGURABLE_RAMSTAGE
is the overall variable controlling other options for minimizing the
ramstage.
MINIMAL_PCI_SCANNING is how we indicate we wish to enable minimal
PCI scanning.
Some devices must be scanned in all cases, such as 0:0.0.
To indicate which devices we must scan, we add a new mandatory
keyword to sconfig
It is used in place of on, off, or hidden, and indicates
a device is enabled and mandatory. Mandatory
devices are always scanned. When MINIMAL_PCI_SCANNING is enabled,
ONLY mandatory devices are scanned.
We further add support in src/device/pci_device.c to manage
both MINIMAL_PCI_SCANNING and mandatory devices.
Finally, to show how this works in practice, we add mandatory
keywords to 3 devices on the qemu-q35.
TEST=
1. This is tested and working on the qemu-q35 target.
2. On CML-Hatch
Before CL:
Total Boot time: ~685ms
After CL:
Total Boot time: ~615ms
Change-Id: I2073d9f8e9297c2b02530821ebb634ea2a5c758e
Signed-off-by: Ronald G. Minnich <rminnich@gmail.com>
Reviewed-on: https://review.coreboot.org/c/coreboot/+/36221
Tested-by: build bot (Jenkins) <no-reply@coreboot.org>
Reviewed-by: Jeremy Soller <jeremy@system76.com>
2019-10-22 04:02:24 +02:00
|
|
|
#define YYMAXUTOK 290
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
|
|
|
|
/* YYTRANSLATE(TOKEN-NUM) -- Symbol number corresponding to TOKEN-NUM
|
|
|
|
as returned by yylex, with out-of-bounds checking. */
|
2016-05-07 10:11:14 +02:00
|
|
|
#define YYTRANSLATE(YYX) \
|
2020-04-28 16:28:03 +02:00
|
|
|
(0 <= (YYX) && (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
/* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM
|
2020-04-28 16:28:03 +02:00
|
|
|
as returned by yylex. */
|
|
|
|
static const yytype_int8 yytranslate[] =
|
2010-04-08 13:37:43 +02:00
|
|
|
{
|
|
|
|
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,
|
Add configurable ramstage support for minimal PCI scanning
This CL has changes that allow us to enable a configurable
ramstage, and one change that allows us to minimize PCI
scanning. Minimal scanning is a frequently requested feature.
To enable it, we add two new variables to src/Kconfig
CONFIGURABLE_RAMSTAGE
is the overall variable controlling other options for minimizing the
ramstage.
MINIMAL_PCI_SCANNING is how we indicate we wish to enable minimal
PCI scanning.
Some devices must be scanned in all cases, such as 0:0.0.
To indicate which devices we must scan, we add a new mandatory
keyword to sconfig
It is used in place of on, off, or hidden, and indicates
a device is enabled and mandatory. Mandatory
devices are always scanned. When MINIMAL_PCI_SCANNING is enabled,
ONLY mandatory devices are scanned.
We further add support in src/device/pci_device.c to manage
both MINIMAL_PCI_SCANNING and mandatory devices.
Finally, to show how this works in practice, we add mandatory
keywords to 3 devices on the qemu-q35.
TEST=
1. This is tested and working on the qemu-q35 target.
2. On CML-Hatch
Before CL:
Total Boot time: ~685ms
After CL:
Total Boot time: ~615ms
Change-Id: I2073d9f8e9297c2b02530821ebb634ea2a5c758e
Signed-off-by: Ronald G. Minnich <rminnich@gmail.com>
Reviewed-on: https://review.coreboot.org/c/coreboot/+/36221
Tested-by: build bot (Jenkins) <no-reply@coreboot.org>
Reviewed-by: Jeremy Soller <jeremy@system76.com>
2019-10-22 04:02:24 +02:00
|
|
|
25, 26, 27, 28, 29, 30, 31, 32, 33, 34,
|
|
|
|
35
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
#if YYDEBUG
|
2016-05-07 10:11:14 +02:00
|
|
|
/* YYRLINE[YYN] -- Source line where rule number YYN was defined. */
|
2020-04-28 16:28:03 +02:00
|
|
|
static const yytype_int8 yyrline[] =
|
2010-04-08 13:37:43 +02:00
|
|
|
{
|
2018-05-31 00:09:09 +02:00
|
|
|
0, 36, 36, 36, 38, 38, 38, 38, 40, 40,
|
2020-04-28 16:28:03 +02:00
|
|
|
40, 40, 40, 40, 40, 40, 42, 42, 51, 51,
|
|
|
|
59, 59, 61, 64, 67, 70, 73, 76, 79, 82
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
#if YYDEBUG || YYERROR_VERBOSE || 0
|
2010-04-08 13:37:43 +02:00
|
|
|
/* 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",
|
Add configurable ramstage support for minimal PCI scanning
This CL has changes that allow us to enable a configurable
ramstage, and one change that allows us to minimize PCI
scanning. Minimal scanning is a frequently requested feature.
To enable it, we add two new variables to src/Kconfig
CONFIGURABLE_RAMSTAGE
is the overall variable controlling other options for minimizing the
ramstage.
MINIMAL_PCI_SCANNING is how we indicate we wish to enable minimal
PCI scanning.
Some devices must be scanned in all cases, such as 0:0.0.
To indicate which devices we must scan, we add a new mandatory
keyword to sconfig
It is used in place of on, off, or hidden, and indicates
a device is enabled and mandatory. Mandatory
devices are always scanned. When MINIMAL_PCI_SCANNING is enabled,
ONLY mandatory devices are scanned.
We further add support in src/device/pci_device.c to manage
both MINIMAL_PCI_SCANNING and mandatory devices.
Finally, to show how this works in practice, we add mandatory
keywords to 3 devices on the qemu-q35.
TEST=
1. This is tested and working on the qemu-q35 target.
2. On CML-Hatch
Before CL:
Total Boot time: ~685ms
After CL:
Total Boot time: ~615ms
Change-Id: I2073d9f8e9297c2b02530821ebb634ea2a5c758e
Signed-off-by: Ronald G. Minnich <rminnich@gmail.com>
Reviewed-on: https://review.coreboot.org/c/coreboot/+/36221
Tested-by: build bot (Jenkins) <no-reply@coreboot.org>
Reviewed-by: Jeremy Soller <jeremy@system76.com>
2019-10-22 04:02:24 +02:00
|
|
|
"STATUS", "MANDATORY", "BUS", "RESOURCE", "END", "EQUALS", "HEX",
|
|
|
|
"STRING", "PCI", "PNP", "I2C", "APIC", "CPU_CLUSTER", "CPU", "DOMAIN",
|
|
|
|
"IRQ", "DRQ", "SLOT_DESC", "IO", "NUMBER", "SUBSYSTEMID", "INHERIT",
|
|
|
|
"IOAPIC_IRQ", "IOAPIC", "PCIINT", "GENERIC", "SPI", "USB", "MMIO",
|
|
|
|
"$accept", "devtree", "$@1", "chipchildren", "devicechildren", "chip",
|
|
|
|
"@2", "device", "@3", "status", "resource", "registers", "subsystemid",
|
2019-04-12 14:42:17 +02:00
|
|
|
"ioapic_irq", "smbios_slot_desc", YY_NULLPTR
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
|
|
|
# ifdef YYPRINT
|
2016-05-07 10:11:14 +02:00
|
|
|
/* YYTOKNUM[NUM] -- (External) token number corresponding to the
|
|
|
|
(internal) symbol number NUM (which must be that of a token). */
|
2020-04-28 16:28:03 +02:00
|
|
|
static const yytype_int16 yytoknum[] =
|
2010-04-08 13:37:43 +02:00
|
|
|
{
|
|
|
|
0, 256, 257, 258, 259, 260, 261, 262, 263, 264,
|
|
|
|
265, 266, 267, 268, 269, 270, 271, 272, 273, 274,
|
2017-02-11 09:50:38 +01:00
|
|
|
275, 276, 277, 278, 279, 280, 281, 282, 283, 284,
|
Add configurable ramstage support for minimal PCI scanning
This CL has changes that allow us to enable a configurable
ramstage, and one change that allows us to minimize PCI
scanning. Minimal scanning is a frequently requested feature.
To enable it, we add two new variables to src/Kconfig
CONFIGURABLE_RAMSTAGE
is the overall variable controlling other options for minimizing the
ramstage.
MINIMAL_PCI_SCANNING is how we indicate we wish to enable minimal
PCI scanning.
Some devices must be scanned in all cases, such as 0:0.0.
To indicate which devices we must scan, we add a new mandatory
keyword to sconfig
It is used in place of on, off, or hidden, and indicates
a device is enabled and mandatory. Mandatory
devices are always scanned. When MINIMAL_PCI_SCANNING is enabled,
ONLY mandatory devices are scanned.
We further add support in src/device/pci_device.c to manage
both MINIMAL_PCI_SCANNING and mandatory devices.
Finally, to show how this works in practice, we add mandatory
keywords to 3 devices on the qemu-q35.
TEST=
1. This is tested and working on the qemu-q35 target.
2. On CML-Hatch
Before CL:
Total Boot time: ~685ms
After CL:
Total Boot time: ~615ms
Change-Id: I2073d9f8e9297c2b02530821ebb634ea2a5c758e
Signed-off-by: Ronald G. Minnich <rminnich@gmail.com>
Reviewed-on: https://review.coreboot.org/c/coreboot/+/36221
Tested-by: build bot (Jenkins) <no-reply@coreboot.org>
Reviewed-by: Jeremy Soller <jeremy@system76.com>
2019-10-22 04:02:24 +02:00
|
|
|
285, 286, 287, 288, 289, 290
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
# endif
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
#define YYPACT_NINF (-10)
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
#define yypact_value_is_default(Yyn) \
|
|
|
|
((Yyn) == YYPACT_NINF)
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
#define YYTABLE_NINF (-1)
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
#define yytable_value_is_error(Yyn) \
|
2016-05-07 10:11:14 +02:00
|
|
|
0
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
|
|
|
|
STATE-NUM. */
|
2010-04-08 13:37:43 +02:00
|
|
|
static const yytype_int8 yypact[] =
|
|
|
|
{
|
2020-04-28 16:28:03 +02:00
|
|
|
-10, 11, 10, -10, 0, -10, -10, -10, 1, 6,
|
|
|
|
2, -10, -10, -10, -10, -9, 8, 3, 4, -10,
|
|
|
|
-10, -10, -10, -10, -3, -4, -10, 9, -1, 5,
|
|
|
|
-10, -10, -10, -10, -10, -10, -10, 15, 14, 7,
|
|
|
|
-2, 12, 16, 13, 17, -10, 18, -10, -10, -10
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
/* 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. */
|
2020-04-28 16:28:03 +02:00
|
|
|
static const yytype_int8 yydefact[] =
|
2016-05-07 10:11:14 +02:00
|
|
|
{
|
2020-04-28 16:28:03 +02:00
|
|
|
2, 0, 0, 1, 0, 3, 16, 7, 0, 0,
|
|
|
|
0, 17, 5, 4, 6, 0, 0, 0, 0, 20,
|
|
|
|
21, 18, 23, 15, 0, 0, 19, 0, 0, 0,
|
|
|
|
9, 8, 10, 14, 11, 12, 13, 0, 0, 0,
|
|
|
|
0, 0, 29, 24, 0, 22, 28, 25, 26, 27
|
2016-05-07 10:11:14 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
/* YYPGOTO[NTERM-NUM]. */
|
2010-04-08 13:37:43 +02:00
|
|
|
static const yytype_int8 yypgoto[] =
|
|
|
|
{
|
2020-04-28 16:28:03 +02:00
|
|
|
-10, -10, -10, -10, -10, -5, -10, 20, -10, -10,
|
|
|
|
-10, 21, -10, -10, -10
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
/* YYDEFGOTO[NTERM-NUM]. */
|
|
|
|
static const yytype_int8 yydefgoto[] =
|
|
|
|
{
|
2018-09-10 04:51:26 +02:00
|
|
|
-1, 1, 2, 8, 24, 5, 7, 13, 23, 21,
|
2020-04-28 16:28:03 +02:00
|
|
|
32, 14, 34, 35, 36
|
2016-05-07 10:11:14 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
/* 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. */
|
2020-04-28 16:28:03 +02:00
|
|
|
static const yytype_int8 yytable[] =
|
2010-04-08 13:37:43 +02:00
|
|
|
{
|
2020-04-28 16:28:03 +02:00
|
|
|
4, 9, 10, 12, 4, 9, 10, 25, 26, 19,
|
|
|
|
20, 3, 11, 4, 6, 15, 16, 17, 22, 30,
|
|
|
|
18, 27, 37, 38, 28, 39, 29, 41, 42, 44,
|
|
|
|
46, 40, 49, 43, 0, 0, 0, 0, 45, 0,
|
|
|
|
0, 47, 0, 48, 31, 33
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
|
2010-05-05 15:13:47 +02:00
|
|
|
static const yytype_int8 yycheck[] =
|
2010-04-08 13:37:43 +02:00
|
|
|
{
|
2020-04-28 16:28:03 +02:00
|
|
|
3, 4, 5, 8, 3, 4, 5, 10, 11, 6,
|
|
|
|
7, 0, 11, 3, 14, 9, 14, 26, 14, 24,
|
|
|
|
12, 24, 26, 14, 27, 26, 29, 12, 14, 31,
|
|
|
|
14, 26, 14, 26, -1, -1, -1, -1, 26, -1,
|
|
|
|
-1, 28, -1, 26, 24, 24
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
|
|
|
|
symbol of state STATE-NUM. */
|
2020-04-28 16:28:03 +02:00
|
|
|
static const yytype_int8 yystos[] =
|
2010-04-08 13:37:43 +02:00
|
|
|
{
|
Add configurable ramstage support for minimal PCI scanning
This CL has changes that allow us to enable a configurable
ramstage, and one change that allows us to minimize PCI
scanning. Minimal scanning is a frequently requested feature.
To enable it, we add two new variables to src/Kconfig
CONFIGURABLE_RAMSTAGE
is the overall variable controlling other options for minimizing the
ramstage.
MINIMAL_PCI_SCANNING is how we indicate we wish to enable minimal
PCI scanning.
Some devices must be scanned in all cases, such as 0:0.0.
To indicate which devices we must scan, we add a new mandatory
keyword to sconfig
It is used in place of on, off, or hidden, and indicates
a device is enabled and mandatory. Mandatory
devices are always scanned. When MINIMAL_PCI_SCANNING is enabled,
ONLY mandatory devices are scanned.
We further add support in src/device/pci_device.c to manage
both MINIMAL_PCI_SCANNING and mandatory devices.
Finally, to show how this works in practice, we add mandatory
keywords to 3 devices on the qemu-q35.
TEST=
1. This is tested and working on the qemu-q35 target.
2. On CML-Hatch
Before CL:
Total Boot time: ~685ms
After CL:
Total Boot time: ~615ms
Change-Id: I2073d9f8e9297c2b02530821ebb634ea2a5c758e
Signed-off-by: Ronald G. Minnich <rminnich@gmail.com>
Reviewed-on: https://review.coreboot.org/c/coreboot/+/36221
Tested-by: build bot (Jenkins) <no-reply@coreboot.org>
Reviewed-by: Jeremy Soller <jeremy@system76.com>
2019-10-22 04:02:24 +02:00
|
|
|
0, 37, 38, 0, 3, 41, 14, 42, 39, 4,
|
|
|
|
5, 11, 41, 43, 47, 9, 14, 26, 12, 6,
|
|
|
|
7, 45, 14, 44, 40, 10, 11, 24, 27, 29,
|
2020-04-28 16:28:03 +02:00
|
|
|
41, 43, 46, 47, 48, 49, 50, 26, 14, 26,
|
|
|
|
26, 12, 14, 26, 31, 26, 14, 28, 26, 14
|
2010-04-08 13:37:43 +02:00
|
|
|
};
|
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
|
2020-04-28 16:28:03 +02:00
|
|
|
static const yytype_int8 yyr1[] =
|
2016-05-07 10:11:14 +02:00
|
|
|
{
|
Add configurable ramstage support for minimal PCI scanning
This CL has changes that allow us to enable a configurable
ramstage, and one change that allows us to minimize PCI
scanning. Minimal scanning is a frequently requested feature.
To enable it, we add two new variables to src/Kconfig
CONFIGURABLE_RAMSTAGE
is the overall variable controlling other options for minimizing the
ramstage.
MINIMAL_PCI_SCANNING is how we indicate we wish to enable minimal
PCI scanning.
Some devices must be scanned in all cases, such as 0:0.0.
To indicate which devices we must scan, we add a new mandatory
keyword to sconfig
It is used in place of on, off, or hidden, and indicates
a device is enabled and mandatory. Mandatory
devices are always scanned. When MINIMAL_PCI_SCANNING is enabled,
ONLY mandatory devices are scanned.
We further add support in src/device/pci_device.c to manage
both MINIMAL_PCI_SCANNING and mandatory devices.
Finally, to show how this works in practice, we add mandatory
keywords to 3 devices on the qemu-q35.
TEST=
1. This is tested and working on the qemu-q35 target.
2. On CML-Hatch
Before CL:
Total Boot time: ~685ms
After CL:
Total Boot time: ~615ms
Change-Id: I2073d9f8e9297c2b02530821ebb634ea2a5c758e
Signed-off-by: Ronald G. Minnich <rminnich@gmail.com>
Reviewed-on: https://review.coreboot.org/c/coreboot/+/36221
Tested-by: build bot (Jenkins) <no-reply@coreboot.org>
Reviewed-by: Jeremy Soller <jeremy@system76.com>
2019-10-22 04:02:24 +02:00
|
|
|
0, 36, 38, 37, 39, 39, 39, 39, 40, 40,
|
2020-04-28 16:28:03 +02:00
|
|
|
40, 40, 40, 40, 40, 40, 42, 41, 44, 43,
|
|
|
|
45, 45, 46, 47, 48, 48, 49, 50, 50, 50
|
2016-05-07 10:11:14 +02:00
|
|
|
};
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
/* YYR2[YYN] -- Number of symbols on the right hand side of rule YYN. */
|
2020-04-28 16:28:03 +02:00
|
|
|
static const yytype_int8 yyr2[] =
|
2016-05-07 10:11:14 +02:00
|
|
|
{
|
|
|
|
0, 2, 0, 2, 2, 2, 2, 0, 2, 2,
|
2020-04-28 16:28:03 +02:00
|
|
|
2, 2, 2, 2, 2, 0, 0, 5, 0, 7,
|
|
|
|
1, 1, 4, 4, 3, 4, 4, 5, 4, 3
|
2016-05-07 10:11:14 +02:00
|
|
|
};
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
#define yyerrok (yyerrstatus = 0)
|
|
|
|
#define yyclearin (yychar = YYEMPTY)
|
|
|
|
#define YYEMPTY (-2)
|
|
|
|
#define YYEOF 0
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
#define YYACCEPT goto yyacceptlab
|
|
|
|
#define YYABORT goto yyabortlab
|
|
|
|
#define YYERROR goto yyerrorlab
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
#define YYRECOVERING() (!!yyerrstatus)
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
#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)
|
2016-05-07 10:11:14 +02:00
|
|
|
|
|
|
|
/* Error token number */
|
|
|
|
#define YYTERROR 1
|
|
|
|
#define YYERRCODE 256
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Enable debugging if requested. */
|
|
|
|
#if YYDEBUG
|
|
|
|
|
|
|
|
# ifndef YYFPRINTF
|
|
|
|
# include <stdio.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
# define YYFPRINTF fprintf
|
|
|
|
# endif
|
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
# define YYDPRINTF(Args) \
|
|
|
|
do { \
|
|
|
|
if (yydebug) \
|
|
|
|
YYFPRINTF Args; \
|
|
|
|
} while (0)
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
/* This macro is provided for backward compatibility. */
|
|
|
|
#ifndef YY_LOCATION_PRINT
|
|
|
|
# define YY_LOCATION_PRINT(File, Loc) ((void) 0)
|
|
|
|
#endif
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
# 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)
|
|
|
|
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
/*-----------------------------------.
|
|
|
|
| Print this symbol's value on YYO. |
|
|
|
|
`-----------------------------------*/
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
static void
|
2020-04-28 16:28:03 +02:00
|
|
|
yy_symbol_value_print (FILE *yyo, int yytype, YYSTYPE const * const yyvaluep)
|
2010-04-08 13:37:43 +02:00
|
|
|
{
|
2020-04-28 16:28:03 +02:00
|
|
|
FILE *yyoutput = yyo;
|
|
|
|
YYUSE (yyoutput);
|
2010-04-08 13:37:43 +02:00
|
|
|
if (!yyvaluep)
|
|
|
|
return;
|
|
|
|
# ifdef YYPRINT
|
|
|
|
if (yytype < YYNTOKENS)
|
2020-04-28 16:28:03 +02:00
|
|
|
YYPRINT (yyo, yytoknum[yytype], *yyvaluep);
|
2010-04-08 13:37:43 +02:00
|
|
|
# endif
|
2020-04-28 16:28:03 +02:00
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
|
2016-05-07 10:11:14 +02:00
|
|
|
YYUSE (yytype);
|
2020-04-28 16:28:03 +02:00
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_END
|
2010-04-08 13:37:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
/*---------------------------.
|
|
|
|
| Print this symbol on YYO. |
|
|
|
|
`---------------------------*/
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
static void
|
2020-04-28 16:28:03 +02:00
|
|
|
yy_symbol_print (FILE *yyo, int yytype, YYSTYPE const * const yyvaluep)
|
2010-04-08 13:37:43 +02:00
|
|
|
{
|
2020-04-28 16:28:03 +02:00
|
|
|
YYFPRINTF (yyo, "%s %s (",
|
2016-05-07 10:11:14 +02:00
|
|
|
yytype < YYNTOKENS ? "token" : "nterm", yytname[yytype]);
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
yy_symbol_value_print (yyo, yytype, yyvaluep);
|
|
|
|
YYFPRINTF (yyo, ")");
|
2010-04-08 13:37:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*------------------------------------------------------------------.
|
|
|
|
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
|
|
|
|
| TOP (included). |
|
|
|
|
`------------------------------------------------------------------*/
|
|
|
|
|
|
|
|
static void
|
2020-04-28 16:28:03 +02:00
|
|
|
yy_stack_print (yy_state_t *yybottom, yy_state_t *yytop)
|
2010-04-08 13:37:43 +02:00
|
|
|
{
|
|
|
|
YYFPRINTF (stderr, "Stack now");
|
|
|
|
for (; yybottom <= yytop; yybottom++)
|
|
|
|
{
|
|
|
|
int yybot = *yybottom;
|
|
|
|
YYFPRINTF (stderr, " %d", yybot);
|
|
|
|
}
|
|
|
|
YYFPRINTF (stderr, "\n");
|
|
|
|
}
|
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
# define YY_STACK_PRINT(Bottom, Top) \
|
|
|
|
do { \
|
|
|
|
if (yydebug) \
|
|
|
|
yy_stack_print ((Bottom), (Top)); \
|
|
|
|
} while (0)
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
|
|
|
|
/*------------------------------------------------.
|
|
|
|
| Report that the YYRULE is going to be reduced. |
|
|
|
|
`------------------------------------------------*/
|
|
|
|
|
|
|
|
static void
|
2020-04-28 16:28:03 +02:00
|
|
|
yy_reduce_print (yy_state_t *yyssp, YYSTYPE *yyvsp, int yyrule)
|
2010-04-08 13:37:43 +02:00
|
|
|
{
|
2020-04-28 16:28:03 +02:00
|
|
|
int yylno = yyrline[yyrule];
|
2010-04-08 13:37:43 +02:00
|
|
|
int yynrhs = yyr2[yyrule];
|
|
|
|
int yyi;
|
2020-04-28 16:28:03 +02:00
|
|
|
YYFPRINTF (stderr, "Reducing stack by rule %d (line %d):\n",
|
2016-05-07 10:11:14 +02:00
|
|
|
yyrule - 1, yylno);
|
2010-04-08 13:37:43 +02:00
|
|
|
/* The symbols being reduced. */
|
|
|
|
for (yyi = 0; yyi < yynrhs; yyi++)
|
|
|
|
{
|
|
|
|
YYFPRINTF (stderr, " $%d = ", yyi + 1);
|
2016-05-07 10:11:14 +02:00
|
|
|
yy_symbol_print (stderr,
|
2020-04-28 16:28:03 +02:00
|
|
|
yystos[+yyssp[yyi + 1 - yynrhs]],
|
|
|
|
&yyvsp[(yyi + 1) - (yynrhs)]
|
2016-05-07 10:11:14 +02:00
|
|
|
);
|
2010-04-08 13:37:43 +02:00
|
|
|
YYFPRINTF (stderr, "\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
# define YY_REDUCE_PRINT(Rule) \
|
|
|
|
do { \
|
|
|
|
if (yydebug) \
|
|
|
|
yy_reduce_print (yyssp, yyvsp, Rule); \
|
|
|
|
} while (0)
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
/* 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. */
|
2016-05-07 10:11:14 +02:00
|
|
|
#ifndef YYINITDEPTH
|
2010-04-08 13:37:43 +02:00
|
|
|
# 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
|
2020-04-28 16:28:03 +02:00
|
|
|
# define yystrlen(S) (YY_CAST (YYPTRDIFF_T, strlen (S)))
|
2010-04-08 13:37:43 +02:00
|
|
|
# else
|
|
|
|
/* Return the length of YYSTR. */
|
2020-04-28 16:28:03 +02:00
|
|
|
static YYPTRDIFF_T
|
2010-04-08 13:37:43 +02:00
|
|
|
yystrlen (const char *yystr)
|
|
|
|
{
|
2020-04-28 16:28:03 +02:00
|
|
|
YYPTRDIFF_T yylen;
|
2010-04-08 13:37:43 +02:00
|
|
|
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. */
|
2020-04-28 16:28:03 +02:00
|
|
|
static YYPTRDIFF_T
|
2010-04-08 13:37:43 +02:00
|
|
|
yytnamerr (char *yyres, const char *yystr)
|
|
|
|
{
|
|
|
|
if (*yystr == '"')
|
|
|
|
{
|
2020-04-28 16:28:03 +02:00
|
|
|
YYPTRDIFF_T yyn = 0;
|
2010-04-08 13:37:43 +02:00
|
|
|
char const *yyp = yystr;
|
|
|
|
|
|
|
|
for (;;)
|
2016-05-07 10:11:14 +02:00
|
|
|
switch (*++yyp)
|
|
|
|
{
|
|
|
|
case '\'':
|
|
|
|
case ',':
|
|
|
|
goto do_not_strip_quotes;
|
|
|
|
|
|
|
|
case '\\':
|
|
|
|
if (*++yyp != '\\')
|
|
|
|
goto do_not_strip_quotes;
|
2020-04-28 16:28:03 +02:00
|
|
|
else
|
|
|
|
goto append;
|
|
|
|
|
|
|
|
append:
|
2016-05-07 10:11:14 +02:00
|
|
|
default:
|
|
|
|
if (yyres)
|
|
|
|
yyres[yyn] = *yyp;
|
|
|
|
yyn++;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case '"':
|
|
|
|
if (yyres)
|
|
|
|
yyres[yyn] = '\0';
|
|
|
|
return yyn;
|
|
|
|
}
|
2010-04-08 13:37:43 +02:00
|
|
|
do_not_strip_quotes: ;
|
|
|
|
}
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
if (yyres)
|
|
|
|
return yystpcpy (yyres, yystr) - yyres;
|
|
|
|
else
|
2010-04-08 13:37:43 +02:00
|
|
|
return yystrlen (yystr);
|
|
|
|
}
|
|
|
|
# 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
|
2020-04-28 16:28:03 +02:00
|
|
|
yysyntax_error (YYPTRDIFF_T *yymsg_alloc, char **yymsg,
|
|
|
|
yy_state_t *yyssp, int yytoken)
|
2012-06-21 22:19:48 +02:00
|
|
|
{
|
|
|
|
enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
|
|
|
|
/* Internationalized format string. */
|
2016-05-07 10:11:14 +02:00
|
|
|
const char *yyformat = YY_NULLPTR;
|
2020-04-28 16:28:03 +02:00
|
|
|
/* Arguments of yyformat: reported tokens (one for the "unexpected",
|
|
|
|
one per "expected"). */
|
2012-06-21 22:19:48 +02:00
|
|
|
char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
|
2020-04-28 16:28:03 +02:00
|
|
|
/* Actual size of YYARG. */
|
2012-06-21 22:19:48 +02:00
|
|
|
int yycount = 0;
|
2020-04-28 16:28:03 +02:00
|
|
|
/* Cumulated lengths of YYARG. */
|
|
|
|
YYPTRDIFF_T yysize = 0;
|
2012-06-21 22:19:48 +02:00
|
|
|
|
|
|
|
/* 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)
|
2010-04-08 13:37:43 +02:00
|
|
|
{
|
2020-04-28 16:28:03 +02:00
|
|
|
int yyn = yypact[+*yyssp];
|
|
|
|
YYPTRDIFF_T yysize0 = yytnamerr (YY_NULLPTR, yytname[yytoken]);
|
|
|
|
yysize = yysize0;
|
2012-06-21 22:19:48 +02:00
|
|
|
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];
|
2016-05-07 10:11:14 +02:00
|
|
|
{
|
2020-04-28 16:28:03 +02:00
|
|
|
YYPTRDIFF_T yysize1
|
|
|
|
= yysize + yytnamerr (YY_NULLPTR, yytname[yyx]);
|
|
|
|
if (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM)
|
|
|
|
yysize = yysize1;
|
|
|
|
else
|
2016-05-07 10:11:14 +02:00
|
|
|
return 2;
|
|
|
|
}
|
2012-06-21 22:19:48 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
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
|
2020-04-28 16:28:03 +02:00
|
|
|
default: /* Avoid compiler warnings. */
|
2012-06-21 22:19:48 +02:00
|
|
|
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
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
{
|
2020-04-28 16:28:03 +02:00
|
|
|
/* Don't count the "%s"s in the final size, but reserve room for
|
|
|
|
the terminator. */
|
|
|
|
YYPTRDIFF_T yysize1 = yysize + (yystrlen (yyformat) - 2 * yycount) + 1;
|
|
|
|
if (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM)
|
|
|
|
yysize = yysize1;
|
|
|
|
else
|
2016-05-07 10:11:14 +02:00
|
|
|
return 2;
|
|
|
|
}
|
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
|
|
|
|
{
|
2020-04-28 16:28:03 +02:00
|
|
|
++yyp;
|
|
|
|
++yyformat;
|
2012-06-21 22:19:48 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
2010-04-08 13:37:43 +02:00
|
|
|
}
|
|
|
|
#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);
|
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
|
|
|
|
YYUSE (yytype);
|
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_END
|
2010-04-08 13:37:43 +02:00
|
|
|
}
|
|
|
|
|
2012-06-21 22:19:48 +02:00
|
|
|
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
|
|
|
|
/* 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
|
|
|
|
|
|
|
int
|
|
|
|
yyparse (void)
|
|
|
|
{
|
2020-04-28 16:28:03 +02:00
|
|
|
yy_state_fast_t yystate;
|
2010-04-08 13:37:43 +02:00
|
|
|
/* Number of tokens to shift before error messages enabled. */
|
|
|
|
int yyerrstatus;
|
|
|
|
|
|
|
|
/* The stacks and their tools:
|
2016-05-07 10:11:14 +02:00
|
|
|
'yyss': related to states.
|
|
|
|
'yyvs': related to semantic values.
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
Refer to the stacks through separate pointers, to allow yyoverflow
|
2010-04-08 13:37:43 +02:00
|
|
|
to reallocate them elsewhere. */
|
|
|
|
|
|
|
|
/* The state stack. */
|
2020-04-28 16:28:03 +02:00
|
|
|
yy_state_t yyssa[YYINITDEPTH];
|
|
|
|
yy_state_t *yyss;
|
|
|
|
yy_state_t *yyssp;
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
/* The semantic value stack. */
|
|
|
|
YYSTYPE yyvsa[YYINITDEPTH];
|
|
|
|
YYSTYPE *yyvs;
|
|
|
|
YYSTYPE *yyvsp;
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
YYPTRDIFF_T yystacksize;
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
int yyn;
|
|
|
|
int yyresult;
|
|
|
|
/* Lookahead token as an internal (translated) token number. */
|
2016-05-07 10:11:14 +02:00
|
|
|
int yytoken = 0;
|
2010-04-08 13:37:43 +02:00
|
|
|
/* 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;
|
2020-04-28 16:28:03 +02:00
|
|
|
YYPTRDIFF_T yymsg_alloc = sizeof yymsgbuf;
|
2010-04-08 13:37:43 +02:00
|
|
|
#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;
|
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
yyssp = yyss = yyssa;
|
|
|
|
yyvsp = yyvs = yyvsa;
|
2010-04-08 13:37:43 +02:00
|
|
|
yystacksize = YYINITDEPTH;
|
|
|
|
|
|
|
|
YYDPRINTF ((stderr, "Starting parse\n"));
|
|
|
|
|
|
|
|
yystate = 0;
|
|
|
|
yyerrstatus = 0;
|
|
|
|
yynerrs = 0;
|
|
|
|
yychar = YYEMPTY; /* Cause a token to be read. */
|
|
|
|
goto yysetstate;
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
|
2010-04-08 13:37:43 +02:00
|
|
|
/*------------------------------------------------------------.
|
2020-04-28 16:28:03 +02:00
|
|
|
| yynewstate -- push a new state, which is found in yystate. |
|
2010-04-08 13:37:43 +02:00
|
|
|
`------------------------------------------------------------*/
|
2020-04-28 16:28:03 +02:00
|
|
|
yynewstate:
|
2010-04-08 13:37:43 +02:00
|
|
|
/* 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++;
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
|
|
|
|
/*--------------------------------------------------------------------.
|
|
|
|
| yysetstate -- set current state (the top of the stack) to yystate. |
|
|
|
|
`--------------------------------------------------------------------*/
|
|
|
|
yysetstate:
|
|
|
|
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
|
|
|
|
YY_ASSERT (0 <= yystate && yystate < YYNSTATES);
|
|
|
|
YY_IGNORE_USELESS_CAST_BEGIN
|
|
|
|
*yyssp = YY_CAST (yy_state_t, yystate);
|
|
|
|
YY_IGNORE_USELESS_CAST_END
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
if (yyss + yystacksize - 1 <= yyssp)
|
2020-04-28 16:28:03 +02:00
|
|
|
#if !defined yyoverflow && !defined YYSTACK_RELOCATE
|
|
|
|
goto yyexhaustedlab;
|
|
|
|
#else
|
2010-04-08 13:37:43 +02:00
|
|
|
{
|
|
|
|
/* Get the current used size of the three stacks, in elements. */
|
2020-04-28 16:28:03 +02:00
|
|
|
YYPTRDIFF_T yysize = yyssp - yyss + 1;
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
# if defined yyoverflow
|
2010-04-08 13:37:43 +02:00
|
|
|
{
|
2016-05-07 10:11:14 +02:00
|
|
|
/* Give user a chance to reallocate the stack. Use copies of
|
|
|
|
these so that the &'s don't force the real ones into
|
|
|
|
memory. */
|
2020-04-28 16:28:03 +02:00
|
|
|
yy_state_t *yyss1 = yyss;
|
2016-05-07 10:11:14 +02:00
|
|
|
YYSTYPE *yyvs1 = yyvs;
|
|
|
|
|
|
|
|
/* Each stack pointer address is followed by the size of the
|
|
|
|
data in use in that stack, in bytes. This used to be a
|
|
|
|
conditional around just the two extra args, but that might
|
|
|
|
be undefined if yyoverflow is a macro. */
|
|
|
|
yyoverflow (YY_("memory exhausted"),
|
2020-04-28 16:28:03 +02:00
|
|
|
&yyss1, yysize * YYSIZEOF (*yyssp),
|
|
|
|
&yyvs1, yysize * YYSIZEOF (*yyvsp),
|
2016-05-07 10:11:14 +02:00
|
|
|
&yystacksize);
|
|
|
|
yyss = yyss1;
|
|
|
|
yyvs = yyvs1;
|
2010-04-08 13:37:43 +02:00
|
|
|
}
|
2020-04-28 16:28:03 +02:00
|
|
|
# else /* defined YYSTACK_RELOCATE */
|
2010-04-08 13:37:43 +02:00
|
|
|
/* Extend the stack our own way. */
|
|
|
|
if (YYMAXDEPTH <= yystacksize)
|
2016-05-07 10:11:14 +02:00
|
|
|
goto yyexhaustedlab;
|
2010-04-08 13:37:43 +02:00
|
|
|
yystacksize *= 2;
|
|
|
|
if (YYMAXDEPTH < yystacksize)
|
2016-05-07 10:11:14 +02:00
|
|
|
yystacksize = YYMAXDEPTH;
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
{
|
2020-04-28 16:28:03 +02:00
|
|
|
yy_state_t *yyss1 = yyss;
|
2016-05-07 10:11:14 +02:00
|
|
|
union yyalloc *yyptr =
|
2020-04-28 16:28:03 +02:00
|
|
|
YY_CAST (union yyalloc *,
|
|
|
|
YYSTACK_ALLOC (YY_CAST (YYSIZE_T, YYSTACK_BYTES (yystacksize))));
|
2016-05-07 10:11:14 +02:00
|
|
|
if (! yyptr)
|
|
|
|
goto yyexhaustedlab;
|
|
|
|
YYSTACK_RELOCATE (yyss_alloc, yyss);
|
|
|
|
YYSTACK_RELOCATE (yyvs_alloc, yyvs);
|
2020-04-28 16:28:03 +02:00
|
|
|
# undef YYSTACK_RELOCATE
|
2016-05-07 10:11:14 +02:00
|
|
|
if (yyss1 != yyssa)
|
|
|
|
YYSTACK_FREE (yyss1);
|
2010-04-08 13:37:43 +02:00
|
|
|
}
|
|
|
|
# endif
|
|
|
|
|
|
|
|
yyssp = yyss + yysize - 1;
|
|
|
|
yyvsp = yyvs + yysize - 1;
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
YY_IGNORE_USELESS_CAST_BEGIN
|
|
|
|
YYDPRINTF ((stderr, "Stack size increased to %ld\n",
|
|
|
|
YY_CAST (long, yystacksize)));
|
|
|
|
YY_IGNORE_USELESS_CAST_END
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
if (yyss + yystacksize - 1 <= yyssp)
|
2016-05-07 10:11:14 +02:00
|
|
|
YYABORT;
|
2010-04-08 13:37:43 +02:00
|
|
|
}
|
2020-04-28 16:28:03 +02:00
|
|
|
#endif /* !defined yyoverflow && !defined YYSTACK_RELOCATE */
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
if (yystate == YYFINAL)
|
|
|
|
YYACCEPT;
|
|
|
|
|
|
|
|
goto yybackup;
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
|
2010-04-08 13:37:43 +02:00
|
|
|
/*-----------.
|
|
|
|
| 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: "));
|
2016-05-07 10:11:14 +02:00
|
|
|
yychar = yylex ();
|
2010-04-08 13:37:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
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);
|
|
|
|
yystate = yyn;
|
2016-05-07 10:11:14 +02:00
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
|
2010-04-08 13:37:43 +02:00
|
|
|
*++yyvsp = yylval;
|
2016-05-07 10:11:14 +02:00
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_END
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
/* Discard the shifted token. */
|
|
|
|
yychar = YYEMPTY;
|
2010-04-08 13:37:43 +02:00
|
|
|
goto yynewstate;
|
|
|
|
|
|
|
|
|
|
|
|
/*-----------------------------------------------------------.
|
|
|
|
| yydefault -- do the default action for the current state. |
|
|
|
|
`-----------------------------------------------------------*/
|
|
|
|
yydefault:
|
|
|
|
yyn = yydefact[yystate];
|
|
|
|
if (yyn == 0)
|
|
|
|
goto yyerrlab;
|
|
|
|
goto yyreduce;
|
|
|
|
|
|
|
|
|
|
|
|
/*-----------------------------.
|
2020-04-28 16:28:03 +02:00
|
|
|
| yyreduce -- do a reduction. |
|
2010-04-08 13:37:43 +02:00
|
|
|
`-----------------------------*/
|
|
|
|
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:
|
2016-05-07 10:11:14 +02:00
|
|
|
'$$ = $1'.
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
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)
|
|
|
|
{
|
2020-04-28 16:28:03 +02:00
|
|
|
case 2:
|
|
|
|
{ cur_parent = root_parent; }
|
2010-04-08 13:37:43 +02:00
|
|
|
break;
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
case 16:
|
|
|
|
{
|
2018-05-31 19:33:16 +02:00
|
|
|
(yyval.chip_instance) = new_chip_instance((yyvsp[0].string));
|
|
|
|
chip_enqueue_tail(cur_chip_instance);
|
|
|
|
cur_chip_instance = (yyval.chip_instance);
|
2012-06-21 22:19:48 +02:00
|
|
|
}
|
2010-04-08 13:37:43 +02:00
|
|
|
break;
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
case 17:
|
|
|
|
{
|
2018-05-31 19:33:16 +02:00
|
|
|
cur_chip_instance = chip_dequeue_tail();
|
2012-06-21 22:19:48 +02:00
|
|
|
}
|
2010-04-08 13:37:43 +02:00
|
|
|
break;
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
case 18:
|
|
|
|
{
|
2018-06-03 13:22:17 +02:00
|
|
|
(yyval.dev) = new_device(cur_parent, cur_chip_instance, (yyvsp[-2].number), (yyvsp[-1].string), (yyvsp[0].number));
|
|
|
|
cur_parent = (yyval.dev)->last_bus;
|
2012-06-21 22:19:48 +02:00
|
|
|
}
|
2010-04-08 13:37:43 +02:00
|
|
|
break;
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
case 19:
|
|
|
|
{
|
2018-06-03 13:22:17 +02:00
|
|
|
cur_parent = (yyvsp[-2].dev)->parent;
|
2012-06-21 22:19:48 +02:00
|
|
|
}
|
2010-04-08 13:37:43 +02:00
|
|
|
break;
|
|
|
|
|
2019-04-12 14:42:17 +02:00
|
|
|
case 22:
|
2020-04-28 16:28:03 +02:00
|
|
|
{ add_resource(cur_parent, (yyvsp[-3].number), strtol((yyvsp[-2].string), NULL, 0), strtol((yyvsp[0].string), NULL, 0)); }
|
2011-03-01 20:58:15 +01:00
|
|
|
break;
|
|
|
|
|
2019-04-12 14:42:17 +02:00
|
|
|
case 23:
|
2020-04-28 16:28:03 +02:00
|
|
|
{ add_register(cur_chip_instance, (yyvsp[-2].string), (yyvsp[0].string)); }
|
2012-06-21 22:19:48 +02:00
|
|
|
break;
|
|
|
|
|
2019-04-12 14:42:17 +02:00
|
|
|
case 24:
|
2020-04-28 16:28:03 +02:00
|
|
|
{ add_pci_subsystem_ids(cur_parent, strtol((yyvsp[-1].string), NULL, 16), strtol((yyvsp[0].string), NULL, 16), 0); }
|
2012-06-21 22:19:48 +02:00
|
|
|
break;
|
|
|
|
|
2019-04-12 14:42:17 +02:00
|
|
|
case 25:
|
2020-04-28 16:28:03 +02:00
|
|
|
{ add_pci_subsystem_ids(cur_parent, strtol((yyvsp[-2].string), NULL, 16), strtol((yyvsp[-1].string), NULL, 16), 1); }
|
2011-03-01 20:58:15 +01:00
|
|
|
break;
|
|
|
|
|
2019-04-12 14:42:17 +02:00
|
|
|
case 26:
|
2020-04-28 16:28:03 +02:00
|
|
|
{ add_ioapic_info(cur_parent, strtol((yyvsp[-2].string), NULL, 16), (yyvsp[-1].string), strtol((yyvsp[0].string), NULL, 16)); }
|
2019-04-12 14:42:17 +02:00
|
|
|
break;
|
|
|
|
|
|
|
|
case 27:
|
2020-04-28 16:28:03 +02:00
|
|
|
{ add_slot_desc(cur_parent, (yyvsp[-3].string), (yyvsp[-2].string), (yyvsp[-1].string), (yyvsp[0].string)); }
|
2019-04-12 14:42:17 +02:00
|
|
|
break;
|
|
|
|
|
|
|
|
case 28:
|
2020-04-28 16:28:03 +02:00
|
|
|
{ add_slot_desc(cur_parent, (yyvsp[-2].string), (yyvsp[-1].string), (yyvsp[0].string), NULL); }
|
|
|
|
break;
|
2019-04-12 14:42:17 +02:00
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
case 29:
|
|
|
|
{ add_slot_desc(cur_parent, (yyvsp[-1].string), (yyvsp[0].string), NULL, NULL); }
|
2019-04-12 14:42:17 +02: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;
|
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
/* Now 'shift' the result of the reduction. Determine what state
|
2010-04-08 13:37:43 +02:00
|
|
|
that goes to, based on the state we popped back to and the rule
|
|
|
|
number reduced by. */
|
2020-04-28 16:28:03 +02:00
|
|
|
{
|
|
|
|
const int yylhs = yyr1[yyn] - YYNTOKENS;
|
|
|
|
const int yyi = yypgoto[yylhs] + *yyssp;
|
|
|
|
yystate = (0 <= yyi && yyi <= YYLAST && yycheck[yyi] == *yyssp
|
|
|
|
? yytable[yyi]
|
|
|
|
: yydefgoto[yylhs]);
|
|
|
|
}
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
goto yynewstate;
|
|
|
|
|
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
/*--------------------------------------.
|
|
|
|
| yyerrlab -- here on detecting error. |
|
|
|
|
`--------------------------------------*/
|
2010-04-08 13:37:43 +02:00
|
|
|
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);
|
2020-04-28 16:28:03 +02:00
|
|
|
yymsg = YY_CAST (char *, YYSTACK_ALLOC (YY_CAST (YYSIZE_T, yymsg_alloc)));
|
2012-06-21 22:19:48 +02:00
|
|
|
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
|
2016-05-07 10:11:14 +02:00
|
|
|
error, discard it. */
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
if (yychar <= YYEOF)
|
2016-05-07 10:11:14 +02:00
|
|
|
{
|
|
|
|
/* Return failure if at end of input. */
|
|
|
|
if (yychar == YYEOF)
|
|
|
|
YYABORT;
|
|
|
|
}
|
2010-04-08 13:37:43 +02:00
|
|
|
else
|
2016-05-07 10:11:14 +02:00
|
|
|
{
|
|
|
|
yydestruct ("Error: discarding",
|
|
|
|
yytoken, &yylval);
|
|
|
|
yychar = YYEMPTY;
|
|
|
|
}
|
2010-04-08 13:37:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Else will try to reuse lookahead token after shifting the error
|
|
|
|
token. */
|
|
|
|
goto yyerrlab1;
|
|
|
|
|
|
|
|
|
|
|
|
/*---------------------------------------------------.
|
|
|
|
| yyerrorlab -- error raised explicitly by YYERROR. |
|
|
|
|
`---------------------------------------------------*/
|
|
|
|
yyerrorlab:
|
2020-04-28 16:28:03 +02:00
|
|
|
/* Pacify compilers when the user code never invokes YYERROR and the
|
|
|
|
label yyerrorlab therefore never appears in user code. */
|
|
|
|
if (0)
|
|
|
|
YYERROR;
|
2010-04-08 13:37:43 +02:00
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
/* Do not reclaim the symbols of the rule whose action triggered
|
2010-04-08 13:37:43 +02:00
|
|
|
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:
|
2016-05-07 10:11:14 +02:00
|
|
|
yyerrstatus = 3; /* Each real token shifted decrements this. */
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
for (;;)
|
|
|
|
{
|
|
|
|
yyn = yypact[yystate];
|
2012-06-21 22:19:48 +02:00
|
|
|
if (!yypact_value_is_default (yyn))
|
2016-05-07 10:11:14 +02:00
|
|
|
{
|
|
|
|
yyn += YYTERROR;
|
|
|
|
if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
|
|
|
|
{
|
|
|
|
yyn = yytable[yyn];
|
|
|
|
if (0 < yyn)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
/* Pop the current state because it cannot handle the error token. */
|
|
|
|
if (yyssp == yyss)
|
2016-05-07 10:11:14 +02:00
|
|
|
YYABORT;
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
|
|
|
|
yydestruct ("Error: popping",
|
2016-05-07 10:11:14 +02:00
|
|
|
yystos[yystate], yyvsp);
|
2010-04-08 13:37:43 +02:00
|
|
|
YYPOPSTACK (1);
|
|
|
|
yystate = *yyssp;
|
|
|
|
YY_STACK_PRINT (yyss, yyssp);
|
|
|
|
}
|
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
|
2010-04-08 13:37:43 +02:00
|
|
|
*++yyvsp = yylval;
|
2016-05-07 10:11:14 +02:00
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_END
|
2010-04-08 13:37:43 +02:00
|
|
|
|
|
|
|
|
|
|
|
/* 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;
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
|
2010-04-08 13:37:43 +02:00
|
|
|
/*-----------------------------------.
|
|
|
|
| yyabortlab -- YYABORT comes here. |
|
|
|
|
`-----------------------------------*/
|
|
|
|
yyabortlab:
|
|
|
|
yyresult = 1;
|
|
|
|
goto yyreturn;
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
|
2016-05-07 10:11:14 +02:00
|
|
|
#if !defined yyoverflow || YYERROR_VERBOSE
|
2010-04-08 13:37:43 +02:00
|
|
|
/*-------------------------------------------------.
|
|
|
|
| yyexhaustedlab -- memory exhaustion comes here. |
|
|
|
|
`-------------------------------------------------*/
|
|
|
|
yyexhaustedlab:
|
|
|
|
yyerror (YY_("memory exhausted"));
|
|
|
|
yyresult = 2;
|
|
|
|
/* Fall through. */
|
|
|
|
#endif
|
|
|
|
|
2020-04-28 16:28:03 +02:00
|
|
|
|
|
|
|
/*-----------------------------------------------------.
|
|
|
|
| yyreturn -- parsing is finished, return the result. |
|
|
|
|
`-----------------------------------------------------*/
|
2010-04-08 13:37:43 +02:00
|
|
|
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);
|
|
|
|
}
|
2016-05-07 10:11:14 +02:00
|
|
|
/* Do not reclaim the symbols of the rule whose action triggered
|
2010-04-08 13:37:43 +02:00
|
|
|
this YYABORT or YYACCEPT. */
|
|
|
|
YYPOPSTACK (yylen);
|
|
|
|
YY_STACK_PRINT (yyss, yyssp);
|
|
|
|
while (yyssp != yyss)
|
|
|
|
{
|
|
|
|
yydestruct ("Cleanup: popping",
|
2020-04-28 16:28:03 +02:00
|
|
|
yystos[+*yyssp], yyvsp);
|
2010-04-08 13:37:43 +02:00
|
|
|
YYPOPSTACK (1);
|
|
|
|
}
|
|
|
|
#ifndef yyoverflow
|
|
|
|
if (yyss != yyssa)
|
|
|
|
YYSTACK_FREE (yyss);
|
|
|
|
#endif
|
|
|
|
#if YYERROR_VERBOSE
|
|
|
|
if (yymsg != yymsgbuf)
|
|
|
|
YYSTACK_FREE (yymsg);
|
|
|
|
#endif
|
2016-05-07 10:11:14 +02:00
|
|
|
return yyresult;
|
2010-04-08 13:37:43 +02:00
|
|
|
}
|
2016-05-07 10:11:14 +02:00
|
|
|
|