database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-07-27 12:41:57 +03:00
Code Activity

Fix typos and grammar in the code

Browse Source 
The large majority of these have been introduced by recent commits done
in the v18 development cycle.

Author: Alexander Lakhin <exclusion@gmail.com>
Discussion: https://postgr.es/m/9a7763ab-5252-429d-a943-b28941e0e28b@gmail.com
This commit is contained in:
Michael Paquier
2025-04-19 19:17:42 +09:00
parent 114f7fa81c
commit 88e947136b
45 changed files with 68 additions and 69 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
contrib/amcheck/verify_common.h
View File

@ -16,7 +16,7 @@
#include "utils/relcache.h"
#include "miscadmin.h"
/* Typedefs for callback functions for amcheck_lock_relation */
/* Typedefs for callback functions for amcheck_lock_relation_and_check */
typedef void (*IndexCheckableCallback) (Relation index);
typedef void (*IndexDoCheckCallback) (Relation rel,
Relation heaprel,

6
contrib/amcheck/verify_gin.c
View File

@ -359,8 +359,8 @@ gin_check_posting_tree_parent_keys_consistency(Relation rel, BlockNumber posting
ptr->depth = stack->depth + 1;
/*
* Set rightmost parent key to invalid iterm pointer. Its
* value is 'Infinity' and not explicitly stored.
* Set rightmost parent key to invalid item pointer. Its value
* is 'Infinity' and not explicitly stored.
*/
if (rightlink == InvalidBlockNumber)
ItemPointerSetInvalid(&ptr->parentkey);
@ -587,7 +587,7 @@ gin_check_parent_keys_consistency(Relation rel,
/*
* Check if it is properly adjusted. If succeed,
* procced to the next key.
* proceed to the next key.
*/
if (ginCompareEntries(&state, attnum, current_key,
current_key_category, parent_key,

4
contrib/pg_buffercache/pg_buffercache_pages.c
View File

@ -289,7 +289,7 @@ pg_buffercache_pages(PG_FUNCTION_ARGS)
*
* Returns NUMA node ID for each memory page used by the buffer. Buffers may
* be smaller or larger than OS memory pages. For each buffer we return one
* entry for each memory page used by the buffer (it fhe buffer is smaller,
* entry for each memory page used by the buffer (if the buffer is smaller,
* it only uses a part of one memory page).
*
* We expect both sizes (for buffers and memory pages) to be a power-of-2, so
@ -335,7 +335,7 @@ pg_buffercache_numa_pages(PG_FUNCTION_ARGS)
* how the pages and buffers "align" in memory - the buffers may be
* shifted in some way, using more memory pages than necessary.
*
* So we need to be careful about mappping buffers to memory pages. We
* So we need to be careful about mapping buffers to memory pages. We
* calculate the maximum number of pages a buffer might use, so that
* we allocate enough space for the entries. And then we count the
* actual number of entries as we scan the buffers.

8
contrib/pg_overexplain/expected/pg_overexplain.out
View File

@ -123,7 +123,7 @@ $$);
RTI 1 (relation, inherited, in-from-clause):
Eref: vegetables (id, name, genus)
Relation: vegetables
Relation Kind: parititioned_table
Relation Kind: partitioned_table
Relation Lock Mode: AccessShareLock
Permission Info Index: 1
RTI 2 (group):
@ -250,7 +250,7 @@ $$);
<In-From-Clause>true</In-From-Clause> +
<Eref>vegetables (id, name, genus)</Eref> +
<Relation>vegetables</Relation> +
<Relation-Kind>parititioned_table</Relation-Kind> +
<Relation-Kind>partitioned_table</Relation-Kind> +
<Relation-Lock-Mode>AccessShareLock</Relation-Lock-Mode> +
<Permission-Info-Index>1</Permission-Info-Index> +
<Security-Barrier>false</Security-Barrier> +
@ -454,7 +454,7 @@ SELECT * FROM vegetables WHERE genus = 'daucus';
RTI 1 (relation, inherited, in-from-clause):
Eref: vegetables (id, name, genus)
Relation: vegetables
Relation Kind: parititioned_table
Relation Kind: partitioned_table
Relation Lock Mode: AccessShareLock
Permission Info Index: 1
RTI 2 (relation, in-from-clause):
@ -478,7 +478,7 @@ INSERT INTO vegetables (name, genus) VALUES ('broccoflower', 'brassica');
RTI 1 (relation):
Eref: vegetables (id, name, genus)
Relation: vegetables
Relation Kind: parititioned_table
Relation Kind: partitioned_table
Relation Lock Mode: RowExclusiveLock
Permission Info Index: 1
RTI 2 (result):

10
contrib/pg_overexplain/pg_overexplain.c
View File

@ -277,7 +277,7 @@ overexplain_per_plan_hook(PlannedStmt *plannedstmt,
* Print out various details from the PlannedStmt that wouldn't otherwise
* be displayed.
*
* We don't try to print everything here. Information that would be displyed
* We don't try to print everything here. Information that would be displayed
* anyway doesn't need to be printed again here, and things with lots of
* substructure probably should be printed via separate options, or not at all.
*/
@ -517,10 +517,10 @@ overexplain_range_table(PlannedStmt *plannedstmt, ExplainState *es)
relkind = "foreign_table";
break;
case RELKIND_PARTITIONED_TABLE:
relkind = "parititioned_table";
relkind = "partitioned_table";
break;
case RELKIND_PARTITIONED_INDEX:
relkind = "parititioned_index";
relkind = "partitioned_index";
break;
case '\0':
relkind = NULL;
@ -632,7 +632,7 @@ overexplain_range_table(PlannedStmt *plannedstmt, ExplainState *es)
}
/*
* add_rte_to_flat_rtable will clear coltypes, coltypemods, and
* add_rte_to_flat_rtable will clear coltypes, coltypmods, and
* colcollations, so skip those fields.
*
* If this is an ephemeral named relation, print out ENR-related
@ -675,7 +675,7 @@ overexplain_range_table(PlannedStmt *plannedstmt, ExplainState *es)
* Emit a text property describing the contents of an Alias.
*
* Column lists can be quite long here, so perhaps we should have an option
* to limit the display length by # of columsn or # of characters, but for
* to limit the display length by # of column or # of characters, but for
* now, just display everything.
*/
static void

2
contrib/postgres_fdw/t/001_auth_scram.pl
View File

@ -3,7 +3,7 @@
# Test SCRAM authentication when opening a new connection with a foreign
# server.
#
# The test is executed by testing the SCRAM authentifcation on a looplback
# The test is executed by testing the SCRAM authentifcation on a loopback
# connection on the same server and with different servers.
use strict;