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 abd280fab74c11355a95816172c98f258f35614a..76dc156b1fb36c9d09226fa814425ad3fb682509 100644 (file)
--- a/contrib/btree_gist/btree_ts.c
+++ b/contrib/btree_gist/btree_ts.c
@@ -373,7 +373,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 daa1122e0ddf427dc02354692f450e6b5747df69..ed3b8bfb9b899cfe086968e7f0999d28392379fc 100644 (file)
--- a/contrib/btree_gist/btree_utils_var.c
+++ b/contrib/btree_gist/btree_utils_var.c
@@ -50,7 +50,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 ca060fabbd6b34f54fd189627d057659ce92b61f..e1cff97d835d497f90c0b874e2479d814982479c 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 8742bc50823678857da654d427661cafffed7d9e..d313ed59e06ed08f9ccb9504c28bbe1d35c0f0f3 100644 (file)
--- a/src/backend/access/gin/ginfast.c
+++ b/src/backend/access/gin/ginfast.c
@@ -887,8 +887,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/optimizer/path/costsize.c b/src/backend/optimizer/path/costsize.c
index dcdfb8142a757af027fc10122d4c3d69f74485f7..7a7aa40bc3049dab7a321a8e3b8bd28022ff9967 100644 (file)
--- a/src/backend/optimizer/path/costsize.c
+++ b/src/backend/optimizer/path/costsize.c
@@ -873,7 +873,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);