1
0
mirror of https://github.com/postgres/postgres.git synced 2026-01-27 21:43:08 +03:00

Fix typos and inconsistencies in code and comments

This change is a cocktail of harmonization of function argument names,
grammar typos, renames for better consistency and unused code (see
ltree).  All of these have been spotted by the author.

Author: Alexander Lakhin <exclusion@gmail.com>
Discussion: https://postgr.es/m/b2c0d0b7-3944-487d-a03d-d155851958ff@gmail.com
This commit is contained in:
Michael Paquier
2026-01-05 09:19:15 +09:00
parent e3fbc9a8de
commit b8cfcb9e00
35 changed files with 41 additions and 47 deletions

View File

@@ -338,11 +338,6 @@ queryin(char *buf, struct Node *escontext)
NODE *tmp; NODE *tmp;
int32 pos = 0; int32 pos = 0;
#ifdef BS_DEBUG
char pbuf[16384],
*cur;
#endif
/* init state */ /* init state */
state.buf = buf; state.buf = buf;
state.state = WAITOPERAND; state.state = WAITOPERAND;

View File

@@ -562,7 +562,7 @@ CREATE SUBSCRIPTION <replaceable class="parameter">subscription_name</replaceabl
</para> </para>
<para> <para>
This option is effective only when This option is effective only when
<literal>retain_conflict_info</literal> is enabled and the apply <literal>retain_dead_tuples</literal> is enabled and the apply
worker associated with the subscription is active. worker associated with the subscription is active.
</para> </para>
<warning> <warning>

View File

@@ -87,7 +87,7 @@ static void compute_new_xmax_infomask(TransactionId xmax, uint16 old_infomask,
uint16 *result_infomask2); uint16 *result_infomask2);
static TM_Result heap_lock_updated_tuple(Relation rel, static TM_Result heap_lock_updated_tuple(Relation rel,
uint16 prior_infomask, uint16 prior_infomask,
TransactionId prior_rawxmax, TransactionId prior_raw_xmax,
const ItemPointerData *prior_ctid, const ItemPointerData *prior_ctid,
TransactionId xid, TransactionId xid,
LockTupleMode mode); LockTupleMode mode);

View File

@@ -191,7 +191,7 @@ heap_xlog_prune_freeze(XLogReaderState *record)
* unlogged and maintained heuristically, it often becomes stale on * unlogged and maintained heuristically, it often becomes stale on
* standbys. If such a standby is later promoted and runs VACUUM, it will * standbys. If such a standby is later promoted and runs VACUUM, it will
* skip recalculating free space for pages that were marked * skip recalculating free space for pages that were marked
* all-visible/all-forzen. FreeSpaceMapVacuum() can then propagate overly * all-visible/all-frozen. FreeSpaceMapVacuum() can then propagate overly
* optimistic free space values upward, causing future insertions to * optimistic free space values upward, causing future insertions to
* select pages that turn out to be unusable. In bulk, this can lead to * select pages that turn out to be unusable. In bulk, this can lead to
* long stalls. * long stalls.

View File

@@ -161,7 +161,7 @@ gin_desc(StringInfo buf, XLogReaderState *record)
appendStringInfo(buf, " prevTail: %u", appendStringInfo(buf, " prevTail: %u",
xlrec->prevTail); xlrec->prevTail);
if (xlrec->newRightlink != InvalidBlockNumber) if (xlrec->newRightlink != InvalidBlockNumber)
appendStringInfo(buf, " newRightLink: %u", appendStringInfo(buf, " newRightlink: %u",
xlrec->newRightlink); xlrec->newRightlink);
} }
break; break;

View File

