PostgreSQL Source Code  git master
matview.c File Reference
#include "postgres.h"
#include "access/genam.h"
#include "access/heapam.h"
#include "access/htup_details.h"
#include "access/multixact.h"
#include "access/tableam.h"
#include "access/xact.h"
#include "access/xlog.h"
#include "catalog/catalog.h"
#include "catalog/indexing.h"
#include "catalog/namespace.h"
#include "catalog/pg_am.h"
#include "catalog/pg_opclass.h"
#include "catalog/pg_operator.h"
#include "commands/cluster.h"
#include "commands/matview.h"
#include "commands/tablecmds.h"
#include "commands/tablespace.h"
#include "executor/executor.h"
#include "executor/spi.h"
#include "miscadmin.h"
#include "parser/parse_relation.h"
#include "pgstat.h"
#include "rewrite/rewriteHandler.h"
#include "storage/lmgr.h"
#include "storage/smgr.h"
#include "tcop/tcopprot.h"
#include "utils/builtins.h"
#include "utils/lsyscache.h"
#include "utils/rel.h"
#include "utils/snapmgr.h"
#include "utils/syscache.h"
Include dependency graph for matview.c:

Go to the source code of this file.

Data Structures

struct  DR_transientrel
 

Functions

static void transientrel_startup (DestReceiver *self, int operation, TupleDesc typeinfo)
 
static bool transientrel_receive (TupleTableSlot *slot, DestReceiver *self)
 
static void transientrel_shutdown (DestReceiver *self)
 
static void transientrel_destroy (DestReceiver *self)
 
static uint64 refresh_matview_datafill (DestReceiver *dest, Query *query, const char *queryString)
 
static char * make_temptable_name_n (char *tempname, int n)
 
static void refresh_by_match_merge (Oid matviewOid, Oid tempOid, Oid relowner, int save_sec_context)
 
static void refresh_by_heap_swap (Oid matviewOid, Oid OIDNewHeap, char relpersistence)
 
static bool is_usable_unique_index (Relation indexRel)
 
static void OpenMatViewIncrementalMaintenance (void)
 
static void CloseMatViewIncrementalMaintenance (void)
 
void SetMatViewPopulatedState (Relation relation, bool newstate)
 
ObjectAddress ExecRefreshMatView (RefreshMatViewStmt *stmt, const char *queryString, ParamListInfo params, QueryCompletion *qc)
 
DestReceiverCreateTransientRelDestReceiver (Oid transientoid)
 
bool MatViewIncrementalMaintenanceIsEnabled (void)
 

Variables

static int matview_maintenance_depth = 0
 

Function Documentation

◆ CloseMatViewIncrementalMaintenance()

static void CloseMatViewIncrementalMaintenance ( void  )
static

Definition at line 930 of file matview.c.

931 {
934 }
Assert(fmt[strlen(fmt) - 1] !='\n')
static int matview_maintenance_depth
Definition: matview.c:61

References Assert(), and matview_maintenance_depth.

Referenced by refresh_by_match_merge().

◆ CreateTransientRelDestReceiver()

DestReceiver* CreateTransientRelDestReceiver ( Oid  transientoid)

Definition at line 436 of file matview.c.

437 {
439 
440  self->pub.receiveSlot = transientrel_receive;
441  self->pub.rStartup = transientrel_startup;
442  self->pub.rShutdown = transientrel_shutdown;
443  self->pub.rDestroy = transientrel_destroy;
444  self->pub.mydest = DestTransientRel;
445  self->transientoid = transientoid;
446 
447  return (DestReceiver *) self;
448 }
@ DestTransientRel
Definition: dest.h:97
static void transientrel_destroy(DestReceiver *self)
Definition: matview.c:525
static void transientrel_startup(DestReceiver *self, int operation, TupleDesc typeinfo)
Definition: matview.c:454
static bool transientrel_receive(TupleTableSlot *slot, DestReceiver *self)
Definition: matview.c:480
static void transientrel_shutdown(DestReceiver *self)
Definition: matview.c:508
void * palloc0(Size size)
Definition: mcxt.c:1241

References DestTransientRel, palloc0(), transientrel_destroy(), transientrel_receive(), transientrel_shutdown(), and transientrel_startup().

Referenced by CreateDestReceiver(), and ExecRefreshMatView().

◆ ExecRefreshMatView()

ObjectAddress ExecRefreshMatView ( RefreshMatViewStmt stmt,
const char *  queryString,
ParamListInfo  params,
QueryCompletion qc 
)

Definition at line 138 of file matview.c.

