PostgreSQL Source Code git master
Loading...
Searching...
No Matches
ri_triggers.c
Go to the documentation of this file.
1/*-------------------------------------------------------------------------
2 *
3 * ri_triggers.c
4 *
5 * Generic trigger procedures for referential integrity constraint
6 * checks.
7 *
8 * Note about memory management: the private hashtables kept here live
9 * across query and transaction boundaries, in fact they live as long as
10 * the backend does. This works because the hashtable structures
11 * themselves are allocated by dynahash.c in its permanent DynaHashCxt,
12 * and the SPI plans they point to are saved using SPI_keepplan().
13 * There is not currently any provision for throwing away a no-longer-needed
14 * plan --- consider improving this someday.
15 *
16 *
17 * Portions Copyright (c) 1996-2026, PostgreSQL Global Development Group
18 *
19 * src/backend/utils/adt/ri_triggers.c
20 *
21 *-------------------------------------------------------------------------
22 */
23
24#include "postgres.h"
25
26#include "access/amapi.h"
27#include "access/genam.h"
28#include "access/htup_details.h"
29#include "access/skey.h"
30#include "access/sysattr.h"
31#include "access/table.h"
32#include "access/tableam.h"
33#include "access/xact.h"
34#include "catalog/index.h"
35#include "catalog/pg_collation.h"
36#include "catalog/pg_constraint.h"
37#include "catalog/pg_namespace.h"
38#include "commands/trigger.h"
39#include "executor/executor.h"
40#include "executor/spi.h"
41#include "lib/ilist.h"
42#include "miscadmin.h"
43#include "parser/parse_coerce.h"
44#include "parser/parse_relation.h"
45#include "utils/acl.h"
46#include "utils/builtins.h"
47#include "utils/datum.h"
48#include "utils/fmgroids.h"
49#include "utils/guc.h"
50#include "utils/hsearch.h"
51#include "utils/inval.h"
52#include "utils/lsyscache.h"
53#include "utils/memutils.h"
54#include "utils/rel.h"
55#include "utils/rls.h"
56#include "utils/ruleutils.h"
57#include "utils/snapmgr.h"
58#include "utils/syscache.h"
59
60/*
61 * Local definitions
62 */
63
64#define RI_MAX_NUMKEYS INDEX_MAX_KEYS
65
66#define RI_INIT_CONSTRAINTHASHSIZE 64
67#define RI_INIT_QUERYHASHSIZE (RI_INIT_CONSTRAINTHASHSIZE * 4)
68
69#define RI_KEYS_ALL_NULL 0
70#define RI_KEYS_SOME_NULL 1
71#define RI_KEYS_NONE_NULL 2
72
73/* RI query type codes */
74/* these queries are executed against the PK (referenced) table: */
75#define RI_PLAN_CHECK_LOOKUPPK 1
76#define RI_PLAN_CHECK_LOOKUPPK_FROM_PK 2
77#define RI_PLAN_LAST_ON_PK RI_PLAN_CHECK_LOOKUPPK_FROM_PK
78/* these queries are executed against the FK (referencing) table: */
79#define RI_PLAN_CASCADE_ONDELETE 3
80#define RI_PLAN_CASCADE_ONUPDATE 4
81#define RI_PLAN_NO_ACTION 5
82/* For RESTRICT, the same plan can be used for both ON DELETE and ON UPDATE triggers. */
83#define RI_PLAN_RESTRICT 6
84#define RI_PLAN_SETNULL_ONDELETE 7
85#define RI_PLAN_SETNULL_ONUPDATE 8
86#define RI_PLAN_SETDEFAULT_ONDELETE 9
87#define RI_PLAN_SETDEFAULT_ONUPDATE 10
88
89#define MAX_QUOTED_NAME_LEN (NAMEDATALEN*2+3)
90#define MAX_QUOTED_REL_NAME_LEN (MAX_QUOTED_NAME_LEN*2)
91
92#define RIAttName(rel, attnum) NameStr(*attnumAttName(rel, attnum))
93#define RIAttType(rel, attnum) attnumTypeId(rel, attnum)
94#define RIAttCollation(rel, attnum) attnumCollationId(rel, attnum)
95
96#define RI_TRIGTYPE_INSERT 1
97#define RI_TRIGTYPE_UPDATE 2
98#define RI_TRIGTYPE_DELETE 3
99
100typedef struct FastPathMeta FastPathMeta;
101
102/*
103 * RI_ConstraintInfo
104 *
105 * Information extracted from an FK pg_constraint entry. This is cached in
106 * ri_constraint_cache.
107 *
108 * Note that pf/pp/ff_eq_oprs may hold the overlaps operator instead of equals
109 * for the PERIOD part of a temporal foreign key.
110 */
111typedef struct RI_ConstraintInfo
112{
113 Oid constraint_id; /* OID of pg_constraint entry (hash key) */
114 bool valid; /* successfully initialized? */
115 Oid constraint_root_id; /* OID of topmost ancestor constraint;
116 * same as constraint_id if not inherited */
117 uint32 oidHashValue; /* hash value of constraint_id */
118 uint32 rootHashValue; /* hash value of constraint_root_id */
119 NameData conname; /* name of the FK constraint */
120 Oid pk_relid; /* referenced relation */
121 Oid fk_relid; /* referencing relation */
122 char confupdtype; /* foreign key's ON UPDATE action */
123 char confdeltype; /* foreign key's ON DELETE action */
124 int ndelsetcols; /* number of columns referenced in ON DELETE
125 * SET clause */
126 int16 confdelsetcols[RI_MAX_NUMKEYS]; /* attnums of cols to set on
127 * delete */
128 char confmatchtype; /* foreign key's match type */
129 bool hasperiod; /* if the foreign key uses PERIOD */
130 int nkeys; /* number of key columns */
131 int16 pk_attnums[RI_MAX_NUMKEYS]; /* attnums of referenced cols */
132 int16 fk_attnums[RI_MAX_NUMKEYS]; /* attnums of referencing cols */
133 Oid pf_eq_oprs[RI_MAX_NUMKEYS]; /* equality operators (PK = FK) */
134 Oid pp_eq_oprs[RI_MAX_NUMKEYS]; /* equality operators (PK = PK) */
135 Oid ff_eq_oprs[RI_MAX_NUMKEYS]; /* equality operators (FK = FK) */
136 Oid period_contained_by_oper; /* anyrange <@ anyrange (or
137 * multiranges) */
138 Oid agged_period_contained_by_oper; /* fkattr <@ range_agg(pkattr) */
139 Oid period_intersect_oper; /* anyrange * anyrange (or
140 * multiranges) */
141 dlist_node valid_link; /* Link in list of valid entries */
142
143 Oid conindid;
144 bool pk_is_partitioned;
145
146 FastPathMeta *fpmeta;
147} RI_ConstraintInfo;
148
149typedef struct RI_CompareHashEntry RI_CompareHashEntry;
150
151/* Fast-path metadata for RI checks on foreign key referencing tables */
160
161/*
162 * RI_QueryKey
163 *
164 * The key identifying a prepared SPI plan in our query hashtable
165 */
166typedef struct RI_QueryKey
167{
168 Oid constr_id; /* OID of pg_constraint entry */
169 int32 constr_queryno; /* query type ID, see RI_PLAN_XXX above */
170} RI_QueryKey;
171
172/*
173 * RI_QueryHashEntry
174 */
180
181/*
182 * RI_CompareKey
183 *
184 * The key identifying an entry showing how to compare two values
185 */
186typedef struct RI_CompareKey
187{
188 Oid eq_opr; /* the equality operator to apply */
189 Oid typeid; /* the data type to apply it to */
190} RI_CompareKey;
191
192/*
193 * RI_CompareHashEntry
194 */
195typedef struct RI_CompareHashEntry
196{
197 RI_CompareKey key;
198 bool valid; /* successfully initialized? */
199 FmgrInfo eq_opr_finfo; /* call info for equality fn */
200 FmgrInfo cast_func_finfo; /* in case we must coerce input */
201} RI_CompareHashEntry;
202
203/*
204 * Maximum number of FK rows buffered before flushing.
205 *
206 * Larger batches amortize per-flush overhead and let the SK_SEARCHARRAY
207 * path walk more leaf pages in a single sorted traversal. But each
208 * buffered row is a materialized HeapTuple in flush_cxt, and the matched[]
209 * scan in ri_FastPathFlushArray() is O(batch_size) per index match.
210 * Benchmarking showed little difference between 16 and 64, with 256
211 * consistently slower. 64 is a reasonable default.
212 */
213#define RI_FASTPATH_BATCH_SIZE 64
214
215/*
216 * RI_FastPathEntry
217 * Per-constraint cache of resources needed by ri_FastPathBatchFlush().
218 *
219 * One entry per constraint, keyed by pg_constraint OID. Created lazily
220 * by ri_FastPathGetEntry() on first use within a trigger-firing batch
221 * and torn down by ri_FastPathTeardown() at batch end.
222 *
223 * FK tuples are buffered in batch[] across trigger invocations and
224 * flushed when the buffer fills or the batch ends.
225 *
226 * RI_FastPathEntry is not subject to cache invalidation. The cached
227 * relations are held open with locks for the transaction duration, preventing
228 * relcache invalidation. The entry itself is torn down at batch end by
229 * ri_FastPathEndBatch(); on abort, ResourceOwner releases the cached
230 * relations and the XactCallback/SubXactCallback NULL the static cache pointer
231 * to prevent any subsequent access.
232 */
233typedef struct RI_FastPathEntry
234{
235 Oid conoid; /* hash key: pg_constraint OID */
236 Oid fk_relid; /* for ri_FastPathEndBatch() */
237 Relation pk_rel;
238 Relation idx_rel;
239 TupleTableSlot *pk_slot;
240 TupleTableSlot *fk_slot;
241 MemoryContext flush_cxt; /* short-lived context for per-flush work */
242
243 /*
244 * TODO: batch[] is HeapTuple[] because the AFTER trigger machinery
245 * currently passes tuples as HeapTuples. Once trigger infrastructure is
246 * slotified, this should use a slot array or whatever batched tuple
247 * storage abstraction exists at that point to be TAM-agnostic.
248 */
249 HeapTuple batch[RI_FASTPATH_BATCH_SIZE];
250 int batch_count;
251} RI_FastPathEntry;
252
253/*
254 * Local data
255 */
256static HTAB *ri_constraint_cache = NULL;
257static HTAB *ri_query_cache = NULL;
258static HTAB *ri_compare_cache = NULL;
259static dclist_head ri_constraint_cache_valid_list;
260
261static HTAB *ri_fastpath_cache = NULL;
262static bool ri_fastpath_callback_registered = false;
263
264/*
265 * Local function prototypes
266 */
267static bool ri_Check_Pk_Match(Relation pk_rel, Relation fk_rel,
268 TupleTableSlot *oldslot,
269 const RI_ConstraintInfo *riinfo);
270static Datum ri_restrict(TriggerData *trigdata, bool is_no_action);
271static Datum ri_set(TriggerData *trigdata, bool is_set_null, int tgkind);
272static void quoteOneName(char *buffer, const char *name);
273static void quoteRelationName(char *buffer, Relation rel);
274static void ri_GenerateQual(StringInfo buf,
275 const char *sep,
276 const char *leftop, Oid leftoptype,
277 Oid opoid,
278 const char *rightop, Oid rightoptype);
279static void ri_GenerateQualCollation(StringInfo buf, Oid collation);
280static int ri_NullCheck(TupleDesc tupDesc, TupleTableSlot *slot,
281 const RI_ConstraintInfo *riinfo, bool rel_is_pk);
282static void ri_BuildQueryKey(RI_QueryKey *key,
283 const RI_ConstraintInfo *riinfo,
284 int32 constr_queryno);
285static bool ri_KeysEqual(Relation rel, TupleTableSlot *oldslot, TupleTableSlot *newslot,
286 const RI_ConstraintInfo *riinfo, bool rel_is_pk);
287static bool ri_CompareWithCast(Oid eq_opr, Oid typeid, Oid collid,
288 Datum lhs, Datum rhs);
289
290static void ri_InitHashTables(void);
291static void InvalidateConstraintCacheCallBack(Datum arg, SysCacheIdentifier cacheid,
292 uint32 hashvalue);
293static SPIPlanPtr ri_FetchPreparedPlan(RI_QueryKey *key);
294static void ri_HashPreparedPlan(RI_QueryKey *key, SPIPlanPtr plan);
295static RI_CompareHashEntry *ri_HashCompareOp(Oid eq_opr, Oid typeid);
296
297static void ri_CheckTrigger(FunctionCallInfo fcinfo, const char *funcname,
298 int tgkind);
299static const RI_ConstraintInfo *ri_FetchConstraintInfo(Trigger *trigger,
300 Relation trig_rel, bool rel_is_pk);
301static const RI_ConstraintInfo *ri_LoadConstraintInfo(Oid constraintOid);
302static Oid get_ri_constraint_root(Oid constrOid);
303static SPIPlanPtr ri_PlanCheck(const char *querystr, int nargs, Oid *argtypes,
304 RI_QueryKey *qkey, Relation fk_rel, Relation pk_rel);
305static bool ri_PerformCheck(const RI_ConstraintInfo *riinfo,
306 RI_QueryKey *qkey, SPIPlanPtr qplan,
307 Relation fk_rel, Relation pk_rel,
308 TupleTableSlot *oldslot, TupleTableSlot *newslot,
309 bool is_restrict,
310 bool detectNewRows, int expect_OK);
311static void ri_FastPathCheck(const RI_ConstraintInfo *riinfo,
312 Relation fk_rel, TupleTableSlot *newslot);
313static void ri_FastPathBatchAdd(const RI_ConstraintInfo *riinfo,
314 Relation fk_rel, TupleTableSlot *newslot);
315static void ri_FastPathBatchFlush(RI_FastPathEntry *fpentry, Relation fk_rel,
316 const RI_ConstraintInfo *riinfo);
317static int ri_FastPathFlushArray(RI_FastPathEntry *fpentry, TupleTableSlot *fk_slot,
318 const RI_ConstraintInfo *riinfo, Relation fk_rel,
319 Snapshot snapshot, IndexScanDesc scandesc);
320static int ri_FastPathFlushLoop(RI_FastPathEntry *fpentry, TupleTableSlot *fk_slot,
321 const RI_ConstraintInfo *riinfo, Relation fk_rel,
322 Snapshot snapshot, IndexScanDesc scandesc);
323static bool ri_FastPathProbeOne(Relation pk_rel, Relation idx_rel,
324 IndexScanDesc scandesc, TupleTableSlot *slot,
325 Snapshot snapshot, const RI_ConstraintInfo *riinfo,
326 ScanKeyData *skey, int nkeys);
327static bool ri_LockPKTuple(Relation pk_rel, TupleTableSlot *slot, Snapshot snap,
328 bool *concurrently_updated);
329static bool ri_fastpath_is_applicable(const RI_ConstraintInfo *riinfo);
330static void ri_CheckPermissions(Relation query_rel);
331static bool recheck_matched_pk_tuple(Relation idxrel, ScanKeyData *skeys,
332 int nkeys, TupleTableSlot *new_slot);
333static void build_index_scankeys(const RI_ConstraintInfo *riinfo,
334 Relation idx_rel, Datum *pk_vals,
335 char *pk_nulls, ScanKey skeys);
336static void ri_populate_fastpath_metadata(RI_ConstraintInfo *riinfo,
337 Relation fk_rel, Relation idx_rel);
338static void ri_ExtractValues(Relation rel, TupleTableSlot *slot,
339 const RI_ConstraintInfo *riinfo, bool rel_is_pk,
340 Datum *vals, char *nulls);
341pg_noreturn static void ri_ReportViolation(const RI_ConstraintInfo *riinfo,
342 Relation pk_rel, Relation fk_rel,
343 TupleTableSlot *violatorslot, TupleDesc tupdesc,
344 int queryno, bool is_restrict, bool partgone);
345static RI_FastPathEntry *ri_FastPathGetEntry(const RI_ConstraintInfo *riinfo,
346 Relation fk_rel);
347static void ri_FastPathEndBatch(void *arg);
348static void ri_FastPathTeardown(void);
349
350
351/*
352 * RI_FKey_check -
353 *
354 * Check foreign key existence (combined for INSERT and UPDATE).
355 */
356static Datum
357RI_FKey_check(TriggerData *trigdata)
358{
359 const RI_ConstraintInfo *riinfo;
360 Relation fk_rel;
361 Relation pk_rel;
362 TupleTableSlot *newslot;
363 RI_QueryKey qkey;
364 SPIPlanPtr qplan;
365
366 riinfo = ri_FetchConstraintInfo(trigdata->tg_trigger,
367 trigdata->tg_relation, false);
368
369 if (TRIGGER_FIRED_BY_UPDATE(trigdata->tg_event))
370 newslot = trigdata->tg_newslot;
371 else
372 newslot = trigdata->tg_trigslot;
373
374 /*
375 * We should not even consider checking the row if it is no longer valid,
376 * since it was either deleted (so the deferred check should be skipped)
377 * or updated (in which case only the latest version of the row should be
378 * checked). Test its liveness according to SnapshotSelf. We need pin
379 * and lock on the buffer to call HeapTupleSatisfiesVisibility. Caller
380 * should be holding pin, but not lock.
381 */
382 if (!table_tuple_satisfies_snapshot(trigdata->tg_relation, newslot, SnapshotSelf))
383 return PointerGetDatum(NULL);
384
385 fk_rel = trigdata->tg_relation;
386
387 switch (ri_NullCheck(RelationGetDescr(fk_rel), newslot, riinfo, false))
388 {
389 case RI_KEYS_ALL_NULL:
390
391 /*
392 * No further check needed - an all-NULL key passes every type of
393 * foreign key constraint.
394 */
395 return PointerGetDatum(NULL);
396
397 case RI_KEYS_SOME_NULL:
398
399 /*
400 * This is the only case that differs between the three kinds of
401 * MATCH.
402 */
403 switch (riinfo->confmatchtype)
404 {
405 case FKCONSTR_MATCH_FULL:
406
407 /*
408 * Not allowed - MATCH FULL says either all or none of the
409 * attributes can be NULLs
410 */
411 ereport(ERROR,
412 (errcode(ERRCODE_FOREIGN_KEY_VIOLATION),
413 errmsg("insert or update on table \"%s\" violates foreign key constraint \"%s\"",
414 RelationGetRelationName(fk_rel),
415 NameStr(riinfo->conname)),
416 errdetail("MATCH FULL does not allow mixing of null and nonnull key values."),
417 errtableconstraint(fk_rel,
418 NameStr(riinfo->conname))));
419 return PointerGetDatum(NULL);
420
421 case FKCONSTR_MATCH_SIMPLE:
422
423 /*
424 * MATCH SIMPLE - if ANY column is null, the key passes
425 * the constraint.
426 */
427 return PointerGetDatum(NULL);
428
429#ifdef NOT_USED
430 case FKCONSTR_MATCH_PARTIAL:
431
432 /*
433 * MATCH PARTIAL - all non-null columns must match. (not
434 * implemented, can be done by modifying the query below
435 * to only include non-null columns, or by writing a
436 * special version here)
437 */
438 break;
439#endif
440 }
441
442 case RI_KEYS_NONE_NULL:
443
444 /*
445 * Have a full qualified key - continue below for all three kinds
446 * of MATCH.
447 */
448 break;
449 }
450
451 /*
452 * Fast path: probe the PK unique index directly, bypassing SPI.
453 *
454 * For non-partitioned, non-temporal FKs, we can skip the SPI machinery
455 * (plan cache, executor setup, etc.) and do a direct index scan + tuple
456 * lock. This is semantically equivalent to the SPI path below but avoids
457 * the per-row executor overhead.
458 *
459 * ri_FastPathBatchAdd() and ri_FastPathCheck() report the violation
460 * themselves if no matching PK row is found, so they only return on
461 * success.
462 */
463 if (ri_fastpath_is_applicable(riinfo))
464 {
465 if (AfterTriggerIsActive())
466 {
467 /* Batched path: buffer and probe in groups */
468 ri_FastPathBatchAdd(riinfo, fk_rel, newslot);
469 }
470 else
471 {
472 /* ALTER TABLE validation: per-row, no cache */
473 ri_FastPathCheck(riinfo, fk_rel, newslot);
474 }
475 return PointerGetDatum(NULL);
476 }
477
478 SPI_connect();
479
480 /*
481 * pk_rel is opened in RowShareLock mode since that's what our eventual
482 * SELECT FOR KEY SHARE will get on it.
483 */
484 pk_rel = table_open(riinfo->pk_relid, RowShareLock);
485
486 /* Fetch or prepare a saved plan for the real check */
487 ri_BuildQueryKey(&qkey, riinfo, RI_PLAN_CHECK_LOOKUPPK);
488
489 if ((qplan = ri_FetchPreparedPlan(&qkey)) == NULL)
490 {
491 StringInfoData querybuf;
492 char pkrelname[MAX_QUOTED_REL_NAME_LEN];
493 char attname[MAX_QUOTED_NAME_LEN];
494 char paramname[16];
495 const char *querysep;
496 Oid queryoids[RI_MAX_NUMKEYS];
497 const char *pk_only;
498
499 /* ----------
500 * The query string built is
501 * SELECT 1 FROM [ONLY] <pktable> x WHERE pkatt1 = $1 [AND ...]
502 * FOR KEY SHARE OF x
503 * The type id's for the $ parameters are those of the
504 * corresponding FK attributes.
505 *
506 * But for temporal FKs we need to make sure
507 * the FK's range is completely covered.
508 * So we use this query instead:
509 * SELECT 1
510 * FROM (
511 * SELECT pkperiodatt AS r
512 * FROM [ONLY] pktable x
513 * WHERE pkatt1 = $1 [AND ...]
514 * AND pkperiodatt && $n
515 * FOR KEY SHARE OF x
516 * ) x1
517 * HAVING $n <@ range_agg(x1.r)
518 * Note if FOR KEY SHARE ever allows GROUP BY and HAVING
519 * we can make this a bit simpler.
520 * ----------
521 */
522 initStringInfo(&querybuf);
523 pk_only = pk_rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE ?
524 "" : "ONLY ";
525 quoteRelationName(pkrelname, pk_rel);
526 if (riinfo->hasperiod)
527 {
528 quoteOneName(attname,
529 RIAttName(pk_rel, riinfo->pk_attnums[riinfo->nkeys - 1]));
530
531 appendStringInfo(&querybuf,
532 "SELECT 1 FROM (SELECT %s AS r FROM %s%s x",
533 attname, pk_only, pkrelname);
534 }
535 else
536 {
537 appendStringInfo(&querybuf, "SELECT 1 FROM %s%s x",
538 pk_only, pkrelname);
539 }
540 querysep = "WHERE";
541 for (int i = 0; i < riinfo->nkeys; i++)
542 {
543 Oid pk_type = RIAttType(pk_rel, riinfo->pk_attnums[i]);
544 Oid fk_type = RIAttType(fk_rel, riinfo->fk_attnums[i]);
545
546 quoteOneName(attname,
547 RIAttName(pk_rel, riinfo->pk_attnums[i]));
548 sprintf(paramname, "$%d", i + 1);
549 ri_GenerateQual(&querybuf, querysep,
550 attname, pk_type,
551 riinfo->pf_eq_oprs[i],
552 paramname, fk_type);
553 querysep = "AND";
554 queryoids[i] = fk_type;
555 }
556 appendStringInfoString(&querybuf, " FOR KEY SHARE OF x");
557 if (riinfo->hasperiod)
558 {
559 Oid fk_type = RIAttType(fk_rel, riinfo->fk_attnums[riinfo->nkeys - 1]);
560
561 appendStringInfoString(&querybuf, ") x1 HAVING ");
562 sprintf(paramname, "$%d", riinfo->nkeys);
563 ri_GenerateQual(&querybuf, "",
564 paramname, fk_type,
565 riinfo->agged_period_contained_by_oper,
566 "pg_catalog.range_agg", ANYMULTIRANGEOID);
567 appendStringInfoString(&querybuf, "(x1.r)");
568 }
569
570 /* Prepare and save the plan */
571 qplan = ri_PlanCheck(querybuf.data, riinfo->nkeys, queryoids,
572 &qkey, fk_rel, pk_rel);
573 }
574
575 /*
576 * Now check that foreign key exists in PK table
577 *
578 * XXX detectNewRows must be true when a partitioned table is on the
579 * referenced side. The reason is that our snapshot must be fresh in
580 * order for the hack in find_inheritance_children() to work.
581 */
582 ri_PerformCheck(riinfo, &qkey, qplan,
583 fk_rel, pk_rel,
584 NULL, newslot,
585 false,
586 pk_rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE,
587 SPI_OK_SELECT);
588
589 if (SPI_finish() != SPI_OK_FINISH)
590 elog(ERROR, "SPI_finish failed");
591
592 table_close(pk_rel, RowShareLock);
593
594 return PointerGetDatum(NULL);
595}
596
597
598/*
599 * RI_FKey_check_ins -
600 *
601 * Check foreign key existence at insert event on FK table.
602 */
603Datum
604RI_FKey_check_ins(PG_FUNCTION_ARGS)
605{
606 /* Check that this is a valid trigger call on the right time and event. */
607 ri_CheckTrigger(fcinfo, "RI_FKey_check_ins", RI_TRIGTYPE_INSERT);
608
609 /* Share code with UPDATE case. */
610 return RI_FKey_check((TriggerData *) fcinfo->context);
611}
612
613
614/*
615 * RI_FKey_check_upd -
616 *
617 * Check foreign key existence at update event on FK table.
618 */
619Datum
620RI_FKey_check_upd(PG_FUNCTION_ARGS)
621{
622 /* Check that this is a valid trigger call on the right time and event. */
623 ri_CheckTrigger(fcinfo, "RI_FKey_check_upd", RI_TRIGTYPE_UPDATE);
624
625 /* Share code with INSERT case. */
626 return RI_FKey_check((TriggerData *) fcinfo->context);
627}
628
629
630/*
631 * ri_Check_Pk_Match
632 *
633 * Check to see if another PK row has been created that provides the same
634 * key values as the "oldslot" that's been modified or deleted in our trigger
635 * event. Returns true if a match is found in the PK table.
636 *
637 * We assume the caller checked that the oldslot contains no NULL key values,
638 * since otherwise a match is impossible.
639 */
640static bool
641ri_Check_Pk_Match(Relation pk_rel, Relation fk_rel,
642 TupleTableSlot *oldslot,
643 const RI_ConstraintInfo *riinfo)
644{
645 SPIPlanPtr qplan;
646 RI_QueryKey qkey;
647 bool result;
648
649 /* Only called for non-null rows */
650 Assert(ri_NullCheck(RelationGetDescr(pk_rel), oldslot, riinfo, true) == RI_KEYS_NONE_NULL);
651
652 SPI_connect();
653
654 /*
655 * Fetch or prepare a saved plan for checking PK table with values coming
656 * from a PK row
657 */
658 ri_BuildQueryKey(&qkey, riinfo, RI_PLAN_CHECK_LOOKUPPK_FROM_PK);
659
660 if ((qplan = ri_FetchPreparedPlan(&qkey)) == NULL)
661 {
662 StringInfoData querybuf;
663 char pkrelname[MAX_QUOTED_REL_NAME_LEN];
664 char attname[MAX_QUOTED_NAME_LEN];
665 char paramname[16];
666 const char *querysep;
667 const char *pk_only;
668 Oid queryoids[RI_MAX_NUMKEYS];
669
670 /* ----------
671 * The query string built is
672 * SELECT 1 FROM [ONLY] <pktable> x WHERE pkatt1 = $1 [AND ...]
673 * FOR KEY SHARE OF x
674 * The type id's for the $ parameters are those of the
675 * PK attributes themselves.
676 *
677 * But for temporal FKs we need to make sure
678 * the old PK's range is completely covered.
679 * So we use this query instead:
680 * SELECT 1
681 * FROM (
682 * SELECT pkperiodatt AS r
683 * FROM [ONLY] pktable x
684 * WHERE pkatt1 = $1 [AND ...]
685 * AND pkperiodatt && $n
686 * FOR KEY SHARE OF x
687 * ) x1
688 * HAVING $n <@ range_agg(x1.r)
689 * Note if FOR KEY SHARE ever allows GROUP BY and HAVING
690 * we can make this a bit simpler.
691 * ----------
692 */
693 initStringInfo(&querybuf);
694 pk_only = pk_rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE ?
695 "" : "ONLY ";
696 quoteRelationName(pkrelname, pk_rel);
697 if (riinfo->hasperiod)
698 {
699 quoteOneName(attname, RIAttName(pk_rel, riinfo->pk_attnums[riinfo->nkeys - 1]));
700
701 appendStringInfo(&querybuf,
702 "SELECT 1 FROM (SELECT %s AS r FROM %s%s x",
703 attname, pk_only, pkrelname);
704 }
705 else
706 {
707 appendStringInfo(&querybuf, "SELECT 1 FROM %s%s x",
708 pk_only, pkrelname);
709 }
710 querysep = "WHERE";
711 for (int i = 0; i < riinfo->nkeys; i++)
712 {
713 Oid pk_type = RIAttType(pk_rel, riinfo->pk_attnums[i]);
714
715 quoteOneName(attname,
716 RIAttName(pk_rel, riinfo->pk_attnums[i]));
717 sprintf(paramname, "$%d", i + 1);
718 ri_GenerateQual(&querybuf, querysep,
719 attname, pk_type,
720 riinfo->pp_eq_oprs[i],
721 paramname, pk_type);
722 querysep = "AND";
723 queryoids[i] = pk_type;
724 }
725 appendStringInfoString(&querybuf, " FOR KEY SHARE OF x");
726 if (riinfo->hasperiod)
727 {
728 Oid fk_type = RIAttType(fk_rel, riinfo->fk_attnums[riinfo->nkeys - 1]);
729
730 appendStringInfoString(&querybuf, ") x1 HAVING ");
731 sprintf(paramname, "$%d", riinfo->nkeys);
732 ri_GenerateQual(&querybuf, "",
733 paramname, fk_type,
734 riinfo->agged_period_contained_by_oper,
735 "pg_catalog.range_agg", ANYMULTIRANGEOID);
736 appendStringInfoString(&querybuf, "(x1.r)");
737 }
738
739 /* Prepare and save the plan */
740 qplan = ri_PlanCheck(querybuf.data, riinfo->nkeys, queryoids,
741 &qkey, fk_rel, pk_rel);
742 }
743
744 /*
745 * We have a plan now. Run it.
746 */
747 result = ri_PerformCheck(riinfo, &qkey, qplan,
748 fk_rel, pk_rel,
749 oldslot, NULL,
750 false,
751 true, /* treat like update */
752 SPI_OK_SELECT);
753
754 if (SPI_finish() != SPI_OK_FINISH)
755 elog(ERROR, "SPI_finish failed");
756
757 return result;
758}
759
760
761/*
762 * RI_FKey_noaction_del -
763 *
764 * Give an error and roll back the current transaction if the
765 * delete has resulted in a violation of the given referential
766 * integrity constraint.
767 */
768Datum
769RI_FKey_noaction_del(PG_FUNCTION_ARGS)
770{
771 /* Check that this is a valid trigger call on the right time and event. */
772 ri_CheckTrigger(fcinfo, "RI_FKey_noaction_del", RI_TRIGTYPE_DELETE);
773
774 /* Share code with RESTRICT/UPDATE cases. */
775 return ri_restrict((TriggerData *) fcinfo->context, true);
776}
777
778/*
779 * RI_FKey_restrict_del -
780 *
781 * Restrict delete from PK table to rows unreferenced by foreign key.
782 *
783 * The SQL standard intends that this referential action occur exactly when
784 * the delete is performed, rather than after. This appears to be
785 * the only difference between "NO ACTION" and "RESTRICT". In Postgres
786 * we still implement this as an AFTER trigger, but it's non-deferrable.
787 */
788Datum
789RI_FKey_restrict_del(PG_FUNCTION_ARGS)
790{
791 /* Check that this is a valid trigger call on the right time and event. */
792 ri_CheckTrigger(fcinfo, "RI_FKey_restrict_del", RI_TRIGTYPE_DELETE);
793
794 /* Share code with NO ACTION/UPDATE cases. */
795 return ri_restrict((TriggerData *) fcinfo->context, false);
796}
797
798/*
799 * RI_FKey_noaction_upd -
800 *
801 * Give an error and roll back the current transaction if the
802 * update has resulted in a violation of the given referential
803 * integrity constraint.
804 */
805Datum
806RI_FKey_noaction_upd(PG_FUNCTION_ARGS)
807{
808 /* Check that this is a valid trigger call on the right time and event. */
809 ri_CheckTrigger(fcinfo, "RI_FKey_noaction_upd", RI_TRIGTYPE_UPDATE);
810
811 /* Share code with RESTRICT/DELETE cases. */
812 return ri_restrict((TriggerData *) fcinfo->context, true);
813}
814
815/*
816 * RI_FKey_restrict_upd -
817 *
818 * Restrict update of PK to rows unreferenced by foreign key.
819 *
820 * The SQL standard intends that this referential action occur exactly when
821 * the update is performed, rather than after. This appears to be
822 * the only difference between "NO ACTION" and "RESTRICT". In Postgres
823 * we still implement this as an AFTER trigger, but it's non-deferrable.
824 */
825Datum
826RI_FKey_restrict_upd(PG_FUNCTION_ARGS)
827{
828 /* Check that this is a valid trigger call on the right time and event. */
829 ri_CheckTrigger(fcinfo, "RI_FKey_restrict_upd", RI_TRIGTYPE_UPDATE);
830
831 /* Share code with NO ACTION/DELETE cases. */
832 return ri_restrict((TriggerData *) fcinfo->context, false);
833}
834
835/*
836 * ri_restrict -
837 *
838 * Common code for ON DELETE RESTRICT, ON DELETE NO ACTION,
839 * ON UPDATE RESTRICT, and ON UPDATE NO ACTION.
840 */
841static Datum
842ri_restrict(TriggerData *trigdata, bool is_no_action)
843{
844 const RI_ConstraintInfo *riinfo;
845 Relation fk_rel;
846 Relation pk_rel;
847 TupleTableSlot *oldslot;
848 RI_QueryKey qkey;
849 SPIPlanPtr qplan;
850
851 riinfo = ri_FetchConstraintInfo(trigdata->tg_trigger,
852 trigdata->tg_relation, true);
853
854 /*
855 * Get the relation descriptors of the FK and PK tables and the old tuple.
856 *
857 * fk_rel is opened in RowShareLock mode since that's what our eventual
858 * SELECT FOR KEY SHARE will get on it.
859 */
860 fk_rel = table_open(riinfo->fk_relid, RowShareLock);
861 pk_rel = trigdata->tg_relation;
862 oldslot = trigdata->tg_trigslot;
863
864 /*
865 * If another PK row now exists providing the old key values, we should
866 * not do anything. However, this check should only be made in the NO
867 * ACTION case; in RESTRICT cases we don't wish to allow another row to be
868 * substituted.
869 *
870 * If the foreign key has PERIOD, we incorporate looking for replacement
871 * rows in the main SQL query below, so we needn't do it here.
872 */
873 if (is_no_action && !riinfo->hasperiod &&
874 ri_Check_Pk_Match(pk_rel, fk_rel, oldslot, riinfo))
875 {
876 table_close(fk_rel, RowShareLock);
877 return PointerGetDatum(NULL);
878 }
879
880 SPI_connect();
881
882 /*
883 * Fetch or prepare a saved plan for the restrict lookup (it's the same
884 * query for delete and update cases)
885 */
886 ri_BuildQueryKey(&qkey, riinfo, is_no_action ? RI_PLAN_NO_ACTION : RI_PLAN_RESTRICT);
887
888 if ((qplan = ri_FetchPreparedPlan(&qkey)) == NULL)
889 {
890 StringInfoData querybuf;
891 char pkrelname[MAX_QUOTED_REL_NAME_LEN];
892 char fkrelname[MAX_QUOTED_REL_NAME_LEN];
893 char attname[MAX_QUOTED_NAME_LEN];
894 char periodattname[MAX_QUOTED_NAME_LEN];
895 char paramname[16];
896 const char *querysep;
897 Oid queryoids[RI_MAX_NUMKEYS];
898 const char *fk_only;
899
900 /* ----------
901 * The query string built is
902 * SELECT 1 FROM [ONLY] <fktable> x WHERE $1 = fkatt1 [AND ...]
903 * FOR KEY SHARE OF x
904 * The type id's for the $ parameters are those of the
905 * corresponding PK attributes.
906 * ----------
907 */
908 initStringInfo(&querybuf);
909 fk_only = fk_rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE ?
910 "" : "ONLY ";
911 quoteRelationName(fkrelname, fk_rel);
912 appendStringInfo(&querybuf, "SELECT 1 FROM %s%s x",
913 fk_only, fkrelname);
914 querysep = "WHERE";
915 for (int i = 0; i < riinfo->nkeys; i++)
916 {
917 Oid pk_type = RIAttType(pk_rel, riinfo->pk_attnums[i]);
918 Oid fk_type = RIAttType(fk_rel, riinfo->fk_attnums[i]);
919
920 quoteOneName(attname,
921 RIAttName(fk_rel, riinfo->fk_attnums[i]));
922 sprintf(paramname, "$%d", i + 1);
923 ri_GenerateQual(&querybuf, querysep,
924 paramname, pk_type,
925 riinfo->pf_eq_oprs[i],
926 attname, fk_type);
927 querysep = "AND";
928 queryoids[i] = pk_type;
929 }
930
931 /*----------
932 * For temporal foreign keys, a reference could still be valid if the
933 * referenced range didn't change too much. Also if a referencing
934 * range extends past the current PK row, we don't want to check that
935 * part: some other PK row should fulfill it. We only want to check
936 * the part matching the PK record we've changed. Therefore to find
937 * invalid records we do this:
938 *
939 * SELECT 1 FROM [ONLY] <fktable> x WHERE $1 = x.fkatt1 [AND ...]
940 * -- begin temporal
941 * AND $n && x.fkperiod
942 * AND NOT coalesce((x.fkperiod * $n) <@
943 * (SELECT range_agg(r)
944 * FROM (SELECT y.pkperiod r
945 * FROM [ONLY] <pktable> y
946 * WHERE $1 = y.pkatt1 [AND ...] AND $n && y.pkperiod
947 * FOR KEY SHARE OF y) y2), false)
948 * -- end temporal
949 * FOR KEY SHARE OF x
950 *
951 * We need the coalesce in case the first subquery returns no rows.
952 * We need the second subquery because FOR KEY SHARE doesn't support
953 * aggregate queries.
954 */
955 if (riinfo->hasperiod && is_no_action)
956 {
957 Oid pk_period_type = RIAttType(pk_rel, riinfo->pk_attnums[riinfo->nkeys - 1]);
958 Oid fk_period_type = RIAttType(fk_rel, riinfo->fk_attnums[riinfo->nkeys - 1]);
959 StringInfoData intersectbuf;
960 StringInfoData replacementsbuf;
961 char *pk_only = pk_rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE ?
962 "" : "ONLY ";
963
964 quoteOneName(attname, RIAttName(fk_rel, riinfo->fk_attnums[riinfo->nkeys - 1]));
965 sprintf(paramname, "$%d", riinfo->nkeys);
966
967 appendStringInfoString(&querybuf, " AND NOT coalesce(");
968
969 /* Intersect the fk with the old pk range */
970 initStringInfo(&intersectbuf);
971 appendStringInfoChar(&intersectbuf, '(');
972 ri_GenerateQual(&intersectbuf, "",
973 attname, fk_period_type,
974 riinfo->period_intersect_oper,
975 paramname, pk_period_type);
976 appendStringInfoChar(&intersectbuf, ')');
977
978 /* Find the remaining history */
979 initStringInfo(&replacementsbuf);
980 appendStringInfoString(&replacementsbuf, "(SELECT pg_catalog.range_agg(r) FROM ");
981
982 quoteOneName(periodattname, RIAttName(pk_rel, riinfo->pk_attnums[riinfo->nkeys - 1]));
983 quoteRelationName(pkrelname, pk_rel);
984 appendStringInfo(&replacementsbuf, "(SELECT y.%s r FROM %s%s y",
985 periodattname, pk_only, pkrelname);
986
987 /* Restrict pk rows to what matches */
988 querysep = "WHERE";
989 for (int i = 0; i < riinfo->nkeys; i++)
990 {
991 Oid pk_type = RIAttType(pk_rel, riinfo->pk_attnums[i]);
992
993 quoteOneName(attname,
994 RIAttName(pk_rel, riinfo->pk_attnums[i]));
995 sprintf(paramname, "$%d", i + 1);
996 ri_GenerateQual(&replacementsbuf, querysep,
997 paramname, pk_type,
998 riinfo->pp_eq_oprs[i],
999 attname, pk_type);
1000 querysep = "AND";
1001 queryoids[i] = pk_type;
1002 }
1003 appendStringInfoString(&replacementsbuf, " FOR KEY SHARE OF y) y2)");
1004
1005 ri_GenerateQual(&querybuf, "",
1006 intersectbuf.data, fk_period_type,
1007 riinfo->agged_period_contained_by_oper,
1008 replacementsbuf.data, ANYMULTIRANGEOID);
1009 /* end of coalesce: */
1010 appendStringInfoString(&querybuf, ", false)");
1011 }
1012
1013 appendStringInfoString(&querybuf, " FOR KEY SHARE OF x");
1014
1015 /* Prepare and save the plan */
1016 qplan = ri_PlanCheck(querybuf.data, riinfo->nkeys, queryoids,
1017 &qkey, fk_rel, pk_rel);
1018 }
1019
1020 /*
1021 * We have a plan now. Run it to check for existing references.
1022 */
1023 ri_PerformCheck(riinfo, &qkey, qplan,
1024 fk_rel, pk_rel,
1025 oldslot, NULL,
1026 !is_no_action,
1027 true, /* must detect new rows */
1028 SPI_OK_SELECT);
1029
1030 if (SPI_finish() != SPI_OK_FINISH)
1031 elog(ERROR, "SPI_finish failed");
1032
1033 table_close(fk_rel, RowShareLock);
1034
1035 return PointerGetDatum(NULL);
1036}
1037
1038
1039/*
1040 * RI_FKey_cascade_del -
1041 *
1042 * Cascaded delete foreign key references at delete event on PK table.
1043 */
1044Datum
1045RI_FKey_cascade_del(PG_FUNCTION_ARGS)
1046{
1047 TriggerData *trigdata = (TriggerData *) fcinfo->context;
1048 const RI_ConstraintInfo *riinfo;
1049 Relation fk_rel;
1050 Relation pk_rel;
1051 TupleTableSlot *oldslot;
1052 RI_QueryKey qkey;
1053 SPIPlanPtr qplan;
1054
1055 /* Check that this is a valid trigger call on the right time and event. */
1056 ri_CheckTrigger(fcinfo, "RI_FKey_cascade_del", RI_TRIGTYPE_DELETE);
1057
1058 riinfo = ri_FetchConstraintInfo(trigdata->tg_trigger,
1059 trigdata->tg_relation, true);
1060
1061 /*
1062 * Get the relation descriptors of the FK and PK tables and the old tuple.
1063 *
1064 * fk_rel is opened in RowExclusiveLock mode since that's what our
1065 * eventual DELETE will get on it.
1066 */
1067 fk_rel = table_open(riinfo->fk_relid, RowExclusiveLock);
1068 pk_rel = trigdata->tg_relation;
1069 oldslot = trigdata->tg_trigslot;
1070
1071 SPI_connect();
1072
1073 /* Fetch or prepare a saved plan for the cascaded delete */
1074 ri_BuildQueryKey(&qkey, riinfo, RI_PLAN_CASCADE_ONDELETE);
1075
1076 if ((qplan = ri_FetchPreparedPlan(&qkey)) == NULL)
1077 {
1078 StringInfoData querybuf;
1079 char fkrelname[MAX_QUOTED_REL_NAME_LEN];
1080 char attname[MAX_QUOTED_NAME_LEN];
1081 char paramname[16];
1082 const char *querysep;
1083 Oid queryoids[RI_MAX_NUMKEYS];
1084 const char *fk_only;
1085
1086 /* ----------
1087 * The query string built is
1088 * DELETE FROM [ONLY] <fktable> WHERE $1 = fkatt1 [AND ...]
1089 * The type id's for the $ parameters are those of the
1090 * corresponding PK attributes.
1091 * ----------
1092 */
1093 initStringInfo(&querybuf);
1094 fk_only = fk_rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE ?
1095 "" : "ONLY ";
1096 quoteRelationName(fkrelname, fk_rel);
1097 appendStringInfo(&querybuf, "DELETE FROM %s%s",
1098 fk_only, fkrelname);
1099 querysep = "WHERE";
1100 for (int i = 0; i < riinfo->nkeys; i++)
1101 {
1102 Oid pk_type = RIAttType(pk_rel, riinfo->pk_attnums[i]);
1103 Oid fk_type = RIAttType(fk_rel, riinfo->fk_attnums[i]);
1104
1105 quoteOneName(attname,
1106 RIAttName(fk_rel, riinfo->fk_attnums[i]));
1107 sprintf(paramname, "$%d", i + 1);
1108 ri_GenerateQual(&querybuf, querysep,
1109 paramname, pk_type,
1110 riinfo->pf_eq_oprs[i],
1111 attname, fk_type);
1112 querysep = "AND";
1113 queryoids[i] = pk_type;
1114 }
1115
1116 /* Prepare and save the plan */
1117 qplan = ri_PlanCheck(querybuf.data, riinfo->nkeys, queryoids,
1118 &qkey, fk_rel, pk_rel);
1119 }
1120
1121 /*
1122 * We have a plan now. Build up the arguments from the key values in the
1123 * deleted PK tuple and delete the referencing rows
1124 */
1125 ri_PerformCheck(riinfo, &qkey, qplan,
1126 fk_rel, pk_rel,
1127 oldslot, NULL,
1128 false,
1129 true, /* must detect new rows */
1130 SPI_OK_DELETE);
1131
1132 if (SPI_finish() != SPI_OK_FINISH)
1133 elog(ERROR, "SPI_finish failed");
1134
1135 table_close(fk_rel, RowExclusiveLock);
1136
1137 return PointerGetDatum(NULL);
1138}
1139
1140
1141/*
1142 * RI_FKey_cascade_upd -
1143 *
1144 * Cascaded update foreign key references at update event on PK table.
1145 */
1146Datum
1147RI_FKey_cascade_upd(PG_FUNCTION_ARGS)
1148{
1149 TriggerData *trigdata = (TriggerData *) fcinfo->context;
1150 const RI_ConstraintInfo *riinfo;
1151 Relation fk_rel;
1152 Relation pk_rel;
1153 TupleTableSlot *newslot;
1154 TupleTableSlot *oldslot;
1155 RI_QueryKey qkey;
1156 SPIPlanPtr qplan;
1157
1158 /* Check that this is a valid trigger call on the right time and event. */
1159 ri_CheckTrigger(fcinfo, "RI_FKey_cascade_upd", RI_TRIGTYPE_UPDATE);
1160
1161 riinfo = ri_FetchConstraintInfo(trigdata->tg_trigger,
1162 trigdata->tg_relation, true);
1163
1164 /*
1165 * Get the relation descriptors of the FK and PK tables and the new and
1166 * old tuple.
1167 *
1168 * fk_rel is opened in RowExclusiveLock mode since that's what our
1169 * eventual UPDATE will get on it.
1170 */
1171 fk_rel = table_open(riinfo->fk_relid, RowExclusiveLock);
1172 pk_rel = trigdata->tg_relation;
1173 newslot = trigdata->tg_newslot;
1174 oldslot = trigdata->tg_trigslot;
1175
1176 SPI_connect();
1177
1178 /* Fetch or prepare a saved plan for the cascaded update */
1179 ri_BuildQueryKey(&qkey, riinfo, RI_PLAN_CASCADE_ONUPDATE);
1180
1181 if ((qplan = ri_FetchPreparedPlan(&qkey)) == NULL)
1182 {
1183 StringInfoData querybuf;
1184 StringInfoData qualbuf;
1185 char fkrelname[MAX_QUOTED_REL_NAME_LEN];
1186 char attname[MAX_QUOTED_NAME_LEN];
1187 char paramname[16];
1188 const char *querysep;
1189 const char *qualsep;
1190 Oid queryoids[RI_MAX_NUMKEYS * 2];
1191 const char *fk_only;
1192
1193 /* ----------
1194 * The query string built is
1195 * UPDATE [ONLY] <fktable> SET fkatt1 = $1 [, ...]
1196 * WHERE $n = fkatt1 [AND ...]
1197 * The type id's for the $ parameters are those of the
1198 * corresponding PK attributes. Note that we are assuming
1199 * there is an assignment cast from the PK to the FK type;
1200 * else the parser will fail.
1201 * ----------
1202 */
1203 initStringInfo(&querybuf);
1204 initStringInfo(&qualbuf);
1205 fk_only = fk_rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE ?
1206 "" : "ONLY ";
1207 quoteRelationName(fkrelname, fk_rel);
1208 appendStringInfo(&querybuf, "UPDATE %s%s SET",
1209 fk_only, fkrelname);
1210 querysep = "";
1211 qualsep = "WHERE";
1212 for (int i = 0, j = riinfo->nkeys; i < riinfo->nkeys; i++, j++)
1213 {
1214 Oid pk_type = RIAttType(pk_rel, riinfo->pk_attnums[i]);
1215 Oid fk_type = RIAttType(fk_rel, riinfo->fk_attnums[i]);
1216
1217 quoteOneName(attname,
1218 RIAttName(fk_rel, riinfo->fk_attnums[i]));
1219 appendStringInfo(&querybuf,
1220 "%s %s = $%d",
1221 querysep, attname, i + 1);
1222 sprintf(paramname, "$%d", j + 1);
1223 ri_GenerateQual(&qualbuf, qualsep,
1224 paramname, pk_type,
1225 riinfo->pf_eq_oprs[i],
1226 attname, fk_type);
1227 querysep = ",";
1228 qualsep = "AND";
1229 queryoids[i] = pk_type;
1230 queryoids[j] = pk_type;
1231 }
1232 appendBinaryStringInfo(&querybuf, qualbuf.data, qualbuf.len);
1233
1234 /* Prepare and save the plan */
1235 qplan = ri_PlanCheck(querybuf.data, riinfo->nkeys * 2, queryoids,
1236 &qkey, fk_rel, pk_rel);
1237 }
1238
1239 /*
1240 * We have a plan now. Run it to update the existing references.
1241 */
1242 ri_PerformCheck(riinfo, &qkey, qplan,
1243 fk_rel, pk_rel,
1244 oldslot, newslot,
1245 false,
1246 true, /* must detect new rows */
1247 SPI_OK_UPDATE);
1248
1249 if (SPI_finish() != SPI_OK_FINISH)
1250 elog(ERROR, "SPI_finish failed");
1251
1252 table_close(fk_rel, RowExclusiveLock);
1253
1254 return PointerGetDatum(NULL);
1255}
1256
1257
1258/*
1259 * RI_FKey_setnull_del -
1260 *
1261 * Set foreign key references to NULL values at delete event on PK table.
1262 */
1263Datum
1264RI_FKey_setnull_del(PG_FUNCTION_ARGS)
1265{
1266 /* Check that this is a valid trigger call on the right time and event. */
1267 ri_CheckTrigger(fcinfo, "RI_FKey_setnull_del", RI_TRIGTYPE_DELETE);
1268
1269 /* Share code with UPDATE case */
1270 return ri_set((TriggerData *) fcinfo->context, true, RI_TRIGTYPE_DELETE);
1271}
1272
1273/*
1274 * RI_FKey_setnull_upd -
1275 *
1276 * Set foreign key references to NULL at update event on PK table.
1277 */
1278Datum
1279RI_FKey_setnull_upd(PG_FUNCTION_ARGS)
1280{
1281 /* Check that this is a valid trigger call on the right time and event. */
1282 ri_CheckTrigger(fcinfo, "RI_FKey_setnull_upd", RI_TRIGTYPE_UPDATE);
1283
1284 /* Share code with DELETE case */
1285 return ri_set((TriggerData *) fcinfo->context, true, RI_TRIGTYPE_UPDATE);
1286}
1287
1288/*
1289 * RI_FKey_setdefault_del -
1290 *
1291 * Set foreign key references to defaults at delete event on PK table.
1292 */
1293Datum
1294RI_FKey_setdefault_del(PG_FUNCTION_ARGS)
1295{
1296 /* Check that this is a valid trigger call on the right time and event. */
1297 ri_CheckTrigger(fcinfo, "RI_FKey_setdefault_del", RI_TRIGTYPE_DELETE);
1298
1299 /* Share code with UPDATE case */
1300 return ri_set((TriggerData *) fcinfo->context, false, RI_TRIGTYPE_DELETE);
1301}
1302
1303/*
1304 * RI_FKey_setdefault_upd -
1305 *
1306 * Set foreign key references to defaults at update event on PK table.
1307 */
1308Datum
1309RI_FKey_setdefault_upd(PG_FUNCTION_ARGS)
1310{
1311 /* Check that this is a valid trigger call on the right time and event. */
1312 ri_CheckTrigger(fcinfo, "RI_FKey_setdefault_upd", RI_TRIGTYPE_UPDATE);
1313
1314 /* Share code with DELETE case */
1315 return ri_set((TriggerData *) fcinfo->context, false, RI_TRIGTYPE_UPDATE);
1316}
1317
1318/*
1319 * ri_set -
1320 *
1321 * Common code for ON DELETE SET NULL, ON DELETE SET DEFAULT, ON UPDATE SET
1322 * NULL, and ON UPDATE SET DEFAULT.
1323 */
1324static Datum
1325ri_set(TriggerData *trigdata, bool is_set_null, int tgkind)
1326{
1327 const RI_ConstraintInfo *riinfo;
1328 Relation fk_rel;
1329 Relation pk_rel;
1330 TupleTableSlot *oldslot;
1331 RI_QueryKey qkey;
1332 SPIPlanPtr qplan;
1333 int32 queryno;
1334
1335 riinfo = ri_FetchConstraintInfo(trigdata->tg_trigger,
1336 trigdata->tg_relation, true);
1337
1338 /*
1339 * Get the relation descriptors of the FK and PK tables and the old tuple.
1340 *
1341 * fk_rel is opened in RowExclusiveLock mode since that's what our
1342 * eventual UPDATE will get on it.
1343 */
1344 fk_rel = table_open(riinfo->fk_relid, RowExclusiveLock);
1345 pk_rel = trigdata->tg_relation;
1346 oldslot = trigdata->tg_trigslot;
1347
1348 SPI_connect();
1349
1350 /*
1351 * Fetch or prepare a saved plan for the trigger.
1352 */
1353 switch (tgkind)
1354 {
1355 case RI_TRIGTYPE_UPDATE:
1356 queryno = is_set_null
1357 ? RI_PLAN_SETNULL_ONUPDATE
1358 : RI_PLAN_SETDEFAULT_ONUPDATE;
1359 break;
1360 case RI_TRIGTYPE_DELETE:
1361 queryno = is_set_null
1362 ? RI_PLAN_SETNULL_ONDELETE
1363 : RI_PLAN_SETDEFAULT_ONDELETE;
1364 break;
1365 default:
1366 elog(ERROR, "invalid tgkind passed to ri_set");
1367 }
1368
1369 ri_BuildQueryKey(&qkey, riinfo, queryno);
1370
1371 if ((qplan = ri_FetchPreparedPlan(&qkey)) == NULL)
1372 {
1373 StringInfoData querybuf;
1374 char fkrelname[MAX_QUOTED_REL_NAME_LEN];
1375 char attname[MAX_QUOTED_NAME_LEN];
1376 char paramname[16];
1377 const char *querysep;
1378 const char *qualsep;
1379 Oid queryoids[RI_MAX_NUMKEYS];
1380 const char *fk_only;
1381 int num_cols_to_set;
1382 const int16 *set_cols;
1383
1384 switch (tgkind)
1385 {
1386 case RI_TRIGTYPE_UPDATE:
1387 num_cols_to_set = riinfo->nkeys;
1388 set_cols = riinfo->fk_attnums;
1389 break;
1390 case RI_TRIGTYPE_DELETE:
1391
1392 /*
1393 * If confdelsetcols are present, then we only update the
1394 * columns specified in that array, otherwise we update all
1395 * the referencing columns.
1396 */
1397 if (riinfo->ndelsetcols != 0)
1398 {
1399 num_cols_to_set = riinfo->ndelsetcols;
1400 set_cols = riinfo->confdelsetcols;
1401 }
1402 else
1403 {
1404 num_cols_to_set = riinfo->nkeys;
1405 set_cols = riinfo->fk_attnums;
1406 }
1407 break;
1408 default:
1409 elog(ERROR, "invalid tgkind passed to ri_set");
1410 }
1411
1412 /* ----------
1413 * The query string built is
1414 * UPDATE [ONLY] <fktable> SET fkatt1 = {NULL|DEFAULT} [, ...]
1415 * WHERE $1 = fkatt1 [AND ...]
1416 * The type id's for the $ parameters are those of the
1417 * corresponding PK attributes.
1418 * ----------
1419 */
1420 initStringInfo(&querybuf);
1421 fk_only = fk_rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE ?
1422 "" : "ONLY ";
1423 quoteRelationName(fkrelname, fk_rel);
1424 appendStringInfo(&querybuf, "UPDATE %s%s SET",
1425 fk_only, fkrelname);
1426
1427 /*
1428 * Add assignment clauses
1429 */
1430 querysep = "";
1431 for (int i = 0; i < num_cols_to_set; i++)
1432 {
1433 quoteOneName(attname, RIAttName(fk_rel, set_cols[i]));
1434 appendStringInfo(&querybuf,
1435 "%s %s = %s",
1436 querysep, attname,
1437 is_set_null ? "NULL" : "DEFAULT");
1438 querysep = ",";
1439 }
1440
1441 /*
1442 * Add WHERE clause
1443 */
1444 qualsep = "WHERE";
1445 for (int i = 0; i < riinfo->nkeys; i++)
1446 {
1447 Oid pk_type = RIAttType(pk_rel, riinfo->pk_attnums[i]);
1448 Oid fk_type = RIAttType(fk_rel, riinfo->fk_attnums[i]);
1449
1450 quoteOneName(attname,
1451 RIAttName(fk_rel, riinfo->fk_attnums[i]));
1452
1453 sprintf(paramname, "$%d", i + 1);
1454 ri_GenerateQual(&querybuf, qualsep,
1455 paramname, pk_type,
1456 riinfo->pf_eq_oprs[i],
1457 attname, fk_type);
1458 qualsep = "AND";
1459 queryoids[i] = pk_type;
1460 }
1461
1462 /* Prepare and save the plan */
1463 qplan = ri_PlanCheck(querybuf.data, riinfo->nkeys, queryoids,
1464 &qkey, fk_rel, pk_rel);
1465 }
1466
1467 /*
1468 * We have a plan now. Run it to update the existing references.
1469 */
1470 ri_PerformCheck(riinfo, &qkey, qplan,
1471 fk_rel, pk_rel,
1472 oldslot, NULL,
1473 false,
1474 true, /* must detect new rows */
1475 SPI_OK_UPDATE);
1476
1477 if (SPI_finish() != SPI_OK_FINISH)
1478 elog(ERROR, "SPI_finish failed");
1479
1480 table_close(fk_rel, RowExclusiveLock);
1481
1482 if (is_set_null)
1483 return PointerGetDatum(NULL);
1484 else
1485 {
1486 /*
1487 * If we just deleted or updated the PK row whose key was equal to the
1488 * FK columns' default values, and a referencing row exists in the FK
1489 * table, we would have updated that row to the same values it already
1490 * had --- and RI_FKey_fk_upd_check_required would hence believe no
1491 * check is necessary. So we need to do another lookup now and in
1492 * case a reference still exists, abort the operation. That is
1493 * already implemented in the NO ACTION trigger, so just run it. (This
1494 * recheck is only needed in the SET DEFAULT case, since CASCADE would
1495 * remove such rows in case of a DELETE operation or would change the
1496 * FK key values in case of an UPDATE, while SET NULL is certain to
1497 * result in rows that satisfy the FK constraint.)
1498 */
1499 return ri_restrict(trigdata, true);
1500 }
1501}
1502
1503
1504/*
1505 * RI_FKey_pk_upd_check_required -
1506 *
1507 * Check if we really need to fire the RI trigger for an update or delete to a PK
1508 * relation. This is called by the AFTER trigger queue manager to see if
1509 * it can skip queuing an instance of an RI trigger. Returns true if the
1510 * trigger must be fired, false if we can prove the constraint will still
1511 * be satisfied.
1512 *
1513 * newslot will be NULL if this is called for a delete.
1514 */
1515bool
1516RI_FKey_pk_upd_check_required(Trigger *trigger, Relation pk_rel,
1517 TupleTableSlot *oldslot, TupleTableSlot *newslot)
1518{
1519 const RI_ConstraintInfo *riinfo;
1520
1521 riinfo = ri_FetchConstraintInfo(trigger, pk_rel, true);
1522
1523 /*
1524 * If any old key value is NULL, the row could not have been referenced by
1525 * an FK row, so no check is needed.
1526 */
1527 if (ri_NullCheck(RelationGetDescr(pk_rel), oldslot, riinfo, true) != RI_KEYS_NONE_NULL)
1528 return false;
1529
1530 /* If all old and new key values are equal, no check is needed */
1531 if (newslot && ri_KeysEqual(pk_rel, oldslot, newslot, riinfo, true))
1532 return false;
1533
1534 /* Else we need to fire the trigger. */
1535 return true;
1536}
1537
1538/*
1539 * RI_FKey_fk_upd_check_required -
1540 *
1541 * Check if we really need to fire the RI trigger for an update to an FK
1542 * relation. This is called by the AFTER trigger queue manager to see if
1543 * it can skip queuing an instance of an RI trigger. Returns true if the
1544 * trigger must be fired, false if we can prove the constraint will still
1545 * be satisfied.
1546 */
1547bool
1548RI_FKey_fk_upd_check_required(Trigger *trigger, Relation fk_rel,
1549 TupleTableSlot *oldslot, TupleTableSlot *newslot)
1550{
1551 const RI_ConstraintInfo *riinfo;
1552 int ri_nullcheck;
1553
1554 /*
1555 * AfterTriggerSaveEvent() handles things such that this function is never
1556 * called for partitioned tables.
1557 */
1558 Assert(fk_rel->rd_rel->relkind != RELKIND_PARTITIONED_TABLE);
1559
1560 riinfo = ri_FetchConstraintInfo(trigger, fk_rel, false);
1561
1562 ri_nullcheck = ri_NullCheck(RelationGetDescr(fk_rel), newslot, riinfo, false);
1563
1564 /*
1565 * If all new key values are NULL, the row satisfies the constraint, so no
1566 * check is needed.
1567 */
1568 if (ri_nullcheck == RI_KEYS_ALL_NULL)
1569 return false;
1570
1571 /*
1572 * If some new key values are NULL, the behavior depends on the match
1573 * type.
1574 */
1575 else if (ri_nullcheck == RI_KEYS_SOME_NULL)
1576 {
1577 switch (riinfo->confmatchtype)
1578 {
1579 case FKCONSTR_MATCH_SIMPLE:
1580
1581 /*
1582 * If any new key value is NULL, the row must satisfy the
1583 * constraint, so no check is needed.
1584 */
1585 return false;
1586
1587 case FKCONSTR_MATCH_PARTIAL:
1588
1589 /*
1590 * Don't know, must run full check.
1591 */
1592 break;
1593
1594 case FKCONSTR_MATCH_FULL:
1595
1596 /*
1597 * If some new key values are NULL, the row fails the
1598 * constraint. We must not throw error here, because the row
1599 * might get invalidated before the constraint is to be
1600 * checked, but we should queue the event to apply the check
1601 * later.
1602 */
1603 return true;
1604 }
1605 }
1606
1607 /*
1608 * Continues here for no new key values are NULL, or we couldn't decide
1609 * yet.
1610 */
1611
1612 /*
1613 * If the original row was inserted by our own transaction, we must fire
1614 * the trigger whether or not the keys are equal. This is because our
1615 * UPDATE will invalidate the INSERT so that the INSERT RI trigger will
1616 * not do anything; so we had better do the UPDATE check. (We could skip
1617 * this if we knew the INSERT trigger already fired, but there is no easy
1618 * way to know that.)
1619 */
1620 if (slot_is_current_xact_tuple(oldslot))
1621 return true;
1622
1623 /* If all old and new key values are equal, no check is needed */
1624 if (ri_KeysEqual(fk_rel, oldslot, newslot, riinfo, false))
1625 return false;
1626
1627 /* Else we need to fire the trigger. */
1628 return true;
1629}
1630
1631/*
1632 * RI_Initial_Check -
1633 *
1634 * Check an entire table for non-matching values using a single query.
1635 * This is not a trigger procedure, but is called during ALTER TABLE
1636 * ADD FOREIGN KEY to validate the initial table contents.
1637 *
1638 * We expect that the caller has made provision to prevent any problems
1639 * caused by concurrent actions. This could be either by locking rel and
1640 * pkrel at ShareRowExclusiveLock or higher, or by otherwise ensuring
1641 * that triggers implementing the checks are already active.
1642 * Hence, we do not need to lock individual rows for the check.
1643 *
1644 * If the check fails because the current user doesn't have permissions
1645 * to read both tables, return false to let our caller know that they will
1646 * need to do something else to check the constraint.
1647 */
1648bool
1649RI_Initial_Check(Trigger *trigger, Relation fk_rel, Relation pk_rel)
1650{
1651 const RI_ConstraintInfo *riinfo;
1652 StringInfoData querybuf;
1653 char pkrelname[MAX_QUOTED_REL_NAME_LEN];
1654 char fkrelname[MAX_QUOTED_REL_NAME_LEN];
1655 char pkattname[MAX_QUOTED_NAME_LEN + 3];
1656 char fkattname[MAX_QUOTED_NAME_LEN + 3];
1657 RangeTblEntry *rte;
1658 RTEPermissionInfo *pk_perminfo;
1659 RTEPermissionInfo *fk_perminfo;
1660 List *rtes = NIL;
1661 List *perminfos = NIL;
1662 const char *sep;
1663 const char *fk_only;
1664 const char *pk_only;
1665 int save_nestlevel;
1666 char workmembuf[32];
1667 int spi_result;
1668 SPIPlanPtr qplan;
1669
1670 riinfo = ri_FetchConstraintInfo(trigger, fk_rel, false);
1671
1672 /*
1673 * Check to make sure current user has enough permissions to do the test
1674 * query. (If not, caller can fall back to the trigger method, which
1675 * works because it changes user IDs on the fly.)
1676 *
1677 * XXX are there any other show-stopper conditions to check?
1678 */
1679 pk_perminfo = makeNode(RTEPermissionInfo);
1680 pk_perminfo->relid = RelationGetRelid(pk_rel);
1681 pk_perminfo->requiredPerms = ACL_SELECT;
1682 perminfos = lappend(perminfos, pk_perminfo);
1683 rte = makeNode(RangeTblEntry);
1684 rte->rtekind = RTE_RELATION;
1685 rte->relid = RelationGetRelid(pk_rel);
1686 rte->relkind = pk_rel->rd_rel->relkind;
1687 rte->rellockmode = AccessShareLock;
1688 rte->perminfoindex = list_length(perminfos);
1689 rtes = lappend(rtes, rte);
1690
1691 fk_perminfo = makeNode(RTEPermissionInfo);
1692 fk_perminfo->relid = RelationGetRelid(fk_rel);
1693 fk_perminfo->requiredPerms = ACL_SELECT;
1694 perminfos = lappend(perminfos, fk_perminfo);
1695 rte = makeNode(RangeTblEntry);
1696 rte->rtekind = RTE_RELATION;
1697 rte->relid = RelationGetRelid(fk_rel);
1698 rte->relkind = fk_rel->rd_rel->relkind;
1699 rte->rellockmode = AccessShareLock;
1700 rte->perminfoindex = list_length(perminfos);
1701 rtes = lappend(rtes, rte);
1702
1703 for (int i = 0; i < riinfo->nkeys; i++)
1704 {
1705 int attno;
1706
1707 attno = riinfo->pk_attnums[i] - FirstLowInvalidHeapAttributeNumber;
1708 pk_perminfo->selectedCols = bms_add_member(pk_perminfo->selectedCols, attno);
1709
1710 attno = riinfo->fk_attnums[i] - FirstLowInvalidHeapAttributeNumber;
1711 fk_perminfo->selectedCols = bms_add_member(fk_perminfo->selectedCols, attno);
1712 }
1713
1714 if (!ExecCheckPermissions(rtes, perminfos, false))
1715 return false;
1716
1717 /*
1718 * Also punt if RLS is enabled on either table unless this role has the
1719 * bypassrls right or is the table owner of the table(s) involved which
1720 * have RLS enabled.
1721 */
1722 if (!has_bypassrls_privilege(GetUserId()) &&
1723 ((pk_rel->rd_rel->relrowsecurity &&
1724 !object_ownercheck(RelationRelationId, RelationGetRelid(pk_rel),
1725 GetUserId())) ||
1726 (fk_rel->rd_rel->relrowsecurity &&
1727 !object_ownercheck(RelationRelationId, RelationGetRelid(fk_rel),
1728 GetUserId()))))
1729 return false;
1730
1731 /*----------
1732 * The query string built is:
1733 * SELECT fk.keycols FROM [ONLY] relname fk
1734 * LEFT OUTER JOIN [ONLY] pkrelname pk
1735 * ON (pk.pkkeycol1=fk.keycol1 [AND ...])
1736 * WHERE pk.pkkeycol1 IS NULL AND
1737 * For MATCH SIMPLE:
1738 * (fk.keycol1 IS NOT NULL [AND ...])
1739 * For MATCH FULL:
1740 * (fk.keycol1 IS NOT NULL [OR ...])
1741 *
1742 * We attach COLLATE clauses to the operators when comparing columns
1743 * that have different collations.
1744 *----------
1745 */
1746 initStringInfo(&querybuf);
1747 appendStringInfoString(&querybuf, "SELECT ");
1748 sep = "";
1749 for (int i = 0; i < riinfo->nkeys; i++)
1750 {
1751 quoteOneName(fkattname,
1752 RIAttName(fk_rel, riinfo->fk_attnums[i]));
1753 appendStringInfo(&querybuf, "%sfk.%s", sep, fkattname);
1754 sep = ", ";
1755 }
1756
1757 quoteRelationName(pkrelname, pk_rel);
1758 quoteRelationName(fkrelname, fk_rel);
1759 fk_only = fk_rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE ?
1760 "" : "ONLY ";
1761 pk_only = pk_rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE ?
1762 "" : "ONLY ";
1763 appendStringInfo(&querybuf,
1764 " FROM %s%s fk LEFT OUTER JOIN %s%s pk ON",
1765 fk_only, fkrelname, pk_only, pkrelname);
1766
1767 strcpy(pkattname, "pk.");
1768 strcpy(fkattname, "fk.");
1769 sep = "(";
1770 for (int i = 0; i < riinfo->nkeys; i++)
1771 {
1772 Oid pk_type = RIAttType(pk_rel, riinfo->pk_attnums[i]);
1773 Oid fk_type = RIAttType(fk_rel, riinfo->fk_attnums[i]);
1774 Oid pk_coll = RIAttCollation(pk_rel, riinfo->pk_attnums[i]);
1775 Oid fk_coll = RIAttCollation(fk_rel, riinfo->fk_attnums[i]);
1776
1777 quoteOneName(pkattname + 3,
1778 RIAttName(pk_rel, riinfo->pk_attnums[i]));
1779 quoteOneName(fkattname + 3,
1780 RIAttName(fk_rel, riinfo->fk_attnums[i]));
1781 ri_GenerateQual(&querybuf, sep,
1782 pkattname, pk_type,
1783 riinfo->pf_eq_oprs[i],
1784 fkattname, fk_type);
1785 if (pk_coll != fk_coll)
1786 ri_GenerateQualCollation(&querybuf, pk_coll);
1787 sep = "AND";
1788 }
1789
1790 /*
1791 * It's sufficient to test any one pk attribute for null to detect a join
1792 * failure.
1793 */
1794 quoteOneName(pkattname, RIAttName(pk_rel, riinfo->pk_attnums[0]));
1795 appendStringInfo(&querybuf, ") WHERE pk.%s IS NULL AND (", pkattname);
1796
1797 sep = "";
1798 for (int i = 0; i < riinfo->nkeys; i++)
1799 {
1800 quoteOneName(fkattname, RIAttName(fk_rel, riinfo->fk_attnums[i]));
1801 appendStringInfo(&querybuf,
1802 "%sfk.%s IS NOT NULL",
1803 sep, fkattname);
1804 switch (riinfo->confmatchtype)
1805 {
1806 case FKCONSTR_MATCH_SIMPLE:
1807 sep = " AND ";
1808 break;
1809 case FKCONSTR_MATCH_FULL:
1810 sep = " OR ";
1811 break;
1812 }
1813 }
1814 appendStringInfoChar(&querybuf, ')');
1815
1816 /*
1817 * Temporarily increase work_mem so that the check query can be executed
1818 * more efficiently. It seems okay to do this because the query is simple
1819 * enough to not use a multiple of work_mem, and one typically would not
1820 * have many large foreign-key validations happening concurrently. So
1821 * this seems to meet the criteria for being considered a "maintenance"
1822 * operation, and accordingly we use maintenance_work_mem. However, we
1823 * must also set hash_mem_multiplier to 1, since it is surely not okay to
1824 * let that get applied to the maintenance_work_mem value.
1825 *
1826 * We use the equivalent of a function SET option to allow the setting to
1827 * persist for exactly the duration of the check query. guc.c also takes
1828 * care of undoing the setting on error.
1829 */
1830 save_nestlevel = NewGUCNestLevel();
1831
1832 snprintf(workmembuf, sizeof(workmembuf), "%d", maintenance_work_mem);
1833 (void) set_config_option("work_mem", workmembuf,
1834 PGC_USERSET, PGC_S_SESSION,
1835 GUC_ACTION_SAVE, true, 0, false);
1836 (void) set_config_option("hash_mem_multiplier", "1",
1837 PGC_USERSET, PGC_S_SESSION,
1838 GUC_ACTION_SAVE, true, 0, false);
1839
1840 SPI_connect();
1841
1842 /*
1843 * Generate the plan. We don't need to cache it, and there are no
1844 * arguments to the plan.
1845 */
1846 qplan = SPI_prepare(querybuf.data, 0, NULL);
1847
1848 if (qplan == NULL)
1849 elog(ERROR, "SPI_prepare returned %s for %s",
1850 SPI_result_code_string(SPI_result), querybuf.data);
1851
1852 /*
1853 * Run the plan. For safety we force a current snapshot to be used. (In
1854 * transaction-snapshot mode, this arguably violates transaction isolation
1855 * rules, but we really haven't got much choice.) We don't need to
1856 * register the snapshot, because SPI_execute_snapshot will see to it. We
1857 * need at most one tuple returned, so pass limit = 1.
1858 */
1859 spi_result = SPI_execute_snapshot(qplan,
1860 NULL, NULL,
1861 GetLatestSnapshot(),
1862 InvalidSnapshot,
1863 true, false, 1);
1864
1865 /* Check result */
1866 if (spi_result != SPI_OK_SELECT)
1867 elog(ERROR, "SPI_execute_snapshot returned %s", SPI_result_code_string(spi_result));
1868
1869 /* Did we find a tuple violating the constraint? */
1870 if (SPI_processed > 0)
1871 {
1872 TupleTableSlot *slot;
1873 HeapTuple tuple = SPI_tuptable->vals[0];
1874 TupleDesc tupdesc = SPI_tuptable->tupdesc;
1875 RI_ConstraintInfo fake_riinfo;
1876
1877 slot = MakeSingleTupleTableSlot(tupdesc, &TTSOpsVirtual);
1878
1879 heap_deform_tuple(tuple, tupdesc,
1880 slot->tts_values, slot->tts_isnull);
1881 ExecStoreVirtualTuple(slot);
1882
1883 /*
1884 * The columns to look at in the result tuple are 1..N, not whatever
1885 * they are in the fk_rel. Hack up riinfo so that the subroutines
1886 * called here will behave properly.
1887 *
1888 * In addition to this, we have to pass the correct tupdesc to
1889 * ri_ReportViolation, overriding its normal habit of using the pk_rel
1890 * or fk_rel's tupdesc.
1891 */
1892 memcpy(&fake_riinfo, riinfo, sizeof(RI_ConstraintInfo));
1893 for (int i = 0; i < fake_riinfo.nkeys; i++)
1894 fake_riinfo.fk_attnums[i] = i + 1;
1895
1896 /*
1897 * If it's MATCH FULL, and there are any nulls in the FK keys,
1898 * complain about that rather than the lack of a match. MATCH FULL
1899 * disallows partially-null FK rows.
1900 */
1901 if (fake_riinfo.confmatchtype == FKCONSTR_MATCH_FULL &&
1902 ri_NullCheck(tupdesc, slot, &fake_riinfo, false) != RI_KEYS_NONE_NULL)
1903 ereport(ERROR,
1904 (errcode(ERRCODE_FOREIGN_KEY_VIOLATION),
1905 errmsg("insert or update on table \"%s\" violates foreign key constraint \"%s\"",
1906 RelationGetRelationName(fk_rel),
1907 NameStr(fake_riinfo.conname)),
1908 errdetail("MATCH FULL does not allow mixing of null and nonnull key values."),
1909 errtableconstraint(fk_rel,
1910 NameStr(fake_riinfo.conname))));
1911
1912 /*
1913 * We tell ri_ReportViolation we were doing the RI_PLAN_CHECK_LOOKUPPK
1914 * query, which isn't true, but will cause it to use
1915 * fake_riinfo.fk_attnums as we need.
1916 */
1917 ri_ReportViolation(&fake_riinfo,
1918 pk_rel, fk_rel,
1919 slot, tupdesc,
1920 RI_PLAN_CHECK_LOOKUPPK, false, false);
1921
1922 ExecDropSingleTupleTableSlot(slot);
1923 }
1924
1925 if (SPI_finish() != SPI_OK_FINISH)
1926 elog(ERROR, "SPI_finish failed");
1927
1928 /*
1929 * Restore work_mem and hash_mem_multiplier.
1930 */
1931 AtEOXact_GUC(true, save_nestlevel);
1932
1933 return true;
1934}
1935
1936/*
1937 * RI_PartitionRemove_Check -
1938 *
1939 * Verify no referencing values exist, when a partition is detached on
1940 * the referenced side of a foreign key constraint.
1941 */
1942void
1943RI_PartitionRemove_Check(Trigger *trigger, Relation fk_rel, Relation pk_rel)
1944{
1945 const RI_ConstraintInfo *riinfo;
1946 StringInfoData querybuf;
1947 char *constraintDef;
1948 char pkrelname[MAX_QUOTED_REL_NAME_LEN];
1949 char fkrelname[MAX_QUOTED_REL_NAME_LEN];
1950 char pkattname[MAX_QUOTED_NAME_LEN + 3];
1951 char fkattname[MAX_QUOTED_NAME_LEN + 3];
1952 const char *sep;
1953 const char *fk_only;
1954 int save_nestlevel;
1955 char workmembuf[32];
1956 int spi_result;
1957 SPIPlanPtr qplan;
1958 int i;
1959
1960 riinfo = ri_FetchConstraintInfo(trigger, fk_rel, false);
1961
1962 /*
1963 * We don't check permissions before displaying the error message, on the
1964 * assumption that the user detaching the partition must have enough
1965 * privileges to examine the table contents anyhow.
1966 */
1967
1968 /*----------
1969 * The query string built is:
1970 * SELECT fk.keycols FROM [ONLY] relname fk
1971 * JOIN pkrelname pk
1972 * ON (pk.pkkeycol1=fk.keycol1 [AND ...])
1973 * WHERE (<partition constraint>) AND
1974 * For MATCH SIMPLE:
1975 * (fk.keycol1 IS NOT NULL [AND ...])
1976 * For MATCH FULL:
1977 * (fk.keycol1 IS NOT NULL [OR ...])
1978 *
1979 * We attach COLLATE clauses to the operators when comparing columns
1980 * that have different collations.
1981 *----------
1982 */
1983 initStringInfo(&querybuf);
1984 appendStringInfoString(&querybuf, "SELECT ");
1985 sep = "";
1986 for (i = 0; i < riinfo->nkeys; i++)
1987 {
1988 quoteOneName(fkattname,
1989 RIAttName(fk_rel, riinfo->fk_attnums[i]));
1990 appendStringInfo(&querybuf, "%sfk.%s", sep, fkattname);
1991 sep = ", ";
1992 }
1993
1994 quoteRelationName(pkrelname, pk_rel);
1995 quoteRelationName(fkrelname, fk_rel);
1996 fk_only = fk_rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE ?
1997 "" : "ONLY ";
1998 appendStringInfo(&querybuf,
1999 " FROM %s%s fk JOIN %s pk ON",
2000 fk_only, fkrelname, pkrelname);
2001 strcpy(pkattname, "pk.");
2002 strcpy(fkattname, "fk.");
2003 sep = "(";
2004 for (i = 0; i < riinfo->nkeys; i++)
2005 {
2006 Oid pk_type = RIAttType(pk_rel, riinfo->pk_attnums[i]);
2007 Oid fk_type = RIAttType(fk_rel, riinfo->fk_attnums[i]);
2008 Oid pk_coll = RIAttCollation(pk_rel, riinfo->pk_attnums[i]);
2009 Oid fk_coll = RIAttCollation(fk_rel, riinfo->fk_attnums[i]);
2010
2011 quoteOneName(pkattname + 3,
2012 RIAttName(pk_rel, riinfo->pk_attnums[i]));
2013 quoteOneName(fkattname + 3,
2014 RIAttName(fk_rel, riinfo->fk_attnums[i]));
2015 ri_GenerateQual(&querybuf, sep,
2016 pkattname, pk_type,
2017 riinfo->pf_eq_oprs[i],
2018 fkattname, fk_type);
2019 if (pk_coll != fk_coll)
2020 ri_GenerateQualCollation(&querybuf, pk_coll);
2021 sep = "AND";
2022 }
2023
2024 /*
2025 * Start the WHERE clause with the partition constraint (except if this is
2026 * the default partition and there's no other partition, because the
2027 * partition constraint is the empty string in that case.)
2028 */
2029 constraintDef = pg_get_partconstrdef_string(RelationGetRelid(pk_rel), "pk");
2030 if (constraintDef && constraintDef[0] != '\0')
2031 appendStringInfo(&querybuf, ") WHERE %s AND (",
2032 constraintDef);
2033 else
2034 appendStringInfoString(&querybuf, ") WHERE (");
2035
2036 sep = "";
2037 for (i = 0; i < riinfo->nkeys; i++)
2038 {
2039 quoteOneName(fkattname, RIAttName(fk_rel, riinfo->fk_attnums[i]));
2040 appendStringInfo(&querybuf,
2041 "%sfk.%s IS NOT NULL",
2042 sep, fkattname);
2043 switch (riinfo->confmatchtype)
2044 {
2045 case FKCONSTR_MATCH_SIMPLE:
2046 sep = " AND ";
2047 break;
2048 case FKCONSTR_MATCH_FULL:
2049 sep = " OR ";
2050 break;
2051 }
2052 }
2053 appendStringInfoChar(&querybuf, ')');
2054
2055 /*
2056 * Temporarily increase work_mem so that the check query can be executed
2057 * more efficiently. It seems okay to do this because the query is simple
2058 * enough to not use a multiple of work_mem, and one typically would not
2059 * have many large foreign-key validations happening concurrently. So
2060 * this seems to meet the criteria for being considered a "maintenance"
2061 * operation, and accordingly we use maintenance_work_mem. However, we
2062 * must also set hash_mem_multiplier to 1, since it is surely not okay to
2063 * let that get applied to the maintenance_work_mem value.
2064 *
2065 * We use the equivalent of a function SET option to allow the setting to
2066 * persist for exactly the duration of the check query. guc.c also takes
2067 * care of undoing the setting on error.
2068 */
2069 save_nestlevel = NewGUCNestLevel();
2070
2071 snprintf(workmembuf, sizeof(workmembuf), "%d", maintenance_work_mem);
2072 (void) set_config_option("work_mem", workmembuf,
2073 PGC_USERSET, PGC_S_SESSION,
2074 GUC_ACTION_SAVE, true, 0, false);
2075 (void) set_config_option("hash_mem_multiplier", "1",
2076 PGC_USERSET, PGC_S_SESSION,
2077 GUC_ACTION_SAVE, true, 0, false);
2078
2079 SPI_connect();
2080
2081 /*
2082 * Generate the plan. We don't need to cache it, and there are no
2083 * arguments to the plan.
2084 */
2085 qplan = SPI_prepare(querybuf.data, 0, NULL);
2086
2087 if (qplan == NULL)
2088 elog(ERROR, "SPI_prepare returned %s for %s",
2089 SPI_result_code_string(SPI_result), querybuf.data);
2090
2091 /*
2092 * Run the plan. For safety we force a current snapshot to be used. (In
2093 * transaction-snapshot mode, this arguably violates transaction isolation
2094 * rules, but we really haven't got much choice.) We don't need to
2095 * register the snapshot, because SPI_execute_snapshot will see to it. We
2096 * need at most one tuple returned, so pass limit = 1.
2097 */
2098 spi_result = SPI_execute_snapshot(qplan,
2099 NULL, NULL,
2100 GetLatestSnapshot(),
2101 InvalidSnapshot,
2102 true, false, 1);
2103
2104 /* Check result */
2105 if (spi_result != SPI_OK_SELECT)
2106 elog(ERROR, "SPI_execute_snapshot returned %s", SPI_result_code_string(spi_result));
2107
2108 /* Did we find a tuple that would violate the constraint? */
2109 if (SPI_processed > 0)
2110 {
2111 TupleTableSlot *slot;
2112 HeapTuple tuple = SPI_tuptable->vals[0];
2113 TupleDesc tupdesc = SPI_tuptable->tupdesc;
2114 RI_ConstraintInfo fake_riinfo;
2115
2116 slot = MakeSingleTupleTableSlot(tupdesc, &TTSOpsVirtual);
2117
2118 heap_deform_tuple(tuple, tupdesc,
2119 slot->tts_values, slot->tts_isnull);
2120 ExecStoreVirtualTuple(slot);
2121
2122 /*
2123 * The columns to look at in the result tuple are 1..N, not whatever
2124 * they are in the fk_rel. Hack up riinfo so that ri_ReportViolation
2125 * will behave properly.
2126 *
2127 * In addition to this, we have to pass the correct tupdesc to
2128 * ri_ReportViolation, overriding its normal habit of using the pk_rel
2129 * or fk_rel's tupdesc.
2130 */
2131 memcpy(&fake_riinfo, riinfo, sizeof(RI_ConstraintInfo));
2132 for (i = 0; i < fake_riinfo.nkeys; i++)
2133 fake_riinfo.pk_attnums[i] = i + 1;
2134
2135 ri_ReportViolation(&fake_riinfo, pk_rel, fk_rel,
2136 slot, tupdesc, 0, false, true);
2137 }
2138
2139 if (SPI_finish() != SPI_OK_FINISH)
2140 elog(ERROR, "SPI_finish failed");
2141
2142 /*
2143 * Restore work_mem and hash_mem_multiplier.
2144 */
2145 AtEOXact_GUC(true, save_nestlevel);
2146}
2147
2148
2149/* ----------
2150 * Local functions below
2151 * ----------
2152 */
2153
2154
2155/*
2156 * quoteOneName --- safely quote a single SQL name
2157 *
2158 * buffer must be MAX_QUOTED_NAME_LEN long (includes room for \0)
2159 */
2160static void
2161quoteOneName(char *buffer, const char *name)
2162{
2163 /* Rather than trying to be smart, just always quote it. */
2164 *buffer++ = '"';
2165 while (*name)
2166 {
2167 if (*name == '"')
2168 *buffer++ = '"';
2169 *buffer++ = *name++;
2170 }
2171 *buffer++ = '"';
2172 *buffer = '\0';
2173}
2174
2175/*
2176 * quoteRelationName --- safely quote a fully qualified relation name
2177 *
2178 * buffer must be MAX_QUOTED_REL_NAME_LEN long (includes room for \0)
2179 */
2180static void
2181quoteRelationName(char *buffer, Relation rel)
2182{
2183 quoteOneName(buffer, get_namespace_name(RelationGetNamespace(rel)));
2184 buffer += strlen(buffer);
2185 *buffer++ = '.';
2186 quoteOneName(buffer, RelationGetRelationName(rel));
2187}
2188
2189/*
2190 * ri_GenerateQual --- generate a WHERE clause equating two variables
2191 *
2192 * This basically appends " sep leftop op rightop" to buf, adding casts
2193 * and schema qualification as needed to ensure that the parser will select
2194 * the operator we specify. leftop and rightop should be parenthesized
2195 * if they aren't variables or parameters.
2196 */
2197static void
2198ri_GenerateQual(StringInfo buf,
2199 const char *sep,
2200 const char *leftop, Oid leftoptype,
2201 Oid opoid,
2202 const char *rightop, Oid rightoptype)
2203{
2204 appendStringInfo(buf, " %s ", sep);
2205 generate_operator_clause(buf, leftop, leftoptype, opoid,
2206 rightop, rightoptype);
2207}
2208
2209/*
2210 * ri_GenerateQualCollation --- add a COLLATE spec to a WHERE clause
2211 *
2212 * We only have to use this function when directly comparing the referencing
2213 * and referenced columns, if they are of different collations; else the
2214 * parser will fail to resolve the collation to use. We don't need to use
2215 * this function for RI queries that compare a variable to a $n parameter.
2216 * Since parameter symbols always have default collation, the effect will be
2217 * to use the variable's collation.
2218 *
2219 * Note that we require that the collations of the referencing and the
2220 * referenced column have the same notion of equality: Either they have to
2221 * both be deterministic or else they both have to be the same. (See also
2222 * ATAddForeignKeyConstraint().)
2223 */
2224static void
2225ri_GenerateQualCollation(StringInfo buf, Oid collation)
2226{
2227 HeapTuple tp;
2228 Form_pg_collation colltup;
2229 char *collname;
2230 char onename[MAX_QUOTED_NAME_LEN];
2231
2232 /* Nothing to do if it's a noncollatable data type */
2233 if (!OidIsValid(collation))
2234 return;
2235
2236 tp = SearchSysCache1(COLLOID, ObjectIdGetDatum(collation));
2237 if (!HeapTupleIsValid(tp))
2238 elog(ERROR, "cache lookup failed for collation %u", collation);
2239 colltup = (Form_pg_collation) GETSTRUCT(tp);
2240 collname = NameStr(colltup->collname);
2241
2242 /*
2243 * We qualify the name always, for simplicity and to ensure the query is
2244 * not search-path-dependent.
2245 */
2246 quoteOneName(onename, get_namespace_name(colltup->collnamespace));
2247 appendStringInfo(buf, " COLLATE %s", onename);
2248 quoteOneName(onename, collname);
2249 appendStringInfo(buf, ".%s", onename);
2250
2251 ReleaseSysCache(tp);
2252}
2253
2254/* ----------
2255 * ri_BuildQueryKey -
2256 *
2257 * Construct a hashtable key for a prepared SPI plan of an FK constraint.
2258 *
2259 * key: output argument, *key is filled in based on the other arguments
2260 * riinfo: info derived from pg_constraint entry
2261 * constr_queryno: an internal number identifying the query type
2262 * (see RI_PLAN_XXX constants at head of file)
2263 * ----------
2264 */
2265static void
2266ri_BuildQueryKey(RI_QueryKey *key, const RI_ConstraintInfo *riinfo,
2267 int32 constr_queryno)
2268{
2269 /*
2270 * Inherited constraints with a common ancestor can share ri_query_cache
2271 * entries for all query types except RI_PLAN_CHECK_LOOKUPPK_FROM_PK.
2272 * Except in that case, the query processes the other table involved in
2273 * the FK constraint (i.e., not the table on which the trigger has been
2274 * fired), and so it will be the same for all members of the inheritance
2275 * tree. So we may use the root constraint's OID in the hash key, rather
2276 * than the constraint's own OID. This avoids creating duplicate SPI
2277 * plans, saving lots of work and memory when there are many partitions
2278 * with similar FK constraints.
2279 *
2280 * (Note that we must still have a separate RI_ConstraintInfo for each
2281 * constraint, because partitions can have different column orders,
2282 * resulting in different pk_attnums[] or fk_attnums[] array contents.)
2283 *
2284 * We assume struct RI_QueryKey contains no padding bytes, else we'd need
2285 * to use memset to clear them.
2286 */
2287 if (constr_queryno != RI_PLAN_CHECK_LOOKUPPK_FROM_PK)
2288 key->constr_id = riinfo->constraint_root_id;
2289 else
2290 key->constr_id = riinfo->constraint_id;
2291 key->constr_queryno = constr_queryno;
2292}
2293
2294/*
2295 * Check that RI trigger function was called in expected context
2296 */
2297static void
2298ri_CheckTrigger(FunctionCallInfo fcinfo, const char *funcname, int tgkind)
2299{
2300 TriggerData *trigdata = (TriggerData *) fcinfo->context;
2301
2302 if (!CALLED_AS_TRIGGER(fcinfo))
2303 ereport(ERROR,
2304 (errcode(ERRCODE_E_R_I_E_TRIGGER_PROTOCOL_VIOLATED),
2305 errmsg("function \"%s\" was not called by trigger manager", funcname)));
2306
2307 /*
2308 * Check proper event
2309 */
2310 if (!TRIGGER_FIRED_AFTER(trigdata->tg_event) ||
2311 !TRIGGER_FIRED_FOR_ROW(trigdata->tg_event))
2312 ereport(ERROR,
2313 (errcode(ERRCODE_E_R_I_E_TRIGGER_PROTOCOL_VIOLATED),
2314 errmsg("function \"%s\" must be fired AFTER ROW", funcname)));
2315
2316 switch (tgkind)
2317 {
2318 case RI_TRIGTYPE_INSERT:
2319 if (!TRIGGER_FIRED_BY_INSERT(trigdata->tg_event))
2320 ereport(ERROR,
2321 (errcode(ERRCODE_E_R_I_E_TRIGGER_PROTOCOL_VIOLATED),
2322 errmsg("function \"%s\" must be fired for INSERT", funcname)));
2323 break;
2324 case RI_TRIGTYPE_UPDATE:
2325 if (!TRIGGER_FIRED_BY_UPDATE(trigdata->tg_event))
2326 ereport(ERROR,
2327 (errcode(ERRCODE_E_R_I_E_TRIGGER_PROTOCOL_VIOLATED),
2328 errmsg("function \"%s\" must be fired for UPDATE", funcname)));
2329 break;
2330 case RI_TRIGTYPE_DELETE:
2331 if (!TRIGGER_FIRED_BY_DELETE(trigdata->tg_event))
2332 ereport(ERROR,
2333 (errcode(ERRCODE_E_R_I_E_TRIGGER_PROTOCOL_VIOLATED),
2334 errmsg("function \"%s\" must be fired for DELETE", funcname)));
2335 break;
2336 }
2337}
2338
2339
2340/*
2341 * Fetch the RI_ConstraintInfo struct for the trigger's FK constraint.
2342 */
2343static const RI_ConstraintInfo *
2344ri_FetchConstraintInfo(Trigger *trigger, Relation trig_rel, bool rel_is_pk)
2345{
2346 Oid constraintOid = trigger->tgconstraint;
2347 const RI_ConstraintInfo *riinfo;
2348
2349 /*
2350 * Check that the FK constraint's OID is available; it might not be if
2351 * we've been invoked via an ordinary trigger or an old-style "constraint
2352 * trigger".
2353 */
2354 if (!OidIsValid(constraintOid))
2355 ereport(ERROR,
2356 (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
2357 errmsg("no pg_constraint entry for trigger \"%s\" on table \"%s\"",
2358 trigger->tgname, RelationGetRelationName(trig_rel)),
2359 errhint("Remove this referential integrity trigger and its mates, then do ALTER TABLE ADD CONSTRAINT.")));
2360
2361 /* Find or create a hashtable entry for the constraint */
2362 riinfo = ri_LoadConstraintInfo(constraintOid);
2363
2364 /* Do some easy cross-checks against the trigger call data */
2365 if (rel_is_pk)
2366 {
2367 if (riinfo->fk_relid != trigger->tgconstrrelid ||
2368 riinfo->pk_relid != RelationGetRelid(trig_rel))
2369 elog(ERROR, "wrong pg_constraint entry for trigger \"%s\" on table \"%s\"",
2370 trigger->tgname, RelationGetRelationName(trig_rel));
2371 }
2372 else
2373 {
2374 if (riinfo->fk_relid != RelationGetRelid(trig_rel) ||
2375 riinfo->pk_relid != trigger->tgconstrrelid)
2376 elog(ERROR, "wrong pg_constraint entry for trigger \"%s\" on table \"%s\"",
2377 trigger->tgname, RelationGetRelationName(trig_rel));
2378 }
2379
2380 if (riinfo->confmatchtype != FKCONSTR_MATCH_FULL &&
2381 riinfo->confmatchtype != FKCONSTR_MATCH_PARTIAL &&
2382 riinfo->confmatchtype != FKCONSTR_MATCH_SIMPLE)
2383 elog(ERROR, "unrecognized confmatchtype: %d",
2384 riinfo->confmatchtype);
2385
2386 if (riinfo->confmatchtype == FKCONSTR_MATCH_PARTIAL)
2387 ereport(ERROR,
2388 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2389 errmsg("MATCH PARTIAL not yet implemented")));
2390
2391 return riinfo;
2392}
2393
2394/*
2395 * Fetch or create the RI_ConstraintInfo struct for an FK constraint.
2396 */
2397static const RI_ConstraintInfo *
2398ri_LoadConstraintInfo(Oid constraintOid)
2399{
2400 RI_ConstraintInfo *riinfo;
2401 bool found;
2402 HeapTuple tup;
2403 Form_pg_constraint conForm;
2404
2405 /*
2406 * On the first call initialize the hashtable
2407 */
2408 if (!ri_constraint_cache)
2409 ri_InitHashTables();
2410
2411 /*
2412 * Find or create a hash entry. If we find a valid one, just return it.
2413 */
2414 riinfo = (RI_ConstraintInfo *) hash_search(ri_constraint_cache,
2415 &constraintOid,
2416 HASH_ENTER, &found);
2417 if (!found)
2418 riinfo->valid = false;
2419 else if (riinfo->valid)
2420 return riinfo;
2421
2422 /*
2423 * Fetch the pg_constraint row so we can fill in the entry.
2424 */
2425 tup = SearchSysCache1(CONSTROID, ObjectIdGetDatum(constraintOid));
2426 if (!HeapTupleIsValid(tup)) /* should not happen */
2427 elog(ERROR, "cache lookup failed for constraint %u", constraintOid);
2428 conForm = (Form_pg_constraint) GETSTRUCT(tup);
2429
2430 if (conForm->contype != CONSTRAINT_FOREIGN) /* should not happen */
2431 elog(ERROR, "constraint %u is not a foreign key constraint",
2432 constraintOid);
2433
2434 /* And extract data */
2435 Assert(riinfo->constraint_id == constraintOid);
2436 if (OidIsValid(conForm->conparentid))
2437 riinfo->constraint_root_id =
2438 get_ri_constraint_root(conForm->conparentid);
2439 else
2440 riinfo->constraint_root_id = constraintOid;
2441 riinfo->oidHashValue = GetSysCacheHashValue1(CONSTROID,
2442 ObjectIdGetDatum(constraintOid));
2443 riinfo->rootHashValue = GetSysCacheHashValue1(CONSTROID,
2444 ObjectIdGetDatum(riinfo->constraint_root_id));
2445 memcpy(&riinfo->conname, &conForm->conname, sizeof(NameData));
2446 riinfo->pk_relid = conForm->confrelid;
2447 riinfo->fk_relid = conForm->conrelid;
2448 riinfo->confupdtype = conForm->confupdtype;
2449 riinfo->confdeltype = conForm->confdeltype;
2450 riinfo->confmatchtype = conForm->confmatchtype;
2451 riinfo->hasperiod = conForm->conperiod;
2452
2453 DeconstructFkConstraintRow(tup,
2454 &riinfo->nkeys,
2455 riinfo->fk_attnums,
2456 riinfo->pk_attnums,
2457 riinfo->pf_eq_oprs,
2458 riinfo->pp_eq_oprs,
2459 riinfo->ff_eq_oprs,
2460 &riinfo->ndelsetcols,
2461 riinfo->confdelsetcols);
2462
2463 /*
2464 * For temporal FKs, get the operators and functions we need. We ask the
2465 * opclass of the PK element for these. This all gets cached (as does the
2466 * generated plan), so there's no performance issue.
2467 */
2468 if (riinfo->hasperiod)
2469 {
2470 Oid opclass = get_index_column_opclass(conForm->conindid, riinfo->nkeys);
2471
2472 FindFKPeriodOpers(opclass,
2473 &riinfo->period_contained_by_oper,
2474 &riinfo->agged_period_contained_by_oper,
2475 &riinfo->period_intersect_oper);
2476 }
2477
2478 /* Metadata used by fast path. */
2479 riinfo->conindid = conForm->conindid;
2480 riinfo->pk_is_partitioned =
2481 (get_rel_relkind(riinfo->pk_relid) == RELKIND_PARTITIONED_TABLE);
2482
2483 ReleaseSysCache(tup);
2484
2485 /*
2486 * For efficient processing of invalidation messages below, we keep a
2487 * doubly-linked count list of all currently valid entries.
2488 */
2489 dclist_push_tail(&ri_constraint_cache_valid_list, &riinfo->valid_link);
2490
2491 riinfo->valid = true;
2492
2493 riinfo->fpmeta = NULL;
2494
2495 return riinfo;
2496}
2497
2498/*
2499 * get_ri_constraint_root
2500 * Returns the OID of the constraint's root parent
2501 */
2502static Oid
2503get_ri_constraint_root(Oid constrOid)
2504{
2505 for (;;)
2506 {
2507 HeapTuple tuple;
2508 Oid constrParentOid;
2509
2510 tuple = SearchSysCache1(CONSTROID, ObjectIdGetDatum(constrOid));
2511 if (!HeapTupleIsValid(tuple))
2512 elog(ERROR, "cache lookup failed for constraint %u", constrOid);
2513 constrParentOid = ((Form_pg_constraint) GETSTRUCT(tuple))->conparentid;
2514 ReleaseSysCache(tuple);
2515 if (!OidIsValid(constrParentOid))
2516 break; /* we reached the root constraint */
2517 constrOid = constrParentOid;
2518 }
2519 return constrOid;
2520}
2521
2522/*
2523 * Callback for pg_constraint inval events
2524 *
2525 * While most syscache callbacks just flush all their entries, pg_constraint
2526 * gets enough update traffic that it's probably worth being smarter.
2527 * Invalidate any ri_constraint_cache entry associated with the syscache
2528 * entry with the specified hash value, or all entries if hashvalue == 0.
2529 *
2530 * Note: at the time a cache invalidation message is processed there may be
2531 * active references to the cache. Because of this we never remove entries
2532 * from the cache, but only mark them invalid, which is harmless to active
2533 * uses. (Any query using an entry should hold a lock sufficient to keep that
2534 * data from changing under it --- but we may get cache flushes anyway.)
2535 */
2536static void
2537InvalidateConstraintCacheCallBack(Datum arg, SysCacheIdentifier cacheid,
2538 uint32 hashvalue)
2539{
2540 dlist_mutable_iter iter;
2541
2542 Assert(ri_constraint_cache != NULL);
2543
2544 /*
2545 * If the list of currently valid entries gets excessively large, we mark
2546 * them all invalid so we can empty the list. This arrangement avoids
2547 * O(N^2) behavior in situations where a session touches many foreign keys
2548 * and also does many ALTER TABLEs, such as a restore from pg_dump.
2549 */
2550 if (dclist_count(&ri_constraint_cache_valid_list) > 1000)
2551 hashvalue = 0; /* pretend it's a cache reset */
2552
2553 dclist_foreach_modify(iter, &ri_constraint_cache_valid_list)
2554 {
2555 RI_ConstraintInfo *riinfo = dclist_container(RI_ConstraintInfo,
2556 valid_link, iter.cur);
2557
2558 /*
2559 * We must invalidate not only entries directly matching the given
2560 * hash value, but also child entries, in case the invalidation
2561 * affects a root constraint.
2562 */
2563 if (hashvalue == 0 ||
2564 riinfo->oidHashValue == hashvalue ||
2565 riinfo->rootHashValue == hashvalue)
2566 {
2567 riinfo->valid = false;
2568 if (riinfo->fpmeta)
2569 {
2570 pfree(riinfo->fpmeta);
2571 riinfo->fpmeta = NULL;
2572 }
2573 /* Remove invalidated entries from the list, too */
2574 dclist_delete_from(&ri_constraint_cache_valid_list, iter.cur);
2575 }
2576 }
2577}
2578
2579
2580/*
2581 * Prepare execution plan for a query to enforce an RI restriction
2582 */
2583static SPIPlanPtr
2584ri_PlanCheck(const char *querystr, int nargs, Oid *argtypes,
2585 RI_QueryKey *qkey, Relation fk_rel, Relation pk_rel)
2586{
2587 SPIPlanPtr qplan;
2588 Relation query_rel;
2589 Oid save_userid;
2590 int save_sec_context;
2591
2592 /*
2593 * Use the query type code to determine whether the query is run against
2594 * the PK or FK table; we'll do the check as that table's owner
2595 */
2596 if (qkey->constr_queryno <= RI_PLAN_LAST_ON_PK)
2597 query_rel = pk_rel;
2598 else
2599 query_rel = fk_rel;
2600
2601 /* Switch to proper UID to perform check as */
2602 GetUserIdAndSecContext(&save_userid, &save_sec_context);
2603 SetUserIdAndSecContext(RelationGetForm(query_rel)->relowner,
2604 save_sec_context | SECURITY_LOCAL_USERID_CHANGE |
2605 SECURITY_NOFORCE_RLS);
2606
2607 /* Create the plan */
2608 qplan = SPI_prepare(querystr, nargs, argtypes);
2609
2610 if (qplan == NULL)
2611 elog(ERROR, "SPI_prepare returned %s for %s", SPI_result_code_string(SPI_result), querystr);
2612
2613 /* Restore UID and security context */
2614 SetUserIdAndSecContext(save_userid, save_sec_context);
2615
2616 /* Save the plan */
2617 SPI_keepplan(qplan);
2618 ri_HashPreparedPlan(qkey, qplan);
2619
2620 return qplan;
2621}
2622
2623/*
2624 * Perform a query to enforce an RI restriction
2625 */
2626static bool
2627ri_PerformCheck(const RI_ConstraintInfo *riinfo,
2628 RI_QueryKey *qkey, SPIPlanPtr qplan,
2629 Relation fk_rel, Relation pk_rel,
2630 TupleTableSlot *oldslot, TupleTableSlot *newslot,
2631 bool is_restrict,
2632 bool detectNewRows, int expect_OK)
2633{
2634 Relation query_rel,
2635 source_rel;
2636 bool source_is_pk;
2637 Snapshot test_snapshot;
2638 Snapshot crosscheck_snapshot;
2639 int limit;
2640 int spi_result;
2641 Oid save_userid;
2642 int save_sec_context;
2643 Datum vals[RI_MAX_NUMKEYS * 2];
2644 char nulls[RI_MAX_NUMKEYS * 2];
2645
2646 /*
2647 * Use the query type code to determine whether the query is run against
2648 * the PK or FK table; we'll do the check as that table's owner
2649 */
2650 if (qkey->constr_queryno <= RI_PLAN_LAST_ON_PK)
2651 query_rel = pk_rel;
2652 else
2653 query_rel = fk_rel;
2654
2655 /*
2656 * The values for the query are taken from the table on which the trigger
2657 * is called - it is normally the other one with respect to query_rel. An
2658 * exception is ri_Check_Pk_Match(), which uses the PK table for both (and
2659 * sets queryno to RI_PLAN_CHECK_LOOKUPPK_FROM_PK). We might eventually
2660 * need some less klugy way to determine this.
2661 */
2662 if (qkey->constr_queryno == RI_PLAN_CHECK_LOOKUPPK)
2663 {
2664 source_rel = fk_rel;
2665 source_is_pk = false;
2666 }
2667 else
2668 {
2669 source_rel = pk_rel;
2670 source_is_pk = true;
2671 }
2672
2673 /* Extract the parameters to be passed into the query */
2674 if (newslot)
2675 {
2676 ri_ExtractValues(source_rel, newslot, riinfo, source_is_pk,
2677 vals, nulls);
2678 if (oldslot)
2679 ri_ExtractValues(source_rel, oldslot, riinfo, source_is_pk,
2680 vals + riinfo->nkeys, nulls + riinfo->nkeys);
2681 }
2682 else
2683 {
2684 ri_ExtractValues(source_rel, oldslot, riinfo, source_is_pk,
2685 vals, nulls);
2686 }
2687
2688 /*
2689 * In READ COMMITTED mode, we just need to use an up-to-date regular
2690 * snapshot, and we will see all rows that could be interesting. But in
2691 * transaction-snapshot mode, we can't change the transaction snapshot. If
2692 * the caller passes detectNewRows == false then it's okay to do the query
2693 * with the transaction snapshot; otherwise we use a current snapshot, and
2694 * tell the executor to error out if it finds any rows under the current
2695 * snapshot that wouldn't be visible per the transaction snapshot. Note
2696 * that SPI_execute_snapshot will register the snapshots, so we don't need
2697 * to bother here.
2698 */
2699 if (IsolationUsesXactSnapshot() && detectNewRows)
2700 {
2701 CommandCounterIncrement(); /* be sure all my own work is visible */
2702 test_snapshot = GetLatestSnapshot();
2703 crosscheck_snapshot = GetTransactionSnapshot();
2704 }
2705 else
2706 {
2707 /* the default SPI behavior is okay */
2708 test_snapshot = InvalidSnapshot;
2709 crosscheck_snapshot = InvalidSnapshot;
2710 }
2711
2712 /*
2713 * If this is a select query (e.g., for a 'no action' or 'restrict'
2714 * trigger), we only need to see if there is a single row in the table,
2715 * matching the key. Otherwise, limit = 0 - because we want the query to
2716 * affect ALL the matching rows.
2717 */
2718 limit = (expect_OK == SPI_OK_SELECT) ? 1 : 0;
2719
2720 /* Switch to proper UID to perform check as */
2721 GetUserIdAndSecContext(&save_userid, &save_sec_context);
2722 SetUserIdAndSecContext(RelationGetForm(query_rel)->relowner,
2723 save_sec_context | SECURITY_LOCAL_USERID_CHANGE |
2724 SECURITY_NOFORCE_RLS);
2725
2726 /*
2727 * Finally we can run the query.
2728 *
2729 * Set fire_triggers to false to ensure that AFTER triggers are queued in
2730 * the outer query's after-trigger context and fire after all RI updates
2731 * on the same row are complete, rather than immediately.
2732 */
2733 spi_result = SPI_execute_snapshot(qplan,
2734 vals, nulls,
2735 test_snapshot, crosscheck_snapshot,
2736 false, false, limit);
2737
2738 /* Restore UID and security context */
2739 SetUserIdAndSecContext(save_userid, save_sec_context);
2740
2741 /* Check result */
2742 if (spi_result < 0)
2743 elog(ERROR, "SPI_execute_snapshot returned %s", SPI_result_code_string(spi_result));
2744
2745 if (expect_OK >= 0 && spi_result != expect_OK)
2746 ereport(ERROR,
2747 (errcode(ERRCODE_INTERNAL_ERROR),
2748 errmsg("referential integrity query on \"%s\" from constraint \"%s\" on \"%s\" gave unexpected result",
2749 RelationGetRelationName(pk_rel),
2750 NameStr(riinfo->conname),
2751 RelationGetRelationName(fk_rel)),
2752 errhint("This is most likely due to a rule having rewritten the query.")));
2753
2754 /* XXX wouldn't it be clearer to do this part at the caller? */
2755 if (qkey->constr_queryno != RI_PLAN_CHECK_LOOKUPPK_FROM_PK &&
2756 expect_OK == SPI_OK_SELECT &&
2757 (SPI_processed == 0) == (qkey->constr_queryno == RI_PLAN_CHECK_LOOKUPPK))
2758 ri_ReportViolation(riinfo,
2759 pk_rel, fk_rel,
2760 newslot ? newslot : oldslot,
2761 NULL,
2762 qkey->constr_queryno, is_restrict, false);
2763
2764 return SPI_processed != 0;
2765}
2766
2767/*
2768 * ri_FastPathCheck
2769 * Perform per row FK existence check via direct index probe,
2770 * bypassing SPI.
2771 *
2772 * If no matching PK row exists, report the violation via ri_ReportViolation(),
2773 * otherwise, the function returns normally.
2774 *
2775 * Note: This is only used by the ALTER TABLE validation path. Other paths use
2776 * ri_FastPathBatchAdd().
2777 */
2778static void
2779ri_FastPathCheck(const RI_ConstraintInfo *riinfo,
2780 Relation fk_rel, TupleTableSlot *newslot)
2781{
2782 Relation pk_rel;
2783 Relation idx_rel;
2784 IndexScanDesc scandesc;
2785 TupleTableSlot *slot;
2786 Datum pk_vals[INDEX_MAX_KEYS];
2787 char pk_nulls[INDEX_MAX_KEYS];
2788 ScanKeyData skey[INDEX_MAX_KEYS];
2789 bool found = false;
2790 Oid saved_userid;
2791 int saved_sec_context;
2792 Snapshot snapshot;
2793
2794 /*
2795 * Advance the command counter so the snapshot sees the effects of prior
2796 * triggers in this statement. Mirrors what the SPI path does in
2797 * ri_PerformCheck().
2798 */
2799 CommandCounterIncrement();
2800 snapshot = RegisterSnapshot(GetTransactionSnapshot());
2801
2802 pk_rel = table_open(riinfo->pk_relid, RowShareLock);
2803 idx_rel = index_open(riinfo->conindid, AccessShareLock);
2804
2805 slot = table_slot_create(pk_rel, NULL);
2806 scandesc = index_beginscan(pk_rel, idx_rel,
2807 snapshot, NULL,
2808 riinfo->nkeys, 0,
2809 SO_NONE);
2810
2811 GetUserIdAndSecContext(&saved_userid, &saved_sec_context);
2812 SetUserIdAndSecContext(RelationGetForm(pk_rel)->relowner,
2813 saved_sec_context |
2814 SECURITY_LOCAL_USERID_CHANGE |
2815 SECURITY_NOFORCE_RLS);
2816 ri_CheckPermissions(pk_rel);
2817
2818 if (riinfo->fpmeta == NULL)
2819 {
2820 /* Reload to ensure it's valid. */
2821 riinfo = ri_LoadConstraintInfo(riinfo->constraint_id);
2822 ri_populate_fastpath_metadata((RI_ConstraintInfo *) riinfo,
2823 fk_rel, idx_rel);
2824 }
2825 Assert(riinfo->fpmeta);
2826 ri_ExtractValues(fk_rel, newslot, riinfo, false, pk_vals, pk_nulls);
2827 build_index_scankeys(riinfo, idx_rel, pk_vals, pk_nulls, skey);
2828 found = ri_FastPathProbeOne(pk_rel, idx_rel, scandesc, slot,
2829 snapshot, riinfo, skey, riinfo->nkeys);
2830 SetUserIdAndSecContext(saved_userid, saved_sec_context);
2831 index_endscan(scandesc);
2832 ExecDropSingleTupleTableSlot(slot);
2833 UnregisterSnapshot(snapshot);
2834
2835 if (!found)
2836 ri_ReportViolation(riinfo, pk_rel, fk_rel,
2837 newslot, NULL,
2838 RI_PLAN_CHECK_LOOKUPPK, false, false);
2839
2840 index_close(idx_rel, NoLock);
2841 table_close(pk_rel, NoLock);
2842}
2843
2844/*
2845 * ri_FastPathBatchAdd
2846 * Buffer a FK row for batched probing.
2847 *
2848 * Adds the row to the batch buffer. When the buffer is full, flushes all
2849 * buffered rows by probing the PK index. Any violation is reported
2850 * immediately during the flush via ri_ReportViolation (which does not return).
2851 *
2852 * Uses the per-batch cache (RI_FastPathEntry) to avoid per-row relation
2853 * open/close, slot creation, etc.
2854 *
2855 * The batch is also flushed at end of trigger-firing cycle via
2856 * ri_FastPathEndBatch().
2857 */
2858static void
2874
2875/*
2876 * ri_FastPathBatchFlush
2877 * Flush all buffered FK rows by probing the PK index.
2878 *
2879 * Dispatches to ri_FastPathFlushArray() for single-column FKs
2880 * (using SK_SEARCHARRAY) or ri_FastPathFlushLoop() for multi-column
2881 * FKs (per-row probing). Violations are reported immediately via
2882 * ri_ReportViolation(), which does not return.
2883 */
2884static void
2885ri_FastPathBatchFlush(RI_FastPathEntry *fpentry, Relation fk_rel,
2886 const RI_ConstraintInfo *riinfo)
2887{
2888 Relation pk_rel = fpentry->pk_rel;
2889 Relation idx_rel = fpentry->idx_rel;
2890 TupleTableSlot *fk_slot = fpentry->fk_slot;
2891 Snapshot snapshot;
2892 IndexScanDesc scandesc;
2893 Oid saved_userid;
2894 int saved_sec_context;
2895 MemoryContext oldcxt;
2896 int violation_index;
2897
2898 if (fpentry->batch_count == 0)
2899 return;
2900
2901 /*
2902 * CCI and security context switch are done once for the entire batch.
2903 * Per-row CCI is unnecessary because by the time a flush runs, all AFTER
2904 * triggers for the buffered rows have already fired (trigger invocations
2905 * strictly alternate per row), so a single CCI advances past all their
2906 * effects. Per-row security context switch is unnecessary because each
2907 * row's probe runs entirely as the PK table owner, same as the SPI path
2908 * -- the only difference is that the SPI path sets and restores the
2909 * context per row whereas we do it once around the whole batch.
2910 */
2911 CommandCounterIncrement();
2912 snapshot = RegisterSnapshot(GetTransactionSnapshot());
2913
2914 /*
2915 * build_index_scankeys() may palloc cast results for cross-type FKs. Use
2916 * the entry's short-lived flush context so these don't accumulate across
2917 * batches.
2918 */
2919 oldcxt = MemoryContextSwitchTo(fpentry->flush_cxt);
2920
2921 scandesc = index_beginscan(pk_rel, idx_rel, snapshot, NULL,
2922 riinfo->nkeys, 0, SO_NONE);
2923
2924 GetUserIdAndSecContext(&saved_userid, &saved_sec_context);
2925 SetUserIdAndSecContext(RelationGetForm(pk_rel)->relowner,
2926 saved_sec_context |
2927 SECURITY_LOCAL_USERID_CHANGE |
2928 SECURITY_NOFORCE_RLS);
2929
2930 /*
2931 * Check that the current user has permission to access pk_rel. Done here
2932 * rather than at entry creation so that permission changes between
2933 * flushes are respected, matching the per-row behavior of the SPI path,
2934 * albeit checked once per flush rather than once per row, like in
2935 * ri_FastPathCheck().
2936 */
2937 ri_CheckPermissions(pk_rel);
2938
2939 if (riinfo->fpmeta == NULL)
2940 {
2941 /* Reload to ensure it's valid. */
2942 riinfo = ri_LoadConstraintInfo(riinfo->constraint_id);
2943 ri_populate_fastpath_metadata((RI_ConstraintInfo *) riinfo,
2944 fk_rel, idx_rel);
2945 }
2946 Assert(riinfo->fpmeta);
2947
2948 /* Skip array overhead for single-row batches. */
2949 if (riinfo->nkeys == 1 && fpentry->batch_count > 1)
2950 violation_index = ri_FastPathFlushArray(fpentry, fk_slot, riinfo,
2951 fk_rel, snapshot, scandesc);
2952 else
2953 violation_index = ri_FastPathFlushLoop(fpentry, fk_slot, riinfo,
2954 fk_rel, snapshot, scandesc);
2955
2956 SetUserIdAndSecContext(saved_userid, saved_sec_context);
2957 UnregisterSnapshot(snapshot);
2958 index_endscan(scandesc);
2959
2960 if (violation_index >= 0)
2961 {
2962 ExecStoreHeapTuple(fpentry->batch[violation_index], fk_slot, false);
2963 ri_ReportViolation(riinfo, pk_rel, fk_rel,
2964 fk_slot, NULL,
2965 RI_PLAN_CHECK_LOOKUPPK, false, false);
2966 }
2967
2968 MemoryContextReset(fpentry->flush_cxt);
2969 MemoryContextSwitchTo(oldcxt);
2970
2971 /* Reset. */
2972 fpentry->batch_count = 0;
2973}
2974
2975/*
2976 * ri_FastPathFlushLoop
2977 * Multi-column fallback: probe the index once per buffered row.
2978 *
2979 * Used for composite foreign keys where SK_SEARCHARRAY does not
2980 * apply, and also for single-row batches of single-column FKs where
2981 * the array overhead is not worth it.
2982 *
2983 * Returns the index of the first violating row in the batch array, or -1 if
2984 * all rows are valid.
2985 */
2986static int
2987ri_FastPathFlushLoop(RI_FastPathEntry *fpentry, TupleTableSlot *fk_slot,
2988 const RI_ConstraintInfo *riinfo, Relation fk_rel,
2989 Snapshot snapshot, IndexScanDesc scandesc)
2990{
2991 Relation pk_rel = fpentry->pk_rel;
2992 Relation idx_rel = fpentry->idx_rel;
2993 TupleTableSlot *pk_slot = fpentry->pk_slot;
2994 Datum pk_vals[INDEX_MAX_KEYS];
2995 char pk_nulls[INDEX_MAX_KEYS];
2996 ScanKeyData skey[INDEX_MAX_KEYS];
2997 bool found = true;
2998
2999 for (int i = 0; i < fpentry->batch_count; i++)
3000 {
3001 ExecStoreHeapTuple(fpentry->batch[i], fk_slot, false);
3002 ri_ExtractValues(fk_rel, fk_slot, riinfo, false, pk_vals, pk_nulls);
3003 build_index_scankeys(riinfo, idx_rel, pk_vals, pk_nulls, skey);
3004
3005 found = ri_FastPathProbeOne(pk_rel, idx_rel, scandesc, pk_slot,
3006 snapshot, riinfo, skey, riinfo->nkeys);
3007
3008 /* Report first unmatched row */
3009 if (!found)
3010 return i;
3011 }
3012
3013 /* All pass. */
3014 return -1;
3015}
3016
3017/*
3018 * ri_FastPathFlushArray
3019 * Single-column fast path using SK_SEARCHARRAY.
3020 *
3021 * Builds an array of FK values and does one index scan with
3022 * SK_SEARCHARRAY. The index AM sorts and deduplicates the array
3023 * internally, then walks matching leaf pages in order. Each
3024 * matched PK tuple is locked and rechecked as before; a matched[]
3025 * bitmap tracks which batch items were satisfied.
3026 *
3027 * Returns the index of the first violating row in the batch array, or -1 if
3028 * all rows are valid.
3029 */
3030static int
3031ri_FastPathFlushArray(RI_FastPathEntry *fpentry, TupleTableSlot *fk_slot,
3032 const RI_ConstraintInfo *riinfo, Relation fk_rel,
3033 Snapshot snapshot, IndexScanDesc scandesc)
3034{
3035 FastPathMeta *fpmeta = riinfo->fpmeta;
3036 Relation pk_rel = fpentry->pk_rel;
3037 Relation idx_rel = fpentry->idx_rel;
3038 TupleTableSlot *pk_slot = fpentry->pk_slot;
3039 Datum search_vals[RI_FASTPATH_BATCH_SIZE];
3040 bool matched[RI_FASTPATH_BATCH_SIZE];
3041 int nvals = fpentry->batch_count;
3042 Datum pk_vals[INDEX_MAX_KEYS];
3043 char pk_nulls[INDEX_MAX_KEYS];
3044 ScanKeyData skey[1];
3045 FmgrInfo *cast_func_finfo;
3046 FmgrInfo *eq_opr_finfo;
3047 Oid elem_type;
3048 int16 elem_len;
3049 bool elem_byval;
3050 char elem_align;
3051 ArrayType *arr;
3052
3053 Assert(fpmeta);
3054
3055 memset(matched, 0, nvals * sizeof(bool));
3056
3057 /*
3058 * Extract FK values, casting to the operator's expected input type if
3059 * needed (e.g. int8 FK -> int4 for int48eq).
3060 */
3061 cast_func_finfo = &fpmeta->cast_func_finfo[0];
3062 eq_opr_finfo = &fpmeta->eq_opr_finfo[0];
3063 for (int i = 0; i < nvals; i++)
3064 {
3065 ExecStoreHeapTuple(fpentry->batch[i], fk_slot, false);
3066 ri_ExtractValues(fk_rel, fk_slot, riinfo, false, pk_vals, pk_nulls);
3067
3068 /* Cast if needed (e.g. int8 FK -> numeric PK) */
3069 if (OidIsValid(cast_func_finfo->fn_oid))
3070 search_vals[i] = FunctionCall3(cast_func_finfo,
3071 pk_vals[0],
3072 Int32GetDatum(-1),
3073 BoolGetDatum(false));
3074 else
3075 search_vals[i] = pk_vals[0];
3076 }
3077
3078 /*
3079 * Array element type must match the operator's right-hand input type,
3080 * which is what the index comparison expects on the search side.
3081 * ri_populate_fastpath_metadata() stores exactly this via
3082 * get_op_opfamily_properties(), which returns the operator's right-hand
3083 * type as the subtype for cross-type operators (e.g. int8 for int48eq)
3084 * and the common type for same-type operators.
3085 */
3086 elem_type = fpmeta->subtypes[0];
3087 Assert(OidIsValid(elem_type));
3088 get_typlenbyvalalign(elem_type, &elem_len, &elem_byval, &elem_align);
3089
3090 arr = construct_array(search_vals, nvals,
3091 elem_type, elem_len, elem_byval, elem_align);
3092
3093 /*
3094 * Build scan key with SK_SEARCHARRAY. The index AM code will internally
3095 * sort and deduplicate, then walk leaf pages in order.
3096 *
3097 * PK indexes are always btree, which supports SK_SEARCHARRAY.
3098 */
3099 Assert(idx_rel->rd_indam->amsearcharray);
3100 ScanKeyEntryInitialize(&skey[0],
3101 SK_SEARCHARRAY,
3102 1, /* attno */
3103 fpmeta->strats[0],
3104 fpmeta->subtypes[0],
3105 idx_rel->rd_indcollation[0],
3106 fpmeta->regops[0],
3107 PointerGetDatum(arr));
3108
3109 index_rescan(scandesc, skey, 1, NULL, 0);
3110
3111 /*
3112 * Walk all matches. The index AM returns them in index order. For each
3113 * match, find which batch item(s) it satisfies.
3114 */
3115 while (index_getnext_slot(scandesc, ForwardScanDirection, pk_slot))
3116 {
3117 Datum found_val;
3118 bool found_null;
3119 bool concurrently_updated;
3120 ScanKeyData recheck_skey[1];
3121
3122 if (!ri_LockPKTuple(pk_rel, pk_slot, snapshot, &concurrently_updated))
3123 continue;
3124
3125 /* Extract the PK value from the matched and locked tuple */
3126 found_val = slot_getattr(pk_slot, riinfo->pk_attnums[0], &found_null);
3127 Assert(!found_null);
3128
3129 if (concurrently_updated)
3130 {
3131 /*
3132 * Build a single-key scankey for recheck. We need the actual PK
3133 * value that was found, not the FK search value.
3134 */
3135 ScanKeyEntryInitialize(&recheck_skey[0], 0, 1,
3136 fpmeta->strats[0],
3137 fpmeta->subtypes[0],
3138 idx_rel->rd_indcollation[0],
3139 fpmeta->regops[0],
3140 found_val);
3141 if (!recheck_matched_pk_tuple(idx_rel, recheck_skey, 1, pk_slot))
3142 continue;
3143 }
3144
3145 /*
3146 * Linear scan to mark all batch items matching this PK value.
3147 * O(batch_size) per match, O(batch_size^2) worst case -- fine for the
3148 * current batch size of 64.
3149 */
3150 for (int i = 0; i < nvals; i++)
3151 {
3152 if (!matched[i] &&
3153 DatumGetBool(FunctionCall2Coll(eq_opr_finfo,
3154 idx_rel->rd_indcollation[0],
3155 found_val,
3156 search_vals[i])))
3157 matched[i] = true;
3158 }
3159 }
3160
3161 /* Report first unmatched row */
3162 for (int i = 0; i < nvals; i++)
3163 if (!matched[i])
3164 return i;
3165
3166 /* All pass. */
3167 return -1;
3168}
3169
3170/*
3171 * ri_FastPathProbeOne
3172 * Probe the PK index for one set of scan keys, lock the matching
3173 * tuple
3174 *
3175 * Returns true if a matching PK row was found, locked, and (if
3176 * applicable) visible to the transaction snapshot.
3177 */
3178static bool
3179ri_FastPathProbeOne(Relation pk_rel, Relation idx_rel,
3180 IndexScanDesc scandesc, TupleTableSlot *slot,
3181 Snapshot snapshot, const RI_ConstraintInfo *riinfo,
3182 ScanKeyData *skey, int nkeys)
3183{
3184 bool found = false;
3185
3186 index_rescan(scandesc, skey, nkeys, NULL, 0);
3187
3188 if (index_getnext_slot(scandesc, ForwardScanDirection, slot))
3189 {
3190 bool concurrently_updated;
3191
3192 if (ri_LockPKTuple(pk_rel, slot, snapshot,
3193 &concurrently_updated))
3194 {
3195 if (concurrently_updated)
3196 found = recheck_matched_pk_tuple(idx_rel, skey, nkeys, slot);
3197 else
3198 found = true;
3199 }
3200 }
3201
3202 return found;
3203}
3204
3205/*
3206 * ri_LockPKTuple
3207 * Lock a PK tuple found by the fast-path index scan.
3208 *
3209 * Calls table_tuple_lock() directly with handling specific to RI checks.
3210 * Returns true if the tuple was successfully locked.
3211 *
3212 * Sets *concurrently_updated to true if the locked tuple was reached
3213 * by following an update chain (tmfd.traversed), indicating the caller
3214 * should recheck the key.
3215 */
3216static bool
3217ri_LockPKTuple(Relation pk_rel, TupleTableSlot *slot, Snapshot snap,
3218 bool *concurrently_updated)
3219{
3220 TM_FailureData tmfd;
3221 TM_Result result;
3222 int lockflags = TUPLE_LOCK_FLAG_LOCK_UPDATE_IN_PROGRESS;
3223
3224 *concurrently_updated = false;
3225
3226 if (!IsolationUsesXactSnapshot())
3227 lockflags |= TUPLE_LOCK_FLAG_FIND_LAST_VERSION;
3228
3229 result = table_tuple_lock(pk_rel, &slot->tts_tid, snap,
3230 slot, GetCurrentCommandId(false),
3231 LockTupleKeyShare, LockWaitBlock,
3232 lockflags, &tmfd);
3233
3234 switch (result)
3235 {
3236 case TM_Ok:
3237 if (tmfd.traversed)
3238 *concurrently_updated = true;
3239 return true;
3240
3241 case TM_Deleted:
3242 if (IsolationUsesXactSnapshot())
3243 ereport(ERROR,
3244 (errcode(ERRCODE_T_R_SERIALIZATION_FAILURE),
3245 errmsg("could not serialize access due to concurrent update")));
3246 return false;
3247
3248 case TM_Updated:
3249 if (IsolationUsesXactSnapshot())
3250 ereport(ERROR,
3251 (errcode(ERRCODE_T_R_SERIALIZATION_FAILURE),
3252 errmsg("could not serialize access due to concurrent update")));
3253
3254 /*
3255 * In READ COMMITTED, FIND_LAST_VERSION should have chased the
3256 * chain and returned TM_Ok. Getting here means something
3257 * unexpected -- fall through to error.
3258 */
3259 elog(ERROR, "unexpected table_tuple_lock status: %u", result);
3260 break;
3261
3262 case TM_SelfModified:
3263
3264 /*
3265 * The current command or a later command in this transaction
3266 * modified the PK row. This shouldn't normally happen during an
3267 * FK check (we're not modifying pk_rel), but handle it safely by
3268 * treating the tuple as not found.
3269 */
3270 return false;
3271
3272 case TM_Invisible:
3273 elog(ERROR, "attempted to lock invisible tuple");
3274 break;
3275
3276 default:
3277 elog(ERROR, "unrecognized table_tuple_lock status: %u", result);
3278 break;
3279 }
3280
3281 return false; /* keep compiler quiet */
3282}
3283
3284static bool
3285ri_fastpath_is_applicable(const RI_ConstraintInfo *riinfo)
3286{
3287 /*
3288 * Partitioned referenced tables are skipped for simplicity, since they
3289 * require routing the probe through the correct partition using
3290 * PartitionDirectory.
3291 */
3292 if (riinfo->pk_is_partitioned)
3293 return false;
3294
3295 /*
3296 * Temporal foreign keys use range overlap and containment semantics (&&,
3297 * <@, range_agg()) that inherently involve aggregation and multiple-row
3298 * reasoning, so they stay on the SPI path.
3299 */
3300 if (riinfo->hasperiod)
3301 return false;
3302
3303 return true;
3304}
3305
3306/*
3307 * ri_CheckPermissions
3308 * Check that the current user has permissions to look into the schema of
3309 * and SELECT from 'query_rel'
3310 */
3311static void
3331
3332/*
3333 * recheck_matched_pk_tuple
3334 * After following an update chain (tmfd.traversed), verify that
3335 * the locked PK tuple still matches the original search keys.
3336 *
3337 * A non-key update (e.g. changing a non-PK column) creates a new tuple version
3338 * that we've now locked, but the key is unchanged -- that's fine. A key
3339 * update means the value we were looking for is gone, so we should treat it as
3340 * not found.
3341 */
3342static bool
3343recheck_matched_pk_tuple(Relation idxrel, ScanKeyData *skeys, int nkeys,
3344 TupleTableSlot *new_slot)
3345{
3346 /*
3347 * TODO: BuildIndexInfo does a syscache lookup + palloc on every call.
3348 * This only fires on the concurrent-update path (tmfd.traversed), which
3349 * should be rare, so the cost is acceptable for now. If profiling shows
3350 * otherwise, cache the IndexInfo in FastPathMeta.
3351 */
3352 IndexInfo *indexInfo = BuildIndexInfo(idxrel);
3353 Datum values[INDEX_MAX_KEYS];
3354 bool isnull[INDEX_MAX_KEYS];
3355 bool matched = true;
3356
3357 /* PK indexes never have these. */
3358 Assert(indexInfo->ii_Expressions == NIL &&
3359 indexInfo->ii_ExclusionOps == NULL);
3360
3361 /* Form the index values and isnull flags given the table tuple. */
3362 Assert(nkeys == indexInfo->ii_NumIndexKeyAttrs);
3363 FormIndexDatum(indexInfo, new_slot, NULL, values, isnull);
3364 for (int i = 0; i < nkeys; i++)
3365 {
3366 ScanKeyData *skey = &skeys[i];
3367
3368 /* A PK column can never be set to NULL. */
3369 Assert(!isnull[i]);
3370 if (!DatumGetBool(FunctionCall2Coll(&skey->sk_func,
3371 skey->sk_collation,
3372 values[i],
3373 skey->sk_argument)))
3374 {
3375 matched = false;
3376 break;
3377 }
3378 }
3379
3380 return matched;
3381}
3382
3383/*
3384 * build_index_scankeys
3385 * Build ScanKeys for a direct index probe of the PK's unique index.
3386 *
3387 * Uses cached compare entries, operator procedures, and strategy numbers
3388 * from ri_populate_fastpath_metadata() rather than looking them up on
3389 * each invocation. Casts FK values to the operator's expected input
3390 * type if needed.
3391 */
3392static void
3393build_index_scankeys(const RI_ConstraintInfo *riinfo,
3394 Relation idx_rel, Datum *pk_vals,
3395 char *pk_nulls, ScanKey skeys)
3396{
3397 FastPathMeta *fpmeta = riinfo->fpmeta;
3398
3399 Assert(fpmeta);
3400
3401 /*
3402 * May need to cast each of the individual values of the foreign key to
3403 * the corresponding PK column's type if the equality operator demands it.
3404 */
3405 for (int i = 0; i < riinfo->nkeys; i++)
3406 {
3407 if (pk_nulls[i] != 'n' &&
3408 OidIsValid(fpmeta->cast_func_finfo[i].fn_oid))
3409 pk_vals[i] = FunctionCall3(&fpmeta->cast_func_finfo[i],
3410 pk_vals[i],
3411 Int32GetDatum(-1), /* typmod */
3412 BoolGetDatum(false)); /* implicit coercion */
3413 }
3414
3415 /*
3416 * Set up ScanKeys for the index scan. This is essentially how
3417 * ExecIndexBuildScanKeys() sets them up.
3418 */
3419 for (int i = 0; i < riinfo->nkeys; i++)
3420 {
3421 int pkattrno = i + 1;
3422
3423 ScanKeyEntryInitialize(&skeys[i], 0, pkattrno,
3424 fpmeta->strats[i], fpmeta->subtypes[i],
3425 idx_rel->rd_indcollation[i], fpmeta->regops[i],
3426 pk_vals[i]);
3427 }
3428}
3429
3430/*
3431 * ri_populate_fastpath_metadata
3432 * Cache per-key metadata needed by build_index_scankeys().
3433 *
3434 * Looks up the compare hash entry, operator procedure OID, and index
3435 * strategy/subtype for each key column. Called lazily on first use
3436 * and persists for the lifetime of the RI_ConstraintInfo entry.
3437 */
3438static void
3439ri_populate_fastpath_metadata(RI_ConstraintInfo *riinfo,
3440 Relation fk_rel, Relation idx_rel)
3441{
3442 FastPathMeta *fpmeta;
3443 MemoryContext oldcxt = MemoryContextSwitchTo(TopMemoryContext);
3444
3445 Assert(riinfo != NULL && riinfo->valid);
3446
3447 fpmeta = palloc_object(FastPathMeta);
3448 for (int i = 0; i < riinfo->nkeys; i++)
3449 {
3450 Oid eq_opr = riinfo->pf_eq_oprs[i];
3451 Oid typeid = RIAttType(fk_rel, riinfo->fk_attnums[i]);
3452 Oid lefttype;
3453 RI_CompareHashEntry *entry = ri_HashCompareOp(eq_opr, typeid);
3454
3455 fmgr_info_copy(&fpmeta->cast_func_finfo[i], &entry->cast_func_finfo,
3456 CurrentMemoryContext);
3457 fmgr_info_copy(&fpmeta->eq_opr_finfo[i], &entry->eq_opr_finfo,
3458 CurrentMemoryContext);
3459 fpmeta->regops[i] = get_opcode(eq_opr);
3460
3461 get_op_opfamily_properties(eq_opr,
3462 idx_rel->rd_opfamily[i],
3463 false,
3464 &fpmeta->strats[i],
3465 &lefttype,
3466 &fpmeta->subtypes[i]);
3467 }
3468
3469 riinfo->fpmeta = fpmeta;
3470 MemoryContextSwitchTo(oldcxt);
3471}
3472
3473/*
3474 * Extract fields from a tuple into Datum/nulls arrays
3475 */
3476static void
3477ri_ExtractValues(Relation rel, TupleTableSlot *slot,
3478 const RI_ConstraintInfo *riinfo, bool rel_is_pk,
3479 Datum *vals, char *nulls)
3480{
3481 const int16 *attnums;
3482 bool isnull;
3483
3484 if (rel_is_pk)
3485 attnums = riinfo->pk_attnums;
3486 else
3487 attnums = riinfo->fk_attnums;
3488
3489 for (int i = 0; i < riinfo->nkeys; i++)
3490 {
3491 vals[i] = slot_getattr(slot, attnums[i], &isnull);
3492 nulls[i] = isnull ? 'n' : ' ';
3493 }
3494}
3495
3496/*
3497 * Produce an error report
3498 *
3499 * If the failed constraint was on insert/update to the FK table,
3500 * we want the key names and values extracted from there, and the error
3501 * message to look like 'key blah is not present in PK'.
3502 * Otherwise, the attr names and values come from the PK table and the
3503 * message looks like 'key blah is still referenced from FK'.
3504 */
3505static void
3506ri_ReportViolation(const RI_ConstraintInfo *riinfo,
3507 Relation pk_rel, Relation fk_rel,
3508 TupleTableSlot *violatorslot, TupleDesc tupdesc,
3509 int queryno, bool is_restrict, bool partgone)
3510{
3511 StringInfoData key_names;
3512 StringInfoData key_values;
3513 bool onfk;
3514 const int16 *attnums;
3515 Oid rel_oid;
3516 AclResult aclresult;
3517 bool has_perm = true;
3518
3519 /*
3520 * Determine which relation to complain about. If tupdesc wasn't passed
3521 * by caller, assume the violator tuple came from there.
3522 */
3523 onfk = (queryno == RI_PLAN_CHECK_LOOKUPPK);
3524 if (onfk)
3525 {
3526 attnums = riinfo->fk_attnums;
3527 rel_oid = fk_rel->rd_id;
3528 if (tupdesc == NULL)
3529 tupdesc = fk_rel->rd_att;
3530 }
3531 else
3532 {
3533 attnums = riinfo->pk_attnums;
3534 rel_oid = pk_rel->rd_id;
3535 if (tupdesc == NULL)
3536 tupdesc = pk_rel->rd_att;
3537 }
3538
3539 /*
3540 * Check permissions- if the user does not have access to view the data in
3541 * any of the key columns then we don't include the errdetail() below.
3542 *
3543 * Check if RLS is enabled on the relation first. If so, we don't return
3544 * any specifics to avoid leaking data.
3545 *
3546 * Check table-level permissions next and, failing that, column-level
3547 * privileges.
3548 *
3549 * When a partition at the referenced side is being detached/dropped, we
3550 * needn't check, since the user must be the table owner anyway.
3551 */
3552 if (partgone)
3553 has_perm = true;
3554 else if (check_enable_rls(rel_oid, InvalidOid, true) != RLS_ENABLED)
3555 {
3556 aclresult = pg_class_aclcheck(rel_oid, GetUserId(), ACL_SELECT);
3557 if (aclresult != ACLCHECK_OK)
3558 {
3559 /* Try for column-level permissions */
3560 for (int idx = 0; idx < riinfo->nkeys; idx++)
3561 {
3562 aclresult = pg_attribute_aclcheck(rel_oid, attnums[idx],
3563 GetUserId(),
3564 ACL_SELECT);
3565
3566 /* No access to the key */
3567 if (aclresult != ACLCHECK_OK)
3568 {
3569 has_perm = false;
3570 break;
3571 }
3572 }
3573 }
3574 }
3575 else
3576 has_perm = false;
3577
3578 if (has_perm)
3579 {
3580 /* Get printable versions of the keys involved */
3581 initStringInfo(&key_names);
3582 initStringInfo(&key_values);
3583 for (int idx = 0; idx < riinfo->nkeys; idx++)
3584 {
3585 int fnum = attnums[idx];
3586 Form_pg_attribute att = TupleDescAttr(tupdesc, fnum - 1);
3587 char *name,
3588 *val;
3589 Datum datum;
3590 bool isnull;
3591
3592 name = NameStr(att->attname);
3593
3594 datum = slot_getattr(violatorslot, fnum, &isnull);
3595 if (!isnull)
3596 {
3597 Oid foutoid;
3598 bool typisvarlena;
3599
3600 getTypeOutputInfo(att->atttypid, &foutoid, &typisvarlena);
3601 val = OidOutputFunctionCall(foutoid, datum);
3602 }
3603 else
3604 val = "null";
3605
3606 if (idx > 0)
3607 {
3608 appendStringInfoString(&key_names, ", ");
3609 appendStringInfoString(&key_values, ", ");
3610 }
3611 appendStringInfoString(&key_names, name);
3612 appendStringInfoString(&key_values, val);
3613 }
3614 }
3615
3616 if (partgone)
3617 ereport(ERROR,
3618 (errcode(ERRCODE_FOREIGN_KEY_VIOLATION),
3619 errmsg("removing partition \"%s\" violates foreign key constraint \"%s\"",
3620 RelationGetRelationName(pk_rel),
3621 NameStr(riinfo->conname)),
3622 errdetail("Key (%s)=(%s) is still referenced from table \"%s\".",
3623 key_names.data, key_values.data,
3624 RelationGetRelationName(fk_rel)),
3625 errtableconstraint(fk_rel, NameStr(riinfo->conname))));
3626 else if (onfk)
3627 ereport(ERROR,
3628 (errcode(ERRCODE_FOREIGN_KEY_VIOLATION),
3629 errmsg("insert or update on table \"%s\" violates foreign key constraint \"%s\"",
3630 RelationGetRelationName(fk_rel),
3631 NameStr(riinfo->conname)),
3632 has_perm ?
3633 errdetail("Key (%s)=(%s) is not present in table \"%s\".",
3634 key_names.data, key_values.data,
3635 RelationGetRelationName(pk_rel)) :
3636 errdetail("Key is not present in table \"%s\".",
3637 RelationGetRelationName(pk_rel)),
3638 errtableconstraint(fk_rel, NameStr(riinfo->conname))));
3639 else if (is_restrict)
3640 ereport(ERROR,
3641 (errcode(ERRCODE_RESTRICT_VIOLATION),
3642 errmsg("update or delete on table \"%s\" violates RESTRICT setting of foreign key constraint \"%s\" on table \"%s\"",
3643 RelationGetRelationName(pk_rel),
3644 NameStr(riinfo->conname),
3645 RelationGetRelationName(fk_rel)),
3646 has_perm ?
3647 errdetail("Key (%s)=(%s) is referenced from table \"%s\".",
3648 key_names.data, key_values.data,
3649 RelationGetRelationName(fk_rel)) :
3650 errdetail("Key is referenced from table \"%s\".",
3651 RelationGetRelationName(fk_rel)),
3652 errtableconstraint(fk_rel, NameStr(riinfo->conname))));
3653 else
3654 ereport(ERROR,
3655 (errcode(ERRCODE_FOREIGN_KEY_VIOLATION),
3656 errmsg("update or delete on table \"%s\" violates foreign key constraint \"%s\" on table \"%s\"",
3657 RelationGetRelationName(pk_rel),
3658 NameStr(riinfo->conname),
3659 RelationGetRelationName(fk_rel)),
3660 has_perm ?
3661 errdetail("Key (%s)=(%s) is still referenced from table \"%s\".",
3662 key_names.data, key_values.data,
3663 RelationGetRelationName(fk_rel)) :
3664 errdetail("Key is still referenced from table \"%s\".",
3665 RelationGetRelationName(fk_rel)),
3666 errtableconstraint(fk_rel, NameStr(riinfo->conname))));
3667}
3668
3669
3670/*
3671 * ri_NullCheck -
3672 *
3673 * Determine the NULL state of all key values in a tuple
3674 *
3675 * Returns one of RI_KEYS_ALL_NULL, RI_KEYS_NONE_NULL or RI_KEYS_SOME_NULL.
3676 */
3677static int
3678ri_NullCheck(TupleDesc tupDesc,
3679 TupleTableSlot *slot,
3680 const RI_ConstraintInfo *riinfo, bool rel_is_pk)
3681{
3682 const int16 *attnums;
3683 bool allnull = true;
3684 bool nonenull = true;
3685
3686 if (rel_is_pk)
3687 attnums = riinfo->pk_attnums;
3688 else
3689 attnums = riinfo->fk_attnums;
3690
3691 for (int i = 0; i < riinfo->nkeys; i++)
3692 {
3693 if (slot_attisnull(slot, attnums[i]))
3694 nonenull = false;
3695 else
3696 allnull = false;
3697 }
3698
3699 if (allnull)
3700 return RI_KEYS_ALL_NULL;
3701
3702 if (nonenull)
3703 return RI_KEYS_NONE_NULL;
3704
3705 return RI_KEYS_SOME_NULL;
3706}
3707
3708
3709/*
3710 * ri_InitHashTables -
3711 *
3712 * Initialize our internal hash tables.
3713 */
3714static void
3715ri_InitHashTables(void)
3716{
3717 HASHCTL ctl;
3718
3719 ctl.keysize = sizeof(Oid);
3720 ctl.entrysize = sizeof(RI_ConstraintInfo);
3721 ri_constraint_cache = hash_create("RI constraint cache",
3722 RI_INIT_CONSTRAINTHASHSIZE,
3723 &ctl, HASH_ELEM | HASH_BLOBS);
3724
3725 /* Arrange to flush cache on pg_constraint changes */
3726 CacheRegisterSyscacheCallback(CONSTROID,
3727 InvalidateConstraintCacheCallBack,
3728 (Datum) 0);
3729
3730 ctl.keysize = sizeof(RI_QueryKey);
3731 ctl.entrysize = sizeof(RI_QueryHashEntry);
3732 ri_query_cache = hash_create("RI query cache",
3733 RI_INIT_QUERYHASHSIZE,
3734 &ctl, HASH_ELEM | HASH_BLOBS);
3735
3736 ctl.keysize = sizeof(RI_CompareKey);
3737 ctl.entrysize = sizeof(RI_CompareHashEntry);
3738 ri_compare_cache = hash_create("RI compare cache",
3739 RI_INIT_QUERYHASHSIZE,
3740 &ctl, HASH_ELEM | HASH_BLOBS);
3741}
3742
3743
3744/*
3745 * ri_FetchPreparedPlan -
3746 *
3747 * Lookup for a query key in our private hash table of prepared
3748 * and saved SPI execution plans. Return the plan if found or NULL.
3749 */
3750static SPIPlanPtr
3751ri_FetchPreparedPlan(RI_QueryKey *key)
3752{
3753 RI_QueryHashEntry *entry;
3754 SPIPlanPtr plan;
3755
3756 /*
3757 * On the first call initialize the hashtable
3758 */
3759 if (!ri_query_cache)
3760 ri_InitHashTables();
3761
3762 /*
3763 * Lookup for the key
3764 */
3765 entry = (RI_QueryHashEntry *) hash_search(ri_query_cache,
3766 key,
3767 HASH_FIND, NULL);
3768 if (entry == NULL)
3769 return NULL;
3770
3771 /*
3772 * Check whether the plan is still valid. If it isn't, we don't want to
3773 * simply rely on plancache.c to regenerate it; rather we should start
3774 * from scratch and rebuild the query text too. This is to cover cases
3775 * such as table/column renames. We depend on the plancache machinery to
3776 * detect possible invalidations, though.
3777 *
3778 * CAUTION: this check is only trustworthy if the caller has already
3779 * locked both FK and PK rels.
3780 */
3781 plan = entry->plan;
3782 if (plan && SPI_plan_is_valid(plan))
3783 return plan;
3784
3785 /*
3786 * Otherwise we might as well flush the cached plan now, to free a little
3787 * memory space before we make a new one.
3788 */
3789 entry->plan = NULL;
3790 if (plan)
3791 SPI_freeplan(plan);
3792
3793 return NULL;
3794}
3795
3796
3797/*
3798 * ri_HashPreparedPlan -
3799 *
3800 * Add another plan to our private SPI query plan hashtable.
3801 */
3802static void
3803ri_HashPreparedPlan(RI_QueryKey *key, SPIPlanPtr plan)
3804{
3805 RI_QueryHashEntry *entry;
3806 bool found;
3807
3808 /*
3809 * On the first call initialize the hashtable
3810 */
3811 if (!ri_query_cache)
3812 ri_InitHashTables();
3813
3814 /*
3815 * Add the new plan. We might be overwriting an entry previously found
3816 * invalid by ri_FetchPreparedPlan.
3817 */
3818 entry = (RI_QueryHashEntry *) hash_search(ri_query_cache,
3819 key,
3820 HASH_ENTER, &found);
3821 Assert(!found || entry->plan == NULL);
3822 entry->plan = plan;
3823}
3824
3825
3826/*
3827 * ri_KeysEqual -
3828 *
3829 * Check if all key values in OLD and NEW are "equivalent":
3830 * For normal FKs we check for equality.
3831 * For temporal FKs we check that the PK side is a superset of its old value,
3832 * or the FK side is a subset of its old value.
3833 *
3834 * Note: at some point we might wish to redefine this as checking for
3835 * "IS NOT DISTINCT" rather than "=", that is, allow two nulls to be
3836 * considered equal. Currently there is no need since all callers have
3837 * previously found at least one of the rows to contain no nulls.
3838 */
3839static bool
3840ri_KeysEqual(Relation rel, TupleTableSlot *oldslot, TupleTableSlot *newslot,
3841 const RI_ConstraintInfo *riinfo, bool rel_is_pk)
3842{
3843 const int16 *attnums;
3844
3845 if (rel_is_pk)
3846 attnums = riinfo->pk_attnums;
3847 else
3848 attnums = riinfo->fk_attnums;
3849
3850 /* XXX: could be worthwhile to fetch all necessary attrs at once */
3851 for (int i = 0; i < riinfo->nkeys; i++)
3852 {
3853 Datum oldvalue;
3854 Datum newvalue;
3855 bool isnull;
3856
3857 /*
3858 * Get one attribute's oldvalue. If it is NULL - they're not equal.
3859 */
3860 oldvalue = slot_getattr(oldslot, attnums[i], &isnull);
3861 if (isnull)
3862 return false;
3863
3864 /*
3865 * Get one attribute's newvalue. If it is NULL - they're not equal.
3866 */
3867 newvalue = slot_getattr(newslot, attnums[i], &isnull);
3868 if (isnull)
3869 return false;
3870
3871 if (rel_is_pk)
3872 {
3873 /*
3874 * If we are looking at the PK table, then do a bytewise
3875 * comparison. We must propagate PK changes if the value is
3876 * changed to one that "looks" different but would compare as
3877 * equal using the equality operator. This only makes a
3878 * difference for ON UPDATE CASCADE, but for consistency we treat
3879 * all changes to the PK the same.
3880 */
3881 CompactAttribute *att = TupleDescCompactAttr(oldslot->tts_tupleDescriptor, attnums[i] - 1);
3882
3883 if (!datum_image_eq(oldvalue, newvalue, att->attbyval, att->attlen))
3884 return false;
3885 }
3886 else
3887 {
3888 Oid eq_opr;
3889
3890 /*
3891 * When comparing the PERIOD columns we can skip the check
3892 * whenever the referencing column stayed equal or shrank, so test
3893 * with the contained-by operator instead.
3894 */
3895 if (riinfo->hasperiod && i == riinfo->nkeys - 1)
3896 eq_opr = riinfo->period_contained_by_oper;
3897 else
3898 eq_opr = riinfo->ff_eq_oprs[i];
3899
3900 /*
3901 * For the FK table, compare with the appropriate equality
3902 * operator. Changes that compare equal will still satisfy the
3903 * constraint after the update.
3904 */
3905 if (!ri_CompareWithCast(eq_opr, RIAttType(rel, attnums[i]), RIAttCollation(rel, attnums[i]),
3906 newvalue, oldvalue))
3907 return false;
3908 }
3909 }
3910
3911 return true;
3912}
3913
3914
3915/*
3916 * ri_CompareWithCast -
3917 *
3918 * Call the appropriate comparison operator for two values.
3919 * Normally this is equality, but for the PERIOD part of foreign keys
3920 * it is ContainedBy, so the order of lhs vs rhs is significant.
3921 * See below for how the collation is applied.
3922 *
3923 * NB: we have already checked that neither value is null.
3924 */
3925static bool
3926ri_CompareWithCast(Oid eq_opr, Oid typeid, Oid collid,
3927 Datum lhs, Datum rhs)
3928{
3929 RI_CompareHashEntry *entry = ri_HashCompareOp(eq_opr, typeid);
3930
3931 /* Do we need to cast the values? */
3932 if (OidIsValid(entry->cast_func_finfo.fn_oid))
3933 {
3934 lhs = FunctionCall3(&entry->cast_func_finfo,
3935 lhs,
3936 Int32GetDatum(-1), /* typmod */
3937 BoolGetDatum(false)); /* implicit coercion */
3938 rhs = FunctionCall3(&entry->cast_func_finfo,
3939 rhs,
3940 Int32GetDatum(-1), /* typmod */
3941 BoolGetDatum(false)); /* implicit coercion */
3942 }
3943
3944 /*
3945 * Apply the comparison operator.
3946 *
3947 * Note: This function is part of a call stack that determines whether an
3948 * update to a row is significant enough that it needs checking or action
3949 * on the other side of a foreign-key constraint. Therefore, the
3950 * comparison here would need to be done with the collation of the *other*
3951 * table. For simplicity (e.g., we might not even have the other table
3952 * open), we'll use our own collation. This is fine because we require
3953 * that both collations have the same notion of equality (either they are
3954 * both deterministic or else they are both the same).
3955 *
3956 * With range/multirangetypes, the collation of the base type is stored as
3957 * part of the rangetype (pg_range.rngcollation), and always used, so
3958 * there is no danger of inconsistency even using a non-equals operator.
3959 * But if we support arbitrary types with PERIOD, we should perhaps just
3960 * always force a re-check.
3961 */
3962 return DatumGetBool(FunctionCall2Coll(&entry->eq_opr_finfo, collid, lhs, rhs));
3963}
3964
3965/*
3966 * ri_HashCompareOp -
3967 *
3968 * Look up or create a cache entry for the given equality operator and
3969 * the caller's value type (typeid). The entry holds the operator's
3970 * FmgrInfo and, if typeid doesn't match what the operator expects as
3971 * its right-hand input, a cast function to coerce the value before
3972 * comparison.
3973 */
3974static RI_CompareHashEntry *
3975ri_HashCompareOp(Oid eq_opr, Oid typeid)
3976{
3977 RI_CompareKey key;
3978 RI_CompareHashEntry *entry;
3979 bool found;
3980
3981 /*
3982 * On the first call initialize the hashtable
3983 */
3984 if (!ri_compare_cache)
3985 ri_InitHashTables();
3986
3987 /*
3988 * Find or create a hash entry. Note we're assuming RI_CompareKey
3989 * contains no struct padding.
3990 */
3991 key.eq_opr = eq_opr;
3992 key.typeid = typeid;
3993 entry = (RI_CompareHashEntry *) hash_search(ri_compare_cache,
3994 &key,
3995 HASH_ENTER, &found);
3996 if (!found)
3997 entry->valid = false;
3998
3999 /*
4000 * If not already initialized, do so. Since we'll keep this hash entry
4001 * for the life of the backend, put any subsidiary info for the function
4002 * cache structs into TopMemoryContext.
4003 */
4004 if (!entry->valid)
4005 {
4006 Oid lefttype,
4007 righttype,
4008 castfunc;
4009 CoercionPathType pathtype;
4010
4011 /* We always need to know how to call the equality operator */
4012 fmgr_info_cxt(get_opcode(eq_opr), &entry->eq_opr_finfo,
4013 TopMemoryContext);
4014
4015 /*
4016 * If we chose to use a cast from FK to PK type, we may have to apply
4017 * the cast function to get to the operator's input type.
4018 *
4019 * XXX eventually it would be good to support array-coercion cases
4020 * here and in ri_CompareWithCast(). At the moment there is no point
4021 * because cases involving nonidentical array types will be rejected
4022 * at constraint creation time.
4023 *
4024 * XXX perhaps also consider supporting CoerceViaIO? No need at the
4025 * moment since that will never be generated for implicit coercions.
4026 */
4027 op_input_types(eq_opr, &lefttype, &righttype);
4028
4029 /*
4030 * pf_eq_oprs (used by the fast path) can be cross-type when the FK
4031 * and PK columns differ in type, e.g. int48eq for int4 PK / int8 FK.
4032 * If the FK column's type already matches what the operator expects
4033 * as its right-hand input, no cast is needed.
4034 */
4035 if (typeid == righttype)
4036 castfunc = InvalidOid; /* simplest case */
4037 else
4038 {
4039 pathtype = find_coercion_pathway(lefttype, typeid,
4040 COERCION_IMPLICIT,
4041 &castfunc);
4042 if (pathtype != COERCION_PATH_FUNC &&
4043 pathtype != COERCION_PATH_RELABELTYPE)
4044 {
4045 /*
4046 * The declared input type of the eq_opr might be a
4047 * polymorphic type such as ANYARRAY or ANYENUM, or other
4048 * special cases such as RECORD; find_coercion_pathway
4049 * currently doesn't subsume these special cases.
4050 */
4051 if (!IsBinaryCoercible(typeid, lefttype))
4052 elog(ERROR, "no conversion function from %s to %s",
4053 format_type_be(typeid),
4054 format_type_be(lefttype));
4055 }
4056 }
4057 if (OidIsValid(castfunc))
4058 fmgr_info_cxt(castfunc, &entry->cast_func_finfo,
4059 TopMemoryContext);
4060 else
4061 entry->cast_func_finfo.fn_oid = InvalidOid;
4062 entry->valid = true;
4063 }
4064
4065 return entry;
4066}
4067
4068
4069/*
4070 * Given a trigger function OID, determine whether it is an RI trigger,
4071 * and if so whether it is attached to PK or FK relation.
4072 */
4073int
4074RI_FKey_trigger_type(Oid tgfoid)
4075{
4076 switch (tgfoid)
4077 {
4078 case F_RI_FKEY_CASCADE_DEL:
4079 case F_RI_FKEY_CASCADE_UPD:
4080 case F_RI_FKEY_RESTRICT_DEL:
4081 case F_RI_FKEY_RESTRICT_UPD:
4082 case F_RI_FKEY_SETNULL_DEL:
4083 case F_RI_FKEY_SETNULL_UPD:
4084 case F_RI_FKEY_SETDEFAULT_DEL:
4085 case F_RI_FKEY_SETDEFAULT_UPD:
4086 case F_RI_FKEY_NOACTION_DEL:
4087 case F_RI_FKEY_NOACTION_UPD:
4088 return RI_TRIGGER_PK;
4089
4090 case F_RI_FKEY_CHECK_INS:
4091 case F_RI_FKEY_CHECK_UPD:
4092 return RI_TRIGGER_FK;
4093 }
4094
4095 return RI_TRIGGER_NONE;
4096}
4097
4098/*
4099 * ri_FastPathEndBatch
4100 * Flush remaining rows and tear down cached state.
4101 *
4102 * Registered as an AfterTriggerBatchCallback. Note: the flush can
4103 * do real work (CCI, security context switch, index probes) and can
4104 * throw ERROR on a constraint violation. If that happens,
4105 * ri_FastPathTeardown never runs; ResourceOwner + XactCallback
4106 * handle resource cleanup on the abort path.
4107 */
4108static void
4109ri_FastPathEndBatch(void *arg)
4110{
4111 HASH_SEQ_STATUS status;
4112 RI_FastPathEntry *entry;
4113
4114 if (ri_fastpath_cache == NULL)
4115 return;
4116
4117 /* Flush any partial batches -- can throw ERROR */
4118 hash_seq_init(&status, ri_fastpath_cache);
4119 while ((entry = hash_seq_search(&status)) != NULL)
4120 {
4121 if (entry->batch_count > 0)
4122 {
4123 Relation fk_rel = table_open(entry->fk_relid, AccessShareLock);
4124 const RI_ConstraintInfo *riinfo = ri_LoadConstraintInfo(entry->conoid);
4125
4126 ri_FastPathBatchFlush(entry, fk_rel, riinfo);
4127 table_close(fk_rel, NoLock);
4128 }
4129 }
4130
4131 ri_FastPathTeardown();
4132}
4133
4134/*
4135 * ri_FastPathTeardown
4136 * Tear down all cached fast-path state.
4137 *
4138 * Called from ri_FastPathEndBatch() after flushing any remaining rows.
4139 */
4140static void
4141ri_FastPathTeardown(void)
4142{
4143 HASH_SEQ_STATUS status;
4144 RI_FastPathEntry *entry;
4145
4146 if (ri_fastpath_cache == NULL)
4147 return;
4148
4149 hash_seq_init(&status, ri_fastpath_cache);
4150 while ((entry = hash_seq_search(&status)) != NULL)
4151 {
4152 if (entry->idx_rel)
4153 index_close(entry->idx_rel, NoLock);
4154 if (entry->pk_rel)
4155 table_close(entry->pk_rel, NoLock);
4156 if (entry->pk_slot)
4157 ExecDropSingleTupleTableSlot(entry->pk_slot);
4158 if (entry->fk_slot)
4159 ExecDropSingleTupleTableSlot(entry->fk_slot);
4160 if (entry->flush_cxt)
4161 MemoryContextDelete(entry->flush_cxt);
4162 }
4163
4164 hash_destroy(ri_fastpath_cache);
4165 ri_fastpath_cache = NULL;
4166 ri_fastpath_callback_registered = false;
4167}
4168
4169static bool ri_fastpath_xact_callback_registered = false;
4170
4171static void
4172ri_FastPathXactCallback(XactEvent event, void *arg)
4173{
4174 /*
4175 * On abort, ResourceOwner already released relations; on commit,
4176 * ri_FastPathTeardown already ran. Either way, just NULL the static
4177 * pointers so they don't dangle into the next transaction.
4178 */
4179 ri_fastpath_cache = NULL;
4180 ri_fastpath_callback_registered = false;
4181}
4182
4183static void
4184ri_FastPathSubXactCallback(SubXactEvent event, SubTransactionId mySubid,
4185 SubTransactionId parentSubid, void *arg)
4186{
4187 if (event == SUBXACT_EVENT_ABORT_SUB)
4188 {
4189 /*
4190 * ResourceOwner already released relations. NULL the static pointers
4191 * so the still-registered batch callback becomes a no-op for the rest
4192 * of this transaction.
4193 */
4194 ri_fastpath_cache = NULL;
4195 ri_fastpath_callback_registered = false;
4196 }
4197}
4198
4199/*
4200 * ri_FastPathGetEntry
4201 * Look up or create a per-batch cache entry for the given constraint.
4202 *
4203 * On first call for a constraint within a batch: opens pk_rel and the index,
4204 * allocates slots for both FK row and the looked up PK row, and registers the
4205 * cleanup callback.
4206 *
4207 * On subsequent calls: returns the existing entry.
4208 */
4209static RI_FastPathEntry *
4210ri_FastPathGetEntry(const RI_ConstraintInfo *riinfo, Relation fk_rel)
4211{
4212 RI_FastPathEntry *entry;
4213 bool found;
4214
4215 /* Create hash table on first use in this batch */
4216 if (ri_fastpath_cache == NULL)
4217 {
4218 HASHCTL ctl;
4219
4220 if (!ri_fastpath_xact_callback_registered)
4221 {
4222 RegisterXactCallback(ri_FastPathXactCallback, NULL);
4223 RegisterSubXactCallback(ri_FastPathSubXactCallback, NULL);
4224 ri_fastpath_xact_callback_registered = true;
4225 }
4226
4227 ctl.keysize = sizeof(Oid);
4228 ctl.entrysize = sizeof(RI_FastPathEntry);
4229 ctl.hcxt = TopTransactionContext;
4230 ri_fastpath_cache = hash_create("RI fast-path cache",
4231 16,
4232 &ctl,
4233 HASH_ELEM | HASH_BLOBS | HASH_CONTEXT);
4234 }
4235
4236 entry = hash_search(ri_fastpath_cache, &riinfo->constraint_id,
4237 HASH_ENTER, &found);
4238
4239 if (!found)
4240 {
4241 MemoryContext oldcxt;
4242
4243 /*
4244 * Zero out non-key fields so ri_FastPathTeardown is safe if we error
4245 * out during partial initialization below.
4246 */
4247 memset(((char *) entry) + offsetof(RI_FastPathEntry, pk_rel), 0,
4248 sizeof(RI_FastPathEntry) - offsetof(RI_FastPathEntry, pk_rel));
4249
4250 oldcxt = MemoryContextSwitchTo(TopTransactionContext);
4251
4252 entry->fk_relid = RelationGetRelid(fk_rel);
4253
4254 /*
4255 * Open PK table and its unique index.
4256 *
4257 * RowShareLock on pk_rel matches what the SPI path's SELECT ... FOR
4258 * KEY SHARE would acquire as a relation-level lock. AccessShareLock
4259 * on the index is standard for index scans.
4260 *
4261 * We don't release these locks until end of transaction, matching SPI
4262 * behavior.
4263 */
4264 entry->pk_rel = table_open(riinfo->pk_relid, RowShareLock);
4265 entry->idx_rel = index_open(riinfo->conindid, AccessShareLock);
4266 entry->pk_slot = table_slot_create(entry->pk_rel, NULL);
4267
4268 /*
4269 * Must be TTSOpsHeapTuple because ExecStoreHeapTuple() is used to
4270 * load entries from batch[] into this slot for value extraction.
4271 */
4272 entry->fk_slot = MakeSingleTupleTableSlot(RelationGetDescr(fk_rel),
4273 &TTSOpsHeapTuple);
4274
4275 entry->flush_cxt = AllocSetContextCreate(TopTransactionContext,
4276 "RI fast path flush temporary context",
4277 ALLOCSET_SMALL_SIZES);
4278 MemoryContextSwitchTo(oldcxt);
4279
4280 /* Ensure cleanup at end of this trigger-firing batch */
4281 if (!ri_fastpath_callback_registered)
4282 {
4283 RegisterAfterTriggerBatchCallback(ri_FastPathEndBatch, NULL);
4284 ri_fastpath_callback_registered = true;
4285 }
4286 }
4287
4288 return entry;
4289}
idx
Datum idx(PG_FUNCTION_ARGS)
Definition _int_op.c:262
AclResult
AclResult
Definition acl.h:183
ACLCHECK_OK
@ ACLCHECK_OK
Definition acl.h:184
has_bypassrls_privilege
bool has_bypassrls_privilege(Oid roleid)
Definition aclchk.c:4231
aclcheck_error
void aclcheck_error(AclResult aclerr, ObjectType objtype, const char *objectname)
Definition aclchk.c:2672
pg_attribute_aclcheck
AclResult pg_attribute_aclcheck(Oid table_oid, AttrNumber attnum, Oid roleid, AclMode mode)
Definition aclchk.c:3911
object_aclcheck
AclResult object_aclcheck(Oid classid, Oid objectid, Oid roleid, AclMode mode)
Definition aclchk.c:3879
object_ownercheck
bool object_ownercheck(Oid classid, Oid objectid, Oid roleid)
Definition aclchk.c:4133
pg_class_aclcheck
AclResult pg_class_aclcheck(Oid table_oid, Oid roleid, AclMode mode)
Definition aclchk.c:4082
construct_array
ArrayType * construct_array(Datum *elems, int nelems, Oid elmtype, int elmlen, bool elmbyval, char elmalign)
Definition arrayfuncs.c:3367
bms_add_member
Bitmapset * bms_add_member(Bitmapset *a, int x)
Definition bitmapset.c:799
values
static Datum values[MAXATTR]
Definition bootstrap.c:190
NameStr
#define NameStr(name)
Definition c.h:835
SubTransactionId
uint32 SubTransactionId
Definition c.h:740
pg_noreturn
#define pg_noreturn
Definition c.h:190
Assert
#define Assert(condition)
Definition c.h:943
int16
int16_t int16
Definition c.h:619
RegProcedure
regproc RegProcedure
Definition c.h:734
int32
int32_t int32
Definition c.h:620
uint32
uint32_t uint32
Definition c.h:624
OidIsValid
#define OidIsValid(objectId)
Definition c.h:858
result
uint32 result
Definition checksum_block_internal.h:18
memcpy
memcpy(sums, checksumBaseOffsets, sizeof(checksumBaseOffsets))
collid
Oid collid
Definition collationcmds.c:705
datum_image_eq
bool datum_image_eq(Datum value1, Datum value2, bool typByVal, int typLen)
Definition datum.c:271
hash_search
void * hash_search(HTAB *hashp, const void *keyPtr, HASHACTION action, bool *foundPtr)
Definition dynahash.c:889
hash_create
HTAB * hash_create(const char *tabname, int64 nelem, const HASHCTL *info, int flags)
Definition dynahash.c:360
hash_destroy
void hash_destroy(HTAB *hashp)
Definition dynahash.c:802
hash_seq_search
void * hash_seq_search(HASH_SEQ_STATUS *status)
Definition dynahash.c:1352
hash_seq_init
void hash_seq_init(HASH_SEQ_STATUS *status, HTAB *hashp)
Definition dynahash.c:1317
arg
Datum arg
Definition elog.c:1322
errcode
int errcode(int sqlerrcode)
Definition elog.c:874
errhint
int errhint(const char *fmt,...) pg_attribute_printf(1
errdetail
int errdetail(const char *fmt,...) pg_attribute_printf(1
ERROR
#define ERROR
Definition elog.h:40
elog
#define elog(elevel,...)
Definition elog.h:228
ereport
#define ereport(elevel,...)
Definition elog.h:152
ExecCheckPermissions
bool ExecCheckPermissions(List *rangeTable, List *rteperminfos, bool ereport_on_violation)
Definition execMain.c:593
MakeSingleTupleTableSlot
TupleTableSlot * MakeSingleTupleTableSlot(TupleDesc tupdesc, const TupleTableSlotOps *tts_ops)
Definition execTuples.c:1497
TTSOpsVirtual
const TupleTableSlotOps TTSOpsVirtual
Definition execTuples.c:84
ExecDropSingleTupleTableSlot
void ExecDropSingleTupleTableSlot(TupleTableSlot *slot)
Definition execTuples.c:1513
ExecStoreVirtualTuple
TupleTableSlot * ExecStoreVirtualTuple(TupleTableSlot *slot)
Definition execTuples.c:1817
TTSOpsHeapTuple
const TupleTableSlotOps TTSOpsHeapTuple
Definition execTuples.c:85
ExecStoreHeapTuple
TupleTableSlot * ExecStoreHeapTuple(HeapTuple tuple, TupleTableSlot *slot, bool shouldFree)
Definition execTuples.c:1617
palloc_object
#define palloc_object(type)
Definition fe_memutils.h:74
FunctionCall2Coll
Datum FunctionCall2Coll(FmgrInfo *flinfo, Oid collation, Datum arg1, Datum arg2)
Definition fmgr.c:1151
OidOutputFunctionCall
char * OidOutputFunctionCall(Oid functionId, Datum val)
Definition fmgr.c:1764
fmgr_info_cxt
void fmgr_info_cxt(Oid functionId, FmgrInfo *finfo, MemoryContext mcxt)
Definition fmgr.c:139
fmgr_info_copy
void fmgr_info_copy(FmgrInfo *dstinfo, FmgrInfo *srcinfo, MemoryContext destcxt)
Definition fmgr.c:582
FunctionCall3
#define FunctionCall3(flinfo, arg1, arg2, arg3)
Definition fmgr.h:706
PG_FUNCTION_ARGS
#define PG_FUNCTION_ARGS
Definition fmgr.h:193
format_type_be
char * format_type_be(Oid type_oid)
Definition format_type.c:343
maintenance_work_mem
int maintenance_work_mem
Definition globals.c:135
NewGUCNestLevel
int NewGUCNestLevel(void)
Definition guc.c:2142
AtEOXact_GUC
void AtEOXact_GUC(bool isCommit, int nestLevel)
Definition guc.c:2169
set_config_option
int set_config_option(const char *name, const char *value, GucContext context, GucSource source, GucAction action, bool changeVal, int elevel, bool is_reload)
Definition guc.c:3248
GUC_ACTION_SAVE
@ GUC_ACTION_SAVE
Definition guc.h:205
PGC_S_SESSION
@ PGC_S_SESSION
Definition guc.h:126
PGC_USERSET
@ PGC_USERSET
Definition guc.h:79
heap_deform_tuple
void heap_deform_tuple(HeapTuple tuple, TupleDesc tupleDesc, Datum *values, bool *isnull)
Definition heaptuple.c:1254
HASH_FIND
@ HASH_FIND
Definition hsearch.h:108
HASH_ENTER
@ HASH_ENTER
Definition hsearch.h:109
HASH_CONTEXT
#define HASH_CONTEXT
Definition hsearch.h:97
HASH_ELEM
#define HASH_ELEM
Definition hsearch.h:90
HASH_BLOBS
#define HASH_BLOBS
Definition hsearch.h:92
HeapTupleIsValid
#define HeapTupleIsValid(tuple)
Definition htup.h:78
htup_details.h
GETSTRUCT
static void * GETSTRUCT(const HeapTupleData *tuple)
Definition htup_details.h:714
dclist_container
#define dclist_container(type, membername, ptr)
Definition ilist.h:947
dclist_push_tail
static void dclist_push_tail(dclist_head *head, dlist_node *node)
Definition ilist.h:709
dclist_count
static uint32 dclist_count(const dclist_head *head)
Definition ilist.h:932
dclist_delete_from
static void dclist_delete_from(dclist_head *head, dlist_node *node)
Definition ilist.h:763
dclist_foreach_modify
#define dclist_foreach_modify(iter, lhead)
Definition ilist.h:973
funcname
#define funcname
Definition indent_codes.h:69
BuildIndexInfo
IndexInfo * BuildIndexInfo(Relation index)
Definition index.c:2446
FormIndexDatum
void FormIndexDatum(IndexInfo *indexInfo, TupleTableSlot *slot, EState *estate, Datum *values, bool *isnull)
Definition index.c:2748
index_getnext_slot
bool index_getnext_slot(IndexScanDesc scan, ScanDirection direction, TupleTableSlot *slot)
Definition indexam.c:698
index_beginscan
IndexScanDesc index_beginscan(Relation heapRelation, Relation indexRelation, Snapshot snapshot, IndexScanInstrumentation *instrument, int nkeys, int norderbys, uint32 flags)
Definition indexam.c:257
index_close
void index_close(Relation relation, LOCKMODE lockmode)
Definition indexam.c:178
index_endscan
void index_endscan(IndexScanDesc scan)
Definition indexam.c:394
index_open
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition indexam.c:134
index_rescan
void index_rescan(IndexScanDesc scan, ScanKey keys, int nkeys, ScanKey orderbys, int norderbys)
Definition indexam.c:368
val
long val
Definition informix.c:689
CacheRegisterSyscacheCallback
void CacheRegisterSyscacheCallback(SysCacheIdentifier cacheid, SyscacheCallbackFunction func, Datum arg)
Definition inval.c:1816
j
int j
Definition isn.c:78
i
int i
Definition isn.c:77
lappend
List * lappend(List *list, void *datum)
Definition list.c:339
NoLock
#define NoLock
Definition lockdefs.h:34
AccessShareLock
#define AccessShareLock
Definition lockdefs.h:36
RowShareLock
#define RowShareLock
Definition lockdefs.h:37
RowExclusiveLock
#define RowExclusiveLock
Definition lockdefs.h:38
LockWaitBlock
@ LockWaitBlock
Definition lockoptions.h:40
LockTupleKeyShare
@ LockTupleKeyShare
Definition lockoptions.h:53
get_op_opfamily_properties
void get_op_opfamily_properties(Oid opno, Oid opfamily, bool ordering_op, int *strategy, Oid *lefttype, Oid *righttype)
Definition lsyscache.c:140
getTypeOutputInfo
void getTypeOutputInfo(Oid type, Oid *typOutput, bool *typIsVarlena)
Definition lsyscache.c:3129
get_typlenbyvalalign
void get_typlenbyvalalign(Oid typid, int16 *typlen, bool *typbyval, char *typalign)
Definition lsyscache.c:2491
get_rel_relkind
char get_rel_relkind(Oid relid)
Definition lsyscache.c:2223
get_opcode
RegProcedure get_opcode(Oid opno)
Definition lsyscache.c:1505
get_index_column_opclass
Oid get_index_column_opclass(Oid index_oid, int attno)
Definition lsyscache.c:3759
get_namespace_name
char * get_namespace_name(Oid nspid)
Definition lsyscache.c:3588
op_input_types
void op_input_types(Oid opno, Oid *lefttype, Oid *righttype)
Definition lsyscache.c:1578
MemoryContextReset
void MemoryContextReset(MemoryContext context)
Definition mcxt.c:403
TopTransactionContext
MemoryContext TopTransactionContext
Definition mcxt.c:171
pfree
void pfree(void *pointer)
Definition mcxt.c:1616
TopMemoryContext
MemoryContext TopMemoryContext
Definition mcxt.c:166
CurrentMemoryContext
MemoryContext CurrentMemoryContext
Definition mcxt.c:160
MemoryContextDelete
void MemoryContextDelete(MemoryContext context)
Definition mcxt.c:472
AllocSetContextCreate
#define AllocSetContextCreate
Definition memutils.h:129
ALLOCSET_SMALL_SIZES
#define ALLOCSET_SMALL_SIZES
Definition memutils.h:170
SECURITY_NOFORCE_RLS
#define SECURITY_NOFORCE_RLS
Definition miscadmin.h:332
SECURITY_LOCAL_USERID_CHANGE
#define SECURITY_LOCAL_USERID_CHANGE
Definition miscadmin.h:330
GetUserIdAndSecContext
void GetUserIdAndSecContext(Oid *userid, int *sec_context)
Definition miscinit.c:613
GetUserId
Oid GetUserId(void)
Definition miscinit.c:470
SetUserIdAndSecContext
void SetUserIdAndSecContext(Oid userid, int sec_context)
Definition miscinit.c:620
makeNode
#define makeNode(_type_)
Definition nodes.h:161
errmsg
static char * errmsg
Definition oauth_hook_client.c:61
MemoryContextSwitchTo
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition palloc.h:124
find_coercion_pathway
CoercionPathType find_coercion_pathway(Oid targetTypeId, Oid sourceTypeId, CoercionContext ccontext, Oid *funcid)
Definition parse_coerce.c:3154
IsBinaryCoercible
bool IsBinaryCoercible(Oid srctype, Oid targettype)
Definition parse_coerce.c:3031
parse_coerce.h
CoercionPathType
CoercionPathType
Definition parse_coerce.h:25
COERCION_PATH_FUNC
@ COERCION_PATH_FUNC
Definition parse_coerce.h:27
COERCION_PATH_RELABELTYPE
@ COERCION_PATH_RELABELTYPE
Definition parse_coerce.h:28
parse_relation.h
ACL_USAGE
#define ACL_USAGE
Definition parsenodes.h:84
FKCONSTR_MATCH_SIMPLE
#define FKCONSTR_MATCH_SIMPLE
Definition parsenodes.h:2937
RTE_RELATION
@ RTE_RELATION
Definition parsenodes.h:1122
FKCONSTR_MATCH_PARTIAL
#define FKCONSTR_MATCH_PARTIAL
Definition parsenodes.h:2936
OBJECT_SCHEMA
@ OBJECT_SCHEMA
Definition parsenodes.h:2468
OBJECT_TABLE
@ OBJECT_TABLE
Definition parsenodes.h:2473
ACL_SELECT
#define ACL_SELECT
Definition parsenodes.h:77
FKCONSTR_MATCH_FULL
#define FKCONSTR_MATCH_FULL
Definition parsenodes.h:2935
attname
NameData attname
Definition pg_attribute.h:43
Form_pg_attribute
FormData_pg_attribute * Form_pg_attribute
Definition pg_attribute.h:206
pg_collation.h
Form_pg_collation
END_CATALOG_STRUCT typedef FormData_pg_collation * Form_pg_collation
Definition pg_collation.h:62
INDEX_MAX_KEYS
#define INDEX_MAX_KEYS
Definition pg_config_manual.h:79
FindFKPeriodOpers
void FindFKPeriodOpers(Oid opclass, Oid *containedbyoperoid, Oid *aggedcontainedbyoperoid, Oid *intersectoperoid)
Definition pg_constraint.c:1668
DeconstructFkConstraintRow
void DeconstructFkConstraintRow(HeapTuple tuple, int *numfks, AttrNumber *conkey, AttrNumber *confkey, Oid *pf_eq_oprs, Oid *pp_eq_oprs, Oid *ff_eq_oprs, int *num_fk_del_set_cols, AttrNumber *fk_del_set_cols)
Definition pg_constraint.c:1538
pg_constraint.h
Form_pg_constraint
END_CATALOG_STRUCT typedef FormData_pg_constraint * Form_pg_constraint
Definition pg_constraint.h:179
list_length
static int list_length(const List *l)
Definition pg_list.h:152
NIL
#define NIL
Definition pg_list.h:68
pg_namespace.h
plan
#define plan(x)
Definition pg_regress.c:164
buf
static char buf[DEFAULT_XLOG_SEG_SIZE]
Definition pg_test_fsync.c:71
ERRCODE_T_R_SERIALIZATION_FAILURE
#define ERRCODE_T_R_SERIALIZATION_FAILURE
Definition pgbench.c:77
sprintf
#define sprintf
Definition port.h:262
snprintf
#define snprintf
Definition port.h:260
DatumGetBool
static bool DatumGetBool(Datum X)
Definition postgres.h:100
PointerGetDatum
static Datum PointerGetDatum(const void *X)
Definition postgres.h:342
BoolGetDatum
static Datum BoolGetDatum(bool X)
Definition postgres.h:112
ObjectIdGetDatum
static Datum ObjectIdGetDatum(Oid X)
Definition postgres.h:252
Datum
uint64_t Datum
Definition postgres.h:70
Int32GetDatum
static Datum Int32GetDatum(int32 X)
Definition postgres.h:212
InvalidOid
#define InvalidOid
Definition postgres_ext.h:37
Oid
unsigned int Oid
Definition postgres_ext.h:32
fb
static int fb(int x)
Definition preproc-init.c:92
COERCION_IMPLICIT
@ COERCION_IMPLICIT
Definition primnodes.h:747
ctl
tree ctl
Definition radixtree.h:1838
RelationGetForm
#define RelationGetForm(relation)
Definition rel.h:510
RelationGetRelid
#define RelationGetRelid(relation)
Definition rel.h:516
RelationGetDescr
#define RelationGetDescr(relation)
Definition rel.h:542
RelationGetRelationName
#define RelationGetRelationName(relation)
Definition rel.h:550
RelationGetNamespace
#define RelationGetNamespace(relation)
Definition rel.h:557
errtableconstraint
int errtableconstraint(Relation rel, const char *conname)
Definition relcache.c:6117
ri_FastPathEndBatch
static void ri_FastPathEndBatch(void *arg)
Definition ri_triggers.c:4109
recheck_matched_pk_tuple
static bool recheck_matched_pk_tuple(Relation idxrel, ScanKeyData *skeys, int nkeys, TupleTableSlot *new_slot)
Definition ri_triggers.c:3343
ri_set
static Datum ri_set(TriggerData *trigdata, bool is_set_null, int tgkind)
Definition ri_triggers.c:1325
ri_PerformCheck
static bool ri_PerformCheck(const RI_ConstraintInfo *riinfo, RI_QueryKey *qkey, SPIPlanPtr qplan, Relation fk_rel, Relation pk_rel, TupleTableSlot *oldslot, TupleTableSlot *newslot, bool is_restrict, bool detectNewRows, int expect_OK)
Definition ri_triggers.c:2627
RI_TRIGTYPE_INSERT
#define RI_TRIGTYPE_INSERT
Definition ri_triggers.c:96
ri_LoadConstraintInfo
static const RI_ConstraintInfo * ri_LoadConstraintInfo(Oid constraintOid)
Definition ri_triggers.c:2398
RI_FKey_check
static Datum RI_FKey_check(TriggerData *trigdata)
Definition ri_triggers.c:357
ri_fastpath_xact_callback_registered
static bool ri_fastpath_xact_callback_registered
Definition ri_triggers.c:4169
RI_PLAN_SETNULL_ONUPDATE
#define RI_PLAN_SETNULL_ONUPDATE
Definition ri_triggers.c:85
RI_PLAN_CASCADE_ONUPDATE
#define RI_PLAN_CASCADE_ONUPDATE
Definition ri_triggers.c:80
RI_TRIGTYPE_DELETE
#define RI_TRIGTYPE_DELETE
Definition ri_triggers.c:98
ri_FastPathSubXactCallback
static void ri_FastPathSubXactCallback(SubXactEvent event, SubTransactionId mySubid, SubTransactionId parentSubid, void *arg)
Definition ri_triggers.c:4184
RI_FKey_setnull_del
Datum RI_FKey_setnull_del(PG_FUNCTION_ARGS)
Definition ri_triggers.c:1264
ri_FastPathBatchFlush
static void ri_FastPathBatchFlush(RI_FastPathEntry *fpentry, Relation fk_rel, const RI_ConstraintInfo *riinfo)
Definition ri_triggers.c:2885
ri_fastpath_callback_registered
static bool ri_fastpath_callback_registered
Definition ri_triggers.c:262
ri_ReportViolation
static pg_noreturn void ri_ReportViolation(const RI_ConstraintInfo *riinfo, Relation pk_rel, Relation fk_rel, TupleTableSlot *violatorslot, TupleDesc tupdesc, int queryno, bool is_restrict, bool partgone)
Definition ri_triggers.c:3506
ri_HashPreparedPlan
static void ri_HashPreparedPlan(RI_QueryKey *key, SPIPlanPtr plan)
Definition ri_triggers.c:3803
quoteOneName
static void quoteOneName(char *buffer, const char *name)
Definition ri_triggers.c:2161
RI_FKey_pk_upd_check_required
bool RI_FKey_pk_upd_check_required(Trigger *trigger, Relation pk_rel, TupleTableSlot *oldslot, TupleTableSlot *newslot)
Definition ri_triggers.c:1516
RI_PLAN_LAST_ON_PK
#define RI_PLAN_LAST_ON_PK
Definition ri_triggers.c:77
RIAttType
#define RIAttType(rel, attnum)
Definition ri_triggers.c:93
ri_GenerateQualCollation
static void ri_GenerateQualCollation(StringInfo buf, Oid collation)
Definition ri_triggers.c:2225
RI_FKey_cascade_del
Datum RI_FKey_cascade_del(PG_FUNCTION_ARGS)
Definition ri_triggers.c:1045
RI_KEYS_SOME_NULL
#define RI_KEYS_SOME_NULL
Definition ri_triggers.c:70
RI_FKey_check_upd
Datum RI_FKey_check_upd(PG_FUNCTION_ARGS)
Definition ri_triggers.c:620
ri_query_cache
static HTAB * ri_query_cache
Definition ri_triggers.c:257
MAX_QUOTED_REL_NAME_LEN
#define MAX_QUOTED_REL_NAME_LEN
Definition ri_triggers.c:90
RI_FKey_restrict_upd
Datum RI_FKey_restrict_upd(PG_FUNCTION_ARGS)
Definition ri_triggers.c:826
ri_FastPathFlushLoop
static int ri_FastPathFlushLoop(RI_FastPathEntry *fpentry, TupleTableSlot *fk_slot, const RI_ConstraintInfo *riinfo, Relation fk_rel, Snapshot snapshot, IndexScanDesc scandesc)
Definition ri_triggers.c:2987
ri_FastPathXactCallback
static void ri_FastPathXactCallback(XactEvent event, void *arg)
Definition ri_triggers.c:4172
ri_restrict
static Datum ri_restrict(TriggerData *trigdata, bool is_no_action)
Definition ri_triggers.c:842
RI_FKey_restrict_del
Datum RI_FKey_restrict_del(PG_FUNCTION_ARGS)
Definition ri_triggers.c:789
RI_PLAN_RESTRICT
#define RI_PLAN_RESTRICT
Definition ri_triggers.c:83
RI_FKey_noaction_del
Datum RI_FKey_noaction_del(PG_FUNCTION_ARGS)
Definition ri_triggers.c:769
quoteRelationName
static void quoteRelationName(char *buffer, Relation rel)
Definition ri_triggers.c:2181
ri_NullCheck
static int ri_NullCheck(TupleDesc tupDesc, TupleTableSlot *slot, const RI_ConstraintInfo *riinfo, bool rel_is_pk)
Definition ri_triggers.c:3678
ri_GenerateQual
static void ri_GenerateQual(StringInfo buf, const char *sep, const char *leftop, Oid leftoptype, Oid opoid, const char *rightop, Oid rightoptype)
Definition ri_triggers.c:2198
build_index_scankeys
static void build_index_scankeys(const RI_ConstraintInfo *riinfo, Relation idx_rel, Datum *pk_vals, char *pk_nulls, ScanKey skeys)
Definition ri_triggers.c:3393
ri_LockPKTuple
static bool ri_LockPKTuple(Relation pk_rel, TupleTableSlot *slot, Snapshot snap, bool *concurrently_updated)
Definition ri_triggers.c:3217
ri_KeysEqual
static bool ri_KeysEqual(Relation rel, TupleTableSlot *oldslot, TupleTableSlot *newslot, const RI_ConstraintInfo *riinfo, bool rel_is_pk)
Definition ri_triggers.c:3840
ri_fastpath_cache
static HTAB * ri_fastpath_cache
Definition ri_triggers.c:261
ri_HashCompareOp
static RI_CompareHashEntry * ri_HashCompareOp(Oid eq_opr, Oid typeid)
Definition ri_triggers.c:3975
RI_PLAN_CHECK_LOOKUPPK_FROM_PK
#define RI_PLAN_CHECK_LOOKUPPK_FROM_PK
Definition ri_triggers.c:76
RIAttCollation
#define RIAttCollation(rel, attnum)
Definition ri_triggers.c:94
ri_constraint_cache_valid_list
static dclist_head ri_constraint_cache_valid_list
Definition ri_triggers.c:259
get_ri_constraint_root
static Oid get_ri_constraint_root(Oid constrOid)
Definition ri_triggers.c:2503
RI_FKey_check_ins
Datum RI_FKey_check_ins(PG_FUNCTION_ARGS)
Definition ri_triggers.c:604
RI_KEYS_ALL_NULL
#define RI_KEYS_ALL_NULL
Definition ri_triggers.c:69
ri_compare_cache
static HTAB * ri_compare_cache
Definition ri_triggers.c:258
ri_populate_fastpath_metadata
static void ri_populate_fastpath_metadata(RI_ConstraintInfo *riinfo, Relation fk_rel, Relation idx_rel)
Definition ri_triggers.c:3439
RI_KEYS_NONE_NULL
#define RI_KEYS_NONE_NULL
Definition ri_triggers.c:71
RI_FASTPATH_BATCH_SIZE
#define RI_FASTPATH_BATCH_SIZE
Definition ri_triggers.c:213
RI_INIT_QUERYHASHSIZE
#define RI_INIT_QUERYHASHSIZE
Definition ri_triggers.c:67
ri_FetchConstraintInfo
static const RI_ConstraintInfo * ri_FetchConstraintInfo(Trigger *trigger, Relation trig_rel, bool rel_is_pk)
Definition ri_triggers.c:2344
ri_FastPathProbeOne
static bool ri_FastPathProbeOne(Relation pk_rel, Relation idx_rel, IndexScanDesc scandesc, TupleTableSlot *slot, Snapshot snapshot, const RI_ConstraintInfo *riinfo, ScanKeyData *skey, int nkeys)
Definition ri_triggers.c:3179
ri_FastPathBatchAdd
static void ri_FastPathBatchAdd(const RI_ConstraintInfo *riinfo, Relation fk_rel, TupleTableSlot *newslot)
Definition ri_triggers.c:2859
ri_BuildQueryKey
static void ri_BuildQueryKey(RI_QueryKey *key, const RI_ConstraintInfo *riinfo, int32 constr_queryno)
Definition ri_triggers.c:2266
ri_FastPathCheck
static void ri_FastPathCheck(const RI_ConstraintInfo *riinfo, Relation fk_rel, TupleTableSlot *newslot)
Definition ri_triggers.c:2779
RI_PLAN_CASCADE_ONDELETE
#define RI_PLAN_CASCADE_ONDELETE
Definition ri_triggers.c:79
RI_FKey_setnull_upd
Datum RI_FKey_setnull_upd(PG_FUNCTION_ARGS)
Definition ri_triggers.c:1279
RI_PLAN_SETDEFAULT_ONDELETE
#define RI_PLAN_SETDEFAULT_ONDELETE
Definition ri_triggers.c:86
RI_FKey_setdefault_del
Datum RI_FKey_setdefault_del(PG_FUNCTION_ARGS)
Definition ri_triggers.c:1294
RI_PLAN_SETDEFAULT_ONUPDATE
#define RI_PLAN_SETDEFAULT_ONUPDATE
Definition ri_triggers.c:87
RI_PLAN_CHECK_LOOKUPPK
#define RI_PLAN_CHECK_LOOKUPPK
Definition ri_triggers.c:75
ri_CompareWithCast
static bool ri_CompareWithCast(Oid eq_opr, Oid typeid, Oid collid, Datum lhs, Datum rhs)
Definition ri_triggers.c:3926
ri_FastPathFlushArray
static int ri_FastPathFlushArray(RI_FastPathEntry *fpentry, TupleTableSlot *fk_slot, const RI_ConstraintInfo *riinfo, Relation fk_rel, Snapshot snapshot, IndexScanDesc scandesc)
Definition ri_triggers.c:3031
RI_PLAN_SETNULL_ONDELETE
#define RI_PLAN_SETNULL_ONDELETE
Definition ri_triggers.c:84
RI_INIT_CONSTRAINTHASHSIZE
#define RI_INIT_CONSTRAINTHASHSIZE
Definition ri_triggers.c:66
ri_CheckPermissions
static void ri_CheckPermissions(Relation query_rel)
Definition ri_triggers.c:3312
RI_Initial_Check
bool RI_Initial_Check(Trigger *trigger, Relation fk_rel, Relation pk_rel)
Definition ri_triggers.c:1649
ri_FastPathGetEntry
static RI_FastPathEntry * ri_FastPathGetEntry(const RI_ConstraintInfo *riinfo, Relation fk_rel)
Definition ri_triggers.c:4210
ri_Check_Pk_Match
static bool ri_Check_Pk_Match(Relation pk_rel, Relation fk_rel, TupleTableSlot *oldslot, const RI_ConstraintInfo *riinfo)
Definition ri_triggers.c:641
RI_PartitionRemove_Check
void RI_PartitionRemove_Check(Trigger *trigger, Relation fk_rel, Relation pk_rel)
Definition ri_triggers.c:1943
ri_FastPathTeardown
static void ri_FastPathTeardown(void)
Definition ri_triggers.c:4141
ri_PlanCheck
static SPIPlanPtr ri_PlanCheck(const char *querystr, int nargs, Oid *argtypes, RI_QueryKey *qkey, Relation fk_rel, Relation pk_rel)
Definition ri_triggers.c:2584
MAX_QUOTED_NAME_LEN
#define MAX_QUOTED_NAME_LEN
Definition ri_triggers.c:89
ri_CheckTrigger
static void ri_CheckTrigger(FunctionCallInfo fcinfo, const char *funcname, int tgkind)
Definition ri_triggers.c:2298
ri_fastpath_is_applicable
static bool ri_fastpath_is_applicable(const RI_ConstraintInfo *riinfo)
Definition ri_triggers.c:3285
RI_TRIGTYPE_UPDATE
#define RI_TRIGTYPE_UPDATE
Definition ri_triggers.c:97
RI_FKey_fk_upd_check_required
bool RI_FKey_fk_upd_check_required(Trigger *trigger, Relation fk_rel, TupleTableSlot *oldslot, TupleTableSlot *newslot)
Definition ri_triggers.c:1548
RI_FKey_trigger_type
int RI_FKey_trigger_type(Oid tgfoid)
Definition ri_triggers.c:4074
RI_FKey_cascade_upd
Datum RI_FKey_cascade_upd(PG_FUNCTION_ARGS)
Definition ri_triggers.c:1147
RI_FKey_noaction_upd
Datum RI_FKey_noaction_upd(PG_FUNCTION_ARGS)
Definition ri_triggers.c:806
ri_InitHashTables
static void ri_InitHashTables(void)
Definition ri_triggers.c:3715
InvalidateConstraintCacheCallBack
static void InvalidateConstraintCacheCallBack(Datum arg, SysCacheIdentifier cacheid, uint32 hashvalue)
Definition ri_triggers.c:2537
ri_ExtractValues
static void ri_ExtractValues(Relation rel, TupleTableSlot *slot, const RI_ConstraintInfo *riinfo, bool rel_is_pk, Datum *vals, char *nulls)
Definition ri_triggers.c:3477
RIAttName
#define RIAttName(rel, attnum)
Definition ri_triggers.c:92
RI_MAX_NUMKEYS
#define RI_MAX_NUMKEYS
Definition ri_triggers.c:64
ri_constraint_cache
static HTAB * ri_constraint_cache
Definition ri_triggers.c:256
ri_FetchPreparedPlan
static SPIPlanPtr ri_FetchPreparedPlan(RI_QueryKey *key)
Definition ri_triggers.c:3751
RI_FKey_setdefault_upd
Datum RI_FKey_setdefault_upd(PG_FUNCTION_ARGS)
Definition ri_triggers.c:1309
RI_PLAN_NO_ACTION
#define RI_PLAN_NO_ACTION
Definition ri_triggers.c:81
check_enable_rls
int check_enable_rls(Oid relid, Oid checkAsUser, bool noError)
Definition rls.c:52
RLS_ENABLED
@ RLS_ENABLED
Definition rls.h:45
pg_get_partconstrdef_string
char * pg_get_partconstrdef_string(Oid partitionId, char *aliasname)
Definition ruleutils.c:2486
generate_operator_clause
void generate_operator_clause(StringInfo buf, const char *leftop, Oid leftoptype, Oid opoid, const char *rightop, Oid rightoptype)
Definition ruleutils.c:14095
ScanKeyEntryInitialize
void ScanKeyEntryInitialize(ScanKey entry, int flags, AttrNumber attributeNumber, StrategyNumber strategy, Oid subtype, Oid collation, RegProcedure procedure, Datum argument)
Definition scankey.c:32
ForwardScanDirection
@ ForwardScanDirection
Definition sdir.h:28
SK_SEARCHARRAY
#define SK_SEARCHARRAY
Definition skey.h:120
GetTransactionSnapshot
Snapshot GetTransactionSnapshot(void)
Definition snapmgr.c:272
GetLatestSnapshot
Snapshot GetLatestSnapshot(void)
Definition snapmgr.c:354
UnregisterSnapshot
void UnregisterSnapshot(Snapshot snapshot)
Definition snapmgr.c:866
RegisterSnapshot
Snapshot RegisterSnapshot(Snapshot snapshot)
Definition snapmgr.c:824
SnapshotSelf
#define SnapshotSelf
Definition snapmgr.h:32
InvalidSnapshot
#define InvalidSnapshot
Definition snapshot.h:119
SPI_plan_is_valid
bool SPI_plan_is_valid(SPIPlanPtr plan)
Definition spi.c:1949
SPI_processed
uint64 SPI_processed
Definition spi.c:45
SPI_freeplan
int SPI_freeplan(SPIPlanPtr plan)
Definition spi.c:1026
SPI_result_code_string
const char * SPI_result_code_string(int code)
Definition spi.c:1973
SPI_tuptable
SPITupleTable * SPI_tuptable
Definition spi.c:46
SPI_connect
int SPI_connect(void)
Definition spi.c:95
SPI_result
int SPI_result
Definition spi.c:47
SPI_finish
int SPI_finish(void)
Definition spi.c:183
SPI_execute_snapshot
int SPI_execute_snapshot(SPIPlanPtr plan, const Datum *Values, const char *Nulls, Snapshot snapshot, Snapshot crosscheck_snapshot, bool read_only, bool fire_triggers, long tcount)
Definition spi.c:774
SPI_prepare
SPIPlanPtr SPI_prepare(const char *src, int nargs, Oid *argtypes)
Definition spi.c:861
SPI_keepplan
int SPI_keepplan(SPIPlanPtr plan)
Definition spi.c:977
SPI_OK_UPDATE
#define SPI_OK_UPDATE
Definition spi.h:90
SPI_OK_DELETE
#define SPI_OK_DELETE
Definition spi.h:89
SPI_OK_FINISH
#define SPI_OK_FINISH
Definition spi.h:83
SPI_OK_SELECT
#define SPI_OK_SELECT
Definition spi.h:86
appendStringInfo
void appendStringInfo(StringInfo str, const char *fmt,...)
Definition stringinfo.c:145
appendBinaryStringInfo
void appendBinaryStringInfo(StringInfo str, const void *data, int datalen)
Definition stringinfo.c:281
appendStringInfoString
void appendStringInfoString(StringInfo str, const char *s)
Definition stringinfo.c:230
appendStringInfoChar
void appendStringInfoChar(StringInfo str, char ch)
Definition stringinfo.c:242
initStringInfo
void initStringInfo(StringInfo str)
Definition stringinfo.c:97
FastPathMeta::eq_opr_finfo
FmgrInfo eq_opr_finfo[RI_MAX_NUMKEYS]
Definition ri_triggers.c:154
FastPathMeta::regops
RegProcedure regops[RI_MAX_NUMKEYS]
Definition ri_triggers.c:156
FastPathMeta::strats
int strats[RI_MAX_NUMKEYS]
Definition ri_triggers.c:158
FastPathMeta::subtypes
Oid subtypes[RI_MAX_NUMKEYS]
Definition ri_triggers.c:157
FastPathMeta::cast_func_finfo
FmgrInfo cast_func_finfo[RI_MAX_NUMKEYS]
Definition ri_triggers.c:155
FmgrInfo::fn_oid
Oid fn_oid
Definition fmgr.h:59
HASHCTL::keysize
Size keysize
Definition hsearch.h:69
HASH_SEQ_STATUS
Definition hsearch.h:116
IndexAmRoutine::amsearcharray
bool amsearcharray
Definition amapi.h:264
IndexInfo::ii_ExclusionOps
Oid * ii_ExclusionOps
Definition execnodes.h:202
IndexInfo::ii_NumIndexKeyAttrs
int ii_NumIndexKeyAttrs
Definition execnodes.h:183
IndexInfo::ii_Expressions
List * ii_Expressions
Definition execnodes.h:192
List
Definition pg_list.h:54
RI_CompareHashEntry
Definition ri_triggers.c:196
RI_CompareHashEntry::key
RI_CompareKey key
Definition ri_triggers.c:197
RI_CompareHashEntry::valid
bool valid
Definition ri_triggers.c:198
RI_CompareHashEntry::cast_func_finfo
FmgrInfo cast_func_finfo
Definition ri_triggers.c:200
RI_CompareHashEntry::eq_opr_finfo
FmgrInfo eq_opr_finfo
Definition ri_triggers.c:199
RI_CompareKey
Definition ri_triggers.c:187
RI_CompareKey::eq_opr
Oid eq_opr
Definition ri_triggers.c:188
RI_ConstraintInfo
Definition ri_triggers.c:112
RI_ConstraintInfo::valid_link
dlist_node valid_link
Definition ri_triggers.c:141
RI_ConstraintInfo::fk_relid
Oid fk_relid
Definition ri_triggers.c:121
RI_ConstraintInfo::pk_attnums
int16 pk_attnums[RI_MAX_NUMKEYS]
Definition ri_triggers.c:131
RI_ConstraintInfo::confmatchtype
char confmatchtype
Definition ri_triggers.c:128
RI_ConstraintInfo::agged_period_contained_by_oper
Oid agged_period_contained_by_oper
Definition ri_triggers.c:138
RI_ConstraintInfo::pk_is_partitioned
bool pk_is_partitioned
Definition ri_triggers.c:144
RI_ConstraintInfo::valid
bool valid
Definition ri_triggers.c:114
RI_ConstraintInfo::conname
NameData conname
Definition ri_triggers.c:119
RI_ConstraintInfo::rootHashValue
uint32 rootHashValue
Definition ri_triggers.c:118
RI_ConstraintInfo::fk_attnums
int16 fk_attnums[RI_MAX_NUMKEYS]
Definition ri_triggers.c:132
RI_ConstraintInfo::pp_eq_oprs
Oid pp_eq_oprs[RI_MAX_NUMKEYS]
Definition ri_triggers.c:134
RI_ConstraintInfo::constraint_root_id
Oid constraint_root_id
Definition ri_triggers.c:115
RI_ConstraintInfo::pk_relid
Oid pk_relid
Definition ri_triggers.c:120
RI_ConstraintInfo::conindid
Oid conindid
Definition ri_triggers.c:143
RI_ConstraintInfo::confdeltype
char confdeltype
Definition ri_triggers.c:123
RI_ConstraintInfo::pf_eq_oprs
Oid pf_eq_oprs[RI_MAX_NUMKEYS]
Definition ri_triggers.c:133
RI_ConstraintInfo::ndelsetcols
int ndelsetcols
Definition ri_triggers.c:124
RI_ConstraintInfo::oidHashValue
uint32 oidHashValue
Definition ri_triggers.c:117
RI_ConstraintInfo::period_contained_by_oper
Oid period_contained_by_oper
Definition ri_triggers.c:136
RI_ConstraintInfo::confdelsetcols
int16 confdelsetcols[RI_MAX_NUMKEYS]
Definition ri_triggers.c:126
RI_ConstraintInfo::confupdtype
char confupdtype
Definition ri_triggers.c:122
RI_ConstraintInfo::constraint_id
Oid constraint_id
Definition ri_triggers.c:113
RI_ConstraintInfo::period_intersect_oper
Oid period_intersect_oper
Definition ri_triggers.c:139
RI_ConstraintInfo::ff_eq_oprs
Oid ff_eq_oprs[RI_MAX_NUMKEYS]
Definition ri_triggers.c:135
RI_ConstraintInfo::nkeys
int nkeys
Definition ri_triggers.c:130
RI_ConstraintInfo::fpmeta
FastPathMeta * fpmeta
Definition ri_triggers.c:146
RI_ConstraintInfo::hasperiod
bool hasperiod
Definition ri_triggers.c:129
RI_FastPathEntry
Definition ri_triggers.c:234
RI_FastPathEntry::fk_slot
TupleTableSlot * fk_slot
Definition ri_triggers.c:240
RI_FastPathEntry::conoid
Oid conoid
Definition ri_triggers.c:235
RI_FastPathEntry::pk_slot
TupleTableSlot * pk_slot
Definition ri_triggers.c:239
RI_FastPathEntry::flush_cxt
MemoryContext flush_cxt
Definition ri_triggers.c:241
RI_FastPathEntry::batch_count
int batch_count
Definition ri_triggers.c:250
RI_FastPathEntry::fk_relid
Oid fk_relid
Definition ri_triggers.c:236
RI_FastPathEntry::pk_rel
Relation pk_rel
Definition ri_triggers.c:237
RI_FastPathEntry::idx_rel
Relation idx_rel
Definition ri_triggers.c:238
RI_FastPathEntry::batch
HeapTuple batch[RI_FASTPATH_BATCH_SIZE]
Definition ri_triggers.c:249
RI_QueryHashEntry
Definition ri_triggers.c:176
RI_QueryHashEntry::plan
SPIPlanPtr plan
Definition ri_triggers.c:178
RI_QueryHashEntry::key
RI_QueryKey key
Definition ri_triggers.c:177
RI_QueryKey
Definition ri_triggers.c:167
RI_QueryKey::constr_queryno
int32 constr_queryno
Definition ri_triggers.c:169
RI_QueryKey::constr_id
Oid constr_id
Definition ri_triggers.c:168
RelationData::rd_indam
const struct IndexAmRoutine * rd_indam
Definition rel.h:206
RelationData::rd_att
TupleDesc rd_att
Definition rel.h:112
RelationData::rd_id
Oid rd_id
Definition rel.h:113
RelationData::rd_opfamily
Oid * rd_opfamily
Definition rel.h:207
RelationData::rd_indcollation
Oid * rd_indcollation
Definition rel.h:217
RelationData::rd_rel
Form_pg_class rd_rel
Definition rel.h:111
SPITupleTable::tupdesc
TupleDesc tupdesc
Definition spi.h:25
SPITupleTable::vals
HeapTuple * vals
Definition spi.h:26
TM_FailureData
Definition tableam.h:170
TM_FailureData::traversed
bool traversed
Definition tableam.h:174
TriggerData::tg_relation
Relation tg_relation
Definition trigger.h:35
TriggerData::tg_event
TriggerEvent tg_event
Definition trigger.h:34
TriggerData::tg_trigslot
TupleTableSlot * tg_trigslot
Definition trigger.h:39
TriggerData::tg_newslot
TupleTableSlot * tg_newslot
Definition trigger.h:40
TriggerData::tg_trigger
Trigger * tg_trigger
Definition trigger.h:38
TupleTableSlot::tts_isnull
bool * tts_isnull
Definition tuptable.h:133
TupleTableSlot::tts_tid
ItemPointerData tts_tid
Definition tuptable.h:142
TupleTableSlot::tts_values
Datum * tts_values
Definition tuptable.h:131
_SPI_plan
Definition spi_priv.h:91
dclist_head
Definition ilist.h:213
dlist_mutable_iter
Definition ilist.h:199
dlist_mutable_iter::cur
dlist_node * cur
Definition ilist.h:200
dlist_node
Definition ilist.h:138
nameData
Definition c.h:830
FirstLowInvalidHeapAttributeNumber
#define FirstLowInvalidHeapAttributeNumber
Definition sysattr.h:27
ReleaseSysCache
void ReleaseSysCache(HeapTuple tuple)
Definition syscache.c:265
SearchSysCache1
HeapTuple SearchSysCache1(SysCacheIdentifier cacheId, Datum key1)
Definition syscache.c:221
GetSysCacheHashValue1
#define GetSysCacheHashValue1(cacheId, key1)
Definition syscache.h:118
table_close
void table_close(Relation relation, LOCKMODE lockmode)
Definition table.c:126
table_open
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition table.c:40
table_slot_create
TupleTableSlot * table_slot_create(Relation relation, List **reglist)
Definition tableam.c:92
SO_NONE
@ SO_NONE
Definition tableam.h:49
TM_Result
TM_Result
Definition tableam.h:95
TM_Ok
@ TM_Ok
Definition tableam.h:100
TM_Deleted
@ TM_Deleted
Definition tableam.h:115
TM_Updated
@ TM_Updated
Definition tableam.h:112
TM_SelfModified
@ TM_SelfModified
Definition tableam.h:106
TM_Invisible
@ TM_Invisible
Definition tableam.h:103
table_tuple_lock
static TM_Result table_tuple_lock(Relation rel, ItemPointer tid, Snapshot snapshot, TupleTableSlot *slot, CommandId cid, LockTupleMode mode, LockWaitPolicy wait_policy, uint8 flags, TM_FailureData *tmfd)
Definition tableam.h:1648
TUPLE_LOCK_FLAG_FIND_LAST_VERSION
#define TUPLE_LOCK_FLAG_FIND_LAST_VERSION
Definition tableam.h:299
table_tuple_satisfies_snapshot
static bool table_tuple_satisfies_snapshot(Relation rel, TupleTableSlot *slot, Snapshot snapshot)
Definition tableam.h:1391
TUPLE_LOCK_FLAG_LOCK_UPDATE_IN_PROGRESS
#define TUPLE_LOCK_FLAG_LOCK_UPDATE_IN_PROGRESS
Definition tableam.h:297
RegisterAfterTriggerBatchCallback
void RegisterAfterTriggerBatchCallback(AfterTriggerBatchCallback callback, void *arg)
Definition trigger.c:6816
AfterTriggerIsActive
bool AfterTriggerIsActive(void)
Definition trigger.c:6877
RI_TRIGGER_FK
#define RI_TRIGGER_FK
Definition trigger.h:287
TRIGGER_FIRED_BY_DELETE
#define TRIGGER_FIRED_BY_DELETE(event)
Definition trigger.h:115
CALLED_AS_TRIGGER
#define CALLED_AS_TRIGGER(fcinfo)
Definition trigger.h:26
TRIGGER_FIRED_FOR_ROW
#define TRIGGER_FIRED_FOR_ROW(event)
Definition trigger.h:124
RI_TRIGGER_NONE
#define RI_TRIGGER_NONE
Definition trigger.h:288
TRIGGER_FIRED_AFTER
#define TRIGGER_FIRED_AFTER(event)
Definition trigger.h:133
TRIGGER_FIRED_BY_INSERT
#define TRIGGER_FIRED_BY_INSERT(event)
Definition trigger.h:112
TRIGGER_FIRED_BY_UPDATE
#define TRIGGER_FIRED_BY_UPDATE(event)
Definition trigger.h:118
RI_TRIGGER_PK
#define RI_TRIGGER_PK
Definition trigger.h:286
TupleDescAttr
static FormData_pg_attribute * TupleDescAttr(TupleDesc tupdesc, int i)
Definition tupdesc.h:178
TupleDescCompactAttr
static CompactAttribute * TupleDescCompactAttr(TupleDesc tupdesc, int i)
Definition tupdesc.h:195
ExecCopySlotHeapTuple
static HeapTuple ExecCopySlotHeapTuple(TupleTableSlot *slot)
Definition tuptable.h:503
slot_getattr
static Datum slot_getattr(TupleTableSlot *slot, int attnum, bool *isnull)
Definition tuptable.h:417
slot_is_current_xact_tuple
static bool slot_is_current_xact_tuple(TupleTableSlot *slot)
Definition tuptable.h:467
slot_attisnull
static bool slot_attisnull(TupleTableSlot *slot, int attnum)
Definition tuptable.h:403
name
const char * name
Definition wait_event_funcs.c:29
CommandCounterIncrement
void CommandCounterIncrement(void)
Definition xact.c:1130
RegisterXactCallback
void RegisterXactCallback(XactCallback callback, void *arg)
Definition xact.c:3855
RegisterSubXactCallback
void RegisterSubXactCallback(SubXactCallback callback, void *arg)
Definition xact.c:3915
GetCurrentCommandId
CommandId GetCurrentCommandId(bool used)
Definition xact.c:831
SubXactEvent
SubXactEvent
Definition xact.h:142
SUBXACT_EVENT_ABORT_SUB
@ SUBXACT_EVENT_ABORT_SUB
Definition xact.h:145
XactEvent
XactEvent
Definition xact.h:128
IsolationUsesXactSnapshot
#define IsolationUsesXactSnapshot()
Definition xact.h:52