aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorTom Lane <tgl@sss.pgh.pa.us>2018-05-21 11:21:08 -0400
committerTom Lane <tgl@sss.pgh.pa.us>2018-05-21 11:21:08 -0400
commit3f5e3a98443c7f437465d79e4b99a0a661ae1b9b (patch)
treed3c3350cd6751fe8bc38d8b0e49f652142c2185d
parent3ce7f72529f5829f73e18240740bafc939b650b5 (diff)
downloadpostgresql-3f5e3a98443c7f437465d79e4b99a0a661ae1b9b.tar.gz
postgresql-3f5e3a98443c7f437465d79e4b99a0a661ae1b9b.zip
Doc: fix bogus cross-reference link.
An xref to a <para>'s ID isn't very helpful because paras don't have names. This causes a warning while building PDFs, though for some reason not while building HTML. The link arguably went to the wrong place, too. To fix, introduce a sub-section we can reference.
-rw-r--r--doc/src/sgml/jit.sgml6
-rw-r--r--doc/src/sgml/storage.sgml10
2 files changed, 10 insertions, 6 deletions
diff --git a/doc/src/sgml/jit.sgml b/doc/src/sgml/jit.sgml
index fc841337c36..bcff1174082 100644
--- a/doc/src/sgml/jit.sgml
+++ b/doc/src/sgml/jit.sgml
@@ -58,9 +58,9 @@
</para>
<para>
Tuple deforming is the process of transforming an on-disk tuple (see <xref
- linkend="heaptuple"/>) into its in-memory representation. It can be
- accelerated by creating a function specific to the table layout and the
- number of columns to be extracted.
+ linkend="storage-tuple-layout"/>) into its in-memory representation.
+ It can be accelerated by creating a function specific to the table layout
+ and the number of columns to be extracted.
</para>
</sect2>
diff --git a/doc/src/sgml/storage.sgml b/doc/src/sgml/storage.sgml
index 70a822e0597..8ef2ac80106 100644
--- a/doc/src/sgml/storage.sgml
+++ b/doc/src/sgml/storage.sgml
@@ -875,8 +875,7 @@ data. Empty in ordinary tables.</entry>
<filename>src/include/storage/bufpage.h</filename>.
</para>
- <para id="heaptuple">
-
+ <para>
Following the page header are item identifiers
(<type>ItemIdData</type>), each requiring four bytes.
An item identifier contains a byte-offset to
@@ -909,7 +908,7 @@ data. Empty in ordinary tables.</entry>
<para>
The final section is the <quote>special section</quote> which can
- contain anything the access method wishes to store. For example,
+ contain anything the access method wishes to store. For example,
b-tree indexes store links to the page's left and right siblings,
as well as some other data relevant to the index structure.
Ordinary tables do not use a special section at all (indicated by setting
@@ -917,6 +916,10 @@ data. Empty in ordinary tables.</entry>
</para>
+ <sect2 id="storage-tuple-layout">
+
+ <title>Table Row Layout</title>
+
<para>
All table rows are structured in the same way. There is a fixed-size
@@ -1040,6 +1043,7 @@ data. Empty in ordinary tables.</entry>
it might be compressed, too (see <xref linkend="storage-toast"/>).
</para>
+ </sect2>
</sect1>
</chapter>