PostgreSQL Source Code  git master
toasting.c
Go to the documentation of this file.
1 /*-------------------------------------------------------------------------
2  *
3  * toasting.c
4  * This file contains routines to support creation of toast tables
5  *
6  *
7  * Portions Copyright (c) 1996-2023, PostgreSQL Global Development Group
8  * Portions Copyright (c) 1994, Regents of the University of California
9  *
10  * IDENTIFICATION
11  * src/backend/catalog/toasting.c
12  *
13  *-------------------------------------------------------------------------
14  */
15 #include "postgres.h"
16 
17 #include "access/heapam.h"
19 #include "access/xact.h"
20 #include "catalog/binary_upgrade.h"
21 #include "catalog/catalog.h"
22 #include "catalog/dependency.h"
23 #include "catalog/heap.h"
24 #include "catalog/index.h"
25 #include "catalog/namespace.h"
26 #include "catalog/pg_am.h"
27 #include "catalog/pg_namespace.h"
28 #include "catalog/pg_opclass.h"
29 #include "catalog/pg_type.h"
30 #include "catalog/toasting.h"
31 #include "miscadmin.h"
32 #include "nodes/makefuncs.h"
33 #include "storage/lock.h"
34 #include "utils/builtins.h"
35 #include "utils/rel.h"
36 #include "utils/syscache.h"
37 
38 static void CheckAndCreateToastTable(Oid relOid, Datum reloptions,
39  LOCKMODE lockmode, bool check,
40  Oid OIDOldToast);
41 static bool create_toast_table(Relation rel, Oid toastOid, Oid toastIndexOid,
42  Datum reloptions, LOCKMODE lockmode, bool check,
43  Oid OIDOldToast);
44 static bool needs_toast_table(Relation rel);
45 
46 
47 /*
48  * CreateToastTable variants
49  * If the table needs a toast table, and doesn't already have one,
50  * then create a toast table for it.
51  *
52  * reloptions for the toast table can be passed, too. Pass (Datum) 0
53  * for default reloptions.
54  *
55  * We expect the caller to have verified that the relation is a table and have
56  * already done any necessary permission checks. Callers expect this function
57  * to end with CommandCounterIncrement if it makes any changes.
58  */
59 void
60 AlterTableCreateToastTable(Oid relOid, Datum reloptions, LOCKMODE lockmode)
61 {
62  CheckAndCreateToastTable(relOid, reloptions, lockmode, true, InvalidOid);
63 }
64 
65 void
66 NewHeapCreateToastTable(Oid relOid, Datum reloptions, LOCKMODE lockmode,
67  Oid OIDOldToast)
68 {
69  CheckAndCreateToastTable(relOid, reloptions, lockmode, false, OIDOldToast);
70 }
71 
72 void
74 {
75  CheckAndCreateToastTable(relOid, reloptions, AccessExclusiveLock, false,
76  InvalidOid);
77 }
78 
79 static void
80 CheckAndCreateToastTable(Oid relOid, Datum reloptions, LOCKMODE lockmode,
81  bool check, Oid OIDOldToast)
82 {
83  Relation rel;
84 
85  rel = table_open(relOid, lockmode);
86 
87  /* create_toast_table does all the work */
88  (void) create_toast_table(rel, InvalidOid, InvalidOid, reloptions, lockmode,
89  check, OIDOldToast);
90 
91  table_close(rel, NoLock);
92 }
93 
94 /*
95  * Create a toast table during bootstrap
96  *
97  * Here we need to prespecify the OIDs of the toast table and its index
98  */
99 void
100 BootstrapToastTable(char *relName, Oid toastOid, Oid toastIndexOid)
101 {
102  Relation rel;
103 
104  rel = table_openrv(makeRangeVar(NULL, relName, -1), AccessExclusiveLock);
105 
106  if (rel->rd_rel->relkind != RELKIND_RELATION &&
107  rel->rd_rel->relkind != RELKIND_MATVIEW)
108  elog(ERROR, "\"%s\" is not a table or materialized view",
109  relName);
110 
111  /* create_toast_table does all the work */
112  if (!create_toast_table(rel, toastOid, toastIndexOid, (Datum) 0,
114  elog(ERROR, "\"%s\" does not require a toast table",
115  relName);
116 
117  table_close(rel, NoLock);
118 }
119 
120 
121 /*
122  * create_toast_table --- internal workhorse
123  *
124  * rel is already opened and locked
125  * toastOid and toastIndexOid are normally InvalidOid, but during
126  * bootstrap they can be nonzero to specify hand-assigned OIDs
127  */
128 static bool
129 create_toast_table(Relation rel, Oid toastOid, Oid toastIndexOid,
130  Datum reloptions, LOCKMODE lockmode, bool check,
131  Oid OIDOldToast)
132 {
133  Oid relOid = RelationGetRelid(rel);
134  HeapTuple reltup;
135  TupleDesc tupdesc;
136  bool shared_relation;
137  bool mapped_relation;
138  Relation toast_rel;
139  Relation class_rel;
140  Oid toast_relid;
141  Oid namespaceid;
142  char toast_relname[NAMEDATALEN];
143  char toast_idxname[NAMEDATALEN];
144  IndexInfo *indexInfo;
145  Oid collationIds[2];
146  Oid opclassIds[2];
147  int16 coloptions[2];
148  ObjectAddress baseobject,
149  toastobject;
150 
151  /*
152  * Is it already toasted?
153  */
154  if (rel->rd_rel->reltoastrelid != InvalidOid)
155  return false;
156 
157  /*
158  * Check to see whether the table actually needs a TOAST table.
159  */
160  if (!IsBinaryUpgrade)
161  {
162  /* Normal mode, normal check */
163  if (!needs_toast_table(rel))
164  return false;
165  }
166  else
167  {
168  /*
169  * In binary-upgrade mode, create a TOAST table if and only if
170  * pg_upgrade told us to (ie, a TOAST table OID has been provided).
171  *
172  * This indicates that the old cluster had a TOAST table for the
173  * current table. We must create a TOAST table to receive the old
174  * TOAST file, even if the table seems not to need one.
175  *
176  * Contrariwise, if the old cluster did not have a TOAST table, we
177  * should be able to get along without one even if the new version's
178  * needs_toast_table rules suggest we should have one. There is a lot
179  * of daylight between where we will create a TOAST table and where
180  * one is really necessary to avoid failures, so small cross-version
181  * differences in the when-to-create heuristic shouldn't be a problem.
182  * If we tried to create a TOAST table anyway, we would have the
183  * problem that it might take up an OID that will conflict with some
184  * old-cluster table we haven't seen yet.
185  */
187  return false;
188  }
189 
190  /*
191  * If requested check lockmode is sufficient. This is a cross check in
192  * case of errors or conflicting decisions in earlier code.
193  */
194  if (check && lockmode != AccessExclusiveLock)
195  elog(ERROR, "AccessExclusiveLock required to add toast table.");
196 
197  /*
198  * Create the toast table and its index
199  */
200  snprintf(toast_relname, sizeof(toast_relname),
201  "pg_toast_%u", relOid);
202  snprintf(toast_idxname, sizeof(toast_idxname),
203  "pg_toast_%u_index", relOid);
204 
205  /* this is pretty painful... need a tuple descriptor */
206  tupdesc = CreateTemplateTupleDesc(3);
207  TupleDescInitEntry(tupdesc, (AttrNumber) 1,
208  "chunk_id",
209  OIDOID,
210  -1, 0);
211  TupleDescInitEntry(tupdesc, (AttrNumber) 2,
212  "chunk_seq",
213  INT4OID,
214  -1, 0);
215  TupleDescInitEntry(tupdesc, (AttrNumber) 3,
216  "chunk_data",
217  BYTEAOID,
218  -1, 0);
219 
220  /*
221  * Ensure that the toast table doesn't itself get toasted, or we'll be
222  * toast :-(. This is essential for chunk_data because type bytea is
223  * toastable; hit the other two just to be sure.
224  */
225  TupleDescAttr(tupdesc, 0)->attstorage = TYPSTORAGE_PLAIN;
226  TupleDescAttr(tupdesc, 1)->attstorage = TYPSTORAGE_PLAIN;
227  TupleDescAttr(tupdesc, 2)->attstorage = TYPSTORAGE_PLAIN;
228 
229  /* Toast field should not be compressed */
230  TupleDescAttr(tupdesc, 0)->attcompression = InvalidCompressionMethod;
231  TupleDescAttr(tupdesc, 1)->attcompression = InvalidCompressionMethod;
232  TupleDescAttr(tupdesc, 2)->attcompression = InvalidCompressionMethod;
233 
234  /*
235  * Toast tables for regular relations go in pg_toast; those for temp
236  * relations go into the per-backend temp-toast-table namespace.
237  */
238  if (isTempOrTempToastNamespace(rel->rd_rel->relnamespace))
239  namespaceid = GetTempToastNamespace();
240  else
241  namespaceid = PG_TOAST_NAMESPACE;
242 
243  /* Toast table is shared if and only if its parent is. */
244  shared_relation = rel->rd_rel->relisshared;
245 
246  /* It's mapped if and only if its parent is, too */
247  mapped_relation = RelationIsMapped(rel);
248 
249  toast_relid = heap_create_with_catalog(toast_relname,
250  namespaceid,
251  rel->rd_rel->reltablespace,
252  toastOid,
253  InvalidOid,
254  InvalidOid,
255  rel->rd_rel->relowner,
257  tupdesc,
258  NIL,
259  RELKIND_TOASTVALUE,
260  rel->rd_rel->relpersistence,
261  shared_relation,
262  mapped_relation,
264  reloptions,
265  false,
266  true,
267  true,
268  OIDOldToast,
269  NULL);
270  Assert(toast_relid != InvalidOid);
271 
272  /* make the toast relation visible, else table_open will fail */
274 
275  /* ShareLock is not really needed here, but take it anyway */
276  toast_rel = table_open(toast_relid, ShareLock);
277 
278  /*
279  * Create unique index on chunk_id, chunk_seq.
280  *
281  * NOTE: the normal TOAST access routines could actually function with a
282  * single-column index on chunk_id only. However, the slice access
283  * routines use both columns for faster access to an individual chunk. In
284  * addition, we want it to be unique as a check against the possibility of
285  * duplicate TOAST chunk OIDs. The index might also be a little more
286  * efficient this way, since btree isn't all that happy with large numbers
287  * of equal keys.
288  */
289 
290  indexInfo = makeNode(IndexInfo);
291  indexInfo->ii_NumIndexAttrs = 2;
292  indexInfo->ii_NumIndexKeyAttrs = 2;
293  indexInfo->ii_IndexAttrNumbers[0] = 1;
294  indexInfo->ii_IndexAttrNumbers[1] = 2;
295  indexInfo->ii_Expressions = NIL;
296  indexInfo->ii_ExpressionsState = NIL;
297  indexInfo->ii_Predicate = NIL;
298  indexInfo->ii_PredicateState = NULL;
299  indexInfo->ii_ExclusionOps = NULL;
300  indexInfo->ii_ExclusionProcs = NULL;
301  indexInfo->ii_ExclusionStrats = NULL;
302  indexInfo->ii_OpclassOptions = NULL;
303  indexInfo->ii_Unique = true;
304  indexInfo->ii_NullsNotDistinct = false;
305  indexInfo->ii_ReadyForInserts = true;
306  indexInfo->ii_CheckedUnchanged = false;
307  indexInfo->ii_IndexUnchanged = false;
308  indexInfo->ii_Concurrent = false;
309  indexInfo->ii_BrokenHotChain = false;
310  indexInfo->ii_ParallelWorkers = 0;
311  indexInfo->ii_Am = BTREE_AM_OID;
312  indexInfo->ii_AmCache = NULL;
313  indexInfo->ii_Context = CurrentMemoryContext;
314 
315  collationIds[0] = InvalidOid;
316  collationIds[1] = InvalidOid;
317 
318  opclassIds[0] = OID_BTREE_OPS_OID;
319  opclassIds[1] = INT4_BTREE_OPS_OID;
320 
321  coloptions[0] = 0;
322  coloptions[1] = 0;
323 
324  index_create(toast_rel, toast_idxname, toastIndexOid, InvalidOid,
326  indexInfo,
327  list_make2("chunk_id", "chunk_seq"),
328  BTREE_AM_OID,
329  rel->rd_rel->reltablespace,
330  collationIds, opclassIds, coloptions, (Datum) 0,
331  INDEX_CREATE_IS_PRIMARY, 0, true, true, NULL);
332 
333  table_close(toast_rel, NoLock);
334 
335  /*
336  * Store the toast table's OID in the parent relation's pg_class row
337  */
338  class_rel = table_open(RelationRelationId, RowExclusiveLock);
339 
340  reltup = SearchSysCacheCopy1(RELOID, ObjectIdGetDatum(relOid));
341  if (!HeapTupleIsValid(reltup))
342  elog(ERROR, "cache lookup failed for relation %u", relOid);
343 
344  ((Form_pg_class) GETSTRUCT(reltup))->reltoastrelid = toast_relid;
345 
347  {
348  /* normal case, use a transactional update */
349  CatalogTupleUpdate(class_rel, &reltup->t_self, reltup);
350  }
351  else
352  {
353  /* While bootstrapping, we cannot UPDATE, so overwrite in-place */
354  heap_inplace_update(class_rel, reltup);
355  }
356 
357  heap_freetuple(reltup);
358 
359  table_close(class_rel, RowExclusiveLock);
360 
361  /*
362  * Register dependency from the toast table to the main, so that the toast
363  * table will be deleted if the main is. Skip this in bootstrap mode.
364  */
366  {
367  baseobject.classId = RelationRelationId;
368  baseobject.objectId = relOid;
369  baseobject.objectSubId = 0;
370  toastobject.classId = RelationRelationId;
371  toastobject.objectId = toast_relid;
372  toastobject.objectSubId = 0;
373 
374  recordDependencyOn(&toastobject, &baseobject, DEPENDENCY_INTERNAL);
375  }
376 
377  /*
378  * Make changes visible
379  */
381 
382  return true;
383 }
384 
385 /*
386  * Check to see whether the table needs a TOAST table.
387  */
388 static bool
390 {
391  /*
392  * No need to create a TOAST table for partitioned tables.
393  */
394  if (rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
395  return false;
396 
397  /*
398  * We cannot allow toasting a shared relation after initdb (because
399  * there's no way to mark it toasted in other databases' pg_class).
400  */
401  if (rel->rd_rel->relisshared && !IsBootstrapProcessingMode())
402  return false;
403 
404  /*
405  * Ignore attempts to create toast tables on catalog tables after initdb.
406  * Which catalogs get toast tables is explicitly chosen in catalog/pg_*.h.
407  * (We could get here via some ALTER TABLE command if the catalog doesn't
408  * have a toast table.)
409  */
411  return false;
412 
413  /* Otherwise, let the AM decide. */
415 }
int16 AttrNumber
Definition: attnum.h:21
signed short int16
Definition: c.h:482
#define OidIsValid(objectId)
Definition: c.h:764
bool IsCatalogRelation(Relation relation)
Definition: catalog.c:105
@ DEPENDENCY_INTERNAL
Definition: dependency.h:35
#define ERROR
Definition: elog.h:39
bool IsBinaryUpgrade
Definition: globals.c:114
Oid heap_create_with_catalog(const char *relname, Oid relnamespace, Oid reltablespace, Oid relid, Oid reltypeid, Oid reloftypeid, Oid ownerid, Oid accessmtd, TupleDesc tupdesc, List *cooked_constraints, char relkind, char relpersistence, bool shared_relation, bool mapped_relation, OnCommitAction oncommit, Datum reloptions, bool use_user_acl, bool allow_system_table_mods, bool is_internal, Oid relrewrite, ObjectAddress *typaddress)
Definition: heap.c:1091
Oid binary_upgrade_next_toast_pg_class_oid
Definition: heap.c:80
void heap_inplace_update(Relation relation, HeapTuple tuple)
Definition: heapam.c:5875
void heap_freetuple(HeapTuple htup)
Definition: heaptuple.c:1426
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define GETSTRUCT(TUP)
Definition: htup_details.h:653
Oid index_create(Relation heapRelation, const char *indexRelationName, Oid indexRelationId, Oid parentIndexRelid, Oid parentConstraintId, RelFileNumber relFileNumber, IndexInfo *indexInfo, const List *indexColNames, Oid accessMethodId, Oid tableSpaceId, const Oid *collationIds, const Oid *opclassIds, const int16 *coloptions, Datum reloptions, bits16 flags, bits16 constr_flags, bool allow_system_table_mods, bool is_internal, Oid *constraintId)
Definition: index.c:711
#define INDEX_CREATE_IS_PRIMARY
Definition: index.h:61
void CatalogTupleUpdate(Relation heapRel, ItemPointer otid, HeapTuple tup)
Definition: indexing.c:313
Assert(fmt[strlen(fmt) - 1] !='\n')
int LOCKMODE
Definition: lockdefs.h:26
#define NoLock
Definition: lockdefs.h:34
#define AccessExclusiveLock
Definition: lockdefs.h:43
#define ShareLock
Definition: lockdefs.h:40
#define RowExclusiveLock
Definition: lockdefs.h:38
RangeVar * makeRangeVar(char *schemaname, char *relname, int location)
Definition: makefuncs.c:425
MemoryContext CurrentMemoryContext
Definition: mcxt.c:135
#define IsBootstrapProcessingMode()
Definition: miscadmin.h:414
bool isTempOrTempToastNamespace(Oid namespaceId)
Definition: namespace.c:3206
Oid GetTempToastNamespace(void)
Definition: namespace.c:3324
#define makeNode(_type_)
Definition: nodes.h:176
FormData_pg_class * Form_pg_class
Definition: pg_class.h:153
#define NAMEDATALEN
void recordDependencyOn(const ObjectAddress *depender, const ObjectAddress *referenced, DependencyType behavior)
Definition: pg_depend.c:44
#define NIL
Definition: pg_list.h:68
#define list_make2(x1, x2)
Definition: pg_list.h:214
#define snprintf
Definition: port.h:238
uintptr_t Datum
Definition: postgres.h:64
static Datum ObjectIdGetDatum(Oid X)
Definition: postgres.h:252
#define InvalidOid
Definition: postgres_ext.h:36
unsigned int Oid
Definition: postgres_ext.h:31
@ ONCOMMIT_NOOP
Definition: primnodes.h:49
#define RelationGetRelid(relation)
Definition: rel.h:504
#define RelationIsMapped(relation)
Definition: rel.h:553
ItemPointerData t_self
Definition: htup.h:65
bool ii_Unique
Definition: execnodes.h:191
uint16 * ii_ExclusionStrats
Definition: execnodes.h:186
bool ii_BrokenHotChain
Definition: execnodes.h:197
int ii_NumIndexAttrs
Definition: execnodes.h:177
void * ii_AmCache
Definition: execnodes.h:201
bool ii_CheckedUnchanged
Definition: execnodes.h:194
Datum * ii_OpclassOptions
Definition: execnodes.h:190
ExprState * ii_PredicateState
Definition: execnodes.h:183
Oid * ii_ExclusionOps
Definition: execnodes.h:184
bool ii_NullsNotDistinct
Definition: execnodes.h:192
int ii_ParallelWorkers
Definition: execnodes.h:199
bool ii_Concurrent
Definition: execnodes.h:196
int ii_NumIndexKeyAttrs
Definition: execnodes.h:178
List * ii_ExpressionsState
Definition: execnodes.h:181
List * ii_Expressions
Definition: execnodes.h:180
bool ii_IndexUnchanged
Definition: execnodes.h:195
Oid * ii_ExclusionProcs
Definition: execnodes.h:185
Oid ii_Am
Definition: execnodes.h:200
AttrNumber ii_IndexAttrNumbers[INDEX_MAX_KEYS]
Definition: execnodes.h:179
MemoryContext ii_Context
Definition: execnodes.h:202
bool ii_ReadyForInserts
Definition: execnodes.h:193
List * ii_Predicate
Definition: execnodes.h:182
Form_pg_class rd_rel
Definition: rel.h:111
#define SearchSysCacheCopy1(cacheId, key1)
Definition: syscache.h:182
@ RELOID
Definition: syscache.h:89
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:126
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:40
Relation table_openrv(const RangeVar *relation, LOCKMODE lockmode)
Definition: table.c:83
static bool table_relation_needs_toast_table(Relation rel)
Definition: tableam.h:1874
static Oid table_relation_toast_am(Relation rel)
Definition: tableam.h:1884
#define InvalidCompressionMethod
void BootstrapToastTable(char *relName, Oid toastOid, Oid toastIndexOid)
Definition: toasting.c:100
static void CheckAndCreateToastTable(Oid relOid, Datum reloptions, LOCKMODE lockmode, bool check, Oid OIDOldToast)
Definition: toasting.c:80
void NewHeapCreateToastTable(Oid relOid, Datum reloptions, LOCKMODE lockmode, Oid OIDOldToast)
Definition: toasting.c:66
void NewRelationCreateToastTable(Oid relOid, Datum reloptions)
Definition: toasting.c:73
void AlterTableCreateToastTable(Oid relOid, Datum reloptions, LOCKMODE lockmode)
Definition: toasting.c:60
static bool create_toast_table(Relation rel, Oid toastOid, Oid toastIndexOid, Datum reloptions, LOCKMODE lockmode, bool check, Oid OIDOldToast)
Definition: toasting.c:129
static bool needs_toast_table(Relation rel)
Definition: toasting.c:389
TupleDesc CreateTemplateTupleDesc(int natts)
Definition: tupdesc.c:45
void TupleDescInitEntry(TupleDesc desc, AttrNumber attributeNumber, const char *attributeName, Oid oidtypeid, int32 typmod, int attdim)
Definition: tupdesc.c:583
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92
void CommandCounterIncrement(void)
Definition: xact.c:1078