postgres likely remains stuck in an unclassified userspace loop. A diagnosis report and patch proposal were created locally.
Published session
Prompt
## Plan Pass
You are planning a fixer patch before any edits happen.
Read the evidence bundle at `./evidence.json`. The prepared workspace is `./workspace` and it was acquired via `debian-source`. The original pre-edit snapshot is available at `./source` if you need to inspect it. For interpreter processes, plan from the script/application entrypoint evidence first and include the runtime only as a second investigation target unless the evidence proves a runtime bug.
Validation expectation: try the project-level build/test entrypoint from the workspace root before reporting only a focused leaf compile. Detected candidate(s): `./configure && make`, `meson setup build-fix && meson compile -C build-fix && meson test -C build-fix`, `make` and, if available, `make check`. If the project-level command fails because dependencies or generated files are missing, include the exact command and failure reason in `## Validation`, then run the narrowest relevant compile/test that is still reproducible from a clean checkout.
Upstream-style expectation: before planning or editing, check for contribution/style docs (`CONTRIBUTING`, `HACKING`, `README-hacking`, `README.md`, `docs/`, `dev-docs/`) and scan the touched subsystem for local helpers. If the project has wrappers for file IO, path-relative IO, process spawning, memory allocation, logging, locking, or platform compatibility, prefer those wrappers over generic libc/std APIs. Do not invent a reproducer or user-visible failure that is not in the evidence bundle; if the evidence is profiler-only or indirect, describe it as a targeted mitigation or stop with a diagnosis instead of presenting a speculative patch as a confirmed bug fix. In the plan and final validation, name any such helper, convention, or evidence limit you found, or say that no relevant local helper was found. Treat this as a `postgresql-18` upstream patch, not just a Debian-local workaround. Inspect the relevant code, nearby callers, project contribution docs, and local helper/compat APIs, but do not edit files in this pass.
Return a short markdown plan with these exact sections:
## Problem
## Evidence Confidence
## Proposed Subject
## Patch Plan
## Risks
## Validation
Classify `## Evidence Confidence` as exactly one of `reproduced`, `observed`, or `inferred`. Use `inferred` only for a no-patch diagnosis/report plan unless you can name the extra evidence you will collect before editing; inferred source patches are blocked by Fixer because they are not pull-request-ready. For `observed` source-patch plans, plan to say in the final `## Issue Connection` that the failure was observed by Fixer and not independently reproduced. If the plan touches authentication, authorization, credentials, cryptography, sandboxing, permissions, or timing/throttling behavior, treat it as security-sensitive: do not plan a source patch unless validation can reproduce the behavior and analyze the security impact; otherwise plan a no-patch diagnosis/report. The plan must explain how the proposed code change addresses the observed issue evidence, call out any prior Fixer patch that should be improved or replaced, reject awkward control flow such as avoidable `goto` if there is a cleaner bounded alternative, name any local helper APIs or maintainer conventions the patch should follow, and keep the intended maintainer-facing explanation clear enough that someone unfamiliar with the local complaint wording can still follow the fix. In `## Validation`, name the reproducible configure/build/test entrypoint you will try from the workspace root before any focused leaf compile or smoke check, and include one bounded independent reproduction attempt for the collected failure signal when it is safe and cheap. Do not plan to claim `reproduced` unless that reproduction command or test can actually show the failure.
## Patch Pass
You are working on a bounded fixer proposal.
Read the evidence bundle at `./evidence.json`. The prepared workspace is `./workspace` and it was acquired via `debian-source`. Produce the smallest reasonable patch for the target repository, keep the change upstreamable, prefer the clearest control flow available, and do not keep avoidable `goto` when a simpler structure would read better. Before introducing new file, process, allocation, locking, networking, or platform APIs, inspect nearby code and project contribution docs for existing helpers or compatibility wrappers and use those local patterns unless you can explain why they do not fit. Validate from a reproducible workspace-root entrypoint before falling back to focused leaf commands; if a build or test cannot run, report the exact command, the exact blocker, and any narrower check you ran instead. During validation, also try one bounded independent reproduction of the collected failure signal when it is safe and cheap, such as a failing test, smoke command, perf/strace comparison, or before/after runtime check. Only use `reproduced` if that command or test actually reproduced the failure; otherwise keep `observed` and report the reproduction blocker. The final explanation must connect the observed issue evidence to the actual code change, not just paraphrase the diff. Write like a maintainer is going to read the patch mail cold: explain the bug in plain language, define subsystem-specific jargon the first time you need it, and make the causal story obvious. Explicitly classify evidence confidence as `reproduced`, `observed`, or `inferred`: `reproduced` means you reproduced the failure locally; `observed` means Fixer has direct crash/log/trace evidence but you did not independently reproduce it; `inferred` means the source patch is not pull-request-ready, so do not leave a source diff unless you first gather stronger observed/reproduced evidence; otherwise return a no-patch diagnosis/report. For any source-changing `observed` patch, say explicitly in `## Issue Connection` that the failure was observed by Fixer and not independently reproduced. Security-sensitive areas such as authentication, authorization, credentials, cryptography, sandboxing, permissions, and timing/throttling behavior need reproduced evidence plus explicit security-impact analysis before leaving a source diff; otherwise return a no-patch diagnosis/report for human review. If you introduce non-obvious state translation, index remapping, or backend split logic, add a short source comment that explains the invariant being preserved.
Start by explaining the likely root cause from the collected perf, strace, and /proc evidence. If you cannot land a safe patch, leave a diagnosis that is strong enough for an upstream bug report.
Validation expectation: try the project-level build/test entrypoint from the workspace root before reporting only a focused leaf compile. Detected candidate(s): `./configure && make`, `meson setup build-fix && meson compile -C build-fix && meson test -C build-fix`, `make` and, if available, `make check`. If the project-level command fails because dependencies or generated files are missing, include the exact command and failure reason in `## Validation`, then run the narrowest relevant compile/test that is still reproducible from a clean checkout.
Upstream-style expectation: before planning or editing, check for contribution/style docs (`CONTRIBUTING`, `HACKING`, `README-hacking`, `README.md`, `docs/`, `dev-docs/`) and scan the touched subsystem for local helpers. If the project has wrappers for file IO, path-relative IO, process spawning, memory allocation, logging, locking, or platform compatibility, prefer those wrappers over generic libc/std APIs. Do not invent a reproducer or user-visible failure that is not in the evidence bundle; if the evidence is profiler-only or indirect, describe it as a targeted mitigation or stop with a diagnosis instead of presenting a speculative patch as a confirmed bug fix. In the plan and final validation, name any such helper, convention, or evidence limit you found, or say that no relevant local helper was found. Treat this as a `postgresql-18` upstream patch, not just a Debian-local workaround.
Keep the change narrowly scoped and summarize validation clearly.
In every authoring pass, your final response must start with `Subject: <single-line git commit subject>` and then include these markdown sections exactly:
## Commit Message
A short upstream-friendly explanation of what changed and why. Write it in plain language that a maintainer can follow without local complaint context. If you use subsystem jargon, define it immediately.
## Evidence Confidence
Exactly one word: `reproduced`, `observed`, or `inferred`. Use `reproduced` only when you reproduced the failure locally with a command or test, and include that command/test in `## Validation`. Use `observed` when Fixer has direct crash/log/trace evidence but you did not independently reproduce it. If `## Git Add Paths` lists source files for an `observed` patch, `## Issue Connection` must explicitly say the failure was observed by Fixer and not independently reproduced. Security-sensitive source changes touching authentication, authorization, credentials, cryptography, sandboxing, permissions, or timing/throttling behavior require reproduced evidence and explicit security-impact analysis; otherwise list `None` under `## Git Add Paths` and write a no-patch diagnosis/report. Use `inferred` for profiler/strace/indirect evidence; inferred responses may be no-patch diagnoses or reports, but inferred source patches are not pull-request-ready until stronger evidence is gathered.
## Issue Connection
Write this as maintainer-facing patch mail, not as local Fixer notes. Cover four things explicitly in readable sentences: the user-visible symptom or the exact collected signal, the code-level cause or the cautious inference from evidence, the specific change you made, and the expected effect. Do not invent a reproducer, command line, crash, or user-visible failure that is not present in the evidence bundle. If the evidence is direct-but-not-reproduced, say it was observed by Fixer and not independently reproduced. If the evidence is indirect and you did not gather stronger evidence, do not leave a source diff; write a no-patch diagnosis/report instead. Include an explicit effect sentence such as `The expected effect is ...`, `This should reduce ...`, or `This prevents ...` for source patches. If the logic is non-obvious in code, mention that you added a short explanatory comment.
## Git Add Paths
List the repo-relative paths that belong in the final patch, one per line. Use `None` only when you intentionally made no source changes. Include intentionally new files, and do not list generated build artifacts.
## Validation
List the checks you ran, or say clearly that you could not run them. Include the independent reproduction command/test and result when `## Evidence Confidence` is `reproduced`; if reproduction was attempted but blocked, name the exact blocker and keep confidence at `observed` or `inferred`.
Before editing, read the plan at `./plan-output.txt` and follow it unless the code proves part of it wrong. If you change course, say so explicitly in the final write-up instead of silently drifting from the plan.
## Review Pass 1
You are reviewing a freshly generated fixer patch.
Read the evidence bundle at `./evidence.json`. The prepared workspace is `./workspace` and it was acquired via `debian-source`. Review the first patch pass. The original pre-edit snapshot is available at `./source` for diffing.
Upstream-style expectation: before planning or editing, check for contribution/style docs (`CONTRIBUTING`, `HACKING`, `README-hacking`, `README.md`, `docs/`, `dev-docs/`) and scan the touched subsystem for local helpers. If the project has wrappers for file IO, path-relative IO, process spawning, memory allocation, logging, locking, or platform compatibility, prefer those wrappers over generic libc/std APIs. Do not invent a reproducer or user-visible failure that is not in the evidence bundle; if the evidence is profiler-only or indirect, describe it as a targeted mitigation or stop with a diagnosis instead of presenting a speculative patch as a confirmed bug fix. In the plan and final validation, name any such helper, convention, or evidence limit you found, or say that no relevant local helper was found. Treat this as a `postgresql-18` upstream patch, not just a Debian-local workaround.
Validation expectation: try the project-level build/test entrypoint from the workspace root before reporting only a focused leaf compile. Detected candidate(s): `./configure && make`, `meson setup build-fix && meson compile -C build-fix && meson test -C build-fix`, `make` and, if available, `make check`. If the project-level command fails because dependencies or generated files are missing, include the exact command and failure reason in `## Validation`, then run the narrowest relevant compile/test that is still reproducible from a clean checkout. The latest author response is at `./patch-output.txt`. Inspect the current code and changed paths like a strict code reviewer. Focus on correctness, regressions, maintainability, awkward control flow such as avoidable `goto`, missing validation, weak or non-gittable commit message text, and explanations that fail to connect the observed issue evidence to the code change. Also review the maintainer experience: the patch mail should be easy to accept upstream, the user-visible bug should be explained in plain language, subsystem-specific jargon should be defined when first used, and any non-obvious state translation or index remapping in code should have a short explanatory comment. Reject patches that omit `## Evidence Confidence`, use anything other than `reproduced`, `observed`, or `inferred`, or sound more certain than that evidence level allows. Reject patches that claim `reproduced` unless `## Validation` names the concrete reproduction command or test and its result. Reject source patches in security-sensitive areas such as authentication, authorization, credentials, cryptography, sandboxing, permissions, and timing/throttling behavior unless the author reproduced the behavior and explicitly analyzed the security impact of the change; observed-only evidence should become a diagnosis/report, not a PR-ready source diff. Reject patches that invent a reproducer, command line, crash, or user-visible failure not present in the evidence bundle; indirect profiler or strace evidence may justify a cautious mitigation, but the author must say it is indirect instead of presenting it as a confirmed upstream bug. Reject patches that introduce generic libc/std APIs when nearby code or project docs provide a local compat/helper API for the same job, unless the author explicitly justifies the exception. Reject validation that only reports a leaf object/syntax build when a project-level configure/build/test entrypoint exists and was not attempted; if a full build cannot run, the author must show the exact failed command and blocker.
Do not apply code changes in this pass.
Return a short markdown review report. The first non-empty line must be exactly one of:
RESULT: ok
RESULT: fix-needed
If you choose `RESULT: fix-needed`, add a `## Findings` section with concrete, actionable items.
Response
## Plan Pass
## Problem
Fixer flagged `postgres` as a runaway-process candidate because the sampled hot symbol was `AtEOXact_Enum`. The same evidence also shows the sampled postmaster was sleeping in `epoll_wait`, with total CPU only `0.3%`, a 3-second profile, and no SQL workload or transaction sequence tying enum cleanup to a reproducible loop.
## Evidence Confidence
inferred
## Proposed Subject
No source patch: diagnose `AtEOXact_Enum` hotspot as insufficient evidence for an upstream PostgreSQL change.
## Patch Plan
I would not edit source in this pass. `src/backend/catalog/pg_enum.c` shows `AtEOXact_Enum()` only clears `uncommitted_enum_types` and `uncommitted_enum_values`; the hash tables are allocated with PostgreSQL’s local `hash_create()` in `TopTransactionContext`, and the nearby comment says memory cleanup is intentionally left to `TopTransactionContext` teardown.
The relevant local conventions/helpers are PostgreSQL memory contexts, `hash_create()`, `hash_search()`, and transaction cleanup hooks called from `xact.c`. No generic libc allocation or manual free path should be introduced here.
`.github/CONTRIBUTING.md` points contributors to PostgreSQL’s upstream developer process, and `README.md` points to upstream build docs. No prior Fixer patch was present in the workspace or Debian patch stack that should be improved or replaced.
If later evidence proves an enum end-of-transaction loop, the patch should be straight-line and bounded, avoiding awkward `goto` control flow, and should preserve the existing transaction-memory-context ownership model unless the bug is specifically in that ownership.
## Risks
A source change based only on this evidence risks changing core transaction cleanup behavior without a demonstrated bug. The profile is contradictory: symbol attribution names enum cleanup, but the captured stack is idle postmaster wait logic.
Changing enum transaction state cleanup could affect rollback, prepared transactions, parallel workers, and safety checks for newly added enum values.
## Validation
Before any future source patch, try the project-level entrypoint from the workspace root:
`./configure && make`
Then, if that succeeds, run:
`make check`
If project-level validation fails because dependencies or generated files are missing, record the exact failure and fall back only to the narrowest relevant compile target for `src/backend/catalog/pg_enum.c` and transaction code.
Bounded independent reproduction attempt before editing: build a temporary cluster, run repeated `CREATE TYPE AS ENUM`, `ALTER TYPE ADD VALUE`, commit, abort, and prepared-transaction cases, then sample the backend/postmaster to see whether `AtEOXact_Enum` consumes measurable CPU. Do not claim `reproduced` unless that command actually shows the reported failure signal.
## Patch Pass
Subject: No patch: report inconclusive AtEOXact_Enum profile
## Commit Message
No source change is included. The collected data points at `AtEOXact_Enum`, PostgreSQL’s end-of-transaction enum cleanup hook, but the same evidence shows the sampled postmaster sleeping in `epoll_wait` with only `0.3%` total CPU. The inspected code path is constant-time pointer clearing backed by `TopTransactionContext`, so this is not pull-request-ready evidence for an upstream code change.
## Evidence Confidence
inferred
## Issue Connection
Fixer collected a profiler signal saying `100.00%` of sampled CPU passed through `AtEOXact_Enum`, along with strace and `/proc` excerpts showing the process in state `S (sleeping)`, `wchan` `do_epoll_wait`, and a backtrace through `WaitEventSetWait()` and `PostmasterMain()`.
The cautious inference is that the hot-symbol attribution is not enough to identify an enum cleanup loop. In `src/backend/catalog/pg_enum.c`, `AtEOXact_Enum()` only clears `uncommitted_enum_types` and `uncommitted_enum_values`; those hash tables are created with PostgreSQL’s local `hash_create()` in `TopTransactionContext`, whose memory is reset by transaction cleanup. That local memory-context convention is the relevant helper pattern here.
I followed the saved plan and did not change course: no source diff was left. A speculative patch would risk changing transaction cleanup semantics without evidence of the actual faulty path. The expected effect is that this proposal becomes an upstream-ready diagnosis/report rather than an unsafe source patch.
## Git Add Paths
None
## Validation
Checked upstream guidance and local conventions: `README.md`, `.github/CONTRIBUTING.md`, `src/backend/catalog/pg_enum.c`, `src/backend/access/transam/xact.c`, and PostgreSQL memory context/hash usage around `TopTransactionContext`, `hash_create()`, and `hash_search()`.
Ran project-level build:
`./configure && make`
Result: passed.
Ran project-level tests:
`make check`
Result: failed during temporary cluster setup because this container runs as root. Exact blocker from `tmp_install/log/initdb-template.log`:
`initdb: error: cannot be run as root`
Independent reproduction attempt: tried to create a temporary cluster and run enum create/alter commit/rollback smoke SQL as an unprivileged user. It was blocked by the container privilege model:
`su -s /bin/sh nobody ...` failed with `su: System error`.
`setpriv --reuid=65534 --regid=65534 --clear-groups ...` failed with `setpriv: setresuid failed: Invalid argument`.
Raw artifact paths named in `evidence.json` were also not present in this workspace, so I could only use the embedded evidence excerpts.
## Review Pass 1
RESULT: ok
The first pass leaves no source diff, which is appropriate for the evidence level. The output correctly classifies confidence as `inferred`, avoids claiming a reproduced bug, and does not present the profiler sample as a confirmed PostgreSQL defect.
Validation is acceptable for a no-patch diagnosis: `./configure && make` was attempted and passed; `make check` was attempted and the exact blocker was reported (`initdb: error: cannot be run as root`). The independent enum smoke reproduction was attempted and its privilege blockers were named. The report also identifies the relevant local PostgreSQL conventions (`TopTransactionContext`, `hash_create()`, `hash_search()`) and explains why changing `AtEOXact_Enum()` would be speculative.
Diff
--- a/GNUmakefile 1970-01-01 04:00:00.000000000 +0400
+++ b/GNUmakefile 2026-05-26 16:48:32.558170825 +0400
@@ -0,0 +1,137 @@
+#
+# PostgreSQL top level makefile
+#
+# GNUmakefile.in
+#
+
+subdir =
+top_builddir = .
+include $(top_builddir)/src/Makefile.global
+
+$(call recurse,all install,src config)
+
+docs:
+ $(MAKE) -C doc all
+
+$(call recurse,world,doc src config contrib,all)
+
+# build src/ before contrib/
+world-contrib-recurse: world-src-recurse
+
+$(call recurse,world-bin,src config contrib,all)
+
+# build src/ before contrib/
+world-bin-contrib-recurse: world-bin-src-recurse
+
+html man:
+ $(MAKE) -C doc $@
+
+install-docs:
+ $(MAKE) -C doc install
+
+$(call recurse,install-world,doc src config contrib,install)
+
+# build src/ before contrib/
+install-world-contrib-recurse: install-world-src-recurse
+
+$(call recurse,install-world-bin,src config contrib,install)
+
+# build src/ before contrib/
+install-world-bin-contrib-recurse: install-world-bin-src-recurse
+
+$(call recurse,installdirs uninstall init-po update-po,doc src config)
+
+$(call recurse,coverage,doc src config contrib)
+
+# clean, distclean, etc should apply to contrib too, even though
+# it's not built by default
+$(call recurse,clean,doc contrib src config)
+clean:
+ rm -rf tmp_install/ portlock/
+# Garbage from autoconf:
+ @rm -rf autom4te.cache/
+
+# Important: distclean `src' last, otherwise Makefile.global
+# will be gone too soon.
+distclean:
+ $(MAKE) -C doc $@
+ $(MAKE) -C contrib $@
+ $(MAKE) -C config $@
+ $(MAKE) -C src $@
+ rm -rf tmp_install/ portlock/
+# Garbage from autoconf:
+ @rm -rf autom4te.cache/
+ rm -f config.cache config.log config.status GNUmakefile
+
+check-tests: | temp-install
+check check-tests installcheck installcheck-parallel installcheck-tests: CHECKPREP_TOP=src/test/regress
+check check-tests installcheck installcheck-parallel installcheck-tests: submake-generated-headers
+ $(MAKE) -C src/test/regress $@
+
+$(call recurse,check-world,src/test src/pl src/interfaces contrib src/bin src/tools/pg_bsd_indent,check)
+$(call recurse,checkprep, src/test src/pl src/interfaces contrib src/bin)
+
+$(call recurse,installcheck-world,src/test src/pl src/interfaces contrib src/bin,installcheck)
+$(call recurse,install-tests,src/test/regress,install-tests)
+
+GNUmakefile: GNUmakefile.in $(top_builddir)/config.status
+ ./config.status $@
+
+update-unicode: | submake-generated-headers submake-libpgport
+ $(MAKE) -C src/common/unicode $@
+ $(MAKE) -C contrib/unaccent $@
+
+
+##########################################################################
+
+distdir = postgresql-$(VERSION)
+dummy = =install=
+
+# git revision to be packaged
+PG_GIT_REVISION = HEAD
+
+GIT = git
+
+dist: $(distdir).tar.gz $(distdir).tar.bz2
+
+.PHONY: $(distdir).tar.gz $(distdir).tar.bz2
+
+distdir-location:
+ @echo $(distdir)
+
+# Note: core.autocrlf=false is needed to avoid line-ending conversion
+# in case the environment has a different setting. Without this, a
+# tarball created on Windows might be different than on, and unusable
+# on, Unix machines.
+
+$(distdir).tar.gz:
+ $(GIT) -C $(srcdir) -c core.autocrlf=false archive --format tar.gz -9 --prefix $(distdir)/ $(PG_GIT_REVISION) -o $(abs_top_builddir)/$@
+
+$(distdir).tar.bz2:
+ $(GIT) -C $(srcdir) -c core.autocrlf=false -c tar.tar.bz2.command='$(BZIP2) -c' archive --format tar.bz2 --prefix $(distdir)/ $(PG_GIT_REVISION) -o $(abs_top_builddir)/$@
+
+distcheck: dist
+ rm -rf $(dummy)
+ mkdir $(dummy)
+ $(GZIP) -d -c $(distdir).tar.gz | $(TAR) xf -
+ install_prefix=`cd $(dummy) && pwd`; \
+ cd $(distdir) \
+ && ./configure --prefix="$$install_prefix"
+ $(MAKE) -C $(distdir)
+ $(MAKE) -C $(distdir) install
+ $(MAKE) -C $(distdir) uninstall
+ @echo "checking whether \`$(MAKE) uninstall' works"
+ test `find $(dummy) ! -type d | wc -l` -eq 0
+ $(MAKE) -C $(distdir) dist
+# Room for improvement: Check here whether this distribution tarball
+# is sufficiently similar to the original one.
+ rm -rf $(distdir) $(dummy)
+ @echo "Distribution integrity checks out."
+
+headerscheck: submake-generated-headers
+ $(top_srcdir)/src/tools/pginclude/headerscheck $(top_srcdir) $(abs_top_builddir)
+
+cpluspluscheck: submake-generated-headers
+ $(top_srcdir)/src/tools/pginclude/headerscheck --cplusplus $(top_srcdir) $(abs_top_builddir)
+
+.PHONY: dist distcheck docs install-docs world check-world install-world installcheck-world headerscheck cpluspluscheck
--- a/src/backend/access/brin/objfiles.txt 1970-01-01 04:00:00.000000000 +0400
+++ b/src/backend/access/brin/objfiles.txt 2026-05-26 16:48:49.447021039 +0400
@@ -0,0 +1 @@
+src/backend/access/brin/brin.o src/backend/access/brin/brin_bloom.o src/backend/access/brin/brin_inclusion.o src/backend/access/brin/brin_minmax.o src/backend/access/brin/brin_minmax_multi.o src/backend/access/brin/brin_pageops.o src/backend/access/brin/brin_revmap.o src/backend/access/brin/brin_tuple.o src/backend/access/brin/brin_validate.o src/backend/access/brin/brin_xlog.o
--- a/src/backend/access/common/objfiles.txt 1970-01-01 04:00:00.000000000 +0400
+++ b/src/backend/access/common/objfiles.txt 2026-05-26 16:48:51.402798453 +0400
@@ -0,0 +1 @@
+src/backend/access/common/attmap.o src/backend/access/common/bufmask.o src/backend/access/common/detoast.o src/backend/access/common/heaptuple.o src/backend/access/common/indextuple.o src/backend/access/common/printsimple.o src/backend/access/common/printtup.o src/backend/access/common/relation.o src/backend/access/common/reloptions.o src/backend/access/common/scankey.o src/backend/access/common/session.o src/backend/access/common/syncscan.o src/backend/access/common/tidstore.o src/backend/access/common/toast_compression.o src/backend/access/common/toast_internals.o src/backend/access/common/tupconvert.o src/backend/access/common/tupdesc.o
--- a/src/backend/access/gin/objfiles.txt 1970-01-01 04:00:00.000000000 +0400
+++ b/src/backend/access/gin/objfiles.txt 2026-05-26 16:48:53.017790429 +0400
@@ -0,0 +1 @@
+src/backend/access/gin/ginarrayproc.o src/backend/access/gin/ginbtree.o src/backend/access/gin/ginbulk.o src/backend/access/gin/gindatapage.o src/backend/access/gin/ginentrypage.o src/backend/access/gin/ginfast.o src/backend/access/gin/ginget.o src/backend/access/gin/gininsert.o src/backend/access/gin/ginlogic.o src/backend/access/gin/ginpostinglist.o src/backend/access/gin/ginscan.o src/backend/access/gin/ginutil.o src/backend/access/gin/ginvacuum.o src/backend/access/gin/ginvalidate.o src/backend/access/gin/ginxlog.o
--- a/src/backend/access/gist/objfiles.txt 1970-01-01 04:00:00.000000000 +0400
+++ b/src/backend/access/gist/objfiles.txt 2026-05-26 16:48:54.360269838 +0400
@@ -0,0 +1 @@
+src/backend/access/gist/gist.o src/backend/access/gist/gistbuild.o src/backend/access/gist/gistbuildbuffers.o src/backend/access/gist/gistget.o src/backend/access/gist/gistproc.o src/backend/access/gist/gistscan.o src/backend/access/gist/gistsplit.o src/backend/access/gist/gistutil.o src/backend/access/gist/gistvacuum.o src/backend/access/gist/gistvalidate.o src/backend/access/gist/gistxlog.o
--- a/src/backend/access/hash/objfiles.txt 1970-01-01 04:00:00.000000000 +0400
+++ b/src/backend/access/hash/objfiles.txt 2026-05-26 16:48:55.278367614 +0400
@@ -0,0 +1 @@
+src/backend/access/hash/hash.o src/backend/access/hash/hash_xlog.o src/backend/access/hash/hashfunc.o src/backend/access/hash/hashinsert.o src/backend/access/hash/hashovfl.o src/backend/access/hash/hashpage.o src/backend/access/hash/hashsearch.o src/backend/access/hash/hashsort.o src/backend/access/hash/hashutil.o src/backend/access/hash/hashvalidate.o
--- a/src/backend/access/heap/objfiles.txt 1970-01-01 04:00:00.000000000 +0400
+++ b/src/backend/access/heap/objfiles.txt 2026-05-26 16:48:57.688227823 +0400
@@ -0,0 +1 @@
+src/backend/access/heap/heapam.o src/backend/access/heap/heapam_handler.o src/backend/access/heap/heapam_visibility.o src/backend/access/heap/heapam_xlog.o src/backend/access/heap/heaptoast.o src/backend/access/heap/hio.o src/backend/access/heap/pruneheap.o src/backend/access/heap/rewriteheap.o src/backend/access/heap/vacuumlazy.o src/backend/access/heap/visibilitymap.o
--- a/src/backend/access/index/objfiles.txt 1970-01-01 04:00:00.000000000 +0400
+++ b/src/backend/access/index/objfiles.txt 2026-05-26 16:48:57.966796805 +0400
@@ -0,0 +1 @@
+src/backend/access/index/amapi.o src/backend/access/index/amvalidate.o src/backend/access/index/genam.o src/backend/access/index/indexam.o
--- a/src/backend/access/nbtree/objfiles.txt 1970-01-01 04:00:00.000000000 +0400
+++ b/src/backend/access/nbtree/objfiles.txt 2026-05-26 16:48:59.960199155 +0400
@@ -0,0 +1 @@
+src/backend/access/nbtree/nbtcompare.o src/backend/access/nbtree/nbtdedup.o src/backend/access/nbtree/nbtinsert.o src/backend/access/nbtree/nbtpage.o src/backend/access/nbtree/nbtpreprocesskeys.o src/backend/access/nbtree/nbtree.o src/backend/access/nbtree/nbtsearch.o src/backend/access/nbtree/nbtsort.o src/backend/access/nbtree/nbtsplitloc.o src/backend/access/nbtree/nbtutils.o src/backend/access/nbtree/nbtvalidate.o src/backend/access/nbtree/nbtxlog.o
--- a/src/backend/access/objfiles.txt 1970-01-01 04:00:00.000000000 +0400
+++ b/src/backend/access/objfiles.txt 2026-05-26 16:49:06.092121844 +0400
@@ -0,0 +1,15 @@
+src/backend/access/brin/brin.o src/backend/access/brin/brin_bloom.o src/backend/access/brin/brin_inclusion.o src/backend/access/brin/brin_minmax.o src/backend/access/brin/brin_minmax_multi.o src/backend/access/brin/brin_pageops.o src/backend/access/brin/brin_revmap.o src/backend/access/brin/brin_tuple.o src/backend/access/brin/brin_validate.o src/backend/access/brin/brin_xlog.o
+src/backend/access/common/attmap.o src/backend/access/common/bufmask.o src/backend/access/common/detoast.o src/backend/access/common/heaptuple.o src/backend/access/common/indextuple.o src/backend/access/common/printsimple.o src/backend/access/common/printtup.o src/backend/access/common/relation.o src/backend/access/common/reloptions.o src/backend/access/common/scankey.o src/backend/access/common/session.o src/backend/access/common/syncscan.o src/backend/access/common/tidstore.o src/backend/access/common/toast_compression.o src/backend/access/common/toast_internals.o src/backend/access/common/tupconvert.o src/backend/access/common/tupdesc.o
+src/backend/access/gin/ginarrayproc.o src/backend/access/gin/ginbtree.o src/backend/access/gin/ginbulk.o src/backend/access/gin/gindatapage.o src/backend/access/gin/ginentrypage.o src/backend/access/gin/ginfast.o src/backend/access/gin/ginget.o src/backend/access/gin/gininsert.o src/backend/access/gin/ginlogic.o src/backend/access/gin/ginpostinglist.o src/backend/access/gin/ginscan.o src/backend/access/gin/ginutil.o src/backend/access/gin/ginvacuum.o src/backend/access/gin/ginvalidate.o src/backend/access/gin/ginxlog.o
+src/backend/access/gist/gist.o src/backend/access/gist/gistbuild.o src/backend/access/gist/gistbuildbuffers.o src/backend/access/gist/gistget.o src/backend/access/gist/gistproc.o src/backend/access/gist/gistscan.o src/backend/access/gist/gistsplit.o src/backend/access/gist/gistutil.o src/backend/access/gist/gistvacuum.o src/backend/access/gist/gistvalidate.o src/backend/access/gist/gistxlog.o
+src/backend/access/hash/hash.o src/backend/access/hash/hash_xlog.o src/backend/access/hash/hashfunc.o src/backend/access/hash/hashinsert.o src/backend/access/hash/hashovfl.o src/backend/access/hash/hashpage.o src/backend/access/hash/hashsearch.o src/backend/access/hash/hashsort.o src/backend/access/hash/hashutil.o src/backend/access/hash/hashvalidate.o
+src/backend/access/heap/heapam.o src/backend/access/heap/heapam_handler.o src/backend/access/heap/heapam_visibility.o src/backend/access/heap/heapam_xlog.o src/backend/access/heap/heaptoast.o src/backend/access/heap/hio.o src/backend/access/heap/pruneheap.o src/backend/access/heap/rewriteheap.o src/backend/access/heap/vacuumlazy.o src/backend/access/heap/visibilitymap.o
+src/backend/access/index/amapi.o src/backend/access/index/amvalidate.o src/backend/access/index/genam.o src/backend/access/index/indexam.o
+src/backend/access/nbtree/nbtcompare.o src/backend/access/nbtree/nbtdedup.o src/backend/access/nbtree/nbtinsert.o src/backend/access/nbtree/nbtpage.o src/backend/access/nbtree/nbtpreprocesskeys.o src/backend/access/nbtree/nbtree.o src/backend/access/nbtree/nbtsearch.o src/backend/access/nbtree/nbtsort.o src/backend/access/nbtree/nbtsplitloc.o src/backend/access/nbtree/nbtutils.o src/backend/access/nbtree/nbtvalidate.o src/backend/access/nbtree/nbtxlog.o
+src/backend/access/rmgrdesc/brindesc.o src/backend/access/rmgrdesc/clogdesc.o src/backend/access/rmgrdesc/committsdesc.o src/backend/access/rmgrdesc/dbasedesc.o src/backend/access/rmgrdesc/genericdesc.o src/backend/access/rmgrdesc/gindesc.o src/backend/access/rmgrdesc/gistdesc.o src/backend/access/rmgrdesc/hashdesc.o src/backend/access/rmgrdesc/heapdesc.o src/backend/access/rmgrdesc/logicalmsgdesc.o src/backend/access/rmgrdesc/mxactdesc.o src/backend/access/rmgrdesc/nbtdesc.o src/backend/access/rmgrdesc/relmapdesc.o src/backend/access/rmgrdesc/replorigindesc.o src/backend/access/rmgrdesc/rmgrdesc_utils.o src/backend/access/rmgrdesc/seqdesc.o src/backend/access/rmgrdesc/smgrdesc.o src/backend/access/rmgrdesc/spgdesc.o src/backend/access/rmgrdesc/standbydesc.o src/backend/access/rmgrdesc/tblspcdesc.o src/backend/access/rmgrdesc/xactdesc.o src/backend/access/rmgrdesc/xlogdesc.o
+src/backend/access/spgist/spgdoinsert.o src/backend/access/spgist/spginsert.o src/backend/access/spgist/spgkdtreeproc.o src/backend/access/spgist/spgproc.o src/backend/access/spgist/spgquadtreeproc.o src/backend/access/spgist/spgscan.o src/backend/access/spgist/spgtextproc.o src/backend/access/spgist/spgutils.o src/backend/access/spgist/spgvacuum.o src/backend/access/spgist/spgvalidate.o src/backend/access/spgist/spgxlog.o
+src/backend/access/sequence/sequence.o
+src/backend/access/table/table.o src/backend/access/table/tableam.o src/backend/access/table/tableamapi.o src/backend/access/table/toast_helper.o
+src/backend/access/tablesample/bernoulli.o src/backend/access/tablesample/system.o src/backend/access/tablesample/tablesample.o
+src/backend/access/transam/clog.o src/backend/access/transam/commit_ts.o src/backend/access/transam/generic_xlog.o src/backend/access/transam/multixact.o src/backend/access/transam/parallel.o src/backend/access/transam/rmgr.o src/backend/access/transam/slru.o src/backend/access/transam/subtrans.o src/backend/access/transam/timeline.o src/backend/access/transam/transam.o src/backend/access/transam/twophase.o src/backend/access/transam/twophase_rmgr.o src/backend/access/transam/varsup.o src/backend/access/transam/xact.o src/backend/access/transam/xlog.o src/backend/access/transam/xlogarchive.o src/backend/access/transam/xlogbackup.o src/backend/access/transam/xlogfuncs.o src/backend/access/transam/xloginsert.o src/backend/access/transam/xlogprefetcher.o src/backend/access/transam/xlogreader.o src/backend/access/transam/xlogrecovery.o src/backend/access/transam/xlogstats.o src/backend/access/transam/xlogutils.o
+
--- a/src/backend/access/rmgrdesc/objfiles.txt 1970-01-01 04:00:00.000000000 +0400
+++ b/src/backend/access/rmgrdesc/objfiles.txt 2026-05-26 16:49:00.546742814 +0400
@@ -0,0 +1 @@
+src/backend/access/rmgrdesc/brindesc.o src/backend/access/rmgrdesc/clogdesc.o src/backend/access/rmgrdesc/committsdesc.o src/backend/access/rmgrdesc/dbasedesc.o src/backend/access/rmgrdesc/genericdesc.o src/backend/access/rmgrdesc/gindesc.o src/backend/access/rmgrdesc/gistdesc.o src/backend/access/rmgrdesc/hashdesc.o src/backend/access/rmgrdesc/heapdesc.o src/backend/access/rmgrdesc/logicalmsgdesc.o src/backend/access/rmgrdesc/mxactdesc.o src/backend/access/rmgrdesc/nbtdesc.o src/backend/access/rmgrdesc/relmapdesc.o src/backend/access/rmgrdesc/replorigindesc.o src/backend/access/rmgrdesc/rmgrdesc_utils.o src/backend/access/rmgrdesc/seqdesc.o src/backend/access/rmgrdesc/smgrdesc.o src/backend/access/rmgrdesc/spgdesc.o src/backend/access/rmgrdesc/standbydesc.o src/backend/access/rmgrdesc/tblspcdesc.o src/backend/access/rmgrdesc/xactdesc.o src/backend/access/rmgrdesc/xlogdesc.o
--- a/src/backend/access/sequence/objfiles.txt 1970-01-01 04:00:00.000000000 +0400
+++ b/src/backend/access/sequence/objfiles.txt 2026-05-26 16:49:01.800821932 +0400
@@ -0,0 +1 @@
+src/backend/access/sequence/sequence.o
--- a/src/backend/access/spgist/objfiles.txt 1970-01-01 04:00:00.000000000 +0400
+++ b/src/backend/access/spgist/objfiles.txt 2026-05-26 16:49:01.777215192 +0400
@@ -0,0 +1 @@
+src/backend/access/spgist/spgdoinsert.o src/backend/access/spgist/spginsert.o src/backend/access/spgist/spgkdtreeproc.o src/backend/access/spgist/spgproc.o src/backend/access/spgist/spgquadtreeproc.o src/backend/access/spgist/spgscan.o src/backend/access/spgist/spgtextproc.o src/backend/access/spgist/spgutils.o src/backend/access/spgist/spgvacuum.o src/backend/access/spgist/spgvalidate.o src/backend/access/spgist/spgxlog.o
--- a/src/backend/access/table/objfiles.txt 1970-01-01 04:00:00.000000000 +0400
+++ b/src/backend/access/table/objfiles.txt 2026-05-26 16:49:01.989167214 +0400
@@ -0,0 +1 @@
+src/backend/access/table/table.o src/backend/access/table/tableam.o src/backend/access/table/tableamapi.o src/backend/access/table/toast_helper.o
--- a/src/backend/access/tablesample/objfiles.txt 1970-01-01 04:00:00.000000000 +0400
+++ b/src/backend/access/tablesample/objfiles.txt 2026-05-26 16:49:02.121275103 +0400
@@ -0,0 +1 @@
+src/backend/access/tablesample/bernoulli.o src/backend/access/tablesample/system.o src/backend/access/tablesample/tablesample.o
--- a/src/backend/access/transam/objfiles.txt 1970-01-01 04:00:00.000000000 +0400
+++ b/src/backend/access/transam/objfiles.txt 2026-05-26 16:49:06.090443258 +0400
@@ -0,0 +1 @@
+src/backend/access/transam/clog.o src/backend/access/transam/commit_ts.o src/backend/access/transam/generic_xlog.o src/backend/access/transam/multixact.o src/backend/access/transam/parallel.o src/backend/access/transam/rmgr.o src/backend/access/transam/slru.o src/backend/access/transam/subtrans.o src/backend/access/transam/timeline.o src/backend/access/transam/transam.o src/backend/access/transam/twophase.o src/backend/access/transam/twophase_rmgr.o src/backend/access/transam/varsup.o src/backend/access/transam/xact.o src/backend/access/transam/xlog.o src/backend/access/transam/xlogarchive.o src/backend/access/transam/xlogbackup.o src/backend/access/transam/xlogfuncs.o src/backend/access/transam/xloginsert.o src/backend/access/transam/xlogprefetcher.o src/backend/access/transam/xlogreader.o src/backend/access/transam/xlogrecovery.o src/backend/access/transam/xlogstats.o src/backend/access/transam/xlogutils.o
--- a/src/backend/archive/objfiles.txt 1970-01-01 04:00:00.000000000 +0400
+++ b/src/backend/archive/objfiles.txt 2026-05-26 16:49:06.126884147 +0400
@@ -0,0 +1 @@
+src/backend/archive/shell_archive.o
--- a/src/backend/backup/objfiles.txt 1970-01-01 04:00:00.000000000 +0400
+++ b/src/backend/backup/objfiles.txt 2026-05-26 16:49:06.869620905 +0400
@@ -0,0 +1 @@
+src/backend/backup/backup_manifest.o src/backend/backup/basebackup.o src/backend/backup/basebackup_copy.o src/backend/backup/basebackup_gzip.o src/backend/backup/basebackup_incremental.o src/backend/backup/basebackup_lz4.o src/backend/backup/basebackup_zstd.o src/backend/backup/basebackup_progress.o src/backend/backup/basebackup_server.o src/backend/backup/basebackup_sink.o src/backend/backup/basebackup_target.o src/backend/backup/basebackup_throttle.o src/backend/backup/walsummary.o src/backend/backup/walsummaryfuncs.o
--- a/src/backend/bootstrap/bootparse.c 1970-01-01 04:00:00.000000000 +0400
+++ b/src/backend/bootstrap/bootparse.c 2026-05-26 16:49:06.900111663 +0400
@@ -0,0 +1,1992 @@
+/* A Bison parser, made by GNU Bison 3.8.2. */
+
+/* Bison implementation for Yacc-like parsers in C
+
+ Copyright (C) 1984, 1989-1990, 2000-2015, 2018-2021 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 <https://www.gnu.org/licenses/>. */
+
+/* As a special exception, you may create a larger work that contains
+ part or all of the Bison parser skeleton and distribute that work
+ under terms of your choice, so long as that work isn't itself a
+ parser generator using the skeleton or a modified version thereof
+ as a parser skeleton. Alternatively, if you modify or redistribute
+ the parser skeleton itself, you may (at your option) remove this
+ special exception, which will cause the skeleton and the resulting
+ Bison output files to be licensed under the GNU General Public
+ License without this special exception.
+
+ This special exception was added by the Free Software Foundation in
+ version 2.2 of Bison. */
+
+/* C LALR(1) parser skeleton written by Richard Stallman, by
+ simplifying the original so-called "semantic" parser. */
+
+/* DO NOT RELY ON FEATURES THAT ARE NOT DOCUMENTED in the manual,
+ especially those whose name start with YY_ or yy_. They are
+ private implementation details that can be changed or removed. */
+
+/* All symbols defined below should begin with yy or YY, to avoid
+ infringing on user name space. This should be done even for local
+ variables, as they might otherwise be expanded by user macros.
+ There are some unavoidable exceptions within include files to
+ define necessary library symbols; they are noted "INFRINGES ON
+ USER NAME SPACE" below. */
+
+/* Identify Bison output, and Bison version. */
+#define YYBISON 30802
+
+/* Bison version string. */
+#define YYBISON_VERSION "3.8.2"
+
+/* Skeleton name. */
+#define YYSKELETON_NAME "yacc.c"
+
+/* Pure parsers. */
+#define YYPURE 1
+
+/* 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
+
+/* First part of user prologue. */
+#line 1 "bootparse.y"
+
+/*-------------------------------------------------------------------------
+ *
+ * bootparse.y
+ * yacc grammar for the "bootstrap" mode (BKI file format)
+ *
+ * Portions Copyright (c) 1996-2025, PostgreSQL Global Development Group
+ * Portions Copyright (c) 1994, Regents of the University of California
+ *
+ *
+ * IDENTIFICATION
+ * src/backend/bootstrap/bootparse.y
+ *
+ *-------------------------------------------------------------------------
+ */
+
+#include "postgres.h"
+
+#include <unistd.h>
+
+#include "bootstrap/bootstrap.h"
+#include "catalog/heap.h"
+#include "catalog/namespace.h"
+#include "catalog/pg_am.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 "utils/memutils.h"
+
+#include "bootparse.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.
+ */
+#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 155 "bootparse.c"
+
+# ifndef YY_CAST
+# ifdef __cplusplus
+# define YY_CAST(Type, Val) static_cast<Type> (Val)
+# define YY_REINTERPRET_CAST(Type, Val) reinterpret_cast<Type> (Val)
+# else
+# define YY_CAST(Type, Val) ((Type) (Val))
+# define YY_REINTERPRET_CAST(Type, Val) ((Type) (Val))
+# endif
+# endif
+# 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
+
+#include "bootparse.h"
+/* Symbol kind. */
+enum yysymbol_kind_t
+{
+ YYSYMBOL_YYEMPTY = -2,
+ YYSYMBOL_YYEOF = 0, /* "end of file" */
+ YYSYMBOL_YYerror = 1, /* error */
+ YYSYMBOL_YYUNDEF = 2, /* "invalid token" */
+ YYSYMBOL_ID = 3, /* ID */
+ YYSYMBOL_COMMA = 4, /* COMMA */
+ YYSYMBOL_EQUALS = 5, /* EQUALS */
+ YYSYMBOL_LPAREN = 6, /* LPAREN */
+ YYSYMBOL_RPAREN = 7, /* RPAREN */
+ YYSYMBOL_NULLVAL = 8, /* NULLVAL */
+ YYSYMBOL_OPEN = 9, /* OPEN */
+ YYSYMBOL_XCLOSE = 10, /* XCLOSE */
+ YYSYMBOL_XCREATE = 11, /* XCREATE */
+ YYSYMBOL_INSERT_TUPLE = 12, /* INSERT_TUPLE */
+ YYSYMBOL_XDECLARE = 13, /* XDECLARE */
+ YYSYMBOL_INDEX = 14, /* INDEX */
+ YYSYMBOL_ON = 15, /* ON */
+ YYSYMBOL_USING = 16, /* USING */
+ YYSYMBOL_XBUILD = 17, /* XBUILD */
+ YYSYMBOL_INDICES = 18, /* INDICES */
+ YYSYMBOL_UNIQUE = 19, /* UNIQUE */
+ YYSYMBOL_XTOAST = 20, /* XTOAST */
+ YYSYMBOL_OBJ_ID = 21, /* OBJ_ID */
+ YYSYMBOL_XBOOTSTRAP = 22, /* XBOOTSTRAP */
+ YYSYMBOL_XSHARED_RELATION = 23, /* XSHARED_RELATION */
+ YYSYMBOL_XROWTYPE_OID = 24, /* XROWTYPE_OID */
+ YYSYMBOL_XFORCE = 25, /* XFORCE */
+ YYSYMBOL_XNOT = 26, /* XNOT */
+ YYSYMBOL_XNULL = 27, /* XNULL */
+ YYSYMBOL_YYACCEPT = 28, /* $accept */
+ YYSYMBOL_TopLevel = 29, /* TopLevel */
+ YYSYMBOL_Boot_Queries = 30, /* Boot_Queries */
+ YYSYMBOL_Boot_Query = 31, /* Boot_Query */
+ YYSYMBOL_Boot_OpenStmt = 32, /* Boot_OpenStmt */
+ YYSYMBOL_Boot_CloseStmt = 33, /* Boot_CloseStmt */
+ YYSYMBOL_Boot_CreateStmt = 34, /* Boot_CreateStmt */
+ YYSYMBOL_35_1 = 35, /* $@1 */
+ YYSYMBOL_36_2 = 36, /* $@2 */
+ YYSYMBOL_Boot_InsertStmt = 37, /* Boot_InsertStmt */
+ YYSYMBOL_38_3 = 38, /* $@3 */
+ YYSYMBOL_Boot_DeclareIndexStmt = 39, /* Boot_DeclareIndexStmt */
+ YYSYMBOL_Boot_DeclareUniqueIndexStmt = 40, /* Boot_DeclareUniqueIndexStmt */
+ YYSYMBOL_Boot_DeclareToastStmt = 41, /* Boot_DeclareToastStmt */
+ YYSYMBOL_Boot_BuildIndsStmt = 42, /* Boot_BuildIndsStmt */
+ YYSYMBOL_boot_index_params = 43, /* boot_index_params */
+ YYSYMBOL_boot_index_param = 44, /* boot_index_param */
+ YYSYMBOL_optbootstrap = 45, /* optbootstrap */
+ YYSYMBOL_optsharedrelation = 46, /* optsharedrelation */
+ YYSYMBOL_optrowtypeoid = 47, /* optrowtypeoid */
+ YYSYMBOL_boot_column_list = 48, /* boot_column_list */
+ YYSYMBOL_boot_column_def = 49, /* boot_column_def */
+ YYSYMBOL_boot_column_nullness = 50, /* boot_column_nullness */
+ YYSYMBOL_oidspec = 51, /* oidspec */
+ YYSYMBOL_boot_column_val_list = 52, /* boot_column_val_list */
+ YYSYMBOL_boot_column_val = 53, /* boot_column_val */
+ YYSYMBOL_boot_ident = 54 /* boot_ident */
+};
+typedef enum yysymbol_kind_t yysymbol_kind_t;
+
+
+
+
+#ifdef short
+# undef short
+#endif
+
+/* On compilers that do not define __PTRDIFF_MAX__ etc., make sure
+ <limits.h> and (if available) <stdint.h> are included
+ so that the code can choose integer types of a good width. */
+
+#ifndef __PTRDIFF_MAX__
+# include <limits.h> /* INFRINGES ON USER NAME SPACE */
+# if defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
+# include <stdint.h> /* INFRINGES ON USER NAME SPACE */
+# define YY_STDINT_H
+# endif
+#endif
+
+/* Narrow types that promote to a signed type and that can represent a
+ signed or unsigned integer of at least N bits. In tables they can
+ save space and decrease cache pressure. Promoting to a signed type
+ helps avoid bugs in integer arithmetic. */
+
+#ifdef __INT_LEAST8_MAX__
+typedef __INT_LEAST8_TYPE__ yytype_int8;
+#elif defined YY_STDINT_H
+typedef int_least8_t yytype_int8;
+#else
+typedef signed char yytype_int8;
+#endif
+
+#ifdef __INT_LEAST16_MAX__
+typedef __INT_LEAST16_TYPE__ yytype_int16;
+#elif defined YY_STDINT_H
+typedef int_least16_t yytype_int16;
+#else
+typedef short yytype_int16;
+#endif
+
+/* Work around bug in HP-UX 11.23, which defines these macros
+ incorrectly for preprocessor constants. This workaround can likely
+ be removed in 2023, as HPE has promised support for HP-UX 11.23
+ (aka HP-UX 11i v2) only through the end of 2022; see Table 2 of
+ <https://h20195.www2.hpe.com/V2/getpdf.aspx/4AA4-7673ENW.pdf>. */
+#ifdef __hpux
+# undef UINT_LEAST8_MAX
+# undef UINT_LEAST16_MAX
+# define UINT_LEAST8_MAX 255
+# define UINT_LEAST16_MAX 65535
+#endif
+
+#if defined __UINT_LEAST8_MAX__ && __UINT_LEAST8_MAX__ <= __INT_MAX__
+typedef __UINT_LEAST8_TYPE__ yytype_uint8;
+#elif (!defined __UINT_LEAST8_MAX__ && defined YY_STDINT_H \
+ && UINT_LEAST8_MAX <= INT_MAX)
+typedef uint_least8_t yytype_uint8;
+#elif !defined __UINT_LEAST8_MAX__ && UCHAR_MAX <= INT_MAX
+typedef unsigned char yytype_uint8;
+#else
+typedef short yytype_uint8;
+#endif
+
+#if defined __UINT_LEAST16_MAX__ && __UINT_LEAST16_MAX__ <= __INT_MAX__
+typedef __UINT_LEAST16_TYPE__ yytype_uint16;
+#elif (!defined __UINT_LEAST16_MAX__ && defined YY_STDINT_H \
+ && UINT_LEAST16_MAX <= INT_MAX)
+typedef uint_least16_t yytype_uint16;
+#elif !defined __UINT_LEAST16_MAX__ && USHRT_MAX <= INT_MAX
+typedef unsigned short yytype_uint16;
+#else
+typedef int yytype_uint16;
+#endif
+
+#ifndef YYPTRDIFF_T
+# if defined __PTRDIFF_TYPE__ && defined __PTRDIFF_MAX__
+# define YYPTRDIFF_T __PTRDIFF_TYPE__
+# define YYPTRDIFF_MAXIMUM __PTRDIFF_MAX__
+# elif defined PTRDIFF_MAX
+# ifndef ptrdiff_t
+# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
+# endif
+# define YYPTRDIFF_T ptrdiff_t
+# define YYPTRDIFF_MAXIMUM PTRDIFF_MAX
+# else
+# define YYPTRDIFF_T long
+# define YYPTRDIFF_MAXIMUM LONG_MAX
+# endif
+#endif
+
+#ifndef YYSIZE_T
+# ifdef __SIZE_TYPE__
+# define YYSIZE_T __SIZE_TYPE__
+# elif defined size_t
+# define YYSIZE_T size_t
+# elif defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
+# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
+# define YYSIZE_T size_t
+# else
+# define YYSIZE_T unsigned
+# endif
+#endif
+
+#define YYSIZE_MAXIMUM \
+ YY_CAST (YYPTRDIFF_T, \
+ (YYPTRDIFF_MAXIMUM < YY_CAST (YYSIZE_T, -1) \
+ ? YYPTRDIFF_MAXIMUM \
+ : YY_CAST (YYSIZE_T, -1)))
+
+#define YYSIZEOF(X) YY_CAST (YYPTRDIFF_T, sizeof (X))
+
+
+/* Stored state numbers (used for stacks). */
+typedef yytype_int8 yy_state_t;
+
+/* State numbers in computations. */
+typedef int yy_state_fast_t;
+
+#ifndef YY_
+# if defined YYENABLE_NLS && YYENABLE_NLS
+# if ENABLE_NLS
+# include <libintl.h> /* INFRINGES ON USER NAME SPACE */
+# define YY_(Msgid) dgettext ("bison-runtime", Msgid)
+# endif
+# endif
+# ifndef YY_
+# define YY_(Msgid) Msgid
+# endif
+#endif
+
+
+#ifndef YY_ATTRIBUTE_PURE
+# if defined __GNUC__ && 2 < __GNUC__ + (96 <= __GNUC_MINOR__)
+# define YY_ATTRIBUTE_PURE __attribute__ ((__pure__))
+# else
+# define YY_ATTRIBUTE_PURE
+# endif
+#endif
+
+#ifndef YY_ATTRIBUTE_UNUSED
+# if defined __GNUC__ && 2 < __GNUC__ + (7 <= __GNUC_MINOR__)
+# define YY_ATTRIBUTE_UNUSED __attribute__ ((__unused__))
+# else
+# define YY_ATTRIBUTE_UNUSED
+# endif
+#endif
+
+/* Suppress unused-variable warnings by "using" E. */
+#if ! defined lint || defined __GNUC__
+# define YY_USE(E) ((void) (E))
+#else
+# define YY_USE(E) /* empty */
+#endif
+
+/* Suppress an incorrect diagnostic about yylval being uninitialized. */
+#if defined __GNUC__ && ! defined __ICC && 406 <= __GNUC__ * 100 + __GNUC_MINOR__
+# if __GNUC__ * 100 + __GNUC_MINOR__ < 407
+# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
+ _Pragma ("GCC diagnostic push") \
+ _Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")
+# else
+# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
+ _Pragma ("GCC diagnostic push") \
+ _Pragma ("GCC diagnostic ignored \"-Wuninitialized\"") \
+ _Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"")
+# endif
+# 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 __cplusplus && defined __GNUC__ && ! defined __ICC && 6 <= __GNUC__
+# define YY_IGNORE_USELESS_CAST_BEGIN \
+ _Pragma ("GCC diagnostic push") \
+ _Pragma ("GCC diagnostic ignored \"-Wuseless-cast\"")
+# define YY_IGNORE_USELESS_CAST_END \
+ _Pragma ("GCC diagnostic pop")
+#endif
+#ifndef YY_IGNORE_USELESS_CAST_BEGIN
+# define YY_IGNORE_USELESS_CAST_BEGIN
+# define YY_IGNORE_USELESS_CAST_END
+#endif
+
+
+#define YY_ASSERT(E) ((void) (0 && (E)))
+
+#if !defined yyoverflow
+
+/* The parser invokes alloca or malloc; define the necessary symbols. */
+
+# ifdef YYSTACK_USE_ALLOCA
+# if YYSTACK_USE_ALLOCA
+# ifdef __GNUC__
+# define YYSTACK_ALLOC __builtin_alloca
+# elif defined __BUILTIN_VA_ARG_INCR
+# include <alloca.h> /* INFRINGES ON USER NAME SPACE */
+# elif defined _AIX
+# define YYSTACK_ALLOC __alloca
+# elif defined _MSC_VER
+# include <malloc.h> /* INFRINGES ON USER NAME SPACE */
+# define alloca _alloca
+# else
+# define YYSTACK_ALLOC alloca
+# if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS
+# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
+ /* Use EXIT_SUCCESS as a witness for stdlib.h. */
+# ifndef EXIT_SUCCESS
+# define EXIT_SUCCESS 0
+# endif
+# endif
+# endif
+# endif
+# endif
+
+# ifdef YYSTACK_ALLOC
+ /* Pacify GCC's 'empty if-body' warning. */
+# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
+# ifndef YYSTACK_ALLOC_MAXIMUM
+ /* The OS might guarantee only one guard page at the bottom of the stack,
+ and a page size can be as small as 4096 bytes. So we cannot safely
+ invoke alloca (N) if N exceeds 4096. Use a slightly smaller number
+ to allow for a few compiler-allocated temporary stack slots. */
+# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
+# endif
+# else
+# define YYSTACK_ALLOC YYMALLOC
+# define YYSTACK_FREE YYFREE
+# ifndef YYSTACK_ALLOC_MAXIMUM
+# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
+# endif
+# if (defined __cplusplus && ! defined EXIT_SUCCESS \
+ && ! ((defined YYMALLOC || defined malloc) \
+ && (defined YYFREE || defined free)))
+# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
+# ifndef EXIT_SUCCESS
+# define EXIT_SUCCESS 0
+# endif
+# endif
+# ifndef YYMALLOC
+# define YYMALLOC malloc
+# if ! defined malloc && ! defined EXIT_SUCCESS
+void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
+# endif
+# endif
+# ifndef YYFREE
+# define YYFREE free
+# if ! defined free && ! defined EXIT_SUCCESS
+void free (void *); /* INFRINGES ON USER NAME SPACE */
+# endif
+# endif
+# endif
+#endif /* !defined yyoverflow */
+
+#if (! defined yyoverflow \
+ && (! defined __cplusplus \
+ || (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
+
+/* A type that is properly aligned for any stack member. */
+union yyalloc
+{
+ yy_state_t yyss_alloc;
+ YYSTYPE yyvs_alloc;
+};
+
+/* The size of the maximum gap between one aligned stack and the next. */
+# define YYSTACK_GAP_MAXIMUM (YYSIZEOF (union yyalloc) - 1)
+
+/* The size of an array large to enough to hold all stacks, each with
+ N elements. */
+# define YYSTACK_BYTES(N) \
+ ((N) * (YYSIZEOF (yy_state_t) + YYSIZEOF (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 \
+ { \
+ YYPTRDIFF_T yynewbytes; \
+ YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \
+ Stack = &yyptr->Stack_alloc; \
+ yynewbytes = yystacksize * YYSIZEOF (*Stack) + YYSTACK_GAP_MAXIMUM; \
+ yyptr += yynewbytes / YYSIZEOF (*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, YY_CAST (YYSIZE_T, (Count)) * sizeof (*(Src)))
+# else
+# define YYCOPY(Dst, Src, Count) \
+ do \
+ { \
+ YYPTRDIFF_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
+
+/* YYMAXUTOK -- Last valid token kind. */
+#define YYMAXUTOK 282
+
+
+/* YYTRANSLATE(TOKEN-NUM) -- Symbol number corresponding to TOKEN-NUM
+ as returned by yylex, with out-of-bounds checking. */
+#define YYTRANSLATE(YYX) \
+ (0 <= (YYX) && (YYX) <= YYMAXUTOK \
+ ? YY_CAST (yysymbol_kind_t, yytranslate[YYX]) \
+ : YYSYMBOL_YYUNDEF)
+
+/* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM
+ as returned by yylex. */
+static const yytype_int8 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_int16 yyrline[] =
+{
+ 0, 117, 117, 118, 122, 123, 127, 128, 129, 130,
+ 131, 132, 133, 134, 138, 149, 159, 169, 158, 256,
+ 255, 274, 327, 380, 392, 402, 403, 407, 423, 424,
+ 428, 429, 433, 434, 438, 439, 443, 452, 453, 454,
+ 458, 462, 463, 464, 468, 470, 475, 476, 477, 478,
+ 479, 480, 481, 482, 483, 484, 485, 486, 487, 488,
+ 489, 490, 491, 492, 493, 494
+};
+#endif
+
+/** Accessing symbol of state STATE. */
+#define YY_ACCESSING_SYMBOL(State) YY_CAST (yysymbol_kind_t, yystos[State])
+
+#if YYDEBUG || 0
+/* The user-facing name of the symbol whose (internal) number is
+ YYSYMBOL. No bounds checking. */
+static const char *yysymbol_name (yysymbol_kind_t yysymbol) YY_ATTRIBUTE_UNUSED;
+
+/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
+ First, the terminals, then, starting at YYNTOKENS, nonterminals. */
+static const char *const yytname[] =
+{
+ "\"end of file\"", "error", "\"invalid token\"", "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
+};
+
+static const char *
+yysymbol_name (yysymbol_kind_t yysymbol)
+{
+ return yytname[yysymbol];
+}
+#endif
+
+#define YYPACT_NINF (-53)
+
+#define yypact_value_is_default(Yyn) \
+ ((Yyn) == YYPACT_NINF)
+
+#define YYTABLE_NINF (-1)
+
+#define yytable_value_is_error(Yyn) \
+ 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_int8 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[] =
+{
+ 0, 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_int8 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 symbol kind of the accessing symbol of
+ state STATE-NUM. */
+static const yytype_int8 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[RULE-NUM] -- Symbol kind of the left-hand side of rule RULE-NUM. */
+static const yytype_int8 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[RULE-NUM] -- Number of symbols on the right-hand side of rule RULE-NUM. */
+static const yytype_int8 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
+};
+
+
+enum { YYENOMEM = -2 };
+
+#define yyerrok (yyerrstatus = 0)
+#define yyclearin (yychar = YYEMPTY)
+
+#define YYACCEPT goto yyacceptlab
+#define YYABORT goto yyabortlab
+#define YYERROR goto yyerrorlab
+#define YYNOMEM goto yyexhaustedlab
+
+
+#define YYRECOVERING() (!!yyerrstatus)
+
+#define YYBACKUP(Token, Value) \
+ do \
+ if (yychar == YYEMPTY) \
+ { \
+ yychar = (Token); \
+ yylval = (Value); \
+ YYPOPSTACK (yylen); \
+ yystate = *yyssp; \
+ goto yybackup; \
+ } \
+ else \
+ { \
+ yyerror (yyscanner, YY_("syntax error: cannot back up")); \
+ YYERROR; \
+ } \
+ while (0)
+
+/* Backward compatibility with an undocumented macro.
+ Use YYerror or YYUNDEF. */
+#define YYERRCODE YYUNDEF
+
+
+/* Enable debugging if requested. */
+#if YYDEBUG
+
+# ifndef YYFPRINTF
+# include <stdio.h> /* INFRINGES ON USER NAME SPACE */
+# define YYFPRINTF fprintf
+# endif
+
+# define YYDPRINTF(Args) \
+do { \
+ if (yydebug) \
+ YYFPRINTF Args; \
+} while (0)
+
+
+
+
+# define YY_SYMBOL_PRINT(Title, Kind, Value, Location) \
+do { \
+ if (yydebug) \
+ { \
+ YYFPRINTF (stderr, "%s ", Title); \
+ yy_symbol_print (stderr, \
+ Kind, Value, yyscanner); \
+ YYFPRINTF (stderr, "\n"); \
+ } \
+} while (0)
+
+
+/*-----------------------------------.
+| Print this symbol's value on YYO. |
+`-----------------------------------*/
+
+static void
+yy_symbol_value_print (FILE *yyo,
+ yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep, yyscan_t yyscanner)
+{
+ FILE *yyoutput = yyo;
+ YY_USE (yyoutput);
+ YY_USE (yyscanner);
+ if (!yyvaluep)
+ return;
+ YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
+ YY_USE (yykind);
+ YY_IGNORE_MAYBE_UNINITIALIZED_END
+}
+
+
+/*---------------------------.
+| Print this symbol on YYO. |
+`---------------------------*/
+
+static void
+yy_symbol_print (FILE *yyo,
+ yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep, yyscan_t yyscanner)
+{
+ YYFPRINTF (yyo, "%s %s (",
+ yykind < YYNTOKENS ? "token" : "nterm", yysymbol_name (yykind));
+
+ yy_symbol_value_print (yyo, yykind, yyvaluep, yyscanner);
+ YYFPRINTF (yyo, ")");
+}
+
+/*------------------------------------------------------------------.
+| yy_stack_print -- Print the state stack from its BOTTOM up to its |
+| TOP (included). |
+`------------------------------------------------------------------*/
+
+static void
+yy_stack_print (yy_state_t *yybottom, yy_state_t *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 (yy_state_t *yyssp, YYSTYPE *yyvsp,
+ int yyrule, yyscan_t yyscanner)
+{
+ int yylno = yyrline[yyrule];
+ int yynrhs = yyr2[yyrule];
+ int yyi;
+ YYFPRINTF (stderr, "Reducing stack by rule %d (line %d):\n",
+ yyrule - 1, yylno);
+ /* The symbols being reduced. */
+ for (yyi = 0; yyi < yynrhs; yyi++)
+ {
+ YYFPRINTF (stderr, " $%d = ", yyi + 1);
+ yy_symbol_print (stderr,
+ YY_ACCESSING_SYMBOL (+yyssp[yyi + 1 - yynrhs]),
+ &yyvsp[(yyi + 1) - (yynrhs)], yyscanner);
+ YYFPRINTF (stderr, "\n");
+ }
+}
+
+# define YY_REDUCE_PRINT(Rule) \
+do { \
+ if (yydebug) \
+ yy_reduce_print (yyssp, yyvsp, Rule, yyscanner); \
+} while (0)
+
+/* Nonzero means print parse trace. It is left uninitialized so that
+ multiple parsers can coexist. */
+int yydebug;
+#else /* !YYDEBUG */
+# define YYDPRINTF(Args) ((void) 0)
+# define YY_SYMBOL_PRINT(Title, Kind, 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
+
+
+
+
+
+
+/*-----------------------------------------------.
+| Release the memory associated to this symbol. |
+`-----------------------------------------------*/
+
+static void
+yydestruct (const char *yymsg,
+ yysymbol_kind_t yykind, YYSTYPE *yyvaluep, yyscan_t yyscanner)
+{
+ YY_USE (yyvaluep);
+ YY_USE (yyscanner);
+ if (!yymsg)
+ yymsg = "Deleting";
+ YY_SYMBOL_PRINT (yymsg, yykind, yyvaluep, yylocationp);
+
+ YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
+ YY_USE (yykind);
+ YY_IGNORE_MAYBE_UNINITIALIZED_END
+}
+
+
+
+
+
+
+/*----------.
+| yyparse. |
+`----------*/
+
+int
+yyparse (yyscan_t yyscanner)
+{
+/* Lookahead token kind. */
+int yychar;
+
+
+/* The semantic value of the lookahead symbol. */
+/* Default value used for initialization, for pacifying older GCCs
+ or non-GCC compilers. */
+YY_INITIAL_VALUE (static YYSTYPE yyval_default;)
+YYSTYPE yylval YY_INITIAL_VALUE (= yyval_default);
+
+ /* Number of syntax errors so far. */
+ int yynerrs = 0;
+
+ yy_state_fast_t yystate = 0;
+ /* Number of tokens to shift before error messages enabled. */
+ int yyerrstatus = 0;
+
+ /* Refer to the stacks through separate pointers, to allow yyoverflow
+ to reallocate them elsewhere. */
+
+ /* Their size. */
+ YYPTRDIFF_T yystacksize = YYINITDEPTH;
+
+ /* The state stack: array, bottom, top. */
+ yy_state_t yyssa[YYINITDEPTH];
+ yy_state_t *yyss = yyssa;
+ yy_state_t *yyssp = yyss;
+
+ /* The semantic value stack: array, bottom, top. */
+ YYSTYPE yyvsa[YYINITDEPTH];
+ YYSTYPE *yyvs = yyvsa;
+ YYSTYPE *yyvsp = yyvs;
+
+ int yyn;
+ /* The return value of yyparse. */
+ int yyresult;
+ /* Lookahead symbol kind. */
+ yysymbol_kind_t yytoken = YYSYMBOL_YYEMPTY;
+ /* The variables used to return semantic value and location from the
+ action routines. */
+ YYSTYPE yyval;
+
+
+
+#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;
+
+ YYDPRINTF ((stderr, "Starting parse\n"));
+
+ yychar = YYEMPTY; /* Cause a token to be read. */
+
+ goto yysetstate;
+
+
+/*------------------------------------------------------------.
+| yynewstate -- push a new state, which is found in yystate. |
+`------------------------------------------------------------*/
+yynewstate:
+ /* In all cases, when you get here, the value and location stacks
+ have just been pushed. So pushing a state here evens the stacks. */
+ yyssp++;
+
+
+/*--------------------------------------------------------------------.
+| yysetstate -- set current state (the top of the stack) to yystate. |
+`--------------------------------------------------------------------*/
+yysetstate:
+ YYDPRINTF ((stderr, "Entering state %d\n", yystate));
+ YY_ASSERT (0 <= yystate && yystate < YYNSTATES);
+ YY_IGNORE_USELESS_CAST_BEGIN
+ *yyssp = YY_CAST (yy_state_t, yystate);
+ YY_IGNORE_USELESS_CAST_END
+ YY_STACK_PRINT (yyss, yyssp);
+
+ if (yyss + yystacksize - 1 <= yyssp)
+#if !defined yyoverflow && !defined YYSTACK_RELOCATE
+ YYNOMEM;
+#else
+ {
+ /* Get the current used size of the three stacks, in elements. */
+ YYPTRDIFF_T yysize = 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. */
+ yy_state_t *yyss1 = yyss;
+ YYSTYPE *yyvs1 = yyvs;
+
+ /* Each stack pointer address is followed by the size of the
+ data in use in that stack, in bytes. This used to be a
+ conditional around just the two extra args, but that might
+ be undefined if yyoverflow is a macro. */
+ yyoverflow (YY_("memory exhausted"),
+ &yyss1, yysize * YYSIZEOF (*yyssp),
+ &yyvs1, yysize * YYSIZEOF (*yyvsp),
+ &yystacksize);
+ yyss = yyss1;
+ yyvs = yyvs1;
+ }
+# else /* defined YYSTACK_RELOCATE */
+ /* Extend the stack our own way. */
+ if (YYMAXDEPTH <= yystacksize)
+ YYNOMEM;
+ yystacksize *= 2;
+ if (YYMAXDEPTH < yystacksize)
+ yystacksize = YYMAXDEPTH;
+
+ {
+ yy_state_t *yyss1 = yyss;
+ union yyalloc *yyptr =
+ YY_CAST (union yyalloc *,
+ YYSTACK_ALLOC (YY_CAST (YYSIZE_T, YYSTACK_BYTES (yystacksize))));
+ if (! yyptr)
+ YYNOMEM;
+ 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;
+
+ YY_IGNORE_USELESS_CAST_BEGIN
+ YYDPRINTF ((stderr, "Stack size increased to %ld\n",
+ YY_CAST (long, yystacksize)));
+ YY_IGNORE_USELESS_CAST_END
+
+ if (yyss + yystacksize - 1 <= yyssp)
+ YYABORT;
+ }
+#endif /* !defined yyoverflow && !defined YYSTACK_RELOCATE */
+
+
+ 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 empty, or end-of-input, or a valid lookahead. */
+ if (yychar == YYEMPTY)
+ {
+ YYDPRINTF ((stderr, "Reading a token\n"));
+ yychar = yylex (&yylval, yyscanner);
+ }
+
+ if (yychar <= YYEOF)
+ {
+ yychar = YYEOF;
+ yytoken = YYSYMBOL_YYEOF;
+ YYDPRINTF ((stderr, "Now at end of input.\n"));
+ }
+ else if (yychar == YYerror)
+ {
+ /* The scanner already issued an error message, process directly
+ to error recovery. But do not keep the error token as
+ lookahead, it is too special and may lead us to an endless
+ loop in error recovery. */
+ yychar = YYUNDEF;
+ yytoken = YYSYMBOL_YYerror;
+ goto yyerrlab1;
+ }
+ 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);
+ yystate = yyn;
+ YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
+ *++yyvsp = yylval;
+ YY_IGNORE_MAYBE_UNINITIALIZED_END
+
+ /* Discard the shifted token. */
+ yychar = YYEMPTY;
+ 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: /* Boot_OpenStmt: OPEN boot_ident */
+#line 139 "bootparse.y"
+ {
+ do_start();
+ boot_openrel((yyvsp[0].str));
+ do_end();
+
+ (void) yynerrs; /* suppress compiler warning */
+ }
+#line 1293 "bootparse.c"
+ break;
+
+ case 15: /* Boot_CloseStmt: XCLOSE boot_ident */
+#line 150 "bootparse.y"
+ {
+ do_start();
+ closerel((yyvsp[0].str));
+ do_end();
+ }
+#line 1303 "bootparse.c"
+ break;
+
+ case 16: /* $@1: %empty */
+#line 159 "bootparse.y"
+ {
+ 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 1317 "bootparse.c"
+ break;
+
+ case 17: /* $@2: %empty */
+#line 169 "bootparse.y"
+ {
+ do_end();
+ }
+#line 1325 "bootparse.c"
+ break;
+
+ case 18: /* Boot_CreateStmt: XCREATE boot_ident oidspec optbootstrap optsharedrelation optrowtypeoid LPAREN $@1 boot_column_list $@2 RPAREN */
+#line 173 "bootparse.y"
+ {
+ 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,
+ true);
+ 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 1409 "bootparse.c"
+ break;
+
+ case 19: /* $@3: %empty */
+#line 256 "bootparse.y"
+ {
+ do_start();
+ elog(DEBUG4, "inserting row");
+ num_columns_read = 0;
+ }
+#line 1419 "bootparse.c"
+ break;
+
+ case 20: /* Boot_InsertStmt: INSERT_TUPLE $@3 LPAREN boot_column_val_list RPAREN */
+#line 262 "bootparse.y"
+ {
+ 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 1433 "bootparse.c"
+ break;
+
+ case 21: /* Boot_DeclareIndexStmt: XDECLARE INDEX boot_ident oidspec ON boot_ident USING boot_ident LPAREN boot_index_params RPAREN */
+#line 275 "bootparse.y"
+ {
+ 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->oldNumber = InvalidRelFileNumber;
+ stmt->oldCreateSubid = InvalidSubTransactionId;
+ stmt->oldFirstRelfilelocatorSubid = 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,
+ -1,
+ false,
+ false,
+ false,
+ true, /* skip_build */
+ false);
+ do_end();
+ }
+#line 1487 "bootparse.c"
+ break;
+
+ case 22: /* Boot_DeclareUniqueIndexStmt: XDECLARE UNIQUE INDEX boot_ident oidspec ON boot_ident USING boot_ident LPAREN boot_index_params RPAREN */
+#line 328 "bootparse.y"
+ {
+ 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->oldNumber = InvalidRelFileNumber;
+ stmt->oldCreateSubid = InvalidSubTransactionId;
+ stmt->oldFirstRelfilelocatorSubid = 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,
+ -1,
+ false,
+ false,
+ false,
+ true, /* skip_build */
+ false);
+ do_end();
+ }
+#line 1541 "bootparse.c"
+ break;
+
+ case 23: /* Boot_DeclareToastStmt: XDECLARE XTOAST oidspec oidspec ON boot_ident */
+#line 381 "bootparse.y"
+ {
+ 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 1554 "bootparse.c"
+ break;
+
+ case 24: /* Boot_BuildIndsStmt: XBUILD INDICES */
+#line 393 "bootparse.y"
+ {
+ do_start();
+ build_indices();
+ do_end();
+ }
+#line 1564 "bootparse.c"
+ break;
+
+ case 25: /* boot_index_params: boot_index_params COMMA boot_index_param */
+#line 402 "bootparse.y"
+ { (yyval.list) = lappend((yyvsp[-2].list), (yyvsp[0].ielem)); }
+#line 1570 "bootparse.c"
+ break;
+
+ case 26: /* boot_index_params: boot_index_param */
+#line 403 "bootparse.y"
+ { (yyval.list) = list_make1((yyvsp[0].ielem)); }
+#line 1576 "bootparse.c"
+ break;
+
+ case 27: /* boot_index_param: boot_ident boot_ident */
+#line 408 "bootparse.y"
+ {
+ 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 1593 "bootparse.c"
+ break;
+
+ case 28: /* optbootstrap: XBOOTSTRAP */
+#line 423 "bootparse.y"
+ { (yyval.ival) = 1; }
+#line 1599 "bootparse.c"
+ break;
+
+ case 29: /* optbootstrap: %empty */
+#line 424 "bootparse.y"
+ { (yyval.ival) = 0; }
+#line 1605 "bootparse.c"
+ break;
+
+ case 30: /* optsharedrelation: XSHARED_RELATION */
+#line 428 "bootparse.y"
+ { (yyval.ival) = 1; }
+#line 1611 "bootparse.c"
+ break;
+
+ case 31: /* optsharedrelation: %empty */
+#line 429 "bootparse.y"
+ { (yyval.ival) = 0; }
+#line 1617 "bootparse.c"
+ break;
+
+ case 32: /* optrowtypeoid: XROWTYPE_OID oidspec */
+#line 433 "bootparse.y"
+ { (yyval.oidval) = (yyvsp[0].oidval); }
+#line 1623 "bootparse.c"
+ break;
+
+ case 33: /* optrowtypeoid: %empty */
+#line 434 "bootparse.y"
+ { (yyval.oidval) = InvalidOid; }
+#line 1629 "bootparse.c"
+ break;
+
+ case 36: /* boot_column_def: boot_ident EQUALS boot_ident boot_column_nullness */
+#line 444 "bootparse.y"
+ {
+ if (++numattr > MAXATTR)
+ elog(FATAL, "too many columns");
+ DefineAttr((yyvsp[-3].str), (yyvsp[-1].str), numattr-1, (yyvsp[0].ival));
+ }
+#line 1639 "bootparse.c"
+ break;
+
+ case 37: /* boot_column_nullness: XFORCE XNOT XNULL */
+#line 452 "bootparse.y"
+ { (yyval.ival) = BOOTCOL_NULL_FORCE_NOT_NULL; }
+#line 1645 "bootparse.c"
+ break;
+
+ case 38: /* boot_column_nullness: XFORCE XNULL */
+#line 453 "bootparse.y"
+ { (yyval.ival) = BOOTCOL_NULL_FORCE_NULL; }
+#line 1651 "bootparse.c"
+ break;
+
+ case 39: /* boot_column_nullness: %empty */
+#line 454 "bootparse.y"
+ { (yyval.ival) = BOOTCOL_NULL_AUTO; }
+#line 1657 "bootparse.c"
+ break;
+
+ case 40: /* oidspec: boot_ident */
+#line 458 "bootparse.y"
+ { (yyval.oidval) = atooid((yyvsp[0].str)); }
+#line 1663 "bootparse.c"
+ break;
+
+ case 44: /* boot_column_val: boot_ident */
+#line 469 "bootparse.y"
+ { InsertOneValue((yyvsp[0].str), num_columns_read++); }
+#line 1669 "bootparse.c"
+ break;
+
+ case 45: /* boot_column_val: NULLVAL */
+#line 471 "bootparse.y"
+ { InsertOneNull(num_columns_read++); }
+#line 1675 "bootparse.c"
+ break;
+
+ case 46: /* boot_ident: ID */
+#line 475 "bootparse.y"
+ { (yyval.str) = (yyvsp[0].str); }
+#line 1681 "bootparse.c"
+ break;
+
+ case 47: /* boot_ident: OPEN */
+#line 476 "bootparse.y"
+ { (yyval.str) = pstrdup((yyvsp[0].kw)); }
+#line 1687 "bootparse.c"
+ break;
+
+ case 48: /* boot_ident: XCLOSE */
+#line 477 "bootparse.y"
+ { (yyval.str) = pstrdup((yyvsp[0].kw)); }
+#line 1693 "bootparse.c"
+ break;
+
+ case 49: /* boot_ident: XCREATE */
+#line 478 "bootparse.y"
+ { (yyval.str) = pstrdup((yyvsp[0].kw)); }
+#line 1699 "bootparse.c"
+ break;
+
+ case 50: /* boot_ident: INSERT_TUPLE */
+#line 479 "bootparse.y"
+ { (yyval.str) = pstrdup((yyvsp[0].kw)); }
+#line 1705 "bootparse.c"
+ break;
+
+ case 51: /* boot_ident: XDECLARE */
+#line 480 "bootparse.y"
+ { (yyval.str) = pstrdup((yyvsp[0].kw)); }
+#line 1711 "bootparse.c"
+ break;
+
+ case 52: /* boot_ident: INDEX */
+#line 481 "bootparse.y"
+ { (yyval.str) = pstrdup((yyvsp[0].kw)); }
+#line 1717 "bootparse.c"
+ break;
+
+ case 53: /* boot_ident: ON */
+#line 482 "bootparse.y"
+ { (yyval.str) = pstrdup((yyvsp[0].kw)); }
+#line 1723 "bootparse.c"
+ break;
+
+ case 54: /* boot_ident: USING */
+#line 483 "bootparse.y"
+ { (yyval.str) = pstrdup((yyvsp[0].kw)); }
+#line 1729 "bootparse.c"
+ break;
+
+ case 55: /* boot_ident: XBUILD */
+#line 484 "bootparse.y"
+ { (yyval.str) = pstrdup((yyvsp[0].kw)); }
+#line 1735 "bootparse.c"
+ break;
+
+ case 56: /* boot_ident: INDICES */
+#line 485 "bootparse.y"
+ { (yyval.str) = pstrdup((yyvsp[0].kw)); }
+#line 1741 "bootparse.c"
+ break;
+
+ case 57: /* boot_ident: UNIQUE */
+#line 486 "bootparse.y"
+ { (yyval.str) = pstrdup((yyvsp[0].kw)); }
+#line 1747 "bootparse.c"
+ break;
+
+ case 58: /* boot_ident: XTOAST */
+#line 487 "bootparse.y"
+ { (yyval.str) = pstrdup((yyvsp[0].kw)); }
+#line 1753 "bootparse.c"
+ break;
+
+ case 59: /* boot_ident: OBJ_ID */
+#line 488 "bootparse.y"
+ { (yyval.str) = pstrdup((yyvsp[0].kw)); }
+#line 1759 "bootparse.c"
+ break;
+
+ case 60: /* boot_ident: XBOOTSTRAP */
+#line 489 "bootparse.y"
+ { (yyval.str) = pstrdup((yyvsp[0].kw)); }
+#line 1765 "bootparse.c"
+ break;
+
+ case 61: /* boot_ident: XSHARED_RELATION */
+#line 490 "bootparse.y"
+ { (yyval.str) = pstrdup((yyvsp[0].kw)); }
+#line 1771 "bootparse.c"
+ break;
+
+ case 62: /* boot_ident: XROWTYPE_OID */
+#line 491 "bootparse.y"
+ { (yyval.str) = pstrdup((yyvsp[0].kw)); }
+#line 1777 "bootparse.c"
+ break;
+
+ case 63: /* boot_ident: XFORCE */
+#line 492 "bootparse.y"
+ { (yyval.str) = pstrdup((yyvsp[0].kw)); }
+#line 1783 "bootparse.c"
+ break;
+
+ case 64: /* boot_ident: XNOT */
+#line 493 "bootparse.y"
+ { (yyval.str) = pstrdup((yyvsp[0].kw)); }
+#line 1789 "bootparse.c"
+ break;
+
+ case 65: /* boot_ident: XNULL */
+#line 494 "bootparse.y"
+ { (yyval.str) = pstrdup((yyvsp[0].kw)); }
+#line 1795 "bootparse.c"
+ break;
+
+
+#line 1799 "bootparse.c"
+
+ 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 ("-> $$ =", YY_CAST (yysymbol_kind_t, yyr1[yyn]), &yyval, &yyloc);
+
+ YYPOPSTACK (yylen);
+ yylen = 0;
+
+ *++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 ? YYSYMBOL_YYEMPTY : YYTRANSLATE (yychar);
+ /* If not already recovering from an error, report this error. */
+ if (!yyerrstatus)
+ {
+ ++yynerrs;
+ yyerror (yyscanner, YY_("syntax error"));
+ }
+
+ 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, yyscanner);
+ 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;
+ ++yynerrs;
+
+ /* 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. */
+
+ /* Pop stack until we find a state that shifts the error token. */
+ for (;;)
+ {
+ yyn = yypact[yystate];
+ if (!yypact_value_is_default (yyn))
+ {
+ yyn += YYSYMBOL_YYerror;
+ if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYSYMBOL_YYerror)
+ {
+ 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",
+ YY_ACCESSING_SYMBOL (yystate), yyvsp, yyscanner);
+ 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", YY_ACCESSING_SYMBOL (yyn), yyvsp, yylsp);
+
+ yystate = yyn;
+ goto yynewstate;
+
+
+/*-------------------------------------.
+| yyacceptlab -- YYACCEPT comes here. |
+`-------------------------------------*/
+yyacceptlab:
+ yyresult = 0;
+ goto yyreturnlab;
+
+
+/*-----------------------------------.
+| yyabortlab -- YYABORT comes here. |
+`-----------------------------------*/
+yyabortlab:
+ yyresult = 1;
+ goto yyreturnlab;
+
+
+/*-----------------------------------------------------------.
+| yyexhaustedlab -- YYNOMEM (memory exhaustion) comes here. |
+`-----------------------------------------------------------*/
+yyexhaustedlab:
+ yyerror (yyscanner, YY_("memory exhausted"));
+ yyresult = 2;
+ goto yyreturnlab;
+
+
+/*----------------------------------------------------------.
+| yyreturnlab -- parsing is finished, clean up and return. |
+`----------------------------------------------------------*/
+yyreturnlab:
+ 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, yyscanner);
+ }
+ /* 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",
+ YY_ACCESSING_SYMBOL (+*yyssp), yyvsp, yyscanner);
+ YYPOPSTACK (1);
+ }
+#ifndef yyoverflow
+ if (yyss != yyssa)
+ YYSTACK_FREE (yyss);
+#endif
+
+ return yyresult;
+}
+
+#line 496 "bootparse.y"
+
--- a/src/backend/bootstrap/bootparse.h 1970-01-01 04:00:00.000000000 +0400
+++ b/src/backend/bootstrap/bootparse.h 2026-05-26 16:49:06.900111663 +0400
@@ -0,0 +1,113 @@
+/* A Bison parser, made by GNU Bison 3.8.2. */
+
+/* Bison interface for Yacc-like parsers in C
+
+ Copyright (C) 1984, 1989-1990, 2000-2015, 2018-2021 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 <https://www.gnu.org/licenses/>. */
+
+/* As a special exception, you may create a larger work that contains
+ part or all of the Bison parser skeleton and distribute that work
+ under terms of your choice, so long as that work isn't itself a
+ parser generator using the skeleton or a modified version thereof
+ as a parser skeleton. Alternatively, if you modify or redistribute
+ the parser skeleton itself, you may (at your option) remove this
+ special exception, which will cause the skeleton and the resulting
+ Bison output files to be licensed under the GNU General Public
+ License without this special exception.
+
+ This special exception was added by the Free Software Foundation in
+ version 2.2 of Bison. */
+
+/* DO NOT RELY ON FEATURES THAT ARE NOT DOCUMENTED in the manual,
+ especially those whose name start with YY_ or yy_. They are
+ private implementation details that can be changed or removed. */
+
+#ifndef YY_BOOT_YY_BOOTPARSE_H_INCLUDED
+# define YY_BOOT_YY_BOOTPARSE_H_INCLUDED
+/* Debug traces. */
+#ifndef YYDEBUG
+# define YYDEBUG 0
+#endif
+#if YYDEBUG
+extern int boot_yydebug;
+#endif
+
+/* Token kinds. */
+#ifndef YYTOKENTYPE
+# define YYTOKENTYPE
+ enum yytokentype
+ {
+ YYEMPTY = -2,
+ YYEOF = 0, /* "end of file" */
+ YYerror = 256, /* error */
+ YYUNDEF = 257, /* "invalid token" */
+ ID = 258, /* ID */
+ COMMA = 259, /* COMMA */
+ EQUALS = 260, /* EQUALS */
+ LPAREN = 261, /* LPAREN */
+ RPAREN = 262, /* RPAREN */
+ NULLVAL = 263, /* NULLVAL */
+ OPEN = 264, /* OPEN */
+ XCLOSE = 265, /* XCLOSE */
+ XCREATE = 266, /* XCREATE */
+ INSERT_TUPLE = 267, /* INSERT_TUPLE */
+ XDECLARE = 268, /* XDECLARE */
+ INDEX = 269, /* INDEX */
+ ON = 270, /* ON */
+ USING = 271, /* USING */
+ XBUILD = 272, /* XBUILD */
+ INDICES = 273, /* INDICES */
+ UNIQUE = 274, /* UNIQUE */
+ XTOAST = 275, /* XTOAST */
+ OBJ_ID = 276, /* OBJ_ID */
+ XBOOTSTRAP = 277, /* XBOOTSTRAP */
+ XSHARED_RELATION = 278, /* XSHARED_RELATION */
+ XROWTYPE_OID = 279, /* XROWTYPE_OID */
+ XFORCE = 280, /* XFORCE */
+ XNOT = 281, /* XNOT */
+ XNULL = 282 /* XNULL */
+ };
+ typedef enum yytokentype yytoken_kind_t;
+#endif
+
+/* Value type. */
+#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
+union YYSTYPE
+{
+#line 87 "bootparse.y"
+
+ List *list;
+ IndexElem *ielem;
+ char *str;
+ const char *kw;
+ int ival;
+ Oid oidval;
+
+#line 100 "bootparse.h"
+
+};
+typedef union YYSTYPE YYSTYPE;
+# define YYSTYPE_IS_TRIVIAL 1
+# define YYSTYPE_IS_DECLARED 1
+#endif
+
+
+
+
+int boot_yyparse (yyscan_t yyscanner);
+
+
+#endif /* !YY_BOOT_YY_BOOTPARSE_H_INCLUDED */
--- a/src/backend/bootstrap/bootscanner.c 1970-01-01 04:00:00.000000000 +0400
+++ b/src/backend/bootstrap/bootscanner.c 2026-05-26 16:49:06.992110504 +0400
@@ -0,0 +1,2435 @@
+#line 2 "bootscanner.c"
+/*-------------------------------------------------------------------------
+ *
+ * bootscanner.l
+ * a lexical scanner for the bootstrap parser
+ *
+ * Portions Copyright (c) 1996-2025, PostgreSQL Global Development Group
+ * Portions Copyright (c) 1994, Regents of the University of California
+ *
+ *
+ * IDENTIFICATION
+ * src/backend/bootstrap/bootscanner.l
+ *
+ *-------------------------------------------------------------------------
+ */
+#include "postgres.h"
+
+/*
+ * NB: include bootparse.h only AFTER including bootstrap.h, because bootstrap.h
+ * includes node definitions needed for YYSTYPE.
+ */
+#include "bootstrap/bootstrap.h"
+#include "bootparse.h"
+#include "utils/guc.h"
+
+#line 27 "bootscanner.c"
+
+#define YY_INT_ALIGNED short int
+
+/* A lexical scanner generated by flex */
+
+#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 yyget_column
+#define boot_yyget_column_ALREADY_DEFINED
+#else
+#define yyget_column boot_yyget_column
+#endif
+
+#ifdef yyset_column
+#define boot_yyset_column_ALREADY_DEFINED
+#else
+#define yyset_column boot_yyset_column
+#endif
+
+#ifdef yywrap
+#define boot_yywrap_ALREADY_DEFINED
+#else
+#define yywrap boot_yywrap
+#endif
+
+#ifdef yyget_lval
+#define boot_yyget_lval_ALREADY_DEFINED
+#else
+#define yyget_lval boot_yyget_lval
+#endif
+
+#ifdef yyset_lval
+#define boot_yyset_lval_ALREADY_DEFINED
+#else
+#define yyset_lval boot_yyset_lval
+#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
+
+/* First, we deal with platform-specific or compiler-specific issues. */
+
+/* begin standard C headers. */
+#include <stdio.h>
+#include <string.h>
+#include <errno.h>
+#include <stdlib.h>
+
+/* end standard C headers. */
+
+/* flex integer type definitions */
+
+#ifndef FLEXINT_H
+#define FLEXINT_H
+
+/* C99 systems have <inttypes.h>. 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 <inttypes.h>
+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))
+
+/* An opaque pointer. */
+#ifndef YY_TYPEDEF_YY_SCANNER_T
+#define YY_TYPEDEF_YY_SCANNER_T
+typedef void* yyscan_t;
+#endif
+
+/* For convenience, these vars (plus the bison vars far below)
+ are macros in the reentrant scanner. */
+#define yyin yyg->yyin_r
+#define yyout yyg->yyout_r
+#define yyextra yyg->yyextra_r
+#define yyleng yyg->yyleng_r
+#define yytext yyg->yytext_r
+#define yylineno (YY_CURRENT_BUFFER_LVALUE->yy_bs_lineno)
+#define yycolumn (YY_CURRENT_BUFFER_LVALUE->yy_bs_column)
+#define yy_flex_debug yyg->yy_flex_debug_r
+
+/* 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 yyg->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 ((yyg->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 , yyscanner )
+#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
+
+#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 = yyg->yy_hold_char; \
+ YY_RESTORE_YY_MORE_OFFSET \
+ yyg->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, yyg->yytext_ptr , yyscanner )
+
+#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 */
+
+/* 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 ( yyg->yy_buffer_stack \
+ ? yyg->yy_buffer_stack[yyg->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 yyg->yy_buffer_stack[yyg->yy_buffer_stack_top]
+
+void yyrestart ( FILE *input_file , yyscan_t yyscanner );
+void yy_switch_to_buffer ( YY_BUFFER_STATE new_buffer , yyscan_t yyscanner );
+YY_BUFFER_STATE yy_create_buffer ( FILE *file, int size , yyscan_t yyscanner );
+void yy_delete_buffer ( YY_BUFFER_STATE b , yyscan_t yyscanner );
+void yy_flush_buffer ( YY_BUFFER_STATE b , yyscan_t yyscanner );
+void yypush_buffer_state ( YY_BUFFER_STATE new_buffer , yyscan_t yyscanner );
+void yypop_buffer_state ( yyscan_t yyscanner );
+
+static void yyensure_buffer_stack ( yyscan_t yyscanner );
+static void yy_load_buffer_state ( yyscan_t yyscanner );
+static void yy_init_buffer ( YY_BUFFER_STATE b, FILE *file , yyscan_t yyscanner );
+#define YY_FLUSH_BUFFER yy_flush_buffer( YY_CURRENT_BUFFER , yyscanner)
+
+YY_BUFFER_STATE yy_scan_buffer ( char *base, yy_size_t size , yyscan_t yyscanner );
+YY_BUFFER_STATE yy_scan_string ( const char *yy_str , yyscan_t yyscanner );
+YY_BUFFER_STATE yy_scan_bytes ( const char *bytes, int len , yyscan_t yyscanner );
+
+void *yyalloc ( yy_size_t , yyscan_t yyscanner );
+void *yyrealloc ( void *, yy_size_t , yyscan_t yyscanner );
+void yyfree ( void * , yyscan_t yyscanner );
+
+#define yy_new_buffer yy_create_buffer
+#define yy_set_interactive(is_interactive) \
+ { \
+ if ( ! YY_CURRENT_BUFFER ){ \
+ yyensure_buffer_stack (yyscanner); \
+ YY_CURRENT_BUFFER_LVALUE = \
+ yy_create_buffer( yyin, YY_BUF_SIZE , yyscanner); \
+ } \
+ YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
+ }
+#define yy_set_bol(at_bol) \
+ { \
+ if ( ! YY_CURRENT_BUFFER ){\
+ yyensure_buffer_stack (yyscanner); \
+ YY_CURRENT_BUFFER_LVALUE = \
+ yy_create_buffer( yyin, YY_BUF_SIZE , yyscanner); \
+ } \
+ 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(yyscanner) (/*CONSTCOND*/1)
+#define YY_SKIP_YYWRAP
+typedef flex_uint8_t YY_CHAR;
+
+typedef int yy_state_type;
+
+#define yytext_ptr yytext_r
+
+static yy_state_type yy_get_previous_state ( yyscan_t yyscanner );
+static yy_state_type yy_try_NUL_trans ( yy_state_type current_state , yyscan_t yyscanner);
+static int yy_get_next_buffer ( yyscan_t yyscanner );
+static void yynoreturn yy_fatal_error ( const char* msg , yyscan_t yyscanner );
+
+/* Done after the current pattern has been matched and before the
+ * corresponding action - sets up yytext.
+ */
+#define YY_DO_BEFORE_ACTION \
+ yyg->yytext_ptr = yy_bp; \
+ yyleng = (int) (yy_cp - yy_bp); \
+ yyg->yy_hold_char = *yy_cp; \
+ *yy_cp = '\0'; \
+ yyg->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, 1, 4, 1, 1, 1, 5, 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, 145, 148, 150, 150, 150, 142, 150, 150, 150,
+ 0, 150, 128, 25, 130, 112, 11, 16, 116, 110,
+ 17, 108, 111, 106, 16, 0, 133, 132, 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, 150, 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[193] =
+ { 0,
+ 4, 5, 6, 4, 7, 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, 27, 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[193] =
+ { 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, 28, 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
+
+ } ;
+
+/* 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
+#line 1 "bootscanner.l"
+
+#line 29 "bootscanner.l"
+
+/* 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)));
+}
+
+#line 767 "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 780 "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 <unistd.h>
+#endif
+
+#ifndef YY_EXTRA_TYPE
+#define YY_EXTRA_TYPE void *
+#endif
+
+/* Holds the entire state of the reentrant scanner. */
+struct yyguts_t
+ {
+
+ /* User-defined. Not touched by flex. */
+ YY_EXTRA_TYPE yyextra_r;
+
+ /* The rest are the same as the globals declared in the non-reentrant scanner. */
+ FILE *yyin_r, *yyout_r;
+ size_t yy_buffer_stack_top; /**< index of top of stack. */
+ size_t yy_buffer_stack_max; /**< capacity of stack. */
+ YY_BUFFER_STATE * yy_buffer_stack; /**< Stack as an array. */
+ char yy_hold_char;
+ int yy_n_chars;
+ int yyleng_r;
+ char *yy_c_buf_p;
+ int yy_init;
+ int yy_start;
+ int yy_did_buffer_switch_on_eof;
+ int yy_start_stack_ptr;
+ int yy_start_stack_depth;
+ int *yy_start_stack;
+ yy_state_type yy_last_accepting_state;
+ char* yy_last_accepting_cpos;
+
+ int yylineno_r;
+ int yy_flex_debug_r;
+
+ char *yytext_r;
+ int yy_more_flag;
+ int yy_more_len;
+
+ YYSTYPE * yylval_r;
+
+ }; /* end struct yyguts_t */
+
+static int yy_init_globals ( yyscan_t yyscanner );
+
+ /* This must go here because YYSTYPE and YYLTYPE are included
+ * from bison output in section 1.*/
+ # define yylval yyg->yylval_r
+
+int yylex_init (yyscan_t* scanner);
+
+int yylex_init_extra ( YY_EXTRA_TYPE user_defined, yyscan_t* scanner);
+
+/* Accessor methods to globals.
+ These are made visible to non-reentrant scanners for convenience. */
+
+int yylex_destroy ( yyscan_t yyscanner );
+
+int yyget_debug ( yyscan_t yyscanner );
+
+void yyset_debug ( int debug_flag , yyscan_t yyscanner );
+
+YY_EXTRA_TYPE yyget_extra ( yyscan_t yyscanner );
+
+void yyset_extra ( YY_EXTRA_TYPE user_defined , yyscan_t yyscanner );
+
+FILE *yyget_in ( yyscan_t yyscanner );
+
+void yyset_in ( FILE * _in_str , yyscan_t yyscanner );
+
+FILE *yyget_out ( yyscan_t yyscanner );
+
+void yyset_out ( FILE * _out_str , yyscan_t yyscanner );
+
+ int yyget_leng ( yyscan_t yyscanner );
+
+char *yyget_text ( yyscan_t yyscanner );
+
+int yyget_lineno ( yyscan_t yyscanner );
+
+void yyset_lineno ( int _line_number , yyscan_t yyscanner );
+
+int yyget_column ( yyscan_t yyscanner );
+
+void yyset_column ( int _column_no , yyscan_t yyscanner );
+
+YYSTYPE * yyget_lval ( yyscan_t yyscanner );
+
+void yyset_lval ( YYSTYPE * yylval_param , yyscan_t yyscanner );
+
+/* Macros after this point can all be overridden by user definitions in
+ * section 1.
+ */
+
+#ifndef YY_SKIP_YYWRAP
+#ifdef __cplusplus
+extern "C" int yywrap ( yyscan_t yyscanner );
+#else
+extern int yywrap ( yyscan_t yyscanner );
+#endif
+#endif
+
+#ifndef YY_NO_UNPUT
+
+#endif
+
+#ifndef yytext_ptr
+static void yy_flex_strncpy ( char *, const char *, int , yyscan_t yyscanner);
+#endif
+
+#ifdef YY_NEED_STRLEN
+static int yy_flex_strlen ( const char * , yyscan_t yyscanner);
+#endif
+
+#ifndef YY_NO_INPUT
+#ifdef __cplusplus
+static int yyinput ( yyscan_t yyscanner );
+#else
+static int input ( yyscan_t yyscanner );
+#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 , yyscanner)
+#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 \
+ (YYSTYPE * yylval_param , yyscan_t yyscanner);
+
+#define YY_DECL int yylex \
+ (YYSTYPE * yylval_param , yyscan_t yyscanner)
+#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;
+ struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+ yylval = yylval_param;
+
+ if ( !yyg->yy_init )
+ {
+ yyg->yy_init = 1;
+
+#ifdef YY_USER_INIT
+ YY_USER_INIT;
+#endif
+
+ if ( ! yyg->yy_start )
+ yyg->yy_start = 1; /* first start state */
+
+ if ( ! yyin )
+ yyin = stdin;
+
+ if ( ! yyout )
+ yyout = stdout;
+
+ if ( ! YY_CURRENT_BUFFER ) {
+ yyensure_buffer_stack (yyscanner);
+ YY_CURRENT_BUFFER_LVALUE =
+ yy_create_buffer( yyin, YY_BUF_SIZE , yyscanner);
+ }
+
+ yy_load_buffer_state( yyscanner );
+ }
+
+ {
+#line 74 "bootscanner.l"
+
+
+#line 1058 "bootscanner.c"
+
+ while ( /*CONSTCOND*/1 ) /* loops until end-of-file is reached */
+ {
+ yy_cp = yyg->yy_c_buf_p;
+
+ /* Support of yytext. */
+ *yy_cp = yyg->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 = yyg->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] )
+ {
+ yyg->yy_last_accepting_state = yy_current_state;
+ yyg->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 = yyg->yy_last_accepting_cpos;
+ yy_current_state = yyg->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 = yyg->yy_hold_char;
+ yy_cp = yyg->yy_last_accepting_cpos;
+ yy_current_state = yyg->yy_last_accepting_state;
+ goto yy_find_action;
+
+case 1:
+YY_RULE_SETUP
+#line 76 "bootscanner.l"
+{ yylval->kw = "open"; return OPEN; }
+ YY_BREAK
+case 2:
+YY_RULE_SETUP
+#line 78 "bootscanner.l"
+{ yylval->kw = "close"; return XCLOSE; }
+ YY_BREAK
+case 3:
+YY_RULE_SETUP
+#line 80 "bootscanner.l"
+{ yylval->kw = "create"; return XCREATE; }
+ YY_BREAK
+case 4:
+YY_RULE_SETUP
+#line 82 "bootscanner.l"
+{ yylval->kw = "OID"; return OBJ_ID; }
+ YY_BREAK
+case 5:
+YY_RULE_SETUP
+#line 83 "bootscanner.l"
+{ yylval->kw = "bootstrap"; return XBOOTSTRAP; }
+ YY_BREAK
+case 6:
+YY_RULE_SETUP
+#line 84 "bootscanner.l"
+{ yylval->kw = "shared_relation"; return XSHARED_RELATION; }
+ YY_BREAK
+case 7:
+YY_RULE_SETUP
+#line 85 "bootscanner.l"
+{ yylval->kw = "rowtype_oid"; return XROWTYPE_OID; }
+ YY_BREAK
+case 8:
+YY_RULE_SETUP
+#line 87 "bootscanner.l"
+{ yylval->kw = "insert"; return INSERT_TUPLE; }
+ YY_BREAK
+case 9:
+YY_RULE_SETUP
+#line 89 "bootscanner.l"
+{ return NULLVAL; }
+ YY_BREAK
+case 10:
+YY_RULE_SETUP
+#line 91 "bootscanner.l"
+{ return COMMA; }
+ YY_BREAK
+case 11:
+YY_RULE_SETUP
+#line 92 "bootscanner.l"
+{ return EQUALS; }
+ YY_BREAK
+case 12:
+YY_RULE_SETUP
+#line 93 "bootscanner.l"
+{ return LPAREN; }
+ YY_BREAK
+case 13:
+YY_RULE_SETUP
+#line 94 "bootscanner.l"
+{ return RPAREN; }
+ YY_BREAK
+case 14:
+/* rule 14 can match eol */
+YY_RULE_SETUP
+#line 96 "bootscanner.l"
+{ yylineno++; }
+ YY_BREAK
+case 15:
+YY_RULE_SETUP
+#line 97 "bootscanner.l"
+;
+ YY_BREAK
+case 16:
+YY_RULE_SETUP
+#line 99 "bootscanner.l"
+; /* drop everything after "#" for comments */
+ YY_BREAK
+case 17:
+YY_RULE_SETUP
+#line 101 "bootscanner.l"
+{ yylval->kw = "declare"; return XDECLARE; }
+ YY_BREAK
+case 18:
+YY_RULE_SETUP
+#line 102 "bootscanner.l"
+{ yylval->kw = "build"; return XBUILD; }
+ YY_BREAK
+case 19:
+YY_RULE_SETUP
+#line 103 "bootscanner.l"
+{ yylval->kw = "indices"; return INDICES; }
+ YY_BREAK
+case 20:
+YY_RULE_SETUP
+#line 104 "bootscanner.l"
+{ yylval->kw = "unique"; return UNIQUE; }
+ YY_BREAK
+case 21:
+YY_RULE_SETUP
+#line 105 "bootscanner.l"
+{ yylval->kw = "index"; return INDEX; }
+ YY_BREAK
+case 22:
+YY_RULE_SETUP
+#line 106 "bootscanner.l"
+{ yylval->kw = "on"; return ON; }
+ YY_BREAK
+case 23:
+YY_RULE_SETUP
+#line 107 "bootscanner.l"
+{ yylval->kw = "using"; return USING; }
+ YY_BREAK
+case 24:
+YY_RULE_SETUP
+#line 108 "bootscanner.l"
+{ yylval->kw = "toast"; return XTOAST; }
+ YY_BREAK
+case 25:
+YY_RULE_SETUP
+#line 109 "bootscanner.l"
+{ yylval->kw = "FORCE"; return XFORCE; }
+ YY_BREAK
+case 26:
+YY_RULE_SETUP
+#line 110 "bootscanner.l"
+{ yylval->kw = "NOT"; return XNOT; }
+ YY_BREAK
+case 27:
+YY_RULE_SETUP
+#line 111 "bootscanner.l"
+{ yylval->kw = "NULL"; return XNULL; }
+ YY_BREAK
+case 28:
+YY_RULE_SETUP
+#line 113 "bootscanner.l"
+{
+ yylval->str = pstrdup(yytext);
+ return ID;
+ }
+ YY_BREAK
+case 29:
+/* rule 29 can match eol */
+YY_RULE_SETUP
+#line 117 "bootscanner.l"
+{
+ /* strip quotes and escapes */
+ yylval->str = DeescapeQuotedString(yytext);
+ return ID;
+ }
+ YY_BREAK
+case 30:
+YY_RULE_SETUP
+#line 123 "bootscanner.l"
+{
+ elog(ERROR, "syntax error at line %d: unexpected character \"%s\"", yylineno, yytext);
+ }
+ YY_BREAK
+case 31:
+YY_RULE_SETUP
+#line 127 "bootscanner.l"
+YY_FATAL_ERROR( "flex scanner jammed" );
+ YY_BREAK
+#line 1278 "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 - yyg->yytext_ptr) - 1;
+
+ /* Undo the effects of YY_DO_BEFORE_ACTION. */
+ *yy_cp = yyg->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.
+ */
+ yyg->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 ( yyg->yy_c_buf_p <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] )
+ { /* This was really a NUL. */
+ yy_state_type yy_next_state;
+
+ yyg->yy_c_buf_p = yyg->yytext_ptr + yy_amount_of_matched_text;
+
+ yy_current_state = yy_get_previous_state( yyscanner );
+
+ /* 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 , yyscan
[truncated 20907506 bytes]