Move routines to manipulate WAL into PostgreSQL::Test::Cluster
[pgsql.git] / src / backend / commands / matview.c
blobc12817091edc1b2d4c85004c9702388948bba6bb
1 /*-------------------------------------------------------------------------
3 * matview.c
4 * materialized view support
6 * Portions Copyright (c) 1996-2025, PostgreSQL Global Development Group
7 * Portions Copyright (c) 1994, Regents of the University of California
10 * IDENTIFICATION
11 * src/backend/commands/matview.c
13 *-------------------------------------------------------------------------
15 #include "postgres.h"
17 #include "access/genam.h"
18 #include "access/heapam.h"
19 #include "access/htup_details.h"
20 #include "access/multixact.h"
21 #include "access/tableam.h"
22 #include "access/xact.h"
23 #include "catalog/indexing.h"
24 #include "catalog/namespace.h"
25 #include "catalog/pg_am.h"
26 #include "catalog/pg_opclass.h"
27 #include "commands/cluster.h"
28 #include "commands/matview.h"
29 #include "commands/tablecmds.h"
30 #include "commands/tablespace.h"
31 #include "executor/executor.h"
32 #include "executor/spi.h"
33 #include "miscadmin.h"
34 #include "pgstat.h"
35 #include "rewrite/rewriteHandler.h"
36 #include "storage/lmgr.h"
37 #include "tcop/tcopprot.h"
38 #include "utils/builtins.h"
39 #include "utils/lsyscache.h"
40 #include "utils/rel.h"
41 #include "utils/snapmgr.h"
42 #include "utils/syscache.h"
45 typedef struct
47 DestReceiver pub; /* publicly-known function pointers */
48 Oid transientoid; /* OID of new heap into which to store */
49 /* These fields are filled by transientrel_startup: */
50 Relation transientrel; /* relation to write to */
51 CommandId output_cid; /* cmin to insert in output tuples */
52 int ti_options; /* table_tuple_insert performance options */
53 BulkInsertState bistate; /* bulk insert state */
54 } DR_transientrel;
56 static int matview_maintenance_depth = 0;
58 static void transientrel_startup(DestReceiver *self, int operation, TupleDesc typeinfo);
59 static bool transientrel_receive(TupleTableSlot *slot, DestReceiver *self);
60 static void transientrel_shutdown(DestReceiver *self);
61 static void transientrel_destroy(DestReceiver *self);
62 static uint64 refresh_matview_datafill(DestReceiver *dest, Query *query,
63 const char *queryString, bool is_create);
64 static char *make_temptable_name_n(char *tempname, int n);
65 static void refresh_by_match_merge(Oid matviewOid, Oid tempOid, Oid relowner,
66 int save_sec_context);
67 static void refresh_by_heap_swap(Oid matviewOid, Oid OIDNewHeap, char relpersistence);
68 static bool is_usable_unique_index(Relation indexRel);
69 static void OpenMatViewIncrementalMaintenance(void);
70 static void CloseMatViewIncrementalMaintenance(void);
73 * SetMatViewPopulatedState
74 * Mark a materialized view as populated, or not.
76 * NOTE: caller must be holding an appropriate lock on the relation.
78 void
79 SetMatViewPopulatedState(Relation relation, bool newstate)
81 Relation pgrel;
82 HeapTuple tuple;
84 Assert(relation->rd_rel->relkind == RELKIND_MATVIEW);
87 * Update relation's pg_class entry. Crucial side-effect: other backends
88 * (and this one too!) are sent SI message to make them rebuild relcache
89 * entries.
91 pgrel = table_open(RelationRelationId, RowExclusiveLock);
92 tuple = SearchSysCacheCopy1(RELOID,
93 ObjectIdGetDatum(RelationGetRelid(relation)));
94 if (!HeapTupleIsValid(tuple))
95 elog(ERROR, "cache lookup failed for relation %u",
96 RelationGetRelid(relation));
98 ((Form_pg_class) GETSTRUCT(tuple))->relispopulated = newstate;
100 CatalogTupleUpdate(pgrel, &tuple->t_self, tuple);
102 heap_freetuple(tuple);
103 table_close(pgrel, RowExclusiveLock);
106 * Advance command counter to make the updated pg_class row locally
107 * visible.
109 CommandCounterIncrement();
113 * ExecRefreshMatView -- execute a REFRESH MATERIALIZED VIEW command
115 * If WITH NO DATA was specified, this is effectively like a TRUNCATE;
116 * otherwise it is like a TRUNCATE followed by an INSERT using the SELECT
117 * statement associated with the materialized view. The statement node's
118 * skipData field shows whether the clause was used.
120 ObjectAddress
121 ExecRefreshMatView(RefreshMatViewStmt *stmt, const char *queryString,
122 QueryCompletion *qc)
124 Oid matviewOid;
125 LOCKMODE lockmode;
127 /* Determine strength of lock needed. */
128 lockmode = stmt->concurrent ? ExclusiveLock : AccessExclusiveLock;
131 * Get a lock until end of transaction.
133 matviewOid = RangeVarGetRelidExtended(stmt->relation,
134 lockmode, 0,
135 RangeVarCallbackMaintainsTable,
136 NULL);
138 return RefreshMatViewByOid(matviewOid, false, stmt->skipData,
139 stmt->concurrent, queryString, qc);
143 * RefreshMatViewByOid -- refresh materialized view by OID
145 * This refreshes the materialized view by creating a new table and swapping
146 * the relfilenumbers of the new table and the old materialized view, so the OID
147 * of the original materialized view is preserved. Thus we do not lose GRANT
148 * nor references to this materialized view.
150 * If skipData is true, this is effectively like a TRUNCATE; otherwise it is
151 * like a TRUNCATE followed by an INSERT using the SELECT statement associated
152 * with the materialized view.
154 * Indexes are rebuilt too, via REINDEX. Since we are effectively bulk-loading
155 * the new heap, it's better to create the indexes afterwards than to fill them
156 * incrementally while we load.
158 * The matview's "populated" state is changed based on whether the contents
159 * reflect the result set of the materialized view's query.
161 * This is also used to populate the materialized view created by CREATE
162 * MATERIALIZED VIEW command.
164 ObjectAddress
165 RefreshMatViewByOid(Oid matviewOid, bool is_create, bool skipData,
166 bool concurrent, const char *queryString,
167 QueryCompletion *qc)
169 Relation matviewRel;
170 RewriteRule *rule;
171 List *actions;
172 Query *dataQuery;
173 Oid tableSpace;
174 Oid relowner;
175 Oid OIDNewHeap;
176 uint64 processed = 0;
177 char relpersistence;
178 Oid save_userid;
179 int save_sec_context;
180 int save_nestlevel;
181 ObjectAddress address;
183 matviewRel = table_open(matviewOid, NoLock);
184 relowner = matviewRel->rd_rel->relowner;
187 * Switch to the owner's userid, so that any functions are run as that
188 * user. Also lock down security-restricted operations and arrange to
189 * make GUC variable changes local to this command.
191 GetUserIdAndSecContext(&save_userid, &save_sec_context);
192 SetUserIdAndSecContext(relowner,
193 save_sec_context | SECURITY_RESTRICTED_OPERATION);
194 save_nestlevel = NewGUCNestLevel();
195 RestrictSearchPath();
197 /* Make sure it is a materialized view. */
198 if (matviewRel->rd_rel->relkind != RELKIND_MATVIEW)
199 ereport(ERROR,
200 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
201 errmsg("\"%s\" is not a materialized view",
202 RelationGetRelationName(matviewRel))));
204 /* Check that CONCURRENTLY is not specified if not populated. */
205 if (concurrent && !RelationIsPopulated(matviewRel))
206 ereport(ERROR,
207 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
208 errmsg("CONCURRENTLY cannot be used when the materialized view is not populated")));
210 /* Check that conflicting options have not been specified. */
211 if (concurrent && skipData)
212 ereport(ERROR,
213 (errcode(ERRCODE_SYNTAX_ERROR),
214 errmsg("%s and %s options cannot be used together",
215 "CONCURRENTLY", "WITH NO DATA")));
218 * Check that everything is correct for a refresh. Problems at this point
219 * are internal errors, so elog is sufficient.
221 if (matviewRel->rd_rel->relhasrules == false ||
222 matviewRel->rd_rules->numLocks < 1)
223 elog(ERROR,
224 "materialized view \"%s\" is missing rewrite information",
225 RelationGetRelationName(matviewRel));
227 if (matviewRel->rd_rules->numLocks > 1)
228 elog(ERROR,
229 "materialized view \"%s\" has too many rules",
230 RelationGetRelationName(matviewRel));
232 rule = matviewRel->rd_rules->rules[0];
233 if (rule->event != CMD_SELECT || !(rule->isInstead))
234 elog(ERROR,
235 "the rule for materialized view \"%s\" is not a SELECT INSTEAD OF rule",
236 RelationGetRelationName(matviewRel));
238 actions = rule->actions;
239 if (list_length(actions) != 1)
240 elog(ERROR,
241 "the rule for materialized view \"%s\" is not a single action",
242 RelationGetRelationName(matviewRel));
245 * Check that there is a unique index with no WHERE clause on one or more
246 * columns of the materialized view if CONCURRENTLY is specified.
248 if (concurrent)
250 List *indexoidlist = RelationGetIndexList(matviewRel);
251 ListCell *indexoidscan;
252 bool hasUniqueIndex = false;
254 Assert(!is_create);
256 foreach(indexoidscan, indexoidlist)
258 Oid indexoid = lfirst_oid(indexoidscan);
259 Relation indexRel;
261 indexRel = index_open(indexoid, AccessShareLock);
262 hasUniqueIndex = is_usable_unique_index(indexRel);
263 index_close(indexRel, AccessShareLock);
264 if (hasUniqueIndex)
265 break;
268 list_free(indexoidlist);
270 if (!hasUniqueIndex)
271 ereport(ERROR,
272 (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
273 errmsg("cannot refresh materialized view \"%s\" concurrently",
274 quote_qualified_identifier(get_namespace_name(RelationGetNamespace(matviewRel)),
275 RelationGetRelationName(matviewRel))),
276 errhint("Create a unique index with no WHERE clause on one or more columns of the materialized view.")));
280 * The stored query was rewritten at the time of the MV definition, but
281 * has not been scribbled on by the planner.
283 dataQuery = linitial_node(Query, actions);
286 * Check for active uses of the relation in the current transaction, such
287 * as open scans.
289 * NB: We count on this to protect us against problems with refreshing the
290 * data using TABLE_INSERT_FROZEN.
292 CheckTableNotInUse(matviewRel,
293 is_create ? "CREATE MATERIALIZED VIEW" :
294 "REFRESH MATERIALIZED VIEW");
297 * Tentatively mark the matview as populated or not (this will roll back
298 * if we fail later).
300 SetMatViewPopulatedState(matviewRel, !skipData);
302 /* Concurrent refresh builds new data in temp tablespace, and does diff. */
303 if (concurrent)
305 tableSpace = GetDefaultTablespace(RELPERSISTENCE_TEMP, false);
306 relpersistence = RELPERSISTENCE_TEMP;
308 else
310 tableSpace = matviewRel->rd_rel->reltablespace;
311 relpersistence = matviewRel->rd_rel->relpersistence;
315 * Create the transient table that will receive the regenerated data. Lock
316 * it against access by any other process until commit (by which time it
317 * will be gone).
319 OIDNewHeap = make_new_heap(matviewOid, tableSpace,
320 matviewRel->rd_rel->relam,
321 relpersistence, ExclusiveLock);
322 Assert(CheckRelationOidLockedByMe(OIDNewHeap, AccessExclusiveLock, false));
324 /* Generate the data, if wanted. */
325 if (!skipData)
327 DestReceiver *dest;
329 dest = CreateTransientRelDestReceiver(OIDNewHeap);
330 processed = refresh_matview_datafill(dest, dataQuery, queryString,
331 is_create);
334 /* Make the matview match the newly generated data. */
335 if (concurrent)
337 int old_depth = matview_maintenance_depth;
339 PG_TRY();
341 refresh_by_match_merge(matviewOid, OIDNewHeap, relowner,
342 save_sec_context);
344 PG_CATCH();
346 matview_maintenance_depth = old_depth;
347 PG_RE_THROW();
349 PG_END_TRY();
350 Assert(matview_maintenance_depth == old_depth);
352 else
354 refresh_by_heap_swap(matviewOid, OIDNewHeap, relpersistence);
357 * Inform cumulative stats system about our activity: basically, we
358 * truncated the matview and inserted some new data. (The concurrent
359 * code path above doesn't need to worry about this because the
360 * inserts and deletes it issues get counted by lower-level code.)
362 pgstat_count_truncate(matviewRel);
363 if (!skipData)
364 pgstat_count_heap_insert(matviewRel, processed);
367 table_close(matviewRel, NoLock);
369 /* Roll back any GUC changes */
370 AtEOXact_GUC(false, save_nestlevel);
372 /* Restore userid and security context */
373 SetUserIdAndSecContext(save_userid, save_sec_context);
375 ObjectAddressSet(address, RelationRelationId, matviewOid);
378 * Save the rowcount so that pg_stat_statements can track the total number
379 * of rows processed by REFRESH MATERIALIZED VIEW command. Note that we
380 * still don't display the rowcount in the command completion tag output,
381 * i.e., the display_rowcount flag of CMDTAG_REFRESH_MATERIALIZED_VIEW
382 * command tag is left false in cmdtaglist.h. Otherwise, the change of
383 * completion tag output might break applications using it.
385 * When called from CREATE MATERIALIZED VIEW command, the rowcount is
386 * displayed with the command tag CMDTAG_SELECT.
388 if (qc)
389 SetQueryCompletion(qc,
390 is_create ? CMDTAG_SELECT : CMDTAG_REFRESH_MATERIALIZED_VIEW,
391 processed);
393 return address;
397 * refresh_matview_datafill
399 * Execute the given query, sending result rows to "dest" (which will
400 * insert them into the target matview).
402 * Returns number of rows inserted.
404 static uint64
405 refresh_matview_datafill(DestReceiver *dest, Query *query,
406 const char *queryString, bool is_create)
408 List *rewritten;
409 PlannedStmt *plan;
410 QueryDesc *queryDesc;
411 Query *copied_query;
412 uint64 processed;
414 /* Lock and rewrite, using a copy to preserve the original query. */
415 copied_query = copyObject(query);
416 AcquireRewriteLocks(copied_query, true, false);
417 rewritten = QueryRewrite(copied_query);
419 /* SELECT should never rewrite to more or less than one SELECT query */
420 if (list_length(rewritten) != 1)
421 elog(ERROR, "unexpected rewrite result for %s",
422 is_create ? "CREATE MATERIALIZED VIEW " : "REFRESH MATERIALIZED VIEW");
423 query = (Query *) linitial(rewritten);
425 /* Check for user-requested abort. */
426 CHECK_FOR_INTERRUPTS();
428 /* Plan the query which will generate data for the refresh. */
429 plan = pg_plan_query(query, queryString, CURSOR_OPT_PARALLEL_OK, NULL);
432 * Use a snapshot with an updated command ID to ensure this query sees
433 * results of any previously executed queries. (This could only matter if
434 * the planner executed an allegedly-stable function that changed the
435 * database contents, but let's do it anyway to be safe.)
437 PushCopiedSnapshot(GetActiveSnapshot());
438 UpdateActiveSnapshotCommandId();
440 /* Create a QueryDesc, redirecting output to our tuple receiver */
441 queryDesc = CreateQueryDesc(plan, queryString,
442 GetActiveSnapshot(), InvalidSnapshot,
443 dest, NULL, NULL, 0);
445 /* call ExecutorStart to prepare the plan for execution */
446 ExecutorStart(queryDesc, 0);
448 /* run the plan */
449 ExecutorRun(queryDesc, ForwardScanDirection, 0);
451 processed = queryDesc->estate->es_processed;
453 /* and clean up */
454 ExecutorFinish(queryDesc);
455 ExecutorEnd(queryDesc);
457 FreeQueryDesc(queryDesc);
459 PopActiveSnapshot();
461 return processed;
464 DestReceiver *
465 CreateTransientRelDestReceiver(Oid transientoid)
467 DR_transientrel *self = (DR_transientrel *) palloc0(sizeof(DR_transientrel));
469 self->pub.receiveSlot = transientrel_receive;
470 self->pub.rStartup = transientrel_startup;
471 self->pub.rShutdown = transientrel_shutdown;
472 self->pub.rDestroy = transientrel_destroy;
473 self->pub.mydest = DestTransientRel;
474 self->transientoid = transientoid;
476 return (DestReceiver *) self;
480 * transientrel_startup --- executor startup
482 static void
483 transientrel_startup(DestReceiver *self, int operation, TupleDesc typeinfo)
485 DR_transientrel *myState = (DR_transientrel *) self;
486 Relation transientrel;
488 transientrel = table_open(myState->transientoid, NoLock);
491 * Fill private fields of myState for use by later routines
493 myState->transientrel = transientrel;
494 myState->output_cid = GetCurrentCommandId(true);
495 myState->ti_options = TABLE_INSERT_SKIP_FSM | TABLE_INSERT_FROZEN;
496 myState->bistate = GetBulkInsertState();
499 * Valid smgr_targblock implies something already wrote to the relation.
500 * This may be harmless, but this function hasn't planned for it.
502 Assert(RelationGetTargetBlock(transientrel) == InvalidBlockNumber);
506 * transientrel_receive --- receive one tuple
508 static bool
509 transientrel_receive(TupleTableSlot *slot, DestReceiver *self)
511 DR_transientrel *myState = (DR_transientrel *) self;
514 * Note that the input slot might not be of the type of the target
515 * relation. That's supported by table_tuple_insert(), but slightly less
516 * efficient than inserting with the right slot - but the alternative
517 * would be to copy into a slot of the right type, which would not be
518 * cheap either. This also doesn't allow accessing per-AM data (say a
519 * tuple's xmin), but since we don't do that here...
522 table_tuple_insert(myState->transientrel,
523 slot,
524 myState->output_cid,
525 myState->ti_options,
526 myState->bistate);
528 /* We know this is a newly created relation, so there are no indexes */
530 return true;
534 * transientrel_shutdown --- executor end
536 static void
537 transientrel_shutdown(DestReceiver *self)
539 DR_transientrel *myState = (DR_transientrel *) self;
541 FreeBulkInsertState(myState->bistate);
543 table_finish_bulk_insert(myState->transientrel, myState->ti_options);
545 /* close transientrel, but keep lock until commit */
546 table_close(myState->transientrel, NoLock);
547 myState->transientrel = NULL;
551 * transientrel_destroy --- release DestReceiver object
553 static void
554 transientrel_destroy(DestReceiver *self)
556 pfree(self);
561 * Given a qualified temporary table name, append an underscore followed by
562 * the given integer, to make a new table name based on the old one.
563 * The result is a palloc'd string.
565 * As coded, this would fail to make a valid SQL name if the given name were,
566 * say, "FOO"."BAR". Currently, the table name portion of the input will
567 * never be double-quoted because it's of the form "pg_temp_NNN", cf
568 * make_new_heap(). But we might have to work harder someday.
570 static char *
571 make_temptable_name_n(char *tempname, int n)
573 StringInfoData namebuf;
575 initStringInfo(&namebuf);
576 appendStringInfoString(&namebuf, tempname);
577 appendStringInfo(&namebuf, "_%d", n);
578 return namebuf.data;
582 * refresh_by_match_merge
584 * Refresh a materialized view with transactional semantics, while allowing
585 * concurrent reads.
587 * This is called after a new version of the data has been created in a
588 * temporary table. It performs a full outer join against the old version of
589 * the data, producing "diff" results. This join cannot work if there are any
590 * duplicated rows in either the old or new versions, in the sense that every
591 * column would compare as equal between the two rows. It does work correctly
592 * in the face of rows which have at least one NULL value, with all non-NULL
593 * columns equal. The behavior of NULLs on equality tests and on UNIQUE
594 * indexes turns out to be quite convenient here; the tests we need to make
595 * are consistent with default behavior. If there is at least one UNIQUE
596 * index on the materialized view, we have exactly the guarantee we need.
598 * The temporary table used to hold the diff results contains just the TID of
599 * the old record (if matched) and the ROW from the new table as a single
600 * column of complex record type (if matched).
602 * Once we have the diff table, we perform set-based DELETE and INSERT
603 * operations against the materialized view, and discard both temporary
604 * tables.
606 * Everything from the generation of the new data to applying the differences
607 * takes place under cover of an ExclusiveLock, since it seems as though we
608 * would want to prohibit not only concurrent REFRESH operations, but also
609 * incremental maintenance. It also doesn't seem reasonable or safe to allow
610 * SELECT FOR UPDATE or SELECT FOR SHARE on rows being updated or deleted by
611 * this command.
613 static void
614 refresh_by_match_merge(Oid matviewOid, Oid tempOid, Oid relowner,
615 int save_sec_context)
617 StringInfoData querybuf;
618 Relation matviewRel;
619 Relation tempRel;
620 char *matviewname;
621 char *tempname;
622 char *diffname;
623 TupleDesc tupdesc;
624 bool foundUniqueIndex;
625 List *indexoidlist;
626 ListCell *indexoidscan;
627 int16 relnatts;
628 Oid *opUsedForQual;
630 initStringInfo(&querybuf);
631 matviewRel = table_open(matviewOid, NoLock);
632 matviewname = quote_qualified_identifier(get_namespace_name(RelationGetNamespace(matviewRel)),
633 RelationGetRelationName(matviewRel));
634 tempRel = table_open(tempOid, NoLock);
635 tempname = quote_qualified_identifier(get_namespace_name(RelationGetNamespace(tempRel)),
636 RelationGetRelationName(tempRel));
637 diffname = make_temptable_name_n(tempname, 2);
639 relnatts = RelationGetNumberOfAttributes(matviewRel);
641 /* Open SPI context. */
642 SPI_connect();
644 /* Analyze the temp table with the new contents. */
645 appendStringInfo(&querybuf, "ANALYZE %s", tempname);
646 if (SPI_exec(querybuf.data, 0) != SPI_OK_UTILITY)
647 elog(ERROR, "SPI_exec failed: %s", querybuf.data);
650 * We need to ensure that there are not duplicate rows without NULLs in
651 * the new data set before we can count on the "diff" results. Check for
652 * that in a way that allows showing the first duplicated row found. Even
653 * after we pass this test, a unique index on the materialized view may
654 * find a duplicate key problem.
656 * Note: here and below, we use "tablename.*::tablerowtype" as a hack to
657 * keep ".*" from being expanded into multiple columns in a SELECT list.
658 * Compare ruleutils.c's get_variable().
660 resetStringInfo(&querybuf);
661 appendStringInfo(&querybuf,
662 "SELECT newdata.*::%s FROM %s newdata "
663 "WHERE newdata.* IS NOT NULL AND EXISTS "
664 "(SELECT 1 FROM %s newdata2 WHERE newdata2.* IS NOT NULL "
665 "AND newdata2.* OPERATOR(pg_catalog.*=) newdata.* "
666 "AND newdata2.ctid OPERATOR(pg_catalog.<>) "
667 "newdata.ctid)",
668 tempname, tempname, tempname);
669 if (SPI_execute(querybuf.data, false, 1) != SPI_OK_SELECT)
670 elog(ERROR, "SPI_exec failed: %s", querybuf.data);
671 if (SPI_processed > 0)
674 * Note that this ereport() is returning data to the user. Generally,
675 * we would want to make sure that the user has been granted access to
676 * this data. However, REFRESH MAT VIEW is only able to be run by the
677 * owner of the mat view (or a superuser) and therefore there is no
678 * need to check for access to data in the mat view.
680 ereport(ERROR,
681 (errcode(ERRCODE_CARDINALITY_VIOLATION),
682 errmsg("new data for materialized view \"%s\" contains duplicate rows without any null columns",
683 RelationGetRelationName(matviewRel)),
684 errdetail("Row: %s",
685 SPI_getvalue(SPI_tuptable->vals[0], SPI_tuptable->tupdesc, 1))));
689 * Create the temporary "diff" table.
691 * Temporarily switch out of the SECURITY_RESTRICTED_OPERATION context,
692 * because you cannot create temp tables in SRO context. For extra
693 * paranoia, add the composite type column only after switching back to
694 * SRO context.
696 SetUserIdAndSecContext(relowner,
697 save_sec_context | SECURITY_LOCAL_USERID_CHANGE);
698 resetStringInfo(&querybuf);
699 appendStringInfo(&querybuf,
700 "CREATE TEMP TABLE %s (tid pg_catalog.tid)",
701 diffname);
702 if (SPI_exec(querybuf.data, 0) != SPI_OK_UTILITY)
703 elog(ERROR, "SPI_exec failed: %s", querybuf.data);
704 SetUserIdAndSecContext(relowner,
705 save_sec_context | SECURITY_RESTRICTED_OPERATION);
706 resetStringInfo(&querybuf);
707 appendStringInfo(&querybuf,
708 "ALTER TABLE %s ADD COLUMN newdata %s",
709 diffname, tempname);
710 if (SPI_exec(querybuf.data, 0) != SPI_OK_UTILITY)
711 elog(ERROR, "SPI_exec failed: %s", querybuf.data);
713 /* Start building the query for populating the diff table. */
714 resetStringInfo(&querybuf);
715 appendStringInfo(&querybuf,
716 "INSERT INTO %s "
717 "SELECT mv.ctid AS tid, newdata.*::%s AS newdata "
718 "FROM %s mv FULL JOIN %s newdata ON (",
719 diffname, tempname, matviewname, tempname);
722 * Get the list of index OIDs for the table from the relcache, and look up
723 * each one in the pg_index syscache. We will test for equality on all
724 * columns present in all unique indexes which only reference columns and
725 * include all rows.
727 tupdesc = matviewRel->rd_att;
728 opUsedForQual = (Oid *) palloc0(sizeof(Oid) * relnatts);
729 foundUniqueIndex = false;
731 indexoidlist = RelationGetIndexList(matviewRel);
733 foreach(indexoidscan, indexoidlist)
735 Oid indexoid = lfirst_oid(indexoidscan);
736 Relation indexRel;
738 indexRel = index_open(indexoid, RowExclusiveLock);
739 if (is_usable_unique_index(indexRel))
741 Form_pg_index indexStruct = indexRel->rd_index;
742 int indnkeyatts = indexStruct->indnkeyatts;
743 oidvector *indclass;
744 Datum indclassDatum;
745 int i;
747 /* Must get indclass the hard way. */
748 indclassDatum = SysCacheGetAttrNotNull(INDEXRELID,
749 indexRel->rd_indextuple,
750 Anum_pg_index_indclass);
751 indclass = (oidvector *) DatumGetPointer(indclassDatum);
753 /* Add quals for all columns from this index. */
754 for (i = 0; i < indnkeyatts; i++)
756 int attnum = indexStruct->indkey.values[i];
757 Oid opclass = indclass->values[i];
758 Form_pg_attribute attr = TupleDescAttr(tupdesc, attnum - 1);
759 Oid attrtype = attr->atttypid;
760 HeapTuple cla_ht;
761 Form_pg_opclass cla_tup;
762 Oid opfamily;
763 Oid opcintype;
764 Oid op;
765 const char *leftop;
766 const char *rightop;
769 * Identify the equality operator associated with this index
770 * column. First we need to look up the column's opclass.
772 cla_ht = SearchSysCache1(CLAOID, ObjectIdGetDatum(opclass));
773 if (!HeapTupleIsValid(cla_ht))
774 elog(ERROR, "cache lookup failed for opclass %u", opclass);
775 cla_tup = (Form_pg_opclass) GETSTRUCT(cla_ht);
776 Assert(cla_tup->opcmethod == BTREE_AM_OID);
777 opfamily = cla_tup->opcfamily;
778 opcintype = cla_tup->opcintype;
779 ReleaseSysCache(cla_ht);
781 op = get_opfamily_member(opfamily, opcintype, opcintype,
782 BTEqualStrategyNumber);
783 if (!OidIsValid(op))
784 elog(ERROR, "missing operator %d(%u,%u) in opfamily %u",
785 BTEqualStrategyNumber, opcintype, opcintype, opfamily);
788 * If we find the same column with the same equality semantics
789 * in more than one index, we only need to emit the equality
790 * clause once.
792 * Since we only remember the last equality operator, this
793 * code could be fooled into emitting duplicate clauses given
794 * multiple indexes with several different opclasses ... but
795 * that's so unlikely it doesn't seem worth spending extra
796 * code to avoid.
798 if (opUsedForQual[attnum - 1] == op)
799 continue;
800 opUsedForQual[attnum - 1] = op;
803 * Actually add the qual, ANDed with any others.
805 if (foundUniqueIndex)
806 appendStringInfoString(&querybuf, " AND ");
808 leftop = quote_qualified_identifier("newdata",
809 NameStr(attr->attname));
810 rightop = quote_qualified_identifier("mv",
811 NameStr(attr->attname));
813 generate_operator_clause(&querybuf,
814 leftop, attrtype,
816 rightop, attrtype);
818 foundUniqueIndex = true;
822 /* Keep the locks, since we're about to run DML which needs them. */
823 index_close(indexRel, NoLock);
826 list_free(indexoidlist);
829 * There must be at least one usable unique index on the matview.
831 * ExecRefreshMatView() checks that after taking the exclusive lock on the
832 * matview. So at least one unique index is guaranteed to exist here
833 * because the lock is still being held. (One known exception is if a
834 * function called as part of refreshing the matview drops the index.
835 * That's a pretty silly thing to do.)
837 if (!foundUniqueIndex)
838 ereport(ERROR,
839 errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
840 errmsg("could not find suitable unique index on materialized view"));
842 appendStringInfoString(&querybuf,
843 " AND newdata.* OPERATOR(pg_catalog.*=) mv.*) "
844 "WHERE newdata.* IS NULL OR mv.* IS NULL "
845 "ORDER BY tid");
847 /* Populate the temporary "diff" table. */
848 if (SPI_exec(querybuf.data, 0) != SPI_OK_INSERT)
849 elog(ERROR, "SPI_exec failed: %s", querybuf.data);
852 * We have no further use for data from the "full-data" temp table, but we
853 * must keep it around because its type is referenced from the diff table.
856 /* Analyze the diff table. */
857 resetStringInfo(&querybuf);
858 appendStringInfo(&querybuf, "ANALYZE %s", diffname);
859 if (SPI_exec(querybuf.data, 0) != SPI_OK_UTILITY)
860 elog(ERROR, "SPI_exec failed: %s", querybuf.data);
862 OpenMatViewIncrementalMaintenance();
864 /* Deletes must come before inserts; do them first. */
865 resetStringInfo(&querybuf);
866 appendStringInfo(&querybuf,
867 "DELETE FROM %s mv WHERE ctid OPERATOR(pg_catalog.=) ANY "
868 "(SELECT diff.tid FROM %s diff "
869 "WHERE diff.tid IS NOT NULL "
870 "AND diff.newdata IS NULL)",
871 matviewname, diffname);
872 if (SPI_exec(querybuf.data, 0) != SPI_OK_DELETE)
873 elog(ERROR, "SPI_exec failed: %s", querybuf.data);
875 /* Inserts go last. */
876 resetStringInfo(&querybuf);
877 appendStringInfo(&querybuf,
878 "INSERT INTO %s SELECT (diff.newdata).* "
879 "FROM %s diff WHERE tid IS NULL",
880 matviewname, diffname);
881 if (SPI_exec(querybuf.data, 0) != SPI_OK_INSERT)
882 elog(ERROR, "SPI_exec failed: %s", querybuf.data);
884 /* We're done maintaining the materialized view. */
885 CloseMatViewIncrementalMaintenance();
886 table_close(tempRel, NoLock);
887 table_close(matviewRel, NoLock);
889 /* Clean up temp tables. */
890 resetStringInfo(&querybuf);
891 appendStringInfo(&querybuf, "DROP TABLE %s, %s", diffname, tempname);
892 if (SPI_exec(querybuf.data, 0) != SPI_OK_UTILITY)
893 elog(ERROR, "SPI_exec failed: %s", querybuf.data);
895 /* Close SPI context. */
896 if (SPI_finish() != SPI_OK_FINISH)
897 elog(ERROR, "SPI_finish failed");
901 * Swap the physical files of the target and transient tables, then rebuild
902 * the target's indexes and throw away the transient table. Security context
903 * swapping is handled by the called function, so it is not needed here.
905 static void
906 refresh_by_heap_swap(Oid matviewOid, Oid OIDNewHeap, char relpersistence)
908 finish_heap_swap(matviewOid, OIDNewHeap, false, false, true, true,
909 RecentXmin, ReadNextMultiXactId(), relpersistence);
913 * Check whether specified index is usable for match merge.
915 static bool
916 is_usable_unique_index(Relation indexRel)
918 Form_pg_index indexStruct = indexRel->rd_index;
921 * Must be unique, valid, immediate, non-partial, and be defined over
922 * plain user columns (not expressions). We also require it to be a
923 * btree. Even if we had any other unique index kinds, we'd not know how
924 * to identify the corresponding equality operator, nor could we be sure
925 * that the planner could implement the required FULL JOIN with non-btree
926 * operators.
928 if (indexStruct->indisunique &&
929 indexStruct->indimmediate &&
930 indexRel->rd_rel->relam == BTREE_AM_OID &&
931 indexStruct->indisvalid &&
932 RelationGetIndexPredicate(indexRel) == NIL &&
933 indexStruct->indnatts > 0)
936 * The point of groveling through the index columns individually is to
937 * reject both index expressions and system columns. Currently,
938 * matviews couldn't have OID columns so there's no way to create an
939 * index on a system column; but maybe someday that wouldn't be true,
940 * so let's be safe.
942 int numatts = indexStruct->indnatts;
943 int i;
945 for (i = 0; i < numatts; i++)
947 int attnum = indexStruct->indkey.values[i];
949 if (attnum <= 0)
950 return false;
952 return true;
954 return false;
959 * This should be used to test whether the backend is in a context where it is
960 * OK to allow DML statements to modify materialized views. We only want to
961 * allow that for internal code driven by the materialized view definition,
962 * not for arbitrary user-supplied code.
964 * While the function names reflect the fact that their main intended use is
965 * incremental maintenance of materialized views (in response to changes to
966 * the data in referenced relations), they are initially used to allow REFRESH
967 * without blocking concurrent reads.
969 bool
970 MatViewIncrementalMaintenanceIsEnabled(void)
972 return matview_maintenance_depth > 0;
975 static void
976 OpenMatViewIncrementalMaintenance(void)
978 matview_maintenance_depth++;
981 static void
982 CloseMatViewIncrementalMaintenance(void)
984 matview_maintenance_depth--;
985 Assert(matview_maintenance_depth >= 0);