PostgreSQL Source Code  git master
vacuum.h File Reference
#include "access/htup.h"
#include "catalog/pg_statistic.h"
#include "catalog/pg_type.h"
#include "nodes/parsenodes.h"
#include "storage/buf.h"
#include "storage/lock.h"
#include "utils/relcache.h"
Include dependency graph for vacuum.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures

struct  VacAttrStats
 
struct  VacuumParams
 

Typedefs

typedef struct VacAttrStatsVacAttrStatsP
 
typedef Datum(* AnalyzeAttrFetchFunc) (VacAttrStatsP stats, int rownum, bool *isNull)
 
typedef void(* AnalyzeAttrComputeStatsFunc) (VacAttrStatsP stats, AnalyzeAttrFetchFunc fetchfunc, int samplerows, double totalrows)
 
typedef struct VacAttrStats VacAttrStats
 
typedef struct VacuumParams VacuumParams
 

Functions

void ExecVacuum (VacuumStmt *vacstmt, bool isTopLevel)
 
void vacuum (int options, List *relations, VacuumParams *params, BufferAccessStrategy bstrategy, bool isTopLevel)
 
void vac_open_indexes (Relation relation, LOCKMODE lockmode, int *nindexes, Relation **Irel)
 
void vac_close_indexes (int nindexes, Relation *Irel, LOCKMODE lockmode)
 
double vac_estimate_reltuples (Relation relation, BlockNumber total_pages, BlockNumber scanned_pages, double scanned_tuples)
 
void vac_update_relstats (Relation relation, BlockNumber num_pages, double num_tuples, BlockNumber num_all_visible_pages, bool hasindex, TransactionId frozenxid, MultiXactId minmulti, bool in_outer_xact)
 
void vacuum_set_xid_limits (Relation rel, int freeze_min_age, int freeze_table_age, int multixact_freeze_min_age, int multixact_freeze_table_age, TransactionId *oldestXmin, TransactionId *freezeLimit, TransactionId *xidFullScanLimit, MultiXactId *multiXactCutoff, MultiXactId *mxactFullScanLimit)
 
void vac_update_datfrozenxid (void)
 
void vacuum_delay_point (void)
 
void lazy_vacuum_rel (Relation onerel, int options, VacuumParams *params, BufferAccessStrategy bstrategy)
 
void analyze_rel (Oid relid, RangeVar *relation, int options, VacuumParams *params, List *va_cols, bool in_outer_xact, BufferAccessStrategy bstrategy)
 
bool std_typanalyze (VacAttrStats *stats)
 
double anl_random_fract (void)
 
double anl_init_selection_state (int n)
 
double anl_get_next_S (double t, int n, double *stateptr)
 

Variables

PGDLLIMPORT int default_statistics_target
 
int vacuum_freeze_min_age
 
int vacuum_freeze_table_age
 
int vacuum_multixact_freeze_min_age
 
int vacuum_multixact_freeze_table_age
 

Typedef Documentation

◆ AnalyzeAttrComputeStatsFunc

typedef void(* AnalyzeAttrComputeStatsFunc) (VacAttrStatsP stats, AnalyzeAttrFetchFunc fetchfunc, int samplerows, double totalrows)

Definition at line 64 of file vacuum.h.

◆ AnalyzeAttrFetchFunc

typedef Datum(* AnalyzeAttrFetchFunc) (VacAttrStatsP stats, int rownum, bool *isNull)

Definition at line 61 of file vacuum.h.

◆ VacAttrStats

◆ VacAttrStatsP

Definition at line 59 of file vacuum.h.

◆ VacuumParams

Function Documentation

◆ analyze_rel()

void analyze_rel ( Oid  relid,
RangeVar relation,
int  options,
VacuumParams params,
List va_cols,
bool  in_outer_xact,
BufferAccessStrategy  bstrategy 
)

Definition at line 115 of file analyze.c.

References acquire_sample_rows(), FdwRoutine::AnalyzeForeignTable, CHECK_FOR_INTERRUPTS, ConditionalLockRelationOid(), DEBUG2, do_analyze_rel(), elevel, ereport, errcode(), ERRCODE_UNDEFINED_TABLE, errmsg(), GetFdwRoutineForRelation(), GetUserId(), INFO, IsAutoVacuumWorkerProcess(), LOG, VacuumParams::log_min_duration, LW_EXCLUSIVE, LWLockAcquire(), LWLockRelease(), MyDatabaseId, MyPgXact, NoLock, pg_class_ownercheck(), pg_database_ownercheck(), PROC_IN_ANALYZE, RelationData::rd_rel, relation_close(), RELATION_IS_OTHER_TEMP, RelationGetNumberOfBlocks, RelationGetRelationName, RelationGetRelid, RangeVar::relname, relpages, ShareUpdateExclusiveLock, try_relation_open(), VACOPT_NOWAIT, VACOPT_VACUUM, VACOPT_VERBOSE, PGXACT::vacuumFlags, and WARNING.

Referenced by vacuum().

118 {
119  Relation onerel;
120  int elevel;
121  AcquireSampleRowsFunc acquirefunc = NULL;
122  BlockNumber relpages = 0;
123  bool rel_lock = true;
124 
125  /* Select logging level */
126  if (options & VACOPT_VERBOSE)
127  elevel = INFO;
128  else
129  elevel = DEBUG2;
130 
131  /* Set up static variables */
132  vac_strategy = bstrategy;
133 
134  /*
135  * Check for user-requested abort.
136  */
138 
139  /*
140  * Open the relation, getting ShareUpdateExclusiveLock to ensure that two
141  * ANALYZEs don't run on it concurrently. (This also locks out a
142  * concurrent VACUUM, which doesn't matter much at the moment but might
143  * matter if we ever try to accumulate stats on dead tuples.) If the rel
144  * has been dropped since we last saw it, we don't need to process it.
145  */
146  if (!(options & VACOPT_NOWAIT))
149  onerel = try_relation_open(relid, NoLock);
150  else
151  {
152  onerel = NULL;
153  rel_lock = false;
154  }
155 
156  /*
157  * If we failed to open or lock the relation, emit a log message before
158  * exiting.
159  */
160  if (!onerel)
161  {
162  /*
163  * If the RangeVar is not defined, we do not have enough information
164  * to provide a meaningful log statement. Chances are that
165  * analyze_rel's caller has intentionally not provided this
166  * information so that this logging is skipped, anyway.
167  */
168  if (relation == NULL)
169  return;
170 
171  /*
172  * Determine the log level. For autovacuum logs, we emit a LOG if
173  * log_autovacuum_min_duration is not disabled. For manual ANALYZE,
174  * we emit a WARNING to match the log statements in the permissions
175  * checks.
176  */
178  elevel = WARNING;
179  else if (params->log_min_duration >= 0)
180  elevel = LOG;
181  else
182  return;
183 
184  if (!rel_lock)
185  ereport(elevel,
186  (errcode(ERRCODE_LOCK_NOT_AVAILABLE),
187  errmsg("skipping analyze of \"%s\" --- lock not available",
188  relation->relname)));
189  else
190  ereport(elevel,
192  errmsg("skipping analyze of \"%s\" --- relation no longer exists",
193  relation->relname)));
194 
195  return;
196  }
197 
198  /*
199  * Check permissions --- this should match vacuum's check!
200  */
201  if (!(pg_class_ownercheck(RelationGetRelid(onerel), GetUserId()) ||
202  (pg_database_ownercheck(MyDatabaseId, GetUserId()) && !onerel->rd_rel->relisshared)))
203  {
204  /* No need for a WARNING if we already complained during VACUUM */
205  if (!(options & VACOPT_VACUUM))
206  {
207  if (onerel->rd_rel->relisshared)
209  (errmsg("skipping \"%s\" --- only superuser can analyze it",
210  RelationGetRelationName(onerel))));
211  else if (onerel->rd_rel->relnamespace == PG_CATALOG_NAMESPACE)
213  (errmsg("skipping \"%s\" --- only superuser or database owner can analyze it",
214  RelationGetRelationName(onerel))));
215  else
217  (errmsg("skipping \"%s\" --- only table or database owner can analyze it",
218  RelationGetRelationName(onerel))));
219  }
221  return;
222  }
223 
224  /*
225  * Silently ignore tables that are temp tables of other backends ---
226  * trying to analyze these is rather pointless, since their contents are
227  * probably not up-to-date on disk. (We don't throw a warning here; it
228  * would just lead to chatter during a database-wide ANALYZE.)
229  */
230  if (RELATION_IS_OTHER_TEMP(onerel))
231  {
233  return;
234  }
235 
236  /*
237  * We can ANALYZE any table except pg_statistic. See update_attstats
238  */
239  if (RelationGetRelid(onerel) == StatisticRelationId)
240  {
242  return;
243  }
244 
245  /*
246  * Check that it's of an analyzable relkind, and set up appropriately.
247  */
248  if (onerel->rd_rel->relkind == RELKIND_RELATION ||
249  onerel->rd_rel->relkind == RELKIND_MATVIEW)
250  {
251  /* Regular table, so we'll use the regular row acquisition function */
252  acquirefunc = acquire_sample_rows;
253  /* Also get regular table's size */
254  relpages = RelationGetNumberOfBlocks(onerel);
255  }
256  else if (onerel->rd_rel->relkind == RELKIND_FOREIGN_TABLE)
257  {
258  /*
259  * For a foreign table, call the FDW's hook function to see whether it
260  * supports analysis.
261  */
262  FdwRoutine *fdwroutine;
263  bool ok = false;
264 
265  fdwroutine = GetFdwRoutineForRelation(onerel, false);
266 
267  if (fdwroutine->AnalyzeForeignTable != NULL)
268  ok = fdwroutine->AnalyzeForeignTable(onerel,
269  &acquirefunc,
270  &relpages);
271 
272  if (!ok)
273  {
275  (errmsg("skipping \"%s\" --- cannot analyze this foreign table",
276  RelationGetRelationName(onerel))));
278  return;
279  }
280  }
281  else if (onerel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
282  {
283  /*
284  * For partitioned tables, we want to do the recursive ANALYZE below.
285  */
286  }
287  else
288  {
289  /* No need for a WARNING if we already complained during VACUUM */
290  if (!(options & VACOPT_VACUUM))
292  (errmsg("skipping \"%s\" --- cannot analyze non-tables or special system tables",
293  RelationGetRelationName(onerel))));
295  return;
296  }
297 
298  /*
299  * OK, let's do it. First let other backends know I'm in ANALYZE.
300  */
301  LWLockAcquire(ProcArrayLock, LW_EXCLUSIVE);
303  LWLockRelease(ProcArrayLock);
304 
305  /*
306  * Do the normal non-recursive ANALYZE. We can skip this for partitioned
307  * tables, which don't contain any rows.
308  */
309  if (onerel->rd_rel->relkind != RELKIND_PARTITIONED_TABLE)
310  do_analyze_rel(onerel, options, params, va_cols, acquirefunc,
311  relpages, false, in_outer_xact, elevel);
312 
313  /*
314  * If there are child tables, do recursive ANALYZE.
315  */
316  if (onerel->rd_rel->relhassubclass)
317  do_analyze_rel(onerel, options, params, va_cols, acquirefunc, relpages,
318  true, in_outer_xact, elevel);
319 
320  /*
321  * Close source relation now, but keep lock so that no one deletes it
322  * before we commit. (If someone did, they'd fail to clean up the entries
323  * we made in pg_statistic. Also, releasing the lock before commit would
324  * expose us to concurrent-update failures in update_attstats.)
325  */
326  relation_close(onerel, NoLock);
327 
328  /*
329  * Reset my PGXACT flag. Note: we need this here, and not in vacuum_rel,
330  * because the vacuum flag is cleared by the end-of-xact code.
331  */
332  LWLockAcquire(ProcArrayLock, LW_EXCLUSIVE);
334  LWLockRelease(ProcArrayLock);
335 }
bool ConditionalLockRelationOid(Oid relid, LOCKMODE lockmode)
Definition: lmgr.c:138
#define ERRCODE_UNDEFINED_TABLE
Definition: pgbench.c:62
Relation try_relation_open(Oid relationId, LOCKMODE lockmode)
Definition: heapam.c:1157
Oid GetUserId(void)
Definition: miscinit.c:379
AnalyzeForeignTable_function AnalyzeForeignTable
Definition: fdwapi.h:233
int errcode(int sqlerrcode)
Definition: elog.c:575
void relation_close(Relation relation, LOCKMODE lockmode)
Definition: heapam.c:1270
#define INFO
Definition: elog.h:33
static BufferAccessStrategy vac_strategy
Definition: analyze.c:81
uint32 BlockNumber
Definition: block.h:31
#define LOG
Definition: elog.h:26
Form_pg_class rd_rel
Definition: rel.h:84
int32 relpages
Definition: pg_class.h:43
PGXACT * MyPgXact
Definition: proc.c:68
uint8 vacuumFlags
Definition: proc.h:230
void LWLockRelease(LWLock *lock)
Definition: lwlock.c:1725
char * relname
Definition: primnodes.h:69
#define DEBUG2
Definition: elog.h:24
#define NoLock
Definition: lockdefs.h:34
#define RelationGetRelationName(relation)
Definition: rel.h:441
bool IsAutoVacuumWorkerProcess(void)
Definition: autovacuum.c:3295
#define ereport(elevel, rest)
Definition: elog.h:122
bool pg_database_ownercheck(Oid db_oid, Oid roleid)
Definition: aclchk.c:5166
#define WARNING
Definition: elog.h:40
static void do_analyze_rel(Relation onerel, int options, VacuumParams *params, List *va_cols, AcquireSampleRowsFunc acquirefunc, BlockNumber relpages, bool inh, bool in_outer_xact, int elevel)
Definition: analyze.c:345
static int elevel
Definition: vacuumlazy.c:144
Oid MyDatabaseId
Definition: globals.c:86
#define RelationGetNumberOfBlocks(reln)
Definition: bufmgr.h:199
#define ShareUpdateExclusiveLock
Definition: lockdefs.h:39
#define RELATION_IS_OTHER_TEMP(relation)
Definition: rel.h:538
bool pg_class_ownercheck(Oid class_oid, Oid roleid)
Definition: aclchk.c:4748
bool LWLockAcquire(LWLock *lock, LWLockMode mode)
Definition: lwlock.c:1121
int log_min_duration
Definition: vacuum.h:145
int(* AcquireSampleRowsFunc)(Relation relation, int elevel, HeapTuple *rows, int targrows, double *totalrows, double *totaldeadrows)
Definition: fdwapi.h:141
int errmsg(const char *fmt,...)
Definition: elog.c:797
FdwRoutine * GetFdwRoutineForRelation(Relation relation, bool makecopy)
Definition: foreign.c:395
#define PROC_IN_ANALYZE
Definition: proc.h:55
#define CHECK_FOR_INTERRUPTS()
Definition: miscadmin.h:98
#define RelationGetRelid(relation)
Definition: rel.h:407
static int acquire_sample_rows(Relation onerel, int elevel, HeapTuple *rows, int targrows, double *totalrows, double *totaldeadrows)
Definition: analyze.c:1042

◆ anl_get_next_S()

double anl_get_next_S ( double  t,
int  n,
double *  stateptr 
)

Definition at line 284 of file sampling.c.

285 {
286  double result;
287 
288  oldrs.W = *stateptr;
289  result = reservoir_get_next_S(&oldrs, t, n);
290  *stateptr = oldrs.W;
291  return result;
292 }
static ReservoirStateData oldrs
Definition: sampling.c:259
double reservoir_get_next_S(ReservoirState rs, double t, int n)
Definition: sampling.c:142

◆ anl_init_selection_state()

double anl_init_selection_state ( int  n)

Definition at line 273 of file sampling.c.

274 {
275  /* initialize if first time through */
276  if (oldrs.randstate[0] == 0)
278 
279  /* Initial value of W (for use when Algorithm Z is first applied) */
280  return exp(-log(sampler_random_fract(oldrs.randstate)) / n);
281 }
void sampler_random_init_state(long seed, SamplerRandomState randstate)
Definition: sampling.c:229
long random(void)
Definition: random.c:22
double sampler_random_fract(SamplerRandomState randstate)
Definition: sampling.c:238
static ReservoirStateData oldrs
Definition: sampling.c:259
SamplerRandomState randstate
Definition: sampling.h:50

◆ anl_random_fract()

double anl_random_fract ( void  )

Definition at line 262 of file sampling.c.

263 {
264  /* initialize if first time through */
265  if (oldrs.randstate[0] == 0)
267 
268  /* and compute a random fraction */
270 }
void sampler_random_init_state(long seed, SamplerRandomState randstate)
Definition: sampling.c:229
long random(void)
Definition: random.c:22
double sampler_random_fract(SamplerRandomState randstate)
Definition: sampling.c:238
static ReservoirStateData oldrs
Definition: sampling.c:259
SamplerRandomState randstate
Definition: sampling.h:50

◆ ExecVacuum()

void ExecVacuum ( VacuumStmt vacstmt,
bool  isTopLevel 
)

Definition at line 87 of file vacuum.c.

References Assert, ereport, errcode(), errmsg(), ERROR, VacuumParams::freeze_min_age, VacuumParams::freeze_table_age, VacuumParams::is_wraparound, lfirst_node, VacuumParams::log_min_duration, VacuumParams::multixact_freeze_min_age, VacuumParams::multixact_freeze_table_age, NIL, VacuumStmt::options, VacuumStmt::rels, VacuumRelation::va_cols, VACOPT_ANALYZE, VACOPT_FREEZE, VACOPT_FULL, VACOPT_SKIPTOAST, VACOPT_VACUUM, and vacuum().

Referenced by standard_ProcessUtility().

88 {
89  VacuumParams params;
90 
91  /* sanity checks on options */
93  Assert((vacstmt->options & VACOPT_VACUUM) ||
94  !(vacstmt->options & (VACOPT_FULL | VACOPT_FREEZE)));
95  Assert(!(vacstmt->options & VACOPT_SKIPTOAST));
96 
97  /*
98  * Make sure VACOPT_ANALYZE is specified if any column lists are present.
99  */
100  if (!(vacstmt->options & VACOPT_ANALYZE))
101  {
102  ListCell *lc;
103 
104  foreach(lc, vacstmt->rels)
105  {
107 
108  if (vrel->va_cols != NIL)
109  ereport(ERROR,
110  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
111  errmsg("ANALYZE option must be specified when a column list is provided")));
112  }
113  }
114 
115  /*
116  * All freeze ages are zero if the FREEZE option is given; otherwise pass
117  * them as -1 which means to use the default values.
118  */
119  if (vacstmt->options & VACOPT_FREEZE)
120  {
121  params.freeze_min_age = 0;
122  params.freeze_table_age = 0;
123  params.multixact_freeze_min_age = 0;
124  params.multixact_freeze_table_age = 0;
125  }
126  else
127  {
128  params.freeze_min_age = -1;
129  params.freeze_table_age = -1;
130  params.multixact_freeze_min_age = -1;
131  params.multixact_freeze_table_age = -1;
132  }
133 
134  /* user-invoked vacuum is never "for wraparound" */
135  params.is_wraparound = false;
136 
137  /* user-invoked vacuum never uses this parameter */
138  params.log_min_duration = -1;
139 
140  /* Now go through the common routine */
141  vacuum(vacstmt->options, vacstmt->rels, &params, NULL, isTopLevel);
142 }
#define NIL
Definition: pg_list.h:69
int multixact_freeze_table_age
Definition: vacuum.h:142
int errcode(int sqlerrcode)
Definition: elog.c:575
int freeze_table_age
Definition: vacuum.h:139
void vacuum(int options, List *relations, VacuumParams *params, BufferAccessStrategy bstrategy, bool isTopLevel)
Definition: vacuum.c:166
#define ERROR
Definition: elog.h:43
int freeze_min_age
Definition: vacuum.h:138
bool is_wraparound
Definition: vacuum.h:144
#define lfirst_node(type, lc)
Definition: pg_list.h:109
#define ereport(elevel, rest)
Definition: elog.h:122
#define Assert(condition)
Definition: c.h:699
int log_min_duration
Definition: vacuum.h:145
int errmsg(const char *fmt,...)
Definition: elog.c:797
int multixact_freeze_min_age
Definition: vacuum.h:140
List * rels
Definition: parsenodes.h:3162

◆ lazy_vacuum_rel()

void lazy_vacuum_rel ( Relation  onerel,
int  options,
VacuumParams params,
BufferAccessStrategy  bstrategy 
)

Definition at line 190 of file vacuumlazy.c.

References _, appendStringInfo(), Assert, buf, StringInfoData::data, DEBUG2, elevel, ereport, errmsg_internal(), VacuumParams::freeze_min_age, VacuumParams::freeze_table_age, FreezeLimit, LVRelStats::frozenskipped_pages, get_database_name(), get_namespace_name(), GetCurrentTimestamp(), LVRelStats::hasindex, INFO, initStringInfo(), InvalidMultiXactId, InvalidTransactionId, IsAutoVacuumWorkerProcess(), lazy_scan_heap(), lazy_truncate_heap(), LVRelStats::lock_waiter_detected, LOG, VacuumParams::log_min_duration, VacuumParams::multixact_freeze_min_age, VacuumParams::multixact_freeze_table_age, MultiXactCutoff, MultiXactIdPrecedesOrEquals(), MyDatabaseId, LVRelStats::new_dead_tuples, LVRelStats::new_live_tuples, LVRelStats::new_rel_tuples, NoLock, LVRelStats::num_index_scans, LVRelStats::old_live_tuples, LVRelStats::old_rel_pages, OldestXmin, LVRelStats::pages_removed, palloc0(), pfree(), pg_rusage_init(), pg_rusage_show(), pgstat_progress_end_command(), pgstat_progress_start_command(), pgstat_progress_update_param(), pgstat_report_vacuum(), LVRelStats::pinskipped_pages, PROGRESS_COMMAND_VACUUM, PROGRESS_VACUUM_PHASE, PROGRESS_VACUUM_PHASE_FINAL_CLEANUP, RelationData::rd_rel, LVRelStats::rel_pages, RelationGetNamespace, RelationGetRelationName, RelationGetRelid, RowExclusiveLock, LVRelStats::scanned_pages, should_attempt_truncation(), TimestampDifference(), TimestampDifferenceExceeds(), TransactionIdPrecedesOrEquals(), LVRelStats::tupcount_pages, LVRelStats::tuples_deleted, vac_close_indexes(), vac_open_indexes(), vac_update_relstats(), VACOPT_DISABLE_PAGE_SKIPPING, VACOPT_VERBOSE, vacuum_set_xid_limits(), VacuumPageDirty, VacuumPageHit, VacuumPageMiss, and visibilitymap_count().

Referenced by vacuum_rel().

192 {
193  LVRelStats *vacrelstats;
194  Relation *Irel;
195  int nindexes;
196  PGRUsage ru0;
197  TimestampTz starttime = 0;
198  long secs;
199  int usecs;
200  double read_rate,
201  write_rate;
202  bool aggressive; /* should we scan all unfrozen pages? */
203  bool scanned_all_unfrozen; /* actually scanned all such pages? */
204  TransactionId xidFullScanLimit;
205  MultiXactId mxactFullScanLimit;
206  BlockNumber new_rel_pages;
207  BlockNumber new_rel_allvisible;
208  double new_live_tuples;
209  TransactionId new_frozen_xid;
210  MultiXactId new_min_multi;
211 
212  Assert(params != NULL);
213 
214  /* measure elapsed time iff autovacuum logging requires it */
215  if (IsAutoVacuumWorkerProcess() && params->log_min_duration >= 0)
216  {
217  pg_rusage_init(&ru0);
218  starttime = GetCurrentTimestamp();
219  }
220 
221  if (options & VACOPT_VERBOSE)
222  elevel = INFO;
223  else
224  elevel = DEBUG2;
225 
227  RelationGetRelid(onerel));
228 
229  vac_strategy = bstrategy;
230 
231  vacuum_set_xid_limits(onerel,
232  params->freeze_min_age,
233  params->freeze_table_age,
234  params->multixact_freeze_min_age,
236  &OldestXmin, &FreezeLimit, &xidFullScanLimit,
237  &MultiXactCutoff, &mxactFullScanLimit);
238 
239  /*
240  * We request an aggressive scan if the table's frozen Xid is now older
241  * than or equal to the requested Xid full-table scan limit; or if the
242  * table's minimum MultiXactId is older than or equal to the requested
243  * mxid full-table scan limit; or if DISABLE_PAGE_SKIPPING was specified.
244  */
245  aggressive = TransactionIdPrecedesOrEquals(onerel->rd_rel->relfrozenxid,
246  xidFullScanLimit);
247  aggressive |= MultiXactIdPrecedesOrEquals(onerel->rd_rel->relminmxid,
248  mxactFullScanLimit);
250  aggressive = true;
251 
252  vacrelstats = (LVRelStats *) palloc0(sizeof(LVRelStats));
253 
254  vacrelstats->old_rel_pages = onerel->rd_rel->relpages;
255  vacrelstats->old_live_tuples = onerel->rd_rel->reltuples;
256  vacrelstats->num_index_scans = 0;
257  vacrelstats->pages_removed = 0;
258  vacrelstats->lock_waiter_detected = false;
259 
260  /* Open all indexes of the relation */
261  vac_open_indexes(onerel, RowExclusiveLock, &nindexes, &Irel);
262  vacrelstats->hasindex = (nindexes > 0);
263 
264  /* Do the vacuuming */
265  lazy_scan_heap(onerel, options, vacrelstats, Irel, nindexes, aggressive);
266 
267  /* Done with indexes */
268  vac_close_indexes(nindexes, Irel, NoLock);
269 
270  /*
271  * Compute whether we actually scanned the all unfrozen pages. If we did,
272  * we can adjust relfrozenxid and relminmxid.
273  *
274  * NB: We need to check this before truncating the relation, because that
275  * will change ->rel_pages.
276  */
277  if ((vacrelstats->scanned_pages + vacrelstats->frozenskipped_pages)
278  < vacrelstats->rel_pages)
279  {
280  Assert(!aggressive);
281  scanned_all_unfrozen = false;
282  }
283  else
284  scanned_all_unfrozen = true;
285 
286  /*
287  * Optionally truncate the relation.
288  */
289  if (should_attempt_truncation(vacrelstats))
290  lazy_truncate_heap(onerel, vacrelstats);
291 
292  /* Report that we are now doing final cleanup */
295 
296  /*
297  * Update statistics in pg_class.
298  *
299  * A corner case here is that if we scanned no pages at all because every
300  * page is all-visible, we should not update relpages/reltuples, because
301  * we have no new information to contribute. In particular this keeps us
302  * from replacing relpages=reltuples=0 (which means "unknown tuple
303  * density") with nonzero relpages and reltuples=0 (which means "zero
304  * tuple density") unless there's some actual evidence for the latter.
305  *
306  * It's important that we use tupcount_pages and not scanned_pages for the
307  * check described above; scanned_pages counts pages where we could not
308  * get cleanup lock, and which were processed only for frozenxid purposes.
309  *
310  * We do update relallvisible even in the corner case, since if the table
311  * is all-visible we'd definitely like to know that. But clamp the value
312  * to be not more than what we're setting relpages to.
313  *
314  * Also, don't change relfrozenxid/relminmxid if we skipped any pages,
315  * since then we don't know for certain that all tuples have a newer xmin.
316  */
317  new_rel_pages = vacrelstats->rel_pages;
318  new_live_tuples = vacrelstats->new_live_tuples;
319  if (vacrelstats->tupcount_pages == 0 && new_rel_pages > 0)
320  {
321  new_rel_pages = vacrelstats->old_rel_pages;
322  new_live_tuples = vacrelstats->old_live_tuples;
323  }
324 
325  visibilitymap_count(onerel, &new_rel_allvisible, NULL);
326  if (new_rel_allvisible > new_rel_pages)
327  new_rel_allvisible = new_rel_pages;
328 
329  new_frozen_xid = scanned_all_unfrozen ? FreezeLimit : InvalidTransactionId;
330  new_min_multi = scanned_all_unfrozen ? MultiXactCutoff : InvalidMultiXactId;
331 
332  vac_update_relstats(onerel,
333  new_rel_pages,
334  new_live_tuples,
335  new_rel_allvisible,
336  vacrelstats->hasindex,
337  new_frozen_xid,
338  new_min_multi,
339  false);
340 
341  /* report results to the stats collector, too */
343  onerel->rd_rel->relisshared,
344  new_live_tuples,
345  vacrelstats->new_dead_tuples);
347 
348  /* and log the action if appropriate */
349  if (IsAutoVacuumWorkerProcess() && params->log_min_duration >= 0)
350  {
351  TimestampTz endtime = GetCurrentTimestamp();
352 
353  if (params->log_min_duration == 0 ||
354  TimestampDifferenceExceeds(starttime, endtime,
355  params->log_min_duration))
356  {
358  char *msgfmt;
359 
360  TimestampDifference(starttime, endtime, &secs, &usecs);
361 
362  read_rate = 0;
363  write_rate = 0;
364  if ((secs > 0) || (usecs > 0))
365  {
366  read_rate = (double) BLCKSZ * VacuumPageMiss / (1024 * 1024) /
367  (secs + usecs / 1000000.0);
368  write_rate = (double) BLCKSZ * VacuumPageDirty / (1024 * 1024) /
369  (secs + usecs / 1000000.0);
370  }
371 
372  /*
373  * This is pretty messy, but we split it up so that we can skip
374  * emitting individual parts of the message when not applicable.
375  */
376  initStringInfo(&buf);
377  if (aggressive)
378  msgfmt = _("automatic aggressive vacuum of table \"%s.%s.%s\": index scans: %d\n");
379  else
380  msgfmt = _("automatic vacuum of table \"%s.%s.%s\": index scans: %d\n");
381  appendStringInfo(&buf, msgfmt,
384  RelationGetRelationName(onerel),
385  vacrelstats->num_index_scans);
386  appendStringInfo(&buf, _("pages: %u removed, %u remain, %u skipped due to pins, %u skipped frozen\n"),
387  vacrelstats->pages_removed,
388  vacrelstats->rel_pages,
389  vacrelstats->pinskipped_pages,
390  vacrelstats->frozenskipped_pages);
391  appendStringInfo(&buf,
392  _("tuples: %.0f removed, %.0f remain, %.0f are dead but not yet removable, oldest xmin: %u\n"),
393  vacrelstats->tuples_deleted,
394  vacrelstats->new_rel_tuples,
395  vacrelstats->new_dead_tuples,
396  OldestXmin);
397  appendStringInfo(&buf,
398  _("buffer usage: %d hits, %d misses, %d dirtied\n"),
402  appendStringInfo(&buf, _("avg read rate: %.3f MB/s, avg write rate: %.3f MB/s\n"),
403  read_rate, write_rate);
404  appendStringInfo(&buf, _("system usage: %s"), pg_rusage_show(&ru0));
405 
406  ereport(LOG,
407  (errmsg_internal("%s", buf.data)));
408  pfree(buf.data);
409  }
410  }
411 }
double new_rel_tuples
Definition: vacuumlazy.c:126
int multixact_freeze_table_age
Definition: vacuum.h:142
void vac_close_indexes(int nindexes, Relation *Irel, LOCKMODE lockmode)
Definition: vacuum.c:1651
BlockNumber rel_pages
Definition: vacuumlazy.c:120
uint32 TransactionId
Definition: c.h:474
void pgstat_progress_start_command(ProgressCommandType cmdtype, Oid relid)
Definition: pgstat.c:3072
TimestampTz GetCurrentTimestamp(void)
Definition: timestamp.c:1570
double tuples_deleted
Definition: vacuumlazy.c:130
int64 TimestampTz
Definition: timestamp.h:39
int VacuumPageHit
Definition: globals.c:144
void pgstat_progress_update_param(int index, int64 val)
Definition: pgstat.c:3093
BlockNumber tupcount_pages
Definition: vacuumlazy.c:124
static void lazy_scan_heap(Relation onerel, int options, LVRelStats *vacrelstats, Relation *Irel, int nindexes, bool aggressive)
Definition: vacuumlazy.c:463
BlockNumber scanned_pages
Definition: vacuumlazy.c:121
#define INFO
Definition: elog.h:33
void vacuum_set_xid_limits(Relation rel, int freeze_min_age, int freeze_table_age, int multixact_freeze_min_age, int multixact_freeze_table_age, TransactionId *oldestXmin, TransactionId *freezeLimit, TransactionId *xidFullScanLimit, MultiXactId *multiXactCutoff, MultiXactId *mxactFullScanLimit)
Definition: vacuum.c:593
uint32 BlockNumber
Definition: block.h:31
BlockNumber pinskipped_pages
Definition: vacuumlazy.c:122
void visibilitymap_count(Relation rel, BlockNumber *all_visible, BlockNumber *all_frozen)
#define LOG
Definition: elog.h:26
Form_pg_class rd_rel
Definition: rel.h:84
bool TimestampDifferenceExceeds(TimestampTz start_time, TimestampTz stop_time, int msec)
Definition: timestamp.c:1649
int freeze_table_age
Definition: vacuum.h:139
void pg_rusage_init(PGRUsage *ru0)
Definition: pg_rusage.c:27
BlockNumber old_rel_pages
Definition: vacuumlazy.c:119
void pfree(void *pointer)
Definition: mcxt.c:1031
void appendStringInfo(StringInfo str, const char *fmt,...)
Definition: stringinfo.c:78
bool TransactionIdPrecedesOrEquals(TransactionId id1, TransactionId id2)
Definition: transam.c:319
int freeze_min_age
Definition: vacuum.h:138
char * get_database_name(Oid dbid)
Definition: dbcommands.c:2056
#define DEBUG2
Definition: elog.h:24
static TransactionId FreezeLimit
Definition: vacuumlazy.c:147
char * get_namespace_name(Oid nspid)
Definition: lsyscache.c:3051
#define NoLock
Definition: lockdefs.h:34
static char * buf
Definition: pg_test_fsync.c:67
#define RowExclusiveLock
Definition: lockdefs.h:38
static MultiXactId MultiXactCutoff
Definition: vacuumlazy.c:148
const char * pg_rusage_show(const PGRUsage *ru0)
Definition: pg_rusage.c:40
#define InvalidTransactionId
Definition: transam.h:31
#define RelationGetRelationName(relation)
Definition: rel.h:441
static TransactionId OldestXmin
Definition: vacuumlazy.c:146
bool IsAutoVacuumWorkerProcess(void)
Definition: autovacuum.c:3295
#define ereport(elevel, rest)
Definition: elog.h:122
double new_live_tuples
Definition: vacuumlazy.c:127
void initStringInfo(StringInfo str)
Definition: stringinfo.c:46
void vac_open_indexes(Relation relation, LOCKMODE lockmode, int *nindexes, Relation **Irel)
Definition: vacuum.c:1608
static int elevel
Definition: vacuumlazy.c:144
bool hasindex
Definition: vacuumlazy.c:117
int VacuumPageDirty
Definition: globals.c:146
void * palloc0(Size size)
Definition: mcxt.c:955
void pgstat_progress_end_command(void)
Definition: pgstat.c:3144
Oid MyDatabaseId
Definition: globals.c:86
#define InvalidMultiXactId
Definition: multixact.h:23
static bool should_attempt_truncation(LVRelStats *vacrelstats)
Definition: vacuumlazy.c:1790
#define PROGRESS_VACUUM_PHASE_FINAL_CLEANUP
Definition: progress.h:35
int num_index_scans
Definition: vacuumlazy.c:137
double old_live_tuples
Definition: vacuumlazy.c:125
TransactionId MultiXactId
Definition: c.h:484
int errmsg_internal(const char *fmt,...)
Definition: elog.c:827
static BufferAccessStrategy vac_strategy
Definition: vacuumlazy.c:150
#define Assert(condition)
Definition: c.h:699
double new_dead_tuples
Definition: vacuumlazy.c:128
#define PROGRESS_VACUUM_PHASE
Definition: progress.h:21
int log_min_duration
Definition: vacuum.h:145
void pgstat_report_vacuum(Oid tableoid, bool shared, PgStat_Counter livetuples, PgStat_Counter deadtuples)
Definition: pgstat.c:1405
BlockNumber pages_removed
Definition: vacuumlazy.c:129
BlockNumber frozenskipped_pages
Definition: vacuumlazy.c:123
bool MultiXactIdPrecedesOrEquals(MultiXactId multi1, MultiXactId multi2)
Definition: multixact.c:3154
int VacuumPageMiss
Definition: globals.c:145
void TimestampDifference(TimestampTz start_time, TimestampTz stop_time, long *secs, int *microsecs)
Definition: timestamp.c:1624
void vac_update_relstats(Relation relation, BlockNumber num_pages, double num_tuples, BlockNumber num_all_visible_pages, bool hasindex, TransactionId frozenxid, MultiXactId minmulti, bool in_outer_xact)
Definition: vacuum.c:864
#define _(x)
Definition: elog.c:84
#define RelationGetRelid(relation)
Definition: rel.h:407
int multixact_freeze_min_age
Definition: vacuum.h:140
static void lazy_truncate_heap(Relation onerel, LVRelStats *vacrelstats)
Definition: vacuumlazy.c:1808
#define RelationGetNamespace(relation)
Definition: rel.h:448
bool lock_waiter_detected
Definition: vacuumlazy.c:139

◆ std_typanalyze()

bool std_typanalyze ( VacAttrStats stats)

Definition at line 1784 of file analyze.c.

References VacAttrStats::attr, VacAttrStats::attrtypid, compute_distinct_stats(), compute_scalar_stats(), VacAttrStats::compute_stats, compute_trivial_stats(), default_statistics_target, StdAnalyzeData::eqfunc, StdAnalyzeData::eqopr, VacAttrStats::extra_data, get_opcode(), get_sort_group_operators(), InvalidOid, StdAnalyzeData::ltopr, VacAttrStats::minrows, OidIsValid, and palloc().

Referenced by array_typanalyze(), and examine_attribute().

1785 {
1786  Form_pg_attribute attr = stats->attr;
1787  Oid ltopr;
1788  Oid eqopr;
1789  StdAnalyzeData *mystats;
1790 
1791  /* If the attstattarget column is negative, use the default value */
1792  /* NB: it is okay to scribble on stats->attr since it's a copy */
1793  if (attr->attstattarget < 0)
1794  attr->attstattarget = default_statistics_target;
1795 
1796  /* Look for default "<" and "=" operators for column's type */
1798  false, false, false,
1799  &ltopr, &eqopr, NULL,
1800  NULL);
1801 
1802  /* Save the operator info for compute_stats routines */
1803  mystats = (StdAnalyzeData *) palloc(sizeof(StdAnalyzeData));
1804  mystats->eqopr = eqopr;
1805  mystats->eqfunc = OidIsValid(eqopr) ? get_opcode(eqopr) : InvalidOid;
1806  mystats->ltopr = ltopr;
1807  stats->extra_data = mystats;
1808 
1809  /*
1810  * Determine which standard statistics algorithm to use
1811  */
1812  if (OidIsValid(eqopr) && OidIsValid(ltopr))
1813  {
1814  /* Seems to be a scalar datatype */
1816  /*--------------------
1817  * The following choice of minrows is based on the paper
1818  * "Random sampling for histogram construction: how much is enough?"
1819  * by Surajit Chaudhuri, Rajeev Motwani and Vivek Narasayya, in
1820  * Proceedings of ACM SIGMOD International Conference on Management
1821  * of Data, 1998, Pages 436-447. Their Corollary 1 to Theorem 5
1822  * says that for table size n, histogram size k, maximum relative
1823  * error in bin size f, and error probability gamma, the minimum
1824  * random sample size is
1825  * r = 4 * k * ln(2*n/gamma) / f^2
1826  * Taking f = 0.5, gamma = 0.01, n = 10^6 rows, we obtain
1827  * r = 305.82 * k
1828  * Note that because of the log function, the dependence on n is
1829  * quite weak; even at n = 10^12, a 300*k sample gives <= 0.66
1830  * bin size error with probability 0.99. So there's no real need to
1831  * scale for n, which is a good thing because we don't necessarily
1832  * know it at this point.
1833  *--------------------
1834  */
1835  stats->minrows = 300 * attr->attstattarget;
1836  }
1837  else if (OidIsValid(eqopr))
1838  {
1839  /* We can still recognize distinct values */
1841  /* Might as well use the same minrows as above */
1842  stats->minrows = 300 * attr->attstattarget;
1843  }
1844  else
1845  {
1846  /* Can't do much but the trivial stuff */
1848  /* Might as well use the same minrows as above */
1849  stats->minrows = 300 * attr->attstattarget;
1850  }
1851 
1852  return true;
1853 }
int minrows
Definition: vacuum.h:92
static void compute_scalar_stats(VacAttrStatsP stats, AnalyzeAttrFetchFunc fetchfunc, int samplerows, double totalrows)
Definition: analyze.c:2297
unsigned int Oid
Definition: postgres_ext.h:31
#define OidIsValid(objectId)
Definition: c.h:605
Form_pg_attribute attr
Definition: vacuum.h:81
Oid attrtypid
Definition: vacuum.h:82
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:197
static void compute_distinct_stats(VacAttrStatsP stats, AnalyzeAttrFetchFunc fetchfunc, int samplerows, double totalrows)
Definition: analyze.c:1954
#define InvalidOid
Definition: postgres_ext.h:36
RegProcedure get_opcode(Oid opno)
Definition: lsyscache.c:1079
void get_sort_group_operators(Oid argtype, bool needLT, bool needEQ, bool needGT, Oid *ltOpr, Oid *eqOpr, Oid *gtOpr, bool *isHashable)
Definition: parse_oper.c:187
static void compute_trivial_stats(VacAttrStatsP stats, AnalyzeAttrFetchFunc fetchfunc, int samplerows, double totalrows)
Definition: analyze.c:1864
void * palloc(Size size)
Definition: mcxt.c:924
AnalyzeAttrComputeStatsFunc compute_stats
Definition: vacuum.h:91
void * extra_data
Definition: vacuum.h:93
int default_statistics_target
Definition: analyze.c:77

◆ vac_close_indexes()

void vac_close_indexes ( int  nindexes,
Relation Irel,
LOCKMODE  lockmode 
)

Definition at line 1651 of file vacuum.c.

References index_close(), and pfree().

Referenced by do_analyze_rel(), and lazy_vacuum_rel().

1652 {
1653  if (Irel == NULL)
1654  return;
1655 
1656  while (nindexes--)
1657  {
1658  Relation ind = Irel[nindexes];
1659 
1660  index_close(ind, lockmode);
1661  }
1662  pfree(Irel);
1663 }
void pfree(void *pointer)
Definition: mcxt.c:1031
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:176

◆ vac_estimate_reltuples()

double vac_estimate_reltuples ( Relation  relation,
BlockNumber  total_pages,
BlockNumber  scanned_pages,
double  scanned_tuples 
)

Definition at line 779 of file vacuum.c.

References RelationData::rd_rel.

Referenced by lazy_scan_heap(), and statapprox_heap().

783 {
784  BlockNumber old_rel_pages = relation->rd_rel->relpages;
785  double old_rel_tuples = relation->rd_rel->reltuples;
786  double old_density;
787  double unscanned_pages;
788  double total_tuples;
789 
790  /* If we did scan the whole table, just use the count as-is */
791  if (scanned_pages >= total_pages)
792  return scanned_tuples;
793 
794  /*
795  * If scanned_pages is zero but total_pages isn't, keep the existing value
796  * of reltuples. (Note: callers should avoid updating the pg_class
797  * statistics in this situation, since no new information has been
798  * provided.)
799  */
800  if (scanned_pages == 0)
801  return old_rel_tuples;
802 
803  /*
804  * If old value of relpages is zero, old density is indeterminate; we
805  * can't do much except scale up scanned_tuples to match total_pages.
806  */
807  if (old_rel_pages == 0)
808  return floor((scanned_tuples / scanned_pages) * total_pages + 0.5);
809 
810  /*
811  * Okay, we've covered the corner cases. The normal calculation is to
812  * convert the old measurement to a density (tuples per page), then
813  * estimate the number of tuples in the unscanned pages using that figure,
814  * and finally add on the number of tuples in the scanned pages.
815  */
816  old_density = old_rel_tuples / old_rel_pages;
817  unscanned_pages = (double) total_pages - (double) scanned_pages;
818  total_tuples = old_density * unscanned_pages + scanned_tuples;
819  return floor(total_tuples + 0.5);
820 }
uint32 BlockNumber
Definition: block.h:31
Form_pg_class rd_rel
Definition: rel.h:84

◆ vac_open_indexes()

void vac_open_indexes ( Relation  relation,
LOCKMODE  lockmode,
int *  nindexes,
Relation **  Irel 
)

Definition at line 1608 of file vacuum.c.

References Assert, i, index_close(), index_open(), IndexIsReady, lfirst_oid, list_free(), list_length(), NoLock, palloc(), RelationData::rd_index, and RelationGetIndexList().

Referenced by do_analyze_rel(), and lazy_vacuum_rel().

1610 {
1611  List *indexoidlist;
1612  ListCell *indexoidscan;
1613  int i;
1614 
1615  Assert(lockmode != NoLock);
1616 
1617  indexoidlist = RelationGetIndexList(relation);
1618 
1619  /* allocate enough memory for all indexes */
1620  i = list_length(indexoidlist);
1621 
1622  if (i > 0)
1623  *Irel = (Relation *) palloc(i * sizeof(Relation));
1624  else
1625  *Irel = NULL;
1626 
1627  /* collect just the ready indexes */
1628  i = 0;
1629  foreach(indexoidscan, indexoidlist)
1630  {
1631  Oid indexoid = lfirst_oid(indexoidscan);
1632  Relation indrel;
1633 
1634  indrel = index_open(indexoid, lockmode);
1635  if (IndexIsReady(indrel->rd_index))
1636  (*Irel)[i++] = indrel;
1637  else
1638  index_close(indrel, lockmode);
1639  }
1640 
1641  *nindexes = i;
1642 
1643  list_free(indexoidlist);
1644 }
#define IndexIsReady(indexForm)
Definition: pg_index.h:86
unsigned int Oid
Definition: postgres_ext.h:31
Form_pg_index rd_index
Definition: rel.h:131
#define NoLock
Definition: lockdefs.h:34
#define Assert(condition)
Definition: c.h:699
static int list_length(const List *l)
Definition: pg_list.h:89
List * RelationGetIndexList(Relation relation)
Definition: relcache.c:4190
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:176
void * palloc(Size size)
Definition: mcxt.c:924
void list_free(List *list)
Definition: list.c:1133
int i
Definition: pg_list.h:45
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition: indexam.c:150
#define lfirst_oid(lc)
Definition: pg_list.h:108

◆ vac_update_datfrozenxid()

void vac_update_datfrozenxid ( void  )

Definition at line 991 of file vacuum.c.

References AccessShareLock, Assert, DATABASEOID, elog, ERROR, ForceTransactionIdLimitUpdate(), GetOldestMultiXactId(), GetOldestXmin(), GETSTRUCT, heap_close, heap_freetuple(), heap_inplace_update(), heap_open(), HeapTupleIsValid, InvalidOid, MultiXactIdIsValid, MultiXactIdPrecedes(), MyDatabaseId, ObjectIdGetDatum, PROCARRAY_FLAGS_VACUUM, ReadNewTransactionId(), ReadNextMultiXactId(), RowExclusiveLock, SearchSysCacheCopy1, systable_beginscan(), systable_endscan(), systable_getnext(), TransactionIdIsNormal, TransactionIdPrecedes(), and vac_truncate_clog().

Referenced by do_autovacuum(), and vacuum().

992 {
993  HeapTuple tuple;
994  Form_pg_database dbform;
995  Relation relation;
996  SysScanDesc scan;
997  HeapTuple classTup;
998  TransactionId newFrozenXid;
999  MultiXactId newMinMulti;
1000  TransactionId lastSaneFrozenXid;
1001  MultiXactId lastSaneMinMulti;
1002  bool bogus = false;
1003  bool dirty = false;
1004 
1005  /*
1006  * Initialize the "min" calculation with GetOldestXmin, which is a
1007  * reasonable approximation to the minimum relfrozenxid for not-yet-
1008  * committed pg_class entries for new tables; see AddNewRelationTuple().
1009  * So we cannot produce a wrong minimum by starting with this.
1010  */
1011  newFrozenXid = GetOldestXmin(NULL, PROCARRAY_FLAGS_VACUUM);
1012 
1013  /*
1014  * Similarly, initialize the MultiXact "min" with the value that would be
1015  * used on pg_class for new tables. See AddNewRelationTuple().
1016  */
1017  newMinMulti = GetOldestMultiXactId();
1018 
1019  /*
1020  * Identify the latest relfrozenxid and relminmxid values that we could
1021  * validly see during the scan. These are conservative values, but it's
1022  * not really worth trying to be more exact.
1023  */
1024  lastSaneFrozenXid = ReadNewTransactionId();
1025  lastSaneMinMulti = ReadNextMultiXactId();
1026 
1027  /*
1028  * We must seqscan pg_class to find the minimum Xid, because there is no
1029  * index that can help us here.
1030  */
1031  relation = heap_open(RelationRelationId, AccessShareLock);
1032 
1033  scan = systable_beginscan(relation, InvalidOid, false,
1034  NULL, 0, NULL);
1035 
1036  while ((classTup = systable_getnext(scan)) != NULL)
1037  {
1038  Form_pg_class classForm = (Form_pg_class) GETSTRUCT(classTup);
1039 
1040  /*
1041  * Only consider relations able to hold unfrozen XIDs (anything else
1042  * should have InvalidTransactionId in relfrozenxid anyway.)
1043  */
1044  if (classForm->relkind != RELKIND_RELATION &&
1045  classForm->relkind != RELKIND_MATVIEW &&
1046  classForm->relkind != RELKIND_TOASTVALUE)
1047  continue;
1048 
1049  Assert(TransactionIdIsNormal(classForm->relfrozenxid));
1050  Assert(MultiXactIdIsValid(classForm->relminmxid));
1051 
1052  /*
1053  * If things are working properly, no relation should have a
1054  * relfrozenxid or relminmxid that is "in the future". However, such
1055  * cases have been known to arise due to bugs in pg_upgrade. If we
1056  * see any entries that are "in the future", chicken out and don't do
1057  * anything. This ensures we won't truncate clog before those
1058  * relations have been scanned and cleaned up.
1059  */
1060  if (TransactionIdPrecedes(lastSaneFrozenXid, classForm->relfrozenxid) ||
1061  MultiXactIdPrecedes(lastSaneMinMulti, classForm->relminmxid))
1062  {
1063  bogus = true;
1064  break;
1065  }
1066 
1067  if (TransactionIdPrecedes(classForm->relfrozenxid, newFrozenXid))
1068  newFrozenXid = classForm->relfrozenxid;
1069 
1070  if (MultiXactIdPrecedes(classForm->relminmxid, newMinMulti))
1071  newMinMulti = classForm->relminmxid;
1072  }
1073 
1074  /* we're done with pg_class */
1075  systable_endscan(scan);
1076  heap_close(relation, AccessShareLock);
1077 
1078  /* chicken out if bogus data found */
1079  if (bogus)
1080  return;
1081 
1082  Assert(TransactionIdIsNormal(newFrozenXid));
1083  Assert(MultiXactIdIsValid(newMinMulti));
1084 
1085  /* Now fetch the pg_database tuple we need to update. */
1086  relation = heap_open(DatabaseRelationId, RowExclusiveLock);
1087 
1088  /* Fetch a copy of the tuple to scribble on */
1090  if (!HeapTupleIsValid(tuple))
1091  elog(ERROR, "could not find tuple for database %u", MyDatabaseId);
1092  dbform = (Form_pg_database) GETSTRUCT(tuple);
1093 
1094  /*
1095  * As in vac_update_relstats(), we ordinarily don't want to let
1096  * datfrozenxid go backward; but if it's "in the future" then it must be
1097  * corrupt and it seems best to overwrite it.
1098  */
1099  if (dbform->datfrozenxid != newFrozenXid &&
1100  (TransactionIdPrecedes(dbform->datfrozenxid, newFrozenXid) ||
1101  TransactionIdPrecedes(lastSaneFrozenXid, dbform->datfrozenxid)))
1102  {
1103  dbform->datfrozenxid = newFrozenXid;
1104  dirty = true;
1105  }
1106  else
1107  newFrozenXid = dbform->datfrozenxid;
1108 
1109  /* Ditto for datminmxid */
1110  if (dbform->datminmxid != newMinMulti &&
1111  (MultiXactIdPrecedes(dbform->datminmxid, newMinMulti) ||
1112  MultiXactIdPrecedes(lastSaneMinMulti, dbform->datminmxid)))
1113  {
1114  dbform->datminmxid = newMinMulti;
1115  dirty = true;
1116  }
1117  else
1118  newMinMulti = dbform->datminmxid;
1119 
1120  if (dirty)
1121  heap_inplace_update(relation, tuple);
1122 
1123  heap_freetuple(tuple);
1124  heap_close(relation, RowExclusiveLock);
1125 
1126  /*
1127  * If we were able to advance datfrozenxid or datminmxid, see if we can
1128  * truncate pg_xact and/or pg_multixact. Also do it if the shared
1129  * XID-wrap-limit info is stale, since this action will update that too.
1130  */
1131  if (dirty || ForceTransactionIdLimitUpdate())
1132  vac_truncate_clog(newFrozenXid, newMinMulti,
1133  lastSaneFrozenXid, lastSaneMinMulti);
1134 }
void systable_endscan(SysScanDesc sysscan)
Definition: genam.c:502
#define GETSTRUCT(TUP)
Definition: htup_details.h:673
uint32 TransactionId
Definition: c.h:474
FormData_pg_database * Form_pg_database
Definition: pg_database.h:54
#define AccessShareLock
Definition: lockdefs.h:36
#define PROCARRAY_FLAGS_VACUUM
Definition: procarray.h:52
#define heap_close(r, l)
Definition: heapam.h:97
void heap_freetuple(HeapTuple htup)
Definition: heaptuple.c:1773
SysScanDesc systable_beginscan(Relation heapRelation, Oid indexId, bool indexOK, Snapshot snapshot, int nkeys, ScanKey key)
Definition: genam.c:331
bool ForceTransactionIdLimitUpdate(void)
Definition: varsup.c:429
HeapTuple systable_getnext(SysScanDesc sysscan)
Definition: genam.c:419
#define ObjectIdGetDatum(X)
Definition: postgres.h:490
#define ERROR
Definition: elog.h:43
#define RowExclusiveLock
Definition: lockdefs.h:38
TransactionId ReadNewTransactionId(void)
Definition: varsup.c:250
#define MultiXactIdIsValid(multi)
Definition: multixact.h:27
bool TransactionIdPrecedes(TransactionId id1, TransactionId id2)
Definition: transam.c:300
MultiXactId GetOldestMultiXactId(void)
Definition: multixact.c:2491
Oid MyDatabaseId
Definition: globals.c:86
Relation heap_open(Oid relationId, LOCKMODE lockmode)
Definition: heapam.c:1294
#define InvalidOid
Definition: postgres_ext.h:36
TransactionId GetOldestXmin(Relation rel, int flags)
Definition: procarray.c:1315
TransactionId MultiXactId
Definition: c.h:484
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define Assert(condition)
Definition: c.h:699
bool MultiXactIdPrecedes(MultiXactId multi1, MultiXactId multi2)
Definition: multixact.c:3140
static void vac_truncate_clog(TransactionId frozenXID, MultiXactId minMulti, TransactionId lastSaneFrozenXid, MultiXactId lastSaneMinMulti)
Definition: vacuum.c:1155
FormData_pg_class * Form_pg_class
Definition: pg_class.h:92
#define SearchSysCacheCopy1(cacheId, key1)
Definition: syscache.h:173
void heap_inplace_update(Relation relation, HeapTuple tuple)
Definition: heapam.c:6387
#define elog
Definition: elog.h:219
#define TransactionIdIsNormal(xid)
Definition: transam.h:42
MultiXactId ReadNextMultiXactId(void)
Definition: multixact.c:721

◆ vac_update_relstats()

void vac_update_relstats ( Relation  relation,
BlockNumber  num_pages,
double  num_tuples,
BlockNumber  num_all_visible_pages,
bool  hasindex,
TransactionId  frozenxid,
MultiXactId  minmulti,
bool  in_outer_xact 
)

Definition at line 864 of file vacuum.c.

References elog, ERROR, GETSTRUCT, heap_close, heap_inplace_update(), heap_open(), HeapTupleIsValid, MultiXactIdIsValid, MultiXactIdPrecedes(), ObjectIdGetDatum, RelationData::rd_rules, ReadNewTransactionId(), ReadNextMultiXactId(), RelationGetRelid, RELOID, RowExclusiveLock, SearchSysCacheCopy1, TransactionIdIsNormal, TransactionIdPrecedes(), and RelationData::trigdesc.

Referenced by do_analyze_rel(), lazy_cleanup_index(), and lazy_vacuum_rel().

870 {
871  Oid relid = RelationGetRelid(relation);
872  Relation rd;
873  HeapTuple ctup;
874  Form_pg_class pgcform;
875  bool dirty;
876 
877  rd = heap_open(RelationRelationId, RowExclusiveLock);
878 
879  /* Fetch a copy of the tuple to scribble on */
881  if (!HeapTupleIsValid(ctup))
882  elog(ERROR, "pg_class entry for relid %u vanished during vacuuming",
883  relid);
884  pgcform = (Form_pg_class) GETSTRUCT(ctup);
885 
886  /* Apply statistical updates, if any, to copied tuple */
887 
888  dirty = false;
889  if (pgcform->relpages != (int32) num_pages)
890  {
891  pgcform->relpages = (int32) num_pages;
892  dirty = true;
893  }
894  if (pgcform->reltuples != (float4) num_tuples)
895  {
896  pgcform->reltuples = (float4) num_tuples;
897  dirty = true;
898  }
899  if (pgcform->relallvisible != (int32) num_all_visible_pages)
900  {
901  pgcform->relallvisible = (int32) num_all_visible_pages;
902  dirty = true;
903  }
904 
905  /* Apply DDL updates, but not inside an outer transaction (see above) */
906 
907  if (!in_outer_xact)
908  {
909  /*
910  * If we didn't find any indexes, reset relhasindex.
911  */
912  if (pgcform->relhasindex && !hasindex)
913  {
914  pgcform->relhasindex = false;
915  dirty = true;
916  }
917 
918  /* We also clear relhasrules and relhastriggers if needed */
919  if (pgcform->relhasrules && relation->rd_rules == NULL)
920  {
921  pgcform->relhasrules = false;
922  dirty = true;
923  }
924  if (pgcform->relhastriggers && relation->trigdesc == NULL)
925  {
926  pgcform->relhastriggers = false;
927  dirty = true;
928  }
929  }
930 
931  /*
932  * Update relfrozenxid, unless caller passed InvalidTransactionId
933  * indicating it has no new data.
934  *
935  * Ordinarily, we don't let relfrozenxid go backwards: if things are
936  * working correctly, the only way the new frozenxid could be older would
937  * be if a previous VACUUM was done with a tighter freeze_min_age, in
938  * which case we don't want to forget the work it already did. However,
939  * if the stored relfrozenxid is "in the future", then it must be corrupt
940  * and it seems best to overwrite it with the cutoff we used this time.
941  * This should match vac_update_datfrozenxid() concerning what we consider
942  * to be "in the future".
943  */
944  if (TransactionIdIsNormal(frozenxid) &&
945  pgcform->relfrozenxid != frozenxid &&
946  (TransactionIdPrecedes(pgcform->relfrozenxid, frozenxid) ||
948  pgcform->relfrozenxid)))
949  {
950  pgcform->relfrozenxid = frozenxid;
951  dirty = true;
952  }
953 
954  /* Similarly for relminmxid */
955  if (MultiXactIdIsValid(minmulti) &&
956  pgcform->relminmxid != minmulti &&
957  (MultiXactIdPrecedes(pgcform->relminmxid, minmulti) ||
958  MultiXactIdPrecedes(ReadNextMultiXactId(), pgcform->relminmxid)))
959  {
960  pgcform->relminmxid = minmulti;
961  dirty = true;
962  }
963 
964  /* If anything changed, write out the tuple. */
965  if (dirty)
966  heap_inplace_update(rd, ctup);
967 
969 }
#define GETSTRUCT(TUP)
Definition: htup_details.h:673
#define heap_close(r, l)
Definition: heapam.h:97
unsigned int Oid
Definition: postgres_ext.h:31
signed int int32
Definition: c.h:313
#define ObjectIdGetDatum(X)
Definition: postgres.h:490
#define ERROR
Definition: elog.h:43
TriggerDesc * trigdesc
Definition: rel.h:90
#define RowExclusiveLock
Definition: lockdefs.h:38
TransactionId ReadNewTransactionId(void)
Definition: varsup.c:250
#define MultiXactIdIsValid(multi)
Definition: multixact.h:27
bool TransactionIdPrecedes(TransactionId id1, TransactionId id2)
Definition: transam.c:300
float float4
Definition: c.h:457
Relation heap_open(Oid relationId, LOCKMODE lockmode)
Definition: heapam.c:1294
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
RuleLock * rd_rules
Definition: rel.h:88
bool MultiXactIdPrecedes(MultiXactId multi1, MultiXactId multi2)
Definition: multixact.c:3140
FormData_pg_class * Form_pg_class
Definition: pg_class.h:92
#define SearchSysCacheCopy1(cacheId, key1)
Definition: syscache.h:173
void heap_inplace_update(Relation relation, HeapTuple tuple)
Definition: heapam.c:6387
#define elog
Definition: elog.h:219
#define TransactionIdIsNormal(xid)
Definition: transam.h:42
#define RelationGetRelid(relation)
Definition: rel.h:407
MultiXactId ReadNextMultiXactId(void)
Definition: multixact.c:721

◆ vacuum()

void vacuum ( int  options,
List relations,
VacuumParams params,
BufferAccessStrategy  bstrategy,
bool  isTopLevel 
)

Definition at line 166 of file vacuum.c.

References ActiveSnapshotSet(), ALLOCSET_DEFAULT_SIZES, AllocSetContextCreate, analyze_rel(), Assert, BAS_VACUUM, CommitTransactionCommand(), cur, ereport, errcode(), errmsg(), ERROR, expand_vacuum_rel(), get_all_vacuum_rels(), GetAccessStrategy(), GetTransactionSnapshot(), IsAutoVacuumWorkerProcess(), IsInTransactionBlock(), lfirst_node, list_concat(), list_length(), MemoryContextDelete(), MemoryContextSwitchTo(), NIL, VacuumRelation::oid, PG_CATCH, PG_END_TRY, PG_RE_THROW, PG_TRY, pgstat_vacuum_stat(), PopActiveSnapshot(), PortalContext, PreventInTransactionBlock(), PushActiveSnapshot(), VacuumRelation::relation, StartTransactionCommand(), VacuumRelation::va_cols, vac_update_datfrozenxid(), VACOPT_ANALYZE, VACOPT_DISABLE_PAGE_SKIPPING, VACOPT_FULL, VACOPT_VACUUM, vacuum_rel(), VacuumCostActive, VacuumCostBalance, VacuumCostDelay, VacuumPageDirty, VacuumPageHit, and VacuumPageMiss.

Referenced by autovacuum_do_vac_analyze(), and ExecVacuum().

168 {
169  static bool in_vacuum = false;
170 
171  const char *stmttype;
172  volatile bool in_outer_xact,
173  use_own_xacts;
174 
175  Assert(params != NULL);
176 
177  stmttype = (options & VACOPT_VACUUM) ? "VACUUM" : "ANALYZE";
178 
179  /*
180  * We cannot run VACUUM inside a user transaction block; if we were inside
181  * a transaction, then our commit- and start-transaction-command calls
182  * would not have the intended effect! There are numerous other subtle
183  * dependencies on this, too.
184  *
185  * ANALYZE (without VACUUM) can run either way.
186  */
187  if (options & VACOPT_VACUUM)
188  {
189  PreventInTransactionBlock(isTopLevel, stmttype);
190  in_outer_xact = false;
191  }
192  else
193  in_outer_xact = IsInTransactionBlock(isTopLevel);
194 
195  /*
196  * Due to static variables vac_context, anl_context and vac_strategy,
197  * vacuum() is not reentrant. This matters when VACUUM FULL or ANALYZE
198  * calls a hostile index expression that itself calls ANALYZE.
199  */
200  if (in_vacuum)
201  ereport(ERROR,
202  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
203  errmsg("%s cannot be executed from VACUUM or ANALYZE",
204  stmttype)));
205 
206  /*
207  * Sanity check DISABLE_PAGE_SKIPPING option.
208  */
209  if ((options & VACOPT_FULL) != 0 &&
211  ereport(ERROR,
212  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
213  errmsg("VACUUM option DISABLE_PAGE_SKIPPING cannot be used with FULL")));
214 
215  /*
216  * Send info about dead objects to the statistics collector, unless we are
217  * in autovacuum --- autovacuum.c does this for itself.
218  */
219  if ((options & VACOPT_VACUUM) && !IsAutoVacuumWorkerProcess())
221 
222  /*
223  * Create special memory context for cross-transaction storage.
224  *
225  * Since it is a child of PortalContext, it will go away eventually even
226  * if we suffer an error; there's no need for special abort cleanup logic.
227  */
229  "Vacuum",
231 
232  /*
233  * If caller didn't give us a buffer strategy object, make one in the
234  * cross-transaction memory context.
235  */
236  if (bstrategy == NULL)
237  {
239 
240  bstrategy = GetAccessStrategy(BAS_VACUUM);
241  MemoryContextSwitchTo(old_context);
242  }
243  vac_strategy = bstrategy;
244 
245  /*
246  * Build list of relation(s) to process, putting any new data in
247  * vac_context for safekeeping.
248  */
249  if (relations != NIL)
250  {
251  List *newrels = NIL;
252  ListCell *lc;
253 
254  foreach(lc, relations)
255  {
257  List *sublist;
258  MemoryContext old_context;
259 
260  sublist = expand_vacuum_rel(vrel);
261  old_context = MemoryContextSwitchTo(vac_context);
262  newrels = list_concat(newrels, sublist);
263  MemoryContextSwitchTo(old_context);
264  }
265  relations = newrels;
266  }
267  else
268  relations = get_all_vacuum_rels();
269 
270  /*
271  * Decide whether we need to start/commit our own transactions.
272  *
273  * For VACUUM (with or without ANALYZE): always do so, so that we can
274  * release locks as soon as possible. (We could possibly use the outer
275  * transaction for a one-table VACUUM, but handling TOAST tables would be
276  * problematic.)
277  *
278  * For ANALYZE (no VACUUM): if inside a transaction block, we cannot
279  * start/commit our own transactions. Also, there's no need to do so if
280  * only processing one relation. For multiple relations when not within a
281  * transaction block, and also in an autovacuum worker, use own
282  * transactions so we can release locks sooner.
283  */
284  if (options & VACOPT_VACUUM)
285  use_own_xacts = true;
286  else
287  {
290  use_own_xacts = true;
291  else if (in_outer_xact)
292  use_own_xacts = false;
293  else if (list_length(relations) > 1)
294  use_own_xacts = true;
295  else
296  use_own_xacts = false;
297  }
298 
299  /*
300  * vacuum_rel expects to be entered with no transaction active; it will
301  * start and commit its own transaction. But we are called by an SQL
302  * command, and so we are executing inside a transaction already. We
303  * commit the transaction started in PostgresMain() here, and start
304  * another one before exiting to match the commit waiting for us back in
305  * PostgresMain().
306  */
307  if (use_own_xacts)
308  {
309  Assert(!in_outer_xact);
310 
311  /* ActiveSnapshot is not set by autovacuum */
312  if (ActiveSnapshotSet())
314 
315  /* matches the StartTransaction in PostgresMain() */
317  }
318 
319  /* Turn vacuum cost accounting on or off, and set/clear in_vacuum */
320  PG_TRY();
321  {
322  ListCell *cur;
323 
324  in_vacuum = true;
326  VacuumCostBalance = 0;
327  VacuumPageHit = 0;
328  VacuumPageMiss = 0;
329  VacuumPageDirty = 0;
330 
331  /*
332  * Loop to process each selected relation.
333  */
334  foreach(cur, relations)
335  {
337 
338  if (options & VACOPT_VACUUM)
339  {
340  if (!vacuum_rel(vrel->oid, vrel->relation, options, params))
341  continue;
342  }
343 
344  if (options & VACOPT_ANALYZE)
345  {
346  /*
347  * If using separate xacts, start one for analyze. Otherwise,
348  * we can use the outer transaction.
349  */
350  if (use_own_xacts)
351  {
353  /* functions in indexes may want a snapshot set */
355  }
356 
357  analyze_rel(vrel->oid, vrel->relation, options, params,
358  vrel->va_cols, in_outer_xact, vac_strategy);
359 
360  if (use_own_xacts)
361  {
364  }
365  }
366  }
367  }
368  PG_CATCH();
369  {
370  in_vacuum = false;
371  VacuumCostActive = false;
372  PG_RE_THROW();
373  }
374  PG_END_TRY();
375 
376  in_vacuum = false;
377  VacuumCostActive = false;
378 
379  /*
380  * Finish up processing.
381  */
382  if (use_own_xacts)
383  {
384  /* here, we are not in a transaction */
385 
386  /*
387  * This matches the CommitTransaction waiting for us in
388  * PostgresMain().
389  */
391  }
392 
393  if ((options & VACOPT_VACUUM) && !IsAutoVacuumWorkerProcess())
394  {
395  /*
396  * Update pg_database.datfrozenxid, and truncate pg_xact if possible.
397  * (autovacuum.c does this for itself.)
398  */
400  }
401 
402  /*
403  * Clean up working storage --- note we must do this after
404  * StartTransactionCommand, else we might be trying to delete the active
405  * context!
406  */
408  vac_context = NULL;
409 }
BufferAccessStrategy GetAccessStrategy(BufferAccessStrategyType btype)
Definition: freelist.c:542
#define NIL
Definition: pg_list.h:69
static List * get_all_vacuum_rels(void)
Definition: vacuum.c:527
void MemoryContextDelete(MemoryContext context)
Definition: mcxt.c:211
int VacuumCostBalance
Definition: globals.c:148
RangeVar * relation
Definition: parsenodes.h:3153
void vac_update_datfrozenxid(void)
Definition: vacuum.c:991
int VacuumPageHit
Definition: globals.c:144
void CommitTransactionCommand(void)
Definition: xact.c:2744
void analyze_rel(Oid relid, RangeVar *relation, int options, VacuumParams *params, List *va_cols, bool in_outer_xact, BufferAccessStrategy bstrategy)
Definition: analyze.c:115
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
static BufferAccessStrategy vac_strategy
Definition: vacuum.c:67
struct cursor * cur
Definition: ecpg.c:28
int errcode(int sqlerrcode)
Definition: elog.c:575
List * list_concat(List *list1, List *list2)
Definition: list.c:321
void PopActiveSnapshot(void)
Definition: snapmgr.c:812
Snapshot GetTransactionSnapshot(void)
Definition: snapmgr.c:304
MemoryContext PortalContext
Definition: mcxt.c:53
#define ERROR
Definition: elog.h:43
#define ALLOCSET_DEFAULT_SIZES
Definition: memutils.h:192
static List * expand_vacuum_rel(VacuumRelation *vrel)
Definition: vacuum.c:426
#define lfirst_node(type, lc)
Definition: pg_list.h:109
void PushActiveSnapshot(Snapshot snap)
Definition: snapmgr.c:733
static MemoryContext vac_context
Definition: vacuum.c:66
void PreventInTransactionBlock(bool isTopLevel, const char *stmtType)
Definition: xact.c:3153
bool ActiveSnapshotSet(void)
Definition: snapmgr.c:851
bool IsAutoVacuumWorkerProcess(void)
Definition: autovacuum.c:3295
#define ereport(elevel, rest)
Definition: elog.h:122
void pgstat_vacuum_stat(void)
Definition: pgstat.c:1022
bool IsInTransactionBlock(bool isTopLevel)
Definition: xact.c:3267
#define AllocSetContextCreate(parent, name, allocparams)
Definition: memutils.h:170
int VacuumPageDirty
Definition: globals.c:146
int VacuumCostDelay
Definition: globals.c:142
#define PG_CATCH()
Definition: elog.h:293
#define Assert(condition)
Definition: c.h:699
static bool vacuum_rel(Oid relid, RangeVar *relation, int options, VacuumParams *params)
Definition: vacuum.c:1301
void StartTransactionCommand(void)
Definition: xact.c:2673
static int list_length(const List *l)
Definition: pg_list.h:89
#define PG_RE_THROW()
Definition: elog.h:314
int errmsg(const char *fmt,...)
Definition: elog.c:797
int VacuumPageMiss
Definition: globals.c:145
#define PG_TRY()
Definition: elog.h:284
Definition: pg_list.h:45
#define PG_END_TRY()
Definition: elog.h:300
bool VacuumCostActive
Definition: globals.c:149

◆ vacuum_delay_point()

void vacuum_delay_point ( void  )

Definition at line 1672 of file vacuum.c.

References AutoVacuumUpdateDelay(), CHECK_FOR_INTERRUPTS, InterruptPending, pg_usleep(), VacuumCostActive, VacuumCostBalance, VacuumCostDelay, and VacuumCostLimit.

Referenced by acquire_sample_rows(), blbulkdelete(), blvacuumcleanup(), btvacuumpage(), compute_array_stats(), compute_distinct_stats(), compute_index_stats(), compute_range_stats(), compute_scalar_stats(), compute_trivial_stats(), compute_tsvector_stats(), file_acquire_sample_rows(), ginbulkdelete(), ginInsertCleanup(), ginvacuumcleanup(), ginVacuumPostingTreeLeaves(), gistbulkdelete(), gistvacuumcleanup(), hashbucketcleanup(), lazy_scan_heap(), lazy_vacuum_heap(), spgprocesspending(), and spgvacuumpage().

1673 {
1674  /* Always check for interrupts */
1676 
1677  /* Nap if appropriate */
1680  {
1681  int msec;
1682 
1684  if (msec > VacuumCostDelay * 4)
1685  msec = VacuumCostDelay * 4;
1686 
1687  pg_usleep(msec * 1000L);
1688 
1689  VacuumCostBalance = 0;
1690 
1691  /* update balance values for workers */
1693 
1694  /* Might have gotten an interrupt while sleeping */
1696  }
1697 }
int VacuumCostBalance
Definition: globals.c:148
void pg_usleep(long microsec)
Definition: signal.c:53
int VacuumCostLimit
Definition: globals.c:141
int VacuumCostDelay
Definition: globals.c:142
volatile bool InterruptPending
Definition: globals.c:32
void AutoVacuumUpdateDelay(void)
Definition: autovacuum.c:1773
#define CHECK_FOR_INTERRUPTS()
Definition: miscadmin.h:98
bool VacuumCostActive
Definition: globals.c:149

◆ vacuum_set_xid_limits()

void vacuum_set_xid_limits ( Relation  rel,
int  freeze_min_age,
int  freeze_table_age,
int  multixact_freeze_min_age,
int  multixact_freeze_table_age,
TransactionId oldestXmin,
TransactionId freezeLimit,
TransactionId xidFullScanLimit,
MultiXactId multiXactCutoff,
MultiXactId mxactFullScanLimit 
)

Definition at line 593 of file vacuum.c.

References Assert, autovacuum_freeze_max_age, ereport, errhint(), errmsg(), FirstMultiXactId, FirstNormalTransactionId, GetOldestMultiXactId(), GetOldestXmin(), Min, MultiXactIdPrecedes(), MultiXactMemberFreezeThreshold(), PROCARRAY_FLAGS_VACUUM, ReadNewTransactionId(), ReadNextMultiXactId(), TransactionIdIsNormal, TransactionIdLimitedForOldSnapshots(), TransactionIdPrecedes(), vacuum_freeze_min_age, vacuum_freeze_table_age, vacuum_multixact_freeze_min_age, vacuum_multixact_freeze_table_age, and WARNING.

Referenced by copy_heap_data(), and lazy_vacuum_rel().

603 {
604  int freezemin;
605  int mxid_freezemin;
606  int effective_multixact_freeze_max_age;
607  TransactionId limit;
608  TransactionId safeLimit;
609  MultiXactId mxactLimit;
610  MultiXactId safeMxactLimit;
611 
612  /*
613  * We can always ignore processes running lazy vacuum. This is because we
614  * use these values only for deciding which tuples we must keep in the
615  * tables. Since lazy vacuum doesn't write its XID anywhere, it's safe to
616  * ignore it. In theory it could be problematic to ignore lazy vacuums in
617  * a full vacuum, but keep in mind that only one vacuum process can be
618  * working on a particular table at any time, and that each vacuum is
619  * always an independent transaction.
620  */
621  *oldestXmin =
623 
624  Assert(TransactionIdIsNormal(*oldestXmin));
625 
626  /*
627  * Determine the minimum freeze age to use: as specified by the caller, or
628  * vacuum_freeze_min_age, but in any case not more than half
629  * autovacuum_freeze_max_age, so that autovacuums to prevent XID
630  * wraparound won't occur too frequently.
631  */
632  freezemin = freeze_min_age;
633  if (freezemin < 0)
634  freezemin = vacuum_freeze_min_age;
635  freezemin = Min(freezemin, autovacuum_freeze_max_age / 2);
636  Assert(freezemin >= 0);
637 
638  /*
639  * Compute the cutoff XID, being careful not to generate a "permanent" XID
640  */
641  limit = *oldestXmin - freezemin;
642  if (!TransactionIdIsNormal(limit))
643  limit = FirstNormalTransactionId;
644 
645  /*
646  * If oldestXmin is very far back (in practice, more than
647  * autovacuum_freeze_max_age / 2 XIDs old), complain and force a minimum
648  * freeze age of zero.
649  */
651  if (!TransactionIdIsNormal(safeLimit))
652  safeLimit = FirstNormalTransactionId;
653 
654  if (TransactionIdPrecedes(limit, safeLimit))
655  {
657  (errmsg("oldest xmin is far in the past"),
658  errhint("Close open transactions soon to avoid wraparound problems.\n"
659  "You might also need to commit or roll back old prepared transactions, or drop stale replication slots.")));
660  limit = *oldestXmin;
661  }
662 
663  *freezeLimit = limit;
664 
665  /*
666  * Compute the multixact age for which freezing is urgent. This is
667  * normally autovacuum_multixact_freeze_max_age, but may be less if we are
668  * short of multixact member space.
669  */
670  effective_multixact_freeze_max_age = MultiXactMemberFreezeThreshold();
671 
672  /*
673  * Determine the minimum multixact freeze age to use: as specified by
674  * caller, or vacuum_multixact_freeze_min_age, but in any case not more
675  * than half effective_multixact_freeze_max_age, so that autovacuums to
676  * prevent MultiXact wraparound won't occur too frequently.
677  */
678  mxid_freezemin = multixact_freeze_min_age;
679  if (mxid_freezemin < 0)
680  mxid_freezemin = vacuum_multixact_freeze_min_age;
681  mxid_freezemin = Min(mxid_freezemin,
682  effective_multixact_freeze_max_age / 2);
683  Assert(mxid_freezemin >= 0);
684 
685  /* compute the cutoff multi, being careful to generate a valid value */
686  mxactLimit = GetOldestMultiXactId() - mxid_freezemin;
687  if (mxactLimit < FirstMultiXactId)
688  mxactLimit = FirstMultiXactId;
689 
690  safeMxactLimit =
691  ReadNextMultiXactId() - effective_multixact_freeze_max_age;
692  if (safeMxactLimit < FirstMultiXactId)
693  safeMxactLimit = FirstMultiXactId;
694 
695  if (MultiXactIdPrecedes(mxactLimit, safeMxactLimit))
696  {
698  (errmsg("oldest multixact is far in the past"),
699  errhint("Close open transactions with multixacts soon to avoid wraparound problems.")));
700  mxactLimit = safeMxactLimit;
701  }
702 
703  *multiXactCutoff = mxactLimit;
704 
705  if (xidFullScanLimit != NULL)
706  {
707  int freezetable;
708 
709  Assert(mxactFullScanLimit != NULL);
710 
711  /*
712  * Determine the table freeze age to use: as specified by the caller,
713  * or vacuum_freeze_table_age, but in any case not more than
714  * autovacuum_freeze_max_age * 0.95, so that if you have e.g nightly
715  * VACUUM schedule, the nightly VACUUM gets a chance to freeze tuples
716  * before anti-wraparound autovacuum is launched.
717  */
718  freezetable = freeze_table_age;
719  if (freezetable < 0)
720  freezetable = vacuum_freeze_table_age;
721  freezetable = Min(freezetable, autovacuum_freeze_max_age * 0.95);
722  Assert(freezetable >= 0);
723 
724  /*
725  * Compute XID limit causing a full-table vacuum, being careful not to
726  * generate a "permanent" XID.
727  */
728  limit = ReadNewTransactionId() - freezetable;
729  if (!TransactionIdIsNormal(limit))
730  limit = FirstNormalTransactionId;
731 
732  *xidFullScanLimit = limit;
733 
734  /*
735  * Similar to the above, determine the table freeze age to use for
736  * multixacts: as specified by the caller, or
737  * vacuum_multixact_freeze_table_age, but in any case not more than
738  * autovacuum_multixact_freeze_table_age * 0.95, so that if you have
739  * e.g. nightly VACUUM schedule, the nightly VACUUM gets a chance to
740  * freeze multixacts before anti-wraparound autovacuum is launched.
741  */
742  freezetable = multixact_freeze_table_age;
743  if (freezetable < 0)
744  freezetable = vacuum_multixact_freeze_table_age;
745  freezetable = Min(freezetable,
746  effective_multixact_freeze_max_age * 0.95);
747  Assert(freezetable >= 0);
748 
749  /*
750  * Compute MultiXact limit causing a full-table vacuum, being careful
751  * to generate a valid MultiXact value.
752  */
753  mxactLimit = ReadNextMultiXactId() - freezetable;
754  if (mxactLimit < FirstMultiXactId)
755  mxactLimit = FirstMultiXactId;
756 
757  *mxactFullScanLimit = mxactLimit;
758  }
759  else
760  {
761  Assert(mxactFullScanLimit == NULL);
762  }
763 }
int errhint(const char *fmt,...)
Definition: elog.c:987
int vacuum_multixact_freeze_table_age
Definition: vacuum.c:62
uint32 TransactionId
Definition: c.h:474
#define Min(x, y)
Definition: c.h:857
TransactionId TransactionIdLimitedForOldSnapshots(TransactionId recentXmin, Relation relation)
Definition: snapmgr.c:1741
#define PROCARRAY_FLAGS_VACUUM
Definition: procarray.h:52
#define FirstNormalTransactionId
Definition: transam.h:34
int autovacuum_freeze_max_age
Definition: autovacuum.c:121
int vacuum_multixact_freeze_min_age
Definition: vacuum.c:61
TransactionId ReadNewTransactionId(void)
Definition: varsup.c:250
#define FirstMultiXactId
Definition: multixact.h:24
#define ereport(elevel, rest)
Definition: elog.h:122
int MultiXactMemberFreezeThreshold(void)
Definition: multixact.c:2817
bool TransactionIdPrecedes(TransactionId id1, TransactionId id2)
Definition: transam.c:300
#define WARNING
Definition: elog.h:40
MultiXactId GetOldestMultiXactId(void)
Definition: multixact.c:2491
TransactionId GetOldestXmin(Relation rel, int flags)
Definition: procarray.c:1315
TransactionId MultiXactId
Definition: c.h:484
#define Assert(condition)
Definition: c.h:699
int vacuum_freeze_min_age
Definition: vacuum.c:59
bool MultiXactIdPrecedes(MultiXactId multi1, MultiXactId multi2)
Definition: multixact.c:3140
int vacuum_freeze_table_age
Definition: vacuum.c:60
int errmsg(const char *fmt,...)
Definition: elog.c:797
#define TransactionIdIsNormal(xid)
Definition: transam.h:42
MultiXactId ReadNextMultiXactId(void)
Definition: multixact.c:721

Variable Documentation

◆ default_statistics_target

PGDLLIMPORT int default_statistics_target

Definition at line 77 of file analyze.c.

Referenced by range_typanalyze(), std_typanalyze(), and ts_typanalyze().

◆ vacuum_freeze_min_age

int vacuum_freeze_min_age

Definition at line 59 of file vacuum.c.

Referenced by do_autovacuum(), and vacuum_set_xid_limits().

◆ vacuum_freeze_table_age

int vacuum_freeze_table_age

Definition at line 60 of file vacuum.c.

Referenced by do_autovacuum(), and vacuum_set_xid_limits().

◆ vacuum_multixact_freeze_min_age

int vacuum_multixact_freeze_min_age

Definition at line 61 of file vacuum.c.

Referenced by do_autovacuum(), and vacuum_set_xid_limits().

◆ vacuum_multixact_freeze_table_age

int vacuum_multixact_freeze_table_age

Definition at line 62 of file vacuum.c.

Referenced by do_autovacuum(), and vacuum_set_xid_limits().