mirror of
https://github.com/postgres/postgres.git
synced 2025-04-21 12:05:57 +03:00
Fix typos.
Oskari Saarenmaa
This commit is contained in:
parent
fd658dbb30
commit
3aff33aa68
@ -63,7 +63,7 @@ extern void sha1_pad(struct sha1_ctxt *);
|
|||||||
extern void sha1_loop(struct sha1_ctxt *, const uint8 *, size_t);
|
extern void sha1_loop(struct sha1_ctxt *, const uint8 *, size_t);
|
||||||
extern void sha1_result(struct sha1_ctxt *, uint8 *);
|
extern void sha1_result(struct sha1_ctxt *, uint8 *);
|
||||||
|
|
||||||
/* compatibilty with other SHA1 source codes */
|
/* compatibility with other SHA1 source codes */
|
||||||
typedef struct sha1_ctxt SHA1_CTX;
|
typedef struct sha1_ctxt SHA1_CTX;
|
||||||
|
|
||||||
#define SHA1Init(x) sha1_init((x))
|
#define SHA1Init(x) sha1_init((x))
|
||||||
|
@ -161,7 +161,7 @@ sepgsql_set_client_label(const char *new_label)
|
|||||||
/*
|
/*
|
||||||
* sepgsql_xact_callback
|
* sepgsql_xact_callback
|
||||||
*
|
*
|
||||||
* A callback routine of transaction commit/abort/prepare. Commmit or abort
|
* A callback routine of transaction commit/abort/prepare. Commit or abort
|
||||||
* changes in the client_label_pending list.
|
* changes in the client_label_pending list.
|
||||||
*/
|
*/
|
||||||
static void
|
static void
|
||||||
|
@ -860,7 +860,7 @@ BETTER: unrecognized node type: 42
|
|||||||
Code in <productname>PostgreSQL</> should only rely on language
|
Code in <productname>PostgreSQL</> should only rely on language
|
||||||
features available in the C89 standard. That means a conforming
|
features available in the C89 standard. That means a conforming
|
||||||
C89 compiler has to be able to compile postgres, at least aside
|
C89 compiler has to be able to compile postgres, at least aside
|
||||||
from a few platform dependant pieces. Features from later
|
from a few platform dependent pieces. Features from later
|
||||||
revision of the C standard or compiler specific features can be
|
revision of the C standard or compiler specific features can be
|
||||||
used, if a fallback is provided.
|
used, if a fallback is provided.
|
||||||
</para>
|
</para>
|
||||||
|
@ -1613,7 +1613,7 @@ CheckPointTwoPhase(XLogRecPtr redo_horizon)
|
|||||||
* transaction manager isn't active.
|
* transaction manager isn't active.
|
||||||
*
|
*
|
||||||
* It's also possible to move I/O out of the lock, but on
|
* 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
|
* transaction in different backend. Let's leave this optimisation
|
||||||
* for future, if somebody will spot that this place cause
|
* for future, if somebody will spot that this place cause
|
||||||
* bottleneck.
|
* bottleneck.
|
||||||
|
@ -838,7 +838,7 @@ pg_GSS_recvauth(Port *port)
|
|||||||
|
|
||||||
/*
|
/*
|
||||||
* Loop through GSSAPI message exchange. This exchange can consist of
|
* 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
|
* the client. All messages from client to server are password packets
|
||||||
* (type 'p').
|
* (type 'p').
|
||||||
*/
|
*/
|
||||||
@ -1078,7 +1078,7 @@ pg_SSPI_recvauth(Port *port)
|
|||||||
|
|
||||||
/*
|
/*
|
||||||
* Loop through SSPI message exchange. This exchange can consist of
|
* 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
|
* the client. All messages from client to server are password packets
|
||||||
* (type 'p').
|
* (type 'p').
|
||||||
*/
|
*/
|
||||||
|
@ -501,7 +501,7 @@ build_join_rel(PlannerInfo *root,
|
|||||||
* level.
|
* level.
|
||||||
*
|
*
|
||||||
* Note that if there are more than two rels in this relation, they could
|
* 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
|
* 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
|
* and joinclauses while building up to this joinrel no matter which we
|
||||||
* take; therefore, we should make the same decision here however we get
|
* 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;
|
* 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 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 *
|
List *
|
||||||
transformTargetList(ParseState *pstate, List *targetlist,
|
transformTargetList(ParseState *pstate, List *targetlist,
|
||||||
|
@ -113,7 +113,7 @@ int effective_io_concurrency = 0;
|
|||||||
|
|
||||||
/*
|
/*
|
||||||
* GUC variables about triggering kernel writeback for buffers written; OS
|
* 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 checkpoint_flush_after = 0;
|
||||||
int bgwriter_flush_after = 0;
|
int bgwriter_flush_after = 0;
|
||||||
|
@ -34,7 +34,7 @@
|
|||||||
* substantially, but there should be few systems where we must make do
|
* substantially, but there should be few systems where we must make do
|
||||||
* with such poor tools.
|
* 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) 1996-2016, PostgreSQL Global Development Group
|
||||||
* Portions Copyright (c) 1994, Regents of the University of California
|
* Portions Copyright (c) 1994, Regents of the University of California
|
||||||
|
@ -71,7 +71,7 @@ typedef struct ProcArrayStruct
|
|||||||
* Known assigned XIDs handling
|
* Known assigned XIDs handling
|
||||||
*/
|
*/
|
||||||
int maxKnownAssignedXids; /* allocated size of array */
|
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 tailKnownAssignedXids; /* index of oldest valid element */
|
||||||
int headKnownAssignedXids; /* index of newest element, + 1 */
|
int headKnownAssignedXids; /* index of newest element, + 1 */
|
||||||
slock_t known_assigned_xids_lck; /* protects head/tail pointers */
|
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;
|
sender = mq->mq_sender;
|
||||||
SpinLockRelease(&mq->mq_mutex);
|
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);
|
Assert(sender != NULL);
|
||||||
SetLatch(&sender->procLatch);
|
SetLatch(&sender->procLatch);
|
||||||
}
|
}
|
||||||
|
@ -508,7 +508,7 @@ parse_object(JsonLexContext *lex, JsonSemAction *sem)
|
|||||||
*/
|
*/
|
||||||
lex->lex_level++;
|
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);
|
lex_expect(JSON_PARSE_OBJECT_START, lex, JSON_TOKEN_OBJECT_START);
|
||||||
|
|
||||||
tok = lex_peek(lex);
|
tok = lex_peek(lex);
|
||||||
|
@ -67,7 +67,7 @@ rank_up(WindowObject winobj)
|
|||||||
up = true;
|
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);
|
WinSetMarkPosition(winobj, curpos);
|
||||||
|
|
||||||
return up;
|
return up;
|
||||||
|
@ -2391,7 +2391,7 @@ static struct config_int ConfigureNamesInt[] =
|
|||||||
GUC_UNIT_BLOCKS
|
GUC_UNIT_BLOCKS
|
||||||
},
|
},
|
||||||
&checkpoint_flush_after,
|
&checkpoint_flush_after,
|
||||||
/* see bufmgr.h: OS dependant default */
|
/* see bufmgr.h: OS dependent default */
|
||||||
DEFAULT_CHECKPOINT_FLUSH_AFTER, 0, WRITEBACK_MAX_PENDING_FLUSHES,
|
DEFAULT_CHECKPOINT_FLUSH_AFTER, 0, WRITEBACK_MAX_PENDING_FLUSHES,
|
||||||
NULL, NULL, NULL
|
NULL, NULL, NULL
|
||||||
},
|
},
|
||||||
@ -2403,7 +2403,7 @@ static struct config_int ConfigureNamesInt[] =
|
|||||||
GUC_UNIT_BLOCKS
|
GUC_UNIT_BLOCKS
|
||||||
},
|
},
|
||||||
&backend_flush_after,
|
&backend_flush_after,
|
||||||
/* see bufmgr.h: OS dependant default */
|
/* see bufmgr.h: OS dependent default */
|
||||||
DEFAULT_BACKEND_FLUSH_AFTER, 0, WRITEBACK_MAX_PENDING_FLUSHES,
|
DEFAULT_BACKEND_FLUSH_AFTER, 0, WRITEBACK_MAX_PENDING_FLUSHES,
|
||||||
NULL, NULL, NULL
|
NULL, NULL, NULL
|
||||||
},
|
},
|
||||||
|
@ -296,7 +296,7 @@ DeflateCompressorZlib(ArchiveHandle *AH, CompressorState *cs, bool flush)
|
|||||||
if (zp->avail_out < cs->zlibOutSize)
|
if (zp->avail_out < cs->zlibOutSize)
|
||||||
{
|
{
|
||||||
/*
|
/*
|
||||||
* Any write function shoud do its own error checking but to
|
* Any write function should do its own error checking but to
|
||||||
* make sure we do a check here as well...
|
* make sure we do a check here as well...
|
||||||
*/
|
*/
|
||||||
size_t len = cs->zlibOutSize - zp->avail_out;
|
size_t len = cs->zlibOutSize - zp->avail_out;
|
||||||
|
@ -1262,7 +1262,7 @@ readMessageFromPipe(int fd)
|
|||||||
int ret;
|
int ret;
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* The problem here is that we need to deal with several possibilites: we
|
* The problem here is that we need to deal with several possibilities: we
|
||||||
* could receive only a partial message or several messages at once. The
|
* could receive only a partial message or several messages at once. The
|
||||||
* caller expects us to return exactly one message however.
|
* caller expects us to return exactly one message however.
|
||||||
*
|
*
|
||||||
|
@ -381,7 +381,7 @@ check_required_directory(char **dirpath, char **configpath,
|
|||||||
* adjust_data_dir
|
* adjust_data_dir
|
||||||
*
|
*
|
||||||
* If a configuration-only directory was specified, find the real data dir
|
* If a configuration-only directory was specified, find the real data dir
|
||||||
* by quering the running server. This has limited checking because we
|
* by querying the running server. This has limited checking because we
|
||||||
* can't check for a running server because we can't find postmaster.pid.
|
* can't check for a running server because we can't find postmaster.pid.
|
||||||
*/
|
*/
|
||||||
void
|
void
|
||||||
|
@ -535,7 +535,7 @@ getExponentialRand(TState *thread, int64 min, int64 max, double parameter)
|
|||||||
uniform = 1.0 - pg_erand48(thread->random_state);
|
uniform = 1.0 - pg_erand48(thread->random_state);
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* inner expresion in (cut, 1] (if parameter > 0), rand in [0, 1)
|
* inner expression in (cut, 1] (if parameter > 0), rand in [0, 1)
|
||||||
*/
|
*/
|
||||||
Assert((1.0 - cut) != 0.0);
|
Assert((1.0 - cut) != 0.0);
|
||||||
rand = -log(cut + (1.0 - cut) * uniform) / parameter;
|
rand = -log(cut + (1.0 - cut) * uniform) / parameter;
|
||||||
|
@ -5,7 +5,7 @@
|
|||||||
*
|
*
|
||||||
* This is intended to provide a simple way to divide a chunk of shared
|
* This is intended to provide a simple way to divide a chunk of shared
|
||||||
* memory (probably dynamic shared memory allocated via dsm_create) into
|
* memory (probably dynamic shared memory allocated via dsm_create) into
|
||||||
* a number of regions and keep track of the addreses of those regions or
|
* a number of regions and keep track of the addresses of those regions or
|
||||||
* key data structures within those regions. This is not intended to
|
* key data structures within those regions. This is not intended to
|
||||||
* scale to a large number of keys and will perform poorly if used that
|
* scale to a large number of keys and will perform poorly if used that
|
||||||
* way; if you need a large number of pointers, store them within some
|
* way; if you need a large number of pointers, store them within some
|
||||||
|
@ -1,7 +1,7 @@
|
|||||||
/* src/interfaces/ecpg/ecpglib/execute.c */
|
/* src/interfaces/ecpg/ecpglib/execute.c */
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* The aim is to get a simpler inteface to the database routines.
|
* The aim is to get a simpler interface to the database routines.
|
||||||
* All the tidieous messing around with tuples is supposed to be hidden
|
* All the tidieous messing around with tuples is supposed to be hidden
|
||||||
* by this function.
|
* by this function.
|
||||||
*/
|
*/
|
||||||
|
@ -632,7 +632,7 @@ sub preload_addons
|
|||||||
my $filename = $path . "/ecpg.addons";
|
my $filename = $path . "/ecpg.addons";
|
||||||
open(my $fh, '<', $filename) or die;
|
open(my $fh, '<', $filename) or die;
|
||||||
|
|
||||||
# there may be multple lines starting ECPG: and then multiple lines of code.
|
# there may be multiple lines starting ECPG: and then multiple lines of code.
|
||||||
# the code need to be add to all prior ECPG records.
|
# the code need to be add to all prior ECPG records.
|
||||||
my (@needsRules, @code, $record);
|
my (@needsRules, @code, $record);
|
||||||
|
|
||||||
|
@ -446,7 +446,7 @@ ECPGdump_a_simple(FILE *o, const char *name, enum ECPGttype type,
|
|||||||
sprintf(variable, "&(%s%s)", prefix ? prefix : "", name);
|
sprintf(variable, "&(%s%s)", prefix ? prefix : "", name);
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* If we created a varchar structure atomatically, counter is
|
* If we created a varchar structure automatically, counter is
|
||||||
* greater than 0.
|
* greater than 0.
|
||||||
*/
|
*/
|
||||||
if (counter)
|
if (counter)
|
||||||
|
@ -983,7 +983,7 @@ DETAIL: drop cascades to table inht2
|
|||||||
drop cascades to table inhts
|
drop cascades to table inhts
|
||||||
drop cascades to table inht3
|
drop cascades to table inht3
|
||||||
drop cascades to table inht4
|
drop cascades to table inht4
|
||||||
-- Test non-inheritable indices [UNIQUE, EXCLUDE] contraints
|
-- Test non-inheritable indices [UNIQUE, EXCLUDE] constraints
|
||||||
CREATE TABLE test_constraints (id int, val1 varchar, val2 int, UNIQUE(val1, val2));
|
CREATE TABLE test_constraints (id int, val1 varchar, val2 int, UNIQUE(val1, val2));
|
||||||
CREATE TABLE test_constraints_inh () INHERITS (test_constraints);
|
CREATE TABLE test_constraints_inh () INHERITS (test_constraints);
|
||||||
\d+ test_constraints
|
\d+ test_constraints
|
||||||
@ -1049,7 +1049,7 @@ Inherits: test_ex_constraints
|
|||||||
|
|
||||||
DROP TABLE test_ex_constraints_inh;
|
DROP TABLE test_ex_constraints_inh;
|
||||||
DROP TABLE test_ex_constraints;
|
DROP TABLE test_ex_constraints;
|
||||||
-- Test non-inheritable foreign key contraints
|
-- Test non-inheritable foreign key constraints
|
||||||
CREATE TABLE test_primary_constraints(id int PRIMARY KEY);
|
CREATE TABLE test_primary_constraints(id int PRIMARY KEY);
|
||||||
CREATE TABLE test_foreign_constraints(id1 int REFERENCES test_primary_constraints(id));
|
CREATE TABLE test_foreign_constraints(id1 int REFERENCES test_primary_constraints(id));
|
||||||
CREATE TABLE test_foreign_constraints_inh () INHERITS (test_foreign_constraints);
|
CREATE TABLE test_foreign_constraints_inh () INHERITS (test_foreign_constraints);
|
||||||
|
@ -65,7 +65,7 @@ SELECT relreplident FROM pg_class WHERE oid = 'test_replica_identity'::regclass;
|
|||||||
(1 row)
|
(1 row)
|
||||||
|
|
||||||
----
|
----
|
||||||
-- Make sure index cases succeeed
|
-- Make sure index cases succeed
|
||||||
----
|
----
|
||||||
-- succeed, primary key
|
-- succeed, primary key
|
||||||
ALTER TABLE test_replica_identity REPLICA IDENTITY USING INDEX test_replica_identity_pkey;
|
ALTER TABLE test_replica_identity REPLICA IDENTITY USING INDEX test_replica_identity_pkey;
|
||||||
|
@ -299,7 +299,7 @@ SELECT a.attrelid::regclass, a.attname, a.attinhcount, e.expected
|
|||||||
DROP TABLE inht1, inhs1 CASCADE;
|
DROP TABLE inht1, inhs1 CASCADE;
|
||||||
|
|
||||||
|
|
||||||
-- Test non-inheritable indices [UNIQUE, EXCLUDE] contraints
|
-- Test non-inheritable indices [UNIQUE, EXCLUDE] constraints
|
||||||
CREATE TABLE test_constraints (id int, val1 varchar, val2 int, UNIQUE(val1, val2));
|
CREATE TABLE test_constraints (id int, val1 varchar, val2 int, UNIQUE(val1, val2));
|
||||||
CREATE TABLE test_constraints_inh () INHERITS (test_constraints);
|
CREATE TABLE test_constraints_inh () INHERITS (test_constraints);
|
||||||
\d+ test_constraints
|
\d+ test_constraints
|
||||||
@ -321,7 +321,7 @@ ALTER TABLE test_ex_constraints DROP CONSTRAINT test_ex_constraints_c_excl;
|
|||||||
DROP TABLE test_ex_constraints_inh;
|
DROP TABLE test_ex_constraints_inh;
|
||||||
DROP TABLE test_ex_constraints;
|
DROP TABLE test_ex_constraints;
|
||||||
|
|
||||||
-- Test non-inheritable foreign key contraints
|
-- Test non-inheritable foreign key constraints
|
||||||
CREATE TABLE test_primary_constraints(id int PRIMARY KEY);
|
CREATE TABLE test_primary_constraints(id int PRIMARY KEY);
|
||||||
CREATE TABLE test_foreign_constraints(id1 int REFERENCES test_primary_constraints(id));
|
CREATE TABLE test_foreign_constraints(id1 int REFERENCES test_primary_constraints(id));
|
||||||
CREATE TABLE test_foreign_constraints_inh () INHERITS (test_foreign_constraints);
|
CREATE TABLE test_foreign_constraints_inh () INHERITS (test_foreign_constraints);
|
||||||
|
@ -44,7 +44,7 @@ ALTER TABLE test_replica_identity REPLICA IDENTITY USING INDEX test_replica_iden
|
|||||||
SELECT relreplident FROM pg_class WHERE oid = 'test_replica_identity'::regclass;
|
SELECT relreplident FROM pg_class WHERE oid = 'test_replica_identity'::regclass;
|
||||||
|
|
||||||
----
|
----
|
||||||
-- Make sure index cases succeeed
|
-- Make sure index cases succeed
|
||||||
----
|
----
|
||||||
|
|
||||||
-- succeed, primary key
|
-- succeed, primary key
|
||||||
|
Loading…
x
Reference in New Issue
Block a user