140 {
141  Oid matviewOid;
142  Relation matviewRel;
143  RewriteRule *rule;
144  List *actions;
145  Query *dataQuery;
146  Oid tableSpace;
147  Oid relowner;
148  Oid OIDNewHeap;
150  uint64 processed = 0;
151  bool concurrent;
152  LOCKMODE lockmode;
153  char relpersistence;
154  Oid save_userid;
155  int save_sec_context;
156  int save_nestlevel;
157  ObjectAddress address;
158 
159  /* Determine strength of lock needed. */
160  concurrent = stmt->concurrent;
161  lockmode = concurrent ? ExclusiveLock : AccessExclusiveLock;
162 
163  /*
164  * Get a lock until end of transaction.
165  */
166  matviewOid = RangeVarGetRelidExtended(stmt->relation,
167  lockmode, 0,
169  NULL);
170  matviewRel = table_open(matviewOid, NoLock);
171  relowner = matviewRel->rd_rel->relowner;
172 
173  /*
174  * Switch to the owner's userid, so that any functions are run as that
175  * user. Also lock down security-restricted operations and arrange to
176  * make GUC variable changes local to this command.
177  */
178  GetUserIdAndSecContext(&save_userid, &save_sec_context);
179  SetUserIdAndSecContext(relowner,
180  save_sec_context | SECURITY_RESTRICTED_OPERATION);
181  save_nestlevel = NewGUCNestLevel();
182 
183  /* Make sure it is a materialized view. */
184  if (matviewRel->rd_rel->relkind != RELKIND_MATVIEW)
185  ereport(ERROR,
186  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
187  errmsg("\"%s\" is not a materialized view",
188  RelationGetRelationName(matviewRel))));
189 
190  /* Check that CONCURRENTLY is not specified if not populated. */
191  if (concurrent && !RelationIsPopulated(matviewRel))
192  ereport(ERROR,
193  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
194  errmsg("CONCURRENTLY cannot be used when the materialized view is not populated")));
195 
196  /* Check that conflicting options have not been specified. */
197  if (concurrent && stmt->skipData)
198  ereport(ERROR,
199  (errcode(ERRCODE_SYNTAX_ERROR),
200  errmsg("%s and %s options cannot be used together",
201  "CONCURRENTLY", "WITH NO DATA")));
202 
203  /*
204  * Check that everything is correct for a refresh. Problems at this point
205  * are internal errors, so elog is sufficient.
206  */
207  if (matviewRel->rd_rel->relhasrules == false ||
208  matviewRel->rd_rules->numLocks < 1)
209  elog(ERROR,
210  "materialized view \"%s\" is missing rewrite information",
211  RelationGetRelationName(matviewRel));
212 
213  if (matviewRel->rd_rules->numLocks > 1)
214  elog(ERROR,
215  "materialized view \"%s\" has too many rules",
216  RelationGetRelationName(matviewRel));
217 
218  rule = matviewRel->rd_rules->rules[0];
219  if (rule->event != CMD_SELECT || !(rule->isInstead))
220  elog(ERROR,
221  "the rule for materialized view \"%s\" is not a SELECT INSTEAD OF rule",
222  RelationGetRelationName(matviewRel));
223 
224  actions = rule->actions;
225  if (list_length(actions) != 1)
226  elog(ERROR,
227  "the rule for materialized view \"%s\" is not a single action",
228  RelationGetRelationName(matviewRel));
229 
230  /*
231  * Check that there is a unique index with no WHERE clause on one or more
232  * columns of the materialized view if CONCURRENTLY is specified.
233  */
234  if (concurrent)
235  {
236  List *indexoidlist = RelationGetIndexList(matviewRel);
237  ListCell *indexoidscan;
238  bool hasUniqueIndex = false;
239 
240  foreach(indexoidscan, indexoidlist)
241  {
242  Oid indexoid = lfirst_oid(indexoidscan);
243  Relation indexRel;
244 
245  indexRel = index_open(indexoid, AccessShareLock);
246  hasUniqueIndex = is_usable_unique_index(indexRel);
247  index_close(indexRel, AccessShareLock);
248  if (hasUniqueIndex)
249  break;
250  }
251 
252  list_free(indexoidlist);
253 
254  if (!hasUniqueIndex)
255  ereport(ERROR,
256  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
257  errmsg("cannot refresh materialized view \"%s\" concurrently",
259  RelationGetRelationName(matviewRel))),
260  errhint("Create a unique index with no WHERE clause on one or more columns of the materialized view.")));
261  }
262 
263  /*
264  * The stored query was rewritten at the time of the MV definition, but
265  * has not been scribbled on by the planner.
266  */
267  dataQuery = linitial_node(Query, actions);
268 
269  /*
270  * Check for active uses of the relation in the current transaction, such
271  * as open scans.
272  *
273  * NB: We count on this to protect us against problems with refreshing the
274  * data using TABLE_INSERT_FROZEN.
275  */
276  CheckTableNotInUse(matviewRel, "REFRESH MATERIALIZED VIEW");
277 
278  /*
279  * Tentatively mark the matview as populated or not (this will roll back
280  * if we fail later).
281  */
282  SetMatViewPopulatedState(matviewRel, !stmt->skipData);
283 
284  /* Concurrent refresh builds new data in temp tablespace, and does diff. */
285  if (concurrent)
286  {
287  tableSpace = GetDefaultTablespace(RELPERSISTENCE_TEMP, false);
288  relpersistence = RELPERSISTENCE_TEMP;
289  }
290  else
291  {
292  tableSpace = matviewRel->rd_rel->reltablespace;
293  relpersistence = matviewRel->rd_rel->relpersistence;
294  }
295 
296  /*
297  * Create the transient table that will receive the regenerated data. Lock
298  * it against access by any other process until commit (by which time it
299  * will be gone).
300  */
301  OIDNewHeap = make_new_heap(matviewOid, tableSpace,
302  matviewRel->rd_rel->relam,
303  relpersistence, ExclusiveLock);
305  dest = CreateTransientRelDestReceiver(OIDNewHeap);
306 
307  /* Generate the data, if wanted. */
308  if (!stmt->skipData)
309  processed = refresh_matview_datafill(dest, dataQuery, queryString);
310 
311  /* Make the matview match the newly generated data. */
312  if (concurrent)
313  {
314  int old_depth = matview_maintenance_depth;
315 
316  PG_TRY();
317  {
318  refresh_by_match_merge(matviewOid, OIDNewHeap, relowner,
319  save_sec_context);
320  }
321  PG_CATCH();
322  {
323  matview_maintenance_depth = old_depth;
324  PG_RE_THROW();
325  }
326  PG_END_TRY();
327  Assert(matview_maintenance_depth == old_depth);
328  }
329  else
330  {
331  refresh_by_heap_swap(matviewOid, OIDNewHeap, relpersistence);
332 
333  /*
334  * Inform cumulative stats system about our activity: basically, we
335  * truncated the matview and inserted some new data. (The concurrent
336  * code path above doesn't need to worry about this because the
337  * inserts and deletes it issues get counted by lower-level code.)
338  */
339  pgstat_count_truncate(matviewRel);
340  if (!stmt->skipData)
341  pgstat_count_heap_insert(matviewRel, processed);
342  }
343 
344  table_close(matviewRel, NoLock);
345 
346  /* Roll back any GUC changes */
347  AtEOXact_GUC(false, save_nestlevel);
348 
349  /* Restore userid and security context */
350  SetUserIdAndSecContext(save_userid, save_sec_context);
351 
352  ObjectAddressSet(address, RelationRelationId, matviewOid);
353 
354  /*
355  * Save the rowcount so that pg_stat_statements can track the total number
356  * of rows processed by REFRESH MATERIALIZED VIEW command. Note that we
357  * still don't display the rowcount in the command completion tag output,
358  * i.e., the display_rowcount flag of CMDTAG_REFRESH_MATERIALIZED_VIEW
359  * command tag is left false in cmdtaglist.h. Otherwise, the change of
360  * completion tag output might break applications using it.
361  */
362  if (qc)
363  SetQueryCompletion(qc, CMDTAG_REFRESH_MATERIALIZED_VIEW, processed);
364 
365  return address;
366 }
Oid GetDefaultTablespace(char relpersistence, bool partitioned)
Definition: tablespace.c:1149
Oid make_new_heap(Oid OIDOldHeap, Oid NewTableSpace, Oid NewAccessMethod, char relpersistence, LOCKMODE lockmode)
Definition: cluster.c:690
static void SetQueryCompletion(QueryCompletion *qc, CommandTag commandTag, uint64 nprocessed)
Definition: cmdtag.h:38
int errhint(const char *fmt,...)
Definition: elog.c:1316
int errcode(int sqlerrcode)
Definition: elog.c:858
int errmsg(const char *fmt,...)
Definition: elog.c:1069
#define PG_RE_THROW()
Definition: elog.h:411
#define PG_TRY(...)
Definition: elog.h:370
#define PG_END_TRY(...)
Definition: elog.h:395
#define ERROR
Definition: elog.h:39
#define PG_CATCH(...)
Definition: elog.h:380
#define ereport(elevel,...)
Definition: elog.h:149
int NewGUCNestLevel(void)
Definition: guc.c:2201
void AtEOXact_GUC(bool isCommit, int nestLevel)
Definition: guc.c:2215
#define stmt
Definition: indent_codes.h:59
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:158
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition: indexam.c:132
void list_free(List *list)
Definition: list.c:1545
void LockRelationOid(Oid relid, LOCKMODE lockmode)
Definition: lmgr.c:109
int LOCKMODE
Definition: lockdefs.h:26
#define NoLock
Definition: lockdefs.h:34
#define AccessExclusiveLock
Definition: lockdefs.h:43
#define AccessShareLock
Definition: lockdefs.h:36
#define ExclusiveLock
Definition: lockdefs.h:42
char * get_namespace_name(Oid nspid)
Definition: lsyscache.c:3324
static uint64 refresh_matview_datafill(DestReceiver *dest, Query *query, const char *queryString)
Definition: matview.c:377
static void refresh_by_match_merge(Oid matviewOid, Oid tempOid, Oid relowner, int save_sec_context)
Definition: matview.c:585
DestReceiver * CreateTransientRelDestReceiver(Oid transientoid)
Definition: matview.c:436
static bool is_usable_unique_index(Relation indexRel)
Definition: matview.c:864
void SetMatViewPopulatedState(Relation relation, bool newstate)
Definition: matview.c:84
static void refresh_by_heap_swap(Oid matviewOid, Oid OIDNewHeap, char relpersistence)
Definition: matview.c:854
#define SECURITY_RESTRICTED_OPERATION
Definition: miscadmin.h:305
void GetUserIdAndSecContext(Oid *userid, int *sec_context)
Definition: miscinit.c:631
void SetUserIdAndSecContext(Oid userid, int sec_context)
Definition: miscinit.c:638
Oid RangeVarGetRelidExtended(const RangeVar *relation, LOCKMODE lockmode, uint32 flags, RangeVarGetRelidCallback callback, void *callback_arg)
Definition: namespace.c:239
@ CMD_SELECT
Definition: nodes.h:276
#define ObjectAddressSet(addr, class_id, object_id)
Definition: objectaddress.h:40
static int list_length(const List *l)
Definition: pg_list.h:152
#define linitial_node(type, l)
Definition: pg_list.h:181
#define lfirst_oid(lc)
Definition: pg_list.h:174
void pgstat_count_heap_insert(Relation rel, PgStat_Counter n)
void pgstat_count_truncate(Relation rel)
unsigned int Oid
Definition: postgres_ext.h:31
#define RelationGetRelationName(relation)
Definition: rel.h:537
#define RelationIsPopulated(relation)
Definition: rel.h:677
#define RelationGetNamespace(relation)
Definition: rel.h:544
List * RelationGetIndexList(Relation relation)
Definition: relcache.c:4739
char * quote_qualified_identifier(const char *qualifier, const char *ident)
Definition: ruleutils.c:11835
Definition: pg_list.h:54
RuleLock * rd_rules
Definition: rel.h:114
Form_pg_class rd_rel
Definition: rel.h:110
RewriteRule ** rules
Definition: prs2lock.h:43
int numLocks
Definition: prs2lock.h:42
Definition: localtime.c:73
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:126
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:40
void CheckTableNotInUse(Relation rel, const char *stmt)
Definition: tablecmds.c:4080
void RangeVarCallbackMaintainsTable(const RangeVar *relation, Oid relId, Oid oldRelId, void *arg)
Definition: tablecmds.c:16958

