60 #include "utils/fmgroids.h"
93 bool inh,
bool in_outer_xact,
int elevel);
102 double *totalrows,
double *totaldeadrows);
106 double *totalrows,
double *totaldeadrows);
201 if (onerel->
rd_rel->relkind == RELKIND_RELATION ||
202 onerel->
rd_rel->relkind == RELKIND_MATVIEW)
209 else if (onerel->
rd_rel->relkind == RELKIND_FOREIGN_TABLE)
228 (
errmsg(
"skipping \"%s\" --- cannot analyze this foreign table",
234 else if (onerel->
rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
245 (
errmsg(
"skipping \"%s\" --- cannot analyze non-tables or special system tables",
261 if (onerel->
rd_rel->relkind != RELKIND_PARTITIONED_TABLE)
263 relpages,
false, in_outer_xact, elevel);
268 if (onerel->
rd_rel->relhassubclass)
270 true, in_outer_xact, elevel);
293 BlockNumber relpages,
bool inh,
bool in_outer_xact,
315 int save_sec_context;
325 (
errmsg(
"analyzing \"%s.%s\" inheritance tree",
330 (
errmsg(
"analyzing \"%s.%s\"",
389 (
errcode(ERRCODE_UNDEFINED_COLUMN),
390 errmsg(
"column \"%s\" of relation \"%s\" does not exist",
394 (
errcode(ERRCODE_DUPLICATE_COLUMN),
395 errmsg(
"column \"%s\" of relation \"%s\" appears more than once",
400 if (vacattrstats[tcnt] != NULL)
411 for (
i = 1;
i <= attr_cnt;
i++)
414 if (vacattrstats[tcnt] != NULL)
429 if (onerel->
rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
435 hasindex = idxs !=
NIL;
441 hasindex = nindexes > 0;
476 if (indexpr_item == NULL)
477 elog(
ERROR,
"too few entries in indexprs list");
499 for (
i = 0;
i < attr_cnt;
i++)
501 if (targrows < vacattrstats[
i]->minrows)
502 targrows = vacattrstats[
i]->
minrows;
510 if (targrows < thisdata->vacattrstats[
i]->minrows)
522 if (targrows < minrows)
535 &totalrows, &totaldeadrows);
537 numrows = (*acquirefunc) (onerel, elevel,
539 &totalrows, &totaldeadrows);
560 for (
i = 0;
i < attr_cnt;
i++)
582 if (n_distinct != 0.0)
604 attr_cnt, vacattrstats);
616 attr_cnt, vacattrstats);
654 double totalindexrows;
656 totalindexrows = ceil(thisdata->
tupleFract * totalrows);
668 else if (onerel->
rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
693 else if (onerel->
rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
738 double read_rate = 0;
739 double write_rate = 0;
775 read_rate = (double) BLCKSZ * AnalyzePageMiss / (1024 * 1024) /
776 (delay_in_ms / 1000.0);
777 write_rate = (double) BLCKSZ * AnalyzePageDirty / (1024 * 1024) /
778 (delay_in_ms / 1000.0);
800 read_rate, write_rate);
802 (
long long) AnalyzePageHit,
803 (
long long) AnalyzePageMiss,
804 (
long long) AnalyzePageDirty);
861 double totalindexrows;
886 exprnulls = (
bool *)
palloc(numrows * attr_cnt *
sizeof(
bool));
889 for (rowno = 0; rowno < numrows; rowno++)
905 if (predicate != NULL)
928 for (
i = 0;
i < attr_cnt;
i++)
935 exprvals[tcnt] = (
Datum) 0;
936 exprnulls[tcnt] =
true;
943 exprnulls[tcnt] =
false;
954 thisdata->
tupleFract = (double) numindexrows / (
double) numrows;
955 totalindexrows = ceil(thisdata->
tupleFract * totalrows);
960 if (numindexrows > 0)
963 for (
i = 0;
i < attr_cnt;
i++)
1010 if (attr->attisdropped)
1014 if (attr->attstattarget == 0)
1131 double *totalrows,
double *totaldeadrows)
1134 double samplerows = 0;
1135 double liverows = 0;
1136 double deadrows = 0;
1137 double rowstoskip = -1;
1148 int prefetch_maximum = 0;
1166 if (prefetch_maximum)
1189 if (prefetch_maximum)
1191 for (
int i = 0;
i < prefetch_maximum;
i++)
1207 bool block_accepted;
1242 if (!block_accepted)
1259 if (numrows < targrows)
1271 if (rowstoskip <= 0)
1279 Assert(k >= 0 && k < targrows);
1305 if (numrows == targrows)
1318 *totalrows = floor((liverows / bs.
m) * totalblocks + 0.5);
1319 *totaldeadrows = floor((deadrows / bs.
m) * totalblocks + 0.5);
1324 *totaldeadrows = 0.0;
1331 (
errmsg(
"\"%s\": scanned %d of %u pages, "
1332 "containing %.0f live rows and %.0f dead rows; "
1333 "%d rows in sample, %.0f estimated total rows",
1337 numrows, *totalrows)));
1378 double *totalrows,
double *totaldeadrows)
1415 (
errmsg(
"skipping analyze of \"%s.%s\" inheritance tree --- this inheritance tree contains no child tables",
1432 foreach(lc, tableOIDs)
1446 Assert(childrel != onerel);
1452 if (childrel->
rd_rel->relkind == RELKIND_RELATION ||
1453 childrel->
rd_rel->relkind == RELKIND_MATVIEW)
1459 else if (childrel->
rd_rel->relkind == RELKIND_FOREIGN_TABLE)
1478 Assert(childrel != onerel);
1489 Assert(childrel->
rd_rel->relkind == RELKIND_PARTITIONED_TABLE);
1490 if (childrel != onerel)
1499 rels[nrels] = childrel;
1500 acquirefuncs[nrels] = acquirefunc;
1501 relblocks[nrels] = (double) relpages;
1502 totalblocks += (double) relpages;
1513 (
errmsg(
"skipping analyze of \"%s.%s\" inheritance tree --- this inheritance tree contains no analyzable child tables",
1528 for (
i = 0;
i < nrels;
i++)
1532 double childblocks = relblocks[
i];
1540 const int progress_index[] = {
1545 const int64 progress_vals[] = {
1554 if (childblocks > 0)
1558 childtargrows = (int) rint(targrows * childblocks / totalblocks);
1560 childtargrows =
Min(childtargrows, targrows - numrows);
1561 if (childtargrows > 0)
1568 childrows = (*acquirefunc) (childrel, elevel,
1569 rows + numrows, childtargrows,
1573 if (childrows > 0 &&
1585 for (
j = 0;
j < childrows;
j++)
1591 rows[numrows +
j] = newtup;
1598 numrows += childrows;
1599 *totalrows += trows;
1600 *totaldeadrows += tdrows;
1651 for (attno = 0; attno < natts; attno++)
1660 bool nulls[Natts_pg_statistic];
1661 bool replaces[Natts_pg_statistic];
1670 for (
i = 0;
i < Natts_pg_statistic; ++
i)
1682 i = Anum_pg_statistic_stakind1 - 1;
1687 i = Anum_pg_statistic_staop1 - 1;
1692 i = Anum_pg_statistic_stacoll1 - 1;
1697 i = Anum_pg_statistic_stanumbers1 - 1;
1707 for (n = 0; n < nnum; n++)
1718 i = Anum_pg_statistic_stavalues1 - 1;
1747 if (indstate == NULL)
1771 if (indstate != NULL)
1829 #define WIDTH_THRESHOLD 1024
1831 #define swapInt(a,b) do {int _tmp; _tmp=a; a=b; b=_tmp;} while(0)
1832 #define swapDatum(a,b) do {Datum _tmp; _tmp=a; a=b; b=_tmp;} while(0)
1888 false,
false,
false,
1889 <opr, &eqopr, NULL,
1894 mystats->
eqopr = eqopr;
1896 mystats->
ltopr = ltopr;
1961 int nonnull_cnt = 0;
1962 double total_width = 0;
1963 bool is_varlena = (!stats->
attrtype->typbyval &&
1965 bool is_varwidth = (!stats->
attrtype->typbyval &&
1968 for (
i = 0;
i < samplerows;
i++)
1975 value = fetchfunc(stats,
i, &isnull);
1995 else if (is_varwidth)
2003 if (nonnull_cnt > 0)
2007 stats->
stanullfrac = (double) null_cnt / (
double) samplerows;
2009 stats->
stawidth = total_width / (double) nonnull_cnt;
2014 else if (null_cnt > 0)
2051 int nonnull_cnt = 0;
2052 int toowide_cnt = 0;
2053 double total_width = 0;
2054 bool is_varlena = (!stats->
attrtype->typbyval &&
2056 bool is_varwidth = (!stats->
attrtype->typbyval &&
2073 track_max = 2 * num_mcv;
2081 for (
i = 0;
i < samplerows;
i++)
2091 value = fetchfunc(stats,
i, &isnull);
2125 else if (is_varwidth)
2135 firstcount1 = track_cnt;
2136 for (
j = 0;
j < track_cnt;
j++)
2145 if (
j < firstcount1 && track[
j].count == 1)
2154 while (
j > 0 && track[
j].count > track[
j - 1].count)
2157 swapInt(track[
j].count, track[
j - 1].count);
2164 if (track_cnt < track_max)
2166 for (
j = track_cnt - 1;
j > firstcount1;
j--)
2168 track[
j].value = track[
j - 1].value;
2169 track[
j].count = track[
j - 1].count;
2171 if (firstcount1 < track_cnt)
2173 track[firstcount1].value =
value;
2174 track[firstcount1].count = 1;
2180 if (nonnull_cnt > 0)
2187 stats->
stanullfrac = (double) null_cnt / (
double) samplerows;
2189 stats->
stawidth = total_width / (double) nonnull_cnt;
2195 for (nmultiple = 0; nmultiple < track_cnt; nmultiple++)
2197 if (track[nmultiple].count == 1)
2199 summultiple += track[nmultiple].count;
2210 else if (track_cnt < track_max && toowide_cnt == 0 &&
2211 nmultiple == track_cnt)
2250 int f1 = nonnull_cnt - summultiple;
2251 int d =
f1 + nmultiple;
2252 double n = samplerows - null_cnt;
2253 double N = totalrows * (1.0 - stats->
stanullfrac);
2258 stadistinct = (n * d) / ((n -
f1) +
f1 * n / N);
2263 if (stadistinct < d)
2265 if (stadistinct > N)
2296 if (track_cnt < track_max && toowide_cnt == 0 &&
2298 track_cnt <= num_mcv)
2301 num_mcv = track_cnt;
2308 if (num_mcv > track_cnt)
2309 num_mcv = track_cnt;
2313 mcv_counts = (
int *)
palloc(num_mcv *
sizeof(
int));
2314 for (
i = 0;
i < num_mcv;
i++)
2315 mcv_counts[
i] = track[
i].count;
2320 samplerows, totalrows);
2335 for (
i = 0;
i < num_mcv;
i++)
2340 mcv_freqs[
i] = (double) track[
i].count / (
double) samplerows;
2344 stats->
stakind[0] = STATISTIC_KIND_MCV;
2358 else if (null_cnt > 0)
2394 int nonnull_cnt = 0;
2395 int toowide_cnt = 0;
2396 double total_width = 0;
2397 bool is_varlena = (!stats->
attrtype->typbyval &&
2399 bool is_varwidth = (!stats->
attrtype->typbyval &&
2413 tupnoLink = (
int *)
palloc(samplerows *
sizeof(
int));
2416 memset(&ssup, 0,
sizeof(ssup));
2431 for (
i = 0;
i < samplerows;
i++)
2438 value = fetchfunc(stats,
i, &isnull);
2472 else if (is_varwidth)
2480 values[values_cnt].tupno = values_cnt;
2481 tupnoLink[values_cnt] = values_cnt;
2524 for (
i = 0;
i < values_cnt;
i++)
2528 corr_xysum += ((double)
i) * ((double) tupno);
2530 if (tupnoLink[tupno] == tupno)
2537 if (track_cnt < num_mcv ||
2538 dups_cnt > track[track_cnt - 1].count)
2548 if (track_cnt < num_mcv)
2550 for (
j = track_cnt - 1;
j > 0;
j--)
2552 if (dups_cnt <= track[
j - 1].count)
2557 track[
j].
count = dups_cnt;
2558 track[
j].
first =
i + 1 - dups_cnt;
2567 stats->
stanullfrac = (double) null_cnt / (
double) samplerows;
2569 stats->
stawidth = total_width / (double) nonnull_cnt;
2581 else if (toowide_cnt == 0 && nmultiple == ndistinct)
2615 int f1 = ndistinct - nmultiple + toowide_cnt;
2616 int d =
f1 + nmultiple;
2617 double n = samplerows - null_cnt;
2618 double N = totalrows * (1.0 - stats->
stanullfrac);
2623 stadistinct = (n * d) / ((n -
f1) +
f1 * n / N);
2628 if (stadistinct < d)
2630 if (stadistinct > N)
2661 if (track_cnt == ndistinct && toowide_cnt == 0 &&
2663 track_cnt <= num_mcv)
2666 num_mcv = track_cnt;
2673 if (num_mcv > track_cnt)
2674 num_mcv = track_cnt;
2678 mcv_counts = (
int *)
palloc(num_mcv *
sizeof(
int));
2679 for (
i = 0;
i < num_mcv;
i++)
2680 mcv_counts[
i] = track[
i].count;
2685 samplerows, totalrows);
2700 for (
i = 0;
i < num_mcv;
i++)
2705 mcv_freqs[
i] = (double) track[
i].count / (
double) samplerows;
2709 stats->
stakind[slot_idx] = STATISTIC_KIND_MCV;
2714 stats->
stavalues[slot_idx] = mcv_values;
2729 num_hist = ndistinct - num_mcv;
2730 if (num_hist > num_bins)
2731 num_hist = num_bins + 1;
2761 while (src < values_cnt)
2767 int first = track[
j].
first;
2772 src = first + track[
j].
count;
2776 ncopy = first - src;
2779 ncopy = values_cnt - src;
2789 Assert(nvals >= num_hist);
2804 delta = (nvals - 1) / (num_hist - 1);
2805 deltafrac = (nvals - 1) % (num_hist - 1);
2808 for (
i = 0;
i < num_hist;
i++)
2814 posfrac += deltafrac;
2815 if (posfrac >= (num_hist - 1))
2819 posfrac -= (num_hist - 1);
2825 stats->
stakind[slot_idx] = STATISTIC_KIND_HISTOGRAM;
2828 stats->
stavalues[slot_idx] = hist_values;
2860 corr_xsum = ((double) (values_cnt - 1)) *
2861 ((
double) values_cnt) / 2.0;
2862 corr_x2sum = ((double) (values_cnt - 1)) *
2863 ((
double) values_cnt) * (
double) (2 * values_cnt - 1) / 6.0;
2866 corrs[0] = (values_cnt * corr_xysum - corr_xsum * corr_xsum) /
2867 (values_cnt * corr_x2sum - corr_xsum * corr_xsum);
2869 stats->
stakind[slot_idx] = STATISTIC_KIND_CORRELATION;
2877 else if (nonnull_cnt > 0)
2880 Assert(nonnull_cnt == toowide_cnt);
2883 stats->
stanullfrac = (double) null_cnt / (
double) samplerows;
2885 stats->
stawidth = total_width / (double) nonnull_cnt;
2891 else if (null_cnt > 0)
2972 double ndistinct_table;
2980 if (samplerows == totalrows || totalrows <= 1.0)
2984 ndistinct_table = stadistinct;
2985 if (ndistinct_table < 0)
2986 ndistinct_table = -ndistinct_table * totalrows;
3008 for (
i = 0;
i < num_mcv - 1;
i++)
3009 sumcount += mcv_counts[
i];
3025 selec = 1.0 - sumcount / samplerows - stanullfrac;
3030 otherdistinct = ndistinct_table - (num_mcv - 1);
3031 if (otherdistinct > 1)
3032 selec /= otherdistinct;
3052 K = N * mcv_counts[num_mcv - 1] / n;
3053 variance = n *
K * (N -
K) * (N - n) / (N * N * (N - 1));
3054 stddev = sqrt(variance);
3056 if (mcv_counts[num_mcv - 1] > selec * samplerows + 2 * stddev + 0.5)
3071 sumcount -= mcv_counts[num_mcv - 1];
ArrayType * construct_array_builtin(Datum *elems, int nelems, Oid elmtype)
ArrayType * construct_array(Datum *elems, int nelems, Oid elmtype, int elmlen, bool elmbyval, char elmalign)
#define InvalidAttrNumber
AttributeOpts * get_attribute_options(Oid attrelid, int attnum)
bool IsAutoVacuumWorkerProcess(void)
long TimestampDifferenceMilliseconds(TimestampTz start_time, TimestampTz stop_time)
bool TimestampDifferenceExceeds(TimestampTz start_time, TimestampTz stop_time, int msec)
TimestampTz GetCurrentTimestamp(void)
void pgstat_progress_start_command(ProgressCommandType cmdtype, Oid relid)
void pgstat_progress_update_param(int index, int64 val)
void pgstat_progress_update_multi_param(int nparam, const int *index, const int64 *val)
void pgstat_progress_end_command(void)
@ PROGRESS_COMMAND_ANALYZE
bool bms_is_member(int x, const Bitmapset *a)
Bitmapset * bms_add_member(Bitmapset *a, int x)
#define InvalidBlockNumber
static Datum values[MAXATTR]
PrefetchBufferResult PrefetchBuffer(Relation reln, ForkNumber forkNum, BlockNumber blockNum)
#define RelationGetNumberOfBlocks(reln)
#define OidIsValid(objectId)
static Datum std_fetch_func(VacAttrStatsP stats, int rownum, bool *isNull)
static void compute_scalar_stats(VacAttrStatsP stats, AnalyzeAttrFetchFunc fetchfunc, int samplerows, double totalrows)
static void update_attstats(Oid relid, bool inh, int natts, VacAttrStats **vacattrstats)
int default_statistics_target
static void compute_distinct_stats(VacAttrStatsP stats, AnalyzeAttrFetchFunc fetchfunc, int samplerows, double totalrows)
static MemoryContext anl_context
bool std_typanalyze(VacAttrStats *stats)
static int analyze_mcv_list(int *mcv_counts, int num_mcv, double stadistinct, double stanullfrac, int samplerows, double totalrows)
static int acquire_inherited_sample_rows(Relation onerel, int elevel, HeapTuple *rows, int targrows, double *totalrows, double *totaldeadrows)
static BufferAccessStrategy vac_strategy
static int compare_mcvs(const void *a, const void *b, void *arg)
struct AnlIndexData AnlIndexData
static int acquire_sample_rows(Relation onerel, int elevel, HeapTuple *rows, int targrows, double *totalrows, double *totaldeadrows)
static void compute_trivial_stats(VacAttrStatsP stats, AnalyzeAttrFetchFunc fetchfunc, int samplerows, double totalrows)
static int compare_scalars(const void *a, const void *b, void *arg)
static Datum ind_fetch_func(VacAttrStatsP stats, int rownum, bool *isNull)
void analyze_rel(Oid relid, RangeVar *relation, VacuumParams *params, List *va_cols, bool in_outer_xact, BufferAccessStrategy bstrategy)
static void do_analyze_rel(Relation onerel, VacuumParams *params, List *va_cols, AcquireSampleRowsFunc acquirefunc, BlockNumber relpages, bool inh, bool in_outer_xact, int elevel)
static VacAttrStats * examine_attribute(Relation onerel, int attnum, Node *index_expr)
static int compare_rows(const void *a, const void *b, void *arg)
static void compute_index_stats(Relation onerel, double totalrows, AnlIndexData *indexdata, int nindexes, HeapTuple *rows, int numrows, MemoryContext col_context)
Datum datumCopy(Datum value, bool typByVal, int typLen)
char * get_database_name(Oid dbid)
elog(ERROR, "%s: %s", p2, msg)
Size toast_raw_datum_size(Datum value)
int errmsg_internal(const char *fmt,...)
int errcode(int sqlerrcode)
int errmsg(const char *fmt,...)
#define ereport(elevel,...)
ExprState * ExecPrepareQual(List *qual, EState *estate)
void ExecDropSingleTupleTableSlot(TupleTableSlot *slot)
TupleTableSlot * ExecStoreHeapTuple(HeapTuple tuple, TupleTableSlot *slot, bool shouldFree)
const TupleTableSlotOps TTSOpsHeapTuple
TupleTableSlot * MakeSingleTupleTableSlot(TupleDesc tupdesc, const TupleTableSlotOps *tts_ops)
EState * CreateExecutorState(void)
void FreeExecutorState(EState *estate)
#define GetPerTupleExprContext(estate)
#define ResetExprContext(econtext)
static bool ExecQual(ExprState *state, ExprContext *econtext)
int ComputeExtStatisticsRows(Relation onerel, int natts, VacAttrStats **vacattrstats)
void BuildRelationExtStatistics(Relation onerel, bool inh, double totalrows, int numrows, HeapTuple *rows, int natts, VacAttrStats **vacattrstats)
int(* AcquireSampleRowsFunc)(Relation relation, int elevel, HeapTuple *rows, int targrows, double *totalrows, double *totaldeadrows)
Datum FunctionCall2Coll(FmgrInfo *flinfo, Oid collation, Datum arg1, Datum arg2)
void fmgr_info(Oid functionId, FmgrInfo *finfo)
#define OidFunctionCall1(functionId, arg1)
#define PG_DETOAST_DATUM(datum)
FdwRoutine * GetFdwRoutineForRelation(Relation relation, bool makecopy)
static int compare(const void *arg1, const void *arg2)
int NewGUCNestLevel(void)
void AtEOXact_GUC(bool isCommit, int nestLevel)
HeapTuple heap_form_tuple(TupleDesc tupleDescriptor, Datum *values, bool *isnull)
HeapTuple heap_modify_tuple(HeapTuple tuple, TupleDesc tupleDesc, Datum *replValues, bool *replIsnull, bool *doReplace)
void heap_freetuple(HeapTuple htup)
#define HeapTupleIsValid(tuple)
static Datum heap_getattr(HeapTuple tup, int attnum, TupleDesc tupleDesc, bool *isnull)
void FormIndexDatum(IndexInfo *indexInfo, TupleTableSlot *slot, EState *estate, Datum *values, bool *isnull)
IndexInfo * BuildIndexInfo(Relation index)
IndexBulkDeleteResult * index_vacuum_cleanup(IndexVacuumInfo *info, IndexBulkDeleteResult *istat)
void CatalogTupleInsertWithInfo(Relation heapRel, HeapTuple tup, CatalogIndexState indstate)
void CatalogCloseIndexes(CatalogIndexState indstate)
CatalogIndexState CatalogOpenIndexes(Relation heapRel)
void CatalogTupleUpdateWithInfo(Relation heapRel, ItemPointer otid, HeapTuple tup, CatalogIndexState indstate)
if(TABLE==NULL||TABLE_index==NULL)
static OffsetNumber ItemPointerGetOffsetNumber(const ItemPointerData *pointer)
static BlockNumber ItemPointerGetBlockNumber(const ItemPointerData *pointer)
Assert(fmt[strlen(fmt) - 1] !='\n')
void list_free(List *list)
#define ShareUpdateExclusiveLock
char * get_namespace_name(Oid nspid)
RegProcedure get_opcode(Oid opno)
void pfree(void *pointer)
void * palloc0(Size size)
MemoryContext CurrentMemoryContext
void MemoryContextDelete(MemoryContext context)
#define AllocSetContextCreate
#define ALLOCSET_DEFAULT_SIZES
#define MemoryContextResetAndDeleteChildren(ctx)
#define SECURITY_RESTRICTED_OPERATION
#define CHECK_FOR_INTERRUPTS()
void GetUserIdAndSecContext(Oid *userid, int *sec_context)
void SetUserIdAndSecContext(Oid userid, int sec_context)
#define InvalidMultiXactId
Oid exprType(const Node *expr)
int32 exprTypmod(const Node *expr)
Oid exprCollation(const Node *expr)
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
void get_sort_group_operators(Oid argtype, bool needLT, bool needEQ, bool needGT, Oid *ltOpr, Oid *eqOpr, Oid *gtOpr, bool *isHashable)
int attnameAttNum(Relation rd, const char *attname, bool sysColOK)
FormData_pg_attribute * Form_pg_attribute
List * find_all_inheritors(Oid parentrelId, LOCKMODE lockmode, List **numparents)
static int list_length(const List *l)
static ListCell * list_head(const List *l)
static ListCell * lnext(const List *l, const ListCell *c)
uint32 pg_prng_uint32(pg_prng_state *state)
pg_prng_state pg_global_prng_state
const char * pg_rusage_show(const PGRUsage *ru0)
void pg_rusage_init(PGRUsage *ru0)
#define STATISTIC_NUM_SLOTS
FormData_pg_type * Form_pg_type
PgStat_Counter pgStatBlockReadTime
PgStat_Counter pgStatBlockWriteTime
void pgstat_report_analyze(Relation rel, PgStat_Counter livetuples, PgStat_Counter deadtuples, bool resetcounter)
void qsort_interruptible(void *base, size_t nel, size_t elsize, qsort_arg_comparator cmp, void *arg)
static bool DatumGetBool(Datum X)
static Datum PointerGetDatum(const void *X)
static Datum Float4GetDatum(float4 X)
static char * DatumGetCString(Datum X)
static Datum Int16GetDatum(int16 X)
static Datum BoolGetDatum(bool X)
static Datum ObjectIdGetDatum(Oid X)
static Pointer DatumGetPointer(Datum X)
static Datum Int32GetDatum(int32 X)
TransactionId GetOldestNonRemovableTransactionId(Relation rel)
#define PROGRESS_ANALYZE_PHASE_FINALIZE_ANALYZE
#define PROGRESS_ANALYZE_PHASE_ACQUIRE_SAMPLE_ROWS_INH
#define PROGRESS_ANALYZE_BLOCKS_DONE
#define PROGRESS_ANALYZE_PHASE
#define PROGRESS_ANALYZE_CHILD_TABLES_TOTAL
#define PROGRESS_ANALYZE_BLOCKS_TOTAL
#define PROGRESS_ANALYZE_PHASE_COMPUTE_STATS
#define PROGRESS_ANALYZE_PHASE_ACQUIRE_SAMPLE_ROWS
#define PROGRESS_ANALYZE_CHILD_TABLES_DONE
#define PROGRESS_ANALYZE_CURRENT_CHILD_TABLE_RELID
#define RelationGetRelid(relation)
#define RelationGetDescr(relation)
#define RelationGetRelationName(relation)
#define RELATION_IS_OTHER_TEMP(relation)
#define RelationGetNamespace(relation)
List * RelationGetIndexList(Relation relation)
struct RelationData * Relation
BlockNumber BlockSampler_Init(BlockSampler bs, BlockNumber nblocks, int samplesize, uint32 randseed)
void reservoir_init_selection_state(ReservoirState rs, int n)
double sampler_random_fract(pg_prng_state *randstate)
bool BlockSampler_HasMore(BlockSampler bs)
BlockNumber BlockSampler_Next(BlockSampler bs)
double reservoir_get_next_S(ReservoirState rs, double t, int n)
void PrepareSortSupportFromOrderingOp(Oid orderingOp, SortSupport ssup)
static int ApplySortComparator(Datum datum1, bool isNull1, Datum datum2, bool isNull2, SortSupport ssup)
int get_tablespace_maintenance_io_concurrency(Oid spcid)
void relation_close(Relation relation, LOCKMODE lockmode)
void appendStringInfo(StringInfo str, const char *fmt,...)
void initStringInfo(StringInfo str)
VacAttrStats ** vacattrstats
float8 n_distinct_inherited
TupleTableSlot * ecxt_scantuple
AnalyzeForeignTable_function AnalyzeForeignTable
AttrNumber ii_IndexAttrNumbers[INDEX_MAX_KEYS]
BufferAccessStrategy strategy
int16 stakind[STATISTIC_NUM_SLOTS]
MemoryContext anl_context
Oid statypid[STATISTIC_NUM_SLOTS]
Oid staop[STATISTIC_NUM_SLOTS]
Oid stacoll[STATISTIC_NUM_SLOTS]
char statypalign[STATISTIC_NUM_SLOTS]
float4 * stanumbers[STATISTIC_NUM_SLOTS]
bool statypbyval[STATISTIC_NUM_SLOTS]
int16 statyplen[STATISTIC_NUM_SLOTS]
int numvalues[STATISTIC_NUM_SLOTS]
Datum * stavalues[STATISTIC_NUM_SLOTS]
int numnumbers[STATISTIC_NUM_SLOTS]
AnalyzeAttrComputeStatsFunc compute_stats
void ReleaseSysCache(HeapTuple tuple)
HeapTuple SearchSysCache3(int cacheId, Datum key1, Datum key2, Datum key3)
#define SearchSysCacheCopy1(cacheId, key1)
void table_close(Relation relation, LOCKMODE lockmode)
Relation table_open(Oid relationId, LOCKMODE lockmode)
TupleTableSlot * table_slot_create(Relation relation, List **reglist)
static bool table_scan_analyze_next_block(TableScanDesc scan, BlockNumber blockno, BufferAccessStrategy bstrategy)
static void table_endscan(TableScanDesc scan)
static bool table_scan_analyze_next_tuple(TableScanDesc scan, TransactionId OldestXmin, double *liverows, double *deadrows, TupleTableSlot *slot)
static TableScanDesc table_beginscan_analyze(Relation rel)
void SetRelationHasSubclass(Oid relationId, bool relhassubclass)
#define InvalidTransactionId
void free_conversion_map(TupleConversionMap *map)
TupleConversionMap * convert_tuples_by_name(TupleDesc indesc, TupleDesc outdesc)
HeapTuple execute_attr_map_tuple(HeapTuple tuple, TupleConversionMap *map)
bool equalTupleDescs(TupleDesc tupdesc1, TupleDesc tupdesc2)
#define TupleDescAttr(tupdesc, i)
static HeapTuple ExecCopySlotHeapTuple(TupleTableSlot *slot)
void vac_open_indexes(Relation relation, LOCKMODE lockmode, int *nindexes, Relation **Irel)
void vac_update_relstats(Relation relation, BlockNumber num_pages, double num_tuples, BlockNumber num_all_visible_pages, bool hasindex, TransactionId frozenxid, MultiXactId minmulti, bool *frozenxid_updated, bool *minmulti_updated, bool in_outer_xact)
Relation vacuum_open_relation(Oid relid, RangeVar *relation, bits32 options, bool verbose, LOCKMODE lmode)
void vac_close_indexes(int nindexes, Relation *Irel, LOCKMODE lockmode)
void vacuum_delay_point(void)
bool vacuum_is_relation_owner(Oid relid, Form_pg_class reltuple, bits32 options)
Datum(* AnalyzeAttrFetchFunc)(VacAttrStatsP stats, int rownum, bool *isNull)
void visibilitymap_count(Relation rel, BlockNumber *all_visible, BlockNumber *all_frozen)
void CommandCounterIncrement(void)