83 bool inh,
bool in_outer_xact,
int elevel);
92 double *totalrows,
double *totaldeadrows);
96 double *totalrows,
double *totaldeadrows);
190 if (onerel->
rd_rel->relkind == RELKIND_RELATION ||
191 onerel->
rd_rel->relkind == RELKIND_MATVIEW)
198 else if (onerel->
rd_rel->relkind == RELKIND_FOREIGN_TABLE)
217 (
errmsg(
"skipping \"%s\" --- cannot analyze this foreign table",
223 else if (onerel->
rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
234 (
errmsg(
"skipping \"%s\" --- cannot analyze non-tables or special system tables",
250 if (onerel->
rd_rel->relkind != RELKIND_PARTITIONED_TABLE)
252 relpages,
false, in_outer_xact, elevel);
257 if (onerel->
rd_rel->relhassubclass)
259 true, in_outer_xact, elevel);
282 BlockNumber relpages,
bool inh,
bool in_outer_xact,
304 int save_sec_context;
314 (
errmsg(
"analyzing \"%s.%s\" inheritance tree",
319 (
errmsg(
"analyzing \"%s.%s\"",
379 (
errcode(ERRCODE_UNDEFINED_COLUMN),
380 errmsg(
"column \"%s\" of relation \"%s\" does not exist",
384 (
errcode(ERRCODE_DUPLICATE_COLUMN),
385 errmsg(
"column \"%s\" of relation \"%s\" appears more than once",
390 if (vacattrstats[tcnt] != NULL)
401 for (
i = 1;
i <= attr_cnt;
i++)
404 if (vacattrstats[tcnt] != NULL)
419 if (onerel->
rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
425 hasindex = idxs !=
NIL;
431 hasindex = nindexes > 0;
466 if (indexpr_item == NULL)
467 elog(
ERROR,
"too few entries in indexprs list");
489 for (
i = 0;
i < attr_cnt;
i++)
491 if (targrows < vacattrstats[
i]->minrows)
492 targrows = vacattrstats[
i]->
minrows;
500 if (targrows < thisdata->vacattrstats[
i]->minrows)
512 if (targrows < minrows)
525 &totalrows, &totaldeadrows);
527 numrows = (*acquirefunc) (onerel, elevel,
529 &totalrows, &totaldeadrows);
550 for (
i = 0;
i < attr_cnt;
i++)
572 if (n_distinct != 0.0)
594 attr_cnt, vacattrstats);
606 attr_cnt, vacattrstats);
627 if (RELKIND_HAS_STORAGE(onerel->
rd_rel->relkind))
647 double totalindexrows;
649 totalindexrows = ceil(thisdata->
tupleFract * totalrows);
661 else if (onerel->
rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
686 else if (onerel->
rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
731 double read_rate = 0;
732 double write_rate = 0;
768 read_rate = (double) BLCKSZ * AnalyzePageMiss / (1024 * 1024) /
769 (delay_in_ms / 1000.0);
770 write_rate = (double) BLCKSZ * AnalyzePageDirty / (1024 * 1024) /
771 (delay_in_ms / 1000.0);
793 read_rate, write_rate);
795 (
long long) AnalyzePageHit,
796 (
long long) AnalyzePageMiss,
797 (
long long) AnalyzePageDirty);
854 double totalindexrows;
879 exprnulls = (
bool *)
palloc(numrows * attr_cnt *
sizeof(
bool));
882 for (rowno = 0; rowno < numrows; rowno++)
898 if (predicate != NULL)
921 for (
i = 0;
i < attr_cnt;
i++)
928 exprvals[tcnt] = (
Datum) 0;
929 exprnulls[tcnt] =
true;
936 exprnulls[tcnt] =
false;
947 thisdata->
tupleFract = (double) numindexrows / (
double) numrows;
948 totalindexrows = ceil(thisdata->
tupleFract * totalrows);
953 if (numindexrows > 0)
956 for (
i = 0;
i < attr_cnt;
i++)
1007 if (attr->attisdropped)
1017 elog(
ERROR,
"cache lookup failed for attribute %d of relation %u",
1019 dat =
SysCacheGetAttr(ATTNUM, atttuple, Anum_pg_attribute_attstattarget, &isnull);
1024 if (attstattarget == 0)
1111 void *callback_private_data,
1112 void *per_buffer_data)
1155 double *totalrows,
double *totaldeadrows)
1158 double samplerows = 0;
1159 double liverows = 0;
1160 double deadrows = 0;
1161 double rowstoskip = -1;
1221 if (numrows < targrows)
1233 if (rowstoskip <= 0)
1241 Assert(k >= 0 && k < targrows);
1269 if (numrows == targrows)
1282 *totalrows = floor((liverows / bs.
m) * totalblocks + 0.5);
1283 *totaldeadrows = floor((deadrows / bs.
m) * totalblocks + 0.5);
1288 *totaldeadrows = 0.0;
1295 (
errmsg(
"\"%s\": scanned %d of %u pages, "
1296 "containing %.0f live rows and %.0f dead rows; "
1297 "%d rows in sample, %.0f estimated total rows",
1301 numrows, *totalrows)));
1342 double *totalrows,
double *totaldeadrows)
1379 (
errmsg(
"skipping analyze of \"%s.%s\" inheritance tree --- this inheritance tree contains no child tables",
1396 foreach(lc, tableOIDs)
1410 Assert(childrel != onerel);
1416 if (childrel->
rd_rel->relkind == RELKIND_RELATION ||
1417 childrel->
rd_rel->relkind == RELKIND_MATVIEW)
1423 else if (childrel->
rd_rel->relkind == RELKIND_FOREIGN_TABLE)
1442 Assert(childrel != onerel);
1453 Assert(childrel->
rd_rel->relkind == RELKIND_PARTITIONED_TABLE);
1454 if (childrel != onerel)
1463 rels[nrels] = childrel;
1464 acquirefuncs[nrels] = acquirefunc;
1465 relblocks[nrels] = (double) relpages;
1466 totalblocks += (double) relpages;
1477 (
errmsg(
"skipping analyze of \"%s.%s\" inheritance tree --- this inheritance tree contains no analyzable child tables",
1492 for (
i = 0;
i < nrels;
i++)
1496 double childblocks = relblocks[
i];
1504 const int progress_index[] = {
1509 const int64 progress_vals[] = {
1518 if (childblocks > 0)
1522 childtargrows = (int) rint(targrows * childblocks / totalblocks);
1524 childtargrows =
Min(childtargrows, targrows - numrows);
1525 if (childtargrows > 0)
1532 childrows = (*acquirefunc) (childrel, elevel,
1533 rows + numrows, childtargrows,
1537 if (childrows > 0 &&
1549 for (
j = 0;
j < childrows;
j++)
1555 rows[numrows +
j] = newtup;
1562 numrows += childrows;
1563 *totalrows += trows;
1564 *totaldeadrows += tdrows;
1615 for (attno = 0; attno < natts; attno++)
1624 bool nulls[Natts_pg_statistic];
1625 bool replaces[Natts_pg_statistic];
1634 for (
i = 0;
i < Natts_pg_statistic; ++
i)
1646 i = Anum_pg_statistic_stakind1 - 1;
1651 i = Anum_pg_statistic_staop1 - 1;
1656 i = Anum_pg_statistic_stacoll1 - 1;
1661 i = Anum_pg_statistic_stanumbers1 - 1;
1671 for (n = 0; n < nnum; n++)
1682 i = Anum_pg_statistic_stavalues1 - 1;
1711 if (indstate == NULL)
1735 if (indstate != NULL)
1793 #define WIDTH_THRESHOLD 1024
1795 #define swapInt(a,b) do {int _tmp; _tmp=a; a=b; b=_tmp;} while(0)
1796 #define swapDatum(a,b) do {Datum _tmp; _tmp=a; a=b; b=_tmp;} while(0)
1852 false,
false,
false,
1853 <opr, &eqopr, NULL,
1858 mystats->
eqopr = eqopr;
1860 mystats->
ltopr = ltopr;
1925 int nonnull_cnt = 0;
1926 double total_width = 0;
1927 bool is_varlena = (!stats->
attrtype->typbyval &&
1929 bool is_varwidth = (!stats->
attrtype->typbyval &&
1932 for (
i = 0;
i < samplerows;
i++)
1939 value = fetchfunc(stats,
i, &isnull);
1959 else if (is_varwidth)
1967 if (nonnull_cnt > 0)
1971 stats->
stanullfrac = (double) null_cnt / (
double) samplerows;
1973 stats->
stawidth = total_width / (double) nonnull_cnt;
1978 else if (null_cnt > 0)
2015 int nonnull_cnt = 0;
2016 int toowide_cnt = 0;
2017 double total_width = 0;
2018 bool is_varlena = (!stats->
attrtype->typbyval &&
2020 bool is_varwidth = (!stats->
attrtype->typbyval &&
2037 track_max = 2 * num_mcv;
2045 for (
i = 0;
i < samplerows;
i++)
2055 value = fetchfunc(stats,
i, &isnull);
2089 else if (is_varwidth)
2099 firstcount1 = track_cnt;
2100 for (
j = 0;
j < track_cnt;
j++)
2109 if (
j < firstcount1 && track[
j].count == 1)
2118 while (
j > 0 && track[
j].count > track[
j - 1].count)
2121 swapInt(track[
j].count, track[
j - 1].count);
2128 if (track_cnt < track_max)
2130 for (
j = track_cnt - 1;
j > firstcount1;
j--)
2132 track[
j].value = track[
j - 1].value;
2133 track[
j].count = track[
j - 1].count;
2135 if (firstcount1 < track_cnt)
2137 track[firstcount1].value =
value;
2138 track[firstcount1].count = 1;
2144 if (nonnull_cnt > 0)
2151 stats->
stanullfrac = (double) null_cnt / (
double) samplerows;
2153 stats->
stawidth = total_width / (double) nonnull_cnt;
2159 for (nmultiple = 0; nmultiple < track_cnt; nmultiple++)
2161 if (track[nmultiple].count == 1)
2163 summultiple += track[nmultiple].count;
2174 else if (track_cnt < track_max && toowide_cnt == 0 &&
2175 nmultiple == track_cnt)
2214 int f1 = nonnull_cnt - summultiple;
2215 int d =
f1 + nmultiple;
2216 double n = samplerows - null_cnt;
2217 double N = totalrows * (1.0 - stats->
stanullfrac);
2222 stadistinct = (n * d) / ((n -
f1) +
f1 * n / N);
2227 if (stadistinct < d)
2229 if (stadistinct > N)
2260 if (track_cnt < track_max && toowide_cnt == 0 &&
2262 track_cnt <= num_mcv)
2265 num_mcv = track_cnt;
2272 if (num_mcv > track_cnt)
2273 num_mcv = track_cnt;
2277 mcv_counts = (
int *)
palloc(num_mcv *
sizeof(
int));
2278 for (
i = 0;
i < num_mcv;
i++)
2279 mcv_counts[
i] = track[
i].count;
2284 samplerows, totalrows);
2299 for (
i = 0;
i < num_mcv;
i++)
2304 mcv_freqs[
i] = (double) track[
i].count / (
double) samplerows;
2308 stats->
stakind[0] = STATISTIC_KIND_MCV;
2322 else if (null_cnt > 0)
2358 int nonnull_cnt = 0;
2359 int toowide_cnt = 0;
2360 double total_width = 0;
2361 bool is_varlena = (!stats->
attrtype->typbyval &&
2363 bool is_varwidth = (!stats->
attrtype->typbyval &&
2377 tupnoLink = (
int *)
palloc(samplerows *
sizeof(
int));
2380 memset(&ssup, 0,
sizeof(ssup));
2395 for (
i = 0;
i < samplerows;
i++)
2402 value = fetchfunc(stats,
i, &isnull);
2436 else if (is_varwidth)
2444 values[values_cnt].tupno = values_cnt;
2445 tupnoLink[values_cnt] = values_cnt;
2488 for (
i = 0;
i < values_cnt;
i++)
2492 corr_xysum += ((double)
i) * ((double) tupno);
2494 if (tupnoLink[tupno] == tupno)
2501 if (track_cnt < num_mcv ||
2502 dups_cnt > track[track_cnt - 1].count)
2512 if (track_cnt < num_mcv)
2514 for (
j = track_cnt - 1;
j > 0;
j--)
2516 if (dups_cnt <= track[
j - 1].count)
2521 track[
j].
count = dups_cnt;
2522 track[
j].
first =
i + 1 - dups_cnt;
2531 stats->
stanullfrac = (double) null_cnt / (
double) samplerows;
2533 stats->
stawidth = total_width / (double) nonnull_cnt;
2545 else if (toowide_cnt == 0 && nmultiple == ndistinct)
2579 int f1 = ndistinct - nmultiple + toowide_cnt;
2580 int d =
f1 + nmultiple;
2581 double n = samplerows - null_cnt;
2582 double N = totalrows * (1.0 - stats->
stanullfrac);
2587 stadistinct = (n * d) / ((n -
f1) +
f1 * n / N);
2592 if (stadistinct < d)
2594 if (stadistinct > N)
2625 if (track_cnt == ndistinct && toowide_cnt == 0 &&
2627 track_cnt <= num_mcv)
2630 num_mcv = track_cnt;
2637 if (num_mcv > track_cnt)
2638 num_mcv = track_cnt;
2642 mcv_counts = (
int *)
palloc(num_mcv *
sizeof(
int));
2643 for (
i = 0;
i < num_mcv;
i++)
2644 mcv_counts[
i] = track[
i].count;
2649 samplerows, totalrows);
2664 for (
i = 0;
i < num_mcv;
i++)
2669 mcv_freqs[
i] = (double) track[
i].count / (
double) samplerows;
2673 stats->
stakind[slot_idx] = STATISTIC_KIND_MCV;
2678 stats->
stavalues[slot_idx] = mcv_values;
2693 num_hist = ndistinct - num_mcv;
2694 if (num_hist > num_bins)
2695 num_hist = num_bins + 1;
2725 while (src < values_cnt)
2731 int first = track[
j].
first;
2736 src = first + track[
j].
count;
2740 ncopy = first - src;
2743 ncopy = values_cnt - src;
2753 Assert(nvals >= num_hist);
2768 delta = (nvals - 1) / (num_hist - 1);
2769 deltafrac = (nvals - 1) % (num_hist - 1);
2772 for (
i = 0;
i < num_hist;
i++)
2778 posfrac += deltafrac;
2779 if (posfrac >= (num_hist - 1))
2783 posfrac -= (num_hist - 1);
2789 stats->
stakind[slot_idx] = STATISTIC_KIND_HISTOGRAM;
2792 stats->
stavalues[slot_idx] = hist_values;
2824 corr_xsum = ((double) (values_cnt - 1)) *
2825 ((
double) values_cnt) / 2.0;
2826 corr_x2sum = ((double) (values_cnt - 1)) *
2827 ((
double) values_cnt) * (
double) (2 * values_cnt - 1) / 6.0;
2830 corrs[0] = (values_cnt * corr_xysum - corr_xsum * corr_xsum) /
2831 (values_cnt * corr_x2sum - corr_xsum * corr_xsum);
2833 stats->
stakind[slot_idx] = STATISTIC_KIND_CORRELATION;
2841 else if (nonnull_cnt > 0)
2844 Assert(nonnull_cnt == toowide_cnt);
2847 stats->
stanullfrac = (double) null_cnt / (
double) samplerows;
2849 stats->
stawidth = total_width / (double) nonnull_cnt;
2855 else if (null_cnt > 0)
2936 double ndistinct_table;
2944 if (samplerows == totalrows || totalrows <= 1.0)
2948 ndistinct_table = stadistinct;
2949 if (ndistinct_table < 0)
2950 ndistinct_table = -ndistinct_table * totalrows;
2972 for (
i = 0;
i < num_mcv - 1;
i++)
2973 sumcount += mcv_counts[
i];
2989 selec = 1.0 - sumcount / samplerows - stanullfrac;
2994 otherdistinct = ndistinct_table - (num_mcv - 1);
2995 if (otherdistinct > 1)
2996 selec /= otherdistinct;
3016 K = N * mcv_counts[num_mcv - 1] / n;
3017 variance = n *
K * (N -
K) * (N - n) / (N * N * (N - 1));
3018 stddev = sqrt(variance);
3020 if (mcv_counts[num_mcv - 1] > selec * samplerows + 2 * stddev + 0.5)
3035 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)
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]
#define RelationGetNumberOfBlocks(reln)
#define Assert(condition)
#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 BlockNumber block_sampling_read_stream_next(ReadStream *stream, void *callback_private_data, void *per_buffer_data)
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)
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 RestrictSearchPath(void)
void AtEOXact_GUC(bool isCommit, int nestLevel)
HeapTuple heap_modify_tuple(HeapTuple tuple, TupleDesc tupleDesc, const Datum *replValues, const bool *replIsnull, const bool *doReplace)
HeapTuple heap_form_tuple(TupleDesc tupleDescriptor, const Datum *values, const bool *isnull)
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)
void list_free(List *list)
#define ShareUpdateExclusiveLock
char * get_namespace_name(Oid nspid)
RegProcedure get_opcode(Oid opno)
void MemoryContextReset(MemoryContext context)
void pfree(void *pointer)
void * palloc0(Size size)
MemoryContext CurrentMemoryContext
void MemoryContextDelete(MemoryContext context)
#define AllocSetContextCreate
#define ALLOCSET_DEFAULT_SIZES
#define AmAutoVacuumWorkerProcess()
#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)
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)
static int16 DatumGetInt16(Datum 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
MemoryContextSwitchTo(old_ctx)
ReadStream * read_stream_begin_relation(int flags, BufferAccessStrategy strategy, Relation rel, ForkNumber forknum, ReadStreamBlockNumberCB callback, void *callback_private_data, size_t per_buffer_data_size)
void read_stream_end(ReadStream *stream)
#define READ_STREAM_MAINTENANCE
#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)
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)
Datum SysCacheGetAttr(int cacheId, HeapTuple tup, AttrNumber attributeNumber, bool *isNull)
HeapTuple SearchSysCache2(int cacheId, Datum key1, Datum key2)
#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 void table_endscan(TableScanDesc scan)
static bool table_scan_analyze_next_tuple(TableScanDesc scan, TransactionId OldestXmin, double *liverows, double *deadrows, TupleTableSlot *slot)
static bool table_scan_analyze_next_block(TableScanDesc scan, ReadStream *stream)
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 equalRowTypes(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_permitted_for_relation(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)