1
0
mirror of https://github.com/postgres/postgres.git synced 2025-11-04 20:11:56 +03:00

Fix typos and duplicate words

This fixes various typos, duplicated words, and tiny bits of whitespace
mainly in code comments but also in docs.

Author: Daniel Gustafsson <daniel@yesql.se>
Author: Heikki Linnakangas <hlinnaka@iki.fi>
Author: Alexander Lakhin <exclusion@gmail.com>
Author: David Rowley <dgrowleyml@gmail.com>
Author: Nazir Bilal Yavuz <byavuz81@gmail.com>
Discussion: https://postgr.es/m/3F577953-A29E-4722-98AD-2DA9EFF2CBB8@yesql.se
This commit is contained in:
Daniel Gustafsson
2024-04-18 21:28:07 +02:00
parent fbed6ebe41
commit 950d4a2cb1
67 changed files with 93 additions and 92 deletions

View File

@@ -541,9 +541,9 @@ read_stream_begin_relation(int flags,
stream->distance = 1;
/*
* Since we always always access the same relation, we can initialize
* parts of the ReadBuffersOperation objects and leave them that way, to
* avoid wasting CPU cycles writing to them for each read.
* Since we always access the same relation, we can initialize parts of
* the ReadBuffersOperation objects and leave them that way, to avoid
* wasting CPU cycles writing to them for each read.
*/
for (int i = 0; i < max_ios; ++i)
{

View File

@@ -1073,7 +1073,7 @@ PinBufferForBlock(Relation rel,
/*
* If there is no Relation it usually implies recovery and thus permanent,
* but we take an argmument because CreateAndCopyRelationData can reach us
* but we take an argument because CreateAndCopyRelationData can reach us
* with only an SMgrRelation for an unlogged relation that we don't want
* to flag with BM_PERMANENT.
*/

View File

@@ -1032,7 +1032,7 @@ LockAcquireExtended(const LOCKTAG *locktag,
/*
* Sleep till someone wakes me up. We do this even in the dontWait
* case, beause while trying to go to sleep, we may discover that we
* case, because while trying to go to sleep, we may discover that we
* can acquire the lock immediately after all.
*/

View File

@@ -1047,7 +1047,7 @@ AuxiliaryPidGetProc(int pid)
* called, because it could be that when we try to find a position at which
* to insert ourself into the wait queue, we discover that we must be inserted
* ahead of everyone who wants a lock that conflict with ours. In that case,
* we get the lock immediately. Beause of this, it's sensible for this function
* we get the lock immediately. Because of this, it's sensible for this function
* to have a dontWait argument, despite the name.
*
* The lock table's partition lock must be held at entry, and will be held