Fix misc typos.

Oskari Saarenmaa. Backpatch to stable branches where applicable.

diff --git a/contrib/btree_gist/btree_ts.c b/contrib/btree_gist/btree_ts.c
index 202d3392a91a36179f83fd5270528b4ed2e0a3a2..81ecebfb29724208520b3d3f5c631cacec8fac80 100644 (file)
--- a/contrib/btree_gist/btree_ts.c
+++ b/contrib/btree_gist/btree_ts.c
@@ -254,7 +254,7 @@ gbt_ts_penalty(PG_FUNCTION_ARGS)
                                newdbl[2];
 
        /*
-        * We are allways using "double" timestamps here. Precision should be good
+        * We are always using "double" timestamps here. Precision should be good
         * enough.
         */
        orgdbl[0] = ((double) origentry->lower);

diff --git a/contrib/btree_gist/btree_utils_var.c b/contrib/btree_gist/btree_utils_var.c
index fab676eec8cd3133a79560cb18f1e5a8e2a4e9df..39f6ed1a5f2dcff4e8c29c1e9e2b5ca9b0511f68 100644 (file)
--- a/contrib/btree_gist/btree_utils_var.c
+++ b/contrib/btree_gist/btree_utils_var.c
@@ -36,7 +36,7 @@ gbt_var_decompress(PG_FUNCTION_ARGS)
        PG_RETURN_POINTER(entry);
 }
 
-/* Returns a better readable representaion of variable key ( sets pointer ) */
+/* Returns a better readable representation of variable key ( sets pointer ) */
 GBT_VARKEY_R
 gbt_var_key_readable(const GBT_VARKEY *k)
 {

diff --git a/src/backend/access/common/heaptuple.c b/src/backend/access/common/heaptuple.c
index 40aeba534e1bc473150c4ae2482897b3e69bb9a3..97c536b2e9f5794de1904599ff9624c7d8c5aaf2 100644 (file)
--- a/src/backend/access/common/heaptuple.c
+++ b/src/backend/access/common/heaptuple.c
@@ -808,7 +808,7 @@ heap_modify_tuple(HeapTuple tuple,
         * repl information, as appropriate.
         *
         * NOTE: it's debatable whether to use heap_deform_tuple() here or just
-        * heap_getattr() only the non-replaced colums.  The latter could win if
+        * heap_getattr() only the non-replaced columns.  The latter could win if
         * there are many replaced columns and few non-replaced ones. However,
         * heap_deform_tuple costs only O(N) while the heap_getattr way would cost
         * O(N^2) if there are many non-replaced columns, so it seems better to

diff --git a/src/backend/access/gin/ginfast.c b/src/backend/access/gin/ginfast.c
index 5918258e98fa8f502fa808d0057d84f570773d3e..6629d3ccafc5e011f81259bd9e5f7075e53c16fe 100644 (file)
--- a/src/backend/access/gin/ginfast.c
+++ b/src/backend/access/gin/ginfast.c
@@ -841,8 +841,8 @@ ginInsertCleanup(Relation index, GinState *ginstate,
                                                                                                 * locking */
 
                        /*
-                        * remove readed pages from pending list, at this point all
-                        * content of readed pages is in regular structure
+                        * remove read pages from pending list, at this point all
+                        * content of read pages is in regular structure
                         */
                        if (shiftList(index, metabuffer, blkno, stats))
                        {

diff --git a/src/backend/optimizer/path/costsize.c b/src/backend/optimizer/path/costsize.c
index 38a4a01de9e68768cdc69e1dc71fe46252c8deb1..2c249d000619851299fb9935652aec75876a0a9b 100644 (file)
--- a/src/backend/optimizer/path/costsize.c
+++ b/src/backend/optimizer/path/costsize.c
@@ -869,7 +869,7 @@ cost_tidscan(Path *path, PlannerInfo *root,
 
        /*
         * The TID qual expressions will be computed once, any other baserestrict
-        * quals once per retrived tuple.
+        * quals once per retrieved tuple.
         */
        cost_qual_eval(&tid_qual_cost, tidquals, root);