Skip to content

Commit

Permalink
Browse files Browse the repository at this point in the history
Fix typos.
  • Loading branch information
Ondřej Bílka committed Aug 21, 2013
1 parent 46ed103 commit c0c3f78
Show file tree
Hide file tree
Showing 61 changed files with 141 additions and 66 deletions.
43 changes: 43 additions & 0 deletions ChangeLog
@@ -1,3 +1,46 @@
2013-08-21 Ondřej Bílka <neleai@seznam.cz>

* argp/argp-help.c: Fix typos.
* crypt/speeds.c: Likewise.
* csu/check_fds.c: Likewise.
* elf/dl-load.c: Likewise.
* elf/dl-open.c: Likewise.
* elf/reldep3.c: Likewise.
* elf/reldep.c: Likewise.
* elf/sprof.c: Likewise.
* iconv/iconv_charmap.c: Likewise.
* iconv/skeleton.c: Likewise.
* iconv/strtab.c: Likewise.
* io/lockf64.c: Likewise.
* libio/libioP.h: Likewise.
* resolv/gai_notify.c: Likewise.
* resolv/ns_name.c: Likewise.
* resolv/ns_samedomain.c: Likewise.
* resolv/res_send.c: Likewise.
* stdlib/random.c: Likewise.
* sunrpc/rpc/xdr.h: Likewise.
* sysdeps/i386/fpu/fraiseexcpt.c: Likewise.
* sysdeps/i386/i686/multiarch/memcmp-sse4.S: Likewise.
* sysdeps/i386/i686/multiarch/memset-sse2-rep.S: Likewise.
* sysdeps/i386/i686/multiarch/memset-sse2.S: Likewise.
* sysdeps/i386/i686/multiarch/strcat-sse2.S: Likewise.
* sysdeps/i386/i686/multiarch/strcmp-sse4.S: Likewise.
* sysdeps/i386/i686/multiarch/strcmp-ssse3.S: Likewise.
* sysdeps/i386/i686/multiarch/strcpy-sse2.S: Likewise.
* sysdeps/mach/hurd/check_fds.c: Likewise.
* sysdeps/powerpc/powerpc32/cell/memcpy.S: Likewise.
* sysdeps/powerpc/powerpc32/fpu/setjmp.S: Likewise.
* sysdeps/powerpc/powerpc32/power4/memcmp.S: Likewise.
* sysdeps/powerpc/powerpc32/power7/memcmp.S: Likewise.
* sysdeps/powerpc/powerpc32/setjmp.S: Likewise.
* sysdeps/powerpc/powerpc64/cell/memcpy.S: Likewise.
* sysdeps/pthread/aio_notify.c: Likewise.
* sysdeps/sparc/fpu/fraiseexcpt.c: Likewise.
* sysdeps/unix/sysv/linux/socketcall.h: Likewise.
* sysdeps/x86_64/fpu/fraiseexcpt.c: Likewise.
* sysdeps/x86_64/multiarch/strcpy-sse2-unaligned.S: Likewise.
* sysdeps/x86/fpu/bits/fenv.h: Likewise.

2013-08-21 Liubov Dmitrieva <liubov.dmitrieva@intel.com>

* sysdeps/i386/i686/multiarch/strcmp.S: Skip SSE4_2
Expand Down
6 changes: 3 additions & 3 deletions argp/argp-help.c
Expand Up @@ -357,7 +357,7 @@ struct hol_entry
/* A pointers into the HOL's short_options field, to the first short option
letter for this entry. The order of the characters following this point
corresponds to the order of options pointed to by OPT, and there are at
most NUM. A short option recorded in a option following OPT is only
most NUM. A short option recorded in an option following OPT is only
valid if it occurs in the right place in SHORT_OPTIONS (otherwise it's
probably been shadowed by some other entry). */
char *short_options;
Expand Down Expand Up @@ -736,12 +736,12 @@ hol_entry_cmp (const struct hol_entry *entry1,
if (entry1->cluster != entry2->cluster)
{
/* The entries are not within the same cluster, so we can't compare them
directly, we have to use the appropiate clustering level too. */
directly, we have to use the appropriate clustering level too. */
if (! entry1->cluster)
/* ENTRY1 is at the `base level', not in a cluster, so we have to
compare it's group number with that of the base cluster in which
ENTRY2 resides. Note that if they're in the same group, the
clustered option always comes laster. */
clustered option always comes last. */
return group_cmp (group1, hol_cluster_base (entry2->cluster)->group, -1);
else if (! entry2->cluster)
/* Likewise, but ENTRY2's not in a cluster. */
Expand Down
2 changes: 1 addition & 1 deletion crypt/speeds.c
Expand Up @@ -16,7 +16,7 @@
* patch from chip@chinacat.unicom.com (Chip Rosenthal):
* you may enable it if your system does not include
* a setitimer() function. You'll have to ensure the
* existence a environment variable: HZ giving how many
* existence an environment variable: HZ giving how many
* ticks goes per second.
* If not existing in your default environment 50, 60
* or even 100 may be the right value. Perhaps you should
Expand Down
2 changes: 1 addition & 1 deletion csu/check_fds.c
Expand Up @@ -60,7 +60,7 @@ check_one_fd (int fd, int mode)

/* Something is wrong with this descriptor, it's probably not
opened. Open /dev/null so that the SUID program we are
about to start does not accidently use this descriptor. */
about to start does not accidentally use this descriptor. */
int nullfd = open_not_cancel (name, mode, 0);

/* We are very paranoid here. With all means we try to ensure
Expand Down
2 changes: 1 addition & 1 deletion elf/dl-load.c
Expand Up @@ -324,7 +324,7 @@ _dl_dst_substitute (struct link_map *l, const char *name, char *result,
const char *const start = name;

/* Now fill the result path. While copying over the string we keep
track of the start of the last path element. When we come accross
track of the start of the last path element. When we come across
a DST we copy over the value or (if the value is not available)
leave the entire path element out. */
char *wp = result;
Expand Down
2 changes: 1 addition & 1 deletion elf/dl-open.c
Expand Up @@ -396,7 +396,7 @@ dl_open_worker (void *a)
/* If this here is the shared object which we want to profile
make sure the profile is started. We can find out whether
this is necessary or not by observing the `_dl_profile_map'
variable. If it was NULL but is not NULL afterwars we must
variable. If it was NULL but is not NULL afterwards we must
start the profiling. */
struct link_map *old_profile_map = GL(dl_profile_map);

Expand Down
2 changes: 1 addition & 1 deletion elf/reldep.c
Expand Up @@ -54,7 +54,7 @@ main (void)
}

/* Now close the first object. If must still be around since we have
a implicit dependency. */
an implicit dependency. */
if (dlclose (h1) != 0)
{
printf ("closing h1 failed: %s\n", dlerror ());
Expand Down
2 changes: 1 addition & 1 deletion elf/reldep3.c
Expand Up @@ -54,7 +54,7 @@ main (void)
}

/* Now close the first object. If must still be around since we have
a implicit dependency. */
an implicit dependency. */
if (dlclose (h1) != 0)
{
printf ("closing h1 failed: %s\n", dlerror ());
Expand Down
2 changes: 1 addition & 1 deletion elf/sprof.c
Expand Up @@ -1364,7 +1364,7 @@ generate_call_graph (struct profdata *profdata)
runp = runp->next;
}

/* Info abount the function itself. */
/* Info about the function itself. */
n = printf ("[%Zu]", cnt);
printf ("%*s%5.1f%8.2f%8.2f%9" PRIdMAX " %s [%Zd]\n",
(int) (7 - n), " ",
Expand Down
2 changes: 1 addition & 1 deletion iconv/iconv_charmap.c
Expand Up @@ -454,7 +454,7 @@ process_block (struct convtable *tbl, char *addr, size_t len, FILE *output)
while (! is_term (cur, byte))
if (cur->val[byte].sub == NULL)
{
/* This is a invalid sequence. Skip the first byte if we are
/* This is an invalid sequence. Skip the first byte if we are
ignoring errors. Otherwise punt. */
if (! omit_invalid)
{
Expand Down
4 changes: 2 additions & 2 deletions iconv/skeleton.c
Expand Up @@ -514,7 +514,7 @@ FUNCTION_NAME (struct __gconv_step *step, struct __gconv_step_data *data,
size_t *lirreversiblep = irreversible ? &lirreversible : NULL;

/* The following assumes that encodings, which have a variable length
what might unalign a buffer even though it is a aligned in the
what might unalign a buffer even though it is an aligned in the
beginning, either don't have the minimal number of bytes as a divisor
of the maximum length or have a minimum length of 1. This is true
for all known and supported encodings.
Expand Down Expand Up @@ -659,7 +659,7 @@ FUNCTION_NAME (struct __gconv_step *step, struct __gconv_step_data *data,
data->__outbuf = outbuf;

/* Remember how many non-identical characters we
converted in a irreversible way. */
converted in an irreversible way. */
*irreversible += lirreversible;

break;
Expand Down
2 changes: 1 addition & 1 deletion iconv/strtab.c
Expand Up @@ -180,7 +180,7 @@ newstring (struct Strtab *st, const char *str, size_t len)


/* XXX This function should definitely be rewritten to use a balancing
tree algorith (AVL, red-black trees). For now a simple, correct
tree algorithm (AVL, red-black trees). For now a simple, correct
implementation is enough. */
static struct Strent **
searchstring (struct Strent **sep, struct Strent *newstr)
Expand Down
2 changes: 1 addition & 1 deletion io/lockf64.c
Expand Up @@ -21,7 +21,7 @@
#include <errno.h>
#include <string.h>

/* lockf.c defines lockf64 as an lias if __OFF_T_MATCHES_OFF64_T. */
/* lockf.c defines lockf64 as an alias if __OFF_T_MATCHES_OFF64_T. */
#ifndef __OFF_T_MATCHES_OFF64_T

/* lockf is a simplified interface to fcntl's locking facilities. */
Expand Down
4 changes: 2 additions & 2 deletions libio/libioP.h
Expand Up @@ -73,7 +73,7 @@ extern "C" {
* These are all the same, just used differently.
* An _IO_FILE (or FILE) object is allows followed by a pointer to
* a jump table (of pointers to functions). The pointer is accessed
* with the _IO_JUMPS macro. The jump table has a eccentric format,
* with the _IO_JUMPS macro. The jump table has an eccentric format,
* so as to be compatible with the layout of a C++ virtual function table.
* (as implemented by g++). When a pointer to a streambuf object is
* coerced to an (_IO_FILE*), then _IO_JUMPS on the result just
Expand Down Expand Up @@ -224,7 +224,7 @@ typedef int (*_IO_doallocate_t) (_IO_FILE *);
There is no correspondence in the ANSI/ISO C++ standard library.
The hooks basically correspond to the Unix system functions
(read, write, close, lseek, and stat) except that a _IO_FILE*
parameter is used instead of a integer file descriptor; the default
parameter is used instead of an integer file descriptor; the default
implementation used for normal files just calls those functions.
The advantage of overriding these functions instead of the higher-level
ones (underflow, overflow etc) is that you can leave all the buffering
Expand Down
5 changes: 5 additions & 0 deletions nptl/ChangeLog
@@ -1,3 +1,8 @@
2013-08-21 Ondřej Bílka <neleai@seznam.cz>

* pthread_getschedparam.c: Fix typos.
* sysdeps/unix/sysv/linux/register-atfork.c: Likewise.

2013-07-23 David S. Miller <davem@davemloft.net>

* tst-cancel4.c (WRITE_BUFFER_SIZE): Adjust comment.
Expand Down
2 changes: 1 addition & 1 deletion nptl/pthread_getschedparam.c
Expand Up @@ -40,7 +40,7 @@ __pthread_getschedparam (threadid, policy, param)
lll_lock (pd->lock, LLL_PRIVATE);

/* The library is responsible for maintaining the values at all
times. If the user uses a interface other than
times. If the user uses an interface other than
pthread_setschedparam to modify the scheduler setting it is not
the library's problem. In case the descriptor's values have
not yet been retrieved do it now. */
Expand Down
2 changes: 1 addition & 1 deletion nptl/sysdeps/unix/sysv/linux/register-atfork.c
Expand Up @@ -127,7 +127,7 @@ libc_freeres_fn (free_mem)
/* No more fork handlers. */
__fork_handlers = NULL;

/* Free eventually alloated memory blocks for the object pool. */
/* Free eventually allocated memory blocks for the object pool. */
struct fork_handler_pool *runp = fork_handler_pool.next;

memset (&fork_handler_pool, '\0', sizeof (fork_handler_pool));
Expand Down
4 changes: 4 additions & 0 deletions ports/ChangeLog.am33
@@ -1,3 +1,7 @@
2013-08-21 Ondřej Bílka <neleai@seznam.cz>

* sysdeps/am33/fpu/fraiseexcpt.c: Fix typos.

2013-06-05 Joseph Myers <joseph@codesourcery.com>

* sysdeps/am33/elf/start.S: Remove trailing whitespace.
Expand Down
6 changes: 6 additions & 0 deletions ports/ChangeLog.hppa
@@ -1,3 +1,9 @@
2013-08-21 Ondřej Bílka <neleai@seznam.cz>

* sysdeps/hppa/dl-lookupcfg.h: Fix typos.
* sysdeps/hppa/fpu/fraiseexcpt.c: Likewise.
* sysdeps/unix/sysv/linux/hppa/sysdep.h: Likewise.

2013-07-23 Carlos O'Donell <carlos@redhat.com>

* sysdeps/hppa/fpu/libm-test-ulps: Regenerate.
Expand Down
9 changes: 9 additions & 0 deletions ports/ChangeLog.ia64
@@ -1,3 +1,12 @@
2013-08-21 Ondřej Bílka <neleai@seznam.cz>

* sysdeps/ia64/fpu/e_atanhl.S: Fix typos.
* sysdeps/ia64/fpu/e_log2l.S: Likewise.
* sysdeps/ia64/fpu/e_logl.S: Likewise.
* sysdeps/ia64/fpu/fraiseexcpt.c: Likewise.
* sysdeps/ia64/fpu/libm_lgammal.S: Likewise.
* sysdeps/ia64/fpu/s_log1pl.S: Likewise.

2013-07-04 Andreas Jaeger <aj@suse.de>

* sysdeps/unix/sysv/linux/ia64/sys/ptrace.h (PTRACE_LISTEN):
Expand Down
4 changes: 4 additions & 0 deletions ports/ChangeLog.m68k
@@ -1,3 +1,7 @@
2013-08-21 Ondřej Bílka <neleai@seznam.cz>

* sysdeps/m68k/m680x0/fpu/fraiseexcpt.c: Fix typos.

2013-07-20 Andreas Schwab <schwab@linux-m68k.org>

* sysdeps/unix/sysv/linux/m68k/dl-static.c: New file.
Expand Down
4 changes: 4 additions & 0 deletions ports/ChangeLog.tile
@@ -1,3 +1,7 @@
2013-08-21 Ondřej Bílka <neleai@seznam.cz>

* sysdeps/tile/jmpbuf-offsets.h: Fix typos.

2013-07-22 Chris Metcalf <cmetcalf@tilera.com>

[BZ #15759]
Expand Down
2 changes: 1 addition & 1 deletion ports/sysdeps/am33/fpu/fraiseexcpt.c
Expand Up @@ -35,7 +35,7 @@ __feraiseexcept (int excepts)
/* First: invalid exception. */
if (excepts & FE_INVALID)
{
/* One example of a invalid operation is 0 * Infinity. */
/* One example of an invalid operation is 0 * Infinity. */
float x = HUGE_VALF, y = 0.0f;
__asm__ __volatile__ ("fmul %1,%0" : "+f" (x) : "f" (y));
}
Expand Down
2 changes: 1 addition & 1 deletion ports/sysdeps/hppa/dl-lookupcfg.h
Expand Up @@ -57,7 +57,7 @@ void _dl_unmap (struct link_map *map);
})


/* The test for "addr & 2" below is to accomodate old binaries which
/* The test for "addr & 2" below is to accommodate old binaries which
violated the ELF ABI by pointing DT_INIT and DT_FINI at a function
descriptor. */
#define DL_DT_INIT_ADDRESS(map, addr) \
Expand Down
2 changes: 1 addition & 1 deletion ports/sysdeps/hppa/fpu/fraiseexcpt.c
Expand Up @@ -42,7 +42,7 @@ feraiseexcept (int excepts)
/* First: Invalid exception. */
if (excepts & FE_INVALID)
{
/* One example of a invalid operation is 0 * Infinity. */
/* One example of an invalid operation is 0 * Infinity. */
double d = HUGE_VAL;
__asm__ __volatile__ (
" fcpy,dbl %%fr0,%%fr22\n"
Expand Down
2 changes: 1 addition & 1 deletion ports/sysdeps/ia64/fpu/e_atanhl.S
Expand Up @@ -99,7 +99,7 @@
// calculation is subdivided into two stages. The first stage is
// calculating of X = 2*|x|/(1-|x|). The second one is calculating of
// sign(x)*log1pl(X)/2. To obtain required accuracy we use precise division
// algorythm output of which is a pair of two extended precision values those
// algorithm output of which is a pair of two extended precision values those
// approximate result of division with accuracy higher than working
// precision. This pair is passed to modified log1pl function.
//
Expand Down
2 changes: 1 addition & 1 deletion ports/sysdeps/ia64/fpu/e_log2l.S
Expand Up @@ -471,7 +471,7 @@ GLOBAL_IEEE754_ENTRY(log2l)
(p7) br.cond.spnt LOG2_PSEUDO_ZERO
}
{.mfi
// get T_low adress
// get T_low address
shladd r3=r28,3,r3
// if first 8 bits after leading 1 are all ones, use polynomial approx. only
(p10) fms.s1 f6=f7,f36,f1
Expand Down
4 changes: 2 additions & 2 deletions ports/sysdeps/ia64/fpu/e_logl.S
Expand Up @@ -211,7 +211,7 @@
//
// Calculate X_1 := X_0 * Z_1 truncated to lsb = 2^(-14)
// = 1.0 0 0 0 d_5 ... d_14
// This is accomplised by integer multiplication.
// This is accomplished by integer multiplication.
// It is proved that X_1 indeed always begin
// with 1.0000 in fixed point.
//
Expand All @@ -232,7 +232,7 @@
//
// Calculate X_2 := X_1 * Z_2 truncated to lsb = 2^(-14)
// = 1.0 0 0 0 0 0 0 0 d_9 d_10 ... d_14
// This is accomplised by integer multiplication.
// This is accomplished by integer multiplication.
// It is proved that X_2 indeed always begin
// with 1.00000000 in fixed point.
//
Expand Down
2 changes: 1 addition & 1 deletion ports/sysdeps/ia64/fpu/fraiseexcpt.c
Expand Up @@ -40,7 +40,7 @@ feraiseexcept (int excepts)
/* First: invalid exception. */
if (FE_INVALID & excepts)
{
/* One example of a invalid operation is 0 * Infinity. */
/* One example of an invalid operation is 0 * Infinity. */
tmp = 0;
__asm__ __volatile__ ("frcpa.s0 %0,p1=f0,f0" : "=f" (tmp) : : "p1" );
}
Expand Down
4 changes: 2 additions & 2 deletions ports/sysdeps/ia64/fpu/libm_lgammal.S
Expand Up @@ -317,7 +317,7 @@
//
// Calculate X_1 := X_0 * Z_1 truncated to lsb = 2^(-14)
// = 1.0 0 0 0 d_5 ... d_14
// This is accomplised by integer multiplication.
// This is accomplished by integer multiplication.
// It is proved that X_1 indeed always begin
// with 1.0000 in fixed point.
//
Expand All @@ -338,7 +338,7 @@
//
// Calculate X_2 := X_1 * Z_2 truncated to lsb = 2^(-14)
// = 1.0 0 0 0 0 0 0 0 d_9 d_10 ... d_14
// This is accomplised by integer multiplication.
// This is accomplished by integer multiplication.
// It is proved that X_2 indeed always begin
// with 1.00000000 in fixed point.
//
Expand Down
4 changes: 2 additions & 2 deletions ports/sysdeps/ia64/fpu/s_log1pl.S
Expand Up @@ -221,7 +221,7 @@
//
// Calculate X_1 := X_0 * Z_1 truncated to lsb = 2^(-14)
// = 1.0 0 0 0 d_5 ... d_14
// This is accomplised by integer multiplication.
// This is accomplished by integer multiplication.
// It is proved that X_1 indeed always begin
// with 1.0000 in fixed point.
//
Expand All @@ -242,7 +242,7 @@
//
// Calculate X_2 := X_1 * Z_2 truncated to lsb = 2^(-14)
// = 1.0 0 0 0 0 0 0 0 d_9 d_10 ... d_14
// This is accomplised by integer multiplication.
// This is accomplished by integer multiplication.
// It is proved that X_2 indeed always begin
// with 1.00000000 in fixed point.
//
Expand Down
2 changes: 1 addition & 1 deletion ports/sysdeps/m68k/m680x0/fpu/fraiseexcpt.c
Expand Up @@ -33,7 +33,7 @@ __feraiseexcept (int excepts)
/* First: invalid exception. */
if (excepts & FE_INVALID)
{
/* One example of a invalid operation is 0 * Infinity. */
/* One example of an invalid operation is 0 * Infinity. */
double d = HUGE_VAL;
__asm__ __volatile__ ("fmul%.s %#0r0,%0; fnop" : "=f" (d) : "0" (d));
}
Expand Down
2 changes: 1 addition & 1 deletion ports/sysdeps/tile/jmpbuf-offsets.h
Expand Up @@ -45,7 +45,7 @@
#define JB_PC 25 /* normally LR, r55 */
#define JB_ICS 26 /* interrupt critical section bit */

/* We save space for some extra state to accomodate future changes. */
/* We save space for some extra state to accommodate future changes. */
#define JB_LEN 32 /* number of words */

#define JB_SIZE (JB_LEN * REGSIZE)
Expand Down

0 comments on commit c0c3f78

Please sign in to comment.