From 6eb9c5a5657d1fe77b55cc261450f3538d35a94d Mon Sep 17 00:00:00 2001 From: Daniel Baumann Date: Sat, 4 May 2024 14:19:15 +0200 Subject: Adding upstream version 13.4. Signed-off-by: Daniel Baumann --- src/backend/bootstrap/.gitignore | 2 + src/backend/bootstrap/Makefile | 25 + src/backend/bootstrap/bootparse.c | 2172 +++++++++++++++++++++++++++++++++ src/backend/bootstrap/bootparse.y | 509 ++++++++ src/backend/bootstrap/bootscanner.c | 2281 +++++++++++++++++++++++++++++++++++ src/backend/bootstrap/bootscanner.l | 146 +++ src/backend/bootstrap/bootstrap.c | 1135 +++++++++++++++++ 7 files changed, 6270 insertions(+) create mode 100644 src/backend/bootstrap/.gitignore create mode 100644 src/backend/bootstrap/Makefile create mode 100644 src/backend/bootstrap/bootparse.c create mode 100644 src/backend/bootstrap/bootparse.y create mode 100644 src/backend/bootstrap/bootscanner.c create mode 100644 src/backend/bootstrap/bootscanner.l create mode 100644 src/backend/bootstrap/bootstrap.c (limited to 'src/backend/bootstrap') diff --git a/src/backend/bootstrap/.gitignore b/src/backend/bootstrap/.gitignore new file mode 100644 index 0000000..1ffe8ca --- /dev/null +++ b/src/backend/bootstrap/.gitignore @@ -0,0 +1,2 @@ +/bootparse.c +/bootscanner.c diff --git a/src/backend/bootstrap/Makefile b/src/backend/bootstrap/Makefile new file mode 100644 index 0000000..6421efb --- /dev/null +++ b/src/backend/bootstrap/Makefile @@ -0,0 +1,25 @@ +#------------------------------------------------------------------------- +# +# Makefile for the bootstrap module +# +# src/backend/bootstrap/Makefile +# +#------------------------------------------------------------------------- + +subdir = src/backend/bootstrap +top_builddir = ../../.. +include $(top_builddir)/src/Makefile.global + +override CPPFLAGS := -I. -I$(srcdir) $(CPPFLAGS) + +OBJS = \ + bootparse.o \ + bootstrap.o + +include $(top_srcdir)/src/backend/common.mk + +# bootscanner is compiled as part of bootparse +bootparse.o: bootscanner.c + +# bootparse.c and bootscanner.c are in the distribution tarball, so +# they are not cleaned here. diff --git a/src/backend/bootstrap/bootparse.c b/src/backend/bootstrap/bootparse.c new file mode 100644 index 0000000..32fc3d7 --- /dev/null +++ b/src/backend/bootstrap/bootparse.c @@ -0,0 +1,2172 @@ +/* A Bison parser, made by GNU Bison 3.3.2. */ + +/* Bison implementation for Yacc-like parsers in C + + Copyright (C) 1984, 1989-1990, 2000-2015, 2018-2019 Free Software Foundation, + Inc. + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . */ + +/* As a special exception, you may create a larger work that contains + part or all of the Bison parser skeleton and distribute that work + under terms of your choice, so long as that work isn't itself a + parser generator using the skeleton or a modified version thereof + as a parser skeleton. Alternatively, if you modify or redistribute + the parser skeleton itself, you may (at your option) remove this + special exception, which will cause the skeleton and the resulting + Bison output files to be licensed under the GNU General Public + License without this special exception. + + This special exception was added by the Free Software Foundation in + version 2.2 of Bison. */ + +/* C LALR(1) parser skeleton written by Richard Stallman, by + simplifying the original so-called "semantic" parser. */ + +/* All symbols defined below should begin with yy or YY, to avoid + infringing on user name space. This should be done even for local + variables, as they might otherwise be expanded by user macros. + There are some unavoidable exceptions within include files to + define necessary library symbols; they are noted "INFRINGES ON + USER NAME SPACE" below. */ + +/* Undocumented macros, especially those whose name start with YY_, + are private implementation details. Do not rely on them. */ + +/* Identify Bison output. */ +#define YYBISON 1 + +/* Bison version. */ +#define YYBISON_VERSION "3.3.2" + +/* Skeleton name. */ +#define YYSKELETON_NAME "yacc.c" + +/* Pure parsers. */ +#define YYPURE 0 + +/* Push parsers. */ +#define YYPUSH 0 + +/* Pull parsers. */ +#define YYPULL 1 + + +/* Substitute the variable and function names. */ +#define yyparse boot_yyparse +#define yylex boot_yylex +#define yyerror boot_yyerror +#define yydebug boot_yydebug +#define yynerrs boot_yynerrs + +#define yylval boot_yylval +#define yychar boot_yychar + +/* First part of user prologue. */ +#line 1 "bootparse.y" /* yacc.c:337 */ + +/*------------------------------------------------------------------------- + * + * bootparse.y + * yacc grammar for the "bootstrap" mode (BKI file format) + * + * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group + * Portions Copyright (c) 1994, Regents of the University of California + * + * + * IDENTIFICATION + * src/backend/bootstrap/bootparse.y + * + *------------------------------------------------------------------------- + */ + +#include "postgres.h" + +#include + +#include "access/attnum.h" +#include "access/htup.h" +#include "access/itup.h" +#include "access/tupdesc.h" +#include "bootstrap/bootstrap.h" +#include "catalog/catalog.h" +#include "catalog/heap.h" +#include "catalog/namespace.h" +#include "catalog/pg_am.h" +#include "catalog/pg_attribute.h" +#include "catalog/pg_authid.h" +#include "catalog/pg_class.h" +#include "catalog/pg_namespace.h" +#include "catalog/pg_tablespace.h" +#include "catalog/toasting.h" +#include "commands/defrem.h" +#include "miscadmin.h" +#include "nodes/makefuncs.h" +#include "nodes/nodes.h" +#include "nodes/parsenodes.h" +#include "nodes/pg_list.h" +#include "nodes/primnodes.h" +#include "rewrite/prs2lock.h" +#include "storage/block.h" +#include "storage/fd.h" +#include "storage/ipc.h" +#include "storage/itemptr.h" +#include "storage/off.h" +#include "storage/smgr.h" +#include "tcop/dest.h" +#include "utils/memutils.h" +#include "utils/rel.h" + + +/* + * Bison doesn't allocate anything that needs to live across parser calls, + * so we can easily have it use palloc instead of malloc. This prevents + * memory leaks if we error out during parsing. Note this only works with + * bison >= 2.0. However, in bison 1.875 the default is to use alloca() + * if possible, so there's not really much problem anyhow, at least if + * you're building with gcc. + */ +#define YYMALLOC palloc +#define YYFREE pfree + +static MemoryContext per_line_ctx = NULL; + +static void +do_start(void) +{ + Assert(CurrentMemoryContext == CurTransactionContext); + /* First time through, create the per-line working context */ + if (per_line_ctx == NULL) + per_line_ctx = AllocSetContextCreate(CurTransactionContext, + "bootstrap per-line processing", + ALLOCSET_DEFAULT_SIZES); + MemoryContextSwitchTo(per_line_ctx); +} + + +static void +do_end(void) +{ + /* Reclaim memory allocated while processing this line */ + MemoryContextSwitchTo(CurTransactionContext); + MemoryContextReset(per_line_ctx); + CHECK_FOR_INTERRUPTS(); /* allow SIGINT to kill bootstrap run */ + if (isatty(0)) + { + printf("bootstrap> "); + fflush(stdout); + } +} + + +static int num_columns_read = 0; + + +#line 177 "bootparse.c" /* yacc.c:337 */ +# ifndef YY_NULLPTR +# if defined __cplusplus +# if 201103L <= __cplusplus +# define YY_NULLPTR nullptr +# else +# define YY_NULLPTR 0 +# endif +# else +# define YY_NULLPTR ((void*)0) +# endif +# endif + +/* Enabling verbose error messages. */ +#ifdef YYERROR_VERBOSE +# undef YYERROR_VERBOSE +# define YYERROR_VERBOSE 1 +#else +# define YYERROR_VERBOSE 0 +#endif + + +/* Debug traces. */ +#ifndef YYDEBUG +# define YYDEBUG 0 +#endif +#if YYDEBUG +extern int boot_yydebug; +#endif + +/* Token type. */ +#ifndef YYTOKENTYPE +# define YYTOKENTYPE + enum yytokentype + { + ID = 258, + COMMA = 259, + EQUALS = 260, + LPAREN = 261, + RPAREN = 262, + NULLVAL = 263, + OPEN = 264, + XCLOSE = 265, + XCREATE = 266, + INSERT_TUPLE = 267, + XDECLARE = 268, + INDEX = 269, + ON = 270, + USING = 271, + XBUILD = 272, + INDICES = 273, + UNIQUE = 274, + XTOAST = 275, + OBJ_ID = 276, + XBOOTSTRAP = 277, + XSHARED_RELATION = 278, + XROWTYPE_OID = 279, + XFORCE = 280, + XNOT = 281, + XNULL = 282 + }; +#endif + +/* Value type. */ +#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED + +union YYSTYPE +{ +#line 104 "bootparse.y" /* yacc.c:352 */ + + List *list; + IndexElem *ielem; + char *str; + const char *kw; + int ival; + Oid oidval; + +#line 254 "bootparse.c" /* yacc.c:352 */ +}; + +typedef union YYSTYPE YYSTYPE; +# define YYSTYPE_IS_TRIVIAL 1 +# define YYSTYPE_IS_DECLARED 1 +#endif + + +extern YYSTYPE boot_yylval; + +int boot_yyparse (void); + + + + + +#ifdef short +# undef short +#endif + +#ifdef YYTYPE_UINT8 +typedef YYTYPE_UINT8 yytype_uint8; +#else +typedef unsigned char yytype_uint8; +#endif + +#ifdef YYTYPE_INT8 +typedef YYTYPE_INT8 yytype_int8; +#else +typedef signed char yytype_int8; +#endif + +#ifdef YYTYPE_UINT16 +typedef YYTYPE_UINT16 yytype_uint16; +#else +typedef unsigned short yytype_uint16; +#endif + +#ifdef YYTYPE_INT16 +typedef YYTYPE_INT16 yytype_int16; +#else +typedef short yytype_int16; +#endif + +#ifndef YYSIZE_T +# ifdef __SIZE_TYPE__ +# define YYSIZE_T __SIZE_TYPE__ +# elif defined size_t +# define YYSIZE_T size_t +# elif ! defined YYSIZE_T +# include /* INFRINGES ON USER NAME SPACE */ +# define YYSIZE_T size_t +# else +# define YYSIZE_T unsigned +# endif +#endif + +#define YYSIZE_MAXIMUM ((YYSIZE_T) -1) + +#ifndef YY_ +# if defined YYENABLE_NLS && YYENABLE_NLS +# if ENABLE_NLS +# include /* INFRINGES ON USER NAME SPACE */ +# define YY_(Msgid) dgettext ("bison-runtime", Msgid) +# endif +# endif +# ifndef YY_ +# define YY_(Msgid) Msgid +# endif +#endif + +#ifndef YY_ATTRIBUTE +# if (defined __GNUC__ \ + && (2 < __GNUC__ || (__GNUC__ == 2 && 96 <= __GNUC_MINOR__))) \ + || defined __SUNPRO_C && 0x5110 <= __SUNPRO_C +# define YY_ATTRIBUTE(Spec) __attribute__(Spec) +# else +# define YY_ATTRIBUTE(Spec) /* empty */ +# endif +#endif + +#ifndef YY_ATTRIBUTE_PURE +# define YY_ATTRIBUTE_PURE YY_ATTRIBUTE ((__pure__)) +#endif + +#ifndef YY_ATTRIBUTE_UNUSED +# define YY_ATTRIBUTE_UNUSED YY_ATTRIBUTE ((__unused__)) +#endif + +/* Suppress unused-variable warnings by "using" E. */ +#if ! defined lint || defined __GNUC__ +# define YYUSE(E) ((void) (E)) +#else +# define YYUSE(E) /* empty */ +#endif + +#if defined __GNUC__ && ! defined __ICC && 407 <= __GNUC__ * 100 + __GNUC_MINOR__ +/* Suppress an incorrect diagnostic about yylval being uninitialized. */ +# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \ + _Pragma ("GCC diagnostic push") \ + _Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")\ + _Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"") +# define YY_IGNORE_MAYBE_UNINITIALIZED_END \ + _Pragma ("GCC diagnostic pop") +#else +# define YY_INITIAL_VALUE(Value) Value +#endif +#ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN +# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN +# define YY_IGNORE_MAYBE_UNINITIALIZED_END +#endif +#ifndef YY_INITIAL_VALUE +# define YY_INITIAL_VALUE(Value) /* Nothing. */ +#endif + + +#if ! defined 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 /* INFRINGES ON USER NAME SPACE */ +# elif defined _AIX +# define YYSTACK_ALLOC __alloca +# elif defined _MSC_VER +# include /* INFRINGES ON USER NAME SPACE */ +# define alloca _alloca +# else +# define YYSTACK_ALLOC alloca +# if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS +# include /* INFRINGES ON USER NAME SPACE */ + /* Use EXIT_SUCCESS as a witness for stdlib.h. */ +# ifndef EXIT_SUCCESS +# define EXIT_SUCCESS 0 +# endif +# endif +# endif +# endif +# endif + +# ifdef YYSTACK_ALLOC + /* Pacify GCC's 'empty if-body' warning. */ +# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) +# ifndef YYSTACK_ALLOC_MAXIMUM + /* The OS might guarantee only one guard page at the bottom of the stack, + and a page size can be as small as 4096 bytes. So we cannot safely + invoke alloca (N) if N exceeds 4096. Use a slightly smaller number + to allow for a few compiler-allocated temporary stack slots. */ +# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */ +# endif +# else +# define YYSTACK_ALLOC YYMALLOC +# define YYSTACK_FREE YYFREE +# ifndef YYSTACK_ALLOC_MAXIMUM +# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM +# endif +# if (defined __cplusplus && ! defined EXIT_SUCCESS \ + && ! ((defined YYMALLOC || defined malloc) \ + && (defined YYFREE || defined free))) +# include /* INFRINGES ON USER NAME SPACE */ +# ifndef EXIT_SUCCESS +# define EXIT_SUCCESS 0 +# endif +# endif +# ifndef YYMALLOC +# define YYMALLOC malloc +# if ! defined malloc && ! defined EXIT_SUCCESS +void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */ +# endif +# endif +# ifndef YYFREE +# define YYFREE free +# if ! defined free && ! defined EXIT_SUCCESS +void free (void *); /* INFRINGES ON USER NAME SPACE */ +# endif +# endif +# endif +#endif /* ! defined yyoverflow || YYERROR_VERBOSE */ + + +#if (! defined yyoverflow \ + && (! defined __cplusplus \ + || (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL))) + +/* A type that is properly aligned for any stack member. */ +union yyalloc +{ + yytype_int16 yyss_alloc; + YYSTYPE yyvs_alloc; +}; + +/* The size of the maximum gap between one aligned stack and the next. */ +# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1) + +/* The size of an array large to enough to hold all stacks, each with + N elements. */ +# define YYSTACK_BYTES(N) \ + ((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \ + + YYSTACK_GAP_MAXIMUM) + +# define YYCOPY_NEEDED 1 + +/* Relocate STACK from its old location to the new one. The + local variables YYSIZE and YYSTACKSIZE give the old and new number of + elements in the stack, and YYPTR gives the new location of the + stack. Advance YYPTR to a properly aligned location for the next + stack. */ +# define YYSTACK_RELOCATE(Stack_alloc, Stack) \ + do \ + { \ + YYSIZE_T yynewbytes; \ + YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \ + Stack = &yyptr->Stack_alloc; \ + yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ + yyptr += yynewbytes / sizeof (*yyptr); \ + } \ + while (0) + +#endif + +#if defined YYCOPY_NEEDED && YYCOPY_NEEDED +/* Copy COUNT objects from SRC to DST. The source and destination do + not overlap. */ +# ifndef YYCOPY +# if defined __GNUC__ && 1 < __GNUC__ +# define YYCOPY(Dst, Src, Count) \ + __builtin_memcpy (Dst, Src, (Count) * sizeof (*(Src))) +# else +# define YYCOPY(Dst, Src, Count) \ + do \ + { \ + YYSIZE_T yyi; \ + for (yyi = 0; yyi < (Count); yyi++) \ + (Dst)[yyi] = (Src)[yyi]; \ + } \ + while (0) +# endif +# endif +#endif /* !YYCOPY_NEEDED */ + +/* YYFINAL -- State number of the termination state. */ +#define YYFINAL 46 +/* YYLAST -- Last index in YYTABLE. */ +#define YYLAST 169 + +/* YYNTOKENS -- Number of terminals. */ +#define YYNTOKENS 28 +/* YYNNTS -- Number of nonterminals. */ +#define YYNNTS 27 +/* YYNRULES -- Number of rules. */ +#define YYNRULES 65 +/* YYNSTATES -- Number of states. */ +#define YYNSTATES 110 + +#define YYUNDEFTOK 2 +#define YYMAXUTOK 282 + +/* YYTRANSLATE(TOKEN-NUM) -- Symbol number corresponding to TOKEN-NUM + as returned by yylex, with out-of-bounds checking. */ +#define YYTRANSLATE(YYX) \ + ((unsigned) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) + +/* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM + as returned by 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, + 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, + 25, 26, 27 +}; + +#if YYDEBUG + /* YYRLINE[YYN] -- Source line where rule number YYN was defined. */ +static const yytype_uint16 yyrline[] = +{ + 0, 134, 134, 135, 139, 140, 144, 145, 146, 147, + 148, 149, 150, 151, 155, 164, 174, 184, 173, 270, + 269, 288, 340, 392, 404, 414, 415, 419, 434, 435, + 439, 440, 444, 445, 449, 450, 454, 463, 464, 465, + 469, 473, 474, 475, 479, 481, 486, 487, 488, 489, + 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, + 500, 501, 502, 503, 504, 505 +}; +#endif + +#if YYDEBUG || YYERROR_VERBOSE || 0 +/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. + First, the terminals, then, starting at YYNTOKENS, nonterminals. */ +static const char *const yytname[] = +{ + "$end", "error", "$undefined", "ID", "COMMA", "EQUALS", "LPAREN", + "RPAREN", "NULLVAL", "OPEN", "XCLOSE", "XCREATE", "INSERT_TUPLE", + "XDECLARE", "INDEX", "ON", "USING", "XBUILD", "INDICES", "UNIQUE", + "XTOAST", "OBJ_ID", "XBOOTSTRAP", "XSHARED_RELATION", "XROWTYPE_OID", + "XFORCE", "XNOT", "XNULL", "$accept", "TopLevel", "Boot_Queries", + "Boot_Query", "Boot_OpenStmt", "Boot_CloseStmt", "Boot_CreateStmt", + "$@1", "$@2", "Boot_InsertStmt", "$@3", "Boot_DeclareIndexStmt", + "Boot_DeclareUniqueIndexStmt", "Boot_DeclareToastStmt", + "Boot_BuildIndsStmt", "boot_index_params", "boot_index_param", + "optbootstrap", "optsharedrelation", "optrowtypeoid", "boot_column_list", + "boot_column_def", "boot_column_nullness", "oidspec", + "boot_column_val_list", "boot_column_val", "boot_ident", YY_NULLPTR +}; +#endif + +# ifdef YYPRINT +/* YYTOKNUM[NUM] -- (External) token number corresponding to the + (internal) symbol number NUM (which must be that of a token). */ +static const yytype_uint16 yytoknum[] = +{ + 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, + 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, + 275, 276, 277, 278, 279, 280, 281, 282 +}; +# endif + +#define YYPACT_NINF -53 + +#define yypact_value_is_default(Yystate) \ + (!!((Yystate) == (-53))) + +#define YYTABLE_NINF -1 + +#define yytable_value_is_error(Yytable_value) \ + 0 + + /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing + STATE-NUM. */ +static const yytype_int16 yypact[] = +{ + -4, 142, 142, 142, -53, 2, -14, 25, -4, -53, + -53, -53, -53, -53, -53, -53, -53, -53, -53, -53, + -53, -53, -53, -53, -53, -53, -53, -53, -53, -53, + -53, -53, -53, -53, -53, -53, -53, -53, -53, -53, + 142, 20, 142, 13, 142, -53, -53, -53, 6, -53, + 117, 142, 142, 142, -53, 8, -53, 92, -53, -53, + 14, 142, 17, -53, 9, 117, -53, -53, 142, 19, + 142, 142, 29, -53, 21, 142, -53, -53, -53, 142, + 22, 142, 30, 142, 35, -53, 37, 142, 34, 142, + 36, 142, 10, -53, 142, 142, -53, -53, 23, 142, + -53, -53, 11, -3, -53, -53, -53, 18, -53, -53 +}; + + /* YYDEFACT[STATE-NUM] -- Default reduction number in state STATE-NUM. + Performed when YYTABLE does not specify something else to do. Zero + means the default is an error. */ +static const yytype_uint8 yydefact[] = +{ + 3, 0, 0, 0, 19, 0, 0, 0, 2, 4, + 6, 7, 8, 9, 10, 11, 12, 13, 46, 47, + 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, + 58, 59, 60, 61, 62, 63, 64, 65, 14, 15, + 0, 0, 0, 0, 0, 24, 1, 5, 29, 40, + 0, 0, 0, 0, 28, 31, 45, 0, 41, 44, + 0, 0, 0, 30, 33, 0, 20, 42, 0, 0, + 0, 0, 0, 43, 0, 0, 23, 32, 16, 0, + 0, 0, 0, 0, 17, 34, 0, 0, 0, 0, + 0, 0, 0, 26, 0, 0, 35, 18, 39, 0, + 21, 27, 0, 0, 36, 25, 22, 0, 38, 37 +}; + + /* YYPGOTO[NTERM-NUM]. */ +static const yytype_int8 yypgoto[] = +{ + -53, -53, -53, 38, -53, -53, -53, -53, -53, -53, + -53, -53, -53, -53, -53, -51, -52, -53, -53, -53, + -53, -39, -53, -41, -53, -46, -1 +}; + + /* YYDEFGOTO[NTERM-NUM]. */ +static const yytype_int8 yydefgoto[] = +{ + -1, 7, 8, 9, 10, 11, 12, 81, 90, 13, + 41, 14, 15, 16, 17, 92, 93, 55, 64, 72, + 84, 85, 104, 48, 57, 58, 49 +}; + + /* YYTABLE[YYPACT[STATE-NUM]] -- What to do in state STATE-NUM. If + positive, shift that token. If negative, reduce the rule whose + number is the opposite. If YYTABLE_NINF, syntax error. */ +static const yytype_uint8 yytable[] = +{ + 38, 39, 40, 53, 45, 1, 2, 3, 4, 5, + 60, 67, 62, 6, 99, 99, 42, 100, 106, 73, + 69, 43, 44, 107, 108, 46, 50, 52, 54, 68, + 77, 63, 70, 71, 75, 78, 87, 79, 83, 89, + 95, 51, 91, 97, 102, 109, 47, 105, 103, 59, + 96, 61, 0, 0, 0, 0, 59, 0, 0, 0, + 0, 0, 0, 0, 59, 0, 0, 74, 0, 76, + 0, 0, 0, 0, 80, 0, 0, 0, 82, 0, + 86, 0, 88, 0, 0, 0, 94, 0, 86, 0, + 98, 0, 0, 101, 94, 18, 65, 0, 94, 66, + 56, 19, 20, 21, 22, 23, 24, 25, 26, 27, + 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, + 18, 0, 0, 0, 0, 56, 19, 20, 21, 22, + 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, + 33, 34, 35, 36, 37, 18, 0, 0, 0, 0, + 0, 19, 20, 21, 22, 23, 24, 25, 26, 27, + 28, 29, 30, 31, 32, 33, 34, 35, 36, 37 +}; + +static const yytype_int8 yycheck[] = +{ + 1, 2, 3, 44, 18, 9, 10, 11, 12, 13, + 51, 57, 53, 17, 4, 4, 14, 7, 7, 65, + 61, 19, 20, 26, 27, 0, 6, 14, 22, 15, + 71, 23, 15, 24, 15, 6, 6, 16, 16, 4, + 6, 42, 5, 7, 95, 27, 8, 99, 25, 50, + 89, 52, -1, -1, -1, -1, 57, -1, -1, -1, + -1, -1, -1, -1, 65, -1, -1, 68, -1, 70, + -1, -1, -1, -1, 75, -1, -1, -1, 79, -1, + 81, -1, 83, -1, -1, -1, 87, -1, 89, -1, + 91, -1, -1, 94, 95, 3, 4, -1, 99, 7, + 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, + 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, + 3, -1, -1, -1, -1, 8, 9, 10, 11, 12, + 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, + 23, 24, 25, 26, 27, 3, -1, -1, -1, -1, + -1, 9, 10, 11, 12, 13, 14, 15, 16, 17, + 18, 19, 20, 21, 22, 23, 24, 25, 26, 27 +}; + + /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing + symbol of state STATE-NUM. */ +static const yytype_uint8 yystos[] = +{ + 0, 9, 10, 11, 12, 13, 17, 29, 30, 31, + 32, 33, 34, 37, 39, 40, 41, 42, 3, 9, + 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, + 20, 21, 22, 23, 24, 25, 26, 27, 54, 54, + 54, 38, 14, 19, 20, 18, 0, 31, 51, 54, + 6, 54, 14, 51, 22, 45, 8, 52, 53, 54, + 51, 54, 51, 23, 46, 4, 7, 53, 15, 51, + 15, 24, 47, 53, 54, 15, 54, 51, 6, 16, + 54, 35, 54, 16, 48, 49, 54, 6, 54, 4, + 36, 5, 43, 44, 54, 6, 49, 7, 54, 4, + 7, 54, 43, 25, 50, 44, 7, 26, 27, 27 +}; + + /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ +static const yytype_uint8 yyr1[] = +{ + 0, 28, 29, 29, 30, 30, 31, 31, 31, 31, + 31, 31, 31, 31, 32, 33, 35, 36, 34, 38, + 37, 39, 40, 41, 42, 43, 43, 44, 45, 45, + 46, 46, 47, 47, 48, 48, 49, 50, 50, 50, + 51, 52, 52, 52, 53, 53, 54, 54, 54, 54, + 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, + 54, 54, 54, 54, 54, 54 +}; + + /* YYR2[YYN] -- Number of symbols on the right hand side of rule YYN. */ +static const yytype_uint8 yyr2[] = +{ + 0, 2, 1, 0, 1, 2, 1, 1, 1, 1, + 1, 1, 1, 1, 2, 2, 0, 0, 11, 0, + 5, 11, 12, 6, 2, 3, 1, 2, 1, 0, + 1, 0, 2, 0, 1, 3, 4, 3, 2, 0, + 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1 +}; + + +#define yyerrok (yyerrstatus = 0) +#define yyclearin (yychar = YYEMPTY) +#define YYEMPTY (-2) +#define YYEOF 0 + +#define YYACCEPT goto yyacceptlab +#define YYABORT goto yyabortlab +#define YYERROR goto yyerrorlab + + +#define YYRECOVERING() (!!yyerrstatus) + +#define YYBACKUP(Token, Value) \ + do \ + if (yychar == YYEMPTY) \ + { \ + yychar = (Token); \ + yylval = (Value); \ + YYPOPSTACK (yylen); \ + yystate = *yyssp; \ + goto yybackup; \ + } \ + else \ + { \ + yyerror (YY_("syntax error: cannot back up")); \ + YYERROR; \ + } \ + while (0) + +/* Error token number */ +#define YYTERROR 1 +#define YYERRCODE 256 + + + +/* Enable debugging if requested. */ +#if YYDEBUG + +# ifndef YYFPRINTF +# include /* INFRINGES ON USER NAME SPACE */ +# define YYFPRINTF fprintf +# endif + +# define YYDPRINTF(Args) \ +do { \ + if (yydebug) \ + YYFPRINTF Args; \ +} while (0) + +/* This macro is provided for backward compatibility. */ +#ifndef YY_LOCATION_PRINT +# define YY_LOCATION_PRINT(File, Loc) ((void) 0) +#endif + + +# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \ +do { \ + if (yydebug) \ + { \ + YYFPRINTF (stderr, "%s ", Title); \ + yy_symbol_print (stderr, \ + Type, Value); \ + YYFPRINTF (stderr, "\n"); \ + } \ +} while (0) + + +/*-----------------------------------. +| Print this symbol's value on YYO. | +`-----------------------------------*/ + +static void +yy_symbol_value_print (FILE *yyo, int yytype, YYSTYPE const * const yyvaluep) +{ + FILE *yyoutput = yyo; + YYUSE (yyoutput); + if (!yyvaluep) + return; +# ifdef YYPRINT + if (yytype < YYNTOKENS) + YYPRINT (yyo, yytoknum[yytype], *yyvaluep); +# endif + YYUSE (yytype); +} + + +/*---------------------------. +| Print this symbol on YYO. | +`---------------------------*/ + +static void +yy_symbol_print (FILE *yyo, int yytype, YYSTYPE const * const yyvaluep) +{ + YYFPRINTF (yyo, "%s %s (", + yytype < YYNTOKENS ? "token" : "nterm", yytname[yytype]); + + yy_symbol_value_print (yyo, yytype, yyvaluep); + YYFPRINTF (yyo, ")"); +} + +/*------------------------------------------------------------------. +| yy_stack_print -- Print the state stack from its BOTTOM up to its | +| TOP (included). | +`------------------------------------------------------------------*/ + +static void +yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop) +{ + YYFPRINTF (stderr, "Stack now"); + for (; yybottom <= yytop; yybottom++) + { + int yybot = *yybottom; + YYFPRINTF (stderr, " %d", yybot); + } + YYFPRINTF (stderr, "\n"); +} + +# define YY_STACK_PRINT(Bottom, Top) \ +do { \ + if (yydebug) \ + yy_stack_print ((Bottom), (Top)); \ +} while (0) + + +/*------------------------------------------------. +| Report that the YYRULE is going to be reduced. | +`------------------------------------------------*/ + +static void +yy_reduce_print (yytype_int16 *yyssp, YYSTYPE *yyvsp, int yyrule) +{ + unsigned long yylno = yyrline[yyrule]; + int yynrhs = yyr2[yyrule]; + int yyi; + YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n", + yyrule - 1, yylno); + /* The symbols being reduced. */ + for (yyi = 0; yyi < yynrhs; yyi++) + { + YYFPRINTF (stderr, " $%d = ", yyi + 1); + yy_symbol_print (stderr, + yystos[yyssp[yyi + 1 - yynrhs]], + &yyvsp[(yyi + 1) - (yynrhs)] + ); + YYFPRINTF (stderr, "\n"); + } +} + +# define YY_REDUCE_PRINT(Rule) \ +do { \ + if (yydebug) \ + yy_reduce_print (yyssp, yyvsp, Rule); \ +} while (0) + +/* Nonzero means print parse trace. It is left uninitialized so that + multiple parsers can coexist. */ +int yydebug; +#else /* !YYDEBUG */ +# define YYDPRINTF(Args) +# define YY_SYMBOL_PRINT(Title, Type, Value, Location) +# define YY_STACK_PRINT(Bottom, Top) +# define YY_REDUCE_PRINT(Rule) +#endif /* !YYDEBUG */ + + +/* YYINITDEPTH -- initial size of the parser's stacks. */ +#ifndef YYINITDEPTH +# define YYINITDEPTH 200 +#endif + +/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only + if the built-in stack extension method is used). + + Do not make this value too large; the results are undefined if + YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH) + evaluated with infinite-precision integer arithmetic. */ + +#ifndef YYMAXDEPTH +# define YYMAXDEPTH 10000 +#endif + + +#if YYERROR_VERBOSE + +# ifndef yystrlen +# if defined __GLIBC__ && defined _STRING_H +# define yystrlen strlen +# else +/* Return the length of YYSTR. */ +static YYSIZE_T +yystrlen (const char *yystr) +{ + YYSIZE_T yylen; + for (yylen = 0; yystr[yylen]; yylen++) + continue; + return yylen; +} +# endif +# endif + +# ifndef yystpcpy +# if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE +# define yystpcpy stpcpy +# else +/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in + YYDEST. */ +static char * +yystpcpy (char *yydest, const char *yysrc) +{ + char *yyd = yydest; + const char *yys = yysrc; + + while ((*yyd++ = *yys++) != '\0') + continue; + + return yyd - 1; +} +# endif +# endif + +# ifndef yytnamerr +/* Copy to YYRES the contents of YYSTR after stripping away unnecessary + quotes and backslashes, so that it's suitable for yyerror. The + heuristic is that double-quoting is unnecessary unless the string + contains an apostrophe, a comma, or backslash (other than + backslash-backslash). YYSTR is taken from yytname. If YYRES is + null, do not copy; instead, return the length of what the result + would have been. */ +static YYSIZE_T +yytnamerr (char *yyres, const char *yystr) +{ + if (*yystr == '"') + { + YYSIZE_T yyn = 0; + char const *yyp = yystr; + + for (;;) + switch (*++yyp) + { + case '\'': + case ',': + goto do_not_strip_quotes; + + case '\\': + if (*++yyp != '\\') + goto do_not_strip_quotes; + else + goto append; + + append: + default: + if (yyres) + yyres[yyn] = *yyp; + yyn++; + break; + + case '"': + if (yyres) + yyres[yyn] = '\0'; + return yyn; + } + do_not_strip_quotes: ; + } + + if (! yyres) + return yystrlen (yystr); + + return (YYSIZE_T) (yystpcpy (yyres, yystr) - yyres); +} +# endif + +/* Copy into *YYMSG, which is of size *YYMSG_ALLOC, an error message + about the unexpected token YYTOKEN for the state stack whose top is + YYSSP. + + Return 0 if *YYMSG was successfully written. Return 1 if *YYMSG is + not large enough to hold the message. In that case, also set + *YYMSG_ALLOC to the required number of bytes. Return 2 if the + required number of bytes is too large to store. */ +static int +yysyntax_error (YYSIZE_T *yymsg_alloc, char **yymsg, + yytype_int16 *yyssp, int yytoken) +{ + YYSIZE_T yysize0 = yytnamerr (YY_NULLPTR, yytname[yytoken]); + YYSIZE_T yysize = yysize0; + enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 }; + /* Internationalized format string. */ + const char *yyformat = YY_NULLPTR; + /* Arguments of yyformat. */ + char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; + /* Number of reported tokens (one for the "unexpected", one per + "expected"). */ + int yycount = 0; + + /* There are many possibilities here to consider: + - If this state is a consistent state with a default action, then + the only way this function was invoked is if the default action + is an error action. In that case, don't check for expected + tokens because there are none. + - The only way there can be no lookahead present (in yychar) is if + this state is a consistent state with a default action. Thus, + detecting the absence of a lookahead is sufficient to determine + that there is no unexpected or expected token to report. In that + case, just report a simple "syntax error". + - Don't assume there isn't a lookahead just because this state is a + consistent state with a default action. There might have been a + previous inconsistent state, consistent state with a non-default + action, or user semantic action that manipulated yychar. + - Of course, the expected token list depends on states to have + correct lookahead information, and it depends on the parser not + to perform extra reductions after fetching a lookahead from the + scanner and before detecting a syntax error. Thus, state merging + (from LALR or IELR) and default reductions corrupt the expected + token list. However, the list is correct for canonical LR with + one exception: it will still contain any token that will not be + accepted due to an error action in a later state. + */ + if (yytoken != YYEMPTY) + { + int yyn = yypact[*yyssp]; + yyarg[yycount++] = yytname[yytoken]; + if (!yypact_value_is_default (yyn)) + { + /* Start YYX at -YYN if negative to avoid negative indexes in + YYCHECK. In other words, skip the first -YYN actions for + this state because they are default actions. */ + int yyxbegin = yyn < 0 ? -yyn : 0; + /* Stay within bounds of both yycheck and yytname. */ + int yychecklim = YYLAST - yyn + 1; + int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS; + int yyx; + + for (yyx = yyxbegin; yyx < yyxend; ++yyx) + if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR + && !yytable_value_is_error (yytable[yyx + yyn])) + { + if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) + { + yycount = 1; + yysize = yysize0; + break; + } + yyarg[yycount++] = yytname[yyx]; + { + YYSIZE_T yysize1 = yysize + yytnamerr (YY_NULLPTR, yytname[yyx]); + if (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM) + yysize = yysize1; + else + return 2; + } + } + } + } + + switch (yycount) + { +# define YYCASE_(N, S) \ + case N: \ + yyformat = S; \ + break + default: /* Avoid compiler warnings. */ + YYCASE_(0, YY_("syntax error")); + YYCASE_(1, YY_("syntax error, unexpected %s")); + YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s")); + YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s")); + YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s")); + YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s")); +# undef YYCASE_ + } + + { + YYSIZE_T yysize1 = yysize + yystrlen (yyformat); + if (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM) + yysize = yysize1; + else + return 2; + } + + if (*yymsg_alloc < yysize) + { + *yymsg_alloc = 2 * yysize; + if (! (yysize <= *yymsg_alloc + && *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM)) + *yymsg_alloc = YYSTACK_ALLOC_MAXIMUM; + return 1; + } + + /* Avoid sprintf, as that infringes on the user's name space. + Don't have undefined behavior even if the translation + produced a string with the wrong number of "%s"s. */ + { + char *yyp = *yymsg; + int yyi = 0; + while ((*yyp = *yyformat) != '\0') + if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount) + { + yyp += yytnamerr (yyp, yyarg[yyi++]); + yyformat += 2; + } + else + { + yyp++; + yyformat++; + } + } + return 0; +} +#endif /* YYERROR_VERBOSE */ + +/*-----------------------------------------------. +| Release the memory associated to this symbol. | +`-----------------------------------------------*/ + +static void +yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep) +{ + YYUSE (yyvaluep); + if (!yymsg) + yymsg = "Deleting"; + YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp); + + YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN + YYUSE (yytype); + YY_IGNORE_MAYBE_UNINITIALIZED_END +} + + + + +/* The lookahead symbol. */ +int yychar; + +/* The semantic value of the lookahead symbol. */ +YYSTYPE yylval; +/* Number of syntax errors so far. */ +int yynerrs; + + +/*----------. +| yyparse. | +`----------*/ + +int +yyparse (void) +{ + int yystate; + /* Number of tokens to shift before error messages enabled. */ + int yyerrstatus; + + /* The stacks and their tools: + 'yyss': related to states. + 'yyvs': related to semantic values. + + Refer to the stacks through separate pointers, to allow yyoverflow + to reallocate them elsewhere. */ + + /* The state stack. */ + yytype_int16 yyssa[YYINITDEPTH]; + yytype_int16 *yyss; + yytype_int16 *yyssp; + + /* The semantic value stack. */ + YYSTYPE yyvsa[YYINITDEPTH]; + YYSTYPE *yyvs; + YYSTYPE *yyvsp; + + YYSIZE_T yystacksize; + + int yyn; + int yyresult; + /* Lookahead token as an internal (translated) token number. */ + int yytoken = 0; + /* The variables used to return semantic value and location from the + action routines. */ + YYSTYPE yyval; + +#if YYERROR_VERBOSE + /* Buffer for error messages, and its allocated size. */ + char yymsgbuf[128]; + char *yymsg = yymsgbuf; + YYSIZE_T yymsg_alloc = sizeof yymsgbuf; +#endif + +#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N)) + + /* The number of symbols on the RHS of the reduced rule. + Keep to zero when no symbol should be popped. */ + int yylen = 0; + + yyssp = yyss = yyssa; + yyvsp = yyvs = yyvsa; + yystacksize = YYINITDEPTH; + + YYDPRINTF ((stderr, "Starting parse\n")); + + yystate = 0; + yyerrstatus = 0; + yynerrs = 0; + yychar = YYEMPTY; /* Cause a token to be read. */ + goto yysetstate; + + +/*------------------------------------------------------------. +| yynewstate -- push a new state, which is found in yystate. | +`------------------------------------------------------------*/ +yynewstate: + /* In all cases, when you get here, the value and location stacks + have just been pushed. So pushing a state here evens the stacks. */ + yyssp++; + + +/*--------------------------------------------------------------------. +| yynewstate -- set current state (the top of the stack) to yystate. | +`--------------------------------------------------------------------*/ +yysetstate: + *yyssp = (yytype_int16) yystate; + + if (yyss + yystacksize - 1 <= yyssp) +#if !defined yyoverflow && !defined YYSTACK_RELOCATE + goto yyexhaustedlab; +#else + { + /* Get the current used size of the three stacks, in elements. */ + YYSIZE_T yysize = (YYSIZE_T) (yyssp - yyss + 1); + +# if defined yyoverflow + { + /* Give user a chance to reallocate the stack. Use copies of + these so that the &'s don't force the real ones into + memory. */ + 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 /* defined YYSTACK_RELOCATE */ + /* 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 + + yyssp = yyss + yysize - 1; + yyvsp = yyvs + yysize - 1; + + YYDPRINTF ((stderr, "Stack size increased to %lu\n", + (unsigned long) yystacksize)); + + if (yyss + yystacksize - 1 <= yyssp) + YYABORT; + } +#endif /* !defined yyoverflow && !defined YYSTACK_RELOCATE */ + + YYDPRINTF ((stderr, "Entering state %d\n", yystate)); + + if (yystate == YYFINAL) + YYACCEPT; + + goto yybackup; + + +/*-----------. +| yybackup. | +`-----------*/ +yybackup: + /* Do appropriate processing given the current state. Read a + lookahead token if we need one and don't already have one. */ + + /* First try to decide what to do without reference to lookahead token. */ + yyn = yypact[yystate]; + if (yypact_value_is_default (yyn)) + goto yydefault; + + /* Not known => get a lookahead token if don't already have one. */ + + /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */ + if (yychar == YYEMPTY) + { + YYDPRINTF ((stderr, "Reading a token: ")); + yychar = yylex (); + } + + if (yychar <= YYEOF) + { + yychar = yytoken = YYEOF; + YYDPRINTF ((stderr, "Now at end of input.\n")); + } + else + { + yytoken = YYTRANSLATE (yychar); + YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc); + } + + /* If the proper action on seeing token YYTOKEN is to reduce or to + detect an error, take that action. */ + yyn += yytoken; + if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken) + goto yydefault; + yyn = yytable[yyn]; + if (yyn <= 0) + { + if (yytable_value_is_error (yyn)) + goto yyerrlab; + yyn = -yyn; + goto yyreduce; + } + + /* Count tokens shifted since error; after three, turn off error + status. */ + if (yyerrstatus) + yyerrstatus--; + + /* Shift the lookahead token. */ + YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc); + + /* Discard the shifted token. */ + yychar = YYEMPTY; + + yystate = yyn; + YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN + *++yyvsp = yylval; + YY_IGNORE_MAYBE_UNINITIALIZED_END + + goto yynewstate; + + +/*-----------------------------------------------------------. +| yydefault -- do the default action for the current state. | +`-----------------------------------------------------------*/ +yydefault: + yyn = yydefact[yystate]; + if (yyn == 0) + goto yyerrlab; + goto yyreduce; + + +/*-----------------------------. +| yyreduce -- do a reduction. | +`-----------------------------*/ +yyreduce: + /* yyn is the number of a rule to reduce with. */ + yylen = yyr2[yyn]; + + /* If YYLEN is nonzero, implement the default value of the action: + '$$ = $1'. + + Otherwise, the following line sets YYVAL to garbage. + This behavior is undocumented and Bison + users should not rely upon it. Assigning to YYVAL + unconditionally makes the parser a bit smaller, and it avoids a + GCC warning that YYVAL may be used uninitialized. */ + yyval = yyvsp[1-yylen]; + + + YY_REDUCE_PRINT (yyn); + switch (yyn) + { + case 14: +#line 156 "bootparse.y" /* yacc.c:1652 */ + { + do_start(); + boot_openrel((yyvsp[0].str)); + do_end(); + } +#line 1437 "bootparse.c" /* yacc.c:1652 */ + break; + + case 15: +#line 165 "bootparse.y" /* yacc.c:1652 */ + { + do_start(); + closerel((yyvsp[0].str)); + do_end(); + } +#line 1447 "bootparse.c" /* yacc.c:1652 */ + break; + + case 16: +#line 174 "bootparse.y" /* yacc.c:1652 */ + { + do_start(); + numattr = 0; + elog(DEBUG4, "creating%s%s relation %s %u", + (yyvsp[-3].ival) ? " bootstrap" : "", + (yyvsp[-2].ival) ? " shared" : "", + (yyvsp[-5].str), + (yyvsp[-4].oidval)); + } +#line 1461 "bootparse.c" /* yacc.c:1652 */ + break; + + case 17: +#line 184 "bootparse.y" /* yacc.c:1652 */ + { + do_end(); + } +#line 1469 "bootparse.c" /* yacc.c:1652 */ + break; + + case 18: +#line 188 "bootparse.y" /* yacc.c:1652 */ + { + TupleDesc tupdesc; + bool shared_relation; + bool mapped_relation; + + do_start(); + + tupdesc = CreateTupleDesc(numattr, attrtypes); + + shared_relation = (yyvsp[-6].ival); + + /* + * The catalogs that use the relation mapper are the + * bootstrap catalogs plus the shared catalogs. If this + * ever gets more complicated, we should invent a BKI + * keyword to mark the mapped catalogs, but for now a + * quick hack seems the most appropriate thing. Note in + * particular that all "nailed" heap rels (see formrdesc + * in relcache.c) must be mapped. + */ + mapped_relation = ((yyvsp[-7].ival) || shared_relation); + + if ((yyvsp[-7].ival)) + { + TransactionId relfrozenxid; + MultiXactId relminmxid; + + if (boot_reldesc) + { + elog(DEBUG4, "create bootstrap: warning, open relation exists, closing first"); + closerel(NULL); + } + + boot_reldesc = heap_create((yyvsp[-9].str), + PG_CATALOG_NAMESPACE, + shared_relation ? GLOBALTABLESPACE_OID : 0, + (yyvsp[-8].oidval), + InvalidOid, + HEAP_TABLE_AM_OID, + tupdesc, + RELKIND_RELATION, + RELPERSISTENCE_PERMANENT, + shared_relation, + mapped_relation, + true, + &relfrozenxid, + &relminmxid); + elog(DEBUG4, "bootstrap relation created"); + } + else + { + Oid id; + + id = heap_create_with_catalog((yyvsp[-9].str), + PG_CATALOG_NAMESPACE, + shared_relation ? GLOBALTABLESPACE_OID : 0, + (yyvsp[-8].oidval), + (yyvsp[-5].oidval), + InvalidOid, + BOOTSTRAP_SUPERUSERID, + HEAP_TABLE_AM_OID, + tupdesc, + NIL, + RELKIND_RELATION, + RELPERSISTENCE_PERMANENT, + shared_relation, + mapped_relation, + ONCOMMIT_NOOP, + (Datum) 0, + false, + true, + false, + InvalidOid, + NULL); + elog(DEBUG4, "relation created with OID %u", id); + } + do_end(); + } +#line 1552 "bootparse.c" /* yacc.c:1652 */ + break; + + case 19: +#line 270 "bootparse.y" /* yacc.c:1652 */ + { + do_start(); + elog(DEBUG4, "inserting row"); + num_columns_read = 0; + } +#line 1562 "bootparse.c" /* yacc.c:1652 */ + break; + + case 20: +#line 276 "bootparse.y" /* yacc.c:1652 */ + { + if (num_columns_read != numattr) + elog(ERROR, "incorrect number of columns in row (expected %d, got %d)", + numattr, num_columns_read); + if (boot_reldesc == NULL) + elog(FATAL, "relation not open"); + InsertOneTuple(); + do_end(); + } +#line 1576 "bootparse.c" /* yacc.c:1652 */ + break; + + case 21: +#line 289 "bootparse.y" /* yacc.c:1652 */ + { + IndexStmt *stmt = makeNode(IndexStmt); + Oid relationId; + + elog(DEBUG4, "creating index \"%s\"", (yyvsp[-8].str)); + + do_start(); + + stmt->idxname = (yyvsp[-8].str); + stmt->relation = makeRangeVar(NULL, (yyvsp[-5].str), -1); + stmt->accessMethod = (yyvsp[-3].str); + stmt->tableSpace = NULL; + stmt->indexParams = (yyvsp[-1].list); + stmt->indexIncludingParams = NIL; + stmt->options = NIL; + stmt->whereClause = NULL; + stmt->excludeOpNames = NIL; + stmt->idxcomment = NULL; + stmt->indexOid = InvalidOid; + stmt->oldNode = InvalidOid; + stmt->oldCreateSubid = InvalidSubTransactionId; + stmt->oldFirstRelfilenodeSubid = InvalidSubTransactionId; + stmt->unique = false; + stmt->primary = false; + stmt->isconstraint = false; + stmt->deferrable = false; + stmt->initdeferred = false; + stmt->transformed = false; + stmt->concurrent = false; + stmt->if_not_exists = false; + stmt->reset_default_tblspc = false; + + /* locks and races need not concern us in bootstrap mode */ + relationId = RangeVarGetRelid(stmt->relation, NoLock, + false); + + DefineIndex(relationId, + stmt, + (yyvsp[-7].oidval), + InvalidOid, + InvalidOid, + false, + false, + false, + true, /* skip_build */ + false); + do_end(); + } +#line 1629 "bootparse.c" /* yacc.c:1652 */ + break; + + case 22: +#line 341 "bootparse.y" /* yacc.c:1652 */ + { + IndexStmt *stmt = makeNode(IndexStmt); + Oid relationId; + + elog(DEBUG4, "creating unique index \"%s\"", (yyvsp[-8].str)); + + do_start(); + + stmt->idxname = (yyvsp[-8].str); + stmt->relation = makeRangeVar(NULL, (yyvsp[-5].str), -1); + stmt->accessMethod = (yyvsp[-3].str); + stmt->tableSpace = NULL; + stmt->indexParams = (yyvsp[-1].list); + stmt->indexIncludingParams = NIL; + stmt->options = NIL; + stmt->whereClause = NULL; + stmt->excludeOpNames = NIL; + stmt->idxcomment = NULL; + stmt->indexOid = InvalidOid; + stmt->oldNode = InvalidOid; + stmt->oldCreateSubid = InvalidSubTransactionId; + stmt->oldFirstRelfilenodeSubid = InvalidSubTransactionId; + stmt->unique = true; + stmt->primary = false; + stmt->isconstraint = false; + stmt->deferrable = false; + stmt->initdeferred = false; + stmt->transformed = false; + stmt->concurrent = false; + stmt->if_not_exists = false; + stmt->reset_default_tblspc = false; + + /* locks and races need not concern us in bootstrap mode */ + relationId = RangeVarGetRelid(stmt->relation, NoLock, + false); + + DefineIndex(relationId, + stmt, + (yyvsp[-7].oidval), + InvalidOid, + InvalidOid, + false, + false, + false, + true, /* skip_build */ + false); + do_end(); + } +#line 1682 "bootparse.c" /* yacc.c:1652 */ + break; + + case 23: +#line 393 "bootparse.y" /* yacc.c:1652 */ + { + elog(DEBUG4, "creating toast table for table \"%s\"", (yyvsp[0].str)); + + do_start(); + + BootstrapToastTable((yyvsp[0].str), (yyvsp[-3].oidval), (yyvsp[-2].oidval)); + do_end(); + } +#line 1695 "bootparse.c" /* yacc.c:1652 */ + break; + + case 24: +#line 405 "bootparse.y" /* yacc.c:1652 */ + { + do_start(); + build_indices(); + do_end(); + } +#line 1705 "bootparse.c" /* yacc.c:1652 */ + break; + + case 25: +#line 414 "bootparse.y" /* yacc.c:1652 */ + { (yyval.list) = lappend((yyvsp[-2].list), (yyvsp[0].ielem)); } +#line 1711 "bootparse.c" /* yacc.c:1652 */ + break; + + case 26: +#line 415 "bootparse.y" /* yacc.c:1652 */ + { (yyval.list) = list_make1((yyvsp[0].ielem)); } +#line 1717 "bootparse.c" /* yacc.c:1652 */ + break; + + case 27: +#line 420 "bootparse.y" /* yacc.c:1652 */ + { + IndexElem *n = makeNode(IndexElem); + n->name = (yyvsp[-1].str); + n->expr = NULL; + n->indexcolname = NULL; + n->collation = NIL; + n->opclass = list_make1(makeString((yyvsp[0].str))); + n->ordering = SORTBY_DEFAULT; + n->nulls_ordering = SORTBY_NULLS_DEFAULT; + (yyval.ielem) = n; + } +#line 1733 "bootparse.c" /* yacc.c:1652 */ + break; + + case 28: +#line 434 "bootparse.y" /* yacc.c:1652 */ + { (yyval.ival) = 1; } +#line 1739 "bootparse.c" /* yacc.c:1652 */ + break; + + case 29: +#line 435 "bootparse.y" /* yacc.c:1652 */ + { (yyval.ival) = 0; } +#line 1745 "bootparse.c" /* yacc.c:1652 */ + break; + + case 30: +#line 439 "bootparse.y" /* yacc.c:1652 */ + { (yyval.ival) = 1; } +#line 1751 "bootparse.c" /* yacc.c:1652 */ + break; + + case 31: +#line 440 "bootparse.y" /* yacc.c:1652 */ + { (yyval.ival) = 0; } +#line 1757 "bootparse.c" /* yacc.c:1652 */ + break; + + case 32: +#line 444 "bootparse.y" /* yacc.c:1652 */ + { (yyval.oidval) = (yyvsp[0].oidval); } +#line 1763 "bootparse.c" /* yacc.c:1652 */ + break; + + case 33: +#line 445 "bootparse.y" /* yacc.c:1652 */ + { (yyval.oidval) = InvalidOid; } +#line 1769 "bootparse.c" /* yacc.c:1652 */ + break; + + case 36: +#line 455 "bootparse.y" /* yacc.c:1652 */ + { + if (++numattr > MAXATTR) + elog(FATAL, "too many columns"); + DefineAttr((yyvsp[-3].str), (yyvsp[-1].str), numattr-1, (yyvsp[0].ival)); + } +#line 1779 "bootparse.c" /* yacc.c:1652 */ + break; + + case 37: +#line 463 "bootparse.y" /* yacc.c:1652 */ + { (yyval.ival) = BOOTCOL_NULL_FORCE_NOT_NULL; } +#line 1785 "bootparse.c" /* yacc.c:1652 */ + break; + + case 38: +#line 464 "bootparse.y" /* yacc.c:1652 */ + { (yyval.ival) = BOOTCOL_NULL_FORCE_NULL; } +#line 1791 "bootparse.c" /* yacc.c:1652 */ + break; + + case 39: +#line 465 "bootparse.y" /* yacc.c:1652 */ + { (yyval.ival) = BOOTCOL_NULL_AUTO; } +#line 1797 "bootparse.c" /* yacc.c:1652 */ + break; + + case 40: +#line 469 "bootparse.y" /* yacc.c:1652 */ + { (yyval.oidval) = atooid((yyvsp[0].str)); } +#line 1803 "bootparse.c" /* yacc.c:1652 */ + break; + + case 44: +#line 480 "bootparse.y" /* yacc.c:1652 */ + { InsertOneValue((yyvsp[0].str), num_columns_read++); } +#line 1809 "bootparse.c" /* yacc.c:1652 */ + break; + + case 45: +#line 482 "bootparse.y" /* yacc.c:1652 */ + { InsertOneNull(num_columns_read++); } +#line 1815 "bootparse.c" /* yacc.c:1652 */ + break; + + case 46: +#line 486 "bootparse.y" /* yacc.c:1652 */ + { (yyval.str) = (yyvsp[0].str); } +#line 1821 "bootparse.c" /* yacc.c:1652 */ + break; + + case 47: +#line 487 "bootparse.y" /* yacc.c:1652 */ + { (yyval.str) = pstrdup((yyvsp[0].kw)); } +#line 1827 "bootparse.c" /* yacc.c:1652 */ + break; + + case 48: +#line 488 "bootparse.y" /* yacc.c:1652 */ + { (yyval.str) = pstrdup((yyvsp[0].kw)); } +#line 1833 "bootparse.c" /* yacc.c:1652 */ + break; + + case 49: +#line 489 "bootparse.y" /* yacc.c:1652 */ + { (yyval.str) = pstrdup((yyvsp[0].kw)); } +#line 1839 "bootparse.c" /* yacc.c:1652 */ + break; + + case 50: +#line 490 "bootparse.y" /* yacc.c:1652 */ + { (yyval.str) = pstrdup((yyvsp[0].kw)); } +#line 1845 "bootparse.c" /* yacc.c:1652 */ + break; + + case 51: +#line 491 "bootparse.y" /* yacc.c:1652 */ + { (yyval.str) = pstrdup((yyvsp[0].kw)); } +#line 1851 "bootparse.c" /* yacc.c:1652 */ + break; + + case 52: +#line 492 "bootparse.y" /* yacc.c:1652 */ + { (yyval.str) = pstrdup((yyvsp[0].kw)); } +#line 1857 "bootparse.c" /* yacc.c:1652 */ + break; + + case 53: +#line 493 "bootparse.y" /* yacc.c:1652 */ + { (yyval.str) = pstrdup((yyvsp[0].kw)); } +#line 1863 "bootparse.c" /* yacc.c:1652 */ + break; + + case 54: +#line 494 "bootparse.y" /* yacc.c:1652 */ + { (yyval.str) = pstrdup((yyvsp[0].kw)); } +#line 1869 "bootparse.c" /* yacc.c:1652 */ + break; + + case 55: +#line 495 "bootparse.y" /* yacc.c:1652 */ + { (yyval.str) = pstrdup((yyvsp[0].kw)); } +#line 1875 "bootparse.c" /* yacc.c:1652 */ + break; + + case 56: +#line 496 "bootparse.y" /* yacc.c:1652 */ + { (yyval.str) = pstrdup((yyvsp[0].kw)); } +#line 1881 "bootparse.c" /* yacc.c:1652 */ + break; + + case 57: +#line 497 "bootparse.y" /* yacc.c:1652 */ + { (yyval.str) = pstrdup((yyvsp[0].kw)); } +#line 1887 "bootparse.c" /* yacc.c:1652 */ + break; + + case 58: +#line 498 "bootparse.y" /* yacc.c:1652 */ + { (yyval.str) = pstrdup((yyvsp[0].kw)); } +#line 1893 "bootparse.c" /* yacc.c:1652 */ + break; + + case 59: +#line 499 "bootparse.y" /* yacc.c:1652 */ + { (yyval.str) = pstrdup((yyvsp[0].kw)); } +#line 1899 "bootparse.c" /* yacc.c:1652 */ + break; + + case 60: +#line 500 "bootparse.y" /* yacc.c:1652 */ + { (yyval.str) = pstrdup((yyvsp[0].kw)); } +#line 1905 "bootparse.c" /* yacc.c:1652 */ + break; + + case 61: +#line 501 "bootparse.y" /* yacc.c:1652 */ + { (yyval.str) = pstrdup((yyvsp[0].kw)); } +#line 1911 "bootparse.c" /* yacc.c:1652 */ + break; + + case 62: +#line 502 "bootparse.y" /* yacc.c:1652 */ + { (yyval.str) = pstrdup((yyvsp[0].kw)); } +#line 1917 "bootparse.c" /* yacc.c:1652 */ + break; + + case 63: +#line 503 "bootparse.y" /* yacc.c:1652 */ + { (yyval.str) = pstrdup((yyvsp[0].kw)); } +#line 1923 "bootparse.c" /* yacc.c:1652 */ + break; + + case 64: +#line 504 "bootparse.y" /* yacc.c:1652 */ + { (yyval.str) = pstrdup((yyvsp[0].kw)); } +#line 1929 "bootparse.c" /* yacc.c:1652 */ + break; + + case 65: +#line 505 "bootparse.y" /* yacc.c:1652 */ + { (yyval.str) = pstrdup((yyvsp[0].kw)); } +#line 1935 "bootparse.c" /* yacc.c:1652 */ + break; + + +#line 1939 "bootparse.c" /* yacc.c:1652 */ + default: break; + } + /* User semantic actions sometimes alter yychar, and that requires + that yytoken be updated with the new translation. We take the + approach of translating immediately before every use of yytoken. + One alternative is translating here after every semantic action, + but that translation would be missed if the semantic action invokes + YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or + if it invokes YYBACKUP. In the case of YYABORT or YYACCEPT, an + incorrect destructor might then be invoked immediately. In the + case of YYERROR or YYBACKUP, subsequent parser actions might lead + to an incorrect destructor call or verbose syntax error message + before the lookahead is translated. */ + YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc); + + YYPOPSTACK (yylen); + yylen = 0; + YY_STACK_PRINT (yyss, yyssp); + + *++yyvsp = yyval; + + /* Now 'shift' the result of the reduction. Determine what state + that goes to, based on the state we popped back to and the rule + number reduced by. */ + { + const int yylhs = yyr1[yyn] - YYNTOKENS; + const int yyi = yypgoto[yylhs] + *yyssp; + yystate = (0 <= yyi && yyi <= YYLAST && yycheck[yyi] == *yyssp + ? yytable[yyi] + : yydefgoto[yylhs]); + } + + goto yynewstate; + + +/*--------------------------------------. +| yyerrlab -- here on detecting error. | +`--------------------------------------*/ +yyerrlab: + /* Make sure we have latest lookahead translation. See comments at + user semantic actions for why this is necessary. */ + yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar); + + /* If not already recovering from an error, report this error. */ + if (!yyerrstatus) + { + ++yynerrs; +#if ! YYERROR_VERBOSE + yyerror (YY_("syntax error")); +#else +# define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \ + yyssp, yytoken) + { + char const *yymsgp = YY_("syntax error"); + int yysyntax_error_status; + yysyntax_error_status = YYSYNTAX_ERROR; + if (yysyntax_error_status == 0) + yymsgp = yymsg; + else if (yysyntax_error_status == 1) + { + if (yymsg != yymsgbuf) + YYSTACK_FREE (yymsg); + yymsg = (char *) YYSTACK_ALLOC (yymsg_alloc); + if (!yymsg) + { + yymsg = yymsgbuf; + yymsg_alloc = sizeof yymsgbuf; + yysyntax_error_status = 2; + } + else + { + yysyntax_error_status = YYSYNTAX_ERROR; + yymsgp = yymsg; + } + } + yyerror (yymsgp); + if (yysyntax_error_status == 2) + goto yyexhaustedlab; + } +# undef YYSYNTAX_ERROR +#endif + } + + + + if (yyerrstatus == 3) + { + /* If just tried and failed to reuse lookahead token after an + error, discard it. */ + + if (yychar <= YYEOF) + { + /* Return failure if at end of input. */ + if (yychar == YYEOF) + YYABORT; + } + else + { + yydestruct ("Error: discarding", + yytoken, &yylval); + yychar = YYEMPTY; + } + } + + /* Else will try to reuse lookahead token after shifting the error + token. */ + goto yyerrlab1; + + +/*---------------------------------------------------. +| yyerrorlab -- error raised explicitly by YYERROR. | +`---------------------------------------------------*/ +yyerrorlab: + /* Pacify compilers when the user code never invokes YYERROR and the + label yyerrorlab therefore never appears in user code. */ + if (0) + YYERROR; + + /* Do not reclaim the symbols of the rule whose action triggered + this YYERROR. */ + YYPOPSTACK (yylen); + yylen = 0; + YY_STACK_PRINT (yyss, yyssp); + yystate = *yyssp; + goto yyerrlab1; + + +/*-------------------------------------------------------------. +| yyerrlab1 -- common code for both syntax error and YYERROR. | +`-------------------------------------------------------------*/ +yyerrlab1: + yyerrstatus = 3; /* Each real token shifted decrements this. */ + + for (;;) + { + yyn = yypact[yystate]; + if (!yypact_value_is_default (yyn)) + { + yyn += YYTERROR; + if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR) + { + yyn = yytable[yyn]; + if (0 < yyn) + break; + } + } + + /* Pop the current state because it cannot handle the error token. */ + if (yyssp == yyss) + YYABORT; + + + yydestruct ("Error: popping", + yystos[yystate], yyvsp); + YYPOPSTACK (1); + yystate = *yyssp; + YY_STACK_PRINT (yyss, yyssp); + } + + YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN + *++yyvsp = yylval; + YY_IGNORE_MAYBE_UNINITIALIZED_END + + + /* Shift the error token. */ + YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp); + + yystate = yyn; + goto yynewstate; + + +/*-------------------------------------. +| yyacceptlab -- YYACCEPT comes here. | +`-------------------------------------*/ +yyacceptlab: + yyresult = 0; + goto yyreturn; + + +/*-----------------------------------. +| yyabortlab -- YYABORT comes here. | +`-----------------------------------*/ +yyabortlab: + yyresult = 1; + goto yyreturn; + + +#if !defined yyoverflow || YYERROR_VERBOSE +/*-------------------------------------------------. +| yyexhaustedlab -- memory exhaustion comes here. | +`-------------------------------------------------*/ +yyexhaustedlab: + yyerror (YY_("memory exhausted")); + yyresult = 2; + /* Fall through. */ +#endif + + +/*-----------------------------------------------------. +| yyreturn -- parsing is finished, return the result. | +`-----------------------------------------------------*/ +yyreturn: + if (yychar != YYEMPTY) + { + /* Make sure we have latest lookahead translation. See comments at + user semantic actions for why this is necessary. */ + yytoken = YYTRANSLATE (yychar); + yydestruct ("Cleanup: discarding lookahead", + yytoken, &yylval); + } + /* Do not reclaim the symbols of the rule whose action triggered + this YYABORT or YYACCEPT. */ + YYPOPSTACK (yylen); + YY_STACK_PRINT (yyss, yyssp); + while (yyssp != yyss) + { + yydestruct ("Cleanup: popping", + yystos[*yyssp], yyvsp); + YYPOPSTACK (1); + } +#ifndef yyoverflow + if (yyss != yyssa) + YYSTACK_FREE (yyss); +#endif +#if YYERROR_VERBOSE + if (yymsg != yymsgbuf) + YYSTACK_FREE (yymsg); +#endif + return yyresult; +} +#line 507 "bootparse.y" /* yacc.c:1918 */ + + +#include "bootscanner.c" diff --git a/src/backend/bootstrap/bootparse.y b/src/backend/bootstrap/bootparse.y new file mode 100644 index 0000000..5eaca27 --- /dev/null +++ b/src/backend/bootstrap/bootparse.y @@ -0,0 +1,509 @@ +%{ +/*------------------------------------------------------------------------- + * + * bootparse.y + * yacc grammar for the "bootstrap" mode (BKI file format) + * + * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group + * Portions Copyright (c) 1994, Regents of the University of California + * + * + * IDENTIFICATION + * src/backend/bootstrap/bootparse.y + * + *------------------------------------------------------------------------- + */ + +#include "postgres.h" + +#include + +#include "access/attnum.h" +#include "access/htup.h" +#include "access/itup.h" +#include "access/tupdesc.h" +#include "bootstrap/bootstrap.h" +#include "catalog/catalog.h" +#include "catalog/heap.h" +#include "catalog/namespace.h" +#include "catalog/pg_am.h" +#include "catalog/pg_attribute.h" +#include "catalog/pg_authid.h" +#include "catalog/pg_class.h" +#include "catalog/pg_namespace.h" +#include "catalog/pg_tablespace.h" +#include "catalog/toasting.h" +#include "commands/defrem.h" +#include "miscadmin.h" +#include "nodes/makefuncs.h" +#include "nodes/nodes.h" +#include "nodes/parsenodes.h" +#include "nodes/pg_list.h" +#include "nodes/primnodes.h" +#include "rewrite/prs2lock.h" +#include "storage/block.h" +#include "storage/fd.h" +#include "storage/ipc.h" +#include "storage/itemptr.h" +#include "storage/off.h" +#include "storage/smgr.h" +#include "tcop/dest.h" +#include "utils/memutils.h" +#include "utils/rel.h" + + +/* + * Bison doesn't allocate anything that needs to live across parser calls, + * so we can easily have it use palloc instead of malloc. This prevents + * memory leaks if we error out during parsing. Note this only works with + * bison >= 2.0. However, in bison 1.875 the default is to use alloca() + * if possible, so there's not really much problem anyhow, at least if + * you're building with gcc. + */ +#define YYMALLOC palloc +#define YYFREE pfree + +static MemoryContext per_line_ctx = NULL; + +static void +do_start(void) +{ + Assert(CurrentMemoryContext == CurTransactionContext); + /* First time through, create the per-line working context */ + if (per_line_ctx == NULL) + per_line_ctx = AllocSetContextCreate(CurTransactionContext, + "bootstrap per-line processing", + ALLOCSET_DEFAULT_SIZES); + MemoryContextSwitchTo(per_line_ctx); +} + + +static void +do_end(void) +{ + /* Reclaim memory allocated while processing this line */ + MemoryContextSwitchTo(CurTransactionContext); + MemoryContextReset(per_line_ctx); + CHECK_FOR_INTERRUPTS(); /* allow SIGINT to kill bootstrap run */ + if (isatty(0)) + { + printf("bootstrap> "); + fflush(stdout); + } +} + + +static int num_columns_read = 0; + +%} + +%expect 0 +%name-prefix="boot_yy" + +%union +{ + List *list; + IndexElem *ielem; + char *str; + const char *kw; + int ival; + Oid oidval; +} + +%type boot_index_params +%type boot_index_param +%type boot_ident +%type optbootstrap optsharedrelation boot_column_nullness +%type oidspec optrowtypeoid + +%token ID +%token COMMA EQUALS LPAREN RPAREN +/* NULLVAL is a reserved keyword */ +%token NULLVAL +/* All the rest are unreserved, and should be handled in boot_ident! */ +%token OPEN XCLOSE XCREATE INSERT_TUPLE +%token XDECLARE INDEX ON USING XBUILD INDICES UNIQUE XTOAST +%token OBJ_ID XBOOTSTRAP XSHARED_RELATION XROWTYPE_OID +%token XFORCE XNOT XNULL + +%start TopLevel + +%% + +TopLevel: + Boot_Queries + | + ; + +Boot_Queries: + Boot_Query + | Boot_Queries Boot_Query + ; + +Boot_Query : + Boot_OpenStmt + | Boot_CloseStmt + | Boot_CreateStmt + | Boot_InsertStmt + | Boot_DeclareIndexStmt + | Boot_DeclareUniqueIndexStmt + | Boot_DeclareToastStmt + | Boot_BuildIndsStmt + ; + +Boot_OpenStmt: + OPEN boot_ident + { + do_start(); + boot_openrel($2); + do_end(); + } + ; + +Boot_CloseStmt: + XCLOSE boot_ident + { + do_start(); + closerel($2); + do_end(); + } + ; + +Boot_CreateStmt: + XCREATE boot_ident oidspec optbootstrap optsharedrelation optrowtypeoid LPAREN + { + do_start(); + numattr = 0; + elog(DEBUG4, "creating%s%s relation %s %u", + $4 ? " bootstrap" : "", + $5 ? " shared" : "", + $2, + $3); + } + boot_column_list + { + do_end(); + } + RPAREN + { + TupleDesc tupdesc; + bool shared_relation; + bool mapped_relation; + + do_start(); + + tupdesc = CreateTupleDesc(numattr, attrtypes); + + shared_relation = $5; + + /* + * The catalogs that use the relation mapper are the + * bootstrap catalogs plus the shared catalogs. If this + * ever gets more complicated, we should invent a BKI + * keyword to mark the mapped catalogs, but for now a + * quick hack seems the most appropriate thing. Note in + * particular that all "nailed" heap rels (see formrdesc + * in relcache.c) must be mapped. + */ + mapped_relation = ($4 || shared_relation); + + if ($4) + { + TransactionId relfrozenxid; + MultiXactId relminmxid; + + if (boot_reldesc) + { + elog(DEBUG4, "create bootstrap: warning, open relation exists, closing first"); + closerel(NULL); + } + + boot_reldesc = heap_create($2, + PG_CATALOG_NAMESPACE, + shared_relation ? GLOBALTABLESPACE_OID : 0, + $3, + InvalidOid, + HEAP_TABLE_AM_OID, + tupdesc, + RELKIND_RELATION, + RELPERSISTENCE_PERMANENT, + shared_relation, + mapped_relation, + true, + &relfrozenxid, + &relminmxid); + elog(DEBUG4, "bootstrap relation created"); + } + else + { + Oid id; + + id = heap_create_with_catalog($2, + PG_CATALOG_NAMESPACE, + shared_relation ? GLOBALTABLESPACE_OID : 0, + $3, + $6, + InvalidOid, + BOOTSTRAP_SUPERUSERID, + HEAP_TABLE_AM_OID, + tupdesc, + NIL, + RELKIND_RELATION, + RELPERSISTENCE_PERMANENT, + shared_relation, + mapped_relation, + ONCOMMIT_NOOP, + (Datum) 0, + false, + true, + false, + InvalidOid, + NULL); + elog(DEBUG4, "relation created with OID %u", id); + } + do_end(); + } + ; + +Boot_InsertStmt: + INSERT_TUPLE + { + do_start(); + elog(DEBUG4, "inserting row"); + num_columns_read = 0; + } + LPAREN boot_column_val_list RPAREN + { + if (num_columns_read != numattr) + elog(ERROR, "incorrect number of columns in row (expected %d, got %d)", + numattr, num_columns_read); + if (boot_reldesc == NULL) + elog(FATAL, "relation not open"); + InsertOneTuple(); + do_end(); + } + ; + +Boot_DeclareIndexStmt: + XDECLARE INDEX boot_ident oidspec ON boot_ident USING boot_ident LPAREN boot_index_params RPAREN + { + IndexStmt *stmt = makeNode(IndexStmt); + Oid relationId; + + elog(DEBUG4, "creating index \"%s\"", $3); + + do_start(); + + stmt->idxname = $3; + stmt->relation = makeRangeVar(NULL, $6, -1); + stmt->accessMethod = $8; + stmt->tableSpace = NULL; + stmt->indexParams = $10; + stmt->indexIncludingParams = NIL; + stmt->options = NIL; + stmt->whereClause = NULL; + stmt->excludeOpNames = NIL; + stmt->idxcomment = NULL; + stmt->indexOid = InvalidOid; + stmt->oldNode = InvalidOid; + stmt->oldCreateSubid = InvalidSubTransactionId; + stmt->oldFirstRelfilenodeSubid = InvalidSubTransactionId; + stmt->unique = false; + stmt->primary = false; + stmt->isconstraint = false; + stmt->deferrable = false; + stmt->initdeferred = false; + stmt->transformed = false; + stmt->concurrent = false; + stmt->if_not_exists = false; + stmt->reset_default_tblspc = false; + + /* locks and races need not concern us in bootstrap mode */ + relationId = RangeVarGetRelid(stmt->relation, NoLock, + false); + + DefineIndex(relationId, + stmt, + $4, + InvalidOid, + InvalidOid, + false, + false, + false, + true, /* skip_build */ + false); + do_end(); + } + ; + +Boot_DeclareUniqueIndexStmt: + XDECLARE UNIQUE INDEX boot_ident oidspec ON boot_ident USING boot_ident LPAREN boot_index_params RPAREN + { + IndexStmt *stmt = makeNode(IndexStmt); + Oid relationId; + + elog(DEBUG4, "creating unique index \"%s\"", $4); + + do_start(); + + stmt->idxname = $4; + stmt->relation = makeRangeVar(NULL, $7, -1); + stmt->accessMethod = $9; + stmt->tableSpace = NULL; + stmt->indexParams = $11; + stmt->indexIncludingParams = NIL; + stmt->options = NIL; + stmt->whereClause = NULL; + stmt->excludeOpNames = NIL; + stmt->idxcomment = NULL; + stmt->indexOid = InvalidOid; + stmt->oldNode = InvalidOid; + stmt->oldCreateSubid = InvalidSubTransactionId; + stmt->oldFirstRelfilenodeSubid = InvalidSubTransactionId; + stmt->unique = true; + stmt->primary = false; + stmt->isconstraint = false; + stmt->deferrable = false; + stmt->initdeferred = false; + stmt->transformed = false; + stmt->concurrent = false; + stmt->if_not_exists = false; + stmt->reset_default_tblspc = false; + + /* locks and races need not concern us in bootstrap mode */ + relationId = RangeVarGetRelid(stmt->relation, NoLock, + false); + + DefineIndex(relationId, + stmt, + $5, + InvalidOid, + InvalidOid, + false, + false, + false, + true, /* skip_build */ + false); + do_end(); + } + ; + +Boot_DeclareToastStmt: + XDECLARE XTOAST oidspec oidspec ON boot_ident + { + elog(DEBUG4, "creating toast table for table \"%s\"", $6); + + do_start(); + + BootstrapToastTable($6, $3, $4); + do_end(); + } + ; + +Boot_BuildIndsStmt: + XBUILD INDICES + { + do_start(); + build_indices(); + do_end(); + } + ; + + +boot_index_params: + boot_index_params COMMA boot_index_param { $$ = lappend($1, $3); } + | boot_index_param { $$ = list_make1($1); } + ; + +boot_index_param: + boot_ident boot_ident + { + IndexElem *n = makeNode(IndexElem); + n->name = $1; + n->expr = NULL; + n->indexcolname = NULL; + n->collation = NIL; + n->opclass = list_make1(makeString($2)); + n->ordering = SORTBY_DEFAULT; + n->nulls_ordering = SORTBY_NULLS_DEFAULT; + $$ = n; + } + ; + +optbootstrap: + XBOOTSTRAP { $$ = 1; } + | { $$ = 0; } + ; + +optsharedrelation: + XSHARED_RELATION { $$ = 1; } + | { $$ = 0; } + ; + +optrowtypeoid: + XROWTYPE_OID oidspec { $$ = $2; } + | { $$ = InvalidOid; } + ; + +boot_column_list: + boot_column_def + | boot_column_list COMMA boot_column_def + ; + +boot_column_def: + boot_ident EQUALS boot_ident boot_column_nullness + { + if (++numattr > MAXATTR) + elog(FATAL, "too many columns"); + DefineAttr($1, $3, numattr-1, $4); + } + ; + +boot_column_nullness: + XFORCE XNOT XNULL { $$ = BOOTCOL_NULL_FORCE_NOT_NULL; } + | XFORCE XNULL { $$ = BOOTCOL_NULL_FORCE_NULL; } + | { $$ = BOOTCOL_NULL_AUTO; } + ; + +oidspec: + boot_ident { $$ = atooid($1); } + ; + +boot_column_val_list: + boot_column_val + | boot_column_val_list boot_column_val + | boot_column_val_list COMMA boot_column_val + ; + +boot_column_val: + boot_ident + { InsertOneValue($1, num_columns_read++); } + | NULLVAL + { InsertOneNull(num_columns_read++); } + ; + +boot_ident: + ID { $$ = $1; } + | OPEN { $$ = pstrdup($1); } + | XCLOSE { $$ = pstrdup($1); } + | XCREATE { $$ = pstrdup($1); } + | INSERT_TUPLE { $$ = pstrdup($1); } + | XDECLARE { $$ = pstrdup($1); } + | INDEX { $$ = pstrdup($1); } + | ON { $$ = pstrdup($1); } + | USING { $$ = pstrdup($1); } + | XBUILD { $$ = pstrdup($1); } + | INDICES { $$ = pstrdup($1); } + | UNIQUE { $$ = pstrdup($1); } + | XTOAST { $$ = pstrdup($1); } + | OBJ_ID { $$ = pstrdup($1); } + | XBOOTSTRAP { $$ = pstrdup($1); } + | XSHARED_RELATION { $$ = pstrdup($1); } + | XROWTYPE_OID { $$ = pstrdup($1); } + | XFORCE { $$ = pstrdup($1); } + | XNOT { $$ = pstrdup($1); } + | XNULL { $$ = pstrdup($1); } + ; +%% + +#include "bootscanner.c" diff --git a/src/backend/bootstrap/bootscanner.c b/src/backend/bootstrap/bootscanner.c new file mode 100644 index 0000000..94b2545 --- /dev/null +++ b/src/backend/bootstrap/bootscanner.c @@ -0,0 +1,2281 @@ +#line 2 "bootscanner.c" + +#line 4 "bootscanner.c" + +#define YY_INT_ALIGNED short int + +/* A lexical scanner generated by flex */ + +#define yy_create_buffer boot_yy_create_buffer +#define yy_delete_buffer boot_yy_delete_buffer +#define yy_scan_buffer boot_yy_scan_buffer +#define yy_scan_string boot_yy_scan_string +#define yy_scan_bytes boot_yy_scan_bytes +#define yy_init_buffer boot_yy_init_buffer +#define yy_flush_buffer boot_yy_flush_buffer +#define yy_load_buffer_state boot_yy_load_buffer_state +#define yy_switch_to_buffer boot_yy_switch_to_buffer +#define yypush_buffer_state boot_yypush_buffer_state +#define yypop_buffer_state boot_yypop_buffer_state +#define yyensure_buffer_stack boot_yyensure_buffer_stack +#define yy_flex_debug boot_yy_flex_debug +#define yyin boot_yyin +#define yyleng boot_yyleng +#define yylex boot_yylex +#define yylineno boot_yylineno +#define yyout boot_yyout +#define yyrestart boot_yyrestart +#define yytext boot_yytext +#define yywrap boot_yywrap +#define yyalloc boot_yyalloc +#define yyrealloc boot_yyrealloc +#define yyfree boot_yyfree + +#define FLEX_SCANNER +#define YY_FLEX_MAJOR_VERSION 2 +#define YY_FLEX_MINOR_VERSION 6 +#define YY_FLEX_SUBMINOR_VERSION 4 +#if YY_FLEX_SUBMINOR_VERSION > 0 +#define FLEX_BETA +#endif + +#ifdef yy_create_buffer +#define boot_yy_create_buffer_ALREADY_DEFINED +#else +#define yy_create_buffer boot_yy_create_buffer +#endif + +#ifdef yy_delete_buffer +#define boot_yy_delete_buffer_ALREADY_DEFINED +#else +#define yy_delete_buffer boot_yy_delete_buffer +#endif + +#ifdef yy_scan_buffer +#define boot_yy_scan_buffer_ALREADY_DEFINED +#else +#define yy_scan_buffer boot_yy_scan_buffer +#endif + +#ifdef yy_scan_string +#define boot_yy_scan_string_ALREADY_DEFINED +#else +#define yy_scan_string boot_yy_scan_string +#endif + +#ifdef yy_scan_bytes +#define boot_yy_scan_bytes_ALREADY_DEFINED +#else +#define yy_scan_bytes boot_yy_scan_bytes +#endif + +#ifdef yy_init_buffer +#define boot_yy_init_buffer_ALREADY_DEFINED +#else +#define yy_init_buffer boot_yy_init_buffer +#endif + +#ifdef yy_flush_buffer +#define boot_yy_flush_buffer_ALREADY_DEFINED +#else +#define yy_flush_buffer boot_yy_flush_buffer +#endif + +#ifdef yy_load_buffer_state +#define boot_yy_load_buffer_state_ALREADY_DEFINED +#else +#define yy_load_buffer_state boot_yy_load_buffer_state +#endif + +#ifdef yy_switch_to_buffer +#define boot_yy_switch_to_buffer_ALREADY_DEFINED +#else +#define yy_switch_to_buffer boot_yy_switch_to_buffer +#endif + +#ifdef yypush_buffer_state +#define boot_yypush_buffer_state_ALREADY_DEFINED +#else +#define yypush_buffer_state boot_yypush_buffer_state +#endif + +#ifdef yypop_buffer_state +#define boot_yypop_buffer_state_ALREADY_DEFINED +#else +#define yypop_buffer_state boot_yypop_buffer_state +#endif + +#ifdef yyensure_buffer_stack +#define boot_yyensure_buffer_stack_ALREADY_DEFINED +#else +#define yyensure_buffer_stack boot_yyensure_buffer_stack +#endif + +#ifdef yylex +#define boot_yylex_ALREADY_DEFINED +#else +#define yylex boot_yylex +#endif + +#ifdef yyrestart +#define boot_yyrestart_ALREADY_DEFINED +#else +#define yyrestart boot_yyrestart +#endif + +#ifdef yylex_init +#define boot_yylex_init_ALREADY_DEFINED +#else +#define yylex_init boot_yylex_init +#endif + +#ifdef yylex_init_extra +#define boot_yylex_init_extra_ALREADY_DEFINED +#else +#define yylex_init_extra boot_yylex_init_extra +#endif + +#ifdef yylex_destroy +#define boot_yylex_destroy_ALREADY_DEFINED +#else +#define yylex_destroy boot_yylex_destroy +#endif + +#ifdef yyget_debug +#define boot_yyget_debug_ALREADY_DEFINED +#else +#define yyget_debug boot_yyget_debug +#endif + +#ifdef yyset_debug +#define boot_yyset_debug_ALREADY_DEFINED +#else +#define yyset_debug boot_yyset_debug +#endif + +#ifdef yyget_extra +#define boot_yyget_extra_ALREADY_DEFINED +#else +#define yyget_extra boot_yyget_extra +#endif + +#ifdef yyset_extra +#define boot_yyset_extra_ALREADY_DEFINED +#else +#define yyset_extra boot_yyset_extra +#endif + +#ifdef yyget_in +#define boot_yyget_in_ALREADY_DEFINED +#else +#define yyget_in boot_yyget_in +#endif + +#ifdef yyset_in +#define boot_yyset_in_ALREADY_DEFINED +#else +#define yyset_in boot_yyset_in +#endif + +#ifdef yyget_out +#define boot_yyget_out_ALREADY_DEFINED +#else +#define yyget_out boot_yyget_out +#endif + +#ifdef yyset_out +#define boot_yyset_out_ALREADY_DEFINED +#else +#define yyset_out boot_yyset_out +#endif + +#ifdef yyget_leng +#define boot_yyget_leng_ALREADY_DEFINED +#else +#define yyget_leng boot_yyget_leng +#endif + +#ifdef yyget_text +#define boot_yyget_text_ALREADY_DEFINED +#else +#define yyget_text boot_yyget_text +#endif + +#ifdef yyget_lineno +#define boot_yyget_lineno_ALREADY_DEFINED +#else +#define yyget_lineno boot_yyget_lineno +#endif + +#ifdef yyset_lineno +#define boot_yyset_lineno_ALREADY_DEFINED +#else +#define yyset_lineno boot_yyset_lineno +#endif + +#ifdef yywrap +#define boot_yywrap_ALREADY_DEFINED +#else +#define yywrap boot_yywrap +#endif + +#ifdef yyalloc +#define boot_yyalloc_ALREADY_DEFINED +#else +#define yyalloc boot_yyalloc +#endif + +#ifdef yyrealloc +#define boot_yyrealloc_ALREADY_DEFINED +#else +#define yyrealloc boot_yyrealloc +#endif + +#ifdef yyfree +#define boot_yyfree_ALREADY_DEFINED +#else +#define yyfree boot_yyfree +#endif + +#ifdef yytext +#define boot_yytext_ALREADY_DEFINED +#else +#define yytext boot_yytext +#endif + +#ifdef yyleng +#define boot_yyleng_ALREADY_DEFINED +#else +#define yyleng boot_yyleng +#endif + +#ifdef yyin +#define boot_yyin_ALREADY_DEFINED +#else +#define yyin boot_yyin +#endif + +#ifdef yyout +#define boot_yyout_ALREADY_DEFINED +#else +#define yyout boot_yyout +#endif + +#ifdef yy_flex_debug +#define boot_yy_flex_debug_ALREADY_DEFINED +#else +#define yy_flex_debug boot_yy_flex_debug +#endif + +#ifdef yylineno +#define boot_yylineno_ALREADY_DEFINED +#else +#define yylineno boot_yylineno +#endif + +/* First, we deal with platform-specific or compiler-specific issues. */ + +/* begin standard C headers. */ +#include +#include +#include +#include + +/* end standard C headers. */ + +/* flex integer type definitions */ + +#ifndef FLEXINT_H +#define FLEXINT_H + +/* C99 systems have . Non-C99 systems may or may not. */ + +#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L + +/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h, + * if you want the limit (max/min) macros for int types. + */ +#ifndef __STDC_LIMIT_MACROS +#define __STDC_LIMIT_MACROS 1 +#endif + +#include +typedef int8_t flex_int8_t; +typedef uint8_t flex_uint8_t; +typedef int16_t flex_int16_t; +typedef uint16_t flex_uint16_t; +typedef int32_t flex_int32_t; +typedef uint32_t flex_uint32_t; +#else +typedef signed char flex_int8_t; +typedef short int flex_int16_t; +typedef int flex_int32_t; +typedef unsigned char flex_uint8_t; +typedef unsigned short int flex_uint16_t; +typedef unsigned int flex_uint32_t; + +/* Limits of integral types. */ +#ifndef INT8_MIN +#define INT8_MIN (-128) +#endif +#ifndef INT16_MIN +#define INT16_MIN (-32767-1) +#endif +#ifndef INT32_MIN +#define INT32_MIN (-2147483647-1) +#endif +#ifndef INT8_MAX +#define INT8_MAX (127) +#endif +#ifndef INT16_MAX +#define INT16_MAX (32767) +#endif +#ifndef INT32_MAX +#define INT32_MAX (2147483647) +#endif +#ifndef UINT8_MAX +#define UINT8_MAX (255U) +#endif +#ifndef UINT16_MAX +#define UINT16_MAX (65535U) +#endif +#ifndef UINT32_MAX +#define UINT32_MAX (4294967295U) +#endif + +#ifndef SIZE_MAX +#define SIZE_MAX (~(size_t)0) +#endif + +#endif /* ! C99 */ + +#endif /* ! FLEXINT_H */ + +/* begin standard C++ headers. */ + +/* TODO: this is always defined, so inline it */ +#define yyconst const + +#if defined(__GNUC__) && __GNUC__ >= 3 +#define yynoreturn __attribute__((__noreturn__)) +#else +#define yynoreturn +#endif + +/* Returned upon end-of-file. */ +#define YY_NULL 0 + +/* Promotes a possibly negative, possibly signed char to an + * integer in range [0..255] for use as an array index. + */ +#define YY_SC_TO_UI(c) ((YY_CHAR) (c)) + +/* Enter a start condition. This macro really ought to take a parameter, + * but we do it the disgusting crufty way forced on us by the ()-less + * definition of BEGIN. + */ +#define BEGIN (yy_start) = 1 + 2 * +/* Translate the current start state into a value that can be later handed + * to BEGIN to return to the state. The YYSTATE alias is for lex + * compatibility. + */ +#define YY_START (((yy_start) - 1) / 2) +#define YYSTATE YY_START +/* Action number for EOF rule of a given start state. */ +#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1) +/* Special action meaning "start processing a new file". */ +#define YY_NEW_FILE yyrestart( yyin ) +#define YY_END_OF_BUFFER_CHAR 0 + +/* Size of default input buffer. */ +#ifndef YY_BUF_SIZE +#ifdef __ia64__ +/* On IA-64, the buffer size is 16k, not 8k. + * Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case. + * Ditto for the __ia64__ case accordingly. + */ +#define YY_BUF_SIZE 32768 +#else +#define YY_BUF_SIZE 16384 +#endif /* __ia64__ */ +#endif + +/* The state buf must be large enough to hold one state per character in the main buffer. + */ +#define YY_STATE_BUF_SIZE ((YY_BUF_SIZE + 2) * sizeof(yy_state_type)) + +#ifndef YY_TYPEDEF_YY_BUFFER_STATE +#define YY_TYPEDEF_YY_BUFFER_STATE +typedef struct yy_buffer_state *YY_BUFFER_STATE; +#endif + +#ifndef YY_TYPEDEF_YY_SIZE_T +#define YY_TYPEDEF_YY_SIZE_T +typedef size_t yy_size_t; +#endif + +extern int yyleng; + +extern FILE *yyin, *yyout; + +#define EOB_ACT_CONTINUE_SCAN 0 +#define EOB_ACT_END_OF_FILE 1 +#define EOB_ACT_LAST_MATCH 2 + + #define YY_LESS_LINENO(n) + #define YY_LINENO_REWIND_TO(ptr) + +/* Return all but the first "n" matched characters back to the input stream. */ +#define yyless(n) \ + do \ + { \ + /* Undo effects of setting up yytext. */ \ + int yyless_macro_arg = (n); \ + YY_LESS_LINENO(yyless_macro_arg);\ + *yy_cp = (yy_hold_char); \ + YY_RESTORE_YY_MORE_OFFSET \ + (yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \ + YY_DO_BEFORE_ACTION; /* set up yytext again */ \ + } \ + while ( 0 ) +#define unput(c) yyunput( c, (yytext_ptr) ) + +#ifndef YY_STRUCT_YY_BUFFER_STATE +#define YY_STRUCT_YY_BUFFER_STATE +struct yy_buffer_state + { + FILE *yy_input_file; + + char *yy_ch_buf; /* input buffer */ + char *yy_buf_pos; /* current position in input buffer */ + + /* Size of input buffer in bytes, not including room for EOB + * characters. + */ + int yy_buf_size; + + /* Number of characters read into yy_ch_buf, not including EOB + * characters. + */ + int yy_n_chars; + + /* Whether we "own" the buffer - i.e., we know we created it, + * and can realloc() it to grow it, and should free() it to + * delete it. + */ + int yy_is_our_buffer; + + /* Whether this is an "interactive" input source; if so, and + * if we're using stdio for input, then we want to use getc() + * instead of fread(), to make sure we stop fetching input after + * each newline. + */ + int yy_is_interactive; + + /* Whether we're considered to be at the beginning of a line. + * If so, '^' rules will be active on the next match, otherwise + * not. + */ + int yy_at_bol; + + int yy_bs_lineno; /**< The line count. */ + int yy_bs_column; /**< The column count. */ + + /* Whether to try to fill the input buffer when we reach the + * end of it. + */ + int yy_fill_buffer; + + int yy_buffer_status; + +#define YY_BUFFER_NEW 0 +#define YY_BUFFER_NORMAL 1 + /* When an EOF's been seen but there's still some text to process + * then we mark the buffer as YY_EOF_PENDING, to indicate that we + * shouldn't try reading from the input source any more. We might + * still have a bunch of tokens to match, though, because of + * possible backing-up. + * + * When we actually see the EOF, we change the status to "new" + * (via yyrestart()), so that the user can continue scanning by + * just pointing yyin at a new input file. + */ +#define YY_BUFFER_EOF_PENDING 2 + + }; +#endif /* !YY_STRUCT_YY_BUFFER_STATE */ + +/* Stack of input buffers. */ +static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */ +static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */ +static YY_BUFFER_STATE * yy_buffer_stack = NULL; /**< Stack as an array. */ + +/* We provide macros for accessing buffer states in case in the + * future we want to put the buffer states in a more general + * "scanner state". + * + * Returns the top of the stack, or NULL. + */ +#define YY_CURRENT_BUFFER ( (yy_buffer_stack) \ + ? (yy_buffer_stack)[(yy_buffer_stack_top)] \ + : NULL) +/* Same as previous macro, but useful when we know that the buffer stack is not + * NULL or when we need an lvalue. For internal use only. + */ +#define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)] + +/* yy_hold_char holds the character lost when yytext is formed. */ +static char yy_hold_char; +static int yy_n_chars; /* number of characters read into yy_ch_buf */ +int yyleng; + +/* Points to current character in buffer. */ +static char *yy_c_buf_p = NULL; +static int yy_init = 0; /* whether we need to initialize */ +static int yy_start = 0; /* start state number */ + +/* Flag which is used to allow yywrap()'s to do buffer switches + * instead of setting up a fresh yyin. A bit of a hack ... + */ +static int yy_did_buffer_switch_on_eof; + +void yyrestart ( FILE *input_file ); +void yy_switch_to_buffer ( YY_BUFFER_STATE new_buffer ); +YY_BUFFER_STATE yy_create_buffer ( FILE *file, int size ); +void yy_delete_buffer ( YY_BUFFER_STATE b ); +void yy_flush_buffer ( YY_BUFFER_STATE b ); +void yypush_buffer_state ( YY_BUFFER_STATE new_buffer ); +void yypop_buffer_state ( void ); + +static void yyensure_buffer_stack ( void ); +static void yy_load_buffer_state ( void ); +static void yy_init_buffer ( YY_BUFFER_STATE b, FILE *file ); +#define YY_FLUSH_BUFFER yy_flush_buffer( YY_CURRENT_BUFFER ) + +YY_BUFFER_STATE yy_scan_buffer ( char *base, yy_size_t size ); +YY_BUFFER_STATE yy_scan_string ( const char *yy_str ); +YY_BUFFER_STATE yy_scan_bytes ( const char *bytes, int len ); + +void *yyalloc ( yy_size_t ); +void *yyrealloc ( void *, yy_size_t ); +void yyfree ( void * ); + +#define yy_new_buffer yy_create_buffer +#define yy_set_interactive(is_interactive) \ + { \ + if ( ! YY_CURRENT_BUFFER ){ \ + yyensure_buffer_stack (); \ + YY_CURRENT_BUFFER_LVALUE = \ + yy_create_buffer( yyin, YY_BUF_SIZE ); \ + } \ + YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \ + } +#define yy_set_bol(at_bol) \ + { \ + if ( ! YY_CURRENT_BUFFER ){\ + yyensure_buffer_stack (); \ + YY_CURRENT_BUFFER_LVALUE = \ + yy_create_buffer( yyin, YY_BUF_SIZE ); \ + } \ + YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \ + } +#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol) + +/* Begin user sect3 */ + +#define boot_yywrap() (/*CONSTCOND*/1) +#define YY_SKIP_YYWRAP +typedef flex_uint8_t YY_CHAR; + +FILE *yyin = NULL, *yyout = NULL; + +typedef int yy_state_type; + +extern int yylineno; +int yylineno = 1; + +extern char *yytext; +#ifdef yytext_ptr +#undef yytext_ptr +#endif +#define yytext_ptr yytext + +static yy_state_type yy_get_previous_state ( void ); +static yy_state_type yy_try_NUL_trans ( yy_state_type current_state ); +static int yy_get_next_buffer ( void ); +static void yynoreturn yy_fatal_error ( const char* msg ); + +/* Done after the current pattern has been matched and before the + * corresponding action - sets up yytext. + */ +#define YY_DO_BEFORE_ACTION \ + (yytext_ptr) = yy_bp; \ + yyleng = (int) (yy_cp - yy_bp); \ + (yy_hold_char) = *yy_cp; \ + *yy_cp = '\0'; \ + (yy_c_buf_p) = yy_cp; +#define YY_NUM_RULES 31 +#define YY_END_OF_BUFFER 32 +/* This struct is not used in this scanner, + but its presence is necessary. */ +struct yy_trans_info + { + flex_int32_t yy_verify; + flex_int32_t yy_nxt; + }; +static const flex_int16_t yy_accept[128] = + { 0, + 0, 0, 32, 30, 15, 14, 30, 12, 13, 10, + 28, 11, 28, 28, 28, 28, 28, 28, 28, 28, + 28, 28, 28, 28, 28, 16, 0, 29, 28, 28, + 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, + 22, 28, 28, 28, 28, 28, 28, 16, 28, 26, + 28, 4, 28, 28, 28, 28, 28, 28, 28, 28, + 28, 28, 28, 28, 28, 28, 28, 27, 28, 28, + 28, 28, 28, 28, 28, 28, 28, 1, 28, 28, + 28, 28, 28, 25, 28, 28, 18, 2, 28, 28, + 21, 28, 28, 28, 28, 24, 28, 23, 9, 28, + + 3, 28, 28, 8, 28, 28, 20, 28, 17, 19, + 28, 28, 28, 28, 28, 5, 28, 28, 28, 28, + 7, 28, 28, 28, 28, 6, 0 + } ; + +static const YY_CHAR yy_ec[256] = + { 0, + 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, + 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 2, 1, 4, 5, 1, 1, 1, 1, 6, + 7, 1, 1, 8, 9, 1, 1, 9, 9, 9, + 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, + 10, 1, 1, 1, 9, 9, 11, 12, 13, 14, + 9, 9, 15, 9, 9, 16, 9, 17, 18, 9, + 9, 19, 9, 20, 21, 9, 9, 9, 9, 9, + 1, 1, 1, 1, 22, 1, 23, 24, 25, 26, + + 27, 9, 28, 29, 30, 9, 9, 31, 9, 32, + 33, 34, 35, 36, 37, 38, 39, 9, 40, 41, + 42, 9, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1 + } ; + +static const YY_CHAR yy_meta[43] = + { 0, + 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, + 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, + 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, + 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, + 3, 3 + } ; + +static const flex_int16_t yy_base[131] = + { 0, + 0, 143, 147, 149, 149, 149, 142, 149, 149, 149, + 0, 149, 127, 25, 129, 111, 11, 16, 115, 109, + 17, 107, 110, 105, 16, 0, 133, 149, 0, 117, + 115, 118, 121, 93, 98, 100, 96, 101, 102, 19, + 0, 99, 85, 101, 100, 92, 91, 0, 109, 0, + 103, 0, 87, 79, 85, 78, 91, 82, 27, 85, + 79, 72, 73, 71, 72, 74, 92, 0, 73, 66, + 76, 74, 62, 76, 57, 72, 60, 0, 53, 67, + 55, 53, 63, 0, 68, 51, 0, 0, 61, 51, + 0, 59, 47, 50, 57, 0, 55, 0, 0, 45, + + 0, 53, 42, 0, 51, 55, 0, 53, 0, 0, + 53, 38, 39, 39, 44, 0, 40, 38, 42, 44, + 0, 28, 35, 31, 30, 0, 149, 57, 52, 60 + } ; + +static const flex_int16_t yy_def[131] = + { 0, + 127, 1, 127, 127, 127, 127, 128, 127, 127, 127, + 129, 127, 129, 129, 129, 129, 129, 129, 129, 129, + 129, 129, 129, 129, 129, 130, 128, 127, 129, 129, + 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, + 129, 129, 129, 129, 129, 129, 129, 130, 129, 129, + 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, + 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, + 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, + 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, + 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, + + 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, + 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, + 129, 129, 129, 129, 129, 129, 0, 127, 127, 127 + } ; + +static const flex_int16_t yy_nxt[192] = + { 0, + 4, 5, 6, 7, 4, 8, 9, 10, 11, 12, + 11, 11, 11, 13, 11, 11, 14, 15, 11, 11, + 11, 16, 11, 17, 18, 19, 11, 11, 11, 20, + 11, 11, 21, 11, 11, 22, 23, 24, 25, 11, + 11, 11, 31, 35, 59, 32, 37, 46, 41, 36, + 42, 38, 47, 75, 29, 60, 76, 27, 27, 27, + 48, 126, 48, 125, 124, 123, 122, 121, 120, 119, + 118, 117, 116, 115, 114, 113, 112, 111, 110, 109, + 108, 107, 106, 105, 104, 103, 102, 101, 100, 99, + 98, 97, 96, 95, 94, 93, 92, 91, 90, 89, + + 88, 87, 86, 85, 84, 83, 82, 81, 80, 79, + 78, 77, 74, 73, 72, 71, 70, 69, 68, 67, + 66, 65, 64, 63, 62, 61, 58, 57, 56, 55, + 54, 53, 52, 51, 50, 49, 28, 45, 44, 43, + 40, 39, 34, 33, 30, 28, 127, 26, 3, 127, + 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, + 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, + 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, + 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, + 127 + + } ; + +static const flex_int16_t yy_chk[192] = + { 0, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 14, 17, 40, 14, 18, 25, 21, 17, + 21, 18, 25, 59, 129, 40, 59, 128, 128, 128, + 130, 125, 130, 124, 123, 122, 120, 119, 118, 117, + 115, 114, 113, 112, 111, 108, 106, 105, 103, 102, + 100, 97, 95, 94, 93, 92, 90, 89, 86, 85, + 83, 82, 81, 80, 79, 77, 76, 75, 74, 73, + + 72, 71, 70, 69, 67, 66, 65, 64, 63, 62, + 61, 60, 58, 57, 56, 55, 54, 53, 51, 49, + 47, 46, 45, 44, 43, 42, 39, 38, 37, 36, + 35, 34, 33, 32, 31, 30, 27, 24, 23, 22, + 20, 19, 16, 15, 13, 7, 3, 2, 127, 127, + 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, + 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, + 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, + 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, + 127 + + } ; + +static yy_state_type yy_last_accepting_state; +static char *yy_last_accepting_cpos; + +extern int yy_flex_debug; +int yy_flex_debug = 0; + +/* The intent behind this definition is that it'll catch + * any uses of REJECT which flex missed. + */ +#define REJECT reject_used_but_not_detected +#define yymore() yymore_used_but_not_detected +#define YY_MORE_ADJ 0 +#define YY_RESTORE_YY_MORE_OFFSET +char *yytext; +#line 1 "bootscanner.l" +#line 2 "bootscanner.l" +/*------------------------------------------------------------------------- + * + * bootscanner.l + * a lexical scanner for the bootstrap parser + * + * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group + * Portions Copyright (c) 1994, Regents of the University of California + * + * + * IDENTIFICATION + * src/backend/bootstrap/bootscanner.l + * + *------------------------------------------------------------------------- + */ +#include "postgres.h" + +#include "access/attnum.h" +#include "access/htup.h" +#include "access/itup.h" +#include "access/tupdesc.h" +#include "bootstrap/bootstrap.h" +#include "catalog/pg_am.h" +#include "catalog/pg_attribute.h" +#include "catalog/pg_class.h" +#include "nodes/nodes.h" +#include "nodes/parsenodes.h" +#include "nodes/pg_list.h" +#include "nodes/primnodes.h" +#include "parser/scansup.h" +#include "rewrite/prs2lock.h" +#include "storage/block.h" +#include "storage/fd.h" +#include "storage/itemptr.h" +#include "storage/off.h" +#include "utils/rel.h" + +/* Not needed now that this file is compiled as part of bootparse. */ +/* #include "bootparse.h" */ + +/* LCOV_EXCL_START */ + +/* Avoid exit() on fatal scanner errors (a bit ugly -- see yy_fatal_error) */ +#undef fprintf +#define fprintf(file, fmt, msg) fprintf_to_ereport(fmt, msg) + +static void +fprintf_to_ereport(const char *fmt, const char *msg) +{ + ereport(ERROR, (errmsg_internal("%s", msg))); +} + + +static int yyline = 1; /* line number for error reporting */ + +#line 844 "bootscanner.c" +#define YY_NO_INPUT 1 +/* + * Keyword tokens return the keyword text (as a constant string) in yylval.kw, + * just in case that's needed because we want to treat the keyword as an + * unreserved identifier. Note that _null_ is not treated as a keyword + * for this purpose; it's the one "reserved word" in the bootstrap syntax. + * + * Notice that all the keywords are case-sensitive, and for historical + * reasons some must be upper case. + * + * String tokens return a palloc'd string in yylval.str. + */ +#line 857 "bootscanner.c" + +#define INITIAL 0 + +#ifndef YY_NO_UNISTD_H +/* Special case for "unistd.h", since it is non-ANSI. We include it way + * down here because we want the user's section 1 to have been scanned first. + * The user has a chance to override it with an option. + */ +#include +#endif + +#ifndef YY_EXTRA_TYPE +#define YY_EXTRA_TYPE void * +#endif + +static int yy_init_globals ( void ); + +/* Accessor methods to globals. + These are made visible to non-reentrant scanners for convenience. */ + +int yylex_destroy ( void ); + +int yyget_debug ( void ); + +void yyset_debug ( int debug_flag ); + +YY_EXTRA_TYPE yyget_extra ( void ); + +void yyset_extra ( YY_EXTRA_TYPE user_defined ); + +FILE *yyget_in ( void ); + +void yyset_in ( FILE * _in_str ); + +FILE *yyget_out ( void ); + +void yyset_out ( FILE * _out_str ); + + int yyget_leng ( void ); + +char *yyget_text ( void ); + +int yyget_lineno ( void ); + +void yyset_lineno ( int _line_number ); + +/* Macros after this point can all be overridden by user definitions in + * section 1. + */ + +#ifndef YY_SKIP_YYWRAP +#ifdef __cplusplus +extern "C" int yywrap ( void ); +#else +extern int yywrap ( void ); +#endif +#endif + +#ifndef YY_NO_UNPUT + +#endif + +#ifndef yytext_ptr +static void yy_flex_strncpy ( char *, const char *, int ); +#endif + +#ifdef YY_NEED_STRLEN +static int yy_flex_strlen ( const char * ); +#endif + +#ifndef YY_NO_INPUT +#ifdef __cplusplus +static int yyinput ( void ); +#else +static int input ( void ); +#endif + +#endif + +/* Amount of stuff to slurp up with each read. */ +#ifndef YY_READ_BUF_SIZE +#ifdef __ia64__ +/* On IA-64, the buffer size is 16k, not 8k */ +#define YY_READ_BUF_SIZE 16384 +#else +#define YY_READ_BUF_SIZE 8192 +#endif /* __ia64__ */ +#endif + +/* Copy whatever the last rule matched to the standard output. */ +#ifndef ECHO +/* This used to be an fputs(), but since the string might contain NUL's, + * we now use fwrite(). + */ +#define ECHO do { if (fwrite( yytext, (size_t) yyleng, 1, yyout )) {} } while (0) +#endif + +/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL, + * is returned in "result". + */ +#ifndef YY_INPUT +#define YY_INPUT(buf,result,max_size) \ + if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \ + { \ + int c = '*'; \ + int n; \ + for ( n = 0; n < max_size && \ + (c = getc( yyin )) != EOF && c != '\n'; ++n ) \ + buf[n] = (char) c; \ + if ( c == '\n' ) \ + buf[n++] = (char) c; \ + if ( c == EOF && ferror( yyin ) ) \ + YY_FATAL_ERROR( "input in flex scanner failed" ); \ + result = n; \ + } \ + else \ + { \ + errno=0; \ + while ( (result = (int) fread(buf, 1, (yy_size_t) max_size, yyin)) == 0 && ferror(yyin)) \ + { \ + if( errno != EINTR) \ + { \ + YY_FATAL_ERROR( "input in flex scanner failed" ); \ + break; \ + } \ + errno=0; \ + clearerr(yyin); \ + } \ + }\ +\ + +#endif + +/* No semi-colon after return; correct usage is to write "yyterminate();" - + * we don't want an extra ';' after the "return" because that will cause + * some compilers to complain about unreachable statements. + */ +#ifndef yyterminate +#define yyterminate() return YY_NULL +#endif + +/* Number of entries by which start-condition stack grows. */ +#ifndef YY_START_STACK_INCR +#define YY_START_STACK_INCR 25 +#endif + +/* Report a fatal error. */ +#ifndef YY_FATAL_ERROR +#define YY_FATAL_ERROR(msg) yy_fatal_error( msg ) +#endif + +/* end tables serialization structures and prototypes */ + +/* Default declaration of generated scanner - a define so the user can + * easily add parameters. + */ +#ifndef YY_DECL +#define YY_DECL_IS_OURS 1 + +extern int yylex (void); + +#define YY_DECL int yylex (void) +#endif /* !YY_DECL */ + +/* Code executed at the beginning of each rule, after yytext and yyleng + * have been set up. + */ +#ifndef YY_USER_ACTION +#define YY_USER_ACTION +#endif + +/* Code executed at the end of each rule. */ +#ifndef YY_BREAK +#define YY_BREAK /*LINTED*/break; +#endif + +#define YY_RULE_SETUP \ + if ( yyleng > 0 ) \ + YY_CURRENT_BUFFER_LVALUE->yy_at_bol = \ + (yytext[yyleng - 1] == '\n'); \ + YY_USER_ACTION + +/** The main scanner function which does all the work. + */ +YY_DECL +{ + yy_state_type yy_current_state; + char *yy_cp, *yy_bp; + int yy_act; + + if ( !(yy_init) ) + { + (yy_init) = 1; + +#ifdef YY_USER_INIT + YY_USER_INIT; +#endif + + if ( ! (yy_start) ) + (yy_start) = 1; /* first start state */ + + if ( ! yyin ) + yyin = stdin; + + if ( ! yyout ) + yyout = stdout; + + if ( ! YY_CURRENT_BUFFER ) { + yyensure_buffer_stack (); + YY_CURRENT_BUFFER_LVALUE = + yy_create_buffer( yyin, YY_BUF_SIZE ); + } + + yy_load_buffer_state( ); + } + + { +#line 83 "bootscanner.l" + + +#line 1078 "bootscanner.c" + + while ( /*CONSTCOND*/1 ) /* loops until end-of-file is reached */ + { + yy_cp = (yy_c_buf_p); + + /* Support of yytext. */ + *yy_cp = (yy_hold_char); + + /* yy_bp points to the position in yy_ch_buf of the start of + * the current run. + */ + yy_bp = yy_cp; + + yy_current_state = (yy_start); + yy_current_state += YY_AT_BOL(); +yy_match: + do + { + YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)] ; + if ( yy_accept[yy_current_state] ) + { + (yy_last_accepting_state) = yy_current_state; + (yy_last_accepting_cpos) = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 128 ) + yy_c = yy_meta[yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c]; + ++yy_cp; + } + while ( yy_current_state != 127 ); + yy_cp = (yy_last_accepting_cpos); + yy_current_state = (yy_last_accepting_state); + +yy_find_action: + yy_act = yy_accept[yy_current_state]; + + YY_DO_BEFORE_ACTION; + +do_action: /* This label is used only to access EOF actions. */ + + switch ( yy_act ) + { /* beginning of action switch */ + case 0: /* must back up */ + /* undo the effects of YY_DO_BEFORE_ACTION */ + *yy_cp = (yy_hold_char); + yy_cp = (yy_last_accepting_cpos); + yy_current_state = (yy_last_accepting_state); + goto yy_find_action; + +case 1: +YY_RULE_SETUP +#line 85 "bootscanner.l" +{ yylval.kw = "open"; return OPEN; } + YY_BREAK +case 2: +YY_RULE_SETUP +#line 87 "bootscanner.l" +{ yylval.kw = "close"; return XCLOSE; } + YY_BREAK +case 3: +YY_RULE_SETUP +#line 89 "bootscanner.l" +{ yylval.kw = "create"; return XCREATE; } + YY_BREAK +case 4: +YY_RULE_SETUP +#line 91 "bootscanner.l" +{ yylval.kw = "OID"; return OBJ_ID; } + YY_BREAK +case 5: +YY_RULE_SETUP +#line 92 "bootscanner.l" +{ yylval.kw = "bootstrap"; return XBOOTSTRAP; } + YY_BREAK +case 6: +YY_RULE_SETUP +#line 93 "bootscanner.l" +{ yylval.kw = "shared_relation"; return XSHARED_RELATION; } + YY_BREAK +case 7: +YY_RULE_SETUP +#line 94 "bootscanner.l" +{ yylval.kw = "rowtype_oid"; return XROWTYPE_OID; } + YY_BREAK +case 8: +YY_RULE_SETUP +#line 96 "bootscanner.l" +{ yylval.kw = "insert"; return INSERT_TUPLE; } + YY_BREAK +case 9: +YY_RULE_SETUP +#line 98 "bootscanner.l" +{ return NULLVAL; } + YY_BREAK +case 10: +YY_RULE_SETUP +#line 100 "bootscanner.l" +{ return COMMA; } + YY_BREAK +case 11: +YY_RULE_SETUP +#line 101 "bootscanner.l" +{ return EQUALS; } + YY_BREAK +case 12: +YY_RULE_SETUP +#line 102 "bootscanner.l" +{ return LPAREN; } + YY_BREAK +case 13: +YY_RULE_SETUP +#line 103 "bootscanner.l" +{ return RPAREN; } + YY_BREAK +case 14: +/* rule 14 can match eol */ +YY_RULE_SETUP +#line 105 "bootscanner.l" +{ yyline++; } + YY_BREAK +case 15: +YY_RULE_SETUP +#line 106 "bootscanner.l" +; + YY_BREAK +case 16: +YY_RULE_SETUP +#line 108 "bootscanner.l" +; /* drop everything after "#" for comments */ + YY_BREAK +case 17: +YY_RULE_SETUP +#line 110 "bootscanner.l" +{ yylval.kw = "declare"; return XDECLARE; } + YY_BREAK +case 18: +YY_RULE_SETUP +#line 111 "bootscanner.l" +{ yylval.kw = "build"; return XBUILD; } + YY_BREAK +case 19: +YY_RULE_SETUP +#line 112 "bootscanner.l" +{ yylval.kw = "indices"; return INDICES; } + YY_BREAK +case 20: +YY_RULE_SETUP +#line 113 "bootscanner.l" +{ yylval.kw = "unique"; return UNIQUE; } + YY_BREAK +case 21: +YY_RULE_SETUP +#line 114 "bootscanner.l" +{ yylval.kw = "index"; return INDEX; } + YY_BREAK +case 22: +YY_RULE_SETUP +#line 115 "bootscanner.l" +{ yylval.kw = "on"; return ON; } + YY_BREAK +case 23: +YY_RULE_SETUP +#line 116 "bootscanner.l" +{ yylval.kw = "using"; return USING; } + YY_BREAK +case 24: +YY_RULE_SETUP +#line 117 "bootscanner.l" +{ yylval.kw = "toast"; return XTOAST; } + YY_BREAK +case 25: +YY_RULE_SETUP +#line 118 "bootscanner.l" +{ yylval.kw = "FORCE"; return XFORCE; } + YY_BREAK +case 26: +YY_RULE_SETUP +#line 119 "bootscanner.l" +{ yylval.kw = "NOT"; return XNOT; } + YY_BREAK +case 27: +YY_RULE_SETUP +#line 120 "bootscanner.l" +{ yylval.kw = "NULL"; return XNULL; } + YY_BREAK +case 28: +YY_RULE_SETUP +#line 122 "bootscanner.l" +{ + yylval.str = scanstr(yytext); + return ID; + } + YY_BREAK +case 29: +/* rule 29 can match eol */ +YY_RULE_SETUP +#line 126 "bootscanner.l" +{ + /* leading and trailing quotes are not passed to scanstr */ + yytext[strlen(yytext) - 1] = '\0'; + yylval.str = scanstr(yytext+1); + yytext[strlen(yytext)] = '"'; /* restore yytext */ + return ID; + } + YY_BREAK +case 30: +YY_RULE_SETUP +#line 134 "bootscanner.l" +{ + elog(ERROR, "syntax error at line %d: unexpected character \"%s\"", yyline, yytext); + } + YY_BREAK +case 31: +YY_RULE_SETUP +#line 138 "bootscanner.l" +YY_FATAL_ERROR( "flex scanner jammed" ); + YY_BREAK +#line 1300 "bootscanner.c" +case YY_STATE_EOF(INITIAL): + yyterminate(); + + case YY_END_OF_BUFFER: + { + /* Amount of text matched not including the EOB char. */ + int yy_amount_of_matched_text = (int) (yy_cp - (yytext_ptr)) - 1; + + /* Undo the effects of YY_DO_BEFORE_ACTION. */ + *yy_cp = (yy_hold_char); + YY_RESTORE_YY_MORE_OFFSET + + if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW ) + { + /* We're scanning a new file or input source. It's + * possible that this happened because the user + * just pointed yyin at a new source and called + * yylex(). If so, then we have to assure + * consistency between YY_CURRENT_BUFFER and our + * globals. Here is the right place to do so, because + * this is the first action (other than possibly a + * back-up) that will match for the new input source. + */ + (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; + YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin; + YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL; + } + + /* Note that here we test for yy_c_buf_p "<=" to the position + * of the first EOB in the buffer, since yy_c_buf_p will + * already have been incremented past the NUL character + * (since all states make transitions on EOB to the + * end-of-buffer state). Contrast this with the test + * in input(). + */ + if ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] ) + { /* This was really a NUL. */ + yy_state_type yy_next_state; + + (yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text; + + yy_current_state = yy_get_previous_state( ); + + /* Okay, we're now positioned to make the NUL + * transition. We couldn't have + * yy_get_previous_state() go ahead and do it + * for us because it doesn't know how to deal + * with the possibility of jamming (and we don't + * want to build jamming into it because then it + * will run more slowly). + */ + + yy_next_state = yy_try_NUL_trans( yy_current_state ); + + yy_bp = (yytext_ptr) + YY_MORE_ADJ; + + if ( yy_next_state ) + { + /* Consume the NUL. */ + yy_cp = ++(yy_c_buf_p); + yy_current_state = yy_next_state; + goto yy_match; + } + + else + { + yy_cp = (yy_last_accepting_cpos); + yy_current_state = (yy_last_accepting_state); + goto yy_find_action; + } + } + + else switch ( yy_get_next_buffer( ) ) + { + case EOB_ACT_END_OF_FILE: + { + (yy_did_buffer_switch_on_eof) = 0; + + if ( yywrap( ) ) + { + /* Note: because we've taken care in + * yy_get_next_buffer() to have set up + * yytext, we can now set up + * yy_c_buf_p so that if some total + * hoser (like flex itself) wants to + * call the scanner after we return the + * YY_NULL, it'll still work - another + * YY_NULL will get returned. + */ + (yy_c_buf_p) = (yytext_ptr) + YY_MORE_ADJ; + + yy_act = YY_STATE_EOF(YY_START); + goto do_action; + } + + else + { + if ( ! (yy_did_buffer_switch_on_eof) ) + YY_NEW_FILE; + } + break; + } + + case EOB_ACT_CONTINUE_SCAN: + (yy_c_buf_p) = + (yytext_ptr) + yy_amount_of_matched_text; + + yy_current_state = yy_get_previous_state( ); + + yy_cp = (yy_c_buf_p); + yy_bp = (yytext_ptr) + YY_MORE_ADJ; + goto yy_match; + + case EOB_ACT_LAST_MATCH: + (yy_c_buf_p) = + &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)]; + + yy_current_state = yy_get_previous_state( ); + + yy_cp = (yy_c_buf_p); + yy_bp = (yytext_ptr) + YY_MORE_ADJ; + goto yy_find_action; + } + break; + } + + default: + YY_FATAL_ERROR( + "fatal flex scanner internal error--no action found" ); + } /* end of action switch */ + } /* end of scanning one token */ + } /* end of user's declarations */ +} /* end of yylex */ + +/* yy_get_next_buffer - try to read in a new buffer + * + * Returns a code representing an action: + * EOB_ACT_LAST_MATCH - + * EOB_ACT_CONTINUE_SCAN - continue scanning from current position + * EOB_ACT_END_OF_FILE - end of file + */ +static int yy_get_next_buffer (void) +{ + char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf; + char *source = (yytext_ptr); + int number_to_move, i; + int ret_val; + + if ( (yy_c_buf_p) > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] ) + YY_FATAL_ERROR( + "fatal flex scanner internal error--end of buffer missed" ); + + if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 ) + { /* Don't try to fill the buffer, so this is an EOF. */ + if ( (yy_c_buf_p) - (yytext_ptr) - YY_MORE_ADJ == 1 ) + { + /* We matched a single character, the EOB, so + * treat this as a final EOF. + */ + return EOB_ACT_END_OF_FILE; + } + + else + { + /* We matched some text prior to the EOB, first + * process it. + */ + return EOB_ACT_LAST_MATCH; + } + } + + /* Try to read more data. */ + + /* First move last chars to start of buffer. */ + number_to_move = (int) ((yy_c_buf_p) - (yytext_ptr) - 1); + + for ( i = 0; i < number_to_move; ++i ) + *(dest++) = *(source++); + + if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING ) + /* don't do the read, it's not guaranteed to return an EOF, + * just force an EOF + */ + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars) = 0; + + else + { + int num_to_read = + YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1; + + while ( num_to_read <= 0 ) + { /* Not enough room in the buffer - grow it. */ + + /* just a shorter name for the current buffer */ + YY_BUFFER_STATE b = YY_CURRENT_BUFFER_LVALUE; + + int yy_c_buf_p_offset = + (int) ((yy_c_buf_p) - b->yy_ch_buf); + + if ( b->yy_is_our_buffer ) + { + int new_size = b->yy_buf_size * 2; + + if ( new_size <= 0 ) + b->yy_buf_size += b->yy_buf_size / 8; + else + b->yy_buf_size *= 2; + + b->yy_ch_buf = (char *) + /* Include room in for 2 EOB chars. */ + yyrealloc( (void *) b->yy_ch_buf, + (yy_size_t) (b->yy_buf_size + 2) ); + } + else + /* Can't grow it, we don't own it. */ + b->yy_ch_buf = NULL; + + if ( ! b->yy_ch_buf ) + YY_FATAL_ERROR( + "fatal error - scanner input buffer overflow" ); + + (yy_c_buf_p) = &b->yy_ch_buf[yy_c_buf_p_offset]; + + num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size - + number_to_move - 1; + + } + + if ( num_to_read > YY_READ_BUF_SIZE ) + num_to_read = YY_READ_BUF_SIZE; + + /* Read in more data. */ + YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]), + (yy_n_chars), num_to_read ); + + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); + } + + if ( (yy_n_chars) == 0 ) + { + if ( number_to_move == YY_MORE_ADJ ) + { + ret_val = EOB_ACT_END_OF_FILE; + yyrestart( yyin ); + } + + else + { + ret_val = EOB_ACT_LAST_MATCH; + YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = + YY_BUFFER_EOF_PENDING; + } + } + + else + ret_val = EOB_ACT_CONTINUE_SCAN; + + if (((yy_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) { + /* Extend the array by 50%, plus the number we really need. */ + int new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1); + YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) yyrealloc( + (void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf, (yy_size_t) new_size ); + if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) + YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" ); + /* "- 2" to take care of EOB's */ + YY_CURRENT_BUFFER_LVALUE->yy_buf_size = (int) (new_size - 2); + } + + (yy_n_chars) += number_to_move; + YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR; + YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR; + + (yytext_ptr) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0]; + + return ret_val; +} + +/* yy_get_previous_state - get the state just before the EOB char was reached */ + + static yy_state_type yy_get_previous_state (void) +{ + yy_state_type yy_current_state; + char *yy_cp; + + yy_current_state = (yy_start); + yy_current_state += YY_AT_BOL(); + + for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp ) + { + YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1); + if ( yy_accept[yy_current_state] ) + { + (yy_last_accepting_state) = yy_current_state; + (yy_last_accepting_cpos) = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 128 ) + yy_c = yy_meta[yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c]; + } + + return yy_current_state; +} + +/* yy_try_NUL_trans - try to make a transition on the NUL character + * + * synopsis + * next_state = yy_try_NUL_trans( current_state ); + */ + static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state ) +{ + int yy_is_jam; + char *yy_cp = (yy_c_buf_p); + + YY_CHAR yy_c = 1; + if ( yy_accept[yy_current_state] ) + { + (yy_last_accepting_state) = yy_current_state; + (yy_last_accepting_cpos) = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 128 ) + yy_c = yy_meta[yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c]; + yy_is_jam = (yy_current_state == 127); + + return yy_is_jam ? 0 : yy_current_state; +} + +#ifndef YY_NO_UNPUT + +#endif + +#ifndef YY_NO_INPUT +#ifdef __cplusplus + static int yyinput (void) +#else + static int input (void) +#endif + +{ + int c; + + *(yy_c_buf_p) = (yy_hold_char); + + if ( *(yy_c_buf_p) == YY_END_OF_BUFFER_CHAR ) + { + /* yy_c_buf_p now points to the character we want to return. + * If this occurs *before* the EOB characters, then it's a + * valid NUL; if not, then we've hit the end of the buffer. + */ + if ( (yy_c_buf_p) < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] ) + /* This was really a NUL. */ + *(yy_c_buf_p) = '\0'; + + else + { /* need more input */ + int offset = (int) ((yy_c_buf_p) - (yytext_ptr)); + ++(yy_c_buf_p); + + switch ( yy_get_next_buffer( ) ) + { + case EOB_ACT_LAST_MATCH: + /* This happens because yy_g_n_b() + * sees that we've accumulated a + * token and flags that we need to + * try matching the token before + * proceeding. But for input(), + * there's no matching to consider. + * So convert the EOB_ACT_LAST_MATCH + * to EOB_ACT_END_OF_FILE. + */ + + /* Reset buffer status. */ + yyrestart( yyin ); + + /*FALLTHROUGH*/ + + case EOB_ACT_END_OF_FILE: + { + if ( yywrap( ) ) + return 0; + + if ( ! (yy_did_buffer_switch_on_eof) ) + YY_NEW_FILE; +#ifdef __cplusplus + return yyinput(); +#else + return input(); +#endif + } + + case EOB_ACT_CONTINUE_SCAN: + (yy_c_buf_p) = (yytext_ptr) + offset; + break; + } + } + } + + c = *(unsigned char *) (yy_c_buf_p); /* cast for 8-bit char's */ + *(yy_c_buf_p) = '\0'; /* preserve yytext */ + (yy_hold_char) = *++(yy_c_buf_p); + + YY_CURRENT_BUFFER_LVALUE->yy_at_bol = (c == '\n'); + + return c; +} +#endif /* ifndef YY_NO_INPUT */ + +/** Immediately switch to a different input stream. + * @param input_file A readable stream. + * + * @note This function does not reset the start condition to @c INITIAL . + */ + void yyrestart (FILE * input_file ) +{ + + if ( ! YY_CURRENT_BUFFER ){ + yyensure_buffer_stack (); + YY_CURRENT_BUFFER_LVALUE = + yy_create_buffer( yyin, YY_BUF_SIZE ); + } + + yy_init_buffer( YY_CURRENT_BUFFER, input_file ); + yy_load_buffer_state( ); +} + +/** Switch to a different input buffer. + * @param new_buffer The new input buffer. + * + */ + void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ) +{ + + /* TODO. We should be able to replace this entire function body + * with + * yypop_buffer_state(); + * yypush_buffer_state(new_buffer); + */ + yyensure_buffer_stack (); + if ( YY_CURRENT_BUFFER == new_buffer ) + return; + + if ( YY_CURRENT_BUFFER ) + { + /* Flush out information for old buffer. */ + *(yy_c_buf_p) = (yy_hold_char); + YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p); + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); + } + + YY_CURRENT_BUFFER_LVALUE = new_buffer; + yy_load_buffer_state( ); + + /* We don't actually know whether we did this switch during + * EOF (yywrap()) processing, but the only time this flag + * is looked at is after yywrap() is called, so it's safe + * to go ahead and always set it. + */ + (yy_did_buffer_switch_on_eof) = 1; +} + +static void yy_load_buffer_state (void) +{ + (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; + (yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos; + yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file; + (yy_hold_char) = *(yy_c_buf_p); +} + +/** Allocate and initialize an input buffer state. + * @param file A readable stream. + * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE. + * + * @return the allocated buffer state. + */ + YY_BUFFER_STATE yy_create_buffer (FILE * file, int size ) +{ + YY_BUFFER_STATE b; + + b = (YY_BUFFER_STATE) yyalloc( sizeof( struct yy_buffer_state ) ); + if ( ! b ) + YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); + + b->yy_buf_size = size; + + /* yy_ch_buf has to be 2 characters longer than the size given because + * we need to put in 2 end-of-buffer characters. + */ + b->yy_ch_buf = (char *) yyalloc( (yy_size_t) (b->yy_buf_size + 2) ); + if ( ! b->yy_ch_buf ) + YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); + + b->yy_is_our_buffer = 1; + + yy_init_buffer( b, file ); + + return b; +} + +/** Destroy the buffer. + * @param b a buffer created with yy_create_buffer() + * + */ + void yy_delete_buffer (YY_BUFFER_STATE b ) +{ + + if ( ! b ) + return; + + if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */ + YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0; + + if ( b->yy_is_our_buffer ) + yyfree( (void *) b->yy_ch_buf ); + + yyfree( (void *) b ); +} + +/* Initializes or reinitializes a buffer. + * This function is sometimes called more than once on the same buffer, + * such as during a yyrestart() or at EOF. + */ + static void yy_init_buffer (YY_BUFFER_STATE b, FILE * file ) + +{ + int oerrno = errno; + + yy_flush_buffer( b ); + + b->yy_input_file = file; + b->yy_fill_buffer = 1; + + /* If b is the current buffer, then yy_init_buffer was _probably_ + * called from yyrestart() or through yy_get_next_buffer. + * In that case, we don't want to reset the lineno or column. + */ + if (b != YY_CURRENT_BUFFER){ + b->yy_bs_lineno = 1; + b->yy_bs_column = 0; + } + + b->yy_is_interactive = 0; + + errno = oerrno; +} + +/** Discard all buffered characters. On the next scan, YY_INPUT will be called. + * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER. + * + */ + void yy_flush_buffer (YY_BUFFER_STATE b ) +{ + if ( ! b ) + return; + + b->yy_n_chars = 0; + + /* We always need two end-of-buffer characters. The first causes + * a transition to the end-of-buffer state. The second causes + * a jam in that state. + */ + b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR; + b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR; + + b->yy_buf_pos = &b->yy_ch_buf[0]; + + b->yy_at_bol = 1; + b->yy_buffer_status = YY_BUFFER_NEW; + + if ( b == YY_CURRENT_BUFFER ) + yy_load_buffer_state( ); +} + +/** Pushes the new state onto the stack. The new state becomes + * the current state. This function will allocate the stack + * if necessary. + * @param new_buffer The new state. + * + */ +void yypush_buffer_state (YY_BUFFER_STATE new_buffer ) +{ + if (new_buffer == NULL) + return; + + yyensure_buffer_stack(); + + /* This block is copied from yy_switch_to_buffer. */ + if ( YY_CURRENT_BUFFER ) + { + /* Flush out information for old buffer. */ + *(yy_c_buf_p) = (yy_hold_char); + YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p); + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); + } + + /* Only push if top exists. Otherwise, replace top. */ + if (YY_CURRENT_BUFFER) + (yy_buffer_stack_top)++; + YY_CURRENT_BUFFER_LVALUE = new_buffer; + + /* copied from yy_switch_to_buffer. */ + yy_load_buffer_state( ); + (yy_did_buffer_switch_on_eof) = 1; +} + +/** Removes and deletes the top of the stack, if present. + * The next element becomes the new top. + * + */ +void yypop_buffer_state (void) +{ + if (!YY_CURRENT_BUFFER) + return; + + yy_delete_buffer(YY_CURRENT_BUFFER ); + YY_CURRENT_BUFFER_LVALUE = NULL; + if ((yy_buffer_stack_top) > 0) + --(yy_buffer_stack_top); + + if (YY_CURRENT_BUFFER) { + yy_load_buffer_state( ); + (yy_did_buffer_switch_on_eof) = 1; + } +} + +/* Allocates the stack if it does not exist. + * Guarantees space for at least one push. + */ +static void yyensure_buffer_stack (void) +{ + yy_size_t num_to_alloc; + + if (!(yy_buffer_stack)) { + + /* First allocation is just for 2 elements, since we don't know if this + * scanner will even need a stack. We use 2 instead of 1 to avoid an + * immediate realloc on the next call. + */ + num_to_alloc = 1; /* After all that talk, this was set to 1 anyways... */ + (yy_buffer_stack) = (struct yy_buffer_state**)yyalloc + (num_to_alloc * sizeof(struct yy_buffer_state*) + ); + if ( ! (yy_buffer_stack) ) + YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" ); + + memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*)); + + (yy_buffer_stack_max) = num_to_alloc; + (yy_buffer_stack_top) = 0; + return; + } + + if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){ + + /* Increase the buffer to prepare for a possible push. */ + yy_size_t grow_size = 8 /* arbitrary grow size */; + + num_to_alloc = (yy_buffer_stack_max) + grow_size; + (yy_buffer_stack) = (struct yy_buffer_state**)yyrealloc + ((yy_buffer_stack), + num_to_alloc * sizeof(struct yy_buffer_state*) + ); + if ( ! (yy_buffer_stack) ) + YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" ); + + /* zero only the new slots.*/ + memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*)); + (yy_buffer_stack_max) = num_to_alloc; + } +} + +/** Setup the input buffer state to scan directly from a user-specified character buffer. + * @param base the character buffer + * @param size the size in bytes of the character buffer + * + * @return the newly allocated buffer state object. + */ +YY_BUFFER_STATE yy_scan_buffer (char * base, yy_size_t size ) +{ + YY_BUFFER_STATE b; + + if ( size < 2 || + base[size-2] != YY_END_OF_BUFFER_CHAR || + base[size-1] != YY_END_OF_BUFFER_CHAR ) + /* They forgot to leave room for the EOB's. */ + return NULL; + + b = (YY_BUFFER_STATE) yyalloc( sizeof( struct yy_buffer_state ) ); + if ( ! b ) + YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" ); + + b->yy_buf_size = (int) (size - 2); /* "- 2" to take care of EOB's */ + b->yy_buf_pos = b->yy_ch_buf = base; + b->yy_is_our_buffer = 0; + b->yy_input_file = NULL; + b->yy_n_chars = b->yy_buf_size; + b->yy_is_interactive = 0; + b->yy_at_bol = 1; + b->yy_fill_buffer = 0; + b->yy_buffer_status = YY_BUFFER_NEW; + + yy_switch_to_buffer( b ); + + return b; +} + +/** Setup the input buffer state to scan a string. The next call to yylex() will + * scan from a @e copy of @a str. + * @param yystr a NUL-terminated string to scan + * + * @return the newly allocated buffer state object. + * @note If you want to scan bytes that may contain NUL values, then use + * yy_scan_bytes() instead. + */ +YY_BUFFER_STATE yy_scan_string (const char * yystr ) +{ + + return yy_scan_bytes( yystr, (int) strlen(yystr) ); +} + +/** Setup the input buffer state to scan the given bytes. The next call to yylex() will + * scan from a @e copy of @a bytes. + * @param yybytes the byte buffer to scan + * @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes. + * + * @return the newly allocated buffer state object. + */ +YY_BUFFER_STATE yy_scan_bytes (const char * yybytes, int _yybytes_len ) +{ + YY_BUFFER_STATE b; + char *buf; + yy_size_t n; + int i; + + /* Get memory for full buffer, including space for trailing EOB's. */ + n = (yy_size_t) (_yybytes_len + 2); + buf = (char *) yyalloc( n ); + if ( ! buf ) + YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" ); + + for ( i = 0; i < _yybytes_len; ++i ) + buf[i] = yybytes[i]; + + buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR; + + b = yy_scan_buffer( buf, n ); + if ( ! b ) + YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" ); + + /* It's okay to grow etc. this buffer, and we should throw it + * away when we're done. + */ + b->yy_is_our_buffer = 1; + + return b; +} + +#ifndef YY_EXIT_FAILURE +#define YY_EXIT_FAILURE 2 +#endif + +static void yynoreturn yy_fatal_error (const char* msg ) +{ + fprintf( stderr, "%s\n", msg ); + exit( YY_EXIT_FAILURE ); +} + +/* Redefine yyless() so it works in section 3 code. */ + +#undef yyless +#define yyless(n) \ + do \ + { \ + /* Undo effects of setting up yytext. */ \ + int yyless_macro_arg = (n); \ + YY_LESS_LINENO(yyless_macro_arg);\ + yytext[yyleng] = (yy_hold_char); \ + (yy_c_buf_p) = yytext + yyless_macro_arg; \ + (yy_hold_char) = *(yy_c_buf_p); \ + *(yy_c_buf_p) = '\0'; \ + yyleng = yyless_macro_arg; \ + } \ + while ( 0 ) + +/* Accessor methods (get/set functions) to struct members. */ + +/** Get the current line number. + * + */ +int yyget_lineno (void) +{ + + return yylineno; +} + +/** Get the input stream. + * + */ +FILE *yyget_in (void) +{ + return yyin; +} + +/** Get the output stream. + * + */ +FILE *yyget_out (void) +{ + return yyout; +} + +/** Get the length of the current token. + * + */ +int yyget_leng (void) +{ + return yyleng; +} + +/** Get the current token. + * + */ + +char *yyget_text (void) +{ + return yytext; +} + +/** Set the current line number. + * @param _line_number line number + * + */ +void yyset_lineno (int _line_number ) +{ + + yylineno = _line_number; +} + +/** Set the input stream. This does not discard the current + * input buffer. + * @param _in_str A readable stream. + * + * @see yy_switch_to_buffer + */ +void yyset_in (FILE * _in_str ) +{ + yyin = _in_str ; +} + +void yyset_out (FILE * _out_str ) +{ + yyout = _out_str ; +} + +int yyget_debug (void) +{ + return yy_flex_debug; +} + +void yyset_debug (int _bdebug ) +{ + yy_flex_debug = _bdebug ; +} + +static int yy_init_globals (void) +{ + /* Initialization is the same as for the non-reentrant scanner. + * This function is called from yylex_destroy(), so don't allocate here. + */ + + (yy_buffer_stack) = NULL; + (yy_buffer_stack_top) = 0; + (yy_buffer_stack_max) = 0; + (yy_c_buf_p) = NULL; + (yy_init) = 0; + (yy_start) = 0; + +/* Defined in main.c */ +#ifdef YY_STDINIT + yyin = stdin; + yyout = stdout; +#else + yyin = NULL; + yyout = NULL; +#endif + + /* For future reference: Set errno on error, since we are called by + * yylex_init() + */ + return 0; +} + +/* yylex_destroy is for both reentrant and non-reentrant scanners. */ +int yylex_destroy (void) +{ + + /* Pop the buffer stack, destroying each element. */ + while(YY_CURRENT_BUFFER){ + yy_delete_buffer( YY_CURRENT_BUFFER ); + YY_CURRENT_BUFFER_LVALUE = NULL; + yypop_buffer_state(); + } + + /* Destroy the stack itself. */ + yyfree((yy_buffer_stack) ); + (yy_buffer_stack) = NULL; + + /* Reset the globals. This is important in a non-reentrant scanner so the next time + * yylex() is called, initialization will occur. */ + yy_init_globals( ); + + return 0; +} + +/* + * Internal utility routines. + */ + +#ifndef yytext_ptr +static void yy_flex_strncpy (char* s1, const char * s2, int n ) +{ + + int i; + for ( i = 0; i < n; ++i ) + s1[i] = s2[i]; +} +#endif + +#ifdef YY_NEED_STRLEN +static int yy_flex_strlen (const char * s ) +{ + int n; + for ( n = 0; s[n]; ++n ) + ; + + return n; +} +#endif + +void *yyalloc (yy_size_t size ) +{ + return malloc(size); +} + +void *yyrealloc (void * ptr, yy_size_t size ) +{ + + /* The cast to (char *) in the following accommodates both + * implementations that use char* generic pointers, and those + * that use void* generic pointers. It works with the latter + * because both ANSI C and C++ allow castless assignment from + * any pointer type to void*, and deal with argument conversions + * as though doing an assignment. + */ + return realloc(ptr, size); +} + +void yyfree (void * ptr ) +{ + free( (char *) ptr ); /* see yyrealloc() for (char *) cast */ +} + +#define YYTABLES_NAME "yytables" + +#line 138 "bootscanner.l" + + +/* LCOV_EXCL_STOP */ + +void +yyerror(const char *message) +{ + elog(ERROR, "%s at line %d", message, yyline); +} + diff --git a/src/backend/bootstrap/bootscanner.l b/src/backend/bootstrap/bootscanner.l new file mode 100644 index 0000000..1048e70 --- /dev/null +++ b/src/backend/bootstrap/bootscanner.l @@ -0,0 +1,146 @@ +%{ +/*------------------------------------------------------------------------- + * + * bootscanner.l + * a lexical scanner for the bootstrap parser + * + * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group + * Portions Copyright (c) 1994, Regents of the University of California + * + * + * IDENTIFICATION + * src/backend/bootstrap/bootscanner.l + * + *------------------------------------------------------------------------- + */ +#include "postgres.h" + +#include "access/attnum.h" +#include "access/htup.h" +#include "access/itup.h" +#include "access/tupdesc.h" +#include "bootstrap/bootstrap.h" +#include "catalog/pg_am.h" +#include "catalog/pg_attribute.h" +#include "catalog/pg_class.h" +#include "nodes/nodes.h" +#include "nodes/parsenodes.h" +#include "nodes/pg_list.h" +#include "nodes/primnodes.h" +#include "parser/scansup.h" +#include "rewrite/prs2lock.h" +#include "storage/block.h" +#include "storage/fd.h" +#include "storage/itemptr.h" +#include "storage/off.h" +#include "utils/rel.h" + +/* Not needed now that this file is compiled as part of bootparse. */ +/* #include "bootparse.h" */ + +/* LCOV_EXCL_START */ + +/* Avoid exit() on fatal scanner errors (a bit ugly -- see yy_fatal_error) */ +#undef fprintf +#define fprintf(file, fmt, msg) fprintf_to_ereport(fmt, msg) + +static void +fprintf_to_ereport(const char *fmt, const char *msg) +{ + ereport(ERROR, (errmsg_internal("%s", msg))); +} + + +static int yyline = 1; /* line number for error reporting */ + +%} + +%option 8bit +%option never-interactive +%option nodefault +%option noinput +%option nounput +%option noyywrap +%option warn +%option prefix="boot_yy" + + +id [-A-Za-z0-9_]+ +sid \"([^\"])*\" + +/* + * Keyword tokens return the keyword text (as a constant string) in yylval.kw, + * just in case that's needed because we want to treat the keyword as an + * unreserved identifier. Note that _null_ is not treated as a keyword + * for this purpose; it's the one "reserved word" in the bootstrap syntax. + * + * Notice that all the keywords are case-sensitive, and for historical + * reasons some must be upper case. + * + * String tokens return a palloc'd string in yylval.str. + */ + +%% + +open { yylval.kw = "open"; return OPEN; } + +close { yylval.kw = "close"; return XCLOSE; } + +create { yylval.kw = "create"; return XCREATE; } + +OID { yylval.kw = "OID"; return OBJ_ID; } +bootstrap { yylval.kw = "bootstrap"; return XBOOTSTRAP; } +shared_relation { yylval.kw = "shared_relation"; return XSHARED_RELATION; } +rowtype_oid { yylval.kw = "rowtype_oid"; return XROWTYPE_OID; } + +insert { yylval.kw = "insert"; return INSERT_TUPLE; } + +_null_ { return NULLVAL; } + +"," { return COMMA; } +"=" { return EQUALS; } +"(" { return LPAREN; } +")" { return RPAREN; } + +[\n] { yyline++; } +[\r\t ] ; + +^\#[^\n]* ; /* drop everything after "#" for comments */ + +declare { yylval.kw = "declare"; return XDECLARE; } +build { yylval.kw = "build"; return XBUILD; } +indices { yylval.kw = "indices"; return INDICES; } +unique { yylval.kw = "unique"; return UNIQUE; } +index { yylval.kw = "index"; return INDEX; } +on { yylval.kw = "on"; return ON; } +using { yylval.kw = "using"; return USING; } +toast { yylval.kw = "toast"; return XTOAST; } +FORCE { yylval.kw = "FORCE"; return XFORCE; } +NOT { yylval.kw = "NOT"; return XNOT; } +NULL { yylval.kw = "NULL"; return XNULL; } + +{id} { + yylval.str = scanstr(yytext); + return ID; + } +{sid} { + /* leading and trailing quotes are not passed to scanstr */ + yytext[strlen(yytext) - 1] = '\0'; + yylval.str = scanstr(yytext+1); + yytext[strlen(yytext)] = '"'; /* restore yytext */ + return ID; + } + +. { + elog(ERROR, "syntax error at line %d: unexpected character \"%s\"", yyline, yytext); + } + +%% + +/* LCOV_EXCL_STOP */ + +void +yyerror(const char *message) +{ + elog(ERROR, "%s at line %d", message, yyline); +} diff --git a/src/backend/bootstrap/bootstrap.c b/src/backend/bootstrap/bootstrap.c new file mode 100644 index 0000000..5480a02 --- /dev/null +++ b/src/backend/bootstrap/bootstrap.c @@ -0,0 +1,1135 @@ +/*------------------------------------------------------------------------- + * + * bootstrap.c + * routines to support running postgres in 'bootstrap' mode + * bootstrap mode is used to create the initial template database + * + * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group + * Portions Copyright (c) 1994, Regents of the University of California + * + * IDENTIFICATION + * src/backend/bootstrap/bootstrap.c + * + *------------------------------------------------------------------------- + */ +#include "postgres.h" + +#include +#include + +#include "access/genam.h" +#include "access/heapam.h" +#include "access/htup_details.h" +#include "access/tableam.h" +#include "access/xact.h" +#include "access/xlog_internal.h" +#include "bootstrap/bootstrap.h" +#include "catalog/index.h" +#include "catalog/pg_collation.h" +#include "catalog/pg_type.h" +#include "common/link-canary.h" +#include "libpq/pqsignal.h" +#include "miscadmin.h" +#include "nodes/makefuncs.h" +#include "pg_getopt.h" +#include "pgstat.h" +#include "postmaster/bgwriter.h" +#include "postmaster/startup.h" +#include "postmaster/walwriter.h" +#include "replication/walreceiver.h" +#include "storage/bufmgr.h" +#include "storage/bufpage.h" +#include "storage/condition_variable.h" +#include "storage/ipc.h" +#include "storage/proc.h" +#include "tcop/tcopprot.h" +#include "utils/builtins.h" +#include "utils/fmgroids.h" +#include "utils/memutils.h" +#include "utils/ps_status.h" +#include "utils/rel.h" +#include "utils/relmapper.h" + +uint32 bootstrap_data_checksum_version = 0; /* No checksum */ + + +#define ALLOC(t, c) \ + ((t *) MemoryContextAllocZero(TopMemoryContext, (unsigned)(c) * sizeof(t))) + +static void CheckerModeMain(void); +static void BootstrapModeMain(void); +static void bootstrap_signals(void); +static void ShutdownAuxiliaryProcess(int code, Datum arg); +static Form_pg_attribute AllocateAttribute(void); +static Oid gettype(char *type); +static void cleanup(void); + +/* ---------------- + * global variables + * ---------------- + */ + +AuxProcType MyAuxProcType = NotAnAuxProcess; /* declared in miscadmin.h */ + +Relation boot_reldesc; /* current relation descriptor */ + +Form_pg_attribute attrtypes[MAXATTR]; /* points to attribute info */ +int numattr; /* number of attributes for cur. rel */ + + +/* + * Basic information associated with each type. This is used before + * pg_type is filled, so it has to cover the datatypes used as column types + * in the core "bootstrapped" catalogs. + * + * XXX several of these input/output functions do catalog scans + * (e.g., F_REGPROCIN scans pg_proc). this obviously creates some + * order dependencies in the catalog creation process. + */ +struct typinfo +{ + char name[NAMEDATALEN]; + Oid oid; + Oid elem; + int16 len; + bool byval; + char align; + char storage; + Oid collation; + Oid inproc; + Oid outproc; +}; + +static const struct typinfo TypInfo[] = { + {"bool", BOOLOID, 0, 1, true, TYPALIGN_CHAR, TYPSTORAGE_PLAIN, InvalidOid, + F_BOOLIN, F_BOOLOUT}, + {"bytea", BYTEAOID, 0, -1, false, TYPALIGN_INT, TYPSTORAGE_EXTENDED, InvalidOid, + F_BYTEAIN, F_BYTEAOUT}, + {"char", CHAROID, 0, 1, true, TYPALIGN_CHAR, TYPSTORAGE_PLAIN, InvalidOid, + F_CHARIN, F_CHAROUT}, + {"int2", INT2OID, 0, 2, true, TYPALIGN_SHORT, TYPSTORAGE_PLAIN, InvalidOid, + F_INT2IN, F_INT2OUT}, + {"int4", INT4OID, 0, 4, true, TYPALIGN_INT, TYPSTORAGE_PLAIN, InvalidOid, + F_INT4IN, F_INT4OUT}, + {"float4", FLOAT4OID, 0, 4, true, TYPALIGN_INT, TYPSTORAGE_PLAIN, InvalidOid, + F_FLOAT4IN, F_FLOAT4OUT}, + {"name", NAMEOID, CHAROID, NAMEDATALEN, false, TYPALIGN_CHAR, TYPSTORAGE_PLAIN, C_COLLATION_OID, + F_NAMEIN, F_NAMEOUT}, + {"regclass", REGCLASSOID, 0, 4, true, TYPALIGN_INT, TYPSTORAGE_PLAIN, InvalidOid, + F_REGCLASSIN, F_REGCLASSOUT}, + {"regproc", REGPROCOID, 0, 4, true, TYPALIGN_INT, TYPSTORAGE_PLAIN, InvalidOid, + F_REGPROCIN, F_REGPROCOUT}, + {"regtype", REGTYPEOID, 0, 4, true, TYPALIGN_INT, TYPSTORAGE_PLAIN, InvalidOid, + F_REGTYPEIN, F_REGTYPEOUT}, + {"regrole", REGROLEOID, 0, 4, true, TYPALIGN_INT, TYPSTORAGE_PLAIN, InvalidOid, + F_REGROLEIN, F_REGROLEOUT}, + {"regnamespace", REGNAMESPACEOID, 0, 4, true, TYPALIGN_INT, TYPSTORAGE_PLAIN, InvalidOid, + F_REGNAMESPACEIN, F_REGNAMESPACEOUT}, + {"text", TEXTOID, 0, -1, false, TYPALIGN_INT, TYPSTORAGE_EXTENDED, DEFAULT_COLLATION_OID, + F_TEXTIN, F_TEXTOUT}, + {"oid", OIDOID, 0, 4, true, TYPALIGN_INT, TYPSTORAGE_PLAIN, InvalidOid, + F_OIDIN, F_OIDOUT}, + {"tid", TIDOID, 0, 6, false, TYPALIGN_SHORT, TYPSTORAGE_PLAIN, InvalidOid, + F_TIDIN, F_TIDOUT}, + {"xid", XIDOID, 0, 4, true, TYPALIGN_INT, TYPSTORAGE_PLAIN, InvalidOid, + F_XIDIN, F_XIDOUT}, + {"cid", CIDOID, 0, 4, true, TYPALIGN_INT, TYPSTORAGE_PLAIN, InvalidOid, + F_CIDIN, F_CIDOUT}, + {"pg_node_tree", PGNODETREEOID, 0, -1, false, TYPALIGN_INT, TYPSTORAGE_EXTENDED, DEFAULT_COLLATION_OID, + F_PG_NODE_TREE_IN, F_PG_NODE_TREE_OUT}, + {"int2vector", INT2VECTOROID, INT2OID, -1, false, TYPALIGN_INT, TYPSTORAGE_PLAIN, InvalidOid, + F_INT2VECTORIN, F_INT2VECTOROUT}, + {"oidvector", OIDVECTOROID, OIDOID, -1, false, TYPALIGN_INT, TYPSTORAGE_PLAIN, InvalidOid, + F_OIDVECTORIN, F_OIDVECTOROUT}, + {"_int4", INT4ARRAYOID, INT4OID, -1, false, TYPALIGN_INT, TYPSTORAGE_EXTENDED, InvalidOid, + F_ARRAY_IN, F_ARRAY_OUT}, + {"_text", 1009, TEXTOID, -1, false, TYPALIGN_INT, TYPSTORAGE_EXTENDED, DEFAULT_COLLATION_OID, + F_ARRAY_IN, F_ARRAY_OUT}, + {"_oid", 1028, OIDOID, -1, false, TYPALIGN_INT, TYPSTORAGE_EXTENDED, InvalidOid, + F_ARRAY_IN, F_ARRAY_OUT}, + {"_char", 1002, CHAROID, -1, false, TYPALIGN_INT, TYPSTORAGE_EXTENDED, InvalidOid, + F_ARRAY_IN, F_ARRAY_OUT}, + {"_aclitem", 1034, ACLITEMOID, -1, false, TYPALIGN_INT, TYPSTORAGE_EXTENDED, InvalidOid, + F_ARRAY_IN, F_ARRAY_OUT} +}; + +static const int n_types = sizeof(TypInfo) / sizeof(struct typinfo); + +struct typmap +{ /* a hack */ + Oid am_oid; + FormData_pg_type am_typ; +}; + +static struct typmap **Typ = NULL; +static struct typmap *Ap = NULL; + +static Datum values[MAXATTR]; /* current row's attribute values */ +static bool Nulls[MAXATTR]; + +static MemoryContext nogc = NULL; /* special no-gc mem context */ + +/* + * At bootstrap time, we first declare all the indices to be built, and + * then build them. The IndexList structure stores enough information + * to allow us to build the indices after they've been declared. + */ + +typedef struct _IndexList +{ + Oid il_heap; + Oid il_ind; + IndexInfo *il_info; + struct _IndexList *il_next; +} IndexList; + +static IndexList *ILHead = NULL; + + +/* + * AuxiliaryProcessMain + * + * The main entry point for auxiliary processes, such as the bgwriter, + * walwriter, walreceiver, bootstrapper and the shared memory checker code. + * + * This code is here just because of historical reasons. + */ +void +AuxiliaryProcessMain(int argc, char *argv[]) +{ + char *progname = argv[0]; + int flag; + char *userDoption = NULL; + + /* + * Initialize process environment (already done if under postmaster, but + * not if standalone). + */ + if (!IsUnderPostmaster) + InitStandaloneProcess(argv[0]); + + /* + * process command arguments + */ + + /* Set defaults, to be overridden by explicit options below */ + if (!IsUnderPostmaster) + InitializeGUCOptions(); + + /* Ignore the initial --boot argument, if present */ + if (argc > 1 && strcmp(argv[1], "--boot") == 0) + { + argv++; + argc--; + } + + /* If no -x argument, we are a CheckerProcess */ + MyAuxProcType = CheckerProcess; + + while ((flag = getopt(argc, argv, "B:c:d:D:Fkr:x:X:-:")) != -1) + { + switch (flag) + { + case 'B': + SetConfigOption("shared_buffers", optarg, PGC_POSTMASTER, PGC_S_ARGV); + break; + case 'D': + userDoption = pstrdup(optarg); + break; + case 'd': + { + /* Turn on debugging for the bootstrap process. */ + char *debugstr; + + debugstr = psprintf("debug%s", optarg); + SetConfigOption("log_min_messages", debugstr, + PGC_POSTMASTER, PGC_S_ARGV); + SetConfigOption("client_min_messages", debugstr, + PGC_POSTMASTER, PGC_S_ARGV); + pfree(debugstr); + } + break; + case 'F': + SetConfigOption("fsync", "false", PGC_POSTMASTER, PGC_S_ARGV); + break; + case 'k': + bootstrap_data_checksum_version = PG_DATA_CHECKSUM_VERSION; + break; + case 'r': + strlcpy(OutputFileName, optarg, MAXPGPATH); + break; + case 'x': + MyAuxProcType = atoi(optarg); + break; + case 'X': + { + int WalSegSz = strtoul(optarg, NULL, 0); + + if (!IsValidWalSegSize(WalSegSz)) + ereport(ERROR, + (errcode(ERRCODE_INVALID_PARAMETER_VALUE), + errmsg("-X requires a power of two value between 1 MB and 1 GB"))); + SetConfigOption("wal_segment_size", optarg, PGC_INTERNAL, + PGC_S_OVERRIDE); + } + break; + case 'c': + case '-': + { + char *name, + *value; + + ParseLongOption(optarg, &name, &value); + if (!value) + { + if (flag == '-') + ereport(ERROR, + (errcode(ERRCODE_SYNTAX_ERROR), + errmsg("--%s requires a value", + optarg))); + else + ereport(ERROR, + (errcode(ERRCODE_SYNTAX_ERROR), + errmsg("-c %s requires a value", + optarg))); + } + + SetConfigOption(name, value, PGC_POSTMASTER, PGC_S_ARGV); + free(name); + if (value) + free(value); + break; + } + default: + write_stderr("Try \"%s --help\" for more information.\n", + progname); + proc_exit(1); + break; + } + } + + if (argc != optind) + { + write_stderr("%s: invalid command-line arguments\n", progname); + proc_exit(1); + } + + switch (MyAuxProcType) + { + case StartupProcess: + MyBackendType = B_STARTUP; + break; + case BgWriterProcess: + MyBackendType = B_BG_WRITER; + break; + case CheckpointerProcess: + MyBackendType = B_CHECKPOINTER; + break; + case WalWriterProcess: + MyBackendType = B_WAL_WRITER; + break; + case WalReceiverProcess: + MyBackendType = B_WAL_RECEIVER; + break; + default: + MyBackendType = B_INVALID; + } + if (IsUnderPostmaster) + init_ps_display(NULL); + + /* Acquire configuration parameters, unless inherited from postmaster */ + if (!IsUnderPostmaster) + { + if (!SelectConfigFiles(userDoption, progname)) + proc_exit(1); + } + + /* + * Validate we have been given a reasonable-looking DataDir and change + * into it (if under postmaster, should be done already). + */ + if (!IsUnderPostmaster) + { + checkDataDir(); + ChangeToDataDir(); + } + + /* If standalone, create lockfile for data directory */ + if (!IsUnderPostmaster) + CreateDataDirLockFile(false); + + SetProcessingMode(BootstrapProcessing); + IgnoreSystemIndexes = true; + + /* Initialize MaxBackends (if under postmaster, was done already) */ + if (!IsUnderPostmaster) + InitializeMaxBackends(); + + BaseInit(); + + /* + * When we are an auxiliary process, we aren't going to do the full + * InitPostgres pushups, but there are a couple of things that need to get + * lit up even in an auxiliary process. + */ + if (IsUnderPostmaster) + { + /* + * Create a PGPROC so we can use LWLocks. In the EXEC_BACKEND case, + * this was already done by SubPostmasterMain(). + */ +#ifndef EXEC_BACKEND + InitAuxiliaryProcess(); +#endif + + /* + * Assign the ProcSignalSlot for an auxiliary process. Since it + * doesn't have a BackendId, the slot is statically allocated based on + * the auxiliary process type (MyAuxProcType). Backends use slots + * indexed in the range from 1 to MaxBackends (inclusive), so we use + * MaxBackends + AuxProcType + 1 as the index of the slot for an + * auxiliary process. + * + * This will need rethinking if we ever want more than one of a + * particular auxiliary process type. + */ + ProcSignalInit(MaxBackends + MyAuxProcType + 1); + + /* finish setting up bufmgr.c */ + InitBufferPoolBackend(); + + /* + * Auxiliary processes don't run transactions, but they may need a + * resource owner anyway to manage buffer pins acquired outside + * transactions (and, perhaps, other things in future). + */ + CreateAuxProcessResourceOwner(); + + /* Initialize backend status information */ + pgstat_initialize(); + pgstat_bestart(); + + /* register a before-shutdown callback for LWLock cleanup */ + before_shmem_exit(ShutdownAuxiliaryProcess, 0); + } + + /* + * XLOG operations + */ + SetProcessingMode(NormalProcessing); + + switch (MyAuxProcType) + { + case CheckerProcess: + /* don't set signals, they're useless here */ + CheckerModeMain(); + proc_exit(1); /* should never return */ + + case BootstrapProcess: + + /* + * There was a brief instant during which mode was Normal; this is + * okay. We need to be in bootstrap mode during BootStrapXLOG for + * the sake of multixact initialization. + */ + SetProcessingMode(BootstrapProcessing); + bootstrap_signals(); + BootStrapXLOG(); + BootstrapModeMain(); + proc_exit(1); /* should never return */ + + case StartupProcess: + /* don't set signals, startup process has its own agenda */ + StartupProcessMain(); + proc_exit(1); /* should never return */ + + case BgWriterProcess: + /* don't set signals, bgwriter has its own agenda */ + BackgroundWriterMain(); + proc_exit(1); /* should never return */ + + case CheckpointerProcess: + /* don't set signals, checkpointer has its own agenda */ + CheckpointerMain(); + proc_exit(1); /* should never return */ + + case WalWriterProcess: + /* don't set signals, walwriter has its own agenda */ + InitXLOGAccess(); + WalWriterMain(); + proc_exit(1); /* should never return */ + + case WalReceiverProcess: + /* don't set signals, walreceiver has its own agenda */ + WalReceiverMain(); + proc_exit(1); /* should never return */ + + default: + elog(PANIC, "unrecognized process type: %d", (int) MyAuxProcType); + proc_exit(1); + } +} + +/* + * In shared memory checker mode, all we really want to do is create shared + * memory and semaphores (just to prove we can do it with the current GUC + * settings). Since, in fact, that was already done by BaseInit(), + * we have nothing more to do here. + */ +static void +CheckerModeMain(void) +{ + proc_exit(0); +} + +/* + * The main entry point for running the backend in bootstrap mode + * + * The bootstrap mode is used to initialize the template database. + * The bootstrap backend doesn't speak SQL, but instead expects + * commands in a special bootstrap language. + */ +static void +BootstrapModeMain(void) +{ + int i; + + Assert(!IsUnderPostmaster); + Assert(IsBootstrapProcessingMode()); + + /* + * To ensure that src/common/link-canary.c is linked into the backend, we + * must call it from somewhere. Here is as good as anywhere. + */ + if (pg_link_canary_is_frontend()) + elog(ERROR, "backend is incorrectly linked to frontend functions"); + + /* + * Do backend-like initialization for bootstrap mode + */ + InitProcess(); + + InitPostgres(NULL, InvalidOid, NULL, InvalidOid, NULL, false); + + /* Initialize stuff for bootstrap-file processing */ + for (i = 0; i < MAXATTR; i++) + { + attrtypes[i] = NULL; + Nulls[i] = false; + } + + /* + * Process bootstrap input. + */ + StartTransactionCommand(); + boot_yyparse(); + CommitTransactionCommand(); + + /* + * We should now know about all mapped relations, so it's okay to write + * out the initial relation mapping files. + */ + RelationMapFinishBootstrap(); + + /* Clean up and exit */ + cleanup(); + proc_exit(0); +} + + +/* ---------------------------------------------------------------- + * misc functions + * ---------------------------------------------------------------- + */ + +/* + * Set up signal handling for a bootstrap process + */ +static void +bootstrap_signals(void) +{ + Assert(!IsUnderPostmaster); + + /* + * We don't actually need any non-default signal handling in bootstrap + * mode; "curl up and die" is a sufficient response for all these cases. + * Let's set that handling explicitly, as documentation if nothing else. + */ + pqsignal(SIGHUP, SIG_DFL); + pqsignal(SIGINT, SIG_DFL); + pqsignal(SIGTERM, SIG_DFL); + pqsignal(SIGQUIT, SIG_DFL); +} + +/* + * Begin shutdown of an auxiliary process. This is approximately the equivalent + * of ShutdownPostgres() in postinit.c. We can't run transactions in an + * auxiliary process, so most of the work of AbortTransaction() is not needed, + * but we do need to make sure we've released any LWLocks we are holding. + * (This is only critical during an error exit.) + */ +static void +ShutdownAuxiliaryProcess(int code, Datum arg) +{ + LWLockReleaseAll(); + ConditionVariableCancelSleep(); + pgstat_report_wait_end(); +} + +/* ---------------------------------------------------------------- + * MANUAL BACKEND INTERACTIVE INTERFACE COMMANDS + * ---------------------------------------------------------------- + */ + +/* ---------------- + * boot_openrel + * ---------------- + */ +void +boot_openrel(char *relname) +{ + int i; + struct typmap **app; + Relation rel; + TableScanDesc scan; + HeapTuple tup; + + if (strlen(relname) >= NAMEDATALEN) + relname[NAMEDATALEN - 1] = '\0'; + + if (Typ == NULL) + { + /* We can now load the pg_type data */ + rel = table_open(TypeRelationId, NoLock); + scan = table_beginscan_catalog(rel, 0, NULL); + i = 0; + while ((tup = heap_getnext(scan, ForwardScanDirection)) != NULL) + ++i; + table_endscan(scan); + app = Typ = ALLOC(struct typmap *, i + 1); + while (i-- > 0) + *app++ = ALLOC(struct typmap, 1); + *app = NULL; + scan = table_beginscan_catalog(rel, 0, NULL); + app = Typ; + while ((tup = heap_getnext(scan, ForwardScanDirection)) != NULL) + { + (*app)->am_oid = ((Form_pg_type) GETSTRUCT(tup))->oid; + memcpy((char *) &(*app)->am_typ, + (char *) GETSTRUCT(tup), + sizeof((*app)->am_typ)); + app++; + } + table_endscan(scan); + table_close(rel, NoLock); + } + + if (boot_reldesc != NULL) + closerel(NULL); + + elog(DEBUG4, "open relation %s, attrsize %d", + relname, (int) ATTRIBUTE_FIXED_PART_SIZE); + + boot_reldesc = table_openrv(makeRangeVar(NULL, relname, -1), NoLock); + numattr = RelationGetNumberOfAttributes(boot_reldesc); + for (i = 0; i < numattr; i++) + { + if (attrtypes[i] == NULL) + attrtypes[i] = AllocateAttribute(); + memmove((char *) attrtypes[i], + (char *) TupleDescAttr(boot_reldesc->rd_att, i), + ATTRIBUTE_FIXED_PART_SIZE); + + { + Form_pg_attribute at = attrtypes[i]; + + elog(DEBUG4, "create attribute %d name %s len %d num %d type %u", + i, NameStr(at->attname), at->attlen, at->attnum, + at->atttypid); + } + } +} + +/* ---------------- + * closerel + * ---------------- + */ +void +closerel(char *name) +{ + if (name) + { + if (boot_reldesc) + { + if (strcmp(RelationGetRelationName(boot_reldesc), name) != 0) + elog(ERROR, "close of %s when %s was expected", + name, RelationGetRelationName(boot_reldesc)); + } + else + elog(ERROR, "close of %s before any relation was opened", + name); + } + + if (boot_reldesc == NULL) + elog(ERROR, "no open relation to close"); + else + { + elog(DEBUG4, "close relation %s", + RelationGetRelationName(boot_reldesc)); + table_close(boot_reldesc, NoLock); + boot_reldesc = NULL; + } +} + + + +/* ---------------- + * DEFINEATTR() + * + * define a pair + * if there are n fields in a relation to be created, this routine + * will be called n times + * ---------------- + */ +void +DefineAttr(char *name, char *type, int attnum, int nullness) +{ + Oid typeoid; + + if (boot_reldesc != NULL) + { + elog(WARNING, "no open relations allowed with CREATE command"); + closerel(NULL); + } + + if (attrtypes[attnum] == NULL) + attrtypes[attnum] = AllocateAttribute(); + MemSet(attrtypes[attnum], 0, ATTRIBUTE_FIXED_PART_SIZE); + + namestrcpy(&attrtypes[attnum]->attname, name); + elog(DEBUG4, "column %s %s", NameStr(attrtypes[attnum]->attname), type); + attrtypes[attnum]->attnum = attnum + 1; + + typeoid = gettype(type); + + if (Typ != NULL) + { + attrtypes[attnum]->atttypid = Ap->am_oid; + attrtypes[attnum]->attlen = Ap->am_typ.typlen; + attrtypes[attnum]->attbyval = Ap->am_typ.typbyval; + attrtypes[attnum]->attstorage = Ap->am_typ.typstorage; + attrtypes[attnum]->attalign = Ap->am_typ.typalign; + attrtypes[attnum]->attcollation = Ap->am_typ.typcollation; + /* if an array type, assume 1-dimensional attribute */ + if (Ap->am_typ.typelem != InvalidOid && Ap->am_typ.typlen < 0) + attrtypes[attnum]->attndims = 1; + else + attrtypes[attnum]->attndims = 0; + } + else + { + attrtypes[attnum]->atttypid = TypInfo[typeoid].oid; + attrtypes[attnum]->attlen = TypInfo[typeoid].len; + attrtypes[attnum]->attbyval = TypInfo[typeoid].byval; + attrtypes[attnum]->attstorage = TypInfo[typeoid].storage; + attrtypes[attnum]->attalign = TypInfo[typeoid].align; + attrtypes[attnum]->attcollation = TypInfo[typeoid].collation; + /* if an array type, assume 1-dimensional attribute */ + if (TypInfo[typeoid].elem != InvalidOid && + attrtypes[attnum]->attlen < 0) + attrtypes[attnum]->attndims = 1; + else + attrtypes[attnum]->attndims = 0; + } + + /* + * If a system catalog column is collation-aware, force it to use C + * collation, so that its behavior is independent of the database's + * collation. This is essential to allow template0 to be cloned with a + * different database collation. + */ + if (OidIsValid(attrtypes[attnum]->attcollation)) + attrtypes[attnum]->attcollation = C_COLLATION_OID; + + attrtypes[attnum]->attstattarget = -1; + attrtypes[attnum]->attcacheoff = -1; + attrtypes[attnum]->atttypmod = -1; + attrtypes[attnum]->attislocal = true; + + if (nullness == BOOTCOL_NULL_FORCE_NOT_NULL) + { + attrtypes[attnum]->attnotnull = true; + } + else if (nullness == BOOTCOL_NULL_FORCE_NULL) + { + attrtypes[attnum]->attnotnull = false; + } + else + { + Assert(nullness == BOOTCOL_NULL_AUTO); + + /* + * Mark as "not null" if type is fixed-width and prior columns are + * too. This corresponds to case where column can be accessed + * directly via C struct declaration. + * + * oidvector and int2vector are also treated as not-nullable, even + * though they are no longer fixed-width. + */ +#define MARKNOTNULL(att) \ + ((att)->attlen > 0 || \ + (att)->atttypid == OIDVECTOROID || \ + (att)->atttypid == INT2VECTOROID) + + if (MARKNOTNULL(attrtypes[attnum])) + { + int i; + + /* check earlier attributes */ + for (i = 0; i < attnum; i++) + { + if (!attrtypes[i]->attnotnull) + break; + } + if (i == attnum) + attrtypes[attnum]->attnotnull = true; + } + } +} + + +/* ---------------- + * InsertOneTuple + * + * If objectid is not zero, it is a specific OID to assign to the tuple. + * Otherwise, an OID will be assigned (if necessary) by heap_insert. + * ---------------- + */ +void +InsertOneTuple(void) +{ + HeapTuple tuple; + TupleDesc tupDesc; + int i; + + elog(DEBUG4, "inserting row with %d columns", numattr); + + tupDesc = CreateTupleDesc(numattr, attrtypes); + tuple = heap_form_tuple(tupDesc, values, Nulls); + pfree(tupDesc); /* just free's tupDesc, not the attrtypes */ + + simple_heap_insert(boot_reldesc, tuple); + heap_freetuple(tuple); + elog(DEBUG4, "row inserted"); + + /* + * Reset null markers for next tuple + */ + for (i = 0; i < numattr; i++) + Nulls[i] = false; +} + +/* ---------------- + * InsertOneValue + * ---------------- + */ +void +InsertOneValue(char *value, int i) +{ + Oid typoid; + int16 typlen; + bool typbyval; + char typalign; + char typdelim; + Oid typioparam; + Oid typinput; + Oid typoutput; + + AssertArg(i >= 0 && i < MAXATTR); + + elog(DEBUG4, "inserting column %d value \"%s\"", i, value); + + typoid = TupleDescAttr(boot_reldesc->rd_att, i)->atttypid; + + boot_get_type_io_data(typoid, + &typlen, &typbyval, &typalign, + &typdelim, &typioparam, + &typinput, &typoutput); + + values[i] = OidInputFunctionCall(typinput, value, typioparam, -1); + + /* + * We use ereport not elog here so that parameters aren't evaluated unless + * the message is going to be printed, which generally it isn't + */ + ereport(DEBUG4, + (errmsg_internal("inserted -> %s", + OidOutputFunctionCall(typoutput, values[i])))); +} + +/* ---------------- + * InsertOneNull + * ---------------- + */ +void +InsertOneNull(int i) +{ + elog(DEBUG4, "inserting column %d NULL", i); + Assert(i >= 0 && i < MAXATTR); + if (TupleDescAttr(boot_reldesc->rd_att, i)->attnotnull) + elog(ERROR, + "NULL value specified for not-null column \"%s\" of relation \"%s\"", + NameStr(TupleDescAttr(boot_reldesc->rd_att, i)->attname), + RelationGetRelationName(boot_reldesc)); + values[i] = PointerGetDatum(NULL); + Nulls[i] = true; +} + +/* ---------------- + * cleanup + * ---------------- + */ +static void +cleanup(void) +{ + if (boot_reldesc != NULL) + closerel(NULL); +} + +/* ---------------- + * gettype + * + * NB: this is really ugly; it will return an integer index into TypInfo[], + * and not an OID at all, until the first reference to a type not known in + * TypInfo[]. At that point it will read and cache pg_type in the Typ array, + * and subsequently return a real OID (and set the global pointer Ap to + * point at the found row in Typ). So caller must check whether Typ is + * still NULL to determine what the return value is! + * ---------------- + */ +static Oid +gettype(char *type) +{ + int i; + Relation rel; + TableScanDesc scan; + HeapTuple tup; + struct typmap **app; + + if (Typ != NULL) + { + for (app = Typ; *app != NULL; app++) + { + if (strncmp(NameStr((*app)->am_typ.typname), type, NAMEDATALEN) == 0) + { + Ap = *app; + return (*app)->am_oid; + } + } + } + else + { + for (i = 0; i < n_types; i++) + { + if (strncmp(type, TypInfo[i].name, NAMEDATALEN) == 0) + return i; + } + elog(DEBUG4, "external type: %s", type); + rel = table_open(TypeRelationId, NoLock); + scan = table_beginscan_catalog(rel, 0, NULL); + i = 0; + while ((tup = heap_getnext(scan, ForwardScanDirection)) != NULL) + ++i; + table_endscan(scan); + app = Typ = ALLOC(struct typmap *, i + 1); + while (i-- > 0) + *app++ = ALLOC(struct typmap, 1); + *app = NULL; + scan = table_beginscan_catalog(rel, 0, NULL); + app = Typ; + while ((tup = heap_getnext(scan, ForwardScanDirection)) != NULL) + { + (*app)->am_oid = ((Form_pg_type) GETSTRUCT(tup))->oid; + memmove((char *) &(*app++)->am_typ, + (char *) GETSTRUCT(tup), + sizeof((*app)->am_typ)); + } + table_endscan(scan); + table_close(rel, NoLock); + return gettype(type); + } + elog(ERROR, "unrecognized type \"%s\"", type); + /* not reached, here to make compiler happy */ + return 0; +} + +/* ---------------- + * boot_get_type_io_data + * + * Obtain type I/O information at bootstrap time. This intentionally has + * almost the same API as lsyscache.c's get_type_io_data, except that + * we only support obtaining the typinput and typoutput routines, not + * the binary I/O routines. It is exported so that array_in and array_out + * can be made to work during early bootstrap. + * ---------------- + */ +void +boot_get_type_io_data(Oid typid, + int16 *typlen, + bool *typbyval, + char *typalign, + char *typdelim, + Oid *typioparam, + Oid *typinput, + Oid *typoutput) +{ + if (Typ != NULL) + { + /* We have the boot-time contents of pg_type, so use it */ + struct typmap **app; + struct typmap *ap; + + app = Typ; + while (*app && (*app)->am_oid != typid) + ++app; + ap = *app; + if (ap == NULL) + elog(ERROR, "type OID %u not found in Typ list", typid); + + *typlen = ap->am_typ.typlen; + *typbyval = ap->am_typ.typbyval; + *typalign = ap->am_typ.typalign; + *typdelim = ap->am_typ.typdelim; + + /* XXX this logic must match getTypeIOParam() */ + if (OidIsValid(ap->am_typ.typelem)) + *typioparam = ap->am_typ.typelem; + else + *typioparam = typid; + + *typinput = ap->am_typ.typinput; + *typoutput = ap->am_typ.typoutput; + } + else + { + /* We don't have pg_type yet, so use the hard-wired TypInfo array */ + int typeindex; + + for (typeindex = 0; typeindex < n_types; typeindex++) + { + if (TypInfo[typeindex].oid == typid) + break; + } + if (typeindex >= n_types) + elog(ERROR, "type OID %u not found in TypInfo", typid); + + *typlen = TypInfo[typeindex].len; + *typbyval = TypInfo[typeindex].byval; + *typalign = TypInfo[typeindex].align; + /* We assume typdelim is ',' for all boot-time types */ + *typdelim = ','; + + /* XXX this logic must match getTypeIOParam() */ + if (OidIsValid(TypInfo[typeindex].elem)) + *typioparam = TypInfo[typeindex].elem; + else + *typioparam = typid; + + *typinput = TypInfo[typeindex].inproc; + *typoutput = TypInfo[typeindex].outproc; + } +} + +/* ---------------- + * AllocateAttribute + * + * Note: bootstrap never sets any per-column ACLs, so we only need + * ATTRIBUTE_FIXED_PART_SIZE space per attribute. + * ---------------- + */ +static Form_pg_attribute +AllocateAttribute(void) +{ + return (Form_pg_attribute) + MemoryContextAllocZero(TopMemoryContext, ATTRIBUTE_FIXED_PART_SIZE); +} + +/* + * index_register() -- record an index that has been set up for building + * later. + * + * At bootstrap time, we define a bunch of indexes on system catalogs. + * We postpone actually building the indexes until just before we're + * finished with initialization, however. This is because the indexes + * themselves have catalog entries, and those have to be included in the + * indexes on those catalogs. Doing it in two phases is the simplest + * way of making sure the indexes have the right contents at the end. + */ +void +index_register(Oid heap, + Oid ind, + IndexInfo *indexInfo) +{ + IndexList *newind; + MemoryContext oldcxt; + + /* + * XXX mao 10/31/92 -- don't gc index reldescs, associated info at + * bootstrap time. we'll declare the indexes now, but want to create them + * later. + */ + + if (nogc == NULL) + nogc = AllocSetContextCreate(NULL, + "BootstrapNoGC", + ALLOCSET_DEFAULT_SIZES); + + oldcxt = MemoryContextSwitchTo(nogc); + + newind = (IndexList *) palloc(sizeof(IndexList)); + newind->il_heap = heap; + newind->il_ind = ind; + newind->il_info = (IndexInfo *) palloc(sizeof(IndexInfo)); + + memcpy(newind->il_info, indexInfo, sizeof(IndexInfo)); + /* expressions will likely be null, but may as well copy it */ + newind->il_info->ii_Expressions = + copyObject(indexInfo->ii_Expressions); + newind->il_info->ii_ExpressionsState = NIL; + /* predicate will likely be null, but may as well copy it */ + newind->il_info->ii_Predicate = + copyObject(indexInfo->ii_Predicate); + newind->il_info->ii_PredicateState = NULL; + /* no exclusion constraints at bootstrap time, so no need to copy */ + Assert(indexInfo->ii_ExclusionOps == NULL); + Assert(indexInfo->ii_ExclusionProcs == NULL); + Assert(indexInfo->ii_ExclusionStrats == NULL); + + newind->il_next = ILHead; + ILHead = newind; + + MemoryContextSwitchTo(oldcxt); +} + + +/* + * build_indices -- fill in all the indexes registered earlier + */ +void +build_indices(void) +{ + for (; ILHead != NULL; ILHead = ILHead->il_next) + { + Relation heap; + Relation ind; + + /* need not bother with locks during bootstrap */ + heap = table_open(ILHead->il_heap, NoLock); + ind = index_open(ILHead->il_ind, NoLock); + + index_build(heap, ind, ILHead->il_info, false, false); + + index_close(ind, NoLock); + table_close(heap, NoLock); + } +} -- cgit v1.2.3