References AccessExclusiveLock, AccessShareLock, Assert(), AtEOXact_GUC(), CheckTableNotInUse(), CMD_SELECT, CreateTransientRelDestReceiver(), generate_unaccent_rules::dest, elog(), ereport, errcode(), errhint(), errmsg(), ERROR, ExclusiveLock, get_namespace_name(), GetDefaultTablespace(), GetUserIdAndSecContext(), index_close(), index_open(), is_usable_unique_index(), lfirst_oid, linitial_node, list_free(), list_length(), LockRelationOid(), make_new_heap(), matview_maintenance_depth, NewGUCNestLevel(), NoLock, RuleLock::numLocks, ObjectAddressSet, PG_CATCH, PG_END_TRY, PG_RE_THROW, PG_TRY, pgstat_count_heap_insert(), pgstat_count_truncate(), quote_qualified_identifier(), RangeVarCallbackMaintainsTable(), RangeVarGetRelidExtended(), RelationData::rd_rel, RelationData::rd_rules, refresh_by_heap_swap(), refresh_by_match_merge(), refresh_matview_datafill(), RelationGetIndexList(), RelationGetNamespace, RelationGetRelationName, RelationIsPopulated, RuleLock::rules, SECURITY_RESTRICTED_OPERATION, SetMatViewPopulatedState(), SetQueryCompletion(), SetUserIdAndSecContext(), stmt, table_close(), and table_open().

Referenced by ProcessUtilitySlow().

◆ is_usable_unique_index()

static bool is_usable_unique_index ( Relation  indexRel)
static

Definition at line 864 of file matview.c.

