Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commit8961cb9

Browse files
committed
Fix typos in comments
The changes done in this commit impact comments with no directuser-visible changes, with fixes for incorrect function, variable orstructure names.Author: Alexander LakhinDiscussion:https://postgr.es/m/e8c38840-596a-83d6-bd8d-cebc51111572@gmail.com
1 parent6fd8ae6 commit8961cb9

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 4thfiled.
1724+
# VxWorks passes extra cpu info in the 4thfield.
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 fromtaget page.
107+
* target page, which was visited last time via downlink fromtarget page.
108108
* We use it to check for missing downlinks.
109109
*/
110110
BlockNumberprevrightlink;

‎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
typedefstruct
2020
{
2121
int32vl_len_;/* varlena header (do not touch directly!) */
@@ -80,7 +80,7 @@ typedef char *BITVECP;
8080
#defineHASHVAL(val,siglen) (((unsigned int)(val)) % SIGLENBIT(siglen))
8181
#defineHASH(sign,val,siglen) SETBIT((sign), HASHVAL(val, siglen))
8282

83-
/*gist_intbig_ops opclass options */
83+
/*gist__intbig_ops opclass options */
8484
typedefstruct
8585
{
8686
int32vl_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
intdummy=0;
581581

582582
/*
583-
* Records other thanSWITCH_WAL must have content. We use an integer 0 to
584-
* follow the restriction.
583+
* Records other thanXLOG_SWITCH must have content. We use an integer 0
584+
*tofollow 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 inheap_hot_prune_opt() if pd_prune_xid was old enough. But we
492+
* done so inheap_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 theLD_DEAD items from the page, once again
2578+
* Now that we have removed theLP_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 aWriteAll, we may already have the desired file open.
812+
* During aSimpleLruWriteAll, 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 exceedMAX_FLUSH_BUFFERS,
867+
* In the unlikely event that we exceedMAX_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
*/

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp