This is the mail archive of the
fortran@gcc.gnu.org
mailing list for the GNU Fortran project.
Re: [fortran,patch] fix typos
- From: Tobias Burnus <burnus at net-b dot de>
- Cc: "'fortran at gcc dot gnu dot org'" <fortran at gcc dot gnu dot org>, gcc-patches <gcc-patches at gcc dot gnu dot org>
- Date: Mon, 16 Oct 2006 21:02:50 +0200
- Subject: Re: [fortran,patch] fix typos
- References: <45333C08.7020005@net-b.de> <20061016174002.GB5119@aon.at>
Hi,
Bernhard Fischer wrote:
> On Mon, Oct 16, 2006 at 10:00:08AM +0200, Tobias Burnus wrote:
>
> Just as a sidenote, these are supposed to be complete sentences,
> starting with an uppercase latter and ending with a fullstop.
>
I realized this, when I looked at the changelog and wrote "Fixed a typo".
> where significand could also sometimes mean mantissa, i think
>
I really should check more dictionaries :-(
The good old Oxford English Dictionary does not contain "significand"
and the Marriam-Webster does neither.
But Oxford's "A Dictionary of Computing" indeed contains:
"In the context of computing, a more common name for the mantissa is the
'significand'."
> > 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.
>
> I'm reasonably sure that the word intended here was "non-contiguous",
> not "discontinuous".
I reverted to "discontiguous"; I also incorporated the change to
-Wimplicit-interface as suggested by Bernhard Fischer.
Is the following patch ok?
Tobias
2006-10-16 Tobias Burnus <burnus@net-b.de>
* primary.c: Revert 'significand' to 'significant' comment change.
* invoke.texi (Warning Options): Minor cleanup for
-Wimplicit-interface.
2006-10-16 Tobias Burnus <burnus@net-b.de>
* m4/in_pack.m4: Fixed a typo.
* m4/iforeach.m4: Fixed a typo.
* m4/eoshift1.m4: Fixed a typo.
* m4/eoshift3.m4: Fixed a typo.
* m4/cshift1.m4: Fixed a typo.
* m4/in_unpack.m4: Fixed a typo.
* m4/reshape.m4: Fixed a typo.
* m4/ifunction.m4: Fixed a typo.
* runtime/environ.c: Fixed a typo.
* runtime/in_pack_generic.c: Fixed a typo.
* runtime/in_unpack_generic.c: Fixed a typo.
* runtime/memory.c: Fixed a typo.
* intrinsics/cshift0.c: Fixed a typo.
* intrinsics/cpu_time.c: Fixed a typo.
* intrinsics/pack_generic.c: Fixed a typo.
* intrinsics/unpack_generic.c: Fixed a typo.
* intrinsics/eoshift0.c: Fixed a typo.
* intrinsics/eoshift2.c: Fixed a typo.
* intrinsics/reshape_generic.c: Fixed a typo.
* io/open.c: Fixed a typo.
* io/list_read.c: Fixed a typo.
* io/io.h: Fixed a typo.
* io/transfer.c: Fixed a typo.
* io/write.c: Fixed a typo.
Index: gcc/fortran/invoke.texi
===================================================================
--- gcc/fortran/invoke.texi (Revision 117788)
+++ gcc/fortran/invoke.texi (Arbeitskopie)
@@ -452,7 +452,7 @@
@cindex -Wimplicit-interface option
@cindex options, -Wimplicit-interface
@item -Wimplicit-interface
-Warn about when procedure are called without an explicit interface.
+Warn if a procedure is called without an explicit interface.
Note this only checks that an explicit interface is present. It does not
check that the declared interfaces are consistent across program units.
@@ -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 discontinuous area of memory.
+sections via a descriptor describing a discontiguous 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 discontinuous.
+is discontiguous.
@cindex -fshort-enums
@item -fshort-enums
Index: gcc/fortran/primary.c
===================================================================
--- gcc/fortran/primary.c (Revision 117788)
+++ gcc/fortran/primary.c (Arbeitskopie)
@@ -463,7 +463,7 @@
c = gfc_next_char ();
}
- /* Scan significant. */
+ /* Scan significand. */
for (;; c = gfc_next_char (), count++)
{
if (c == '.')
Index: libgfortran/m4/in_pack.m4
===================================================================
--- libgfortran/m4/in_pack.m4 (Revision 117788)
+++ libgfortran/m4/in_pack.m4 (Arbeitskopie)
@@ -105,7 +105,7 @@
the next dimension. */
count[n] = 0;
/* We could precalculate these products, but this is a less
- frequently used path so proabably not worth it. */
+ frequently used path so probably not worth it. */
src -= stride[n] * extent[n];
n++;
if (n == dim)
Index: libgfortran/m4/iforeach.m4
===================================================================
--- libgfortran/m4/iforeach.m4 (Revision 117788)
+++ libgfortran/m4/iforeach.m4 (Arbeitskopie)
@@ -85,7 +85,7 @@
the next dimension. */
count[n] = 0;
/* We could precalculate these products, but this is a less
- frequently used path so proabably not worth it. */
+ frequently used path so probably not worth it. */
base -= sstride[n] * extent[n];
n++;
if (n == rank)
@@ -197,7 +197,7 @@
the next dimension. */
count[n] = 0;
/* We could precalculate these products, but this is a less
- frequently used path so proabably not worth it. */
+ frequently used path so probably not worth it. */
base -= sstride[n] * extent[n];
mbase -= mstride[n] * extent[n];
n++;
Index: libgfortran/m4/eoshift1.m4
===================================================================
--- libgfortran/m4/eoshift1.m4 (Revision 117788)
+++ libgfortran/m4/eoshift1.m4 (Arbeitskopie)
@@ -200,7 +200,7 @@
the next dimension. */
count[n] = 0;
/* We could precalculate these products, but this is a less
- frequently used path so proabably not worth it. */
+ frequently used path so probably not worth it. */
rptr -= rstride[n] * extent[n];
sptr -= sstride[n] * extent[n];
hptr -= hstride[n] * extent[n];
Index: libgfortran/m4/eoshift3.m4
===================================================================
--- libgfortran/m4/eoshift3.m4 (Revision 117788)
+++ libgfortran/m4/eoshift3.m4 (Arbeitskopie)
@@ -216,7 +216,7 @@
the next dimension. */
count[n] = 0;
/* We could precalculate these products, but this is a less
- frequently used path so proabably not worth it. */
+ frequently used path so probably not worth it. */
rptr -= rstride[n] * extent[n];
sptr -= sstride[n] * extent[n];
hptr -= hstride[n] * extent[n];
Index: libgfortran/m4/cshift1.m4
===================================================================
--- libgfortran/m4/cshift1.m4 (Revision 117788)
+++ libgfortran/m4/cshift1.m4 (Arbeitskopie)
@@ -176,7 +176,7 @@
the next dimension. */
count[n] = 0;
/* We could precalculate these products, but this is a less
- frequently used path so proabably not worth it. */
+ frequently used path so probably not worth it. */
rptr -= rstride[n] * extent[n];
sptr -= sstride[n] * extent[n];
hptr -= hstride[n] * extent[n];
Index: libgfortran/m4/in_unpack.m4
===================================================================
--- libgfortran/m4/in_unpack.m4 (Revision 117788)
+++ libgfortran/m4/in_unpack.m4 (Arbeitskopie)
@@ -94,7 +94,7 @@
the next dimension. */
count[n] = 0;
/* We could precalculate these products, but this is a less
- frequently used path so proabably not worth it. */
+ frequently used path so probably not worth it. */
dest -= stride[n] * extent[n];
n++;
if (n == dim)
Index: libgfortran/m4/reshape.m4
===================================================================
--- libgfortran/m4/reshape.m4 (Revision 117788)
+++ libgfortran/m4/reshape.m4 (Arbeitskopie)
@@ -202,7 +202,7 @@
the next dimension. */
rcount[n] = 0;
/* We could precalculate these products, but this is a less
- frequently used path so proabably not worth it. */
+ frequently used path so probably not worth it. */
rptr -= rstride[n] * rextent[n];
n++;
if (n == rdim)
@@ -225,7 +225,7 @@
the next dimension. */
scount[n] = 0;
/* We could precalculate these products, but this is a less
- frequently used path so proabably not worth it. */
+ frequently used path so probably not worth it. */
src -= sstride[n] * sextent[n];
n++;
if (n == sdim)
Index: libgfortran/m4/ifunction.m4
===================================================================
--- libgfortran/m4/ifunction.m4 (Revision 117788)
+++ libgfortran/m4/ifunction.m4 (Arbeitskopie)
@@ -126,7 +126,7 @@
the next dimension. */
count[n] = 0;
/* We could precalculate these products, but this is a less
- frequently used path so proabably not worth it. */
+ frequently used path so probably not worth it. */
base -= sstride[n] * extent[n];
dest -= dstride[n] * extent[n];
n++;
@@ -277,7 +277,7 @@
the next dimension. */
count[n] = 0;
/* We could precalculate these products, but this is a less
- frequently used path so proabably not worth it. */
+ frequently used path so probably not worth it. */
base -= sstride[n] * extent[n];
mbase -= mstride[n] * extent[n];
dest -= dstride[n] * extent[n];
Index: libgfortran/runtime/environ.c
===================================================================
--- libgfortran/runtime/environ.c (Revision 117788)
+++ libgfortran/runtime/environ.c (Arbeitskopie)
@@ -503,7 +503,7 @@
stringize (DEFAULT_RECL), 0},
{"GFORTRAN_LIST_SEPARATOR", 0, NULL, init_sep, show_sep,
- "Separatator to use when writing list output. May contain any number of "
+ "Separator to use when writing list output. May contain any number of "
"spaces\nand at most one comma. Default is a single space.", 0},
/* Memory related controls */
@@ -855,7 +855,7 @@
/* Parse the GFORTRAN_CONVERT_UNITS variable. This is called
twice, once to count the units and once to actually mark them in
- the table. When counting, we don't check for double occurences
+ the table. When counting, we don't check for double occurrences
of units. */
static int
Index: libgfortran/runtime/in_pack_generic.c
===================================================================
--- libgfortran/runtime/in_pack_generic.c (Revision 117788)
+++ libgfortran/runtime/in_pack_generic.c (Arbeitskopie)
@@ -138,7 +138,7 @@
the next dimension. */
count[n] = 0;
/* We could precalculate these products, but this is a less
- frequently used path so proabably not worth it. */
+ frequently used path so probably not worth it. */
src -= stride[n] * extent[n] * size;
n++;
if (n == dim)
Index: libgfortran/runtime/in_unpack_generic.c
===================================================================
--- libgfortran/runtime/in_unpack_generic.c (Revision 117788)
+++ libgfortran/runtime/in_unpack_generic.c (Arbeitskopie)
@@ -136,7 +136,7 @@
the next dimension. */
count[n] = 0;
/* We could precalculate these products, but this is a less
- frequently used path so proabably not worth it. */
+ frequently used path so probably not worth it. */
dest -= stride[n] * extent[n] * size;
n++;
if (n == dim)
Index: libgfortran/runtime/memory.c
===================================================================
--- libgfortran/runtime/memory.c (Revision 117788)
+++ libgfortran/runtime/memory.c (Arbeitskopie)
@@ -1,4 +1,4 @@
-/* Memory mamagement routines.
+/* Memory management routines.
Copyright 2002, 2005, 2006 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
Index: libgfortran/intrinsics/cshift0.c
===================================================================
--- libgfortran/intrinsics/cshift0.c (Revision 117788)
+++ libgfortran/intrinsics/cshift0.c (Arbeitskopie)
@@ -276,7 +276,7 @@
the next dimension. */
count[n] = 0;
/* We could precalculate these products, but this is a less
- frequently used path so proabably not worth it. */
+ frequently used path so probably not worth it. */
rptr -= rstride[n] * extent[n];
sptr -= sstride[n] * extent[n];
n++;
Index: libgfortran/intrinsics/cpu_time.c
===================================================================
--- libgfortran/intrinsics/cpu_time.c (Revision 117788)
+++ libgfortran/intrinsics/cpu_time.c (Arbeitskopie)
@@ -86,7 +86,7 @@
static inline void __cpu_time_1 (long *, long *) ATTRIBUTE_ALWAYS_INLINE;
/* Helper function for the actual implementation of the CPU_TIME
- intrnsic. Returns a CPU time in microseconds or -1 if no CPU time
+ intrinsic. Returns a CPU time in microseconds or -1 if no CPU time
could be computed. */
#ifdef __MINGW32__
Index: libgfortran/intrinsics/pack_generic.c
===================================================================
--- libgfortran/intrinsics/pack_generic.c (Revision 117788)
+++ libgfortran/intrinsics/pack_generic.c (Arbeitskopie)
@@ -41,7 +41,7 @@
Description: Pack an array into an array of rank one under the
control of a mask.
- Class: Transformational fucntion.
+ Class: Transformational function.
Arguments:
ARRAY may be of any type. It shall not be scalar.
@@ -171,7 +171,7 @@
and increment the next dimension. */
count[n] = 0;
/* We could precalculate this product, but this is a
- less frequently used path so proabably not worth
+ less frequently used path so probably not worth
it. */
m -= mstride[n] * extent[n];
n++;
@@ -230,7 +230,7 @@
the next dimension. */
count[n] = 0;
/* We could precalculate these products, but this is a less
- frequently used path so proabably not worth it. */
+ frequently used path so probably not worth it. */
sptr -= sstride[n] * extent[n];
mptr -= mstride[n] * extent[n];
n++;
@@ -402,7 +402,7 @@
increment the next dimension. */
count[n] = 0;
/* We could precalculate these products, but this is a
- less frequently used path so proabably not worth it. */
+ less frequently used path so probably not worth it. */
sptr -= sstride[n] * extent[n];
n++;
if (n >= dim)
Index: libgfortran/intrinsics/unpack_generic.c
===================================================================
--- libgfortran/intrinsics/unpack_generic.c (Revision 117788)
+++ libgfortran/intrinsics/unpack_generic.c (Arbeitskopie)
@@ -148,7 +148,7 @@
the next dimension. */
count[n] = 0;
/* We could precalculate these products, but this is a less
- frequently used path so proabably not worth it. */
+ frequently used path so probably not worth it. */
rptr -= rstride[n] * extent[n];
fptr -= fstride[n] * extent[n];
mptr -= mstride[n] * extent[n];
Index: libgfortran/intrinsics/eoshift0.c
===================================================================
--- libgfortran/intrinsics/eoshift0.c (Revision 117788)
+++ libgfortran/intrinsics/eoshift0.c (Arbeitskopie)
@@ -189,7 +189,7 @@
the next dimension. */
count[n] = 0;
/* We could precalculate these products, but this is a less
- frequently used path so proabably not worth it. */
+ frequently used path so probably not worth it. */
rptr -= rstride[n] * extent[n];
sptr -= sstride[n] * extent[n];
n++;
Index: libgfortran/intrinsics/eoshift2.c
===================================================================
--- libgfortran/intrinsics/eoshift2.c (Revision 117788)
+++ libgfortran/intrinsics/eoshift2.c (Arbeitskopie)
@@ -206,7 +206,7 @@
the next dimension. */
count[n] = 0;
/* We could precalculate these products, but this is a less
- frequently used path so proabably not worth it. */
+ frequently used path so probably not worth it. */
rptr -= rstride[n] * extent[n];
sptr -= sstride[n] * extent[n];
bptr -= bstride[n] * extent[n];
Index: libgfortran/intrinsics/reshape_generic.c
===================================================================
--- libgfortran/intrinsics/reshape_generic.c (Revision 117788)
+++ libgfortran/intrinsics/reshape_generic.c (Arbeitskopie)
@@ -190,7 +190,7 @@
the next dimension. */
rcount[n] = 0;
/* We could precalculate these products, but this is a less
- frequently used path so proabably not worth it. */
+ frequently used path so probably not worth it. */
rptr -= rstride[n] * rextent[n] * size;
n++;
if (n == rdim)
@@ -213,7 +213,7 @@
the next dimension. */
scount[n] = 0;
/* We could precalculate these products, but this is a less
- frequently used path so proabably not worth it. */
+ frequently used path so probably not worth it. */
src -= sstride[n] * sextent[n] * size;
n++;
if (n == sdim)
Index: libgfortran/io/open.c
===================================================================
--- libgfortran/io/open.c (Revision 117788)
+++ libgfortran/io/open.c (Arbeitskopie)
@@ -178,7 +178,7 @@
if (flags->pad != PAD_UNSPECIFIED)
generate_error (&opp->common, ERROR_OPTION_CONFLICT,
- "PAD paramter conflicts with UNFORMATTED form in "
+ "PAD parameter conflicts with UNFORMATTED form in "
"OPEN statement");
}
@@ -284,7 +284,7 @@
if (flags->form == FORM_UNFORMATTED)
{
generate_error (&opp->common, ERROR_OPTION_CONFLICT,
- "PAD paramter conflicts with UNFORMATTED form in "
+ "PAD parameter conflicts with UNFORMATTED form in "
"OPEN statement");
goto fail;
}
Index: libgfortran/io/list_read.c
===================================================================
--- libgfortran/io/list_read.c (Revision 117788)
+++ libgfortran/io/list_read.c (Arbeitskopie)
@@ -2219,7 +2219,7 @@
}
/* If the expanded read warning flag is set, increment it,
- indicating that a single read has occured. */
+ indicating that a single read has occurred. */
if (dtp->u.p.expanded_read >= 1)
dtp->u.p.expanded_read++;
@@ -2298,7 +2298,7 @@
c = next_char (dtp);
if (c != '?')
{
- st_sprintf (nml_err_msg, "namelist read: missplaced = sign");
+ st_sprintf (nml_err_msg, "namelist read: misplaced = sign");
goto nml_err_ret;
}
nml_query (dtp, '=');
Index: libgfortran/io/io.h
===================================================================
--- libgfortran/io/io.h (Revision 117788)
+++ libgfortran/io/io.h (Arbeitskopie)
@@ -108,7 +108,7 @@
or
&GROUPNAME OBJECT=value[s] [,OBJECT=value[s]]...&END
- The object can be a fully qualified, compound name for an instrinsic
+ The object can be a fully qualified, compound name for an intrinsic
type, derived types or derived type components. So, a substring
a(:)%b(4)%ch(2:4)(1:7) has to be treated correctly in namelist
read. Hence full information about the structure of the object has
Index: libgfortran/io/transfer.c
===================================================================
--- libgfortran/io/transfer.c (Revision 117788)
+++ libgfortran/io/transfer.c (Arbeitskopie)
@@ -731,7 +731,7 @@
/* This subroutine is the main loop for a formatted data transfer
statement. It would be natural to implement this as a coroutine
with the user program, but C makes that awkward. We loop,
- processesing format elements. When we actually have to transfer
+ processing format elements. When we actually have to transfer
data instead of just setting flags, we return control to the user
program which calls a subroutine that supplies the address and type
of the next element, then comes back here to process it. */
Index: libgfortran/io/write.c
===================================================================
--- libgfortran/io/write.c (Revision 117788)
+++ libgfortran/io/write.c (Arbeitskopie)
@@ -1,6 +1,6 @@
/* Copyright (C) 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc.
Contributed by Andy Vaught
- Namelist output contibuted by Paul Thomas
+ Namelist output contributed by Paul Thomas
This file is part of the GNU Fortran 95 runtime library (libgfortran).