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

Commitad10853

Browse files
committed
Assorted comment fixes, mostly just typos, but some obsolete statements.
YAMAMOTO Takashi
1 parentdd243b3 commitad10853

File tree

11 files changed

+24
-20
lines changed

11 files changed

+24
-20
lines changed

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -253,7 +253,7 @@ gistplacetopage(Relation rel, Size freespace, GISTSTATE *giststate,
253253
}
254254

255255
/*
256-
* Now that we knowwhick blocks the new pages go to, set up downlink
256+
* Now that we knowwhich blocks the new pages go to, set up downlink
257257
* tuples to point to them.
258258
*/
259259
for (ptr=dist;ptr;ptr=ptr->next)

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

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
/*-------------------------------------------------------------------------
22
*
33
* gistproc.c
4-
* Support procedures for GiSTs over 2-D objects (boxes, polygons, circles).
4+
* Support procedures for GiSTs over 2-D objects (boxes, polygons, circles,
5+
* points).
56
*
67
* This gives R-tree behavior, with Guttman's poly-time split algorithm.
78
*

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

Lines changed: 7 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -29,7 +29,7 @@ typedef struct
2929

3030
/*
3131
* Forms unions of subkeys after page split, but
32-
* uses only tuples aren't in groups ofequalent tuples
32+
* uses only tuplesthataren't in groups ofequivalent tuples
3333
*/
3434
staticvoid
3535
gistunionsubkeyvec(GISTSTATE*giststate,IndexTuple*itvec,
@@ -200,8 +200,8 @@ do {\
200200

201201
/*
202202
* adjust left and right unions according to splits by previous
203-
* split byfirsts columns. This function is called only in case
204-
* when pickSplit doesn't supportsubspplit.
203+
* split byfirst columns. This function is called only in case
204+
* when pickSplit doesn't supportsubsplit.
205205
*/
206206

207207
staticvoid
@@ -503,8 +503,8 @@ gistSplitHalf(GIST_SPLITVEC *v, int len)
503503
}
504504

505505
/*
506-
*trys to split page by attno key, in a case of null
507-
* values moveits to separate page.
506+
*tries to split page by attno key, in case of null
507+
* values movethose to separate page.
508508
*/
509509
void
510510
gistSplitByKey(Relationr,Pagepage,IndexTuple*itup,intlen,GISTSTATE*giststate,
@@ -531,7 +531,7 @@ gistSplitByKey(Relation r, Page page, IndexTuple *itup, int len, GISTSTATE *gist
531531
{
532532
/*
533533
* Corner case: All keys in attno column are null, we should try to
534-
* split by keys in next column.It all keys in all columns are NULL
534+
* split by keys in next column.If all keys in all columns are NULL
535535
* just split page half by half
536536
*/
537537
v->spl_risnull[attno]=v->spl_lisnull[attno]= TRUE;
@@ -582,7 +582,7 @@ gistSplitByKey(Relation r, Page page, IndexTuple *itup, int len, GISTSTATE *gist
582582
{
583583
/*
584584
* simple case: left and right keys for attno column are
585-
*equial
585+
*equal
586586
*/
587587
gistSplitByKey(r,page,itup,len,giststate,v,entryvec,attno+1);
588588
}

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

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -22,7 +22,7 @@
2222
#include"utils/builtins.h"
2323

2424
/*
25-
* static *S used fortemrorary storage (saves stack and palloc() call)
25+
* static *S used fortemporary storage (saves stack and palloc() call)
2626
*/
2727

2828
staticDatumattrS[INDEX_MAX_KEYS];
@@ -148,8 +148,8 @@ gistfillitupvec(IndexTuple *vec, int veclen, int *memlen)
148148
}
149149

150150
/*
151-
* Make unions of keys in IndexTuple vector, return FALSE if itvec contains
152-
*invalid tuple.Resulting Datums aren't compressed.
151+
* Make unions of keys in IndexTuple vector.
152+
* Resulting Datums aren't compressed.
153153
*/
154154

155155
void

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -131,7 +131,7 @@ pushStackIfSplited(Page page, GistBDItem *stack)
131131

132132
/*
133133
* Bulk deletion of all index entries pointing to a set of heap tuples and
134-
* check invalid tuples aftercrash recovery.
134+
* check invalid tuplesleftafterupgrade.
135135
* The set of target tuples is specified via a callback routine that tells
136136
* whether any given heap tuple (identified by ItemPointer) is being deleted.
137137
*

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

Lines changed: 4 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -44,9 +44,10 @@
4444
*
4545
* Note: because TransactionIds are 32 bits and wrap around at 0xFFFFFFFF,
4646
* CLOG page numbering also wraps around at 0xFFFFFFFF/CLOG_XACTS_PER_PAGE,
47-
* and CLOG segment numbering at 0xFFFFFFFF/CLOG_XACTS_PER_SEGMENT. We need
48-
* take no explicit notice of that fact in this module, except when comparing
49-
* segment and page numbers in TruncateCLOG (see CLOGPagePrecedes).
47+
* and CLOG segment numbering at
48+
* 0xFFFFFFFF/CLOG_XACTS_PER_PAGE/SLRU_PAGES_PER_SEGMENT. We need take no
49+
* explicit notice of that fact in this module, except when comparing segment
50+
* and page numbers in TruncateCLOG (see CLOGPagePrecedes).
5051
*/
5152

5253
/* We need two bits per xact, so four xacts fit in a byte */

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

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -280,6 +280,8 @@ SimpleLruZeroPage(SlruCtl ctl, int pageno)
280280
* in a page from disk into an existing buffer. (Such an old page cannot
281281
* have any interesting LSNs, since we'd have flushed them before writing
282282
* the page in the first place.)
283+
*
284+
* This assumes that InvalidXLogRecPtr is bitwise-all-0.
283285
*/
284286
staticvoid
285287
SimpleLruZeroLSNs(SlruCtlctl,intslotno)

‎src/backend/executor/nodeWindowAgg.c‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1668,7 +1668,7 @@ ExecEndWindowAgg(WindowAggState *node)
16681668
}
16691669

16701670
/* -----------------
1671-
*ExecRescanWindowAgg
1671+
*ExecReScanWindowAgg
16721672
* -----------------
16731673
*/
16741674
void

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1214,7 +1214,7 @@ GetMaxSnapshotSubxidCount(void)
12141214
*
12151215
* We also update the following backend-global variables:
12161216
*TransactionXmin: the oldest xmin of any snapshot in use in the
1217-
*current transaction (this is the same asMyProc->xmin).
1217+
*current transaction (this is the same asMyPgXact->xmin).
12181218
*RecentXmin: the xmin computed for the most recent snapshot. XIDs
12191219
*older than this are known not running any more.
12201220
*RecentGlobalXmin: the global xmin (oldest TransactionXmin across all

‎src/backend/utils/hash/hashfn.c‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -25,7 +25,7 @@
2525

2626

2727
/*
28-
* string_hash: hash function for keys that arenull-terminated strings.
28+
* string_hash: hash function for keys that areNUL-terminated strings.
2929
*
3030
* NOTE: this is the default hash function if none is specified.
3131
*/

0 commit comments

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