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

Commitf43608b

Browse files
committed
Fix typos and inconsistencies in code comments
Author: Alexander LakhinDiscussion:https://postgr.es/m/dec6aae8-2d63-639f-4d50-20e229fb83e3@gmail.com
1 parent96719e5 commitf43608b

File tree

8 files changed

+13
-14
lines changed

8 files changed

+13
-14
lines changed

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -424,7 +424,7 @@ _bt_binsrch(Relation rel,
424424

425425
/*
426426
*
427-
*bt_binsrch_insert() -- Cacheable, incremental leaf page binary search.
427+
*_bt_binsrch_insert() -- Cacheable, incremental leaf page binary search.
428428
*
429429
* Like _bt_binsrch(), but with support for caching the binary search
430430
* bounds. Only used during insertion, and only on the leaf page that it

‎src/backend/catalog/catalog.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -383,7 +383,7 @@ GetNewOidWithIndex(Relation relation, Oid indexId, AttrNumber oidcolumn)
383383
* is also an unused OID within pg_class. If the result is to be used only
384384
* as a relfilenode for an existing relation, pass NULL for pg_class.
385385
*
386-
* As withGetNewObjectIdWithIndex(), there is some theoretical risk of a race
386+
* As withGetNewOidWithIndex(), there is some theoretical risk of a race
387387
* condition, but it doesn't seem worth worrying about.
388388
*
389389
* Note: we don't support using this in bootstrap mode. All relations

‎src/backend/commands/copy.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2626,7 +2626,7 @@ CopyMultiInsertInfoNextFreeSlot(CopyMultiInsertInfo *miinfo,
26262626

26272627
/*
26282628
* Record the previously reserved TupleTableSlot that was reserved by
2629-
*MultiInsertInfoNextFreeSlot as being consumed.
2629+
*CopyMultiInsertInfoNextFreeSlot as being consumed.
26302630
*/
26312631
staticinlinevoid
26322632
CopyMultiInsertInfoStore(CopyMultiInsertInfo*miinfo,ResultRelInfo*rri,

‎src/backend/libpq/be-secure-gssapi.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -400,7 +400,7 @@ read_or_wait(Port *port, ssize_t len)
400400
{
401401
/*
402402
* If we got back less than zero, indicating an error, and that
403-
* wasn't just aEWOULDBOCK/EAGAIN, then give up.
403+
* wasn't just aEWOULDBLOCK/EAGAIN, then give up.
404404
*/
405405
if (ret<0&& !(errno==EWOULDBLOCK||errno==EAGAIN))
406406
return-1;

‎src/backend/parser/parse_target.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -38,7 +38,7 @@ static void markTargetListOrigin(ParseState *pstate, TargetEntry *tle,
3838
staticNode*transformAssignmentIndirection(ParseState*pstate,
3939
Node*basenode,
4040
constchar*targetName,
41-
booltargetIsArray,
41+
booltargetIsSubscripting,
4242
OidtargetTypeId,
4343
int32targetTypMod,
4444
OidtargetCollation,

‎src/backend/postmaster/checkpointer.c

Lines changed: 5 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -1213,12 +1213,11 @@ CompactCheckpointerRequestQueue(void)
12131213
* backwards from the end of the queue and check whether a request is
12141214
* *preceded* by an earlier, identical request, in the hopes of doing less
12151215
* copying. But that might change the semantics, if there's an
1216-
* intervening FORGET_RELATION_FSYNC or FORGET_DATABASE_FSYNC request, so
1217-
* we do it this way. It would be possible to be even smarter if we made
1218-
* the code below understand the specific semantics of such requests (it
1219-
* could blow away preceding entries that would end up being canceled
1220-
* anyhow), but it's not clear that the extra complexity would buy us
1221-
* anything.
1216+
* intervening SYNC_FORGET_REQUEST or SYNC_FILTER_REQUEST, so we do it
1217+
* this way. It would be possible to be even smarter if we made the code
1218+
* below understand the specific semantics of such requests (it could blow
1219+
* away preceding entries that would end up being canceled anyhow), but
1220+
* it's not clear that the extra complexity would buy us anything.
12221221
*/
12231222
for (n=0;n<CheckpointerShmem->num_requests;n++)
12241223
{

‎src/backend/utils/cache/lsyscache.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1055,7 +1055,7 @@ get_opclass_input_type(Oid opclass)
10551055
}
10561056

10571057
/*
1058-
*get_opclass_family_and_input_type
1058+
*get_opclass_opfamily_and_input_type
10591059
*
10601060
*Returns the OID of the operator family the opclass belongs to,
10611061
*the OID of the datatype the opclass indexes

‎src/port/pg_bitutils.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -28,7 +28,7 @@
2828
* left-most the 7th bit. The 0th entry of the array should not be used.
2929
*
3030
* Note: this is not used by the functions in pg_bitutils.h when
31-
*HAVE_BUILTIN_CLZ is defined, but we provide it anyway, so that
31+
*HAVE__BUILTIN_CLZ is defined, but we provide it anyway, so that
3232
* extensions possibly compiled with a different compiler can use it.
3333
*/
3434
constuint8pg_leftmost_one_pos[256]= {
@@ -56,7 +56,7 @@ const uint8 pg_leftmost_one_pos[256] = {
5656
* left-most the 7th bit. The 0th entry of the array should not be used.
5757
*
5858
* Note: this is not used by the functions in pg_bitutils.h when
59-
*HAVE_BUILTIN_CTZ is defined, but we provide it anyway, so that
59+
*HAVE__BUILTIN_CTZ is defined, but we provide it anyway, so that
6060
* extensions possibly compiled with a different compiler can use it.
6161
*/
6262
constuint8pg_rightmost_one_pos[256]= {

0 commit comments

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