865 {
866  Form_pg_index indexStruct = indexRel->rd_index;
867 
868  /*
869  * Must be unique, valid, immediate, non-partial, and be defined over
870  * plain user columns (not expressions). We also require it to be a
871  * btree. Even if we had any other unique index kinds, we'd not know how
872  * to identify the corresponding equality operator, nor could we be sure
873  * that the planner could implement the required FULL JOIN with non-btree
874  * operators.
875  */
876  if (indexStruct->indisunique &&
877  indexStruct->indimmediate &&
878  indexRel->rd_rel->relam == BTREE_AM_OID &&
879  indexStruct->indisvalid &&
880  RelationGetIndexPredicate(indexRel) == NIL &&
881  indexStruct->indnatts > 0)
882  {
883  /*
884  * The point of groveling through the index columns individually is to
885  * reject both index expressions and system columns. Currently,
886  * matviews couldn't have OID columns so there's no way to create an
887  * index on a system column; but maybe someday that wouldn't be true,
888  * so let's be safe.
889  */
890  int numatts = indexStruct->indnatts;
891  int i;
892 
893  for (i = 0; i < numatts; i++)
894  {
895  int attnum = indexStruct->indkey.values[i];
896 
897  if (attnum <= 0)
898  return false;
899  }
900  return true;
901  }
902  return false;
903 }
int i
Definition: isn.c:73
int16 attnum
Definition: pg_attribute.h:74
FormData_pg_index * Form_pg_index
Definition: pg_index.h:70
#define NIL
Definition: pg_list.h:68
List * RelationGetIndexPredicate(Relation relation)
Definition: relcache.c:5086
Form_pg_index rd_index
Definition: rel.h:190

References attnum, i, NIL, RelationData::rd_index, RelationData::rd_rel, and RelationGetIndexPredicate().

Referenced by ExecRefreshMatView(), and refresh_by_match_merge().

◆ make_temptable_name_n()

static char * make_temptable_name_n ( char *  tempname,
int  n 
)
static

Definition at line 542 of file matview.c.

543 {
544  StringInfoData namebuf;
545 
546  initStringInfo(&namebuf);
547  appendStringInfoString(&namebuf, tempname);
548  appendStringInfo(&namebuf, "_%d", n);
549  return namebuf.data;
550 }
void appendStringInfo(StringInfo str, const char *fmt,...)
Definition: stringinfo.c:91
void appendStringInfoString(StringInfo str, const char *s)
Definition: stringinfo.c:176
void initStringInfo(StringInfo str)
Definition: stringinfo.c:59

References appendStringInfo(), appendStringInfoString(), StringInfoData::data, and initStringInfo().

Referenced by refresh_by_match_merge().

◆ MatViewIncrementalMaintenanceIsEnabled()

bool MatViewIncrementalMaintenanceIsEnabled ( void  )

Definition at line 918 of file matview.c.

919 {
920  return matview_maintenance_depth > 0;
921 }

References matview_maintenance_depth.

Referenced by CheckValidResultRel().

◆ OpenMatViewIncrementalMaintenance()

static void OpenMatViewIncrementalMaintenance ( void  )
static

Definition at line 924 of file matview.c.

925 {
927 }

References matview_maintenance_depth.

Referenced by refresh_by_match_merge().

◆ refresh_by_heap_swap()

static void refresh_by_heap_swap ( Oid  matviewOid,
Oid  OIDNewHeap,
char  relpersistence 
)
static

Definition at line 854 of file matview.c.

855 {
856  finish_heap_swap(matviewOid, OIDNewHeap, false, false, true, true,
857  RecentXmin, ReadNextMultiXactId(), relpersistence);
858 }
void finish_heap_swap(Oid OIDOldHeap, Oid OIDNewHeap, bool is_system_catalog, bool swap_toast_by_content, bool check_constraints, bool is_internal, TransactionId frozenXid, MultiXactId cutoffMulti, char newrelpersistence)
Definition: cluster.c:1424
MultiXactId ReadNextMultiXactId(void)
Definition: multixact.c:724
TransactionId RecentXmin
Definition: snapmgr.c:114

References finish_heap_swap(), ReadNextMultiXactId(), and RecentXmin.

Referenced by ExecRefreshMatView().

◆ refresh_by_match_merge()

static void refresh_by_match_merge ( Oid  matviewOid,
Oid  tempOid,
Oid  relowner,
int  save_sec_context 
)
static

Definition at line 585 of file matview.c.

587 {
588  StringInfoData querybuf;
589  Relation matviewRel;
590  Relation tempRel;
591  char *matviewname;
592  char *tempname;
593  char *diffname;
594  TupleDesc tupdesc;
595  bool foundUniqueIndex;
596  List *indexoidlist;
597  ListCell *indexoidscan;
598  int16 relnatts;
599  Oid *opUsedForQual;
600 
601  initStringInfo(&querybuf);
602  matviewRel = table_open(matviewOid, NoLock);
604  RelationGetRelationName(matviewRel));
605  tempRel = table_open(tempOid, NoLock);
607  RelationGetRelationName(tempRel));
608  diffname = make_temptable_name_n(tempname, 2);
609 
610  relnatts = RelationGetNumberOfAttributes(matviewRel);
611 
612  /* Open SPI context. */
613  if (SPI_connect() != SPI_OK_CONNECT)
614  elog(ERROR, "SPI_connect failed");
615 
616  /* Analyze the temp table with the new contents. */
617  appendStringInfo(&querybuf, "ANALYZE %s", tempname);
618  if (SPI_exec(querybuf.data, 0) != SPI_OK_UTILITY)
619  elog(ERROR, "SPI_exec failed: %s", querybuf.data);
620 
621  /*
622  * We need to ensure that there are not duplicate rows without NULLs in
623  * the new data set before we can count on the "diff" results. Check for
624  * that in a way that allows showing the first duplicated row found. Even
625  * after we pass this test, a unique index on the materialized view may
626  * find a duplicate key problem.
627  *
628  * Note: here and below, we use "tablename.*::tablerowtype" as a hack to
629  * keep ".*" from being expanded into multiple columns in a SELECT list.
630  * Compare ruleutils.c's get_variable().
631  */
632  resetStringInfo(&querybuf);
633  appendStringInfo(&querybuf,
634  "SELECT newdata.*::%s FROM %s newdata "
635  "WHERE newdata.* IS NOT NULL AND EXISTS "
636  "(SELECT 1 FROM %s newdata2 WHERE newdata2.* IS NOT NULL "
637  "AND newdata2.* OPERATOR(pg_catalog.*=) newdata.* "
638  "AND newdata2.ctid OPERATOR(pg_catalog.<>) "
639  "newdata.ctid)",
640  tempname, tempname, tempname);
641  if (SPI_execute(querybuf.data, false, 1) != SPI_OK_SELECT)
642  elog(ERROR, "SPI_exec failed: %s", querybuf.data);
643  if (SPI_processed > 0)
644  {
645  /*
646  * Note that this ereport() is returning data to the user. Generally,
647  * we would want to make sure that the user has been granted access to
648  * this data. However, REFRESH MAT VIEW is only able to be run by the
649  * owner of the mat view (or a superuser) and therefore there is no
650  * need to check for access to data in the mat view.
651  */
652  ereport(ERROR,
653  (errcode(ERRCODE_CARDINALITY_VIOLATION),
654  errmsg("new data for materialized view \"%s\" contains duplicate rows without any null columns",
655  RelationGetRelationName(matviewRel)),
656  errdetail("Row: %s",
658  }
659 
660  SetUserIdAndSecContext(relowner,
661  save_sec_context | SECURITY_LOCAL_USERID_CHANGE);
662 
663  /* Start building the query for creating the diff table. */
664  resetStringInfo(&querybuf);
665  appendStringInfo(&querybuf,
666  "CREATE TEMP TABLE %s AS "
667  "SELECT mv.ctid AS tid, newdata.*::%s AS newdata "
668  "FROM %s mv FULL JOIN %s newdata ON (",
669  diffname, tempname, matviewname, tempname);
670 
671  /*
672  * Get the list of index OIDs for the table from the relcache, and look up
673  * each one in the pg_index syscache. We will test for equality on all
674  * columns present in all unique indexes which only reference columns and
675  * include all rows.
676  */
677  tupdesc = matviewRel->rd_att;
678  opUsedForQual = (Oid *) palloc0(sizeof(Oid) * relnatts);
679  foundUniqueIndex = false;
680 
681  indexoidlist = RelationGetIndexList(matviewRel);
682 
683  foreach(indexoidscan, indexoidlist)
684  {
685  Oid indexoid = lfirst_oid(indexoidscan);
686  Relation indexRel;
687 
688  indexRel = index_open(indexoid, RowExclusiveLock);
689  if (is_usable_unique_index(indexRel))
690  {
691  Form_pg_index indexStruct = indexRel->rd_index;
692  int indnkeyatts = indexStruct->indnkeyatts;
693  oidvector *indclass;
694  Datum indclassDatum;
695  int i;
696 
697  /* Must get indclass the hard way. */
698  indclassDatum = SysCacheGetAttrNotNull(INDEXRELID,
699  indexRel->rd_indextuple,
700  Anum_pg_index_indclass);
701  indclass = (oidvector *) DatumGetPointer(indclassDatum);
702 
703  /* Add quals for all columns from this index. */
704  for (i = 0; i < indnkeyatts; i++)
705  {
706  int attnum = indexStruct->indkey.values[i];
707  Oid opclass = indclass->values[i];
708  Form_pg_attribute attr = TupleDescAttr(tupdesc, attnum - 1);
709  Oid attrtype = attr->atttypid;
710  HeapTuple cla_ht;
711  Form_pg_opclass cla_tup;
712  Oid opfamily;
713  Oid opcintype;
714  Oid op;
715  const char *leftop;
716  const char *rightop;
717 
718  /*
719  * Identify the equality operator associated with this index
720  * column. First we need to look up the column's opclass.
721  */
722  cla_ht = SearchSysCache1(CLAOID, ObjectIdGetDatum(opclass));
723  if (!HeapTupleIsValid(cla_ht))
724  elog(ERROR, "cache lookup failed for opclass %u", opclass);
725  cla_tup = (Form_pg_opclass) GETSTRUCT(cla_ht);
726  Assert(cla_tup->opcmethod == BTREE_AM_OID);
727  opfamily = cla_tup->opcfamily;
728  opcintype = cla_tup->opcintype;
729  ReleaseSysCache(cla_ht);
730 
731  op = get_opfamily_member(opfamily, opcintype, opcintype,
733  if (!OidIsValid(op))
734  elog(ERROR, "missing operator %d(%u,%u) in opfamily %u",
735  BTEqualStrategyNumber, opcintype, opcintype, opfamily);
736 
737  /*
738  * If we find the same column with the same equality semantics
739  * in more than one index, we only need to emit the equality
740  * clause once.
741  *
742  * Since we only remember the last equality operator, this
743  * code could be fooled into emitting duplicate clauses given
744  * multiple indexes with several different opclasses ... but
745  * that's so unlikely it doesn't seem worth spending extra
746  * code to avoid.
747  */
748  if (opUsedForQual[attnum - 1] == op)
749  continue;
750  opUsedForQual[attnum - 1] = op;
751 
752  /*
753  * Actually add the qual, ANDed with any others.
754  */
755  if (foundUniqueIndex)
756  appendStringInfoString(&querybuf, " AND ");
757 
758  leftop = quote_qualified_identifier("newdata",
759  NameStr(attr->attname));
760  rightop = quote_qualified_identifier("mv",
761  NameStr(attr->attname));
762 
763  generate_operator_clause(&querybuf,
764  leftop, attrtype,
765  op,
766  rightop, attrtype);
767 
768  foundUniqueIndex = true;
769  }
770  }
771 
772  /* Keep the locks, since we're about to run DML which needs them. */
773  index_close(indexRel, NoLock);
774  }
775 
776  list_free(indexoidlist);
777 
778  /*
779  * There must be at least one usable unique index on the matview.
780  *
781  * ExecRefreshMatView() checks that after taking the exclusive lock on the
782  * matview. So at least one unique index is guaranteed to exist here
783  * because the lock is still being held; so an Assert seems sufficient.
784  */
785  Assert(foundUniqueIndex);
786 
787  appendStringInfoString(&querybuf,
788  " AND newdata.* OPERATOR(pg_catalog.*=) mv.*) "
789  "WHERE newdata.* IS NULL OR mv.* IS NULL "
790  "ORDER BY tid");
791 
792  /* Create the temporary "diff" table. */
793  if (SPI_exec(querybuf.data, 0) != SPI_OK_UTILITY)
794  elog(ERROR, "SPI_exec failed: %s", querybuf.data);
795 
796  SetUserIdAndSecContext(relowner,
797  save_sec_context | SECURITY_RESTRICTED_OPERATION);
798 
799  /*
800  * We have no further use for data from the "full-data" temp table, but we
801  * must keep it around because its type is referenced from the diff table.
802  */
803 
804  /* Analyze the diff table. */
805  resetStringInfo(&querybuf);
806  appendStringInfo(&querybuf, "ANALYZE %s", diffname);
807  if (SPI_exec(querybuf.data, 0) != SPI_OK_UTILITY)
808  elog(ERROR, "SPI_exec failed: %s", querybuf.data);
809 
811 
812  /* Deletes must come before inserts; do them first. */
813  resetStringInfo(&querybuf);
814  appendStringInfo(&querybuf,
815  "DELETE FROM %s mv WHERE ctid OPERATOR(pg_catalog.=) ANY "
816  "(SELECT diff.tid FROM %s diff "
817  "WHERE diff.tid IS NOT NULL "
818  "AND diff.newdata IS NULL)",
819  matviewname, diffname);
820  if (SPI_exec(querybuf.data, 0) != SPI_OK_DELETE)
821  elog(ERROR, "SPI_exec failed: %s", querybuf.data);
822 
823  /* Inserts go last. */
824  resetStringInfo(&querybuf);
825  appendStringInfo(&querybuf,
826  "INSERT INTO %s SELECT (diff.newdata).* "
827  "FROM %s diff WHERE tid IS NULL",
828  matviewname, diffname);
829  if (SPI_exec(querybuf.data, 0) != SPI_OK_INSERT)
830  elog(ERROR, "SPI_exec failed: %s", querybuf.data);
831 
832  /* We're done maintaining the materialized view. */
834  table_close(tempRel, NoLock);
835  table_close(matviewRel, NoLock);
836 
837  /* Clean up temp tables. */
838  resetStringInfo(&querybuf);
839  appendStringInfo(&querybuf, "DROP TABLE %s, %s", diffname, tempname);
840  if (SPI_exec(querybuf.data, 0) != SPI_OK_UTILITY)
841  elog(ERROR, "SPI_exec failed: %s", querybuf.data);
842 
843  /* Close SPI context. */
844  if (SPI_finish() != SPI_OK_FINISH)
845  elog(ERROR, "SPI_finish failed");
846 }
#define NameStr(name)
Definition: c.h:730
signed short int16
Definition: c.h:477
#define OidIsValid(objectId)
Definition: c.h:759
int errdetail(const char *fmt,...)
Definition: elog.c:1202
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define GETSTRUCT(TUP)
Definition: htup_details.h:653
#define RowExclusiveLock
Definition: lockdefs.h:38
Oid get_opfamily_member(Oid opfamily, Oid lefttype, Oid righttype, int16 strategy)
Definition: lsyscache.c:165
static char * make_temptable_name_n(char *tempname, int n)
Definition: matview.c:542
static void CloseMatViewIncrementalMaintenance(void)
Definition: matview.c:930
static void OpenMatViewIncrementalMaintenance(void)
Definition: matview.c:924
#define SECURITY_LOCAL_USERID_CHANGE
Definition: miscadmin.h:304
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:209
FormData_pg_opclass * Form_pg_opclass
Definition: pg_opclass.h:83
uintptr_t Datum
Definition: postgres.h:64
static Datum ObjectIdGetDatum(Oid X)
Definition: postgres.h:252
static Pointer DatumGetPointer(Datum X)
Definition: postgres.h:312
#define RelationGetNumberOfAttributes(relation)
Definition: rel.h:509
void generate_operator_clause(StringInfo buf, const char *leftop, Oid leftoptype, Oid opoid, const char *rightop, Oid rightoptype)
Definition: ruleutils.c:12159
uint64 SPI_processed
Definition: spi.c:45
SPITupleTable * SPI_tuptable
Definition: spi.c:46
int SPI_connect(void)
Definition: spi.c:95
int SPI_finish(void)
Definition: spi.c:183
int SPI_exec(const char *src, long tcount)
Definition: spi.c:628
char * SPI_getvalue(HeapTuple tuple, TupleDesc tupdesc, int fnumber)
Definition: spi.c:1218
int SPI_execute(const char *src, bool read_only, long tcount)
Definition: spi.c:594
#define SPI_OK_UTILITY
Definition: spi.h:85
#define SPI_OK_INSERT
Definition: spi.h:88
#define SPI_OK_DELETE
Definition: spi.h:89
#define SPI_OK_CONNECT
Definition: spi.h:82
#define SPI_OK_FINISH
Definition: spi.h:83
#define SPI_OK_SELECT
Definition: spi.h:86
#define BTEqualStrategyNumber
Definition: stratnum.h:31
void resetStringInfo(StringInfo str)
Definition: stringinfo.c:75
struct HeapTupleData * rd_indextuple
Definition: rel.h:192
TupleDesc rd_att
Definition: rel.h:111
TupleDesc tupdesc
Definition: spi.h:25
HeapTuple * vals
Definition: spi.h:26
Definition: c.h:710
Oid values[FLEXIBLE_ARRAY_MEMBER]
Definition: c.h:717
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:866
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:818
Datum SysCacheGetAttrNotNull(int cacheId, HeapTuple tup, AttrNumber attributeNumber)
Definition: syscache.c:1110
@ INDEXRELID
Definition: syscache.h:66
@ CLAOID
Definition: syscache.h:48
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92

References appendStringInfo(), appendStringInfoString(), Assert(), attnum, BTEqualStrategyNumber, CLAOID, CloseMatViewIncrementalMaintenance(), StringInfoData::data, DatumGetPointer(), elog(), ereport, errcode(), errdetail(), errmsg(), ERROR, generate_operator_clause(), get_namespace_name(), get_opfamily_member(), GETSTRUCT, HeapTupleIsValid, i, index_close(), index_open(), INDEXRELID, initStringInfo(), is_usable_unique_index(), lfirst_oid, list_free(), make_temptable_name_n(), NameStr, NoLock, ObjectIdGetDatum(), OidIsValid, OpenMatViewIncrementalMaintenance(), palloc0(), quote_qualified_identifier(), RelationData::rd_att, RelationData::rd_index, RelationData::rd_indextuple, RelationGetIndexList(), RelationGetNamespace, RelationGetNumberOfAttributes, RelationGetRelationName, ReleaseSysCache(), resetStringInfo(), RowExclusiveLock, SearchSysCache1(), SECURITY_LOCAL_USERID_CHANGE, SECURITY_RESTRICTED_OPERATION, SetUserIdAndSecContext(), SPI_connect(), SPI_exec(), SPI_execute(), SPI_finish(), SPI_getvalue(), SPI_OK_CONNECT, SPI_OK_DELETE, SPI_OK_FINISH, SPI_OK_INSERT, SPI_OK_SELECT, SPI_OK_UTILITY, SPI_processed, SPI_tuptable, SysCacheGetAttrNotNull(), table_close(), table_open(), SPITupleTable::tupdesc, TupleDescAttr, SPITupleTable::vals, and oidvector::values.

Referenced by ExecRefreshMatView().

◆ refresh_matview_datafill()

static uint64 refresh_matview_datafill ( DestReceiver dest,
Query query,
const char *  queryString 
)
static

Definition at line 377 of file matview.c.

379 {
380  List *rewritten;
381  PlannedStmt *plan;
382  QueryDesc *queryDesc;
383  Query *copied_query;
384  uint64 processed;
385 
386  /* Lock and rewrite, using a copy to preserve the original query. */
387  copied_query = copyObject(query);
388  AcquireRewriteLocks(copied_query, true, false);
389  rewritten = QueryRewrite(copied_query);
390 
391  /* SELECT should never rewrite to more or less than one SELECT query */
392  if (list_length(rewritten) != 1)
393  elog(ERROR, "unexpected rewrite result for REFRESH MATERIALIZED VIEW");
394  query = (Query *) linitial(rewritten);
395 
396  /* Check for user-requested abort. */
398 
399  /* Plan the query which will generate data for the refresh. */
400  plan = pg_plan_query(query, queryString, CURSOR_OPT_PARALLEL_OK, NULL);
401 
402  /*
403  * Use a snapshot with an updated command ID to ensure this query sees
404  * results of any previously executed queries. (This could only matter if
405  * the planner executed an allegedly-stable function that changed the
406  * database contents, but let's do it anyway to be safe.)
407  */
410 
411  /* Create a QueryDesc, redirecting output to our tuple receiver */
412  queryDesc = CreateQueryDesc(plan, queryString,
414  dest, NULL, NULL, 0);
415 
416  /* call ExecutorStart to prepare the plan for execution */
417  ExecutorStart(queryDesc, 0);
418 
419  /* run the plan */
420  ExecutorRun(queryDesc, ForwardScanDirection, 0, true);
421 
422  processed = queryDesc->estate->es_processed;
423 
424  /* and clean up */
425  ExecutorFinish(queryDesc);
426  ExecutorEnd(queryDesc);
427 
428  FreeQueryDesc(queryDesc);
429 
431 
432  return processed;
433 }
void ExecutorEnd(QueryDesc *queryDesc)
Definition: execMain.c:462
void ExecutorFinish(QueryDesc *queryDesc)
Definition: execMain.c:402
void ExecutorStart(QueryDesc *queryDesc, int eflags)
Definition: execMain.c:132
void ExecutorRun(QueryDesc *queryDesc, ScanDirection direction, uint64 count, bool execute_once)
Definition: execMain.c:301
#define CHECK_FOR_INTERRUPTS()
Definition: miscadmin.h:121
#define copyObject(obj)
Definition: nodes.h:244
#define CURSOR_OPT_PARALLEL_OK
Definition: parsenodes.h:3124
#define linitial(l)
Definition: pg_list.h:178
PlannedStmt * pg_plan_query(Query *querytree, const char *query_string, int cursorOptions, ParamListInfo boundParams)
Definition: postgres.c:852
void FreeQueryDesc(QueryDesc *qdesc)
Definition: pquery.c:105
QueryDesc * CreateQueryDesc(PlannedStmt *plannedstmt, const char *sourceText, Snapshot snapshot, Snapshot crosscheck_snapshot, DestReceiver *dest, ParamListInfo params, QueryEnvironment *queryEnv, int instrument_options)
Definition: pquery.c:67
void AcquireRewriteLocks(Query *parsetree, bool forExecute, bool forUpdatePushedDown)
List * QueryRewrite(Query *parsetree)
@ ForwardScanDirection
Definition: sdir.h:28
void UpdateActiveSnapshotCommandId(void)
Definition: snapmgr.c:747
void PopActiveSnapshot(void)
Definition: snapmgr.c:778
void PushCopiedSnapshot(Snapshot snapshot)
Definition: snapmgr.c:735
Snapshot GetActiveSnapshot(void)
Definition: snapmgr.c:805
#define InvalidSnapshot
Definition: snapshot.h:123
uint64 es_processed
Definition: execnodes.h:664
EState * estate
Definition: execdesc.h:48

References AcquireRewriteLocks(), CHECK_FOR_INTERRUPTS, copyObject, CreateQueryDesc(), CURSOR_OPT_PARALLEL_OK, generate_unaccent_rules::dest, elog(), ERROR, EState::es_processed, QueryDesc::estate, ExecutorEnd(), ExecutorFinish(), ExecutorRun(), ExecutorStart(), ForwardScanDirection, FreeQueryDesc(), GetActiveSnapshot(), InvalidSnapshot, linitial, list_length(), pg_plan_query(), PopActiveSnapshot(), PushCopiedSnapshot(), QueryRewrite(), and UpdateActiveSnapshotCommandId().

Referenced by ExecRefreshMatView().

◆ SetMatViewPopulatedState()

void SetMatViewPopulatedState ( Relation  relation,
bool  newstate 
)

Definition at line 84 of file matview.c.

85 {
86  Relation pgrel;
87  HeapTuple tuple;
88 
89  Assert(relation->rd_rel->relkind == RELKIND_MATVIEW);
90 
91  /*
92  * Update relation's pg_class entry. Crucial side-effect: other backends
93  * (and this one too!) are sent SI message to make them rebuild relcache
94  * entries.
95  */
96  pgrel = table_open(RelationRelationId, RowExclusiveLock);
99  if (!HeapTupleIsValid(tuple))
100  elog(ERROR, "cache lookup failed for relation %u",
101  RelationGetRelid(relation));
102 
103  ((Form_pg_class) GETSTRUCT(tuple))->relispopulated = newstate;
104 
105  CatalogTupleUpdate(pgrel, &tuple->t_self, tuple);
106 
107  heap_freetuple(tuple);
109 
110  /*
111  * Advance command counter to make the updated pg_class row locally
112  * visible.
113  */
115 }
void heap_freetuple(HeapTuple htup)
Definition: heaptuple.c:1338
void CatalogTupleUpdate(Relation heapRel, ItemPointer otid, HeapTuple tup)
Definition: indexing.c:313
FormData_pg_class * Form_pg_class
Definition: pg_class.h:153
static struct state * newstate(struct nfa *nfa)
Definition: regc_nfa.c:137
#define RelationGetRelid(relation)
Definition: rel.h:503
ItemPointerData t_self
Definition: htup.h:65
#define SearchSysCacheCopy1(cacheId, key1)
Definition: syscache.h:182
@ RELOID
Definition: syscache.h:89
void CommandCounterIncrement(void)
Definition: xact.c:1078

References Assert(), CatalogTupleUpdate(), CommandCounterIncrement(), elog(), ERROR, GETSTRUCT, heap_freetuple(), HeapTupleIsValid, newstate(), ObjectIdGetDatum(), RelationData::rd_rel, RelationGetRelid, RELOID, RowExclusiveLock, SearchSysCacheCopy1, HeapTupleData::t_self, table_close(), and table_open().

Referenced by ExecRefreshMatView(), and intorel_startup().

◆ transientrel_destroy()

static void transientrel_destroy ( DestReceiver self)
static

Definition at line 525 of file matview.c.

526 {
527  pfree(self);
528 }
void pfree(void *pointer)
Definition: mcxt.c:1436

References pfree().

Referenced by CreateTransientRelDestReceiver().

◆ transientrel_receive()

static bool transientrel_receive ( TupleTableSlot slot,
DestReceiver self 
)
static

Definition at line 480 of file matview.c.

481 {
482  DR_transientrel *myState = (DR_transientrel *) self;
483 
484  /*
485  * Note that the input slot might not be of the type of the target
486  * relation. That's supported by table_tuple_insert(), but slightly less
487  * efficient than inserting with the right slot - but the alternative
488  * would be to copy into a slot of the right type, which would not be
489  * cheap either. This also doesn't allow accessing per-AM data (say a
490  * tuple's xmin), but since we don't do that here...
491  */
492 
494  slot,
495  myState->output_cid,
496  myState->ti_options,
497  myState->bistate);
498 
499  /* We know this is a newly created relation, so there are no indexes */
500 
501  return true;
502 }
Relation transientrel
Definition: matview.c:55
BulkInsertState bistate
Definition: matview.c:58
CommandId output_cid
Definition: matview.c:56
int ti_options
Definition: matview.c:57
static void table_tuple_insert(Relation rel, TupleTableSlot *slot, CommandId cid, int options, struct BulkInsertStateData *bistate)
Definition: tableam.h:1399

References DR_transientrel::bistate, DR_transientrel::output_cid, table_tuple_insert(), DR_transientrel::ti_options, and DR_transientrel::transientrel.

Referenced by CreateTransientRelDestReceiver().

◆ transientrel_shutdown()

static void transientrel_shutdown ( DestReceiver self)
static

Definition at line 508 of file matview.c.

509 {
510  DR_transientrel *myState = (DR_transientrel *) self;
511 
512  FreeBulkInsertState(myState->bistate);
513 
515 
516  /* close transientrel, but keep lock until commit */
517  table_close(myState->transientrel, NoLock);
518  myState->transientrel = NULL;
519 }
void FreeBulkInsertState(BulkInsertState bistate)
Definition: heapam.c:1784
static void table_finish_bulk_insert(Relation rel, int options)
Definition: tableam.h:1600

References DR_transientrel::bistate, FreeBulkInsertState(), NoLock, table_close(), table_finish_bulk_insert(), DR_transientrel::ti_options, and DR_transientrel::transientrel.

Referenced by CreateTransientRelDestReceiver().

◆ transientrel_startup()

static void transientrel_startup ( DestReceiver self,
int  operation,
TupleDesc  typeinfo 
)
static

Definition at line 454 of file matview.c.

455 {
456  DR_transientrel *myState = (DR_transientrel *) self;
457  Relation transientrel;
458 
459  transientrel = table_open(myState->transientoid, NoLock);
460 
461  /*
462  * Fill private fields of myState for use by later routines
463  */
464  myState->transientrel = transientrel;
465  myState->output_cid = GetCurrentCommandId(true);
467  myState->bistate = GetBulkInsertState();
468 
469  /*
470  * Valid smgr_targblock implies something already wrote to the relation.
471  * This may be harmless, but this function hasn't planned for it.
472  */
474 }
#define InvalidBlockNumber
Definition: block.h:33
BulkInsertState GetBulkInsertState(void)
Definition: heapam.c:1770
#define RelationGetTargetBlock(relation)
Definition: rel.h:601
Oid transientoid
Definition: matview.c:53
#define TABLE_INSERT_FROZEN
Definition: tableam.h:253
#define TABLE_INSERT_SKIP_FSM
Definition: tableam.h:252
CommandId GetCurrentCommandId(bool used)
Definition: xact.c:818

References Assert(), DR_transientrel::bistate, GetBulkInsertState(), GetCurrentCommandId(), InvalidBlockNumber, NoLock, DR_transientrel::output_cid, RelationGetTargetBlock, TABLE_INSERT_FROZEN, TABLE_INSERT_SKIP_FSM, table_open(), DR_transientrel::ti_options, DR_transientrel::transientoid, and DR_transientrel::transientrel.

Referenced by CreateTransientRelDestReceiver().

Variable Documentation

◆ matview_maintenance_depth

int matview_maintenance_depth = 0
static