Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to content

Commit 0d9937d

Browse files
committed
Fix typos in comments and in one isolation test.
Dagfinn Ilmari Mannsåker, reviewed by Shubham Khanna. Some subtractions by me. Discussion: http://postgr.es/m/87le9fmi01.fsf@wibble.ilmari.org
1 parent 5c430f9 commit 0d9937d

File tree

29 files changed

+45
-45
lines changed

29 files changed

+45
-45
lines changed

contrib/bloom/bloom.h

+1-1
Original file line numberDiff line numberDiff line change
@@ -127,7 +127,7 @@ typedef struct BloomMetaPageData
127127
FreeBlockNumberArray notFullPage;
128128
} BloomMetaPageData;
129129

130-
/* Magic number to distinguish bloom pages among anothers */
130+
/* Magic number to distinguish bloom pages from others */
131131
#define BLOOM_MAGICK_NUMBER (0xDBAC0DED)
132132

133133
/* Number of blocks numbers fit in BloomMetaPageData */

contrib/pgcrypto/expected/pgp-compression.out

+1-1
Original file line numberDiff line numberDiff line change
@@ -60,7 +60,7 @@ WITH random_string AS
6060
-- This generates a random string of 16366 bytes. This is chosen
6161
-- as random so that it does not get compressed, and the decompression
6262
-- would work on a string with the same length as the origin, making the
63-
-- test behavior more predictible. lpad() ensures that the generated
63+
-- test behavior more predictable. lpad() ensures that the generated
6464
-- hexadecimal value is completed by extra zero characters if random()
6565
-- has generated a value strictly lower than 16.
6666
SELECT string_agg(decode(lpad(to_hex((random()*256)::int), 2, '0'), 'hex'), '') as bytes

contrib/pgcrypto/openssl.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -460,7 +460,7 @@ bf_init(PX_Cipher *c, const uint8 *key, unsigned klen, const uint8 *iv)
460460

461461
/*
462462
* Test if key len is supported. BF_set_key silently cut large keys and it
463-
* could be a problem when user transfer crypted data from one server to
463+
* could be a problem when user transfer encrypted data from one server to
464464
* another.
465465
*/
466466

contrib/pgcrypto/sql/pgp-compression.sql

+1-1
Original file line numberDiff line numberDiff line change
@@ -36,7 +36,7 @@ WITH random_string AS
3636
-- This generates a random string of 16366 bytes. This is chosen
3737
-- as random so that it does not get compressed, and the decompression
3838
-- would work on a string with the same length as the origin, making the
39-
-- test behavior more predictible. lpad() ensures that the generated
39+
-- test behavior more predictable. lpad() ensures that the generated
4040
-- hexadecimal value is completed by extra zero characters if random()
4141
-- has generated a value strictly lower than 16.
4242
SELECT string_agg(decode(lpad(to_hex((random()*256)::int), 2, '0'), 'hex'), '') as bytes

contrib/postgres_fdw/expected/postgres_fdw.out

+1-1
Original file line numberDiff line numberDiff line change
@@ -4819,7 +4819,7 @@ SELECT * FROM ft2 ftupper WHERE
48194819
925 | 5 | 00925 | Mon Jan 26 00:00:00 1970 PST | Mon Jan 26 00:00:00 1970 | 5 | 5 | foo
48204820
(10 rows)
48214821

4822-
-- EXISTS should be propogated to the highest upper inner join
4822+
-- EXISTS should be propagated to the highest upper inner join
48234823
EXPLAIN (verbose, costs off)
48244824
SELECT ft2.*, ft4.* FROM ft2 INNER JOIN
48254825
(SELECT * FROM ft4 WHERE EXISTS (

contrib/postgres_fdw/sql/postgres_fdw.sql

+1-1
Original file line numberDiff line numberDiff line change
@@ -1399,7 +1399,7 @@ SELECT * FROM ft2 ftupper WHERE
13991399
AND ftupper.c1 > 900
14001400
ORDER BY ftupper.c1 LIMIT 10;
14011401

1402-
-- EXISTS should be propogated to the highest upper inner join
1402+
-- EXISTS should be propagated to the highest upper inner join
14031403
EXPLAIN (verbose, costs off)
14041404
SELECT ft2.*, ft4.* FROM ft2 INNER JOIN
14051405
(SELECT * FROM ft4 WHERE EXISTS (

src/backend/access/brin/brin.c

+3-3
Original file line numberDiff line numberDiff line change
@@ -348,7 +348,7 @@ brininsert(Relation idxRel, Datum *values, bool *nulls,
348348
bool autosummarize = BrinGetAutoSummarize(idxRel);
349349

350350
/*
351-
* If firt time through in this statement, initialize the insert state
351+
* If first time through in this statement, initialize the insert state
352352
* that we keep for all the inserts in the command.
353353
*/
354354
if (!bistate)
@@ -1042,7 +1042,7 @@ brinbuildCallbackParallel(Relation index,
10421042
/*
10431043
* If we're in a block that belongs to a different range, summarize what
10441044
* we've got and start afresh. Note the scan might have skipped many
1045-
* pages, if they were devoid of live tuples; we do not create emptry BRIN
1045+
* pages, if they were devoid of live tuples; we do not create empty BRIN
10461046
* ranges here - the leader is responsible for filling them in.
10471047
*
10481048
* Unlike serial builds, parallel index builds allow synchronized seqscans
@@ -2149,7 +2149,7 @@ union_tuples(BrinDesc *bdesc, BrinMemTuple *a, BrinTuple *b)
21492149
* brin_vacuum_scan
21502150
* Do a complete scan of the index during VACUUM.
21512151
*
2152-
* This routine scans the complete index looking for uncatalogued index pages,
2152+
* This routine scans the complete index looking for uncataloged index pages,
21532153
* i.e. those that might have been lost due to a crash after index extension
21542154
* and such.
21552155
*/

src/backend/access/common/heaptuple.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -85,7 +85,7 @@
8585
((att)->attstorage != TYPSTORAGE_PLAIN)
8686

8787
/*
88-
* Setup for cacheing pass-by-ref missing attributes in a way that survives
88+
* Setup for caching pass-by-ref missing attributes in a way that survives
8989
* tupleDesc destruction.
9090
*/
9191

src/backend/access/nbtree/nbtree.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -158,7 +158,7 @@ btbuildempty(Relation index)
158158
Page metapage;
159159

160160
/*
161-
* Initalize the metapage.
161+
* Initialize the metapage.
162162
*
163163
* Regular index build bypasses the buffer manager and uses smgr functions
164164
* directly, with an smgrimmedsync() call at the end. That makes sense

src/backend/catalog/namespace.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -4218,7 +4218,7 @@ cachedNamespacePath(const char *searchPath, Oid roleid)
42184218
entry = spcache_insert(searchPath, roleid);
42194219

42204220
/*
4221-
* An OOM may have resulted in a cache entry with mising 'oidlist' or
4221+
* An OOM may have resulted in a cache entry with missing 'oidlist' or
42224222
* 'finalPath', so just compute whatever is missing.
42234223
*/
42244224

src/backend/catalog/pg_constraint.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -1290,7 +1290,7 @@ get_relation_constraint_attnos(Oid relid, const char *conname,
12901290

12911291
/*
12921292
* Return the OID of the constraint enforced by the given index in the
1293-
* given relation; or InvalidOid if no such index is catalogued.
1293+
* given relation; or InvalidOid if no such index is cataloged.
12941294
*
12951295
* Much like get_constraint_index, this function is concerned only with the
12961296
* one constraint that "owns" the given index. Therefore, constraints of

src/backend/commands/event_trigger.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -387,7 +387,7 @@ SetDatatabaseHasLoginEventTriggers(void)
387387
HeapTuple tuple;
388388

389389
/*
390-
* Use shared lock to prevent a conflit with EventTriggerOnLogin() trying
390+
* Use shared lock to prevent a conflict with EventTriggerOnLogin() trying
391391
* to reset pg_database.dathasloginevt flag. Note, this lock doesn't
392392
* effectively blocks database or other objection. It's just custom lock
393393
* tag used to prevent multiple backends changing

src/backend/executor/execMain.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -1849,7 +1849,7 @@ ExecPartitionCheck(ResultRelInfo *resultRelInfo, TupleTableSlot *slot,
18491849
econtext->ecxt_scantuple = slot;
18501850

18511851
/*
1852-
* As in case of the catalogued constraints, we treat a NULL result as
1852+
* As in case of the cataloged constraints, we treat a NULL result as
18531853
* success here, not a failure.
18541854
*/
18551855
success = ExecCheck(resultRelInfo->ri_PartitionCheckExpr, econtext);

src/backend/optimizer/plan/initsplan.c

+2-2
Original file line numberDiff line numberDiff line change
@@ -1928,8 +1928,8 @@ deconstruct_distribute_oj_quals(PlannerInfo *root,
19281928
* jtitems list to be ordered that way.
19291929
*
19301930
* We first strip out all the nullingrels bits corresponding to
1931-
* commutating joins below this one, and then successively put them
1932-
* back as we crawl up the join stack.
1931+
* commuting joins below this one, and then successively put them back
1932+
* as we crawl up the join stack.
19331933
*/
19341934
quals = jtitem->oj_joinclauses;
19351935
if (!bms_is_empty(joins_below))

src/backend/utils/adt/rangetypes.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -2608,7 +2608,7 @@ range_contains_elem_internal(TypeCacheEntry *typcache, const RangeType *r, Datum
26082608
* values into a range object. They are modeled after heaptuple.c's
26092609
* heap_compute_data_size() and heap_fill_tuple(), but we need not handle
26102610
* null values here. TYPE_IS_PACKABLE must test the same conditions as
2611-
* heaptuple.c's ATT_IS_PACKABLE macro. See the comments thare for more
2611+
* heaptuple.c's ATT_IS_PACKABLE macro. See the comments there for more
26122612
* details.
26132613
*/
26142614

src/backend/utils/sort/tuplesortvariants.c

+5-5
Original file line numberDiff line numberDiff line change
@@ -93,7 +93,7 @@ static void readtup_datum(Tuplesortstate *state, SortTuple *stup,
9393
static void freestate_cluster(Tuplesortstate *state);
9494

9595
/*
96-
* Data struture pointed by "TuplesortPublic.arg" for the CLUSTER case. Set by
96+
* Data structure pointed by "TuplesortPublic.arg" for the CLUSTER case. Set by
9797
* the tuplesort_begin_cluster.
9898
*/
9999
typedef struct
@@ -105,7 +105,7 @@ typedef struct
105105
} TuplesortClusterArg;
106106

107107
/*
108-
* Data struture pointed by "TuplesortPublic.arg" for the IndexTuple case.
108+
* Data structure pointed by "TuplesortPublic.arg" for the IndexTuple case.
109109
* Set by tuplesort_begin_index_xxx and used only by the IndexTuple routines.
110110
*/
111111
typedef struct
@@ -115,7 +115,7 @@ typedef struct
115115
} TuplesortIndexArg;
116116

117117
/*
118-
* Data struture pointed by "TuplesortPublic.arg" for the index_btree subcase.
118+
* Data structure pointed by "TuplesortPublic.arg" for the index_btree subcase.
119119
*/
120120
typedef struct
121121
{
@@ -126,7 +126,7 @@ typedef struct
126126
} TuplesortIndexBTreeArg;
127127

128128
/*
129-
* Data struture pointed by "TuplesortPublic.arg" for the index_hash subcase.
129+
* Data structure pointed by "TuplesortPublic.arg" for the index_hash subcase.
130130
*/
131131
typedef struct
132132
{
@@ -138,7 +138,7 @@ typedef struct
138138
} TuplesortIndexHashArg;
139139

140140
/*
141-
* Data struture pointed by "TuplesortPublic.arg" for the Datum case.
141+
* Data structure pointed by "TuplesortPublic.arg" for the Datum case.
142142
* Set by tuplesort_begin_datum and used only by the DatumTuple routines.
143143
*/
144144
typedef struct

src/backend/utils/time/combocid.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44
* Combo command ID support routines
55
*
66
* Before version 8.3, HeapTupleHeaderData had separate fields for cmin
7-
* and cmax. To reduce the header size, cmin and cmax are now overlayed
7+
* and cmax. To reduce the header size, cmin and cmax are now overlaid
88
* in the same field in the header. That usually works because you rarely
99
* insert and delete a tuple in the same transaction, and we don't need
1010
* either field to remain valid after the originating transaction exits.

src/bin/pg_rewind/t/001_basic.pl

+1-1
Original file line numberDiff line numberDiff line change
@@ -60,7 +60,7 @@ sub run_test
6060

6161
# Insert a row in the old primary. This causes the primary and standby
6262
# to have "diverged", it's no longer possible to just apply the
63-
# standy's logs over primary directory - you need to rewind.
63+
# standby's logs over primary directory - you need to rewind.
6464
primary_psql("INSERT INTO tbl1 VALUES ('in primary, after promotion')");
6565

6666
# Also insert a new row in the standby, which won't be present in the

src/bin/pg_rewind/t/004_pg_xlog_symlink.pl

+1-1
Original file line numberDiff line numberDiff line change
@@ -52,7 +52,7 @@ sub run_test
5252

5353
# Insert a row in the old primary. This causes the primary and standby
5454
# to have "diverged", it's no longer possible to just apply the
55-
# standy's logs over primary directory - you need to rewind.
55+
# standby's logs over primary directory - you need to rewind.
5656
primary_psql("INSERT INTO tbl1 VALUES ('in primary, after promotion')");
5757

5858
# Also insert a new row in the standby, which won't be present in the

src/bin/pg_rewind/t/007_standby_source.pl

+1-1
Original file line numberDiff line numberDiff line change
@@ -86,7 +86,7 @@
8686

8787

8888
# Insert a row in A. This causes A/B and C to have "diverged", so that it's
89-
# no longer possible to just apply the standy's logs over primary directory
89+
# no longer possible to just apply the standby's logs over primary directory
9090
# - you need to rewind.
9191
$node_a->safe_psql('postgres',
9292
"INSERT INTO tbl1 VALUES ('in A, after C was promoted')");

src/bin/pg_rewind/t/009_growing_files.pl

+1-1
Original file line numberDiff line numberDiff line change
@@ -28,7 +28,7 @@
2828
RewindTest::promote_standby();
2929

3030
# Insert a row in the old primary. This causes the primary and standby to have
31-
# "diverged", it's no longer possible to just apply the standy's logs over
31+
# "diverged", it's no longer possible to just apply the standby's logs over
3232
# primary directory - you need to rewind. Also insert a new row in the
3333
# standby, which won't be present in the old primary.
3434
primary_psql("INSERT INTO tbl1 VALUES ('in primary, after promotion')");

src/include/pg_config_manual.h

+1-1
Original file line numberDiff line numberDiff line change
@@ -337,7 +337,7 @@
337337

338338
/*
339339
* Define this to force Bitmapset reallocation on each modification. Helps
340-
* to find hangling pointers to Bitmapset's.
340+
* to find dangling pointers to Bitmapset's.
341341
*/
342342
/* #define REALLOCATE_BITMAPSETS */
343343

src/test/isolation/specs/stats.spec

+8-8
Original file line numberDiff line numberDiff line change
@@ -543,10 +543,10 @@ permutation
543543
s1_table_insert
544544
s1_begin
545545
s1_table_update_k1 # should *not* be counted, different rel
546-
s1_table_update_k1 # dito
546+
s1_table_update_k1 # ditto
547547
s1_table_truncate
548548
s1_table_insert_k1 # should be counted
549-
s1_table_update_k1 # dito
549+
s1_table_update_k1 # ditto
550550
s1_prepare_a
551551
s1_commit_prepared_a
552552
s1_ff
@@ -557,10 +557,10 @@ permutation
557557
s1_table_insert
558558
s1_begin
559559
s1_table_update_k1 # should *not* be counted, different rel
560-
s1_table_update_k1 # dito
560+
s1_table_update_k1 # ditto
561561
s1_table_truncate
562562
s1_table_insert_k1 # should be counted
563-
s1_table_update_k1 # dito
563+
s1_table_update_k1 # ditto
564564
s1_prepare_a
565565
s1_ff # flush out non-transactional stats, might happen anyway
566566
s2_commit_prepared_a
@@ -572,10 +572,10 @@ permutation
572572
s1_table_insert
573573
s1_begin
574574
s1_table_update_k1 # should be counted
575-
s1_table_update_k1 # dito
575+
s1_table_update_k1 # ditto
576576
s1_table_truncate
577577
s1_table_insert_k1 # should *not* be counted, different rel
578-
s1_table_update_k1 # dito
578+
s1_table_update_k1 # ditto
579579
s1_prepare_a
580580
s1_rollback_prepared_a
581581
s1_ff
@@ -586,10 +586,10 @@ permutation
586586
s1_table_insert
587587
s1_begin
588588
s1_table_update_k1 # should be counted
589-
s1_table_update_k1 # dito
589+
s1_table_update_k1 # ditto
590590
s1_table_truncate
591591
s1_table_insert_k1 # should *not* be counted, different rel
592-
s1_table_update_k1 # dito
592+
s1_table_update_k1 # ditto
593593
s1_prepare_a
594594
s2_rollback_prepared_a
595595
s1_ff s2_ff

src/test/regress/expected/boolean.out

+1-1
Original file line numberDiff line numberDiff line change
@@ -486,7 +486,7 @@ FROM booltbl3 ORDER BY o;
486486

487487
-- Test to make sure short-circuiting and NULL handling is
488488
-- correct. Use a table as source to prevent constant simplification
489-
-- to interfer.
489+
-- from interfering.
490490
CREATE TABLE booltbl4(isfalse bool, istrue bool, isnul bool);
491491
INSERT INTO booltbl4 VALUES (false, true, null);
492492
\pset null '(null)'

src/test/regress/expected/brin_multi.out

+2-2
Original file line numberDiff line numberDiff line change
@@ -826,11 +826,11 @@ RESET enable_seqscan;
826826
-- test overflows during CREATE INDEX with extreme timestamp values
827827
CREATE TABLE brin_timestamp_test(a TIMESTAMPTZ);
828828
SET datestyle TO iso;
829-
-- values close to timetamp minimum
829+
-- values close to timestamp minimum
830830
INSERT INTO brin_timestamp_test
831831
SELECT '4713-01-01 00:00:01 BC'::timestamptz + (i || ' seconds')::interval
832832
FROM generate_series(1,30) s(i);
833-
-- values close to timetamp maximum
833+
-- values close to timestamp maximum
834834
INSERT INTO brin_timestamp_test
835835
SELECT '294276-12-01 00:00:01'::timestamptz + (i || ' seconds')::interval
836836
FROM generate_series(1,30) s(i);

src/test/regress/expected/join.out

+1-1
Original file line numberDiff line numberDiff line change
@@ -6957,7 +6957,7 @@ WHERE q0.a = 1;
69576957
(7 rows)
69586958

69596959
--
6960-
---- Only one side is unqiue
6960+
---- Only one side is unique
69616961
--select * from sl t1, sl t2 where t1.a = t2.a and t1.b = 1;
69626962
--select * from sl t1, sl t2 where t1.a = t2.a and t2.b = 1;
69636963
--

src/test/regress/sql/boolean.sql

+1-1
Original file line numberDiff line numberDiff line change
@@ -227,7 +227,7 @@ FROM booltbl3 ORDER BY o;
227227

228228
-- Test to make sure short-circuiting and NULL handling is
229229
-- correct. Use a table as source to prevent constant simplification
230-
-- to interfer.
230+
-- from interfering.
231231
CREATE TABLE booltbl4(isfalse bool, istrue bool, isnul bool);
232232
INSERT INTO booltbl4 VALUES (false, true, null);
233233
\pset null '(null)'

src/test/regress/sql/brin_multi.sql

+2-2
Original file line numberDiff line numberDiff line change
@@ -592,12 +592,12 @@ CREATE TABLE brin_timestamp_test(a TIMESTAMPTZ);
592592

593593
SET datestyle TO iso;
594594

595-
-- values close to timetamp minimum
595+
-- values close to timestamp minimum
596596
INSERT INTO brin_timestamp_test
597597
SELECT '4713-01-01 00:00:01 BC'::timestamptz + (i || ' seconds')::interval
598598
FROM generate_series(1,30) s(i);
599599

600-
-- values close to timetamp maximum
600+
-- values close to timestamp maximum
601601
INSERT INTO brin_timestamp_test
602602
SELECT '294276-12-01 00:00:01'::timestamptz + (i || ' seconds')::interval
603603
FROM generate_series(1,30) s(i);

src/test/regress/sql/join.sql

+1-1
Original file line numberDiff line numberDiff line change
@@ -2656,7 +2656,7 @@ SELECT * FROM
26562656
WHERE q0.a = 1;
26572657

26582658
--
2659-
---- Only one side is unqiue
2659+
---- Only one side is unique
26602660
--select * from sl t1, sl t2 where t1.a = t2.a and t1.b = 1;
26612661
--select * from sl t1, sl t2 where t1.a = t2.a and t2.b = 1;
26622662
--

0 commit comments

Comments
 (0)