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 0d7378e9ce57bb2eadcf5e7262087dc56ea74ed1..1d2b3612ae30310f0fc728af5eb6295d58522648 100644 (file)
--- a/contrib/btree_gist/btree_ts.c
+++ b/contrib/btree_gist/btree_ts.c
@@ -375,7 +375,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 d7387e63d6d4136dfe44fff6a5a4a3ffa3ff6a50..5d6dc69eb8159ccacc5cc7290b24a329d3da426e 100644 (file)
--- a/contrib/btree_gist/btree_utils_var.c
+++ b/contrib/btree_gist/btree_utils_var.c
@@ -52,7 +52,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 d51072cbec5c0f1dc429a718f82c2a427c1fa688..64ecb850f3dd58dfb32f60c8c18502384c11d158 100644 (file)
--- a/src/backend/access/common/heaptuple.c
+++ b/src/backend/access/common/heaptuple.c
@@ -807,7 +807,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 51778b763949cb3b39096b92570ef2fdbcb09603..4fe2998cba62417ff384f114b0b5be6c05ef58c7 100644 (file)
--- a/src/backend/access/gin/ginfast.c
+++ b/src/backend/access/gin/ginfast.c
@@ -886,8 +886,8 @@ ginInsertCleanup(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/access/gist/gistproc.c b/src/backend/access/gist/gistproc.c
index 9c39f582266caff0a43a057bd58dac711b129832..d8f861aae6b20b6608bc0c8745a4671155d7b7c5 100644 (file)
--- a/src/backend/access/gist/gistproc.c
+++ b/src/backend/access/gist/gistproc.c
@@ -578,7 +578,7 @@ gist_box_picksplit(PG_FUNCTION_ARGS)
                 * We first consider splits where b is the lower bound of an entry.
                 * We iterate through all entries, and for each b, calculate the
                 * smallest possible a. Then we consider splits where a is the
-                * uppper bound of an entry, and for each a, calculate the greatest
+                * upper bound of an entry, and for each a, calculate the greatest
                 * possible b.
                 *
                 * In the above example, the first loop would consider splits:
@@ -628,7 +628,7 @@ gist_box_picksplit(PG_FUNCTION_ARGS)
                }
 
                /*
-                * Iterate over upper bound of left group finding greates possible
+                * Iterate over upper bound of left group finding greatest possible
                 * lower bound of right group.
                 */
                i1 = nentries - 1;

diff --git a/src/backend/optimizer/path/costsize.c b/src/backend/optimizer/path/costsize.c
index 8bb2bd5621a3ddf2ad0b87da1cda8026540bf9cb..d1d6c843aaafbeaa58a9a28cb394809cb2772306 100644 (file)
--- a/src/backend/optimizer/path/costsize.c
+++ b/src/backend/optimizer/path/costsize.c
@@ -919,7 +919,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);