Skip to content

Commit 9679345

Browse files
author
Amit Kapila
committed
Fix typos.
Reported-by: Alexander Lakhin Author: Alexander Lakhin Reviewed-by: Amit Kapila and Tom Lane Discussion: https://postgr.es/m/7208de98-add8-8537-91c0-f8b089e2928c@gmail.com
1 parent 4120571 commit 9679345

File tree

21 files changed

+22
-22
lines changed

21 files changed

+22
-22
lines changed

‎contrib/postgres_fdw/postgres_fdw.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3064,7 +3064,7 @@ estimate_path_cost_size(PlannerInfo *root,
30643064
total_cost += cpu_tuple_cost * retrieved_rows;
30653065

30663066
/*
3067-
* If we have LIMIT, we should perfer performing the restriction remotely
3067+
* If we have LIMIT, we should prefer performing the restriction remotely
30683068
* rather than locally, as the former avoids extra row fetches from the
30693069
* remote that the latter might cause. But since the core code doesn't
30703070
* account for such fetches when estimating the costs of the local

‎doc/src/sgml/charset.sgml

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -896,7 +896,7 @@ CREATE COLLATION french FROM "fr-x-icu";
896896
equal only if they consist of the same byte sequence. Nondeterministic
897897
comparison may determine strings to be equal even if they consist of
898898
different bytes. Typical situations include case-insensitive comparison,
899-
accent-insensitive comparison, as well as comparion of strings in
899+
accent-insensitive comparison, as well as comparison of strings in
900900
different Unicode normal forms. It is up to the collation provider to
901901
actually implement such insensitive comparisons; the deterministic flag
902902
only determines whether ties are to be broken using bytewise comparison.

‎doc/src/sgml/monitoring.sgml

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3556,7 +3556,7 @@ SELECT pg_stat_get_backend_pid(s.backendid) AS pid,
35563556
</entry>
35573557
</row>
35583558
<row>
3559-
<entry><structfield>current_locked_pid</structfield></entry>
3559+
<entry><structfield>current_locker_pid</structfield></entry>
35603560
<entry><type>bigint</type></entry>
35613561
<entry>
35623562
Process ID of the locker currently being waited for.

‎doc/src/sgml/storage.sgml

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -960,7 +960,7 @@ data. Empty in ordinary tables.</entry>
960960
(that is, <structfield>t_natts</structfield> bits altogether). In this list of bits, a
961961
1 bit indicates not-null, a 0 bit is a null. When the bitmap is not
962962
present, all columns are assumed not-null.
963-
The object ID is only present if the <firstterm>HEAP_HASOID</firstterm> bit
963+
The object ID is only present if the <firstterm>HEAP_HASOID_OLD</firstterm> bit
964964
is set in <structfield>t_infomask</structfield>. If present, it appears just
965965
before the <structfield>t_hoff</structfield> boundary. Any padding needed to make
966966
<structfield>t_hoff</structfield> a MAXALIGN multiple will appear between the null

‎src/backend/access/nbtree/nbtinsert.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -663,7 +663,7 @@ _bt_check_unique(Relation rel, BTInsertState insertstate, Relation heapRel,
663663
* (In a !heapkeyspace index, there can be multiple pages with the same
664664
* high key, where the new tuple could legitimately be placed on. In
665665
* that case, the caller passes the first page containing duplicates,
666-
* just like when checkinunique=true. If that page doesn't have enough
666+
* just like when checkingunique=true. If that page doesn't have enough
667667
* room for the new tuple, this function moves right, trying to find a
668668
* legal page that does.)
669669
*

‎src/backend/access/nbtree/nbtutils.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1344,7 +1344,7 @@ _bt_mark_scankey_required(ScanKey skey)
13441344
* _bt_preprocess_keys(), above, about how this is done.
13451345
*
13461346
* Forward scan callers can pass a high key tuple in the hopes of having
1347-
* us set *continuescanthat to false, and avoiding an unnecessary visit to
1347+
* us set *continuescan to false, and avoiding an unnecessary visit to
13481348
* the page to the right.
13491349
*
13501350
* scan: index scan descriptor (containing a search-type scankey)

‎src/backend/commands/copy.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2934,7 +2934,7 @@ CopyFrom(CopyState cstate)
29342934
else if (contain_volatile_functions(cstate->whereClause))
29352935
{
29362936
/*
2937-
* Can't support multi-inserts if there are any volatile funcation
2937+
* Can't support multi-inserts if there are any volatile function
29382938
* expressions in WHERE clause. Similarly to the trigger case above,
29392939
* such expressions may query the table we're inserting into.
29402940
*/

‎src/backend/commands/tablecmds.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3574,7 +3574,7 @@ AlterTableGetLockLevel(List *cmds)
35743574

35753575
/*
35763576
* Removing constraints can affect SELECTs that have been
3577-
* optimised assuming the constraint holds true. See also
3577+
* optimized assuming the constraint holds true. See also
35783578
* CloneFkReferenced.
35793579
*/
35803580
case AT_DropConstraint: /* as DROP INDEX */

‎src/backend/executor/execMain.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2432,7 +2432,7 @@ ExecBuildAuxRowMark(ExecRowMark *erm, List *targetlist)
24322432
* inputslot - tuple for processing - this can be the slot from
24332433
* EvalPlanQualSlot(), for the increased efficiency.
24342434
*
2435-
* This tests whether the tuple in inputslot still matches the relvant
2435+
* This tests whether the tuple in inputslot still matches the relevant
24362436
* quals. For that result to be useful, typically the input tuple has to be
24372437
* last row version (otherwise the result isn't particularly useful) and
24382438
* locked (otherwise the result might be out of date). That's typically

‎src/backend/executor/execTuples.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1602,7 +1602,7 @@ ExecStoreHeapTupleDatum(Datum data, TupleTableSlot *slot)
16021602
* NB: If materialize is true, modifications of the returned tuple are
16031603
* allowed. But it depends on the type of the slot whether such modifications
16041604
* will also affect the slot's contents. While that is not the nicest
1605-
* behaviour, all such modifcations are in the process of being removed.
1605+
* behaviour, all such modifications are in the process of being removed.
16061606
*/
16071607
HeapTuple
16081608
ExecFetchSlotHeapTuple(TupleTableSlot *slot, bool materialize, bool *shouldFree)
@@ -1645,7 +1645,7 @@ ExecFetchSlotHeapTuple(TupleTableSlot *slot, bool materialize, bool *shouldFree)
16451645
* tuple should be considered as read-only.
16461646
*
16471647
* If that callback is not supported, it calls copy_minimal_tuple callback
1648-
* which is expected to return a copy of minimal tuple represnting the
1648+
* which is expected to return a copy of minimal tuple representing the
16491649
* contents of the slot. In this case *shouldFree is set to true,
16501650
* indicating the caller that it should free the memory consumed by the
16511651
* minimal tuple. In this case the returned minimal tuple may be written

‎src/backend/jit/llvm/llvmjit_deform.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -202,7 +202,7 @@ slot_compile_deform(LLVMJitContext *context, TupleDesc desc,
202202
LLVMBuildBitCast(b,
203203
v_slot,
204204
l_ptr(StructMinimalTupleTableSlot),
205-
"minimalslotslot");
205+
"minimalslot");
206206
v_slotoffp = LLVMBuildStructGEP(b, v_minimalslot, FIELDNO_MINIMALTUPLETABLESLOT_OFF, "");
207207
v_tupleheaderp =
208208
l_load_struct_gep(b, v_minimalslot, FIELDNO_MINIMALTUPLETABLESLOT_TUPLE,

‎src/backend/libpq/hba.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1429,7 +1429,7 @@ parse_hba_line(TokenizedLine *tok_line, int elevel)
14291429
errmsg("GSSAPI encryption only supports gss, trust, or reject authentication"),
14301430
errcontext("line %d of configuration file \"%s\"",
14311431
line_num, HbaFileName)));
1432-
*err_msg = "GSSAPI encryption only supports gss, trust, or reject authenticaion";
1432+
*err_msg = "GSSAPI encryption only supports gss, trust, or reject authentication";
14331433
return NULL;
14341434
}
14351435

‎src/backend/postmaster/syslogger.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1546,7 +1546,7 @@ CheckLogrotateSignal(void)
15461546
}
15471547

15481548
/*
1549-
* Remove the file signaling a log rotateion request.
1549+
* Remove the file signaling a log rotation request.
15501550
*/
15511551
void
15521552
RemoveLogrotateSignalFiles(void)

‎src/backend/statistics/mcv.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -714,7 +714,7 @@ statext_mcv_serialize(MCVList *mcvlist, VacAttrStats **stats)
714714
memcpy(ptr, &tmp, info[dim].typlen);
715715
ptr += info[dim].typlen;
716716
}
717-
else if (info[dim].typlen > 0) /* pased by reference */
717+
else if (info[dim].typlen > 0) /* passed by reference */
718718
{
719719
/* no special alignment needed, treated as char array */
720720
memcpy(ptr, DatumGetPointer(value), info[dim].typlen);

‎src/backend/utils/adt/float.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -506,7 +506,7 @@ float8in_internal_opt_error(char *num, char **endptr_p,
506506
}
507507

508508
/*
509-
* Interfact to float8in_internal_opt_error() without "have_error" argument.
509+
* Interface to float8in_internal_opt_error() without "have_error" argument.
510510
*/
511511
double
512512
float8in_internal(char *num, char **endptr_p,

‎src/backend/utils/adt/jsonpath_scan.l

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -603,7 +603,7 @@ parseUnicode(char *s, int l)
603603
{
604604
while (s[++i] != '}' && i < l)
605605
ch = (ch << 4) | hexval(s[i]);
606-
i++; /* ski p '}' */
606+
i++; /* skip '}' */
607607
}
608608
else /* parse '\uXXXX' */
609609
{

‎src/backend/utils/misc/guc.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8968,7 +8968,7 @@ get_explain_guc_options(int *num)
89688968
break;
89698969

89708970
default:
8971-
elog(ERROR, "unexcpected GUC type: %d", conf->vartype);
8971+
elog(ERROR, "unexpected GUC type: %d", conf->vartype);
89728972
}
89738973

89748974
/* skip GUC variables that match the built-in default */

‎src/bin/pg_dump/t/002_pg_dump.pl

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3131,7 +3131,7 @@
31313131
# AM occurs. To achieve that we create a table with the standard
31323132
# AM, test AM, standard AM. That guarantees that there needs to be
31333133
# a SET interspersed. Then use a regex that prevents interspersed
3134-
# SET ...; statements, followed by the exptected CREATE TABLE. Not
3134+
# SET ...; statements, followed by the expected CREATE TABLE. Not
31353135
# pretty, but seems hard to do better in this framework.
31363136
'CREATE TABLE regress_pg_dump_table_am' => {
31373137
create_order => 12,

‎src/include/statistics/statistics.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -82,7 +82,7 @@ typedef struct MCVItem
8282
Datum *values; /* item values */
8383
} MCVItem;
8484

85-
/* multivariate MCV list - essentally an array of MCV items */
85+
/* multivariate MCV list - essentially an array of MCV items */
8686
typedef struct MCVList
8787
{
8888
uint32 magic; /* magic constant marker */

‎src/include/utils/jsonpath.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -96,7 +96,7 @@ typedef enum JsonPathItemType
9696
* Support functions to parse/construct binary value.
9797
* Unlike many other representation of expression the first/main
9898
* node is not an operation but left operand of expression. That
99-
* allows to implement cheep follow-path descending in jsonb
99+
* allows to implement cheap follow-path descending in jsonb
100100
* structure and then execute operator with right operand
101101
*/
102102

‎src/interfaces/libpq/pqexpbuffer.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -37,7 +37,7 @@
3737
/* All "broken" PQExpBuffers point to this string. */
3838
static const char oom_buffer[1] = "";
3939

40-
/* Need a char * for unconstify() compatiblity */
40+
/* Need a char * for unconstify() compatibility */
4141
static const char *oom_buffer_ptr = oom_buffer;
4242

4343
static bool appendPQExpBufferVA(PQExpBuffer str, const char *fmt, va_list args) pg_attribute_printf(2, 0);

0 commit comments

Comments
 (0)