]> granicus.if.org Git - postgresql/commitdiff
Fix misc typos in comments.
authorHeikki Linnakangas <heikki.linnakangas@iki.fi>
Wed, 23 Jan 2019 11:39:00 +0000 (13:39 +0200)
committerHeikki Linnakangas <heikki.linnakangas@iki.fi>
Wed, 23 Jan 2019 11:39:00 +0000 (13:39 +0200)
Spotted mostly by Fabien Coelho.

Discussion: https://www.postgresql.org/message-id/alpine.DEB.2.21.1901230947050.16643@lancre

15 files changed:
contrib/pgcrypto/pgp-decrypt.c
contrib/postgres_fdw/postgres_fdw.c
src/backend/access/gin/ginget.c
src/backend/executor/execExprInterp.c
src/backend/executor/execParallel.c
src/backend/executor/execTuples.c
src/backend/parser/gram.y
src/backend/tcop/postgres.c
src/backend/utils/cache/inval.c
src/backend/utils/cache/typcache.c
src/bin/pgbench/pgbench.c
src/bin/psql/command.c
src/include/nodes/execnodes.h
src/include/port.h
src/pl/plpython/plpy_elog.c

index 7d31e5354b8f236216f476742d2c9c0aa4376517..96c344c30b786e5db17ab5f599094f55934078c8 100644 (file)
@@ -132,7 +132,7 @@ pgp_parse_pkt_hdr(PullFilter *src, uint8 *tag, int *len_p, int allow_ctx)
        int                     res;
        uint8      *p;
 
-       /* EOF is normal here, thus we dont use GETBYTE */
+       /* EOF is normal here, thus we don't use GETBYTE */
        res = pullf_read(src, 1, &p);
        if (res < 0)
                return res;
index d85a83abe98ae8573d833f0ba76861bcdab12a73..961838ed93a38d189d14e242685bc54c79090196 100644 (file)
@@ -2771,7 +2771,7 @@ estimate_path_cost_size(PlannerInfo *root,
                        run_cost += cpu_tuple_cost * numGroups;
                        run_cost += ptarget->cost.per_tuple * numGroups;
 
-                       /* Accout for the eval cost of HAVING quals, if any */
+                       /* Account for the eval cost of HAVING quals, if any */
                        if (root->parse->havingQual)
                        {
                                QualCost        remote_cost;
index fb37e2b6c4395e5c62655c8287aeb1121393b51d..b18ae2b3ed250e5f1d31ba71fd31d0a6d8810601 100644 (file)
@@ -442,7 +442,7 @@ restartScanEntry:
                        /*
                         * Lock the entry leaf page.  This is more coarse-grained than
                         * necessary, because it will conflict with any insertions that
-                        * land on the same leaf page, not only the exacty key we searched
+                        * land on the same leaf page, not only the exact key we searched
                         * for.  But locking an individual tuple would require updating
                         * that lock whenever it moves because of insertions or vacuums,
                         * which seems too complicated.
index d793efdd9cdaf1d4f49ef2d6ffca66a6f6d8e071..5a7206f5882da80380a35f474c072f5369f611fb 100644 (file)
@@ -1873,7 +1873,7 @@ CheckOpSlotCompatibility(ExprEvalStep *op, TupleTableSlot *slot)
 
        /*
         * Should probably fixed at some point, but for now it's easier to allow
-        * buffer and heap tuples to be used interchangably.
+        * buffer and heap tuples to be used interchangeably.
         */
        if (slot->tts_ops == &TTSOpsBufferHeapTuple &&
                op->d.fetch.kind == &TTSOpsHeapTuple)
index d6cfd28ddc2da174f38403bf6be5503230cd7273..ceea3d6d721cb4b726d7e9098e23bee629884c85 100644 (file)
@@ -1049,7 +1049,7 @@ ExecParallelRetrieveJitInstrumentation(PlanState *planstate,
                        MemoryContextAllocZero(planstate->state->es_query_cxt, sizeof(JitInstrumentation));
        combined = planstate->state->es_jit_worker_instr;
 
-       /* Accummulate all the workers' instrumentations. */
+       /* Accumulate all the workers' instrumentations. */
        for (n = 0; n < shared_jit->num_workers; ++n)
                InstrJitAgg(combined, &shared_jit->jit_instr[n]);
 
index 67474e0d209d0162b7cf124961a55cc55f8db4f6..bc5a5249448058579bb31d8aef31a375956a8d9c 100644 (file)
@@ -1476,7 +1476,7 @@ ExecStoreAllNullTuple(TupleTableSlot *slot)
  * possible.
  *
  * If materialize is true, the contents of the slots will be made independent
- * from the underlying storage (i.e. all buffer pins are release, memory is
+ * from the underlying storage (i.e. all buffer pins are released, memory is
  * allocated in the slot's context).
  *
  * If shouldFree is not-NULL it'll be set to true if the returned tuple has
index d8a3c2d4cc600d728b342e4f074fef1a9e4a6771..6535550c72e3e93f6fa096dab906e42ef0ed6eae 100644 (file)
@@ -2677,7 +2677,7 @@ alter_identity_column_option:
                ;
 
 PartitionBoundSpec:
-                       /* a HASH partition*/
+                       /* a HASH partition */
                        FOR VALUES WITH '(' hash_partbound ')'
                                {
                                        ListCell   *lc;
index 0c0891b33e695d3738dbee9f3133f8d965f1ed81..e773f20d9fee99661c6354e5164f3ae3cf9bd5d1 100644 (file)
@@ -2243,7 +2243,7 @@ check_log_duration(char *msec_str, bool was_logged)
 
                /*
                 * Do not log if log_statement_sample_rate = 0. Log a sample if
-                * log_statement_sample_rate <= 1 and avoid unecessary random() call
+                * log_statement_sample_rate <= 1 and avoid unnecessary random() call
                 * if log_statement_sample_rate = 1.  But don't compute any of this
                 * unless needed.
                 */
index ba28611d8cc1958fdccfe683260ee1a76f45cd73..f09e3a9affa0df824bb0d5e87aaa3c051dde4459 100644 (file)
@@ -8,7 +8,7 @@
  *     When a tuple is updated or deleted, our standard visibility rules
  *     consider that it is *still valid* so long as we are in the same command,
  *     ie, until the next CommandCounterIncrement() or transaction commit.
- *     (See acces/heap/heapam_visibility.c, and note that system catalogs are
+ *     (See access/heap/heapam_visibility.c, and note that system catalogs are
  *  generally scanned under the most current snapshot available, rather than
  *  the transaction snapshot.) At the command boundary, the old tuple stops
  *     being valid and the new version, if any, becomes valid.  Therefore,
index bca2dc118d96dc87fd51f0cea058a0d78979ab20..2fb7dd3b8e3080fd3576e2f7eb0a0f02c93e8bb4 100644 (file)
@@ -151,7 +151,7 @@ typedef struct RecordCacheEntry
 
 /*
  * To deal with non-anonymous record types that are exchanged by backends
- * involved in a parallel query, we also need a shared verion of the above.
+ * involved in a parallel query, we also need a shared version of the above.
  */
 struct SharedRecordTypmodRegistry
 {
index 489912ff0c808992182e6beeaf8ddf739ea7c2f7..a40e144f22f88876adab27aae4767e068184c7ad 100644 (file)
@@ -407,12 +407,12 @@ typedef struct
 } CState;
 
 /*
- * Cache cell for zipfian_random call
+ * Cache cell for random_zipfian call
  */
 typedef struct
 {
        /* cell keys */
-       double          s;                              /* s - parameter of zipfan_random function */
+       double          s;                              /* s - parameter of random_zipfian function */
        int64           n;                              /* number of elements in range (max - min + 1) */
 
        double          harmonicn;              /* generalizedHarmonicNumber(n, s) */
index cbe5e518c959e0c84dfb5e0914332ab474074867..ab259c473a9ee187b477d6afc26c9b811363cb9d 100644 (file)
@@ -600,7 +600,7 @@ exec_command_conninfo(PsqlScanState scan_state, bool active_branch)
 
                        /*
                         * If the host is an absolute path, the connection is via socket
-                        * unless overriden by hostaddr
+                        * unless overridden by hostaddr
                         */
                        if (is_absolute_path(host))
                        {
index 7cae0851774be733d23b8ca3bbd1e666d50e3c3a..64e8ef37407f24aab2dc39a178711d54c4024bff 100644 (file)
@@ -1136,7 +1136,7 @@ typedef struct ModifyTableState
  *             nplans                          how many plans are in the array
  *             whichplan                       which plan is being executed (0 .. n-1), or a
  *                                                     special negative value. See nodeAppend.c.
- *             pruningstate            details required to allow partitions to be
+ *             prune_state                     details required to allow partitions to be
  *                                                     eliminated from the scan, or NULL if not possible.
  *             valid_subplans          for runtime pruning, valid appendplans indexes to
  *                                                     scan.
index a55c47326235b4a26d1319844536ee5f31e79154..485e771f99fb2d73a571957ccfeb02cf58f10445 100644 (file)
@@ -523,7 +523,7 @@ extern pqsigfunc pqsignal_no_restart(int signo, pqsigfunc func);
 /* port/quotes.c */
 extern char *escape_single_quotes_ascii(const char *src);
 
-/* port/wait_error.c */
+/* common/wait_error.c */
 extern char *wait_result_to_str(int exit_status);
 extern bool wait_result_is_signal(int exit_status, int signum);
 extern bool wait_result_is_any_signal(int exit_status, bool include_command_not_found);
index 3814a6c32df7232f3025b2714df10f605a7bcb7c..ec7e624e1017f18163a952f000e72ade4f1f948a 100644 (file)
@@ -244,7 +244,7 @@ PLy_traceback(PyObject *e, PyObject *v, PyObject *tb,
 
        *tb_depth = 0;
        initStringInfo(&tbstr);
-       /* Mimick Python traceback reporting as close as possible. */
+       /* Mimic Python traceback reporting as close as possible. */
        appendStringInfoString(&tbstr, "Traceback (most recent call last):");
        while (tb != NULL && tb != Py_None)
        {