Skip to content

Commit 8961cb9

Browse files
michaelpqmichaelpq
committed
Fix typos in comments
The changes done in this commit impact comments with no direct user-visible changes, with fixes for incorrect function, variable or structure names. Author: Alexander Lakhin Discussion: https://postgr.es/m/e8c38840-596a-83d6-bd8d-cebc51111572@gmail.com
1 parent 6fd8ae6 commit 8961cb9

File tree

43 files changed

+59
-60
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

43 files changed

+59
-60
lines changed

‎config/config.sub

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1721,7 +1721,7 @@ case $os in
17211721
# Likewise for "kernel-abi"
17221722
eabi* | gnueabi*)
17231723
;;
1724-
# VxWorks passes extra cpu info in the 4th filed.
1724+
# VxWorks passes extra cpu info in the 4th field.
17251725
simlinux | simwindows | spe)
17261726
;;
17271727
# Now accept the basic system types.

‎contrib/amcheck/verify_nbtree.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -104,7 +104,7 @@ typedef struct BtreeCheckState
104104

105105
/*
106106
* The rightlink and incomplete split flag of block one level down to the
107-
* target page, which was visited last time via downlink from taget page.
107+
* target page, which was visited last time via downlink from target page.
108108
* We use it to check for missing downlinks.
109109
*/
110110
BlockNumber prevrightlink;

‎contrib/intarray/_int.h

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -15,7 +15,7 @@
1515
((GISTIntArrayOptions *) PG_GET_OPCLASS_OPTIONS())->num_ranges : \
1616
G_INT_NUMRANGES_DEFAULT)
1717

