extern void sha1_loop(struct sha1_ctxt *, const uint8 *, size_t);
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;
#define SHA1Init(x) sha1_init((x))
/*
* 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.
*/
static void
Code in <productname>PostgreSQL</> should only rely on language
features available in the C89 standard. That means a conforming
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
used, if a fallback is provided.
</para>
* 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.
/*
* 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').
*/
/*
* 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').
*/
* 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
*
* 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,
/*
* 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;
* 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
* 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 */
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);
}
*/
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);
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;
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
},
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
},
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...
*/
size_t len = cs->zlibOutSize - zp->avail_out;
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
* caller expects us to return exactly one message however.
*
* adjust_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.
*/
void
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);
rand = -log(cut + (1.0 - cut) * uniform) / parameter;
*
* This is intended to provide a simple way to divide a chunk of shared
* 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
* 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
/* 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
* by this function.
*/
my $filename = $path . "/ecpg.addons";
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.
my (@needsRules, @code, $record);
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.
*/
if (counter)
drop cascades to table inhts
drop cascades to table inht3
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_inh () INHERITS (test_constraints);
\d+ test_constraints
DROP TABLE test_ex_constraints_inh;
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_foreign_constraints(id1 int REFERENCES test_primary_constraints(id));
CREATE TABLE test_foreign_constraints_inh () INHERITS (test_foreign_constraints);
(1 row)
----
--- Make sure index cases succeeed
+-- Make sure index cases succeed
----
-- succeed, primary key
ALTER TABLE test_replica_identity REPLICA IDENTITY USING INDEX test_replica_identity_pkey;
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_inh () INHERITS (test_constraints);
\d+ test_constraints
DROP TABLE test_ex_constraints_inh;
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_foreign_constraints(id1 int REFERENCES test_primary_constraints(id));
CREATE TABLE test_foreign_constraints_inh () INHERITS (test_foreign_constraints);
SELECT relreplident FROM pg_class WHERE oid = 'test_replica_identity'::regclass;
----
--- Make sure index cases succeeed
+-- Make sure index cases succeed
----
-- succeed, primary key
projects / postgresql.git / commitdiff