We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see ourdocumentation.
There was an error while loading.Please reload this page.
1 parent4fc72cc commitfa60fb6Copy full SHA for fa60fb6
src/backend/access/brin/brin_pageops.c
@@ -494,7 +494,7 @@ brin_evacuate_page(Relation idxRel, BlockNumber pagesPerRange,
494
* index item of size itemsz. If oldbuf is a valid buffer, it is also locked
495
* (in an order determined to avoid deadlocks.)
496
*
497
- * If there's no existing page with enough free space toaccomodate the new
+ * If there's no existing page with enough free space toaccommodate the new
498
* item, the relation is extended. If this happens, *extended is set to true.
499
500
* If we find that the old page is no longer a regular index page (because
src/backend/access/heap/README.tuplock
@@ -9,7 +9,7 @@ is implemented by storing locking information in the tuple header: a tuple is
9
marked as locked by setting the current transaction's XID as its XMAX, and
10
setting additional infomask bits to distinguish this case from the more normal
11
case of having deleted the tuple. When multiple transactions concurrently
12
-lock a tuple, a MultiXact is used; see below. This mechanism canaccomodate
+lock a tuple, a MultiXact is used; see below. This mechanism canaccommodate
13
arbitrarily large numbers of tuples being locked simultaneously.
14
15
When it is necessary to wait for a tuple-level lock to be released, the basic
src/backend/access/transam/twophase.c
@@ -269,7 +269,7 @@ AtAbort_Twophase(void)
269
* can be finished later, so just unlock it.
270
271
* If we abort during prepare, after having written the WAL record, we
272
- * might not havetransfered all locks and other state to the prepared
+ * might not havetransferred all locks and other state to the prepared
273
* transaction yet. Likewise, if we abort during commit or rollback,
274
* after having written the WAL record, we might not have released
275
* all the resources held by the transaction yet. In those cases, the
src/backend/access/transam/xact.c
@@ -2317,7 +2317,7 @@ PrepareTransaction(void)
2317
/*
2318
* In normal commit-processing, this is all non-critical post-transaction
2319
* cleanup. When the transaction is prepared, however, it's important that
2320
- * the locks and other per-backend resources aretransfered to the
+ * the locks and other per-backend resources aretransferred to the
2321
* prepared transaction's PGPROC entry. Note that if an error is raised
2322
* here, it's too late to abort the transaction. XXX: This probably should
2323
* be in a critical section, to force a PANIC if any of this fails, but
src/backend/commands/event_trigger.c
@@ -883,7 +883,7 @@ EventTriggerSQLDrop(Node *parsetree)
883
884
* Nothing to do if run list is empty. Note this shouldn't happen,
885
* because if there are no sql_drop events, then objects-to-drop wouldn't
886
- * have been collected in the first place and we would havequitted above.
+ * have been collected in the first place and we would havequit above.
887
*/
888
if (runlist==NIL)
889
return;
src/backend/commands/vacuumlazy.c
@@ -952,7 +952,7 @@ lazy_scan_heap(Relation onerel, LVRelStats *vacrelstats,
952
heap_execute_freeze_tuple(htup,&frozen[i]);
953
}
954
955
-/* Now WAL-log freezing ifneccessary */
+/* Now WAL-log freezing ifnecessary */
956
if (RelationNeedsWAL(onerel))
957
{
958
XLogRecPtrrecptr;
src/backend/postmaster/bgwriter.c
@@ -297,7 +297,7 @@ BackgroundWriterMain(void)
297
* overall timeout handling but just assume we're going to get called
298
* often enough even if hibernation mode is active. It's not that
299
* important that log_snap_interval_ms is met strictly. To make sure
300
- * we're not waking the disk upunneccesarily on an idle system we
+ * we're not waking the disk upunnecessarily on an idle system we
301
* check whether there has been any WAL inserted since the last time
302
* we've logged a running xacts.
303
src/backend/replication/basebackup.c
@@ -85,7 +85,7 @@ static char *statrelpath = NULL;
85
/* The actual number of bytes, transfer of which may cause sleep. */
86
staticuint64throttling_sample;
87
88
-/* Amount of data alreadytransfered but not yet throttled. */
+/* Amount of data alreadytransferred but not yet throttled. */
89
staticint64throttling_counter;
90
91
/* The minimum time required to transfer throttling_sample bytes. */
@@ -172,7 +172,7 @@ perform_base_backup(basebackup_options *opt, DIR *tblspcdir)
172
173
174
* The minimum amount of time for throttling_sample bytes to be
175
- *transfered.
+ *transferred.
176
177
elapsed_min_unit=USECS_PER_SEC /THROTTLING_FREQUENCY;
178
src/backend/replication/logical/origin.c
@@ -1342,7 +1342,7 @@ pg_replication_origin_advance(PG_FUNCTION_ARGS)
1342
1343
* Can't sensibly pass a local commit to be flushed at checkpoint - this
1344
* xact hasn't committed yet. This is why this function should be used to
1345
- * set up theintial replication state, but not for replay.
+ * set up theinitial replication state, but not for replay.
1346
1347
replorigin_advance(node,remote_commit,InvalidXLogRecPtr,
1348
true/* go backward */, true/* wal log */);
src/backend/replication/logical/reorderbuffer.c
@@ -143,7 +143,7 @@ typedef struct ReorderBufferDiskChange
143
* without hitting disk in OLTP workloads, while starting to spool to disk in
144
* other workloads reasonably fast.
145
146
- * At some point in the future itprobaly makes sense to have a more elaborate
+ * At some point in the future itprobably makes sense to have a more elaborate
147
* resource management here, but it's not entirely clear what that would look
148
* like.
149
@@ -1704,7 +1704,7 @@ ReorderBufferForget(ReorderBuffer *rb, TransactionId xid, XLogRecPtr lsn)
1704
txn->final_lsn=lsn;
1705
1706
1707
- *Proccess cache invalidation messages if there are any. Even if we're
+ *Process cache invalidation messages if there are any. Even if we're
1708
* not interested in the transaction's contents, it could have manipulated
1709
* the catalog and we need to update the caches according to that.
1710