@@ -1287,7 +1287,7 @@ CheckAlterSubOption(Subscription *sub, const char *option,
* retreat in the calculated xmin, necessitating additional handling. * retreat in the calculated xmin, necessitating additional handling.
* *
* XXX To address the above race conditions, we can define * XXX To address the above race conditions, we can define
* oldest_nonremovable_xid as FullTransactionID and adds the check to * oldest_nonremovable_xid as FullTransactionId and adds the check to
* disallow retreating the conflict slot's xmin. For now, we kept the * disallow retreating the conflict slot's xmin. For now, we kept the
* implementation simple by disallowing change to the retain_dead_tuples, * implementation simple by disallowing change to the retain_dead_tuples,
* but in the future we can change this after some more analysis. * but in the future we can change this after some more analysis.

View File

@@ -684,7 +684,7 @@ _jumbleParam(JumbleState *jstate, Node *node)
JUMBLE_FIELD(paramkind); JUMBLE_FIELD(paramkind);
JUMBLE_FIELD(paramid); JUMBLE_FIELD(paramid);
JUMBLE_FIELD(paramtype); JUMBLE_FIELD(paramtype);
/* paramtypmode and paramcollid are ignored */ /* paramtypmod and paramcollid are ignored */
if (expr->paramkind == PARAM_EXTERN) if (expr->paramkind == PARAM_EXTERN)
{ {

View File

@@ -2285,7 +2285,7 @@ remove_self_joins_one_group(PlannerInfo *root, Relids relids)
continue; continue;
/* /*
* Remove rrel ReloptInfo from the planner structures and the * Remove rrel RelOptInfo from the planner structures and the
* corresponding row mark. * corresponding row mark.
*/ */
remove_self_join_rel(root, kmark, rmark, krel, rrel, restrictlist); remove_self_join_rel(root, kmark, rmark, krel, rrel, restrictlist);

View File

@@ -7922,8 +7922,8 @@ apply_scanjoin_target_to_paths(PlannerInfo *root,
* However, there are several cases when this optimization is not safe. If * However, there are several cases when this optimization is not safe. If
* the rel isn't partitioned, then none of the paths will be Append or * the rel isn't partitioned, then none of the paths will be Append or
* MergeAppend paths, so we should definitely not do this. If it is * MergeAppend paths, so we should definitely not do this. If it is
* parititoned but is a joinrel, it may have Append and MergeAppend paths, * partititoned but is a joinrel, it may have Append and MergeAppend
* but it can also have join paths that we can't afford to discard. * paths, but it can also have join paths that we can't afford to discard.
* *
* Some care is needed, because we have to allow * Some care is needed, because we have to allow
* generate_useful_gather_paths to see the old partial paths in the next * generate_useful_gather_paths to see the old partial paths in the next

View File

@@ -937,7 +937,7 @@ infer_arbiter_indexes(PlannerInfo *root)
Assert(idxForm->indisready); Assert(idxForm->indisready);
/* /*
* Set up inferElems and inferPredExprs to match the * Set up inferElems and inferIndexExprs to match the
* constraint index, so that we can match them in the loop * constraint index, so that we can match them in the loop
* below. * below.
*/ */

View File

@@ -4989,7 +4989,7 @@ satisfies_hash_partition(PG_FUNCTION_ARGS)
* second_name: name of the second partition * second_name: name of the second partition
* second_bound: bound of the second partition * second_bound: bound of the second partition
* defaultPart: true if one of the new partitions is DEFAULT * defaultPart: true if one of the new partitions is DEFAULT
* is_merge: true ndicates the operation is MERGE PARTITIONS; * is_merge: true indicates the operation is MERGE PARTITIONS;
* false indicates the operation is SPLIT PARTITION. * false indicates the operation is SPLIT PARTITION.
* pstate: pointer to ParseState struct for determining error position * pstate: pointer to ParseState struct for determining error position
*/ */

View File

@@ -173,7 +173,7 @@ update_slotsync_skip_stats(SlotSyncSkipReason skip_reason)
slot = MyReplicationSlot; slot = MyReplicationSlot;
/* /*
* Update the slot sync related stats in pg_stat_replication_slot when a * Update the slot sync related stats in pg_stat_replication_slots when a
* slot sync is skipped * slot sync is skipped
*/ */
if (skip_reason != SS_SKIP_NONE) if (skip_reason != SS_SKIP_NONE)

View File

@@ -4280,7 +4280,7 @@ DebugPrintBufferRefcount(Buffer buffer)
backend = INVALID_PROC_NUMBER; backend = INVALID_PROC_NUMBER;
} }
/* theoretically we should lock the bufhdr here */ /* theoretically we should lock the bufHdr here */
buf_state = pg_atomic_read_u32(&buf->state); buf_state = pg_atomic_read_u32(&buf->state);
result = psprintf("[%03d] (rel=%s, blockNum=%u, flags=0x%x, refcount=%u %d)", result = psprintf("[%03d] (rel=%s, blockNum=%u, flags=0x%x, refcount=%u %d)",

View File

@@ -190,7 +190,7 @@
* two-phase commit support * two-phase commit support
* AtPrepare_PredicateLocks(void); * AtPrepare_PredicateLocks(void);
* PostPrepare_PredicateLocks(TransactionId xid); * PostPrepare_PredicateLocks(TransactionId xid);
* PredicateLockTwoPhaseFinish(TransactionId xid, bool isCommit); * PredicateLockTwoPhaseFinish(FullTransactionId fxid, bool isCommit);
* predicatelock_twophase_recover(FullTransactionId fxid, uint16 info, * predicatelock_twophase_recover(FullTransactionId fxid, uint16 info,
* void *recdata, uint32 len); * void *recdata, uint32 len);
*/ */

View File

@@ -418,7 +418,7 @@ CheckMyDatabase(const char *name, bool am_superuser, bool override_allow_connect
ctype = TextDatumGetCString(datum); ctype = TextDatumGetCString(datum);
/* /*
* Historcally, we set LC_COLLATE from datcollate, as well. That's no * Historically, we set LC_COLLATE from datcollate, as well. That's no
* longer necessary because all collation behavior is handled through * longer necessary because all collation behavior is handled through
* pg_locale_t. * pg_locale_t.
*/ */

View File

@@ -694,7 +694,7 @@
short_desc => 'Set this to force all parse and plan trees to be passed through outfuncs.c/readfuncs.c, to facilitate catching errors and omissions in those modules.', short_desc => 'Set this to force all parse and plan trees to be passed through outfuncs.c/readfuncs.c, to facilitate catching errors and omissions in those modules.',
flags => 'GUC_NOT_IN_SAMPLE', flags => 'GUC_NOT_IN_SAMPLE',
variable => 'Debug_write_read_parse_plan_trees', variable => 'Debug_write_read_parse_plan_trees',
boot_val => 'DEFAULT_DEBUG_READ_WRITE_PARSE_PLAN_TREES', boot_val => 'DEFAULT_DEBUG_WRITE_READ_PARSE_PLAN_TREES',
ifdef => 'DEBUG_NODE_TESTS_ENABLED', ifdef => 'DEBUG_NODE_TESTS_ENABLED',
}, },

View File

@@ -228,7 +228,7 @@ sub read_multixid_fields
# Reset a cluster's next multixid and mxoffset to given values. # Reset a cluster's next multixid and mxoffset to given values.
# #
# Note: This is used on the old insallation, so the command arguments # Note: This is used on the old installation, so the command arguments
# and the output parsing used here must work with all pre-v19 # and the output parsing used here must work with all pre-v19
# PostgreSQL versions supported by the test. # PostgreSQL versions supported by the test.
sub reset_mxid_mxoffset_pre_v19 sub reset_mxid_mxoffset_pre_v19

View File

@@ -293,7 +293,7 @@ typedef struct PruneFreezeResult
* is only valid if we froze some tuples (nfrozen > 0), and all_frozen is * is only valid if we froze some tuples (nfrozen > 0), and all_frozen is
* true. * true.
* *
* These are only set if the HEAP_PRUNE_FREEZE option is set. * These are only set if the HEAP_PAGE_PRUNE_FREEZE option is set.
*/ */
bool all_visible; bool all_visible;
bool all_frozen; bool all_frozen;

View File

@@ -1262,7 +1262,7 @@ typedef struct PGAlignedXLogBlock
*/ */
#if !HAVE_DECL_FDATASYNC #if !HAVE_DECL_FDATASYNC
extern int fdatasync(int fildes); extern int fdatasync(int fd);
#endif #endif
/* /*

View File

@@ -47,7 +47,7 @@ extern ObjectAddress AlterSequence(ParseState *pstate, AlterSeqStmt *stmt);
extern void SequenceChangePersistence(Oid relid, char newrelpersistence); extern void SequenceChangePersistence(Oid relid, char newrelpersistence);
extern void DeleteSequenceTuple(Oid relid); extern void DeleteSequenceTuple(Oid relid);
extern void ResetSequence(Oid seq_relid); extern void ResetSequence(Oid seq_relid);
extern void SetSequence(Oid relid, int64 next, bool is_called); extern void SetSequence(Oid relid, int64 next, bool iscalled);
extern void ResetSequenceCaches(void); extern void ResetSequenceCaches(void);
#endif /* SEQUENCE_H */ #endif /* SEQUENCE_H */

View File

@@ -346,7 +346,7 @@ int128_div_mod_int32(INT128 *i128, int32 v, int32 *remainder)
n_lo = i128->lo; n_lo = i128->lo;
} }
/* denomimator: absolute value of v */ /* denominator: absolute value of v */
d = abs(v); d = abs(v);
/* quotient and remainder of high 64 bits */ /* quotient and remainder of high 64 bits */

View File

@@ -114,7 +114,7 @@ extern void llvm_split_symbol_name(const char *name, char **modname, char **func
extern LLVMTypeRef llvm_pg_var_type(const char *varname); extern LLVMTypeRef llvm_pg_var_type(const char *varname);
extern LLVMTypeRef llvm_pg_var_func_type(const char *varname); extern LLVMTypeRef llvm_pg_var_func_type(const char *varname);
extern LLVMValueRef llvm_pg_func(LLVMModuleRef mod, const char *funcname); extern LLVMValueRef llvm_pg_func(LLVMModuleRef mod, const char *funcname);
extern void llvm_copy_attributes(LLVMValueRef from, LLVMValueRef to); extern void llvm_copy_attributes(LLVMValueRef v_from, LLVMValueRef v_to);
extern LLVMValueRef llvm_function_reference(LLVMJitContext *context, extern LLVMValueRef llvm_function_reference(LLVMJitContext *context,
LLVMBuilderRef builder, LLVMBuilderRef builder,
LLVMModuleRef mod, LLVMModuleRef mod,

View File

@@ -404,7 +404,7 @@ struct PlannerInfo
/* list of AggClauseInfos */ /* list of AggClauseInfos */
List *agg_clause_list; List *agg_clause_list;
/* list of GroupExprInfos */ /* list of GroupingExprInfos */
List *group_expr_list; List *group_expr_list;
/* list of plain Vars contained in targetlist and havingQual */ /* list of plain Vars contained in targetlist and havingQual */

View File

@@ -79,11 +79,11 @@ extern void px(PlannerInfo *root, Gene *tour1, Gene *tour2, Gene *offspring,
int num_gene, City * city_table); int num_gene, City * city_table);
/* order crossover [OX1] according to Davis */ /* order crossover [OX1] according to Davis */
extern void ox1(PlannerInfo *root, Gene *mom, Gene *dad, Gene *offspring, extern void ox1(PlannerInfo *root, Gene *tour1, Gene *tour2, Gene *offspring,
int num_gene, City * city_table); int num_gene, City * city_table);
/* order crossover [OX2] according to Syswerda */ /* order crossover [OX2] according to Syswerda */
extern void ox2(PlannerInfo *root, Gene *mom, Gene *dad, Gene *offspring, extern void ox2(PlannerInfo *root, Gene *tour1, Gene *tour2, Gene *offspring,
int num_gene, City * city_table); int num_gene, City * city_table);
#endif /* GEQO_RECOMBINATION_H */ #endif /* GEQO_RECOMBINATION_H */

View File

@@ -485,7 +485,7 @@ extern char *strsep(char **stringp, const char *delim);
#endif #endif
#if !HAVE_DECL_TIMINGSAFE_BCMP #if !HAVE_DECL_TIMINGSAFE_BCMP
extern int timingsafe_bcmp(const void *b1, const void *b2, size_t len); extern int timingsafe_bcmp(const void *b1, const void *b2, size_t n);
#endif #endif
/* /*

View File

@@ -29,6 +29,6 @@
*/ */
#undef gai_strerror #undef gai_strerror
extern const char *gai_strerror(int ecode); extern const char *gai_strerror(int errcode);
#endif /* WIN32_SYS_SOCKET_H */ #endif /* WIN32_SYS_SOCKET_H */

View File

@@ -505,7 +505,7 @@ extern SOCKET pgwin32_socket(int af, int type, int protocol);
extern int pgwin32_bind(SOCKET s, struct sockaddr *addr, int addrlen); extern int pgwin32_bind(SOCKET s, struct sockaddr *addr, int addrlen);
extern int pgwin32_listen(SOCKET s, int backlog); extern int pgwin32_listen(SOCKET s, int backlog);
extern SOCKET pgwin32_accept(SOCKET s, struct sockaddr *addr, int *addrlen); extern SOCKET pgwin32_accept(SOCKET s, struct sockaddr *addr, int *addrlen);
extern int pgwin32_connect(SOCKET s, const struct sockaddr *name, int namelen); extern int pgwin32_connect(SOCKET s, const struct sockaddr *addr, int addrlen);
extern int pgwin32_select(int nfds, fd_set *readfds, fd_set *writefds, fd_set *exceptfds, const struct timeval *timeout); extern int pgwin32_select(int nfds, fd_set *readfds, fd_set *writefds, fd_set *exceptfds, const struct timeval *timeout);
extern int pgwin32_recv(SOCKET s, char *buf, int len, int flags); extern int pgwin32_recv(SOCKET s, char *buf, int len, int flags);
extern int pgwin32_send(SOCKET s, const void *buf, int len, int flags); extern int pgwin32_send(SOCKET s, const void *buf, int len, int flags);
@@ -581,9 +581,9 @@ typedef unsigned short mode_t;
#endif #endif
/* in port/win32pread.c */ /* in port/win32pread.c */
extern ssize_t pg_pread(int fd, void *buf, size_t nbyte, pgoff_t offset); extern ssize_t pg_pread(int fd, void *buf, size_t size, pgoff_t offset);
/* in port/win32pwrite.c */ /* in port/win32pwrite.c */
extern ssize_t pg_pwrite(int fd, const void *buf, size_t nbyte, pgoff_t offset); extern ssize_t pg_pwrite(int fd, const void *buf, size_t size, pgoff_t offset);
#endif /* PG_WIN32_PORT_H */ #endif /* PG_WIN32_PORT_H */

View File

@@ -16,12 +16,11 @@
extern Size LogicalDecodingCtlShmemSize(void); extern Size LogicalDecodingCtlShmemSize(void);
extern void LogicalDecodingCtlShmemInit(void); extern void LogicalDecodingCtlShmemInit(void);
extern void StartupLogicalDecodingStatus(bool status_in_control_file); extern void StartupLogicalDecodingStatus(bool last_status);
extern void InitializeProcessXLogLogicalInfo(void); extern void InitializeProcessXLogLogicalInfo(void);
extern bool ProcessBarrierUpdateXLogLogicalInfo(void); extern bool ProcessBarrierUpdateXLogLogicalInfo(void);
extern bool IsLogicalDecodingEnabled(void); extern bool IsLogicalDecodingEnabled(void);
extern bool IsXLogLogicalInfoEnabled(void); extern bool IsXLogLogicalInfoEnabled(void);
extern bool CheckXLogLogicalInfo(void);
extern void AtEOXact_LogicalCtl(void); extern void AtEOXact_LogicalCtl(void);
extern void EnsureLogicalDecodingEnabled(void); extern void EnsureLogicalDecodingEnabled(void);
extern void EnableLogicalDecoding(void); extern void EnableLogicalDecoding(void);

View File

@@ -294,7 +294,7 @@ extern void launch_sync_worker(LogicalRepWorkerType wtype, int nsyncworkers,
Oid relid, TimestampTz *last_start_time); Oid relid, TimestampTz *last_start_time);
extern void ProcessSyncingRelations(XLogRecPtr current_lsn); extern void ProcessSyncingRelations(XLogRecPtr current_lsn);
extern void FetchRelationStates(bool *has_pending_subtables, extern void FetchRelationStates(bool *has_pending_subtables,
bool *has_pending_sequences, bool *started_tx); bool *has_pending_subsequences, bool *started_tx);
extern void stream_start_internal(TransactionId xid, bool first_segment); extern void stream_start_internal(TransactionId xid, bool first_segment);
extern void stream_stop_internal(TransactionId xid); extern void stream_stop_internal(TransactionId xid);

View File

@@ -35,7 +35,7 @@ extern bool stats_check_arg_pair(FunctionCallInfo fcinfo,
int argnum1, int argnum2); int argnum1, int argnum2);
extern void RangeVarCallbackForStats(const RangeVar *relation, extern void RangeVarCallbackForStats(const RangeVar *relation,
Oid relId, Oid oldRelid, void *arg); Oid relId, Oid oldRelId, void *arg);
extern bool stats_fill_fcinfo_from_arg_pairs(FunctionCallInfo pairs_fcinfo, extern bool stats_fill_fcinfo_from_arg_pairs(FunctionCallInfo pairs_fcinfo,
FunctionCallInfo positional_fcinfo, FunctionCallInfo positional_fcinfo,

View File

@@ -73,7 +73,7 @@ extern void PreCommit_CheckForSerializationFailure(void);
/* two-phase commit support */ /* two-phase commit support */
extern void AtPrepare_PredicateLocks(void); extern void AtPrepare_PredicateLocks(void);
extern void PostPrepare_PredicateLocks(FullTransactionId fxid); extern void PostPrepare_PredicateLocks(FullTransactionId fxid);
extern void PredicateLockTwoPhaseFinish(FullTransactionId xid, bool isCommit); extern void PredicateLockTwoPhaseFinish(FullTransactionId fxid, bool isCommit);
extern void predicatelock_twophase_recover(FullTransactionId fxid, uint16 info, extern void predicatelock_twophase_recover(FullTransactionId fxid, uint16 info,
void *recdata, uint32 len); void *recdata, uint32 len);

View File

@@ -266,10 +266,10 @@ extern PGDLLIMPORT bool Debug_raw_expression_coverage_test;
#define DEFAULT_DEBUG_COPY_PARSE_PLAN_TREES false #define DEFAULT_DEBUG_COPY_PARSE_PLAN_TREES false
#endif #endif
#ifdef READ_WRITE_PARSE_PLAN_TREES #ifdef WRITE_READ_PARSE_PLAN_TREES
#define DEFAULT_DEBUG_READ_WRITE_PARSE_PLAN_TREES true #define DEFAULT_DEBUG_WRITE_READ_PARSE_PLAN_TREES true
#else #else
#define DEFAULT_DEBUG_READ_WRITE_PARSE_PLAN_TREES false #define DEFAULT_DEBUG_WRITE_READ_PARSE_PLAN_TREES false
#endif #endif
#ifdef RAW_EXPRESSION_COVERAGE_TEST #ifdef RAW_EXPRESSION_COVERAGE_TEST

View File

@@ -39,7 +39,7 @@ $node->safe_psql(
my $count = $node->safe_psql('postgres', my $count = $node->safe_psql('postgres',
"select count(*) from brin_page_items(get_raw_page('brin_wi_idx', 2), 'brin_wi_idx'::regclass)" "select count(*) from brin_page_items(get_raw_page('brin_wi_idx', 2), 'brin_wi_idx'::regclass)"
); );
is($count, '1', "initial brin_wi_index index state is correct"); is($count, '1', "initial brin_wi_idx index state is correct");
$count = $node->safe_psql('postgres', $count = $node->safe_psql('postgres',
"select count(*) from brin_page_items(get_raw_page('brin_packdate_idx', 2), 'brin_packdate_idx'::regclass)" "select count(*) from brin_page_items(get_raw_page('brin_packdate_idx', 2), 'brin_packdate_idx'::regclass)"
); );

View File

@@ -54,7 +54,7 @@ my $psql_primaryB =
# Our test relies on two rounds of index vacuuming for reasons elaborated # Our test relies on two rounds of index vacuuming for reasons elaborated
# later. To trigger two rounds of index vacuuming, we must fill up the # later. To trigger two rounds of index vacuuming, we must fill up the
# TIDStore with dead items partway through a vacuum of the table. The number # TidStore with dead items partway through a vacuum of the table. The number
# of rows is just enough to ensure we exceed maintenance_work_mem on all # of rows is just enough to ensure we exceed maintenance_work_mem on all
# supported platforms, while keeping test runtime as short as we can. # supported platforms, while keeping test runtime as short as we can.
my $nrows = 2000; my $nrows = 2000;
@@ -225,7 +225,7 @@ $node_primary->poll_query_until(
# Move the cursor forward to the next 7. We inserted the 7 much later, so # Move the cursor forward to the next 7. We inserted the 7 much later, so
# advancing the cursor should allow vacuum to proceed vacuuming most pages of # advancing the cursor should allow vacuum to proceed vacuuming most pages of
# the relation. Because we set maintanence_work_mem sufficiently low, we # the relation. Because we set maintenance_work_mem sufficiently low, we
# expect that a round of index vacuuming has happened and that the vacuum is # expect that a round of index vacuuming has happened and that the vacuum is
# now waiting for the cursor to release its pin on the last page of the # now waiting for the cursor to release its pin on the last page of the
# relation. # relation.

View File

@@ -182,7 +182,7 @@
} }
# NUMA introspection requires touching memory first, and some of it may # NUMA introspection requires touching memory first, and some of it may
# be marked as noacess (e.g. unpinned buffers). So just ignore that. # be marked as noaccess (e.g. unpinned buffers). So just ignore that.
{ {
pg_numa_touch_mem_if_required pg_numa_touch_mem_if_required
Memcheck:Addr4 Memcheck:Addr4