18-
/* gist_int_ops opclass options */
18+
/* gist__int_ops opclass options */
1919
typedef struct
2020
{
2121
int32 vl_len_; /* varlena header (do not touch directly!) */
@@ -80,7 +80,7 @@ typedef char *BITVECP;
8080
#define HASHVAL(val, siglen) (((unsigned int)(val)) % SIGLENBIT(siglen))
8181
#define HASH(sign, val, siglen) SETBIT((sign), HASHVAL(val, siglen))
8282

83-
/* gist_intbig_ops opclass options */
83+
/* gist__intbig_ops opclass options */
8484
typedef struct
8585
{
8686
int32 vl_len_; /* varlena header (do not touch directly!) */

‎src/backend/access/gist/gistxlog.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -580,8 +580,8 @@ gistXLogAssignLSN(void)
580580
int dummy = 0;
581581

582582
/*
583-
* Records other than SWITCH_WAL must have content. We use an integer 0 to
584-
* follow the restriction.
583+
* Records other than XLOG_SWITCH must have content. We use an integer 0
584+
* to follow the restriction.
585585
*/
586586
XLogBeginInsert();
587587
XLogSetRecordFlags(XLOG_MARK_UNIMPORTANT);

‎src/backend/access/heap/heapam.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1223,7 +1223,7 @@ heap_set_tidrange(TableScanDesc sscan, ItemPointer mintid,
12231223
* Calculate the first block and the number of blocks we must scan. We
12241224
* could be more aggressive here and perform some more validation to try
12251225
* and further narrow the scope of blocks to scan by checking if the
1226-
* lowerItem has an offset above MaxOffsetNumber. In this case, we could
1226+
* lowestItem has an offset above MaxOffsetNumber. In this case, we could
12271227
* advance startBlk by one. Likewise, if highestItem has an offset of 0
12281228
* we could scan one fewer blocks. However, such an optimization does not
12291229
* seem worth troubling over, currently.

‎src/backend/access/heap/heapam_handler.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -816,7 +816,7 @@ heapam_relation_copy_for_cluster(Relation OldHeap, Relation NewHeap,
816816
* If the last pages of the scan were empty, we would go to
817817
* the next phase while heap_blks_scanned != heap_blks_total.
818818
* Instead, to ensure that heap_blks_scanned is equivalent to
819-
* total_heap_blks after the table scan phase, this parameter
819+
* heap_blks_total after the table scan phase, this parameter
820820
* is manually updated to the correct value when the table
821821
* scan finishes.
822822
*/

‎src/backend/access/heap/pruneheap.c

Lines changed: 2 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -198,8 +198,7 @@ heap_page_prune_opt(Relation relation, Buffer buffer)
198198
/*
199199
* Now that we have buffer lock, get accurate information about the
200200
* page's free space, and recheck the heuristic about whether to
201-
* prune. (We needn't recheck PageIsPrunable, since no one else could
202-
* have pruned while we hold pin.)
201+
* prune.
203202
*/
204203
if (PageIsFull(page) || PageGetHeapFreeSpace(page) < minfree)
205204
{
@@ -490,7 +489,7 @@ heap_page_prune(Relation relation, Buffer buffer,
490489
*
491490
* Due to its cost we also only want to call
492491
* TransactionIdLimitedForOldSnapshots() if necessary, i.e. we might not have
493-
* done so in heap_hot_prune_opt() if pd_prune_xid was old enough. But we
492+
* done so in heap_page_prune_opt() if pd_prune_xid was old enough. But we
494493
* still want to be able to remove rows that are too new to be removed
495494
* according to prstate->vistest, but that can be removed based on
496495
* old_snapshot_threshold. So we call TransactionIdLimitedForOldSnapshots() on

‎src/backend/access/heap/vacuumlazy.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2575,7 +2575,7 @@ lazy_vacuum_heap_page(LVRelState *vacrel, BlockNumber blkno, Buffer buffer,
25752575
END_CRIT_SECTION();
25762576

25772577
/*
2578-
* Now that we have removed the LD_DEAD items from the page, once again
2578+
* Now that we have removed the LP_DEAD items from the page, once again
25792579
* check if the page has become all-visible. The page is already marked
25802580
* dirty, exclusively locked, and, if needed, a full page image has been
25812581
* emitted.

‎src/backend/access/nbtree/nbtsplitloc.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -119,7 +119,7 @@ static inline IndexTuple _bt_split_firstright(FindSplitData *state,
119119
* righthand page (which is called firstrightoff), plus a boolean
120120
* indicating whether the new tuple goes on the left or right page. You
121121
* can think of the returned state as a point _between_ two adjacent data
122-
* items (laftleft and firstright data items) on an imaginary version of
122+
* items (lastleft and firstright data items) on an imaginary version of
123123
* origpage that already includes newitem. The bool is necessary to
124124
* disambiguate the case where firstrightoff == newitemoff (i.e. it is
125125
* sometimes needed to determine if the firstright tuple for the split is

‎src/backend/access/transam/slru.c

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -809,7 +809,7 @@ SlruPhysicalWritePage(SlruCtl ctl, int pageno, int slotno, SlruWriteAll fdata)
809809
}
810810

811811
/*
812-
* During a WriteAll, we may already have the desired file open.
812+
* During a SimpleLruWriteAll, we may already have the desired file open.
813813
*/
814814
if (fdata)
815815
{
@@ -864,7 +864,7 @@ SlruPhysicalWritePage(SlruCtl ctl, int pageno, int slotno, SlruWriteAll fdata)
864864
else
865865
{
866866
/*
867-
* In the unlikely event that we exceed MAX_FLUSH_BUFFERS,
867+
* In the unlikely event that we exceed MAX_WRITEALL_BUFFERS,
868868
* fall back to treating it as a standalone write.
869869
*/
870870
fdata = NULL;
@@ -1478,7 +1478,7 @@ SlruPagePrecedesTestOffset(SlruCtl ctl, int per_page, uint32 offset)
14781478
*
14791479
* This assumes every uint32 >= FirstNormalTransactionId is a valid key. It
14801480
* assumes each value occupies a contiguous, fixed-size region of SLRU bytes.
1481-
* (MultiXactMemberCtl separates flags from XIDs. AsyncCtl has
1481+
* (MultiXactMemberCtl separates flags from XIDs. NotifyCtl has
14821482
* variable-length entries, no keys, and no random access. These unit tests
14831483
* do not apply to them.)
14841484
*/

‎src/backend/access/transam/xlogreader.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1476,7 +1476,7 @@ XLogFindNextRecord(XLogReaderState *state, XLogRecPtr RecPtr)
14761476
}
14771477

14781478
/*
1479-
* Helper function to ease writing of XLogRoutine->page_read callbacks.
1479+
* Helper function to ease writing of XLogReaderRoutine->page_read callbacks.
14801480
* If this function is used, caller must supply a segment_open callback in
14811481
* 'state', as that is used here.
14821482
*
@@ -1513,7 +1513,7 @@ WALRead(XLogReaderState *state,
15131513
/*
15141514
* If the data we want is not in a segment we have open, close what we
15151515
* have (if anything) and open the next one, using the caller's
1516-
* provided openSegment callback.
1516+
* provided segment_open callback.
15171517
*/
15181518
if (state->seg.ws_file < 0 ||
15191519
!XLByteInSeg(recptr, state->seg.ws_segno, state->segcxt.ws_segsize) ||

‎src/backend/commands/opclasscmds.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -819,7 +819,7 @@ AlterOpFamily(AlterOpFamilyStmt *stmt)
819819
Oid amoid, /* our AM's oid */
820820
opfamilyoid; /* oid of opfamily */
821821
int maxOpNumber, /* amstrategies value */
822-
optsProcNumber, /* amopclassopts value */
822+
optsProcNumber, /* amoptsprocnum value */
823823
maxProcNumber; /* amsupport value */
824824
HeapTuple tup;
825825
Form_pg_am amform;
@@ -1321,7 +1321,7 @@ assignProcTypes(OpFamilyMember *member, Oid amoid, Oid typeoid,
13211321
/*
13221322
* pg_amproc functions are indexed by (lefttype, righttype), but
13231323
* an equalimage function can only be called at CREATE INDEX time.
1324-
* The same opclass opcintype OID is always used for leftype and
1324+
* The same opclass opcintype OID is always used for lefttype and
13251325
* righttype. Providing a cross-type routine isn't sensible.
13261326
* Reject cross-type ALTER OPERATOR FAMILY ... ADD FUNCTION 4
13271327
* statements here.

‎src/backend/commands/subscriptioncmds.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -974,8 +974,8 @@ AlterSubscription_refresh(Subscription *sub, bool copy_data,
974974
*
975975
* Even if new worker for this particular rel is restarted it
976976
* won't be able to make any progress as we hold exclusive
977-
* lock on subscription_rel till the transaction end. It will
978-
* simply exit as there is no corresponding rel entry.
977+
* lock on pg_subscription_rel till the transaction end. It
978+
* will simply exit as there is no corresponding rel entry.
979979
*
980980
* This locking also ensures that the state of rels won't
981981
* change till we are done with this refresh operation.

‎src/backend/commands/tablecmds.c

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -2984,7 +2984,7 @@ MergeAttributes(List *schema, List *supers, char relpersistence,
29842984
* generated column, we'll take its generation expression in
29852985
* preference to the parent's. We must check that the child
29862986
* column doesn't specify a default value or identity, which
2987-
* matches the rules for a single column in parse_util.c.
2987+
* matches the rules for a single column in parse_utilcmd.c.
29882988
*
29892989
* Conversely, if the parent column is not generated, the
29902990
* child column can't be either. (We used to allow that, but
@@ -8017,7 +8017,7 @@ ATPrepDropExpression(Relation rel, AlterTableCmd *cmd, bool recurse, bool recurs
80178017
* is a bit complicated. GENERATED clauses must be attached to the column
80188018
* definition and cannot be added later like DEFAULT, so if a child table
80198019
* has a generation expression that the parent does not have, the child
8020-
* column will necessarily be an attlocal column. So to implement ONLY
8020+
* column will necessarily be an attislocal column. So to implement ONLY
80218021
* here, we'd need extra code to update attislocal of the direct child
80228022
* tables, somewhat similar to how DROP COLUMN does it, so that the
80238023
* resulting state can be properly dumped and restored.
@@ -10930,7 +10930,7 @@ ATExecAlterConstraint(Relation rel, AlterTableCmd *cmd, bool recurse,
1093010930
}
1093110931

1093210932
/*
10933-
* ATExecConstrRecurse already invalidated relcache for the relations
10933+
* ATExecAlterConstrRecurse already invalidated relcache for the relations
1093410934
* having the constraint itself; here we also invalidate for relations
1093510935
* that have any triggers that are part of the constraint.
1093610936
*/

‎src/backend/executor/nodeAgg.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3004,7 +3004,7 @@ hashagg_batch_new(LogicalTape *input_tape, int setno,
30043004
}
30053005

30063006
/*
3007-
* read_spilled_tuple
3007+
* hashagg_batch_read
30083008
* read the next tuple from a batch's tape. Return NULL if no more.
30093009
*/
30103010
static MinimalTuple

‎src/backend/jit/llvm/llvmjit_expr.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -2121,8 +2121,8 @@ llvm_compile_expr(ExprState *state)
21212121

21222122
/*
21232123
* pergroup = &aggstate->all_pergroups
2124-
* [op->d.agg_strict_trans_check.setoff]
2125-
* [op->d.agg_init_trans_check.transno];
2124+
* [op->d.agg_trans.setoff]
2125+
* [op->d.agg_trans.transno];
21262126
*/
21272127
v_allpergroupsp =
21282128
l_load_struct_gep(b, v_aggstatep,

‎src/backend/optimizer/plan/planagg.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -386,7 +386,7 @@ build_minmax_path(PlannerInfo *root, MinMaxAggInfo *mminfo,
386386
ntest = makeNode(NullTest);
387387
ntest->nulltesttype = IS_NOT_NULL;
388388
ntest->arg = copyObject(mminfo->target);
389-
/* we checked it wasn't a rowtype in find_minmax_aggs_walker */
389+
/* we checked it wasn't a rowtype in can_minmax_aggs */
390390
ntest->argisrow = false;
391391
ntest->location = -1;
392392

‎src/backend/parser/gram.y

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -957,7 +957,7 @@ stmtmulti: stmtmulti ';' toplevel_stmt
957957

958958
/*
959959
* toplevel_stmt includes BEGIN and END. stmt does not include them, because
960-
* those words have different meanings in function bodys.
960+
* those words have different meanings in function bodies.
961961
*/
962962
toplevel_stmt:
963963
stmt

‎src/backend/partitioning/partbounds.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2340,7 +2340,7 @@ merge_default_partitions(PartitionMap *outer_map,
23402340
/*
23412341
* The default partitions have to be joined with each other, so merge
23422342
* them. Note that each of the default partitions isn't merged yet
2343-
* (see, process_outer_partition()/process_innerer_partition()), so
2343+
* (see, process_outer_partition()/process_inner_partition()), so
23442344
* they should be merged successfully. The merged partition will act
23452345
* as the default partition of the join relation.
23462346
*/

‎src/backend/partitioning/partdesc.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -55,7 +55,7 @@ static PartitionDesc RelationBuildPartitionDesc(Relation rel,
5555
* RelationGetPartitionDesc -- get partition descriptor, if relation is partitioned
5656
*
5757
* We keep two partdescs in relcache: rd_partdesc includes all partitions
58-
* (even those being concurrently marked detached), while rd_partdesc_nodetach
58+
* (even those being concurrently marked detached), while rd_partdesc_nodetached
5959
* omits (some of) those. We store the pg_inherits.xmin value for the latter,
6060
* to determine whether it can be validly reused in each case, since that
6161
* depends on the active snapshot.

‎src/backend/replication/logical/reorderbuffer.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1885,7 +1885,7 @@ ReorderBufferStreamCommit(ReorderBuffer *rb, ReorderBufferTXN *txn)
18851885
/*
18861886
* This is a PREPARED transaction, part of a two-phase commit. The
18871887
* full cleanup will happen as part of the COMMIT PREPAREDs, so now
1888-
* just truncate txn by removing changes and tuple_cids.
1888+
* just truncate txn by removing changes and tuplecids.
18891889
*/
18901890
ReorderBufferTruncateTXN(rb, txn, true);
18911891
/* Reset the CheckXidAlive */
@@ -4010,7 +4010,7 @@ ReorderBufferStreamTXN(ReorderBuffer *rb, ReorderBufferTXN *txn)
40104010
* After that we need to reuse the snapshot from the previous run.
40114011
*
40124012
* Unlike DecodeCommit which adds xids of all the subtransactions in
4013-
* snapshot's xip array via SnapBuildCommittedTxn, we can't do that here
4013+
* snapshot's xip array via SnapBuildCommitTxn, we can't do that here
40144014
* but we do add them to subxip array instead via ReorderBufferCopySnap.
40154015
* This allows the catalog changes made in subtransactions decoded till
40164016
* now to be visible.

‎src/backend/replication/syncrep.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -804,7 +804,7 @@ standby_priority_comparator(const void *a, const void *b)
804804

805805
/*
806806
* We might have equal priority values; arbitrarily break ties by position
807-
* in the WALSnd array. (This is utterly bogus, since that is arrival
807+
* in the WalSnd array. (This is utterly bogus, since that is arrival
808808
* order dependent, but there are regression tests that rely on it.)
809809
*/
810810
return sa->walsnd_index - sb->walsnd_index;

‎src/backend/storage/file/fd.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3069,7 +3069,7 @@ AtEOXact_Files(bool isCommit)
30693069
/*
30703070
* BeforeShmemExit_Files
30713071
*
3072-
* before_shmem_access hook to clean up temp files during backend shutdown.
3072+
* before_shmem_exit hook to clean up temp files during backend shutdown.
30733073
* Here, we want to clean up *all* temp files including interXact ones.
30743074
*/
30753075
static void

‎src/backend/storage/ipc/latch.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -151,7 +151,7 @@ struct WaitEventSet
151151
#endif
152152
};
153153

154-
/* A common WaitEventSet used to implement WatchLatch() */
154+
/* A common WaitEventSet used to implement WaitLatch() */
155155
static WaitEventSet *LatchWaitSet;
156156

157157
/* The position of the latch in LatchWaitSet. */

‎src/backend/storage/ipc/procarray.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1754,7 +1754,7 @@ ComputeXidHorizons(ComputeXidHorizonsResult *h)
17541754
* current top-level xid any.
17551755
*
17561756
* Without an assigned xid we could use a horizon as aggressive as
1757-
* ReadNewTransactionid(), but we can get away with the much cheaper
1757+
* GetNewTransactionId(), but we can get away with the much cheaper
17581758
* latestCompletedXid + 1: If this backend has no xid there, by
17591759
* definition, can't be any newer changes in the temp table than
17601760
* latestCompletedXid.

‎src/backend/storage/lmgr/spin.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -37,7 +37,7 @@
3737
#define NUM_EMULATION_SEMAPHORES (NUM_SPINLOCK_SEMAPHORES + NUM_ATOMICS_SEMAPHORES)
3838
#else
3939
#define NUM_EMULATION_SEMAPHORES (NUM_SPINLOCK_SEMAPHORES)
40-
#endif /* DISABLE_ATOMICS */
40+
#endif /* HAVE_ATOMICS */
4141

4242
PGSemaphore *SpinlockSemaArray;
4343

‎src/backend/utils/activity/backend_status.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -283,7 +283,7 @@ pgstat_beinit(void)
283283
*
284284
* Apart from auxiliary processes, MyBackendId, MyDatabaseId,
285285
* session userid, and application_name must be set for a
286-
* backend (hence, this cannot be combined with pgbestat_beinit).
286+
* backend (hence, this cannot be combined with pgstat_beinit).
287287
* Note also that we must be inside a transaction if this isn't an aux
288288
* process, as we may need to do encoding conversion on some strings.
289289
* ----------

‎src/backend/utils/activity/pgstat_wal.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -24,7 +24,7 @@
2424
PgStat_PendingWalStats PendingWalStats = {0};
2525

2626
/*
27-
* WAL usage counters saved from pgWALUsage at the previous call to
27+
* WAL usage counters saved from pgWalUsage at the previous call to
2828
* pgstat_report_wal(). This is used to calculate how much WAL usage
2929
* happens between pgstat_report_wal() calls, by subtracting
3030
* the previous counters from the current ones.

‎src/backend/utils/adt/acl.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -4717,8 +4717,8 @@ pg_has_role_id_id(PG_FUNCTION_ARGS)
47174717
* Convert text string to AclMode value.
47184718
*
47194719
* We use USAGE to denote whether the privileges of the role are accessible
4720-
* (has_privs), MEMBER to denote is_member, and MEMBER WITH GRANT OPTION
4721-
* (or ADMIN OPTION) to denote is_admin. There is no ACL bit corresponding
4720+
* (has_privs_of_role), MEMBER to denote is_member, and MEMBER WITH GRANT
4721+
* (or ADMIN) OPTION to denote is_admin. There is no ACL bit corresponding
47224722
* to MEMBER so we cheat and use ACL_CREATE for that. This convention
47234723
* is shared only with pg_role_aclcheck, below.
47244724
*/

‎src/backend/utils/adt/pg_locale.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1012,7 +1012,7 @@ search_locale_enum(LPWSTR pStr, DWORD dwFlags, LPARAM lparam)
10121012
{
10131013
/*
10141014
* If the enumerated locale does not have a hyphen ("en") OR the
1015-
* lc_message input does not have an underscore ("English"), we only
1015+
* locale_name input does not have an underscore ("English"), we only
10161016
* need to compare the <Language> tags.
10171017
*/
10181018
if (wcsrchr(pStr, '-') == NULL || wcsrchr(argv[0], '_') == NULL)

‎src/backend/utils/adt/selfuncs.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4210,7 +4210,7 @@ estimate_multivariate_ndistinct(PlannerInfo *root, RelOptInfo *rel,
42104210
* Process complex expressions, not just simple Vars.
42114211
*
42124212
* First, we search for an exact match of an expression. If we
4213-
* find one, we can just discard the whole GroupExprInfo, with all
4213+
* find one, we can just discard the whole GroupVarInfo, with all
42144214
* the variables we extracted from it.
42154215
*
42164216
* Otherwise we inspect the individual vars, and try matching it

‎src/backend/utils/mb/mbutils.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -453,7 +453,7 @@ pg_do_encoding_conversion(unsigned char *src, int len,
453453
*
454454
* The output is null-terminated.
455455
*
456-
* If destlen < srclen * MAX_CONVERSION_LENGTH + 1, the converted output
456+
* If destlen < srclen * MAX_CONVERSION_INPUT_LENGTH + 1, the converted output
457457
* wouldn't necessarily fit in the output buffer, and the function will not
458458
* convert the whole input.
459459
*

‎src/bin/pg_rewind/rewind_source.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -83,4 +83,4 @@ extern rewind_source *init_libpq_source(PGconn *conn);
8383
/* in local_source.c */
8484
extern rewind_source *init_local_source(const char *datadir);
8585

86-
#endif /* FETCH_H */
86+
#endif /* REWIND_SOURCE_H */

‎src/include/access/tableam.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -358,7 +358,7 @@ typedef struct TableAmRoutine
358358
* allowed by the AM.
359359
*
360360
* Implementations can assume that scan_set_tidrange is always called
361-
* before can_getnextslot_tidrange or after scan_rescan and before any
361+
* before scan_getnextslot_tidrange or after scan_rescan and before any
362362
* further calls to scan_getnextslot_tidrange.
363363
*/
364364
void (*scan_set_tidrange) (TableScanDesc scan,

0 commit comments

Comments
 (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy