tree-predcom.c (is_inv_store_elimination_chain): Fix a typo - lenght to length.

	* tree-predcom.c (is_inv_store_elimination_chain): Fix a typo - lenght
	to length.

	* lang.opt (ftail-call-workaround=): Fix a typo - lenghts to lengths.

From-SVN: r271771

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index e4261664778313cfb7124cb54777528cf20166b9..0b30f808027b783e30de15189a05b5b2a6fc7f5e 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,8 @@
+2019-05-30  Jakub Jelinek  <jakub@redhat.com>
+
+       * tree-predcom.c (is_inv_store_elimination_chain): Fix a typo - lenght
+       to length.
+
 2019-05-30  Iain Sandoe  <iain@sandoe.co.uk>
 
        Backport from mainline.

diff --git a/gcc/fortran/ChangeLog b/gcc/fortran/ChangeLog
index f617e6ea6671370f7fb4bb631695861f2e73b434..0369353b2de6c58a4d71dd7049ca1c4ebdfac42c 100644 (file)
--- a/gcc/fortran/ChangeLog
+++ b/gcc/fortran/ChangeLog
@@ -1,3 +1,7 @@
+2019-05-30  Jakub Jelinek  <jakub@redhat.com>
+
+       * lang.opt (ftail-call-workaround=): Fix a typo - lenghts to lengths.
+
 2019-05-29  Jakub Jelinek  <jakub@redhat.com>
 
        PR fortran/90329

diff --git a/gcc/fortran/lang.opt b/gcc/fortran/lang.opt
index 07d824c2570afc3fefb7a32d8f2514347c4781e8..f2908a5c1fc9edf528a08f847423607f4bb36dee 100644 (file)
--- a/gcc/fortran/lang.opt
+++ b/gcc/fortran/lang.opt
@@ -763,7 +763,7 @@ Frotran Alias(ftail-call-workaround=,1,0)
 
 ftail-call-workaround=
 Fortran RejectNegative Joined UInteger IntegerRange(0, 2) Var(flag_tail_call_workaround) Init(1)
-Disallow tail call optimization when a calling routine may have omitted character lenghts.
+Disallow tail call optimization when a calling routine may have omitted character lengths.
 
 funderscoring
 Fortran Var(flag_underscoring) Init(1)

diff --git a/gcc/tree-predcom.c b/gcc/tree-predcom.c
index 1870645d66da5e8b5bdea79dba1b2aca7928e0fa..8e83a715a24da4aaa47108c4cc1b0186fc5fd9b8 100644 (file)
--- a/gcc/tree-predcom.c
+++ b/gcc/tree-predcom.c
@@ -1713,7 +1713,7 @@ is_inv_store_elimination_chain (struct loop *loop, chain_p chain)
 
   gcc_assert (!chain->has_max_use_after);
 
-  /* If loop iterates for unknown times or fewer times than chain->lenght,
+  /* If loop iterates for unknown times or fewer times than chain->length,
      we still need to setup root variable and propagate it with PHI node.  */
   tree niters = number_of_latch_executions (loop);
   if (TREE_CODE (niters) != INTEGER_CST