Skip to content

Commit c80b5f6

Browse files
hlinnakahlinnaka
committed
Fix misc typos.
Oskari Saarenmaa. Backpatch to stable branches where applicable.
1 parent c39f567 commit c80b5f6

File tree

17 files changed

+25
-25
lines changed

17 files changed

+25
-25
lines changed

‎contrib/btree_gist/btree_ts.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -369,7 +369,7 @@ gbt_ts_penalty(PG_FUNCTION_ARGS)
369369
newdbl[2];
370370

371371
/*
372-
* We are allways using "double" timestamps here. Precision should be good
372+
* We are always using "double" timestamps here. Precision should be good
373373
* enough.
374374
*/
375375
orgdbl[0] = ((double) origentry->lower);

‎contrib/btree_gist/btree_utils_var.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -52,7 +52,7 @@ gbt_var_decompress(PG_FUNCTION_ARGS)
5252
PG_RETURN_POINTER(entry);
5353
}
5454

55-
/* Returns a better readable representaion of variable key ( sets pointer ) */
55+
/* Returns a better readable representation of variable key ( sets pointer ) */
5656
GBT_VARKEY_R
5757
gbt_var_key_readable(const GBT_VARKEY *k)
5858
{

‎contrib/cube/cube.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -814,7 +814,7 @@ cube_inter(PG_FUNCTION_ARGS)
814814
Max(LL_COORD(b, i), UR_COORD(b, i))
815815
);
816816
}
817-
/* continue on the higher dimemsions only present in 'a' */
817+
/* continue on the higher dimensions only present in 'a' */
818818
for (; i < DIM(a); i++)
819819
{
820820
result->x[i] = Max(0,

‎doc/src/sgml/ref/alter_role.sgml

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -138,7 +138,7 @@ ALTER ROLE { <replaceable class="PARAMETER">role_specification</replaceable> | A
138138
<term>CURRENT_USER</term>
139139
<listitem>
140140
<para>
141-
Alter the current user instead of an explicitely identified role.
141+
Alter the current user instead of an explicitly identified role.
142142
</para>
143143
</listitem>
144144
</varlistentry>
@@ -147,7 +147,7 @@ ALTER ROLE { <replaceable class="PARAMETER">role_specification</replaceable> | A
147147
<term>SESSION_USER</term>
148148
<listitem>
149149
<para>
150-
Alter the current session user instead of an explicitely identified
150+
Alter the current session user instead of an explicitly identified
151151
role.
152152
</para>
153153
</listitem>

‎doc/src/sgml/release-9.5.sgml

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -460,7 +460,7 @@ FIXME: Add Andres
460460
<!--
461461
2014-07-01 [9f03ca9] Robert..: Avoid copying index tuples when building an ind..
462462
-->
463-
Speed up CREATE INDEX by avoiding unneccessary memory copies (Robert Haas)
463+
Speed up CREATE INDEX by avoiding unnecessary memory copies (Robert Haas)
464464
</para>
465465
</listitem>
466466

@@ -1111,7 +1111,7 @@ FIXME: Correct description
11111111
-->
11121112
<para>
11131113
Allow changing of the <acronym>WAL</acronym>
1114-
logging status of a table ater creation with <link
1114+
logging status of a table after creation with <link
11151115
linkend="SQL-ALTERTABLE"><command>ALTER TABLE .. SET LOGGED /
11161116
UNLOGGED</></> (Fabr&iacute;zio de Royes Mello)
11171117
</para>

‎doc/src/sgml/sources.sgml

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -251,7 +251,7 @@ ereport(ERROR,
251251
</listitem>
252252
<listitem>
253253
<para>
254-
<function>errdetail_log_plural(const char *fmt_singuar, const char
254+
<function>errdetail_log_plural(const char *fmt_singular, const char
255255
*fmt_plural, unsigned long n, ...)</function> is like
256256
<function>errdetail_log</>, but with support for various plural forms of
257257
the message.

‎src/backend/access/brin/brin_revmap.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -127,7 +127,7 @@ brinRevmapExtend(BrinRevmap *revmap, BlockNumber heapBlk)
127127
* it's not long enough.
128128
*
129129
* The returned buffer is also recorded in the revmap struct; finishing that
130-
* releases the buffer, therefore the caller needn't do it explicitely.
130+
* releases the buffer, therefore the caller needn't do it explicitly.
131131
*/
132132
Buffer
133133
brinLockRevmapPageForUpdate(BrinRevmap *revmap, BlockNumber heapBlk)
@@ -314,7 +314,7 @@ revmap_get_blkno(BrinRevmap *revmap, BlockNumber heapBlk)
314314
* Obtain and return a buffer containing the revmap page for the given heap
315315
* page. The revmap must have been previously extended to cover that page.
316316
* The returned buffer is also recorded in the revmap struct; finishing that
317-
* releases the buffer, therefore the caller needn't do it explicitely.
317+
* releases the buffer, therefore the caller needn't do it explicitly.
318318
*/
319319
static Buffer
320320
revmap_get_buffer(BrinRevmap *revmap, BlockNumber heapBlk)

‎src/backend/access/common/heaptuple.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -805,7 +805,7 @@ heap_modify_tuple(HeapTuple tuple,
805805
* repl information, as appropriate.
806806
*
807807
* NOTE: it's debatable whether to use heap_deform_tuple() here or just
808-
* heap_getattr() only the non-replaced colums. The latter could win if
808+
* heap_getattr() only the non-replaced columns. The latter could win if
809809
* there are many replaced columns and few non-replaced ones. However,
810810
* heap_deform_tuple costs only O(N) while the heap_getattr way would cost
811811
* O(N^2) if there are many non-replaced columns, so it seems better to

‎src/backend/access/gin/ginfast.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -888,8 +888,8 @@ ginInsertCleanup(GinState *ginstate,
888888
* locking */
889889

890890
/*
891-
* remove readed pages from pending list, at this point all
892-
* content of readed pages is in regular structure
891+
* remove read pages from pending list, at this point all
892+
* content of read pages is in regular structure
893893
*/
894894
if (shiftList(index, metabuffer, blkno, stats))
895895
{

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

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -588,7 +588,7 @@ gist_box_picksplit(PG_FUNCTION_ARGS)
588588
* We first consider splits where b is the lower bound of an entry.
589589
* We iterate through all entries, and for each b, calculate the
590590
* smallest possible a. Then we consider splits where a is the
591-
* uppper bound of an entry, and for each a, calculate the greatest
591+
* upper bound of an entry, and for each a, calculate the greatest
592592
* possible b.
593593
*
594594
* In the above example, the first loop would consider splits:
@@ -638,7 +638,7 @@ gist_box_picksplit(PG_FUNCTION_ARGS)
638638
}
639639

640640
/*
641-
* Iterate over upper bound of left group finding greates possible
641+
* Iterate over upper bound of left group finding greatest possible
642642
* lower bound of right group.
643643
*/
644644
i1 = nentries - 1;

‎src/backend/access/heap/heapam.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -5473,7 +5473,7 @@ heap_lock_updated_tuple_rec(Relation rel, ItemPointer tid, TransactionId xid,
54735473
*
54745474
* The initial tuple is assumed to be already locked.
54755475
*
5476-
* This function doesn't check visibility, it just inconditionally marks the
5476+
* This function doesn't check visibility, it just unconditionally marks the
54775477
* tuple(s) as locked. If any tuple in the updated chain is being deleted
54785478
* concurrently (or updated with the key being modified), sleep until the
54795479
* transaction doing it is finished.
@@ -6187,7 +6187,7 @@ heap_prepare_freeze_tuple(HeapTupleHeader tuple, TransactionId cutoff_xid,
61876187
/*
61886188
* NB -- some of these transformations are only valid because we
61896189
* know the return Xid is a tuple updater (i.e. not merely a
6190-
* locker.) Also note that the only reason we don't explicitely
6190+
* locker.) Also note that the only reason we don't explicitly
61916191
* worry about HEAP_KEYS_UPDATED is because it lives in
61926192
* t_infomask2 rather than t_infomask.
61936193
*/

‎src/backend/access/heap/rewriteheap.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -763,9 +763,9 @@ raw_heap_insert(RewriteState state, HeapTuple tup)
763763
*
764764
* Crash-Safety: This module diverts from the usual patterns of doing WAL
765765
* since it cannot rely on checkpoint flushing out all buffers and thus
766-
* waiting for exlusive locks on buffers. Usually the XLogInsert() covering
766+
* waiting for exclusive locks on buffers. Usually the XLogInsert() covering
767767
* buffer modifications is performed while the buffer(s) that are being
768-
* modified are exlusively locked guaranteeing that both the WAL record and
768+
* modified are exclusively locked guaranteeing that both the WAL record and
769769
* the modified heap are on either side of the checkpoint. But since the
770770
* mapping files we log aren't in shared_buffers that interlock doesn't work.
771771
*

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -83,7 +83,7 @@ int synchronous_commit = SYNCHRONOUS_COMMIT_ON;
8383
* When running as a parallel worker, we place only a single
8484
* TransactionStateData on the parallel worker's state stack, and the XID
8585
* reflected there will be that of the *innermost* currently-active
86-
* subtransaction in the backend that initiated paralllelism. However,
86+
* subtransaction in the backend that initiated parallelism. However,
8787
* GetTopTransactionId() and TransactionIdIsCurrentTransactionId()
8888
* need to return the same answers in the parallel worker as they would have
8989
* in the user backend, so we need some additional bookkeeping.

‎src/backend/optimizer/path/costsize.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1039,7 +1039,7 @@ cost_tidscan(Path *path, PlannerInfo *root,
10391039

10401040
/*
10411041
* The TID qual expressions will be computed once, any other baserestrict
1042-
* quals once per retrived tuple.
1042+
* quals once per retrieved tuple.
10431043
*/
10441044
cost_qual_eval(&tid_qual_cost, tidquals, root);
10451045

‎src/backend/replication/logical/origin.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1049,7 +1049,7 @@ replorigin_session_setup(RepOriginId node)
10491049
{
10501050
ereport(ERROR,
10511051
(errcode(ERRCODE_OBJECT_IN_USE),
1052-
errmsg("replication identiefer %d is already active for pid %d",
1052+
errmsg("replication identifier %d is already active for pid %d",
10531053
curstate->roident, curstate->acquired_by)));
10541054
}
10551055

‎src/backend/utils/adt/regproc.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -855,7 +855,7 @@ format_operator_internal(Oid operator_oid, bool force_qualify)
855855

856856
/*
857857
* Would this oper be found (given the right args) by regoperatorin?
858-
* If not, or if caller explicitely requests it, we need to qualify
858+
* If not, or if caller explicitly requests it, we need to qualify
859859
* it.
860860
*/
861861
if (force_qualify || !OperatorIsVisible(operator_oid))

‎src/include/storage/lwlock.h

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -54,13 +54,13 @@ typedef struct LWLock
5454
slock_t mutex; /* Protects LWLock and queue of PGPROCs */
5555
uint16 tranche; /* tranche ID */
5656

57-
pg_atomic_uint32 state; /* state of exlusive/nonexclusive lockers */
57+
pg_atomic_uint32 state; /* state of exclusive/nonexclusive lockers */
5858
#ifdef LOCK_DEBUG
5959
pg_atomic_uint32 nwaiters; /* number of waiters */
6060
#endif
6161
dlist_head waiters; /* list of waiting PGPROCs */
6262
#ifdef LOCK_DEBUG
63-
struct PGPROC *owner; /* last exlusive owner of the lock */
63+
struct PGPROC *owner; /* last exclusive owner of the lock */
6464
#endif
6565
} LWLock;
6666

0 commit comments

Comments
 (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy