This is the mail archive of the fortran@gcc.gnu.org mailing list for the GNU Fortran project.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]
Other format: [Raw text]

Re: [fortran,patch] fix typos


On Mon, Oct 16, 2006 at 10:00:08AM +0200, Tobias Burnus wrote:
>This patch fixes a few typos.

Also, could somebody please rephrase invoke.texi's first sentence
of the description of
@item -Wimplicit-interface
Warn about when procedure are called without an explicit interface.

Is "Warn if a procedure is called without" ok?

>
>Tobias
>
>2006-10-16 Tobias Burnus <burnus@net-b.de>
>    * trans-stmt.c: typo
>    * invoke.texi: typos
>    * resolve.c: typo
>    * trans-decl.c: typo
>    * primary.c: typo

Just as a sidenote, these are supposed to be complete sentences,
starting with an uppercase latter and ending with a fullstop.

So "Fix typo." should be fine, i think.
Also, there have to be two spaces between the date and your name and
also between your name and '<'.

Other parts of the tree are also full of some of the typos you mention
below (where significand could also sometimes mean mantissa, i think).


>Index: gcc/fortran/trans-stmt.c
>===================================================================
>--- gcc/fortran/trans-stmt.c	(Revision 117773)
>+++ gcc/fortran/trans-stmt.c	(Arbeitskopie)
>@@ -625,7 +625,7 @@
> }
> 
> 
>-/* Translage an arithmetic IF expression.
>+/* Translate an arithmetic IF expression.
> 
>    IF (cond) label1, label2, label3 translates to
> 
>Index: gcc/fortran/invoke.texi
>===================================================================
>--- gcc/fortran/invoke.texi	(Revision 117773)
>+++ gcc/fortran/invoke.texi	(Arbeitskopie)
>@@ -845,13 +845,13 @@
> @item -frepack-arrays
> @cindex Repacking arrays
> In some circumstances GNU Fortran may pass assumed shape array
>-sections via a descriptor describing a discontiguous area of memory.
>+sections via a descriptor describing a discontinuous area of memory.
> This option adds code to the function prologue to repack the data into
> a contiguous block at runtime.
> 
> This should result in faster accesses to the array.  However it can introduce
> significant overhead to the function call, especially  when the passed data
>-is discontiguous.
>+is discontinuous.


This one also occurs in libgfortran/io/unix.c
> 
> @cindex -fshort-enums
> @item -fshort-enums
>Index: gcc/fortran/resolve.c
>===================================================================
>--- gcc/fortran/resolve.c	(Revision 117773)
>+++ gcc/fortran/resolve.c	(Arbeitskopie)
>@@ -1528,7 +1528,7 @@
> 	     && expr->value.function.isym->generic_id != GFC_ISYM_LOC
> 	     && expr->value.function.isym->generic_id != GFC_ISYM_PRESENT)
>     {
>-      /* Array instrinsics must also have the last upper bound of an
>+      /* Array intrinsics must also have the last upper bound of an
> 	 assumed size array argument.  UBOUND and SIZE have to be
> 	 excluded from the check if the second argument is anything
> 	 than a constant.  */

Also in libgfortran/io/io.h

>Index: gcc/fortran/trans-decl.c
>===================================================================
>--- gcc/fortran/trans-decl.c	(Revision 117773)
>+++ gcc/fortran/trans-decl.c	(Arbeitskopie)
>@@ -701,7 +701,7 @@
>   type = TREE_TYPE (type);
>   if (GFC_DESCRIPTOR_TYPE_P (type))
>     {
>-      /* Create a decriptorless array pointer.  */
>+      /* Create a descriptorless array pointer.  */
>       as = sym->as;
>       packed = 0;
>       if (!gfc_option.flag_repack_arrays)
>Index: gcc/fortran/primary.c
>===================================================================
>--- gcc/fortran/primary.c	(Revision 117773)
>+++ gcc/fortran/primary.c	(Arbeitskopie)
>@@ -463,7 +463,7 @@
>       c = gfc_next_char ();
>     }
> 
>-  /* Scan significand.  */
>+  /* Scan significant.  */
>   for (;; c = gfc_next_char (), count++)
>     {
>       if (c == '.')


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]