This is the mail archive of the libc-hacker@sourceware.org mailing list for the glibc project.
Note that libc-hacker is a closed list. You may look at the archives of this list, but subscription and posting are not open.
| Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
|---|---|---|
| Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |
| Other format: | [Raw text] | |
Hi!
I ran aspell (well, as it has no --mode=ccomment, I used the ugly little
awk scripts attached below) on comments in libc *.[chS] source comments.
This is what I came up with, though as I'm not a native speaker some of the
changes below might be wrong or at least unnecessary, so if e.g. Roland
could go over the changes, it would be heartily appreciated.
I haven't creates a ChangeLog entry for this yet, as it will depend
on what files really will need changing.
--- libc/math/libm-test.inc.jj 2005-01-08 16:50:22.000000000 +0100
+++ libc/math/libm-test.inc 2005-08-18 13:42:45.000000000 +0200
@@ -22,7 +22,7 @@
This file is processed by a perl script. The resulting file has to
be included by a master file that defines:
- Makros:
+ Macros:
FUNC(function): converts general function name (like cos) to
name with correct suffix (e.g. cosl or cosf)
MATHCONST(x): like FUNC but for constants (e.g convert 0.0 to 0.0L)
--- libc/math/fenv.h.jj 2001-07-06 06:55:35.000000000 +0200
+++ libc/math/fenv.h 2005-08-18 13:37:43.000000000 +0200
@@ -25,7 +25,7 @@
#include <features.h>
-/* Get the architecture dependend definitions. The following definitions
+/* Get the architecture dependent definitions. The following definitions
are expected to be done:
fenv_t type for object representing an entire floating-point
--- libc/math/bits/mathcalls.h.jj 2004-08-04 14:42:22.000000000 +0200
+++ libc/math/bits/mathcalls.h 2005-08-18 13:37:43.000000000 +0200
@@ -285,7 +285,7 @@ __MATHCALLX (nextafter,, (_Mdouble_ __x,
__MATHCALLX (nexttoward,, (_Mdouble_ __x, long double __y), (__const__));
# endif
-/* Return the remainder of integer divison X / Y with infinite precision. */
+/* Return the remainder of integer division X / Y with infinite precision. */
__MATHCALL (remainder,, (_Mdouble_ __x, _Mdouble_ __y));
# if defined __USE_MISC || defined __USE_ISOC99
--- libc/math/tgmath.h.jj 2004-05-07 14:32:16.000000000 +0200
+++ libc/math/tgmath.h 2005-08-18 13:37:43.000000000 +0200
@@ -354,7 +354,7 @@
/* Floating-point modulo remainder of X/Y. */
#define fmod(Val1, Val2) __TGMATH_BINARY_REAL_ONLY (Val1, Val2, fmod)
-/* Round X to integral valuein floating-point format using current
+/* Round X to integral value in floating-point format using current
rounding direction, but do not raise inexact exception. */
#define nearbyint(Val) __TGMATH_UNARY_REAL_ONLY (Val, nearbyint)
@@ -402,7 +402,7 @@
#define nexttoward(Val1, Val2) \
__TGMATH_BINARY_FIRST_REAL_ONLY (Val1, Val2, nexttoward)
-/* Return the remainder of integer divison X / Y with infinite precision. */
+/* Return the remainder of integer division X / Y with infinite precision. */
#define remainder(Val1, Val2) __TGMATH_BINARY_REAL_ONLY (Val1, Val2, remainder)
/* Return X times (2 to the Nth power). */
--- libc/nptl_db/thread_dbP.h.jj 2004-05-07 14:32:23.000000000 +0200
+++ libc/nptl_db/thread_dbP.h 2005-08-18 13:37:43.000000000 +0200
@@ -30,7 +30,7 @@
#include "thread_db.h"
#include "../nptl/pthreadP.h" /* This is for *_BITMASK only. */
-/* Indeces for the symbol names. */
+/* Indices for the symbol names. */
enum
{
# define DB_STRUCT(type) SYM_SIZEOF_##type,
--- libc/nptl_db/td_thr_get_info.c.jj 2003-09-09 08:59:59.000000000 +0200
+++ libc/nptl_db/td_thr_get_info.c 2005-08-18 13:37:43.000000000 +0200
@@ -64,7 +64,7 @@ td_thr_get_info (const td_thrhandle_t *t
if (err != TD_OK)
return err;
- /* Fill in information. Clear first to provide reproducable
+ /* Fill in information. Clear first to provide reproducible
results for the fields we do not fill in. */
memset (infop, '\0', sizeof (td_thrinfo_t));
--- libc/nptl_db/thread_db.h.jj 2003-09-09 08:58:19.000000000 +0200
+++ libc/nptl_db/thread_db.h 2005-08-18 13:37:43.000000000 +0200
@@ -21,7 +21,7 @@
#define _THREAD_DB_H 1
/* This is the debugger interface for the NPTL library. It is
- modelled closely after the interface with same names in Solaris
+ modeled closely after the interface with same names in Solaris
with the goal to share the same code in the debugger. */
#include <pthread.h>
#include <stdint.h>
--- libc/nptl_db/td_thr_tsd.c.jj 2003-09-09 08:57:51.000000000 +0200
+++ libc/nptl_db/td_thr_tsd.c 2005-08-18 13:37:43.000000000 +0200
@@ -48,7 +48,7 @@ td_thr_tsd (const td_thrhandle_t *th, co
if (err != TD_OK)
return err;
- /* Compute the indeces. */
+ /* Compute the indices. */
pthread_key_2ndlevel_size
= DB_DESC_NELEM (th->th_ta_p->ta_field_pthread_key_data_level2_data);
idx1st = tk / pthread_key_2ndlevel_size;
--- libc/posix/tst-spawn.c.jj 2001-07-06 06:55:38.000000000 +0200
+++ libc/posix/tst-spawn.c 2005-08-18 13:37:44.000000000 +0200
@@ -181,7 +181,7 @@ do_test (int argc, char *argv[])
+ file descriptor number which is supposed to be closed
+ the open file descriptor
+ the newly opened file descriptor
- + thhe duped second descriptor
+ + the duped second descriptor
+ the name of the closed descriptor
*/
if (argc != (restart ? 6 : 5))
--- libc/posix/fnmatch.c.jj 2005-04-13 21:29:18.000000000 +0200
+++ libc/posix/fnmatch.c 2005-08-18 13:37:44.000000000 +0200
@@ -41,7 +41,7 @@
# include <stdlib.h>
#endif
-/* For platform which support the ISO C amendement 1 functionality we
+/* For platform which support the ISO C amendment 1 functionality we
support user defined character classes. */
#if defined _LIBC || (defined HAVE_WCTYPE_H && defined HAVE_WCHAR_H)
/* Solaris 2.5 has a bug: <wchar.h> must be included before <wctype.h>. */
@@ -111,7 +111,7 @@ extern int fnmatch (const char *pattern,
# if defined _LIBC || (defined HAVE_WCTYPE_H && defined HAVE_WCHAR_H)
/* The GNU C library provides support for user-defined character classes
- and the functions from ISO C amendement 1. */
+ and the functions from ISO C amendment 1. */
# ifdef CHARCLASS_NAME_MAX
# define CHAR_CLASS_MAX_LENGTH CHARCLASS_NAME_MAX
# else
--- libc/posix/regex_internal.h.jj 2005-05-20 10:35:53.000000000 +0200
+++ libc/posix/regex_internal.h 2005-08-18 13:37:44.000000000 +0200
@@ -122,7 +122,7 @@
extern const char __re_error_msgid[] attribute_hidden;
extern const size_t __re_error_msgid_idx[] attribute_hidden;
-/* Number of bits in an unsinged int. */
+/* Number of bits in an unsigned int. */
#define UINT_BITS (sizeof (unsigned int) * BYTE_BITS)
/* Number of unsigned int in an bit_set. */
#define BITSET_UINTS ((SBC_MAX + UINT_BITS - 1) / UINT_BITS)
--- libc/posix/confstr.c.jj 2004-12-14 10:29:32.000000000 +0100
+++ libc/posix/confstr.c 2005-08-18 13:37:44.000000000 +0200
@@ -48,7 +48,7 @@ confstr (name, buf, len)
case _CS_V6_WIDTH_RESTRICTED_ENVS:
/* We have to return a newline-separated list of named of
- programming environements in which the widths of blksize_t,
+ programming environments in which the widths of blksize_t,
cc_t, mode_t, nfds_t, pid_t, ptrdiff_t, size_t, speed_t,
ssize_t, suseconds_t, tcflag_t, useconds_t, wchar_t, and
wint_t types are no greater than the width of type long.
--- libc/posix/tst-exec.c.jj 2001-07-06 06:55:38.000000000 +0200
+++ libc/posix/tst-exec.c 2005-08-18 13:37:43.000000000 +0200
@@ -135,7 +135,7 @@ do_test (int argc, char *argv[])
- three parameters left if called through re-execution
+ file descriptor number which is supposed to be closed
+ the open file descriptor
- + the name of the closed desriptor
+ + the name of the closed descriptor
*/
if (restart)
--- libc/posix/regcomp.c.jj 2005-07-11 09:51:15.000000000 +0200
+++ libc/posix/regcomp.c 2005-08-18 13:37:44.000000000 +0200
@@ -2110,7 +2110,7 @@ peek_token_bracket (token, input, syntax
/* Entry point of the parser.
Parse the regular expression REGEXP and return the structure tree.
- If an error is occured, ERR is set by error code, and return NULL.
+ If an error is occurred, ERR is set by error code, and return NULL.
This function build the following tree, from regular expression <reg_exp>:
CAT
/ \
@@ -2652,7 +2652,7 @@ parse_dup_op (elem, regexp, dfa, token,
Build the range expression which starts from START_ELEM, and ends
at END_ELEM. The result are written to MBCSET and SBCSET.
RANGE_ALLOC is the allocated size of mbcset->range_starts, and
- mbcset->range_ends, is a pointer argument sinse we may
+ mbcset->range_ends, is a pointer argument since we may
update it. */
static reg_errcode_t
@@ -2816,8 +2816,8 @@ parse_bracket_exp (regexp, dfa, token, s
const int32_t *symb_table;
const unsigned char *extra;
- /* Local function for parse_bracket_exp used in _LIBC environement.
- Seek the collating symbol entry correspondings to NAME.
+ /* Local function for parse_bracket_exp used in _LIBC environment.
+ Seek the collating symbol entry corresponding to NAME.
Return the index of the symbol in the SYMB_TABLE. */
auto inline int32_t
@@ -2849,7 +2849,7 @@ parse_bracket_exp (regexp, dfa, token, s
return elem;
}
- /* Local function for parse_bracket_exp used in _LIBC environement.
+ /* Local function for parse_bracket_exp used in _LIBC environment.
Look up the collation sequence value of BR_ELEM.
Return the value if succeeded, UINT_MAX otherwise. */
@@ -2914,11 +2914,11 @@ parse_bracket_exp (regexp, dfa, token, s
return UINT_MAX;
}
- /* Local function for parse_bracket_exp used in _LIBC environement.
+ /* Local function for parse_bracket_exp used in _LIBC environment.
Build the range expression which starts from START_ELEM, and ends
at END_ELEM. The result are written to MBCSET and SBCSET.
RANGE_ALLOC is the allocated size of mbcset->range_starts, and
- mbcset->range_ends, is a pointer argument sinse we may
+ mbcset->range_ends, is a pointer argument since we may
update it. */
auto inline reg_errcode_t
@@ -2998,11 +2998,11 @@ parse_bracket_exp (regexp, dfa, token, s
return REG_NOERROR;
}
- /* Local function for parse_bracket_exp used in _LIBC environement.
+ /* Local function for parse_bracket_exp used in _LIBC environment.
Build the collating element which is represented by NAME.
The result are written to MBCSET and SBCSET.
COLL_SYM_ALLOC is the allocated size of mbcset->coll_sym, is a
- pointer argument sinse we may update it. */
+ pointer argument since we may update it. */
auto inline reg_errcode_t
__attribute ((always_inline))
@@ -3449,7 +3449,7 @@ parse_bracket_symbol (elem, regexp, toke
Build the equivalence class which is represented by NAME.
The result are written to MBCSET and SBCSET.
EQUIV_CLASS_ALLOC is the allocated size of mbcset->equiv_classes,
- is a pointer argument sinse we may update it. */
+ is a pointer argument since we may update it. */
static reg_errcode_t
#ifdef RE_ENABLE_I18N
@@ -3488,7 +3488,7 @@ build_equiv_class (sbcset, name)
/* This isn't a valid character. */
return REG_ECOLLATE;
- /* Build single byte matcing table for this equivalence class. */
+ /* Build single byte matching table for this equivalence class. */
char_buf[1] = (unsigned char) '\0';
len = weights[idx1];
for (ch = 0; ch < SBC_MAX; ++ch)
@@ -3544,7 +3544,7 @@ build_equiv_class (sbcset, name)
Build the character class which is represented by NAME.
The result are written to MBCSET and SBCSET.
CHAR_CLASS_ALLOC is the allocated size of mbcset->char_classes,
- is a pointer argument sinse we may update it. */
+ is a pointer argument since we may update it. */
static reg_errcode_t
#ifdef RE_ENABLE_I18N
@@ -3744,7 +3744,7 @@ build_charclass_op (dfa, trans, class_na
/* This is intended for the expressions like "a{1,3}".
Fetch a number from `input', and return the number.
Return -1, if the number field is empty like "{,1}".
- Return -2, If an error is occured. */
+ Return -2, If an error is occurred. */
static int
fetch_number (input, token, syntax)
--- libc/posix/fnmatch_loop.c.jj 2004-12-06 12:40:56.000000000 +0100
+++ libc/posix/fnmatch_loop.c 2005-08-18 13:37:43.000000000 +0200
@@ -389,7 +389,7 @@ FCT (pattern, string, string_end, no_lea
{
/* We found a table entry. Now see whether the
character we are currently at has the same
- equivalance class value. */
+ equivalence class value. */
int len = weights[idx];
int32_t idx2;
const UCHAR *np = (const UCHAR *) n;
--- libc/posix/regexec.c.jj 2005-05-20 10:49:34.000000000 +0200
+++ libc/posix/regexec.c 2005-08-18 13:37:44.000000000 +0200
@@ -287,7 +287,7 @@ compat_symbol (libc, __compat_regexec, r
concerned.
If REGS is not NULL, and BUFP->no_sub is not set, the offsets of the match
- and all groups is stroed in REGS. (For the "_2" variants, the offsets are
+ and all groups is stored in REGS. (For the "_2" variants, the offsets are
computed relative to the concatenation, not relative to the individual
strings.)
@@ -456,7 +456,7 @@ re_search_stub (bufp, string, length, st
rval = 0;
- /* I hope we needn't fill ther regs with -1's when no match was found. */
+ /* I hope we needn't fill their regs with -1's when no match was found. */
if (result != REG_NOERROR)
rval = -1;
else if (regs != NULL)
@@ -597,7 +597,7 @@ re_exec (s)
/* Searches for a compiled pattern PREG in the string STRING, whose
length is LENGTH. NMATCH, PMATCH, and EFLAGS have the same
- mingings with regexec. START, and RANGE have the same meanings
+ meanings with regexec. START, and RANGE have the same meanings
with re_search.
Return REG_NOERROR if we find a match, and REG_NOMATCH if not,
otherwise return the error code.
@@ -1049,7 +1049,7 @@ acquire_init_state_context (err, mctx, i
FL_LONGEST_MATCH means we want the POSIX longest matching.
If P_MATCH_FIRST is not NULL, and the match fails, it is set to the
next place where we may want to try matching.
- Note that the matcher assume that the maching starts from the current
+ Note that the matcher assume that the matching starts from the current
index of the buffer. */
static int
@@ -2212,7 +2212,7 @@ sift_states_iter_mb (mctx, sctx, node_id
dfa->nexts[node_idx]))
/* The node can't accept the `multi byte', or the
destination was already thrown away, then the node
- could't accept the current input `multi byte'. */
+ couldn't accept the current input `multi byte'. */
naccepted = 0;
/* Otherwise, it is sure that the node could accept
`naccepted' bytes input. */
@@ -2397,7 +2397,7 @@ find_recover_state (err, mctx)
/* From the node set CUR_NODES, pick up the nodes whose types are
OP_OPEN_SUBEXP and which have corresponding back references in the regular
expression. And register them to use them later for evaluating the
- correspoding back references. */
+ corresponding back references. */
static reg_errcode_t
check_subexp_matching_top (mctx, cur_nodes, str_idx)
@@ -3325,7 +3325,7 @@ build_trtable (dfa, state)
}
dests_ch = (bitset *) (dests_node + SBC_MAX);
- /* Initialize transiton table. */
+ /* Initialize transition table. */
state->word_trtable = state->trtable = NULL;
/* At first, group all nodes belonging to `state' into several
@@ -4067,7 +4067,7 @@ extend_buffers (mctx)
reg_errcode_t ret;
re_string_t *pstr = &mctx->input;
- /* Double the lengthes of the buffers. */
+ /* Double the lengths of the buffers. */
ret = re_string_realloc_buffers (pstr, pstr->bufs_len * 2);
if (BE (ret != REG_NOERROR, 0))
return ret;
--- libc/posix/regex_internal.c.jj 2005-07-11 09:51:15.000000000 +0200
+++ libc/posix/regex_internal.c 2005-08-18 13:37:44.000000000 +0200
@@ -1199,7 +1199,7 @@ re_node_set_merge (dest, src)
/* Insert the new element ELEM to the re_node_set* SET.
SET should not already have ELEM.
- return -1 if an error is occured, return 1 otherwise. */
+ return -1 if an error is occurred, return 1 otherwise. */
static int
re_node_set_insert (set, elem)
@@ -1257,7 +1257,7 @@ re_node_set_insert (set, elem)
/* Insert the new element ELEM to the re_node_set* SET.
SET should not already have any element greater than or equal to ELEM.
- Return -1 if an error is occured, return 1 otherwise. */
+ Return -1 if an error is occurred, return 1 otherwise. */
static int
re_node_set_insert_last (set, elem)
@@ -1335,7 +1335,7 @@ re_node_set_remove_at (set, idx)
/* Add the token TOKEN to dfa->nodes, and return the index of the token.
- Or return -1, if an error will be occured. */
+ Or return -1, if an error will be occurred. */
static int
re_dfa_add_node (dfa, token)
@@ -1526,7 +1526,7 @@ register_state (dfa, newstate, hash)
return REG_NOERROR;
}
-/* Create the new state which is independ of contexts.
+/* Create the new state which is independent of contexts.
Return the new state if succeeded, otherwise return NULL. */
static re_dfastate_t *
--- libc/posix/globtest.c.jj 2001-07-06 06:55:38.000000000 +0200
+++ libc/posix/globtest.c 2005-08-18 13:37:44.000000000 +0200
@@ -107,7 +107,7 @@ main (int argc, char *argv[])
if ((glob_flags & GLOB_DOOFFS) && g.gl_pathv[0] == NULL)
g.gl_pathv[0] = (char *) "abc";
- /* Print out the names. Unless otherwise specified, qoute them. */
+ /* Print out the names. Unless otherwise specified, quote them. */
if (g.gl_pathv)
{
for (i = 0; i < g.gl_offs + g.gl_pathc; ++i)
--- libc/malloc/malloc.c.jj 2005-04-13 21:28:37.000000000 +0200
+++ libc/malloc/malloc.c 2005-08-18 13:37:44.000000000 +0200
@@ -311,7 +311,7 @@ extern "C" {
is fairly extensive, and will slow down execution
noticeably. Calling malloc_stats or mallinfo with MALLOC_DEBUG set
will attempt to check every non-mmapped allocated and free chunk in
- the course of computing the summmaries. (By nature, mmapped regions
+ the course of computing the summaries. (By nature, mmapped regions
cannot be checked very much automatically.)
Setting MALLOC_DEBUG may also be helpful if you are trying to modify
@@ -799,7 +799,7 @@ extern Void_t* sbrk();
there's no compelling reason to bother to do this.)
The main declaration needed is the mallinfo struct that is returned
- (by-copy) by mallinfo(). The SVID/XPG malloinfo struct contains a
+ (by-copy) by mallinfo(). The SVID/XPG mallinfo struct contains a
bunch of fields that are not even meaningful in this version of
malloc. These fields are are instead filled by mallinfo() with
other numbers that might be of interest.
@@ -831,7 +831,7 @@ extern Void_t* sbrk();
if no space is available. Additionally, on failure, errno is
set to ENOMEM on ANSI C systems.
- If n is zero, malloc returns a minumum-sized chunk. (The minimum
+ If n is zero, malloc returns a minimum-sized chunk. (The minimum
size is 16 bytes on most 32bit systems, and 24 or 32 bytes on 64bit
systems.) On most systems, size_t is an unsigned type, so calls
with negative arguments are interpreted as requests for huge amounts
@@ -1180,7 +1180,7 @@ void public_cFREe();
Malloc_trim returns 1 if it actually released any memory, else 0.
On systems that do not support "negative sbrks", it will always
- rreturn 0.
+ return 0.
*/
#if __STD_C
int public_mTRIm(size_t);
@@ -1332,7 +1332,7 @@ int __posix_memalign(void **, size_
might set to a value close to the average size of a process
(program) running on your system. Releasing this much memory
would allow such a process to run in memory. Generally, it's
- worth it to tune for trimming rather tham memory mapping when a
+ worth it to tune for trimming rather than memory mapping when a
program undergoes phases where several large chunks are
allocated and released in ways that can reuse each other's
storage, perhaps mixed with phases where there are no such
@@ -1737,7 +1737,7 @@ nextchunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-
the malloc code, but "mem" is the pointer that is returned to the
user. "Nextchunk" is the beginning of the next contiguous chunk.
- Chunks always begin on even word boundries, so the mem portion
+ Chunks always begin on even word boundaries, so the mem portion
(which is returned to the user) is also on an even word boundary, and
thus at least double-word aligned.
@@ -1947,7 +1947,7 @@ nextchunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-
and consolidated sets of chunks, which is what these bins hold, so
they can be found quickly. All procedures maintain the invariant
that no consolidated chunk physically borders another one, so each
- chunk in a list is known to be preceeded and followed by either
+ chunk in a list is known to be preceded and followed by either
inuse chunks or the ends of memory.
Chunks in bins are kept in size order, with ties going to the
@@ -4190,7 +4190,7 @@ _int_malloc(mstate av, size_t bytes)
We require that av->top always exists (i.e., has size >=
MINSIZE) after initialization, so if it would otherwise be
- exhuasted by current request, it is replenished. (The main
+ exhausted by current request, it is replenished. (The main
reason for ensuring it exists is that we may need MINSIZE space
to put in fenceposts in sysmalloc.)
*/
--- libc/malloc/mcheck.c.jj 2004-09-09 22:35:50.000000000 +0200
+++ libc/malloc/mcheck.c 2005-08-18 13:37:44.000000000 +0200
@@ -62,7 +62,7 @@ static struct hdr *root;
static int mcheck_used;
-/* Nonzero if pedentic checking of all blocks is requested. */
+/* Nonzero if pedantic checking of all blocks is requested. */
static int pedantic;
#if defined _LIBC || defined STDC_HEADERS || defined USG
--- libc/malloc/memusage.c.jj 2004-08-14 18:18:33.000000000 +0200
+++ libc/malloc/memusage.c 2005-08-18 13:37:44.000000000 +0200
@@ -523,7 +523,7 @@ free (void *ptr)
}
-/* `mmap' replacement. We do not have to keep track of the sizesince
+/* `mmap' replacement. We do not have to keep track of the size since
`munmap' will get it as a parameter. */
void *
mmap (void *start, size_t len, int prot, int flags, int fd, off_t offset)
@@ -575,7 +575,7 @@ mmap (void *start, size_t len, int prot,
}
-/* `mmap' replacement. We do not have to keep track of the sizesince
+/* `mmap' replacement. We do not have to keep track of the size since
`munmap' will get it as a parameter. */
void *
mmap64 (void *start, size_t len, int prot, int flags, int fd, off64_t offset)
@@ -627,7 +627,7 @@ mmap64 (void *start, size_t len, int pro
}
-/* `mmap' replacement. We do not have to keep track of the sizesince
+/* `mmap' replacement. We do not have to keep track of the size since
`munmap' will get it as a parameter. */
void *
mremap (void *start, size_t old_len, size_t len, int flags)
@@ -802,7 +802,7 @@ dest (void)
calls[idx_munmap], total[idx_munmap],
failed[idx_munmap] ? "\e[01;41m" : "", failed[idx_munmap]);
- /* Write out a histoogram of the sizes of the allocations. */
+ /* Write out a histogram of the sizes of the allocations. */
fprintf (stderr, "\e[01;32mHistogram for block sizes:\e[0;0m\n");
/* Determine the maximum of all calls for each size range. */
--- libc/streams/stropts.h.jj 2003-04-19 18:48:35.000000000 +0200
+++ libc/streams/stropts.h 2005-08-18 13:37:44.000000000 +0200
@@ -35,7 +35,7 @@ typedef __uid_t uid_t;
typedef __t_uscalar_t t_uscalar_t;
-/* Get system specific contants. */
+/* Get system specific constants. */
#include <bits/stropts.h>
--- libc/dlfcn/dlfcn.h.jj 2004-11-26 10:16:26.000000000 +0100
+++ libc/dlfcn/dlfcn.h 2005-08-18 13:37:44.000000000 +0200
@@ -41,7 +41,7 @@
# define RTLD_DEFAULT ((void *) 0)
-/* Type for namespace indeces. */
+/* Type for namespace indices. */
typedef long int Lmid_t;
/* Special namespace ID values. */
--- libc/dlfcn/dlerror.c.jj 2005-06-22 18:34:11.000000000 +0200
+++ libc/dlfcn/dlerror.c 2005-08-18 13:37:44.000000000 +0200
@@ -191,7 +191,7 @@ check_free (struct dl_action_result *rec
{
/* We can free the string only if the allocation happened in the
C library used by the dynamic linker. This means, it is
- always the C library in the base namespave. */
+ always the C library in the base namespace. */
struct link_map *map = NULL;
Dl_info info;
if (_dl_addr (check_free, &info, &map, NULL) != 0
--- libc/inet/netinet/igmp.h.jj 2003-05-15 02:29:21.000000000 +0200
+++ libc/inet/netinet/igmp.h 2005-08-18 13:37:44.000000000 +0200
@@ -110,7 +110,7 @@ struct igmp {
#define IGMP_v2_ROUTER 2
/*
- * The following four defininitions are for backwards compatibility.
+ * The following four definitions are for backwards compatibility.
* They should be removed as soon as all applications are updated to
* use the new constant names.
*/
--- libc/inet/protocols/timed.h.jj 1999-06-08 23:02:54.000000000 +0200
+++ libc/inet/protocols/timed.h 2005-08-18 13:37:44.000000000 +0200
@@ -60,7 +60,7 @@ struct tsp {
*/
#define TSP_ANY 0 /* match any types */
#define TSP_ADJTIME 1 /* send adjtime */
-#define TSP_ACK 2 /* generic acknowledgement */
+#define TSP_ACK 2 /* generic acknowledgment */
#define TSP_MASTERREQ 3 /* ask for master's name */
#define TSP_MASTERACK 4 /* acknowledge master request */
#define TSP_SETTIME 5 /* send network time */
--- libc/inet/rexec.c.jj 2005-02-21 17:19:38.000000000 +0100
+++ libc/inet/rexec.c 2005-08-18 13:37:44.000000000 +0200
@@ -153,7 +153,7 @@ retry:
struct iovec iov[3] =
{
[0] = { .iov_base = (void *) name, .iov_len = strlen (name) + 1 },
- /* should public key encypt the password here */
+ /* should public key encrypt the password here */
[1] = { .iov_base = (void *) pass, .iov_len = strlen (pass) + 1 },
[2] = { .iov_base = (void *) cmd, .iov_len = strlen (cmd) + 1 }
};
--- libc/inet/rcmd.c.jj 2005-07-28 15:57:01.000000000 +0200
+++ libc/inet/rcmd.c 2005-08-18 13:37:44.000000000 +0200
@@ -475,7 +475,7 @@ iruserfopen (const char *file, uid_t oku
FILE *res = NULL;
/* If not a regular file, if owned by someone other than user or
- root, if writeable by anyone but the owner, or if hardlinked
+ root, if writable by anyone but the owner, or if hardlinked
anywhere, quit. */
cp = NULL;
if (__lxstat64 (_STAT_VER, file, &st))
--- libc/inet/arpa/inet.h.jj 2004-08-04 14:15:58.000000000 +0200
+++ libc/inet/arpa/inet.h 2005-08-18 13:37:44.000000000 +0200
@@ -46,7 +46,7 @@ extern struct in_addr inet_makeaddr (in_
extern in_addr_t inet_netof (struct in_addr __in) __THROW;
/* Extract the network number in network byte order from the address
- in numbers-and-dots natation starting at CP. */
+ in numbers-and-dots notation starting at CP. */
extern in_addr_t inet_network (__const char *__cp) __THROW;
/* Convert Internet number in IN to ASCII representation. The return value
@@ -61,7 +61,7 @@ extern int inet_pton (int __af, __const
/* Convert a Internet address in binary network format for interface
type AF in buffer starting at CP to presentation form and place
- result in buffer of length LEN astarting at BUF. */
+ result in buffer of length LEN starting at BUF. */
extern __const char *inet_ntop (int __af, __const void *__restrict __cp,
char *__restrict __buf, socklen_t __len)
__THROW;
@@ -78,7 +78,7 @@ extern int inet_aton (__const char *__cp
extern char *inet_neta (in_addr_t __net, char *__buf, size_t __len) __THROW;
/* Convert network number for interface type AF in buffer starting at
- CP to presentation format. The result will specifiy BITS bits of
+ CP to presentation format. The result will specify BITS bits of
the number. */
extern char *inet_net_ntop (int __af, __const void *__cp, int __bits,
char *__buf, size_t __len) __THROW;
--- libc/inet/arpa/tftp.h.jj 1999-06-11 23:27:12.000000000 +0200
+++ libc/inet/arpa/tftp.h 2005-08-18 13:37:44.000000000 +0200
@@ -43,7 +43,7 @@
#define RRQ 01 /* read request */
#define WRQ 02 /* write request */
#define DATA 03 /* data packet */
-#define ACK 04 /* acknowledgement */
+#define ACK 04 /* acknowledgment */
#define ERROR 05 /* error code */
struct tftphdr {
--- libc/nis/nis_ismember.c.jj 2001-07-06 06:55:36.000000000 +0200
+++ libc/nis/nis_ismember.c 2005-08-18 13:37:44.000000000 +0200
@@ -23,7 +23,7 @@
/* internal_nis_ismember ()
return codes: -1 principal is in -group
0 principal isn't in any group
- 1 pirncipal is in group */
+ 1 principal is in group */
static int
internal_ismember (const_nis_name principal, const_nis_name group)
{
--- libc/nis/rpcsvc/nis_tags.h.jj 1997-12-28 16:02:26.000000000 +0100
+++ libc/nis/rpcsvc/nis_tags.h 2005-08-18 13:37:44.000000000 +0200
@@ -31,7 +31,7 @@ extern "C" {
#define ALL_RESULTS (1<<3) /* Retrieve all results */
#define NO_CACHE (1<<4) /* Do not return 'cached' results */
#define MASTER_ONLY (1<<5) /* Get value only from master server */
-#define EXPAND_NAME (1<<6) /* Expand partitially qualified names */
+#define EXPAND_NAME (1<<6) /* Expand partially qualified names */
/* Semantic modification for table operations flags */
#define RETURN_RESULT (1<<7) /* Return resulting object to client */
--- libc/nis/rpcsvc/nis.h.jj 1999-12-31 19:47:09.000000000 +0100
+++ libc/nis/rpcsvc/nis.h 2005-08-18 13:37:44.000000000 +0200
@@ -469,7 +469,7 @@ typedef struct fd_result fd_result;
#define NIS_NOBODY(a, m) (((a) & ((m) << 24)) != 0)
/*
* EOL Alert - The following non-prefixed test macros are
- * here for backward compatability, and will be not be present
+ * here for backward compatibility, and will be not be present
* in future releases - use the NIS_*() macros above.
*/
#define WORLD(a, m) (((a) & (m)) != 0)
--- libc/nis/nis_print.c.jj 2004-11-01 13:25:30.000000000 +0100
+++ libc/nis/nis_print.c 2005-08-18 13:37:44.000000000 +0200
@@ -290,7 +290,7 @@ nis_print_link (const link_obj *obj)
fputs (_("Linked Object Type : "), stdout);
nis_print_objtype (obj->li_rtype);
printf (_("Linked to : %s\n"), obj->li_name);
- /* XXX Print the attributs here, if they exists */
+ /* XXX Print the attributes here, if they exists */
}
libnsl_hidden_def (nis_print_link)
--- libc/nis/nss_compat/compat-spwd.c.jj 2005-07-11 09:51:13.000000000 +0200
+++ libc/nis/nss_compat/compat-spwd.c 2005-08-18 13:37:44.000000000 +0200
@@ -396,7 +396,7 @@ getspent_next_nss (struct spwd *result,
return NSS_STATUS_SUCCESS;
}
-/* This function handle the +user entrys in /etc/shadow */
+/* This function handle the +user entrees in /etc/shadow */
static enum nss_status
getspnam_plususer (const char *name, struct spwd *result, ent_t *ent,
char *buffer, size_t buflen, int *errnop)
--- libc/nis/nss_compat/compat-pwd.c.jj 2005-07-11 09:51:13.000000000 +0200
+++ libc/nis/nss_compat/compat-pwd.c 2005-08-18 13:37:44.000000000 +0200
@@ -448,7 +448,7 @@ getpwent_next_nss (struct passwd *result
return NSS_STATUS_SUCCESS;
}
-/* This function handle the +user entrys in /etc/passwd */
+/* This function handle the +user entries in /etc/passwd */
static enum nss_status
getpwnam_plususer (const char *name, struct passwd *result, ent_t *ent,
char *buffer, size_t buflen, int *errnop)
--- libc/nis/nss_compat/compat-grp.c.jj 2005-07-11 09:51:12.000000000 +0200
+++ libc/nis/nss_compat/compat-grp.c 2005-08-18 13:37:44.000000000 +0200
@@ -221,7 +221,7 @@ getgrent_next_nss (struct group *result,
return NSS_STATUS_SUCCESS;
}
-/* This function handle the +group entrys in /etc/group */
+/* This function handle the +group entries in /etc/group */
static enum nss_status
getgrnam_plusgroup (const char *name, struct group *result, ent_t *ent,
char *buffer, size_t buflen, int *errnop)
--- libc/nis/ypclnt.c.jj 2005-04-13 21:28:39.000000000 +0200
+++ libc/nis/ypclnt.c 2005-08-18 13:37:44.000000000 +0200
@@ -672,7 +672,7 @@ __xdr_ypresp_all (XDR *xdrs, struct ypre
objp->status = resp.ypresp_all_u.val.stat;
xdr_free ((xdrproc_t) xdr_ypresp_all, (char *) &resp);
/* Sun says we don't need to make this call, but must return
- immediatly. Since Solaris makes this call, we will call
+ immediately. Since Solaris makes this call, we will call
the callback function, too. */
(*objp->foreach) (objp->status, NULL, 0, NULL, 0, objp->data);
return TRUE;
--- libc/nis/nis_checkpoint.c.jj 2001-07-06 06:55:36.000000000 +0200
+++ libc/nis/nis_checkpoint.c 2005-08-18 13:37:44.000000000 +0200
@@ -44,7 +44,7 @@ nis_checkpoint(const_nis_name dirname)
return res2;
}
- /* Check if obj is really a diryectory object */
+ /* Check if obj is really a directory object */
if (__type_of (NIS_RES_OBJECT (res2)) != NIS_DIRECTORY_OBJ)
{
nis_freeresult (res2);
--- libc/nis/nis_ping.c.jj 2001-07-06 06:55:36.000000000 +0200
+++ libc/nis/nis_ping.c 2005-08-18 13:37:44.000000000 +0200
@@ -48,7 +48,7 @@ nis_ping (const_nis_name dirname, unsign
else
obj = (nis_object *) dirobj;
- /* Check if obj is really a diryectory object */
+ /* Check if obj is really a directory object */
if (__type_of (obj) != NIS_DIRECTORY_OBJ)
{
if (res != NULL)
--- libc/iconvdata/iso-2022-jp-3.c.jj 2004-08-04 14:15:56.000000000 +0200
+++ libc/iconvdata/iso-2022-jp-3.c 2005-08-18 13:37:45.000000000 +0200
@@ -135,7 +135,7 @@ enum
/* Since we might have to reset input pointer we must be able to save
- and retore the state. */
+ and restore the state. */
#define SAVE_RESET_STATE(Save) \
if (Save) \
saved_state = *statep; \
--- libc/iconvdata/jis0208.h.jj 2005-02-08 17:17:04.000000000 +0100
+++ libc/iconvdata/jis0208.h 2005-08-18 13:37:45.000000000 +0200
@@ -24,7 +24,7 @@
#include <gconv.h>
#include <stdint.h>
-/* Struct for table with indeces in UCS mapping table. */
+/* Struct for table with indices in UCS mapping table. */
struct jisx0208_ucs_idx
{
uint16_t start;
--- libc/iconvdata/iso646.c.jj 2002-06-28 23:13:14.000000000 +0200
+++ libc/iconvdata/iso646.c 2005-08-18 13:37:45.000000000 +0200
@@ -20,7 +20,7 @@
/* The implementation of the conversion which can be performed by this
module are not very sophisticated and not tuned at all. There are
- zillions of ISO 646 derivates and supporting them all in a separate
+ zillions of ISO 646 derivatives and supporting them all in a separate
module is overkill since these coded character sets are hardly ever
used anymore (except ANSI_X3.4-1968 == ASCII, which is compatible
with ISO 8859-1). The European variants are superceded by the
--- libc/iconvdata/gbbig5.c.jj 2002-12-02 23:33:55.000000000 +0100
+++ libc/iconvdata/gbbig5.c 2005-08-18 13:37:45.000000000 +0200
@@ -23,7 +23,7 @@
#include <stdint.h>
/*
- * This module does convertions between gb2312 and big5 encodings.
+ * This module does conversions between gb2312 and big5 encodings.
* It is necessary because gb2312 encoding use simplified chinese,
* while big5 use traditional one. Often times both the simplified
* version of a chinese character and its traditional counterpart
--- libc/iconvdata/ibm937.c.jj 2002-06-28 23:21:25.000000000 +0200
+++ libc/iconvdata/ibm937.c 2005-08-18 13:37:45.000000000 +0200
@@ -76,7 +76,7 @@
/* Since we might have to reset input pointer we must be able to save
- and retore the state. */
+ and restore the state. */
#define SAVE_RESET_STATE(Save) \
if (Save) \
save_curcs = *curcsp; \
--- libc/iconvdata/ibm935.c.jj 2002-06-28 23:21:25.000000000 +0200
+++ libc/iconvdata/ibm935.c 2005-08-18 13:37:45.000000000 +0200
@@ -76,7 +76,7 @@
/* Since we might have to reset input pointer we must be able to save
- and retore the state. */
+ and restore the state. */
#define SAVE_RESET_STATE(Save) \
if (Save) \
save_curcs = *curcsp; \
--- libc/iconvdata/iso-2022-jp.c.jj 2002-06-28 23:13:11.000000000 +0200
+++ libc/iconvdata/iso-2022-jp.c 2005-08-18 13:37:45.000000000 +0200
@@ -250,7 +250,7 @@ gconv_end (struct __gconv_step *data)
/* Since we might have to reset input pointer we must be able to save
- and retore the state. */
+ and restore the state. */
#define SAVE_RESET_STATE(Save) \
if (Save) \
save_set = *setp; \
@@ -272,7 +272,7 @@ gconv_end (struct __gconv_step *data)
if (__builtin_expect (ch, 0) == ESC) \
{ \
/* We now must be prepared to read two to three more \
- chracters. If we have a match in the first character but \
+ characters. If we have a match in the first character but \
then the input buffer ends we terminate with an error since \
we must not risk missing an escape sequence just because it \
is not entirely in the current input buffer. */ \
@@ -680,7 +680,7 @@ static const cvlist_t conversion_lists[4
the character is unknown. \
The CJK character sets partially overlap when seen as subsets \
of ISO 10646; therefore there is no single correct result. \
- We use a preferrence order which depends on the language tag. */ \
+ We use a preference order which depends on the language tag. */ \
\
if (ch <= 0x7f) \
{ \
--- libc/iconvdata/ibm930.c.jj 2002-06-28 23:19:37.000000000 +0200
+++ libc/iconvdata/ibm930.c 2005-08-18 13:37:45.000000000 +0200
@@ -76,7 +76,7 @@
/* Since we might have to reset input pointer we must be able to save
- and retore the state. */
+ and restore the state. */
#define SAVE_RESET_STATE(Save) \
if (Save) \
save_curcs = *curcsp; \
@@ -84,7 +84,7 @@
*curcsp = save_curcs
-/* Current codeset type. */
+/* Current code set type. */
enum
{
sb = 0,
--- libc/iconvdata/ibm933.c.jj 2002-06-28 23:20:20.000000000 +0200
+++ libc/iconvdata/ibm933.c 2005-08-18 13:37:45.000000000 +0200
@@ -76,7 +76,7 @@
/* Since we might have to reset input pointer we must be able to save
- and retore the state. */
+ and restore the state. */
#define SAVE_RESET_STATE(Save) \
if (Save) \
save_curcs = *curcsp; \
--- libc/iconvdata/jis0208.c.jj 2002-12-17 02:29:56.000000000 +0100
+++ libc/iconvdata/jis0208.c 2005-08-18 13:37:45.000000000 +0200
@@ -1860,7 +1860,7 @@ const char __jisx0208_from_ucs4_greek[0x
/* The mapping of all the other UCS values is quite difficult since they
are distributed from 0x2010 upto to 0xffe5. There are many gaps with
unpredictable place and size. Therefore we use a table which maps
- ranges to idexes in a table. This table ca be generated with:
+ ranges to indexes in a table. This table ca be generated with:
egrep '^0x' < .../eastasia/jis/jis0208.txt | awk '{ print $3, $2}' |
egrep '^0x[^01]' | sort -u | perl tab.pl
--- libc/iconvdata/jis0212.h.jj 2003-06-11 23:40:42.000000000 +0200
+++ libc/iconvdata/jis0212.h 2005-08-18 13:37:45.000000000 +0200
@@ -25,7 +25,7 @@
#include <stdint.h>
-/* Struct for table with indeces in mapping table. */
+/* Struct for table with indices in mapping table. */
struct jisx0212_idx
{
uint16_t start;
--- libc/iconvdata/iso-2022-cn-ext.c.jj 2004-03-08 12:01:44.000000000 +0100
+++ libc/iconvdata/iso-2022-cn-ext.c 2005-08-18 13:37:45.000000000 +0200
@@ -154,7 +154,7 @@ enum
/* Since we might have to reset input pointer we must be able to save
- and retore the state. */
+ and restore the state. */
#define SAVE_RESET_STATE(Save) \
if (Save) \
save_set = *setp; \
--- libc/iconvdata/gbgbk.c.jj 2002-06-28 23:22:19.000000000 +0200
+++ libc/iconvdata/gbgbk.c 2005-08-18 13:37:45.000000000 +0200
@@ -63,7 +63,7 @@
0xA8BB to 0xA8C0 \
\
All these characters are not defined in GB2312. Besides this \
- there is an incomatibility in the mapping. The Unicode tables \
+ there is an incompatibility in the mapping. The Unicode tables \
say that 0xA1A4 maps in GB2312 to U30FB while in GBK it maps to \
U00B7. Similarly, 0xA1AA maps in GB2312 to U2015 while in GBK \
it maps to U2014. Since we are free to do whatever we want if \
--- libc/iconvdata/iso-2022-cn.c.jj 2002-06-28 23:13:14.000000000 +0200
+++ libc/iconvdata/iso-2022-cn.c 2005-08-18 13:37:45.000000000 +0200
@@ -103,7 +103,7 @@ enum
/* Since we might have to reset input pointer we must be able to save
- and retore the state. */
+ and restore the state. */
#define SAVE_RESET_STATE(Save) \
if (Save) \
save_set = *setp; \
--- libc/stdlib/tst-strtod.c.jj 2004-08-04 14:16:17.000000000 +0200
+++ libc/stdlib/tst-strtod.c 2005-08-18 13:37:45.000000000 +0200
@@ -252,7 +252,7 @@ locale_test (void)
continue;
}
- /* We call __strtod_interal here instead of strtod to tests the
+ /* We call __strtod_internal here instead of strtod to tests the
handling of grouping. */
d = __strtod_internal (tests[n].str, &endp, 1);
if (d != tests[n].exp)
--- libc/stdlib/tst-random.c.jj 2001-08-24 00:35:09.000000000 +0200
+++ libc/stdlib/tst-random.c 2005-08-18 13:37:45.000000000 +0200
@@ -8,14 +8,14 @@
is regenerated twice and checked against the stored values.
First they are regenerated one sequence at a time, using srandom()
- to set the initial state. A discrepency here would suggest that
+ to set the initial state. A discrepancy here would suggest that
srandom() was failing to completely initialize the random number
generator.
Second the sequences are regenerated in an interleaved order.
A state vector is created for each sequence using initstate().
setstate() is used to switch from sequence to sequence during
- the interleaved generation. A discrepency here would suggest
+ the interleaved generation. A discrepancy here would suggest
a problem with either initstate() failing to initialize the
random number generator properly, or the failure of setstate()
to correctly save and restore state information. Also, each
--- libc/catgets/gencat.c.jj 2005-01-19 14:12:33.000000000 +0100
+++ libc/catgets/gencat.c 2005-08-18 13:37:45.000000000 +0200
@@ -420,7 +420,7 @@ read_input_file (struct catalog *current
}
else
{
- /* We have found seomthing that looks like a
+ /* We have found something that looks like a
correct identifier. */
struct set_list *runp;
--- libc/nscd/initgrcache.c.jj 2005-02-25 14:54:25.000000000 +0100
+++ libc/nscd/initgrcache.c 2005-08-18 13:37:45.000000000 +0200
@@ -97,7 +97,7 @@ addinitgroupsX (struct database_dyn *db,
long int size;
if (limit > 0)
- /* We limit the size of the intially allocated array. */
+ /* We limit the size of the initially allocated array. */
size = MIN (limit, 64);
else
/* No fixed limit on groups. Pick a starting buffer size. */
@@ -242,7 +242,7 @@ addinitgroupsX (struct database_dyn *db,
written = total = sizeof (struct dataset) + start * sizeof (int32_t);
- /* If we refill the cache, first assume the reconrd did not
+ /* If we refill the cache, first assume the record did not
change. Allocate memory on the cache since it is likely
discarded anyway. If it turns out to be necessary to have a
new record we can still allocate real memory. */
--- libc/nscd/hstcache.c.jj 2005-02-25 14:54:25.000000000 +0100
+++ libc/nscd/hstcache.c 2005-08-18 13:37:45.000000000 +0200
@@ -206,7 +206,7 @@ cache_addhst (struct database_dyn *db, i
+ h_addr_list_cnt * hst->h_length);
written = total;
- /* If we refill the cache, first assume the reconrd did not
+ /* If we refill the cache, first assume the record did not
change. Allocate memory on the cache since it is likely
discarded anyway. If it turns out to be necessary to have a
new record we can still allocate real memory. */
@@ -357,7 +357,7 @@ cache_addhst (struct database_dyn *db, i
pthread_rwlock_rdlock (&db->lock);
/* NB: the following code is really complicated. It has
- seemlingly duplicated code paths which do the same. The
+ seemingly duplicated code paths which do the same. The
problem is that we always must add the hash table entry
with the FIRST flag set first. Otherwise we get dangling
pointers in case memory allocation fails. */
--- libc/nscd/grpcache.c.jj 2005-07-20 10:32:47.000000000 +0200
+++ libc/nscd/grpcache.c 2005-08-18 13:37:45.000000000 +0200
@@ -191,7 +191,7 @@ cache_addgr (struct database_dyn *db, in
+ gr_mem_cnt * sizeof (uint32_t)
+ gr_name_len + gr_passwd_len + gr_mem_len_total);
- /* If we refill the cache, first assume the reconrd did not
+ /* If we refill the cache, first assume the record did not
change. Allocate memory on the cache since it is likely
discarded anyway. If it turns out to be necessary to have a
new record we can still allocate real memory. */
--- libc/nscd/nscd_conf.c.jj 2004-10-05 00:36:50.000000000 +0200
+++ libc/nscd/nscd_conf.c 2005-08-18 13:37:45.000000000 +0200
@@ -274,7 +274,7 @@ nscd_parse_file (const char *fname, stru
{
restart_time = time (NULL) + restart_interval;
- /* Save the old current workding directory if we are in paranoia
+ /* Save the old current working directory if we are in paranoia
mode. We have to change back to it. */
oldcwd = get_current_dir_name ();
if (oldcwd == NULL)
--- libc/nscd/nscd_helper.c.jj 2005-07-20 10:32:47.000000000 +0200
+++ libc/nscd/nscd_helper.c 2005-08-18 13:37:45.000000000 +0200
@@ -166,7 +166,7 @@ wait_on_socket (int sock)
}
-/* Try to get a file descriptor for the shared meory segment
+/* Try to get a file descriptor for the shared memory segment
containing the database. */
static struct mapped_database *
get_mapping (request_type type, const char *key,
--- libc/nscd/nscd.c.jj 2005-07-20 10:32:47.000000000 +0200
+++ libc/nscd/nscd.c 2005-08-18 13:37:45.000000000 +0200
@@ -479,7 +479,7 @@ check_pid (const char *file)
/* If we cannot parse the file default to assuming nscd runs.
If the PID is alive, assume it is running. That all unless
- the PID is the same as the current process' since tha latter
+ the PID is the same as the current process' since the latter
can mean we re-exec. */
if ((n != 1 || kill (pid, 0) == 0) && pid != getpid ())
return 1;
--- libc/nscd/pwdcache.c.jj 2005-02-25 14:54:25.000000000 +0100
+++ libc/nscd/pwdcache.c 2005-08-18 13:37:45.000000000 +0200
@@ -186,7 +186,7 @@ cache_addpw (struct database_dyn *db, in
written = total = (sizeof (struct dataset) + pw_name_len + pw_passwd_len
+ pw_gecos_len + pw_dir_len + pw_shell_len);
- /* If we refill the cache, first assume the reconrd did not
+ /* If we refill the cache, first assume the record did not
change. Allocate memory on the cache since it is likely
discarded anyway. If it turns out to be necessary to have a
new record we can still allocate real memory. */
--- libc/nscd/nscd_stat.c.jj 2005-08-17 18:03:24.000000000 +0200
+++ libc/nscd/nscd_stat.c 2005-08-18 13:37:45.000000000 +0200
@@ -254,7 +254,7 @@ receive_print_stats (void)
if (enabled[0] == '\0')
/* The locale does not provide this information so we have to
translate it ourself. Since we should avoid short translation
- terms we artifically increase the length. */
+ terms we artificially increase the length. */
enabled = data.dbs[i].enabled ? yesstr : nostr;
if (check_file[0] == '\0')
check_file = data.dbs[i].check_file ? yesstr : nostr;
--- libc/nscd/connections.c.jj 2005-08-17 18:08:02.000000000 +0200
+++ libc/nscd/connections.c 2005-08-18 13:37:45.000000000 +0200
@@ -590,7 +590,7 @@ cannot create read-only descriptor for \
cannot create read-only descriptor for \"%s\"; no mmap"),
dbs[cnt].db_filename);
- /* Before we create the header, initialiye the hash
+ /* Before we create the header, initialize the hash
table. So that if we get interrupted if writing
the header we can recognize a partially initialized
database. */
@@ -769,7 +769,7 @@ cannot set socket to close on exec: %s;
exit (1);
}
- /* Change to unprivileged uid/gid/groups if specifed in config file */
+ /* Change to unprivileged uid/gid/groups if specified in config file */
if (server_user != NULL)
finish_drop_privileges ();
}
@@ -1407,7 +1407,7 @@ handle_request: request received (Versio
/* Compute next timeout time. */
prune_ts.tv_sec += CACHE_PRUNE_INTERVAL;
- /* In case the list is emtpy we do not want to run the prune
+ /* In case the list is empty we do not want to run the prune
code right away again. */
to = 0;
}
--- libc/hesiod/hesiod.c.jj 2005-06-22 18:34:13.000000000 +0200
+++ libc/hesiod/hesiod.c 2005-08-18 13:37:45.000000000 +0200
@@ -324,7 +324,7 @@ parse_config_file(struct hesiod_p *ctx,
}
if (n == 0) {
/* Restore the default. Better than
- nother at all. */
+ XXXXXX at all. */
ctx->classes[0] = C_IN;
ctx->classes[1] = C_HS;
} else if (n == 1
--- libc/elf/ldconfig.c.jj 2005-04-13 21:28:20.000000000 +0200
+++ libc/elf/ldconfig.c 2005-08-18 13:37:45.000000000 +0200
@@ -591,7 +591,7 @@ manual_link (char *library)
- search for libraries which will be added to the cache
- create symbolic links to the soname for each library
- This has to be done separatly for each directory.
+ This has to be done separately for each directory.
To keep track of which libraries to add to the cache and which
links to create, we save a list of all libraries.
--- libc/elf/dl-profile.c.jj 2004-07-12 17:50:22.000000000 +0200
+++ libc/elf/dl-profile.c 2005-08-18 13:37:45.000000000 +0200
@@ -38,7 +38,7 @@
/* The LD_PROFILE feature has to be implemented different to the
normal profiling using the gmon/ functions. The problem is that an
- arbitrary amount of processes simulataneously can be run using
+ arbitrary amount of processes simultaneously can be run using
profiling and all write the results in the same file. To provide
this mechanism one could implement a complicated mechanism to merge
the content of two profiling runs or one could extend the file
@@ -101,7 +101,7 @@
0038+(2*CN+2)*A+(CN-1)*4+K ?? ?? ?? ?? <- Count#CGN
We put (for now?) no basic block information in the file since this would
- introduce rase conditions among all the processes who want to write them.
+ introduce race conditions among all the processes who want to write them.
`K' is the number of count entries which is computed as
@@ -166,7 +166,7 @@ static unsigned int log_hashfraction;
-/* Set up profiling data to profile object desribed by MAP. The output
+/* Set up profiling data to profile object described by MAP. The output
file is found (or created) in OUTPUT_DIR. */
void
internal_function
--- libc/elf/elf.h.jj 2005-08-08 09:14:45.000000000 +0200
+++ libc/elf/elf.h 2005-08-18 13:37:46.000000000 +0200
@@ -327,7 +327,7 @@ typedef struct
#define SHT_FINI_ARRAY 15 /* Array of destructors */
#define SHT_PREINIT_ARRAY 16 /* Array of pre-constructors */
#define SHT_GROUP 17 /* Section group */
-#define SHT_SYMTAB_SHNDX 18 /* Extended section indeces */
+#define SHT_SYMTAB_SHNDX 18 /* Extended section indices */
#define SHT_NUM 19 /* Number of defined types. */
#define SHT_LOOS 0x60000000 /* Start OS-specific */
#define SHT_GNU_LIBLIST 0x6ffffff7 /* Prelink library list */
@@ -1202,7 +1202,7 @@ typedef struct
#define R_SPARC_LM22 36 /* Low middle 22 bits of ... */
#define R_SPARC_PC_HH22 37 /* Top 22 bits of pc rel 64 bit */
#define R_SPARC_PC_HM10 38 /* High middle 10 bit of ... */
-#define R_SPARC_PC_LM22 39 /* Low miggle 22 bits of ... */
+#define R_SPARC_PC_LM22 39 /* Low middle 22 bits of ... */
#define R_SPARC_WDISP16 40 /* PC relative 16 bit shifted */
#define R_SPARC_WDISP19 41 /* PC relative 19 bit shifted */
#define R_SPARC_7 43 /* Direct 7 bit */
@@ -1649,9 +1649,9 @@ typedef Elf32_Addr Elf32_Conflict;
#define EFA_PARISC_1_1 0x0210 /* PA-RISC 1.1 big-endian. */
#define EFA_PARISC_2_0 0x0214 /* PA-RISC 2.0 big-endian. */
-/* Additional section indeces. */
+/* Additional section indices. */
-#define SHN_PARISC_ANSI_COMMON 0xff00 /* Section for tenatively declared
+#define SHN_PARISC_ANSI_COMMON 0xff00 /* Section for tentatively declared
symbols in ANSI C. */
#define SHN_PARISC_HUGE_COMMON 0xff01 /* Common blocks in huge model. */
@@ -1808,7 +1808,7 @@ typedef Elf32_Addr Elf32_Conflict;
/* Legal values for sh_type field of Elf64_Shdr. */
-/* These two are primerily concerned with ECOFF debugging info. */
+/* These two are primarily concerned with ECOFF debugging info. */
#define SHT_ALPHA_DEBUG 0x70000001
#define SHT_ALPHA_REGINFO 0x70000002
--- libc/elf/reldep.c.jj 2000-08-27 01:36:55.000000000 +0200
+++ libc/elf/reldep.c 2005-08-18 13:37:45.000000000 +0200
@@ -93,7 +93,7 @@ main (void)
exit (1);
}
- /* The variable now must have its originial value. */
+ /* The variable now must have its original value. */
if (*vp != 0)
{
puts ("variable \"some_var\" not reset");
--- libc/elf/reldep2.c.jj 2001-09-08 18:21:56.000000000 +0200
+++ libc/elf/reldep2.c 2005-08-18 13:37:45.000000000 +0200
@@ -78,7 +78,7 @@ main (void)
exit (1);
}
- /* The variable now must have its originial value. */
+ /* The variable now must have its original value. */
if (*vp != 42)
{
puts ("variable \"some_var\" reset");
--- libc/elf/dl-open.c.jj 2005-06-22 18:34:11.000000000 +0200
+++ libc/elf/dl-open.c 2005-08-18 13:37:46.000000000 +0200
@@ -55,7 +55,7 @@ extern int __libc_multiple_libcs; /* Def
static void show_scope (struct link_map *new);
#endif
-/* We must be carefull not to leave us in an inconsistent state. Thus we
+/* We must be careful not to leave us in an inconsistent state. Thus we
catch any error and re-raise it after cleaning up. */
struct dl_open_args
--- libc/elf/dl-load.c.jj 2005-08-08 09:14:45.000000000 +0200
+++ libc/elf/dl-load.c 2005-08-18 13:37:45.000000000 +0200
@@ -125,7 +125,7 @@ int __stack_prot attribute_hidden attrib
long respectively. I.e., even with a file which has 10 program
header entries we only have to read 372B/624B respectively. Add to
this a bit of margin for program notes and reading 512B and 832B
- for 32-bit and 64-bit files respecitvely is enough. If this
+ for 32-bit and 64-bit files respectively is enough. If this
heuristic should really fail for some file the code in
`_dl_map_object_from_fd' knows how to recover. */
struct filebuf
@@ -249,7 +249,7 @@ _dl_dst_substitute (struct link_map *l,
char *last_elem, *wp;
/* 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. */
last_elem = wp = result;
@@ -1603,7 +1603,7 @@ open_verify (const char *name, struct fi
unsigned int osversion;
size_t maplength;
- /* We successfully openened the file. Now verify it is a file
+ /* We successfully opened the file. Now verify it is a file
we can use. */
__set_errno (0);
fbp->len = __libc_read (fd, fbp->buf, sizeof (fbp->buf));
--- libc/elf/reldep3.c.jj 2000-08-27 01:38:18.000000000 +0200
+++ libc/elf/reldep3.c 2005-08-18 13:37:45.000000000 +0200
@@ -78,7 +78,7 @@ main (void)
exit (1);
}
- /* The variable now must have its originial value. */
+ /* The variable now must have its original value. */
if (*vp != 0)
{
puts ("variable \"some_var\" not reset");
--- libc/elf/nodelete.c.jj 2000-11-26 07:17:46.000000000 +0100
+++ libc/elf/nodelete.c 2005-08-18 13:37:45.000000000 +0200
@@ -23,7 +23,7 @@ static int
do_test (void)
{
/* We are testing the two possibilities to mark an object as not deletable:
- - marked on the linker commandline with `-z nodelete'
+ - marked on the linker command line with `-z nodelete'
- with the RTLD_NODELETE flag at dlopen()-time.
The test we are performing should be safe. We are loading the objects,
--- libc/elf/dl-support.c.jj 2005-05-20 10:35:21.000000000 +0200
+++ libc/elf/dl-support.c 2005-08-18 13:37:46.000000000 +0200
@@ -143,7 +143,7 @@ const ElfW(Ehdr) *_dl_sysinfo_dso;
#endif
/* During the program run we must not modify the global data of
- loaded shared object simultanously in two threads. Therefore we
+ loaded shared object simultaneously in two threads. Therefore we
protect `_dl_open' and `_dl_close' in dl-close.c.
This must be a recursive lock since the initializer function of
--- libc/elf/rtld.c.jj 2005-07-04 10:27:37.000000000 +0200
+++ libc/elf/rtld.c 2005-08-18 13:37:45.000000000 +0200
@@ -1099,7 +1099,7 @@ of this helper program; chances are you
/* _dl_rtld_libname.next = NULL; Already zero. */
GL(dl_rtld_map).l_libname = &_dl_rtld_libname;
- /* Ordinarilly, we would get additional names for the loader from
+ /* Ordinarily, we would get additional names for the loader from
our DT_SONAME. This can't happen if we were actually linked as
a static executable (detect this case when we have no DYNAMIC).
If so, assume the filename component of the interpreter path to
@@ -2143,7 +2143,7 @@ ERROR: ld.so: object '%s' cannot be load
_dl_protect_relro (l);
#ifdef USE_TLS
- /* Add object to slot information data if necessasy. */
+ /* Add object to slot information data if necessary. */
if (l->l_tls_blocksize != 0 && tls_init_tp_called)
_dl_add_to_slotinfo (l);
#endif
@@ -2169,7 +2169,7 @@ ERROR: ld.so: object '%s' cannot be load
hp_timing_t add;
#endif
- /* If we are profiling we also must do lazy reloaction. */
+ /* If we are profiling we also must do lazy relocation. */
GLRO(dl_lazy) |= consider_profiling;
struct link_map *l = main_map;
@@ -2195,7 +2195,7 @@ ERROR: ld.so: object '%s' cannot be load
consider_profiling);
#ifdef USE_TLS
- /* Add object to slot information data if necessasy. */
+ /* Add object to slot information data if necessary. */
if (l->l_tls_blocksize != 0 && tls_init_tp_called)
_dl_add_to_slotinfo (l);
#endif
--- libc/elf/dl-version.c.jj 2005-03-08 13:05:15.000000000 +0100
+++ libc/elf/dl-version.c 2005-08-18 13:37:46.000000000 +0200
@@ -185,7 +185,7 @@ _dl_check_map_versions (struct link_map
/* Pointer to dynamic section with definitions. */
ElfW(Dyn) *def;
/* We need to find out which is the highest version index used
- in a dependecy. */
+ in a dependency. */
unsigned int ndx_high = 0;
/* Initialize to make the compiler happy. */
const char *errstring = NULL;
@@ -273,7 +273,7 @@ _dl_check_map_versions (struct link_map
the maximum index here as well.
XXX We could avoid the loop by just taking the number of definitions
- as an upper bound of new indeces. */
+ as an upper bound of new indices. */
if (def != NULL)
{
ElfW(Verdef) *ent;
--- libc/elf/dl-dst.h.jj 2004-03-08 12:01:42.000000000 +0100
+++ libc/elf/dl-dst.h 2005-08-18 13:37:46.000000000 +0200
@@ -1,4 +1,4 @@
-/* Handling of dynamic sring tokens.
+/* Handling of dynamic string tokens.
Copyright (C) 1999, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
This file is part of the GNU C Library.
--- libc/elf/sprof.c.jj 2005-01-19 14:12:39.000000000 +0100
+++ libc/elf/sprof.c 2005-08-18 13:37:45.000000000 +0200
@@ -117,7 +117,7 @@ static enum
/* Nozero for testing. */
static int do_test;
-/* Strcuture describing calls. */
+/* Structure describing calls. */
struct here_fromstruct
{
struct here_cg_arc_record volatile *here;
@@ -266,7 +266,7 @@ main (int argc, char *argv[])
exit (1);
/* We can now determine the filename for the profiling data, if
- nececessary. */
+ necessary. */
if (profdata == NULL)
{
char *newp;
@@ -381,7 +381,7 @@ load_shobj (const char *name)
/* Since we use dlopen() we must be prepared to work around the sometimes
strange lookup rules for the shared objects. If we have a file foo.so
- in the current directory and the user specfies foo.so on the command
+ in the current directory and the user specifies foo.so on the command
line (without specifying a directory) we should load the file in the
current directory even if a normal dlopen() call would read the other
file. We do this by adding a directory portion to the name. */
@@ -785,7 +785,7 @@ load_profdata (const char *name, struct
return NULL;
}
- /* We don't need the file desriptor anymore. */
+ /* We don't need the file descriptor anymore. */
if (close (fd) < 0)
{
error (0, errno, _("error while closing the profiling data file"));
--- libc/intl/dcigettext.c.jj 2005-05-03 21:44:29.000000000 +0200
+++ libc/intl/dcigettext.c 2005-08-18 13:37:46.000000000 +0200
@@ -601,7 +601,7 @@ DCIGETTEXT (domainname, msgid1, msgid2,
/* When this is a SUID binary we must not allow accessing files
outside the dedicated directories. */
if (ENABLE_SECURE && strchr (single_locale, '/') != NULL)
- /* Ingore this entry. */
+ /* Ignore this entry. */
continue;
}
--- libc/intl/tst-translit.c.jj 2001-07-06 06:54:53.000000000 +0200
+++ libc/intl/tst-translit.c 2005-08-18 13:37:46.000000000 +0200
@@ -1,4 +1,4 @@
-/* Test of translitation in the gettext functions.
+/* Test of transliteration in the gettext functions.
Copyright (C) 2000 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by Ulrich Drepper <drepper@cygnus.com>, 2000.
--- libc/sunrpc/rpc_main.c.jj 2005-01-26 18:22:23.000000000 +0100
+++ libc/sunrpc/rpc_main.c 2005-08-18 13:37:46.000000000 +0200
@@ -401,7 +401,7 @@ open_input (const char *infile, const ch
}
}
-/* Close the connection to the C-preprocessor and check for successfull
+/* Close the connection to the C-preprocessor and check for successful
termination. */
static void
close_input (void)
--- libc/sunrpc/rpc_thread.c.jj 2003-02-22 02:57:51.000000000 +0100
+++ libc/sunrpc/rpc_thread.c 2005-08-18 13:37:46.000000000 +0200
@@ -73,7 +73,7 @@ __rpc_thread_variables (void)
/* Global variables If we're single-threaded, or if this is the first
thread using the variable, use the existing global variable. This
- provides backwards compatability for existing applications which
+ provides backwards compatibility for existing applications which
dynamically link against this code. */
#undef svc_fdset
#undef rpc_createerr
--- libc/sunrpc/rpc/clnt.h.jj 2003-09-02 09:08:57.000000000 +0200
+++ libc/sunrpc/rpc/clnt.h 2005-08-18 13:42:10.000000000 +0200
@@ -109,8 +109,8 @@ struct rpc_err {
int RE_errno; /* related system error */
enum auth_stat RE_why; /* why the auth error occurred */
struct {
- u_long low; /* lowest verion supported */
- u_long high; /* highest verion supported */
+ u_long low; /* lowest version supported */
+ u_long high; /* highest version supported */
} RE_vers;
struct { /* maybe meaningful if RPC_FAILED */
long s1;
--- libc/sunrpc/key_call.c.jj 2005-03-08 13:05:19.000000000 +0100
+++ libc/sunrpc/key_call.c 2005-08-18 13:37:46.000000000 +0200
@@ -31,7 +31,7 @@
*/
/*
* The original source is from the RPCSRC 4.0 package from Sun Microsystems.
- * The Interface to keyserver protocoll 2, RPC over AF_UNIX and Linux/doors
+ * The Interface to keyserver protocol 2, RPC over AF_UNIX and Linux/doors
* was added by Thorsten Kukuk <kukuk@suse.de>
* Since the Linux/doors project was stopped, I doubt that this code will
* ever be useful <kukuk@suse.de>.
--- libc/sunrpc/des_impl.c.jj 2005-03-08 13:05:19.000000000 +0100
+++ libc/sunrpc/des_impl.c 2005-08-18 13:37:46.000000000 +0200
@@ -353,7 +353,7 @@ static const unsigned long des_skb[8][64
/* The changes to this macro may help or hinder, depending on the
- * compiler and the achitecture. gcc2 always seems to do well :-).
+ * compiler and the architecture. gcc2 always seems to do well :-).
* Inspired by Dana How <how@isl.stanford.edu>
* DO NOT use the alternative version on machines with 8 byte longs.
*/
--- libc/sunrpc/auth_des.c.jj 2005-02-21 17:20:13.000000000 +0100
+++ libc/sunrpc/auth_des.c 2005-08-18 13:37:46.000000000 +0200
@@ -85,7 +85,7 @@ struct ad_private {
u_int ad_servernamelen; /* length of name, rounded up */
uint32_t ad_window; /* client specified window */
bool_t ad_dosync; /* synchronize? */
- struct sockaddr ad_syncaddr; /* remote host to synch with */
+ struct sockaddr ad_syncaddr; /* remote host to sync with */
struct rpc_timeval ad_timediff; /* server's time - client's time */
uint32_t ad_nickname; /* server's nickname for client */
struct authdes_cred ad_cred; /* storage for credential */
--- libc/sunrpc/xdr_rec.c.jj 2005-07-28 15:57:17.000000000 +0200
+++ libc/sunrpc/xdr_rec.c 2005-08-18 13:37:46.000000000 +0200
@@ -105,7 +105,7 @@ typedef struct rec_strm
caddr_t out_base; /* output buffer (points to frag header) */
caddr_t out_finger; /* next output position */
caddr_t out_boundry; /* data cannot up to this address */
- u_int32_t *frag_header; /* beginning of curren fragment */
+ u_int32_t *frag_header; /* beginning of current fragment */
bool_t frag_sent; /* true if buffer sent in middle of record */
/*
* in-coming bits
@@ -613,7 +613,7 @@ set_input_fragment (RECSTREAM *rstrm)
/*
* Sanity check. Try not to accept wildly incorrect fragment
* sizes. Unfortunately, only a size of zero can be identified as
- * 'wildely incorrect', and this only, if it is not the last
+ * 'wildly incorrect', and this only, if it is not the last
* fragment of a message. Ridiculously large fragment sizes may look
* wrong, but we don't have any way to be certain that they aren't
* what the client actually intended to send us. Many existing RPC
--- libc/obj/math/libm-test.c.jj 2005-07-28 16:04:34.000000000 +0200
+++ libc/obj/math/libm-test.c 2005-08-18 13:37:46.000000000 +0200
@@ -84,11 +84,11 @@
aren't checked at the moment.
NaN values: There exist signalling and quiet NaNs. This implementation
- only uses quiet NaN as parameter but does not differenciate
+ only uses quiet NaN as parameter but does not differentiate
between the two kinds of NaNs as result.
Inline functions: Inlining functions should give an improvement in
- speed - but not in precission. The inlined functions return
+ speed - but not in precision. The inlined functions return
reasonable values for a reasonable range of input values. The
result is not necessarily correct for all values and exceptions are
not correctly raised in all cases. Problematic input and return
@@ -137,7 +137,7 @@
#define INVALID_EXCEPTION_OK 0x4
#define DIVIDE_BY_ZERO_EXCEPTION_OK 0x8
#define EXCEPTIONS_OK INVALID_EXCEPTION_OK+DIVIDE_BY_ZERO_EXCEPTION_OK
-/* Some special test flags, passed togther with exceptions. */
+/* Some special test flags, passed together with exceptions. */
#define IGNORE_ZERO_INF_SIGN 0x10
/* Various constants (we must supply them precalculated for accuracy). */
@@ -3120,7 +3120,7 @@ lgamma_test (void)
static void
lrint_test (void)
{
- /* XXX this test is incomplete. We need to have a way to specifiy
+ /* XXX this test is incomplete. We need to have a way to specify
the rounding method and test the critical cases. So far, only
unproblematic numbers are tested. */
@@ -3152,7 +3152,7 @@ lrint_test (void)
static void
llrint_test (void)
{
- /* XXX this test is incomplete. We need to have a way to specifiy
+ /* XXX this test is incomplete. We need to have a way to specify
the rounding method and test the critical cases. So far, only
unproblematic numbers are tested. */
--- libc/sysdeps/unix/sockatmark.c.jj 2001-08-17 08:44:34.000000000 +0200
+++ libc/sysdeps/unix/sockatmark.c 2005-08-18 13:37:46.000000000 +0200
@@ -19,7 +19,7 @@
#include <sys/ioctl.h>
#include <sys/socket.h>
-/* Determine wheter socket is at a out-of-band mark. */
+/* Determine whether socket is at a out-of-band mark. */
int
sockatmark (fd)
int fd;
--- libc/sysdeps/unix/readdir.c.jj 2002-08-28 05:26:37.000000000 +0200
+++ libc/sysdeps/unix/readdir.c 2005-08-18 13:37:47.000000000 +0200
@@ -71,7 +71,7 @@ __READDIR (DIR *dirp)
if (bytes < 0 && errno == ENOENT)
bytes = 0;
- /* Don't modifiy errno when reaching EOF. */
+ /* Don't modify errno when reaching EOF. */
if (bytes == 0)
__set_errno (saved_errno);
dp = NULL;
@@ -94,7 +94,7 @@ __READDIR (DIR *dirp)
reclen = sizeof *dp;
/* The name is not terminated if it is the largest possible size.
Clobber the following byte to ensure proper null termination. We
- read jst one entry at a time above so we know that byte will not
+ read just one entry at a time above so we know that byte will not
be used later. */
dp->d_name[sizeof dp->d_name] = '\0';
#endif
--- libc/sysdeps/unix/sysv/linux/kernel-features.h.jj 2005-05-04 10:32:13.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/kernel-features.h 2005-08-18 13:37:47.000000000 +0200
@@ -69,7 +69,7 @@
# define __ASSUME_LCHOWN_SYSCALL 1
#endif
-/* When did the `setresuid' sysall became available? */
+/* When did the `setresuid' syscall became available? */
#if __LINUX_KERNEL_VERSION >= 131584 && !defined __sparc__
# define __ASSUME_SETRESUID_SYSCALL 1
#endif
@@ -352,7 +352,7 @@
# define __ASSUME_CORRECT_SI_PID 1
#endif
-/* The tgkill syscall was instroduced for i386 in 2.5.75. For Alpha
+/* The tgkill syscall was introduced for i386 in 2.5.75. For Alpha
it was introduced in 2.6.0-test1 which unfortunately cannot be
distinguished from 2.6.0. On x86-64, ppc, and ppc64 it was
introduced in 2.6.0-test3. */
--- libc/sysdeps/unix/sysv/linux/alpha/rt_sigaction.S.jj 2004-01-27 15:44:26.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/alpha/rt_sigaction.S 2005-08-18 13:37:50.000000000 +0200
@@ -19,7 +19,7 @@
#include <sysdep.h>
-/* On Alpha we desparately want to avoid having to issue an imb. Ordinarily
+/* On Alpha we desperately want to avoid having to issue an imb. Ordinarily
the kernel would have to issue one after setting up the signal return
stack, but the Linux rt_sigaction syscall is prepared to accept a pointer
to the sigreturn syscall, instead of inlining it on the stack.
--- libc/sysdeps/unix/sysv/linux/alpha/bits/fcntl.h.jj 2005-06-06 11:41:17.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/alpha/bits/fcntl.h 2005-08-18 13:37:46.000000000 +0200
@@ -88,8 +88,8 @@
#ifdef __USE_GNU
# define F_SETLEASE 1024 /* Set a lease. */
-# define F_GETLEASE 1025 /* Enquire what lease is active. */
-# define F_NOTIFY 1026 /* Request notfications on a directory. */
+# define F_GETLEASE 1025 /* Inquire what lease is active. */
+# define F_NOTIFY 1026 /* Request notifications on a directory. */
#endif
/* for F_[GET|SET]FL */
@@ -127,7 +127,7 @@
# define DN_CREATE 0x00000004 /* File created. */
# define DN_DELETE 0x00000008 /* File removed. */
# define DN_RENAME 0x00000010 /* File renamed. */
-# define DN_ATTRIB 0x00000020 /* File changed attibutes. */
+# define DN_ATTRIB 0x00000020 /* File changed attributes. */
# define DN_MULTISHOT 0x80000000 /* Don't remove notifier. */
#endif
--- libc/sysdeps/unix/sysv/linux/alpha/bits/netdb.h.jj 2001-07-06 06:56:13.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/alpha/bits/netdb.h 2005-08-18 13:43:44.000000000 +0200
@@ -30,6 +30,6 @@ struct netent
char **n_aliases; /* Alias list. */
int n_addrtype; /* Net address type. */
/* XXX We should probably use uint32_t for the field and ensure
- compatiblity by adding appropriate padding. */
+ compatibility by adding appropriate padding. */
unsigned long int n_net; /* Network number. */
};
--- libc/sysdeps/unix/sysv/linux/alpha/bits/resource.h.jj 2005-06-23 12:15:48.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/alpha/bits/resource.h 2005-08-18 13:37:46.000000000 +0200
@@ -95,7 +95,7 @@ enum __rlimit_resource
__RLIMIT_NICE = 13,
#define RLIMIT_NICE __RLIMIT_NICE
- /* Maximum realtime priority allowed for non-priviledged
+ /* Maximum realtime priority allowed for non-privileged
processes. */
__RLIMIT_RTPRIO = 14,
#define RLIMIT_RTPRIO __RLIMIT_RTPRIO
--- libc/sysdeps/unix/sysv/linux/alpha/getcontext.S.jj 2005-06-06 11:41:17.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/alpha/getcontext.S 2005-08-18 13:37:50.000000000 +0200
@@ -45,7 +45,7 @@ weak_alias (__getcontext, getcontext)
/* An internal routine used by getcontext and setcontext.
- The incomming return address register is $0. */
+ The incoming return address register is $0. */
.align 4
.globl __getcontext_x
--- libc/sysdeps/unix/sysv/linux/alpha/sys/procfs.h.jj 2001-07-06 06:56:13.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/alpha/sys/procfs.h 2005-08-18 13:44:02.000000000 +0200
@@ -19,7 +19,7 @@
#ifndef _SYS_PROCFS_H
#define _SYS_PROCFS_H 1
-/* This is somehow modelled after the file of the same name on SysVr4
+/* This is somehow modeled after the file of the same name on SysVr4
systems. It provides a definition of the core file format for ELF
used on Linux. */
@@ -103,7 +103,7 @@ typedef gregset_t prgregset_t;
typedef fpregset_t prfpregset_t;
/* We don't have any differences between processes and threads,
- therefore habe only ine PID type. */
+ therefore have only one PID type. */
typedef __pid_t lwpid_t;
--- libc/sysdeps/unix/sysv/linux/alpha/setitimer.S.jj 2003-06-20 18:24:36.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/alpha/setitimer.S 2005-08-18 13:37:51.000000000 +0200
@@ -101,7 +101,7 @@ $do32:
callsys
bne a3, $error
- /* Conditionaly bounce old value up. */
+ /* Conditionally bounce old value up. */
ldq a2, 16(sp)
bne a2, 2f
ldl t0, 0(a2)
--- libc/sysdeps/unix/sysv/linux/alpha/kernel_sigaction.h.jj 1998-02-24 16:22:07.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/alpha/kernel_sigaction.h 2005-08-18 13:44:27.000000000 +0200
@@ -1,4 +1,4 @@
-/* This is the sigaction struction from the Linux 2.1.20 kernel. */
+/* This is the sigaction structure from the Linux 2.1.20 kernel. */
struct old_kernel_sigaction {
__sighandler_t k_sa_handler;
--- libc/sysdeps/unix/sysv/linux/s390/s390-32/chown.c.jj 2004-03-11 11:10:24.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/s390/s390-32/chown.c 2005-08-18 13:37:46.000000000 +0200
@@ -95,7 +95,7 @@ __real_chown (const char *file, uid_t ow
#if SHLIB_COMPAT (libc, GLIBC_2_0, GLIBC_2_1)
-/* Compiling for compatibiity. */
+/* Compiling for compatibility. */
int
attribute_compat_text_section
__chown_is_lchown (const char *file, uid_t owner, gid_t group)
--- libc/sysdeps/unix/sysv/linux/s390/s390-32/swapcontext.S.jj 2005-06-06 11:41:19.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/s390/s390-32/swapcontext.S 2005-08-18 13:37:51.000000000 +0200
@@ -25,7 +25,7 @@
/* __swapcontext (ucontext_t *oucp, const ucontext_t *ucp)
Saves the machine context in oucp such that when it is activated,
- it appears as if __swapcontextt() returned again, restores the
+ it appears as if __swapcontext() returned again, restores the
machine context in ucp and thereby resumes execution in that
context.
--- libc/sysdeps/unix/sysv/linux/s390/s390-32/socket.S.jj 2003-12-11 22:23:20.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/s390/s390-32/socket.S 2005-08-18 13:37:51.000000000 +0200
@@ -25,7 +25,7 @@
#define P2(a, b) a##b
.text
-/* The socket-oriented system calls are handled unusally in Linux.
+/* The socket-oriented system calls are handled unusually in Linux.
They are all gated through the single `socketcall' system call number.
`socketcall' takes two arguments: the first is the subcode, specifying
which socket function is being called; and the second is a pointer to
--- libc/sysdeps/unix/sysv/linux/s390/s390-32/sysdep.h.jj 2004-10-06 11:05:09.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/s390/s390-32/sysdep.h 2005-08-18 13:37:46.000000000 +0200
@@ -44,7 +44,7 @@
a large offset. Therefore we must not anymore test for < 0, but test
for a real error by making sure the value in gpr2 is a real error
number. Linus said he will make sure the no syscall returns a value
- in -1 .. -4095 as a valid result so we can savely test with -4095. */
+ in -1 .. -4095 as a valid result so we can safely test with -4095. */
#undef PSEUDO
#define PSEUDO(name, syscall_name, args) \
--- libc/sysdeps/unix/sysv/linux/s390/s390-32/syscall.S.jj 2003-12-11 22:23:20.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/s390/s390-32/syscall.S 2005-08-18 13:37:51.000000000 +0200
@@ -54,7 +54,7 @@ ENTRY (syscall)
jl 2f
1: svc 0
j 3f
-2: ex %r1,1b-0b(%r7) /* lsb of R1 is subsituted as SVC number */
+2: ex %r1,1b-0b(%r7) /* lsb of R1 is substituted as SVC number */
3: l %r15,0(%r15) /* load back chain */
cfi_adjust_cfa_offset (-96)
lm %r6,15,24(%r15) /* load registers */
--- libc/sysdeps/unix/sysv/linux/s390/bits/fcntl.h.jj 2004-08-30 12:04:06.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/s390/bits/fcntl.h 2005-08-18 13:37:46.000000000 +0200
@@ -106,8 +106,8 @@
#ifdef __USE_GNU
# define F_SETLEASE 1024 /* Set a lease. */
-# define F_GETLEASE 1025 /* Enquire what lease is active. */
-# define F_NOTIFY 1026 /* Request notfications on a directory. */
+# define F_GETLEASE 1025 /* Inquire what lease is active. */
+# define F_NOTIFY 1026 /* Request notifications on a directory. */
#endif
/* For F_[GET|SET]FL. */
@@ -145,7 +145,7 @@
# define DN_CREATE 0x00000004 /* File created. */
# define DN_DELETE 0x00000008 /* File removed. */
# define DN_RENAME 0x00000010 /* File renamed. */
-# define DN_ATTRIB 0x00000020 /* File changed attibutes. */
+# define DN_ATTRIB 0x00000020 /* File changed attributes. */
# define DN_MULTISHOT 0x80000000 /* Don't remove notifier. */
#endif
--- libc/sysdeps/unix/sysv/linux/s390/sys/procfs.h.jj 2003-12-11 22:23:20.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/s390/sys/procfs.h 2005-08-18 13:37:46.000000000 +0200
@@ -19,7 +19,7 @@
#ifndef _SYS_PROCFS_H
#define _SYS_PROCFS_H 1
-/* This is somewhat modelled after the file of the same name on SVR4
+/* This is somewhat modeled after the file of the same name on SVR4
systems. It provides a definition of the core file format for ELF
used on Linux. It doesn't have anything to do with the /proc file
system, even though Linux has one.
--- libc/sysdeps/unix/sysv/linux/s390/s390-64/swapcontext.S.jj 2005-06-06 11:41:19.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/s390/s390-64/swapcontext.S 2005-08-18 13:37:51.000000000 +0200
@@ -25,7 +25,7 @@
/* __swapcontext (ucontext_t *oucp, const ucontext_t *ucp)
Saves the machine context in oucp such that when it is activated,
- it appears as if __swapcontextt() returned again, restores the
+ it appears as if __swapcontext() returned again, restores the
machine context in ucp and thereby resumes execution in that
context.
--- libc/sysdeps/unix/sysv/linux/s390/s390-64/socket.S.jj 2003-12-11 22:23:20.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/s390/s390-64/socket.S 2005-08-18 13:37:51.000000000 +0200
@@ -25,7 +25,7 @@
#define P2(a, b) a##b
.text
-/* The socket-oriented system calls are handled unusally in Linux.
+/* The socket-oriented system calls are handled unusually in Linux.
They are all gated through the single `socketcall' system call number.
`socketcall' takes two arguments: the first is the subcode, specifying
which socket function is being called; and the second is a pointer to
--- libc/sysdeps/unix/sysv/linux/s390/s390-64/sysdep.h.jj 2004-10-06 11:05:09.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/s390/s390-64/sysdep.h 2005-08-18 13:37:46.000000000 +0200
@@ -56,7 +56,7 @@
a large offset. Therefore we must not anymore test for < 0, but test
for a real error by making sure the value in gpr2 is a real error
number. Linus said he will make sure the no syscall returns a value
- in -1 .. -4095 as a valid result so we can savely test with -4095. */
+ in -1 .. -4095 as a valid result so we can safely test with -4095. */
#undef PSEUDO
#define PSEUDO(name, syscall_name, args) \
--- libc/sysdeps/unix/sysv/linux/s390/s390-64/syscall.S.jj 2003-12-11 22:23:20.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/s390/s390-64/syscall.S 2005-08-18 13:37:51.000000000 +0200
@@ -54,7 +54,7 @@ ENTRY (syscall)
jl 2f
1: svc 0
j 3f
-2: ex %r1,1b-0b(%r7) /* lsb of R1 is subsituted as SVC number */
+2: ex %r1,1b-0b(%r7) /* lsb of R1 is substituted as SVC number */
3: lg %r15,0(%r15) /* load back chain */
cfi_adjust_cfa_offset (-160)
lmg %r6,15,48(%r15) /* Load registers. */
--- libc/sysdeps/unix/sysv/linux/net/ethernet.h.jj 2001-09-14 15:03:53.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/net/ethernet.h 2005-08-18 13:37:46.000000000 +0200
@@ -56,7 +56,7 @@ struct ether_header
#define ETHER_MIN_LEN (ETH_ZLEN + ETHER_CRC_LEN) /* min packet length */
#define ETHER_MAX_LEN (ETH_FRAME_LEN + ETHER_CRC_LEN) /* max packet length */
-/* make sure ethenet length is valid */
+/* make sure ethernet length is valid */
#define ETHER_IS_VALID_LEN(foo) \
((foo) >= ETHER_MIN_LEN && (foo) <= ETHER_MAX_LEN)
--- libc/sysdeps/unix/sysv/linux/net/if_shaper.h.jj 2001-07-06 06:56:18.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/net/if_shaper.h 2005-08-18 13:37:46.000000000 +0200
@@ -28,7 +28,7 @@ __BEGIN_DECLS
#define SHAPER_QLEN 10
/*
- * This is a bit speed dependant (read it shouldnt be a constant!)
+ * This is a bit speed dependent (read it shouldn't be a constant!)
*
* 5 is about right for 28.8 upwards. Below that double for every
* halving of speed or so. - ie about 20 for 9600 baud.
--- libc/sysdeps/unix/sysv/linux/powerpc/chown.c.jj 2003-09-03 13:10:51.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/powerpc/chown.c 2005-08-18 13:37:46.000000000 +0200
@@ -75,7 +75,7 @@ __chown (const char *file, uid_t owner,
}
memcpy (path, file, filelen);
- /* 'The system has an arbitrary limit...' In practise, we'll hit
+ /* 'The system has an arbitrary limit...' In practice, we'll hit
ENAMETOOLONG before this, usually. */
for (loopct = 0; loopct < 128; loopct++)
{
--- libc/sysdeps/unix/sysv/linux/powerpc/powerpc64/socket.S.jj 2004-12-21 14:33:47.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/powerpc/powerpc64/socket.S 2005-08-18 13:37:51.000000000 +0200
@@ -22,7 +22,7 @@
#define P(a, b) P2(a, b)
#define P2(a, b) a##b
-/* The socket-oriented system calls are handled unusally in Linux.
+/* The socket-oriented system calls are handled unusually in Linux.
They are all gated through the single `socketcall' system call number.
`socketcall' takes two arguments: the first is the subcode, specifying
which socket function is being called; and the second is a pointer to
--- libc/sysdeps/unix/sysv/linux/powerpc/powerpc64/sysdep.h.jj 2005-04-26 12:07:14.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/powerpc/powerpc64/sysdep.h 2005-08-18 13:37:46.000000000 +0200
@@ -29,7 +29,7 @@
#include <errno.h>
#endif
-/* Some systen calls got renamed over time, but retained the same semantics.
+/* Some system calls got renamed over time, but retained the same semantics.
Handle them here so they can be catched by both C and assembler stubs in
glibc. */
--- libc/sysdeps/unix/sysv/linux/powerpc/powerpc64/clone.S.jj 2004-12-21 14:36:18.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/powerpc/powerpc64/clone.S 2005-08-18 13:37:51.000000000 +0200
@@ -82,7 +82,7 @@ ENTRY (BP_SYM (__clone))
/* Check for child process. */
cmpdi cr1,r3,0
crandc cr1*4+eq,cr1*4+eq,cr0*4+so
- bne- cr1,L(parent) /* The '-' is to minimise the race. */
+ bne- cr1,L(parent) /* The '-' is to minimize the race. */
#ifdef RESET_PID
andis. r0,r28,CLONE_THREAD>>16
--- libc/sysdeps/unix/sysv/linux/powerpc/powerpc32/socket.S.jj 2005-06-20 11:20:12.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/powerpc/powerpc32/socket.S 2005-08-18 13:37:51.000000000 +0200
@@ -22,7 +22,7 @@
#define P(a, b) P2(a, b)
#define P2(a, b) a##b
-/* The socket-oriented system calls are handled unusally in Linux.
+/* The socket-oriented system calls are handled unusually in Linux.
They are all gated through the single `socketcall' system call number.
`socketcall' takes two arguments: the first is the subcode, specifying
which socket function is being called; and the second is a pointer to
--- libc/sysdeps/unix/sysv/linux/powerpc/powerpc32/sysdep.h.jj 2005-02-25 14:45:15.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/powerpc/powerpc32/sysdep.h 2005-08-18 13:37:46.000000000 +0200
@@ -21,7 +21,7 @@
#include <sysdeps/unix/powerpc/sysdep.h>
-/* Some systen calls got renamed over time, but retained the same semantics.
+/* Some system calls got renamed over time, but retained the same semantics.
Handle them here so they can be catched by both C and assembler stubs in
glibc. */
--- libc/sysdeps/unix/sysv/linux/powerpc/powerpc32/clone.S.jj 2005-05-26 14:21:52.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/powerpc/powerpc32/clone.S 2005-08-18 13:37:51.000000000 +0200
@@ -89,7 +89,7 @@ ENTRY (BP_SYM (__clone))
/* Check for child process. */
cmpwi cr1,r3,0
crandc cr1*4+eq,cr1*4+eq,cr0*4+so
- bne- cr1,L(parent) /* The '-' is to minimise the race. */
+ bne- cr1,L(parent) /* The '-' is to minimize the race. */
#ifndef __ASSUME_FIXED_CLONE_SYSCALL
/* On at least mklinux DR3a5, clone() doesn't actually change
--- libc/sysdeps/unix/sysv/linux/powerpc/bits/fcntl.h.jj 2004-08-30 12:04:06.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/powerpc/bits/fcntl.h 2005-08-18 13:37:46.000000000 +0200
@@ -92,8 +92,8 @@
#ifdef __USE_GNU
# define F_SETLEASE 1024 /* Set a lease. */
-# define F_GETLEASE 1025 /* Enquire what lease is active. */
-# define F_NOTIFY 1026 /* Request notfications on a directory. */
+# define F_GETLEASE 1025 /* Inquire what lease is active. */
+# define F_NOTIFY 1026 /* Request notifications on a directory. */
#endif
/* For F_[GET|SET]FL. */
@@ -131,7 +131,7 @@
# define DN_CREATE 0x00000004 /* File created. */
# define DN_DELETE 0x00000008 /* File removed. */
# define DN_RENAME 0x00000010 /* File renamed. */
-# define DN_ATTRIB 0x00000020 /* File changed attibutes. */
+# define DN_ATTRIB 0x00000020 /* File changed attributes. */
# define DN_MULTISHOT 0x80000000 /* Don't remove notifier. */
#endif
--- libc/sysdeps/unix/sysv/linux/powerpc/sys/ucontext.h.jj 2005-03-17 21:58:52.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/powerpc/sys/ucontext.h 2005-08-18 13:37:46.000000000 +0200
@@ -67,7 +67,7 @@ typedef struct
* the mcontext upto but not including the v_regs field. For kernels that
* don't AT_HWCAP or return AT_HWCAP without PPC_FEATURE_HAS_ALTIVEC the
* v_regs field may not exit and should not be referenced. The v_regd field
- * can be refernced safely only after verifying that PPC_FEATURE_HAS_ALTIVEC
+ * can be referenced safely only after verifying that PPC_FEATURE_HAS_ALTIVEC
* is set in AT_HWCAP. */
/* Number of general registers. */
@@ -116,7 +116,7 @@ typedef struct {
* either NULL (if this processor does not support the VMX feature) or the
* address of the first quadword within the allocated (vmx_reserve) area.
*
- * The pointer (v_regs) of vector type (elf_vrreg_t) is essentually
+ * The pointer (v_regs) of vector type (elf_vrreg_t) is essentially
* an array of 34 quadword entries. The entries with
* indexes 0-31 contain the corresponding vector registers. The entry with
* index 32 contains the vscr as the last word (offset 12) within the
--- libc/sysdeps/unix/sysv/linux/powerpc/sys/procfs.h.jj 2005-03-03 07:50:32.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/powerpc/sys/procfs.h 2005-08-18 13:45:15.000000000 +0200
@@ -19,7 +19,7 @@
#ifndef _SYS_PROCFS_H
#define _SYS_PROCFS_H 1
-/* This is somehow modelled after the file of the same name on SysVr4
+/* This is somehow modeled after the file of the same name on SysVr4
systems. It provides a definition of the core file format for ELF
used on Linux. */
@@ -124,7 +124,7 @@ typedef elf_gregset_t prgregset_t;
typedef elf_fpregset_t prfpregset_t;
/* We don't have any differences between processes and threads,
- therefore habe only ine PID type. */
+ therefore have only one PID type. */
typedef __pid_t lwpid_t;
--- libc/sysdeps/unix/sysv/linux/sparc/bits/fcntl.h.jj 2004-08-30 12:04:08.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/sparc/bits/fcntl.h 2005-08-18 13:37:46.000000000 +0200
@@ -99,8 +99,8 @@
#ifdef __USE_GNU
# define F_SETLEASE 1024 /* Set a lease. */
-# define F_GETLEASE 1025 /* Enquire what lease is active. */
-# define F_NOTIFY 1026 /* Request notfications on a directory. */
+# define F_GETLEASE 1025 /* Inquire what lease is active. */
+# define F_NOTIFY 1026 /* Request notifications on a directory. */
#endif
#if __WORDSIZE == 64
@@ -148,7 +148,7 @@
# define DN_CREATE 0x00000004 /* File created. */
# define DN_DELETE 0x00000008 /* File removed. */
# define DN_RENAME 0x00000010 /* File renamed. */
-# define DN_ATTRIB 0x00000020 /* File changed attibutes. */
+# define DN_ATTRIB 0x00000020 /* File changed attributes. */
# define DN_MULTISHOT 0x80000000 /* Don't remove notifier. */
#endif
--- libc/sysdeps/unix/sysv/linux/sparc/bits/resource.h.jj 2005-06-23 12:15:49.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/sparc/bits/resource.h 2005-08-18 13:37:46.000000000 +0200
@@ -95,7 +95,7 @@ enum __rlimit_resource
__RLIMIT_NICE = 13,
#define RLIMIT_NICE __RLIMIT_NICE
- /* Maximum realtime priority allowed for non-priviledged
+ /* Maximum realtime priority allowed for non-privileged
processes. */
__RLIMIT_RTPRIO = 14,
#define RLIMIT_RTPRIO __RLIMIT_RTPRIO
--- libc/sysdeps/unix/sysv/linux/sparc/sys/ucontext.h.jj 2001-07-06 06:56:21.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/sparc/sys/ucontext.h 2005-08-18 13:45:43.000000000 +0200
@@ -87,7 +87,7 @@ typedef struct ucontext {
__sigset_t uc_sigmask;
} ucontext_t;
-#endif /* __WORDISIZE == 64 */
+#endif /* __WORDSIZE == 64 */
/*
* Location of the users' stored registers relative to R0.
@@ -143,7 +143,7 @@ typedef greg_t gregset_t[NGREG];
* The following structures define how a register window can appear on the
* stack. This structure is available (when required) through the `gwins'
* field of an mcontext (nested within ucontext). SPARC_MAXWINDOW is the
- * maximum number of outstanding regiters window defined in the SPARC
+ * maximum number of outstanding registers window defined in the SPARC
* architecture (*not* implementation).
*/
#define SPARC_MAXREGWINDOW 31 /* max windows in SPARC arch. */
@@ -172,7 +172,7 @@ typedef struct gwindows
/*
* struct fq defines the minimal format of a floating point instruction queue
* entry. The size of entries in the floating point queue are implementation
- * dependent. The union FQu is guarenteed to be the first field in any ABI
+ * dependent. The union FQu is guaranteed to be the first field in any ABI
* conformant system implementation. Any additional fields provided by an
* implementation should not be used applications designed to be ABI conformant. */
--- libc/sysdeps/unix/sysv/linux/sparc/sys/ptrace.h.jj 2001-07-06 06:56:21.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/sparc/sys/ptrace.h 2005-08-18 13:37:46.000000000 +0200
@@ -25,7 +25,7 @@
#include <bits/wordsize.h>
/* Linux/SPARC kernels up to 2.3.18 do not care much
- about what namespace polution, so use a kludge now. */
+ about what namespace pollution, so use a kludge now. */
#undef PTRACE_GETREGS
#undef PTRACE_SETREGS
#undef PTRACE_GETFPREGS
--- libc/sysdeps/unix/sysv/linux/sparc/sys/procfs.h.jj 2002-05-21 04:09:49.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/sparc/sys/procfs.h 2005-08-18 13:37:46.000000000 +0200
@@ -19,7 +19,7 @@
#ifndef _SYS_PROCFS_H
#define _SYS_PROCFS_H 1
-/* This is somehow modelled after the file of the same name on SysVr4
+/* This is somehow modeled after the file of the same name on SysVr4
systems. It provides a definition of the core file format for ELF
used on Linux. */
--- libc/sysdeps/unix/sysv/linux/pathconf.c.jj 2003-09-05 12:39:10.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/pathconf.c 2005-08-18 13:37:47.000000000 +0200
@@ -62,7 +62,7 @@ __statfs_link_max (int result, const str
/* Not possible, return the default value. */
return LINUX_LINK_MAX;
- /* Some error occured. */
+ /* Some error occurred. */
return -1;
}
@@ -115,7 +115,7 @@ __statfs_filesize_max (int result, const
/* Not possible, return the default value. */
return 32;
- /* Some error occured. */
+ /* Some error occurred. */
return -1;
}
@@ -156,7 +156,7 @@ __statfs_symlinks (int result, const str
/* Not possible, return the default value. */
return 1;
- /* Some error occured. */
+ /* Some error occurred. */
return -1;
}
--- libc/sysdeps/unix/sysv/linux/mips/bits/fcntl.h.jj 2004-11-25 14:36:29.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/mips/bits/fcntl.h 2005-08-18 13:37:46.000000000 +0200
@@ -94,8 +94,8 @@
#ifdef __USE_GNU
# define F_SETLEASE 1024 /* Set a lease. */
-# define F_GETLEASE 1025 /* Enquire what lease is active. */
-# define F_NOTIFY 1026 /* Request notfications on a directory. */
+# define F_GETLEASE 1025 /* Inquire what lease is active. */
+# define F_NOTIFY 1026 /* Request notifications on a directory. */
#endif
/* for F_[GET|SET]FL */
@@ -133,7 +133,7 @@
# define DN_CREATE 0x00000004 /* File created. */
# define DN_DELETE 0x00000008 /* File removed. */
# define DN_RENAME 0x00000010 /* File renamed. */
-# define DN_ATTRIB 0x00000020 /* File changed attibutes. */
+# define DN_ATTRIB 0x00000020 /* File changed attributes. */
# define DN_MULTISHOT 0x80000000 /* Don't remove notifier. */
#endif
--- libc/sysdeps/unix/sysv/linux/mips/bits/resource.h.jj 2005-06-22 18:34:25.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/mips/bits/resource.h 2005-08-18 13:37:46.000000000 +0200
@@ -95,7 +95,7 @@ enum __rlimit_resource
__RLIMIT_NICE = 13,
#define RLIMIT_NICE __RLIMIT_NICE
- /* Maximum realtime priority allowed for non-priviledged
+ /* Maximum realtime priority allowed for non-privileged
processes. */
__RLIMIT_RTPRIO = 14,
#define RLIMIT_RTPRIO _RLIMIT_RTPRIO
--- libc/sysdeps/unix/sysv/linux/mips/sys/procfs.h.jj 2004-11-25 14:36:29.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/mips/sys/procfs.h 2005-08-18 13:46:01.000000000 +0200
@@ -20,7 +20,7 @@
#ifndef _SYS_PROCFS_H
#define _SYS_PROCFS_H 1
-/* This is somehow modelled after the file of the same name on SysVr4
+/* This is somehow modeled after the file of the same name on SysVr4
systems. It provides a definition of the core file format for ELF
used on Linux. */
@@ -116,7 +116,7 @@ typedef elf_gregset_t prgregset_t;
typedef elf_fpregset_t prfpregset_t;
/* We don't have any differences between processes and threads,
- therefore habe only ine PID type. */
+ therefore have only one PID type. */
typedef __pid_t lwpid_t;
--- libc/sysdeps/unix/sysv/linux/sh/socket.S.jj 2004-03-23 15:51:53.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/sh/socket.S 2005-08-18 13:37:51.000000000 +0200
@@ -24,7 +24,7 @@
#define P2(a, b) a##b
.text
-/* The socket-oriented system calls are handled unusally in Linux.
+/* The socket-oriented system calls are handled unusually in Linux.
They are all gated through the single `socketcall' system call number.
`socketcall' takes two arguments: the first is the subcode, specifying
which socket function is being called; and the second is a pointer to
--- libc/sysdeps/unix/sysv/linux/sh/sys/procfs.h.jj 2004-11-20 18:56:16.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/sh/sys/procfs.h 2005-08-18 13:46:13.000000000 +0200
@@ -19,7 +19,7 @@
#ifndef _SYS_PROCFS_H
#define _SYS_PROCFS_H 1
-/* This is somehow modelled after the file of the same name on SysVr4
+/* This is somehow modeled after the file of the same name on SysVr4
systems. It provides a definition of the core file format for ELF
used on Linux. */
@@ -103,7 +103,7 @@ typedef elf_gregset_t prgregset_t;
typedef elf_fpregset_t prfpregset_t;
/* We don't have any differences between processes and threads,
- therefore habe only ine PID type. */
+ therefore have only one PID type. */
typedef __pid_t lwpid_t;
--- libc/sysdeps/unix/sysv/linux/sh/sysdep.h.jj 2004-10-05 09:05:02.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/sh/sysdep.h 2005-08-18 13:37:46.000000000 +0200
@@ -43,7 +43,7 @@
might return a large offset. Therefore we must not anymore test
for < 0, but test for a real error by making sure the value in R0
is a real error number. Linus said he will make sure the no syscall
- returns a value in -1 .. -4095 as a valid result so we can savely
+ returns a value in -1 .. -4095 as a valid result so we can safely
test with -4095. */
#define _IMM1 #-1
--- libc/sysdeps/unix/sysv/linux/if_index.c.jj 2005-06-20 11:20:11.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/if_index.c 2005-08-18 13:43:13.000000000 +0200
@@ -409,7 +409,7 @@ __protocol_available (int *have_inet, in
struct ifconf ifc;
# define RQ_IFS 4
- /* Wirst case assumption. */
+ /* Worst case assumption. */
*have_inet = 0;
*have_inet6 = 0;
--- libc/sysdeps/unix/sysv/linux/i386/chown.c.jj 2004-03-10 10:32:06.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/i386/chown.c 2005-08-18 13:37:46.000000000 +0200
@@ -134,7 +134,7 @@ __chown_is_lchown (const char *file, uid
return INLINE_SYSCALL (chown, 3, CHECK_STRING (file), owner, group);
}
#elif SHLIB_COMPAT (libc, GLIBC_2_0, GLIBC_2_1)
-/* Compiling for compatibiity. */
+/* Compiling for compatibility. */
int
attribute_compat_text_section
__chown_is_lchown (const char *file, uid_t owner, gid_t group)
--- libc/sysdeps/unix/sysv/linux/i386/socket.S.jj 2005-05-03 21:44:58.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/i386/socket.S 2005-08-18 13:37:51.000000000 +0200
@@ -24,7 +24,7 @@
#define P2(a, b) a##b
.text
-/* The socket-oriented system calls are handled unusally in Linux.
+/* The socket-oriented system calls are handled unusually in Linux.
They are all gated through the single `socketcall' system call number.
`socketcall' takes two arguments: the first is the subcode, specifying
which socket function is being called; and the second is a pointer to
--- libc/sysdeps/unix/sysv/linux/i386/bits/fcntl.h.jj 2004-08-30 12:04:03.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/i386/bits/fcntl.h 2005-08-18 13:37:46.000000000 +0200
@@ -92,8 +92,8 @@
#ifdef __USE_GNU
# define F_SETLEASE 1024 /* Set a lease. */
-# define F_GETLEASE 1025 /* Enquire what lease is active. */
-# define F_NOTIFY 1026 /* Request notfications on a directory. */
+# define F_GETLEASE 1025 /* Inquire what lease is active. */
+# define F_NOTIFY 1026 /* Request notifications on a directory. */
#endif
/* For F_[GET|SET]FL. */
@@ -131,7 +131,7 @@
# define DN_CREATE 0x00000004 /* File created. */
# define DN_DELETE 0x00000008 /* File removed. */
# define DN_RENAME 0x00000010 /* File renamed. */
-# define DN_ATTRIB 0x00000020 /* File changed attibutes. */
+# define DN_ATTRIB 0x00000020 /* File changed attributes. */
# define DN_MULTISHOT 0x80000000 /* Don't remove notifier. */
#endif
--- libc/sysdeps/unix/sysv/linux/i386/sys/procfs.h.jj 2001-07-06 06:56:17.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/i386/sys/procfs.h 2005-08-18 13:37:46.000000000 +0200
@@ -19,7 +19,7 @@
#ifndef _SYS_PROCFS_H
#define _SYS_PROCFS_H 1
-/* This is somewhat modelled after the file of the same name on SVR4
+/* This is somewhat modeled after the file of the same name on SVR4
systems. It provides a definition of the core file format for ELF
used on Linux. It doesn't have anything to do with the /proc file
system, even though Linux has one.
--- libc/sysdeps/unix/sysv/linux/i386/sysdep.h.jj 2005-05-26 14:21:50.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/i386/sysdep.h 2005-08-18 13:37:46.000000000 +0200
@@ -54,7 +54,7 @@
might return a large offset. Therefore we must not anymore test
for < 0, but test for a real error by making sure the value in %eax
is a real error number. Linus said he will make sure the no syscall
- returns a value in -1 .. -4095 as a valid result so we can savely
+ returns a value in -1 .. -4095 as a valid result so we can safely
test with -4095. */
/* We don't want the label for the error handle to be global when we define
--- libc/sysdeps/unix/sysv/linux/sigprocmask.c.jj 2004-09-30 00:50:16.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/sigprocmask.c 2005-08-18 13:44:53.000000000 +0200
@@ -18,7 +18,7 @@
#include <errno.h>
#include <signal.h>
-#include <string.h> /* Neede for string function builtin redirection. */
+#include <string.h> /* Needed for string function builtin redirection. */
#include <unistd.h>
#include <sysdep.h>
--- libc/sysdeps/unix/sysv/linux/m68k/socket.S.jj 2002-12-27 23:15:18.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/m68k/socket.S 2005-08-18 13:37:51.000000000 +0200
@@ -23,7 +23,7 @@
#define P2(a, b) a##b
.text
-/* The socket-oriented system calls are handled unusally in Linux.
+/* The socket-oriented system calls are handled unusually in Linux.
They are all gated through the single `socketcall' system call number.
`socketcall' takes two arguments: the first is the subcode, specifying
which socket function is being called; and the second is a pointer to
--- libc/sysdeps/unix/sysv/linux/m68k/bits/fcntl.h.jj 2004-08-30 12:04:04.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/m68k/bits/fcntl.h 2005-08-18 13:37:46.000000000 +0200
@@ -91,8 +91,8 @@
#ifdef __USE_GNU
# define F_SETLEASE 1024 /* Set a lease. */
-# define F_GETLEASE 1025 /* Enquire what lease is active. */
-# define F_NOTIFY 1026 /* Request notfications on a directory. */
+# define F_GETLEASE 1025 /* Inquire what lease is active. */
+# define F_NOTIFY 1026 /* Request notifications on a directory. */
#endif
/* For F_[GET|SET]FL. */
@@ -130,7 +130,7 @@
# define DN_CREATE 0x00000004 /* File created. */
# define DN_DELETE 0x00000008 /* File removed. */
# define DN_RENAME 0x00000010 /* File renamed. */
-# define DN_ATTRIB 0x00000020 /* File changed attibutes. */
+# define DN_ATTRIB 0x00000020 /* File changed attributes. */
# define DN_MULTISHOT 0x80000000 /* Don't remove notifier. */
#endif
--- libc/sysdeps/unix/sysv/linux/m68k/sys/procfs.h.jj 2001-07-15 17:30:50.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/m68k/sys/procfs.h 2005-08-18 13:37:46.000000000 +0200
@@ -19,7 +19,7 @@
#ifndef _SYS_PROCFS_H
#define _SYS_PROCFS_H 1
-/* This is somewhat modelled after the file of the same name on SVR4
+/* This is somewhat modeled after the file of the same name on SVR4
systems. It provides a definition of the core file format for ELF
used on Linux. It doesn't have anything to do with the /proc file
system, even though Linux has one.
--- libc/sysdeps/unix/sysv/linux/m68k/sysdep.h.jj 2004-10-05 09:05:00.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/m68k/sysdep.h 2005-08-18 13:37:46.000000000 +0200
@@ -45,7 +45,7 @@
a large offset. Therefore we must not anymore test for < 0, but test
for a real error by making sure the value in %d0 is a real error
number. Linus said he will make sure the no syscall returns a value
- in -1 .. -4095 as a valid result so we can savely test with -4095. */
+ in -1 .. -4095 as a valid result so we can safely test with -4095. */
/* We don't want the label for the error handler to be visible in the symbol
table when we define it here. */
--- libc/sysdeps/unix/sysv/linux/bits/uio.h.jj 2001-07-06 06:56:14.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/bits/uio.h 2005-08-18 13:37:47.000000000 +0200
@@ -31,7 +31,7 @@
/* Size of object which can be written atomically.
This macro has different values in different kernel versions. The
- latest versions of ther kernel use 1024 and this is good choice. Since
+ latest versions of the kernel use 1024 and this is good choice. Since
the C library implementation of readv/writev is able to emulate the
functionality even if the currently running kernel does not support
this large value the readv/writev call will not fail because of this. */
--- libc/sysdeps/unix/sysv/linux/bits/local_lim.h.jj 2004-04-13 10:42:55.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/bits/local_lim.h 2005-08-18 13:37:47.000000000 +0200
@@ -51,7 +51,7 @@
# undef __undef_OPEN_MAX
#endif
-/* Maximum amount by which a process can descrease its asynchronous I/O
+/* Maximum amount by which a process can decrease its asynchronous I/O
priority level. */
#define AIO_PRIO_DELTA_MAX 20
--- libc/sysdeps/unix/sysv/linux/bits/resource.h.jj 2005-06-23 12:15:48.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/bits/resource.h 2005-08-18 13:37:47.000000000 +0200
@@ -95,7 +95,7 @@ enum __rlimit_resource
__RLIMIT_NICE = 13,
#define RLIMIT_NICE __RLIMIT_NICE
- /* Maximum realtime priority allowed for non-priviledged
+ /* Maximum realtime priority allowed for non-privileged
processes. */
__RLIMIT_RTPRIO = 14,
#define RLIMIT_RTPRIO __RLIMIT_RTPRIO
--- libc/sysdeps/unix/sysv/linux/init-first.c.jj 2005-01-08 16:50:29.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/init-first.c 2005-08-18 13:37:47.000000000 +0200
@@ -33,7 +33,7 @@
used in the process. Safe assumption if initializer never runs. */
int __libc_multiple_libcs attribute_hidden = 1;
-/* Remember the command line argument and enviroment contents for
+/* Remember the command line argument and environment contents for
later calls of initializers for dynamic libraries. */
int __libc_argc attribute_hidden;
char **__libc_argv attribute_hidden;
--- libc/sysdeps/unix/sysv/linux/ia64/clone2.S.jj 2004-12-13 09:40:02.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/ia64/clone2.S 2005-08-18 13:37:51.000000000 +0200
@@ -99,6 +99,6 @@ PSEUDO_END(__clone2)
/* For now we leave __clone undefined. This is unlikely to be a */
/* problem, since at least the i386 __clone in glibc always failed */
-/* with a 0 sp (eventhough the kernel explicitly handled it). */
+/* with a 0 sp (even though the kernel explicitly handled it). */
/* Thus all such calls needed to pass an explicit sp, and as a result, */
/* would be unlikely to work on ia64. */
--- libc/sysdeps/unix/sysv/linux/ia64/bits/fcntl.h.jj 2004-08-30 12:04:03.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/ia64/bits/fcntl.h 2005-08-18 13:37:47.000000000 +0200
@@ -88,8 +88,8 @@
#ifdef __USE_GNU
# define F_SETLEASE 1024 /* Set a lease. */
-# define F_GETLEASE 1025 /* Enquire what lease is active. */
-# define F_NOTIFY 1026 /* Request notfications on a directory. */
+# define F_GETLEASE 1025 /* Inquire what lease is active. */
+# define F_NOTIFY 1026 /* Request notifications on a directory. */
#endif
/* For F_[GET|SET]FL. */
@@ -128,7 +128,7 @@
# define DN_CREATE 0x00000004 /* File created. */
# define DN_DELETE 0x00000008 /* File removed. */
# define DN_RENAME 0x00000010 /* File renamed. */
-# define DN_ATTRIB 0x00000020 /* File changed attibutes. */
+# define DN_ATTRIB 0x00000020 /* File changed attributes. */
# define DN_MULTISHOT 0x80000000 /* Don't remove notifier. */
#endif
--- libc/sysdeps/unix/sysv/linux/ia64/sys/rse.h.jj 2001-07-06 06:56:17.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/ia64/sys/rse.h 2005-08-18 13:37:47.000000000 +0200
@@ -50,7 +50,7 @@ ia64_rse_rnat_addr (unsigned long *slot_
return (unsigned long *) ((unsigned long) slot_addr | (0x3f << 3));
}
-/* Calcuate the number of registers in the dirty partition starting at
+/* Calculate the number of registers in the dirty partition starting at
BSPSTORE with a size of DIRTY bytes. This isn't simply DIRTY
divided by eight because the 64th slot is used to store ar.rnat. */
--- libc/sysdeps/unix/sysv/linux/ia64/sys/procfs.h.jj 2003-11-29 10:20:18.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/ia64/sys/procfs.h 2005-08-18 13:46:25.000000000 +0200
@@ -19,7 +19,7 @@
#ifndef _SYS_PROCFS_H
#define _SYS_PROCFS_H 1
-/* This is somehow modelled after the file of the same name on SysVr4
+/* This is somehow modeled after the file of the same name on SysVr4
systems. It provides a definition of the core file format for ELF
used on Linux. */
@@ -118,7 +118,7 @@ typedef gregset_t prgregset_t;
typedef fpregset_t prfpregset_t;
/* We don't have any differences between processes and threads,
- therefore habe only ine PID type. */
+ therefore have only one PID type. */
typedef __pid_t lwpid_t;
--- libc/sysdeps/unix/sysv/linux/ia64/sysdep.h.jj 2004-09-28 01:11:41.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/ia64/sysdep.h 2005-08-18 13:37:47.000000000 +0200
@@ -99,7 +99,7 @@
a large offset. Therefore we must not anymore test for < 0, but test
for a real error by making sure the value in %d0 is a real error
number. Linus said he will make sure the no syscall returns a value
- in -1 .. -4095 as a valid result so we can savely test with -4095. */
+ in -1 .. -4095 as a valid result so we can safely test with -4095. */
/* We don't want the label for the error handler to be visible in the symbol
table when we define it here. */
--- libc/sysdeps/unix/sysv/linux/sys/epoll.h.jj 2004-01-27 15:44:26.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/sys/epoll.h 2005-08-18 13:37:47.000000000 +0200
@@ -53,9 +53,9 @@ enum EPOLL_EVENTS
/* Valid opcodes ( "op" parameter ) to issue to epoll_ctl(). */
-#define EPOLL_CTL_ADD 1 /* Add a file decriptor to the interface. */
-#define EPOLL_CTL_DEL 2 /* Remove a file decriptor from the interface. */
-#define EPOLL_CTL_MOD 3 /* Change file decriptor epoll_event structure. */
+#define EPOLL_CTL_ADD 1 /* Add a file descriptor to the interface. */
+#define EPOLL_CTL_DEL 2 /* Remove a file descriptor from the interface. */
+#define EPOLL_CTL_MOD 3 /* Change file descriptor epoll_event structure. */
typedef union epoll_data
--- libc/sysdeps/unix/sysv/linux/sys/procfs.h.jj 2001-07-06 06:56:21.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/sys/procfs.h 2005-08-18 13:46:39.000000000 +0200
@@ -19,7 +19,7 @@
#ifndef _SYS_PROCFS_H
#define _SYS_PROCFS_H 1
-/* This is somehow modelled after the file of the same name on SysVr4
+/* This is somehow modeled after the file of the same name on SysVr4
systems. It provides a definition of the core file format for ELF
used on Linux. */
@@ -103,7 +103,7 @@ typedef gregset_t prgregset_t;
typedef fpregset_t prfpregset_t;
/* We don't have any differences between processes and threads,
- therefore habe only ine PID type. */
+ therefore have only one PID type. */
typedef __pid_t lwpid_t;
--- libc/sysdeps/unix/sysv/linux/sys/inotify.h.jj 2005-08-17 08:16:54.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/sys/inotify.h 2005-08-18 13:37:47.000000000 +0200
@@ -37,8 +37,8 @@ struct inotify_event
#define IN_ACCESS 0x00000001 /* File was accessed. */
#define IN_MODIFY 0x00000002 /* File was modified. */
#define IN_ATTRIB 0x00000004 /* Metadata changed. */
-#define IN_CLOSE_WRITE 0x00000008 /* Writtable file was closed. */
-#define IN_CLOSE_NOWRITE 0x00000010 /* Unwrittable file closed. */
+#define IN_CLOSE_WRITE 0x00000008 /* Writable file was closed. */
+#define IN_CLOSE_NOWRITE 0x00000010 /* Unwritable file closed. */
#define IN_CLOSE (IN_CLOSE_WRITE | IN_CLOSE_NOWRITE) /* Close. */
#define IN_OPEN 0x00000020 /* File was opened. */
#define IN_MOVED_FROM 0x00000040 /* File was moved from X. */
--- libc/sysdeps/unix/sysv/linux/hppa/bits/fcntl.h.jj 2004-08-30 12:04:02.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/hppa/bits/fcntl.h 2005-08-18 13:37:47.000000000 +0200
@@ -91,8 +91,8 @@
#ifdef __USE_GNU
# define F_SETLEASE 1024 /* Set a lease. */
-# define F_GETLEASE 1025 /* Enquire what lease is active. */
-# define F_NOTIFY 1026 /* Request notfications on a directory. */
+# define F_GETLEASE 1025 /* Inquire what lease is active. */
+# define F_NOTIFY 1026 /* Request notifications on a directory. */
#endif
/* for F_[GET|SET]FL */
@@ -123,7 +123,7 @@
# define DN_CREATE 0x00000004 /* File created. */
# define DN_DELETE 0x00000008 /* File removed. */
# define DN_RENAME 0x00000010 /* File renamed. */
-# define DN_ATTRIB 0x00000020 /* File changed attibutes. */
+# define DN_ATTRIB 0x00000020 /* File changed attributes. */
# define DN_MULTISHOT 0x80000000 /* Don't remove notifier. */
#endif
--- libc/sysdeps/unix/sysv/linux/hppa/bits/mman.h.jj 2003-09-30 00:23:24.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/hppa/bits/mman.h 2005-08-18 13:37:47.000000000 +0200
@@ -57,7 +57,7 @@
#define MADV_RANDOM 1 /* expect random page references */
#define MADV_SEQUENTIAL 2 /* expect sequential page references */
#define MADV_WILLNEED 3 /* will need these pages */
-#define MADV_DONTNEED 4 /* dont need these pages */
+#define MADV_DONTNEED 4 /* don't need these pages */
#define MADV_SPACEAVAIL 5 /* insure that resources are reserved */
#define MADV_VPS_PURGE 6 /* Purge pages from VM page cache */
#define MADV_VPS_INHERIT 7 /* Inherit parents page size */
--- libc/sysdeps/unix/sysv/linux/hppa/sys/procfs.h.jj 2001-07-06 06:56:16.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/hppa/sys/procfs.h 2005-08-18 13:37:47.000000000 +0200
@@ -19,7 +19,7 @@
#ifndef _SYS_PROCFS_H
#define _SYS_PROCFS_H 1
-/* This is somewhat modelled after the file of the same name on SVR4
+/* This is somewhat modeled after the file of the same name on SVR4
systems. It provides a definition of the core file format for ELF
used on Linux. It doesn't have anything to do with the /proc file
system, even though Linux has one.
--- libc/sysdeps/unix/sysv/linux/hppa/sysdep.h.jj 2003-11-04 19:33:16.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/hppa/sysdep.h 2005-08-18 13:37:47.000000000 +0200
@@ -161,7 +161,7 @@
#define SYSCALL_PIC_SETUP /* Nothing. */
-/* All the syscall assembly macros rely on finding the approriate
+/* All the syscall assembly macros rely on finding the appropriate
SYSCALL_ERROR_LABEL or rather HANDLER. */
/* int * __errno_location(void) so you have to store your value
--- libc/sysdeps/unix/sysv/linux/hppa/kernel_sigaction.h.jj 2000-10-15 05:26:50.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/hppa/kernel_sigaction.h 2005-08-18 13:46:56.000000000 +0200
@@ -1,7 +1,7 @@
/* We have a separate header file here because we do not support
SA_RESTORER on hppa. */
-/* This is the sigaction struction from the Linux 2.1.20 kernel. */
+/* This is the sigaction structure from the Linux 2.1.20 kernel. */
/* Blah. This is bogus. We don't ever use it. */
struct old_kernel_sigaction {
__sighandler_t k_sa_handler;
--- libc/sysdeps/unix/sysv/linux/netax25/ax25.h.jj 2001-07-06 06:56:18.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/netax25/ax25.h 2005-08-18 13:37:47.000000000 +0200
@@ -63,7 +63,7 @@
#define AX25_DIGI_INBAND 0x01 /* Allow digipeating within port */
#define AX25_DIGI_XBAND 0x02 /* Allow digipeating across ports */
-/* Maximim number of digipeaters: */
+/* Maximum number of digipeaters: */
#define AX25_MAX_DIGIS 8
@@ -81,7 +81,7 @@ struct sockaddr_ax25
};
/*
- * The sockaddr struct with the digipeater adresses:
+ * The sockaddr struct with the digipeater addresses:
*/
struct full_sockaddr_ax25
{
--- libc/sysdeps/unix/sysv/linux/x86_64/swapcontext.S.jj 2005-06-06 11:41:20.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/x86_64/swapcontext.S 2005-08-18 13:37:51.000000000 +0200
@@ -26,7 +26,7 @@
/* int __swapcontext (ucontext_t *oucp, const ucontext_t *ucp);
Saves the machine context in oucp such that when it is activated,
- it appears as if __swapcontextt() returned again, restores the
+ it appears as if __swapcontext() returned again, restores the
machine context in ucp and thereby resumes execution in that
context.
--- libc/sysdeps/unix/sysv/linux/x86_64/bits/fcntl.h.jj 2004-08-30 12:04:09.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/x86_64/bits/fcntl.h 2005-08-18 13:37:47.000000000 +0200
@@ -106,8 +106,8 @@
#ifdef __USE_GNU
# define F_SETLEASE 1024 /* Set a lease. */
-# define F_GETLEASE 1025 /* Enquire what lease is active. */
-# define F_NOTIFY 1026 /* Request notfications on a directory. */
+# define F_GETLEASE 1025 /* Inquire what lease is active. */
+# define F_NOTIFY 1026 /* Request notifications on a directory. */
#endif
/* For F_[GET|SET]FL. */
@@ -145,7 +145,7 @@
# define DN_CREATE 0x00000004 /* File created. */
# define DN_DELETE 0x00000008 /* File removed. */
# define DN_RENAME 0x00000010 /* File renamed. */
-# define DN_ATTRIB 0x00000020 /* File changed attibutes. */
+# define DN_ATTRIB 0x00000020 /* File changed attributes. */
# define DN_MULTISHOT 0x80000000 /* Don't remove notifier. */
#endif
--- libc/sysdeps/unix/sysv/linux/x86_64/sys/epoll.h.jj 2004-01-27 15:44:26.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/x86_64/sys/epoll.h 2005-08-18 13:37:47.000000000 +0200
@@ -53,9 +53,9 @@ enum EPOLL_EVENTS
/* Valid opcodes ( "op" parameter ) to issue to epoll_ctl(). */
-#define EPOLL_CTL_ADD 1 /* Add a file decriptor to the interface. */
-#define EPOLL_CTL_DEL 2 /* Remove a file decriptor from the interface. */
-#define EPOLL_CTL_MOD 3 /* Change file decriptor epoll_event structure. */
+#define EPOLL_CTL_ADD 1 /* Add a file descriptor to the interface. */
+#define EPOLL_CTL_DEL 2 /* Remove a file descriptor from the interface. */
+#define EPOLL_CTL_MOD 3 /* Change file descriptor epoll_event structure. */
typedef union epoll_data
--- libc/sysdeps/unix/sysv/linux/x86_64/sys/procfs.h.jj 2004-11-09 12:26:48.000000000 +0100
+++ libc/sysdeps/unix/sysv/linux/x86_64/sys/procfs.h 2005-08-18 13:37:47.000000000 +0200
@@ -19,7 +19,7 @@
#ifndef _SYS_PROCFS_H
#define _SYS_PROCFS_H 1
-/* This is somewhat modelled after the file of the same name on SVR4
+/* This is somewhat modeled after the file of the same name on SVR4
systems. It provides a definition of the core file format for ELF
used on Linux. It doesn't have anything to do with the /proc file
system, even though Linux has one.
--- libc/sysdeps/unix/sysv/linux/x86_64/sysdep.h.jj 2005-04-13 21:29:57.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/x86_64/sysdep.h 2005-08-18 13:37:47.000000000 +0200
@@ -63,7 +63,7 @@
might return a large offset. Therefore we must not anymore test
for < 0, but test for a real error by making sure the value in %eax
is a real error number. Linus said he will make sure the no syscall
- returns a value in -1 .. -4095 as a valid result so we can savely
+ returns a value in -1 .. -4095 as a valid result so we can safely
test with -4095. */
/* We don't want the label for the error handle to be global when we define
@@ -182,7 +182,7 @@
The Linux kernel uses and destroys internally these registers:
return address from
syscall rcx
- additionally clobered: r12-r15,rbx,rbp
+ additionally clobbered: r12-r15,rbx,rbp
eflags from syscall r11
Normal function call, including calls to the system call stub
--- libc/sysdeps/unix/sysv/linux/dl-osinfo.h.jj 2005-08-08 09:16:33.000000000 +0200
+++ libc/sysdeps/unix/sysv/linux/dl-osinfo.h 2005-08-18 13:37:46.000000000 +0200
@@ -152,7 +152,7 @@ _dl_discover_osversion (void)
\
/* Now we can test with the required version. */ \
if (__LINUX_KERNEL_VERSION > 0 && version < __LINUX_KERNEL_VERSION) \
- /* Not sufficent. */ \
+ /* Not sufficient. */ \
FATAL ("FATAL: kernel too old\n"); \
} \
else if (__LINUX_KERNEL_VERSION > 0) \
--- libc/sysdeps/gnu/netinet/tcp.h.jj 2001-04-29 14:30:59.000000000 +0200
+++ libc/sysdeps/gnu/netinet/tcp.h 2005-08-18 13:37:47.000000000 +0200
@@ -64,7 +64,7 @@ struct tcphdr
u_int16_t th_sport; /* source port */
u_int16_t th_dport; /* destination port */
tcp_seq th_seq; /* sequence number */
- tcp_seq th_ack; /* acknowledgement number */
+ tcp_seq th_ack; /* acknowledgment number */
# if __BYTE_ORDER == __LITTLE_ENDIAN
u_int8_t th_x2:4; /* (unused) */
u_int8_t th_off:4; /* data offset */
--- libc/sysdeps/alpha/hp-timing.h.jj 2001-09-01 08:08:44.000000000 +0200
+++ libc/sysdeps/alpha/hp-timing.h 2005-08-18 13:37:47.000000000 +0200
@@ -27,7 +27,7 @@
/* The macros defined here use the timestamp counter in IA-64. They
provide a very accurate way to measure the time with very little
- overhead. The time values themself have no real meaning, only
+ overhead. The time values themselves have no real meaning, only
differences are interesting.
The list of macros we need includes the following:
--- libc/sysdeps/alpha/fpu/bits/fenv.h.jj 2001-07-06 06:55:47.000000000 +0200
+++ libc/sysdeps/alpha/fpu/bits/fenv.h 2005-08-18 13:47:17.000000000 +0200
@@ -60,7 +60,7 @@ enum
#define FE_ALL_EXCEPT FE_ALL_EXCEPT
};
-/* Alpha chips support all four defined rouding modes.
+/* Alpha chips support all four defined rounding modes.
Note that code must be compiled to use dynamic rounding (/d) instructions
to see these changes. For gcc this is -mfp-rounding-mode=d; for DEC cc
--- libc/sysdeps/alpha/bits/atomic.h.jj 2004-01-27 15:44:24.000000000 +0100
+++ libc/sysdeps/alpha/bits/atomic.h 2005-08-18 13:37:47.000000000 +0200
@@ -151,7 +151,7 @@ typedef uintmax_t uatomic_max_t;
: "memory"); \
})
-/* For all "bool" routines, we return FALSE if exchange succesful. */
+/* For all "bool" routines, we return FALSE if exchange successful. */
#define __arch_compare_and_exchange_bool_8_int(mem, new, old, mb1, mb2) \
({ unsigned long __prev; int __cmp; \
--- libc/sysdeps/alpha/soft-fp/ots_cvtqux.c.jj 2004-03-06 21:46:23.000000000 +0100
+++ libc/sysdeps/alpha/soft-fp/ots_cvtqux.c 2005-08-18 13:37:47.000000000 +0200
@@ -22,7 +22,7 @@
#include "local-soft-fp.h"
/* Should never actually be used, since we've more bits of precision
- than the incomming long, but needed for linkage. */
+ than the incoming long, but needed for linkage. */
#undef FP_ROUNDMODE
#define FP_ROUNDMODE FP_RND_ZERO
--- libc/sysdeps/alpha/soft-fp/ots_cvtqx.c.jj 2004-03-06 21:46:23.000000000 +0100
+++ libc/sysdeps/alpha/soft-fp/ots_cvtqx.c 2005-08-18 13:37:47.000000000 +0200
@@ -22,7 +22,7 @@
#include "local-soft-fp.h"
/* Should never actually be used, since we've more bits of precision
- than the incomming long, but needed for linkage. */
+ than the incoming long, but needed for linkage. */
#undef FP_ROUNDMODE
#define FP_ROUNDMODE FP_RND_ZERO
--- libc/sysdeps/s390/s390-32/elf/setjmp.S.jj 2003-12-11 22:23:20.000000000 +0100
+++ libc/sysdeps/s390/s390-32/elf/setjmp.S 2005-08-18 13:37:51.000000000 +0200
@@ -28,20 +28,20 @@
ENTRY (setjmp)
.weak C_SYMBOL_NAME (setjmp)
lhi %r3,1 /* second argument of one */
- j .Linternal_sigsetjmp /* branch relativ to __sigsetjmp */
+ j .Linternal_sigsetjmp /* branch relative to __sigsetjmp */
END (setjmp)
/* Binary compatibility entry point. */
ENTRY(_setjmp)
.weak C_SYMBOL_NAME (_setjmp)
lhi %r3,0 /* second argument of zero */
- j .Linternal_sigsetjmp /* branch relativ to __sigsetjmp */
+ j .Linternal_sigsetjmp /* branch relative to __sigsetjmp */
END (_setjmp)
libc_hidden_def (_setjmp)
ENTRY(__setjmp)
lhi %r3,0 /* second argument of zero */
- j .Linternal_sigsetjmp /* branch relativ to __sigsetjmp */
+ j .Linternal_sigsetjmp /* branch relative to __sigsetjmp */
END (__setjmp)
ENTRY(__sigsetjmp)
--- libc/sysdeps/s390/s390-32/s390-mcount.S.jj 2005-06-06 11:41:12.000000000 +0200
+++ libc/sysdeps/s390/s390-32/s390-mcount.S 2005-08-18 13:37:51.000000000 +0200
@@ -1,4 +1,4 @@
-/* S/390-specific implemetation of profiling support.
+/* S/390-specific implementation of profiling support.
Copyright (C) 2000, 2001 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by Martin Schwidefsky (schwidefsky@de.ibm.com)
--- libc/sysdeps/s390/fpu/bits/fenv.h.jj 2001-07-06 06:56:02.000000000 +0200
+++ libc/sysdeps/s390/fpu/bits/fenv.h 2005-08-18 13:37:47.000000000 +0200
@@ -36,7 +36,7 @@ enum
FE_INEXACT = 0x08
#define FE_INEXACT FE_INEXACT
};
-/* We dont use the y bit of the DXC in the floating point control register
+/* We don't use the y bit of the DXC in the floating point control register
as glibc has no FE encoding for fe inexact incremented
or fe inexact truncated.
We currently use the flag bits in the fpc
--- libc/sysdeps/s390/s390-64/s390x-mcount.S.jj 2005-06-06 11:41:12.000000000 +0200
+++ libc/sysdeps/s390/s390-64/s390x-mcount.S 2005-08-18 13:37:51.000000000 +0200
@@ -1,4 +1,4 @@
-/* 64 bit S/390-specific implemetation of profiling support.
+/* 64 bit S/390-specific implementation of profiling support.
Copyright (C) 2001 Free Software Foundation, Inc.
Contributed by Martin Schwidefsky (schwidefsky@de.ibm.com)
This file is part of the GNU C Library.
--- libc/sysdeps/s390/s390-64/elf/setjmp.S.jj 2003-12-11 22:23:20.000000000 +0100
+++ libc/sysdeps/s390/s390-64/elf/setjmp.S 2005-08-18 13:37:51.000000000 +0200
@@ -28,20 +28,20 @@
ENTRY (setjmp)
.weak C_SYMBOL_NAME (setjmp)
lghi %r3,1 /* Second argument of one. */
- j .Linternal_sigsetjmp /* Branch relativ to __sigsetjmp. */
+ j .Linternal_sigsetjmp /* Branch relative to __sigsetjmp. */
END (setjmp)
/* Binary compatibility entry point. */
ENTRY(_setjmp)
.weak C_SYMBOL_NAME (_setjmp)
slgr %r3,%r3 /* Second argument of zero. */
- j .Linternal_sigsetjmp /* Branch relativ to __sigsetjmp. */
+ j .Linternal_sigsetjmp /* Branch relative to __sigsetjmp. */
END (setjmp)
libc_hidden_def (_setjmp)
ENTRY(__setjmp)
slgr %r3,%r3 /* Second argument of zero. */
- j .Linternal_sigsetjmp /* Branch relativ to __sigsetjmp. */
+ j .Linternal_sigsetjmp /* Branch relative to __sigsetjmp. */
END (setjmp)
ENTRY(__sigsetjmp)
--- libc/sysdeps/pthread/aio_misc.c.jj 2004-08-14 18:18:43.000000000 +0200
+++ libc/sysdeps/pthread/aio_misc.c 2005-08-18 13:37:47.000000000 +0200
@@ -88,7 +88,7 @@ static int idle_thread_count;
static struct aioinit optim =
{
20, /* int aio_threads; Maximal number of threads. */
- 64, /* int aio_num; Number of expected simultanious requests. */
+ 64, /* int aio_num; Number of expected simultaneous requests. */
0,
0,
0,
@@ -366,7 +366,7 @@ __aio_enqueue_request (aiocb_union *aioc
/* The current file descriptor is worked on. It makes no sense
to start another thread since this new thread would fight
with the running thread for the resources. But we also cannot
- say that the thread processing this desriptor shall immediately
+ say that the thread processing this descriptor shall immediately
after finishing the current job process this request if there
are other threads in the running queue which have a higher
priority. */
--- libc/sysdeps/pthread/aio_cancel.c.jj 2003-07-30 12:00:43.000000000 +0200
+++ libc/sysdeps/pthread/aio_cancel.c 2005-08-18 13:37:47.000000000 +0200
@@ -108,7 +108,7 @@ aio_cancel (fildes, aiocbp)
else
{
/* Find the beginning of the list of all requests for this
- desriptor. */
+ descriptor. */
req = __aio_find_req_fd (fildes);
/* If any request is worked on by a thread it must be the first.
--- libc/sysdeps/powerpc/powerpc64/bsd-_setjmp.S.jj 2004-10-12 15:52:09.000000000 +0200
+++ libc/sysdeps/powerpc/powerpc64/bsd-_setjmp.S 2005-08-18 13:37:51.000000000 +0200
@@ -45,7 +45,7 @@ libc_hidden_def (__novmx_setjmp)
# endif /* defined SHARED && SHLIB_COMPAT (libc, GLIBC_2_3, GLIBC_2_3_4) */
default_symbol_version (__vmx_setjmp,_setjmp,GLIBC_2.3.4)
-/* __GI__setjmp prototype is needed for ntpl i.e. _setjmp is defined
+/* __GI__setjmp prototype is needed for nptl i.e. _setjmp is defined
as a libc_hidden_proto & is used in sysdeps/generic/libc-start.c
if HAVE_CLEANUP_JMP_BUF is defined */
ENTRY (BP_SYM (__GI__setjmp))
--- libc/sysdeps/powerpc/powerpc64/fpu/s_trunc.S.jj 2005-01-08 16:50:27.000000000 +0100
+++ libc/sysdeps/powerpc/powerpc64/fpu/s_trunc.S 2005-08-18 13:37:51.000000000 +0200
@@ -46,7 +46,7 @@ EALIGN (__trunc, 4, 0)
fsub fp1,fp1,fp13 /* x-= TWO52; */
fabs fp1,fp1 /* if (x == 0.0) */
/* x = 0.0; */
- mtfsf 0x01,fp11 /* restore previous truncing mode. */
+ mtfsf 0x01,fp11 /* restore previous truncation mode. */
blr
.L4:
bge- cr6,.L9 /* if (x < 0.0) */
--- libc/sysdeps/powerpc/powerpc64/fpu/s_truncf.S.jj 2005-01-08 16:50:27.000000000 +0100
+++ libc/sysdeps/powerpc/powerpc64/fpu/s_truncf.S 2005-08-18 13:37:51.000000000 +0200
@@ -46,7 +46,7 @@ EALIGN (__truncf, 4, 0)
fsubs fp1,fp1,fp13 /* x-= TWO23; */
fabs fp1,fp1 /* if (x == 0.0) */
/* x = 0.0; */
- mtfsf 0x01,fp11 /* restore previous truncing mode. */
+ mtfsf 0x01,fp11 /* restore previous truncation mode. */
blr
.L4:
bge- cr6,.L9 /* if (x < 0.0) */
--- libc/sysdeps/powerpc/powerpc64/elf/entry.h.jj 2002-09-14 10:54:53.000000000 +0200
+++ libc/sysdeps/powerpc/powerpc64/elf/entry.h 2005-08-18 13:37:47.000000000 +0200
@@ -29,6 +29,6 @@ extern void _start (void);
/* Use the address of ._start as the lowest address for which we need
to keep profiling records. We can't copy the ia64 scheme as our
- entry poiny address is really the address of the function
+ entry point address is really the address of the function
descriptor, not the actual function entry. */
#define TEXT_START (((long int *) ENTRY_POINT)[0])
--- libc/sysdeps/powerpc/powerpc64/strncmp.S.jj 2004-10-12 15:52:09.000000000 +0200
+++ libc/sysdeps/powerpc/powerpc64/strncmp.S 2005-08-18 13:37:51.000000000 +0200
@@ -50,7 +50,7 @@ EALIGN (BP_SYM(strncmp), 4, 0)
clrldi. rTMP, rTMP, 61
lis rFEFE, -0x101
bne L(unaligned)
-/* We are doubleword alligned so set up for two loops. first a double word
+/* We are doubleword aligned so set up for two loops. first a double word
loop, then fall into the byte loop if any residual. */
srdi. rTMP, rN, 3
clrldi rN, rN, 61
--- libc/sysdeps/powerpc/powerpc64/bits/atomic.h.jj 2004-09-14 00:33:01.000000000 +0200
+++ libc/sysdeps/powerpc/powerpc64/bits/atomic.h 2005-08-18 13:48:25.000000000 +0200
@@ -19,7 +19,7 @@
02111-1307 USA. */
/* The 32-bit exchange_bool is different on powerpc64 because the subf
- does signed 64-bit arthmatic while the lwarx is 32-bit unsigned
+ does signed 64-bit arithmetics while the lwarx is 32-bit unsigned
(a load word and zero (high 32) form) load.
In powerpc64 register values are 64-bit by default, including oldval.
The value in old val unknown sign extension, lwarx loads the 32-bit
--- libc/sysdeps/powerpc/powerpc64/memcpy.S.jj 2004-10-12 15:52:09.000000000 +0200
+++ libc/sysdeps/powerpc/powerpc64/memcpy.S 2005-08-18 13:37:51.000000000 +0200
@@ -29,11 +29,11 @@
with the appropriate combination of byte and halfword load/stores.
There is minimal effort to optimize the alignment of short moves.
The 64-bit implementations of POWER3 and POWER4 do a reasonable job
- of handling unligned load/stores that do not cross 32-byte boundries.
+ of handling unaligned load/stores that do not cross 32-byte boundaries.
Longer moves (>= 32-bytes) justify the effort to get at least the
destination doubleword (8-byte) aligned. Further optimization is
- posible when both source and destination are doubleword aligned.
+ possible when both source and destination are doubleword aligned.
Each case has a optimized unrolled loop. */
EALIGN (BP_SYM (memcpy), 5, 0)
@@ -43,9 +43,9 @@ EALIGN (BP_SYM (memcpy), 5, 0)
neg 0,3
std 3,-16(1)
std 31,-8(1)
- andi. 11,3,7 /* check alignement of dst. */
+ andi. 11,3,7 /* check alignment of dst. */
clrldi 0,0,61 /* Number of bytes until the 1st doubleword of dst. */
- clrldi 10,4,61 /* check alignement of src. */
+ clrldi 10,4,61 /* check alignment of src. */
cmpldi cr6,5,8
ble- cr1,.L2 /* If move < 32 bytes use short move code. */
cmpld cr6,10,11
@@ -56,7 +56,7 @@ EALIGN (BP_SYM (memcpy), 5, 0)
beq .L0
subf 31,0,5
- /* Move 0-7 bytes as needed to get the destination doubleword alligned. */
+ /* Move 0-7 bytes as needed to get the destination doubleword aligned. */
1: bf 31,2f
lbz 6,0(12)
addi 12,12,1
@@ -73,10 +73,10 @@ EALIGN (BP_SYM (memcpy), 5, 0)
stw 6,0(3)
addi 3,3,4
0:
- clrldi 10,12,61 /* check alignement of src again. */
+ clrldi 10,12,61 /* check alignment of src again. */
srdi 9,31,3 /* Number of full double words remaining. */
- /* Copy doublewords from source to destination, assumpting the
+ /* Copy doublewords from source to destination, assuming the
destination is aligned on a doubleword boundary.
At this point we know there are at least 25 bytes left (32-7) to copy.
@@ -152,7 +152,7 @@ EALIGN (BP_SYM (memcpy), 5, 0)
add 12,12,0
/* At this point we have a tail of 0-7 bytes and we know that the
- destiniation is double word aligned. */
+ destination is double word aligned. */
4: bf 29,2f
lwz 6,0(12)
addi 12,12,4
@@ -282,7 +282,7 @@ EALIGN (BP_SYM (memcpy), 5, 0)
bne cr6,4f
/* Would have liked to use use ld/std here but the 630 processors are
slow for load/store doubles that are not at least word aligned.
- Unaligned Load/Store word execute with only a 1 cycle penaltity. */
+ Unaligned Load/Store word execute with only a 1 cycle penalty. */
lwz 6,0(4)
lwz 7,4(4)
stw 6,0(3)
--- libc/sysdeps/powerpc/powerpc64/dl-machine.h.jj 2005-05-20 10:36:08.000000000 +0200
+++ libc/sysdeps/powerpc/powerpc64/dl-machine.h 2005-08-18 13:37:47.000000000 +0200
@@ -174,7 +174,7 @@ DL_STARTING_UP_DEF \
" .popsection\n" \
" .type " BODY_PREFIX "_dl_start_user,@function\n" \
" " ENTRY_2(_dl_start_user) "\n" \
-/* Now, we do our main work of calling initialisation procedures. \
+/* Now, we do our main work of calling initialization procedures. \
The ELF ABI doesn't say anything about parameters for these, \
so we just pass argc, argv, and the environment. \
Changing these is strongly discouraged (not least because argc is \
@@ -204,7 +204,7 @@ BODY_PREFIX "_dl_start_user:\n" \
" sldi 5,3,3\n" \
" add 6,4,5\n" \
" addi 5,6,8\n" \
-/* Pass the auxilary vector in r6. This is passed to us just after \
+/* Pass the auxiliary vector in r6. This is passed to us just after \
_envp. */ \
"2: ldu 0,8(6)\n" \
" cmpdi 0,0\n" \
@@ -317,13 +317,13 @@ elf_machine_runtime_setup (struct link_m
/* Relocate the DT_PPC64_GLINK entry in the _DYNAMIC section.
elf_get_dynamic_info takes care of the standard entries but
doesn't know exactly what to do with processor specific
- entires. */
+ entries. */
if (info[DT_PPC64(GLINK)] != NULL)
info[DT_PPC64(GLINK)]->d_un.d_ptr += l_addr;
if (lazy)
{
- /* The function descriptor of the appropriate trampline
+ /* The function descriptor of the appropriate trampoline
routine is used to set the 1st and 2nd doubleword of the
plt_reserve. */
Elf64_FuncDesc *resolve_fd;
--- libc/sysdeps/powerpc/powerpc32/dl-machine.c.jj 2005-01-08 16:50:27.000000000 +0100
+++ libc/sysdeps/powerpc/powerpc32/dl-machine.c 2005-08-18 13:37:47.000000000 +0200
@@ -26,7 +26,7 @@
#include <dl-machine.h>
#include <stdio-common/_itoa.h>
-/* The value __cache_line_size is defined in memset.S and is initialised
+/* The value __cache_line_size is defined in memset.S and is initialized
by _dl_sysdep_start via DL_PLATFORM_INIT. */
extern int __cache_line_size;
weak_extern (__cache_line_size)
--- libc/sysdeps/powerpc/powerpc32/bsd-_setjmp.S.jj 2005-05-26 14:21:40.000000000 +0200
+++ libc/sysdeps/powerpc/powerpc32/bsd-_setjmp.S 2005-08-18 13:37:51.000000000 +0200
@@ -43,7 +43,7 @@ libc_hidden_def (__novmx_setjmp)
# endif /* defined SHARED && SHLIB_COMPAT (libc, GLIBC_2_0, GLIBC_2_3_4) */
default_symbol_version (__vmx_setjmp,_setjmp,GLIBC_2.3.4)
-/* __GI__setjmp prototype is needed for ntpl i.e. _setjmp is defined
+/* __GI__setjmp prototype is needed for nptl i.e. _setjmp is defined
as a libc_hidden_proto & is used in sysdeps/generic/libc-start.c
if HAVE_CLEANUP_JMP_BUF is defined */
ENTRY (BP_SYM (__GI__setjmp))
--- libc/sysdeps/powerpc/powerpc32/fpu/s_trunc.S.jj 2005-06-22 18:34:22.000000000 +0200
+++ libc/sysdeps/powerpc/powerpc32/fpu/s_trunc.S 2005-08-18 13:37:51.000000000 +0200
@@ -64,7 +64,7 @@ ENTRY (__trunc)
fsub fp1,fp1,fp13 /* x-= TWO52; */
fabs fp1,fp1 /* if (x == 0.0) */
/* x = 0.0; */
- mtfsf 0x01,fp11 /* restore previous truncing mode. */
+ mtfsf 0x01,fp11 /* restore previous truncation mode. */
blr
.L4:
bge- cr6,.L9 /* if (x < 0.0) */
--- libc/sysdeps/powerpc/powerpc32/fpu/s_truncf.S.jj 2005-06-22 18:34:22.000000000 +0200
+++ libc/sysdeps/powerpc/powerpc32/fpu/s_truncf.S 2005-08-18 13:37:51.000000000 +0200
@@ -64,7 +64,7 @@ ENTRY (__truncf)
fsubs fp1,fp1,fp13 /* x-= TWO23; */
fabs fp1,fp1 /* if (x == 0.0) */
/* x = 0.0; */
- mtfsf 0x01,fp11 /* restore previous truncing mode. */
+ mtfsf 0x01,fp11 /* restore previous truncation mode. */
blr
.L4:
bge- cr6,.L9 /* if (x < 0.0) */
--- libc/sysdeps/powerpc/powerpc32/fpu/setjmp.S.jj 2004-03-23 15:51:35.000000000 +0100
+++ libc/sysdeps/powerpc/powerpc32/fpu/setjmp.S 2005-08-18 14:01:35.000000000 +0200
@@ -1,4 +1,4 @@
-/* non alitivec (old) version of setjmp for PowerPC.
+/* non altivec (old) version of setjmp for PowerPC.
Copyright (C) 1995-1997,1999,2000,2003,2004 Free Software Foundation, Inc.
This file is part of the GNU C Library.
--- libc/sysdeps/powerpc/powerpc32/strncmp.S.jj 2003-11-03 18:38:35.000000000 +0100
+++ libc/sysdeps/powerpc/powerpc32/strncmp.S 2005-08-18 13:37:51.000000000 +0200
@@ -49,7 +49,7 @@ EALIGN (BP_SYM(strncmp), 4, 0)
clrlwi. rTMP, rTMP, 30
lis rFEFE, -0x101
bne L(unaligned)
-/* We are word alligned so set up for two loops. first a word
+/* We are word aligned so set up for two loops. first a word
loop, then fall into the byte loop if any residual. */
srwi. rTMP, rN, 2
clrlwi rN, rN, 30
--- libc/sysdeps/powerpc/powerpc32/memset.S.jj 2005-06-22 18:34:22.000000000 +0200
+++ libc/sysdeps/powerpc/powerpc32/memset.S 2005-08-18 13:37:51.000000000 +0200
@@ -292,7 +292,7 @@ L(checklinesize):
beq cr1,L(nondcbz)
/* If the cache line size is 32 bytes then goto to L(zloopstart),
- which is coded specificly for 32-byte lines (and 601). */
+ which is coded specifically for 32-byte lines (and 601). */
cmplwi cr1,rCLS,32
beq cr1,L(zloopstart)
--- libc/sysdeps/powerpc/powerpc32/dl-start.S.jj 2005-06-22 18:34:22.000000000 +0200
+++ libc/sysdeps/powerpc/powerpc32/dl-start.S 2005-08-18 13:37:51.000000000 +0200
@@ -40,7 +40,7 @@ ENTRY(_start)
/* FALLTHRU */
ENTRY(_dl_start_user)
-/* Now, we do our main work of calling initialisation procedures.
+/* Now, we do our main work of calling initialization procedures.
The ELF ABI doesn't say anything about parameters for these,
so we just pass argc, argv, and the environment.
Changing these is strongly discouraged (not least because argc is
@@ -81,7 +81,7 @@ ENTRY(_dl_start_user)
slwi r5,r3,2
add r6,r4,r5
addi r5,r6,4
-/* pass the auxilary vector in r6. This is passed to us just after _envp. */
+/* pass the auxiliary vector in r6. This is passed to us just after _envp. */
2: lwzu r0,4(r6)
cmpwi r0,0
bne 2b
--- libc/sysdeps/powerpc/powerpc32/bits/atomic.h.jj 2004-09-14 00:33:00.000000000 +0200
+++ libc/sysdeps/powerpc/powerpc32/bits/atomic.h 2005-08-18 13:49:01.000000000 +0200
@@ -20,7 +20,7 @@
/*
* The 32-bit exchange_bool is different on powerpc64 because the subf
- * does signed 64-bit arthmatic while the lwarx is 32-bit unsigned
+ * does signed 64-bit arithmetics while the lwarx is 32-bit unsigned
* (a load word and zero (high 32) form). So powerpc64 has a slightly
* different version in sysdeps/powerpc/powerpc64/bits/atomic.h.
*/
--- libc/sysdeps/powerpc/powerpc32/setjmp.S.jj 2004-03-13 10:23:15.000000000 +0100
+++ libc/sysdeps/powerpc/powerpc32/setjmp.S 2005-08-18 13:48:43.000000000 +0200
@@ -1,4 +1,4 @@
-/* non alitivec (old) version of setjmp for PowerPC.
+/* non altivec (old) version of setjmp for PowerPC.
Copyright (C) 1995-1997,1999-2001,2004 Free Software Foundation, Inc.
This file is part of the GNU C Library.
--- libc/sysdeps/powerpc/fpu/e_sqrtf.c.jj 2004-05-26 16:05:30.000000000 +0200
+++ libc/sysdeps/powerpc/fpu/e_sqrtf.c 2005-08-18 13:37:47.000000000 +0200
@@ -115,7 +115,7 @@ __slow_ieee754_sqrtf (x)
fesetenv_register (fe);
return g + sy * d;
denorm:
- /* For denormalised numbers, we normalise, calculate the
+ /* For denormalized numbers, we normalize, calculate the
square root, and return an adjusted result. */
fesetenv_register (fe);
return __slow_ieee754_sqrtf (x * two48) * twom24;
--- libc/sysdeps/powerpc/fpu/fenv_libc.h.jj 2001-07-06 06:56:02.000000000 +0200
+++ libc/sysdeps/powerpc/fpu/fenv_libc.h 2005-08-18 13:37:47.000000000 +0200
@@ -85,14 +85,14 @@ enum {
FPSCR_UE, /* underflow exception enable */
FPSCR_ZE, /* zero divide exception enable */
FPSCR_XE, /* inexact exception enable */
- FPSCR_NI /* non-IEEE mode (typically, no denormalised numbers) */
+ FPSCR_NI /* non-IEEE mode (typically, no denormalized numbers) */
/* the remaining two least-significant bits keep the rounding mode */
};
/* This operation (i) sets the appropriate FPSCR bits for its
parameter, (ii) converts SNaN to the corresponding NaN, and (iii)
otherwise passes its parameter through unchanged (in particular, -0
- and +0 stay as they were). The `obvious' way to do this is optimised
+ and +0 stay as they were). The `obvious' way to do this is optimized
out by gcc. */
#define f_wash(x) \
({ double d; asm volatile ("fmul %0,%1,%2" \
--- libc/sysdeps/powerpc/fpu/e_sqrt.c.jj 2004-05-26 16:05:30.000000000 +0200
+++ libc/sysdeps/powerpc/fpu/e_sqrt.c 2005-08-18 13:37:47.000000000 +0200
@@ -139,7 +139,7 @@ __slow_ieee754_sqrt (x)
fesetenv_register (fe);
return g + sy * d;
denorm:
- /* For denormalised numbers, we normalise, calculate the
+ /* For denormalized numbers, we normalize, calculate the
square root, and return an adjusted result. */
fesetenv_register (fe);
return __slow_ieee754_sqrt (x * two108) * twom54;
--- libc/sysdeps/powerpc/elf/libc-start.c.jj 2005-07-11 09:51:20.000000000 +0200
+++ libc/sysdeps/powerpc/elf/libc-start.c 2005-08-18 13:37:47.000000000 +0200
@@ -66,7 +66,7 @@ BP_SYM (__libc_start_main) (int argc, ch
char *__unbounded *__unbounded temp;
/* ...in which case, we have argc as the top thing on the
stack, followed by argv (NULL-terminated), envp (likewise),
- and the auxilary vector. */
+ and the auxiliary vector. */
/* 32/64-bit agnostic load from stack */
argc = *(long int *__unbounded) stack_on_entry;
ubp_av = stack_on_entry + 1;
--- libc/sysdeps/powerpc/bits/setjmp.h.jj 2004-02-19 17:50:45.000000000 +0100
+++ libc/sysdeps/powerpc/bits/setjmp.h 2005-08-18 13:37:47.000000000 +0200
@@ -57,7 +57,7 @@
/* The current powerpc 32-bit Altivec ABI specifies for SVR4 ABI and EABI
the vrsave must be at byte 248 & v20 at byte 256. So we must pad this
- correctly on 32 bit. It also insists that vecregs are only gauranteed
+ correctly on 32 bit. It also insists that vecregs are only guaranteed
4 byte alignment so we need to use vperm in the setjmp/longjmp routines.
We have to version the code because members like int __mask_was_saved
in the jmp_buf will move as jmp_buf is now larger than 248 bytes. We
--- libc/sysdeps/sparc/sparc32/sparcv9/udiv.S.jj 1999-03-29 15:25:14.000000000 +0200
+++ libc/sysdeps/sparc/sparc32/sparcv9/udiv.S 2005-08-18 13:37:51.000000000 +0200
@@ -1,7 +1,7 @@
/*
* Sparc v9 has divide.
* As divx takes 68 cycles and udiv only 37,
- * we use udiv eventhough it is deprecated.
+ * we use udiv even though it is deprecated.
*/
#include <sysdep.h>
--- libc/sysdeps/sparc/sparc32/sparcv9/urem.S.jj 1999-03-29 15:25:14.000000000 +0200
+++ libc/sysdeps/sparc/sparc32/sparcv9/urem.S 2005-08-18 13:37:51.000000000 +0200
@@ -1,7 +1,7 @@
/*
* Sparc v9 has divide.
* As divx takes 68 cycles and udiv only 37,
- * we use udiv eventhough it is deprecated.
+ * we use udiv even though it is deprecated.
*/
#include <sysdep.h>
--- libc/sysdeps/sparc/sparc32/sparcv9/rem.S.jj 1999-03-29 15:25:14.000000000 +0200
+++ libc/sysdeps/sparc/sparc32/sparcv9/rem.S 2005-08-18 13:37:51.000000000 +0200
@@ -1,7 +1,7 @@
/*
* Sparc v9 has divide.
* As divx takes 68 cycles and sdivcc only 36,
- * we use sdivcc eventhough it is deprecated.
+ * we use sdivcc even though it is deprecated.
*/
#include <sysdep.h>
--- libc/sysdeps/sparc/sparc32/sparcv9/sdiv.S.jj 1999-03-29 15:25:14.000000000 +0200
+++ libc/sysdeps/sparc/sparc32/sparcv9/sdiv.S 2005-08-18 13:37:51.000000000 +0200
@@ -1,7 +1,7 @@
/*
* Sparc v9 has divide.
* As divx takes 68 cycles and sdivcc only 36,
- * we use sdivcc eventhough it is deprecated.
+ * we use sdivcc even though it is deprecated.
*/
#include <sysdep.h>
--- libc/sysdeps/sparc/sparc32/dl-machine.h.jj 2005-04-13 21:29:46.000000000 +0200
+++ libc/sysdeps/sparc/sparc32/dl-machine.h 2005-08-18 13:37:47.000000000 +0200
@@ -236,7 +236,7 @@ _start:\n\
/* Pass pointer to argument block to _dl_start. */\n\
call _dl_start\n\
add %sp, 22*4, %o0\n\
- /* FALTHRU */\n\
+ /* FALLTHRU */\n\
.globl _dl_start_user\n\
.type _dl_start_user, @function\n\
_dl_start_user:\n\
--- libc/sysdeps/mips/elf/start.S.jj 2004-11-25 14:36:10.000000000 +0100
+++ libc/sysdeps/mips/elf/start.S 2005-08-18 13:37:51.000000000 +0200
@@ -62,7 +62,7 @@
...
NULL
ra ($31) The return address register is set to zero so that programs
- that search backword through stack frames recognize the last
+ that search backward through stack frames recognize the last
stack frame.
*/
--- libc/sysdeps/mips/bits/atomic.h.jj 2005-03-28 11:14:59.000000000 +0200
+++ libc/sysdeps/mips/bits/atomic.h 2005-08-18 13:37:47.000000000 +0200
@@ -107,7 +107,7 @@ typedef uintmax_t uatomic_max_t;
: "memory")
#endif
-/* For all "bool" routines, we return FALSE if exchange succesful. */
+/* For all "bool" routines, we return FALSE if exchange successful. */
#define __arch_compare_and_exchange_bool_8_int(mem, new, old, rel, acq) \
({ typeof (*mem) __prev; int __cmp; \
--- libc/sysdeps/mips/bits/link.h.jj 2005-03-28 09:43:51.000000000 +0200
+++ libc/sysdeps/mips/bits/link.h 2005-08-18 13:37:47.000000000 +0200
@@ -47,7 +47,7 @@ typedef struct La_mips_32_retval
typedef struct La_mips_64_regs
{
uint64_t lr_reg[8]; /* $a0 through $a7 */
- double lr_fpreg[8]; /* $f12 throgh $f19 */
+ double lr_fpreg[8]; /* $f12 through $f19 */
uint64_t lr_ra;
uint64_t lr_sp;
} La_mips_64_regs;
--- libc/sysdeps/mips/sys/asm.h.jj 2005-04-01 17:08:23.000000000 +0200
+++ libc/sysdeps/mips/sys/asm.h 2005-08-18 13:37:47.000000000 +0200
@@ -471,7 +471,7 @@ symbol = value
# define MTC0 dmtc0
#endif
-/* The MIPS archtectures do not have a uniform memory model. Particular
+/* The MIPS architectures do not have a uniform memory model. Particular
platforms may provide additional guarantees - for instance, the R4000
LL and SC instructions implicitly perform a SYNC, and the 4K promises
strong ordering.
--- libc/sysdeps/i386/fpu/e_hypotf.S.jj 2001-07-06 06:55:53.000000000 +0200
+++ libc/sysdeps/i386/fpu/e_hypotf.S 2005-08-18 13:37:51.000000000 +0200
@@ -1,4 +1,4 @@
-/* Compute the hypothenuse of X and Y.
+/* Compute the hypotenuse of X and Y.
Copyright (C) 1998 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by Ulrich Drepper <drepper@cygnus.com>, 1998.
--- libc/sysdeps/i386/fpu/e_hypot.S.jj 2001-07-06 06:55:53.000000000 +0200
+++ libc/sysdeps/i386/fpu/e_hypot.S 2005-08-18 13:37:51.000000000 +0200
@@ -1,4 +1,4 @@
-/* Compute the hypothenuse of X and Y.
+/* Compute the hypotenuse of X and Y.
Copyright (C) 1998 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by Ulrich Drepper <drepper@cygnus.com>, 1998.
--- libc/sysdeps/i386/fpu/bits/mathdef.h.jj 2004-11-09 12:26:46.000000000 +0100
+++ libc/sysdeps/i386/fpu/bits/mathdef.h 2005-08-18 13:37:47.000000000 +0200
@@ -24,7 +24,7 @@
# define _MATH_H_MATHDEF 1
# if defined __FLT_EVAL_METHOD__ && __FLT_EVAL_METHOD__ == 0
-/* When using -mfpmath=sse, values are computed with the precission of the
+/* When using -mfpmath=sse, values are computed with the precision of the
used type. */
typedef float float_t; /* `float' expressions are evaluated as `float'. */
typedef double double_t; /* `double' expressions are evaluated as
--- libc/sysdeps/i386/strrchr.S.jj 2005-05-04 10:32:10.000000000 +0200
+++ libc/sysdeps/i386/strrchr.S 2005-08-18 13:37:51.000000000 +0200
@@ -3,7 +3,7 @@
Copyright (C) 1994-1997, 2000, 2003, 2005 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by Ulrich Drepper <drepper@gnu.ai.mit.edu>
- Some optimisations by Alan Modra <Alan@SPRI.Levels.UniSA.Edu.Au>
+ Some optimizations by Alan Modra <Alan@SPRI.Levels.UniSA.Edu.Au>
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
--- libc/sysdeps/i386/memchr.S.jj 2005-05-04 10:32:10.000000000 +0200
+++ libc/sysdeps/i386/memchr.S 2005-08-18 13:37:51.000000000 +0200
@@ -3,7 +3,7 @@
Copyright (C) 1994-1998, 2000, 2003, 2005 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by Ulrich Drepper <drepper@gnu.ai.mit.edu>
- Optimised a little by Alan Modra <Alan@SPRI.Levels.UniSA.Edu.Au>
+ Optimized a little by Alan Modra <Alan@SPRI.Levels.UniSA.Edu.Au>
This version is developed using the same algorithm as the fast C
version which carries the following introduction:
Based on strlen implementation by Torbjorn Granlund (tege@sics.se),
--- libc/sysdeps/i386/i686/hp-timing.h.jj 2005-03-17 22:00:52.000000000 +0100
+++ libc/sysdeps/i386/i686/hp-timing.h 2005-08-18 13:50:00.000000000 +0200
@@ -27,7 +27,7 @@
/* The macros defined here use the timestamp counter in i586 and up versions
of the x86 processors. They provide a very accurate way to measure the
- time with very little overhead. The time values themself have no real
+ time with very little overhead. The time values themselves have no real
meaning, only differences are interesting.
This version is for the i686 processors. The difference to the i586
@@ -90,7 +90,7 @@ typedef unsigned long long int hp_timing
/* That's quite simple. Use the `rdtsc' instruction. Note that the value
might not be 100% accurate since there might be some more instructions
running in this moment. This could be changed by using a barrier like
- 'cpuid' right before the `rdtsc' instruciton. But we are not interested
+ 'cpuid' right before the `rdtsc' instruction. But we are not interested
in accurate clock cycles here so we don't do this. */
#define HP_TIMING_NOW(Var) __asm__ __volatile__ ("rdtsc" : "=A" (Var))
--- libc/sysdeps/i386/i686/dl-hash.h.jj 2005-02-21 17:20:20.000000000 +0100
+++ libc/sysdeps/i386/i686/dl-hash.h 2005-08-18 13:37:47.000000000 +0200
@@ -1,4 +1,4 @@
-/* Compute hash alue for given string according to ELF standard.
+/* Compute hash value for given string according to ELF standard.
Copyright (C) 1998, 2003, 2005 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by Ulrich Drepper <drepper@cygnus.com>, 1998.
--- libc/sysdeps/i386/i386-mcount.S.jj 2005-06-06 11:41:07.000000000 +0200
+++ libc/sysdeps/i386/i386-mcount.S 2005-08-18 13:37:51.000000000 +0200
@@ -1,4 +1,4 @@
-/* i386-specific implemetation of profiling support.
+/* i386-specific implementation of profiling support.
Copyright (C) 1997, 2002 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by Ulrich Drepper <drepper@cygnus.com>, 1997.
--- libc/sysdeps/i386/strchrnul.S.jj 2005-05-04 10:32:10.000000000 +0200
+++ libc/sysdeps/i386/strchrnul.S 2005-08-18 13:37:51.000000000 +0200
@@ -4,7 +4,7 @@
Copyright (C) 1994-1997, 1999, 2000, 2005 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by Ulrich Drepper <drepper@gnu.org>
- Some optimisations by Alan Modra <Alan@SPRI.Levels.UniSA.Edu.Au>
+ Some optimizations by Alan Modra <Alan@SPRI.Levels.UniSA.Edu.Au>
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
--- libc/sysdeps/i386/rawmemchr.S.jj 2005-05-04 10:32:10.000000000 +0200
+++ libc/sysdeps/i386/rawmemchr.S 2005-08-18 13:37:51.000000000 +0200
@@ -3,7 +3,7 @@
Copyright (C) 1994-2000,2002,2005 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by Ulrich Drepper <drepper@gnu.ai.mit.edu>
- Optimised a little by Alan Modra <Alan@SPRI.Levels.UniSA.Edu.Au>
+ Optimized a little by Alan Modra <Alan@SPRI.Levels.UniSA.Edu.Au>
This version is developed using the same algorithm as the fast C
version which carries the following introduction:
Based on strlen implementation by Torbjorn Granlund (tege@sics.se),
--- libc/sysdeps/i386/strchr.S.jj 2005-05-04 10:32:10.000000000 +0200
+++ libc/sysdeps/i386/strchr.S 2005-08-18 13:37:51.000000000 +0200
@@ -4,7 +4,7 @@
Free Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by Ulrich Drepper <drepper@gnu.ai.mit.edu>
- Some optimisations by Alan Modra <Alan@SPRI.Levels.UniSA.Edu.Au>
+ Some optimizations by Alan Modra <Alan@SPRI.Levels.UniSA.Edu.Au>
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
--- libc/sysdeps/i386/strpbrk.S.jj 2005-05-04 10:32:10.000000000 +0200
+++ libc/sysdeps/i386/strpbrk.S 2005-08-18 13:37:51.000000000 +0200
@@ -1,4 +1,4 @@
-/* strcspn (str, ss) -- Return the length of the initial segement of STR
+/* strcspn (str, ss) -- Return the length of the initial segment of STR
which contains no characters from SS.
For Intel 80x86, x>=3.
Copyright (C) 1994-1997, 2000, 2003, 2005 Free Software Foundation, Inc.
@@ -210,7 +210,7 @@ L(1): leal -4(%edx), %eax /* prepare loo
1. a character in the stopset was found
and
2. the end of the string was found
- But as a sign that the chracter is in the stopset we store its
+ But as a sign that the character is in the stopset we store its
value in the table. But the value of NUL is NUL so the loop
terminates for NUL in every case. */
--- libc/sysdeps/i386/i486/strcat.S.jj 2005-05-04 10:32:11.000000000 +0200
+++ libc/sysdeps/i386/i486/strcat.S 2005-08-18 13:37:51.000000000 +0200
@@ -3,7 +3,7 @@
Copyright (C) 1994-1997,2000,2003,2005 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by Ulrich Drepper <drepper@ipd.info.uni-karlsruhe.de>.
- Optimised a little by Alan Modra <Alan@SPRI.Levels.UniSA.Edu.Au>
+ Optimized a little by Alan Modra <Alan@SPRI.Levels.UniSA.Edu.Au>
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
--- libc/sysdeps/ia64/hp-timing.h.jj 2004-03-08 12:01:51.000000000 +0100
+++ libc/sysdeps/ia64/hp-timing.h 2005-08-18 13:37:47.000000000 +0200
@@ -28,7 +28,7 @@
/* The macros defined here use the timestamp counter in IA-64. They
provide a very accurate way to measure the time with very little
- overhead. The time values themself have no real meaning, only
+ overhead. The time values themselves have no real meaning, only
differences are interesting.
The list of macros we need includes the following:
--- libc/sysdeps/ia64/fpu/s_erfcl.S.jj 2005-04-13 21:29:39.000000000 +0200
+++ libc/sysdeps/ia64/fpu/s_erfcl.S 2005-08-18 13:37:51.000000000 +0200
@@ -71,7 +71,7 @@
// -0.5*[x(i+1)-x(i)] <= z <= 0.5*[x(i+1)-x(i)].
//
// Let Q(z)= (P(z)- S)/S, S = a0, rounded to 16 bits.
-// Polynomial coeffitients for Q(z) we have in the table erfc_Q_table as
+// Polynomial coefficients for Q(z) we have in the table erfc_Q_table as
// long double values
//
// We use multi precision to calculate input argument -x^2 for expl and
@@ -168,7 +168,7 @@
// Case exp_small:
//
// Here, exp(X) and exp(X) - 1 can all be
-// appproximated by a relatively simple polynomial.
+// approximated by a relatively simple polynomial.
//
// This polynomial resembles the truncated Taylor series
//
@@ -1548,7 +1548,7 @@ GLOBAL_LIBM_ENTRY(erfcl)
{ .mfi
ldfe FR_A12 = [GR_P_POINT_1], -64
nop.f 0
- extr GR_K = GR_N_fix, 12, 32 // Extract limite range K
+ extr GR_K = GR_N_fix, 12, 32 // Extract limited range K
}
{ .mfi
ldfe FR_A13 = [GR_P_POINT_2], -64
--- libc/sysdeps/ia64/fpu/s_asinh.S.jj 2005-04-13 21:29:38.000000000 +0200
+++ libc/sysdeps/ia64/fpu/s_asinh.S 2005-08-18 13:37:53.000000000 +0200
@@ -45,7 +45,7 @@
// 10/18/01 Improved accuracy
// 05/20/02 Cleaned up namespace and sf0 syntax
// 02/06/03 Reordered header: .section, .global, .proc, .align
-// 05/21/03 Improved performance, fixed to handle unorms
+// 05/21/03 Improved performance, fixed to handle unnorms
// 03/31/05 Reformatted delimiters between data tables
//
// API
--- libc/sysdeps/ia64/fpu/e_acosf.S.jj 2005-04-13 21:29:36.000000000 +0200
+++ libc/sysdeps/ia64/fpu/e_acosf.S 2005-08-18 13:37:51.000000000 +0200
@@ -57,7 +57,7 @@
// Description
//=========================================
// The acosf function computes the principle value of the arc sine of x.
-// A doman error occurs for arguments not in the range [-1,+1].
+// A domain error occurs for arguments not in the range [-1,+1].
// The acosf function returns the arc cosine in the range [0, +pi] radians.
// acos(1) returns +0
--- libc/sysdeps/ia64/fpu/s_expm1.S.jj 2005-04-13 21:29:39.000000000 +0200
+++ libc/sysdeps/ia64/fpu/s_expm1.S 2005-08-18 13:37:52.000000000 +0200
@@ -508,7 +508,7 @@ EXPM1_COMMON:
;;
// Nfloat = round_int(W)
-// The signficand of fW_2TO56_RSH contains the rounded integer part of W,
+// The significant of fW_2TO56_RSH contains the rounded integer part of W,
// as a twos complement number in the lower bits (that is, it may be negative).
// That twos complement number (called N) is put into rN.
--- libc/sysdeps/ia64/fpu/libm_reduce.S.jj 2005-01-08 16:50:26.000000000 +0100
+++ libc/sysdeps/ia64/fpu/libm_reduce.S 2005-08-18 13:37:51.000000000 +0200
@@ -75,7 +75,7 @@
//
// IEEE Special Conditions:
//
-// No condions should be raised.
+// No conditions should be raised.
//
//*********************************************************************
//
@@ -134,7 +134,7 @@
// ==============
//
// This describes the algorithm in the most natural way using
-// unsigned interger multiplication. The implementation section
+// unsigned integer multiplication. The implementation section
// describes how the integer arithmetic is simulated.
//
// STEP 0. Initialization
@@ -159,7 +159,7 @@
//
// P_1 = b b b ... b
//
-// each b can be 0 or 1. Also, let P_0 be the two bits correspoding to
+// each b can be 0 or 1. Also, let P_0 be the two bits corresponding to
// bit positions L+2 and L+1. So, when each of the P_j is interpreted
// with appropriate scaling, we have
//
@@ -179,7 +179,7 @@
// + x*P_small*(pi/2).
//
// Hence, P_big*x corresponds to information that can be ignored for
-// trigonometic function evaluation.
+// trigonometric function evaluation.
//
// Next, we must estimate the effect of ignoring P_small. The absolute
// error made by ignoring P_small is bounded by
@@ -288,7 +288,7 @@
//
// Set sgn_x := sign(x); x := |x|; x_lo := 2 lsb of x.
//
-// In memory, 2/pi is stored contigously as
+// In memory, 2/pi is stored contiguously as
//
// 0x00000000 0x00000000 0xA2F....
// ^
@@ -786,7 +786,7 @@ __libm_pi_by_2_reduce:
// setf.sig FR_ScaleP3 = GR_x_lo
// fmerge.se FR_X = FR_X,FR_ScaleP3
// Set sgn_x := sign(x); x := |x|; x_lo := 2 lsb of x.
-// 2/pi is stored contigously as
+// 2/pi is stored contiguously as
// 0x00000000 0x00000000.0xA2F....
// M = EXP - BIAS ( M >= 63)
// Given x = 2^m * 1.xxxx...xxx; we calculate L := 62 - m.
--- libc/sysdeps/ia64/fpu/e_log2l.S.jj 2005-04-13 21:29:37.000000000 +0200
+++ libc/sysdeps/ia64/fpu/e_log2l.S 2005-08-18 13:37:52.000000000 +0200
@@ -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
--- libc/sysdeps/ia64/fpu/s_erfl.S.jj 2005-04-13 21:29:39.000000000 +0200
+++ libc/sysdeps/ia64/fpu/s_erfl.S 2005-08-18 13:37:51.000000000 +0200
@@ -90,7 +90,7 @@
// Implementation notes
// --------------------
//
-// 1. Special path: x = 0, INF, NaNa, denormals
+// 1. Special path: x = 0, INF, NaNs, denormals
//
// This branch is cut off by one fclass operation.
// Then zeros+nans, infinities and denormals processed separately.
@@ -100,7 +100,7 @@
// 2. [0;1/8] path: 0.0 < |x| < 1/8
//
// First coefficient of polynomial we must split to multiprecision too.
-// Also we can parallelise computations:
+// Also we can parallelize computations:
// (x*(A1H+A1L)) calculated in parallel with "tail" (x^3*A3 + ... + x^15*A15)
// Furthermore the second part is factorized using binary tree technique.
//
@@ -108,7 +108,7 @@
//
// Multiprecision have to be performed only for first few
// polynomial iterations (up to 3-rd x degree)
-// Here we use the same parallelisation way as above:
+// Here we use the same parallelization way as above:
// Split whole polynomial to first, "multiprecision" part, and second,
// so called "tail", native precision part.
//
@@ -118,7 +118,7 @@
//
// 2) Tail part:
// v3 = x^4 * ( A4 + x*A5 + ... + x^21*A25 )
-// v3 is splitted to 2 even parts (10 coefficient in each one).
+// v3 is split to 2 even parts (10 coefficient in each one).
// These 2 parts are also factorized using binary tree technique.
//
// So Multiprecision and Tail parts cost is almost the same
@@ -1029,7 +1029,7 @@ GLOBAL_LIBM_ENTRY(erfl)
br.ret.sptk b0 // Main path return
};;
-// satiration path ////////////////////////////////////////////////////////////
+// saturation path ////////////////////////////////////////////////////////////
_saturation:
.pred.rel "mutex",p14,p15
--- libc/sysdeps/ia64/fpu/s_cosf.S.jj 2005-04-13 21:29:39.000000000 +0200
+++ libc/sysdeps/ia64/fpu/s_cosf.S 2005-08-18 13:50:19.000000000 +0200
@@ -462,7 +462,7 @@ _SINCOSF_COMMON:
{ .mmi
getf.exp sincosf_r_signexp = f8
setf.exp sincosf_2TOM61 = sincosf_GR_exp_2tom61
- addl gr_tmp = -1,r0 // For "inexect" constant create
+ addl gr_tmp = -1,r0 // For "inexact" constant create
};;
// Load the two pieces of pi/16
--- libc/sysdeps/ia64/fpu/libm_lgammal.S.jj 2005-04-13 21:29:38.000000000 +0200
+++ libc/sysdeps/ia64/fpu/libm_lgammal.S 2005-08-18 13:37:52.000000000 +0200
@@ -96,7 +96,7 @@
// b) C = A + B = (Ahi, Alo) + (Bhi, Blo) means multi-precision addition.
// The result would be C = (Chi, Clo). Notice, that Clo shouldn't be
// equal to Alo + Blo
-// c) D = A*B = (Ahi, Alo)*(Bhi, Blo) = (Dhi, Dlo) multi-precisiion
+// c) D = A*B = (Ahi, Alo)*(Bhi, Blo) = (Dhi, Dlo) multi-precision
// multiplication.
//
// So, lgammal has the following computational paths:
@@ -166,7 +166,7 @@
// C = (Chi, Clo) - pair of double precision numbers representing constant
// 0.5*ln(2*Pi);
// S(1/x) = 1/x * (B2 + B4*(1/x)^2 + ... + B20*(1/x)^18), B2, ..., B20 are
-// Bernulli numbers. S is computed in native precision and then added to
+// Bernoulli numbers. S is computed in native precision and then added to
// Clo;
// lnHi(x) - 1 is computed in native precision and the multiprecision
// multiplication (x, 0) *(lnHi(x) - 1, lnLo(x)) is used.
@@ -183,7 +183,7 @@
// approximation of the first terms.
// 6.1) -2^63 < x < -6.0 ("negative Sterling" range)
// lgammal(t) is approximated exactly as in #4. The only difference that
-// for -13.0 < x < -6.0 subrange instead of Bernulli numbers we use their
+// for -13.0 < x < -6.0 subrange instead of Bernoulli numbers we use their
// minimax approximation on this range.
// log(t), log(|dT|) are approximated by the log routine mentioned above.
// 6.2) -6.0 < x <= -0.75, |x + 1|> 2^(-7)
@@ -203,24 +203,24 @@
// log(|dT|) is approximated by the log routine mentioned above.
// lgammal(-x) is approximated by polynomial of 8th degree from (-x + 1).
//
-// 7) -20.0 < x < -2.0, x falls in root "neighbourhood".
-// "Neighbourhood" means that |lgammal(x)| < epsilon, where epsilon is
+// 7) -20.0 < x < -2.0, x falls in root "neighborhood".
+// "Neighborhood" means that |lgammal(x)| < epsilon, where epsilon is
// different for every root (and it is stored in the table), but typically
// it is ~ 0.15. There are 35 roots significant from "double extended"
// point of view. We split all the roots into two subsets: "left" and "right"
// roots. Considering [-(N+1), -N] range we call root as "left" one if it
// lies closer to -(N+1) and "right" otherwise. There is no "left" root in
// the [-20, -19] range (it exists, but is insignificant for double extended
-// precision). To determine if x falls in root "neighbourhood" we store
-// significands of all the 35 roots as well as epsilon values (expressed
+// precision). To determine if x falls in root "neighborhood" we store
+// significants of all the 35 roots as well as epsilon values (expressed
// by the left and right bound).
// In these ranges we approximate lgammal(x) by polynomial series of 19th
// degree:
// lgammal(x) = P19(t) = A0 + A1*t + ...+ A19*t^19, where t = x - EDP_Root,
// EDP_Root is the exact value of the corresponding root rounded to double
// extended precision. So, we have 35 different polynomials which make our
-// table rather big. We may hope that x falls in root "neighbourhood"
-// quite rarely -> ther might be no need in frequent use of different
+// table rather big. We may hope that x falls in root "neighborhood"
+// quite rarely -> there might be no need in frequent use of different
// polynomials.
// A0, A1, A2, A3 are represented as pairs of double precision numbers,
// A4, A5 are long doubles, and to decrease the size of the table we
@@ -282,7 +282,7 @@
// ----------------------
//
// Z := X
-// N := unbaised exponent of Z
+// N := unbiased exponent of Z
// S_hi := 2^(-N) * Z
//
// Step 1. Argument Reduction
@@ -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.
//
@@ -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.
//
@@ -480,7 +480,7 @@ FR_X = f10 // first
FR_Y = f1 // second argument (lgammal has just one)
FR_RESULT = f8 // result
-// First 7 Bernulli numbers
+// First 7 Bernoulli numbers
fB2 = f9
fLnDeltaL = f9
fXSqr = f9
@@ -631,7 +631,7 @@ FR_Q1 = f120
fThirteen = f121
fSix = f121
FR_rcub = f121
-// Last three Bernulli numbers
+// Last three Bernoulli numbers
fB16 = f122
fB18 = f123
fB20 = f124
@@ -668,7 +668,7 @@ data8 0x8800000000000655, 0x0000C003 //
data8 0x900000000000005A, 0x0000C003 // Range [-19, -18]
data8 0x9800000000000005, 0x0000C003 // Range [-20, -19]
// List of bounds of ranges with special polynomial approximation near root
-// Only significands of bounds are actually stored
+// Only significants of bounds are actually stored
data8 0xA000000000000000, 0x9800000000000000 // Bounds for root on [-3, -2]
data8 0xCAB88035C5EFBB41, 0xC7E05E31F4B02115 // Bounds for root on [-4, -3]
data8 0x817831B899735C72, 0x8114633941B8053A // Bounds for root on [-5, -4]
@@ -707,7 +707,7 @@ data8 0x8FFFFFFFFFFFFFA6, 0x0000C003 //
data8 0x97FFFFFFFFFFFFFB, 0x0000C003 // Range [-19, -18]
data8 0x0000000000000000, 0x00000000 // pad to keep logic in the main path
// List of bounds of ranges with special polynomial approximation near root
-// Only significands of bounds are actually stored
+// Only significants of bounds are actually stored
data8 0xB235880944CC758E, 0xADD2F1A9FBE76C8B // Bounds for root on [-3, -2]
data8 0xFD8E7844F307B07C, 0xFCA655C2152BDE4D // Bounds for root on [-4, -3]
data8 0x9FC4D876EE546967, 0x9FAEE4AF68BC4292 // Bounds for root on [-5, -4]
@@ -885,11 +885,11 @@ data8 0xB8D54C8BFFFDEBF4, 0x00007FF1
LOCAL_OBJECT_END(lgammal_data)
LOCAL_OBJECT_START(lgammal_Stirling)
-// Coefficients needed for Strirling's formula
+// Coefficients needed for Stirling's formula
data8 0x3FED67F1C864BEB4 // High part of 0.5*ln(2*Pi)
data8 0x3C94D252F2400510 // Low part of 0.5*ln(2*Pi)
//
-// Bernulli numbers used in Striling's formula for -2^63 < |x| < -13.0
+// Bernoulli numbers used in Stirling's formula for -2^63 < |x| < -13.0
//(B1H, B1L) = 8.3333333333333333333262747254e-02
data8 0x3FB5555555555555, 0x3C55555555555555
data8 0xB60B60B60B60B60B, 0x0000BFF6 //B2 = -2.7777777777777777777777777778e-03
@@ -1334,7 +1334,7 @@ LOCAL_OBJECT_END(lgammal_near_neg_half_d
//!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
LOCAL_OBJECT_START(lgammal_right_roots_polynomial_data)
// Polynomial coefficients for right root on [-3, -2]
-// Lgammal is aproximated by polynomial within [-.056244 ; .158208 ] range
+// Lgammal is approximated by polynomial within [-.056244 ; .158208 ] range
data8 0xBBBD5E9DCD11030B, 0xB867411D9FF87DD4 //A0
data8 0x3FF83FE966AF535E, 0x3CAA21235B8A769A //A1
data8 0x40136EEBB002F55C, 0x3CC3959A6029838E //A2
@@ -1356,7 +1356,7 @@ data8 0x40E0FB2C989CE4A3 //A17
data8 0x40E52739AB005641 //A18
data8 0x41161E3E6DDF503A //A19
// Polynomial coefficients for right root on [-4, -3]
-// Lgammal is aproximated by polynomial within [-.172797 ; .171573 ] range
+// Lgammal is approximated by polynomial within [-.172797 ; .171573 ] range
data8 0x3C172712B248E42E, 0x38CB8D17801A5D67 //A0
data8 0x401F20A65F2FAC54, 0x3CCB9EA1817A824E //A1
data8 0x4039D4D2977150EF, 0x3CDA42E149B6276A //A2
@@ -1378,7 +1378,7 @@ data8 0x42A7256F59B286F7 //A17
data8 0x42D462D1586DE61F //A18
data8 0x42FBB1228D6C5118 //A19
// Polynomial coefficients for right root on [-5, -4]
-// Lgammal is aproximated by polynomial within [-.163171 ; .161988 ] range
+// Lgammal is approximated by polynomial within [-.163171 ; .161988 ] range
data8 0x3C5840FBAFDEE5BB, 0x38CAC0336E8C490A //A0
data8 0x403ACA5CF4921642, 0x3CCEDCDDA5491E56 //A1
data8 0x40744415CD813F8E, 0x3CFBFEBC17E39146 //A2
@@ -1400,7 +1400,7 @@ data8 0x44A3507DA81D5C01 //A17
data8 0x44EF06A31E39EEDF //A18
data8 0x45333774C99F523F //A19
// Polynomial coefficients for right root on [-6, -5]
-// Lgammal is aproximated by polynomial within [-.156450 ; .156126 ] range
+// Lgammal is approximated by polynomial within [-.156450 ; .156126 ] range
data8 0x3C71B82D6B2B3304, 0x3917186E3C0DC231 //A0
data8 0x405ED72E0829AE02, 0x3C960C25157980EB //A1
data8 0x40BCECC32EC22F9B, 0x3D5D8335A32F019C //A2
@@ -1422,7 +1422,7 @@ data8 0x4709D045390A3810 //A17
data8 0x4778D360873C9F64 //A18
data8 0x47E26965BE9A682A //A19
// Polynomial coefficients for right root on [-7, -6]
-// Lgammal is aproximated by polynomial within [-.154582 ; .154521 ] range
+// Lgammal is approximated by polynomial within [-.154582 ; .154521 ] range
data8 0x3C75F103A1B00A48, 0x391C041C190C726D //A0
data8 0x40869DE49E3AF2AA, 0x3D1C17E1F813063B //A1
data8 0x410FCE23484CFD10, 0x3DB6F38C2F11DAB9 //A2
@@ -1444,7 +1444,7 @@ data8 0x49C47CC9AE3F1073 //A17
data8 0x4A5D38E8C35EFF45 //A18
data8 0x4AF0123E89694CD8 //A19
// Polynomial coefficients for right root on [-8, -7]
-// Lgammal is aproximated by polynomial within [-.154217 ; .154208 ] range
+// Lgammal is approximated by polynomial within [-.154217 ; .154208 ] range
data8 0xBCD2507D818DDD68, 0xB97F6940EA2871A0 //A0
data8 0x40B3B407AA387BCB, 0x3D6320238F2C43D1 //A1
data8 0x41683E85DAAFBAC7, 0x3E148D085958EA3A //A2
@@ -1466,7 +1466,7 @@ data8 0x4CC05021086F637B //A17
data8 0x4D8450A345B0FB49 //A18
data8 0x4E43825848865DB2 //A19
// Polynomial coefficients for right root on [-9, -8]
-// Lgammal is aproximated by polynomial within [-.154160 ; .154158 ] range
+// Lgammal is approximated by polynomial within [-.154160 ; .154158 ] range
data8 0x3CDF4358564F2B46, 0x397969BEE6042F81 //A0
data8 0x40E3B088FED67721, 0x3D82787BA937EE85 //A1
data8 0x41C83A3893550EF4, 0x3E542ED57E244DA8 //A2
@@ -1488,7 +1488,7 @@ data8 0x4FF03797EACD0F23 //A17
data8 0x50E4304A8E68A730 //A18
data8 0x51D3618FB2EC9F93 //A19
// Polynomial coefficients for right root on [-10, -9]
-// Lgammal is aproximated by polynomial within [-.154152 ; .154152 ] range
+// Lgammal is approximated by polynomial within [-.154152 ; .154152 ] range
data8 0x3D42F34DA97ECF0C, 0x39FD1256F345B0D0 //A0
data8 0x4116261203919787, 0x3DC12D44055588EB //A1
data8 0x422EA8F32FB7FE99, 0x3ED849CE4E7B2D77 //A2
@@ -1510,7 +1510,7 @@ data8 0x534E00B6B0C8B809 //A17
data8 0x5475022FE21215B2 //A18
data8 0x5596B02BF6C5E19B //A19
// Polynomial coefficients for right root on [-11, -10]
-// Lgammal is aproximated by polynomial within [-.154151 ; .154151 ] range
+// Lgammal is approximated by polynomial within [-.154151 ; .154151 ] range
data8 0x3D7AA9C2E2B1029C, 0x3A15FB37578544DB //A0
data8 0x414BAF825A0C91D4, 0x3DFB9DA2CE398747 //A1
data8 0x4297F3EC8AE0AF03, 0x3F34208B55FB8781 //A2
@@ -1532,7 +1532,7 @@ data8 0x56D4D10FEEDB030C //A17
data8 0x5832385DF86AD28A //A18
data8 0x598898914B4D6523 //A19
// Polynomial coefficients for right root on [-12, -11]
-// Lgammal is aproximated by polynomial within [-.154151 ; .154151 ] range
+// Lgammal is approximated by polynomial within [-.154151 ; .154151 ] range
data8 0xBD96F61647C58B03, 0xBA3ABB0C2A6C755B //A0
data8 0x418308A82714B70D, 0x3E1088FC6A104C39 //A1
data8 0x4306A493DD613C39, 0x3FB2341ECBF85741 //A2
@@ -1554,7 +1554,7 @@ data8 0x5A824088688B008D //A17
data8 0x5C15F75EF7E08EBD //A18
data8 0x5DA462EA902F0C90 //A19
// Polynomial coefficients for right root on [-13, -12]
-// Lgammal is aproximated by polynomial within [-.154151 ; .154151 ] range
+// Lgammal is approximated by polynomial within [-.154151 ; .154151 ] range
data8 0x3DC3191752ACFC9D, 0x3A26CB6629532DBF //A0
data8 0x41BC8CFC051191BD, 0x3E68A84DA4E62AF2 //A1
data8 0x43797926294A0148, 0x400F345FF3723CFF //A2
@@ -1576,7 +1576,7 @@ data8 0x5E518FC34C6F54EF //A17
data8 0x601FB3F17BCCD9A0 //A18
data8 0x61E61128D512FE97 //A1
// Polynomial coefficients for right root on [-14, -13]
-// Lgammal is aproximated by polynomial within [-.154151 ; .154151 ] range
+// Lgammal is approximated by polynomial within [-.154151 ; .154151 ] range
data8 0xBE170D646421B3F5, 0xBAAD95F79FCB5097 //A0
data8 0x41F7328CBFCD9AC7, 0x3E743B8B1E8AEDB1 //A1
data8 0x43F0D0FA2DBDA237, 0x40A0422D6A227B55 //A2
@@ -1598,7 +1598,7 @@ data8 0x6240787C4B1C9D6C //A17
data8 0x6448289235E80977 //A18
data8 0x664B5352C6C3449E //A19
// Polynomial coefficients for right root on [-15, -14]
-// Lgammal is aproximated by polynomial within [-.154151 ; .154151 ] range
+// Lgammal is approximated by polynomial within [-.154151 ; .154151 ] range
data8 0x3E562C2E34A9207D, 0x3ADC00DA3DFF7A83 //A0
data8 0x42344C3B2F0D90AB, 0x3EB8A2E979F24536 //A1
data8 0x4469BFFF28B50D07, 0x41181E3D05C1C294 //A2
@@ -1620,7 +1620,7 @@ data8 0x664B3998D60D0F9B //A17
data8 0x689178710782FA8B //A18
data8 0x6AD14A66C1C7BEC3 //A19
// Polynomial coefficients for right root on [-16, -15]
-// Lgammal is aproximated by polynomial within [-.154151 ; .154151 ] range
+// Lgammal is approximated by polynomial within [-.154151 ; .154151 ] range
data8 0xBE6D7E7192615BAE, 0xBB0137677D7CC719 //A0
data8 0x4273077763F6628C, 0x3F09250FB8FC8EC9 //A1
data8 0x44E6A1BF095B1AB3, 0x4178D5A74F6CB3B3 //A2
@@ -1642,7 +1642,7 @@ data8 0x6A722D2B19B7E2F9 //A17
data8 0x6CF5DEB3073B0743 //A18
data8 0x6F744AC11550B93A //A19
// Polynomial coefficients for right root on [-17, -16]
-// Lgammal is aproximated by polynomial within [-.154151 ; .154151 ] range
+// Lgammal is approximated by polynomial within [-.154151 ; .154151 ] range
data8 0xBEDCC6291188207E, 0xBB872E3FDD48F5B7 //A0
data8 0x42B3076EE7525EF9, 0x3F6687A5038CA81C //A1
data8 0x4566A1AAD96EBCB5, 0x421F0FEDFBF548D2 //A2
@@ -1664,7 +1664,7 @@ data8 0x6EB22C9807C21819 //A17
data8 0x7175DE20D04617C4 //A18
data8 0x74344AB87C6D655F //A19
// Polynomial coefficients for right root on [-18, -17]
-// Lgammal is aproximated by polynomial within [-.154151 ; .154151 ] range
+// Lgammal is approximated by polynomial within [-.154151 ; .154151 ] range
data8 0xBF28AEEE7B61D77C, 0xBBDBBB5FC57ABF79 //A0
data8 0x42F436F56B3B8A0C, 0x3FA43EE3C5C576E9 //A1
data8 0x45E98A22535D115D, 0x42984678BE78CC48 //A2
@@ -1686,7 +1686,7 @@ data8 0x730962B4500F4A61 //A17
data8 0x76103C6ED099192A //A18
data8 0x79100C7132CFD6E3 //A19
// Polynomial coefficients for right root on [-19, -18]
-// Lgammal is aproximated by polynomial within [-.154151 ; .154151 ] range
+// Lgammal is approximated by polynomial within [-.154151 ; .154151 ] range
data8 0x3F3C19A53328A0C3, 0x3BE04ADC3FBE1458 //A0
data8 0x4336C16C16C16C19, 0x3FE58CE3AC4A7C28 //A1
data8 0x46702E85C0898B70, 0x432C922E412CEC6E //A2
@@ -1708,7 +1708,7 @@ data8 0x7777C401A8715CF9 //A17
data8 0x7AC1110C6D350440 //A18
data8 0x7E02D0971CF84865 //A19
// Polynomial coefficients for right root on [-20, -19]
-// Lgammal is aproximated by polynomial within [-.154151 ; .154151 ] range
+// Lgammal is approximated by polynomial within [-.154151 ; .154151 ] range
data8 0xBFAB767F9BE21803, 0xBC5ACEF5BB1BD8B5 //A0
data8 0x4379999999999999, 0x4029241C7F5914C8 //A1
data8 0x46F47AE147AE147A, 0x43AC2979B64B9D7E //A2
@@ -1733,7 +1733,7 @@ LOCAL_OBJECT_END(lgammal_right_roots_pol
LOCAL_OBJECT_START(lgammal_left_roots_polynomial_data)
// Polynomial coefficients for left root on [-3, -2]
-// Lgammal is aproximated by polynomial within [.084641 ; -.059553 ] range
+// Lgammal is approximated by polynomial within [.084641 ; -.059553 ] range
data8 0xBC0844590979B82E, 0xB8BC7CE8CE2ECC3B //A0
data8 0xBFFEA12DA904B18C, 0xBC91A6B2BAD5EF6E //A1
data8 0x4023267F3C265A51, 0x3CD7055481D03AED //A2
@@ -1756,7 +1756,7 @@ data8 0x41EA727E3033E2D9 //A18
data8 0xC20812C297729142 //A19
//
// Polynomial coefficients for left root on [-4, -3]
-// Lgammal is aproximated by polynomial within [.147147 ; -.145158 ] range
+// Lgammal is approximated by polynomial within [.147147 ; -.145158 ] range
data8 0xBC3130AE5C4F54DB, 0xB8ED23294C13398A //A0
data8 0xC034B99D966C5646, 0xBCE2E5FE3BC3DBB9 //A1
data8 0x406F76DEAE0436BD, 0x3D14974DDEC057BD //A2
@@ -1778,7 +1778,7 @@ data8 0xC471C4421E908C3A //A17
data8 0x44B92CD4D59D6D17 //A18
data8 0xC4FB3A078B5247FA //A19
// Polynomial coefficients for left root on [-5, -4]
-// Lgammal is aproximated by polynomial within [.155671 ; -.155300 ] range
+// Lgammal is approximated by polynomial within [.155671 ; -.155300 ] range
data8 0xBC57BF3C6E8A94C1, 0xB902FB666934AC9E //A0
data8 0xC05D224A3EF9E41F, 0xBCF6F5713913E440 //A1
data8 0x40BB533C678A3955, 0x3D688E53E3C72538 //A2
@@ -1800,7 +1800,7 @@ data8 0xC6FFDDC6DD938E2E //A17
data8 0x476DD7C07184B9F9 //A18
data8 0xC7D554A30085C052 //A19
// Polynomial coefficients for left root on [-6, -5]
-// Lgammal is aproximated by polynomial within [.157425 ; -.157360 ] range
+// Lgammal is approximated by polynomial within [.157425 ; -.157360 ] range
data8 0x3C9E20A87C8B79F1, 0x39488BE34B2427DB //A0
data8 0xC08661F6A43A5E12, 0xBD3D912526D759CC //A1
data8 0x410F79DCB794F270, 0x3DB9BEE7CD3C1BF5 //A2
@@ -1822,7 +1822,7 @@ data8 0xC9C2C6A864521F3A //A17
data8 0x4A5AB127C62E8DA1 //A18
data8 0xCAECF60EF3183C57 //A19
// Polynomial coefficients for left root on [-7, -6]
-// Lgammal is aproximated by polynomial within [.157749 ; -.157739 ] range
+// Lgammal is approximated by polynomial within [.157749 ; -.157739 ] range
data8 0x3CC9B9E8B8D551D6, 0x3961813C8E1E10DB //A0
data8 0xC0B3ABF7A5CEA91F, 0xBD55638D4BCB4CC4 //A1
data8 0x4168349A25504236, 0x3E0287ECE50CCF76 //A2
@@ -1844,7 +1844,7 @@ data8 0xCCC01CB3021212FF //A17
data8 0x4D841613AC3431D1 //A18
data8 0xCE431C9E9EE43AD9 //A19
// Polynomial coefficients for left root on [-8, -7]
-// Lgammal is aproximated by polynomial within [.157799 ; -.157798 ] range
+// Lgammal is approximated by polynomial within [.157799 ; -.157798 ] range
data8 0xBCF9C7A33AD9478C, 0xB995B0470F11E5ED //A0
data8 0xC0E3AF76FE4C2F8B, 0xBD8DBCD503250511 //A1
data8 0x41C838E76CAAF0D5, 0x3E5D79F5E2E069C3 //A2
@@ -1866,7 +1866,7 @@ data8 0xCFF0351B51508523 //A17
data8 0x50E4364CCBF53100 //A18
data8 0xD1D33CFD0BF96FA6 //A19
// Polynomial coefficients for left root on [-9, -8]
-// Lgammal is aproximated by polynomial within [.157806 ; -.157806 ] range
+// Lgammal is approximated by polynomial within [.157806 ; -.157806 ] range
data8 0x3D333E4438B1B9D4, 0x39E7B956B83964C1 //A0
data8 0xC11625EDFC63DCD8, 0xBDCF39625709EFAC //A1
data8 0x422EA8C150480F16, 0x3EC16ED908AB7EDD //A2
@@ -1888,7 +1888,7 @@ data8 0xD34E085C088404A5 //A17
data8 0x547511892FF8960E //A18
data8 0xD5968FA3B1ED67A9 //A19
// Polynomial coefficients for left root on [-10, -9]
-// Lgammal is aproximated by polynomial within [.157807 ; -.157807 ] range
+// Lgammal is approximated by polynomial within [.157807 ; -.157807 ] range
data8 0xBD355818A2B42BA2, 0xB9B7320B6A0D61EA //A0
data8 0xC14BAF7DA5F3770E, 0xBDE64AF9A868F719 //A1
data8 0x4297F3E8791F9CD3, 0x3F2A553E59B4835E //A2
@@ -1910,7 +1910,7 @@ data8 0xD6D4D760074F6E6B //A17
data8 0x5832469D58ED3FA9 //A18
data8 0xD988769F3DC76642 //A19
// Polynomial coefficients for left root on [-11, -10]
-// Lgammal is aproximated by polynomial within [.157807 ; -.157807 ] range
+// Lgammal is approximated by polynomial within [.157807 ; -.157807 ] range
data8 0xBDA050601F39778A, 0xBA0D4D1CE53E8241 //A0
data8 0xC18308A7D8EA4039, 0xBE370C379D3EAD41 //A1
data8 0x4306A49380644E6C, 0x3FBBB143C0E7B5C8 //A2
@@ -1932,7 +1932,7 @@ data8 0xDA8246294D210BEC //A17
data8 0x5C1608AAC32C3A8E //A18
data8 0xDDA446E570A397D5 //A19
// Polynomial coefficients for left root on [-12, -11]
-// Lgammal is aproximated by polynomial within [.157807 ; -.157807 ] range
+// Lgammal is approximated by polynomial within [.157807 ; -.157807 ] range
data8 0x3DEACBB3081C502E, 0x3A8AA6F01DEDF745 //A0
data8 0xC1BC8CFBFB0A9912, 0xBE6556B6504A2AE6 //A1
data8 0x43797926206941D7, 0x40289A9644C2A216 //A2
@@ -1954,7 +1954,7 @@ data8 0xDE51952FDFD1EC49 //A17
data8 0x601FCCEC1BBD25F1 //A18
data8 0xE1E5F2D76B610920 //A19
// Polynomial coefficients for left root on [-13, -12]
-// Lgammal is aproximated by polynomial within [.157807 ; -.157807 ] range
+// Lgammal is approximated by polynomial within [.157807 ; -.157807 ] range
data8 0xBE01612F373268ED, 0xBA97B7A18CDF103B //A0
data8 0xC1F7328CBF7A4FAC, 0xBE89A25A6952F481 //A1
data8 0x43F0D0FA2DBDA237, 0x40A0422EC1CE6084 //A2
@@ -1976,7 +1976,7 @@ data8 0xE2407D92CD613E82 //A17
data8 0x64483B9B62367EB7 //A18
data8 0xE64B2DC830E8A799 //A1
// Polynomial coefficients for left root on [-14, -13]
-// Lgammal is aproximated by polynomial within [.157807 ; -.157807 ] range
+// Lgammal is approximated by polynomial within [.157807 ; -.157807 ] range
data8 0x3E563D0B930B371F, 0x3AE779957E14F012 //A0
data8 0xC2344C3B2F083767, 0xBEC0B7769AA3DD66 //A1
data8 0x4469BFFF28B50D07, 0x41181E3F13ED2401 //A2
@@ -1998,7 +1998,7 @@ data8 0xE64B4201CDF9F138 //A17
data8 0x689186351E58AA88 //A18
data8 0xEAD132A585DFC60A //A19
// Polynomial coefficients for left root on [-15, -14]
-// Lgammal is aproximated by polynomial within [.157807 ; -.157807 ] range
+// Lgammal is approximated by polynomial within [.157807 ; -.157807 ] range
data8 0xBE6D7DDE12700AC1, 0xBB1E025BF1667FB5 //A0
data8 0xC273077763F60AD5, 0xBF2A1698184C7A9A //A1
data8 0x44E6A1BF095B1AB3, 0x4178D5AE8A4A2874 //A2
@@ -2020,7 +2020,7 @@ data8 0xEA7232C8804F32C3 //A17
data8 0x6CF5EFEE929A0928 //A18
data8 0xEF742EE03EC3E8FF //A19
// Polynomial coefficients for left root on [-16, -15]
-// Lgammal is aproximated by polynomial within [.157807 ; -.157807 ] range
+// Lgammal is approximated by polynomial within [.157807 ; -.157807 ] range
data8 0xBEDCC628FEAC7A1B, 0xBB80582C8BEBB198 //A0
data8 0xC2B3076EE752595E, 0xBF5388F55AFAE53E //A1
data8 0x4566A1AAD96EBCB5, 0x421F0FEFE2444293 //A2
@@ -2042,7 +2042,7 @@ data8 0xEEB23234FE191D55 //A17
data8 0x7175EF5D1080B105 //A18
data8 0xF4342ED7B1B7BE31 //A19
// Polynomial coefficients for left root on [-17, -16]
-// Lgammal is aproximated by polynomial within [.157807 ; -.157807 ] range
+// Lgammal is approximated by polynomial within [.157807 ; -.157807 ] range
data8 0xBF28AEEE7B58C790, 0xBBC4448DE371FA0A //A0
data8 0xC2F436F56B3B89B1, 0xBF636755245AC63A //A1
data8 0x45E98A22535D115D, 0x4298467DA93DB784 //A2
@@ -2064,7 +2064,7 @@ data8 0xF3096A81A69BD8AE //A17
data8 0x76104951BAD67D5C //A18
data8 0xF90FECC99786FD5B //A19
// Polynomial coefficients for left root on [-18, -17]
-// Lgammal is aproximated by polynomial within [.157807 ; -.157807 ] range
+// Lgammal is approximated by polynomial within [.157807 ; -.157807 ] range
data8 0x3F3C19A53328E26A, 0x3BE238D7BA036B3B //A0
data8 0xC336C16C16C16C13, 0xBFEACE245DEC56F3 //A1
data8 0x46702E85C0898B70, 0x432C922B64FD1DA4 //A2
@@ -2086,7 +2086,7 @@ data8 0xF777CB6E2B550D73 //A17
data8 0x7AC11E468A134A51 //A18
data8 0xFE02B6BDD0FC40AA //A19
// Polynomial coefficients for left root on [-19, -18]
-// Lgammal is aproximated by polynomial within [.157807 ; -.157807 ] range
+// Lgammal is approximated by polynomial within [.157807 ; -.157807 ] range
data8 0xBFAB767F9BE217FC, 0xBC4A5541CE0D8D0D //A0
data8 0xC379999999999999, 0xC01A84981B490BE8 //A1
data8 0x46F47AE147AE147A, 0x43AC2987BBC466EB //A2
@@ -2166,7 +2166,7 @@ _deno_back_to_main_path:
;;
{ .mfi
shladd rZ1offsett = GR_Index1, 2, GR_ad_z_1 // Point to Z_1
- fmerge.se fSignifX = f1, f8 // sifnificand of x
+ fmerge.se fSignifX = f1, f8 // significant of x
// Get high 15 bits of significand
extr.u GR_X_0 = rSignifX, 49, 15
}
@@ -2441,7 +2441,7 @@ _deno_back_to_main_path:
// point to right "near root" bound
adds rTmpPtr2 = 8, rRootsBndAddr
fnma.s1 fMOne = f1, f1, f0 // -1.0
- // Point to Bernulli numbers
+ // Point to Bernoulli numbers
adds rBernulliPtr = 544, rTbl3Addr
}
;;
@@ -2456,7 +2456,7 @@ _deno_back_to_main_path:
// right bound of "near root" range
(p12) ld8 rRightBound = [rTmpPtr2]
fcvt.xf fFloatN = fFloatN
- // special "Bernulli" numbers for Stirling's formula for -13 < x < -6
+ // special "Bernoulli" numbers for Stirling's formula for -13 < x < -6
(p14) adds rBernulliPtr = 160, rBernulliPtr
}
;;
@@ -2598,7 +2598,7 @@ _deno_back_to_main_path:
{ .mfi
ldfe fA12 = [rTmpPtr2], -32 // A12
fms.s1 FR_r = FR_G, fSignifX, f1 // r = G * S_hi - 1
- sub GR_N = GR_N, rExpHalf, 1 // unbisaed exponent of DeltaX
+ sub GR_N = GR_N, rExpHalf, 1 // unbiased exponent of DeltaX
}
;;
//
@@ -4221,7 +4221,7 @@ _negStirling:
;;
{ .mfi
nop.m 0
- // low part of "Bernulli" polynomial
+ // low part of "Bernoulli" polynomial
fma.s1 fB20 = fB20, fInvX3, fA2L
nop.i 0
}
@@ -4503,8 +4503,8 @@ _negStirling:
}
;;
-// here if x falls in neighbourhood of any negative root
-// "neighbourhood" typically means that |lgammal(x)| < 0.17
+// here if x falls in neighborhood of any negative root
+// "neighborhood" typically means that |lgammal(x)| < 0.17
// on the [-3.0,-2.0] range |lgammal(x)| has even less
// magnitude
// rXint contains index of the root
@@ -5882,7 +5882,7 @@ lgammal_big_positive:
{ .mfi
ldfe fB16 = [rPolDataPtr], 16
// get double extended coefficients from two doubles
- // two doubles are needed in Stitling's formula for negative x
+ // two doubles are needed in Stirling's formula for negative x
fadd.s1 fB2 = fB2, fA1
nop.i 0
}
--- libc/sysdeps/ia64/fpu/e_asin.S.jj 2005-04-13 21:29:36.000000000 +0200
+++ libc/sysdeps/ia64/fpu/e_asin.S 2005-08-18 13:37:52.000000000 +0200
@@ -51,7 +51,7 @@
//=========================================
// The asin function computes the principal value of the arc sine of x.
// asin(0) returns 0, asin(1) returns pi/2, asin(-1) returns -pi/2.
-// A doman error occurs for arguments not in the range [-1,+1].
+// A domain error occurs for arguments not in the range [-1,+1].
//
// The asin function returns the arc sine in the range [-pi/2, +pi/2] radians.
//
@@ -88,10 +88,10 @@
//
// S3 approximates sqrt(R) with enough accuracy for this algorithm
//
-// So, the result should be reconstracted as follows:
+// So, the result should be reconstructed as follows:
// asin(x) = sign(x) * (Pi/2 - S3*PolB(R))
//
-// But for optimization perposes the reconstruction step is slightly
+// But for optimization purposes the reconstruction step is slightly
// changed:
// asin(x) = sign(x)*(Pi/2 - PolB(R)*S2) + sign(x)*d2*S2*PolB(R)
//
@@ -99,7 +99,7 @@
// Return asin(x) = sign(x)*Pi/2
//
// 5. 1.0 < |x| <= +INF
-// A doman error occurs for arguments not in the range [-1,+1]
+// A domain error occurs for arguments not in the range [-1,+1]
//
// 6. x = [S,Q]NaN
// Return asin(x) = QNaN
--- libc/sysdeps/ia64/fpu/e_sinh.S.jj 2005-04-13 21:29:37.000000000 +0200
+++ libc/sysdeps/ia64/fpu/e_sinh.S 2005-08-18 13:37:52.000000000 +0200
@@ -447,7 +447,7 @@ SINH_COMMON:
;;
// Nfloat = round_int(W)
-// The signficand of fW_2TO56_RSH contains the rounded integer part of W,
+// The significant of fW_2TO56_RSH contains the rounded integer part of W,
// as a twos complement number in the lower bits (that is, it may be negative).
// That twos complement number (called N) is put into rN.
--- libc/sysdeps/ia64/fpu/e_asinf.S.jj 2005-04-13 21:29:36.000000000 +0200
+++ libc/sysdeps/ia64/fpu/e_asinf.S 2005-08-18 13:37:52.000000000 +0200
@@ -57,12 +57,12 @@
// Description
//=========================================
// The asinf function computes the arc sine of x in the range [-pi,+pi].
-// A doman error occurs for arguments not in the range [-1,+1].
+// A domain error occurs for arguments not in the range [-1,+1].
// asinf(+-0) returns +-0
// asinf(x) returns a Nan and raises the invalid exception for |x| >1
// The acosf function returns the arc cosine in the range [0, +pi] radians.
-// A doman error occurs for arguments not in the range [-1,+1].
+// A domain error occurs for arguments not in the range [-1,+1].
// acosf(1) returns +0
// acosf(x) returns a Nan and raises the invalid exception for |x| >1
--- libc/sysdeps/ia64/fpu/s_erfcf.S.jj 2005-04-13 21:29:39.000000000 +0200
+++ libc/sysdeps/ia64/fpu/s_erfcf.S 2005-08-18 13:37:52.000000000 +0200
@@ -63,7 +63,7 @@
//
// Let P15(x) - polynomial approximation of degree 15 for function
// erfcf(x) * exp( x^2) and x(i) <= x <= x(i+1), i = 0,1,2,3
-// Polynomial coeffitients we have in the table erfc_p_table.
+// Polynomial coefficients we have in the table erfc_p_table.
//
// So we can find result for erfcf(x) as above.
// Algorithm description for exp function see below.
@@ -617,7 +617,7 @@ GLOBAL_LIBM_ENTRY(erfcf)
;;
// Nfloat = round_int(W)
-// The signficand of EXP_W_2TO56_RSH contains the rounded integer part of W,
+// The significant of EXP_W_2TO56_RSH contains the rounded integer part of W,
// as a twos complement number in the lower bits (that is, it may be negative).
// That twos complement number (called N) is put into exp_GR_N.
--- libc/sysdeps/ia64/fpu/libm_sincos_large.S.jj 2005-04-13 21:29:38.000000000 +0200
+++ libc/sysdeps/ia64/fpu/libm_sincos_large.S 2005-08-18 13:37:52.000000000 +0200
@@ -223,7 +223,7 @@
// = (-1)^i_0 * [cos(r) - c*r] if i_1 = 1
//
// because |r| is small and thus the second terms in the correction
-// are unneccessary.
+// are unnecessary.
//
// Finally, sin(r) and cos(r) are approximated by polynomials of
// moderate lengths.
@@ -1175,7 +1175,7 @@ SINCOS_CONTINUE:
{ .mfi
nop.m 999
//
-// For big s: r = s - w: No futher reduction is necessary
+// For big s: r = s - w: No further reduction is necessary
// For small s: w = N * P_3 (change sign) More reduction
//
(p6) fcmp.lt.unc.s1 p8, p9 = FR_r, FR_Two_to_M3
--- libc/sysdeps/ia64/fpu/s_tanl.S.jj 2005-04-13 21:29:40.000000000 +0200
+++ libc/sysdeps/ia64/fpu/s_tanl.S 2005-08-18 13:51:03.000000000 +0200
@@ -1315,7 +1315,7 @@ TANL_COMMON:
//
// Do fcmp to generate Denormal exception
// - can't do FNORM (will generate Underflow when U is unmasked!)
-// Branch out to deal with unsupporteds values.
+// Branch out to deal with unsupported values.
{ .mfi
setf.exp FR_2tom64 = GR_exp_2tom64 // Form 2^-64 for scaling N_float
fcmp.eq.s0 p0, p6 = Arg, f1 // Dummy to flag denormals
@@ -1953,7 +1953,7 @@ TANL_LARGER_ARG:
}
;;
-// Case 4: We need abs of both U_hi and V_hi - dont
+// Case 4: We need abs of both U_hi and V_hi - don't
// worry about switched sign of V_hi.
{ .mfi
nop.m 999
--- libc/sysdeps/ia64/fpu/s_asinhf.S.jj 2005-01-06 12:29:22.000000000 +0100
+++ libc/sysdeps/ia64/fpu/s_asinhf.S 2005-08-18 13:37:52.000000000 +0200
@@ -44,7 +44,7 @@
// 04/19/01 Improved speed of the paths #1,2,3,4,5
// 05/20/02 Cleaned up namespace and sf0 syntax
// 02/06/03 Reordered header: .section, .global, .proc, .align
-// 05/21/03 Improved performance, fixed to handle unorms
+// 05/21/03 Improved performance, fixed to handle unnorms
//
// API
// ==============================================================
@@ -156,7 +156,7 @@
// p11 to filter out case when x >= 0
// p12 to filter out case when x = + denormal
// p13 to select path #4
-// p14 to filtef out case when x = - denormal
+// p14 to filter out case when x = - denormal
// Assembly macros
//==============================================================
log_GR_exp_17_ones = r14
--- libc/sysdeps/ia64/fpu/e_log.S.jj 2005-04-13 21:29:37.000000000 +0200
+++ libc/sysdeps/ia64/fpu/e_log.S 2005-08-18 13:37:52.000000000 +0200
@@ -122,7 +122,7 @@
// L2 = 1.0/log(10)
//
// So common code with two different entry points those set pointers
-// to the base address of coresponding data sets containing values
+// to the base address of corresponding data sets containing values
// of L2,T and prepare integer representation of L1 needed for following
// setf instruction.
//
@@ -134,7 +134,7 @@
// InvX = frcpa(x)
// r = InvX*x - 1
// P(r) = r*((r*A3 - A2) + r^4*((A4 + r*A5) + r^2*(A6 + r*A7)),
-// all coefficients are calcutated in quad and rounded to double
+// all coefficients are calculated in quad and rounded to double
// precision. A7,A6,A5,A4 are stored in memory whereas A3 and A2
// created with setf.
//
@@ -825,7 +825,7 @@ LOCAL_OBJECT_END(log_data)
LOCAL_OBJECT_START(log10_data)
-// coefficients of polynoimal approximation
+// coefficients of polynomial approximation
data8 0x3FC2494104381A8E // A7
data8 0xBFC5556D556BBB69 // A6
//
--- libc/sysdeps/ia64/fpu/e_atanhf.S.jj 2005-04-13 21:29:37.000000000 +0200
+++ libc/sysdeps/ia64/fpu/e_atanhf.S 2005-08-18 13:37:52.000000000 +0200
@@ -43,7 +43,7 @@
// 05/20/02 Cleaned up namespace and sf0 syntax
// 08/06/02 Improved Itanium 2 performance
// 02/06/03 Reordered header: .section, .global, .proc, .align
-// 05/26/03 Improved performance, fixed to handle unorms
+// 05/26/03 Improved performance, fixed to handle unnorms
//
// API
//==============================================================
--- libc/sysdeps/ia64/fpu/s_modfl.S.jj 2005-01-08 16:50:26.000000000 +0100
+++ libc/sysdeps/ia64/fpu/s_modfl.S 2005-08-18 13:37:52.000000000 +0200
@@ -152,7 +152,7 @@ GLOBAL_LIBM_ENTRY(modfl)
nop.i 999 ;;
}
-// p11 <== SMALL, no integer part, fraction is everyting
+// p11 <== SMALL, no integer part, fraction is everything
// p9 <== HUGE, no fraction part, integer is everything
// p12 <== NORMAL, fraction part and integer part
{ .mii
--- libc/sysdeps/ia64/fpu/e_atanhl.S.jj 2005-04-13 21:29:37.000000000 +0200
+++ libc/sysdeps/ia64/fpu/e_atanhl.S 2005-08-18 13:37:53.000000000 +0200
@@ -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.
//
--- libc/sysdeps/ia64/fpu/w_tgammal.S.jj 2005-04-13 21:29:40.000000000 +0200
+++ libc/sysdeps/ia64/fpu/w_tgammal.S 2005-08-18 13:37:52.000000000 +0200
@@ -84,7 +84,7 @@
// 1) |X| >= 13 - Stirling formula computation
// a) Positive arguments:
// TGAMMAL(X) = exp((X-0.5)*ln(X) - X + C + S(Z)),
-// where C = 0.5*ln(2*Pi) , Z = 1/Z, S(Z) - Bernulli polynomial
+// where C = 0.5*ln(2*Pi) , Z = 1/Z, S(Z) - Bernoulli polynomial
// (up to 'B18' term).
// Some of these calculation done in multiprecision.
// Ln returns multiprecision result too
@@ -102,15 +102,15 @@
//
// 2) 1 <= |X| < 13 - Polynomial part
// a) Positive arguments:
-// All values are splitted to such intervals as:
+// All values are split to such intervals as:
// #0->[2;3], #1->[3,4], #2->[5,6]...
// For even intervals we just use polynomial computation with degree 20
// and first 6 multiprecision computations.
// Range reduction looks like
// N = [x] with truncate, r = x - N - 0.5, -0.5 <= r < 0.5
-// For odd intervals we use reccurent formula:
+// For odd intervals we use recurrent formula:
// TGAMMAL(X) = TGAMMA(X-1)*(X-1)
-// [1;2] interval is splitted to 3 subranges:
+// [1;2] interval is split to 3 subranges:
// [1;1.25], [1.25;1.75], [1.75;2] with the same polynomial forms
//
// b) Negative arguments
@@ -120,7 +120,7 @@
// and get final result.
//
// 3) 0 < |X| < 1 - Near 0 part
-// a) Here we use reccurent formula TGAMMAL(X) = TGAMMAL(X+1)/X
+// a) Here we use recurrent formula TGAMMAL(X) = TGAMMAL(X+1)/X
// TGAMMAL(X+1) calculated as shown above,
// 1/X result obtained in parallel. Then we just multiply these values.
// There is only additional separated subrange: [0;0.125] with specific
@@ -270,7 +270,7 @@ LOCAL_OBJECT_END(Constants_Tgammal_log_8
LOCAL_OBJECT_START(Constants_Tgammal_stirling)
//0.5*ln(2*Pi)=9.1893853320467266954096885e-01 + 7.2239360881843238220057778e-17
data8 0x3FED67F1C864BEB4, 0x3C94D252F2400510
-// Bernulli numbers
+// Bernoulli numbers
data8 0xAAAAAAAAAAAAAAAB, 0x00003FFB //B2 = 8.3333333333333333333333333333e-02
data8 0xBF66C16C16C16C17 //B4 = -2.7777777777777777777777777778e-03
data8 0x3F4A01A01A01A01A //B6 = 7.9365079365079365079365079365e-04
@@ -1249,7 +1249,7 @@ GLOBAL_LIBM_ENTRY(tgammal)
adds GR_c_NegUnderflow = 1765, r0
nop.f 0
(p6) br.cond.spnt tgammal_spec // Spec. values processing branch ////////////
- // (0s, INFs, NANs, NatVals, denormals) //////
+ // (0s, Infs, NANs, NatVals, denormals) //////
};;
{ .mfi
@@ -1629,7 +1629,7 @@ GLOBAL_LIBM_ENTRY(tgammal)
{ .mfi
nop.m 0
- fma.s1 FR_l_B14 = FR_l_B16, FR_l_Z2, FR_l_B14// bernulli tail
+ fma.s1 FR_l_B14 = FR_l_B16, FR_l_Z2, FR_l_B14// Bernoulli tail
nop.i 0
}
{ .mfi
@@ -1640,18 +1640,18 @@ GLOBAL_LIBM_ENTRY(tgammal)
{ .mfi
nop.m 0
- fma.s1 FR_l_B2 = FR_l_B4, FR_l_Z2, FR_l_B2 // bernulli tail
+ fma.s1 FR_l_B2 = FR_l_B4, FR_l_Z2, FR_l_B2 // Bernoulli tail
nop.i 0
}
{ .mfi
nop.m 0
- fma.s1 FR_l_B6 = FR_l_B8, FR_l_Z2, FR_l_B6 // bernulli tail
+ fma.s1 FR_l_B6 = FR_l_B8, FR_l_Z2, FR_l_B6 // Bernoulli tail
nop.i 0
};;
{ .mfi
nop.m 0
- fma.s1 FR_l_B10 = FR_l_B12, FR_l_Z2, FR_l_B10// bernulli tail
+ fma.s1 FR_l_B10 = FR_l_B12, FR_l_Z2, FR_l_B10// Bernoulli tail
nop.i 0
}
{ .mfi
@@ -1713,18 +1713,18 @@ GLOBAL_LIBM_ENTRY(tgammal)
}
{ .mfi
nop.m 0
- fma.s1 FR_l_B14 = FR_l_B18, FR_l_Z4, FR_l_B14 //bernulli tail
+ fma.s1 FR_l_B14 = FR_l_B18, FR_l_Z4, FR_l_B14 //Bernoulli tail
nop.i 0
};;
{ .mfi
nop.m 0
- fma.s1 FR_l_B2 = FR_l_B6, FR_l_Z4, FR_l_B2 //bernulli tail
+ fma.s1 FR_l_B2 = FR_l_B6, FR_l_Z4, FR_l_B2 //Bernoulli tail
nop.i 0
}
{ .mfi
nop.m 0
- fma.s1 FR_l_Z8 = FR_l_Z4, FR_l_Z4, f0 //bernulli tail
+ fma.s1 FR_l_Z8 = FR_l_Z4, FR_l_Z4, f0 //Bernoulli tail
nop.i 0
};;
@@ -1759,7 +1759,7 @@ GLOBAL_LIBM_ENTRY(tgammal)
{ .mfi
nop.m 0
- fma.s1 FR_l_B10 = FR_l_B14, FR_l_Z4, FR_l_B10 //bernulli tail
+ fma.s1 FR_l_B10 = FR_l_B14, FR_l_Z4, FR_l_B10 //Bernoulli tail
nop.i 0
};;
@@ -1795,7 +1795,7 @@ GLOBAL_LIBM_ENTRY(tgammal)
{ .mfi
nop.m 0
- fma.s1 FR_l_SS = FR_l_B10, FR_l_Z8, FR_l_B2 // bernulli tail
+ fma.s1 FR_l_SS = FR_l_B10, FR_l_Z8, FR_l_B2 // Bernoulli tail
nop.i 0
};;
@@ -2416,7 +2416,7 @@ tgamma_lt_13:
{ .mfi
ldfe FR_r_A6 = [GR_r_sin_Table2], 16
nop.f 0
- cmp.gtu p11, p12 = 0x2, GR_p_XN // p11: x < 2 (splitted intervals),
+ cmp.gtu p11, p12 = 0x2, GR_p_XN // p11: x < 2 (split intervals),
// p12: x > 2 (base intervals)
};;
@@ -2446,7 +2446,7 @@ tgamma_lt_13:
{ .mfi
ldfe FR_r_A8 = [GR_r_sin_Table], 16
nop.f 0
-(p12) tbit.nz.unc p13, p12 = GR_p_XN, 0x0 // p13: reccurent computations
+(p12) tbit.nz.unc p13, p12 = GR_p_XN, 0x0 // p13: recurrent computations
// X is at [3;4], [5;6], [7;8]... interval
}
{ .mfi
@@ -3014,7 +3014,7 @@ tgamma_lt_13:
{ .mfi
nop.m 0
(p13) fma.s1 FR_p_OddPoly0H = FR_p_Poly0H, FR_p_AbsXM1, f0
- // Reccurent computations - multiplying by X-1
+ // Recurrent computations - multiplying by X-1
nop.i 0
};;
@@ -3070,7 +3070,7 @@ tgamma_lt_13:
{ .mfi
nop.m 0
(p13) fms.s1 FR_p_OddPoly0L = FR_p_Poly0H, FR_p_AbsXM1, FR_p_OddPoly0H
- // Reccurent computations - multiplying by X-1 (low part)
+ // Recurrent computations - multiplying by X-1 (low part)
nop.i 0
};;
@@ -3135,7 +3135,7 @@ tgamma_lt_13:
{ .mfi
nop.m 0
(p13) fma.s1 FR_p_OddPoly0L = FR_p_Poly0L, FR_p_AbsXM1, FR_p_OddPoly0L
- // Reccurent computations - multiplying by X-1 (low part)
+ // Recurrent computations - multiplying by X-1 (low part)
nop.i 0
};;
@@ -3160,13 +3160,13 @@ tgamma_lt_13:
{ .mfi
nop.m 0
(p13) fma.s1 FR_p_Poly0H = FR_p_OddPoly0H, f1, f0
- // Reccurent computations
+ // Recurrent computations
nop.i 0
}
{ .mfi
nop.m 0
(p13) fma.s1 FR_p_Poly0L = FR_p_OddPoly0L, f1, f0
- // Reccurent computations
+ // Recurrent computations
nop.i 0
};;
--- libc/sysdeps/ia64/fpu/s_log1p.S.jj 2005-04-13 21:29:40.000000000 +0200
+++ libc/sysdeps/ia64/fpu/s_log1p.S 2005-08-18 13:37:52.000000000 +0200
@@ -103,7 +103,7 @@
// InvX = frcpa(x+1)
// r = InvX*(x+1) - 1
// P(r) = r*((r*A3 - A2) + r^4*((A4 + r*A5) + r^2*(A6 + r*A7)),
-// all coefficients are calcutated in quad and rounded to double
+// all coefficients are calculated in quad and rounded to double
// precision. A7,A6,A5,A4 are stored in memory whereas A3 and A2
// created with setf.
//
--- libc/sysdeps/ia64/fpu/w_tgammaf.S.jj 2005-04-13 21:29:40.000000000 +0200
+++ libc/sysdeps/ia64/fpu/w_tgammaf.S 2005-08-18 13:37:52.000000000 +0200
@@ -171,7 +171,7 @@
// Step 3: Division
// ----------------
// To calculate 1/x and 1/(GAMMA(x)*S12(rs)) we use frcpa
-// instruction with following Newton-Raphson interations.
+// instruction with following Newton-Raphson iterations.
//
//
//*********************************************************************
--- libc/sysdeps/ia64/fpu/s_log1pl.S.jj 2005-04-13 21:29:40.000000000 +0200
+++ libc/sysdeps/ia64/fpu/s_log1pl.S 2005-08-18 13:37:52.000000000 +0200
@@ -185,7 +185,7 @@
// ----------------------
//
// Z := X + 1
-// N := unbaised exponent of Z
+// N := unbiased exponent of Z
// S_hi := 2^(-N) * Z
// S_lo := 2^(-N) * { (max(X,1)-Z) + min(X,1) }
//
@@ -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.
//
@@ -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.
//
--- libc/sysdeps/ia64/fpu/s_cbrt.S.jj 2005-04-13 21:29:39.000000000 +0200
+++ libc/sysdeps/ia64/fpu/s_cbrt.S 2005-08-18 13:37:51.000000000 +0200
@@ -59,9 +59,9 @@
//
// cbrt(a)= cbrt(a*y)/cbrt(y) = cbrt(1 - (1-a*y)) * (1/cbrt(y))
//
-// For all values of y, the 3 possible significands of 1/cbrt(y)
+// For all values of y, the 3 possible significants of 1/cbrt(y)
// are stored in a table (T0) to 64 bits of accuracy. (There are
-// 3 possible significands because the exponent of y modulo 3
+// 3 possible significants because the exponent of y modulo 3
// can be 0, 1, or 2.)
//
//
@@ -166,7 +166,7 @@ LOCAL_OBJECT_END(poly_coeffs)
// For every entry B in the frcpa table, this table contains
-// the significands of cbrt(1/B), cbrt(2/B), cbrt(4/B).
+// the significants of cbrt(1/B), cbrt(2/B), cbrt(4/B).
// The index to this table is the same as the frcpa index.
LOCAL_OBJECT_START(T_table)
--- libc/sysdeps/ia64/fpu/s_expm1l.S.jj 2005-04-13 21:29:39.000000000 +0200
+++ libc/sysdeps/ia64/fpu/s_expm1l.S 2005-08-18 13:37:53.000000000 +0200
@@ -139,7 +139,7 @@
// Case exp_small:
//
// Here, exp(X) and exp(X) - 1 can all be
-// appproximated by a relatively simple polynomial.
+// approximated by a relatively simple polynomial.
//
// This polynomial resembles the truncated Taylor series
//
@@ -833,7 +833,7 @@ exp_continue:
// Now we are on the main path for |x| >= 2^-m, m=12 for exp, m=7 for expm1
//
// float_N = round_int(N_signif)
-// The signficand of N_signif contains the rounded integer part of X * 2^12/ln2,
+// The significant of N_signif contains the rounded integer part of X * 2^12/ln2,
// as a twos complement number in the lower bits (that is, it may be negative).
// That twos complement number (called N) is put into GR_N.
--- libc/sysdeps/ia64/fpu/e_acosl.S.jj 2005-04-13 21:29:36.000000000 +0200
+++ libc/sysdeps/ia64/fpu/e_acosl.S 2005-08-18 13:37:53.000000000 +0200
@@ -58,7 +58,7 @@
// acos(s)= pi/2-asin(t)-asin(r), where r= s*sqrt(1-t^2)-t*sqrt(1-s^2), i.e.
// r= (s-t)*sqrt(1-t^2)-t*sqrt(1-t^2)*(sqrt((1-s^2)/(1-t^2))-1)
// asin(r)-r evaluated as 9-degree polynomial (c3*r^3+c5*r^5+c7*r^7+c9*r^9)
-// The 64-bit significands of sqrt(1-t^2), 1/(1-t^2) are read from the table,
+// The 64-bit significants of sqrt(1-t^2), 1/(1-t^2) are read from the table,
// along with the high and low parts of asin(t) (stored as two double precision
// values)
//
--- libc/sysdeps/ia64/fpu/s_modf.S.jj 2005-01-08 16:50:26.000000000 +0100
+++ libc/sysdeps/ia64/fpu/s_modf.S 2005-08-18 13:37:53.000000000 +0200
@@ -157,7 +157,7 @@ GLOBAL_LIBM_ENTRY(modf)
nop.i 999 ;;
}
-// p11 <== SMALL, no integer part, fraction is everyting
+// p11 <== SMALL, no integer part, fraction is everything
// p9 <== HUGE, no fraction part, integer is everything
// p12 <== NORMAL, fraction part and integer part
{ .mii
--- libc/sysdeps/ia64/fpu/e_cosh.S.jj 2005-04-13 21:29:37.000000000 +0200
+++ libc/sysdeps/ia64/fpu/e_cosh.S 2005-08-18 13:37:53.000000000 +0200
@@ -441,7 +441,7 @@ COSH_COMMON:
;;
// Nfloat = round_int(W)
-// The signficand of fW_2TO56_RSH contains the rounded integer part of W,
+// The significant of fW_2TO56_RSH contains the rounded integer part of W,
// as a twos complement number in the lower bits (that is, it may be negative).
// That twos complement number (called N) is put into rN.
--- libc/sysdeps/ia64/fpu/libm_tan.S.jj 2002-07-06 08:35:58.000000000 +0200
+++ libc/sysdeps/ia64/fpu/libm_tan.S 2005-08-18 13:52:16.000000000 +0200
@@ -1864,7 +1864,7 @@ TAN_LARGER_ARG:
{ .mfi
nop.m 999
//
-// Case 4: We need abs of both U_hi and V_hi - dont
+// Case 4: We need abs of both U_hi and V_hi - don't
// worry about switched sign of V_hi .
//
(p11) fsub.s1 A = U_hi, V_hi
--- libc/sysdeps/ia64/fpu/e_powl.S.jj 2005-04-13 21:29:37.000000000 +0200
+++ libc/sysdeps/ia64/fpu/e_powl.S 2005-08-18 13:37:52.000000000 +0200
@@ -1593,7 +1593,7 @@ LOGL_RETURN:
;;
// float_N = round_int(N)
-// The signficand of N contains the rounded integer part of X * 2^12/ln2,
+// The significant of N contains the rounded integer part of X * 2^12/ln2,
// as a twos complement number in the lower bits (that is, it may be negative).
// That twos complement number (called N) is put into GR_N_fix.
--- libc/sysdeps/ia64/fpu/w_tgamma.S.jj 2005-04-13 21:29:40.000000000 +0200
+++ libc/sysdeps/ia64/fpu/w_tgamma.S 2005-08-18 13:37:52.000000000 +0200
@@ -170,7 +170,7 @@
// Step 3: Division
// ----------------
// To calculate 1/(x*GAMMA(x)*S21(r)) we use frcpa instruction
-// with following Newton-Raphson interations.
+// with following Newton-Raphson iterations.
//
//
//*********************************************************************
@@ -332,7 +332,7 @@ RODATA
LOCAL_OBJECT_START(tgamma_data)
data8 0x406573FAE561F648 // overflow boundary (171.624376956302739927196)
-data8 0x3FDD8B618D5AF8FE // point of local minium (0.461632144968362356785)
+data8 0x3FDD8B618D5AF8FE // point of local minimum (0.461632144968362356785)
//
//[2; 3]
data8 0xEF0E85C9AE40ABE2,0x00004000 // C01
@@ -1263,7 +1263,7 @@ GLOBAL_LIBM_ENTRY(tgamma)
frcpa.s1 FR_Rcp0,p0 = f1,FR_GAMMA
cmp.ltu p13,p0 = GR_Sign_Exp,GR_ExpOf1
};;
-// NR method: ineration #1
+// NR method: iteration #1
{ .mfi
(p13) getf.exp GR_Sign_Exp = FR_AbsX
fnma.s1 FR_Rcp1 = FR_Rcp0,FR_GAMMA,f1 // t = 1 - r0*x
@@ -1294,7 +1294,7 @@ GLOBAL_LIBM_ENTRY(tgamma)
fma.s1 FR_Rcp1 = FR_Rcp0,FR_Rcp1,FR_Rcp0
nop.i 0
};;
-// NR method: ineration #2
+// NR method: iteration #2
{ .mfi
nop.m 0
fnma.s1 FR_Rcp2 = FR_Rcp1,FR_GAMMA,f1 // t = 1 - r1*x
@@ -1305,7 +1305,7 @@ GLOBAL_LIBM_ENTRY(tgamma)
fma.s1 FR_Rcp2 = FR_Rcp1,FR_Rcp2,FR_Rcp1
nop.i 0
};;
-// NR method: ineration #3
+// NR method: iteration #3
{ .mfi
nop.m 0
fnma.s1 FR_Rcp3 = FR_Rcp2,FR_GAMMA,f1 // t = 1 - r2*x
--- libc/sysdeps/ia64/fpu/e_powf.S.jj 2005-04-13 21:29:37.000000000 +0200
+++ libc/sysdeps/ia64/fpu/e_powf.S 2005-08-18 13:37:53.000000000 +0200
@@ -109,7 +109,7 @@
//
// Log(1/Cm) = log(1/frcpa(1+m/256)) where m goes from 0 to 255.
//
-// We tabluate as one double, T for single precision power
+// We tabulate as one double, T for single precision power
//
// Log(x) = (K Log(2)_hi + T) + (K Log(2)_lo) + Log( 1 + (Bx-1))
// Log(x) = G + delta + Log( 1 + (Bx-1))
@@ -208,7 +208,7 @@
//
// 0 fffe b17217f7d1cf4000 e6af278ece600fcb dabc000000000000
//
-// Put the right 64-bit signficand in an FR register, convert to double;
+// Put the right 64-bit significant in an FR register, convert to double;
// it is exact. Put the next 128 bits into a quad register and round to double.
// The true exponent of the low part is -51.
//
@@ -268,7 +268,7 @@
//
// So what we want to do is shift bits 43 thru 63 into significand_lo.
// This is shifting bit 42 into bit 63, taking care to retain shifted-off bits.
-// Then shifting (just with signficaand_hi) back into bit 42.
+// Then shifting (just with significand_hi) back into bit 42.
//
// The shift_value is 63-42 = 21. In general, this is
// 63 - (51 -(0xffff - 0xfff6))
@@ -354,7 +354,7 @@
// +0 -inf +inf error 27 33 divide-by-zero
// -0 -inf +inf error 27 33 divide-by-zero
-// X zero Y positve
+// X zero Y positive
// +0 +odd integer +0
// -0 +odd integer -0
// +0 !+odd integer +0
@@ -928,7 +928,7 @@ GLOBAL_LIBM_ENTRY(powf)
fclass.m p14,p0 = f8, 0x07
nop.i 999
}
-// Note POW_Xm1 and POW_r1 are used interchangably
+// Note POW_Xm1 and POW_r1 are used interchangeably
{ .mfb
nop.m 999
(p8) fnma.s1 POW_Xm1 = POW_Xp1,f1,f0
--- libc/sysdeps/ia64/fpu/e_acos.S.jj 2005-04-13 21:29:36.000000000 +0200
+++ libc/sysdeps/ia64/fpu/e_acos.S 2005-08-18 13:37:52.000000000 +0200
@@ -51,7 +51,7 @@
//=========================================
// The acos function computes the principal value of the arc cosine of x.
// acos(0) returns Pi/2, acos(1) returns 0, acos(-1) returns Pi.
-// A doman error occurs for arguments not in the range [-1,+1].
+// A domain error occurs for arguments not in the range [-1,+1].
//
// The acos function returns the arc cosine in the range [0, Pi] radians.
//
@@ -89,7 +89,7 @@
//
// S3 approximates sqrt(R) with enough accuracy for this algorithm
//
-// So, the result should be reconstracted as follows:
+// So, the result should be reconstructed as follows:
// acos(x) = Pi/2 - sign(x) * (Pi/2 - S3*PolB(R))
//
// But for optimization purposes the reconstruction step is slightly
@@ -101,7 +101,7 @@
// Return acos(1.0) = 0.0, acos(-1.0) = Pi
//
// 5. 1.0 < |x| <= +INF
-// A doman error occurs for arguments not in the range [-1,+1]
+// A domain error occurs for arguments not in the range [-1,+1]
//
// 6. x = [S,Q]NaN
// Return acos(x) = QNaN
--- libc/sysdeps/ia64/fpu/libm_lgamma.S.jj 2005-04-13 21:29:38.000000000 +0200
+++ libc/sysdeps/ia64/fpu/libm_lgamma.S 2005-08-18 13:50:40.000000000 +0200
@@ -150,7 +150,7 @@
// - ln(sin(Pi*r)/(Pi*r)) - ln(|r|)
// where r = x - rounded_to_nearest(x).
//
-// Neighbourhoods of negative roots
+// Neighborhoods of negative roots
// --------------------------------
// Here we use polynomial approximation
// ln(GAMMA(x-x0)) = ln(GAMMA(x0)) + (x-x0)*P14(x-x0),
@@ -3441,7 +3441,7 @@ lgamma_pseudoroot:
fma.d.s0 f8 = FR_PR01,FR_PRN,f0
br.ret.sptk b0
};;
-// branch for handling +/-0, NaT, QNaN, +/-INF and denormalised numbers
+// branch for handling +/-0, NaT, QNaN, +/-INF and denormalized numbers
//---------------------------------------------------------------------
.align 32
lgamma_spec:
@@ -3521,7 +3521,7 @@ lgamma_singularity:
(p6) sub GR_SignOfGamma = r0,GR_SignOfGamma
br.cond.sptk lgamma_libm_err
};;
-// overflow (x > OVERFLOV_BOUNDARY)
+// overflow (x > OVERFLOW_BOUNDARY)
//---------------------------------------------------------------------
.align 32
lgamma_overflow:
--- libc/sysdeps/ia64/fpu/s_nexttowardf.S.jj 2005-04-13 21:29:40.000000000 +0200
+++ libc/sysdeps/ia64/fpu/s_nexttowardf.S 2005-08-18 13:37:51.000000000 +0200
@@ -161,7 +161,7 @@ GLOBAL_LIBM_ENTRY(nexttowardf)
// Form smallest normal significand and largest denormal significand
{ .mfi
(p12) add GR_new_sig = GR_sig, GR_sden_sig
-(p6) fnorm.s.s0 f8=f9 //Normalise
+(p6) fnorm.s.s0 f8=f9 //Normalize
dep.z GR_snorm_sig = 1,63,1 // 0x8000000000000000
}
{ .mlx
--- libc/sysdeps/ia64/fpu/e_logl.S.jj 2005-04-13 21:29:37.000000000 +0200
+++ libc/sysdeps/ia64/fpu/e_logl.S 2005-08-18 13:37:51.000000000 +0200
@@ -176,7 +176,7 @@
// ----------------------
//
// Z := X
-// N := unbaised exponent of Z
+// N := unbiased exponent of Z
// S_hi := 2^(-N) * Z
//
// Step 1. Argument Reduction
@@ -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.
//
@@ -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.
//
--- libc/sysdeps/ia64/fpu/e_acoshl.S.jj 2005-04-13 21:29:36.000000000 +0200
+++ libc/sysdeps/ia64/fpu/e_acoshl.S 2005-08-18 13:37:52.000000000 +0200
@@ -41,7 +41,7 @@
//
// History:
// 10/01/01 Initial version
-// 10/10/01 Performance inproved
+// 10/10/01 Performance improved
// 12/11/01 Changed huges_logp to not be global
// 01/02/02 Corrected .restore syntax
// 05/20/02 Cleaned up namespace and sf0 syntax
@@ -163,7 +163,7 @@
//
// Now we pass b presented as sum b_hi + b_lo to special version
// of logl function which accept a pair of arguments as
-// mutiprecision value.
+// multiprecision value.
//
// Special log algorithm overview
// ================================
@@ -249,7 +249,7 @@
RODATA
.align 64
-// Near 1 path rational aproximation coefficients
+// Near 1 path rational approximation coefficients
LOCAL_OBJECT_START(Poly_P)
data8 0xB0978143F695D40F, 0x3FF1 // .84205539791447100108478906277453574946e-4
data8 0xB9800D841A8CAD29, 0x3FF6 // .28305085180397409672905983082168721069e-2
@@ -655,7 +655,7 @@ GLOBAL_LIBM_ENTRY(acoshl)
};;
{ .mfi
- getf.d GR_Arg = FR_Arg // get arument as double (int64)
+ getf.d GR_Arg = FR_Arg // get argument as double (int64)
fma.s0 FR_Two = f1, f1, f1 // construct 2.0
addl GR_ad_z_1 = @ltoff(Constants_Z_1#),gp // logl tables
}
--- libc/sysdeps/ia64/fpu/e_pow.S.jj 2005-04-13 21:29:37.000000000 +0200
+++ libc/sysdeps/ia64/fpu/e_pow.S 2005-08-18 13:37:53.000000000 +0200
@@ -60,7 +60,7 @@
// overflow result when x negative, y odd in round up, down, zero.
// 06/14/01 Added brace missing from bundle
// 12/10/01 Corrected case where x negative, 2^52 <= |y| < 2^53, y odd integer.
-// 12/20/01 Fixed monotonity problem in round to nearest.
+// 12/20/01 Fixed monotonicity problem in round to nearest.
// 02/08/02 Fixed overflow/underflow cases that were not calling error support.
// 05/20/02 Cleaned up namespace and sf0 syntax
// 08/29/02 Improved Itanium 2 performance
@@ -109,7 +109,7 @@
//
// Log(1/Cm) = log(1/frcpa(1+m/256)) where m goes from 0 to 255.
//
-// We tabluate as two doubles, T and t, where T +t is the value itself.
+// We tabulate as two doubles, T and t, where T +t is the value itself.
//
// Log(x) = (K Log(2)_hi + T) + (Log(2)_hi + t) + Log( 1 + (Bx-1))
// Log(x) = G + delta + Log( 1 + (Bx-1))
@@ -214,7 +214,7 @@
//
// 0 fffe b17217f7d1cf4000 e6af278ece600fcb dabc000000000000
//
-// Put the right 64-bit signficand in an FR register, convert to double;
+// Put the right 64-bit significant in an FR register, convert to double;
// it is exact. Put the next 128 bits into a quad register and round to double.
// The true exponent of the low part is -51.
//
@@ -274,7 +274,7 @@
//
// So what we want to do is shift bits 43 thru 63 into significand_lo.
// This is shifting bit 42 into bit 63, taking care to retain shifted-off bits.
-// Then shifting (just with signficaand_hi) back into bit 42.
+// Then shifting (just with significand_hi) back into bit 42.
//
// The shift_value is 63-42 = 21. In general, this is
// 63 - (51 -(0xffff - 0xfff6))
@@ -358,7 +358,7 @@
// +0 -inf +inf error 27 33 divide-by-zero
// -0 -inf +inf error 27 33 divide-by-zero
-// X zero Y positve
+// X zero Y positive
// +0 +odd integer +0
// -0 +odd integer -0
// +0 !+odd integer +0
@@ -992,7 +992,7 @@ POW_COMMON:
}
;;
-// Note POW_Xm1 and POW_r1 are used interchangably
+// Note POW_Xm1 and POW_r1 are used interchangeably
{ .mfi
alloc r32=ar.pfs,2,19,4,0
fms.s1 POW_r = POW_B, POW_NORM_X,f1
--- libc/sysdeps/ia64/fpu/e_logf.S.jj 2005-04-13 21:29:37.000000000 +0200
+++ libc/sysdeps/ia64/fpu/e_logf.S 2005-08-18 13:37:52.000000000 +0200
@@ -119,7 +119,7 @@
// L2 = 1.0/log(10)
//
// So common code with two different entry points those set pointers
-// to the base address of coresponding data sets containing values
+// to the base address of corresponding data sets containing values
// of L2,T and prepare integer representation of L1 needed for following
// setf instruction can be used.
//
@@ -130,7 +130,7 @@
// InvX = frcpa(x)
// r = InvX*x - 1
// P(r) = r*((1 - A2*r) + r^2*(A3 - A4*r)) = r*P2(r),
-// A4,A3,A2 are created with setf inctruction.
+// A4,A3,A2 are created with setf instruction.
// We use Taylor series and so A4 = 1/4, A3 = 1/3,
// A2 = 1/2 rounded to double.
//
@@ -159,7 +159,7 @@
//
// 3. How we define is input argument such that |x-1| < 1/256 or not.
//
-// To do it we analyze biased exponent and significand of input argment.
+// To do it we analyze biased exponent and significand of input argument.
//
// a) First we test is biased exponent equal to 0xFFFE or 0xFFFF (i.e.
// we test is 0.5 <= x < 2). This comparison can be performed using
@@ -171,12 +171,12 @@
// with 1-1/256 and 1+1/256 or in register format representation with
// 0xFFFEFF00000000000000 and 0xFFFF8080000000000000 correspondingly.
// As far as biased exponent of x here can be equal only to 0xFFFE or
-// 0xFFFF we need to test only last bit of it. Also signifigand always
-// has implicit bit set to 1 that can be exluded from comparison.
+// 0xFFFF we need to test only last bit of it. Also significant always
+// has implicit bit set to 1 that can be excluded from comparison.
// Thus it's quite enough to generate 64-bit integer bits of that are
// ix[63] = biased_exponent_of_x[0] and ix[62-0] = significand_of_x[62-0]
// and compare it with 0x7F00000000000000 and 0x80800000000000000 (those
-// obtained like ix from register representatinos of 255/256 and
+// obtained like ix from register representations of 255/256 and
// 257/256). This comparison can be made like in a), using unsigned
// version of cmp i.e. ix - 0x7F00000000000000 < 0x0180000000000000.
// 0x0180000000000000 is difference between 0x80800000000000000 and
@@ -838,7 +838,7 @@ GLOBAL_IEEE754_ENTRY(log10f)
{ .mib
setf.exp FR_A2 = GR_05 // create A2
sub GR_de = GR_Exp,GR_05 // biased_exponent_of_x - 0xFFFE
- // needed to comparion with 0.5 and 2.0
+ // needed to compare with 0.5 and 2.0
br.cond.sptk logf_log10f_common
};;
GLOBAL_IEEE754_END(log10f)
@@ -873,7 +873,7 @@ GLOBAL_IEEE754_ENTRY(logf)
setf.d FR_A3 = GR_A3 // create A3
fcmp.eq.s1 p13,p14 = f0,f0 // p13 - true for logf
sub GR_de = GR_Exp,GR_05 // biased_exponent_of_x - 0xFFFE
- // needed to comparion with 0.5 and 2.0
+ // needed to compare with 0.5 and 2.0
}
{ .mlx
setf.exp FR_A2 = GR_05 // create A2
@@ -883,7 +883,7 @@ GLOBAL_IEEE754_ENTRY(logf)
logf_log10f_common:
{ .mfi
setf.exp FR_A4 = GR_025 // create A4=0.25
- fclass.m p9,p0 = f8,0x3A // is x < 0 (including negateve unnormals)?
+ fclass.m p9,p0 = f8,0x3A // is x < 0 (including negative unnormals)?
dep GR_x = GR_Exp,GR_Sig,63,1 // produce integer that bits are
// GR_x[63] = GR_Exp[0]
// GR_x[62-0] = GR_Sig[62-0]
--- libc/sysdeps/ia64/fpu/s_tanhl.S.jj 2005-04-13 21:29:40.000000000 +0200
+++ libc/sysdeps/ia64/fpu/s_tanhl.S 2005-08-18 13:37:52.000000000 +0200
@@ -95,15 +95,15 @@
// Implementation notes
// --------------------
//
-// 1. Special path: x = 0, INF, NaNa, denormals
+// 1. Special path: x = 0, INF, NaNs, denormals
//
// This branch is cut off by one fclass operation.
// Then zeros+nans, infinities and denormals processed separately.
-// For denormals we use simple fma operaton x+x*x (- for +denorms)
+// For denormals we use simple fma operation x+x*x (- for +denorms)
//
// 2. [0;1/8] path: 0.0 < |x| < 1/8
//
-// Here we use simple polynimial computations, where last step
+// Here we use simple polynomial computations, where last step
// is performed as x + x^3*A3+...
// The rest of polynomial is factorized using binary tree technique.
//
@@ -111,7 +111,7 @@
//
// Multiprecision have to be performed only for first few
// polynomial iterations (up to 3-rd x degree)
-// Here we use the same parallelisation way as above:
+// Here we use the same parallelization way as above:
// Split whole polynomial to first, "multiprecision" part, and second,
// so called "tail", native precision part.
//
@@ -121,7 +121,7 @@
//
// 2) Tail part:
// v3 = x^4 * ( A4 + x*A5 + ... + x^21*A25 )
-// v3 is splitted to 2 even parts (10 coefficient in each one).
+// v3 is split to 2 even parts (10 coefficient in each one).
// These 2 parts are also factorized using binary tree technique.
//
// So Multiprecision and Tail parts cost is almost the same
@@ -1196,7 +1196,7 @@ GLOBAL_LIBM_ENTRY(tanhl)
br.ret.sptk b0 // Main path return
};;
-// satiration path ////////////////////////////////////////////////////////////
+// saturation path ////////////////////////////////////////////////////////////
_saturation:
.pred.rel "mutex",p14,p15
--- libc/sysdeps/ia64/fpu/libm_lgammaf.S.jj 2005-04-13 21:29:38.000000000 +0200
+++ libc/sysdeps/ia64/fpu/libm_lgammaf.S 2005-08-18 13:51:59.000000000 +0200
@@ -154,7 +154,7 @@
// - ln(sin(Pi*r)/(Pi*r)) - ln(|r|)
// where r = x - rounded_to_nearest(x).
//
-// Neighbourhoods of negative roots
+// Neighborhoods of negative roots
// --------------------------------
// Here we use polynomial approximation
// ln(GAMMA(x-x0)) = ln(GAMMA(x0)) + (x-x0)*P14(x-x0),
@@ -162,7 +162,7 @@
// precision number.
//
//
-// Claculation of logarithm
+// Calculation of logarithm
// ------------------------
// Consider x = 2^N * xf so
// ln(x) = ln(frcpa(x)*x/frcpa(x))
@@ -1064,7 +1064,7 @@ lgammaf_0_1:
{ .mfi
ldfpd FR_Ln2,FR_05 = [GR_ad_Data],16
fma.s1 FR_P32 = FR_P3,FR_r,FR_P2
- // input argument cann't be equal to 1.0
+ // input argument can't be equal to 1.0
cmp.eq p0,p14 = r0,r0
};;
{ .mfi
@@ -1456,7 +1456,7 @@ lgammaf_negrecursion:
// load coefficients of polynomial approximation
// of ln(GAMMA(x)), x is close to one of negative roots
(p13) ldfpd FR_R3,FR_R2 = [GR_ad_RootCo]
- // argumenth for logarithm
+ // argument for logarithm
(p10) fma.s1 FR_Req = FR_Req,FR_Xp2,f0
mov GR_ExpMask = 0x1ffff
}
@@ -2022,7 +2022,7 @@ lgammaf_negpoly:
fms.s.s0 f8 = FR_Ln,f1,FR_Lnf
br.ret.sptk b0
};;
-// branch for handling +/-0, NaT, QNaN, +/-INF and denormalised numbers
+// branch for handling +/-0, NaT, QNaN, +/-INF and denormalized numbers
//---------------------------------------------------------------------
.align 32
lgammaf_spec:
@@ -2097,7 +2097,7 @@ lgammaf_singularity:
(p6) sub GR_SignOfGamma = r0,GR_SignOfGamma
br.cond.sptk lgammaf_libm_err
};;
-// overflow (x > OVERFLOV_BOUNDARY)
+// overflow (x > OVERFLOW_BOUNDARY)
//---------------------------------------------------------------------
.align 32
lgammaf_overflow:
--- libc/sysdeps/ia64/fpu/s_cos.S.jj 2005-04-13 21:29:39.000000000 +0200
+++ libc/sysdeps/ia64/fpu/s_cos.S 2005-08-18 13:37:52.000000000 +0200
@@ -476,7 +476,7 @@ _SINCOS_COMMON:
{ .mfi
alloc r32 = ar.pfs, 1, 4, 0, 0
fclass.m p11,p0 = f8, 0x0b // Test for x=unorm
- mov sincos_GR_all_ones = -1 // For "inexect" constant create
+ mov sincos_GR_all_ones = -1 // For "inexact" constant create
}
{ .mib
setf.exp sincos_2TOM61 = sincos_GR_exp_2tom61
--- libc/sysdeps/ia64/fpu/s_erff.S.jj 2005-04-13 21:29:39.000000000 +0200
+++ libc/sysdeps/ia64/fpu/s_erff.S 2005-08-18 13:37:51.000000000 +0200
@@ -67,7 +67,7 @@
// PolC(|x|) = B0*x^4 + C3*|x|^3 + C2*|x|^2 + C1*|x| + C0,
// PolA(|x|) = A3|x|^3 + A2*x^2 + A1*|x| + A0
//
-// Actually range 0.125<=|x|< 4.0 is splitted to 5 subranges.
+// Actually range 0.125<=|x|< 4.0 is split to 5 subranges.
// For each subrange there is particular set of coefficients.
// Below is the list of subranges:
// 3.1 0.125 <= |x| < 0.25
--- libc/sysdeps/ia64/fpu/s_modff.S.jj 2005-01-08 16:50:26.000000000 +0100
+++ libc/sysdeps/ia64/fpu/s_modff.S 2005-08-18 13:51:39.000000000 +0200
@@ -157,7 +157,7 @@ GLOBAL_LIBM_ENTRY(modff)
nop.i 999 ;;
}
-// p11 <== SMALL, no integer part, fraction is everyting
+// p11 <== SMALL, no integer part, fraction is everything
// p9 <== HUGE, no fraction part, integer is everything
// p12 <== NORMAL, fraction part and integer part
{ .mii
--- libc/sysdeps/ia64/fpu/e_asinl.S.jj 2005-04-13 21:29:36.000000000 +0200
+++ libc/sysdeps/ia64/fpu/e_asinl.S 2005-08-18 13:37:53.000000000 +0200
@@ -58,7 +58,7 @@
// asin(s)= asin(t)+asin(r), where r= s*sqrt(1-t^2)-t*sqrt(1-s^2), i.e.
// r= (s-t)*sqrt(1-t^2)-t*sqrt(1-t^2)*(sqrt((1-s^2)/(1-t^2))-1)
// asin(r)-r evaluated as 9-degree polynomial (c3*r^3+c5*r^5+c7*r^7+c9*r^9)
-// The 64-bit significands of sqrt(1-t^2), 1/(1-t^2) are read from the table,
+// The 64-bit significants of sqrt(1-t^2), 1/(1-t^2) are read from the table,
// along with the high and low parts of asin(t) (stored as two double precision
// values)
//
--- libc/sysdeps/ia64/fpu/libm_sincosl.S.jj 2005-04-13 21:29:38.000000000 +0200
+++ libc/sysdeps/ia64/fpu/libm_sincosl.S 2005-08-18 13:37:52.000000000 +0200
@@ -205,7 +205,7 @@
// = (-1)^i_0 * [cosl(r) - c*r] if i_1 = 1
//
// because |r| is small and thus the second terms in the correction
-// are unneccessary.
+// are unnecessary.
//
// Finally, sinl(r) and cosl(r) are approximated by polynomials of
// moderate lengths.
@@ -1112,7 +1112,7 @@ SINCOSL_COMMON2:
};;
//
-// For big s: r = s - w: No futher reduction is necessary
+// For big s: r = s - w: No further reduction is necessary
// For small s: w = N * P_3 (change sign) More reduction
//
{ .mfi
--- libc/sysdeps/ia64/fpu/e_expf.S.jj 2005-04-13 21:29:37.000000000 +0200
+++ libc/sysdeps/ia64/fpu/e_expf.S 2005-08-18 13:37:51.000000000 +0200
@@ -46,7 +46,7 @@
// 08/21/00 Improvements to save 2 cycles on main path, and shorten x=0 case
// 12/07/00 Widen main path, shorten x=inf, nan paths
// 03/15/01 Fix monotonicity problem around x=0 for round to +inf
-// 02/05/02 Corrected uninitialize predicate in POSSIBLE_UNDERFLOW path
+// 02/05/02 Corrected uninitialized predicate in POSSIBLE_UNDERFLOW path
// 05/20/02 Cleaned up namespace and sf0 syntax
// 07/26/02 Algorithm changed, accuracy improved
// 09/26/02 support of higher precision inputs added, underflow threshold
--- libc/sysdeps/ia64/fpu/s_nexttoward.S.jj 2005-04-13 21:29:40.000000000 +0200
+++ libc/sysdeps/ia64/fpu/s_nexttoward.S 2005-08-18 13:37:52.000000000 +0200
@@ -155,7 +155,7 @@ GLOBAL_LIBM_ENTRY(nexttoward)
// Form smallest normal significand and largest denormal significand
{ .mfi
(p12) add GR_new_sig = GR_sig, GR_sden_sig
-(p6) fnorm.d.s0 f8=f9 //Normalise
+(p6) fnorm.d.s0 f8=f9 //Normalize
dep.z GR_snorm_sig = 1,63,1 // 0x8000000000000000
}
{ .mlx
--- libc/sysdeps/ia64/fpu/e_atanh.S.jj 2005-04-13 21:29:37.000000000 +0200
+++ libc/sysdeps/ia64/fpu/e_atanh.S 2005-08-18 13:37:52.000000000 +0200
@@ -43,7 +43,7 @@
// 05/03/01 Initial version
// 05/20/02 Cleaned up namespace and sf0 syntax
// 02/06/03 Reordered header: .section, .global, .proc, .align
-// 05/26/03 Improved performance, fixed to handle unorms
+// 05/26/03 Improved performance, fixed to handle unnorms
// 03/31/05 Reformatted delimiters between data tables
//
// API
--- libc/sysdeps/ia64/fpu/e_exp.S.jj 2005-04-13 21:29:37.000000000 +0200
+++ libc/sysdeps/ia64/fpu/e_exp.S 2005-08-18 13:37:52.000000000 +0200
@@ -48,7 +48,7 @@
// 11/30/00 Reworked to shorten main path, widen main path to include all
// args in normal range, and add quick exit for 0, nan, inf.
// 12/05/00 Loaded constants earlier with setf to save 2 cycles.
-// 02/05/02 Corrected uninitialize predicate in POSSIBLE_UNDERFLOW path
+// 02/05/02 Corrected uninitialized predicate in POSSIBLE_UNDERFLOW path
// 05/20/02 Cleaned up namespace and sf0 syntax
// 09/07/02 Force inexact flag
// 11/15/02 Split underflow path into zero/nonzero; eliminated fma in main path
@@ -398,7 +398,7 @@ GLOBAL_IEEE754_ENTRY(exp)
;;
// Nfloat = round_int(W)
-// The signficand of fW_2TO56_RSH contains the rounded integer part of W,
+// The significant of fW_2TO56_RSH contains the rounded integer part of W,
// as a twos complement number in the lower bits (that is, it may be negative).
// That twos complement number (called N) is put into rN.
--- libc/sysdeps/ia64/fpu/s_cbrtf.S.jj 2005-04-13 21:29:39.000000000 +0200
+++ libc/sysdeps/ia64/fpu/s_cbrtf.S 2005-08-18 13:37:53.000000000 +0200
@@ -59,9 +59,9 @@
//
// cbrt(a)= cbrt(a*y)/cbrt(y) = cbrt(1 - (1-a*y)) * (1/cbrt(y))
//
-// For all values of y, the 3 possible significands of 1/cbrt(y)
+// For all values of y, the 3 possible significants of 1/cbrt(y)
// are stored in a table (T0) to 64 bits of accuracy. (There are
-// 3 possible significands because the exponent of y modulo 3
+// 3 possible significants because the exponent of y modulo 3
// can be 0, 1, or 2.)
//
//
@@ -150,7 +150,7 @@ LOCAL_OBJECT_START(poly_coeffs)
LOCAL_OBJECT_END(poly_coeffs)
// For every entry B in the frcpa table, this table contains
-// the significands of cbrt(1/B), cbrt(2/B), cbrt(4/B).
+// the significants of cbrt(1/B), cbrt(2/B), cbrt(4/B).
// The index to this table is the same as the frcpa index.
LOCAL_OBJECT_START(T_table)
--- libc/sysdeps/ia64/fpu/s_erfc.S.jj 2005-04-13 21:29:39.000000000 +0200
+++ libc/sysdeps/ia64/fpu/s_erfc.S 2005-08-18 13:37:52.000000000 +0200
@@ -65,7 +65,7 @@
//
// Let P14(z) - polynomial approximation of degree 14 for function
// erfc(z+x(i)) * exp( (z+x(i))^2) and 0 <= z <= x(i+1)-x(i).
-// Polynomial coeffitients we have in the table erfc_p_table.
+// Polynomial coefficients we have in the table erfc_p_table.
//
// So we can find result for erfc(x) as above.
// Algorithm description for exp function see below.
@@ -863,7 +863,7 @@ GLOBAL_LIBM_ENTRY(erfc)
(p15) br.cond.spnt __libm_error_region
};;
-//p8: x < 27.0, result without ungerflow error
+//p8: x < 27.0, result without underflow error
{ .mfi
getf.exp GR_IndxPlusBias = FR_Tmp // exp + bias for (|x|+1)^4
fcmp.lt.s1 p8,p0 = FR_NormX,FR_UnfBound
--- libc/sysdeps/ia64/fpu/s_asinhl.S.jj 2005-04-13 21:29:38.000000000 +0200
+++ libc/sysdeps/ia64/fpu/s_asinhl.S 2005-08-18 13:37:52.000000000 +0200
@@ -122,7 +122,7 @@
//
// Now we pass b presented as sum b_hi + b_lo to special version
// of logl function which accept a pair of arguments as
-// 'mutiprecision' value.
+// 'multiprecision' value.
//
// Special log algorithm overview
// ================================
@@ -554,7 +554,7 @@ GLOBAL_LIBM_ENTRY(asinhl)
};;
{ .mfi
- getf.exp GR_ArgExp = FR_Arg // get arument's exponent
+ getf.exp GR_ArgExp = FR_Arg // get argument's exponent
fabs FR_AX = FR_Arg // absolute value of argument
mov GR_TwoN7 = 0xfff8 // 2^-7 exp
}
--- libc/sysdeps/ia64/fpu/s_cosl.S.jj 2005-04-13 21:29:39.000000000 +0200
+++ libc/sysdeps/ia64/fpu/s_cosl.S 2005-08-18 13:37:51.000000000 +0200
@@ -212,7 +212,7 @@
// = (-1)^i_0 * [cosl(r) - c*r] if i_1 = 1
//
// because |r| is small and thus the second terms in the correction
-// are unneccessary.
+// are unnecessary.
//
// Finally, sinl(r) and cosl(r) are approximated by polynomials of
// moderate lengths.
@@ -1083,7 +1083,7 @@ SINCOSL_COMMON:
;;
//
-// For big s: r = s - w: No futher reduction is necessary
+// For big s: r = s - w: No further reduction is necessary
// For small s: w = N * P_3 (change sign) More reduction
//
{ .mfi
--- libc/sysdeps/ia64/memmove.S.jj 2003-11-20 00:40:50.000000000 +0100
+++ libc/sysdeps/ia64/memmove.S 2005-08-18 13:37:53.000000000 +0200
@@ -27,7 +27,7 @@
The core of the function is the memcpy implementation used in memcpy.S.
When bytes have to be copied backwards, only the easy case, when
- all arguments are multiples of 8, is optimised.
+ all arguments are multiples of 8, is optimized.
In this form, it assumes little endian mode. For big endian mode,
sh1 must be computed using an extra instruction: sub sh1 = 64, sh1
@@ -203,7 +203,7 @@ ENTRY(memmove)
mov ar.lc = saved_lc // restore the loop counter
br.ret.sptk.many b0
-// In the case of a backward copy, optimise only the case when everything
+// In the case of a backward copy, optimize only the case when everything
// is a multiple of 8, otherwise copy byte by byte. The backward copy is
// used only when the blocks are overlapping and dest > src.
--- libc/sysdeps/ia64/memchr.S.jj 2003-04-30 00:47:19.000000000 +0200
+++ libc/sysdeps/ia64/memchr.S 2005-08-18 13:37:51.000000000 +0200
@@ -18,7 +18,7 @@
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
02111-1307 USA. */
-/* Return: the address of the first occurence of chr in str or NULL
+/* Return: the address of the first occurrence of chr in str or NULL
Inputs:
in0: str
--- libc/sysdeps/ia64/memcpy.S.jj 2003-11-20 00:40:50.000000000 +0100
+++ libc/sysdeps/ia64/memcpy.S 2005-08-18 13:37:53.000000000 +0200
@@ -27,7 +27,7 @@
in2: byte count
An assembly implementation of the algorithm used by the generic C
- version from glibc. The case when source and sest are aligned is
+ version from glibc. The case when source and dest are aligned is
treated separately, for extra performance.
In this form, memcpy assumes little endian mode. For big endian mode,
--- libc/sysdeps/ia64/strchr.S.jj 2005-06-06 11:41:08.000000000 +0200
+++ libc/sysdeps/ia64/strchr.S 2005-08-18 13:37:51.000000000 +0200
@@ -18,7 +18,7 @@
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
02111-1307 USA. */
-/* Return: the address of the first occurence of chr in str or NULL
+/* Return: the address of the first occurrence of chr in str or NULL
Inputs:
in0: str
--- libc/sysdeps/ia64/dl-machine.h.jj 2005-02-08 17:17:24.000000000 +0100
+++ libc/sysdeps/ia64/dl-machine.h 2005-08-18 13:37:47.000000000 +0200
@@ -216,7 +216,7 @@ elf_machine_runtime_setup (struct link_m
" Note that _dl_skip_args is an integer, not a long - Jes\n" \
"\n" \
" The stack pointer has to be 16 byte aligned. We cannot simply\n" \
-" addjust the stack pointer. We have to move the whole argv and\n" \
+" adjust the stack pointer. We have to move the whole argv and\n" \
" envp and adjust _dl_argv by _dl_skip_args. H.J. */\n" \
" }\n" \
" { .mib\n" \
@@ -252,7 +252,7 @@ elf_machine_runtime_setup (struct link_m
" }\n" \
" { .mmi\n" \
" mov out3 = r11\n" \
-" sub r17 = r17, r3 /* Substract _dl_skip_args. */\n" \
+" sub r17 = r17, r3 /* Subtract _dl_skip_args. */\n" \
" addl out0 = @gprel(_rtld_local), gp\n" \
" }\n" \
"1: /* Copy env. */\n" \
--- libc/sysdeps/ia64/dl-trampoline.S.jj 2005-07-11 09:51:18.000000000 +0200
+++ libc/sysdeps/ia64/dl-trampoline.S 2005-08-18 13:37:53.000000000 +0200
@@ -371,7 +371,7 @@ ENTRY(_dl_runtime_profile)
{ .mmi
and r15 = -16, r15
;;
- /* We don't copy the 16byte scatch area. Prepare r16/r17 as
+ /* We don't copy the 16byte scratch area. Prepare r16/r17 as
destination. */
sub r16 = r12, r15
sub r17 = r12, r15
@@ -391,7 +391,7 @@ ENTRY(_dl_runtime_profile)
;;
}
{ .mii
- /* Skip the 16byte scatch area. Prepare r2/r3 as source. */
+ /* Skip the 16byte scratch area. Prepare r2/r3 as source. */
adds r2 = 16, loc10
adds r3 = 24, loc10
mov ar.lc = r15
--- libc/sysdeps/generic/segfault.c.jj 2004-10-15 23:08:35.000000000 +0200
+++ libc/sysdeps/generic/segfault.c 2005-08-18 13:52:53.000000000 +0200
@@ -42,7 +42,7 @@
/* Get code to possibly dump the content of all registers. */
#include <register-dump.h>
-/* We'll use tis a lot. */
+/* We'll use this a lot. */
#define WRITE_STRING(s) write (fd, s, strlen (s))
/* Name of the output file. */
--- libc/sysdeps/generic/sockatmark.c.jj 2001-07-06 06:55:50.000000000 +0200
+++ libc/sysdeps/generic/sockatmark.c 2005-08-18 13:37:47.000000000 +0200
@@ -19,7 +19,7 @@
#include <errno.h>
#include <sys/socket.h>
-/* Determine wheter socket is at a out-of-band mark. */
+/* Determine whether socket is at a out-of-band mark. */
int
sockatmark (fd)
int fd;
--- libc/sysdeps/generic/ldiv.c.jj 2001-07-06 06:55:49.000000000 +0200
+++ libc/sysdeps/generic/ldiv.c 2005-08-18 13:37:47.000000000 +0200
@@ -31,7 +31,7 @@ ldiv (long int numer, long int denom)
/* The ANSI standard says that |QUOT| <= |NUMER / DENOM|, where
NUMER / DENOM is to be computed in infinite precision. In
other words, we should always truncate the quotient towards
- zero, never -infinity. Machine division and remainer may
+ zero, never -infinity. Machine division and remainder may
work either way when one or both of NUMER or DENOM is
negative. If only one is negative and QUOT has been
truncated towards -infinity, REM will have the same sign as
--- libc/sysdeps/generic/inttypes.h.jj 2004-09-14 00:32:56.000000000 +0200
+++ libc/sysdeps/generic/inttypes.h 2005-08-18 13:37:48.000000000 +0200
@@ -261,7 +261,7 @@ typedef wchar_t __gwchar_t;
# define SCNuMAX __PRI64_PREFIX "u"
# define SCNxMAX __PRI64_PREFIX "x"
-/* Macros for scaning `intptr_t' and `uintptr_t'. */
+/* Macros for scanning `intptr_t' and `uintptr_t'. */
# define SCNdPTR __PRIPTR_PREFIX "d"
# define SCNiPTR __PRIPTR_PREFIX "i"
# define SCNoPTR __PRIPTR_PREFIX "o"
--- libc/sysdeps/generic/unwind-dw2-fde-glibc.c.jj 2004-05-26 16:05:21.000000000 +0200
+++ libc/sysdeps/generic/unwind-dw2-fde-glibc.c 2005-08-18 13:37:48.000000000 +0200
@@ -134,7 +134,7 @@ _Unwind_IteratePhdrCallback (struct dl_p
data->dbase = NULL;
if (p_dynamic)
{
- /* For dynamicly linked executables and shared libraries,
+ /* For dynamically linked executables and shared libraries,
DT_PLTGOT is the gp value for that object. */
ElfW(Dyn) *dyn = (ElfW(Dyn) *)(p_dynamic->p_vaddr + load_base);
for (; dyn->d_tag != DT_NULL ; dyn++)
--- libc/sysdeps/generic/netinet/ip.h.jj 2002-02-07 04:49:18.000000000 +0100
+++ libc/sysdeps/generic/netinet/ip.h 2005-08-18 13:52:34.000000000 +0200
@@ -120,7 +120,7 @@ struct ip
u_short ip_id; /* identification */
u_short ip_off; /* fragment offset field */
#define IP_RF 0x8000 /* reserved fragment flag */
-#define IP_DF 0x4000 /* dont fragment flag */
+#define IP_DF 0x4000 /* don't fragment flag */
#define IP_MF 0x2000 /* more fragments flag */
#define IP_OFFMASK 0x1fff /* mask for fragmenting bits */
u_int8_t ip_ttl; /* time to live */
--- libc/sysdeps/generic/netinet/tcp.h.jj 1999-06-08 23:06:31.000000000 +0200
+++ libc/sysdeps/generic/netinet/tcp.h 2005-08-18 13:37:47.000000000 +0200
@@ -46,7 +46,7 @@ struct tcphdr {
u_short th_sport; /* source port */
u_short th_dport; /* destination port */
tcp_seq th_seq; /* sequence number */
- tcp_seq th_ack; /* acknowledgement number */
+ tcp_seq th_ack; /* acknowledgment number */
#if __BYTE_ORDER == __LITTLE_ENDIAN
u_char th_x2:4, /* (unused) */
th_off:4; /* data offset */
--- libc/sysdeps/generic/libc-start.c.jj 2005-07-11 09:51:17.000000000 +0200
+++ libc/sysdeps/generic/libc-start.c 2005-08-18 13:37:47.000000000 +0200
@@ -132,7 +132,7 @@ LIBC_START_MAIN (int (*main) (int, char
# ifdef DL_SYSDEP_OSCHECK
if (!__libc_multiple_libcs)
{
- /* This needs to run to initiliaze _dl_osversion before TLS
+ /* This needs to run to initialize _dl_osversion before TLS
setup might check it. */
DL_SYSDEP_OSCHECK (__libc_fatal);
}
--- libc/sysdeps/generic/lldiv.c.jj 2001-07-06 06:55:49.000000000 +0200
+++ libc/sysdeps/generic/lldiv.c 2005-08-18 13:37:48.000000000 +0200
@@ -1,4 +1,4 @@
-/* `long long int' divison with remainder.
+/* `long long int' division with remainder.
Copyright (C) 1992, 1996, 1997 Free Software Foundation, Inc.
This file is part of the GNU C Library.
@@ -34,7 +34,7 @@ lldiv (numer, denom)
/* The ANSI standard says that |QUOT| <= |NUMER / DENOM|, where
NUMER / DENOM is to be computed in infinite precision. In
other words, we should always truncate the quotient towards
- zero, never -infinity. Machine division and remainer may
+ zero, never -infinity. Machine division and remainder may
work either way when one or both of NUMER or DENOM is
negative. If only one is negative and QUOT has been
truncated towards -infinity, REM will have the same sign as
--- libc/sysdeps/generic/div.c.jj 2001-07-06 06:55:48.000000000 +0200
+++ libc/sysdeps/generic/div.c 2005-08-18 13:37:48.000000000 +0200
@@ -63,7 +63,7 @@ div (numer, denom)
/* The ANSI standard says that |QUOT| <= |NUMER / DENOM|, where
NUMER / DENOM is to be computed in infinite precision. In
other words, we should always truncate the quotient towards
- zero, never -infinity. Machine division and remainer may
+ zero, never -infinity. Machine division and remainder may
work either way when one or both of NUMER or DENOM is
negative. If only one is negative and QUOT has been
truncated towards -infinity, REM will have the same sign as
--- libc/sysdeps/generic/timer_gettime.c.jj 2001-07-06 06:55:50.000000000 +0200
+++ libc/sysdeps/generic/timer_gettime.c 2005-08-18 13:53:15.000000000 +0200
@@ -19,7 +19,7 @@
#include <errno.h>
#include <time.h>
-/* Get current value of timer TIMERID and store it in VLAUE. */
+/* Get current value of timer TIMERID and store it in VALUE. */
int
timer_gettime (timer_t timerid, struct itimerspec *value)
{
--- libc/sysdeps/generic/elf/backtracesymsfd.c.jj 2005-06-22 18:34:19.000000000 +0200
+++ libc/sysdeps/generic/elf/backtracesymsfd.c 2005-08-18 13:37:47.000000000 +0200
@@ -28,7 +28,7 @@
#if __ELF_NATIVE_CLASS == 32
# define WORD_WIDTH 8
#else
-/* We assyme 64bits. */
+/* We assume 64bits. */
# define WORD_WIDTH 16
#endif
--- libc/sysdeps/generic/elf/backtracesyms.c.jj 2003-03-10 10:12:11.000000000 +0100
+++ libc/sysdeps/generic/elf/backtracesyms.c 2005-08-18 13:37:47.000000000 +0200
@@ -29,7 +29,7 @@
#if __ELF_NATIVE_CLASS == 32
# define WORD_WIDTH 8
#else
-/* We assyme 64bits. */
+/* We assume 64bits. */
# define WORD_WIDTH 16
#endif
--- libc/sysdeps/generic/funlockfile.c.jj 2002-12-16 23:12:41.000000000 +0100
+++ libc/sysdeps/generic/funlockfile.c 2005-08-18 13:37:48.000000000 +0200
@@ -1,4 +1,4 @@
-/* Unlock I/O stream. Singlethreaded version.
+/* Unlock I/O stream. Single-threaded version.
Copyright (C) 1996, 1997, 2000, 2002 Free Software Foundation, Inc.
This file is part of the GNU C Library.
--- libc/sysdeps/generic/bits/sigstack.h.jj 2001-07-06 06:55:50.000000000 +0200
+++ libc/sysdeps/generic/bits/sigstack.h 2005-08-18 13:37:48.000000000 +0200
@@ -48,7 +48,7 @@ enum
#define SS_DISABLE SS_DISABLE
};
-/* Minumum stack size for a signal handler. */
+/* Minimum stack size for a signal handler. */
#define MINSIGSTKSZ 8192
/* System default stack size. */
--- libc/sysdeps/generic/strstr.c.jj 2003-04-30 00:47:20.000000000 +0200
+++ libc/sysdeps/generic/strstr.c 2005-08-18 13:37:47.000000000 +0200
@@ -108,7 +108,7 @@ strstr (phaystack, pneedle)
goto foundneedle;
}
while (*++rhaystack == (a = *++needle));
- needle = rneedle; /* took the register-poor aproach */
+ needle = rneedle; /* took the register-poor approach */
}
if (!a)
break;
--- libc/sysdeps/generic/pty-private.h.jj 2001-07-06 06:55:49.000000000 +0200
+++ libc/sysdeps/generic/pty-private.h 2005-08-18 13:37:48.000000000 +0200
@@ -1,4 +1,4 @@
-/* Internal defenitions and declarations for pseudo terminal functions.
+/* Internal definitions and declarations for pseudo terminal functions.
Copyright (C) 1998, 1999 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by Zack Weinberg <zack@rabi.phys.columbia.edu>, 1998.
--- libc/sysdeps/generic/dl-sysdep.c.jj 2005-05-20 10:35:59.000000000 +0200
+++ libc/sysdeps/generic/dl-sysdep.c 2005-08-18 13:37:47.000000000 +0200
@@ -501,7 +501,7 @@ _dl_important_hwcaps (const char *platfo
}
/* Fill in the information. This follows the following scheme
- (indeces from TEMP for four strings):
+ (indices from TEMP for four strings):
entry #0: 0, 1, 2, 3 binary: 1111
#1: 0, 1, 3 1101
#2: 0, 2, 3 1011
--- libc/sysdeps/generic/sysdep.h.jj 2003-09-02 09:08:57.000000000 +0200
+++ libc/sysdeps/generic/sysdep.h 2005-08-18 13:53:36.000000000 +0200
@@ -47,7 +47,7 @@
#define JUMPTARGET(sym) sym
#endif
-/* Makros to generate eh_frame unwind information. */
+/* Macros to generate eh_frame unwind information. */
# ifdef HAVE_ASM_CFI_DIRECTIVES
# define cfi_startproc .cfi_startproc
# define cfi_endproc .cfi_endproc
--- libc/sysdeps/generic/ldsodefs.h.jj 2005-06-22 18:34:19.000000000 +0200
+++ libc/sysdeps/generic/ldsodefs.h 2005-08-18 13:37:48.000000000 +0200
@@ -418,7 +418,7 @@ struct rtld_global
} _dl_ns[DL_NNS];
/* During the program run we must not modify the global data of
- loaded shared object simultanously in two threads. Therefore we
+ loaded shared object simultaneously in two threads. Therefore we
protect `_dl_open' and `_dl_close' in dl-close.c.
This must be a recursive lock since the initializer function of
--- libc/sysdeps/generic/e_exp10f.c.jj 2001-07-06 06:55:49.000000000 +0200
+++ libc/sysdeps/generic/e_exp10f.c 2005-08-18 13:37:47.000000000 +0200
@@ -24,7 +24,7 @@
float
__ieee754_exp10f (float arg)
{
- /* This is a very stupid and inprecise implementation. It'll get
+ /* This is a very stupid and imprecise implementation. It'll get
replaced sometime (soon?). */
return __ieee754_expf (M_LN10 * arg);
}
--- libc/sysdeps/generic/e_exp10.c.jj 2001-07-06 06:55:49.000000000 +0200
+++ libc/sysdeps/generic/e_exp10.c 2005-08-18 13:37:48.000000000 +0200
@@ -24,7 +24,7 @@
double
__ieee754_exp10 (double arg)
{
- /* This is a very stupid and inprecise implementation. It'll get
+ /* This is a very stupid and imprecise implementation. It'll get
replaced sometime (soon?). */
return __ieee754_exp (M_LN10 * arg);
}
--- libc/sysdeps/generic/flockfile.c.jj 2002-12-16 23:12:27.000000000 +0100
+++ libc/sysdeps/generic/flockfile.c 2005-08-18 13:37:47.000000000 +0200
@@ -1,4 +1,4 @@
-/* Lock I/O stream. Singlethreaded version.
+/* Lock I/O stream. Single-threaded version.
Copyright (C) 1996, 1997, 2000, 2002 Free Software Foundation, Inc.
This file is part of the GNU C Library.
--- libc/sysdeps/generic/ftrylockfile.c.jj 2002-12-16 23:13:00.000000000 +0100
+++ libc/sysdeps/generic/ftrylockfile.c 2005-08-18 13:37:47.000000000 +0200
@@ -1,4 +1,4 @@
-/* Try locking I/O stream. Singlethreaded version.
+/* Try locking I/O stream. Single-threaded version.
Copyright (C) 1996, 1997, 2000, 2002 Free Software Foundation, Inc.
This file is part of the GNU C Library.
--- libc/sysdeps/generic/check_fds.c.jj 2003-04-23 03:54:03.000000000 +0200
+++ libc/sysdeps/generic/check_fds.c 2005-08-18 13:37:48.000000000 +0200
@@ -56,7 +56,7 @@ check_one_fd (int fd, int mode)
Note that the following code assumes that STDIN_FILENO,
STDOUT_FILENO, STDERR_FILENO are the three lowest file
- decsriptor numbers, in this order. */
+ descriptor numbers, in this order. */
if (__builtin_expect (nullfd != fd, 0)
|| __builtin_expect (__fxstat64 (_STAT_VER, fd, &st), 0) != 0
|| __builtin_expect (S_ISCHR (st.st_mode), 1) == 0
--- libc/sysdeps/generic/e_exp10l.c.jj 2001-07-06 06:55:49.000000000 +0200
+++ libc/sysdeps/generic/e_exp10l.c 2005-08-18 13:37:48.000000000 +0200
@@ -24,7 +24,7 @@
long double
__ieee754_exp10l (long double arg)
{
- /* This is a very stupid and inprecise implementation. It'll get
+ /* This is a very stupid and imprecise implementation. It'll get
replaced sometime (soon?). */
return __ieee754_expl (M_LN10l * arg);
}
--- libc/sysdeps/hppa/dl-lookupcfg.h.jj 2005-01-08 16:50:24.000000000 +0100
+++ libc/sysdeps/hppa/dl-lookupcfg.h 2005-08-18 13:37:48.000000000 +0200
@@ -56,7 +56,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) \
--- libc/sysdeps/hppa/dl-machine.h.jj 2004-11-19 13:38:56.000000000 +0100
+++ libc/sysdeps/hppa/dl-machine.h 2005-08-18 13:37:48.000000000 +0200
@@ -348,7 +348,7 @@ asm ( \
just like a branch reloc. This sequence gets us the \
runtime address of _DYNAMIC. */ \
" bl 0f,%r19\n" \
-" depi 0,31,2,%r19\n" /* clear priviledge bits */ \
+" depi 0,31,2,%r19\n" /* clear privilege bits */ \
"0: addil L'_DYNAMIC - ($PIC_pcrel$0 - 8),%r19\n" \
" ldo R'_DYNAMIC - ($PIC_pcrel$0 - 12)(%r1),%r26\n" \
\
--- libc/sysdeps/ieee754/ldbl-128/e_expl.c.jj 2004-12-21 14:33:37.000000000 +0100
+++ libc/sysdeps/ieee754/ldbl-128/e_expl.c 2005-08-18 13:37:48.000000000 +0200
@@ -118,7 +118,7 @@ static const long double C[] = {
#define TWO15 C[11]
32768.0L,
-/* Chebyshev polynom coeficients for (exp(x)-1)/x */
+/* Chebyshev polynom coefficients for (exp(x)-1)/x */
#define P1 C[12]
#define P2 C[13]
#define P3 C[14]
--- libc/sysdeps/ieee754/ldbl-128/e_powl.c.jj 2002-08-28 04:30:21.000000000 +0200
+++ libc/sysdeps/ieee754/ldbl-128/e_powl.c 2005-08-18 13:53:57.000000000 +0200
@@ -37,7 +37,7 @@
* 1. Compute and return log2(x) in two pieces:
* log2(x) = w1 + w2,
* where w1 has 113-53 = 60 bit trailing zeros.
- * 2. Perform y*log2(x) = n+y' by simulating muti-precision
+ * 2. Perform y*log2(x) = n+y' by simulating multi-precision
* arithmetic, where |y'|<=0.5.
* 3. Return x**y = 2**n*exp(y'*log2)
*
--- libc/sysdeps/ieee754/ldbl-128/e_coshl.c.jj 2002-08-28 04:30:21.000000000 +0200
+++ libc/sysdeps/ieee754/ldbl-128/e_coshl.c 2005-08-18 13:37:48.000000000 +0200
@@ -107,7 +107,7 @@ __ieee754_coshl (x)
if (ex <= 0x400c62e3) /* 11356.375 */
return half * __ieee754_expl (u.value);
- /* |x| in [log(maxdouble), overflowthresold] */
+ /* |x| in [log(maxdouble), overflowthreshold] */
if (u.value <= ovf_thresh)
{
w = __ieee754_expl (half * u.value);
@@ -115,6 +115,6 @@ __ieee754_coshl (x)
return t * w;
}
- /* |x| > overflowthresold, cosh(x) overflow */
+ /* |x| > overflowthreshold, cosh(x) overflow */
return huge * huge;
}
--- libc/sysdeps/ieee754/ldbl-96/e_lgammal_r.c.jj 2002-08-28 04:30:22.000000000 +0200
+++ libc/sysdeps/ieee754/ldbl-96/e_lgammal_r.c 2005-08-18 13:37:48.000000000 +0200
@@ -44,7 +44,7 @@
* = log(6.3*5.3) + lgamma(5.3)
* = log(6.3*5.3*4.3*3.3*2.3) + lgamma(2.3)
* 2. Polynomial approximation of lgamma around its
- * minimun ymin=1.461632144968362245 to maintain monotonicity.
+ * minimum ymin=1.461632144968362245 to maintain monotonicity.
* On [ymin-0.23, ymin+0.27] (i.e., [1.23164,1.73163]), use
* Let z = x-ymin;
* lgamma(x) = -1.214862905358496078218 + z^2*poly(z)
--- libc/sysdeps/ieee754/flt-32/e_coshf.c.jj 1999-07-14 01:57:55.000000000 +0200
+++ libc/sysdeps/ieee754/flt-32/e_coshf.c 2005-08-18 13:37:48.000000000 +0200
@@ -60,13 +60,13 @@ static float one = 1.0, half=0.5, huge =
/* |x| in [22, log(maxdouble)] return half*exp(|x|) */
if (ix < 0x42b17180) return half*__ieee754_expf(fabsf(x));
- /* |x| in [log(maxdouble), overflowthresold] */
+ /* |x| in [log(maxdouble), overflowthreshold] */
if (ix<=0x42b2d4fc) {
w = __ieee754_expf(half*fabsf(x));
t = half*w;
return t*w;
}
- /* |x| > overflowthresold, cosh(x) overflow */
+ /* |x| > overflowthreshold, cosh(x) overflow */
return huge*huge;
}
--- libc/sysdeps/ieee754/flt-32/e_sinhf.c.jj 1999-07-14 01:59:02.000000000 +0200
+++ libc/sysdeps/ieee754/flt-32/e_sinhf.c 2005-08-18 13:37:48.000000000 +0200
@@ -56,13 +56,13 @@ static float one = 1.0, shuge = 1.0e37;
/* |x| in [22, log(maxdouble)] return 0.5*exp(|x|) */
if (ix < 0x42b17180) return h*__ieee754_expf(fabsf(x));
- /* |x| in [log(maxdouble), overflowthresold] */
+ /* |x| in [log(maxdouble), overflowthreshold] */
if (ix<=0x42b2d4fc) {
w = __ieee754_expf((float)0.5*fabsf(x));
t = h*w;
return t*w;
}
- /* |x| > overflowthresold, sinh(x) overflow */
+ /* |x| > overflowthreshold, sinh(x) overflow */
return x*shuge;
}
--- libc/sysdeps/ieee754/k_standard.c.jj 2004-11-25 14:36:06.000000000 +0100
+++ libc/sysdeps/ieee754/k_standard.c 2005-08-18 13:37:48.000000000 +0200
@@ -30,7 +30,7 @@ static char rcsid[] = "$NetBSD: k_standa
#endif /* !defined(_USE_WRITE) */
/* XXX gcc versions until now don't delay the 0.0/0.0 division until
- runtime but produce NaN at copile time. This is wrong since the
+ runtime but produce NaN at compile time. This is wrong since the
exceptions are not set correctly. */
#if 0 && defined __STDC__
static const double zero = 0.0; /* used as const */
--- libc/sysdeps/ieee754/dbl-64/branred.c.jj 2002-08-27 00:40:36.000000000 +0200
+++ libc/sysdeps/ieee754/dbl-64/branred.c 2005-08-18 13:37:48.000000000 +0200
@@ -140,5 +140,5 @@ int __branred(double x, double *a, doubl
t=(b-s)+bb;
*a=s;
*aa=t;
- return ((int) sum)&3; /* return quater of unit circle */
+ return ((int) sum)&3; /* return quarter of unit circle */
}
--- libc/sysdeps/ieee754/dbl-64/s_atan.c.jj 2002-08-27 00:40:36.000000000 +0200
+++ libc/sysdeps/ieee754/dbl-64/s_atan.c 2005-08-18 13:37:48.000000000 +0200
@@ -222,7 +222,7 @@ for (i=0; i<M; i++) {
__mp_dbl(&mpy1,&y1,p); __mp_dbl(&mpy2,&y2,p);
if (y1==y2) return y1;
}
- return y1; /*if unpossible to do exact computing */
+ return y1; /*if impossible to do exact computing */
}
#ifdef NO_LONG_DOUBLE
--- libc/sysdeps/ieee754/dbl-64/e_lgamma_r.c.jj 2002-09-10 02:50:32.000000000 +0200
+++ libc/sysdeps/ieee754/dbl-64/e_lgamma_r.c 2005-08-18 13:37:48.000000000 +0200
@@ -28,7 +28,7 @@ static char rcsid[] = "$NetBSD: e_lgamma
* = log(6.3*5.3) + lgamma(5.3)
* = log(6.3*5.3*4.3*3.3*2.3) + lgamma(2.3)
* 2. Polynomial approximation of lgamma around its
- * minimun ymin=1.461632144968362245 to maintain monotonicity.
+ * minimum ymin=1.461632144968362245 to maintain monotonicity.
* On [ymin-0.23, ymin+0.27] (i.e., [1.23164,1.73163]), use
* Let z = x-ymin;
* lgamma(x) = -1.214862905358496078218 + z^2*poly(z)
--- libc/sysdeps/ieee754/dbl-64/e_cosh.c.jj 1999-07-14 01:48:26.000000000 +0200
+++ libc/sysdeps/ieee754/dbl-64/e_cosh.c 2005-08-18 13:37:48.000000000 +0200
@@ -79,7 +79,7 @@ static double one = 1.0, half=0.5, huge
/* |x| in [22, log(maxdouble)] return half*exp(|x|) */
if (ix < 0x40862e42) return half*__ieee754_exp(fabs(x));
- /* |x| in [log(maxdouble), overflowthresold] */
+ /* |x| in [log(maxdouble), overflowthreshold] */
GET_LOW_WORD(lx,x);
if (ix<0x408633ce || ((ix==0x408633ce)&&(lx<=(u_int32_t)0x8fb9f87d))) {
w = __ieee754_exp(half*fabs(x));
@@ -87,6 +87,6 @@ static double one = 1.0, half=0.5, huge
return t*w;
}
- /* |x| > overflowthresold, cosh(x) overflow */
+ /* |x| > overflowthreshold, cosh(x) overflow */
return huge*huge;
}
--- libc/sysdeps/ieee754/dbl-64/e_atan2.c.jj 2002-08-27 00:40:36.000000000 +0200
+++ libc/sysdeps/ieee754/dbl-64/e_atan2.c 2005-08-18 13:37:48.000000000 +0200
@@ -402,5 +402,5 @@ static double atan2Mp(double x,double y
__mp_dbl(&mpz1,&z1,p); __mp_dbl(&mpz2,&z2,p);
if (z1==z2) return z1;
}
- return z1; /*if unpossible to do exact computing */
+ return z1; /*if impossible to do exact computing */
}
--- libc/sysdeps/ieee754/dbl-64/k_rem_pio2.c.jj 1999-07-14 01:49:54.000000000 +0200
+++ libc/sysdeps/ieee754/dbl-64/k_rem_pio2.c 2005-08-18 13:37:48.000000000 +0200
@@ -45,7 +45,7 @@ static char rcsid[] = "$NetBSD: k_rem_pi
* z = (z-x[i])*2**24
*
*
- * y[] ouput result in an array of double precision numbers.
+ * y[] output result in an array of double precision numbers.
* The dimension of y[] is:
* 24-bit precision 1
* 53-bit precision 2
--- libc/sysdeps/ieee754/dbl-64/e_sinh.c.jj 1999-07-14 01:49:32.000000000 +0200
+++ libc/sysdeps/ieee754/dbl-64/e_sinh.c 2005-08-18 13:37:48.000000000 +0200
@@ -73,7 +73,7 @@ static double one = 1.0, shuge = 1.0e307
/* |x| in [22, log(maxdouble)] return 0.5*exp(|x|) */
if (ix < 0x40862e42) return h*__ieee754_exp(fabs(x));
- /* |x| in [log(maxdouble), overflowthresold] */
+ /* |x| in [log(maxdouble), overflowthreshold] */
GET_LOW_WORD(lx,x);
if (ix<0x408633ce || ((ix==0x408633ce)&&(lx<=(u_int32_t)0x8fb9f87d))) {
w = __ieee754_exp(0.5*fabs(x));
@@ -81,6 +81,6 @@ static double one = 1.0, shuge = 1.0e307
return t*w;
}
- /* |x| > overflowthresold, sinh(x) overflow */
+ /* |x| > overflowthreshold, sinh(x) overflow */
return x*shuge;
}
--- libc/sysdeps/mach/hurd/net/ethernet.h.jj 2001-07-06 06:55:59.000000000 +0200
+++ libc/sysdeps/mach/hurd/net/ethernet.h 2005-08-18 13:37:48.000000000 +0200
@@ -56,7 +56,7 @@ struct ether_header
#define ETHER_MIN_LEN (ETH_ZLEN + ETH_CRC_LEN) /* min packet length */
#define ETHER_MAX_LEN (ETH_FRAME_LEN + ETH_CRC_LEN) /* max packet length */
-/* make sure ethenet length is valid */
+/* make sure ethernet length is valid */
#define ETHER_IS_VALID_LEN(foo) \
((foo) >= ETHER_MIN_LEN && (foo) <= ETHER_MAX_LEN)
--- libc/sysdeps/mach/hurd/i386/tls.h.jj 2004-11-01 13:25:43.000000000 +0100
+++ libc/sysdeps/mach/hurd/i386/tls.h 2005-08-18 13:37:48.000000000 +0200
@@ -25,7 +25,7 @@
/* Some things really need not be machine-dependent. */
# include <sysdeps/mach/hurd/tls.h>
-/* Indiciate that TLS support is available. */
+/* Indicate that TLS support is available. */
# define USE_TLS 1
/* The TCB can have any size and the memory following the address the
--- libc/sysdeps/x86_64/strcpy_chk.S.jj 2004-10-18 06:17:08.000000000 +0200
+++ libc/sysdeps/x86_64/strcpy_chk.S 2005-08-18 13:37:53.000000000 +0200
@@ -62,7 +62,7 @@ ENTRY (STRCPY_CHK)
for the next unrolled round? */
jb 60f /* If not, avoid the unrolled loop. */
- /* Now the sources is aligned. Unfortunatly we cannot force
+ /* Now the sources is aligned. Unfortunately we cannot force
to have both source and destination aligned, so ignore the
alignment of the destination. */
.p2align 4
--- libc/sysdeps/x86_64/fpu/bits/mathdef.h.jj 2004-11-09 12:26:49.000000000 +0100
+++ libc/sysdeps/x86_64/fpu/bits/mathdef.h 2005-08-18 13:37:48.000000000 +0200
@@ -26,7 +26,7 @@
# include <bits/wordsize.h>
# if __WORDSIZE == 64 || (defined __FLT_EVAL_METHOD__ && __FLT_EVAL_METHOD__ == 0)
-/* The x86-64 architecture computes values with the precission of the
+/* The x86-64 architecture computes values with the precision of the
used type. Similarly for -m32 -mfpmath=sse. */
typedef float float_t; /* `float' expressions are evaluated as `float'. */
typedef double double_t; /* `double' expressions are evaluated
--- libc/sysdeps/x86_64/memset.S.jj 2005-04-01 17:08:22.000000000 +0200
+++ libc/sysdeps/x86_64/memset.S 2005-08-18 13:37:53.000000000 +0200
@@ -27,7 +27,7 @@
/* BEWARE: `#ifdef memset' means that memset is redefined as `bzero' */
#define BZERO_P (defined memset)
-/* This is somehow experimental and could made dependend on the cache
+/* This is somehow experimental and could made dependent on the cache
size. */
#define LARGE $120000
--- libc/sysdeps/x86_64/strcpy.S.jj 2003-04-30 00:47:18.000000000 +0200
+++ libc/sysdeps/x86_64/strcpy.S 2005-08-18 13:37:53.000000000 +0200
@@ -51,7 +51,7 @@ ENTRY (BP_SYM (STRCPY))
5:
movq $0xfefefefefefefeff,%r8
- /* Now the sources is aligned. Unfortunatly we cannot force
+ /* Now the sources is aligned. Unfortunately we cannot force
to have both source and destination aligned, so ignore the
alignment of the destination. */
.p2align 4
--- libc/sysdeps/x86_64/strcat.S.jj 2003-04-30 00:47:18.000000000 +0200
+++ libc/sysdeps/x86_64/strcat.S 2005-08-18 13:37:53.000000000 +0200
@@ -159,7 +159,7 @@ ENTRY (BP_SYM (strcat))
decl %ecx
jnz 21b
- /* Now the sources is aligned. Unfortunatly we cannot force
+ /* Now the sources is aligned. Unfortunately we cannot force
to have both source and destination aligned, so ignore the
alignment of the destination. */
.p2align 4
--- libc/sysdeps/x86_64/strchr.S.jj 2005-04-01 17:08:22.000000000 +0200
+++ libc/sysdeps/x86_64/strchr.S 2005-08-18 13:37:53.000000000 +0200
@@ -279,7 +279,7 @@ ENTRY (BP_SYM (strchr))
cmpb %dl, %cl /* is seventh byte NUL? */
je 7b /* yes => return NULL */
- /* It must be in the eigth byte and it cannot be NUL. */
+ /* It must be in the eight byte and it cannot be NUL. */
incq %rax
6:
--- libc/argp/argp-help.c.jj 2005-08-17 18:02:53.000000000 +0200
+++ libc/argp/argp-help.c 2005-08-18 13:37:48.000000000 +0200
@@ -1,4 +1,4 @@
-/* Hierarchial argument parsing help output
+/* Hierarchical argument parsing help output
Copyright (C) 1995-2003, 2004, 2005 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Written by Miles Bader <miles@gnu.ai.mit.edu>.
@@ -276,7 +276,7 @@ fill_in_uparams (const struct argp_state
optional. The documentation string is word-wrapped appropiately, and if
the list of options is long enough, it will be started on a separate line.
If there are no short options for a given option, the first long option is
- indented slighly in a way that's supposed to make most long options appear
+ indented slightly in a way that's supposed to make most long options appear
to be in a separate column.
For example, the following output (from ps):
@@ -733,7 +733,7 @@ hol_entry_cmp (const struct hol_entry *e
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
@@ -1537,7 +1537,7 @@ argp_doc (const struct argp *argp, const
}
/* Output a usage message for ARGP to STREAM. If called from
- argp_state_help, STATE is the relevent parsing state. FLAGS are from the
+ argp_state_help, STATE is the relevant parsing state. FLAGS are from the
set ARGP_HELP_*. NAME is what to use wherever a `program name' is
needed. */
static void
--- libc/argp/argp.h.jj 2004-09-14 00:32:39.000000000 +0200
+++ libc/argp/argp.h 2005-08-18 13:37:48.000000000 +0200
@@ -1,4 +1,4 @@
-/* Hierarchial argument parsing, layered over getopt.
+/* Hierarchical argument parsing, layered over getopt.
Copyright (C) 1995-1999,2003,2004 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Written by Miles Bader <miles@gnu.ai.mit.edu>.
@@ -485,7 +485,7 @@ extern void __argp_help (__const struct
parsing routine (thus taking an argp_state structure as the first
argument). They may or may not print an error message and exit, depending
on the flags in STATE -- in any case, the caller should be prepared for
- them *not* to exit, and should return an appropiate error after calling
+ them *not* to exit, and should return an appropriate error after calling
them. [argp_usage & argp_error should probably be called argp_state_...,
but they're used often enough that they should be short] */
--- libc/argp/argp-parse.c.jj 2004-03-10 10:31:57.000000000 +0100
+++ libc/argp/argp-parse.c 2005-08-18 13:37:48.000000000 +0200
@@ -1,4 +1,4 @@
-/* Hierarchial argument parsing, layered over getopt
+/* Hierarchical argument parsing, layered over getopt
Copyright (C) 1995-2000, 2002, 2003, 2004 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Written by Miles Bader <miles@gnu.ai.mit.edu>.
@@ -228,7 +228,7 @@ struct group
particular short options is from. */
char *short_end;
- /* The number of non-option args sucessfully handled by this parser. */
+ /* The number of non-option args successfully handled by this parser. */
unsigned args_processed;
/* This group's parser's parent's group. */
--- libc/socket/sys/socket.h.jj 2005-02-22 10:02:45.000000000 +0100
+++ libc/socket/sys/socket.h 2005-08-18 13:37:48.000000000 +0200
@@ -219,7 +219,7 @@ extern int shutdown (int __fd, int __how
#ifdef __USE_XOPEN2K
-/* Determine wheter socket is at a out-of-band mark. */
+/* Determine whether socket is at a out-of-band mark. */
extern int sockatmark (int __fd) __THROW;
#endif
--- libc/rt/aio.h.jj 2004-09-14 00:32:55.000000000 +0200
+++ libc/rt/aio.h 2005-08-18 13:37:48.000000000 +0200
@@ -34,7 +34,7 @@ __BEGIN_DECLS
/* Asynchronous I/O control block. */
struct aiocb
{
- int aio_fildes; /* File desriptor. */
+ int aio_fildes; /* File descriptor. */
int aio_lio_opcode; /* Operation to be performed. */
int aio_reqprio; /* Request priority offset. */
volatile void *aio_buf; /* Location of buffer. */
@@ -62,7 +62,7 @@ struct aiocb
#ifdef __USE_LARGEFILE64
struct aiocb64
{
- int aio_fildes; /* File desriptor. */
+ int aio_fildes; /* File descriptor. */
int aio_lio_opcode; /* Operation to be performed. */
int aio_reqprio; /* Request priority offset. */
volatile void *aio_buf; /* Location of buffer. */
@@ -88,7 +88,7 @@ struct aiocb64
struct aioinit
{
int aio_threads; /* Maximal number of threads. */
- int aio_num; /* Number of expected simultanious requests. */
+ int aio_num; /* Number of expected simultaneous requests. */
int aio_locks; /* Not used. */
int aio_usedba; /* Not used. */
int aio_debug; /* Not used. */
@@ -168,7 +168,7 @@ extern int aio_cancel (int __fildes, str
extern int aio_suspend (__const struct aiocb *__const __list[], int __nent,
__const struct timespec *__restrict __timeout);
-/* Force all operations associated with file desriptor described by
+/* Force all operations associated with file descriptor described by
`aio_fildes' member of AIOCBP. */
extern int aio_fsync (int __operation, struct aiocb *__aiocbp) __THROW;
#else
--- libc/login/programs/utmpdump.c.jj 2003-08-29 12:30:14.000000000 +0200
+++ libc/login/programs/utmpdump.c 2005-08-18 13:37:48.000000000 +0200
@@ -27,7 +27,7 @@
static void
print_entry (struct utmp *up)
{
- /* Mixed 32-/64-bit systems may have timeval structs of different sixe
+ /* Mixed 32-/64-bit systems may have timeval structs of different size
but need struct utmp to be the same size. So in 64-bit up->ut_tv may
not be a timeval but a struct of __int32_t's. This would cause a compile
time warning and a formating error when 32-bit int is passed where
--- libc/assert/assert-perr.c.jj 2005-07-28 15:56:56.000000000 +0200
+++ libc/assert/assert-perr.c 2005-08-18 13:37:48.000000000 +0200
@@ -64,7 +64,7 @@ __assert_perror_fail (int errnum,
(void) __fxprintf (NULL, "%s", buf);
(void) fflush (stderr);
- /* We have to free the buffer since the appplication might catch the
+ /* We have to free the buffer since the application might catch the
SIGABRT. */
free (buf);
}
--- libc/localedata/tests-mbwc/dat_wcscmp.c.jj 2003-01-03 23:02:16.000000000 +0100
+++ libc/localedata/tests-mbwc/dat_wcscmp.c 2005-08-18 13:37:48.000000000 +0200
@@ -8,7 +8,7 @@
/* NOTE:
This is not a locale sensitive function and
- it may not make sence testing it for each locale ...
+ it may not make sense testing it for each locale ...
*/
--- libc/localedata/tests-mbwc/dat_mblen.c.jj 2003-01-03 23:02:16.000000000 +0100
+++ libc/localedata/tests-mbwc/dat_mblen.c 2005-08-18 13:37:48.000000000 +0200
@@ -19,7 +19,7 @@
*
* o When you feed a null pointer for a string (s) to the function,
* set s_flg=0 instead of putting just a 'NULL' there.
- * Even if you set a 'NULL', it doens't mean a NULL pointer.
+ * Even if you set a 'NULL', it doesn't mean a NULL pointer.
*
* o When s is a null pointer, the function checks state dependency.
*
--- libc/localedata/tests-mbwc/dat_strxfrm.c.jj 2003-01-03 23:02:16.000000000 +0100
+++ libc/localedata/tests-mbwc/dat_strxfrm.c 2005-08-18 13:37:48.000000000 +0200
@@ -13,7 +13,7 @@
* Return value and errno value are checked only for 2nd string:
* org2[]; n1 and n2 don't mean bytes to be translated.
* It means a buffer size including a null character.
- * Results of this test depens on results of strcoll().
+ * Results of this test depends on results of strcoll().
* If you got errors, check both test results.
*
* The buffer size should be enough to contain a string including a
--- libc/localedata/tests-mbwc/dat_wcsxfrm.c.jj 2003-01-03 23:02:17.000000000 +0100
+++ libc/localedata/tests-mbwc/dat_wcsxfrm.c 2005-08-18 13:37:48.000000000 +0200
@@ -12,7 +12,7 @@
* Return value and errno value are checked only for 2nd string:
* org2[]; n1 and n2 don't mean bytes to be translated.
* It means a buffer size including a null character.
- * Results of this test depens on results of wcscoll().
+ * Results of this test depends on results of wcscoll().
* If you got errors, check both test results.
*/
--- libc/localedata/tests-mbwc/dat_wcsncat.c.jj 2003-01-03 23:02:17.000000000 +0100
+++ libc/localedata/tests-mbwc/dat_wcsncat.c 2005-08-18 13:55:54.000000000 +0200
@@ -9,7 +9,7 @@
/*
* Note:
- * A terminating null wide chararacter is always appended to
+ * A terminating null wide character is always appended to
* the result: ws1.
*
*/
--- libc/localedata/tests-mbwc/dat_strcoll.c.jj 2003-01-03 23:02:16.000000000 +0100
+++ libc/localedata/tests-mbwc/dat_strcoll.c 2005-08-18 13:37:48.000000000 +0200
@@ -13,7 +13,7 @@
expected value = 0. If a return value is expected to be a
positive/negative value, set ret_flg=0, and set the expected value
= +1/-1.
- There is inconsistensy between tst_strcoll() and tst_wcscoll()(it
+ There is inconsistency between tst_strcoll() and tst_wcscoll()(it
has cmp_flg) for input data. I'll fix it.
Assuming en_US to be en_US.ascii. (maybe, should be iso8859-1).
--- libc/localedata/tst-digits.c.jj 2001-07-06 06:55:34.000000000 +0200
+++ libc/localedata/tst-digits.c 2005-08-18 13:37:48.000000000 +0200
@@ -179,7 +179,7 @@ main (void)
printf ("%d failures in wprintf tests\n", failures);
status = failures != 0;
- /* ctype tests. This makes sure that the multibyte chracter digit
+ /* ctype tests. This makes sure that the multibyte character digit
representations are not handle in this table. */
failures = 0;
for (cnt = 0; cnt < 256; ++cnt)
--- libc/localedata/tests/test6.c.jj 2001-07-06 06:55:34.000000000 +0200
+++ libc/localedata/tests/test6.c 2005-08-18 13:37:48.000000000 +0200
@@ -41,7 +41,7 @@ main (void)
/* Test basic table handling (basic == not more than 256 characters).
The charmaps swaps the normal lower-upper case meaning of the
ASCII characters used in the source code while the Unicode mapping
- in the repertoire map has the normal correspondants. This test
+ in the repertoire map has the normal correspondents. This test
shows the independence of the tables for `char' and `wchar_t'
characters. */
--- libc/nptl/perf.c.jj 2004-08-30 12:06:52.000000000 +0200
+++ libc/nptl/perf.c 2005-08-18 13:37:49.000000000 +0200
@@ -389,7 +389,7 @@ main (int argc, char *argv[])
tmain = pthread_self ();
/* We use signal SIGUSR1 for communication between the threads and
- the main thread. We only want sychronous notification. */
+ the main thread. We only want synchronous notification. */
if (sync_method == sync_signal)
{
sigemptyset (&ss);
--- libc/nptl/sem_open.c.jj 2003-05-31 21:57:50.000000000 +0200
+++ libc/nptl/sem_open.c 2005-08-18 13:37:48.000000000 +0200
@@ -179,7 +179,7 @@ check_add_mapping (const char *name, siz
}
else
{
- /* We haven't found a mapping. Install ione. */
+ /* We haven't found a mapping. Install one. */
struct inuse_sem *newp;
newp = (struct inuse_sem *) malloc (sizeof (*newp) + namelen);
--- libc/nptl/tst-cancel9.c.jj 2004-02-23 09:46:36.000000000 +0100
+++ libc/nptl/tst-cancel9.c 2005-08-18 13:37:49.000000000 +0200
@@ -61,7 +61,7 @@ tf (void *arg)
}
while (1)
- /* fprintf() uses write() which is a cancallation point. */
+ /* fprintf() uses write() which is a cancellation point. */
fprintf (fp, "foo");
pthread_cleanup_pop (0);
--- libc/nptl/pthread_setschedprio.c.jj 2004-11-24 23:52:48.000000000 +0100
+++ libc/nptl/pthread_setschedprio.c 2005-08-18 13:37:49.000000000 +0200
@@ -42,7 +42,7 @@ pthread_setschedprio (threadid, prio)
param.sched_priority = prio;
/* We have to handle cancellation in the following code since we are
- locking another threads desriptor. */
+ locking another threads descriptor. */
pthread_cleanup_push ((void (*) (void *)) lll_unlock_wake_cb, &pd->lock);
lll_lock (pd->lock);
--- libc/nptl/sysdeps/unix/sysv/linux/alpha/bits/local_lim.h.jj 2004-04-13 10:42:53.000000000 +0200
+++ libc/nptl/sysdeps/unix/sysv/linux/alpha/bits/local_lim.h 2005-08-18 13:37:48.000000000 +0200
@@ -66,7 +66,7 @@
/* We have no predefined limit on the number of threads. */
#undef PTHREAD_THREADS_MAX
-/* Maximum amount by which a process can descrease its asynchronous I/O
+/* Maximum amount by which a process can decrease its asynchronous I/O
priority level. */
#define AIO_PRIO_DELTA_MAX 20
--- libc/nptl/sysdeps/unix/sysv/linux/alpha/lowlevellock.h.jj 2004-06-11 14:45:52.000000000 +0200
+++ libc/nptl/sysdeps/unix/sysv/linux/alpha/lowlevellock.h 2005-08-18 14:05:27.000000000 +0200
@@ -12,7 +12,7 @@
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
- License along with the GNU C Libr \ary; if not, write to the Free
+ License along with the GNU C Library; if not, write to the Free
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
02111-1307 USA. */
--- libc/nptl/sysdeps/unix/sysv/linux/internaltypes.h.jj 2004-09-02 23:27:06.000000000 +0200
+++ libc/nptl/sysdeps/unix/sysv/linux/internaltypes.h 2005-08-18 13:37:49.000000000 +0200
@@ -67,7 +67,7 @@ struct pthread_condattr
{
/* Combination of values:
- Bit 0 : flag whether coditional variable will be shareable between
+ Bit 0 : flag whether conditional variable will be shareable between
processes.
Bit 1-7: clock ID. */
--- libc/nptl/sysdeps/unix/sysv/linux/register-atfork.c.jj 2003-06-14 10:49:21.000000000 +0200
+++ libc/nptl/sysdeps/unix/sysv/linux/register-atfork.c 2005-08-18 13:37:48.000000000 +0200
@@ -117,7 +117,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));
--- libc/nptl/sysdeps/unix/sysv/linux/sparc/bits/local_lim.h.jj 2004-04-13 10:42:53.000000000 +0200
+++ libc/nptl/sysdeps/unix/sysv/linux/sparc/bits/local_lim.h 2005-08-18 13:37:48.000000000 +0200
@@ -66,7 +66,7 @@
/* We have no predefined limit on the number of threads. */
#undef PTHREAD_THREADS_MAX
-/* Maximum amount by which a process can descrease its asynchronous I/O
+/* Maximum amount by which a process can decrease its asynchronous I/O
priority level. */
#define AIO_PRIO_DELTA_MAX 20
--- libc/nptl/sysdeps/unix/sysv/linux/sparc/lowlevellock.h.jj 2004-06-11 14:45:53.000000000 +0200
+++ libc/nptl/sysdeps/unix/sysv/linux/sparc/lowlevellock.h 2005-08-18 14:05:49.000000000 +0200
@@ -13,7 +13,7 @@
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
- License along with the GNU C Libr \ary; if not, write to the Free
+ License along with the GNU C Library; if not, write to the Free
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
02111-1307 USA. */
--- libc/nptl/sysdeps/unix/sysv/linux/sh/pthread_cond_wait.S.jj 2004-09-14 00:32:53.000000000 +0200
+++ libc/nptl/sysdeps/unix/sysv/linux/sh/pthread_cond_wait.S 2005-08-18 13:37:53.000000000 +0200
@@ -274,7 +274,7 @@ __pthread_cond_wait:
bra 2b
nop
3:
- /* Unlock in loop requires waekup. */
+ /* Unlock in loop requires wakeup. */
mov r8, r4
#if cond_lock != 0
add #cond_lock, r4
--- libc/nptl/sysdeps/unix/sysv/linux/sh/pthread_once.S.jj 2004-07-12 17:50:23.000000000 +0200
+++ libc/nptl/sysdeps/unix/sysv/linux/sh/pthread_once.S 2005-08-18 13:37:53.000000000 +0200
@@ -153,7 +153,7 @@ __pthread_once:
add #UNWINDBUFSIZE, r15
cfi_adjust_cfa_offset (-UNWINDBUFSIZE)
- /* Sucessful run of the initializer. Signal that we are done. */
+ /* Successful run of the initializer. Signal that we are done. */
INC (@r9, r2)
/* Wake up all other threads. */
mov r9, r4
--- libc/nptl/sysdeps/unix/sysv/linux/i386/pthread_once.S.jj 2004-05-18 10:52:25.000000000 +0200
+++ libc/nptl/sysdeps/unix/sysv/linux/i386/pthread_once.S 2005-08-18 13:37:53.000000000 +0200
@@ -124,7 +124,7 @@ __pthread_once:
addl $UNWINDBUFSIZE+8, %esp
cfi_adjust_cfa_offset (-UNWINDBUFSIZE-8)
- /* Sucessful run of the initializer. Signal that we are done. */
+ /* Successful run of the initializer. Signal that we are done. */
movl 12(%esp), %ebx
LOCK
addl $1, (%ebx)
--- libc/nptl/sysdeps/unix/sysv/linux/i386/lowlevellock.h.jj 2004-05-18 10:56:00.000000000 +0200
+++ libc/nptl/sysdeps/unix/sysv/linux/i386/lowlevellock.h 2005-08-18 13:37:48.000000000 +0200
@@ -107,7 +107,7 @@ extern int __lll_mutex_unlock_wake (int
/* NB: in the lll_mutex_trylock macro we simply return the value in %eax
- after the cmpxchg instruction. In case the operation succeded this
+ after the cmpxchg instruction. In case the operation succeeded this
value is zero. In case the operation failed, the cmpxchg instruction
has loaded the current value of the memory work which is guaranteed
to be nonzero. */
--- libc/nptl/sysdeps/unix/sysv/linux/i386/i486/pthread_cond_broadcast.S.jj 2004-06-11 14:45:52.000000000 +0200
+++ libc/nptl/sysdeps/unix/sysv/linux/i386/i486/pthread_cond_broadcast.S 2005-08-18 13:37:53.000000000 +0200
@@ -143,12 +143,12 @@ __pthread_cond_broadcast:
call __lll_mutex_lock_wait
jmp 2b
- /* Unlock in loop requires waekup. */
+ /* Unlock in loop requires wakeup. */
5: leal cond_lock-cond_futex(%ebx), %eax
call __lll_mutex_unlock_wake
jmp 6b
- /* Unlock in loop requires waekup. */
+ /* Unlock in loop requires wakeup. */
7: leal cond_lock-cond_futex(%ebx), %eax
call __lll_mutex_unlock_wake
jmp 8b
--- libc/nptl/sysdeps/unix/sysv/linux/i386/i486/pthread_cond_wait.S.jj 2004-09-02 23:27:06.000000000 +0200
+++ libc/nptl/sysdeps/unix/sysv/linux/i386/i486/pthread_cond_wait.S 2005-08-18 13:37:53.000000000 +0200
@@ -209,7 +209,7 @@ __pthread_cond_wait:
call __lll_mutex_lock_wait
jmp 2b
- /* Unlock in loop requires waekup. */
+ /* Unlock in loop requires wakeup. */
3:
.LSbl2:
#if cond_lock == 0
--- libc/nptl/sysdeps/unix/sysv/linux/bits/local_lim.h.jj 2005-03-01 10:34:41.000000000 +0100
+++ libc/nptl/sysdeps/unix/sysv/linux/bits/local_lim.h 2005-08-18 13:37:48.000000000 +0200
@@ -66,7 +66,7 @@
/* We have no predefined limit on the number of threads. */
#undef PTHREAD_THREADS_MAX
-/* Maximum amount by which a process can descrease its asynchronous I/O
+/* Maximum amount by which a process can decrease its asynchronous I/O
priority level. */
#define AIO_PRIO_DELTA_MAX 20
--- libc/nptl/sysdeps/unix/sysv/linux/ia64/__sigstack_longjmp.c.jj 2004-09-13 20:34:47.000000000 +0200
+++ libc/nptl/sysdeps/unix/sysv/linux/ia64/__sigstack_longjmp.c 2005-08-18 13:37:48.000000000 +0200
@@ -20,7 +20,7 @@
/* The public __longjmp() implementation is limited to jumping within
the same stack. That is, in general it is not possible to use this
__longjmp() implementation to cross from one stack to another.
- In constrast, the __sigstack_longjmp() implemented here allows
+ In contrast, the __sigstack_longjmp() implemented here allows
crossing from the alternate signal stack to the normal stack
as a special case. */
--- libc/nptl/sysdeps/unix/sysv/linux/ia64/bits/local_lim.h.jj 2004-04-13 10:42:53.000000000 +0200
+++ libc/nptl/sysdeps/unix/sysv/linux/ia64/bits/local_lim.h 2005-08-18 13:37:48.000000000 +0200
@@ -66,7 +66,7 @@
/* We have no predefined limit on the number of threads. */
#undef PTHREAD_THREADS_MAX
-/* Maximum amount by which a process can descrease its asynchronous I/O
+/* Maximum amount by which a process can decrease its asynchronous I/O
priority level. */
#define AIO_PRIO_DELTA_MAX 20
--- libc/nptl/sysdeps/unix/sysv/linux/mq_notify.c.jj 2004-04-20 19:03:25.000000000 +0200
+++ libc/nptl/sysdeps/unix/sysv/linux/mq_notify.c 2005-08-18 13:37:48.000000000 +0200
@@ -35,9 +35,9 @@
/* Defined in the kernel headers: */
#define NOTIFY_COOKIE_LEN 32 /* Length of the cookie used. */
-#define NOTIFY_WOKENUP 1 /* Code for notifcation. */
+#define NOTIFY_WOKENUP 1 /* Code for notification. */
#define NOTIFY_REMOVED 2 /* Code for closed message queue
- of de-notifcation. */
+ of de-notification. */
/* Data structure for the queued notification requests. */
--- libc/nptl/sysdeps/unix/sysv/linux/x86_64/pthread_once.S.jj 2005-04-13 21:29:02.000000000 +0200
+++ libc/nptl/sysdeps/unix/sysv/linux/x86_64/pthread_once.S 2005-08-18 13:37:53.000000000 +0200
@@ -95,7 +95,7 @@ __pthread_once:
popq %rdi
.Lpop_rdi:
- /* Sucessful run of the initializer. Signal that we are done. */
+ /* Successful run of the initializer. Signal that we are done. */
LOCK
incl (%rdi)
--- libc/nptl/sysdeps/unix/sysv/linux/x86_64/lowlevellock.h.jj 2004-07-12 17:50:23.000000000 +0200
+++ libc/nptl/sysdeps/unix/sysv/linux/x86_64/lowlevellock.h 2005-08-18 13:37:49.000000000 +0200
@@ -82,7 +82,7 @@ extern int __lll_mutex_unlock_wait (int
/* NB: in the lll_mutex_trylock macro we simply return the value in %eax
- after the cmpxchg instruction. In case the operation succeded this
+ after the cmpxchg instruction. In case the operation succeeded this
value is zero. In case the operation failed, the cmpxchg instruction
has loaded the current value of the memory work which is guaranteed
to be nonzero. */
--- libc/nptl/sysdeps/alpha/jmpbuf-unwind.h.jj 2004-09-04 09:16:51.000000000 +0200
+++ libc/nptl/sysdeps/alpha/jmpbuf-unwind.h 2005-08-18 13:37:49.000000000 +0200
@@ -27,5 +27,5 @@
#define _JMPBUF_UNWINDS_ADJ(_jmpbuf, _address, _adj) \
((uintptr_t) (_address) - (_adj) < (uintptr_t) (_jmpbuf)[JB_SP] - (_adj))
-/* We use the normal lobngjmp for unwinding. */
+/* We use the normal longjmp for unwinding. */
#define __libc_unwind_longjmp(buf, val) __libc_longjmp (buf, val)
--- libc/nptl/sysdeps/pthread/posix-timer.h.jj 2004-12-13 09:36:19.000000000 +0100
+++ libc/nptl/sysdeps/pthread/posix-timer.h 2005-08-18 13:37:49.000000000 +0200
@@ -82,7 +82,7 @@ extern struct timer_node __timer_array[T
/* Global lock to protect operation on the lists. */
extern pthread_mutex_t __timer_mutex;
-/* Variable to protext initialization. */
+/* Variable to protect initialization. */
extern pthread_once_t __timer_init_once_control;
/* Nonzero if initialization of timer implementation failed. */
--- libc/nptl/sysdeps/pthread/timer_routines.c.jj 2004-12-13 09:36:19.000000000 +0100
+++ libc/nptl/sysdeps/pthread/timer_routines.c 2005-08-18 13:37:49.000000000 +0200
@@ -45,7 +45,7 @@ struct timer_node __timer_array[TIMER_MA
/* Global lock to protect operation on the lists. */
pthread_mutex_t __timer_mutex = PTHREAD_MUTEX_INITIALIZER;
-/* Variable to protext initialization. */
+/* Variable to protect initialization. */
pthread_once_t __timer_init_once_control = PTHREAD_ONCE_INIT;
/* Nonzero if initialization of timer implementation failed. */
--- libc/nptl/sysdeps/pthread/timer_gettime.c.jj 2004-12-01 21:40:01.000000000 +0100
+++ libc/nptl/sysdeps/pthread/timer_gettime.c 2005-08-18 13:56:15.000000000 +0200
@@ -24,7 +24,7 @@
#include "posix-timer.h"
-/* Get current value of timer TIMERID and store it in VLAUE. */
+/* Get current value of timer TIMERID and store it in VALUE. */
int
timer_gettime (timerid, value)
timer_t timerid;
--- libc/nptl/sysdeps/pthread/timer_create.c.jj 2004-12-13 09:36:19.000000000 +0100
+++ libc/nptl/sysdeps/pthread/timer_create.c 2005-08-18 13:37:49.000000000 +0200
@@ -113,7 +113,7 @@ timer_create (clock_id, evp, timerid)
else
pthread_attr_init (&newtimer->attr);
- /* Ensure thread attributes call for deatched thread. */
+ /* Ensure thread attributes call for detached thread. */
pthread_attr_setdetachstate (&newtimer->attr, PTHREAD_CREATE_DETACHED);
/* Try to find existing thread having the right attributes. */
--- libc/nptl/sysdeps/pthread/pthread.h.jj 2005-07-20 10:32:46.000000000 +0200
+++ libc/nptl/sysdeps/pthread/pthread.h 2005-08-18 13:37:49.000000000 +0200
@@ -358,7 +358,7 @@ extern int pthread_attr_getaffinity_np (
/* Initialize thread attribute *ATTR with attributes corresponding to the
- already running thread TH. It shall be called on unitialized ATTR
+ already running thread TH. It shall be called on uninitialized ATTR
and destroyed with pthread_attr_destroy when no longer needed. */
extern int pthread_getattr_np (pthread_t __th, pthread_attr_t *__attr) __THROW;
#endif
@@ -746,7 +746,7 @@ extern int pthread_rwlock_rdlock (pthrea
extern int pthread_rwlock_tryrdlock (pthread_rwlock_t *__rwlock) __THROW;
# ifdef __USE_XOPEN2K
-/* Try to acquire read lock for RWLOCK or return after specfied time. */
+/* Try to acquire read lock for RWLOCK or return after specified time. */
extern int pthread_rwlock_timedrdlock (pthread_rwlock_t *__restrict __rwlock,
__const struct timespec *__restrict
__abstime) __THROW;
@@ -759,7 +759,7 @@ extern int pthread_rwlock_wrlock (pthrea
extern int pthread_rwlock_trywrlock (pthread_rwlock_t *__rwlock) __THROW;
# ifdef __USE_XOPEN2K
-/* Try to acquire write lock for RWLOCK or return after specfied time. */
+/* Try to acquire write lock for RWLOCK or return after specified time. */
extern int pthread_rwlock_timedwrlock (pthread_rwlock_t *__restrict __rwlock,
__const struct timespec *__restrict
__abstime) __THROW;
@@ -852,13 +852,13 @@ extern int pthread_condattr_setpshared (
int __pshared) __THROW;
#ifdef __USE_XOPEN2K
-/* Get the clock selected for the conditon variable attribute ATTR. */
+/* Get the clock selected for the condition variable attribute ATTR. */
extern int pthread_condattr_getclock (__const pthread_condattr_t *
__restrict __attr,
__clockid_t *__restrict __clock_id)
__THROW;
-/* Set the clock selected for the conditon variable attribute ATTR. */
+/* Set the clock selected for the condition variable attribute ATTR. */
extern int pthread_condattr_setclock (pthread_condattr_t *__attr,
__clockid_t __clock_id) __THROW;
--- libc/nptl/sysdeps/pthread/bits/libc-lock.h.jj 2005-04-13 21:28:42.000000000 +0200
+++ libc/nptl/sysdeps/pthread/bits/libc-lock.h 2005-08-18 13:37:49.000000000 +0200
@@ -135,7 +135,7 @@ typedef pthread_key_t __libc_key_t;
(void) ((NAME) = (__rtld_lock_recursive_t) _RTLD_LOCK_RECURSIVE_INITIALIZER)
/* If we check for a weakly referenced symbol and then perform a
- normal jump to it te code generated for some platforms in case of
+ normal jump to it the code generated for some platforms in case of
PIC is unnecessarily slow. What would happen is that the function
is first referenced as data and then it is called indirectly
through the PLT. We can make this a direct jump. */
@@ -363,7 +363,7 @@ typedef pthread_key_t __libc_key_t;
/* Note that for I/O cleanup handling we are using the old-style
- cancel handling. It does not have to be integrated with C++ snce
+ cancel handling. It does not have to be integrated with C++ since
no C++ code is called in the middle. The old-style handling is
faster and the support is not going away. */
extern void _pthread_cleanup_push (struct _pthread_cleanup_buffer *buffer,
--- libc/nptl/sysdeps/pthread/pthread_rwlock_timedwrlock.c.jj 2004-07-12 17:50:23.000000000 +0200
+++ libc/nptl/sysdeps/pthread/pthread_rwlock_timedwrlock.c 2005-08-18 13:37:49.000000000 +0200
@@ -24,7 +24,7 @@
#include <pthreadP.h>
-/* Try to acquire write lock for RWLOCK or return after specfied time. */
+/* Try to acquire write lock for RWLOCK or return after specified time. */
int
pthread_rwlock_timedwrlock (rwlock, abstime)
pthread_rwlock_t *rwlock;
--- libc/nptl/sysdeps/pthread/pthread_rwlock_timedrdlock.c.jj 2004-08-14 18:18:35.000000000 +0200
+++ libc/nptl/sysdeps/pthread/pthread_rwlock_timedrdlock.c 2005-08-18 13:37:49.000000000 +0200
@@ -24,7 +24,7 @@
#include <pthreadP.h>
-/* Try to acquire read lock for RWLOCK or return after specfied time. */
+/* Try to acquire read lock for RWLOCK or return after specified time. */
int
pthread_rwlock_timedrdlock (rwlock, abstime)
pthread_rwlock_t *rwlock;
--- libc/nptl/sysdeps/pthread/pthread_cond_wait.c.jj 2004-09-02 23:27:06.000000000 +0200
+++ libc/nptl/sysdeps/pthread/pthread_cond_wait.c 2005-08-18 13:37:49.000000000 +0200
@@ -164,7 +164,7 @@ __pthread_cond_wait (cond, mutex)
cond->__data.__nwaiters -= 1 << COND_CLOCK_BITS;
- /* If pthread_cond_destroy was called on this varaible already,
+ /* If pthread_cond_destroy was called on this variable already,
notify the pthread_cond_destroy caller all waiters have left
and it can be successfully destroyed. */
if (cond->__data.__total_seq == -1ULL
--- libc/nptl/sysdeps/powerpc/jmpbuf-unwind.h.jj 2004-09-04 09:16:52.000000000 +0200
+++ libc/nptl/sysdeps/powerpc/jmpbuf-unwind.h 2005-08-18 13:37:49.000000000 +0200
@@ -27,5 +27,5 @@
#define _JMPBUF_UNWINDS_ADJ(_jmpbuf, _address, _adj) \
((uintptr_t) (_address) - (_adj) < (uintptr_t) (_jmpbuf)[JB_GPR1] - (_adj))
-/* We use the normal lobngjmp for unwinding. */
+/* We use the normal longjmp for unwinding. */
#define __libc_unwind_longjmp(buf, val) __libc_longjmp (buf, val)
--- libc/nptl/sysdeps/sparc/sparc32/jmpbuf-unwind.h.jj 2004-09-04 09:16:52.000000000 +0200
+++ libc/nptl/sysdeps/sparc/sparc32/jmpbuf-unwind.h 2005-08-18 13:37:49.000000000 +0200
@@ -27,5 +27,5 @@
#define _JMPBUF_UNWINDS_ADJ(_jmpbuf, _address, _adj) \
((uintptr_t) (_address) - (_adj) < (uintptr_t) (_jmpbuf)[JB_SP] - (_adj))
-/* We use the normal lobngjmp for unwinding. */
+/* We use the normal longjmp for unwinding. */
#define __libc_unwind_longjmp(buf, val) __libc_longjmp (buf, val)
--- libc/nptl/sysdeps/sparc/sparc64/jmpbuf-unwind.h.jj 2005-04-14 23:35:10.000000000 +0200
+++ libc/nptl/sysdeps/sparc/sparc64/jmpbuf-unwind.h 2005-08-18 13:37:49.000000000 +0200
@@ -27,5 +27,5 @@
#define _JMPBUF_UNWINDS_ADJ(_jmpbuf, _address, _adj) \
((uintptr_t) (_address) - (_adj) < (uintptr_t) (_jmpbuf)[0].uc_mcontext.mc_fp - (_adj))
-/* We use the normal lobngjmp for unwinding. */
+/* We use the normal longjmp for unwinding. */
#define __libc_unwind_longjmp(buf, val) __libc_longjmp (buf, val)
--- libc/nptl/sysdeps/sh/jmpbuf-unwind.h.jj 2004-09-04 09:16:52.000000000 +0200
+++ libc/nptl/sysdeps/sh/jmpbuf-unwind.h 2005-08-18 13:37:49.000000000 +0200
@@ -27,5 +27,5 @@
#define _JMPBUF_UNWINDS_ADJ(jmpbuf, address, adj) \
((uintptr_t) (address) - (adj) < (uintptr_t) (jmpbuf)[0].__regs[7] - (adj))
-/* We use the normal lobngjmp for unwinding. */
+/* We use the normal longjmp for unwinding. */
#define __libc_unwind_longjmp(buf, val) __libc_longjmp (buf, val)
--- libc/nptl/sysdeps/i386/jmpbuf-unwind.h.jj 2004-09-04 09:16:51.000000000 +0200
+++ libc/nptl/sysdeps/i386/jmpbuf-unwind.h 2005-08-18 13:37:49.000000000 +0200
@@ -27,5 +27,5 @@
#define _JMPBUF_UNWINDS_ADJ(_jmpbuf, _address, _adj) \
((uintptr_t) (_address) - (_adj) < (uintptr_t) (_jmpbuf)[JB_SP] - (_adj))
-/* We use the normal lobngjmp for unwinding. */
+/* We use the normal longjmp for unwinding. */
#define __libc_unwind_longjmp(buf, val) __libc_longjmp (buf, val)
--- libc/nptl/sysdeps/x86_64/jmpbuf-unwind.h.jj 2004-09-04 09:16:55.000000000 +0200
+++ libc/nptl/sysdeps/x86_64/jmpbuf-unwind.h 2005-08-18 13:37:49.000000000 +0200
@@ -27,5 +27,5 @@
#define _JMPBUF_UNWINDS_ADJ(_jmpbuf, _address, _adj) \
((uintptr_t) (_address) - (_adj) < (uintptr_t) (_jmpbuf)[JB_RSP] - (_adj))
-/* We use the normal lobngjmp for unwinding. */
+/* We use the normal longjmp for unwinding. */
#define __libc_unwind_longjmp(buf, val) __libc_longjmp (buf, val)
--- libc/nptl/pthread_setschedparam.c.jj 2004-02-27 13:51:58.000000000 +0100
+++ libc/nptl/pthread_setschedparam.c 2005-08-18 13:37:49.000000000 +0200
@@ -40,7 +40,7 @@ __pthread_setschedparam (threadid, polic
int result = 0;
/* We have to handle cancellation in the following code since we are
- locking another threads desriptor. */
+ locking another threads descriptor. */
pthread_cleanup_push ((void (*) (void *)) lll_unlock_wake_cb, &pd->lock);
lll_lock (pd->lock);
--- libc/nptl/tst-kill4.c.jj 2003-02-21 21:27:54.000000000 +0100
+++ libc/nptl/tst-kill4.c 2005-08-18 13:37:48.000000000 +0200
@@ -52,7 +52,7 @@ do_test (void)
the implementation. Namely, that the memory allocated for the
thread descriptor is not going away, that the the TID field is
cleared and therefore the signal is sent to process 0, and that
- we can savely assume there is no other process with this ID at
+ we can safely assume there is no other process with this ID at
that time. */
int e = pthread_kill (th, 0);
if (e == 0)
--- libc/nptl/pthreadP.h.jj 2004-11-20 13:00:54.000000000 +0100
+++ libc/nptl/pthreadP.h 2005-08-18 13:37:49.000000000 +0200
@@ -231,7 +231,7 @@ extern void __deallocate_stack (struct p
function also re-initializes the lock for the stack cache. */
extern void __reclaim_stacks (void) attribute_hidden;
-/* Make all threads's stacks executable. */
+/* Make all threads' stacks executable. */
extern int __make_stacks_executable (void **stack_endp)
internal_function attribute_hidden;
--- libc/nptl/tst-signal3.c.jj 2004-03-08 12:01:48.000000000 +0100
+++ libc/nptl/tst-signal3.c 2005-08-18 13:37:49.000000000 +0200
@@ -26,7 +26,7 @@
#include <unistd.h>
-/* Number of different signalss to use. Also is the number of
+/* Number of different signals to use. Also is the number of
threads. */
#define N 10
/* Maximum number of threads in flight at any one time. */
--- libc/nptl/pthread_key_create.c.jj 2003-09-09 09:00:21.000000000 +0200
+++ libc/nptl/pthread_key_create.c 2005-08-18 13:37:48.000000000 +0200
@@ -34,7 +34,7 @@ __pthread_key_create (key, destr)
lll_lock (__pthread_keys_lock);
- /* Find a slot in __pthread_kyes which is unused. */
+ /* Find a slot in __pthread_keys which is unused. */
for (cnt = 0; cnt < PTHREAD_KEYS_MAX; ++cnt)
if (KEY_UNUSED (__pthread_keys[cnt].seq)
&& KEY_USABLE (__pthread_keys[cnt].seq))
--- libc/nptl/pthread_getattr_np.c.jj 2004-04-17 12:14:23.000000000 +0200
+++ libc/nptl/pthread_getattr_np.c 2005-08-18 13:37:48.000000000 +0200
@@ -40,13 +40,13 @@ pthread_getattr_np (thread_id, attr)
int ret = 0;
/* We have to handle cancellation in the following code since we are
- locking another threads desriptor. */
+ locking another threads descriptor. */
pthread_cleanup_push ((void (*) (void *)) lll_unlock_wake_cb, &thread->lock);
lll_lock (thread->lock);
/* The thread library is responsible for keeping the values in the
- thread desriptor up-to-date in case the user changes them. */
+ thread descriptor up-to-date in case the user changes them. */
memcpy (&iattr->schedparam, &thread->schedparam,
sizeof (struct sched_param));
iattr->schedpolicy = thread->schedpolicy;
--- libc/nptl/pthread_cond_destroy.c.jj 2004-09-04 09:25:00.000000000 +0200
+++ libc/nptl/pthread_cond_destroy.c 2005-08-18 13:37:49.000000000 +0200
@@ -40,7 +40,7 @@ __pthread_cond_destroy (cond)
/* Tell pthread_cond_*wait that this condvar is being destroyed. */
cond->__data.__total_seq = -1ULL;
- /* If there are waiters which have been already signalled or
+ /* If there are waiters which have been already signaled or
broadcasted, but still are using the pthread_cond_t structure,
pthread_cond_destroy needs to wait for them. */
unsigned int nwaiters = cond->__data.__nwaiters;
--- libc/debug/pcprofiledump.c.jj 2004-11-15 10:31:18.000000000 +0100
+++ libc/debug/pcprofiledump.c 2005-08-18 13:37:49.000000000 +0200
@@ -101,7 +101,7 @@ main (int argc, char *argv[])
}
/* Read the first 4-byte word. It contains the information about
- the word size and the endianess. */
+ the word size and the endianness. */
if (TEMP_FAILURE_RETRY (read (fd, &word, 4)) != 4)
error (EXIT_FAILURE, errno, _("cannot read header"));
--- libc/locale/programs/ld-monetary.c.jj 2003-11-26 09:25:06.000000000 +0100
+++ libc/locale/programs/ld-monetary.c 2005-08-18 13:37:49.000000000 +0200
@@ -88,7 +88,7 @@ struct locale_monetary_t
};
-/* The content iof the field int_curr_symbol has to be taken from
+/* The content of the field int_curr_symbol has to be taken from
ISO-4217. We test for correct values. */
#define DEFINE_INT_CURR(str) str,
static const char *const valid_int_curr[] =
--- libc/locale/programs/config.h.jj 2001-07-06 06:55:33.000000000 +0200
+++ libc/locale/programs/config.h 2005-08-18 13:37:49.000000000 +0200
@@ -38,7 +38,7 @@
# endif
#endif
-/* This must be one higer than the last used LC_xxx category value. */
+/* This must be one higher than the last used LC_xxx category value. */
#define __LC_LAST 13
#include_next <config.h>
--- libc/locale/programs/ld-ctype.c.jj 2004-04-13 10:42:52.000000000 +0200
+++ libc/locale/programs/ld-ctype.c 2005-08-18 13:37:49.000000000 +0200
@@ -2273,7 +2273,7 @@ ctype_read (struct linereader *ldfile, s
if (nowtok == tok_eof)
break;
- /* Ingore empty lines. */
+ /* Ignore empty lines. */
if (nowtok == tok_eol)
{
now = lr_token (ldfile, charmap, NULL, NULL, verbose);
--- libc/locale/programs/ld-collate.c.jj 2003-06-13 22:50:24.000000000 +0200
+++ libc/locale/programs/ld-collate.c 2005-08-18 13:37:49.000000000 +0200
@@ -1444,7 +1444,7 @@ order for `%.*s' already defined at %s:%
}
else
{
- /* Simly use the weight from `ellipsis_weight'. */
+ /* Simply use the weight from `ellipsis_weight'. */
elem->weights[cnt].w =
collate->ellipsis_weight.weights[cnt].w;
elem->weights[cnt].cnt =
@@ -1497,7 +1497,7 @@ collate_finish (struct localedef_t *loca
for the wide- and the multibyte-character symbols. This is done
since it might make a difference in the encoding if there is in
some cases no multibyte-character but there are wide-characters.
- (The other way around it is not important since theencoded
+ (The other way around it is not important since the encoded
collation value in the wide-character case is 32 bits wide and
therefore requires no encoding).
@@ -2097,7 +2097,7 @@ collate_output (struct localedef_t *loca
int32_t weightidx;
int added;
- /* Find out wether this is a single entry or we have more than
+ /* Find out whether this is a single entry or we have more than
one consecutive entry. */
if (runp->mbnext != NULL
&& runp->nmbs == runp->mbnext->nmbs
@@ -2142,7 +2142,7 @@ collate_output (struct localedef_t *loca
obstack_1grow_fast (&extrapool, curp->mbs[i]);
/* Now find the end of the consecutive sequence and
- add all the indeces in the indirect pool. */
+ add all the indices in the indirect pool. */
do
{
weightidx = output_weight (&weightpool, collate, curp);
@@ -2320,7 +2320,7 @@ collate_output (struct localedef_t *loca
int32_t weightidx;
int added;
- /* Find out wether this is a single entry or we have more than
+ /* Find out whether this is a single entry or we have more than
one consecutive entry. */
if (runp->wcnext != NULL
&& runp->nwcs == runp->wcnext->nwcs
@@ -2363,7 +2363,7 @@ collate_output (struct localedef_t *loca
obstack_int32_grow_fast (&extrapool, curp->wcs[i]);
/* Now find the end of the consecutive sequence and
- add all the indeces in the indirect pool. */
+ add all the indices in the indirect pool. */
do
{
weightidx = output_weightwc (&weightpool, collate,
@@ -2693,7 +2693,7 @@ collate_read (struct linereader *ldfile,
if (nowtok == tok_eof)
break;
- /* Ingore empty lines. */
+ /* Ignore empty lines. */
if (nowtok == tok_eol)
{
now = lr_token (ldfile, charmap, result, NULL, verbose);
--- libc/locale/programs/ld-telephone.c.jj 2002-04-18 09:54:00.000000000 +0200
+++ libc/locale/programs/ld-telephone.c 2005-08-18 13:37:49.000000000 +0200
@@ -262,7 +262,7 @@ telephone_read (struct linereader *ldfil
if (nowtok == tok_eof)
break;
- /* Ingore empty lines. */
+ /* Ignore empty lines. */
if (nowtok == tok_eol)
{
now = lr_token (ldfile, charmap, result, NULL, verbose);
--- libc/locale/programs/ld-paper.c.jj 2002-04-18 09:54:00.000000000 +0200
+++ libc/locale/programs/ld-paper.c 2005-08-18 13:37:49.000000000 +0200
@@ -198,7 +198,7 @@ paper_read (struct linereader *ldfile, s
if (nowtok == tok_eof)
break;
- /* Ingore empty lines. */
+ /* Ignore empty lines. */
if (nowtok == tok_eol)
{
now = lr_token (ldfile, charmap, result, NULL, verbose);
--- libc/locale/programs/ld-time.c.jj 2004-04-13 10:42:52.000000000 +0200
+++ libc/locale/programs/ld-time.c 2005-08-18 13:37:49.000000000 +0200
@@ -958,7 +958,7 @@ time_read (struct linereader *ldfile, st
if (nowtok == tok_eof)
break;
- /* Ingore empty lines. */
+ /* Ignore empty lines. */
if (nowtok == tok_eol)
{
now = lr_token (ldfile, charmap, result, repertoire, verbose);
--- libc/locale/programs/simple-hash.c.jj 2002-07-24 12:41:06.000000000 +0200
+++ libc/locale/programs/simple-hash.c 2005-08-18 13:37:49.000000000 +0200
@@ -262,7 +262,7 @@ lookup (htab, key, keylen, hval)
size_t idx;
hash_entry *table = (hash_entry *) htab->table;
- /* First hash function: simply take the modul but prevent zero. */
+ /* First hash function: simply take the modulo but prevent zero. */
hash = 1 + hval % htab->size;
idx = hash;
--- libc/locale/programs/ld-measurement.c.jj 2002-12-20 11:26:19.000000000 +0100
+++ libc/locale/programs/ld-measurement.c 2005-08-18 13:37:49.000000000 +0200
@@ -195,7 +195,7 @@ measurement_read (struct linereader *ldf
if (nowtok == tok_eof)
break;
- /* Ingore empty lines. */
+ /* Ignore empty lines. */
if (nowtok == tok_eol)
{
now = lr_token (ldfile, charmap, result, NULL, verbose);
--- libc/locale/programs/ld-numeric.c.jj 2002-04-18 09:54:00.000000000 +0200
+++ libc/locale/programs/ld-numeric.c 2005-08-18 13:37:49.000000000 +0200
@@ -236,7 +236,7 @@ numeric_read (struct linereader *ldfile,
if (nowtok == tok_eof)
break;
- /* Ingore empty lines. */
+ /* Ignore empty lines. */
if (nowtok == tok_eol)
{
now = lr_token (ldfile, charmap, result, NULL, verbose);
--- libc/locale/programs/linereader.c.jj 2005-02-21 17:19:49.000000000 +0100
+++ libc/locale/programs/linereader.c 2005-08-18 13:37:49.000000000 +0200
@@ -657,7 +657,7 @@ get_string (struct linereader *lr, const
if (ch != '<')
{
/* The standards leave it up to the implementation to decide
- what to do with character which stand for themself. We
+ what to do with character which stand for themselves. We
could jump through hoops to find out the value relative to
the charmap and the repertoire map, but instead we leave
it up to the locale definition author to write a better
--- libc/locale/localeinfo.h.jj 2004-08-14 18:18:32.000000000 +0200
+++ libc/locale/localeinfo.h 2005-08-18 13:37:49.000000000 +0200
@@ -191,7 +191,7 @@ extern struct __locale_struct _nl_global
__libc_tsd_define (extern, LOCALE)
-/* For static linking it is desireable to avoid always linking in the code
+/* For static linking it is desirable to avoid always linking in the code
and data for every category when we can tell at link time that they are
unused. We can manage this playing some tricks with weak references.
But with thread-local locale settings, it becomes quite ungainly unless
--- libc/libio/wfiledoalloc.c.jj 2002-07-06 08:35:54.000000000 +0200
+++ libc/libio/wfiledoalloc.c 2005-08-18 13:37:49.000000000 +0200
@@ -98,7 +98,7 @@ _IO_wfile_doallocate (fp)
couldbetty = 0;
size = _IO_BUFSIZ;
#if 0
- /* do not try to optimise fseek() */
+ /* do not try to optimize fseek() */
fp->_flags |= __SNPT;
#endif
}
--- libc/libio/ioftell.c.jj 2004-11-09 12:26:43.000000000 +0100
+++ libc/libio/ioftell.c 2005-08-18 13:37:49.000000000 +0200
@@ -29,7 +29,7 @@
#include "libioP.h"
#include <stdlib.h>
#include <errno.h>
-/* ANSI explicily requires setting errno to a positive value on failure. */
+/* ANSI explicitly requires setting errno to a positive value on failure. */
long int
_IO_ftell (fp)
--- libc/libio/genops.c.jj 2004-09-16 11:35:19.000000000 +0200
+++ libc/libio/genops.c 2005-08-18 13:37:49.000000000 +0200
@@ -37,7 +37,7 @@
static _IO_lock_t list_all_lock = _IO_lock_initializer;
#endif
-/* Used to signal modifications to the list of FILE decriptors. */
+/* Used to signal modifications to the list of FILE descriptors. */
static int _IO_list_all_stamp;
--- libc/libio/libio.h.jj 2005-02-21 17:19:40.000000000 +0100
+++ libc/libio/libio.h 2005-08-18 13:37:50.000000000 +0200
@@ -123,14 +123,14 @@
#define _IO_USER_BUF 1 /* User owns buffer; don't delete it on close. */
#define _IO_UNBUFFERED 2
#define _IO_NO_READS 4 /* Reading not allowed */
-#define _IO_NO_WRITES 8 /* Writing not allowd */
+#define _IO_NO_WRITES 8 /* Writing not allowed */
#define _IO_EOF_SEEN 0x10
#define _IO_ERR_SEEN 0x20
#define _IO_DELETE_DONT_CLOSE 0x40 /* Don't call close(_fileno) on cleanup. */
#define _IO_LINKED 0x80 /* Set if linked (using _chain) to streambuf::_list_all.*/
#define _IO_IN_BACKUP 0x100
#define _IO_LINE_BUF 0x200
-#define _IO_TIED_PUT_GET 0x400 /* Set if put and get pointer logicly tied. */
+#define _IO_TIED_PUT_GET 0x400 /* Set if put and get pointer logically tied. */
#define _IO_CURRENTLY_PUTTING 0x800
#define _IO_IS_APPENDING 0x1000
#define _IO_IS_FILEBUF 0x2000
--- libc/libio/fmemopen.c.jj 2005-02-07 10:20:58.000000000 +0100
+++ libc/libio/fmemopen.c 2005-08-18 13:37:50.000000000 +0200
@@ -34,7 +34,7 @@
* - I never used the "original" fmemopen(). I am sure that "my"
* fmemopen() behaves differently than the original version.
*
- * - The documentation doesn't say wether a string stream allows
+ * - The documentation doesn't say whether a string stream allows
* seeks. I checked the old fmemopen implementation in glibc's stdio
* directory, wasn't quite able to see what is going on in that
* source, but as far as I understand there was no seek there. For
--- libc/stdio-common/vfscanf.c.jj 2005-04-27 14:03:55.000000000 +0200
+++ libc/stdio-common/vfscanf.c 2005-08-18 13:37:50.000000000 +0200
@@ -591,7 +591,7 @@ _IO_vfscanf (s, format, argptr, errp)
/* We have a severe problem here. The ISO C standard
contradicts itself in explaining the effect of the %n
format in `scanf'. While in ISO C:1990 and the ISO C
- Amendement 1:1995 the result is described as
+ Amendment 1:1995 the result is described as
Execution of a %n directive does not effect the
assignment count returned at the completion of
@@ -2183,7 +2183,7 @@ _IO_vfscanf (s, format, argptr, errp)
#endif
if (now == read_in)
- /* We haven't succesfully read any character. */
+ /* We haven't successfully read any character. */
conv_error ();
if (!(flags & SUPPRESS))
@@ -2367,7 +2367,7 @@ _IO_vfscanf (s, format, argptr, errp)
#endif
if (now == read_in)
- /* We haven't succesfully read any character. */
+ /* We haven't successfully read any character. */
conv_error ();
if (!(flags & SUPPRESS))
--- libc/stdio-common/vfprintf.c.jj 2004-11-19 13:38:51.000000000 +0100
+++ libc/stdio-common/vfprintf.c 2005-08-18 13:37:50.000000000 +0200
@@ -1080,7 +1080,7 @@ vfprintf (FILE *s, const CHAR_T *format,
&mbstate); \
if (len == (size_t) -1) \
{ \
- /* Something went wron gduring the conversion. Bail out. */ \
+ /* Something went wrong during the conversion. Bail out. */ \
done = -1; \
goto all_done; \
} \
@@ -1135,7 +1135,7 @@ vfprintf (FILE *s, const CHAR_T *format,
else \
{ \
/* In case we have a multibyte character set the \
- situation is more compilcated. We must not copy \
+ situation is more complicated. We must not copy \
bytes at the end which form an incomplete character. */\
wchar_t ignore[prec]; \
const char *str2 = string; \
--- libc/stdio-common/printf_fp.c.jj 2004-08-04 14:42:24.000000000 +0200
+++ libc/stdio-common/printf_fp.c 2005-08-18 13:37:50.000000000 +0200
@@ -169,7 +169,7 @@ __printf_fp (FILE *fp,
/* We need to shift the contents of fp_input by this amount of bits. */
int to_shift = 0;
- /* The fraction of the floting-point value in question */
+ /* The fraction of the floating-point value in question */
MPN_VAR(frac);
/* and the exponent. */
int exponent;
@@ -1117,7 +1117,7 @@ __printf_fp (FILE *fp,
/* Now copy the wide character string. Since the character
(except for the decimal point and thousands separator) must
- be coming from the ASCII range we can esily convert the
+ be coming from the ASCII range we can easily convert the
string without mapping tables. */
for (cp = buffer, copywc = wstartp; copywc < wcp; ++copywc)
if (*copywc == decimalwc)
--- libc/gmon/mcount.c.jj 2003-03-21 08:45:54.000000000 +0100
+++ libc/gmon/mcount.c 2005-08-18 13:37:50.000000000 +0200
@@ -87,7 +87,7 @@ _MCOUNT_DECL(frompc, selfpc) /* _mcount;
But we can simplify this if we assume the profiling data
is always initialized by the functions in gmon.c. But
then it is possible to avoid a runtime check and use the
- smae `if' as in gmon.c. So keep these tests in sync. */
+ same `if' as in gmon.c. So keep these tests in sync. */
if ((HASHFRACTION & (HASHFRACTION - 1)) == 0) {
/* avoid integer divide if possible: */
i = frompc >> p->log_hashfraction;
--- libc/include/libc-symbols.h.jj 2005-07-20 10:32:43.000000000 +0200
+++ libc/include/libc-symbols.h 2005-08-18 13:37:50.000000000 +0200
@@ -401,7 +401,7 @@ for linking")
# endif /* ELF. */
#else
-/* We cannot do anything in generial. */
+/* We cannot do anything in general. */
# define text_set_element(set, symbol) asm ("")
# define data_set_element(set, symbol) asm ("")
# define bss_set_element(set, symbol) asm ("")
@@ -524,7 +524,7 @@ for linking")
}
libc_hidden_weak (foo)
- Simularly for global data. If references to foo within libc.so should
+ Similarly for global data. If references to foo within libc.so should
always go to foo defined in libc.so, then in include/foo.h you add:
libc_hidden_proto (foo)
--- libc/time/getdate.c.jj 2003-09-14 20:13:44.000000000 +0200
+++ libc/time/getdate.c 2005-08-18 13:37:50.000000000 +0200
@@ -41,7 +41,7 @@ static int check_mday (int year, int mon
3 failed to get file status information,
4 the template file is not a regular file,
5 an error is encountered while reading the template file,
- 6 memory allication failed (not enough memory available),
+ 6 memory allocation failed (not enough memory available),
7 there is no line in the template that matches the input,
8 invalid input specification Example: February 31 or a time is
specified that can not be represented in a time_t (representing
--- libc/time/time.h.jj 2003-04-19 18:48:35.000000000 +0200
+++ libc/time/time.h 2005-08-18 13:56:43.000000000 +0200
@@ -357,12 +357,12 @@ extern int timer_create (clockid_t __clo
/* Delete timer TIMERID. */
extern int timer_delete (timer_t __timerid) __THROW;
-/* Set timer TIMERID to VALUE, returning old value in OVLAUE. */
+/* Set timer TIMERID to VALUE, returning old value in OVALUE. */
extern int timer_settime (timer_t __timerid, int __flags,
__const struct itimerspec *__restrict __value,
struct itimerspec *__restrict __ovalue) __THROW;
-/* Get current value of timer TIMERID and store it in VLAUE. */
+/* Get current value of timer TIMERID and store it in VALUE. */
extern int timer_gettime (timer_t __timerid, struct itimerspec *__value)
__THROW;
@@ -378,7 +378,7 @@ extern int timer_getoverrun (timer_t __t
3 failed to get file status information,
4 the template file is not a regular file,
5 an error is encountered while reading the template file,
- 6 memory allication failed (not enough memory available),
+ 6 memory allocation failed (not enough memory available),
7 there is no line in the template that matches the input,
8 invalid input specification Example: February 31 or a time is
specified that can not be represented in a time_t (representing
--- libc/time/tzfile.c.jj 2004-11-20 21:27:50.000000000 +0100
+++ libc/time/tzfile.c 2005-08-18 13:37:50.000000000 +0200
@@ -115,7 +115,7 @@ __tzfile_read (const char *file, size_t
{
/* We must not allow to read an arbitrary file in a setuid
program. So we fail for any file which is not in the
- directory hierachy starting at TZDIR
+ directory hierarchy starting at TZDIR
and which is not the system wide default TZDEFAULT. */
if (__libc_enable_secure
&& ((*file == '/'
--- libc/time/mktime.c.jj 2005-06-22 18:34:27.000000000 +0200
+++ libc/time/mktime.c 2005-08-18 13:37:50.000000000 +0200
@@ -351,7 +351,7 @@ __mktime_internal (struct tm *tp,
int diff = approx_biennia - approx_requested_biennia;
int abs_diff = diff < 0 ? - diff : diff;
- /* IRIX 4.0.5 cc miscaculates TIME_T_MIN / 3: it erroneously
+ /* IRIX 4.0.5 cc miscalculates TIME_T_MIN / 3: it erroneously
gives a positive value of 715827882. Setting a variable
first then doing math on it seems to work.
(ghazi@caip.rutgers.edu) */
--- libc/resolv/ns_name.c.jj 2004-10-18 10:20:56.000000000 +0200
+++ libc/resolv/ns_name.c 2005-08-18 13:57:09.000000000 +0200
@@ -637,7 +637,7 @@ ns_name_skip(const u_char **ptrptr, cons
/*
* special(ch)
* Thinking in noninternationalized USASCII (per the DNS spec),
- * is this characted special ("in need of quoting") ?
+ * is this character special ("in need of quoting") ?
* return:
* boolean.
*/
--- libc/resolv/gai_misc.c.jj 2002-11-01 21:43:55.000000000 +0100
+++ libc/resolv/gai_misc.c 2005-08-18 13:37:50.000000000 +0200
@@ -57,11 +57,11 @@ static int idle_thread_count;
/* These are the values used for optimization. We will probably
- create a funcion to set these values. */
+ create a function to set these values. */
static struct gaiinit optim =
{
20, /* int gai_threads; Maximal number of threads. */
- 64, /* int gai_num; Number of expected simultanious requests. */
+ 64, /* int gai_num; Number of expected simultaneous requests. */
0,
0,
0,
--- libc/resolv/gai_misc.h.jj 2001-07-06 06:55:39.000000000 +0200
+++ libc/resolv/gai_misc.h 2005-08-18 13:37:50.000000000 +0200
@@ -58,7 +58,7 @@ struct requestlist
struct gaiinit
{
int gai_threads; /* Maximal number of threads. */
- int gai_num; /* Number of expected simultanious requests. */
+ int gai_num; /* Number of expected simultaneous requests. */
int gai_locks; /* Not used. */
int gai_usedba; /* Not used. */
int gai_debug; /* Not used. */
--- libc/resolv/res_send.c.jj 2005-07-11 09:51:15.000000000 +0200
+++ libc/resolv/res_send.c 2005-08-18 13:37:50.000000000 +0200
@@ -757,7 +757,7 @@ send_vc(res_state statp,
}
if (truncating) {
/*
- * Flush rest of answer so connection stays in synch.
+ * Flush rest of answer so connection stays in sync.
*/
anhp->tc = 1;
len = resplen - anssiz;
@@ -773,7 +773,7 @@ send_vc(res_state statp,
}
}
/*
- * If the calling applicating has bailed out of
+ * If the calling application has bailed out of
* a previous call and failed to arrange to have
* the circuit closed or the server has got
* itself confused, then drop the packet and
--- libc/resolv/resolv.h.jj 2004-09-16 11:35:28.000000000 +0200
+++ libc/resolv/resolv.h 2005-08-18 13:37:50.000000000 +0200
@@ -162,7 +162,7 @@ typedef struct __res_state *res_state;
/*
* Resolver configuration file.
* Normally not present, but may contain the address of the
- * inital name server(s) to query and the domain search list.
+ * initial name server(s) to query and the domain search list.
*/
#ifndef _PATH_RESCONF
@@ -185,14 +185,14 @@ struct res_sym {
#define RES_EXHAUSTIVE 0x00000001 /* always do all queries */
/*
- * Resolver options (keep these in synch with res_debug.c, please)
+ * Resolver options (keep these in sync with res_debug.c, please)
*/
#define RES_INIT 0x00000001 /* address initialized */
#define RES_DEBUG 0x00000002 /* print debug messages */
#define RES_AAONLY 0x00000004 /* authoritative answers only (!IMPL)*/
#define RES_USEVC 0x00000008 /* use virtual circuit */
#define RES_PRIMARY 0x00000010 /* query primary server only (!IMPL) */
-#define RES_IGNTC 0x00000020 /* ignore trucation errors */
+#define RES_IGNTC 0x00000020 /* ignore truncation errors */
#define RES_RECURSE 0x00000040 /* recursion desired */
#define RES_DEFNAMES 0x00000080 /* use default domain name */
#define RES_STAYOPEN 0x00000100 /* Keep TCP socket open */
--- libc/resolv/res_init.c.jj 2004-10-12 15:51:58.000000000 +0200
+++ libc/resolv/res_init.c 2005-08-18 13:37:50.000000000 +0200
@@ -119,7 +119,7 @@ unsigned long long int __res_initstamp a
* there will have precedence. Otherwise, the server address is set to
* INADDR_ANY and the default domain name comes from the gethostname().
*
- * An interrim version of this code (BIND 4.9, pre-4.4BSD) used 127.0.0.1
+ * An interim version of this code (BIND 4.9, pre-4.4BSD) used 127.0.0.1
* rather than INADDR_ANY ("0.0.0.0") as the default name server address
* since it was noted that INADDR_ANY actually meant ``the first interface
* you "ifconfig"'d at boot time'' and if this was a SLIP or PPP interface,
@@ -145,7 +145,7 @@ res_ninit(res_state statp) {
libc_hidden_def (__res_ninit)
#endif
-/* This function has to be reachable by res_data.c but not publically. */
+/* This function has to be reachable by res_data.c but not publicly. */
int
__res_vinit(res_state statp, int preinit) {
register FILE *fp;
--- libc/resolv/arpa/nameser.h.jj 2004-09-16 11:35:28.000000000 +0200
+++ libc/resolv/arpa/nameser.h 2005-08-18 13:57:31.000000000 +0200
@@ -91,7 +91,7 @@
/*
* These can be expanded with synonyms, just keep ns_parse.c:ns_parserecord()
- * in synch with it.
+ * in sync with it.
*/
typedef enum __ns_sect {
ns_s_qd = 0, /* Query: Question. */
@@ -156,7 +156,7 @@ typedef struct __ns_rr {
/*
* These don't have to be in the same order as in the packet flags word,
* and they can even overlap in some cases, but they will need to be kept
- * in synch with ns_parse.c:ns_flagdata[].
+ * in sync with ns_parse.c:ns_flagdata[].
*/
typedef enum __ns_flag {
ns_f_qr, /* Question/Response. */
@@ -289,7 +289,7 @@ typedef enum __ns_type {
ns_t_cert = 37, /* Certification record */
ns_t_a6 = 38, /* IPv6 address (deprecates AAAA) */
ns_t_dname = 39, /* Non-terminal DNAME (for IPv6) */
- ns_t_sink = 40, /* Kitchen sink (experimentatl) */
+ ns_t_sink = 40, /* Kitchen sink (experimental) */
ns_t_opt = 41, /* EDNS0 option (meta-RR) */
ns_t_tsig = 250, /* Transaction signature. */
ns_t_ixfr = 251, /* Incremental zone transfer. */
--- libc/libidn/stringprep.c.jj 2004-05-07 14:32:10.000000000 +0200
+++ libc/libidn/stringprep.c 2005-08-18 13:57:49.000000000 +0200
@@ -328,7 +328,7 @@ stringprep_4zi (uint32_t * ucs4, size_t
/**
* stringprep:
- * @in: input/ouput array with string to prepare.
+ * @in: input/output array with string to prepare.
* @maxlen: maximum length of input/output array.
* @flags: stringprep profile flags, or 0.
* @profile: pointer to stringprep profile to use.
@@ -480,7 +480,7 @@ stringprep_profile (const char *in,
* package is available under the GNU Lesser General Public License.
*
* The library contains a generic Stringprep implementation that does
- * Unicode 3.2 NFKC normalization, mapping and prohibitation of
+ * Unicode 3.2 NFKC normalization, mapping and prohibition of
* characters, and bidirectional character handling. Profiles for
* Nameprep, iSCSI, SASL and XMPP are included. Punycode and ASCII
* Compatible Encoding (ACE) via IDNA are supported. A mechanism to
@@ -615,7 +615,7 @@ stringprep_profile (const char *in,
/**
* stringprep_nameprep:
- * @in: input/ouput array with string to prepare.
+ * @in: input/output array with string to prepare.
* @maxlen: maximum length of input/output array.
*
* Prepare the input UTF-8 string according to the nameprep profile.
@@ -626,7 +626,7 @@ stringprep_profile (const char *in,
/**
* stringprep_nameprep_no_unassigned:
- * @in: input/ouput array with string to prepare.
+ * @in: input/output array with string to prepare.
* @maxlen: maximum length of input/output array.
*
* Prepare the input UTF-8 string according to the nameprep profile.
@@ -636,7 +636,7 @@ stringprep_profile (const char *in,
/**
* stringprep_iscsi:
- * @in: input/ouput array with string to prepare.
+ * @in: input/output array with string to prepare.
* @maxlen: maximum length of input/output array.
*
* Prepare the input UTF-8 string according to the draft iSCSI
@@ -645,7 +645,7 @@ stringprep_profile (const char *in,
/**
* stringprep_plain:
- * @in: input/ouput array with string to prepare.
+ * @in: input/output array with string to prepare.
* @maxlen: maximum length of input/output array.
*
* Prepare the input UTF-8 string according to the draft SASL
@@ -654,7 +654,7 @@ stringprep_profile (const char *in,
/**
* stringprep_xmpp_nodeprep:
- * @in: input/ouput array with string to prepare.
+ * @in: input/output array with string to prepare.
* @maxlen: maximum length of input/output array.
*
* Prepare the input UTF-8 string according to the draft XMPP node
@@ -663,7 +663,7 @@ stringprep_profile (const char *in,
/**
* stringprep_xmpp_resourceprep:
- * @in: input/ouput array with string to prepare.
+ * @in: input/output array with string to prepare.
* @maxlen: maximum length of input/output array.
*
* Prepare the input UTF-8 string according to the draft XMPP resource
--- libc/libidn/idna.c.jj 2004-05-25 18:35:39.000000000 +0200
+++ libc/libidn/idna.c 2005-08-18 13:37:50.000000000 +0200
@@ -51,7 +51,7 @@
* It is important to note that the ToASCII operation can fail. ToASCII
* fails if any step of it fails. If any step of the ToASCII operation
* fails on any label in a domain name, that domain name MUST NOT be used
- * as an internationalized domain name. The method for deadling with this
+ * as an internationalized domain name. The method for dealing with this
* failure is application-specific.
*
* The inputs to ToASCII are a sequence of code points, the AllowUnassigned
--- libc/libidn/nfkc.c.jj 2004-03-08 04:54:02.000000000 +0100
+++ libc/libidn/nfkc.c 2005-08-18 13:37:50.000000000 +0200
@@ -426,7 +426,7 @@ g_utf8_to_ucs4_fast (const gchar * str,
* @items_written: location to store number of bytes written or %NULL.
* The value here stored does not include the trailing 0
* byte.
- * @error: location to store the error occuring, or %NULL to ignore
+ * @error: location to store the error occurring, or %NULL to ignore
* errors. Any of the errors in #GConvertError other than
* %G_CONVERT_ERROR_NO_CONVERSION may occur.
*
--- libc/libidn/iconvme.c.jj 2005-03-15 23:27:14.000000000 +0100
+++ libc/libidn/iconvme.c 2005-08-18 13:37:50.000000000 +0200
@@ -51,7 +51,7 @@
/* Convert a zero-terminated string STR from the FROM_CODSET code set
to the TO_CODESET code set. The returned string is allocated using
- malloc, and must be dellocated by the caller using free. On
+ malloc, and must be deallocated by the caller using free. On
failure, NULL is returned and errno holds the error reason. Note
that if TO_CODESET uses \0 for anything but to terminate the
string, the caller of this function may have difficulties finding
--- libc/misc/search.h.jj 2001-07-06 06:55:36.000000000 +0200
+++ libc/misc/search.h 2005-08-18 13:37:50.000000000 +0200
@@ -79,7 +79,7 @@ struct _ENTRY;
/* Family of hash table handling functions. The functions also
have reentrant counterparts ending with _r. The non-reentrant
- functions all work on a signle internal hashing table. */
+ functions all work on a single internal hashing table. */
/* Search for entry matching ITEM.key in internal hash table. If
ACTION is `FIND' return found entry or signal error by returning
--- libc/misc/regexp.h.jj 2004-05-25 18:35:43.000000000 +0200
+++ libc/misc/regexp.h 2005-08-18 13:37:50.000000000 +0200
@@ -22,7 +22,7 @@
/* The contents of this header file was first standardized in X/Open
System Interface and Headers Issue 2, originally coming from SysV.
- In issue 4, version 2, it is marked as TO BE WITDRAWN, and it has
+ In issue 4, version 2, it is marked as TO BE WITHDRAWN, and it has
been withdrawn in SUSv3.
This code shouldn't be used in any newly written code. It is
--- libc/misc/hsearch_r.c.jj 2002-08-04 05:50:05.000000000 +0200
+++ libc/misc/hsearch_r.c 2005-08-18 13:37:50.000000000 +0200
@@ -154,7 +154,7 @@ hsearch_r (item, action, retval, htab)
hval += item.key[count];
}
- /* First hash function: simply take the modul but prevent zero. */
+ /* First hash function: simply take the modulo but prevent zero. */
hval %= htab->size;
if (hval == 0)
++hval;
@@ -180,7 +180,7 @@ hsearch_r (item, action, retval, htab)
do
{
/* Because SIZE is prime this guarantees to step through all
- available indeces. */
+ available indices. */
if (idx <= hval2)
idx = htab->size + idx - hval2;
else
--- libc/string/string.h.jj 2004-10-18 10:20:59.000000000 +0200
+++ libc/string/string.h 2005-08-18 13:37:50.000000000 +0200
@@ -114,7 +114,7 @@ __END_NAMESPACE_STD
#ifdef __USE_GNU
/* The following functions are equivalent to the both above but they
take the locale they use for the collation as an extra argument.
- This is not standardsized but something like will come. */
+ This is not standardized but something like will come. */
# include <xlocale.h>
/* Compare the collated forms of S1 and S2 using rules from L. */
--- libc/string/bits/string2.h.jj 2004-06-11 14:55:23.000000000 +0200
+++ libc/string/bits/string2.h 2005-08-18 13:37:50.000000000 +0200
@@ -1,4 +1,4 @@
-/* Machine-independant string function optimizations.
+/* Machine-independent string function optimizations.
Copyright (C) 1997-2003, 2004 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by Ulrich Drepper <drepper@cygnus.com>, 1997.
@@ -48,7 +48,7 @@
#endif
#if _STRING_ARCH_unaligned
-/* If we can do unaligned memory accesses we must know the endianess. */
+/* If we can do unaligned memory accesses we must know the endianness. */
# include <endian.h>
# include <bits/types.h>
--- libc/string/strxfrm_l.c.jj 2004-03-15 09:13:15.000000000 +0100
+++ libc/string/strxfrm_l.c 2005-08-18 13:58:20.000000000 +0200
@@ -140,7 +140,7 @@ STRXFRM (STRING_TYPE *dest, const STRING
}
/* We need the elements of the string as unsigned values since they
- are used as indeces. */
+ are used as indices. */
usrc = (const USTRING_TYPE *) src;
/* Perform the first pass over the string and while doing this find
@@ -158,7 +158,7 @@ STRXFRM (STRING_TYPE *dest, const STRING
/* No memory. Well, go with the stack then.
XXX Once this implementation is stable we will handle this
- differently. Instead of precomputing the indeces we will
+ differently. Instead of precomputing the indices we will
do this in time. This means, though, that this happens for
every pass again. */
goto try_stack;
@@ -186,7 +186,7 @@ STRXFRM (STRING_TYPE *dest, const STRING
another value which then is ignored. */
rulearr[idxmax] = '\0';
- /* Now the passes over the weights. We now use the indeces we found
+ /* Now the passes over the weights. We now use the indices we found
before. */
needed = 0;
for (pass = 0; pass < nrules; ++pass)
--- libc/string/strcoll_l.c.jj 2004-03-15 09:13:15.000000000 +0100
+++ libc/string/strcoll_l.c 2005-08-18 13:58:42.000000000 +0200
@@ -115,7 +115,7 @@ STRCOLL (s1, s2, l)
return (s1len != 0) - (s2len != 0);
/* We need the elements of the strings as unsigned values since they
- are used as indeces. */
+ are used as indices. */
us1 = (const USTRING_TYPE *) s1;
us2 = (const USTRING_TYPE *) s2;
@@ -139,7 +139,7 @@ STRCOLL (s1, s2, l)
/* No memory. Well, go with the stack then.
XXX Once this implementation is stable we will handle this
- differently. Instead of precomputing the indeces we will
+ differently. Instead of precomputing the indices we will
do this in time. This means, though, that this happens for
every pass again. */
goto try_stack;
@@ -338,7 +338,7 @@ STRCOLL (s1, s2, l)
}
/* Now the remaining passes over the weights. We now use the
- indeces we found before. */
+ indices we found before. */
for (pass = 1; pass < nrules; ++pass)
{
/* We assume that if a rule has defined `position' in one section
--- libc/string/strverscmp.c.jj 2002-08-04 11:14:35.000000000 +0200
+++ libc/string/strverscmp.c 2005-08-18 13:37:50.000000000 +0200
@@ -22,7 +22,7 @@
#include <ctype.h>
/* states: S_N: normal, S_I: comparing integral part, S_F: comparing
- fractionnal parts, S_Z: idem but with leading Zeroes only */
+ fractional parts, S_Z: idem but with leading Zeroes only */
#define S_N 0x0
#define S_I 0x4
#define S_F 0x8
--- libc/nss/makedb.c.jj 2004-05-18 10:52:25.000000000 +0200
+++ libc/nss/makedb.c 2005-08-18 13:37:50.000000000 +0200
@@ -136,7 +136,7 @@ main (int argc, char *argv[])
output_name = argv[remaining];
}
- /* First load the shared object to initialize version dependend
+ /* First load the shared object to initialize version dependent
variables. */
if (load_db () != NSS_STATUS_SUCCESS)
error (EXIT_FAILURE, 0, gettext ("No usable database library found."));
--- libc/nss/nss_db/db-open.c.jj 2001-07-06 06:55:38.000000000 +0200
+++ libc/nss/nss_db/db-open.c 2005-08-18 13:37:50.000000000 +0200
@@ -202,7 +202,7 @@ unload_db (void)
}
}
-/* Open the database stored in FILE. If succesful, store the database
+/* Open the database stored in FILE. If successful, store the database
handle in *DBP and return NSS_STATUS_SUCCESS. On failure, return
the appropriate lookup status. */
enum nss_status
@@ -297,7 +297,7 @@ db_cursor (void *db, void *txn, NSS_DBC
/* Open the database in FNAME, for access specified by FLAGS. If
opening the database causes the file FNAME to be created, it is
- created with MODE. If succesful, store the database handle in *DBP
+ created with MODE. If successful, store the database handle in *DBP
and return NSS_STATUS_SUCCESS. On failure, return the appropriate
lookup status. */
int
--- libc/nss/nss_db/dummy-db.h.jj 2001-07-06 06:55:38.000000000 +0200
+++ libc/nss/nss_db/dummy-db.h 2005-08-18 13:37:50.000000000 +0200
@@ -119,7 +119,7 @@ struct dbc24
void *c_put;
};
-/* The 2.7 release is slighty different. */
+/* The 2.7 release is slightly different. */
/* Access methods from version 2.7. */
#define DB27_FIRST 7
--- libc/nss/nss_db/nss_db.h.jj 2001-07-06 06:55:38.000000000 +0200
+++ libc/nss/nss_db/nss_db.h 2005-08-18 13:37:50.000000000 +0200
@@ -71,7 +71,7 @@ typedef struct
int (*put) (void *, void *, DBT *, DBT *, uint32_t);
} NSS_DB;
-/* Open the database stored in FILE. If succesful, store the database
+/* Open the database stored in FILE. If successful, store the database
handle in *DBP and return NSS_STATUS_SUCCESS. On failure, return
the appropriate lookup status. */
extern enum nss_status internal_setent (const char *file, NSS_DB **dbp);
@@ -86,7 +86,7 @@ extern enum nss_status load_db (void);
/* Open the database in FNAME, for access specified by FLAGS. If
opening the database causes the file FNAME to be created, it is
- created with MODE. If succesful, store the database handle in *DBP
+ created with MODE. If successful, store the database handle in *DBP
and return NSS_STATUS_SUCCESS. On failure, return the appropriate
lookup status. */
extern int dbopen (const char *fname, int oper, int mode, NSS_DB **dbp);
--- libc/nss/nss_files/files-network.c.jj 2004-11-23 21:42:29.000000000 +0100
+++ libc/nss/nss_files/files-network.c 2005-08-18 13:37:50.000000000 +0200
@@ -41,7 +41,7 @@ LINE_PARSER
STRING_FIELD (addr, isspace, 1);
/* 'inet_network' does not add zeroes at the end if the network number
- does not four byte values. We add them outselves if necessary. */
+ does not four byte values. We add them ourselves if necessary. */
cp = strchr (addr, '.');
if (cp != NULL)
{
--- libc/hurd/lookup-retry.c.jj 2003-01-13 04:45:30.000000000 +0100
+++ libc/hurd/lookup-retry.c 2005-08-18 13:37:50.000000000 +0200
@@ -135,7 +135,7 @@ __hurd_file_name_lookup_retry (error_t (
refusing symlinks while accepting mount points.
Note that we actually permit something Linux doesn't:
we follow root-owned symlinks; if that is deemed
- undesireable, we can add a final check for that
+ undesirable, we can add a final check for that
one exception to our general translator-based rule. */
struct stat64 st;
err = __io_stat (*result, &st);
--- libc/grp/initgroups.c.jj 2005-04-13 21:28:22.000000000 +0200
+++ libc/grp/initgroups.c 2005-08-18 13:37:50.000000000 +0200
@@ -197,7 +197,7 @@ initgroups (const char *user, gid_t grou
long int limit = __sysconf (_SC_NGROUPS_MAX);
if (limit > 0)
- /* We limit the size of the intially allocated array. */
+ /* We limit the size of the initially allocated array. */
size = MIN (limit, 64);
else
/* No fixed limit on groups. Pick a starting buffer size. */
--- libc/iconv/gconv_int.h.jj 2005-04-13 21:28:22.000000000 +0200
+++ libc/iconv/gconv_int.h 2005-08-18 13:37:50.000000000 +0200
@@ -50,7 +50,7 @@ struct gconv_alias
};
-/* How many character should be conveted in one call? */
+/* How many character should be converted in one call? */
#define GCONV_NCHAR_GOAL 8160
@@ -164,7 +164,7 @@ __libc_lock_define (extern, __gconv_lock
})
-/* Return in *HANDLE decriptor for transformation from FROMSET to TOSET. */
+/* Return in *HANDLE descriptor for transformation from FROMSET to TOSET. */
extern int __gconv_open (const char *toset, const char *fromset,
__gconv_t *handle, int flags)
internal_function;
--- libc/iconv/gconv.h.jj 2003-11-12 09:50:52.000000000 +0100
+++ libc/iconv/gconv.h 2005-08-18 13:37:50.000000000 +0200
@@ -79,7 +79,7 @@ typedef int (*__gconv_init_fct) (struct
typedef void (*__gconv_end_fct) (struct __gconv_step *);
-/* Type of a transliteration/transscription function. */
+/* Type of a transliteration/transcription function. */
typedef int (*__gconv_trans_fct) (struct __gconv_step *,
struct __gconv_step_data *, void *,
__const unsigned char *,
@@ -102,7 +102,7 @@ typedef void (*__gconv_trans_end_fct) (v
struct __gconv_trans_data
{
- /* Transliteration/Transscription function. */
+ /* Transliteration/Transcription function. */
__gconv_trans_fct __trans_fct;
__gconv_trans_context_fct __trans_context_fct;
__gconv_trans_end_fct __trans_end_fct;
--- libc/iconv/iconv_prog.c.jj 2005-02-08 17:17:04.000000000 +0100
+++ libc/iconv/iconv_prog.c 2005-08-18 14:01:52.000000000 +0200
@@ -99,7 +99,7 @@ static const char *to_code = "";
/* File to write output to. If NULL write to stdout. */
static const char *output_file;
-/* Nonzero if verbose ouput is wanted. */
+/* Nonzero if verbose output is wanted. */
int verbose;
/* Nonzero if list of all coded character sets is wanted. */
@@ -175,7 +175,7 @@ main (int argc, char *argv[])
to_code = newp;
}
- /* POSIX 1003.2b introduces a silly thing: the arguments to -t anf -f
+ /* POSIX 1003.2b introduces a silly thing: the arguments to -t and -f
can be file names of charmaps. In this case iconv will have to read
those charmaps and use them to do the conversion. But there are
holes in the specification. There is nothing said that if -f is a
@@ -546,7 +546,7 @@ incomplete character or shift sequence a
static int
process_fd (iconv_t cd, int fd, FILE *output)
{
- /* we have a problem with reading from a desriptor since we must not
+ /* we have a problem with reading from a descriptor since we must not
provide the iconv() function an incomplete character or shift
sequence at the end of the buffer. Since we have to deal with
arbitrary encodings we must read the whole text in a buffer and
--- libc/iconv/gconv_trans.c.jj 2003-11-12 09:50:52.000000000 +0100
+++ libc/iconv/gconv_trans.c 2005-08-18 13:59:35.000000000 +0200
@@ -75,8 +75,8 @@ __gconv_transliterate (struct __gconv_st
return (winbuf == winbufend
? __GCONV_EMPTY_INPUT : __GCONV_INCOMPLETE_INPUT);
- /* The array starting at FROM_IDX contains indeces to the string table
- in FROM_TBL. The indeces are sorted wrt to the strings. I.e., we
+ /* The array starting at FROM_IDX contains indices to the string table
+ in FROM_TBL. The indices are sorted wrt to the strings. I.e., we
are doing binary search. */
low = 0;
high = size;
--- libc/iconv/iconvconfig.c.jj 2005-03-08 13:05:15.000000000 +0100
+++ libc/iconv/iconvconfig.c 2005-08-18 13:37:50.000000000 +0200
@@ -444,7 +444,7 @@ static void
add_alias (char *rp)
{
/* We now expect two more string. The strings are normalized
- (converted to UPPER case) and strored in the alias database. */
+ (converted to UPPER case) and stored in the alias database. */
char *from;
char *to;
char *wp;
--- libc/iconv/loop.c.jj 2003-11-12 09:50:52.000000000 +0100
+++ libc/iconv/loop.c 2005-08-18 13:37:50.000000000 +0200
@@ -39,7 +39,7 @@
BODY this is supposed to expand to the body of the loop.
The user must provide this.
- EXTRA_LOOP_DECLS extra arguments passed from converion loop call.
+ EXTRA_LOOP_DECLS extra arguments passed from conversion loop call.
INIT_PARAMS code to define and initialize variables from params.
UPDATE_PARAMS code to store result in params.
@@ -211,7 +211,7 @@
\
if (irreversible == NULL) \
/* This means we are in call from __gconv_transliterate. In this \
- case we are not doing any error recovery outself. */ \
+ case we are not doing any error recovery ourself. */ \
break; \
\
/* First try the transliteration methods. */ \
--- libc/iconv/iconv_prog.h.jj 2003-11-12 09:50:52.000000000 +0100
+++ libc/iconv/iconv_prog.h 2005-08-18 14:00:18.000000000 +0200
@@ -24,7 +24,7 @@
#include <charmap.h>
-/* Nonzero if verbose ouput is wanted. */
+/* Nonzero if verbose output is wanted. */
extern int verbose;
/* If nonzero omit invalid character from output. */
--- libc/iconv/gconv_conf.c.jj 2003-11-12 09:50:52.000000000 +0100
+++ libc/iconv/gconv_conf.c 2005-08-18 13:37:50.000000000 +0200
@@ -129,7 +129,7 @@ static void
add_alias (char *rp, void *modules)
{
/* We now expect two more string. The strings are normalized
- (converted to UPPER case) and strored in the alias database. */
+ (converted to UPPER case) and stored in the alias database. */
struct gconv_alias *new_alias;
char *from, *to, *wp;
--- libc/iconv/strtab.c.jj 2005-01-26 18:22:17.000000000 +0100
+++ libc/iconv/strtab.c 2005-08-18 14:01:04.000000000 +0200
@@ -181,7 +181,7 @@ newstring (struct Strtab *st, const char
/* 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)
Jakub
Attachment:
libcspell.tar.bz2
Description: BZip2 compressed data
| Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
|---|---|---|
| Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |