PostgreSQL Source Code  git master
vacuum.h File Reference
#include "access/htup.h"
#include "catalog/pg_class.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 enum VacuumOption VacuumOption
 
typedef enum VacOptTernaryValue VacOptTernaryValue
 
typedef struct VacuumParams VacuumParams
 

Enumerations

enum  VacuumOption {
  VACOPT_VACUUM = 1 << 0, VACOPT_ANALYZE = 1 << 1, VACOPT_VERBOSE = 1 << 2, VACOPT_FREEZE = 1 << 3,
  VACOPT_FULL = 1 << 4, VACOPT_SKIP_LOCKED = 1 << 5, VACOPT_SKIPTOAST = 1 << 6, VACOPT_DISABLE_PAGE_SKIPPING = 1 << 7
}
 
enum  VacOptTernaryValue { VACOPT_TERNARY_DEFAULT = 0, VACOPT_TERNARY_DISABLED, VACOPT_TERNARY_ENABLED }
 

Functions

void ExecVacuum (ParseState *pstate, VacuumStmt *vacstmt, bool isTopLevel)
 
void vacuum (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)
 
bool vacuum_is_relation_owner (Oid relid, Form_pg_class reltuple, int options)
 
Relation vacuum_open_relation (Oid relid, RangeVar *relation, int options, bool verbose, LOCKMODE lmode)
 
void analyze_rel (Oid relid, RangeVar *relation, 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 67 of file vacuum.h.

◆ AnalyzeAttrFetchFunc

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

Definition at line 64 of file vacuum.h.

◆ VacAttrStats

typedef struct VacAttrStats VacAttrStats

◆ VacAttrStatsP

typedef struct VacAttrStats* VacAttrStatsP

Definition at line 62 of file vacuum.h.

◆ VacOptTernaryValue

◆ VacuumOption

typedef enum VacuumOption VacuumOption

◆ VacuumParams

typedef struct VacuumParams VacuumParams

Enumeration Type Documentation

◆ VacOptTernaryValue

Enumerator
VACOPT_TERNARY_DEFAULT 
VACOPT_TERNARY_DISABLED 
VACOPT_TERNARY_ENABLED 

Definition at line 157 of file vacuum.h.

◆ VacuumOption

Enumerator
VACOPT_VACUUM 
VACOPT_ANALYZE 
VACOPT_VERBOSE 
VACOPT_FREEZE 
VACOPT_FULL 
VACOPT_SKIP_LOCKED 
VACOPT_SKIPTOAST 
VACOPT_DISABLE_PAGE_SKIPPING 

Definition at line 139 of file vacuum.h.

140 {
141  VACOPT_VACUUM = 1 << 0, /* do VACUUM */
142  VACOPT_ANALYZE = 1 << 1, /* do ANALYZE */
143  VACOPT_VERBOSE = 1 << 2, /* print progress info */
144  VACOPT_FREEZE = 1 << 3, /* FREEZE option */
145  VACOPT_FULL = 1 << 4, /* FULL (non-concurrent) vacuum */
146  VACOPT_SKIP_LOCKED = 1 << 5, /* skip if cannot get lock */
147  VACOPT_SKIPTOAST = 1 << 6, /* don't process the TOAST table, if any */
148  VACOPT_DISABLE_PAGE_SKIPPING = 1 << 7 /* don't skip any pages */
149 } VacuumOption;
VacuumOption
Definition: vacuum.h:139

Function Documentation

◆ analyze_rel()

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

Definition at line 118 of file analyze.c.

References acquire_sample_rows(), FdwRoutine::AnalyzeForeignTable, CHECK_FOR_INTERRUPTS, DEBUG2, do_analyze_rel(), elevel, ereport, errmsg(), GetFdwRoutineForRelation(), INFO, VacuumParams::log_min_duration, LW_EXCLUSIVE, LWLockAcquire(), LWLockRelease(), MyPgXact, NoLock, VacuumParams::options, PROC_IN_ANALYZE, RelationData::rd_rel, relation_close(), RELATION_IS_OTHER_TEMP, RelationGetNumberOfBlocks, RelationGetRelationName, RelationGetRelid, relpages, ShareUpdateExclusiveLock, VACOPT_ANALYZE, VACOPT_VACUUM, VACOPT_VERBOSE, vacuum_is_relation_owner(), vacuum_open_relation(), PGXACT::vacuumFlags, and WARNING.

Referenced by vacuum().

121 {
122  Relation onerel;
123  int elevel;
124  AcquireSampleRowsFunc acquirefunc = NULL;
125  BlockNumber relpages = 0;
126 
127  /* Select logging level */
128  if (params->options & VACOPT_VERBOSE)
129  elevel = INFO;
130  else
131  elevel = DEBUG2;
132 
133  /* Set up static variables */
134  vac_strategy = bstrategy;
135 
136  /*
137  * Check for user-requested abort.
138  */
140 
141  /*
142  * Open the relation, getting ShareUpdateExclusiveLock to ensure that two
143  * ANALYZEs don't run on it concurrently. (This also locks out a
144  * concurrent VACUUM, which doesn't matter much at the moment but might
145  * matter if we ever try to accumulate stats on dead tuples.) If the rel
146  * has been dropped since we last saw it, we don't need to process it.
147  *
148  * Make sure to generate only logs for ANALYZE in this case.
149  */
150  onerel = vacuum_open_relation(relid, relation, params->options & ~(VACOPT_VACUUM),
151  params->log_min_duration >= 0,
153 
154  /* leave if relation could not be opened or locked */
155  if (!onerel)
156  return;
157 
158  /*
159  * Check if relation needs to be skipped based on ownership. This check
160  * happens also when building the relation list to analyze for a manual
161  * operation, and needs to be done additionally here as ANALYZE could
162  * happen across multiple transactions where relation ownership could have
163  * changed in-between. Make sure to generate only logs for ANALYZE in
164  * this case.
165  */
167  onerel->rd_rel,
168  params->options & VACOPT_ANALYZE))
169  {
171  return;
172  }
173 
174  /*
175  * Silently ignore tables that are temp tables of other backends ---
176  * trying to analyze these is rather pointless, since their contents are
177  * probably not up-to-date on disk. (We don't throw a warning here; it
178  * would just lead to chatter during a database-wide ANALYZE.)
179  */
180  if (RELATION_IS_OTHER_TEMP(onerel))
181  {
183  return;
184  }
185 
186  /*
187  * We can ANALYZE any table except pg_statistic. See update_attstats
188  */
189  if (RelationGetRelid(onerel) == StatisticRelationId)
190  {
192  return;
193  }
194 
195  /*
196  * Check that it's of an analyzable relkind, and set up appropriately.
197  */
198  if (onerel->rd_rel->relkind == RELKIND_RELATION ||
199  onerel->rd_rel->relkind == RELKIND_MATVIEW)
200  {
201  /* Regular table, so we'll use the regular row acquisition function */
202  acquirefunc = acquire_sample_rows;
203  /* Also get regular table's size */
204  relpages = RelationGetNumberOfBlocks(onerel);
205  }
206  else if (onerel->rd_rel->relkind == RELKIND_FOREIGN_TABLE)
207  {
208  /*
209  * For a foreign table, call the FDW's hook function to see whether it
210  * supports analysis.
211  */
212  FdwRoutine *fdwroutine;
213  bool ok = false;
214 
215  fdwroutine = GetFdwRoutineForRelation(onerel, false);
216 
217  if (fdwroutine->AnalyzeForeignTable != NULL)
218  ok = fdwroutine->AnalyzeForeignTable(onerel,
219  &acquirefunc,
220  &relpages);
221 
222  if (!ok)
223  {
225  (errmsg("skipping \"%s\" --- cannot analyze this foreign table",
226  RelationGetRelationName(onerel))));
228  return;
229  }
230  }
231  else if (onerel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
232  {
233  /*
234  * For partitioned tables, we want to do the recursive ANALYZE below.
235  */
236  }
237  else
238  {
239  /* No need for a WARNING if we already complained during VACUUM */
240  if (!(params->options & VACOPT_VACUUM))
242  (errmsg("skipping \"%s\" --- cannot analyze non-tables or special system tables",
243  RelationGetRelationName(onerel))));
245  return;
246  }
247 
248  /*
249  * OK, let's do it. First let other backends know I'm in ANALYZE.
250  */
251  LWLockAcquire(ProcArrayLock, LW_EXCLUSIVE);
253  LWLockRelease(ProcArrayLock);
254 
255  /*
256  * Do the normal non-recursive ANALYZE. We can skip this for partitioned
257  * tables, which don't contain any rows.
258  */
259  if (onerel->rd_rel->relkind != RELKIND_PARTITIONED_TABLE)
260  do_analyze_rel(onerel, params, va_cols, acquirefunc,
261  relpages, false, in_outer_xact, elevel);
262 
263  /*
264  * If there are child tables, do recursive ANALYZE.
265  */
266  if (onerel->rd_rel->relhassubclass)
267  do_analyze_rel(onerel, params, va_cols, acquirefunc, relpages,
268  true, in_outer_xact, elevel);
269 
270  /*
271  * Close source relation now, but keep lock so that no one deletes it
272  * before we commit. (If someone did, they'd fail to clean up the entries
273  * we made in pg_statistic. Also, releasing the lock before commit would
274  * expose us to concurrent-update failures in update_attstats.)
275  */
276  relation_close(onerel, NoLock);
277 
278  /*
279  * Reset my PGXACT flag. Note: we need this here, and not in vacuum_rel,
280  * because the vacuum flag is cleared by the end-of-xact code.
281  */
282  LWLockAcquire(ProcArrayLock, LW_EXCLUSIVE);
284  LWLockRelease(ProcArrayLock);
285 }
static void do_analyze_rel(Relation onerel, VacuumParams *params, List *va_cols, AcquireSampleRowsFunc acquirefunc, BlockNumber relpages, bool inh, bool in_outer_xact, int elevel)
Definition: analyze.c:295
AnalyzeForeignTable_function AnalyzeForeignTable
Definition: fdwapi.h:234
#define INFO
Definition: elog.h:33
static BufferAccessStrategy vac_strategy
Definition: analyze.c:84
uint32 BlockNumber
Definition: block.h:31
Form_pg_class rd_rel
Definition: rel.h:83
int32 relpages
Definition: pg_class.h:60
PGXACT * MyPgXact
Definition: proc.c:69
uint8 vacuumFlags
Definition: proc.h:233
void LWLockRelease(LWLock *lock)
Definition: lwlock.c:1726
bool vacuum_is_relation_owner(Oid relid, Form_pg_class reltuple, int options)
Definition: vacuum.c:484
#define DEBUG2
Definition: elog.h:24
#define NoLock
Definition: lockdefs.h:34
Relation vacuum_open_relation(Oid relid, RangeVar *relation, int options, bool verbose, LOCKMODE lmode)
Definition: vacuum.c:558
#define RelationGetRelationName(relation)
Definition: rel.h:450
#define ereport(elevel, rest)
Definition: elog.h:141
#define WARNING
Definition: elog.h:40
static int elevel
Definition: vacuumlazy.c:143
#define RelationGetNumberOfBlocks(reln)
Definition: bufmgr.h:198
#define ShareUpdateExclusiveLock
Definition: lockdefs.h:39
void relation_close(Relation relation, LOCKMODE lockmode)
Definition: relation.c:206
#define RELATION_IS_OTHER_TEMP(relation)
Definition: rel.h:546
bool LWLockAcquire(LWLock *lock, LWLockMode mode)
Definition: lwlock.c:1122
int log_min_duration
Definition: vacuum.h:180
int(* AcquireSampleRowsFunc)(Relation relation, int elevel, HeapTuple *rows, int targrows, double *totalrows, double *totaldeadrows)
Definition: fdwapi.h:142
int errmsg(const char *fmt,...)
Definition: elog.c:784
FdwRoutine * GetFdwRoutineForRelation(Relation relation, bool makecopy)
Definition: foreign.c:427
int options
Definition: vacuum.h:172
#define PROC_IN_ANALYZE
Definition: proc.h:55
#define CHECK_FOR_INTERRUPTS()
Definition: miscadmin.h:99
#define RelationGetRelid(relation)
Definition: rel.h:416
static int acquire_sample_rows(Relation onerel, int elevel, HeapTuple *rows, int targrows, double *totalrows, double *totaldeadrows)
Definition: analyze.c:1022

◆ 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 ( ParseState pstate,
VacuumStmt vacstmt,
bool  isTopLevel 
)

Definition at line 88 of file vacuum.c.

References analyze(), Assert, defGetBoolean(), DefElem::defname, ereport, errcode(), errmsg(), ERROR, VacuumParams::freeze_min_age, VacuumParams::freeze_table_age, get_vacopt_ternary_value(), VacuumParams::index_cleanup, VacuumStmt::is_vacuumcmd, VacuumParams::is_wraparound, lfirst, lfirst_node, DefElem::location, VacuumParams::log_min_duration, VacuumParams::multixact_freeze_min_age, VacuumParams::multixact_freeze_table_age, NIL, VacuumParams::options, VacuumStmt::options, parser_errposition(), VacuumStmt::rels, VacuumParams::truncate, VacuumRelation::va_cols, VACOPT_ANALYZE, VACOPT_DISABLE_PAGE_SKIPPING, VACOPT_FREEZE, VACOPT_FULL, VACOPT_SKIP_LOCKED, VACOPT_SKIPTOAST, VACOPT_TERNARY_DEFAULT, VACOPT_VACUUM, VACOPT_VERBOSE, vacuum(), and verbose.

Referenced by standard_ProcessUtility().

89 {
90  VacuumParams params;
91  bool verbose = false;
92  bool skip_locked = false;
93  bool analyze = false;
94  bool freeze = false;
95  bool full = false;
96  bool disable_page_skipping = false;
97  ListCell *lc;
98 
99  /* Set default value */
102 
103  /* Parse options list */
104  foreach(lc, vacstmt->options)
105  {
106  DefElem *opt = (DefElem *) lfirst(lc);
107 
108  /* Parse common options for VACUUM and ANALYZE */
109  if (strcmp(opt->defname, "verbose") == 0)
110  verbose = defGetBoolean(opt);
111  else if (strcmp(opt->defname, "skip_locked") == 0)
112  skip_locked = defGetBoolean(opt);
113  else if (!vacstmt->is_vacuumcmd)
114  ereport(ERROR,
115  (errcode(ERRCODE_SYNTAX_ERROR),
116  errmsg("unrecognized ANALYZE option \"%s\"", opt->defname),
117  parser_errposition(pstate, opt->location)));
118 
119  /* Parse options available on VACUUM */
120  else if (strcmp(opt->defname, "analyze") == 0)
121  analyze = defGetBoolean(opt);
122  else if (strcmp(opt->defname, "freeze") == 0)
123  freeze = defGetBoolean(opt);
124  else if (strcmp(opt->defname, "full") == 0)
125  full = defGetBoolean(opt);
126  else if (strcmp(opt->defname, "disable_page_skipping") == 0)
127  disable_page_skipping = defGetBoolean(opt);
128  else if (strcmp(opt->defname, "index_cleanup") == 0)
130  else if (strcmp(opt->defname, "truncate") == 0)
131  params.truncate = get_vacopt_ternary_value(opt);
132  else
133  ereport(ERROR,
134  (errcode(ERRCODE_SYNTAX_ERROR),
135  errmsg("unrecognized VACUUM option \"%s\"", opt->defname),
136  parser_errposition(pstate, opt->location)));
137  }
138 
139  /* Set vacuum options */
140  params.options =
141  (vacstmt->is_vacuumcmd ? VACOPT_VACUUM : VACOPT_ANALYZE) |
142  (verbose ? VACOPT_VERBOSE : 0) |
143  (skip_locked ? VACOPT_SKIP_LOCKED : 0) |
144  (analyze ? VACOPT_ANALYZE : 0) |
145  (freeze ? VACOPT_FREEZE : 0) |
146  (full ? VACOPT_FULL : 0) |
147  (disable_page_skipping ? VACOPT_DISABLE_PAGE_SKIPPING : 0);
148 
149  /* sanity checks on options */
150  Assert(params.options & (VACOPT_VACUUM | VACOPT_ANALYZE));
151  Assert((params.options & VACOPT_VACUUM) ||
152  !(params.options & (VACOPT_FULL | VACOPT_FREEZE)));
153  Assert(!(params.options & VACOPT_SKIPTOAST));
154 
155  /*
156  * Make sure VACOPT_ANALYZE is specified if any column lists are present.
157  */
158  if (!(params.options & VACOPT_ANALYZE))
159  {
160  ListCell *lc;
161 
162  foreach(lc, vacstmt->rels)
163  {
165 
166  if (vrel->va_cols != NIL)
167  ereport(ERROR,
168  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
169  errmsg("ANALYZE option must be specified when a column list is provided")));
170  }
171  }
172 
173  /*
174  * All freeze ages are zero if the FREEZE option is given; otherwise pass
175  * them as -1 which means to use the default values.
176  */
177  if (params.options & VACOPT_FREEZE)
178  {
179  params.freeze_min_age = 0;
180  params.freeze_table_age = 0;
181  params.multixact_freeze_min_age = 0;
182  params.multixact_freeze_table_age = 0;
183  }
184  else
185  {
186  params.freeze_min_age = -1;
187  params.freeze_table_age = -1;
188  params.multixact_freeze_min_age = -1;
189  params.multixact_freeze_table_age = -1;
190  }
191 
192  /* user-invoked vacuum is never "for wraparound" */
193  params.is_wraparound = false;
194 
195  /* user-invoked vacuum never uses this parameter */
196  params.log_min_duration = -1;
197 
198  /* Now go through the common routine */
199  vacuum(vacstmt->rels, &params, NULL, isTopLevel);
200 }
#define NIL
Definition: pg_list.h:65
int multixact_freeze_table_age
Definition: vacuum.h:177
void vacuum(List *relations, VacuumParams *params, BufferAccessStrategy bstrategy, bool isTopLevel)
Definition: vacuum.c:222
bool is_vacuumcmd
Definition: parsenodes.h:3190
int errcode(int sqlerrcode)
Definition: elog.c:570
int freeze_table_age
Definition: vacuum.h:174
bool defGetBoolean(DefElem *def)
Definition: define.c:111
#define ERROR
Definition: elog.h:43
int freeze_min_age
Definition: vacuum.h:173
bool is_wraparound
Definition: vacuum.h:179
#define lfirst_node(type, lc)
Definition: pg_list.h:193
int location
Definition: parsenodes.h:733
#define ereport(elevel, rest)
Definition: elog.h:141
VacOptTernaryValue index_cleanup
Definition: vacuum.h:183
static int verbose
Definition: pg_basebackup.c:94
VacOptTernaryValue truncate
Definition: vacuum.h:185
#define Assert(condition)
Definition: c.h:732
#define lfirst(lc)
Definition: pg_list.h:190
int parser_errposition(ParseState *pstate, int location)
Definition: parse_node.c:111
int log_min_duration
Definition: vacuum.h:180
int errmsg(const char *fmt,...)
Definition: elog.c:784
List * options
Definition: parsenodes.h:3188
int options
Definition: vacuum.h:172
char * defname
Definition: parsenodes.h:730
int multixact_freeze_min_age
Definition: vacuum.h:175
static long analyze(struct nfa *nfa)
Definition: regc_nfa.c:2816
List * rels
Definition: parsenodes.h:3189
static VacOptTernaryValue get_vacopt_ternary_value(DefElem *def)
Definition: vacuum.c:1974

◆ std_typanalyze()

bool std_typanalyze ( VacAttrStats stats)

Definition at line 1660 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().

1661 {
1662  Form_pg_attribute attr = stats->attr;
1663  Oid ltopr;
1664  Oid eqopr;
1665  StdAnalyzeData *mystats;
1666 
1667  /* If the attstattarget column is negative, use the default value */
1668  /* NB: it is okay to scribble on stats->attr since it's a copy */
1669  if (attr->attstattarget < 0)
1670  attr->attstattarget = default_statistics_target;
1671 
1672  /* Look for default "<" and "=" operators for column's type */
1674  false, false, false,
1675  &ltopr, &eqopr, NULL,
1676  NULL);
1677 
1678  /* Save the operator info for compute_stats routines */
1679  mystats = (StdAnalyzeData *) palloc(sizeof(StdAnalyzeData));
1680  mystats->eqopr = eqopr;
1681  mystats->eqfunc = OidIsValid(eqopr) ? get_opcode(eqopr) : InvalidOid;
1682  mystats->ltopr = ltopr;
1683  stats->extra_data = mystats;
1684 
1685  /*
1686  * Determine which standard statistics algorithm to use
1687  */
1688  if (OidIsValid(eqopr) && OidIsValid(ltopr))
1689  {
1690  /* Seems to be a scalar datatype */
1692  /*--------------------
1693  * The following choice of minrows is based on the paper
1694  * "Random sampling for histogram construction: how much is enough?"
1695  * by Surajit Chaudhuri, Rajeev Motwani and Vivek Narasayya, in
1696  * Proceedings of ACM SIGMOD International Conference on Management
1697  * of Data, 1998, Pages 436-447. Their Corollary 1 to Theorem 5
1698  * says that for table size n, histogram size k, maximum relative
1699  * error in bin size f, and error probability gamma, the minimum
1700  * random sample size is
1701  * r = 4 * k * ln(2*n/gamma) / f^2
1702  * Taking f = 0.5, gamma = 0.01, n = 10^6 rows, we obtain
1703  * r = 305.82 * k
1704  * Note that because of the log function, the dependence on n is
1705  * quite weak; even at n = 10^12, a 300*k sample gives <= 0.66
1706  * bin size error with probability 0.99. So there's no real need to
1707  * scale for n, which is a good thing because we don't necessarily
1708  * know it at this point.
1709  *--------------------
1710  */
1711  stats->minrows = 300 * attr->attstattarget;
1712  }
1713  else if (OidIsValid(eqopr))
1714  {
1715  /* We can still recognize distinct values */
1717  /* Might as well use the same minrows as above */
1718  stats->minrows = 300 * attr->attstattarget;
1719  }
1720  else
1721  {
1722  /* Can't do much but the trivial stuff */
1724  /* Might as well use the same minrows as above */
1725  stats->minrows = 300 * attr->attstattarget;
1726  }
1727 
1728  return true;
1729 }
int minrows
Definition: vacuum.h:97
static void compute_scalar_stats(VacAttrStatsP stats, AnalyzeAttrFetchFunc fetchfunc, int samplerows, double totalrows)
Definition: analyze.c:2173
unsigned int Oid
Definition: postgres_ext.h:31
#define OidIsValid(objectId)
Definition: c.h:638
Form_pg_attribute attr
Definition: vacuum.h:85
Oid attrtypid
Definition: vacuum.h:86
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:200
static void compute_distinct_stats(VacAttrStatsP stats, AnalyzeAttrFetchFunc fetchfunc, int samplerows, double totalrows)
Definition: analyze.c:1830
#define InvalidOid
Definition: postgres_ext.h:36
RegProcedure get_opcode(Oid opno)
Definition: lsyscache.c:1092
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:1740
void * palloc(Size size)
Definition: mcxt.c:924
AnalyzeAttrComputeStatsFunc compute_stats
Definition: vacuum.h:96
void * extra_data
Definition: vacuum.h:98
int default_statistics_target
Definition: analyze.c:80

◆ vac_close_indexes()

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

Definition at line 1919 of file vacuum.c.

References index_close(), and pfree().

Referenced by do_analyze_rel(), and heap_vacuum_rel().

1920 {
1921  if (Irel == NULL)
1922  return;
1923 
1924  while (nindexes--)
1925  {
1926  Relation ind = Irel[nindexes];
1927 
1928  index_close(ind, lockmode);
1929  }
1930  pfree(Irel);
1931 }
void pfree(void *pointer)
Definition: mcxt.c:1031
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:152

◆ vac_estimate_reltuples()

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

Definition at line 1066 of file vacuum.c.

References RelationData::rd_rel.

Referenced by lazy_scan_heap(), and statapprox_heap().

1070 {
1071  BlockNumber old_rel_pages = relation->rd_rel->relpages;
1072  double old_rel_tuples = relation->rd_rel->reltuples;
1073  double old_density;
1074  double unscanned_pages;
1075  double total_tuples;
1076 
1077  /* If we did scan the whole table, just use the count as-is */
1078  if (scanned_pages >= total_pages)
1079  return scanned_tuples;
1080 
1081  /*
1082  * If scanned_pages is zero but total_pages isn't, keep the existing value
1083  * of reltuples. (Note: callers should avoid updating the pg_class
1084  * statistics in this situation, since no new information has been
1085  * provided.)
1086  */
1087  if (scanned_pages == 0)
1088  return old_rel_tuples;
1089 
1090  /*
1091  * If old value of relpages is zero, old density is indeterminate; we
1092  * can't do much except scale up scanned_tuples to match total_pages.
1093  */
1094  if (old_rel_pages == 0)
1095  return floor((scanned_tuples / scanned_pages) * total_pages + 0.5);
1096 
1097  /*
1098  * Okay, we've covered the corner cases. The normal calculation is to
1099  * convert the old measurement to a density (tuples per page), then
1100  * estimate the number of tuples in the unscanned pages using that figure,
1101  * and finally add on the number of tuples in the scanned pages.
1102  */
1103  old_density = old_rel_tuples / old_rel_pages;
1104  unscanned_pages = (double) total_pages - (double) scanned_pages;
1105  total_tuples = old_density * unscanned_pages + scanned_tuples;
1106  return floor(total_tuples + 0.5);
1107 }
uint32 BlockNumber
Definition: block.h:31
Form_pg_class rd_rel
Definition: rel.h:83

◆ vac_open_indexes()

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

Definition at line 1876 of file vacuum.c.

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

Referenced by do_analyze_rel(), and heap_vacuum_rel().

1878 {
1879  List *indexoidlist;
1880  ListCell *indexoidscan;
1881  int i;
1882 
1883  Assert(lockmode != NoLock);
1884 
1885  indexoidlist = RelationGetIndexList(relation);
1886 
1887  /* allocate enough memory for all indexes */
1888  i = list_length(indexoidlist);
1889 
1890  if (i > 0)
1891  *Irel = (Relation *) palloc(i * sizeof(Relation));
1892  else
1893  *Irel = NULL;
1894 
1895  /* collect just the ready indexes */
1896  i = 0;
1897  foreach(indexoidscan, indexoidlist)
1898  {
1899  Oid indexoid = lfirst_oid(indexoidscan);
1900  Relation indrel;
1901 
1902  indrel = index_open(indexoid, lockmode);
1903  if (indrel->rd_index->indisready)
1904  (*Irel)[i++] = indrel;
1905  else
1906  index_close(indrel, lockmode);
1907  }
1908 
1909  *nindexes = i;
1910 
1911  list_free(indexoidlist);
1912 }
unsigned int Oid
Definition: postgres_ext.h:31
Form_pg_index rd_index
Definition: rel.h:143
#define NoLock
Definition: lockdefs.h:34
#define Assert(condition)
Definition: c.h:732
static int list_length(const List *l)
Definition: pg_list.h:169
List * RelationGetIndexList(Relation relation)
Definition: relcache.c:4348
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:152
void * palloc(Size size)
Definition: mcxt.c:924
void list_free(List *list)
Definition: list.c:1373
int i
Definition: pg_list.h:50
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition: indexam.c:126
#define lfirst_oid(lc)
Definition: pg_list.h:192

◆ vac_update_datfrozenxid()

void vac_update_datfrozenxid ( void  )

Definition at line 1278 of file vacuum.c.

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

Referenced by do_autovacuum(), and vacuum().

1279 {
1280  HeapTuple tuple;
1281  Form_pg_database dbform;
1282  Relation relation;
1283  SysScanDesc scan;
1284  HeapTuple classTup;
1285  TransactionId newFrozenXid;
1286  MultiXactId newMinMulti;
1287  TransactionId lastSaneFrozenXid;
1288  MultiXactId lastSaneMinMulti;
1289  bool bogus = false;
1290  bool dirty = false;
1291 
1292  /*
1293  * Initialize the "min" calculation with GetOldestXmin, which is a
1294  * reasonable approximation to the minimum relfrozenxid for not-yet-
1295  * committed pg_class entries for new tables; see AddNewRelationTuple().
1296  * So we cannot produce a wrong minimum by starting with this.
1297  */
1298  newFrozenXid = GetOldestXmin(NULL, PROCARRAY_FLAGS_VACUUM);
1299 
1300  /*
1301  * Similarly, initialize the MultiXact "min" with the value that would be
1302  * used on pg_class for new tables. See AddNewRelationTuple().
1303  */
1304  newMinMulti = GetOldestMultiXactId();
1305 
1306  /*
1307  * Identify the latest relfrozenxid and relminmxid values that we could
1308  * validly see during the scan. These are conservative values, but it's
1309  * not really worth trying to be more exact.
1310  */
1311  lastSaneFrozenXid = ReadNewTransactionId();
1312  lastSaneMinMulti = ReadNextMultiXactId();
1313 
1314  /*
1315  * We must seqscan pg_class to find the minimum Xid, because there is no
1316  * index that can help us here.
1317  */
1318  relation = table_open(RelationRelationId, AccessShareLock);
1319 
1320  scan = systable_beginscan(relation, InvalidOid, false,
1321  NULL, 0, NULL);
1322 
1323  while ((classTup = systable_getnext(scan)) != NULL)
1324  {
1325  Form_pg_class classForm = (Form_pg_class) GETSTRUCT(classTup);
1326 
1327  /*
1328  * Only consider relations able to hold unfrozen XIDs (anything else
1329  * should have InvalidTransactionId in relfrozenxid anyway).
1330  */
1331  if (classForm->relkind != RELKIND_RELATION &&
1332  classForm->relkind != RELKIND_MATVIEW &&
1333  classForm->relkind != RELKIND_TOASTVALUE)
1334  {
1335  Assert(!TransactionIdIsValid(classForm->relfrozenxid));
1336  Assert(!MultiXactIdIsValid(classForm->relminmxid));
1337  continue;
1338  }
1339 
1340  /*
1341  * Some table AMs might not need per-relation xid / multixid horizons.
1342  * It therefore seems reasonable to allow relfrozenxid and relminmxid
1343  * to not be set (i.e. set to their respective Invalid*Id)
1344  * independently. Thus validate and compute horizon for each only if
1345  * set.
1346  *
1347  * If things are working properly, no relation should have a
1348  * relfrozenxid or relminmxid that is "in the future". However, such
1349  * cases have been known to arise due to bugs in pg_upgrade. If we
1350  * see any entries that are "in the future", chicken out and don't do
1351  * anything. This ensures we won't truncate clog & multixact SLRUs
1352  * before those relations have been scanned and cleaned up.
1353  */
1354 
1355  if (TransactionIdIsValid(classForm->relfrozenxid))
1356  {
1357  Assert(TransactionIdIsNormal(classForm->relfrozenxid));
1358 
1359  /* check for values in the future */
1360  if (TransactionIdPrecedes(lastSaneFrozenXid, classForm->relfrozenxid))
1361  {
1362  bogus = true;
1363  break;
1364  }
1365 
1366  /* determine new horizon */
1367  if (TransactionIdPrecedes(classForm->relfrozenxid, newFrozenXid))
1368  newFrozenXid = classForm->relfrozenxid;
1369  }
1370 
1371  if (MultiXactIdIsValid(classForm->relminmxid))
1372  {
1373  /* check for values in the future */
1374  if (MultiXactIdPrecedes(lastSaneMinMulti, classForm->relminmxid))
1375  {
1376  bogus = true;
1377  break;
1378  }
1379 
1380  /* determine new horizon */
1381  if (MultiXactIdPrecedes(classForm->relminmxid, newMinMulti))
1382  newMinMulti = classForm->relminmxid;
1383  }
1384  }
1385 
1386  /* we're done with pg_class */
1387  systable_endscan(scan);
1388  table_close(relation, AccessShareLock);
1389 
1390  /* chicken out if bogus data found */
1391  if (bogus)
1392  return;
1393 
1394  Assert(TransactionIdIsNormal(newFrozenXid));
1395  Assert(MultiXactIdIsValid(newMinMulti));
1396 
1397  /* Now fetch the pg_database tuple we need to update. */
1398  relation = table_open(DatabaseRelationId, RowExclusiveLock);
1399 
1400  /* Fetch a copy of the tuple to scribble on */
1402  if (!HeapTupleIsValid(tuple))
1403  elog(ERROR, "could not find tuple for database %u", MyDatabaseId);
1404  dbform = (Form_pg_database) GETSTRUCT(tuple);
1405 
1406  /*
1407  * As in vac_update_relstats(), we ordinarily don't want to let
1408  * datfrozenxid go backward; but if it's "in the future" then it must be
1409  * corrupt and it seems best to overwrite it.
1410  */
1411  if (dbform->datfrozenxid != newFrozenXid &&
1412  (TransactionIdPrecedes(dbform->datfrozenxid, newFrozenXid) ||
1413  TransactionIdPrecedes(lastSaneFrozenXid, dbform->datfrozenxid)))
1414  {
1415  dbform->datfrozenxid = newFrozenXid;
1416  dirty = true;
1417  }
1418  else
1419  newFrozenXid = dbform->datfrozenxid;
1420 
1421  /* Ditto for datminmxid */
1422  if (dbform->datminmxid != newMinMulti &&
1423  (MultiXactIdPrecedes(dbform->datminmxid, newMinMulti) ||
1424  MultiXactIdPrecedes(lastSaneMinMulti, dbform->datminmxid)))
1425  {
1426  dbform->datminmxid = newMinMulti;
1427  dirty = true;
1428  }
1429  else
1430  newMinMulti = dbform->datminmxid;
1431 
1432  if (dirty)
1433  heap_inplace_update(relation, tuple);
1434 
1435  heap_freetuple(tuple);
1436  table_close(relation, RowExclusiveLock);
1437 
1438  /*
1439  * If we were able to advance datfrozenxid or datminmxid, see if we can
1440  * truncate pg_xact and/or pg_multixact. Also do it if the shared
1441  * XID-wrap-limit info is stale, since this action will update that too.
1442  */
1443  if (dirty || ForceTransactionIdLimitUpdate())
1444  vac_truncate_clog(newFrozenXid, newMinMulti,
1445  lastSaneFrozenXid, lastSaneMinMulti);
1446 }
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
void systable_endscan(SysScanDesc sysscan)
Definition: genam.c:525
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
uint32 TransactionId
Definition: c.h:507
FormData_pg_database * Form_pg_database
Definition: pg_database.h:81
#define AccessShareLock
Definition: lockdefs.h:36
#define PROCARRAY_FLAGS_VACUUM
Definition: procarray.h:52
void heap_freetuple(HeapTuple htup)
Definition: heaptuple.c:1338
SysScanDesc systable_beginscan(Relation heapRelation, Oid indexId, bool indexOK, Snapshot snapshot, int nkeys, ScanKey key)
Definition: genam.c:352
bool ForceTransactionIdLimitUpdate(void)
Definition: varsup.c:471
HeapTuple systable_getnext(SysScanDesc sysscan)
Definition: genam.c:444
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
#define RowExclusiveLock
Definition: lockdefs.h:38
#define MultiXactIdIsValid(multi)
Definition: multixact.h:27
bool TransactionIdPrecedes(TransactionId id1, TransactionId id2)
Definition: transam.c:300
MultiXactId GetOldestMultiXactId(void)
Definition: multixact.c:2493
Oid MyDatabaseId
Definition: globals.c:85
#define InvalidOid
Definition: postgres_ext.h:36
TransactionId GetOldestXmin(Relation rel, int flags)
Definition: procarray.c:1304
TransactionId MultiXactId
Definition: c.h:517
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define Assert(condition)
Definition: c.h:732
bool MultiXactIdPrecedes(MultiXactId multi1, MultiXactId multi2)
Definition: multixact.c:3142
static void vac_truncate_clog(TransactionId frozenXID, MultiXactId minMulti, TransactionId lastSaneFrozenXid, MultiXactId lastSaneMinMulti)
Definition: vacuum.c:1467
static TransactionId ReadNewTransactionId(void)
Definition: transam.h:244
FormData_pg_class * Form_pg_class
Definition: pg_class.h:150
#define SearchSysCacheCopy1(cacheId, key1)
Definition: syscache.h:174
void heap_inplace_update(Relation relation, HeapTuple tuple)
Definition: heapam.c:5707
#define elog(elevel,...)
Definition: elog.h:226
#define TransactionIdIsValid(xid)
Definition: transam.h:41
#define TransactionIdIsNormal(xid)
Definition: transam.h:42
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
MultiXactId ReadNextMultiXactId(void)
Definition: multixact.c:723

◆ 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 1151 of file vacuum.c.

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

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

1157 {
1158  Oid relid = RelationGetRelid(relation);
1159  Relation rd;
1160  HeapTuple ctup;
1161  Form_pg_class pgcform;
1162  bool dirty;
1163 
1164  rd = table_open(RelationRelationId, RowExclusiveLock);
1165 
1166  /* Fetch a copy of the tuple to scribble on */
1168  if (!HeapTupleIsValid(ctup))
1169  elog(ERROR, "pg_class entry for relid %u vanished during vacuuming",
1170  relid);
1171  pgcform = (Form_pg_class) GETSTRUCT(ctup);
1172 
1173  /* Apply statistical updates, if any, to copied tuple */
1174 
1175  dirty = false;
1176  if (pgcform->relpages != (int32) num_pages)
1177  {
1178  pgcform->relpages = (int32) num_pages;
1179  dirty = true;
1180  }
1181  if (pgcform->reltuples != (float4) num_tuples)
1182  {
1183  pgcform->reltuples = (float4) num_tuples;
1184  dirty = true;
1185  }
1186  if (pgcform->relallvisible != (int32) num_all_visible_pages)
1187  {
1188  pgcform->relallvisible = (int32) num_all_visible_pages;
1189  dirty = true;
1190  }
1191 
1192  /* Apply DDL updates, but not inside an outer transaction (see above) */
1193 
1194  if (!in_outer_xact)
1195  {
1196  /*
1197  * If we didn't find any indexes, reset relhasindex.
1198  */
1199  if (pgcform->relhasindex && !hasindex)
1200  {
1201  pgcform->relhasindex = false;
1202  dirty = true;
1203  }
1204 
1205  /* We also clear relhasrules and relhastriggers if needed */
1206  if (pgcform->relhasrules && relation->rd_rules == NULL)
1207  {
1208  pgcform->relhasrules = false;
1209  dirty = true;
1210  }
1211  if (pgcform->relhastriggers && relation->trigdesc == NULL)
1212  {
1213  pgcform->relhastriggers = false;
1214  dirty = true;
1215  }
1216  }
1217 
1218  /*
1219  * Update relfrozenxid, unless caller passed InvalidTransactionId
1220  * indicating it has no new data.
1221  *
1222  * Ordinarily, we don't let relfrozenxid go backwards: if things are
1223  * working correctly, the only way the new frozenxid could be older would
1224  * be if a previous VACUUM was done with a tighter freeze_min_age, in
1225  * which case we don't want to forget the work it already did. However,
1226  * if the stored relfrozenxid is "in the future", then it must be corrupt
1227  * and it seems best to overwrite it with the cutoff we used this time.
1228  * This should match vac_update_datfrozenxid() concerning what we consider
1229  * to be "in the future".
1230  */
1231  if (TransactionIdIsNormal(frozenxid) &&
1232  pgcform->relfrozenxid != frozenxid &&
1233  (TransactionIdPrecedes(pgcform->relfrozenxid, frozenxid) ||
1235  pgcform->relfrozenxid)))
1236  {
1237  pgcform->relfrozenxid = frozenxid;
1238  dirty = true;
1239  }
1240 
1241  /* Similarly for relminmxid */
1242  if (MultiXactIdIsValid(minmulti) &&
1243  pgcform->relminmxid != minmulti &&
1244  (MultiXactIdPrecedes(pgcform->relminmxid, minmulti) ||
1245  MultiXactIdPrecedes(ReadNextMultiXactId(), pgcform->relminmxid)))
1246  {
1247  pgcform->relminmxid = minmulti;
1248  dirty = true;
1249  }
1250 
1251  /* If anything changed, write out the tuple. */
1252  if (dirty)
1253  heap_inplace_update(rd, ctup);
1254 
1256 }
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
unsigned int Oid
Definition: postgres_ext.h:31
signed int int32
Definition: c.h:346
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
TriggerDesc * trigdesc
Definition: rel.h:89
#define RowExclusiveLock
Definition: lockdefs.h:38
#define MultiXactIdIsValid(multi)
Definition: multixact.h:27
bool TransactionIdPrecedes(TransactionId id1, TransactionId id2)
Definition: transam.c:300
float float4
Definition: c.h:490
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
RuleLock * rd_rules
Definition: rel.h:87
bool MultiXactIdPrecedes(MultiXactId multi1, MultiXactId multi2)
Definition: multixact.c:3142
static TransactionId ReadNewTransactionId(void)
Definition: transam.h:244
FormData_pg_class * Form_pg_class
Definition: pg_class.h:150
#define SearchSysCacheCopy1(cacheId, key1)
Definition: syscache.h:174
void heap_inplace_update(Relation relation, HeapTuple tuple)
Definition: heapam.c:5707
#define elog(elevel,...)
Definition: elog.h:226
#define TransactionIdIsNormal(xid)
Definition: transam.h:42
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
#define RelationGetRelid(relation)
Definition: rel.h:416
MultiXactId ReadNextMultiXactId(void)
Definition: multixact.c:723

◆ vacuum()

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

Definition at line 222 of file vacuum.c.

References ActiveSnapshotSet(), ALLOCSET_DEFAULT_SIZES, AllocSetContextCreate, analyze_rel(), Assert, BAS_VACUUM, CommandCounterIncrement(), 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, VacuumParams::options, 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().

224 {
225  static bool in_vacuum = false;
226 
227  const char *stmttype;
228  volatile bool in_outer_xact,
229  use_own_xacts;
230 
231  Assert(params != NULL);
232 
233  stmttype = (params->options & VACOPT_VACUUM) ? "VACUUM" : "ANALYZE";
234 
235  /*
236  * We cannot run VACUUM inside a user transaction block; if we were inside
237  * a transaction, then our commit- and start-transaction-command calls
238  * would not have the intended effect! There are numerous other subtle
239  * dependencies on this, too.
240  *
241  * ANALYZE (without VACUUM) can run either way.
242  */
243  if (params->options & VACOPT_VACUUM)
244  {
245  PreventInTransactionBlock(isTopLevel, stmttype);
246  in_outer_xact = false;
247  }
248  else
249  in_outer_xact = IsInTransactionBlock(isTopLevel);
250 
251  /*
252  * Due to static variables vac_context, anl_context and vac_strategy,
253  * vacuum() is not reentrant. This matters when VACUUM FULL or ANALYZE
254  * calls a hostile index expression that itself calls ANALYZE.
255  */
256  if (in_vacuum)
257  ereport(ERROR,
258  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
259  errmsg("%s cannot be executed from VACUUM or ANALYZE",
260  stmttype)));
261 
262  /*
263  * Sanity check DISABLE_PAGE_SKIPPING option.
264  */
265  if ((params->options & VACOPT_FULL) != 0 &&
266  (params->options & VACOPT_DISABLE_PAGE_SKIPPING) != 0)
267  ereport(ERROR,
268  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
269  errmsg("VACUUM option DISABLE_PAGE_SKIPPING cannot be used with FULL")));
270 
271  /*
272  * Send info about dead objects to the statistics collector, unless we are
273  * in autovacuum --- autovacuum.c does this for itself.
274  */
275  if ((params->options & VACOPT_VACUUM) && !IsAutoVacuumWorkerProcess())
277 
278  /*
279  * Create special memory context for cross-transaction storage.
280  *
281  * Since it is a child of PortalContext, it will go away eventually even
282  * if we suffer an error; there's no need for special abort cleanup logic.
283  */
285  "Vacuum",
287 
288  /*
289  * If caller didn't give us a buffer strategy object, make one in the
290  * cross-transaction memory context.
291  */
292  if (bstrategy == NULL)
293  {
295 
296  bstrategy = GetAccessStrategy(BAS_VACUUM);
297  MemoryContextSwitchTo(old_context);
298  }
299  vac_strategy = bstrategy;
300 
301  /*
302  * Build list of relation(s) to process, putting any new data in
303  * vac_context for safekeeping.
304  */
305  if (relations != NIL)
306  {
307  List *newrels = NIL;
308  ListCell *lc;
309 
310  foreach(lc, relations)
311  {
313  List *sublist;
314  MemoryContext old_context;
315 
316  sublist = expand_vacuum_rel(vrel, params->options);
317  old_context = MemoryContextSwitchTo(vac_context);
318  newrels = list_concat(newrels, sublist);
319  MemoryContextSwitchTo(old_context);
320  }
321  relations = newrels;
322  }
323  else
324  relations = get_all_vacuum_rels(params->options);
325 
326  /*
327  * Decide whether we need to start/commit our own transactions.
328  *
329  * For VACUUM (with or without ANALYZE): always do so, so that we can
330  * release locks as soon as possible. (We could possibly use the outer
331  * transaction for a one-table VACUUM, but handling TOAST tables would be
332  * problematic.)
333  *
334  * For ANALYZE (no VACUUM): if inside a transaction block, we cannot
335  * start/commit our own transactions. Also, there's no need to do so if
336  * only processing one relation. For multiple relations when not within a
337  * transaction block, and also in an autovacuum worker, use own
338  * transactions so we can release locks sooner.
339  */
340  if (params->options & VACOPT_VACUUM)
341  use_own_xacts = true;
342  else
343  {
344  Assert(params->options & VACOPT_ANALYZE);
346  use_own_xacts = true;
347  else if (in_outer_xact)
348  use_own_xacts = false;
349  else if (list_length(relations) > 1)
350  use_own_xacts = true;
351  else
352  use_own_xacts = false;
353  }
354 
355  /*
356  * vacuum_rel expects to be entered with no transaction active; it will
357  * start and commit its own transaction. But we are called by an SQL
358  * command, and so we are executing inside a transaction already. We
359  * commit the transaction started in PostgresMain() here, and start
360  * another one before exiting to match the commit waiting for us back in
361  * PostgresMain().
362  */
363  if (use_own_xacts)
364  {
365  Assert(!in_outer_xact);
366 
367  /* ActiveSnapshot is not set by autovacuum */
368  if (ActiveSnapshotSet())
370 
371  /* matches the StartTransaction in PostgresMain() */
373  }
374 
375  /* Turn vacuum cost accounting on or off, and set/clear in_vacuum */
376  PG_TRY();
377  {
378  ListCell *cur;
379 
380  in_vacuum = true;
382  VacuumCostBalance = 0;
383  VacuumPageHit = 0;
384  VacuumPageMiss = 0;
385  VacuumPageDirty = 0;
386 
387  /*
388  * Loop to process each selected relation.
389  */
390  foreach(cur, relations)
391  {
393 
394  if (params->options & VACOPT_VACUUM)
395  {
396  if (!vacuum_rel(vrel->oid, vrel->relation, params))
397  continue;
398  }
399 
400  if (params->options & VACOPT_ANALYZE)
401  {
402  /*
403  * If using separate xacts, start one for analyze. Otherwise,
404  * we can use the outer transaction.
405  */
406  if (use_own_xacts)
407  {
409  /* functions in indexes may want a snapshot set */
411  }
412 
413  analyze_rel(vrel->oid, vrel->relation, params,
414  vrel->va_cols, in_outer_xact, vac_strategy);
415 
416  if (use_own_xacts)
417  {
420  }
421  else
422  {
423  /*
424  * If we're not using separate xacts, better separate the
425  * ANALYZE actions with CCIs. This avoids trouble if user
426  * says "ANALYZE t, t".
427  */
429  }
430  }
431  }
432  }
433  PG_CATCH();
434  {
435  in_vacuum = false;
436  VacuumCostActive = false;
437  PG_RE_THROW();
438  }
439  PG_END_TRY();
440 
441  in_vacuum = false;
442  VacuumCostActive = false;
443 
444  /*
445  * Finish up processing.
446  */
447  if (use_own_xacts)
448  {
449  /* here, we are not in a transaction */
450 
451  /*
452  * This matches the CommitTransaction waiting for us in
453  * PostgresMain().
454  */
456  }
457 
458  if ((params->options & VACOPT_VACUUM) && !IsAutoVacuumWorkerProcess())
459  {
460  /*
461  * Update pg_database.datfrozenxid, and truncate pg_xact if possible.
462  * (autovacuum.c does this for itself.)
463  */
465  }
466 
467  /*
468  * Clean up working storage --- note we must do this after
469  * StartTransactionCommand, else we might be trying to delete the active
470  * context!
471  */
473  vac_context = NULL;
474 }
BufferAccessStrategy GetAccessStrategy(BufferAccessStrategyType btype)
Definition: freelist.c:542
#define NIL
Definition: pg_list.h:65
void analyze_rel(Oid relid, RangeVar *relation, VacuumParams *params, List *va_cols, bool in_outer_xact, BufferAccessStrategy bstrategy)
Definition: analyze.c:118
void MemoryContextDelete(MemoryContext context)
Definition: mcxt.c:211
#define AllocSetContextCreate
Definition: memutils.h:169
int VacuumCostBalance
Definition: globals.c:147
static bool vacuum_rel(Oid relid, RangeVar *relation, VacuumParams *params)
Definition: vacuum.c:1613
RangeVar * relation
Definition: parsenodes.h:3203
void vac_update_datfrozenxid(void)
Definition: vacuum.c:1278
int VacuumPageHit
Definition: globals.c:143
void CommitTransactionCommand(void)
Definition: xact.c:2895
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
static BufferAccessStrategy vac_strategy
Definition: vacuum.c:68
struct cursor * cur
Definition: ecpg.c:28
List * list_concat(List *list1, const List *list2)
Definition: list.c:515
int errcode(int sqlerrcode)
Definition: elog.c:570
void PopActiveSnapshot(void)
Definition: snapmgr.c:814
Snapshot GetTransactionSnapshot(void)
Definition: snapmgr.c:306
static List * expand_vacuum_rel(VacuumRelation *vrel, int options)
Definition: vacuum.c:670
MemoryContext PortalContext
Definition: mcxt.c:53
#define ERROR
Definition: elog.h:43
#define ALLOCSET_DEFAULT_SIZES
Definition: memutils.h:191
#define lfirst_node(type, lc)
Definition: pg_list.h:193
void PushActiveSnapshot(Snapshot snap)
Definition: snapmgr.c:735
static MemoryContext vac_context
Definition: vacuum.c:67
void PreventInTransactionBlock(bool isTopLevel, const char *stmtType)
Definition: xact.c:3328
bool ActiveSnapshotSet(void)
Definition: snapmgr.c:853
bool IsAutoVacuumWorkerProcess(void)
Definition: autovacuum.c:3278
#define ereport(elevel, rest)
Definition: elog.h:141
void pgstat_vacuum_stat(void)
Definition: pgstat.c:1023
bool IsInTransactionBlock(bool isTopLevel)
Definition: xact.c:3442
int VacuumPageDirty
Definition: globals.c:145
void CommandCounterIncrement(void)
Definition: xact.c:1003
#define PG_CATCH()
Definition: elog.h:310
#define Assert(condition)
Definition: c.h:732
void StartTransactionCommand(void)
Definition: xact.c:2794
static int list_length(const List *l)
Definition: pg_list.h:169
#define PG_RE_THROW()
Definition: elog.h:331
int errmsg(const char *fmt,...)
Definition: elog.c:784
double VacuumCostDelay
Definition: globals.c:141
int options
Definition: vacuum.h:172
int VacuumPageMiss
Definition: globals.c:144
#define PG_TRY()
Definition: elog.h:301
Definition: pg_list.h:50
#define PG_END_TRY()
Definition: elog.h:317
bool VacuumCostActive
Definition: globals.c:148
static List * get_all_vacuum_rels(int options)
Definition: vacuum.c:809

◆ vacuum_delay_point()

void vacuum_delay_point ( void  )

Definition at line 1940 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(), gistvacuumpage(), hashbucketcleanup(), lazy_scan_heap(), lazy_vacuum_heap(), spgprocesspending(), and spgvacuumpage().

1941 {
1942  /* Always check for interrupts */
1944 
1945  /* Nap if appropriate */
1948  {
1949  double msec;
1950 
1952  if (msec > VacuumCostDelay * 4)
1953  msec = VacuumCostDelay * 4;
1954 
1955  pg_usleep((long) (msec * 1000));
1956 
1957  VacuumCostBalance = 0;
1958 
1959  /* update balance values for workers */
1961 
1962  /* Might have gotten an interrupt while sleeping */
1964  }
1965 }
int VacuumCostBalance
Definition: globals.c:147
void pg_usleep(long microsec)
Definition: signal.c:53
int VacuumCostLimit
Definition: globals.c:140
volatile sig_atomic_t InterruptPending
Definition: globals.c:30
double VacuumCostDelay
Definition: globals.c:141
void AutoVacuumUpdateDelay(void)
Definition: autovacuum.c:1760
#define CHECK_FOR_INTERRUPTS()
Definition: miscadmin.h:99
bool VacuumCostActive
Definition: globals.c:148

◆ vacuum_is_relation_owner()

bool vacuum_is_relation_owner ( Oid  relid,
Form_pg_class  reltuple,
int  options 
)

Definition at line 484 of file vacuum.c.

References Assert, ereport, errmsg(), GetUserId(), MyDatabaseId, NameStr, pg_class_ownercheck(), pg_database_ownercheck(), relname, VACOPT_ANALYZE, VACOPT_VACUUM, and WARNING.

Referenced by analyze_rel(), expand_vacuum_rel(), get_all_vacuum_rels(), and vacuum_rel().

485 {
486  char *relname;
487 
489 
490  /*
491  * Check permissions.
492  *
493  * We allow the user to vacuum or analyze a table if he is superuser, the
494  * table owner, or the database owner (but in the latter case, only if
495  * it's not a shared relation). pg_class_ownercheck includes the
496  * superuser case.
497  *
498  * Note we choose to treat permissions failure as a WARNING and keep
499  * trying to vacuum or analyze the rest of the DB --- is this appropriate?
500  */
501  if (pg_class_ownercheck(relid, GetUserId()) ||
502  (pg_database_ownercheck(MyDatabaseId, GetUserId()) && !reltuple->relisshared))
503  return true;
504 
505  relname = NameStr(reltuple->relname);
506 
507  if ((options & VACOPT_VACUUM) != 0)
508  {
509  if (reltuple->relisshared)
511  (errmsg("skipping \"%s\" --- only superuser can vacuum it",
512  relname)));
513  else if (reltuple->relnamespace == PG_CATALOG_NAMESPACE)
515  (errmsg("skipping \"%s\" --- only superuser or database owner can vacuum it",
516  relname)));
517  else
519  (errmsg("skipping \"%s\" --- only table or database owner can vacuum it",
520  relname)));
521 
522  /*
523  * For VACUUM ANALYZE, both logs could show up, but just generate
524  * information for VACUUM as that would be the first one to be
525  * processed.
526  */
527  return false;
528  }
529 
530  if ((options & VACOPT_ANALYZE) != 0)
531  {
532  if (reltuple->relisshared)
534  (errmsg("skipping \"%s\" --- only superuser can analyze it",
535  relname)));
536  else if (reltuple->relnamespace == PG_CATALOG_NAMESPACE)
538  (errmsg("skipping \"%s\" --- only superuser or database owner can analyze it",
539  relname)));
540  else
542  (errmsg("skipping \"%s\" --- only table or database owner can analyze it",
543  relname)));
544  }
545 
546  return false;
547 }
Oid GetUserId(void)
Definition: miscinit.c:380
NameData relname
Definition: pg_class.h:35
#define ereport(elevel, rest)
Definition: elog.h:141
bool pg_database_ownercheck(Oid db_oid, Oid roleid)
Definition: aclchk.c:5173
#define WARNING
Definition: elog.h:40
Oid MyDatabaseId
Definition: globals.c:85
#define Assert(condition)
Definition: c.h:732
bool pg_class_ownercheck(Oid class_oid, Oid roleid)
Definition: aclchk.c:4755
int errmsg(const char *fmt,...)
Definition: elog.c:784
#define NameStr(name)
Definition: c.h:609

◆ vacuum_open_relation()

Relation vacuum_open_relation ( Oid  relid,
RangeVar relation,
int  options,
bool  verbose,
LOCKMODE  lmode 
)

Definition at line 558 of file vacuum.c.

References Assert, ConditionalLockRelationOid(), elevel, ereport, errcode(), ERRCODE_UNDEFINED_TABLE, errmsg(), IsAutoVacuumWorkerProcess(), LOG, NoLock, RangeVar::relname, try_relation_open(), VACOPT_ANALYZE, VACOPT_SKIP_LOCKED, VACOPT_VACUUM, and WARNING.

Referenced by analyze_rel(), and vacuum_rel().

560 {
561  Relation onerel;
562  bool rel_lock = true;
563  int elevel;
564 
566 
567  /*
568  * Open the relation and get the appropriate lock on it.
569  *
570  * There's a race condition here: the relation may have gone away since
571  * the last time we saw it. If so, we don't need to vacuum or analyze it.
572  *
573  * If we've been asked not to wait for the relation lock, acquire it first
574  * in non-blocking mode, before calling try_relation_open().
575  */
576  if (!(options & VACOPT_SKIP_LOCKED))
577  onerel = try_relation_open(relid, lmode);
578  else if (ConditionalLockRelationOid(relid, lmode))
579  onerel = try_relation_open(relid, NoLock);
580  else
581  {
582  onerel = NULL;
583  rel_lock = false;
584  }
585 
586  /* if relation is opened, leave */
587  if (onerel)
588  return onerel;
589 
590  /*
591  * Relation could not be opened, hence generate if possible a log
592  * informing on the situation.
593  *
594  * If the RangeVar is not defined, we do not have enough information to
595  * provide a meaningful log statement. Chances are that the caller has
596  * intentionally not provided this information so that this logging is
597  * skipped, anyway.
598  */
599  if (relation == NULL)
600  return NULL;
601 
602  /*
603  * Determine the log level.
604  *
605  * For manual VACUUM or ANALYZE, we emit a WARNING to match the log
606  * statements in the permission checks; otherwise, only log if the caller
607  * so requested.
608  */
610  elevel = WARNING;
611  else if (verbose)
612  elevel = LOG;
613  else
614  return NULL;
615 
616  if ((options & VACOPT_VACUUM) != 0)
617  {
618  if (!rel_lock)
619  ereport(elevel,
620  (errcode(ERRCODE_LOCK_NOT_AVAILABLE),
621  errmsg("skipping vacuum of \"%s\" --- lock not available",
622  relation->relname)));
623  else
624  ereport(elevel,
626  errmsg("skipping vacuum of \"%s\" --- relation no longer exists",
627  relation->relname)));
628 
629  /*
630  * For VACUUM ANALYZE, both logs could show up, but just generate
631  * information for VACUUM as that would be the first one to be
632  * processed.
633  */
634  return NULL;
635  }
636 
637  if ((options & VACOPT_ANALYZE) != 0)
638  {
639  if (!rel_lock)
640  ereport(elevel,
641  (errcode(ERRCODE_LOCK_NOT_AVAILABLE),
642  errmsg("skipping analyze of \"%s\" --- lock not available",
643  relation->relname)));
644  else
645  ereport(elevel,
647  errmsg("skipping analyze of \"%s\" --- relation no longer exists",
648  relation->relname)));
649  }
650 
651  return NULL;
652 }
bool ConditionalLockRelationOid(Oid relid, LOCKMODE lockmode)
Definition: lmgr.c:151
#define ERRCODE_UNDEFINED_TABLE
Definition: pgbench.c:72
int errcode(int sqlerrcode)
Definition: elog.c:570
#define LOG
Definition: elog.h:26
Relation try_relation_open(Oid relationId, LOCKMODE lockmode)
Definition: relation.c:89
char * relname
Definition: primnodes.h:68
#define NoLock
Definition: lockdefs.h:34
bool IsAutoVacuumWorkerProcess(void)
Definition: autovacuum.c:3278
#define ereport(elevel, rest)
Definition: elog.h:141
static int verbose
Definition: pg_basebackup.c:94
#define WARNING
Definition: elog.h:40
static int elevel
Definition: vacuumlazy.c:143
#define Assert(condition)
Definition: c.h:732
int errmsg(const char *fmt,...)
Definition: elog.c:784

◆ 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 880 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_table_data(), and heap_vacuum_rel().

890 {
891  int freezemin;
892  int mxid_freezemin;
893  int effective_multixact_freeze_max_age;
894  TransactionId limit;
895  TransactionId safeLimit;
896  MultiXactId mxactLimit;
897  MultiXactId safeMxactLimit;
898 
899  /*
900  * We can always ignore processes running lazy vacuum. This is because we
901  * use these values only for deciding which tuples we must keep in the
902  * tables. Since lazy vacuum doesn't write its XID anywhere, it's safe to
903  * ignore it. In theory it could be problematic to ignore lazy vacuums in
904  * a full vacuum, but keep in mind that only one vacuum process can be
905  * working on a particular table at any time, and that each vacuum is
906  * always an independent transaction.
907  */
908  *oldestXmin =
910 
911  Assert(TransactionIdIsNormal(*oldestXmin));
912 
913  /*
914  * Determine the minimum freeze age to use: as specified by the caller, or
915  * vacuum_freeze_min_age, but in any case not more than half
916  * autovacuum_freeze_max_age, so that autovacuums to prevent XID
917  * wraparound won't occur too frequently.
918  */
919  freezemin = freeze_min_age;
920  if (freezemin < 0)
921  freezemin = vacuum_freeze_min_age;
922  freezemin = Min(freezemin, autovacuum_freeze_max_age / 2);
923  Assert(freezemin >= 0);
924 
925  /*
926  * Compute the cutoff XID, being careful not to generate a "permanent" XID
927  */
928  limit = *oldestXmin - freezemin;
929  if (!TransactionIdIsNormal(limit))
930  limit = FirstNormalTransactionId;
931 
932  /*
933  * If oldestXmin is very far back (in practice, more than
934  * autovacuum_freeze_max_age / 2 XIDs old), complain and force a minimum
935  * freeze age of zero.
936  */
938  if (!TransactionIdIsNormal(safeLimit))
939  safeLimit = FirstNormalTransactionId;
940 
941  if (TransactionIdPrecedes(limit, safeLimit))
942  {
944  (errmsg("oldest xmin is far in the past"),
945  errhint("Close open transactions soon to avoid wraparound problems.\n"
946  "You might also need to commit or roll back old prepared transactions, or drop stale replication slots.")));
947  limit = *oldestXmin;
948  }
949 
950  *freezeLimit = limit;
951 
952  /*
953  * Compute the multixact age for which freezing is urgent. This is
954  * normally autovacuum_multixact_freeze_max_age, but may be less if we are
955  * short of multixact member space.
956  */
957  effective_multixact_freeze_max_age = MultiXactMemberFreezeThreshold();
958 
959  /*
960  * Determine the minimum multixact freeze age to use: as specified by
961  * caller, or vacuum_multixact_freeze_min_age, but in any case not more
962  * than half effective_multixact_freeze_max_age, so that autovacuums to
963  * prevent MultiXact wraparound won't occur too frequently.
964  */
965  mxid_freezemin = multixact_freeze_min_age;
966  if (mxid_freezemin < 0)
967  mxid_freezemin = vacuum_multixact_freeze_min_age;
968  mxid_freezemin = Min(mxid_freezemin,
969  effective_multixact_freeze_max_age / 2);
970  Assert(mxid_freezemin >= 0);
971 
972  /* compute the cutoff multi, being careful to generate a valid value */
973  mxactLimit = GetOldestMultiXactId() - mxid_freezemin;
974  if (mxactLimit < FirstMultiXactId)
975  mxactLimit = FirstMultiXactId;
976 
977  safeMxactLimit =
978  ReadNextMultiXactId() - effective_multixact_freeze_max_age;
979  if (safeMxactLimit < FirstMultiXactId)
980  safeMxactLimit = FirstMultiXactId;
981 
982  if (MultiXactIdPrecedes(mxactLimit, safeMxactLimit))
983  {
985  (errmsg("oldest multixact is far in the past"),
986  errhint("Close open transactions with multixacts soon to avoid wraparound problems.")));
987  mxactLimit = safeMxactLimit;
988  }
989 
990  *multiXactCutoff = mxactLimit;
991 
992  if (xidFullScanLimit != NULL)
993  {
994  int freezetable;
995 
996  Assert(mxactFullScanLimit != NULL);
997 
998  /*
999  * Determine the table freeze age to use: as specified by the caller,
1000  * or vacuum_freeze_table_age, but in any case not more than
1001  * autovacuum_freeze_max_age * 0.95, so that if you have e.g nightly
1002  * VACUUM schedule, the nightly VACUUM gets a chance to freeze tuples
1003  * before anti-wraparound autovacuum is launched.
1004  */
1005  freezetable = freeze_table_age;
1006  if (freezetable < 0)
1007  freezetable = vacuum_freeze_table_age;
1008  freezetable = Min(freezetable, autovacuum_freeze_max_age * 0.95);
1009  Assert(freezetable >= 0);
1010 
1011  /*
1012  * Compute XID limit causing a full-table vacuum, being careful not to
1013  * generate a "permanent" XID.
1014  */
1015  limit = ReadNewTransactionId() - freezetable;
1016  if (!TransactionIdIsNormal(limit))
1017  limit = FirstNormalTransactionId;
1018 
1019  *xidFullScanLimit = limit;
1020 
1021  /*
1022  * Similar to the above, determine the table freeze age to use for
1023  * multixacts: as specified by the caller, or
1024  * vacuum_multixact_freeze_table_age, but in any case not more than
1025  * autovacuum_multixact_freeze_table_age * 0.95, so that if you have
1026  * e.g. nightly VACUUM schedule, the nightly VACUUM gets a chance to
1027  * freeze multixacts before anti-wraparound autovacuum is launched.
1028  */
1029  freezetable = multixact_freeze_table_age;
1030  if (freezetable < 0)
1031  freezetable = vacuum_multixact_freeze_table_age;
1032  freezetable = Min(freezetable,
1033  effective_multixact_freeze_max_age * 0.95);
1034  Assert(freezetable >= 0);
1035 
1036  /*
1037  * Compute MultiXact limit causing a full-table vacuum, being careful
1038  * to generate a valid MultiXact value.
1039  */
1040  mxactLimit = ReadNextMultiXactId() - freezetable;
1041  if (mxactLimit < FirstMultiXactId)
1042  mxactLimit = FirstMultiXactId;
1043 
1044  *mxactFullScanLimit = mxactLimit;
1045  }
1046  else
1047  {
1048  Assert(mxactFullScanLimit == NULL);
1049  }
1050 }
int errhint(const char *fmt,...)
Definition: elog.c:974
int vacuum_multixact_freeze_table_age
Definition: vacuum.c:63
uint32 TransactionId
Definition: c.h:507
#define Min(x, y)
Definition: c.h:904
TransactionId TransactionIdLimitedForOldSnapshots(TransactionId recentXmin, Relation relation)
Definition: snapmgr.c:1775
#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:62
#define FirstMultiXactId
Definition: multixact.h:24
#define ereport(elevel, rest)
Definition: elog.h:141
int MultiXactMemberFreezeThreshold(void)
Definition: multixact.c:2819
bool TransactionIdPrecedes(TransactionId id1, TransactionId id2)
Definition: transam.c:300
#define WARNING
Definition: elog.h:40
MultiXactId GetOldestMultiXactId(void)
Definition: multixact.c:2493
TransactionId GetOldestXmin(Relation rel, int flags)
Definition: procarray.c:1304
TransactionId MultiXactId
Definition: c.h:517
#define Assert(condition)
Definition: c.h:732
int vacuum_freeze_min_age
Definition: vacuum.c:60
bool MultiXactIdPrecedes(MultiXactId multi1, MultiXactId multi2)
Definition: multixact.c:3142
int vacuum_freeze_table_age
Definition: vacuum.c:61
static TransactionId ReadNewTransactionId(void)
Definition: transam.h:244
int errmsg(const char *fmt,...)
Definition: elog.c:784
#define TransactionIdIsNormal(xid)
Definition: transam.h:42
MultiXactId ReadNextMultiXactId(void)
Definition: multixact.c:723

Variable Documentation

◆ default_statistics_target

PGDLLIMPORT int default_statistics_target

◆ vacuum_freeze_min_age

int vacuum_freeze_min_age

Definition at line 60 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 61 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 62 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 63 of file vacuum.c.

Referenced by do_autovacuum(), and vacuum_set_xid_limits().