mirror of
https://github.com/postgres/postgres.git
synced 2025-11-19 13:42:17 +03:00
Fix typos.
Oskari Saarenmaa
This commit is contained in:
@@ -1613,7 +1613,7 @@ CheckPointTwoPhase(XLogRecPtr redo_horizon)
|
||||
* transaction manager isn't active.
|
||||
*
|
||||
* It's also possible to move I/O out of the lock, but on
|
||||
* every error we should check whether somebody commited our
|
||||
* every error we should check whether somebody committed our
|
||||
* transaction in different backend. Let's leave this optimisation
|
||||
* for future, if somebody will spot that this place cause
|
||||
* bottleneck.
|
||||
|
||||
@@ -838,7 +838,7 @@ pg_GSS_recvauth(Port *port)
|
||||
|
||||
/*
|
||||
* Loop through GSSAPI message exchange. This exchange can consist of
|
||||
* multiple messags sent in both directions. First message is always from
|
||||
* multiple messages sent in both directions. First message is always from
|
||||
* the client. All messages from client to server are password packets
|
||||
* (type 'p').
|
||||
*/
|
||||
@@ -1078,7 +1078,7 @@ pg_SSPI_recvauth(Port *port)
|
||||
|
||||
/*
|
||||
* Loop through SSPI message exchange. This exchange can consist of
|
||||
* multiple messags sent in both directions. First message is always from
|
||||
* multiple messages sent in both directions. First message is always from
|
||||
* the client. All messages from client to server are password packets
|
||||
* (type 'p').
|
||||
*/
|
||||
|
||||
@@ -501,7 +501,7 @@ build_join_rel(PlannerInfo *root,
|
||||
* level.
|
||||
*
|
||||
* Note that if there are more than two rels in this relation, they could
|
||||
* be divided between inner_rel and outer_rel in any arbitary way. We
|
||||
* be divided between inner_rel and outer_rel in any arbitrary way. We
|
||||
* assume this doesn't matter, because we should hit all the same baserels
|
||||
* and joinclauses while building up to this joinrel no matter which we
|
||||
* take; therefore, we should make the same decision here however we get
|
||||
|
||||
@@ -115,7 +115,7 @@ transformTargetEntry(ParseState *pstate,
|
||||
*
|
||||
* This code acts mostly the same for SELECT, UPDATE, or RETURNING lists;
|
||||
* the main thing is to transform the given expressions (the "val" fields).
|
||||
* The exprKind parameter distinguishes these cases when necesssary.
|
||||
* The exprKind parameter distinguishes these cases when necessary.
|
||||
*/
|
||||
List *
|
||||
transformTargetList(ParseState *pstate, List *targetlist,
|
||||
|
||||
@@ -113,7 +113,7 @@ int effective_io_concurrency = 0;
|
||||
|
||||
/*
|
||||
* GUC variables about triggering kernel writeback for buffers written; OS
|
||||
* dependant defaults are set via the GUC mechanism.
|
||||
* dependent defaults are set via the GUC mechanism.
|
||||
*/
|
||||
int checkpoint_flush_after = 0;
|
||||
int bgwriter_flush_after = 0;
|
||||
|
||||
@@ -34,7 +34,7 @@
|
||||
* substantially, but there should be few systems where we must make do
|
||||
* with such poor tools.
|
||||
*
|
||||
* As ever, Windows requires its own implemetation.
|
||||
* As ever, Windows requires its own implementation.
|
||||
*
|
||||
* Portions Copyright (c) 1996-2016, PostgreSQL Global Development Group
|
||||
* Portions Copyright (c) 1994, Regents of the University of California
|
||||
|
||||
@@ -71,7 +71,7 @@ typedef struct ProcArrayStruct
|
||||
* Known assigned XIDs handling
|
||||
*/
|
||||
int maxKnownAssignedXids; /* allocated size of array */
|
||||
int numKnownAssignedXids; /* currrent # of valid entries */
|
||||
int numKnownAssignedXids; /* current # of valid entries */
|
||||
int tailKnownAssignedXids; /* index of oldest valid element */
|
||||
int headKnownAssignedXids; /* index of newest element, + 1 */
|
||||
slock_t known_assigned_xids_lck; /* protects head/tail pointers */
|
||||
|
||||
@@ -1104,7 +1104,7 @@ shm_mq_inc_bytes_read(volatile shm_mq *mq, Size n)
|
||||
sender = mq->mq_sender;
|
||||
SpinLockRelease(&mq->mq_mutex);
|
||||
|
||||
/* We shoudn't have any bytes to read without a sender. */
|
||||
/* We shouldn't have any bytes to read without a sender. */
|
||||
Assert(sender != NULL);
|
||||
SetLatch(&sender->procLatch);
|
||||
}
|
||||
|
||||
@@ -508,7 +508,7 @@ parse_object(JsonLexContext *lex, JsonSemAction *sem)
|
||||
*/
|
||||
lex->lex_level++;
|
||||
|
||||
/* we know this will succeeed, just clearing the token */
|
||||
/* we know this will succeed, just clearing the token */
|
||||
lex_expect(JSON_PARSE_OBJECT_START, lex, JSON_TOKEN_OBJECT_START);
|
||||
|
||||
tok = lex_peek(lex);
|
||||
|
||||
@@ -67,7 +67,7 @@ rank_up(WindowObject winobj)
|
||||
up = true;
|
||||
}
|
||||
|
||||
/* We can advance the mark, but only *after* acccess to prior row */
|
||||
/* We can advance the mark, but only *after* access to prior row */
|
||||
WinSetMarkPosition(winobj, curpos);
|
||||
|
||||
return up;
|
||||
|
||||
@@ -2391,7 +2391,7 @@ static struct config_int ConfigureNamesInt[] =
|
||||
GUC_UNIT_BLOCKS
|
||||
},
|
||||
&checkpoint_flush_after,
|
||||
/* see bufmgr.h: OS dependant default */
|
||||
/* see bufmgr.h: OS dependent default */
|
||||
DEFAULT_CHECKPOINT_FLUSH_AFTER, 0, WRITEBACK_MAX_PENDING_FLUSHES,
|
||||
NULL, NULL, NULL
|
||||
},
|
||||
@@ -2403,7 +2403,7 @@ static struct config_int ConfigureNamesInt[] =
|
||||
GUC_UNIT_BLOCKS
|
||||
},
|
||||
&backend_flush_after,
|
||||
/* see bufmgr.h: OS dependant default */
|
||||
/* see bufmgr.h: OS dependent default */
|
||||
DEFAULT_BACKEND_FLUSH_AFTER, 0, WRITEBACK_MAX_PENDING_FLUSHES,
|
||||
NULL, NULL, NULL
|
||||
},
|
||||
|
||||
Reference in New Issue
Block a user